X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fstat%2Ffirmstat_t.h;h=831b5dd4bdf43c8a9ff44daffde2913fc9dd3204;hb=6a768b09064c37b361871ba888213cdd5ed5a700;hp=86df6f8410c3e55073abd764856448899eca5bca;hpb=71e6a8373b7e49d4b95459b6d779354c2280d921;p=libfirm diff --git a/ir/stat/firmstat_t.h b/ir/stat/firmstat_t.h index 86df6f841..831b5dd4b 100644 --- a/ir/stat/firmstat_t.h +++ b/ir/stat/firmstat_t.h @@ -20,9 +20,14 @@ #include "irnode_t.h" #include "irgraph_t.h" #include "pset.h" +#include "pdeq.h" #include "irprog.h" #include "irgwalk.h" #include "counter.h" +#include "irhooks.h" + +/* some useful macro. */ +#define ARR_SIZE(a) (sizeof(a)/sizeof((a)[0])) /* * just be make some things clear :-), the @@ -37,59 +42,116 @@ typedef pset hmap_block_entry_t; typedef pset hmap_ir_op; typedef pset hmap_distrib_entry_t; +/** + * possible address marker values + */ +enum adr_marker_t { + MARK_ADDRESS_CALC = 1, /**< the node is an address expression */ + MARK_REF_ADR = 2, /**< the node is referenced by an address expression */ + MARK_REF_NON_ADR = 4, /**< the node is referenced by a non-address expression */ +}; + +/** + * An entry in the address_mark set + */ +typedef struct _address_mark_entry_t { + ir_node *node; /**< the node which this entry belongs to, needed for compare */ + unsigned mark; /**< the mark, a bitmask of enum adr_marker_t */ +} address_mark_entry_t; /** * An entry for ir_nodes, used in ir_graph statistics. */ 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 */ + 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; +enum leaf_call_state_t { + LCS_UNKNOWN = 0, /**< state is unknown yet */ + LCS_LEAF_CALL = 1, /**< only leaf functions will be called */ + LCS_NON_LEAF_CALL = 2, /**< at least one non-leaf function will be called or indetermined */ +}; + /** - * An entry for ir_graphs + * An entry for ir_graphs. These numbers are calculated for every IR graph. */ typedef struct _graph_entry_t { - HASH_MAP(node_entry_t) *opcode_hash; /**< hash map containing the opcode counter */ - HASH_MAP(block_entry_t) *block_hash; /**< hash map countaining the block 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_strength_red; /**< number of times strength reduction was successful on this graph */ - counter_t cnt_edges; /**< number of DF edges in this graph */ + struct obstack recalc_cnts; /**< obstack containing the counters that are recalculated */ + HASH_MAP(node_entry_t) *opcode_hash; /**< hash map containing the opcode counter */ + HASH_MAP(block_entry_t) *block_hash; /**< hash map containing the block counter */ + HASH_MAP(block_entry_t) *extbb_hash; /**< hash map containing the extended block 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_strength_red; /**< number of times strength reduction was successful on this graph */ + counter_t cnt_edges; /**< number of DF edges in this graph */ counter_t cnt_all_calls; /**< number of all calls */ + counter_t cnt_call_with_cnst_arg; /**< number of calls with const args */ counter_t cnt_indirect_calls; /**< number of indirect calls */ - 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 */ - unsigned is_deleted:1; /**< set if this irg was deleted */ - unsigned is_leaf:1; /**< set, if this irg is a leaf function */ - unsigned is_recursive:1; /**< set, if this irg has recursive calls */ - unsigned is_chain_call:1; /**< set, if this irg is a chain call */ + counter_t cnt_if_conv[IF_RESULT_LAST]; /**< number of if conversions */ + counter_t cnt_real_func_call; /**< number real function call optimization */ + unsigned num_tail_recursion; /**< number of tail recursion optimizations */ + HASH_MAP(opt_entry_t) *opt_hash[FS_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 */ + set *address_mark; /**< a set containing the address marks of the nodes */ + unsigned is_deleted:1; /**< set if this irg was deleted */ + unsigned is_leaf:1; /**< set, if this irg is a leaf function */ + unsigned is_leaf_call:2; /**< set, if this irg calls only leaf functions */ + unsigned is_recursive:1; /**< set, if this irg has recursive calls */ + unsigned is_chain_call:1; /**< set, if this irg is a chain call */ + unsigned is_analyzed:1; /**< helper: set, if this irg was already analysed */ } graph_entry_t; /** * 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 */ + counter_t count; /**< optimization counter */ + const ir_op *op; /**< the op for this entry */ } opt_entry_t; /** - * An entry for a block in a ir-graph + * An entry for a block or extended block in a ir-graph */ typedef struct _block_entry_t { - counter_t cnt_nodes; /**< the counter of nodes in this block */ - counter_t cnt_edges; /**< the counter of edges in this block */ - counter_t cnt_in_edges; /**< the counter of edges incoming from other blocks to this block */ - counter_t cnt_out_edges; /**< the counter of edges outgoing from this block to other blocks */ - long block_nr; /**< block nr */ + counter_t cnt_nodes; /**< the counter of nodes in this block */ + counter_t cnt_edges; /**< the counter of edges in this block */ + counter_t cnt_in_edges; /**< the counter of edges incoming from other blocks to this block */ + counter_t cnt_out_edges; /**< the counter of edges outgoing from this block to other blocks */ + counter_t cnt_phi_data; /**< the counter of data Phi nodes in this block */ + long block_nr; /**< block nr */ } block_entry_t; +/** An entry for an extended block in a ir-graph */ +typedef block_entry_t extbb_entry_t; + +/** + * Some potential interesting float values + */ +typedef enum _float_classify_t { + STAT_FC_0, /**< the float value 0.0 */ + STAT_FC_1, /**< the float value 1.0 */ + STAT_FC_2, /**< the float value 2.0 */ + STAT_FC_0_5, /**< the float value 0.5 */ + STAT_FC_EXACT, /**< an exact value */ + STAT_FC_OTHER, /**< all other values */ + STAT_FC_MAX /**< last value */ +} float_classify_t; + +/** + * constant info + */ +typedef struct _constant_info_t { + counter_t int_bits_count[32]; /**< distribution of bit sizes of integer constants */ + counter_t floats[STAT_FC_MAX]; /**< floating point constants */ + counter_t others; /**< all other constants */ +} constant_info_t; + /** forward */ typedef struct _dumper_t dumper_t; @@ -109,6 +171,13 @@ typedef void (*dump_graph_FUNC)(dumper_t *dmp, graph_entry_t *entry); */ typedef void (*dump_init_FUNC)(dumper_t *dmp, const char *name); +/** + * handler for dumper a constant info table + * + * @param dmp the dumper + */ +typedef void (*dump_const_table_FUNC)(dumper_t *dmp, const constant_info_t *tbl); + /** * handler for dumper finish * @@ -116,37 +185,48 @@ typedef void (*dump_init_FUNC)(dumper_t *dmp, const char *name); */ typedef void (*dump_finish_FUNC)(dumper_t *dmp); +/** + * statistics info + */ +typedef struct _statistic_info_t { + unsigned stat_options; /**< statistic options: field must be first */ + struct obstack cnts; /**< obstack containing the counters that are incremented */ + HASH_MAP(graph_entry_t) *irg_hash; /**< hash map containing the counter for irgs */ + HASH_MAP(ir_op) *ir_op_hash; /**< hash map containing all ir_ops (accessible by op_codes) */ + pdeq *wait_q; /**< wait queue for leaf call decision */ + int recursive; /**< flag for detecting recursive hook calls */ + int in_dead_node_elim; /**< set, if dead node elimination runs */ + ir_op *op_Phi0; /**< pseudo op for Phi0 */ + ir_op *op_PhiM; /**< pseudo op for memory Phi */ + ir_op *op_ProjM; /**< pseudo op for memory Proj */ + ir_op *op_MulC; /**< pseudo op for multiplication by const */ + ir_op *op_DivC; /**< pseudo op for division by const */ + ir_op *op_ModC; /**< pseudo op for modulo by const */ + ir_op *op_DivModC; /**< pseudo op for DivMod by const */ + ir_op *op_SelSel; /**< pseudo op for Sel(Sel) */ + ir_op *op_SelSelSel; /**< pseudo op for Sel(Sel(Sel)) */ + dumper_t *dumper; /**< list of dumper */ + int reassoc_run; /**< if set, reassociation is running */ + constant_info_t const_info; /**< statistic info for constants */ +} stat_info_t; /** * a dumper description */ 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 */ + dump_graph_FUNC dump_graph; /**< handler for dumping an irg */ + dump_const_table_FUNC dump_const_tbl; /**< handler for dumping a const table */ + dump_init_FUNC init; /**< handler for init */ + dump_finish_FUNC finish; /**< handler for finish */ + FILE *f; /**< the file to dump to */ + stat_info_t *status; /**< access to the global status */ + dumper_t *next; /**< link to the next dumper */ }; /** - * statistics info + * helper: get an ir_op from an opcode */ -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 */ - HASH_MAP(ir_op) *ir_op_hash; /**< hash map containing all ir_ops (accessible by op_codes) */ - int recursive; /**< flag for detecting recursive hook calls */ - int in_dead_node_elim; /**< set, if dead node elimination runs */ - ir_op *op_Phi0; /**< pseudo op for Phi0 */ - ir_op *op_PhiM; /**< pseudo op for memory Phi */ - ir_op *op_MulC; /**< pseudo op for multiplication by const */ - ir_op *op_DivC; /**< pseudo op for division by const */ - ir_op *op_ModC; /**< pseudo op for modulo by const */ - ir_op *op_DivModC; /**< pseudo op for DivMod by const */ - dumper_t *dumper; /**< list of dumper */ - int reassoc_run; /**< if set, reassociation is running */ - int enable; /**< if set, statistic is enabled */ -} stat_info_t; +ir_op *stat_get_op_from_opcode(opcode code); /** * An entry in a distribution table @@ -165,14 +245,14 @@ typedef unsigned (*distrib_hash_fun)(const void *object); typedef struct _distrib_tbl_t { struct obstack cnts; /**< obstack containing the distrib_entry_t entries */ HASH_MAP(distrib_entry_t) *hash_map; /**< the hash map containing the distribution */ - distrib_hash_fun hash_func; /**< the hash function for object in this distribution */ + distrib_hash_fun hash_func; /**< the hash function for object in this distribution */ unsigned int_dist; /**< non-zero, if it's a integer distribution */ } distrib_tbl_t; /* API for distribution tables */ /** - * creates a new distribution table + * creates a new distribution table. * * @param cmp_func Compare function for objects in the distribution * @param hash_func Hash function for objects in the distribution @@ -180,31 +260,31 @@ typedef struct _distrib_tbl_t { distrib_tbl_t *stat_new_distrib_tbl(pset_cmp_fun cmp_func, distrib_hash_fun hash_func); /** - * creates a new distribution table for an integer distribution + * creates a new distribution table for an integer distribution. */ distrib_tbl_t *stat_new_int_distrib_tbl(void); /** - * destroys a distribution table + * destroys a distribution table. */ void stat_delete_distrib_tbl(distrib_tbl_t *tbl); /** - * adds a new object count into the distribution table + * adds a new object count into the distribution table. */ void stat_add_distrib_tbl(distrib_tbl_t *tbl, const void *object, const counter_t *cnt); /** - * adds a new key count into the integer distribution table + * adds a new key count into the integer distribution table. */ void stat_add_int_distrib_tbl(distrib_tbl_t *tbl, int key, const counter_t *cnt); /** - * calculates the mean value of a distribution + * calculates the mean value of a distribution. */ double stat_calc_mean_distrib_tbl(distrib_tbl_t *tbl); -/** evaluates each entry of a distribution table */ +/** evaluates each entry of a distribution table. */ typedef void (*eval_distrib_entry_fun)(const distrib_entry_t *entry); /** @@ -212,4 +292,27 @@ typedef void (*eval_distrib_entry_fun)(const distrib_entry_t *entry); */ void stat_iterate_distrib_tbl(distrib_tbl_t *tbl, eval_distrib_entry_fun eval); +/** + * update info on Consts. + * + * @param node The Const node + * @param graph The graph entry containing the call + */ +void stat_update_const(stat_info_t *status, ir_node *node, graph_entry_t *graph); + +/** + * clears the const statistics for a new snapshot. + */ +void stat_const_clear(stat_info_t *status); + +/** + * initialize the Const statistic. + */ +void stat_init_const_cnt(stat_info_t *status); + +/** + * return a human readable name for an float classification + */ +const char *stat_fc_name(float_classify_t classification); + #endif /* _FIRMSTAT_T_H_ */