# 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"
+#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"
-
-/*
- * 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 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 {
- pset *opcode_hash; /**< hash map containing the opcode counter */
- counter_t walked; /**< walker walked over the graph */
- counter_t walked_blocks; /**< walker walked over the graph blocks */
- counter_t was_inlined; /**< number of times other graph were inlined */
- counter_t got_inlined; /**< number of times this graph was inlined */
- pset *opt_hash[STAT_OPT_MAX]; /**< hash maps containing opcode counter for optimizations */
- const 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;
+#include "firmstat_t.h"
+#include "pattern.h"
+#include "dags.h"
/**
- * An entry for optimized ir_nodes
+ * names of the optimizations
*/
-typedef struct _opt_entry_t {
- counter_t count; /**< optimization counter */
- const ir_op *op; /**< the op for this entry */
-} opt_entry_t;
+static const char *opt_names[] = {
+ "straightening optimization",
+ "if simplification",
+ "algebraic simplification",
+ "Phi optmization",
+ "Write-After-Write optimization",
+ "Write-After-Read optimization",
+ "Read-After-Write optimization",
+ "Tuple optimization",
+ "ID optimization",
+ "Constant evaluation",
+ "Lowered",
+};
/**
- * statistics info
+ * need this to be static
*/
-typedef struct _statistic_info_t {
- struct obstack cnts; /**< obstack containing the counters */
- pset *opcode_hash; /**< hash map containing the opcode counter */
- pset *irg_hash; /**< hash map containing the counter for irgs */
- FILE *f; /**< outputfile */
- ir_op *op_Phi0; /**< needed pseudo op */
-} stat_info_t;
+static ir_op _op_Phi0, _op_PhiM;
-/*
- * global status
- */
-static stat_info_t _status, *status = &_status;
+/* ---------------------------------------------------------------------------------- */
-/**
- * increase a counter
- */
-static INLINE void cnt_inc(counter_t *cnt)
-{
- int i;
-
- for (i = 0; i < STAT_CNT_NUM; ++i) {
- if (++cnt->cnt[i])
- break;
- }
-}
+#define STAT_ENTER ++status->recursive
+#define STAT_LEAVE --status->recursive
+#define STAT_ENTER_SINGLE do { if (status->recursive > 0) return; ++status->recursive; } while (0)
/**
- * decreace a counter
+ * global status
*/
-static INLINE void cnt_dec(counter_t *cnt)
-{
- int i;
-
- for (i = 0; i < STAT_CNT_NUM; ++i) {
- if (--cnt->cnt[i] != -1)
- break;
- }
-}
+static stat_info_t _status, *status = &_status;
/**
- * set a counter to zero
- */
-static INLINE void cnt_clr(counter_t *cnt)
-{
- memset(cnt->cnt, 0, sizeof(cnt->cnt));
-}
-
-/*
* compare two elements of the opcode hash
*/
static int opcode_cmp(const void *elt, const void *key)
return e1->op->code - e2->op->code;
}
-/*
+/**
* compare two elements of the graph hash
*/
static int graph_cmp(const void *elt, const void *key)
return e1->irg != e2->irg;
}
-/*
+/**
* compare two elements of the optimization hash
*/
static int opt_cmp(const void *elt, const void *key)
return e1->op->code != e2->op->code;
}
+/**
+ * compare two elements of the block hash
+ */
+static int block_cmp(const void *elt, const void *key)
+{
+ const block_entry_t *e1 = elt;
+ const block_entry_t *e2 = key;
+
+ return e1->block_nr != e2->block_nr;
+}
+
+/**
+ * compare two elements of the ir_op hash
+ */
+static int opcode_cmp_2(const void *elt, const void *key)
+{
+ const ir_op *e1 = elt;
+ const ir_op *e2 = key;
+
+ return e1->code != e2->code;
+}
+
+/**
+ * clears all counter in a node_entry_t
+ */
+static void opcode_clear_entry(node_entry_t *elem)
+{
+ cnt_clr(&elem->cnt_alive);
+ cnt_clr(&elem->new_node);
+ cnt_clr(&elem->into_Id);
+}
+
/**
* Returns the associates node_entry_t for an ir_op
*/
elem = obstack_alloc(&status->cnts, sizeof(*elem));
- /* clear new counter */
- cnt_clr(&elem->new_node);
- cnt_clr(&elem->into_Id);
+ /* clear counter */
+ 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
*/
static INLINE unsigned irg_hash(const ir_graph *irg)
{
- return (unsigned)irg;
+ 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
*/
-static graph_entry_t *graph_get_entry(const ir_graph *irg, pset *set)
+static graph_entry_t *graph_get_entry(ir_graph *irg, pset *set)
{
graph_entry_t key;
graph_entry_t *elem;
elem = obstack_alloc(&status->cnts, sizeof(*elem));
- cnt_clr(&elem->walked);
- cnt_clr(&elem->walked_blocks);
- cnt_clr(&elem->got_inlined);
- cnt_clr(&elem->was_inlined);
+ /* 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);
+}
-/* initialize the statistics module. */
-void stat_init(void)
+/**
+ * Returns the associates block_entry_t for an block
+ */
+static block_entry_t *block_get_entry(long block_nr, pset *set)
{
- obstack_init(&status->cnts);
+ block_entry_t key;
+ block_entry_t *elem;
- /* create the hash-tables */
- status->opcode_hash = new_pset(opcode_cmp, 8);
- status->irg_hash = new_pset(graph_cmp, 8);
+ key.block_nr = block_nr;
- status->f = fopen("firmstat.txt", "w");
- status->op_Phi0 = NULL;
+ 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);
}
-/* A new IR op is registered. */
-void stat_new_ir_op(const ir_op *op)
+
+/**
+ * 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)
{
- /* execute for side effect :-) */
- opcode_get_entry(op, status->opcode_hash);
+ ir_op *op = get_irn_op(node);
+
+ 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 && get_irn_mode(node) == mode_M) {
+ /* special case, a Memory Phi node, count on extra counter */
+ op = status->op_PhiM;
+ }
+ return op;
}
-/* An IR op is freed. */
-void stat_free_ir_op(const ir_op *op)
+/**
+ * update the block counter
+ */
+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);
+ }
+ }
}
-/* A new node is created. */
-void stat_new_node(const ir_node *node)
+/**
+ * walker for reachable nodes count
+ */
+static void count_nodes(ir_node *node, void *env)
{
+ graph_entry_t *graph = env;
node_entry_t *entry;
- graph_entry_t *graph;
- ir_op *op = get_irn_op(node);
- if (op->code == iro_Phi && get_irn_arity(node) == 0) {
- /* special case, a Phi0 node, count on extra counter */
- if (! status->op_Phi0) {
- ir_op *op_Phi = get_op_Phi();
+ ir_op *op = stat_get_irn_op(node);
+ int arity = get_irn_arity(node);
+
+ entry = opcode_get_entry(op, graph->opcode_hash);
- status->op_Phi0 = new_ir_op(0xFFFF, "Phi0", op_Phi->pinned, op_Phi->flags, op_Phi->opar, op_Phi->op_index, op_Phi->attr_size);
+ cnt_inc(&entry->cnt_alive);
+ cnt_add_i(&graph->cnt_edges, arity);
+
+ /* count block edges */
+ count_block_info(node, graph);
+}
+
+/**
+ * count all alive nodes and edges in a graph
+ */
+static void count_nodes_in_graph(graph_entry_t *global, graph_entry_t *graph)
+{
+ node_entry_t *entry;
+
+ /* 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);
+ }
+
+ /* 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)) {
+ node_entry_t *g_entry = opcode_get_entry(entry->op, global->opcode_hash);
+
+ /* update the node counter */
+ cnt_add(&g_entry->cnt_alive, &entry->cnt_alive);
+ }
+
+ /* update the edge counter */
+ cnt_add(&global->cnt_edges, &graph->cnt_edges);
+}
+
+/**
+ * register a dumper
+ */
+static void stat_register_dumper(dumper_t *dumper)
+{
+ dumper->next = status->dumper;
+ status->dumper = dumper;
+}
+
+/**
+ * dumps an irg
+ */
+static void dump_graph(graph_entry_t *entry)
+{
+ dumper_t *dumper;
+
+ for (dumper = status->dumper; dumper; dumper = dumper->next) {
+ if (dumper->dump_graph)
+ dumper->dump_graph(dumper, entry);
+ }
+}
+
+/**
+ * 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
+ */
+static void dump_finish(void)
+{
+ dumper_t *dumper;
+
+ for (dumper = status->dumper; dumper; dumper = dumper->next) {
+ if (dumper->finish)
+ dumper->finish(dumper);
+ }
+}
+
+/* ---------------------------------------------------------------------- */
+
+/**
+ * dumps a opcode hash into human readable form
+ */
+static void simple_dump_opcode_hash(dumper_t *dmp, pset *set)
+{
+ node_entry_t *entry;
+ counter_t f_alive;
+ counter_t f_new_node;
+ counter_t f_Id;
+
+ cnt_clr(&f_alive);
+ cnt_clr(&f_new_node);
+ cnt_clr(&f_Id);
+
+ 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]);
+
+ cnt_add(&f_alive, &entry->cnt_alive);
+ cnt_add(&f_new_node, &entry->new_node);
+ cnt_add(&f_Id, &entry->into_Id);
+ }
+ fprintf(dmp->f, "-------------------------------------------\n");
+ fprintf(dmp->f, "%-16s %8d %8d %8d\n", "Sum",
+ f_alive.cnt[0],
+ f_new_node.cnt[0],
+ f_Id.cnt[0]);
+}
+
+/**
+ * dumps a optimization hash into human readable form
+ */
+static void simple_dump_opt_hash(dumper_t *dmp, pset *set, int index)
+{
+ opt_entry_t *entry = pset_first(set);
+
+ if (entry) {
+ fprintf(dmp->f, "\n%s:\n", opt_names[index]);
+ fprintf(dmp->f, "%-16s %-8s\n", "Opcode", "deref");
+
+ for (; entry; entry = pset_next(set)) {
+ fprintf(dmp->f, "%-16s %8d\n",
+ get_id_str(entry->op->name), entry->count.cnt[0]);
}
- op = status->op_Phi0;
}
+}
- entry = opcode_get_entry(op, status->opcode_hash);
- graph = graph_get_entry(current_ir_graph, status->irg_hash);
+/**
+ * dumps the endges count
+ */
+static void simple_dump_edges(dumper_t *dmp, counter_t *cnt)
+{
+ fprintf(dmp->f, "%-16s %8d\n", "Edges", cnt->cnt[0]);
+}
- /* increase global value */
- cnt_inc(&entry->new_node);
+/**
+ * dumps the IRG
+ */
+static void simple_dump_graph(dumper_t *dmp, graph_entry_t *entry)
+{
+ int dump_opts = 1;
+ block_entry_t *b_entry;
- /* increase local value */
- entry = opcode_get_entry(op, graph->opcode_hash);
- cnt_inc(&entry->new_node);
+ if (entry->irg) {
+ ir_graph *const_irg = get_const_code_irg();
+
+ if (entry->irg == const_irg) {
+ fprintf(dmp->f, "\nConst code Irg %p", (void *)entry->irg);
+ }
+ else {
+ if (entry->ent)
+ 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, " %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]
+ );
+ }
+ else {
+ fprintf(dmp->f, "\nGlobals counts:\n");
+ fprintf(dmp->f, "--------------\n");
+ dump_opts = 0;
+ }
+
+ simple_dump_opcode_hash(dmp, entry->opcode_hash);
+ simple_dump_edges(dmp, &entry->cnt_edges);
+
+ /* effects of optimizations */
+ if (dump_opts) {
+ int i;
+
+ 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]
+ );
+ }
+ }
}
-/* A node is changed into a Id node */
-void stat_turn_into_id(const ir_node *node)
+/**
+ * initialise the simple dumper
+ */
+static void simple_init(dumper_t *dmp, const char *name)
+{
+ char fname[2048];
+
+ snprintf(fname, sizeof(fname), "%s.txt", name);
+ dmp->f = fopen(fname, "w");
+}
+
+/**
+ * finishes the simple dumper
+ */
+static void simple_finish(dumper_t *dmp)
+{
+ fclose(dmp->f);
+ dmp->f = NULL;
+}
+
+/**
+ * the simple human readable dumper
+ */
+static dumper_t simple_dumper = {
+ simple_dump_graph,
+ simple_init,
+ simple_finish,
+ NULL,
+ NULL,
+};
+
+/* ---------------------------------------------------------------------- */
+
+/**
+ * count the nodes as needed:
+ *
+ * 1 normal (data) Phi's
+ * 2 memory Phi's
+ * 3 Proj
+ * 0 all other nodes
+ */
+static void csv_count_nodes(graph_entry_t *graph, counter_t cnt[])
{
node_entry_t *entry;
- graph_entry_t *graph;
- ir_op *op = get_irn_op(node);
+ int i;
- if (op->code == iro_Phi && get_irn_arity(node) == 0) {
- /* special case, a Phi0 node, count on extra counter */
- if (! status->op_Phi0) {
- ir_op *op_Phi = get_op_Phi();
+ for (i = 0; i < 4; ++i)
+ cnt_clr(&cnt[i]);
- status->op_Phi0 = new_ir_op(0xFFFF, "Phi0", op_Phi->pinned, op_Phi->flags, op_Phi->opar, op_Phi->op_index, op_Phi->attr_size);
+ for (entry = pset_first(graph->opcode_hash); entry; entry = pset_next(graph->opcode_hash)) {
+ if (entry->op == op_Phi) {
+ /* normal Phi */
+ cnt_add(&cnt[1], &entry->cnt_alive);
+ }
+ else if (entry->op == status->op_PhiM) {
+ /* memory Phi */
+ cnt_add(&cnt[2], &entry->cnt_alive);
+ }
+ else if (entry->op == op_Proj) {
+ /* Proj */
+ cnt_add(&cnt[3], &entry->cnt_alive);
+ }
+ else {
+ /* all other nodes */
+ cnt_add(&cnt[0], &entry->cnt_alive);
}
- op = status->op_Phi0;
}
+}
+
+/**
+ * dumps the IRG
+ */
+static void csv_dump_graph(dumper_t *dmp, graph_entry_t *entry)
+{
+ const char *name;
- entry = opcode_get_entry(op, status->opcode_hash);
- graph = graph_get_entry(current_ir_graph, status->irg_hash);
+ counter_t cnt[4];
- /* increase global value */
- cnt_inc(&entry->into_Id);
+ if (entry->irg) {
+ ir_graph *const_irg = get_const_code_irg();
- /* increase local value */
- entry = opcode_get_entry(op, graph->opcode_hash);
- cnt_inc(&entry->into_Id);
+ if (entry->irg == const_irg) {
+ name = "<Const code Irg>";
+ return;
+ }
+ else {
+ if (entry->ent)
+ name = get_entity_name(entry->ent);
+ else
+ name = "<UNKNOWN IRG>";
+ }
+
+ csv_count_nodes(entry, cnt);
+
+ fprintf(dmp->f, "%-40s, %p, %d, %d, %d, %d\n",
+ name,
+ (void *)entry->irg,
+ cnt[0].cnt[0],
+ cnt[1].cnt[0],
+ cnt[2].cnt[0],
+ cnt[3].cnt[0]
+ );
+ }
+}
+
+/**
+ * initialise the simple dumper
+ */
+static void csv_init(dumper_t *dmp, const char *name)
+{
+ char fname[2048];
+
+ snprintf(fname, sizeof(fname), "%s.csv", name);
+ dmp->f = fopen(fname, "a");
+}
+
+/**
+ * finishes the simple dumper
+ */
+static void csv_finish(dumper_t *dmp)
+{
+ fclose(dmp->f);
+ dmp->f = NULL;
+}
+
+/**
+ * the simple human readable dumper
+ */
+static dumper_t csv_dumper = {
+ csv_dump_graph,
+ csv_init,
+ csv_finish,
+ NULL,
+ NULL,
+};
+
+
+/* ---------------------------------------------------------------------- */
+
+/*
+ * 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 init_stat(unsigned enable_options)
+{
+#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 = new_id_from_chars(X("Phi0"));
+
+ _op_PhiM.code = --pseudo_id;
+ _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);
+ 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;
+ {
+ }
+ STAT_LEAVE;
+}
+
+/* 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;
+
+ STAT_ENTER;
+ {
+ node_entry_t *entry;
+ graph_entry_t *graph;
+ ir_op *op = stat_get_irn_op(node);
+
+ /* increase global value */
+ graph = graph_get_entry(NULL, status->irg_hash);
+ entry = opcode_get_entry(op, graph->opcode_hash);
+ cnt_inc(&entry->new_node);
+
+ /* increase local value */
+ graph = graph_get_entry(current_ir_graph, status->irg_hash);
+ entry = opcode_get_entry(op, graph->opcode_hash);
+ cnt_inc(&entry->new_node);
+ }
+ STAT_LEAVE;
+}
+
+/* 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;
+ graph_entry_t *graph;
+ ir_op *op = stat_get_irn_op(node);
+
+ /* increase global value */
+ graph = graph_get_entry(NULL, status->irg_hash);
+ entry = opcode_get_entry(op, graph->opcode_hash);
+ cnt_inc(&entry->into_Id);
+
+ /* increase local value */
+ graph = graph_get_entry(current_ir_graph, status->irg_hash);
+ entry = opcode_get_entry(op, graph->opcode_hash);
+ cnt_inc(&entry->into_Id);
+ }
+ STAT_LEAVE;
}
/* A new graph was created */
-void stat_new_graph(const ir_graph *irg, entity *ent)
+void stat_new_graph(ir_graph *irg, entity *ent)
{
- /* execute for side effect :-) */
- graph_entry_t * graph = graph_get_entry(irg, status->irg_hash);
+ if (! status->enable)
+ return;
- graph->ent = ent;
- graph->deleted = 0;
+ STAT_ENTER;
+ {
+ /* execute for side effect :-) */
+ graph_entry_t * graph = graph_get_entry(irg, status->irg_hash);
+
+ graph->ent = ent;
+ graph->deleted = 0;
+ }
+ STAT_LEAVE;
}
/*
* A graph was deleted
*/
-void stat_free_graph(const ir_graph *irg)
+void stat_free_graph(ir_graph *irg)
{
- graph_entry_t * graph = graph_get_entry(irg, status->irg_hash);
+ if (! status->enable)
+ return;
+
+ STAT_ENTER;
+ {
+ graph_entry_t *graph = graph_get_entry(irg, status->irg_hash);
+ graph_entry_t *global = graph_get_entry(NULL, status->irg_hash);
+
+ graph->deleted = 1;
- graph->deleted = 1;
+ /* 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;
}
/*
- * A walk over a graph is initiated
+ * A walk over a graph is initiated. Do not count walks from statistic code.
*/
-void stat_irg_walk(const ir_graph *irg, void *pre, void *post)
+void stat_irg_walk(ir_graph *irg, void *pre, void *post)
{
- graph_entry_t *graph = graph_get_entry(irg, status->irg_hash);
+ if (! status->enable)
+ return;
- cnt_inc(&graph->walked);
+ STAT_ENTER_SINGLE;
+ {
+ graph_entry_t *graph = graph_get_entry(irg, status->irg_hash);
+
+ cnt_inc(&graph->cnt_walked);
+ }
+ STAT_LEAVE;
}
/*
- * A walk over the graph's blocks is initiated
+ * A walk over a graph in block-wise order is initiated. Do not count walks from statistic code.
*/
-void stat_irg_block_walk(const ir_graph *irg, const ir_node *node, void *pre, void *post)
+void stat_irg_walk_blkwise(ir_graph *irg, void *pre, void *post)
{
- graph_entry_t *graph = graph_get_entry(irg, status->irg_hash);
+ /* for now, do NOT differentiate between blockwise and normal */
+ stat_irg_walk(irg, pre, post);
+}
- cnt_inc(&graph->walked_blocks);
+/*
+ * 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);
+
+ cnt_inc(&graph->cnt_walked_blocks);
+ }
+ STAT_LEAVE;
}
/**
ir_node **old_node_array, int old_num_entries,
stat_opt_kind opt)
{
- int i, j;
- graph_entry_t *graph = graph_get_entry(current_ir_graph, status->irg_hash);
-
- 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;
-
- /* 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]);
+ if (! status->enable)
+ return;
+
+ STAT_ENTER;
+ {
+ int i, j;
+ graph_entry_t *graph = graph_get_entry(current_ir_graph, status->irg_hash);
+
+ 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;
+
+ /* 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]);
+ }
}
}
+ STAT_LEAVE;
}
/*
*/
void stat_lower(ir_node *node)
{
- graph_entry_t *graph = graph_get_entry(current_ir_graph, status->irg_hash);
+ if (! status->enable)
+ return;
+
+ STAT_ENTER;
+ {
+ graph_entry_t *graph = graph_get_entry(current_ir_graph, status->irg_hash);
- removed_due_opt(node, graph->opt_hash[STAT_LOWERED]);
+ removed_due_opt(node, graph->opt_hash[STAT_LOWERED]);
+ }
+ STAT_LEAVE;
}
/*
* A graph was inlined
*/
-void stat_inline(ir_node *call, const ir_graph *called_irg)
+void stat_inline(ir_node *call, ir_graph *called_irg)
{
- ir_graph *irg = get_irn_irg(call);
- graph_entry_t *i_graph = graph_get_entry(called_irg, status->irg_hash);
- graph_entry_t *graph = graph_get_entry(irg, status->irg_hash);
+ if (! status->enable)
+ return;
- cnt_inc(&graph->got_inlined);
- cnt_inc(&i_graph->was_inlined);
+ STAT_ENTER;
+ {
+ ir_graph *irg = get_irn_irg(call);
+ graph_entry_t *i_graph = graph_get_entry(called_irg, status->irg_hash);
+ graph_entry_t *graph = graph_get_entry(irg, status->irg_hash);
+
+ cnt_inc(&graph->cnt_got_inlined);
+ cnt_inc(&i_graph->cnt_was_inlined);
+ }
+ STAT_LEAVE;
}
-/**
- * dumps a opcode hash
+/*
+ * Start the dead node elimination.
*/
-static void dump_opcode_hash(pset *set)
+void stat_dead_node_elim_start(ir_graph *irg)
{
- node_entry_t *entry;
+ if (! status->enable)
+ return;
- fprintf(status->f, "%-16s %-8s %-8s\n", "Opcode", "created", "->Id");
- for (entry = pset_first(set); entry; entry = pset_next(set)) {
- fprintf(status->f, "%-16s %8d %8d\n",
- get_id_str(entry->op->name), entry->new_node.cnt[0], entry->into_Id.cnt[0]);
- }
+ ++status->in_dead_node_elim;
}
-static const char *opt_names[] = {
- "straightening optimization",
- "if simplification",
- "algebraic simplification",
- "Phi optmization",
- "Write-After-Write optimization",
- "Write-After-Read optimization",
- "Tuple optimization",
- "ID optimization",
- "Constant evaluation",
- "Lowered",
-};
-
-/**
- * dumps a optimization hash
+/*
+ * Stops the dead node elimination.
*/
-static void dump_opt_hash(pset *set, int index)
+void stat_dead_node_elim_stop(ir_graph *irg)
{
- opt_entry_t *entry = pset_first(set);
+ if (! status->enable)
+ return;
- if (entry) {
- fprintf(status->f, "\n%s:\n", opt_names[index]);
- fprintf(status->f, "%-16s %-8s\n", "Opcode", "deref");
-
- for (; entry; entry = pset_next(set)) {
- fprintf(status->f, "%-16s %8d\n",
- get_id_str(entry->op->name), entry->count.cnt[0]);
- }
- }
+ --status->in_dead_node_elim;
}
/* Finish the statistics */
-void stat_finish(void)
+void stat_finish(const char *name)
{
- int i;
- graph_entry_t *entry;
- ir_graph *const_irg = get_const_code_irg();
+ if (! status->enable)
+ return;
- /* dump global */
- fprintf(status->f, "\nGlobal counts:\n");
- dump_opcode_hash(status->opcode_hash);
+ STAT_ENTER;
+ {
+ graph_entry_t *entry;
+ graph_entry_t *global = graph_get_entry(NULL, status->irg_hash);
- for (entry = pset_first(status->irg_hash); entry; entry = pset_next(status->irg_hash)) {
- entity *ent = entry->ent;
+ dump_init(name);
- if (entry->irg == const_irg) {
- fprintf(status->f, "\nConst code Irg %p", entry->irg);
- }
- else {
- if (ent)
- fprintf(status->f, "\nEntity %s, Irg %p", get_entity_name(ent), entry->irg);
- else
- fprintf(status->f, "\nIrg %p", entry->irg);
+ /* 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;
+ }
+
+ if (! entry->deleted) {
+ /* 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);
}
- fprintf(status->f, " %swalked %d over blocks %d was inlined %d got inlined %d:\n",
- entry->deleted ? "DELETED " : "",
- entry->walked.cnt[0], entry->walked_blocks.cnt[0],
- entry->was_inlined.cnt[0],
- entry->got_inlined.cnt[0]
- );
+ /* dump global */
+// dump_graph(global);
+ dump_finish();
- dump_opcode_hash(entry->opcode_hash);
+ stat_finish_pattern_history();
- for (i = 0; i < sizeof(entry->opt_hash)/sizeof(entry->opt_hash[0]); ++i) {
- dump_opt_hash(entry->opt_hash[i], i);
+ /* 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);
}
- }
- fclose(status->f);
+ /* finished */
+// status->enable = 0;
+ }
+ STAT_LEAVE;
}
#else
#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) {}
void stat_turn_into_id(const ir_node *node) {}
-void stat_new_graph(const ir_graph *irg, entity *ent) {}
+void stat_new_graph(ir_graph *irg, entity *ent) {}
-void stat_free_graph(const ir_graph *irg) {}
+void stat_free_graph(ir_graph *irg) {}
-void stat_irg_walk(const ir_graph *irg, void *pre, void *post) {}
+void stat_irg_walk(ir_graph *irg, void *pre, void *post) {}
-void stat_irg_block_walk(const ir_graph *irg, const ir_node *node, void *pre, void *post) {}
+void stat_irg_block_walk(ir_graph *irg, const ir_node *node, void *pre, void *post) {}
void stat_merge_nodes(
ir_node **new_node_array, int new_num_entries,
void stat_lower(ir_node *node) {}
-void stat_inline(const ir_node *call, const ir_graph *irg) {}
+void stat_inline(ir_node *call, ir_graph *irg) {}
+
+void stat_dead_node_elim_start(ir_graph *irg) {}
+
+void stat_dead_node_elim_stop(ir_graph *irg) {}
#endif
projects / libfirm / blobdiff