# include "config.h"
#endif
-# include <string.h>
-
-# include "irop_t.h"
-# include "irnode_t.h"
-# include "irgraph_t.h"
-# include "pset.h"
-# include "irprog.h"
-# include "irgwalk.h"
+#ifdef FIRM_STATISTICS
#include <stdio.h>
#include <stdlib.h>
+#include <string.h>
-#undef obstack_chunk_alloc
-#undef obstack_chunk_free
-#define obstack_chunk_alloc malloc
-#define obstack_chunk_free free
-#include <obstack.h>
-
-#ifdef FIRM_STATISTICS
-
-#include "firmstat.h"
-
-/*
- * just be make some things clear :-), the
- * poor man "generics"
- */
-#define HASH_MAP(type) pset_##type
-
-typedef pset pset_node_entry_t;
-typedef pset pset_graph_entry_t;
-typedef pset pset_opt_entry_t;
-
-/*
- * 32 bit should be enough for now
- */
-#define STAT_CNT_NUM 1
-
-typedef struct _counter_t {
- unsigned cnt[STAT_CNT_NUM];
-} counter_t;
-
-/*
- * An entry for ir_nodes
- */
-typedef struct _node_entry_t {
- counter_t cnt_alive; /**< amount of nodes in this entry */
- counter_t new_node; /**< amount of new nodes for this entry */
- counter_t into_Id; /**< amount of nodes that turned into Id's for this entry */
- const ir_op *op; /**< the op for this entry */
-} node_entry_t;
-
-/*
- * An entry for ir_graphs
- */
-typedef struct _graph_entry_t {
- HASH_MAP(node_entry_t) *opcode_hash; /**< hash map containing the opcode counter */
- counter_t cnt_walked; /**< walker walked over the graph */
- counter_t cnt_walked_blocks; /**< walker walked over the graph blocks */
- counter_t cnt_was_inlined; /**< number of times other graph were inlined */
- counter_t cnt_got_inlined; /**< number of times this graph was inlined */
- counter_t cnt_edges; /**< number of DF edges in this graph */
- HASH_MAP(opt_entry_t) *opt_hash[STAT_OPT_MAX]; /**< hash maps containing opcode counter for optimizations */
- ir_graph *irg; /**< the graph of this object */
- entity *ent; /**< the entity of this graph if one exists */
- int deleted; /**< set if this irg was deleted */
-} graph_entry_t;
-
-/**
- * An entry for optimized ir_nodes
- */
-typedef struct _opt_entry_t {
- counter_t count; /**< optimization counter */
- const ir_op *op; /**< the op for this entry */
-} opt_entry_t;
-
-/** forward */
-typedef struct _dumper_t dumper_t;
-
-/**
- * handler for dumping an IRG
- *
- * @param dmp the dumper
- * @param entry the IR-graph hash map entry
- */
-typedef void (*dump_graph_FUNC)(dumper_t *dmp, graph_entry_t *entry);
-
-/**
- * handler for dumper init
- *
- * @param dmp the dumper
- * @param name name of the file to dump to
- */
-typedef void (*dump_init_FUNC)(dumper_t *dmp, const char *name);
-
-/**
- * handler for dumper finish
- *
- * @param dmp the dumper
- */
-typedef void (*dump_finish_FUNC)(dumper_t *dmp);
-
-
-/**
- * a dumper description
- */
-struct _dumper_t {
- dump_graph_FUNC dump_graph; /**< handler for dumping an irg */
- dump_init_FUNC init; /**< handler for init */
- dump_finish_FUNC finish; /**< handler for finish */
- FILE *f; /**< the file to dump to */
- dumper_t *next; /**< link to the next dumper */
-};
-
-/**
- * statistics info
- */
-typedef struct _statistic_info_t {
- struct obstack cnts; /**< obstack containing the counters */
- HASH_MAP(graph_entry_t) *irg_hash; /**< hash map containing the counter for irgs */
- int recursive; /**< flag for detecting recursive hook calls */
- int in_dead_node_elim; /**< set, if dead node elimination runs */
- ir_op *op_Phi0; /**< needed pseudo op */
- ir_op *op_PhiM; /**< needed pseudo op */
- dumper_t *dumper; /**< list of dumper */
-} stat_info_t;
+#include "firmstat_t.h"
+#include "pattern.h"
+#include "dags.h"
/**
* names of the optimizations
"Phi optmization",
"Write-After-Write optimization",
"Write-After-Read optimization",
+ "Read-After-Write optimization",
"Tuple optimization",
"ID optimization",
"Constant evaluation",
#define STAT_LEAVE --status->recursive
#define STAT_ENTER_SINGLE do { if (status->recursive > 0) return; ++status->recursive; } while (0)
-/*
+/**
* global status
*/
static stat_info_t _status, *status = &_status;
/**
- * increase a counter
+ * compare two elements of the opcode hash
*/
-static INLINE void cnt_inc(counter_t *cnt)
+static int opcode_cmp(const void *elt, const void *key)
{
- int i;
+ const node_entry_t *e1 = elt;
+ const node_entry_t *e2 = key;
- for (i = 0; i < STAT_CNT_NUM; ++i) {
- if (++cnt->cnt[i])
- break;
- }
+ return e1->op->code - e2->op->code;
}
/**
- * decreace a counter
+ * compare two elements of the graph hash
*/
-static INLINE void cnt_dec(counter_t *cnt)
+static int graph_cmp(const void *elt, const void *key)
{
- int i;
-
- for (i = 0; i < STAT_CNT_NUM; ++i) {
- if (--cnt->cnt[i] != -1)
- break;
- }
-}
+ const graph_entry_t *e1 = elt;
+ const graph_entry_t *e2 = key;
-/**
- * set a counter to zero
- */
-static INLINE void cnt_clr(counter_t *cnt)
-{
- memset(cnt->cnt, 0, sizeof(cnt->cnt));
+ return e1->irg != e2->irg;
}
/**
- * add a counter to another
+ * compare two elements of the optimization hash
*/
-static inline void cnt_add(counter_t *dst, const counter_t *src)
+static int opt_cmp(const void *elt, const void *key)
{
- int i, carry = 0;
-
- for (i = 0; i < STAT_CNT_NUM; ++i) {
- unsigned a = dst->cnt[i] + src->cnt[i] + carry;
-
- if (carry)
- carry = a <= dst->cnt[i];
- else
- carry = a < dst->cnt[i];
-
- dst->cnt[i] = a;
+ const opt_entry_t *e1 = elt;
+ const opt_entry_t *e2 = key;
- if (! carry)
- break;
- }
+ return e1->op->code != e2->op->code;
}
/**
- * add an integer to an counter
+ * compare two elements of the block hash
*/
-static inline void cnt_add_i(counter_t *dst, int src)
+static int block_cmp(const void *elt, const void *key)
{
- int i;
- unsigned a = dst->cnt[0] + src;
- unsigned carry = a < dst->cnt[i];
-
- dst->cnt[0] = a;
- if (! carry)
- return;
-
- for (i = 1; i < STAT_CNT_NUM; ++i) {
- unsigned a = dst->cnt[i] + carry;
-
- carry = a < dst->cnt[i];
+ const block_entry_t *e1 = elt;
+ const block_entry_t *e2 = key;
- dst->cnt[i] = a;
-
- if (! carry)
- break;
- }
+ return e1->block_nr != e2->block_nr;
}
-/*
- * compare two elements of the opcode hash
+/**
+ * compare two elements of the ir_op hash
*/
-static int opcode_cmp(const void *elt, const void *key)
+static int opcode_cmp_2(const void *elt, const void *key)
{
- const node_entry_t *e1 = elt;
- const node_entry_t *e2 = key;
+ const ir_op *e1 = elt;
+ const ir_op *e2 = key;
- return e1->op->code - e2->op->code;
+ return e1->code != e2->code;
}
-/*
- * compare two elements of the graph hash
- */
-static int graph_cmp(const void *elt, const void *key)
-{
- const graph_entry_t *e1 = elt;
- const graph_entry_t *e2 = key;
-
- return e1->irg != e2->irg;
-}
-
-/*
- * compare two elements of the optimization hash
+/**
+ * clears all counter in a node_entry_t
*/
-static int opt_cmp(const void *elt, const void *key)
+static void opcode_clear_entry(node_entry_t *elem)
{
- const opt_entry_t *e1 = elt;
- const opt_entry_t *e2 = key;
-
- return e1->op->code != e2->op->code;
+ cnt_clr(&elem->cnt_alive);
+ cnt_clr(&elem->new_node);
+ cnt_clr(&elem->into_Id);
}
/**
elem = obstack_alloc(&status->cnts, sizeof(*elem));
/* clear counter */
- cnt_clr(&elem->cnt_alive);
- cnt_clr(&elem->new_node);
- cnt_clr(&elem->into_Id);
+ opcode_clear_entry(elem);
elem->op = op;
return pset_insert(set, elem, op->code);
}
+/**
+ * Returns the associates ir_op for an opcode
+ */
+static ir_op *opcode_find_entry(opcode code, pset *set)
+{
+ ir_op key;
+
+ key.code = code;
+ return pset_find(set, &key, code);
+}
+
/**
* calculates a hash value for an irg
* Addresses are typically aligned at 32bit, so we ignore the lowest bits
return (unsigned)irg >> 3;
}
+/**
+ * clears all counter in a graph_entry_t
+ */
+static void graph_clear_entry(graph_entry_t *elem)
+{
+ cnt_clr(&elem->cnt_walked);
+ cnt_clr(&elem->cnt_walked_blocks);
+ cnt_clr(&elem->cnt_got_inlined);
+ cnt_clr(&elem->cnt_was_inlined);
+ cnt_clr(&elem->cnt_edges);
+}
+
/**
* Returns the acssociates graph_entry_t for an irg
*/
elem = obstack_alloc(&status->cnts, sizeof(*elem));
- cnt_clr(&elem->cnt_walked);
- cnt_clr(&elem->cnt_walked_blocks);
- cnt_clr(&elem->cnt_got_inlined);
- cnt_clr(&elem->cnt_was_inlined);
- cnt_clr(&elem->cnt_edges);
+ /* clear counter */
+ graph_clear_entry(elem);
/* new hash table for opcodes here */
elem->opcode_hash = new_pset(opcode_cmp, 5);
+ elem->block_hash = new_pset(block_cmp, 5);
elem->irg = irg;
for (i = 0; i < sizeof(elem->opt_hash)/sizeof(elem->opt_hash[0]); ++i)
return pset_insert(set, elem, irg_hash(irg));
}
+/**
+ * clears all counter in an opt_entry_t
+ */
+static void opt_clear_entry(opt_entry_t *elem)
+{
+ cnt_clr(&elem->count);
+}
+
/**
* Returns the associates opt_entry_t for an ir_op
*/
elem = obstack_alloc(&status->cnts, sizeof(*elem));
/* clear new counter */
- cnt_clr(&elem->count);
+ opt_clear_entry(elem);
elem->op = op;
return pset_insert(set, elem, op->code);
}
+/**
+ * clears all counter in a block_entry_t
+ */
+static void block_clear_entry(block_entry_t *elem)
+{
+ cnt_clr(&elem->cnt_nodes);
+ cnt_clr(&elem->cnt_edges);
+ cnt_clr(&elem->cnt_in_edges);
+ cnt_clr(&elem->cnt_out_edges);
+}
+
+/**
+ * Returns the associates block_entry_t for an block
+ */
+static block_entry_t *block_get_entry(long block_nr, pset *set)
+{
+ block_entry_t key;
+ block_entry_t *elem;
+
+ key.block_nr = block_nr;
+
+ elem = pset_find(set, &key, block_nr);
+ if (elem)
+ return elem;
+
+ elem = obstack_alloc(&status->cnts, sizeof(*elem));
+
+ /* clear new counter */
+ block_clear_entry(elem);
+
+ elem->block_nr = block_nr;
+
+ return pset_insert(set, elem, block_nr);
+}
+
+
/**
* Returns the ir_op for an IR-node,
* handles special cases and return pseudo op codes
*/
static ir_op *stat_get_irn_op(const ir_node *node)
{
- ir_op *op = intern_get_irn_op(node);
+ ir_op *op = get_irn_op(node);
- if (op->code == iro_Phi && intern_get_irn_arity(node) == 0) {
+ if (op->code == iro_Phi && get_irn_arity(node) == 0) {
/* special case, a Phi0 node, count on extra counter */
op = status->op_Phi0;
}
- else if (op->code == iro_Phi && intern_get_irn_mode(node) == mode_M) {
+ else if (op->code == iro_Phi && get_irn_mode(node) == mode_M) {
/* special case, a Memory Phi node, count on extra counter */
op = status->op_PhiM;
}
return op;
}
-
/**
- * environment for the count walker
+ * update the block counter
*/
-typedef struct _cnt_env_t {
- pset *set; /**< the hash map containing the ir_ops */
- counter_t *cnt_edges; /**< the edges counter */
-} cnt_env_t;
+static void count_block_info(ir_node *node, graph_entry_t *graph)
+{
+ ir_op *op = get_irn_op(node);
+ ir_node *block;
+ block_entry_t *b_entry;
+ int i, arity;
+
+ /* check for block */
+ if (op == op_Block) {
+ arity = get_irn_arity(node);
+ b_entry = block_get_entry(get_irn_node_nr(node), graph->block_hash);
+
+ /* count all incoming edges */
+ for (i = 0; i < arity; ++i) {
+ ir_node *pred = get_irn_n(node, i);
+ ir_node *other_block = get_nodes_block(pred);
+ block_entry_t *b_entry_other = block_get_entry(get_irn_node_nr(other_block), graph->block_hash);
+
+ cnt_inc(&b_entry->cnt_in_edges); /* an edge coming from another block */
+ cnt_inc(&b_entry_other->cnt_out_edges);
+ }
+ return;
+ }
+ else if (op == op_Call) {
+ // return;
+ }
+
+ block = get_nodes_block(node);
+ b_entry = block_get_entry(get_irn_node_nr(block), graph->block_hash);
+
+ /* we have a new nodes */
+ cnt_inc(&b_entry->cnt_nodes);
+
+ arity = get_irn_arity(node);
+
+ for (i = 0; i < arity; ++i) {
+ ir_node *pred = get_irn_n(node, i);
+ ir_node *other_block;
+
+ if (get_irn_op(pred) == op_Block)
+ continue;
+
+ other_block = get_nodes_block(pred);
+
+ if (other_block == block)
+ cnt_inc(&b_entry->cnt_edges); /* a in block edge */
+ else {
+ block_entry_t *b_entry_other = block_get_entry(get_irn_node_nr(other_block), graph->block_hash);
+
+ cnt_inc(&b_entry->cnt_in_edges); /* an edge coming from another block */
+ cnt_inc(&b_entry_other->cnt_out_edges);
+ }
+ }
+}
/**
* walker for reachable nodes count
*/
static void count_nodes(ir_node *node, void *env)
{
- cnt_env_t *cenv = env;
+ graph_entry_t *graph = env;
node_entry_t *entry;
+
ir_op *op = stat_get_irn_op(node);
- int arity = intern_get_irn_arity(node);
+ int arity = get_irn_arity(node);
- entry = opcode_get_entry(op, cenv->set);
+ entry = opcode_get_entry(op, graph->opcode_hash);
cnt_inc(&entry->cnt_alive);
- cnt_add_i(cenv->cnt_edges, arity);
+ cnt_add_i(&graph->cnt_edges, arity);
+
+ /* count block edges */
+ count_block_info(node, graph);
}
/**
- * count all alive nodes in a graph
+ * count all alive nodes and edges in a graph
*/
-static void count_nodes_in_graph(graph_entry_t * global, graph_entry_t * graph)
+static void count_nodes_in_graph(graph_entry_t *global, graph_entry_t *graph)
{
- cnt_env_t env;
node_entry_t *entry;
- env.set = graph->opcode_hash;
- env.cnt_edges = &graph->cnt_edges;
+ /* clear first the alive counter in the graph */
+ for (entry = pset_first(graph->opcode_hash); entry; entry = pset_next(graph->opcode_hash)) {
+ cnt_clr(&entry->cnt_alive);
+ }
- irg_walk_graph(graph->irg, count_nodes, NULL, &env);
+ /* count the nodes in the graph */
+ irg_walk_graph(graph->irg, count_nodes, NULL, graph);
/* assume we walk every graph only ONCE, we could sum here the global count */
for (entry = pset_first(graph->opcode_hash); entry; entry = pset_next(graph->opcode_hash)) {
/**
* register a dumper
*/
-static void stat_register_dumper(dumper_t *dumper, const char *name)
+static void stat_register_dumper(dumper_t *dumper)
{
dumper->next = status->dumper;
status->dumper = dumper;
-
- if (dumper->init)
- dumper->init(dumper, name);
}
/**
}
}
+/**
+ * initialise the dumper
+ */
+static void dump_init(const char *name)
+{
+ dumper_t *dumper;
+
+ for (dumper = status->dumper; dumper; dumper = dumper->next) {
+ if (dumper->init)
+ dumper->init(dumper, name);
+ }
+}
+
/**
* finish the dumper
*/
fprintf(dmp->f, "%-16s %-8s %-8s %-8s\n", "Opcode", "alive", "created", "->Id");
for (entry = pset_first(set); entry; entry = pset_next(set)) {
fprintf(dmp->f, "%-16s %8d %8d %8d\n",
- get_id_str(entry->op->name), entry->cnt_alive.cnt[0], entry->new_node.cnt[0], entry->into_Id.cnt[0]);
+ get_id_str(entry->op->name), entry->cnt_alive.cnt[0], entry->new_node.cnt[0], entry->into_Id.cnt[0]);
cnt_add(&f_alive, &entry->cnt_alive);
cnt_add(&f_new_node, &entry->new_node);
for (; entry; entry = pset_next(set)) {
fprintf(dmp->f, "%-16s %8d\n",
- get_id_str(entry->op->name), entry->count.cnt[0]);
+ get_id_str(entry->op->name), entry->count.cnt[0]);
}
}
}
static void simple_dump_graph(dumper_t *dmp, graph_entry_t *entry)
{
int dump_opts = 1;
+ block_entry_t *b_entry;
if (entry->irg) {
ir_graph *const_irg = get_const_code_irg();
}
else {
if (entry->ent)
- fprintf(dmp->f, "\nEntity %s, Irg %p", get_entity_name(entry->ent), (void *)entry->irg);
+ fprintf(dmp->f, "\nEntity %s, Irg %p", get_entity_name(entry->ent), (void *)entry->irg);
else
- fprintf(dmp->f, "\nIrg %p", (void *)entry->irg);
+ fprintf(dmp->f, "\nIrg %p", (void *)entry->irg);
}
fprintf(dmp->f, " %swalked %d over blocks %d was inlined %d got inlined %d:\n",
- entry->deleted ? "DELETED " : "",
- entry->cnt_walked.cnt[0], entry->cnt_walked_blocks.cnt[0],
- entry->cnt_was_inlined.cnt[0],
- entry->cnt_got_inlined.cnt[0]
+ entry->deleted ? "DELETED " : "",
+ entry->cnt_walked.cnt[0], entry->cnt_walked_blocks.cnt[0],
+ entry->cnt_was_inlined.cnt[0],
+ entry->cnt_got_inlined.cnt[0]
);
}
else {
fprintf(dmp->f, "\nGlobals counts:\n");
+ fprintf(dmp->f, "--------------\n");
dump_opts = 0;
}
for (i = 0; i < sizeof(entry->opt_hash)/sizeof(entry->opt_hash[0]); ++i) {
simple_dump_opt_hash(dmp, entry->opt_hash[i], i);
}
+
+ /* dump block info */
+ fprintf(dmp->f, "\n%12s %12s %12s %12s %12s %12s\n", "Block Nr", "Nodes", "intern E", "incoming E", "outgoing E", "quot");
+ for (b_entry = pset_first(entry->block_hash);
+ b_entry;
+ b_entry = pset_next(entry->block_hash)) {
+ fprintf(dmp->f, "BLK %12ld %12u %12u %12u %12u %4.8f\n",
+ b_entry->block_nr,
+ b_entry->cnt_nodes.cnt[0],
+ b_entry->cnt_edges.cnt[0],
+ b_entry->cnt_in_edges.cnt[0],
+ b_entry->cnt_out_edges.cnt[0],
+ (double)b_entry->cnt_edges.cnt[0] / (double)b_entry->cnt_nodes.cnt[0]
+ );
+ }
}
}
*/
static void simple_init(dumper_t *dmp, const char *name)
{
- dmp->f = fopen(name, "w");
+ char fname[2048];
+
+ snprintf(fname, sizeof(fname), "%s.txt", name);
+ dmp->f = fopen(fname, "w");
}
/**
}
else {
if (entry->ent)
- name = get_entity_name(entry->ent);
+ name = get_entity_name(entry->ent);
else
- name = "<UNKNOWN IRG>";
+ name = "<UNKNOWN IRG>";
}
csv_count_nodes(entry, cnt);
fprintf(dmp->f, "%-40s, %p, %d, %d, %d, %d\n",
- name,
- entry->irg,
- cnt[0].cnt[0],
- cnt[1].cnt[0],
- cnt[2].cnt[0],
- cnt[3].cnt[0]
+ name,
+ (void *)entry->irg,
+ cnt[0].cnt[0],
+ cnt[1].cnt[0],
+ cnt[2].cnt[0],
+ cnt[3].cnt[0]
);
}
}
*/
static void csv_init(dumper_t *dmp, const char *name)
{
- dmp->f = fopen(name, "a");
+ char fname[2048];
+
+ snprintf(fname, sizeof(fname), "%s.csv", name);
+ dmp->f = fopen(fname, "a");
}
/**
/* ---------------------------------------------------------------------- */
+/*
+ * helper: get an ir_op from an opcode
+ */
+ir_op *stat_get_op_from_opcode(opcode code)
+{
+ return opcode_find_entry(code, status->ir_op_hash);
+}
+
/* initialize the statistics module. */
-void stat_init(void)
+void init_stat(unsigned enable_options)
{
-#define X(a) a, sizeof(a)-1
+#define X(a) a, sizeof(a)-1
int pseudo_id = 0;
+ /* enable statistics */
+ status->enable = enable_options & FIRMSTAT_ENABLED;
+
+ if (! status->enable)
+ return;
+
obstack_init(&status->cnts);
/* build the pseudo-ops */
_op_Phi0.code = --pseudo_id;
- _op_Phi0.name = id_from_str(X("Phi0"));
+ _op_Phi0.name = new_id_from_chars(X("Phi0"));
_op_PhiM.code = --pseudo_id;
- _op_PhiM.name = id_from_str(X("PhiM"));
+ _op_PhiM.name = new_id_from_chars(X("PhiM"));
/* create the hash-tables */
status->irg_hash = new_pset(graph_cmp, 8);
+ status->ir_op_hash = new_pset(opcode_cmp_2, 1);
status->op_Phi0 = &_op_Phi0;
status->op_PhiM = &_op_PhiM;
- stat_register_dumper(&simple_dumper, "firmstat.txt");
- stat_register_dumper(&csv_dumper, "firmstat.csv");
+ stat_register_dumper(&simple_dumper);
+ stat_register_dumper(&csv_dumper);
+ /* initialize the pattern hash */
+ stat_init_pattern_history(enable_options & FIRMSTAT_PATTERN_ENABLED);
#undef X
}
/* A new IR op is registered. */
void stat_new_ir_op(const ir_op *op)
{
+ if (! status->enable)
+ return;
+
STAT_ENTER;
{
graph_entry_t *graph = graph_get_entry(NULL, status->irg_hash);
/* execute for side effect :-) */
opcode_get_entry(op, graph->opcode_hash);
+
+ pset_insert(status->ir_op_hash, op, op->code);
}
STAT_LEAVE;
}
/* An IR op is freed. */
void stat_free_ir_op(const ir_op *op)
{
+ if (! status->enable)
+ return;
+
STAT_ENTER;
{
}
/* A new node is created. */
void stat_new_node(const ir_node *node)
{
+ if (! status->enable)
+ return;
+
/* do NOT count during dead node elimination */
if (status->in_dead_node_elim > 0)
return;
/* A node is changed into a Id node */
void stat_turn_into_id(const ir_node *node)
{
+ if (! status->enable)
+ return;
+
STAT_ENTER;
{
node_entry_t *entry;
/* A new graph was created */
void stat_new_graph(ir_graph *irg, entity *ent)
{
+ if (! status->enable)
+ return;
+
STAT_ENTER;
{
/* execute for side effect :-) */
*/
void stat_free_graph(ir_graph *irg)
{
+ if (! status->enable)
+ return;
+
STAT_ENTER;
{
graph_entry_t *graph = graph_get_entry(irg, status->irg_hash);
/* count the nodes of the graph yet, it will be destroyed later */
count_nodes_in_graph(global, graph);
+
+ /* count the DAG's */
+ count_dags_in_graph(global, graph);
+
+ /* calculate the pattern */
+ stat_calc_pattern_history(irg);
}
STAT_LEAVE;
}
*/
void stat_irg_walk(ir_graph *irg, void *pre, void *post)
{
+ if (! status->enable)
+ return;
+
STAT_ENTER_SINGLE;
{
graph_entry_t *graph = graph_get_entry(irg, status->irg_hash);
STAT_LEAVE;
}
+/*
+ * A walk over a graph in block-wise order is initiated. Do not count walks from statistic code.
+ */
+void stat_irg_walk_blkwise(ir_graph *irg, void *pre, void *post)
+{
+ /* for now, do NOT differentiate between blockwise and normal */
+ stat_irg_walk(irg, pre, post);
+}
+
/*
* A walk over the graph's blocks is initiated. Do not count walks from statistic code.
*/
void stat_irg_block_walk(ir_graph *irg, const ir_node *node, void *pre, void *post)
{
+ if (! status->enable)
+ return;
+
STAT_ENTER_SINGLE;
{
graph_entry_t *graph = graph_get_entry(irg, status->irg_hash);
ir_node **old_node_array, int old_num_entries,
stat_opt_kind opt)
{
+ if (! status->enable)
+ return;
+
STAT_ENTER;
{
int i, j;
for (i = 0; i < old_num_entries; ++i) {
for (j = 0; j < new_num_entries; ++j)
- if (old_node_array[i] == new_node_array[j])
- break;
+ if (old_node_array[i] == new_node_array[j])
+ break;
/* nodes might be in new and old, these are NOT removed */
if (j >= new_num_entries) {
- removed_due_opt(old_node_array[i], graph->opt_hash[opt]);
+ removed_due_opt(old_node_array[i], graph->opt_hash[opt]);
}
}
}
*/
void stat_lower(ir_node *node)
{
+ if (! status->enable)
+ return;
+
STAT_ENTER;
{
graph_entry_t *graph = graph_get_entry(current_ir_graph, status->irg_hash);
*/
void stat_inline(ir_node *call, ir_graph *called_irg)
{
+ if (! status->enable)
+ return;
+
STAT_ENTER;
{
ir_graph *irg = get_irn_irg(call);
*/
void stat_dead_node_elim_start(ir_graph *irg)
{
+ if (! status->enable)
+ return;
+
++status->in_dead_node_elim;
}
*/
void stat_dead_node_elim_stop(ir_graph *irg)
{
+ if (! status->enable)
+ return;
+
--status->in_dead_node_elim;
}
/* Finish the statistics */
-void stat_finish(void)
+void stat_finish(const char *name)
{
+ if (! status->enable)
+ return;
+
STAT_ENTER;
{
graph_entry_t *entry;
graph_entry_t *global = graph_get_entry(NULL, status->irg_hash);
+ dump_init(name);
+
/* dump per graph */
for (entry = pset_first(status->irg_hash); entry; entry = pset_next(status->irg_hash)) {
if (entry->irg == NULL) {
- /* special entry for the global count */
- continue;
+ /* special entry for the global count */
+ continue;
}
if (! entry->deleted) {
- /* the graph is still alive, count the nodes on it */
- count_nodes_in_graph(global, entry);
+ /* the graph is still alive, count the nodes on it */
+ count_nodes_in_graph(global, entry);
+
+ /* count the DAG's */
+ count_dags_in_graph(global, entry);
+
+ /* calculate the pattern */
+ stat_calc_pattern_history(entry->irg);
}
dump_graph(entry);
+
+ /* clear the counter here:
+ * we need only the edge counter to be cleared, all others are cumulative
+ */
+ cnt_clr(&entry->cnt_edges);
}
/* dump global */
- dump_graph(global);
+// dump_graph(global);
dump_finish();
+ stat_finish_pattern_history();
+
+ /* clear the global counter here */
+ {
+ node_entry_t *entry;
+
+ for (entry = pset_first(global->opcode_hash); entry; entry = pset_next(global->opcode_hash)) {
+ opcode_clear_entry(entry);
+ }
+ graph_clear_entry(global);
+ }
+
+ /* finished */
+// status->enable = 0;
}
STAT_LEAVE;
}
#define FIRM_STATISTICS
#include "firmstat.h"
-void stat_init(void) {}
+void init_stat(unsigned enable_options) {}
-void stat_finish(void) {}
+void stat_finish(const char *name) {}
void stat_new_ir_op(const ir_op *op) {}
projects / libfirm / blobdiff