/*
- * Copyright (C) 1995-2011 University of Karlsruhe. All right reserved.
- *
* This file is part of libFirm.
- *
- * This file may be distributed and/or modified under the terms of the
- * GNU General Public License version 2 as published by the Free Software
- * Foundation and appearing in the file LICENSE.GPL included in the
- * packaging of this file.
- *
- * Licensees holding valid libFirm Professional Edition licenses may use
- * this file in accordance with the libFirm Commercial License.
- * Agreement provided with the Software.
- *
- * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
- * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
- * PURPOSE.
+ * Copyright (C) 2012 University of Karlsruhe.
*/
/**
cmp = cnt_cmp(&(*e2)->count, &(*e1)->count);
return cmp;
-} /* pattern_count_cmp */
+}
/**
* Compare two pattern for its pattern hash.
return memcmp(e1->buf, e2->buf, e1->len);
return e1->len < e2->len ? -1 : +1;
-} /* pattern_cmp */
+}
/**
* Initialize a code buffer.
buf->end = data + len;
buf->hash = 0x2BAD4; /* An arbitrary seed. */
buf->overrun = 0;
-} /* init_buf */
+}
/**
* Put a byte into the buffer.
} else {
buf->overrun = 1;
}
-} /* put_byte */
+}
/**
* Returns the current length of a buffer.
static size_t buf_lenght(const CODE_BUFFER *buf)
{
return buf->next - buf->start;
-} /* buf_lenght */
+}
/**
* Returns the current content of a buffer.
static const BYTE *buf_content(const CODE_BUFFER *buf)
{
return buf->start;
-} /* buf_content */
+}
/**
* Returns the hash value of a buffer.
static unsigned buf_hash(const CODE_BUFFER *buf)
{
return buf->hash;
-} /* buf_hash */
+}
/**
* Returns non-zero if a buffer overrun has occurred.
static unsigned buf_overrun(const CODE_BUFFER *buf)
{
return buf->overrun;
-} /* buf_overrun */
+}
/**
* Returns the next byte from the buffer WITHOUT dropping.
if (buf->next < buf->end)
return *buf->next;
return VLC_TAG_END;
-} /* look_byte */
+}
/**
* Returns the next byte from the buffer WITH dropping.
if (buf->next < buf->end)
return *buf->next++;
return VLC_TAG_END;
-} /* get_byte */
+}
#define BITS(n) (1 << (n))
put_byte(buf, code >> 16);
put_byte(buf, code >> 8);
put_byte(buf, code);
- } /* if */
-} /* put_code */
+ }
+}
#define BIT_MASK(n) ((1 << (n)) - 1)
code = ((code & BIT_MASK(5)) << 16) | (get_byte(buf) << 8);
code |= get_byte(buf);
return code;
- } /* if */
+ }
if (code < VLC_32BIT) {
code = ((code & BIT_MASK(4)) << 24) | (get_byte(buf) << 16);
code |= get_byte(buf) << 8;
code |= get_byte(buf);
return code;
- } /* if */
+ }
if (code == VLC_32BIT) {
code = get_byte(buf) << 24;
code |= get_byte(buf) << 16;
code |= get_byte(buf) << 8;
code |= get_byte(buf);
return code;
- } /* if */
+ }
/* should not happen */
panic("Wrong code in buffer");
-} /* get_code */
+}
/**
* Put a tag into the buffer.
assert(tag >= VLC_TAG_FIRST && "invalid tag");
put_byte(buf, tag);
-} /* put_tag */
+}
/**
* Returns the next tag or zero if the next code isn't a tag.
if (b >= VLC_TAG_FIRST)
return get_byte(buf);
return 0;
-} /* next_tag */
+}
/**
* An Environment for the pattern encoder.
(void) size;
return e1->addr != e2->addr;
-} /* addr_cmp */
+}
/**
* Return the index of a (existing) mode.
} else {
/* a new entry, proceed */
++env->curr_id;
- } /* if */
+ }
put_code(env->buf, (unsigned)code);
put_code(env->buf, find_mode_index(mode));
else
put_tag(env->buf, VLC_TAG_EMPTY);
- } /* if */
+ }
/* do we need integer constants */
if (env->options & OPT_WITH_ICONST) {
put_tag(env->buf, VLC_TAG_ICONST);
put_code(env->buf, v);
- } /* if */
- } /* if */
- } /* if */
+ }
+ }
+ }
--max_depth;
if (max_depth <= 0) {
put_code(env->buf, 0);
return max_depth;
- } /* if */
+ }
preds = get_irn_arity(node);
put_code(env->buf, preds);
} else if (opcode_diff == 0 && l != r) {
/* Both nodes have the same opcode, but are different.
Need a better method here to decide which goes to the left side. */
- } /* if */
+ }
/* special handling for commutative operators */
depth = _encode_node(l, max_depth, env);
depth = _encode_node(n, max_depth, env);
if (depth < res)
res = depth;
- } /* for */
- } /* if */
+ }
+ }
return res;
-} /* _encode_node */
+}
/**
* Encode a DAG starting by the IR-node node.
if (env.options) {
put_tag(buf, VLC_TAG_OPTION);
put_code(buf, env.options);
- } /* if */
+ }
res = _encode_node(node, max_depth, &env);
del_set(env.id_set);
return max_depth - res;
-} /* encode_node */
+}
/**
* Decode an IR-node, recursive walker.
* we don't know the target here, it's a ref.
*/
pattern_dump_edge(env->dmp, code, parent, position, edge_mode);
- } /* if */
+ }
/* dump the node ref */
pattern_dump_ref(env->dmp, code);
return;
- } /* if */
+ }
/* get the opcode */
op_code = get_code(env->buf);
if (env->options & OPT_WITH_MODE) {
if (next_tag(env->buf) != VLC_TAG_EMPTY) {
mode_code = get_code(env->buf);
- } /* if */
- } /* if */
+ }
+ }
/* check, if a ICONST attribute is given */
if (next_tag(env->buf) == VLC_TAG_ICONST) {
iconst = get_code(env->buf);
attr = &iconst;
- } /* if */
+ }
/* dump the edge */
if (parent) {
* we need it anyway for ref's.
*/
pattern_dump_edge(env->dmp, env->curr_id, parent, position, edge_mode);
- } /* if */
+ }
/* dump the node */
parent = env->curr_id;
pattern_start_children(env->dmp, parent);
for (i = 0; i < preds; ++i) {
_decode_node(parent, i, env);
- } /* for */
+ }
pattern_finish_children(env->dmp, parent);
- } /* if */
- } /* if */
-} /* _decode_node */
+ }
+ }
+}
/**
* Decode an IR-node.
code = next_tag(&buf);
if (code == VLC_TAG_OPTION) {
options = get_code(&buf);
- } /* if */
+ }
env.options = options;
_decode_node(0, 0, &env);
-} /* decode_node */
+}
/**
* The environment for the pattern calculation.
if (elem != NULL) {
obstack_free(&status->obst, key);
return elem;
- } /* if */
+ }
cnt_clr(&key->count);
return (pattern_entry_t*)pset_insert(set, key, hash);
-} /* pattern_get_entry */
+}
/**
* Increase the count for a pattern.
/* increase count */
cnt_inc(&entry->count);
- } /* if */
-} /* count_pattern */
+ }
+}
/**
* Pre-walker for nodes pattern calculation.
lc_fprintf(stderr, "Pattern store: buffer overrun at size %zu. Pattern ignored.\n", sizeof(buffer));
} else
count_pattern(&buf, depth);
-} /* calc_nodes_pattern */
+}
/**
* Store all collected patterns.
static void store_pattern(const char *fname)
{
FILE *f;
- pattern_entry_t *entry;
size_t count = pset_count(status->pattern_hash);
if (count <= 0)
if (! f) {
perror(fname);
return;
- } /* if */
+ }
fwrite("FPS1", 4, 1, f);
fwrite(&count, sizeof(count), 1, f);
- foreach_pset(status->pattern_hash, pattern_entry_t*, entry) {
+ foreach_pset(status->pattern_hash, pattern_entry_t, entry) {
fwrite(entry, offsetof(pattern_entry_t, buf) + entry->len, 1, f);
- } /* for */
+ }
fclose(f);
-} /* store_pattern */
+}
/**
* Read collected patterns from a file.
if (! f) {
perror(fname);
return NULL;
- } /* if */
+ }
res = fread(magic, 4, 1, f);
if (res != 1)
put_byte(&buf, fgetc(f));
entry = pattern_get_entry(&buf, pattern_hash);
entry->count = tmp.count;
- } /* for */
+ }
fclose(f);
lc_printf("Read %zu pattern from %s\n", count, fname);
fprintf(stderr, "Error: %s is not a Firm pattern store. Ignored.\n", fname);
fclose(f);
return NULL;
-} /* read_pattern */
+}
/**
* Write the collected patterns to a VCG file for inspection.
*/
static void pattern_output(const char *fname)
{
- pattern_entry_t *entry;
pattern_entry_t **pattern_arr;
pattern_dumper_t *dump;
size_t i, count = pset_count(status->pattern_hash);
pattern_arr = XMALLOCN(pattern_entry_t*, count);
i = 0;
- foreach_pset(status->pattern_hash, pattern_entry_t*, entry) {
+ foreach_pset(status->pattern_hash, pattern_entry_t, entry) {
pattern_arr[i++] = entry;
- } /* for */
+ }
assert(count == i);
count = i;
qsort(pattern_arr, count, sizeof(*pattern_arr), pattern_count_cmp);
for (i = 0; i < count; ++i) {
- entry = pattern_arr[i];
+ pattern_entry_t *const entry = pattern_arr[i];
if (cnt_to_uint(&entry->count) < status->bound)
continue;
pattern_dump_new_pattern(dump, &entry->count);
decode_node(entry->buf, entry->len, dump);
pattern_dump_finish_pattern(dump);
- } /* for */
+ }
/* destroy it */
pattern_end(dump);
-} /* pattern_output */
+}
/*
* Calculates the pattern history.
for (i = status->min_depth; i <= status->max_depth; ++i) {
env.max_depth = i;
irg_walk_graph(irg, calc_nodes_pattern, NULL, &env);
- } /* for */
-} /* stat_calc_pattern_history */
+ }
+}
/*
* Initializes the pattern history.
if (pattern_hash == NULL)
pattern_hash = new_pset(pattern_cmp, 8);
status->pattern_hash = pattern_hash;
-} /* stat_init_pattern_history */
+}
/*
* Finish the pattern history.
obstack_free(&status->obst, NULL);
status->enable = 0;
-} /* stat_finish_pattern_history */
+}
projects / libfirm / blobdiff