"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",
"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;
/* ---------------------------------------------------------------------------------- */
{
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_got_inlined);
+ cnt_clr(&elem->cnt_strength_red);
cnt_clr(&elem->cnt_edges);
}
* 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;
}
}
}
+/**
+ * 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 */
+ {
+ 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);
}
/**
cnt_clr(&entry->cnt_alive);
}
+ /* set pessimistic values */
+ graph->is_leaf = 1;
+ graph->is_recursive = 0;
+ graph->is_chain_call = 1;
+
+ /* we need dominance info */
+ if (graph->irg != get_const_code_irg())
+ 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);
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 {
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) {
_op_PhiM.code = --pseudo_id;
_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->ir_op_hash = new_pset(opcode_cmp_2, 1);
status->op_Phi0 = &_op_Phi0;
status->op_PhiM = &_op_PhiM;
+ 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);
}
/* 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);
+// 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 */
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_with_shifts(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_with_shifts(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_with_shifts(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(const char *name)
{
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);
+// count_dags_in_graph(global, entry);
/* calculate the pattern */
stat_calc_pattern_history(entry->irg);
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) {}
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_with_shifts(ir_node *div) {}
+
+void stat_arch_dep_replace_mod_with_shifts(ir_node *mod) {}
+
+void stat_arch_dep_replace_DivMod_with_shifts(ir_node *divmod) {}
+
#endif