X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fstat%2Ffirmstat.c;h=530bec4ebc58d16cb4053b81ab63a55c6f67c7cf;hb=6a768b09064c37b361871ba888213cdd5ed5a700;hp=243c5df5992d1277de8ab5d22e015844b2cb10ed;hpb=2242902f91d0f33b6a32fbbf4685105f48344de5;p=libfirm diff --git a/ir/stat/firmstat.c b/ir/stat/firmstat.c index 243c5df59..530bec4eb 100644 --- a/ir/stat/firmstat.c +++ b/ir/stat/firmstat.c @@ -13,119 +13,79 @@ # include "config.h" #endif -# include - -# include "irop_t.h" -# include "irnode_t.h" -# include "irgraph_t.h" -# include "pset.h" -# include "irprog.h" +#ifdef FIRM_STATISTICS #include -#include - -#undef obstack_chunk_alloc -#undef obstack_chunk_free -#define obstack_chunk_alloc malloc -#define obstack_chunk_free free -#include -#ifdef FIRM_STATISTICS +#ifdef HAVE_STDLIB_H +# include +#endif +#ifdef HAVE_STRING_H +# include +#endif -#include "firmstat.h" +#include "irouts.h" +#include "irdump.h" +#include "hashptr.h" +#include "firmstat_t.h" +#include "pattern.h" +#include "dags.h" +#include "stat_dmp.h" +#include "xmalloc.h" +#include "irhooks.h" /* - * 32 bit should be enough for now + * need this to be static: + * Special pseudo Opcodes that we need to count some interesting cases */ -#define STAT_CNT_NUM 1 -typedef struct _counter_t { - unsigned cnt[STAT_CNT_NUM]; -} counter_t; - -/* - * An entry for ir_nodes +/** + * The Phi0, a node that is created during SSA construction */ -typedef struct _node_entry_t { - counter_t new_node; /**< amount of new nodes for this entry */ - counter_t into_Id; /**< amount of nodes that turned into Id's for this entry */ - const ir_op *op; /**< the op for this entry */ -} node_entry_t; +static ir_op _op_Phi0; -/* - * An entry for ir_graphs - */ -typedef struct _graph_entry_t { - pset *opcode_hash; /**< hash map containing the opcode counter */ - counter_t walked; /**< walker walked over the graph */ - counter_t walked_blocks; /**< walker walked over the graph blocks */ - counter_t was_inlined; /**< number of times other graph were inlined */ - counter_t got_inlined; /**< number of times this graph was inlined */ - pset *opt_hash[STAT_OPT_MAX]; /**< hash maps containing opcode counter for optimizations */ - const ir_graph *irg; /**< the graph of this object */ - entity *ent; /**< the entity of this graph if one exists */ - int deleted; /**< set if this irg was deleted */ -} graph_entry_t; +/** The PhiM, just to count memory Phi's. */ +static ir_op _op_PhiM; -/** - * An entry for optimized ir_nodes - */ -typedef struct _opt_entry_t { - counter_t count; /**< optimization counter */ - const ir_op *op; /**< the op for this entry */ -} opt_entry_t; +/** The Mul by Const node. */ +static ir_op _op_MulC; -/** - * statistics info - */ -typedef struct _statistic_info_t { - struct obstack cnts; /**< obstack containing the counters */ - pset *opcode_hash; /**< hash map containing the opcode counter */ - pset *irg_hash; /**< hash map containing the counter for irgs */ - FILE *f; /**< outputfile */ - ir_op *op_Phi0; /**< needed pseudo op */ -} stat_info_t; +/** The Div by Const node. */ +static ir_op _op_DivC; -/* - * global status - */ -static stat_info_t _status, *status = &_status; +/** The Div by Const node. */ +static ir_op _op_ModC; -/** - * increase a counter - */ -static INLINE void cnt_inc(counter_t *cnt) -{ - int i; +/** The Div by Const node. */ +static ir_op _op_DivModC; - for (i = 0; i < STAT_CNT_NUM; ++i) { - if (++cnt->cnt[i]) - break; - } -} +/** The memory Proj node. */ +static ir_op _op_ProjM; -/** - * decreace a counter - */ -static INLINE void cnt_dec(counter_t *cnt) -{ - int i; +/** A Sel of a Sel */ +static ir_op _op_SelSel; - for (i = 0; i < STAT_CNT_NUM; ++i) { - if (--cnt->cnt[i] != -1) - break; - } -} +/** A Sel of a Sel of a Sel */ +static ir_op _op_SelSelSel; + +/* ---------------------------------------------------------------------------------- */ + +/** 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) /** - * set a counter to zero + * global status */ -static INLINE void cnt_clr(counter_t *cnt) -{ - memset(cnt->cnt, 0, sizeof(cnt->cnt)); -} +static const int status_disable = 0; +static stat_info_t *status = (stat_info_t *)&status_disable; -/* +/** * compare two elements of the opcode hash */ static int opcode_cmp(const void *elt, const void *key) @@ -136,7 +96,7 @@ static int opcode_cmp(const void *elt, const void *key) return e1->op->code - e2->op->code; } -/* +/** * compare two elements of the graph hash */ static int graph_cmp(const void *elt, const void *key) @@ -147,7 +107,7 @@ static int graph_cmp(const void *elt, const void *key) return e1->irg != e2->irg; } -/* +/** * compare two elements of the optimization hash */ static int opt_cmp(const void *elt, const void *key) @@ -158,43 +118,131 @@ static int opt_cmp(const void *elt, const void *key) return e1->op->code != e2->op->code; } +/** + * compare two elements of the block/extbb hash + */ +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; +} + +/** + * compare two elements of the ir_op hash + */ +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; +} + +/** + * 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 + */ +static void opcode_clear_entry(node_entry_t *elem) +{ + cnt_clr(&elem->cnt_alive); + cnt_clr(&elem->new_node); + cnt_clr(&elem->into_Id); +} + /** * 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, pset *set) +static node_entry_t *opcode_get_entry(const ir_op *op, hmap_node_entry_t *hmap) { node_entry_t key; node_entry_t *elem; key.op = op; - elem = pset_find(set, &key, op->code); + elem = pset_find(hmap, &key, op->code); if (elem) return elem; elem = obstack_alloc(&status->cnts, sizeof(*elem)); + memset(elem, 0, sizeof(*elem)); - /* clear new counter */ - cnt_clr(&elem->new_node); - cnt_clr(&elem->into_Id); + /* clear counter */ + opcode_clear_entry(elem); elem->op = op; - return pset_insert(set, elem, op->code); + return pset_insert(hmap, elem, op->code); } /** - * calculates a hash value for an irg + * Returns the associates ir_op for an opcode + * + * @param code the IR opcode + * @param hmap the hash map containing opcode -> ir_op* */ -static INLINE unsigned irg_hash(const ir_graph *irg) +static ir_op *opcode_find_entry(opcode code, hmap_ir_op *hmap) { - return (unsigned)irg; + ir_op key; + + key.code = code; + return pset_find(hmap, &key, code); } /** - * Returns the acssociates graph_entry_t for an irg + * clears all counter in a graph_entry_t */ -static graph_entry_t *graph_get_entry(const ir_graph *irg, pset *set) +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_was_inlined); + cnt_clr(&elem->cnt_got_inlined); + cnt_clr(&elem->cnt_strength_red); + cnt_clr(&elem->cnt_real_func_call); + } + cnt_clr(&elem->cnt_edges); + cnt_clr(&elem->cnt_all_calls); + cnt_clr(&elem->cnt_call_with_cnst_arg); + cnt_clr(&elem->cnt_indirect_calls); + + if (elem->block_hash) { + del_pset(elem->block_hash); + elem->block_hash = NULL; + } + + if (elem->extbb_hash) { + del_pset(elem->extbb_hash); + elem->extbb_hash = NULL; + } + + obstack_free(&elem->recalc_cnts, NULL); + obstack_init(&elem->recalc_cnts); +} + +/** + * Returns the associated graph_entry_t for an IR graph. + * + * @param irg the IR graph + * @param hmap the hash map containing ir_graph* -> graph_entry_t* + */ +static graph_entry_t *graph_get_entry(ir_graph *irg, hmap_graph_entry_t *hmap) { graph_entry_t key; graph_entry_t *elem; @@ -202,351 +250,1500 @@ static graph_entry_t *graph_get_entry(const ir_graph *irg, pset *set) key.irg = irg; - elem = pset_find(set, &key, irg_hash(irg)); + elem = pset_find(hmap, &key, HASH_PTR(irg)); if (elem) return elem; + /* allocate a new one */ elem = obstack_alloc(&status->cnts, sizeof(*elem)); + memset(elem, 0, sizeof(*elem)); + obstack_init(&elem->recalc_cnts); - cnt_clr(&elem->walked); - cnt_clr(&elem->walked_blocks); - cnt_clr(&elem->got_inlined); - cnt_clr(&elem->was_inlined); + /* clear counter */ + graph_clear_entry(elem, 1); /* new hash table for opcodes here */ elem->opcode_hash = new_pset(opcode_cmp, 5); + elem->address_mark = new_set(address_mark_cmp, 5); elem->irg = irg; + /* these hash tables are created on demand */ + elem->block_hash = NULL; + elem->extbb_hash = NULL; + 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(hmap, elem, HASH_PTR(irg)); } /** - * Returns the associates opt_entry_t for an ir_op + * clears all counter in an opt_entry_t */ -static opt_entry_t *opt_get_entry(const ir_op *op, pset *set) +static void opt_clear_entry(opt_entry_t *elem) +{ + cnt_clr(&elem->count); +} + +/** + * Returns the associated opt_entry_t for an IR operation. + * + * @param op the IR operation + * @param hmap the hash map containing ir_op* -> opt_entry_t* + */ +static opt_entry_t *opt_get_entry(const ir_op *op, hmap_opt_entry_t *hmap) { opt_entry_t key; opt_entry_t *elem; key.op = op; - elem = pset_find(set, &key, op->code); + elem = pset_find(hmap, &key, op->code); if (elem) return elem; elem = obstack_alloc(&status->cnts, sizeof(*elem)); + memset(elem, 0, sizeof(*elem)); /* clear new counter */ - cnt_clr(&elem->count); + opt_clear_entry(elem); elem->op = op; - return pset_insert(set, elem, op->code); + return pset_insert(hmap, elem, op->code); } -/* ---------------------------------------------------------------------- */ +/** + * clears all counter in a block_entry_t + */ +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); +} -/* initialize the statistics module. */ -void stat_init(void) +/** + * Returns the associated block_entry_t for an block. + * + * @param block_nr an IR block number + * @param hmap a hash map containing long -> block_entry_t + */ +static block_entry_t *block_get_entry(struct obstack *obst, long block_nr, hmap_block_entry_t *hmap) { - obstack_init(&status->cnts); + block_entry_t key; + block_entry_t *elem; - /* create the hash-tables */ - status->opcode_hash = new_pset(opcode_cmp, 8); - status->irg_hash = new_pset(graph_cmp, 8); + key.block_nr = block_nr; + + elem = pset_find(hmap, &key, block_nr); + if (elem) + return elem; + + elem = obstack_alloc(obst, sizeof(*elem)); + memset(elem, 0, sizeof(*elem)); + + /* clear new counter */ + block_clear_entry(elem); + + elem->block_nr = block_nr; - status->f = fopen("firmstat.txt", "w"); - status->op_Phi0 = NULL; + return pset_insert(hmap, elem, block_nr); } -/* A new IR op is registered. */ -void stat_new_ir_op(const ir_op *op) + +/** + * Returns the ir_op for an IR-node, + * handles special cases and return pseudo op codes. + * + * @param none an IR node + */ +static ir_op *stat_get_irn_op(ir_node *node) { - /* execute for side effect :-) */ - opcode_get_entry(op, status->opcode_hash); + ir_op *op = get_irn_op(node); + + if (op == op_Phi && get_irn_arity(node) == 0) { + /* special case, a Phi0 node, count on extra counter */ + op = status->op_Phi0 ? status->op_Phi0 : op; + } + 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 ? 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 == 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; + } + 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; + } + 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; + } + 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; + } + else if (op == op_Sel && get_irn_op(get_Sel_ptr(node)) == op_Sel) { + /* special case, a Sel of a Sel, count on extra counter */ + op = status->op_SelSel ? status->op_SelSel : op; + + if (get_irn_op(get_Sel_ptr(get_Sel_ptr(node))) == op_Sel) { + /* special case, a Sel of a Sel of a Sel, count on extra counter */ + op = status->op_SelSelSel ? status->op_SelSelSel : op; + } + } + + return op; } -/* An IR op is freed. */ -void stat_free_ir_op(const ir_op *op) +/** + * update the block counter + */ +static void undate_block_info(ir_node *node, graph_entry_t *graph) { + ir_op *op = get_irn_op(node); + ir_node *block; + block_entry_t *b_entry; + int i, arity; + + /* check for block */ + if (op == op_Block) { + arity = get_irn_arity(node); + b_entry = block_get_entry(&graph->recalc_cnts, get_irn_node_nr(node), graph->block_hash); + + /* count all incoming edges */ + for (i = 0; i < arity; ++i) { + ir_node *pred = get_irn_n(node, i); + ir_node *other_block = get_nodes_block(pred); + block_entry_t *b_entry_other = block_get_entry(&graph->recalc_cnts, get_irn_node_nr(other_block), graph->block_hash); + + cnt_inc(&b_entry->cnt_in_edges); /* an edge coming from another block */ + cnt_inc(&b_entry_other->cnt_out_edges); + } + return; + } + + block = get_nodes_block(node); + b_entry = block_get_entry(&graph->recalc_cnts, get_irn_node_nr(block), graph->block_hash); + + if (op == op_Phi && mode_is_datab(get_irn_mode(node))) { + /* count data Phi per block */ + cnt_inc(&b_entry->cnt_phi_data); + } + + /* we have a new node in our block */ + cnt_inc(&b_entry->cnt_nodes); + + /* don't count keep-alive edges */ + if (get_irn_op(node) == op_End) + return; + + arity = get_irn_arity(node); + + for (i = 0; i < arity; ++i) { + ir_node *pred = get_irn_n(node, i); + ir_node *other_block; + + other_block = get_nodes_block(pred); + + if (other_block == block) + cnt_inc(&b_entry->cnt_edges); /* a in block edge */ + else { + block_entry_t *b_entry_other = block_get_entry(&graph->recalc_cnts, get_irn_node_nr(other_block), graph->block_hash); + + cnt_inc(&b_entry->cnt_in_edges); /* an edge coming from another block */ + cnt_inc(&b_entry_other->cnt_out_edges); + } + } } -/* A new node is created. */ -void stat_new_node(const ir_node *node) +/** + * update the extended block counter + */ +static void undate_extbb_info(ir_node *node, graph_entry_t *graph) { - node_entry_t *entry; - graph_entry_t *graph; ir_op *op = get_irn_op(node); + ir_extblk *extbb; + extbb_entry_t *eb_entry; + int i, arity; + + /* check for block */ + if (op == op_Block) { + extbb = get_nodes_extbb(node); + arity = get_irn_arity(node); + eb_entry = block_get_entry(&graph->recalc_cnts, get_extbb_node_nr(extbb), graph->extbb_hash); + + /* count all incoming edges */ + for (i = 0; i < arity; ++i) { + ir_node *pred = get_irn_n(node, i); + ir_extblk *other_extbb = get_nodes_extbb(pred); + + if (extbb != other_extbb) { + extbb_entry_t *eb_entry_other = block_get_entry(&graph->recalc_cnts, get_extbb_node_nr(other_extbb), graph->extbb_hash); + + cnt_inc(&eb_entry->cnt_in_edges); /* an edge coming from another extbb */ + cnt_inc(&eb_entry_other->cnt_out_edges); + } + } + return; + } - if (op->code == iro_Phi && get_irn_arity(node) == 0) { - /* special case, a Phi0 node, count on extra counter */ - if (! status->op_Phi0) { - ir_op *op_Phi = get_op_Phi(); + extbb = get_nodes_extbb(node); + eb_entry = block_get_entry(&graph->recalc_cnts, get_extbb_node_nr(extbb), graph->extbb_hash); + + if (op == op_Phi && mode_is_datab(get_irn_mode(node))) { + /* count data Phi per extbb */ + cnt_inc(&eb_entry->cnt_phi_data); + } + + /* we have a new node in our block */ + cnt_inc(&eb_entry->cnt_nodes); - status->op_Phi0 = new_ir_op(0xFFFF, "Phi0", op_Phi->pinned, op_Phi->flags, op_Phi->opar, op_Phi->op_index, op_Phi->attr_size); + /* don't count keep-alive edges */ + if (get_irn_op(node) == op_End) + return; + + arity = get_irn_arity(node); + + for (i = 0; i < arity; ++i) { + ir_node *pred = get_irn_n(node, i); + ir_extblk *other_extbb = get_nodes_extbb(pred); + + if (other_extbb == extbb) + cnt_inc(&eb_entry->cnt_edges); /* a in extbb edge */ + else { + extbb_entry_t *eb_entry_other = block_get_entry(&graph->recalc_cnts, get_extbb_node_nr(other_extbb), graph->extbb_hash); + + cnt_inc(&eb_entry->cnt_in_edges); /* an edge coming from another extbb */ + cnt_inc(&eb_entry_other->cnt_out_edges); } - op = status->op_Phi0; } +} - entry = opcode_get_entry(op, status->opcode_hash); - graph = graph_get_entry(current_ir_graph, status->irg_hash); +/** calculates how many arguments of the call are const */ +static int cnt_const_args(ir_node *call) +{ + int i, res = 0; + int n = get_Call_n_params(call); - /* increase global value */ - cnt_inc(&entry->new_node); + for (i = 0; i < n; ++i) { + ir_node *param = get_Call_param(call, i); + ir_op *op = get_irn_op(param); - /* increase local value */ - entry = opcode_get_entry(op, graph->opcode_hash); - cnt_inc(&entry->new_node); + if (op == op_Const || op == op_SymConst) + ++res; + } + return res; } -/* A node is changed into a Id node */ -void stat_turn_into_id(const ir_node *node) +/** + * update info on calls + * + * @param call The call + * @param graph The graph entry containing the call + */ +static void stat_update_call(ir_node *call, graph_entry_t *graph) { - node_entry_t *entry; - graph_entry_t *graph; - ir_op *op = get_irn_op(node); + ir_node *block = get_nodes_block(call); + ir_node *ptr = get_Call_ptr(call); + entity *ent = NULL; + ir_graph *callee = NULL; + int num_const_args; + + /* + * If the block is bad, the whole subgraph will collapse 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, 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); + + /* it is recursive, if it calls at least once */ + if (callee == graph->irg) + graph->is_recursive = 1; + } + } + else { + /* indirect call, be could not predict */ + cnt_inc(&graph->cnt_indirect_calls); - if (op->code == iro_Phi && get_irn_arity(node) == 0) { - /* special case, a Phi0 node, count on extra counter */ - if (! status->op_Phi0) { - ir_op *op_Phi = get_op_Phi(); + /* 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); + int depth = get_Block_dom_depth(block); - status->op_Phi0 = new_ir_op(0xFFFF, "Phi0", op_Phi->pinned, op_Phi->flags, op_Phi->opar, op_Phi->op_index, op_Phi->attr_size); + for (; curr != block && get_Block_dom_depth(curr) > depth;) { + curr = get_Block_idom(curr); + + if (! curr || is_no_Block(curr)) + break; } - op = status->op_Phi0; + + if (curr != block) + graph->is_chain_call = 0; } - entry = opcode_get_entry(op, status->opcode_hash); - graph = graph_get_entry(current_ir_graph, status->irg_hash); + /* check, if the callee is a leaf */ + if (callee) { + graph_entry_t *called = graph_get_entry(callee, status->irg_hash); - /* increase global value */ - cnt_inc(&entry->into_Id); + if (called->is_analyzed) { + if (! called->is_leaf) + graph->is_leaf_call = LCS_NON_LEAF_CALL; + } + } + + /* check, if arguments of the call are const */ + num_const_args = cnt_const_args(call); + + if (num_const_args > 0) + cnt_inc(&graph->cnt_call_with_cnst_arg); +} + +/** + * update info on calls for graphs on the wait queue + */ +static void stat_update_call_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 collapse 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; +} + +/** + * walker for reachable nodes count + */ +static void update_node_stat(ir_node *node, void *env) +{ + graph_entry_t *graph = env; + node_entry_t *entry; + + ir_op *op = stat_get_irn_op(node); + int arity = get_irn_arity(node); - /* increase local value */ entry = opcode_get_entry(op, graph->opcode_hash); - cnt_inc(&entry->into_Id); + + cnt_inc(&entry->cnt_alive); + cnt_add_i(&graph->cnt_edges, arity); + + /* count block edges */ + undate_block_info(node, graph); + + /* count extended block edges */ + if (status->stat_options & FIRMSTAT_COUNT_EXTBB) { + undate_extbb_info(node, graph); + } + + /* handle statistics for special node types */ + + if (op == op_Const) { + if (status->stat_options & FIRMSTAT_COUNT_CONSTS) { + /* check properties of constants */ + stat_update_const(status, node, graph); + } + } + else if (op == op_Call) { + /* check for properties that depends on calls like recursion/leaf/indirect call */ + stat_update_call(node, graph); + } } -/* A new graph was created */ -void stat_new_graph(const ir_graph *irg, entity *ent) +/** + * walker for reachable nodes count for graphs on the wait_q + */ +static void update_node_stat_2(ir_node *node, void *env) { - /* execute for side effect :-) */ - graph_entry_t * graph = graph_get_entry(irg, status->irg_hash); + graph_entry_t *graph = env; - graph->ent = ent; - graph->deleted = 0; + /* check for properties that depends on calls like recursion/leaf/indirect call */ + if (get_irn_op(node) == op_Call) + stat_update_call_2(node, graph); } -/* - * A graph was deleted +/** + * get the current address mark */ -void stat_free_graph(const ir_graph *irg) +static unsigned get_adr_mark(graph_entry_t *graph, ir_node *node) { - graph_entry_t * graph = graph_get_entry(irg, status->irg_hash); + address_mark_entry_t *value = set_find(graph->address_mark, &node, sizeof(*value), HASH_PTR(node)); - graph->deleted = 1; + return value ? value->mark : 0; } -/* - * A walk over a graph is initiated +/** + * 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. */ -void stat_irg_walk(const ir_graph *irg, void *pre, void *post) +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_dump_snapshot() + * 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) +{ + node_entry_t *entry; + + /* clear first the alive counter in the graph */ + for (entry = pset_first(graph->opcode_hash); entry; entry = pset_next(graph->opcode_hash)) { + cnt_clr(&entry->cnt_alive); + } + + /* set pessimistic values */ + graph->is_leaf = 1; + graph->is_leaf_call = LCS_UNKNOWN; + graph->is_recursive = 0; + graph->is_chain_call = 1; + + /* create new block counter */ + graph->block_hash = new_pset(block_cmp, 5); + + /* we need dominator info */ + if (graph->irg != get_const_code_irg()) + if (get_irg_dom_state(graph->irg) != dom_consistent) + compute_doms(graph->irg); - cnt_inc(&graph->walked); + if (status->stat_options & FIRMSTAT_COUNT_EXTBB) { + /* we need extended basic blocks */ + compute_extbb(graph->irg); + + /* create new extbb counter */ + graph->extbb_hash = new_pset(block_cmp, 5); + } + + /* count the nodes in the graph */ + irg_walk_graph(graph->irg, update_node_stat, NULL, graph); + +#if 0 + /* 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 (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); + + /* update the node counter */ + cnt_add(&g_entry->cnt_alive, &entry->cnt_alive); + } + + /* 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_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 + 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_dump_snapshot() + * 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; + } +} + +/** + * register a dumper + */ +static void stat_register_dumper(const dumper_t *dumper) +{ + dumper_t *p = xmalloc(sizeof(*p)); + + if (p) { + *p = *dumper; + + p->next = status->dumper; + p->status = status; + status->dumper = p; + } + + /* FIXME: memory leak */ +} + +/** + * dumps an IR graph. + */ +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); + } +} + +/** + * dumps a constant table + */ +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); + } +} + +/** + * initialize the dumper + */ +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); + } } +/** + * finish the dumper + */ +static void stat_dump_finish(void) +{ + dumper_t *dumper; + + for (dumper = status->dumper; dumper; dumper = dumper->next) { + if (dumper->finish) + dumper->finish(dumper); + } +} + +/* ---------------------------------------------------------------------- */ + /* - * A walk over the graph's blocks is initiated + * helper: get an ir_op from an opcode */ -void stat_irg_block_walk(const ir_graph *irg, const ir_node *node, void *pre, void *post) +ir_op *stat_get_op_from_opcode(opcode code) { - graph_entry_t *graph = graph_get_entry(irg, status->irg_hash); + return opcode_find_entry(code, status->ir_op_hash); +} + +/** + * 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) +{ + if (! status->stat_options) + return; + + STAT_ENTER; + { + graph_entry_t *graph = graph_get_entry(NULL, status->irg_hash); - cnt_inc(&graph->walked_blocks); + /* execute for side effect :-) */ + opcode_get_entry(op, graph->opcode_hash); + + pset_insert(status->ir_op_hash, op, op->code); + } + STAT_LEAVE; } /** - * called for every node that is removed due to an optimization + * An IR op is freed. + * + * @param ctx the hook context + * @param op the IR opcode that is freed */ -static void removed_due_opt(ir_node *n, pset *set) +static void stat_free_ir_op(void *ctx, ir_op *op) { - ir_op *op = get_irn_op(n); - opt_entry_t *entry = opt_get_entry(op, set); + if (! status->stat_options) + return; + + STAT_ENTER; + { + } + STAT_LEAVE; +} + +/** + * A new node is created. + * + * @param ctx the hook context + * @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) +{ + if (! status->stat_options) + return; + + /* do NOT count during dead node elimination */ + if (status->in_dead_node_elim > 0) + return; + + STAT_ENTER; + { + node_entry_t *entry; + graph_entry_t *graph; + ir_op *op = stat_get_irn_op(node); + + /* increase global value */ + graph = graph_get_entry(NULL, status->irg_hash); + entry = opcode_get_entry(op, graph->opcode_hash); + cnt_inc(&entry->new_node); + + /* increase local value */ + graph = graph_get_entry(current_ir_graph, status->irg_hash); + entry = opcode_get_entry(op, graph->opcode_hash); + cnt_inc(&entry->new_node); + } + STAT_LEAVE; +} + +/** + * 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) +{ + if (! status->stat_options) + return; + + STAT_ENTER; + { + node_entry_t *entry; + graph_entry_t *graph; + ir_op *op = stat_get_irn_op(node); + + /* increase global value */ + graph = graph_get_entry(NULL, status->irg_hash); + entry = opcode_get_entry(op, graph->opcode_hash); + cnt_inc(&entry->into_Id); + + /* increase local value */ + graph = graph_get_entry(current_ir_graph, status->irg_hash); + entry = opcode_get_entry(op, graph->opcode_hash); + cnt_inc(&entry->into_Id); + } + STAT_LEAVE; +} + +/** + * A new graph was created + * + * @param ctx the hook context + * @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) +{ + if (! status->stat_options) + return; + + STAT_ENTER; + { + /* execute for side effect :-) */ + graph_entry_t * graph = graph_get_entry(irg, status->irg_hash); + + 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; +} + +/** + * A graph will be deleted + * + * @param ctx the hook context + * @param irg the IR graph that will be deleted + * + * Note that we still hold the information for this graph + * 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) +{ + if (! status->stat_options) + return; + + STAT_ENTER; + { + graph_entry_t *graph = graph_get_entry(irg, status->irg_hash); + graph_entry_t *global = graph_get_entry(NULL, status->irg_hash); + + graph->is_deleted = 1; + + 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; +} + +/** + * A walk over a graph is initiated. Do not count walks from statistic code. + * + * @param ctx the hook context + * @param irg the IR graph that will be walked + * @param pre the pre walker + * @param post the post walker + */ +static void stat_irg_walk(void *ctx, ir_graph *irg, generic_func *pre, generic_func *post) +{ + if (! status->stat_options) + return; + + STAT_ENTER_SINGLE; + { + graph_entry_t *graph = graph_get_entry(irg, status->irg_hash); + + cnt_inc(&graph->cnt_walked); + } + STAT_LEAVE; +} + +/** + * A walk over a graph in block-wise order is initiated. Do not count walks from statistic code. + * + * @param ctx the hook context + * @param irg the IR graph that will be walked + * @param pre the pre walker + * @param post the post walker + */ +static void stat_irg_walk_blkwise(void *ctx, ir_graph *irg, generic_func *pre, generic_func *post) +{ + /* for now, do NOT differentiate between blockwise and normal */ + stat_irg_walk(ctx, irg, pre, post); +} + +/** + * A walk over the graph's blocks is initiated. Do not count walks from statistic code. + * + * @param ctx the hook context + * @param irg the IR graph that will be walked + * @param node the IR node + * @param pre the pre walker + * @param post the post walker + */ +static void stat_irg_block_walk(void *ctx, ir_graph *irg, ir_node *node, generic_func *pre, generic_func *post) +{ + if (! status->stat_options) + return; + + STAT_ENTER_SINGLE; + { + graph_entry_t *graph = graph_get_entry(irg, status->irg_hash); + + cnt_inc(&graph->cnt_walked_blocks); + } + STAT_LEAVE; +} + +/** + * 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) +{ + ir_op *op = stat_get_irn_op(n); + opt_entry_t *entry = opt_get_entry(op, hmap); /* increase global value */ cnt_inc(&entry->count); } -/* - * Some nodes were optimized into some others due to an optimization +/** + * Some nodes were optimized into some others due to an optimization. + * + * @param ctx the hook context */ -void stat_merge_nodes( +static void stat_merge_nodes( + void *ctx, ir_node **new_node_array, int new_num_entries, ir_node **old_node_array, int old_num_entries, - stat_opt_kind opt) + hook_opt_kind opt) { - int i, j; - graph_entry_t *graph = graph_get_entry(current_ir_graph, status->irg_hash); + if (! status->stat_options) + return; + + STAT_ENTER; + { + int i, j; + graph_entry_t *graph = graph_get_entry(current_ir_graph, status->irg_hash); - 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]) - break; + if (status->reassoc_run) + opt = HOOK_OPT_REASSOC; - /* nodes might be in new and old, these are NOT removed */ - if (j >= new_num_entries) { - removed_due_opt(old_node_array[i], graph->opt_hash[opt]); + 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]) + break; + + /* nodes might be in new and old, these are NOT removed */ + if (j >= new_num_entries) { + int xopt = opt; + + /* sometimes we did not detect, that it is replaced by a Const */ + if (opt == HOOK_OPT_CONFIRM && new_num_entries == 1) { + ir_op *op = get_irn_op(new_node_array[0]); + + if (op == op_Const || op == op_SymConst) + xopt = HOOK_OPT_CONFIRM_C; + } + + removed_due_opt(old_node_array[i], graph->opt_hash[xopt]); + } } } + STAT_LEAVE; } -/* +/** + * 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) +{ + if (! status->stat_options) + return; + + STAT_ENTER; + { + status->reassoc_run = flag; + } + STAT_LEAVE; +} + +/** * A node was lowered into other nodes + * + * @param ctx the hook context + * @param node the IR node that will be lowered */ -void stat_lower(ir_node *node) +static void stat_lower(void *ctx, ir_node *node) { - graph_entry_t *graph = graph_get_entry(current_ir_graph, status->irg_hash); + if (! status->stat_options) + return; + + STAT_ENTER; + { + graph_entry_t *graph = graph_get_entry(current_ir_graph, status->irg_hash); - removed_due_opt(node, graph->opt_hash[STAT_LOWERED]); + removed_due_opt(node, graph->opt_hash[HOOK_LOWERED]); + } + STAT_LEAVE; } -/* - * A graph was inlined +/** + * A graph was inlined. + * + * @param ctx the hook context + * @param call the IR call that will re changed into the body of + * the called IR graph + * @param called_irg the IR graph representing the called routine */ -void stat_inline(ir_node *call, const ir_graph *called_irg) +static void stat_inline(void *ctx, ir_node *call, ir_graph *called_irg) { - ir_graph *irg = get_irn_irg(call); - graph_entry_t *i_graph = graph_get_entry(called_irg, status->irg_hash); - graph_entry_t *graph = graph_get_entry(irg, status->irg_hash); + if (! status->stat_options) + return; - cnt_inc(&graph->got_inlined); - cnt_inc(&i_graph->was_inlined); + STAT_ENTER; + { + ir_graph *irg = get_irn_irg(call); + graph_entry_t *i_graph = graph_get_entry(called_irg, status->irg_hash); + graph_entry_t *graph = graph_get_entry(irg, status->irg_hash); + + cnt_inc(&graph->cnt_got_inlined); + cnt_inc(&i_graph->cnt_was_inlined); + } + STAT_LEAVE; } /** - * dumps a opcode hash + * A graph with tail-recursions was optimized. + * + * @param ctx the hook context */ -static void dump_opcode_hash(pset *set) +static void stat_tail_rec(void *ctx, ir_graph *irg, int n_calls) { - node_entry_t *entry; + if (! status->stat_options) + return; + + STAT_ENTER; + { + graph_entry_t *graph = graph_get_entry(irg, status->irg_hash); - fprintf(status->f, "%-16s %-8s %-8s\n", "Opcode", "created", "->Id"); - for (entry = pset_first(set); entry; entry = pset_next(set)) { - fprintf(status->f, "%-16s %8d %8d\n", - get_id_str(entry->op->name), entry->new_node.cnt[0], entry->into_Id.cnt[0]); + graph->num_tail_recursion += n_calls; } + STAT_LEAVE; } -static const char *opt_names[] = { - "straightening optimization", - "if simplification", - "algebraic simplification", - "Phi optmization", - "Write-After-Write optimization", - "Write-After-Read optimization", - "Tuple optimization", - "ID optimization", - "Constant evaluation", - "Lowered", -}; +/** + * 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, ir_node *cmp) +{ + if (! status->stat_options) + 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[HOOK_OPT_STRENGTH_RED]); + } + STAT_LEAVE; +} /** - * dumps a optimization hash + * Start/Stop the dead node elimination. + * + * @param ctx the hook context */ -static void dump_opt_hash(pset *set, int index) +static void stat_dead_node_elim(void *ctx, ir_graph *irg, int start) { - opt_entry_t *entry = pset_first(set); + if (! status->stat_options) + return; - if (entry) { - fprintf(status->f, "\n%s:\n", opt_names[index]); - fprintf(status->f, "%-16s %-8s\n", "Opcode", "deref"); + if (start) + ++status->in_dead_node_elim; + else + --status->in_dead_node_elim; +} - for (; entry; entry = pset_next(set)) { - fprintf(status->f, "%-16s %8d\n", - get_id_str(entry->op->name), entry->count.cnt[0]); - } +/** + * if-conversion was tried + */ +static void stat_if_conversion(void *context, ir_graph *irg, ir_node *phi, + int pos, ir_node *mux, if_result_t reason) +{ + if (! status->stat_options) + return; + + STAT_ENTER; + { + graph_entry_t *graph = graph_get_entry(irg, status->irg_hash); + + cnt_inc(&graph->cnt_if_conv[reason]); } + STAT_LEAVE; } -/* Finish the statistics */ -void stat_finish(void) +/** + * real function call was optimized + */ +static void stat_func_call(void *context, ir_graph *irg, ir_node *call) { - int i; - graph_entry_t *entry; - ir_graph *const_irg = get_const_code_irg(); + if (! status->stat_options) + return; - /* dump global */ - fprintf(status->f, "\nGlobal counts:\n"); - dump_opcode_hash(status->opcode_hash); + STAT_ENTER; + { + graph_entry_t *graph = graph_get_entry(irg, status->irg_hash); - for (entry = pset_first(status->irg_hash); entry; entry = pset_next(status->irg_hash)) { - entity *ent = entry->ent; + cnt_inc(&graph->cnt_real_func_call); + } + STAT_LEAVE; +} - if (entry->irg == const_irg) { - fprintf(status->f, "\nConst code Irg %p", entry->irg); +/** + * 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) +{ + if (! status->stat_options) + return; + + STAT_ENTER; + { + graph_entry_t *graph = graph_get_entry(current_ir_graph, status->irg_hash); + removed_due_opt(mul, graph->opt_hash[HOOK_OPT_ARCH_DEP]); + } + STAT_LEAVE; +} + +/** + * 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) +{ + if (! status->stat_options) + return; + + STAT_ENTER; + { + graph_entry_t *graph = graph_get_entry(current_ir_graph, status->irg_hash); + removed_due_opt(node, graph->opt_hash[HOOK_OPT_ARCH_DEP]); + } + STAT_LEAVE; +} + +/* Dumps a statistics snapshot */ +void stat_dump_snapshot(const char *name, const char *phase) +{ + char fname[2048]; + const char *p; + int l; + + if (! status->stat_options) + return; + + STAT_ENTER; + { + graph_entry_t *entry; + graph_entry_t *global = graph_get_entry(NULL, status->irg_hash); + + /* + * The constant counter is only global, so we clear it here. + * Note that it does NOT contain the constants in DELETED + * graphs due to this. + */ + if (status->stat_options & FIRMSTAT_COUNT_CONSTS) + stat_const_clear(status); + + /* build the name */ + p = strrchr(name, '/'); +#ifdef _WIN32 + { + const char *q; + + q = strrchr(name, '\\'); + + /* NULL might be not the smallest pointer */ + if (q && (!p || q > p)) + p = q; + } +#endif + if (p) { + ++p; + l = p - name; + + if (l > sizeof(fname) - 1) + l = sizeof(fname) - 1; + + memcpy(fname, name, l); + fname[l] = '\0'; } else { - if (ent) - fprintf(status->f, "\nEntity %s, Irg %p", get_entity_name(ent), entry->irg); - else - fprintf(status->f, "\nIrg %p", entry->irg); + fname[0] = '\0'; + p = name; + } + strncat(fname, "firmstat-", sizeof(fname)); + strncat(fname, phase, sizeof(fname)); + strncat(fname, "-", sizeof(fname)); + strncat(fname, p, sizeof(fname)); + + stat_dump_init(fname); + + /* calculate the graph statistics */ + 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; + } + + if (! entry->is_deleted) { + /* the graph is still alive, count the nodes on it */ + update_graph_stat(global, entry); + } } - fprintf(status->f, " %swalked %d over blocks %d was inlined %d got inlined %d:\n", - entry->deleted ? "DELETED " : "", - entry->walked.cnt[0], entry->walked_blocks.cnt[0], - entry->was_inlined.cnt[0], - entry->got_inlined.cnt[0] - ); + /* some calculations are dependent, 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); + } + + + /* dump per graph */ + for (entry = pset_first(status->irg_hash); entry; entry = pset_next(status->irg_hash)) { - dump_opcode_hash(entry->opcode_hash); + if (entry->irg == NULL) { + /* special entry for the global count */ + continue; + } - for (i = 0; i < sizeof(entry->opt_hash)/sizeof(entry->opt_hash[0]); ++i) { - dump_opt_hash(entry->opt_hash[i], i); + if (! entry->is_deleted || status->stat_options & FIRMSTAT_COUNT_DELETED) { + stat_dump_graph(entry); + } + + if (! entry->is_deleted) { + /* clear the counter that are not accumulated */ + graph_clear_entry(entry, 0); + } } - } - fclose(status->f); + /* dump global */ + stat_dump_graph(global); + + /* dump the const info */ + if (status->stat_options & FIRMSTAT_COUNT_CONSTS) + stat_dump_consts(&status->const_info); + + stat_dump_finish(); + + stat_finish_pattern_history(); + + /* clear the global counter here */ + { + node_entry_t *entry; + + for (entry = pset_first(global->opcode_hash); entry; entry = pset_next(global->opcode_hash)) { + opcode_clear_entry(entry); + } + /* clear all global counter */ + graph_clear_entry(global, 1); + } + } + STAT_LEAVE; } -#else +/** the hook entries for the Firm statistics module */ +static hook_entry_t stat_hooks[hook_last]; -/* need this for prototypes */ -#define FIRM_STATISTICS -#include "firmstat.h" +/* initialize the statistics module. */ +void init_stat(unsigned enable_options) +{ +#define X(a) a, sizeof(a)-1 +#define HOOK(h, fkt) \ + stat_hooks[h].hook._##h = fkt; register_hook(h, &stat_hooks[h]) + + if (! (enable_options & FIRMSTAT_ENABLED)) + return; + + status = xmalloc(sizeof(*status)); + memset(status, 0, sizeof(*status)); + + /* enable statistics */ + status->stat_options = enable_options & FIRMSTAT_ENABLED ? enable_options : 0; + + /* register all hooks */ + HOOK(hook_new_ir_op, stat_new_ir_op); + HOOK(hook_free_ir_op, stat_free_ir_op); + HOOK(hook_new_node, stat_new_node); + HOOK(hook_turn_into_id, stat_turn_into_id); + HOOK(hook_new_graph, stat_new_graph); + HOOK(hook_free_graph, stat_free_graph); + HOOK(hook_irg_walk, stat_irg_walk); + HOOK(hook_irg_walk_blkwise, stat_irg_walk_blkwise); + HOOK(hook_irg_block_walk, stat_irg_block_walk); + HOOK(hook_merge_nodes, stat_merge_nodes); + HOOK(hook_reassociate, stat_reassociate); + HOOK(hook_lower, stat_lower); + HOOK(hook_inline, stat_inline); + HOOK(hook_tail_rec, stat_tail_rec); + HOOK(hook_strength_red, stat_strength_red); + HOOK(hook_dead_node_elim, stat_dead_node_elim); + HOOK(hook_if_conversion, stat_if_conversion); + HOOK(hook_func_call, stat_func_call); + HOOK(hook_arch_dep_replace_mul_with_shifts, stat_arch_dep_replace_mul_with_shifts); + HOOK(hook_arch_dep_replace_division_by_const, stat_arch_dep_replace_division_by_const); -void stat_init(void) {} + obstack_init(&status->cnts); -void stat_finish(void) {} + /* create the hash-tables */ + status->irg_hash = new_pset(graph_cmp, 8); + status->ir_op_hash = new_pset(opcode_cmp_2, 1); -void stat_new_ir_op(const ir_op *op) {} + /* create the wait queue */ + status->wait_q = new_pdeq(); -void stat_free_ir_op(const ir_op *op) {} + 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")); -void stat_new_node(const ir_node *node) {} + _op_PhiM.code = get_next_ir_opcode(); + _op_PhiM.name = new_id_from_chars(X("PhiM")); -void stat_turn_into_id(const ir_node *node) {} + _op_ProjM.code = get_next_ir_opcode(); + _op_ProjM.name = new_id_from_chars(X("ProjM")); -void stat_new_graph(const ir_graph *irg, entity *ent) {} + _op_MulC.code = get_next_ir_opcode(); + _op_MulC.name = new_id_from_chars(X("MulC")); -void stat_free_graph(const ir_graph *irg) {} + _op_DivC.code = get_next_ir_opcode(); + _op_DivC.name = new_id_from_chars(X("DivC")); -void stat_irg_walk(const ir_graph *irg, void *pre, void *post) {} + _op_ModC.code = get_next_ir_opcode(); + _op_ModC.name = new_id_from_chars(X("ModC")); -void stat_irg_block_walk(const ir_graph *irg, const ir_node *node, void *pre, void *post) {} + _op_DivModC.code = get_next_ir_opcode(); + _op_DivModC.name = new_id_from_chars(X("DivModC")); -void stat_merge_nodes( - ir_node **new_node_array, int new_num_entries, - ir_node **old_node_array, int old_num_entries, - stat_opt_kind opt) {} + 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; + status->op_DivModC = NULL; + } -void stat_lower(ir_node *node) {} + if (enable_options & FIRMSTAT_COUNT_SELS) { + _op_SelSel.code = get_next_ir_opcode(); + _op_SelSel.name = new_id_from_chars(X("Sel(Sel)")); -void stat_inline(const ir_node *call, const ir_graph *irg) {} + _op_SelSelSel.code = get_next_ir_opcode(); + _op_SelSelSel.name = new_id_from_chars(X("Sel(Sel(Sel))")); -#endif + status->op_SelSel = &_op_SelSel; + status->op_SelSelSel = &_op_SelSelSel; + } + else { + status->op_SelSel = NULL; + status->op_SelSelSel = NULL; + } + + /* register the dumper */ + stat_register_dumper(&simple_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); + + /* initialize the Const options */ + if (enable_options & FIRMSTAT_COUNT_CONSTS) + stat_init_const_cnt(status); + +#undef HOOK +#undef X +} + +/* terminates the statistics module, frees all memory */ +void stat_term(void) { + if (status != (stat_info_t *)&status_disable) { + xfree(status); + status = (stat_info_t *)&status_disable; + } +} + +#else + +/* initialize the statistics module. */ +void init_stat(unsigned enable_options) {} + +/* Dumps a statistics snapshot */ +void stat_dump_snapshot(const char *name, const char *phase) {} + +/* terminates the statistics module, frees all memory */ +void stat_term(void); + +#endif /* FIRM_STATISTICS */