X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fstat%2Ffirmstat.c;h=1e7dd4bdddfed12f5e67bfe4a26caeb93b7c9b6f;hb=af9d5340df83e18c0480b996de482d5ae930c7d7;hp=b2ffd0f750bb2b16630dfe9e5973407006ebeb1f;hpb=ac7a8d6d17e3080b94233fb5ab099591b9dc757b;p=libfirm diff --git a/ir/stat/firmstat.c b/ir/stat/firmstat.c index b2ffd0f75..1e7dd4bdd 100644 --- a/ir/stat/firmstat.c +++ b/ir/stat/firmstat.c @@ -1,1038 +1,2365 @@ /* - * Project: libFIRM - * File name: ir/ir/firmstat.c - * Purpose: Statistics for Firm. - * Author: Michael Beck - * Created: - * CVS-ID: $Id$ - * Copyright: (c) 2004 Universität Karlsruhe - * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE. + * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved. + * + * This file is part of libFirm. + * + * This file may be distributed and/or modified under the terms of the + * GNU General Public License version 2 as published by the Free Software + * Foundation and appearing in the file LICENSE.GPL included in the + * packaging of this file. + * + * Licensees holding valid libFirm Professional Edition licenses may use + * this file in accordance with the libFirm Commercial License. + * Agreement provided with the Software. + * + * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE + * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR + * PURPOSE. */ +/** + * @file + * @brief Statistics for Firm. + * @author Michael Beck + * @version $Id$ + */ #ifdef HAVE_CONFIG_H # include "config.h" #endif -# include - -# include "irop_t.h" -# include "irnode_t.h" -# include "irgraph_t.h" -# include "pset.h" -# include "irprog.h" -# include "irgwalk.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" /* - * just be make some things clear :-), the - * poor man "generics" + * need this to be static: + * Special pseudo Opcodes that we need to count some interesting cases */ -#define HASH_MAP(type) pset_##type -typedef pset pset_node_entry_t; -typedef pset pset_graph_entry_t; -typedef pset pset_opt_entry_t; - -/* - * 32 bit should be enough for now +/** + * The Phi0, a node that is created during SSA construction */ -#define STAT_CNT_NUM 1 +static ir_op _op_Phi0; -typedef struct _counter_t { - unsigned cnt[STAT_CNT_NUM]; -} counter_t; +/** The PhiM, just to count memory Phi's. */ +static ir_op _op_PhiM; -/* - * An entry for ir_nodes +/** 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; + +/** The Quot by Const node. */ +static ir_op _op_QuotC; + +/** The memory Proj node. */ +static ir_op _op_ProjM; + +/** A Sel of a Sel */ +static ir_op _op_SelSel; + +/** 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) + +/** + * global status */ -typedef struct _node_entry_t { - counter_t cnt_alive; /**< amount of nodes in this entry */ - 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 const unsigned status_disable = 0; +static stat_info_t *status = (stat_info_t *)&status_disable; -/* - * An entry for ir_graphs +/** + * Compare two elements of the opcode hash. */ -typedef struct _graph_entry_t { - HASH_MAP(node_entry_t) *opcode_hash; /**< hash map containing the opcode counter */ - counter_t cnt_walked; /**< walker walked over the graph */ - counter_t cnt_walked_blocks; /**< walker walked over the graph blocks */ - counter_t cnt_was_inlined; /**< number of times other graph were inlined */ - counter_t cnt_got_inlined; /**< number of times this graph was inlined */ - counter_t cnt_edges; /**< number of DF edges in this graph */ - HASH_MAP(opt_entry_t) *opt_hash[STAT_OPT_MAX]; /**< hash maps containing opcode counter for optimizations */ - 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; +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 */ /** - * An entry for optimized ir_nodes + * Compare two elements of the graph hash. */ -typedef struct _opt_entry_t { - counter_t count; /**< optimization counter */ - const ir_op *op; /**< the op for this entry */ -} opt_entry_t; +static int graph_cmp(const void *elt, const void *key) { + const graph_entry_t *e1 = elt; + const graph_entry_t *e2 = key; -/** forward */ -typedef struct _dumper_t dumper_t; + return e1->irg != e2->irg; +} /* graph_cmp */ /** - * handler for dumping an IRG - * - * @param dmp the dumper - * @param entry the IR-graph hash map entry + * Compare two elements of the optimization hash. */ -typedef void (*dump_graph_FUNC)(dumper_t *dmp, graph_entry_t *entry); +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 */ /** - * handler for dumper init - * - * @param dmp the dumper - * @param name name of the file to dump to + * Compare two elements of the block/extbb hash. */ -typedef void (*dump_init_FUNC)(dumper_t *dmp, const char *name); +static int block_cmp(const void *elt, const void *key) { + const block_entry_t *e1 = elt; + const block_entry_t *e2 = key; + + /* it's enough to compare the block number */ + return e1->block_nr != e2->block_nr; +} /* block_cmp */ /** - * handler for dumper finish - * - * @param dmp the dumper + * Compare two elements of the be_block hash. */ -typedef void (*dump_finish_FUNC)(dumper_t *dmp); +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 */ /** - * a dumper description + * Compare two elements of reg pressure hash. */ -struct _dumper_t { - dump_graph_FUNC dump_graph; /**< handler for dumping an irg */ - dump_init_FUNC init; /**< handler for init */ - dump_finish_FUNC finish; /**< handler for finish */ - FILE *f; /**< the file to dump to */ - dumper_t *next; /**< link to the next dumper */ -}; +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 */ /** - * statistics info + * Compare two elements of the perm_stat hash. */ -typedef struct _statistic_info_t { - struct obstack cnts; /**< obstack containing the counters */ - HASH_MAP(graph_entry_t) *irg_hash; /**< hash map containing the counter for irgs */ - int recursive; /**< flag for detecting recursive hook calls */ - int in_dead_node_elim; /**< set, if dead node elimination runs */ - ir_op *op_Phi0; /**< needed pseudo op */ - ir_op *op_PhiM; /**< needed pseudo op */ - dumper_t *dumper; /**< list of dumper */ -} stat_info_t; +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 */ /** - * names of the optimizations + * Compare two elements of the perm_class hash. */ -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", -}; +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 */ /** - * need this to be static + * Compare two elements of the ir_op hash. */ -static ir_op _op_Phi0, _op_PhiM; +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 */ -#define STAT_ENTER ++status->recursive -#define STAT_LEAVE --status->recursive -#define STAT_ENTER_SINGLE do { if (status->recursive > 0) return; ++status->recursive; } while (0) +/** + * 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; + (void) size; -/* - * global status + /* compare only the nodes, the rest is used as data container */ + return e1->node != e2->node; +} /* address_mark_cmp */ + +/** + * Clear all counter in a node_entry_t. */ -static stat_info_t _status, *status = &_status; +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 */ /** - * increase a counter + * 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 INLINE void cnt_inc(counter_t *cnt) -{ - int i; +static node_entry_t *opcode_get_entry(const ir_op *op, hmap_node_entry_t *hmap) { + node_entry_t key; + node_entry_t *elem; - for (i = 0; i < STAT_CNT_NUM; ++i) { - if (++cnt->cnt[i]) - break; - } -} + key.op = op; + + elem = pset_find(hmap, &key, op->code); + if (elem) + return elem; + + elem = obstack_alloc(&status->cnts, sizeof(*elem)); + memset(elem, 0, sizeof(*elem)); + + /* clear counter */ + opcode_clear_entry(elem); + + elem->op = op; + + return pset_insert(hmap, elem, op->code); +} /* opcode_get_entry */ /** - * decreace a counter + * Returns the associates ir_op for an opcode + * + * @param code the IR opcode + * @param hmap the hash map containing opcode -> ir_op* */ -static INLINE void cnt_dec(counter_t *cnt) -{ - int i; +static ir_op *opcode_find_entry(ir_opcode code, hmap_ir_op *hmap) { + ir_op key; - for (i = 0; i < STAT_CNT_NUM; ++i) { - if (--cnt->cnt[i] != -1) - break; - } -} + key.code = code; + return pset_find(hmap, &key, code); +} /* opcode_find_entry */ /** - * set a counter to zero + * 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 INLINE void cnt_clr(counter_t *cnt) -{ - memset(cnt->cnt, 0, sizeof(cnt->cnt)); -} +static void graph_clear_entry(graph_entry_t *elem, int all) { + int i; + + /* clear accumulated / non-accumulated counter */ + for (i = all ? 0 : _gcnt_non_acc; i < _gcnt_last; ++i) { + cnt_clr(&elem->cnt[i]); + } /* for */ + + if (elem->block_hash) { + del_pset(elem->block_hash); + elem->block_hash = NULL; + } /* if */ + + if (elem->extbb_hash) { + del_pset(elem->extbb_hash); + elem->extbb_hash = NULL; + } /* if */ + + obstack_free(&elem->recalc_cnts, NULL); + obstack_init(&elem->recalc_cnts); +} /* graph_clear_entry */ /** - * add a counter to another + * 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 inline void cnt_add(counter_t *dst, const counter_t *src) +static graph_entry_t *graph_get_entry(ir_graph *irg, hmap_graph_entry_t *hmap) { - int i, carry = 0; + graph_entry_t key; + graph_entry_t *elem; + size_t i; - for (i = 0; i < STAT_CNT_NUM; ++i) { - unsigned a = dst->cnt[i] + src->cnt[i] + carry; + key.irg = irg; - if (carry) - carry = a <= dst->cnt[i]; - else - carry = a < dst->cnt[i]; + elem = pset_find(hmap, &key, HASH_PTR(irg)); - dst->cnt[i] = a; + if (elem) { + /* create hash map backend block information */ + if (! elem->be_block_hash) + elem->be_block_hash = new_pset(be_block_cmp, 5); - if (! carry) - break; - } -} + return elem; + } /* if */ + + /* allocate a new one */ + elem = obstack_alloc(&status->cnts, sizeof(*elem)); + memset(elem, 0, sizeof(*elem)); + obstack_init(&elem->recalc_cnts); + + /* 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(hmap, elem, HASH_PTR(irg)); +} /* graph_get_entry */ + +/** + * Clear all counter in an opt_entry_t. + */ +static void opt_clear_entry(opt_entry_t *elem) { + cnt_clr(&elem->count); +} /* opt_clear_entry */ /** - * add an integer to an counter + * 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 inline void cnt_add_i(counter_t *dst, int src) +static opt_entry_t *opt_get_entry(const ir_op *op, hmap_opt_entry_t *hmap) { - int i; - unsigned a = dst->cnt[0] + src; - unsigned carry = a < dst->cnt[i]; + opt_entry_t key; + opt_entry_t *elem; - dst->cnt[0] = a; - if (! carry) - return; + key.op = op; - for (i = 1; i < STAT_CNT_NUM; ++i) { - unsigned a = dst->cnt[i] + carry; + elem = pset_find(hmap, &key, op->code); + if (elem) + return elem; - carry = a < dst->cnt[i]; + elem = obstack_alloc(&status->cnts, sizeof(*elem)); + memset(elem, 0, sizeof(*elem)); - dst->cnt[i] = a; + /* clear new counter */ + opt_clear_entry(elem); - if (! carry) - break; - } -} + elem->op = op; -/* - * compare two elements of the opcode hash + return pset_insert(hmap, elem, op->code); +} /* opt_get_entry */ + +/** + * clears all counter in a block_entry_t */ -static int opcode_cmp(const void *elt, const void *key) -{ - const node_entry_t *e1 = elt; - const node_entry_t *e2 = key; +static void block_clear_entry(block_entry_t *elem) { + int i; - return e1->op->code - e2->op->code; -} + for (i = 0; i < _bcnt_last; ++i) + cnt_clr(&elem->cnt[i]); +} /* block_clear_entry */ -/* - * compare two elements of the graph hash +/** + * 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 int graph_cmp(const void *elt, const void *key) +static block_entry_t *block_get_entry(struct obstack *obst, long block_nr, hmap_block_entry_t *hmap) { - const graph_entry_t *e1 = elt; - const graph_entry_t *e2 = key; + block_entry_t key; + block_entry_t *elem; - return e1->irg != e2->irg; -} + key.block_nr = block_nr; -/* - * compare two elements of the optimization hash + 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; + + return pset_insert(hmap, elem, block_nr); +} /* block_get_entry */ + +/** + * Clear all sets in be_block_entry_t. */ -static int opt_cmp(const void *elt, const void *key) +static void be_block_clear_entry(be_block_entry_t *elem) { - const opt_entry_t *e1 = elt; - const opt_entry_t *e2 = key; + if (elem->reg_pressure) + del_pset(elem->reg_pressure); - return e1->op->code != e2->op->code; -} + if (elem->sched_ready) + stat_delete_distrib_tbl(elem->sched_ready); + + if (elem->perm_class_stat) + del_pset(elem->perm_class_stat); + + 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 */ /** - * Returns the associates node_entry_t for an ir_op + * Returns the associated be_block_entry_t for an block. + * + * @param block_nr an IR block number + * @param hmap a hash map containing long -> be_block_entry_t */ -static node_entry_t *opcode_get_entry(const ir_op *op, pset *set) +static be_block_entry_t *be_block_get_entry(struct obstack *obst, long block_nr, hmap_be_block_entry_t *hmap) { - node_entry_t key; - node_entry_t *elem; + be_block_entry_t key; + be_block_entry_t *elem; - key.op = op; + key.block_nr = block_nr; - elem = pset_find(set, &key, op->code); - if (elem) - return elem; + elem = pset_find(hmap, &key, block_nr); + if (elem) + return elem; - elem = obstack_alloc(&status->cnts, sizeof(*elem)); + elem = obstack_alloc(obst, sizeof(*elem)); + memset(elem, 0, sizeof(*elem)); - /* clear counter */ - cnt_clr(&elem->cnt_alive); - cnt_clr(&elem->new_node); - cnt_clr(&elem->into_Id); + /* clear new counter */ + be_block_clear_entry(elem); - elem->op = op; + elem->block_nr = block_nr; - return pset_insert(set, elem, op->code); -} + return pset_insert(hmap, elem, block_nr); +} /* be_block_get_entry */ /** - * calculates a hash value for an irg - * Addresses are typically aligned at 32bit, so we ignore the lowest bits + * clears all sets in perm_class_entry_t */ -static INLINE unsigned irg_hash(const ir_graph *irg) -{ - return (unsigned)irg >> 3; -} +static void perm_class_clear_entry(perm_class_entry_t *elem) { + if (elem->perm_stat) + del_pset(elem->perm_stat); + + elem->perm_stat = new_pset(perm_stat_cmp, 5); +} /* perm_class_clear_entry */ /** - * Returns the acssociates graph_entry_t for an irg + * Returns the associated perm_class entry for a register class. + * + * @param class_name the register class name + * @param hmap a hash map containing class_name -> perm_class_entry_t */ -static graph_entry_t *graph_get_entry(ir_graph *irg, pset *set) +static perm_class_entry_t *perm_class_get_entry(struct obstack *obst, const char *class_name, + hmap_perm_class_entry_t *hmap) { - graph_entry_t key; - graph_entry_t *elem; - int i; + perm_class_entry_t key; + perm_class_entry_t *elem; - key.irg = irg; + key.class_name = class_name; - elem = pset_find(set, &key, irg_hash(irg)); - if (elem) - return elem; + elem = pset_find(hmap, &key, HASH_PTR(class_name)); + if (elem) + return elem; - elem = obstack_alloc(&status->cnts, sizeof(*elem)); + elem = obstack_alloc(obst, sizeof(*elem)); + memset(elem, 0, sizeof(*elem)); - 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_edges); + /* clear new counter */ + perm_class_clear_entry(elem); - /* new hash table for opcodes here */ - elem->opcode_hash = new_pset(opcode_cmp, 5); - elem->irg = irg; + elem->class_name = class_name; - 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(hmap, elem, HASH_PTR(class_name)); +} /* perm_class_get_entry */ - return pset_insert(set, elem, irg_hash(irg)); -} +/** + * clears all sets in perm_stat_entry_t + */ +static void perm_stat_clear_entry(perm_stat_entry_t *elem) { + if (elem->chains) + stat_delete_distrib_tbl(elem->chains); + + if (elem->cycles) + stat_delete_distrib_tbl(elem->cycles); + + elem->chains = stat_new_int_distrib_tbl(); + elem->cycles = stat_new_int_distrib_tbl(); +} /* perm_stat_clear_entry */ /** - * Returns the associates opt_entry_t for an ir_op + * Returns the associated perm_stat entry for a perm. + * + * @param perm the perm node + * @param hmap a hash map containing perm -> perm_stat_entry_t */ -static opt_entry_t *opt_get_entry(const ir_op *op, pset *set) +static perm_stat_entry_t *perm_stat_get_entry(struct obstack *obst, ir_node *perm, hmap_perm_stat_entry_t *hmap) { - opt_entry_t key; - opt_entry_t *elem; + perm_stat_entry_t key; + perm_stat_entry_t *elem; + + key.perm = perm; - key.op = op; + elem = pset_find(hmap, &key, HASH_PTR(perm)); + if (elem) + return elem; - elem = pset_find(set, &key, op->code); - if (elem) - return elem; + elem = obstack_alloc(obst, sizeof(*elem)); + memset(elem, 0, sizeof(*elem)); - elem = obstack_alloc(&status->cnts, sizeof(*elem)); + /* clear new counter */ + perm_stat_clear_entry(elem); - /* clear new counter */ - cnt_clr(&elem->count); + elem->perm = perm; - elem->op = op; + return pset_insert(hmap, elem, HASH_PTR(perm)); +} /* perm_stat_get_entry */ - return pset_insert(set, elem, op->code); +/** + * Clear optimizations counter, + */ +static void clear_optimization_counter(void) { + int i; + for (i = 0; i < FS_OPT_MAX; ++i) + cnt_clr(&status->num_opts[i]); } /** * Returns the ir_op for an IR-node, - * handles special cases and return pseudo op codes + * handles special cases and return pseudo op codes. + * + * @param none an IR node */ -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); - - if (op->code == iro_Phi && get_irn_arity(node) == 0) { - /* special case, a Phi0 node, count on extra counter */ - op = status->op_Phi0; - } - else if (op->code == iro_Phi && get_irn_mode(node) == mode_M) { - /* special case, a Memory Phi node, count on extra counter */ - op = status->op_PhiM; - } - return op; -} - + ir_op *op = get_irn_op(node); + ir_opcode opc = op->code; + + switch (opc) { + case iro_Phi: + if (get_irn_arity(node) == 0) { + /* special case, a Phi0 node, count on extra counter */ + op = status->op_Phi0 ? status->op_Phi0 : op; + } else if (get_irn_mode(node) == mode_M) { + /* special case, a Memory Phi node, count on extra counter */ + op = status->op_PhiM ? status->op_PhiM : op; + } /* if */ + break; + case iro_Proj: + if (get_irn_mode(node) == mode_M) { + /* special case, a Memory Proj node, count on extra counter */ + op = status->op_ProjM ? status->op_ProjM : op; + } /* if */ + break; + case iro_Mul: + if (is_Const(get_Mul_left(node)) || is_Const(get_Mul_right(node))) { + /* special case, a Multiply by a const, count on extra counter */ + op = status->op_MulC ? status->op_MulC : op; + } /* if */ + break; + case iro_Div: + if (is_Const(get_Div_right(node))) { + /* special case, a division by a const, count on extra counter */ + op = status->op_DivC ? status->op_DivC : op; + } /* if */ + break; + case iro_Mod: + if (is_Const(get_Mod_right(node))) { + /* special case, a module by a const, count on extra counter */ + op = status->op_ModC ? status->op_ModC : op; + } /* if */ + break; + case iro_DivMod: + if (is_Const(get_DivMod_right(node))) { + /* special case, a division/modulo by a const, count on extra counter */ + op = status->op_DivModC ? status->op_DivModC : op; + } /* if */ + break; + case iro_Quot: + if (is_Const(get_Quot_right(node))) { + /* special case, a floating point division by a const, count on extra counter */ + op = status->op_QuotC ? status->op_QuotC : op; + } /* if */ + break; + case iro_Sel: + if (is_Sel(get_Sel_ptr(node))) { + /* special case, a Sel of a Sel, count on extra counter */ + op = status->op_SelSel ? status->op_SelSel : op; + if (is_Sel(get_Sel_ptr(get_Sel_ptr(node)))) { + /* special case, a Sel of a Sel of a Sel, count on extra counter */ + op = status->op_SelSelSel ? status->op_SelSelSel : op; + } /* if */ + } /* if */ + break; + default: + ; + } /* switch */ + + return op; +} /* stat_get_irn_op */ /** - * environment for the count walker + * update the block counter */ -typedef struct _cnt_env_t { - pset *set; /**< the hash map containing the ir_ops */ - counter_t *cnt_edges; /**< the edges counter */ -} cnt_env_t; +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); + /* mark start end block to allow to filter them out */ + if (node == get_irg_start_block(graph->irg)) + b_entry->is_start = 1; + else if (node == get_irg_end_block(graph->irg)) + b_entry->is_end = 1; + + /* 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[bcnt_in_edges]); /* an edge coming from another block */ + cnt_inc(&b_entry_other->cnt[bcnt_out_edges]); + } /* for */ + return; + } /* if */ + + 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[bcnt_phi_data]); + } /* if */ + + /* we have a new node in our block */ + cnt_inc(&b_entry->cnt[bcnt_nodes]); + + /* don't count keep-alive edges */ + if (is_End(node)) + 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[bcnt_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[bcnt_in_edges]); /* an edge coming from another block */ + cnt_inc(&b_entry_other->cnt[bcnt_out_edges]); + } /* if */ + } /* for */ +} /* undate_block_info */ /** - * walker for reachable nodes count + * Update the extended block counter. */ -static void count_nodes(ir_node *node, void *env) +static void update_extbb_info(ir_node *node, graph_entry_t *graph) { - cnt_env_t *cenv = env; - node_entry_t *entry; - ir_op *op = stat_get_irn_op(node); - int arity = get_irn_arity(node); + 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[bcnt_in_edges]); /* an edge coming from another extbb */ + cnt_inc(&eb_entry_other->cnt[bcnt_out_edges]); + } /* if */ + } /* for */ + return; + } /* if */ + + 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[bcnt_phi_data]); + } /* if */ + + /* we have a new node in our block */ + cnt_inc(&eb_entry->cnt[bcnt_nodes]); + + /* don't count keep-alive edges */ + if (is_End(node)) + 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[bcnt_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[bcnt_in_edges]); /* an edge coming from another extbb */ + cnt_inc(&eb_entry_other->cnt[bcnt_out_edges]); + } /* if */ + } /* for */ +} /* update_extbb_info */ + +/** + * Calculates how many arguments of the call are const, updates + * param distribution. + */ +static void analyse_params_of_Call(graph_entry_t *graph, ir_node *call) { + int i, num_const_args = 0, num_local_adr = 0; + int n = get_Call_n_params(call); - entry = opcode_get_entry(op, cenv->set); + for (i = 0; i < n; ++i) { + ir_node *param = get_Call_param(call, i); - cnt_inc(&entry->cnt_alive); - cnt_add_i(cenv->cnt_edges, arity); -} + if (is_irn_constlike(param)) + ++num_const_args; + else if (is_Sel(param)) { + ir_node *base = param; + + do { + base = get_Sel_ptr(base); + } while (is_Sel(base)); + + if (base == get_irg_frame(current_ir_graph)) + ++num_local_adr; + } + + } /* for */ + + if (num_const_args > 0) + cnt_inc(&graph->cnt[gcnt_call_with_cnst_arg]); + if (num_const_args == n) + cnt_inc(&graph->cnt[gcnt_call_with_all_cnst_arg]); + if (num_local_adr > 0) + cnt_inc(&graph->cnt[gcnt_call_with_local_adr]); + + stat_inc_int_distrib_tbl(status->dist_param_cnt, n); +} /* analyse_params_of_Call */ /** - * count all alive nodes in a graph + * Update info on calls. + * + * @param call The call + * @param graph The graph entry containing the call */ -static void count_nodes_in_graph(graph_entry_t * global, graph_entry_t * graph) +static void stat_update_call(ir_node *call, graph_entry_t *graph) { - cnt_env_t env; - node_entry_t *entry; + ir_node *block = get_nodes_block(call); + ir_node *ptr = get_Call_ptr(call); + ir_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; + + cnt_inc(&graph->cnt[gcnt_all_calls]); + + /* found a call, this function is not a leaf */ + graph->is_leaf = 0; + + if (is_SymConst(ptr)) { + 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; + if (callee == NULL) + cnt_inc(&graph->cnt[gcnt_external_calls]); + } /* if */ + } else { + /* indirect call, be could not predict */ + cnt_inc(&graph->cnt[gcnt_indirect_calls]); + + /* NOT a leaf call */ + graph->is_leaf_call = LCS_NON_LEAF_CALL; + } /* if */ + + /* 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); + + for (; curr != block && get_Block_dom_depth(curr) > depth;) { + curr = get_Block_idom(curr); + + if (! curr || is_no_Block(curr)) + break; + } /* for */ + + if (curr != block) + graph->is_chain_call = 0; + } + + /* check, if the callee is a leaf */ + if (callee) { + graph_entry_t *called = graph_get_entry(callee, status->irg_hash); + + if (called->is_analyzed) { + if (! called->is_leaf) + graph->is_leaf_call = LCS_NON_LEAF_CALL; + } /* if */ + } /* if */ + + analyse_params_of_Call(graph, call); +} /* stat_update_call */ - env.set = graph->opcode_hash; - env.cnt_edges = &graph->cnt_edges; - - irg_walk_graph(graph->irg, count_nodes, NULL, &env); +/** + * 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); + ir_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 (is_SymConst(ptr)) { + 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); + } /* if */ + } /* if */ + + /* 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; +} /* stat_update_call_2 */ - /* 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); +/** + * Find the base address and entity of an Sel node. + * + * @param sel the node + * + * @return the base address. + */ +static ir_node *find_base_adr(ir_node *sel) { + ir_node *ptr = get_Sel_ptr(sel); - /* update the node counter */ - cnt_add(&g_entry->cnt_alive, &entry->cnt_alive); - } + while (is_Sel(ptr)) { + sel = ptr; + ptr = get_Sel_ptr(sel); + } + return ptr; +} /* find_base_adr */ - /* update the edge counter */ - cnt_add(&global->cnt_edges, &graph->cnt_edges); -} +/** + * Update info on Load/Store address statistics. + */ +static void stat_update_address(ir_node *node, graph_entry_t *graph) { + ir_opcode opc = get_irn_opcode(node); + ir_node *base; + ir_graph *irg; + + switch (opc) { + case iro_SymConst: + /* a global address */ + cnt_inc(&graph->cnt[gcnt_global_adr]); + break; + case iro_Sel: + base = find_base_adr(node); + irg = current_ir_graph; + if (base == get_irg_tls(irg)) { + /* a TLS variable, like a global. */ + cnt_inc(&graph->cnt[gcnt_global_adr]); + } else if (base == get_irg_frame(irg)) { + /* a local Variable. */ + cnt_inc(&graph->cnt[gcnt_local_adr]); + } else { + /* Pointer access */ + if (is_Proj(base) && skip_Proj(get_Proj_pred(base)) == get_irg_start(irg)) { + /* pointer access through parameter, check for THIS */ + ir_entity *ent = get_irg_entity(irg); + + if (ent != NULL) { + ir_type *ent_tp = get_entity_type(ent); + + if (get_method_calling_convention(ent_tp) & cc_this_call) { + if (get_Proj_proj(base) == 0) { + /* THIS pointer */ + cnt_inc(&graph->cnt[gcnt_this_adr]); + goto end_parameter; + } /* if */ + } /* if */ + } /* if */ + /* other parameter */ + cnt_inc(&graph->cnt[gcnt_param_adr]); +end_parameter: ; + } else { + /* unknown Pointer access */ + cnt_inc(&graph->cnt[gcnt_other_adr]); + } /* if */ + } /* if */ + default: + ; + } /* switch */ +} /* stat_update_address */ /** - * register a dumper + * Walker for reachable nodes count. */ -static void stat_register_dumper(dumper_t *dumper, const char *name) +static void update_node_stat(ir_node *node, void *env) { - dumper->next = status->dumper; - status->dumper = dumper; + graph_entry_t *graph = env; + node_entry_t *entry; + + ir_op *op = stat_get_irn_op(node); + int i, arity = get_irn_arity(node); + + entry = opcode_get_entry(op, graph->opcode_hash); + + cnt_inc(&entry->cnt_alive); + cnt_add_i(&graph->cnt[gcnt_edges], arity); + + /* count block edges */ + undate_block_info(node, graph); + + /* count extended block edges */ + if (status->stat_options & FIRMSTAT_COUNT_EXTBB) { + if (graph->irg != get_const_code_irg()) + update_extbb_info(node, graph); + } /* if */ + + /* handle statistics for special node types */ + + switch (op->code) { + case iro_Call: + /* check for properties that depends on calls like recursion/leaf/indirect call */ + stat_update_call(node, graph); + break; + case iro_Load: + /* check address properties */ + stat_update_address(get_Load_ptr(node), graph); + break; + case iro_Store: + /* check address properties */ + stat_update_address(get_Store_ptr(node), graph); + break; + case iro_Phi: + /* check for non-strict Phi nodes */ + for (i = arity - 1; i >= 0; --i) { + ir_node *pred = get_Phi_pred(node, i); + if (is_Unknown(pred)) { + /* found an Unknown predecessor, graph is not strict */ + graph->is_strict = 0; + break; + } + } + default: + ; + } /* switch */ + + /* we want to count the constant IN nodes, not the CSE'ed constant's itself */ + if (status->stat_options & FIRMSTAT_COUNT_CONSTS) { + int i; + + for (i = get_irn_arity(node) - 1; i >= 0; --i) { + ir_node *pred = get_irn_n(node, i); + + if (is_Const(pred)) { + /* check properties of constants */ + stat_update_const(status, pred, graph); + } /* if */ + } /* for */ + } /* if */ +} /* update_node_stat */ - if (dumper->init) - dumper->init(dumper, name); -} +/** + * Walker for reachable nodes count for graphs on the wait_q. + */ +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 */ /** - * dumps an irg + * Get the current address mark. */ -static void dump_graph(graph_entry_t *entry) -{ - dumper_t *dumper; +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)); - for (dumper = status->dumper; dumper; dumper = dumper->next) { - if (dumper->dump_graph) - dumper->dump_graph(dumper, entry); - } -} + return value ? value->mark : 0; +} /* get_adr_mark */ /** - * finish the dumper + * Set the current address mark. */ -static void dump_finish(void) -{ - dumper_t *dumper; +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)); - for (dumper = status->dumper; dumper; dumper = dumper->next) { - if (dumper->finish) - dumper->finish(dumper); - } -} + value->mark = val; +} /* set_adr_mark */ -/* ---------------------------------------------------------------------- */ +#undef DUMP_ADR_MODE +#ifdef DUMP_ADR_MODE /** - * dumps a opcode hash into human readable form + * 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. */ -static void simple_dump_opcode_hash(dumper_t *dmp, pset *set) +static int stat_adr_mark_hook(FILE *F, ir_node *node, ir_node *local) { - 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]); -} + 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; +} /* stat_adr_mark_hook */ +#endif /* DUMP_ADR_MODE */ /** - * dumps a optimization hash into human readable form + * Return the "operational" mode of a Firm node. */ -static void simple_dump_opt_hash(dumper_t *dmp, pset *set, int index) -{ - opt_entry_t *entry = pset_first(set); +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 */ - if (entry) { - fprintf(dmp->f, "\n%s:\n", opt_names[index]); - fprintf(dmp->f, "%-16s %-8s\n", "Opcode", "deref"); +/** + * 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 mark_address_calc(ir_node *node, void *env) { + graph_entry_t *graph = env; + ir_mode *mode = get_irn_op_mode(node); + int i, n; + unsigned mark_preds = MARK_REF_NON_ADR; + + if (! mode_is_data(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 no reference mode, but is only + * referenced by address calculations + */ + mark_preds = MARK_REF_ADR; + } /* if */ + } /* if */ + + /* mark all predecessors */ + 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_data(mode)) + continue; + + set_adr_mark(graph, pred, get_adr_mark(graph, pred) | mark_preds); + } /* for */ +} /* mark_address_calc */ - for (; entry; entry = pset_next(set)) { - fprintf(dmp->f, "%-16s %8d\n", - get_id_str(entry->op->name), entry->count.cnt[0]); - } - } -} +/** + * 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[gcnt_pure_adr_ops]); + else if ((mark & (MARK_REF_ADR | MARK_REF_NON_ADR)) == MARK_REF_ADR) + cnt_inc(&graph->cnt[gcnt_pure_adr_ops]); + else if ((mark & (MARK_REF_ADR | MARK_REF_NON_ADR)) == (MARK_REF_ADR|MARK_REF_NON_ADR)) + cnt_inc(&graph->cnt[gcnt_all_adr_ops]); +} /* count_adr_ops */ /** - * dumps the endges count + * 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 simple_dump_edges(dumper_t *dmp, counter_t *cnt) +static void update_graph_stat(graph_entry_t *global, graph_entry_t *graph) { - fprintf(dmp->f, "%-16s %8d\n", "Edges", cnt->cnt[0]); -} + node_entry_t *entry; + int i; + + /* clear first the alive counter in the graph */ + foreach_pset(graph->opcode_hash, entry) { + cnt_clr(&entry->cnt_alive); + } /* foreach_pset */ + + /* set pessimistic values */ + graph->is_leaf = 1; + graph->is_leaf_call = LCS_UNKNOWN; + graph->is_recursive = 0; + graph->is_chain_call = 1; + graph->is_strict = 1; + + /* create new block counter */ + graph->block_hash = new_pset(block_cmp, 5); + + /* we need dominator info */ + if (graph->irg != get_const_code_irg()) { + assure_doms(graph->irg); + + 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); + } /* if */ + } /* if */ + + /* 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 */ + foreach_pset(graph->opcode_hash, entry) { + 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); + } /* foreach_pset */ + + /* count the number of address calculation */ + if (graph->irg != get_const_code_irg()) { + ir_graph *rem = current_ir_graph; + + 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; + +#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 /* DUMP_ADR_MODE */ + + irg_walk_graph(graph->irg, NULL, count_adr_ops, graph); + } /* if */ + + /* 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); + } /* if */ + + /* we have analyzed this graph */ + graph->is_analyzed = 1; + + /* accumulate all counter's */ + for (i = 0; i < _gcnt_last; ++i) + cnt_add(&global->cnt[i], &graph->cnt[i]); +} /* update_graph_stat */ /** - * dumps the IRG + * 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 simple_dump_graph(dumper_t *dmp, graph_entry_t *entry) +static void update_graph_stat_2(graph_entry_t *global, graph_entry_t *graph) { - int dump_opts = 1; - - 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:\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] - ); - } - else { - fprintf(dmp->f, "\nGlobals counts:\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); - } - } -} + (void) global; + 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; + } /* if */ +} /* update_graph_stat_2 */ /** - * initialise the simple dumper + * Register a dumper. */ -static void simple_init(dumper_t *dmp, const char *name) -{ - dmp->f = fopen(name, "w"); -} +static void stat_register_dumper(const dumper_t *dumper) { + dumper_t *p = XMALLOC(dumper_t); + + memcpy(p, dumper, sizeof(*p)); + + p->next = status->dumper; + p->status = status; + status->dumper = p; + + /* FIXME: memory leak */ +} /* stat_register_dumper */ /** - * finishes the simple dumper + * Dumps the statistics of an IR graph. */ -static void simple_finish(dumper_t *dmp) -{ - fclose(dmp->f); - dmp->f = NULL; -} +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 */ /** - * the simple human readable dumper + * Calls all registered dumper functions. */ -static dumper_t simple_dumper = { - simple_dump_graph, - simple_init, - simple_finish, - NULL, - NULL, -}; +static void stat_dump_registered(graph_entry_t *entry) { + dumper_t *dumper; -/* ---------------------------------------------------------------------- */ + for (dumper = status->dumper; dumper; dumper = dumper->next) { + if (dumper->func_map) { + dump_graph_FUNC func; + + foreach_pset(dumper->func_map, func) + func(dumper, entry); + } /* if */ + } /* for */ +} /* stat_dump_registered */ /** - * count the nodes as needed: - * - * 1 normal (data) Phi's - * 2 memory Phi's - * 3 Proj - * 0 all other nodes + * Dumps a constant table. */ -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); - } - } -} +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 */ /** - * dumps the IRG + * Dumps the parameter distribution */ -static void csv_dump_graph(dumper_t *dmp, graph_entry_t *entry) -{ - const char *name; - - counter_t cnt[4]; - - if (entry->irg) { - ir_graph *const_irg = get_const_code_irg(); - - if (entry->irg == const_irg) { - name = ""; - return; - } - else { - if (entry->ent) - name = get_entity_name(entry->ent); - else - name = ""; - } - - csv_count_nodes(entry, cnt); - - fprintf(dmp->f, "%-40s, %p, %d, %d, %d, %d\n", - name, - entry->irg, - cnt[0].cnt[0], - cnt[1].cnt[0], - cnt[2].cnt[0], - cnt[3].cnt[0] - ); - } -} +static void stat_dump_param_tbl(const distrib_tbl_t *tbl, graph_entry_t *global) { + dumper_t *dumper; + + for (dumper = status->dumper; dumper; dumper = dumper->next) { + if (dumper->dump_param_tbl) + dumper->dump_param_tbl(dumper, tbl, global); + } /* for */ +} /* stat_dump_param_tbl */ /** - * initialise the simple dumper + * Dumps the optimization counter */ -static void csv_init(dumper_t *dmp, const char *name) -{ - dmp->f = fopen(name, "a"); -} +static void stat_dump_opt_cnt(const counter_t *tbl, unsigned len) { + dumper_t *dumper; + + for (dumper = status->dumper; dumper; dumper = dumper->next) { + if (dumper->dump_opt_cnt) + dumper->dump_opt_cnt(dumper, tbl, len); + } /* for */ +} /* stat_dump_opt_cnt */ /** - * finishes the simple dumper + * Initialize the dumper. */ -static void csv_finish(dumper_t *dmp) -{ - fclose(dmp->f); - dmp->f = NULL; -} +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 */ /** - * the simple human readable dumper + * Finish the dumper. */ -static dumper_t csv_dumper = { - csv_dump_graph, - csv_init, - csv_finish, - NULL, - NULL, -}; +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 */ + +/** + * Register an additional function for all dumper. + */ +void stat_register_dumper_func(dump_graph_FUNC func) { + dumper_t *dumper; + + for (dumper = status->dumper; dumper; dumper = dumper->next) { + if (! dumper->func_map) + dumper->func_map = pset_new_ptr(3); + pset_insert_ptr(dumper->func_map, func); + } /* for */ +} /* stat_register_dumper_func */ /* ---------------------------------------------------------------------- */ -/* initialize the statistics module. */ -void stat_init(void) -{ -#define X(a) a, sizeof(a)-1 +/* + * Helper: get an ir_op from an opcode. + */ +ir_op *stat_get_op_from_opcode(ir_opcode code) { + return opcode_find_entry(code, status->ir_op_hash); +} /* stat_get_op_from_opcode */ - int pseudo_id = 0; +/** + * 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) { + (void) ctx; + if (! status->stat_options) + return; - obstack_init(&status->cnts); + STAT_ENTER; + { + graph_entry_t *graph = graph_get_entry(NULL, status->irg_hash); - /* build the pseudo-ops */ - _op_Phi0.code = --pseudo_id; - _op_Phi0.name = id_from_str(X("Phi0")); + /* execute for side effect :-) */ + (void)opcode_get_entry(op, graph->opcode_hash); - _op_PhiM.code = --pseudo_id; - _op_PhiM.name = id_from_str(X("PhiM")); + pset_insert(status->ir_op_hash, op, op->code); + } + STAT_LEAVE; +} /* stat_new_ir_op */ - /* create the hash-tables */ - status->irg_hash = new_pset(graph_cmp, 8); +/** + * 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) { + (void) ctx; + (void) op; + if (! status->stat_options) + return; + + STAT_ENTER; + { + } + STAT_LEAVE; +} /* stat_free_ir_op */ - status->op_Phi0 = &_op_Phi0; - status->op_PhiM = &_op_PhiM; +/** + * Hook: 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) { + (void) ctx; + (void) irg; + if (! status->stat_options) + return; + + /* do NOT count during dead node elimination */ + if (status->in_dead_node_elim) + 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; +} /* stat_new_node */ - stat_register_dumper(&simple_dumper, "firmstat.txt"); - stat_register_dumper(&csv_dumper, "firmstat.csv"); +/** + * 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) { + (void) ctx; + 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; +} /* stat_turn_into_id */ -#undef X -} +/** + * Hook: 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, ir_entity *ent) { + (void) ctx; + 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_strict = 1; + graph->is_analyzed = 0; + } + STAT_LEAVE; +} /* stat_new_graph */ -/* A new IR op is registered. */ -void stat_new_ir_op(const ir_op *op) -{ - STAT_ENTER; - { - graph_entry_t *graph = graph_get_entry(NULL, status->irg_hash); - - /* execute for side effect :-) */ - opcode_get_entry(op, graph->opcode_hash); - } - STAT_LEAVE; -} +/** + * Hook: 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) { + (void) ctx; + 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); + } /* if */ + } + STAT_LEAVE; +} /* stat_free_graph */ -/* An IR op is freed. */ -void stat_free_ir_op(const ir_op *op) +/** + * Hook: 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) { - STAT_ENTER; - { - } - STAT_LEAVE; -} + (void) ctx; + (void) pre; + (void) post; + if (! status->stat_options) + return; -/* A new node is created. */ -void stat_new_node(const ir_node *node) -{ - /* 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; -} + STAT_ENTER_SINGLE; + { + graph_entry_t *graph = graph_get_entry(irg, status->irg_hash); -/* A node is changed into a Id node */ -void stat_turn_into_id(const ir_node *node) -{ - 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; -} + cnt_inc(&graph->cnt[gcnt_acc_walked]); + } + STAT_LEAVE; +} /* stat_irg_walk */ -/* A new graph was created */ -void stat_new_graph(ir_graph *irg, entity *ent) +/** + * Hook: 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) { - STAT_ENTER; - { - /* execute for side effect :-) */ - graph_entry_t * graph = graph_get_entry(irg, status->irg_hash); - - graph->ent = ent; - graph->deleted = 0; - } - STAT_LEAVE; -} + /* for now, do NOT differentiate between blockwise and normal */ + stat_irg_walk(ctx, irg, pre, post); +} /* stat_irg_walk_blkwise */ -/* - * A graph was deleted +/** + * Hook: 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 */ -void stat_free_graph(ir_graph *irg) +static void stat_irg_block_walk(void *ctx, ir_graph *irg, ir_node *node, generic_func *pre, generic_func *post) { - STAT_ENTER; - { - graph_entry_t *graph = graph_get_entry(irg, status->irg_hash); - graph_entry_t *global = graph_get_entry(NULL, status->irg_hash); + (void) ctx; + (void) node; + (void) pre; + (void) post; + if (! status->stat_options) + return; + + STAT_ENTER_SINGLE; + { + graph_entry_t *graph = graph_get_entry(irg, status->irg_hash); + + cnt_inc(&graph->cnt[gcnt_acc_walked_blocks]); + } + STAT_LEAVE; +} /* 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* + * @param kind the optimization kind + */ +static void removed_due_opt(ir_node *n, hmap_opt_entry_t *hmap, hook_opt_kind kind) { + opt_entry_t *entry; + ir_op *op = stat_get_irn_op(n); - graph->deleted = 1; + /* ignore CSE for Constants */ + if (kind == HOOK_OPT_CSE && (is_Const(n) || is_SymConst(n))) + return; - /* count the nodes of the graph yet, it will be destroyed later */ - count_nodes_in_graph(global, graph); - } - STAT_LEAVE; -} + /* increase global value */ + entry = opt_get_entry(op, hmap); + cnt_inc(&entry->count); +} /* removed_due_opt */ -/* - * A walk over a graph is initiated. Do not count walks from statistic code. +/** + * Hook: Some nodes were optimized into some others due to an optimization. + * + * @param ctx the hook context */ -void stat_irg_walk(ir_graph *irg, void *pre, void *post) +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, + hook_opt_kind opt) { - STAT_ENTER_SINGLE; - { - graph_entry_t *graph = graph_get_entry(irg, status->irg_hash); + (void) ctx; + if (! status->stat_options) + return; + + STAT_ENTER; + { + int i, j; + graph_entry_t *graph = graph_get_entry(current_ir_graph, status->irg_hash); + + cnt_inc(&status->num_opts[opt]); + if (status->reassoc_run) + opt = HOOK_OPT_REASSOC; + + for (i = 0; i < old_num_entries; ++i) { + /* nodes might be in new and old, so if we found a node + in both sets, this one is NOT removed */ + for (j = 0; j < new_num_entries; ++j) { + if (old_node_array[i] == new_node_array[j]) + break; + } /* for */ + 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; + } /* if */ + + removed_due_opt(old_node_array[i], graph->opt_hash[xopt], xopt); + } /* if */ + } /* for */ + } + STAT_LEAVE; +} /* stat_merge_nodes */ - cnt_inc(&graph->cnt_walked); - } - STAT_LEAVE; -} +/** + * 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) { + (void) ctx; + if (! status->stat_options) + return; + + STAT_ENTER; + { + status->reassoc_run = flag; + } + STAT_LEAVE; +} /* stat_reassociate */ -/* - * A walk over the graph's blocks is initiated. Do not count walks from statistic code. +/** + * Hook: A node was lowered into other nodes + * + * @param ctx the hook context + * @param node the IR node that will be lowered */ -void stat_irg_block_walk(ir_graph *irg, const ir_node *node, void *pre, void *post) -{ - STAT_ENTER_SINGLE; - { - graph_entry_t *graph = graph_get_entry(irg, status->irg_hash); +static void stat_lower(void *ctx, ir_node *node) { + (void) ctx; + if (! status->stat_options) + return; - cnt_inc(&graph->cnt_walked_blocks); - } - STAT_LEAVE; -} + STAT_ENTER; + { + graph_entry_t *graph = graph_get_entry(current_ir_graph, status->irg_hash); + + removed_due_opt(node, graph->opt_hash[HOOK_LOWERED], HOOK_LOWERED); + } + STAT_LEAVE; +} /* stat_lower */ /** - * called for every node that is removed due to an optimization + * Hook: 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 */ -static void removed_due_opt(ir_node *n, pset *set) +static void stat_inline(void *ctx, ir_node *call, ir_graph *called_irg) { - ir_op *op = get_irn_op(n); - opt_entry_t *entry = opt_get_entry(op, set); + (void) ctx; + if (! status->stat_options) + return; + + 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[gcnt_acc_got_inlined]); + cnt_inc(&i_graph->cnt[gcnt_acc_was_inlined]); + } + STAT_LEAVE; +} /* stat_inline */ - /* increase global value */ - cnt_inc(&entry->count); -} +/** + * 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) { + (void) ctx; + if (! status->stat_options) + return; -/* - * Some nodes were optimized into some others due to an optimization + STAT_ENTER; + { + graph_entry_t *graph = graph_get_entry(irg, status->irg_hash); + + graph->num_tail_recursion += n_calls; + } + STAT_LEAVE; +} /* stat_tail_rec */ + +/** + * Strength reduction was performed on an iteration variable. + * + * @param ctx the hook context */ -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) -{ - 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; - - /* 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]); - } - } - } - STAT_LEAVE; -} +static void stat_strength_red(void *ctx, ir_graph *irg, ir_node *strong) { + (void) ctx; + if (! status->stat_options) + return; -/* - * A node was lowered into other nodes + STAT_ENTER; + { + graph_entry_t *graph = graph_get_entry(irg, status->irg_hash); + cnt_inc(&graph->cnt[gcnt_acc_strength_red]); + + removed_due_opt(strong, graph->opt_hash[HOOK_OPT_STRENGTH_RED], HOOK_OPT_STRENGTH_RED); + } + STAT_LEAVE; +} /* stat_strength_red */ + +/** + * Hook: Start/Stop the dead node elimination. + * + * @param ctx the hook context */ -void stat_lower(ir_node *node) -{ - STAT_ENTER; - { - graph_entry_t *graph = graph_get_entry(current_ir_graph, status->irg_hash); +static void stat_dead_node_elim(void *ctx, ir_graph *irg, int start) { + (void) ctx; + (void) irg; + if (! status->stat_options) + return; - removed_due_opt(node, graph->opt_hash[STAT_LOWERED]); - } - STAT_LEAVE; -} + status->in_dead_node_elim = (start != 0); +} /* stat_dead_node_elim */ -/* - * A graph was inlined +/** + * Hook: if-conversion was tried. */ -void stat_inline(ir_node *call, ir_graph *called_irg) +static void stat_if_conversion(void *context, ir_graph *irg, ir_node *phi, + int pos, ir_node *mux, if_result_t reason) { - 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; -} + (void) context; + (void) phi; + (void) pos; + (void) mux; + if (! status->stat_options) + return; + + STAT_ENTER; + { + graph_entry_t *graph = graph_get_entry(irg, status->irg_hash); + + cnt_inc(&graph->cnt[gcnt_if_conv + reason]); + } + STAT_LEAVE; +} /* stat_if_conversion */ -/* - * Start the dead node elimination. +/** + * Hook: real function call was optimized. */ -void stat_dead_node_elim_start(ir_graph *irg) +static void stat_func_call(void *context, ir_graph *irg, ir_node *call) { - ++status->in_dead_node_elim; -} + (void) context; + (void) call; + if (! status->stat_options) + return; + + STAT_ENTER; + { + graph_entry_t *graph = graph_get_entry(irg, status->irg_hash); + + cnt_inc(&graph->cnt[gcnt_acc_real_func_call]); + } + STAT_LEAVE; +} /* 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) { + (void) ctx; + 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], HOOK_OPT_ARCH_DEP); + } + STAT_LEAVE; +} /* 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) { + (void) ctx; + 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], HOOK_OPT_ARCH_DEP); + } + STAT_LEAVE; +} /* stat_arch_dep_replace_division_by_const */ /* - * Stops the dead node elimination. + * Update the register pressure of a block. + * + * @param irg the irg containing the block + * @param block the block for which the reg pressure should be set + * @param pressure the pressure + * @param class_name the name of the register class */ -void stat_dead_node_elim_stop(ir_graph *irg) +void stat_be_block_regpressure(ir_graph *irg, ir_node *block, int pressure, const char *class_name) { - --status->in_dead_node_elim; -} + if (! status->stat_options) + return; -/* Finish the statistics */ -void stat_finish(void) -{ - STAT_ENTER; - { - graph_entry_t *entry; - graph_entry_t *global = graph_get_entry(NULL, status->irg_hash); + STAT_ENTER; + { + graph_entry_t *graph = graph_get_entry(irg, status->irg_hash); + be_block_entry_t *block_ent; + reg_pressure_entry_t *rp_ent; - /* dump per graph */ - for (entry = pset_first(status->irg_hash); entry; entry = pset_next(status->irg_hash)) { + block_ent = be_block_get_entry(&status->be_data, get_irn_node_nr(block), graph->be_block_hash); + rp_ent = obstack_alloc(&status->be_data, sizeof(*rp_ent)); + memset(rp_ent, 0, sizeof(*rp_ent)); - if (entry->irg == NULL) { - /* special entry for the global count */ - continue; - } + rp_ent->class_name = class_name; + rp_ent->pressure = pressure; - if (! entry->deleted) { - /* the graph is still alive, count the nodes on it */ - count_nodes_in_graph(global, entry); - } + pset_insert(block_ent->reg_pressure, rp_ent, HASH_PTR(class_name)); + } + STAT_LEAVE; +} /* stat_be_block_regpressure */ - dump_graph(entry); - } +/** + * Update the distribution of ready nodes of a block + * + * @param irg the irg containing the block + * @param block the block for which the reg pressure should be set + * @param num_ready the number of ready nodes + */ +void stat_be_block_sched_ready(ir_graph *irg, ir_node *block, int num_ready) +{ + if (! status->stat_options) + return; - /* dump global */ - dump_graph(global); - dump_finish(); + STAT_ENTER; + { + graph_entry_t *graph = graph_get_entry(irg, status->irg_hash); + be_block_entry_t *block_ent; - } - STAT_LEAVE; -} + block_ent = be_block_get_entry(&status->be_data, get_irn_node_nr(block), graph->be_block_hash); -#else + /* increase the counter of corresponding number of ready nodes */ + stat_inc_int_distrib_tbl(block_ent->sched_ready, num_ready); + } + STAT_LEAVE; +} /* stat_be_block_sched_ready */ -/* need this for prototypes */ -#define FIRM_STATISTICS -#include "firmstat.h" +/** + * Update the permutation statistic of a block. + * + * @param class_name the name of the register class + * @param n_regs number of registers in the register class + * @param perm the perm node + * @param block the block containing the perm + * @param size the size of the perm + * @param real_size number of pairs with different registers + */ +void stat_be_block_stat_perm(const char *class_name, int n_regs, ir_node *perm, ir_node *block, + int size, int real_size) +{ + if (! status->stat_options) + return; -void stat_init(void) {} + STAT_ENTER; + { + graph_entry_t *graph = graph_get_entry(get_irn_irg(block), status->irg_hash); + be_block_entry_t *block_ent; + perm_class_entry_t *pc_ent; + perm_stat_entry_t *ps_ent; -void stat_finish(void) {} + block_ent = be_block_get_entry(&status->be_data, get_irn_node_nr(block), graph->be_block_hash); + pc_ent = perm_class_get_entry(&status->be_data, class_name, block_ent->perm_class_stat); + ps_ent = perm_stat_get_entry(&status->be_data, perm, pc_ent->perm_stat); -void stat_new_ir_op(const ir_op *op) {} + pc_ent->n_regs = n_regs; -void stat_free_ir_op(const ir_op *op) {} + /* update information */ + ps_ent->size = size; + ps_ent->real_size = real_size; + } + STAT_LEAVE; +} /* stat_be_block_stat_perm */ -void stat_new_node(const ir_node *node) {} +/** + * Update the permutation statistic of a single perm. + * + * @param class_name the name of the register class + * @param perm the perm node + * @param block the block containing the perm + * @param is_chain 1 if chain, 0 if cycle + * @param size length of the cycle/chain + * @param n_ops the number of ops representing this cycle/chain after lowering + */ +void stat_be_block_stat_permcycle(const char *class_name, ir_node *perm, ir_node *block, + int is_chain, int size, int n_ops) +{ + if (! status->stat_options) + return; + + STAT_ENTER; + { + graph_entry_t *graph = graph_get_entry(get_irn_irg(block), status->irg_hash); + be_block_entry_t *block_ent; + perm_class_entry_t *pc_ent; + perm_stat_entry_t *ps_ent; + + block_ent = be_block_get_entry(&status->be_data, get_irn_node_nr(block), graph->be_block_hash); + pc_ent = perm_class_get_entry(&status->be_data, class_name, block_ent->perm_class_stat); + ps_ent = perm_stat_get_entry(&status->be_data, perm, pc_ent->perm_stat); + + if (is_chain) { + ps_ent->n_copies += n_ops; + stat_inc_int_distrib_tbl(ps_ent->chains, size); + } else { + ps_ent->n_exchg += n_ops; + stat_inc_int_distrib_tbl(ps_ent->cycles, size); + } /* if */ + } + STAT_LEAVE; +} /* stat_be_block_stat_permcycle */ + +/* 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 /* _WIN32 */ + if (p) { + ++p; + l = p - name; + + if (l > (int) (sizeof(fname) - 1)) + l = sizeof(fname) - 1; + + memcpy(fname, name, l); + fname[l] = '\0'; + } else { + fname[0] = '\0'; + p = name; + } /* if */ + 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 */ + if (! entry->is_deleted) { + /* the graph is still alive, count the nodes on it */ + update_graph_stat(global, entry); + } /* if */ + } /* for */ + + /* 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); + } /* while */ + + /* dump per graph */ + 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 */ + + if (! entry->is_deleted || status->stat_options & FIRMSTAT_COUNT_DELETED) { + stat_dump_graph(entry); + stat_dump_registered(entry); + } /* if */ + + if (! entry->is_deleted) { + /* clear the counter that are not accumulated */ + graph_clear_entry(entry, 0); + } /* if */ + } /* for */ + + /* dump global */ + stat_dump_graph(global); + + /* dump the const info */ + if (status->stat_options & FIRMSTAT_COUNT_CONSTS) + stat_dump_consts(&status->const_info); + + /* dump the parameter distribution */ + stat_dump_param_tbl(status->dist_param_cnt, global); + + /* dump the optimization counter and clear them */ + stat_dump_opt_cnt(status->num_opts, ARR_SIZE(status->num_opts)); + clear_optimization_counter(); + + stat_dump_finish(); + + stat_finish_pattern_history(fname); + + /* 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); + } /* for */ + /* clear all global counter */ + graph_clear_entry(global, 1); + } + } + STAT_LEAVE; +} /* stat_dump_snapshot */ + +/** the hook entries for the Firm statistics module */ +static hook_entry_t stat_hooks[hook_last]; -void stat_turn_into_id(const ir_node *node) {} +/* initialize the statistics module. */ +void firm_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]) + unsigned num = 0; + + if (! (enable_options & FIRMSTAT_ENABLED)) + return; + + status = XMALLOCZ(stat_info_t); + + /* 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); + + obstack_init(&status->cnts); + obstack_init(&status->be_data); + + /* create the hash-tables */ + status->irg_hash = new_pset(graph_cmp, 8); + status->ir_op_hash = new_pset(opcode_cmp_2, 1); + + /* create the wait queue */ + status->wait_q = new_pdeq(); + + if (enable_options & FIRMSTAT_COUNT_STRONG_OP) { + /* build the pseudo-ops */ + + _op_Phi0.code = --num; + _op_Phi0.name = new_id_from_chars(X("Phi0")); + + _op_PhiM.code = --num; + _op_PhiM.name = new_id_from_chars(X("PhiM")); + + _op_ProjM.code = --num; + _op_ProjM.name = new_id_from_chars(X("ProjM")); + + _op_MulC.code = --num; + _op_MulC.name = new_id_from_chars(X("MulC")); + + _op_DivC.code = --num; + _op_DivC.name = new_id_from_chars(X("DivC")); + + _op_ModC.code = --num; + _op_ModC.name = new_id_from_chars(X("ModC")); + + _op_DivModC.code = --num; + _op_DivModC.name = new_id_from_chars(X("DivModC")); + + _op_QuotC.code = --num; + _op_QuotC.name = new_id_from_chars(X("QuotC")); + + 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; + status->op_QuotC = &_op_QuotC; + } 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; + status->op_QuotC = NULL; + } /* if */ + + /* for Florian: count the Sel depth */ + if (enable_options & FIRMSTAT_COUNT_SELS) { + _op_SelSel.code = --num; + _op_SelSel.name = new_id_from_chars(X("Sel(Sel)")); + + _op_SelSelSel.code = --num; + _op_SelSelSel.name = new_id_from_chars(X("Sel(Sel(Sel))")); + + status->op_SelSel = &_op_SelSel; + status->op_SelSelSel = &_op_SelSelSel; + } else { + status->op_SelSel = NULL; + status->op_SelSelSel = NULL; + } /* if */ + + /* 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); + + /* distribution table for parameter counts */ + status->dist_param_cnt = stat_new_int_distrib_tbl(); + + clear_optimization_counter(); + +#undef HOOK +#undef X +} /* firm_init_stat */ -void stat_new_graph(ir_graph *irg, entity *ent) {} +/** + * Frees all dumper structures. + */ +static void stat_term_dumper(void) { + dumper_t *dumper, *next_dumper; -void stat_free_graph(ir_graph *irg) {} + for (dumper = status->dumper; dumper; /* iteration done in loop body */ ) { + if (dumper->func_map) + del_pset(dumper->func_map); -void stat_irg_walk(ir_graph *irg, void *pre, void *post) {} + next_dumper = dumper->next; + free(dumper); + dumper = next_dumper; + } /* for */ +} /* stat_term_dumper */ -void stat_irg_block_walk(ir_graph *irg, const ir_node *node, void *pre, void *post) {} -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) {} +/* Terminates the statistics module, frees all memory. */ +void stat_term(void) { + if (status != (stat_info_t *)&status_disable) { + obstack_free(&status->be_data, NULL); + obstack_free(&status->cnts, NULL); + + stat_term_dumper(); -void stat_lower(ir_node *node) {} + xfree(status); + status = (stat_info_t *)&status_disable; + } +} /* stat_term */ -void stat_inline(ir_node *call, ir_graph *irg) {} +/* returns 1 if statistics were initialized, 0 otherwise */ +int stat_is_active(void) { + return status != (stat_info_t *)&status_disable; +} /* stat_is_active */ -void stat_dead_node_elim_start(ir_graph *irg) {} +#else -void stat_dead_node_elim_stop(ir_graph *irg) {} +/* initialize the statistics module. */ +void firm_init_stat(unsigned enable_options) {} -#endif +/* 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 */