/**
* Compare two elements of the opcode hash.
*/
-static int opcode_cmp(const void *elt, const void *key)
-{
+static int opcode_cmp(const void *elt, const void *key) {
const node_entry_t *e1 = elt;
const node_entry_t *e2 = key;
return e1->op->code - e2->op->code;
-} /* opcode_cmp */
+} /* opcode_cmp */
/**
* Compare two elements of the graph hash.
*/
-static int graph_cmp(const void *elt, const void *key)
-{
+static int graph_cmp(const void *elt, const void *key) {
const graph_entry_t *e1 = elt;
const graph_entry_t *e2 = key;
return e1->irg != e2->irg;
-} /* graph_cmp */
+} /* graph_cmp */
/**
* Compare two elements of the optimization hash.
*/
-static int opt_cmp(const void *elt, const void *key)
-{
+static int opt_cmp(const void *elt, const void *key) {
const opt_entry_t *e1 = elt;
const opt_entry_t *e2 = key;
return e1->op->code != e2->op->code;
-} /* opt_cmp */
+} /* opt_cmp */
/**
* Compare two elements of the block/extbb hash.
*/
-static int block_cmp(const void *elt, const void *key)
-{
+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;
-} /* block_cmp */
+} /* block_cmp */
/**
* Compare two elements of the be_block hash.
*/
-static int be_block_cmp(const void *elt, const void *key)
-{
+static int be_block_cmp(const void *elt, const void *key) {
const be_block_entry_t *e1 = elt;
const be_block_entry_t *e2 = key;
return e1->block_nr != e2->block_nr;
-} /* be_block_cmp */
+} /* be_block_cmp */
/**
* Compare two elements of reg pressure hash.
*/
-static int reg_pressure_cmp(const void *elt, const void *key)
-{
+static int reg_pressure_cmp(const void *elt, const void *key) {
const reg_pressure_entry_t *e1 = elt;
const reg_pressure_entry_t *e2 = key;
return e1->class_name != e2->class_name;
-} /* reg_pressure_cmp */
+} /* reg_pressure_cmp */
/**
* Compare two elements of the perm_stat hash.
*/
-static int perm_stat_cmp(const void *elt, const void *key)
-{
+static int perm_stat_cmp(const void *elt, const void *key) {
const perm_stat_entry_t *e1 = elt;
const perm_stat_entry_t *e2 = key;
return e1->perm != e2->perm;
-} /* perm_stat_cmp */
+} /* perm_stat_cmp */
/**
* Compare two elements of the perm_class hash.
*/
-static int perm_class_cmp(const void *elt, const void *key)
-{
+static int perm_class_cmp(const void *elt, const void *key) {
const perm_class_entry_t *e1 = elt;
const perm_class_entry_t *e2 = key;
return e1->class_name != e2->class_name;
-} /* perm_class_cmp */
+} /* perm_class_cmp */
/**
* Compare two elements of the ir_op hash.
*/
-static int opcode_cmp_2(const void *elt, const void *key)
-{
+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;
-} /* opcode_cmp_2 */
+} /* opcode_cmp_2 */
/**
* Compare two elements of the address_mark set.
*/
-static int address_mark_cmp(const void *elt, const void *key, size_t size)
-{
+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;
-} /* address_mark_cmp */
+} /* address_mark_cmp */
/**
* Clear all counter in a node_entry_t.
*/
-static void opcode_clear_entry(node_entry_t *elem)
-{
+static void opcode_clear_entry(node_entry_t *elem) {
cnt_clr(&elem->cnt_alive);
cnt_clr(&elem->new_node);
cnt_clr(&elem->into_Id);
-} /* opcode_clear_entry */
+} /* opcode_clear_entry */
/**
* Returns the associates node_entry_t for an ir_op
* @param op the IR operation
* @param hmap a hash map containing ir_op* -> node_entry_t*
*/
-static node_entry_t *opcode_get_entry(const ir_op *op, hmap_node_entry_t *hmap)
-{
+static node_entry_t *opcode_get_entry(const ir_op *op, hmap_node_entry_t *hmap) {
node_entry_t key;
node_entry_t *elem;
elem->op = op;
return pset_insert(hmap, elem, op->code);
-} /* opcode_get_entry */
+} /* opcode_get_entry */
/**
* Returns the associates ir_op for an opcode
* @param code the IR opcode
* @param hmap the hash map containing opcode -> ir_op*
*/
-static ir_op *opcode_find_entry(opcode code, hmap_ir_op *hmap)
-{
+static ir_op *opcode_find_entry(opcode code, hmap_ir_op *hmap) {
ir_op key;
key.code = code;
return pset_find(hmap, &key, code);
-} /* opcode_find_entry */
+} /* opcode_find_entry */
/**
- * clears all counter in a graph_entry_t
+ * Clears all counter in a graph_entry_t.
+ *
+ * @param elem the graph entry
+ * @param all if non-zero, clears all counters, else leave accumulated ones
*/
-static void graph_clear_entry(graph_entry_t *elem, int all)
-{
+static void graph_clear_entry(graph_entry_t *elem, int all) {
if (all) {
cnt_clr(&elem->cnt_walked);
cnt_clr(&elem->cnt_walked_blocks);
cnt_clr(&elem->cnt_all_calls);
cnt_clr(&elem->cnt_call_with_cnst_arg);
cnt_clr(&elem->cnt_indirect_calls);
+ cnt_clr(&elem->cnt_pure_adr_ops);
+ cnt_clr(&elem->cnt_all_adr_ops);
if (elem->block_hash) {
del_pset(elem->block_hash);
obstack_free(&elem->recalc_cnts, NULL);
obstack_init(&elem->recalc_cnts);
-} /* graph_clear_entry */
+} /* graph_clear_entry */
/**
* Returns the associated graph_entry_t for an IR graph.
elem->opt_hash[i] = new_pset(opt_cmp, 4);
return pset_insert(hmap, elem, HASH_PTR(irg));
-} /* graph_get_entry */
+} /* graph_get_entry */
/**
* Clear all counter in an opt_entry_t.
*/
-static void opt_clear_entry(opt_entry_t *elem)
-{
+static void opt_clear_entry(opt_entry_t *elem) {
cnt_clr(&elem->count);
-} /* opt_clear_entry */
+} /* opt_clear_entry */
/**
* Returns the associated opt_entry_t for an IR operation.
elem->op = op;
return pset_insert(hmap, elem, op->code);
-} /* opt_get_entry */
+} /* opt_get_entry */
/**
* clears all counter in a block_entry_t
*/
-static void block_clear_entry(block_entry_t *elem)
-{
+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);
cnt_clr(&elem->cnt_phi_data);
-}
+} /* block_clear_entry */
/**
* Returns the associated block_entry_t for an block.
elem->block_nr = block_nr;
return pset_insert(hmap, elem, block_nr);
-} /* block_get_entry */
+} /* block_get_entry */
/**
* Clear all sets in be_block_entry_t.
elem->reg_pressure = new_pset(reg_pressure_cmp, 5);
elem->sched_ready = stat_new_int_distrib_tbl();
elem->perm_class_stat = new_pset(perm_class_cmp, 5);
-} /* be_block_clear_entry */
+} /* be_block_clear_entry */
/**
* Returns the associated be_block_entry_t for an block.
elem->block_nr = block_nr;
return pset_insert(hmap, elem, block_nr);
-} /* be_block_get_entry */
+} /* be_block_get_entry */
/**
* clears all sets in perm_class_entry_t
del_pset(elem->perm_stat);
elem->perm_stat = new_pset(perm_stat_cmp, 5);
-}
+} /* perm_class_clear_entry */
/**
* Returns the associated perm_class entry for a register class.
elem->class_name = class_name;
return pset_insert(hmap, elem, HASH_PTR(class_name));
-} /* perm_class_get_entry */
+} /* perm_class_get_entry */
/**
* clears all sets in perm_stat_entry_t
elem->chains = stat_new_int_distrib_tbl();
elem->cycles = stat_new_int_distrib_tbl();
-} /* perm_stat_clear_entry */
+} /* perm_stat_clear_entry */
/**
* Returns the associated perm_stat entry for a perm.
elem->perm = perm;
return pset_insert(hmap, elem, HASH_PTR(perm));
-} /* perm_stat_get_entry */
+} /* perm_stat_get_entry */
/**
* Returns the ir_op for an IR-node,
} /* if */
return op;
-} /* stat_get_irn_op */
+} /* stat_get_irn_op */
/**
* update the block counter
cnt_inc(&b_entry_other->cnt_out_edges);
} /* if */
} /* for */
-} /* undate_block_info */
+} /* undate_block_info */
/**
* Update the extended block counter.
cnt_inc(&eb_entry_other->cnt_out_edges);
} /* if */
} /* for */
-} /* update_extbb_info */
+} /* update_extbb_info */
/** Calculates how many arguments of the call are const. */
-static int cnt_const_args(ir_node *call)
-{
+static int cnt_const_args(ir_node *call) {
int i, res = 0;
int n = get_Call_n_params(call);
++res;
} /* for */
return res;
-} /* cnt_const_args */
+} /* cnt_const_args */
/**
* Update info on calls.
if (num_const_args > 0)
cnt_inc(&graph->cnt_call_with_cnst_arg);
-} /* stat_update_call */
+} /* stat_update_call */
/**
* Update info on calls for graphs on the wait queue.
graph->is_leaf_call = LCS_NON_LEAF_CALL;
} else
graph->is_leaf_call = LCS_NON_LEAF_CALL;
-} /* stat_update_call_2 */
+} /* stat_update_call_2 */
/**
* Walker for reachable nodes count.
/* check for properties that depends on calls like recursion/leaf/indirect call */
stat_update_call(node, graph);
} /* if */
-} /* update_node_stat */
+} /* update_node_stat */
/**
* Walker for reachable nodes count for graphs on the wait_q.
*/
-static void update_node_stat_2(ir_node *node, void *env)
-{
+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 (is_Call(node))
stat_update_call_2(node, graph);
-} /* update_node_stat_2 */
+} /* update_node_stat_2 */
/**
* Get the current address mark.
*/
-static unsigned get_adr_mark(graph_entry_t *graph, ir_node *node)
-{
+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;
-} /* get_adr_mark */
+} /* get_adr_mark */
/**
* Set the current address mark.
*/
-static void set_adr_mark(graph_entry_t *graph, ir_node *node, unsigned val)
-{
+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;
-} /* set_adr_mark */
+} /* set_adr_mark */
-#if 0
+#undef DUMP_ADR_MODE
+
+#ifdef DUMP_ADR_MODE
/**
* 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
/* I know the color! */
return 1;
-} /* stat_adr_mark_hook */
-#endif
-
-/**
- * walker that marks every node that is an address calculation
+} /* stat_adr_mark_hook */
+#endif /* DUMP_ADR_MODE */
+
+/**
+ * Return the "operational" mode of a Firm node.
+ */
+static ir_mode *get_irn_op_mode(ir_node *node) {
+ switch (get_irn_opcode(node)) {
+ case iro_Load:
+ return get_Load_mode(node);
+ case iro_Store:
+ return get_irn_mode(get_Store_value(node));
+ case iro_DivMod:
+ return get_irn_mode(get_DivMod_left(node));
+ case iro_Div:
+ return get_irn_mode(get_Div_left(node));
+ case iro_Mod:
+ return get_irn_mode(get_Mod_left(node));
+ case iro_Cmp:
+ /* Cmp is no address calculation, or is it? */
+ default:
+ return get_irn_mode(node);
+ } /* switch */
+} /* get_irn_op_mode */
+
+/**
+ * Post-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.
+ * Users of a node must be visited first. We ensure this by
+ * calling it in the post of an outs walk. This should work even in cycles,
+ * while the normal pre-walk will not.
*/
-static void mark_address_calc(ir_node *node, void *env)
-{
+static void mark_address_calc(ir_node *node, void *env) {
graph_entry_t *graph = env;
- ir_mode *mode = get_irn_mode(node);
+ ir_mode *mode = get_irn_op_mode(node);
int i, n;
unsigned mark_preds = MARK_REF_NON_ADR;
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
- */
+ /*
+ * this node has no reference mode, but is only
+ * referenced by address calculations
+ */
mark_preds = MARK_REF_ADR;
} /* if */
} /* if */
for (i = 0, n = get_irn_arity(node); i < n; ++i) {
ir_node *pred = get_irn_n(node, i);
+ mode = get_irn_op_mode(pred);
+ if (! mode_is_numP(mode))
+ continue;
+
set_adr_mark(graph, pred, get_adr_mark(graph, pred) | mark_preds);
} /* for */
-} /* mark_address_calc */
+} /* mark_address_calc */
+
+/**
+ * Post-walker that marks every node that is an address calculation.
+ *
+ * Users of a node must be visited first. We ensure this by
+ * calling it in the post of an outs walk. This should work even in cycles,
+ * while the normal pre-walk will not.
+ */
+static void count_adr_ops(ir_node *node, void *env) {
+ graph_entry_t *graph = env;
+ unsigned mark = get_adr_mark(graph, node);
+
+ if (mark & MARK_ADDRESS_CALC)
+ cnt_inc(&graph->cnt_pure_adr_ops);
+ else if ((mark & (MARK_REF_ADR | MARK_REF_NON_ADR)) == MARK_REF_ADR)
+ cnt_inc(&graph->cnt_pure_adr_ops);
+ else if ((mark & (MARK_REF_ADR | MARK_REF_NON_ADR)) == (MARK_REF_ADR|MARK_REF_NON_ADR))
+ cnt_inc(&graph->cnt_all_adr_ops);
+} /* count_adr_ops */
/**
* Called for every graph when the graph is either deleted or stat_dump_snapshot()
irg_walk_graph(graph->irg, update_node_stat, NULL, graph);
#if 0
- /* Uncomment this code if chain-call means call exact one */
+ /* Uncomment this code if chain-call means call exact one. */
entry = opcode_get_entry(op_Call, graph->opcode_hash);
/* check if we have more than 1 call */
if (graph->irg != get_const_code_irg()) {
ir_graph *rem = current_ir_graph;
- if (get_irg_outs_state(graph->irg) != outs_consistent)
- compute_irg_outs(graph->irg);
+ assure_irg_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
+#ifdef DUMP_ADR_MODE
/* register the vcg hook and dump the graph for test */
set_dump_node_vcgattr_hook(stat_adr_mark_hook);
dump_ir_block_graph(graph->irg, "-adr");
set_dump_node_vcgattr_hook(NULL);
-#endif
+#endif /* DUMP_ADR_MODE */
+
+ irg_walk_graph(graph->irg, NULL, count_adr_ops, graph);
} /* if */
/* count the DAG's */
/* we have analyzed this graph */
graph->is_analyzed = 1;
-} /* update_graph_stat */
+} /* update_graph_stat */
/**
* Called for every graph that was on the wait_q in stat_dump_snapshot()
if (graph->is_leaf_call == LCS_UNKNOWN)
graph->is_leaf_call = LCS_LEAF_CALL;
} /* if */
-} /* update_graph_stat_2 */
+} /* update_graph_stat_2 */
/**
* Register a dumper.
*/
-static void stat_register_dumper(const dumper_t *dumper)
-{
+static void stat_register_dumper(const dumper_t *dumper) {
dumper_t *p = xmalloc(sizeof(*p));
if (p) {
}
/* FIXME: memory leak */
-} /* stat_register_dumper */
+} /* stat_register_dumper */
/**
* Dumps the statistics of an IR graph.
*/
-static void stat_dump_graph(graph_entry_t *entry)
-{
+static void stat_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);
} /* for */
-} /* stat_dump_graph */
+} /* stat_dump_graph */
/**
* Calls all registered dumper functions.
*/
-static void stat_dump_registered(graph_entry_t *entry)
-{
+static void stat_dump_registered(graph_entry_t *entry) {
dumper_t *dumper;
for (dumper = status->dumper; dumper; dumper = dumper->next) {
func(dumper, entry);
} /* if */
} /* for */
-} /* stat_dump_registered */
+} /* stat_dump_registered */
/**
* Dumps a constant table.
*/
-static void stat_dump_consts(const constant_info_t *tbl)
-{
+static void stat_dump_consts(const constant_info_t *tbl) {
dumper_t *dumper;
for (dumper = status->dumper; dumper; dumper = dumper->next) {
if (dumper->dump_const_tbl)
dumper->dump_const_tbl(dumper, tbl);
} /* for */
-} /* stat_dump_consts */
+} /* stat_dump_consts */
/**
* Initialize the dumper.
*/
-static void stat_dump_init(const char *name)
-{
+static void stat_dump_init(const char *name) {
dumper_t *dumper;
for (dumper = status->dumper; dumper; dumper = dumper->next) {
if (dumper->init)
dumper->init(dumper, name);
} /* for */
-} /* stat_dump_init */
+} /* stat_dump_init */
/**
* Finish the dumper.
*/
-static void stat_dump_finish(void)
-{
+static void stat_dump_finish(void) {
dumper_t *dumper;
for (dumper = status->dumper; dumper; dumper = dumper->next) {
if (dumper->finish)
dumper->finish(dumper);
} /* for */
-} /* stat_dump_finish */
+} /* stat_dump_finish */
/**
* Register an additional function for all dumper.
dumper->func_map = pset_new_ptr(3);
pset_insert_ptr(dumper->func_map, func);
} /* for */
-} /* stat_register_dumper_func */
+} /* stat_register_dumper_func */
/* ---------------------------------------------------------------------- */
/*
* Helper: get an ir_op from an opcode.
*/
-ir_op *stat_get_op_from_opcode(opcode code)
-{
+ir_op *stat_get_op_from_opcode(opcode code) {
return opcode_find_entry(code, status->ir_op_hash);
-} /* stat_get_op_from_opcode */
+} /* stat_get_op_from_opcode */
/**
* Hook: A new IR op is registered.
* @param ctx the hook context
* @param op the new IR opcode that was created.
*/
-static void stat_new_ir_op(void *ctx, ir_op *op)
-{
+static void stat_new_ir_op(void *ctx, ir_op *op) {
if (! status->stat_options)
return;
pset_insert(status->ir_op_hash, op, op->code);
}
STAT_LEAVE;
-} /* stat_new_ir_op */
+} /* stat_new_ir_op */
/**
* Hook: An IR op is freed.
* @param ctx the hook context
* @param op the IR opcode that is freed
*/
-static void stat_free_ir_op(void *ctx, ir_op *op)
-{
+static void stat_free_ir_op(void *ctx, ir_op *op) {
if (! status->stat_options)
return;
{
}
STAT_LEAVE;
-} /* stat_free_ir_op */
+} /* stat_free_ir_op */
/**
* Hook: A new node is created.
* @param irg the IR graph on which the node is created
* @param node the new IR node that was created
*/
-static void stat_new_node(void *ctx, ir_graph *irg, ir_node *node)
-{
+static void stat_new_node(void *ctx, ir_graph *irg, ir_node *node) {
if (! status->stat_options)
return;
cnt_inc(&entry->new_node);
}
STAT_LEAVE;
-} /* stat_new_node */
+} /* stat_new_node */
/**
* Hook: A node is changed into a Id node
* @param ctx the hook context
* @param node the IR node that will be turned into an ID
*/
-static void stat_turn_into_id(void *ctx, ir_node *node)
-{
+static void stat_turn_into_id(void *ctx, ir_node *node) {
if (! status->stat_options)
return;
cnt_inc(&entry->into_Id);
}
STAT_LEAVE;
-} /* stat_turn_into_id */
+} /* stat_turn_into_id */
/**
* Hook: A new graph was created
* @param irg the new IR graph that was created
* @param ent the entity of this graph
*/
-static void stat_new_graph(void *ctx, ir_graph *irg, entity *ent)
-{
+static void stat_new_graph(void *ctx, ir_graph *irg, entity *ent) {
if (! status->stat_options)
return;
graph->is_analyzed = 0;
}
STAT_LEAVE;
-} /* stat_new_graph */
+} /* stat_new_graph */
/**
* Hook: A graph will be deleted
* in our hash maps, only a flag is set which prevents this
* information from being changed, it's "frozen" from now.
*/
-static void stat_free_graph(void *ctx, ir_graph *irg)
-{
+static void stat_free_graph(void *ctx, ir_graph *irg) {
if (! status->stat_options)
return;
} /* if */
}
STAT_LEAVE;
-} /* stat_free_graph */
+} /* stat_free_graph */
/**
* Hook: A walk over a graph is initiated. Do not count walks from statistic code.
cnt_inc(&graph->cnt_walked);
}
STAT_LEAVE;
-} /* stat_irg_walk */
+} /* stat_irg_walk */
/**
* Hook: A walk over a graph in block-wise order is initiated. Do not count walks from statistic code.
{
/* for now, do NOT differentiate between blockwise and normal */
stat_irg_walk(ctx, irg, pre, post);
-} /* stat_irg_walk_blkwise */
+} /* stat_irg_walk_blkwise */
/**
* Hook: A walk over the graph's blocks is initiated. Do not count walks from statistic code.
cnt_inc(&graph->cnt_walked_blocks);
}
STAT_LEAVE;
-} /* stat_irg_block_walk */
+} /* stat_irg_block_walk */
/**
* Called for every node that is removed due to an optimization.
* @param n the IR node that will be removed
* @param hmap the hash map containing ir_op* -> opt_entry_t*
*/
-static void removed_due_opt(ir_node *n, hmap_opt_entry_t *hmap)
-{
+static void removed_due_opt(ir_node *n, hmap_opt_entry_t *hmap) {
ir_op *op = stat_get_irn_op(n);
opt_entry_t *entry = opt_get_entry(op, hmap);
/* increase global value */
cnt_inc(&entry->count);
-} /* removed_due_opt */
+} /* removed_due_opt */
/**
* Hook: Some nodes were optimized into some others due to an optimization.
} /* for */
}
STAT_LEAVE;
-} /* stat_merge_nodes */
+} /* stat_merge_nodes */
/**
* Hook: Reassociation is started/stopped.
* @param ctx the hook context
* @param flag if non-zero, reassociation is started else stopped
*/
-static void stat_reassociate(void *ctx, int flag)
-{
+static void stat_reassociate(void *ctx, int flag) {
if (! status->stat_options)
return;
status->reassoc_run = flag;
}
STAT_LEAVE;
-} /* stat_reassociate */
+} /* stat_reassociate */
/**
* Hook: A node was lowered into other nodes
* @param ctx the hook context
* @param node the IR node that will be lowered
*/
-static void stat_lower(void *ctx, ir_node *node)
-{
+static void stat_lower(void *ctx, ir_node *node) {
if (! status->stat_options)
return;
removed_due_opt(node, graph->opt_hash[HOOK_LOWERED]);
}
STAT_LEAVE;
-} /* stat_lower */
+} /* stat_lower */
/**
* Hook: A graph was inlined.
cnt_inc(&i_graph->cnt_was_inlined);
}
STAT_LEAVE;
-} /* stat_inline */
+} /* stat_inline */
/**
* Hook: A graph with tail-recursions was optimized.
*
* @param ctx the hook context
*/
-static void stat_tail_rec(void *ctx, ir_graph *irg, int n_calls)
-{
+static void stat_tail_rec(void *ctx, ir_graph *irg, int n_calls) {
if (! status->stat_options)
return;
graph->num_tail_recursion += n_calls;
}
STAT_LEAVE;
-} /* stat_tail_rec */
+} /* stat_tail_rec */
/**
* Strength reduction was performed on an iteration variable.
*
* @param ctx the hook context
*/
-static void stat_strength_red(void *ctx, ir_graph *irg, ir_node *strong)
-{
+static void stat_strength_red(void *ctx, ir_graph *irg, ir_node *strong) {
if (! status->stat_options)
return;
removed_due_opt(strong, graph->opt_hash[HOOK_OPT_STRENGTH_RED]);
}
STAT_LEAVE;
-} /* stat_strength_red */
+} /* stat_strength_red */
/**
* Hook: Start/Stop the dead node elimination.
*
* @param ctx the hook context
*/
-static void stat_dead_node_elim(void *ctx, ir_graph *irg, int start)
-{
+static void stat_dead_node_elim(void *ctx, ir_graph *irg, int start) {
if (! status->stat_options)
return;
++status->in_dead_node_elim;
else
--status->in_dead_node_elim;
-} /* stat_dead_node_elim */
+} /* stat_dead_node_elim */
/**
* Hook: if-conversion was tried.
cnt_inc(&graph->cnt_if_conv[reason]);
}
STAT_LEAVE;
-} /* stat_if_conversion */
+} /* stat_if_conversion */
/**
* Hook: real function call was optimized.
cnt_inc(&graph->cnt_real_func_call);
}
STAT_LEAVE;
-} /* stat_func_call */
+} /* stat_func_call */
/**
* Hook: A multiply was replaced by a series of Shifts/Adds/Subs.
*
* @param ctx the hook context
*/
-static void stat_arch_dep_replace_mul_with_shifts(void *ctx, ir_node *mul)
-{
+static void stat_arch_dep_replace_mul_with_shifts(void *ctx, ir_node *mul) {
if (! status->stat_options)
return;
removed_due_opt(mul, graph->opt_hash[HOOK_OPT_ARCH_DEP]);
}
STAT_LEAVE;
-} /* stat_arch_dep_replace_mul_with_shifts */
+} /* stat_arch_dep_replace_mul_with_shifts */
/**
* Hook: A division by const was replaced.
* @param ctx the hook context
* @param node the division node that will be optimized
*/
-static void stat_arch_dep_replace_division_by_const(void *ctx, ir_node *node)
-{
+static void stat_arch_dep_replace_division_by_const(void *ctx, ir_node *node) {
if (! status->stat_options)
return;
removed_due_opt(node, graph->opt_hash[HOOK_OPT_ARCH_DEP]);
}
STAT_LEAVE;
-} /* stat_arch_dep_replace_division_by_const */
+} /* stat_arch_dep_replace_division_by_const */
/*
* Update the register pressure of a block.
pset_insert(block_ent->reg_pressure, rp_ent, HASH_PTR(class_name));
}
STAT_LEAVE;
-} /* stat_be_block_regpressure */
+} /* stat_be_block_regpressure */
/**
* Update the distribution of ready nodes of a block
stat_inc_int_distrib_tbl(block_ent->sched_ready, num_ready);
}
STAT_LEAVE;
-} /* stat_be_block_sched_ready */
+} /* stat_be_block_sched_ready */
/**
* Update the permutation statistic of a block.
ps_ent->real_size = real_size;
}
STAT_LEAVE;
-} /* stat_be_block_stat_perm */
+} /* stat_be_block_stat_perm */
/**
* Update the permutation statistic of a single perm.
} /* if */
}
STAT_LEAVE;
-} /* stat_be_block_stat_permcycle */
+} /* stat_be_block_stat_permcycle */
/* Dumps a statistics snapshot. */
void stat_dump_snapshot(const char *name, const char *phase)
}
}
STAT_LEAVE;
-} /* stat_dump_snapshot */
+} /* stat_dump_snapshot */
/** the hook entries for the Firm statistics module */
static hook_entry_t stat_hooks[hook_last];
#undef HOOK
#undef X
-} /* firm_init_stat */
+} /* firm_init_stat */
/**
* Frees all dumper structures.
free(dumper);
dumper = next_dumper;
} /* for */
-} /* stat_term_dumper */
+} /* stat_term_dumper */
/* Terminates the statistics module, frees all memory. */
xfree(status);
status = (stat_info_t *)&status_disable;
}
-} /* stat_term */
+} /* stat_term */
/* returns 1 if statistics were initialized, 0 otherwise */
int stat_is_active(void) {
return status != (stat_info_t *)&status_disable;
-} /* stat_is_active */
+} /* stat_is_active */
#else
cnt_add(&f_alive, &entry->cnt_alive);
cnt_add(&f_new_node, &entry->new_node);
cnt_add(&f_Id, &entry->into_Id);
- }
+ } /* foreach_pset */
fprintf(dmp->f, "-------------------------------------------\n");
fprintf(dmp->f, "%-16s %8u %8u %8u\n", "Sum",
cnt_to_uint(&f_alive),
cnt_to_uint(&f_new_node),
cnt_to_uint(&f_Id)
);
-}
+} /* simple_dump_opcode_hash */
/**
* dumps an optimization hash into human readable form
foreach_pset(set, entry) {
fprintf(dmp->f, "%-16s %8u\n",
get_id_str(entry->op->name), cnt_to_uint(&entry->count));
- }
- }
-}
+ } /* foreach_pset */
+ } /* if */
+} /* simple_dump_opt_hash */
/**
* dumps the register pressure for each block and for each register class
foreach_pset(b_entry->reg_pressure, rp_entry)
fprintf(dmp->f, "%15d", rp_entry->pressure);
fprintf(dmp->f, "\n");
- }
-}
+ } /* for */
+} /* simple_dump_be_block_reg_pressure */
/** prints a distribution entry */
-static void simple_dump_distrib_entry(const distrib_entry_t *entry, void *env)
-{
+static void simple_dump_distrib_entry(const distrib_entry_t *entry, void *env) {
FILE *dmp_f = env;
fprintf(dmp_f, "%12d", cnt_to_uint(&entry->cnt));
-}
+} /* simple_dump_distrib_entry */
/**
* dumps the distribution of the amount of ready nodes for each block
stat_iterate_distrib_tbl(b_entry->sched_ready, simple_dump_distrib_entry, dmp->f);
fprintf(dmp->f, "%12.2lf", stat_calc_avg_distrib_tbl(b_entry->sched_ready));
fprintf(dmp->f, "\n");
- }
- }
-}
+ } /* foreach_pset */
+ } /* if */
+} /* simple_dump_be_block_sched_ready */
/**
* Adds the counter for given entry to another distribution table.
distrib_tbl_t *sum_tbl = env;
stat_add_int_distrib_tbl(sum_tbl, (int)(entry->object), &entry->cnt);
-}
+} /* add_distrib_entry */
/**
* dumps permutation statistics for one and block and one class
/* sum up distribution table for cycles */
stat_iterate_distrib_tbl(ps_ent->cycles, add_distrib_entry, sum_cycles);
- }
+ } /* foreach_pset */
/* print chain distribution for all perms of this class in this block */
fprintf(dmp->f, "chain distribution:\n");
snprintf(buf, sizeof(buf), "length %d", i);
fprintf(dmp->f, "%12s", buf);
stat_insert_int_distrib_tbl(sum_chains, i);
- }
+ } /* for */
fprintf(dmp->f, "\n");
stat_iterate_distrib_tbl(sum_chains, simple_dump_distrib_entry, dmp->f);
fprintf(dmp->f, "\n");
snprintf(buf, sizeof(buf), "length %d", i);
fprintf(dmp->f, "%12s", buf);
stat_insert_int_distrib_tbl(sum_cycles, i);
- }
+ } /* for */
fprintf(dmp->f, "\n");
stat_iterate_distrib_tbl(sum_cycles, simple_dump_distrib_entry, dmp->f);
fprintf(dmp->f, "\n");
stat_delete_distrib_tbl(sum_chains);
stat_delete_distrib_tbl(sum_cycles);
-}
+} /* simple_dump_be_block_permstat_class */
/**
* dumps statistics about perms
fprintf(dmp->f, "BLOCK %ld:\n", b_entry->block_nr);
- if (b_entry->perm_class_stat)
+ if (b_entry->perm_class_stat) {
foreach_pset(b_entry->perm_class_stat, pc_ent) {
fprintf(dmp->f, "register class %s:\n", pc_ent->class_name);
simple_dump_be_block_permstat_class(dmp, pc_ent);
- }
- }
+ } /* foreach_pset */
+ } /* if */
+ } /* foreach_pset */
fprintf(dmp->f, "PERMUTATION STATISTICS END\n");
- }
-}
+ } /* if */
+} /* simple_dump_be_block_permstat */
/**
* dumps the number of real_function_call optimization
if (! cnt_eq(cnt, 0)) {
fprintf(dmp->f, "\nReal Function Calls optimized:\n");
fprintf(dmp->f, "%-16s %8u\n", "Call", cnt_to_uint(cnt));
- }
-}
+ } /* if */
+} /* simple_dump_real_func_calls */
/**
* dumps the number of tail_recursion optimization
if (num_tail_recursion > 0) {
fprintf(dmp->f, "\nTail recursion optimized:\n");
fprintf(dmp->f, "%-16s %8u\n", "Call", num_tail_recursion);
- }
-}
+ } /* if */
+} /* simple_dump_tail_recursion */
/**
* dumps the edges count
return;
fprintf(dmp->f, "%-16s %8d\n", "Edges", cnt_to_uint(cnt));
-}
+} /* simple_dump_edges */
/**
* dumps the IRG
fprintf(dmp->f, "\nEntity %s, Irg %p", get_entity_ld_name(entry->ent), (void *)entry->irg);
else
fprintf(dmp->f, "\nIrg %p", (void *)entry->irg);
- }
+ } /* if */
fprintf(dmp->f, " %swalked %u over blocks %u:\n"
" was inlined : %u\n"
for (i = 0; i < sizeof(entry->cnt_if_conv)/sizeof(entry->cnt_if_conv[0]); ++i) {
fprintf(dmp->f, " %s : %u\n", if_conv_names[i], cnt_to_uint(&entry->cnt_if_conv[i]));
- }
- }
- else {
+ } /* for */
+ } else {
fprintf(dmp->f, "\nGlobals counts:\n");
fprintf(dmp->f, "--------------\n");
dump_opts = 0;
- }
+ } /* if */
+
+ /* address ops */
+ fprintf(dmp->f,
+ " pure address calculation ops: %u\n"
+ " all address calculation ops : %u\n",
+ cnt_to_uint(&entry->cnt_pure_adr_ops),
+ cnt_to_uint(&entry->cnt_all_adr_ops));
simple_dump_opcode_hash(dmp, entry->opcode_hash);
simple_dump_edges(dmp, &entry->cnt_edges);
for (i = 0; i < sizeof(entry->opt_hash)/sizeof(entry->opt_hash[0]); ++i) {
simple_dump_opt_hash(dmp, entry->opt_hash[i], i);
- }
+ } /* for */
/* dump block info */
fprintf(dmp->f, "\n%12s %12s %12s %12s %12s %12s %12s\n", "Block Nr", "Nodes", "intern E", "incoming E", "outgoing E", "Phi", "quot");
cnt_to_uint(&b_entry->cnt_phi_data),
cnt_to_dbl(&b_entry->cnt_edges) / cnt_to_dbl(&b_entry->cnt_nodes)
);
- }
+ } /* foreach_pset */
/* dump block reg pressure */
simple_dump_be_block_reg_pressure(dmp, entry);
cnt_to_uint(&eb_entry->cnt_phi_data),
cnt_to_dbl(&eb_entry->cnt_edges) / cnt_to_dbl(&eb_entry->cnt_nodes)
);
- }
- }
+ } /* foreach_pset */
+ } /* if */
}
-}
+} /* simple_dump_graph */
/**
- * dumps the IRG
+ * dumps the constant table
*/
static void simple_dump_const_tbl(dumper_t *dmp, const constant_info_t *tbl)
{
for (i = 0; i < ARR_SIZE(tbl->int_bits_count); ++i) {
fprintf(dmp->f, "%5d %12u\n", i + 1, cnt_to_uint(&tbl->int_bits_count[i]));
cnt_add(&sum, &tbl->int_bits_count[i]);
- }
+ } /* for */
fprintf(dmp->f, "-------------------------------\n");
fprintf(dmp->f, "\nFloating point constants classification\n");
for (i = 0; i < ARR_SIZE(tbl->floats); ++i) {
fprintf(dmp->f, "%-10s %12u\n", stat_fc_name(i), cnt_to_uint(&tbl->floats[i]));
cnt_add(&sum, &tbl->floats[i]);
- }
+ } /* for */
fprintf(dmp->f, "--------------------------------------\n");
fprintf(dmp->f, "other %12u\n", cnt_to_uint(&tbl->others));
fprintf(dmp->f, "-------------------------------\n");
fprintf(dmp->f, "sum %12u\n", cnt_to_uint(&sum));
-}
+} /* simple_dump_const_tbl */
/**
* initialize the simple dumper
*/
-static void simple_init(dumper_t *dmp, const char *name)
-{
+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");
if (! dmp->f) {
perror(fname);
- }
-}
+ } /* if */
+} /* simple_init */
/**
* finishes the simple dumper
*/
-static void simple_finish(dumper_t *dmp)
-{
+static void simple_finish(dumper_t *dmp) {
if (dmp->f)
fclose(dmp->f);
dmp->f = NULL;
-}
+} /* simple_finish */
/**
* the simple human readable dumper
if (entry->op == op_Phi) {
/* normal Phi */
cnt_add(&cnt[1], &entry->cnt_alive);
- }
- else if (entry->op == dmp->status->op_PhiM) {
+ } else if (entry->op == dmp->status->op_PhiM) {
/* memory Phi */
cnt_add(&cnt[2], &entry->cnt_alive);
- }
- else if (entry->op == op_Proj) {
+ } else if (entry->op == op_Proj) {
/* Proj */
cnt_add(&cnt[3], &entry->cnt_alive);
- }
- else {
+ } else {
/* all other nodes */
cnt_add(&cnt[0], &entry->cnt_alive);
- }
- }
-}
+ } /* if */
+ } /* foreach_pset */
+} /* csv_count_nodes */
/**
* dumps the IRG
if (entry->irg == const_irg) {
name = "<Const code Irg>";
return;
- }
- else {
+ } else {
if (entry->ent)
name = get_entity_name(entry->ent);
else
name = "<UNKNOWN IRG>";
- }
+ } /* if */
csv_count_nodes(dmp, entry, cnt);
cnt_to_uint(&cnt[2]),
cnt_to_uint(&cnt[3])
);
- }
-}
+ } /* if */
+} /* csv_dump_graph */
/**
* dumps the IRG
static void csv_dump_const_tbl(dumper_t *dmp, const constant_info_t *tbl)
{
/* FIXME: NYI */
-}
+} /* csv_dump_const_tbl */
/**
* initialize the simple dumper
dmp->f = fopen(fname, "a");
if (! dmp->f)
perror(fname);
-}
+} /* csv_init */
/**
* finishes the simple dumper
if (dmp->f)
fclose(dmp->f);
dmp->f = NULL;
-}
+} /* csv_finish */
/**
* the simple human readable dumper
projects / libfirm / commitdiff