#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"
/** 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
*/
key.irg = irg;
- elem = pset_find(set, &key, irg_hash(irg));
+ elem = pset_find(set, &key, HASH_PTR(irg));
if (elem)
return elem;
/* 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));
}
/**
{
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);
*/
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 colabse later
+ * so do not count this call.
+ * This happens in dead code.
+ */
+ if (is_Bad(block))
+ return;
cnt_inc(&graph->cnt_all_calls);
- /* found a call, is not a leaf function */
+ /* 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 */
+ /* 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 colabse 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;
}
/**
count_block_info(node, graph);
/* check for properties that depends on calls like recursion/leaf/indirect call */
- if (get_irn_op(node) == op_Call)
+ if (op == op_Call)
update_call_stat(node, graph);
}
/**
- * called for every graph when the graph is either deleted or stat_finish
- * is called, must recalculate all statistic info
+ * walker for reachable nodes count for graphs on teh 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)
+ update_call_stat_2(node, graph);
+}
+
+/**
+ * get the current address mark
+ */
+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)
{
/* set pessimistic values */
graph->is_leaf = 1;
+ graph->is_leaf_call = LCS_UNKNOWN;
graph->is_recursive = 0;
graph->is_chain_call = 1;
/* update the edge counter */
cnt_add(&global->cnt_edges, &graph->cnt_edges);
+
+ /* count the number of address calculation */
+ if (graph->irg != get_const_code_irg()) {
+ ir_graph *rem = current_ir_graph;
+
+ 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;
+
+#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
+ }
+
+ /* count the DAG's */
+ if (status->stat_options & FIRMSTAT_COUNT_DAG)
+ count_dags_in_graph(global, graph);
+
+ /* calculate the patterns of this graph */
+ stat_calc_pattern_history(graph->irg);
+
+ /* 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);
+ }
+
+ /* we have analyzed this graph */
+ graph->is_analyzed = 1;
+}
+
+/**
+ * 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 update_graph_stat_2(graph_entry_t *global, graph_entry_t *graph)
+{
+ if (graph->is_deleted) {
+ /* deleted, ignore */
+ return;
+ }
+
+ if (graph->irg) {
+ /* count the nodes in the graph */
+ irg_walk_graph(graph->irg, update_node_stat_2, NULL, graph);
+
+ if (graph->is_leaf_call == LCS_UNKNOWN)
+ graph->is_leaf_call = LCS_LEAF_CALL;
+ }
}
/**
/**
* dumps an irg
*/
-static void dump_graph(graph_entry_t *entry)
+static void stat_dump_graph(graph_entry_t *entry)
{
dumper_t *dumper;
/**
* initialise the dumper
*/
-static void dump_init(const char *name)
+static void stat_dump_init(const char *name)
{
dumper_t *dumper;
/**
* finish the dumper
*/
-static void dump_finish(void)
+static void stat_dump_finish(void)
{
dumper_t *dumper;
{
#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;
/* 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;
}
*/
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 */
- update_graph_stat(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 */
update_graph_stat(global, entry);
+ }
+ }
+
+ /* some calculations are dependant, 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 that are not accumulated */
- graph_clear_entry(entry, 0);
+ 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();
}
/* finished */
-// status->enable = 0;
+// status->stat_options = 0;
}
STAT_LEAVE;
}
projects / libfirm / blobdiff