# include "config.h"
#endif
-# include <string.h>
+#ifdef FIRM_STATISTICS
#include <stdio.h>
#include <stdlib.h>
+#include <string.h>
-#ifdef FIRM_STATISTICS
-
-#include "firmstat.h"
-# include "irop_t.h"
-# include "irnode_t.h"
-# include "irgraph_t.h"
-# include "pset.h"
-# include "irprog.h"
-# include "irgwalk.h"
-# include "pattern.h"
-# include "counter.h"
-
-/*
- * just be make some things clear :-), the
- * poor man "generics"
- */
-#define HASH_MAP(type) hmap_##type
-
-typedef pset hmap_node_entry_t;
-typedef pset hmap_graph_entry_t;
-typedef pset hmap_opt_entry_t;
-typedef pset hmap_block_entry_t;
-typedef pset hmap_ir_op;
-
-/*
- * An entry for ir_nodes, used in ir_graph statistics.
- */
-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 */
- HASH_MAP(block_entry_t) *block_hash; /**< hash map countaining the block 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;
-
-/**
- * An entry for a block in a ir-graph
- */
-typedef struct _block_entry_t {
- counter_t cnt_nodes; /**< the counter of nodes in this block */
- counter_t cnt_edges; /**< the counter of edges in this block */
- counter_t cnt_in_edges; /**< the counter of edges incoming from other blocks to this block */
- counter_t cnt_out_edges; /**< the counter of edges outgoing from this block to other blocks */
- long block_nr; /**< block nr */
-} block_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 */
- HASH_MAP(ir_op) *ir_op_hash; /**< hash map containing all ir_ops (accessible by op_codes) */
- 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 */
- int enable; /**< if set, statistic is enabled */
-} stat_info_t;
+#include "firmstat_t.h"
+#include "pattern.h"
+#include "dags.h"
/**
* names of the optimizations
"Write-After-Write optimization",
"Write-After-Read optimization",
"Read-After-Write optimization",
+ "Read-After-Read optimization",
"Tuple optimization",
"ID optimization",
"Constant evaluation",
+ "Common subexpression elimination",
+ "Strength reduction",
+ "Architecture dependant optimization",
+ "Reassociation optimization",
"Lowered",
};
+/*
+ * need this to be static:
+ * Special pseudo Opcodes that we need to count some interesting cases
+ */
+
/**
- * need this to be static
+ * The Phi0, a node that is created during SSA construction
*/
-static ir_op _op_Phi0, _op_PhiM;
+static ir_op _op_Phi0;
+
+/** The PhiM, just to count memorty Phi's. */
+static ir_op _op_PhiM;
+
+/** The Mul by Const node. */
+static ir_op _op_MulC;
+
+/** The Div by Const node. */
+static ir_op _op_DivC;
+
+/** The Div by Const node. */
+static ir_op _op_ModC;
+
+/** The Div by Const node. */
+static ir_op _op_DivModC;
/* ---------------------------------------------------------------------------------- */
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 counter */
- cnt_clr(&elem->cnt_alive);
- cnt_clr(&elem->new_node);
- cnt_clr(&elem->into_Id);
+ opcode_clear_entry(elem);
elem->op = op;
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_was_inlined);
+ cnt_clr(&elem->cnt_got_inlined);
+ cnt_clr(&elem->cnt_strength_red);
+ 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);
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
*/
elem = obstack_alloc(&status->cnts, sizeof(*elem));
/* clear new counter */
- cnt_clr(&elem->cnt_nodes);
- cnt_clr(&elem->cnt_edges);
- cnt_clr(&elem->cnt_in_edges);
- cnt_clr(&elem->cnt_out_edges);
+ block_clear_entry(elem);
elem->block_nr = 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)
+static ir_op *stat_get_irn_op(ir_node *node)
{
ir_op *op = get_irn_op(node);
/* special case, a Memory Phi node, count on extra counter */
op = status->op_PhiM;
}
+ else if (op->code == iro_Mul &&
+ (get_irn_op(get_Mul_left(node)) == op_Const || get_irn_op(get_Mul_right(node)) == op_Const)) {
+ /* special case, a Multiply by a const, count on extra counter */
+ op = status->op_MulC ? status->op_MulC : op_Mul;
+ }
+ else if (op->code == iro_Div && get_irn_op(get_Div_right(node)) == op_Const) {
+ /* special case, a division by a const, count on extra counter */
+ op = status->op_DivC ? status->op_DivC : op_Div;
+ }
+ else if (op->code == iro_Mod && get_irn_op(get_Mod_right(node)) == op_Const) {
+ /* special case, a module by a const, count on extra counter */
+ op = status->op_ModC ? status->op_ModC : op_Mod;
+ }
+ else if (op->code == iro_DivMod && get_irn_op(get_DivMod_right(node)) == op_Const) {
+ /* special case, a division/modulo by a const, count on extra counter */
+ op = status->op_DivModC ? status->op_DivModC : op_DivMod;
+ }
+
return op;
}
/* 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);
+ 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 */
// return;
}
- block = get_nodes_Block(node);
+ block = get_nodes_block(node);
b_entry = block_get_entry(get_irn_node_nr(block), graph->block_hash);
/* we have a new nodes */
if (get_irn_op(pred) == op_Block)
continue;
- other_block = get_nodes_Block(pred);
+ other_block = get_nodes_block(pred);
if (other_block == block)
cnt_inc(&b_entry->cnt_edges); /* a in block edge */
}
}
+/**
+ * update info on calls
+ */
+static void count_call(ir_node *call, graph_entry_t *graph)
+{
+ ir_node *ptr = get_Call_ptr(call);
+ entity *ent = NULL;
+
+ /* found a call, is not a leaf function */
+ graph->is_leaf = 0;
+
+ if (get_irn_op(ptr) == op_SymConst) {
+ if (get_SymConst_kind(ptr) == symconst_addr_ent) {
+ /* ok, we seems to know the entity */
+ ent = get_SymConst_entity(ptr);
+
+ if (get_entity_irg(ent) == graph->irg)
+ graph->is_recursive = 1;
+ }
+ }
+
+ /* check, if it's a chain-call: Then, the call-block
+ * must dominate the end block. */
+ {
+ ir_node *curr = get_irg_end_block(graph->irg);
+ ir_node *block = get_nodes_block(call);
+ int depth = get_Block_dom_depth(block);
+
+ for (; curr != block && get_Block_dom_depth(curr) > depth;) {
+ curr = get_Block_idom(curr);
+
+ if (! curr || is_no_Block(curr))
+ break;
+ }
+
+ if (curr != block)
+ graph->is_chain_call = 0;
+ }
+}
+
/**
* walker for reachable nodes count
*/
/* count block edges */
count_block_info(node, graph);
+
+ /* check for leaf functions */
+ if (get_irn_op(node) == op_Call)
+ count_call(node, 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);
+ }
+
+ /* set pessimistic values */
+ graph->is_leaf = 1;
+ graph->is_recursive = 0;
+ graph->is_chain_call = 1;
+
+ /* we need dominator info */
+ if (graph->irg != get_const_code_irg())
+ if (get_irg_dom_state(graph->irg) != dom_consistent)
+ compute_doms(graph->irg);
+
+ /* count the nodes in the graph */
irg_walk_graph(graph->irg, count_nodes, NULL, graph);
+#if 0
+ entry = opcode_get_entry(op_Call, graph->opcode_hash);
+
+ /* check if we have more than 1 call */
+ if (cnt_gt(entry->cnt_alive, 1))
+ graph->is_chain_call = 0;
+#endif
+
+ /* recursive functions are never chain calls, leafs don't have calls */
+ if (graph->is_recursive || graph->is_leaf)
+ graph->is_chain_call = 0;
+
/* 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);
/**
* 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, "\nIrg %p", (void *)entry->irg);
}
- fprintf(dmp->f, " %swalked %d over blocks %d was inlined %d got inlined %d:\n",
- entry->deleted ? "DELETED " : "",
+ fprintf(dmp->f, " %swalked %d over blocks %d:\n"
+ " was inlined: %d\n"
+ " got inlined: %d\n"
+ " strength red: %d\n"
+ " leaf function: %s\n"
+ " recursive : %s\n"
+ " chain call : %s\n",
+ entry->is_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->cnt_got_inlined.cnt[0],
+ entry->cnt_strength_red.cnt[0],
+ entry->is_leaf ? "YES" : "NO",
+ entry->is_recursive ? "YES" : "NO",
+ entry->is_chain_call ? "YES" : "NO"
);
}
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", "incoming", "outgoing", "quot");
- for (b_entry = pset_first(entry->block_hash);
- b_entry;
- b_entry = pset_next(entry->block_hash)) {
- fprintf(dmp->f, "%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]
- );
+ /* 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");
}
/**
counter_t cnt[4];
- if (entry->irg) {
+ if (entry->irg && !entry->is_deleted) {
ir_graph *const_irg = get_const_code_irg();
if (entry->irg == const_irg) {
*/
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");
}
/**
}
/* initialize the statistics module. */
-void stat_init(unsigned enable_options)
+void init_stat(unsigned enable_options)
{
#define X(a) a, sizeof(a)-1
/* 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"));
+
+ _op_MulC.code = --pseudo_id;
+ _op_MulC.name = new_id_from_chars(X("MulC"));
+
+ _op_DivC.code = --pseudo_id;
+ _op_DivC.name = new_id_from_chars(X("DivC"));
+
+ _op_ModC.code = --pseudo_id;
+ _op_ModC.name = new_id_from_chars(X("ModC"));
+
+ _op_DivModC.code = --pseudo_id;
+ _op_DivModC.name = new_id_from_chars(X("DivModC"));
/* create the hash-tables */
status->irg_hash = new_pset(graph_cmp, 8);
status->op_Phi0 = &_op_Phi0;
status->op_PhiM = &_op_PhiM;
- stat_register_dumper(&simple_dumper, "firmstat.txt");
- stat_register_dumper(&csv_dumper, "firmstat.csv");
+ if (enable_options & FIRMSTAT_COUNT_STRONG_OP) {
+ status->op_MulC = &_op_MulC;
+ status->op_DivC = &_op_DivC;
+ status->op_ModC = &_op_ModC;
+ status->op_DivModC = &_op_DivModC;
+ }
+ else {
+ status->op_MulC = NULL;
+ status->op_DivC = NULL;
+ status->op_ModC = NULL;
+ status->op_DivModC = NULL;
+ }
+
+ stat_register_dumper(&simple_dumper);
+ stat_register_dumper(&csv_dumper);
/* initialize the pattern hash */
stat_init_pattern_history(enable_options & FIRMSTAT_PATTERN_ENABLED);
}
/* A new node is created. */
-void stat_new_node(const ir_node *node)
+void stat_new_node(ir_node *node)
{
if (! status->enable)
return;
}
/* A node is changed into a Id node */
-void stat_turn_into_id(const ir_node *node)
+void stat_turn_into_id(ir_node *node)
{
if (! status->enable)
return;
/* execute for side effect :-) */
graph_entry_t * graph = graph_get_entry(irg, status->irg_hash);
- graph->ent = ent;
- graph->deleted = 0;
+ graph->ent = ent;
+ graph->is_deleted = 0;
+ graph->is_leaf = 0;
+ graph->is_recursive = 0;
+ graph->is_chain_call = 0;
}
STAT_LEAVE;
}
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->is_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);
}
*/
static void removed_due_opt(ir_node *n, pset *set)
{
- ir_op *op = get_irn_op(n);
+ ir_op *op = stat_get_irn_op(n);
opt_entry_t *entry = opt_get_entry(op, set);
/* increase global value */
int i, j;
graph_entry_t *graph = graph_get_entry(current_ir_graph, status->irg_hash);
+ if (status->reassoc_run)
+ opt = STAT_OPT_REASSOC;
+
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])
STAT_LEAVE;
}
+/*
+ * reassociation started/stopped.
+ */
+void stat_reassociate(int flag)
+{
+ if (! status->enable)
+ return;
+
+ STAT_ENTER;
+ {
+ status->reassoc_run = flag;
+ }
+ STAT_LEAVE;
+}
+
/*
* A node was lowered into other nodes
*/
STAT_LEAVE;
}
+/*
+ * A graph with tail-recursions was optimized.
+ */
+void stat_tail_rec(ir_graph *irg)
+{
+ if (! status->enable)
+ return;
+
+ STAT_ENTER;
+ {
+ }
+ STAT_LEAVE;
+}
+
+/*
+ * Strength reduction was performed on an iteration variable.
+ */
+void stat_strength_red(ir_graph *irg, ir_node *strong, ir_node *cmp)
+{
+ if (! status->enable)
+ return;
+
+ STAT_ENTER;
+ {
+ graph_entry_t *graph = graph_get_entry(irg, status->irg_hash);
+ cnt_inc(&graph->cnt_strength_red);
+
+ removed_due_opt(strong, graph->opt_hash[STAT_OPT_STRENGTH_RED]);
+ }
+ STAT_LEAVE;
+}
+
/*
* Start the dead node elimination.
*/
--status->in_dead_node_elim;
}
+/*
+ * A multiply was replaced by a series of Shifts/Adds/Subs
+ */
+void stat_arch_dep_replace_mul_with_shifts(ir_node *mul)
+{
+ if (! status->enable)
+ return;
+
+ STAT_ENTER;
+ {
+ graph_entry_t *graph = graph_get_entry(current_ir_graph, status->irg_hash);
+ removed_due_opt(mul, graph->opt_hash[STAT_OPT_ARCH_DEP]);
+ }
+ STAT_LEAVE;
+}
+
+/**
+ * A division was replaced by a series of Shifts/Muls
+ */
+void stat_arch_dep_replace_div_by_const(ir_node *div)
+{
+ if (! status->enable)
+ return;
+
+ STAT_ENTER;
+ {
+ graph_entry_t *graph = graph_get_entry(current_ir_graph, status->irg_hash);
+ removed_due_opt(div, graph->opt_hash[STAT_OPT_ARCH_DEP]);
+ }
+ STAT_LEAVE;
+}
+
+/**
+ * A modulo was replaced by a series of Shifts/Muls
+ */
+void stat_arch_dep_replace_mod_by_const(ir_node *mod)
+{
+ if (! status->enable)
+ return;
+
+ STAT_ENTER;
+ {
+ graph_entry_t *graph = graph_get_entry(current_ir_graph, status->irg_hash);
+ removed_due_opt(mod, graph->opt_hash[STAT_OPT_ARCH_DEP]);
+ }
+ STAT_LEAVE;
+}
+
+/**
+ * A DivMod was replaced by a series of Shifts/Muls
+ */
+void stat_arch_dep_replace_DivMod_by_const(ir_node *divmod)
+{
+ if (! status->enable)
+ return;
+
+ STAT_ENTER;
+ {
+ graph_entry_t *graph = graph_get_entry(current_ir_graph, status->irg_hash);
+ removed_due_opt(divmod, graph->opt_hash[STAT_OPT_ARCH_DEP]);
+ }
+ STAT_LEAVE;
+}
+
/* Finish the statistics */
-void stat_finish(void)
+void stat_finish(const char *name)
{
if (! status->enable)
return;
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)) {
continue;
}
- if (! entry->deleted) {
+ if (! entry->is_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);
}
/* dump global */
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;
+// 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) {}
void stat_free_ir_op(const ir_op *op) {}
-void stat_new_node(const ir_node *node) {}
+void stat_new_node(ir_node *node) {}
-void stat_turn_into_id(const ir_node *node) {}
+void stat_turn_into_id(ir_node *node) {}
void stat_new_graph(ir_graph *irg, entity *ent) {}
ir_node **old_node_array, int old_num_entries,
stat_opt_kind opt) {}
+void stat_reassociate(int start) {}
+
void stat_lower(ir_node *node) {}
void stat_inline(ir_node *call, ir_graph *irg) {}
+void stat_tail_rec(ir_graph *irg) {}
+
+void stat_strength_red(ir_graph *irg, ir_node *strong, ir_node *cmp) {}
+
void stat_dead_node_elim_start(ir_graph *irg) {}
void stat_dead_node_elim_stop(ir_graph *irg) {}
+void stat_arch_dep_replace_mul_with_shifts(ir_node *mul) {}
+
+void stat_arch_dep_replace_div_by_const(ir_node *div) {}
+
+void stat_arch_dep_replace_mod_by_const(ir_node *mod) {}
+
+void stat_arch_dep_replace_DivMod_by_const(ir_node *divmod) {}
+
#endif
projects / libfirm / blobdiff