/*
- * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
+ * Copyright (C) 1995-2011 University of Karlsruhe. All right reserved.
*
* This file is part of libFirm.
*
#include "pattern_dmp.h"
#include "hashptr.h"
#include "error.h"
-
-#ifdef FIRM_STATISTICS
+#include "lc_printf.h"
/*
* just be make some things clear :-), the
*/
typedef struct pattern_entry_t {
counter_t count; /**< Amount of pattern occurance. */
- unsigned len; /**< The length of the VLC encoded buffer. */
+ size_t len; /**< The length of the VLC encoded buffer. */
BYTE buf[1]; /**< The buffer containing the VLC encoded pattern. */
} pattern_entry_t;
{
const pattern_entry_t *e1 = (const pattern_entry_t*)elt;
const pattern_entry_t *e2 = (const pattern_entry_t*)key;
- int diff = e1->len - e2->len;
- if (diff)
- return diff;
+ if (e1->len == e2->len)
+ return memcmp(e1->buf, e2->buf, e1->len);
- return memcmp(e1->buf, e2->buf, e1->len);
+ return e1->len < e2->len ? -1 : +1;
} /* pattern_cmp */
/**
* @param data a buffer address
* @param len the length of the data buffer
*/
-static void init_buf(CODE_BUFFER *buf, BYTE *data, unsigned len)
+static void init_buf(CODE_BUFFER *buf, BYTE *data, size_t len)
{
buf->start =
buf->next = data;
*
* @return the length of the buffer content
*/
-static unsigned buf_lenght(const CODE_BUFFER *buf)
+static size_t buf_lenght(const CODE_BUFFER *buf)
{
return buf->next - buf->start;
} /* buf_lenght */
return e1->addr != e2->addr;
} /* addr_cmp */
-static unsigned find_mode_index(const ir_mode *mode)
+/**
+ * Return the index of a (existing) mode.
+ */
+static size_t find_mode_index(const ir_mode *mode)
{
- int n = get_irp_n_modes();
- int i;
+ size_t i, n = get_irp_n_modes();
for (i = 0; i < n; ++i) {
if (get_irp_mode(i) == mode)
return i;
}
- return -1;
+ /* should really not happen */
+ assert(!"Cound not find index of mode in find_mode_index()");
+ return (size_t)-1;
}
/**
/**
* Decode an IR-node.
*/
-static void decode_node(BYTE *b, unsigned len, pattern_dumper_t *dump)
+static void decode_node(BYTE *b, size_t len, pattern_dumper_t *dump)
{
codec_env_t env;
CODE_BUFFER buf;
static pattern_entry_t *pattern_get_entry(CODE_BUFFER *buf, pset *set)
{
pattern_entry_t *key, *elem;
- unsigned len = buf_lenght(buf);
+ size_t len = buf_lenght(buf);
unsigned hash;
key = OALLOCF(&status->obst, pattern_entry_t, buf, len);
depth = encode_node(node, &buf, env->max_depth);
if (buf_overrun(&buf)) {
- fprintf(stderr, "Pattern store: buffer overrun at size %u. Pattern ignored.\n", (unsigned) sizeof(buffer));
+ lc_fprintf(stderr, "Pattern store: buffer overrun at size %zu. Pattern ignored.\n", sizeof(buffer));
} else
count_pattern(&buf, depth);
} /* calc_nodes_pattern */
{
FILE *f;
pattern_entry_t *entry;
- int i, count = pset_count(status->pattern_hash);
+ size_t i, count = pset_count(status->pattern_hash);
if (count <= 0)
return;
{
FILE *f;
pattern_entry_t *entry, tmp;
- int i, count;
+ size_t i, count;
unsigned j;
char magic[4];
HASH_MAP(pattern_entry_t) *pattern_hash = new_pset(pattern_cmp, 8);
for (j = 0; j < tmp.len; ++j)
put_byte(&buf, fgetc(f));
entry = pattern_get_entry(&buf, pattern_hash);
- memcpy(&entry->count, &tmp.count, sizeof(entry->count));
+ entry->count = tmp.count;
} /* for */
fclose(f);
- printf("Read %d pattern from %s\n", count, fname);
+ lc_printf("Read %zu pattern from %s\n", count, fname);
assert(pset_count(pattern_hash) == count);
return pattern_hash;
pattern_entry_t *entry;
pattern_entry_t **pattern_arr;
pattern_dumper_t *dump;
- int i, count = pset_count(status->pattern_hash);
+ size_t i, count = pset_count(status->pattern_hash);
- printf("\n%d pattern detected\n", count);
+ lc_printf("\n%zu pattern detected\n", count);
- if (count <= 0)
+ if (count == 0)
return;
/* creates a dumper */
status->enable = 0;
} /* stat_finish_pattern_history */
-
-#endif /* FIRM_STATISTICS */