#ifdef FIRM_STATISTICS
#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
+#ifdef HAVE_STDLIB_H
+# include <stdlib.h>
+#endif
+#ifdef HAVE_STRING_H
+# include <string.h>
+#endif
+
+#include "irouts.h"
+#include "irdump.h"
+#include "hashptr.h"
#include "firmstat_t.h"
#include "pattern.h"
#include "dags.h"
-
-/**
- * names of the optimizations
- */
-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",
- "Read-After-Read optimization",
- "Tuple optimization",
- "ID optimization",
- "Constant evaluation",
- "Common subexpression elimination",
- "Strength reduction",
- "Architecture dependant optimization",
- "Reassociation optimization",
- "Lowered",
-};
+#include "stat_dmp.h"
+#include "xmalloc.h"
/*
* need this to be static:
*/
static ir_op _op_Phi0;
-/** The PhiM, just to count memorty Phi's. */
+/** The PhiM, just to count memory Phi's. */
static ir_op _op_PhiM;
/** The Mul by Const node. */
/** The Div by Const node. */
static ir_op _op_DivModC;
+/** The memory Proj node. */
+static ir_op _op_ProjM;
+
/* ---------------------------------------------------------------------------------- */
+/** Marks the begin of a statistic (hook) function. */
#define STAT_ENTER ++status->recursive
+
+/** Marks the end of a statistic (hook) functions. */
#define STAT_LEAVE --status->recursive
+
+/** Allows to enter a statistic function only when we are not already in a hook. */
#define STAT_ENTER_SINGLE do { if (status->recursive > 0) return; ++status->recursive; } while (0)
/**
return e1->code != e2->code;
}
+/**
+ * compare two elements of the address_mark set
+ */
+static int address_mark_cmp(const void *elt, const void *key, size_t size)
+{
+ const address_mark_entry_t *e1 = elt;
+ const address_mark_entry_t *e2 = key;
+
+ /* compare only the nodes, the rest is used as data container */
+ return e1->node != e2->node;
+}
+
/**
* clears all counter in a node_entry_t
*/
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 >> 3;
-}
-
/**
* clears all counter in a graph_entry_t
*/
-static void graph_clear_entry(graph_entry_t *elem)
+static void graph_clear_entry(graph_entry_t *elem, int all)
{
- 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);
+ if (all) {
+ 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);
+ cnt_clr(&elem->cnt_all_calls);
+ cnt_clr(&elem->cnt_indirect_calls);
}
/**
- * Returns the acssociates graph_entry_t for an irg
+ * Returns the associated graph_entry_t for an irg
*/
static graph_entry_t *graph_get_entry(ir_graph *irg, pset *set)
{
key.irg = irg;
- elem = pset_find(set, &key, irg_hash(irg));
+ elem = pset_find(set, &key, HASH_PTR(irg));
if (elem)
return elem;
+ /* allocate a new one */
elem = obstack_alloc(&status->cnts, sizeof(*elem));
/* clear counter */
- graph_clear_entry(elem);
+ graph_clear_entry(elem, 1);
/* new hash table for opcodes here */
elem->opcode_hash = new_pset(opcode_cmp, 5);
elem->block_hash = new_pset(block_cmp, 5);
+ elem->address_mark = new_set(address_mark_cmp, 5);
elem->irg = irg;
for (i = 0; i < sizeof(elem->opt_hash)/sizeof(elem->opt_hash[0]); ++i)
elem->opt_hash[i] = new_pset(opt_cmp, 4);
- return pset_insert(set, elem, irg_hash(irg));
+ return pset_insert(set, elem, HASH_PTR(irg));
}
/**
}
/**
- * Returns the associates opt_entry_t for an ir_op
+ * Returns the associated opt_entry_t for an ir_op
*/
static opt_entry_t *opt_get_entry(const ir_op *op, pset *set)
{
}
/**
- * Returns the associates block_entry_t for an block
+ * Returns the associated block_entry_t for an block
*/
static block_entry_t *block_get_entry(long block_nr, pset *set)
{
{
ir_op *op = get_irn_op(node);
- if (op->code == iro_Phi && get_irn_arity(node) == 0) {
+ if (op == op_Phi && get_irn_arity(node) == 0) {
/* special case, a Phi0 node, count on extra counter */
- op = status->op_Phi0;
+ op = status->op_Phi0 ? status->op_Phi0 : op;
}
- else if (op->code == iro_Phi && get_irn_mode(node) == mode_M) {
+ else if (op == op_Phi && get_irn_mode(node) == mode_M) {
/* special case, a Memory Phi node, count on extra counter */
- op = status->op_PhiM;
+ op = status->op_PhiM ? status->op_PhiM : op;
+ }
+ else if (op == op_Proj && get_irn_mode(node) == mode_M) {
+ /* special case, a Memory Proj node, count on extra counter */
+ op = status->op_ProjM ? status->op_ProjM : op;
}
- else if (op->code == iro_Mul &&
+ else if (op == op_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;
+ op = status->op_MulC ? status->op_MulC : op;
}
- else if (op->code == iro_Div && get_irn_op(get_Div_right(node)) == op_Const) {
+ else if (op == op_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;
+ op = status->op_DivC ? status->op_DivC : op;
}
- else if (op->code == iro_Mod && get_irn_op(get_Mod_right(node)) == op_Const) {
+ else if (op == op_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;
+ op = status->op_ModC ? status->op_ModC : op;
}
- else if (op->code == iro_DivMod && get_irn_op(get_DivMod_right(node)) == op_Const) {
+ else if (op == op_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;
+ op = status->op_DivModC ? status->op_DivModC : op;
}
return op;
}
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);
/**
* update info on calls
*/
-static void count_call(ir_node *call, graph_entry_t *graph)
+static void update_call_stat(ir_node *call, graph_entry_t *graph)
{
+ ir_node *block = get_nodes_block(call);
ir_node *ptr = get_Call_ptr(call);
entity *ent = NULL;
+ ir_graph *callee = NULL;
+
+ /*
+ * If the block is bad, the whole subgraph will collapse later
+ * so do not count this call.
+ * This happens in dead code.
+ */
+ if (is_Bad(block))
+ return;
- /* found a call, is not a leaf function */
+ cnt_inc(&graph->cnt_all_calls);
+
+ /* found a call, this function is not a leaf */
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);
+ callee = get_entity_irg(ent);
- if (get_entity_irg(ent) == graph->irg)
+ /* it is recursive, if it calls at least once */
+ if (callee == graph->irg)
graph->is_recursive = 1;
}
}
+ else {
+ /* indirect call, be could not predict */
+ cnt_inc(&graph->cnt_indirect_calls);
+
+ /* NOT a leaf call */
+ graph->is_leaf_call = LCS_NON_LEAF_CALL;
+ }
/* 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;) {
if (curr != block)
graph->is_chain_call = 0;
}
+
+ /* check, if the callee is a leaf */
+ if (callee) {
+ graph_entry_t *called = graph_get_entry(callee, status->irg_hash);
+
+ if (called->is_analyzed) {
+ if (! called->is_leaf)
+ graph->is_leaf_call = LCS_NON_LEAF_CALL;
+ }
+ }
+}
+
+/**
+ * update info on calls for graphs on the wait queue
+ */
+static void update_call_stat_2(ir_node *call, graph_entry_t *graph)
+{
+ ir_node *block = get_nodes_block(call);
+ ir_node *ptr = get_Call_ptr(call);
+ entity *ent = NULL;
+ ir_graph *callee = NULL;
+
+ /*
+ * If the block is bad, the whole subgraph will collapse later
+ * so do not count this call.
+ * This happens in dead code.
+ */
+ if (is_Bad(block))
+ return;
+
+ 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);
+ callee = get_entity_irg(ent);
+ }
+ }
+
+ /* check, if the callee is a leaf */
+ if (callee) {
+ graph_entry_t *called = graph_get_entry(callee, status->irg_hash);
+
+ assert(called->is_analyzed);
+
+ if (! called->is_leaf)
+ graph->is_leaf_call = LCS_NON_LEAF_CALL;
+ }
+ else
+ graph->is_leaf_call = LCS_NON_LEAF_CALL;
}
/**
* walker for reachable nodes count
*/
-static void count_nodes(ir_node *node, void *env)
+static void update_node_stat(ir_node *node, void *env)
{
graph_entry_t *graph = env;
node_entry_t *entry;
/* count block edges */
count_block_info(node, graph);
- /* check for leaf functions */
+ /* check for properties that depends on calls like recursion/leaf/indirect call */
+ if (op == op_Call)
+ update_call_stat(node, graph);
+}
+
+/**
+ * walker for reachable nodes count for graphs on the wait_q
+ */
+static void update_node_stat_2(ir_node *node, void *env)
+{
+ graph_entry_t *graph = env;
+
+ /* check for properties that depends on calls like recursion/leaf/indirect call */
if (get_irn_op(node) == op_Call)
- count_call(node, graph);
+ update_call_stat_2(node, graph);
}
/**
- * count all alive nodes and edges in a graph
+ * get the current address mark
*/
-static void count_nodes_in_graph(graph_entry_t *global, graph_entry_t *graph)
+static unsigned get_adr_mark(graph_entry_t *graph, ir_node *node)
+{
+ address_mark_entry_t *value = set_find(graph->address_mark, &node, sizeof(*value), HASH_PTR(node));
+
+ return value ? value->mark : 0;
+}
+
+/**
+ * set the current address mark
+ */
+static void set_adr_mark(graph_entry_t *graph, ir_node *node, unsigned val)
+{
+ address_mark_entry_t *value = set_insert(graph->address_mark, &node, sizeof(*value), HASH_PTR(node));
+
+ value->mark = val;
+}
+
+/**
+ * a vcg attribute hook: Color a node with a different color if
+ * it's identified as a part of an address expression or at least referenced
+ * by an address expression.
+ */
+static int stat_adr_mark_hook(FILE *F, ir_node *node, ir_node *local)
+{
+ ir_node *n = local ? local : node;
+ ir_graph *irg = get_irn_irg(n);
+ graph_entry_t *graph = graph_get_entry(irg, status->irg_hash);
+ unsigned mark = get_adr_mark(graph, n);
+
+ if (mark & MARK_ADDRESS_CALC)
+ fprintf(F, "color: purple");
+ else if ((mark & (MARK_REF_ADR | MARK_REF_NON_ADR)) == MARK_REF_ADR)
+ fprintf(F, "color: pink");
+ else if ((mark & (MARK_REF_ADR | MARK_REF_NON_ADR)) == (MARK_REF_ADR|MARK_REF_NON_ADR))
+ fprintf(F, "color: lightblue");
+ else
+ return 0;
+
+ /* I know the color! */
+ return 1;
+}
+
+/**
+ * walker that marks every node that is an address calculation
+ *
+ * predecessor nodes must be visited first. We ensure this by
+ * calling in in the post of an outs walk. This should work even in cycles,
+ * while the pre in a normal walk will not.
+ */
+static void mark_address_calc(ir_node *node, void *env)
+{
+ graph_entry_t *graph = env;
+ ir_mode *mode = get_irn_mode(node);
+ int i, n;
+ unsigned mark_preds = MARK_REF_NON_ADR;
+
+ if (! mode_is_numP(mode))
+ return;
+
+ if (mode_is_reference(mode)) {
+ /* a reference is calculated here, we are sure */
+ set_adr_mark(graph, node, MARK_ADDRESS_CALC);
+
+ mark_preds = MARK_REF_ADR;
+ }
+ else {
+ unsigned mark = get_adr_mark(graph, node);
+
+ if ((mark & (MARK_REF_ADR | MARK_REF_NON_ADR)) == MARK_REF_ADR) {
+ /*
+ * this node has not an reference mode, but is only
+ * referenced by address calculations
+ */
+ mark_preds = MARK_REF_ADR;
+ }
+ }
+
+ /* mark all predecessors */
+ for (i = 0, n = get_irn_arity(node); i < n; ++i) {
+ ir_node *pred = get_irn_n(node, i);
+
+ set_adr_mark(graph, pred, get_adr_mark(graph, pred) | mark_preds);
+ }
+}
+
+/**
+ * Called for every graph when the graph is either deleted or stat_finish()
+ * is called, must recalculate all statistic info.
+ *
+ * @param global The global entry
+ * @param graph The current entry
+ */
+static void update_graph_stat(graph_entry_t *global, graph_entry_t *graph)
{
node_entry_t *entry;
/* set pessimistic values */
graph->is_leaf = 1;
+ graph->is_leaf_call = LCS_UNKNOWN;
graph->is_recursive = 0;
graph->is_chain_call = 1;
compute_doms(graph->irg);
/* count the nodes in the graph */
- irg_walk_graph(graph->irg, count_nodes, NULL, graph);
+ irg_walk_graph(graph->irg, update_node_stat, NULL, graph);
#if 0
entry = opcode_get_entry(op_Call, graph->opcode_hash);
/* 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;
+ /* count the number of address calculation */
+ if (graph->irg != get_const_code_irg()) {
+ ir_graph *rem = current_ir_graph;
- for (dumper = status->dumper; dumper; dumper = dumper->next) {
- if (dumper->finish)
- dumper->finish(dumper);
- }
-}
+ if (get_irg_outs_state(graph->irg) != outs_consistent)
+ compute_outs(graph->irg);
-/* ---------------------------------------------------------------------- */
+ /* Must be done an the outs graph */
+ current_ir_graph = graph->irg;
+ irg_out_walk(get_irg_start(graph->irg), NULL, mark_address_calc, graph);
+ current_ir_graph = rem;
-/**
- * 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);
+#if 0
+ set_dump_node_vcgattr_hook(stat_adr_mark_hook);
+ dump_ir_block_graph(graph->irg, "-adr");
+ set_dump_node_vcgattr_hook(NULL);
+#endif
}
- 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);
+ /* count the DAG's */
+ if (status->stat_options & FIRMSTAT_COUNT_DAG)
+ count_dags_in_graph(global, graph);
- if (entry) {
- fprintf(dmp->f, "\n%s:\n", opt_names[index]);
- fprintf(dmp->f, "%-16s %-8s\n", "Opcode", "deref");
+ /* calculate the patterns of this graph */
+ stat_calc_pattern_history(graph->irg);
- for (; entry; entry = pset_next(set)) {
- fprintf(dmp->f, "%-16s %8d\n",
- get_id_str(entry->op->name), entry->count.cnt[0]);
- }
+ /* leaf function did not call others */
+ if (graph->is_leaf)
+ graph->is_leaf_call = LCS_NON_LEAF_CALL;
+ else if (graph->is_leaf_call == LCS_UNKNOWN) {
+ /* we still don't know if this graph calls leaf-functions, so enqueue */
+ pdeq_putl(status->wait_q, graph);
}
-}
-/**
- * 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]);
+ /* we have analyzed this graph */
+ graph->is_analyzed = 1;
}
/**
- * dumps the IRG
+ * Called for every graph that was on the wait_q in stat_finish()
+ * must finish all statistic info calculations.
+ *
+ * @param global The global entry
+ * @param graph The current entry
*/
-static void simple_dump_graph(dumper_t *dmp, graph_entry_t *entry)
+static void update_graph_stat_2(graph_entry_t *global, graph_entry_t *graph)
{
- int dump_opts = 1;
- block_entry_t *b_entry;
-
- 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:\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_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;
+ if (graph->is_deleted) {
+ /* deleted, ignore */
+ return;
}
- simple_dump_opcode_hash(dmp, entry->opcode_hash);
- simple_dump_edges(dmp, &entry->cnt_edges);
-
- /* effects of optimizations */
- if (dump_opts) {
- int i;
+ if (graph->irg) {
+ /* count the nodes in the graph */
+ irg_walk_graph(graph->irg, update_node_stat_2, NULL, graph);
- 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]
- );
- }
+ if (graph->is_leaf_call == LCS_UNKNOWN)
+ graph->is_leaf_call = LCS_LEAF_CALL;
}
}
/**
- * initialise the simple dumper
+ * register a dumper
*/
-static void simple_init(dumper_t *dmp, const char *name)
+static void stat_register_dumper(const dumper_t *dumper)
{
- char fname[2048];
+ dumper_t *p = xmalloc(sizeof(*p));
- snprintf(fname, sizeof(fname), "%s.txt", name);
- dmp->f = fopen(fname, "w");
-}
+ if (p) {
+ *p = *dumper;
-/**
- * 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,
-};
+ p->next = status->dumper;
+ p->status = status;
+ status->dumper = p;
+ }
-/* ---------------------------------------------------------------------- */
+ /* FIXME: memory leak */
+}
/**
- * count the nodes as needed:
- *
- * 1 normal (data) Phi's
- * 2 memory Phi's
- * 3 Proj
- * 0 all other nodes
+ * dumps an irg
*/
-static void csv_count_nodes(graph_entry_t *graph, counter_t cnt[])
+static void stat_dump_graph(graph_entry_t *entry)
{
- node_entry_t *entry;
- int i;
-
- for (i = 0; i < 4; ++i)
- cnt_clr(&cnt[i]);
+ dumper_t *dumper;
- 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);
- }
+ for (dumper = status->dumper; dumper; dumper = dumper->next) {
+ if (dumper->dump_graph)
+ dumper->dump_graph(dumper, entry);
}
}
/**
- * dumps the IRG
+ * initialize the dumper
*/
-static void csv_dump_graph(dumper_t *dmp, graph_entry_t *entry)
+static void stat_dump_init(const char *name)
{
- const char *name;
-
- counter_t cnt[4];
-
- if (entry->irg && !entry->is_deleted) {
- ir_graph *const_irg = get_const_code_irg();
-
- 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);
+ dumper_t *dumper;
- 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]
- );
+ for (dumper = status->dumper; dumper; dumper = dumper->next) {
+ if (dumper->init)
+ dumper->init(dumper, name);
}
}
/**
- * initialise the simple dumper
+ * finish the dumper
*/
-static void csv_init(dumper_t *dmp, const char *name)
+static void stat_dump_finish(void)
{
- char fname[2048];
-
- snprintf(fname, sizeof(fname), "%s.csv", name);
- dmp->f = fopen(fname, "a");
-}
+ dumper_t *dumper;
-/**
- * finishes the simple dumper
- */
-static void csv_finish(dumper_t *dmp)
-{
- fclose(dmp->f);
- dmp->f = NULL;
+ for (dumper = status->dumper; dumper; dumper = dumper->next) {
+ if (dumper->finish)
+ dumper->finish(dumper);
+ }
}
-/**
- * the simple human readable dumper
- */
-static dumper_t csv_dumper = {
- csv_dump_graph,
- csv_init,
- csv_finish,
- NULL,
- NULL,
-};
-
-
/* ---------------------------------------------------------------------- */
/*
{
#define X(a) a, sizeof(a)-1
- int pseudo_id = 0;
-
/* enable statistics */
- status->enable = enable_options & FIRMSTAT_ENABLED;
+ status->stat_options = enable_options & FIRMSTAT_ENABLED ? enable_options : 0;
- if (! status->enable)
+ if (! status->stat_options)
return;
obstack_init(&status->cnts);
- /* build the pseudo-ops */
- _op_Phi0.code = --pseudo_id;
- _op_Phi0.name = new_id_from_chars(X("Phi0"));
+ /* create the hash-tables */
+ status->irg_hash = new_pset(graph_cmp, 8);
+ status->ir_op_hash = new_pset(opcode_cmp_2, 1);
- _op_PhiM.code = --pseudo_id;
- _op_PhiM.name = new_id_from_chars(X("PhiM"));
+ /* create the wait queue */
+ status->wait_q = new_pdeq();
- _op_MulC.code = --pseudo_id;
- _op_MulC.name = new_id_from_chars(X("MulC"));
+ if (enable_options & FIRMSTAT_COUNT_STRONG_OP) {
+ /* build the pseudo-ops */
+ _op_Phi0.code = get_next_ir_opcode();
+ _op_Phi0.name = new_id_from_chars(X("Phi0"));
- _op_DivC.code = --pseudo_id;
- _op_DivC.name = new_id_from_chars(X("DivC"));
+ _op_PhiM.code = get_next_ir_opcode();
+ _op_PhiM.name = new_id_from_chars(X("PhiM"));
- _op_ModC.code = --pseudo_id;
- _op_ModC.name = new_id_from_chars(X("ModC"));
+ _op_ProjM.code = get_next_ir_opcode();
+ _op_ProjM.name = new_id_from_chars(X("ProjM"));
- _op_DivModC.code = --pseudo_id;
- _op_DivModC.name = new_id_from_chars(X("DivModC"));
+ _op_MulC.code = get_next_ir_opcode();
+ _op_MulC.name = new_id_from_chars(X("MulC"));
- /* create the hash-tables */
- status->irg_hash = new_pset(graph_cmp, 8);
- status->ir_op_hash = new_pset(opcode_cmp_2, 1);
+ _op_DivC.code = get_next_ir_opcode();
+ _op_DivC.name = new_id_from_chars(X("DivC"));
- status->op_Phi0 = &_op_Phi0;
- status->op_PhiM = &_op_PhiM;
+ _op_ModC.code = get_next_ir_opcode();
+ _op_ModC.name = new_id_from_chars(X("ModC"));
- if (enable_options & FIRMSTAT_COUNT_STRONG_OP) {
+ _op_DivModC.code = get_next_ir_opcode();
+ _op_DivModC.name = new_id_from_chars(X("DivModC"));
+
+ status->op_Phi0 = &_op_Phi0;
+ status->op_PhiM = &_op_PhiM;
+ status->op_ProjM = &_op_ProjM;
status->op_MulC = &_op_MulC;
status->op_DivC = &_op_DivC;
status->op_ModC = &_op_ModC;
status->op_DivModC = &_op_DivModC;
}
else {
+ status->op_Phi0 = NULL;
+ status->op_PhiM = NULL;
+ status->op_ProjM = NULL;
status->op_MulC = NULL;
status->op_DivC = NULL;
status->op_ModC = NULL;
status->op_DivModC = NULL;
}
+ /* register the dumper */
stat_register_dumper(&simple_dumper);
- stat_register_dumper(&csv_dumper);
+
+ if (enable_options & FIRMSTAT_CSV_OUTPUT)
+ stat_register_dumper(&csv_dumper);
/* initialize the pattern hash */
stat_init_pattern_history(enable_options & FIRMSTAT_PATTERN_ENABLED);
/* A new IR op is registered. */
void stat_new_ir_op(const ir_op *op)
{
- if (! status->enable)
+ if (! status->stat_options)
return;
STAT_ENTER;
/* An IR op is freed. */
void stat_free_ir_op(const ir_op *op)
{
- if (! status->enable)
+ if (! status->stat_options)
return;
STAT_ENTER;
/* A new node is created. */
void stat_new_node(ir_node *node)
{
- if (! status->enable)
+ if (! status->stat_options)
return;
/* do NOT count during dead node elimination */
/* A node is changed into a Id node */
void stat_turn_into_id(ir_node *node)
{
- if (! status->enable)
+ if (! status->stat_options)
return;
STAT_ENTER;
/* A new graph was created */
void stat_new_graph(ir_graph *irg, entity *ent)
{
- if (! status->enable)
+ if (! status->stat_options)
return;
STAT_ENTER;
graph->ent = ent;
graph->is_deleted = 0;
graph->is_leaf = 0;
+ graph->is_leaf_call = 0;
graph->is_recursive = 0;
graph->is_chain_call = 0;
+ graph->is_analyzed = 0;
}
STAT_LEAVE;
}
/*
- * A graph was deleted
+ * A graph will be deleted
*/
void stat_free_graph(ir_graph *irg)
{
- if (! status->enable)
+ if (! status->stat_options)
return;
STAT_ENTER;
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);
+ if (status->stat_options & FIRMSTAT_COUNT_DELETED) {
+ /* count the nodes of the graph yet, it will be destroyed later */
+ update_graph_stat(global, graph);
+ }
}
STAT_LEAVE;
}
*/
void stat_irg_walk(ir_graph *irg, void *pre, void *post)
{
- if (! status->enable)
+ if (! status->stat_options)
return;
STAT_ENTER_SINGLE;
*/
void stat_irg_block_walk(ir_graph *irg, const ir_node *node, void *pre, void *post)
{
- if (! status->enable)
+ if (! status->stat_options)
return;
STAT_ENTER_SINGLE;
ir_node **old_node_array, int old_num_entries,
stat_opt_kind opt)
{
- if (! status->enable)
+ if (! status->stat_options)
return;
STAT_ENTER;
*/
void stat_reassociate(int flag)
{
- if (! status->enable)
+ if (! status->stat_options)
return;
STAT_ENTER;
*/
void stat_lower(ir_node *node)
{
- if (! status->enable)
+ if (! status->stat_options)
return;
STAT_ENTER;
*/
void stat_inline(ir_node *call, ir_graph *called_irg)
{
- if (! status->enable)
+ if (! status->stat_options)
return;
STAT_ENTER;
*/
void stat_tail_rec(ir_graph *irg)
{
- if (! status->enable)
+ if (! status->stat_options)
return;
STAT_ENTER;
*/
void stat_strength_red(ir_graph *irg, ir_node *strong, ir_node *cmp)
{
- if (! status->enable)
+ if (! status->stat_options)
return;
STAT_ENTER;
*/
void stat_dead_node_elim_start(ir_graph *irg)
{
- if (! status->enable)
+ if (! status->stat_options)
return;
++status->in_dead_node_elim;
*/
void stat_dead_node_elim_stop(ir_graph *irg)
{
- if (! status->enable)
+ if (! status->stat_options)
return;
--status->in_dead_node_elim;
*/
void stat_arch_dep_replace_mul_with_shifts(ir_node *mul)
{
- if (! status->enable)
+ if (! status->stat_options)
return;
STAT_ENTER;
*/
void stat_arch_dep_replace_div_by_const(ir_node *div)
{
- if (! status->enable)
+ if (! status->stat_options)
return;
STAT_ENTER;
*/
void stat_arch_dep_replace_mod_by_const(ir_node *mod)
{
- if (! status->enable)
+ if (! status->stat_options)
return;
STAT_ENTER;
*/
void stat_arch_dep_replace_DivMod_by_const(ir_node *divmod)
{
- if (! status->enable)
+ if (! status->stat_options)
return;
STAT_ENTER;
/* Finish the statistics */
void stat_finish(const char *name)
{
- if (! status->enable)
+ if (! status->stat_options)
return;
STAT_ENTER;
graph_entry_t *entry;
graph_entry_t *global = graph_get_entry(NULL, status->irg_hash);
- dump_init(name);
+ stat_dump_init(name);
- /* dump per graph */
+ /* calculate the graph statistics */
for (entry = pset_first(status->irg_hash); entry; entry = pset_next(status->irg_hash)) {
if (entry->irg == NULL) {
if (! entry->is_deleted) {
/* the graph is still alive, count the nodes on it */
- count_nodes_in_graph(global, entry);
+ update_graph_stat(global, entry);
+ }
+ }
+
+ /* some calculations are dependent, we pushed them on the wait_q */
+ while (! pdeq_empty(status->wait_q)) {
+ entry = pdeq_getr(status->wait_q);
+
+ update_graph_stat_2(global, entry);
+ }
- /* count the DAG's */
-// count_dags_in_graph(global, entry);
- /* calculate the pattern */
- stat_calc_pattern_history(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;
}
- dump_graph(entry);
+ if (! entry->is_deleted || status->stat_options & FIRMSTAT_COUNT_DELETED)
+ stat_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);
+ if (! entry->is_deleted) {
+ /* clear the counter that are not accumulated */
+ graph_clear_entry(entry, 0);
+ }
}
/* dump global */
- dump_graph(global);
- dump_finish();
+ stat_dump_graph(global);
+ stat_dump_finish();
stat_finish_pattern_history();
for (entry = pset_first(global->opcode_hash); entry; entry = pset_next(global->opcode_hash)) {
opcode_clear_entry(entry);
}
- graph_clear_entry(global);
+ /* clear all global counter */
+ graph_clear_entry(global, 1);
}
/* finished */
-// status->enable = 0;
+// status->stat_options = 0;
}
STAT_LEAVE;
}
projects / libfirm / blobdiff