3 * File name: ir/stat/firmstat_t.h
4 * Purpose: Statistics for Firm. Internal data structures.
8 * Copyright: (c) 2004 Universität Karlsruhe
9 * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
11 #ifndef _FIRMSTAT_T_H_
12 #define _FIRMSTAT_T_H_
21 #include "irgraph_t.h"
29 /* some useful macro. */
30 #define ARR_SIZE(a) (sizeof(a)/sizeof((a)[0]))
33 * just be make some things clear :-), the
36 #define HASH_MAP(type) hmap_##type
38 typedef pset hmap_node_entry_t;
39 typedef pset hmap_graph_entry_t;
40 typedef pset hmap_opt_entry_t;
41 typedef pset hmap_block_entry_t;
42 typedef pset hmap_be_block_entry_t;
43 typedef pset hmap_reg_pressure_entry_t;
44 typedef pset hmap_perm_stat_entry_t;
45 typedef pset hmap_perm_class_entry_t;
46 typedef pset hmap_ir_op;
47 typedef pset hmap_distrib_entry_t;
50 * An entry in a distribution table
52 typedef struct _distrib_entry_t {
53 counter_t cnt; /**< the current count */
54 const void *object; /**< the object which is counted */
57 /** The type of the hash function for objects in distribution tables. */
58 typedef unsigned (*distrib_hash_fun)(const void *object);
61 * The distribution table.
63 typedef struct _distrib_tbl_t {
64 struct obstack cnts; /**< obstack containing the distrib_entry_t entries */
65 HASH_MAP(distrib_entry_t) *hash_map; /**< the hash map containing the distribution */
66 distrib_hash_fun hash_func; /**< the hash function for object in this distribution */
67 unsigned int_dist; /**< non-zero, if it's a integer distribution */
71 * possible address marker values
74 MARK_ADDRESS_CALC = 1, /**< the node is an address expression */
75 MARK_REF_ADR = 2, /**< the node is referenced by an address expression */
76 MARK_REF_NON_ADR = 4, /**< the node is referenced by a non-address expression */
80 * An entry in the address_mark set
82 typedef struct _address_mark_entry_t {
83 ir_node *node; /**< the node which this entry belongs to, needed for compare */
84 unsigned mark; /**< the mark, a bitmask of enum adr_marker_t */
85 } address_mark_entry_t;
88 * An entry for ir_nodes, used in ir_graph statistics.
90 typedef struct _node_entry_t {
91 counter_t cnt_alive; /**< amount of nodes in this entry */
92 counter_t new_node; /**< amount of new nodes for this entry */
93 counter_t into_Id; /**< amount of nodes that turned into Id's for this entry */
94 const ir_op *op; /**< the op for this entry */
97 enum leaf_call_state_t {
98 LCS_UNKNOWN = 0, /**< state is unknown yet */
99 LCS_LEAF_CALL = 1, /**< only leaf functions will be called */
100 LCS_NON_LEAF_CALL = 2, /**< at least one non-leaf function will be called or indetermined */
104 * An entry for ir_graphs. These numbers are calculated for every IR graph.
106 typedef struct _graph_entry_t {
107 struct obstack recalc_cnts; /**< obstack containing the counters that are recalculated */
108 HASH_MAP(node_entry_t) *opcode_hash; /**< hash map containing the opcode counter */
109 HASH_MAP(block_entry_t) *block_hash; /**< hash map containing the block counter */
110 HASH_MAP(block_entry_t) *extbb_hash; /**< hash map containing the extended block counter */
111 HASH_MAP(be_block_entry_t) *be_block_hash; /**< hash map containing backend block information */
112 counter_t cnt_walked; /**< walker walked over the graph */
113 counter_t cnt_walked_blocks; /**< walker walked over the graph blocks */
114 counter_t cnt_was_inlined; /**< number of times other graph were inlined */
115 counter_t cnt_got_inlined; /**< number of times this graph was inlined */
116 counter_t cnt_strength_red; /**< number of times strength reduction was successful on this graph */
117 counter_t cnt_edges; /**< number of DF edges in this graph */
118 counter_t cnt_all_calls; /**< number of all calls */
119 counter_t cnt_call_with_cnst_arg; /**< number of calls with const args */
120 counter_t cnt_indirect_calls; /**< number of indirect calls */
121 counter_t cnt_if_conv[IF_RESULT_LAST]; /**< number of if conversions */
122 counter_t cnt_real_func_call; /**< number real function call optimization */
123 unsigned num_tail_recursion; /**< number of tail recursion optimizations */
124 HASH_MAP(opt_entry_t) *opt_hash[FS_OPT_MAX]; /**< hash maps containing opcode counter for optimizations */
125 ir_graph *irg; /**< the graph of this object */
126 entity *ent; /**< the entity of this graph if one exists */
127 set *address_mark; /**< a set containing the address marks of the nodes */
128 unsigned is_deleted:1; /**< set if this irg was deleted */
129 unsigned is_leaf:1; /**< set, if this irg is a leaf function */
130 unsigned is_leaf_call:2; /**< set, if this irg calls only leaf functions */
131 unsigned is_recursive:1; /**< set, if this irg has recursive calls */
132 unsigned is_chain_call:1; /**< set, if this irg is a chain call */
133 unsigned is_analyzed:1; /**< helper: set, if this irg was already analysed */
137 * An entry for optimized ir_nodes
139 typedef struct _opt_entry_t {
140 counter_t count; /**< optimization counter */
141 const ir_op *op; /**< the op for this entry */
145 * An entry for register pressure.
147 typedef struct _reg_pressure_entry_t {
148 const char *class_name; /**< name of the register class */
149 int pressure; /**< the register pressure for this class */
150 } reg_pressure_entry_t;
153 * An entry for permutation statistics.
155 typedef struct _perm_stat_entry_t {
156 ir_node *perm; /**< the perm node */
157 int size; /**< complete size */
158 int real_size; /**< number of pairs with different registers */
159 int n_copies; /**< number of copies created for lowering */
160 int n_exchg; /**< number of exchanges created for lowering */
161 distrib_tbl_t *cycles; /**< distribution of cycle lengths */
162 distrib_tbl_t *chains; /**< distribution of chain lengths */
166 * An entry for permutation statistics per class.
168 typedef struct _perm_class_entry_t {
169 const char *class_name; /**< name of the register class */
170 int n_regs; /**< number of register in this class */
171 HASH_MAP(perm_stat_entry_t) *perm_stat; /**< statistics about all perm nodes of this class */
172 } perm_class_entry_t;
175 * An entry for a block or extended block in a ir-graph
177 typedef struct _be_block_entry_t {
178 long block_nr; /**< block nr */
179 distrib_tbl_t *sched_ready; /**< distribution of ready nodes per block */
180 /**< the highest register pressures for this block for each register class */
181 HASH_MAP(reg_pressure_entry_t) *reg_pressure;
182 HASH_MAP(perm_class_entry_t) *perm_class_stat; /**< statistics about perm nodes for each register class */
186 * An entry for a block or extended block in a ir-graph
188 typedef struct _block_entry_t {
189 counter_t cnt_nodes; /**< the counter of nodes in this block */
190 counter_t cnt_edges; /**< the counter of edges in this block */
191 counter_t cnt_in_edges; /**< the counter of edges incoming from other blocks to this block */
192 counter_t cnt_out_edges; /**< the counter of edges outgoing from this block to other blocks */
193 counter_t cnt_phi_data; /**< the counter of data Phi nodes in this block */
194 long block_nr; /**< block nr */
197 /** An entry for an extended block in a ir-graph */
198 typedef block_entry_t extbb_entry_t;
201 * Some potential interesting float values
203 typedef enum _float_classify_t {
204 STAT_FC_0, /**< the float value 0.0 */
205 STAT_FC_1, /**< the float value 1.0 */
206 STAT_FC_2, /**< the float value 2.0 */
207 STAT_FC_0_5, /**< the float value 0.5 */
208 STAT_FC_EXACT, /**< an exact value */
209 STAT_FC_OTHER, /**< all other values */
210 STAT_FC_MAX /**< last value */
216 typedef struct _constant_info_t {
217 counter_t int_bits_count[32]; /**< distribution of bit sizes of integer constants */
218 counter_t floats[STAT_FC_MAX]; /**< floating point constants */
219 counter_t others; /**< all other constants */
223 typedef struct _dumper_t dumper_t;
226 * handler for dumping an IRG
228 * @param dmp the dumper
229 * @param entry the IR-graph hash map entry
231 typedef void (*dump_graph_FUNC)(dumper_t *dmp, graph_entry_t *entry);
234 * handler for dumper init
236 * @param dmp the dumper
237 * @param name name of the file to dump to
239 typedef void (*dump_init_FUNC)(dumper_t *dmp, const char *name);
242 * handler for dumper a constant info table
244 * @param dmp the dumper
246 typedef void (*dump_const_table_FUNC)(dumper_t *dmp, const constant_info_t *tbl);
249 * handler for dumper finish
251 * @param dmp the dumper
253 typedef void (*dump_finish_FUNC)(dumper_t *dmp);
258 typedef struct _statistic_info_t {
259 unsigned stat_options; /**< statistic options: field must be first */
260 struct obstack cnts; /**< obstack containing the counters that are incremented */
261 struct obstack be_data; /**< obstack containing backend statistics data */
262 HASH_MAP(graph_entry_t) *irg_hash; /**< hash map containing the counter for irgs */
263 HASH_MAP(ir_op) *ir_op_hash; /**< hash map containing all ir_ops (accessible by op_codes) */
264 pdeq *wait_q; /**< wait queue for leaf call decision */
265 int recursive; /**< flag for detecting recursive hook calls */
266 int in_dead_node_elim; /**< set, if dead node elimination runs */
267 ir_op *op_Phi0; /**< pseudo op for Phi0 */
268 ir_op *op_PhiM; /**< pseudo op for memory Phi */
269 ir_op *op_ProjM; /**< pseudo op for memory Proj */
270 ir_op *op_MulC; /**< pseudo op for multiplication by const */
271 ir_op *op_DivC; /**< pseudo op for division by const */
272 ir_op *op_ModC; /**< pseudo op for modulo by const */
273 ir_op *op_DivModC; /**< pseudo op for DivMod by const */
274 ir_op *op_SelSel; /**< pseudo op for Sel(Sel) */
275 ir_op *op_SelSelSel; /**< pseudo op for Sel(Sel(Sel)) */
276 dumper_t *dumper; /**< list of dumper */
277 int reassoc_run; /**< if set, reassociation is running */
278 constant_info_t const_info; /**< statistic info for constants */
282 * a dumper description
285 dump_graph_FUNC dump_graph; /**< handler for dumping an irg */
286 dump_const_table_FUNC dump_const_tbl; /**< handler for dumping a const table */
287 dump_init_FUNC init; /**< handler for init */
288 dump_finish_FUNC finish; /**< handler for finish */
289 FILE *f; /**< the file to dump to */
290 stat_info_t *status; /**< access to the global status */
291 dumper_t *next; /**< link to the next dumper */
295 * helper: get an ir_op from an opcode
297 ir_op *stat_get_op_from_opcode(opcode code);
299 /* API for distribution tables */
302 * creates a new distribution table.
304 * @param cmp_func Compare function for objects in the distribution
305 * @param hash_func Hash function for objects in the distribution
307 distrib_tbl_t *stat_new_distrib_tbl(pset_cmp_fun cmp_func, distrib_hash_fun hash_func);
310 * creates a new distribution table for an integer distribution.
312 distrib_tbl_t *stat_new_int_distrib_tbl(void);
315 * destroys a distribution table.
317 void stat_delete_distrib_tbl(distrib_tbl_t *tbl);
320 * adds a new object count into the distribution table.
322 void stat_add_distrib_tbl(distrib_tbl_t *tbl, const void *object, const counter_t *cnt);
325 * adds a new key count into the integer distribution table.
327 void stat_add_int_distrib_tbl(distrib_tbl_t *tbl, int key, const counter_t *cnt);
330 * increases object count by one
332 void stat_inc_distrib_tbl(distrib_tbl_t *tbl, const void *object);
335 * increases key count by one
337 void stat_inc_int_distrib_tbl(distrib_tbl_t *tbl, int key);
340 * inserts a new object with count 0 into the distribution table
341 * if object is already present, nothing happens
343 void stat_insert_distrib_tbl(distrib_tbl_t *tbl, const void *object);
346 * inserts a new key with count 0 into the integer distribution table
347 * if key is already present, nothing happens
349 void stat_insert_int_distrib_tbl(distrib_tbl_t *tbl, int key);
352 * returns the sum over all counters in a distribution table
354 int stat_get_count_distrib_tbl(distrib_tbl_t *tbl);
357 * calculates the mean value of a distribution.
359 double stat_calc_mean_distrib_tbl(distrib_tbl_t *tbl);
362 * calculates the average value of a distribution
364 double stat_calc_avg_distrib_tbl(distrib_tbl_t *tbl);
366 /** evaluates each entry of a distribution table. */
367 typedef void (*eval_distrib_entry_fun)(const distrib_entry_t *entry, void *env);
370 * iterates over all entries in a distribution table
372 void stat_iterate_distrib_tbl(distrib_tbl_t *tbl, eval_distrib_entry_fun eval, void *env);
375 * update info on Consts.
377 * @param node The Const node
378 * @param graph The graph entry containing the call
380 void stat_update_const(stat_info_t *status, ir_node *node, graph_entry_t *graph);
383 * clears the const statistics for a new snapshot.
385 void stat_const_clear(stat_info_t *status);
388 * initialize the Const statistic.
390 void stat_init_const_cnt(stat_info_t *status);
393 * return a human readable name for an float classification
395 const char *stat_fc_name(float_classify_t classification);
398 * Update the register pressure of a block
400 * @param irg the irg containing the block
401 * @param block the block for which the reg pressure should be set
402 * @param pressure the pressure
403 * @param class_name the name of the register class
405 void stat_be_block_regpressure(ir_graph *irg, ir_node *block, int pressure, const char *class_name);
408 * Update the distribution of ready nodes of a block
410 * @param irg the irg containing the block
411 * @param block the block for which the reg pressure should be set
412 * @param num_ready the number of ready nodes
414 void stat_be_block_sched_ready(ir_graph *irg, ir_node *block, int num_ready);
417 * Update the permutation statistic of a block
419 * @param class_name the name of the register class
420 * @param perm the perm node
421 * @param block the block containing the perm
422 * @param size the size of the perm
423 * @param real_size number of pairs with different registers
425 void stat_be_block_stat_perm(const char *class_name, int n_regs, ir_node *perm, ir_node *block,
426 int size, int real_size);
429 * Update the permutation statistic of a single perm
431 * @param class_name the name of the register class
432 * @param perm the perm node
433 * @param block the block containing the perm
434 * @param is_chain 1 if chain, 0 if cycle
435 * @param size length of the cycle/chain
436 * @param n_ops the number of ops representing this cycle/chain after lowering
438 void stat_be_block_stat_permcycle(const char *class_name, ir_node *perm, ir_node *block,
439 int is_chain, int size, int n_ops);
442 #endif /* _FIRMSTAT_T_H_ */