#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",
- "Strength reduction",
- "Lowered",
-};
+#include "stat_dmp.h"
/*
* need this to be static:
/**
* 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);
}
/**
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);
}
}
+/**
+ * update info on calls
+ */
+static void update_call_stat(ir_node *call, graph_entry_t *graph)
+{
+ ir_node *ptr = get_Call_ptr(call);
+ entity *ent = NULL;
+
+ cnt_inc(&graph->cnt_all_calls);
+
+ /* 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;
+ }
+ }
+ else {
+ /* indirect call */
+ cnt_inc(&graph->cnt_indirect_calls);
+ }
+
+ /* 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
*/
-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 properties that depends on calls like recursion/leaf/indirect call */
+ if (get_irn_op(node) == op_Call)
+ update_call_stat(node, graph);
}
/**
- * count all alive nodes and edges in a graph
+ * called for every graph when the graph is either deleted or stat_finish
+ * is called, must recalculate all statistic info
*/
-static void count_nodes_in_graph(graph_entry_t *global, graph_entry_t *graph)
+static void update_graph_stat(graph_entry_t *global, graph_entry_t *graph)
{
node_entry_t *entry;
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);
+ irg_walk_graph(graph->irg, update_node_stat, 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)) {
/**
* register a dumper
*/
-static void stat_register_dumper(dumper_t *dumper)
+static void stat_register_dumper(const dumper_t *dumper)
{
- dumper->next = status->dumper;
- status->dumper = dumper;
+ dumper_t *p = malloc(sizeof(*p));
+
+ if (p) {
+ *p = *dumper;
+
+ p->next = status->dumper;
+ p->status = status;
+ status->dumper = p;
+ }
+
+ /* FIXME: memory leak */
}
/**
}
}
-/* ---------------------------------------------------------------------- */
-
-/**
- * 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);
- }
- 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);
-
- if (entry) {
- fprintf(dmp->f, "\n%s:\n", opt_names[index]);
- fprintf(dmp->f, "%-16s %-8s\n", "Opcode", "deref");
-
- for (; entry; entry = pset_next(set)) {
- fprintf(dmp->f, "%-16s %8d\n",
- get_id_str(entry->op->name), entry->count.cnt[0]);
- }
- }
-}
-
-/**
- * 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]);
-}
-
-/**
- * dumps the IRG
- */
-static void simple_dump_graph(dumper_t *dmp, graph_entry_t *entry)
-{
- 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 was inlined %d got inlined %d strength red %d:\n",
- entry->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]
- );
- }
- else {
- fprintf(dmp->f, "\nGlobals counts:\n");
- fprintf(dmp->f, "--------------\n");
- dump_opts = 0;
- }
-
- simple_dump_opcode_hash(dmp, entry->opcode_hash);
- simple_dump_edges(dmp, &entry->cnt_edges);
-
- /* effects of optimizations */
- if (dump_opts) {
- int i;
-
- 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]
- );
- }
- }
-}
-
-/**
- * initialise the simple dumper
- */
-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");
-}
-
-/**
- * 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,
-};
-
-/* ---------------------------------------------------------------------- */
-
-/**
- * count the nodes as needed:
- *
- * 1 normal (data) Phi's
- * 2 memory Phi's
- * 3 Proj
- * 0 all other nodes
- */
-static void csv_count_nodes(graph_entry_t *graph, counter_t cnt[])
-{
- node_entry_t *entry;
- int i;
-
- for (i = 0; i < 4; ++i)
- cnt_clr(&cnt[i]);
-
- 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);
- }
- }
-}
-
-/**
- * dumps the IRG
- */
-static void csv_dump_graph(dumper_t *dmp, graph_entry_t *entry)
-{
- const char *name;
-
- counter_t cnt[4];
-
- if (entry->irg && !entry->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);
-
- 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]
- );
- }
-}
-
-/**
- * initialise the simple dumper
- */
-static void csv_init(dumper_t *dmp, const char *name)
-{
- char fname[2048];
-
- snprintf(fname, sizeof(fname), "%s.csv", name);
- dmp->f = fopen(fname, "a");
-}
-
-/**
- * finishes the simple dumper
- */
-static void csv_finish(dumper_t *dmp)
-{
- fclose(dmp->f);
- dmp->f = NULL;
-}
-
-/**
- * the simple human readable dumper
- */
-static dumper_t csv_dumper = {
- csv_dump_graph,
- csv_init,
- csv_finish,
- NULL,
- 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);
/* 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;
}
/*
- * A graph was deleted
+ * A graph will be deleted
*/
void stat_free_graph(ir_graph *irg)
{
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);
+ update_graph_stat(global, graph);
/* count the DAG's */
// count_dags_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
*/
--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_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);
+ update_graph_stat(global, entry);
/* count the DAG's */
// count_dags_in_graph(global, entry);
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);
+ /* clear the counter that are not accumulated */
+ graph_clear_entry(entry, 0);
}
/* dump global */
-// dump_graph(global);
+ dump_graph(global);
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 */
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_dead_node_elim_stop(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