"Tuple optimization",
"ID optimization",
"Constant evaluation",
+ "Common subexpression elimination",
"Strength reduction",
"Architecture dependant optimization",
+ "Reassociation optimization",
"Lowered",
};
}
}
+/**
+ * update info on calls
+ */
+static void count_call(ir_node *call, graph_entry_t *graph)
+{
+ ir_node *ptr = get_Call_ptr(call);
+ entity *ent = NULL;
+
+ /* found a call, is not a leaf function */
+ graph->is_leaf = 0;
+
+ if (get_irn_op(ptr) == op_SymConst) {
+ if (get_SymConst_kind(ptr) == symconst_addr_ent) {
+ /* ok, we seems to know the entity */
+ ent = get_SymConst_entity(ptr);
+
+ if (get_entity_irg(ent) == graph->irg)
+ graph->is_recursive = 1;
+ }
+ }
+
+ /* check, if it's a chain-call: Then, the call-block
+ * must dominate the end block. */
+ {
+ ir_node *curr = get_irg_end_block(graph->irg);
+ ir_node *block = get_nodes_block(call);
+ int depth = get_Block_dom_depth(block);
+
+ for (; curr != block && get_Block_dom_depth(curr) > depth;) {
+ curr = get_Block_idom(curr);
+
+ if (! curr || is_no_Block(curr))
+ break;
+ }
+
+ if (curr != block)
+ graph->is_chain_call = 0;
+ }
+}
+
/**
* walker for reachable nodes count
*/
/* count block edges */
count_block_info(node, graph);
+
+ /* check for leaf functions */
+ if (get_irn_op(node) == op_Call)
+ count_call(node, graph);
}
/**
cnt_clr(&entry->cnt_alive);
}
+ /* set pessimistic values */
+ graph->is_leaf = 1;
+ graph->is_recursive = 0;
+ graph->is_chain_call = 1;
+
+ /* we need dominator info */
+ if (graph->irg != get_const_code_irg())
+ if (get_irg_dom_state(graph->irg) != dom_consistent)
+ compute_doms(graph->irg);
+
/* count the nodes in the graph */
irg_walk_graph(graph->irg, count_nodes, NULL, graph);
+#if 0
+ entry = opcode_get_entry(op_Call, graph->opcode_hash);
+
+ /* check if we have more than 1 call */
+ if (cnt_gt(entry->cnt_alive, 1))
+ graph->is_chain_call = 0;
+#endif
+
+ /* recursive functions are never chain calls, leafs don't have calls */
+ if (graph->is_recursive || graph->is_leaf)
+ graph->is_chain_call = 0;
+
/* assume we walk every graph only ONCE, we could sum here the global count */
for (entry = pset_first(graph->opcode_hash); entry; entry = pset_next(graph->opcode_hash)) {
node_entry_t *g_entry = opcode_get_entry(entry->op, global->opcode_hash);
fprintf(dmp->f, "\nIrg %p", (void *)entry->irg);
}
- fprintf(dmp->f, " %swalked %d over blocks %d was inlined %d got inlined %d strength red %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_strength_red.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 && !entry->deleted) {
+ if (entry->irg && !entry->is_deleted) {
ir_graph *const_irg = get_const_code_irg();
if (entry->irg == const_irg) {
/* 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);
int i, j;
graph_entry_t *graph = graph_get_entry(current_ir_graph, status->irg_hash);
+ if (status->reassoc_run)
+ opt = STAT_OPT_REASSOC;
+
for (i = 0; i < old_num_entries; ++i) {
for (j = 0; j < new_num_entries; ++j)
if (old_node_array[i] == new_node_array[j])
STAT_LEAVE;
}
+/*
+ * reassociation started/stopped.
+ */
+void stat_reassociate(int flag)
+{
+ if (! status->enable)
+ return;
+
+ STAT_ENTER;
+ {
+ status->reassoc_run = flag;
+ }
+ STAT_LEAVE;
+}
+
/*
* A node was lowered into other nodes
*/
STAT_LEAVE;
}
+/**
+ * A division was replaced by a series of Shifts/Muls
+ */
+void stat_arch_dep_replace_div_by_const(ir_node *div)
+{
+ if (! status->enable)
+ return;
+
+ STAT_ENTER;
+ {
+ graph_entry_t *graph = graph_get_entry(current_ir_graph, status->irg_hash);
+ removed_due_opt(div, graph->opt_hash[STAT_OPT_ARCH_DEP]);
+ }
+ STAT_LEAVE;
+}
+
+/**
+ * A modulo was replaced by a series of Shifts/Muls
+ */
+void stat_arch_dep_replace_mod_by_const(ir_node *mod)
+{
+ if (! status->enable)
+ return;
+
+ STAT_ENTER;
+ {
+ graph_entry_t *graph = graph_get_entry(current_ir_graph, status->irg_hash);
+ removed_due_opt(mod, graph->opt_hash[STAT_OPT_ARCH_DEP]);
+ }
+ STAT_LEAVE;
+}
+
+/**
+ * A DivMod was replaced by a series of Shifts/Muls
+ */
+void stat_arch_dep_replace_DivMod_by_const(ir_node *divmod)
+{
+ if (! status->enable)
+ return;
+
+ STAT_ENTER;
+ {
+ graph_entry_t *graph = graph_get_entry(current_ir_graph, status->irg_hash);
+ removed_due_opt(divmod, graph->opt_hash[STAT_OPT_ARCH_DEP]);
+ }
+ STAT_LEAVE;
+}
+
/* Finish the statistics */
void stat_finish(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);
}
/* dump global */
-// dump_graph(global);
+ dump_graph(global);
dump_finish();
stat_finish_pattern_history();
ir_node **old_node_array, int old_num_entries,
stat_opt_kind opt) {}
+void stat_reassociate(int start) {}
+
void stat_lower(ir_node *node) {}
void stat_inline(ir_node *call, ir_graph *irg) {}
void stat_arch_dep_replace_mul_with_shifts(ir_node *mul) {}
+void stat_arch_dep_replace_div_by_const(ir_node *div) {}
+
+void stat_arch_dep_replace_mod_by_const(ir_node *mod) {}
+
+void stat_arch_dep_replace_DivMod_by_const(ir_node *divmod) {}
+
#endif
projects / libfirm / blobdiff