2 * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Statistics for Firm.
23 * @author Michael Beck
30 #ifdef FIRM_STATISTICS
44 #include "firmstat_t.h"
52 * need this to be static:
53 * Special pseudo Opcodes that we need to count some interesting cases
57 * The Phi0, a node that is created during SSA construction
59 static ir_op _op_Phi0;
61 /** The PhiM, just to count memory Phi's. */
62 static ir_op _op_PhiM;
64 /** The Mul by Const node. */
65 static ir_op _op_MulC;
67 /** The Div by Const node. */
68 static ir_op _op_DivC;
70 /** The Div by Const node. */
71 static ir_op _op_ModC;
73 /** The Div by Const node. */
74 static ir_op _op_DivModC;
76 /** The Quot by Const node. */
77 static ir_op _op_QuotC;
79 /** The memory Proj node. */
80 static ir_op _op_ProjM;
83 static ir_op _op_SelSel;
85 /** A Sel of a Sel of a Sel */
86 static ir_op _op_SelSelSel;
88 /* ---------------------------------------------------------------------------------- */
90 /** Marks the begin of a statistic (hook) function. */
91 #define STAT_ENTER ++status->recursive
93 /** Marks the end of a statistic (hook) functions. */
94 #define STAT_LEAVE --status->recursive
96 /** Allows to enter a statistic function only when we are not already in a hook. */
97 #define STAT_ENTER_SINGLE do { if (status->recursive > 0) return; ++status->recursive; } while (0)
102 static const unsigned status_disable = 0;
103 static stat_info_t *status = (stat_info_t *)&status_disable;
106 * Compare two elements of the opcode hash.
108 static int opcode_cmp(const void *elt, const void *key) {
109 const node_entry_t *e1 = elt;
110 const node_entry_t *e2 = key;
112 return e1->op->code - e2->op->code;
116 * Compare two elements of the graph hash.
118 static int graph_cmp(const void *elt, const void *key) {
119 const graph_entry_t *e1 = elt;
120 const graph_entry_t *e2 = key;
122 return e1->irg != e2->irg;
126 * Compare two elements of the optimization hash.
128 static int opt_cmp(const void *elt, const void *key) {
129 const opt_entry_t *e1 = elt;
130 const opt_entry_t *e2 = key;
132 return e1->op->code != e2->op->code;
136 * Compare two elements of the block/extbb hash.
138 static int block_cmp(const void *elt, const void *key) {
139 const block_entry_t *e1 = elt;
140 const block_entry_t *e2 = key;
142 /* it's enough to compare the block number */
143 return e1->block_nr != e2->block_nr;
147 * Compare two elements of the be_block hash.
149 static int be_block_cmp(const void *elt, const void *key) {
150 const be_block_entry_t *e1 = elt;
151 const be_block_entry_t *e2 = key;
153 return e1->block_nr != e2->block_nr;
157 * Compare two elements of reg pressure hash.
159 static int reg_pressure_cmp(const void *elt, const void *key) {
160 const reg_pressure_entry_t *e1 = elt;
161 const reg_pressure_entry_t *e2 = key;
163 return e1->class_name != e2->class_name;
164 } /* reg_pressure_cmp */
167 * Compare two elements of the perm_stat hash.
169 static int perm_stat_cmp(const void *elt, const void *key) {
170 const perm_stat_entry_t *e1 = elt;
171 const perm_stat_entry_t *e2 = key;
173 return e1->perm != e2->perm;
174 } /* perm_stat_cmp */
177 * Compare two elements of the perm_class hash.
179 static int perm_class_cmp(const void *elt, const void *key) {
180 const perm_class_entry_t *e1 = elt;
181 const perm_class_entry_t *e2 = key;
183 return e1->class_name != e2->class_name;
184 } /* perm_class_cmp */
187 * Compare two elements of the ir_op hash.
189 static int opcode_cmp_2(const void *elt, const void *key) {
190 const ir_op *e1 = elt;
191 const ir_op *e2 = key;
193 return e1->code != e2->code;
197 * Compare two elements of the address_mark set.
199 static int address_mark_cmp(const void *elt, const void *key, size_t size) {
200 const address_mark_entry_t *e1 = elt;
201 const address_mark_entry_t *e2 = key;
204 /* compare only the nodes, the rest is used as data container */
205 return e1->node != e2->node;
206 } /* address_mark_cmp */
209 * Clear all counter in a node_entry_t.
211 static void opcode_clear_entry(node_entry_t *elem) {
212 cnt_clr(&elem->cnt_alive);
213 cnt_clr(&elem->new_node);
214 cnt_clr(&elem->into_Id);
215 } /* opcode_clear_entry */
218 * Returns the associates node_entry_t for an ir_op
220 * @param op the IR operation
221 * @param hmap a hash map containing ir_op* -> node_entry_t*
223 static node_entry_t *opcode_get_entry(const ir_op *op, hmap_node_entry_t *hmap) {
229 elem = pset_find(hmap, &key, op->code);
233 elem = obstack_alloc(&status->cnts, sizeof(*elem));
234 memset(elem, 0, sizeof(*elem));
237 opcode_clear_entry(elem);
241 return pset_insert(hmap, elem, op->code);
242 } /* opcode_get_entry */
245 * Returns the associates ir_op for an opcode
247 * @param code the IR opcode
248 * @param hmap the hash map containing opcode -> ir_op*
250 static ir_op *opcode_find_entry(ir_opcode code, hmap_ir_op *hmap) {
254 return pset_find(hmap, &key, code);
255 } /* opcode_find_entry */
258 * Clears all counter in a graph_entry_t.
260 * @param elem the graph entry
261 * @param all if non-zero, clears all counters, else leave accumulated ones
263 static void graph_clear_entry(graph_entry_t *elem, int all) {
266 /* clear accumulated / non-accumulated counter */
267 for (i = all ? 0 : _gcnt_non_acc; i < _gcnt_last; ++i) {
268 cnt_clr(&elem->cnt[i]);
271 if (elem->block_hash) {
272 del_pset(elem->block_hash);
273 elem->block_hash = NULL;
276 if (elem->extbb_hash) {
277 del_pset(elem->extbb_hash);
278 elem->extbb_hash = NULL;
281 obstack_free(&elem->recalc_cnts, NULL);
282 obstack_init(&elem->recalc_cnts);
283 } /* graph_clear_entry */
286 * Returns the associated graph_entry_t for an IR graph.
288 * @param irg the IR graph
289 * @param hmap the hash map containing ir_graph* -> graph_entry_t*
291 static graph_entry_t *graph_get_entry(ir_graph *irg, hmap_graph_entry_t *hmap)
299 elem = pset_find(hmap, &key, HASH_PTR(irg));
302 /* create hash map backend block information */
303 if (! elem->be_block_hash)
304 elem->be_block_hash = new_pset(be_block_cmp, 5);
309 /* allocate a new one */
310 elem = obstack_alloc(&status->cnts, sizeof(*elem));
311 memset(elem, 0, sizeof(*elem));
312 obstack_init(&elem->recalc_cnts);
315 graph_clear_entry(elem, 1);
317 /* new hash table for opcodes here */
318 elem->opcode_hash = new_pset(opcode_cmp, 5);
319 elem->address_mark = new_set(address_mark_cmp, 5);
322 /* these hash tables are created on demand */
323 elem->block_hash = NULL;
324 elem->extbb_hash = NULL;
326 for (i = 0; i < sizeof(elem->opt_hash)/sizeof(elem->opt_hash[0]); ++i)
327 elem->opt_hash[i] = new_pset(opt_cmp, 4);
329 return pset_insert(hmap, elem, HASH_PTR(irg));
330 } /* graph_get_entry */
333 * Clear all counter in an opt_entry_t.
335 static void opt_clear_entry(opt_entry_t *elem) {
336 cnt_clr(&elem->count);
337 } /* opt_clear_entry */
340 * Returns the associated opt_entry_t for an IR operation.
342 * @param op the IR operation
343 * @param hmap the hash map containing ir_op* -> opt_entry_t*
345 static opt_entry_t *opt_get_entry(const ir_op *op, hmap_opt_entry_t *hmap)
352 elem = pset_find(hmap, &key, op->code);
356 elem = obstack_alloc(&status->cnts, sizeof(*elem));
357 memset(elem, 0, sizeof(*elem));
359 /* clear new counter */
360 opt_clear_entry(elem);
364 return pset_insert(hmap, elem, op->code);
365 } /* opt_get_entry */
368 * clears all counter in a block_entry_t
370 static void block_clear_entry(block_entry_t *elem) {
373 for (i = 0; i < _bcnt_last; ++i)
374 cnt_clr(&elem->cnt[i]);
375 } /* block_clear_entry */
378 * Returns the associated block_entry_t for an block.
380 * @param block_nr an IR block number
381 * @param hmap a hash map containing long -> block_entry_t
383 static block_entry_t *block_get_entry(struct obstack *obst, long block_nr, hmap_block_entry_t *hmap)
388 key.block_nr = block_nr;
390 elem = pset_find(hmap, &key, block_nr);
394 elem = obstack_alloc(obst, sizeof(*elem));
395 memset(elem, 0, sizeof(*elem));
397 /* clear new counter */
398 block_clear_entry(elem);
400 elem->block_nr = block_nr;
402 return pset_insert(hmap, elem, block_nr);
403 } /* block_get_entry */
406 * Clear all sets in be_block_entry_t.
408 static void be_block_clear_entry(be_block_entry_t *elem)
410 if (elem->reg_pressure)
411 del_pset(elem->reg_pressure);
413 if (elem->sched_ready)
414 stat_delete_distrib_tbl(elem->sched_ready);
416 if (elem->perm_class_stat)
417 del_pset(elem->perm_class_stat);
419 elem->reg_pressure = new_pset(reg_pressure_cmp, 5);
420 elem->sched_ready = stat_new_int_distrib_tbl();
421 elem->perm_class_stat = new_pset(perm_class_cmp, 5);
422 } /* be_block_clear_entry */
425 * Returns the associated be_block_entry_t for an block.
427 * @param block_nr an IR block number
428 * @param hmap a hash map containing long -> be_block_entry_t
430 static be_block_entry_t *be_block_get_entry(struct obstack *obst, long block_nr, hmap_be_block_entry_t *hmap)
432 be_block_entry_t key;
433 be_block_entry_t *elem;
435 key.block_nr = block_nr;
437 elem = pset_find(hmap, &key, block_nr);
441 elem = obstack_alloc(obst, sizeof(*elem));
442 memset(elem, 0, sizeof(*elem));
444 /* clear new counter */
445 be_block_clear_entry(elem);
447 elem->block_nr = block_nr;
449 return pset_insert(hmap, elem, block_nr);
450 } /* be_block_get_entry */
453 * clears all sets in perm_class_entry_t
455 static void perm_class_clear_entry(perm_class_entry_t *elem) {
457 del_pset(elem->perm_stat);
459 elem->perm_stat = new_pset(perm_stat_cmp, 5);
460 } /* perm_class_clear_entry */
463 * Returns the associated perm_class entry for a register class.
465 * @param class_name the register class name
466 * @param hmap a hash map containing class_name -> perm_class_entry_t
468 static perm_class_entry_t *perm_class_get_entry(struct obstack *obst, const char *class_name,
469 hmap_perm_class_entry_t *hmap)
471 perm_class_entry_t key;
472 perm_class_entry_t *elem;
474 key.class_name = class_name;
476 elem = pset_find(hmap, &key, HASH_PTR(class_name));
480 elem = obstack_alloc(obst, sizeof(*elem));
481 memset(elem, 0, sizeof(*elem));
483 /* clear new counter */
484 perm_class_clear_entry(elem);
486 elem->class_name = class_name;
488 return pset_insert(hmap, elem, HASH_PTR(class_name));
489 } /* perm_class_get_entry */
492 * clears all sets in perm_stat_entry_t
494 static void perm_stat_clear_entry(perm_stat_entry_t *elem) {
496 stat_delete_distrib_tbl(elem->chains);
499 stat_delete_distrib_tbl(elem->cycles);
501 elem->chains = stat_new_int_distrib_tbl();
502 elem->cycles = stat_new_int_distrib_tbl();
503 } /* perm_stat_clear_entry */
506 * Returns the associated perm_stat entry for a perm.
508 * @param perm the perm node
509 * @param hmap a hash map containing perm -> perm_stat_entry_t
511 static perm_stat_entry_t *perm_stat_get_entry(struct obstack *obst, ir_node *perm, hmap_perm_stat_entry_t *hmap)
513 perm_stat_entry_t key;
514 perm_stat_entry_t *elem;
518 elem = pset_find(hmap, &key, HASH_PTR(perm));
522 elem = obstack_alloc(obst, sizeof(*elem));
523 memset(elem, 0, sizeof(*elem));
525 /* clear new counter */
526 perm_stat_clear_entry(elem);
530 return pset_insert(hmap, elem, HASH_PTR(perm));
531 } /* perm_stat_get_entry */
534 * Clear optimizations counter,
536 static void clear_optimization_counter(void) {
538 for (i = 0; i < FS_OPT_MAX; ++i)
539 cnt_clr(&status->num_opts[i]);
543 * Returns the ir_op for an IR-node,
544 * handles special cases and return pseudo op codes.
546 * @param none an IR node
548 static ir_op *stat_get_irn_op(ir_node *node)
550 ir_op *op = get_irn_op(node);
551 ir_opcode opc = op->code;
555 if (get_irn_arity(node) == 0) {
556 /* special case, a Phi0 node, count on extra counter */
557 op = status->op_Phi0 ? status->op_Phi0 : op;
558 } else if (get_irn_mode(node) == mode_M) {
559 /* special case, a Memory Phi node, count on extra counter */
560 op = status->op_PhiM ? status->op_PhiM : op;
564 if (get_irn_mode(node) == mode_M) {
565 /* special case, a Memory Proj node, count on extra counter */
566 op = status->op_ProjM ? status->op_ProjM : op;
570 if (is_Const(get_Mul_left(node)) || is_Const(get_Mul_right(node))) {
571 /* special case, a Multiply by a const, count on extra counter */
572 op = status->op_MulC ? status->op_MulC : op;
576 if (is_Const(get_Div_right(node))) {
577 /* special case, a division by a const, count on extra counter */
578 op = status->op_DivC ? status->op_DivC : op;
582 if (is_Const(get_Mod_right(node))) {
583 /* special case, a module by a const, count on extra counter */
584 op = status->op_ModC ? status->op_ModC : op;
588 if (is_Const(get_DivMod_right(node))) {
589 /* special case, a division/modulo by a const, count on extra counter */
590 op = status->op_DivModC ? status->op_DivModC : op;
594 if (is_Const(get_Quot_right(node))) {
595 /* special case, a floating point division by a const, count on extra counter */
596 op = status->op_QuotC ? status->op_QuotC : op;
600 if (is_Sel(get_Sel_ptr(node))) {
601 /* special case, a Sel of a Sel, count on extra counter */
602 op = status->op_SelSel ? status->op_SelSel : op;
603 if (is_Sel(get_Sel_ptr(get_Sel_ptr(node)))) {
604 /* special case, a Sel of a Sel of a Sel, count on extra counter */
605 op = status->op_SelSelSel ? status->op_SelSelSel : op;
614 } /* stat_get_irn_op */
617 * update the block counter
619 static void undate_block_info(ir_node *node, graph_entry_t *graph)
621 ir_op *op = get_irn_op(node);
623 block_entry_t *b_entry;
626 /* check for block */
627 if (op == op_Block) {
628 arity = get_irn_arity(node);
629 b_entry = block_get_entry(&graph->recalc_cnts, get_irn_node_nr(node), graph->block_hash);
630 /* mark start end block to allow to filter them out */
631 if (node == get_irg_start_block(graph->irg))
632 b_entry->is_start = 1;
633 else if (node == get_irg_end_block(graph->irg))
636 /* count all incoming edges */
637 for (i = 0; i < arity; ++i) {
638 ir_node *pred = get_irn_n(node, i);
639 ir_node *other_block = get_nodes_block(pred);
640 block_entry_t *b_entry_other = block_get_entry(&graph->recalc_cnts, get_irn_node_nr(other_block), graph->block_hash);
642 cnt_inc(&b_entry->cnt[bcnt_in_edges]); /* an edge coming from another block */
643 cnt_inc(&b_entry_other->cnt[bcnt_out_edges]);
648 block = get_nodes_block(node);
649 b_entry = block_get_entry(&graph->recalc_cnts, get_irn_node_nr(block), graph->block_hash);
651 if (op == op_Phi && mode_is_datab(get_irn_mode(node))) {
652 /* count data Phi per block */
653 cnt_inc(&b_entry->cnt[bcnt_phi_data]);
656 /* we have a new node in our block */
657 cnt_inc(&b_entry->cnt[bcnt_nodes]);
659 /* don't count keep-alive edges */
663 arity = get_irn_arity(node);
665 for (i = 0; i < arity; ++i) {
666 ir_node *pred = get_irn_n(node, i);
667 ir_node *other_block;
669 other_block = get_nodes_block(pred);
671 if (other_block == block)
672 cnt_inc(&b_entry->cnt[bcnt_edges]); /* a in block edge */
674 block_entry_t *b_entry_other = block_get_entry(&graph->recalc_cnts, get_irn_node_nr(other_block), graph->block_hash);
676 cnt_inc(&b_entry->cnt[bcnt_in_edges]); /* an edge coming from another block */
677 cnt_inc(&b_entry_other->cnt[bcnt_out_edges]);
680 } /* undate_block_info */
683 * Update the extended block counter.
685 static void update_extbb_info(ir_node *node, graph_entry_t *graph)
687 ir_op *op = get_irn_op(node);
689 extbb_entry_t *eb_entry;
692 /* check for block */
693 if (op == op_Block) {
694 extbb = get_nodes_extbb(node);
695 arity = get_irn_arity(node);
696 eb_entry = block_get_entry(&graph->recalc_cnts, get_extbb_node_nr(extbb), graph->extbb_hash);
698 /* count all incoming edges */
699 for (i = 0; i < arity; ++i) {
700 ir_node *pred = get_irn_n(node, i);
701 ir_extblk *other_extbb = get_nodes_extbb(pred);
703 if (extbb != other_extbb) {
704 extbb_entry_t *eb_entry_other = block_get_entry(&graph->recalc_cnts, get_extbb_node_nr(other_extbb), graph->extbb_hash);
706 cnt_inc(&eb_entry->cnt[bcnt_in_edges]); /* an edge coming from another extbb */
707 cnt_inc(&eb_entry_other->cnt[bcnt_out_edges]);
713 extbb = get_nodes_extbb(node);
714 eb_entry = block_get_entry(&graph->recalc_cnts, get_extbb_node_nr(extbb), graph->extbb_hash);
716 if (op == op_Phi && mode_is_datab(get_irn_mode(node))) {
717 /* count data Phi per extbb */
718 cnt_inc(&eb_entry->cnt[bcnt_phi_data]);
721 /* we have a new node in our block */
722 cnt_inc(&eb_entry->cnt[bcnt_nodes]);
724 /* don't count keep-alive edges */
728 arity = get_irn_arity(node);
730 for (i = 0; i < arity; ++i) {
731 ir_node *pred = get_irn_n(node, i);
732 ir_extblk *other_extbb = get_nodes_extbb(pred);
734 if (other_extbb == extbb)
735 cnt_inc(&eb_entry->cnt[bcnt_edges]); /* a in extbb edge */
737 extbb_entry_t *eb_entry_other = block_get_entry(&graph->recalc_cnts, get_extbb_node_nr(other_extbb), graph->extbb_hash);
739 cnt_inc(&eb_entry->cnt[bcnt_in_edges]); /* an edge coming from another extbb */
740 cnt_inc(&eb_entry_other->cnt[bcnt_out_edges]);
743 } /* update_extbb_info */
746 * Calculates how many arguments of the call are const, updates
747 * param distribution.
749 static void analyse_params_of_Call(graph_entry_t *graph, ir_node *call) {
750 int i, num_const_args = 0, num_local_adr = 0;
751 int n = get_Call_n_params(call);
753 for (i = 0; i < n; ++i) {
754 ir_node *param = get_Call_param(call, i);
756 if (is_irn_constlike(param))
758 else if (is_Sel(param)) {
759 ir_node *base = param;
762 base = get_Sel_ptr(base);
763 } while (is_Sel(base));
765 if (base == get_irg_frame(current_ir_graph))
771 if (num_const_args > 0)
772 cnt_inc(&graph->cnt[gcnt_call_with_cnst_arg]);
773 if (num_const_args == n)
774 cnt_inc(&graph->cnt[gcnt_call_with_all_cnst_arg]);
775 if (num_local_adr > 0)
776 cnt_inc(&graph->cnt[gcnt_call_with_local_adr]);
778 stat_inc_int_distrib_tbl(status->dist_param_cnt, n);
779 } /* analyse_params_of_Call */
782 * Update info on calls.
784 * @param call The call
785 * @param graph The graph entry containing the call
787 static void stat_update_call(ir_node *call, graph_entry_t *graph)
789 ir_node *block = get_nodes_block(call);
790 ir_node *ptr = get_Call_ptr(call);
791 ir_entity *ent = NULL;
792 ir_graph *callee = NULL;
795 * If the block is bad, the whole subgraph will collapse later
796 * so do not count this call.
797 * This happens in dead code.
802 cnt_inc(&graph->cnt[gcnt_all_calls]);
804 /* found a call, this function is not a leaf */
807 if (is_SymConst(ptr)) {
808 if (get_SymConst_kind(ptr) == symconst_addr_ent) {
809 /* ok, we seems to know the entity */
810 ent = get_SymConst_entity(ptr);
811 callee = get_entity_irg(ent);
813 /* it is recursive, if it calls at least once */
814 if (callee == graph->irg)
815 graph->is_recursive = 1;
817 cnt_inc(&graph->cnt[gcnt_external_calls]);
820 /* indirect call, be could not predict */
821 cnt_inc(&graph->cnt[gcnt_indirect_calls]);
823 /* NOT a leaf call */
824 graph->is_leaf_call = LCS_NON_LEAF_CALL;
827 /* check, if it's a chain-call: Then, the call-block
828 * must dominate the end block. */
830 ir_node *curr = get_irg_end_block(graph->irg);
831 int depth = get_Block_dom_depth(block);
833 for (; curr != block && get_Block_dom_depth(curr) > depth;) {
834 curr = get_Block_idom(curr);
836 if (! curr || is_no_Block(curr))
841 graph->is_chain_call = 0;
844 /* check, if the callee is a leaf */
846 graph_entry_t *called = graph_get_entry(callee, status->irg_hash);
848 if (called->is_analyzed) {
849 if (! called->is_leaf)
850 graph->is_leaf_call = LCS_NON_LEAF_CALL;
854 analyse_params_of_Call(graph, call);
855 } /* stat_update_call */
858 * Update info on calls for graphs on the wait queue.
860 static void stat_update_call_2(ir_node *call, graph_entry_t *graph)
862 ir_node *block = get_nodes_block(call);
863 ir_node *ptr = get_Call_ptr(call);
864 ir_entity *ent = NULL;
865 ir_graph *callee = NULL;
868 * If the block is bad, the whole subgraph will collapse later
869 * so do not count this call.
870 * This happens in dead code.
875 if (is_SymConst(ptr)) {
876 if (get_SymConst_kind(ptr) == symconst_addr_ent) {
877 /* ok, we seems to know the entity */
878 ent = get_SymConst_entity(ptr);
879 callee = get_entity_irg(ent);
883 /* check, if the callee is a leaf */
885 graph_entry_t *called = graph_get_entry(callee, status->irg_hash);
887 assert(called->is_analyzed);
889 if (! called->is_leaf)
890 graph->is_leaf_call = LCS_NON_LEAF_CALL;
892 graph->is_leaf_call = LCS_NON_LEAF_CALL;
893 } /* stat_update_call_2 */
896 * Find the base address and entity of an Sel node.
898 * @param sel the node
900 * @return the base address.
902 static ir_node *find_base_adr(ir_node *sel) {
903 ir_node *ptr = get_Sel_ptr(sel);
905 while (is_Sel(ptr)) {
907 ptr = get_Sel_ptr(sel);
910 } /* find_base_adr */
913 * Update info on Load/Store address statistics.
915 static void stat_update_address(ir_node *node, graph_entry_t *graph) {
916 ir_opcode opc = get_irn_opcode(node);
922 /* a global address */
923 cnt_inc(&graph->cnt[gcnt_global_adr]);
926 base = find_base_adr(node);
927 irg = current_ir_graph;
928 if (base == get_irg_tls(irg)) {
929 /* a TLS variable, like a global. */
930 cnt_inc(&graph->cnt[gcnt_global_adr]);
931 } else if (base == get_irg_frame(irg)) {
932 /* a local Variable. */
933 cnt_inc(&graph->cnt[gcnt_local_adr]);
936 if (is_Proj(base) && skip_Proj(get_Proj_pred(base)) == get_irg_start(irg)) {
937 /* pointer access through parameter, check for THIS */
938 ir_entity *ent = get_irg_entity(irg);
941 ir_type *ent_tp = get_entity_type(ent);
943 if (get_method_calling_convention(ent_tp) & cc_this_call) {
944 if (get_Proj_proj(base) == 0) {
946 cnt_inc(&graph->cnt[gcnt_this_adr]);
951 /* other parameter */
952 cnt_inc(&graph->cnt[gcnt_param_adr]);
955 /* unknown Pointer access */
956 cnt_inc(&graph->cnt[gcnt_other_adr]);
962 } /* stat_update_address */
965 * Walker for reachable nodes count.
967 static void update_node_stat(ir_node *node, void *env)
969 graph_entry_t *graph = env;
972 ir_op *op = stat_get_irn_op(node);
973 int i, arity = get_irn_arity(node);
975 entry = opcode_get_entry(op, graph->opcode_hash);
977 cnt_inc(&entry->cnt_alive);
978 cnt_add_i(&graph->cnt[gcnt_edges], arity);
980 /* count block edges */
981 undate_block_info(node, graph);
983 /* count extended block edges */
984 if (status->stat_options & FIRMSTAT_COUNT_EXTBB) {
985 if (graph->irg != get_const_code_irg())
986 update_extbb_info(node, graph);
989 /* handle statistics for special node types */
993 /* check for properties that depends on calls like recursion/leaf/indirect call */
994 stat_update_call(node, graph);
997 /* check address properties */
998 stat_update_address(get_Load_ptr(node), graph);
1001 /* check address properties */
1002 stat_update_address(get_Store_ptr(node), graph);
1005 /* check for non-strict Phi nodes */
1006 for (i = arity - 1; i >= 0; --i) {
1007 ir_node *pred = get_Phi_pred(node, i);
1008 if (is_Unknown(pred)) {
1009 /* found an Unknown predecessor, graph is not strict */
1010 graph->is_strict = 0;
1018 /* we want to count the constant IN nodes, not the CSE'ed constant's itself */
1019 if (status->stat_options & FIRMSTAT_COUNT_CONSTS) {
1022 for (i = get_irn_arity(node) - 1; i >= 0; --i) {
1023 ir_node *pred = get_irn_n(node, i);
1025 if (is_Const(pred)) {
1026 /* check properties of constants */
1027 stat_update_const(status, pred, graph);
1031 } /* update_node_stat */
1034 * Walker for reachable nodes count for graphs on the wait_q.
1036 static void update_node_stat_2(ir_node *node, void *env) {
1037 graph_entry_t *graph = env;
1039 /* check for properties that depends on calls like recursion/leaf/indirect call */
1041 stat_update_call_2(node, graph);
1042 } /* update_node_stat_2 */
1045 * Get the current address mark.
1047 static unsigned get_adr_mark(graph_entry_t *graph, ir_node *node) {
1048 address_mark_entry_t *value = set_find(graph->address_mark, &node, sizeof(*value), HASH_PTR(node));
1050 return value ? value->mark : 0;
1051 } /* get_adr_mark */
1054 * Set the current address mark.
1056 static void set_adr_mark(graph_entry_t *graph, ir_node *node, unsigned val) {
1057 address_mark_entry_t *value = set_insert(graph->address_mark, &node, sizeof(*value), HASH_PTR(node));
1060 } /* set_adr_mark */
1062 #undef DUMP_ADR_MODE
1064 #ifdef DUMP_ADR_MODE
1066 * a vcg attribute hook: Color a node with a different color if
1067 * it's identified as a part of an address expression or at least referenced
1068 * by an address expression.
1070 static int stat_adr_mark_hook(FILE *F, ir_node *node, ir_node *local)
1072 ir_node *n = local ? local : node;
1073 ir_graph *irg = get_irn_irg(n);
1074 graph_entry_t *graph = graph_get_entry(irg, status->irg_hash);
1075 unsigned mark = get_adr_mark(graph, n);
1077 if (mark & MARK_ADDRESS_CALC)
1078 fprintf(F, "color: purple");
1079 else if ((mark & (MARK_REF_ADR | MARK_REF_NON_ADR)) == MARK_REF_ADR)
1080 fprintf(F, "color: pink");
1081 else if ((mark & (MARK_REF_ADR | MARK_REF_NON_ADR)) == (MARK_REF_ADR|MARK_REF_NON_ADR))
1082 fprintf(F, "color: lightblue");
1086 /* I know the color! */
1088 } /* stat_adr_mark_hook */
1089 #endif /* DUMP_ADR_MODE */
1092 * Return the "operational" mode of a Firm node.
1094 static ir_mode *get_irn_op_mode(ir_node *node) {
1095 switch (get_irn_opcode(node)) {
1097 return get_Load_mode(node);
1099 return get_irn_mode(get_Store_value(node));
1101 return get_irn_mode(get_DivMod_left(node));
1103 return get_irn_mode(get_Div_left(node));
1105 return get_irn_mode(get_Mod_left(node));
1107 /* Cmp is no address calculation, or is it? */
1109 return get_irn_mode(node);
1111 } /* get_irn_op_mode */
1114 * Post-walker that marks every node that is an address calculation.
1116 * Users of a node must be visited first. We ensure this by
1117 * calling it in the post of an outs walk. This should work even in cycles,
1118 * while the normal pre-walk will not.
1120 static void mark_address_calc(ir_node *node, void *env) {
1121 graph_entry_t *graph = env;
1122 ir_mode *mode = get_irn_op_mode(node);
1124 unsigned mark_preds = MARK_REF_NON_ADR;
1126 if (! mode_is_data(mode))
1129 if (mode_is_reference(mode)) {
1130 /* a reference is calculated here, we are sure */
1131 set_adr_mark(graph, node, MARK_ADDRESS_CALC);
1133 mark_preds = MARK_REF_ADR;
1135 unsigned mark = get_adr_mark(graph, node);
1137 if ((mark & (MARK_REF_ADR | MARK_REF_NON_ADR)) == MARK_REF_ADR) {
1139 * this node has no reference mode, but is only
1140 * referenced by address calculations
1142 mark_preds = MARK_REF_ADR;
1146 /* mark all predecessors */
1147 for (i = 0, n = get_irn_arity(node); i < n; ++i) {
1148 ir_node *pred = get_irn_n(node, i);
1150 mode = get_irn_op_mode(pred);
1151 if (! mode_is_data(mode))
1154 set_adr_mark(graph, pred, get_adr_mark(graph, pred) | mark_preds);
1156 } /* mark_address_calc */
1159 * Post-walker that marks every node that is an address calculation.
1161 * Users of a node must be visited first. We ensure this by
1162 * calling it in the post of an outs walk. This should work even in cycles,
1163 * while the normal pre-walk will not.
1165 static void count_adr_ops(ir_node *node, void *env) {
1166 graph_entry_t *graph = env;
1167 unsigned mark = get_adr_mark(graph, node);
1169 if (mark & MARK_ADDRESS_CALC)
1170 cnt_inc(&graph->cnt[gcnt_pure_adr_ops]);
1171 else if ((mark & (MARK_REF_ADR | MARK_REF_NON_ADR)) == MARK_REF_ADR)
1172 cnt_inc(&graph->cnt[gcnt_pure_adr_ops]);
1173 else if ((mark & (MARK_REF_ADR | MARK_REF_NON_ADR)) == (MARK_REF_ADR|MARK_REF_NON_ADR))
1174 cnt_inc(&graph->cnt[gcnt_all_adr_ops]);
1175 } /* count_adr_ops */
1178 * Called for every graph when the graph is either deleted or stat_dump_snapshot()
1179 * is called, must recalculate all statistic info.
1181 * @param global The global entry
1182 * @param graph The current entry
1184 static void update_graph_stat(graph_entry_t *global, graph_entry_t *graph)
1186 node_entry_t *entry;
1189 /* clear first the alive counter in the graph */
1190 foreach_pset(graph->opcode_hash, entry) {
1191 cnt_clr(&entry->cnt_alive);
1192 } /* foreach_pset */
1194 /* set pessimistic values */
1196 graph->is_leaf_call = LCS_UNKNOWN;
1197 graph->is_recursive = 0;
1198 graph->is_chain_call = 1;
1199 graph->is_strict = 1;
1201 /* create new block counter */
1202 graph->block_hash = new_pset(block_cmp, 5);
1204 /* we need dominator info */
1205 if (graph->irg != get_const_code_irg()) {
1206 assure_doms(graph->irg);
1208 if (status->stat_options & FIRMSTAT_COUNT_EXTBB) {
1209 /* we need extended basic blocks */
1210 compute_extbb(graph->irg);
1212 /* create new extbb counter */
1213 graph->extbb_hash = new_pset(block_cmp, 5);
1217 /* count the nodes in the graph */
1218 irg_walk_graph(graph->irg, update_node_stat, NULL, graph);
1221 /* Uncomment this code if chain-call means call exact one. */
1222 entry = opcode_get_entry(op_Call, graph->opcode_hash);
1224 /* check if we have more than 1 call */
1225 if (cnt_gt(entry->cnt_alive, 1))
1226 graph->is_chain_call = 0;
1229 /* recursive functions are never chain calls, leafs don't have calls */
1230 if (graph->is_recursive || graph->is_leaf)
1231 graph->is_chain_call = 0;
1233 /* assume we walk every graph only ONCE, we could sum here the global count */
1234 foreach_pset(graph->opcode_hash, entry) {
1235 node_entry_t *g_entry = opcode_get_entry(entry->op, global->opcode_hash);
1237 /* update the node counter */
1238 cnt_add(&g_entry->cnt_alive, &entry->cnt_alive);
1239 } /* foreach_pset */
1241 /* count the number of address calculation */
1242 if (graph->irg != get_const_code_irg()) {
1243 ir_graph *rem = current_ir_graph;
1245 assure_irg_outs(graph->irg);
1247 /* Must be done an the outs graph */
1248 current_ir_graph = graph->irg;
1249 irg_out_walk(get_irg_start(graph->irg), NULL, mark_address_calc, graph);
1250 current_ir_graph = rem;
1252 #ifdef DUMP_ADR_MODE
1253 /* register the vcg hook and dump the graph for test */
1254 set_dump_node_vcgattr_hook(stat_adr_mark_hook);
1255 dump_ir_block_graph(graph->irg, "-adr");
1256 set_dump_node_vcgattr_hook(NULL);
1257 #endif /* DUMP_ADR_MODE */
1259 irg_walk_graph(graph->irg, NULL, count_adr_ops, graph);
1262 /* count the DAG's */
1263 if (status->stat_options & FIRMSTAT_COUNT_DAG)
1264 count_dags_in_graph(global, graph);
1266 /* calculate the patterns of this graph */
1267 stat_calc_pattern_history(graph->irg);
1269 /* leaf function did not call others */
1271 graph->is_leaf_call = LCS_NON_LEAF_CALL;
1272 else if (graph->is_leaf_call == LCS_UNKNOWN) {
1273 /* we still don't know if this graph calls leaf-functions, so enqueue */
1274 pdeq_putl(status->wait_q, graph);
1277 /* we have analyzed this graph */
1278 graph->is_analyzed = 1;
1280 /* accumulate all counter's */
1281 for (i = 0; i < _gcnt_last; ++i)
1282 cnt_add(&global->cnt[i], &graph->cnt[i]);
1283 } /* update_graph_stat */
1286 * Called for every graph that was on the wait_q in stat_dump_snapshot()
1287 * must finish all statistic info calculations.
1289 * @param global The global entry
1290 * @param graph The current entry
1292 static void update_graph_stat_2(graph_entry_t *global, graph_entry_t *graph)
1295 if (graph->is_deleted) {
1296 /* deleted, ignore */
1301 /* count the nodes in the graph */
1302 irg_walk_graph(graph->irg, update_node_stat_2, NULL, graph);
1304 if (graph->is_leaf_call == LCS_UNKNOWN)
1305 graph->is_leaf_call = LCS_LEAF_CALL;
1307 } /* update_graph_stat_2 */
1310 * Register a dumper.
1312 static void stat_register_dumper(const dumper_t *dumper) {
1313 dumper_t *p = XMALLOC(dumper_t);
1315 memcpy(p, dumper, sizeof(*p));
1317 p->next = status->dumper;
1321 /* FIXME: memory leak */
1322 } /* stat_register_dumper */
1325 * Dumps the statistics of an IR graph.
1327 static void stat_dump_graph(graph_entry_t *entry) {
1330 for (dumper = status->dumper; dumper; dumper = dumper->next) {
1331 if (dumper->dump_graph)
1332 dumper->dump_graph(dumper, entry);
1334 } /* stat_dump_graph */
1337 * Calls all registered dumper functions.
1339 static void stat_dump_registered(graph_entry_t *entry) {
1342 for (dumper = status->dumper; dumper; dumper = dumper->next) {
1343 if (dumper->func_map) {
1344 dump_graph_FUNC func;
1346 foreach_pset(dumper->func_map, func)
1347 func(dumper, entry);
1350 } /* stat_dump_registered */
1353 * Dumps a constant table.
1355 static void stat_dump_consts(const constant_info_t *tbl) {
1358 for (dumper = status->dumper; dumper; dumper = dumper->next) {
1359 if (dumper->dump_const_tbl)
1360 dumper->dump_const_tbl(dumper, tbl);
1362 } /* stat_dump_consts */
1365 * Dumps the parameter distribution
1367 static void stat_dump_param_tbl(const distrib_tbl_t *tbl, graph_entry_t *global) {
1370 for (dumper = status->dumper; dumper; dumper = dumper->next) {
1371 if (dumper->dump_param_tbl)
1372 dumper->dump_param_tbl(dumper, tbl, global);
1374 } /* stat_dump_param_tbl */
1377 * Dumps the optimization counter
1379 static void stat_dump_opt_cnt(const counter_t *tbl, unsigned len) {
1382 for (dumper = status->dumper; dumper; dumper = dumper->next) {
1383 if (dumper->dump_opt_cnt)
1384 dumper->dump_opt_cnt(dumper, tbl, len);
1386 } /* stat_dump_opt_cnt */
1389 * Initialize the dumper.
1391 static void stat_dump_init(const char *name) {
1394 for (dumper = status->dumper; dumper; dumper = dumper->next) {
1396 dumper->init(dumper, name);
1398 } /* stat_dump_init */
1401 * Finish the dumper.
1403 static void stat_dump_finish(void) {
1406 for (dumper = status->dumper; dumper; dumper = dumper->next) {
1408 dumper->finish(dumper);
1410 } /* stat_dump_finish */
1413 * Register an additional function for all dumper.
1415 void stat_register_dumper_func(dump_graph_FUNC func) {
1418 for (dumper = status->dumper; dumper; dumper = dumper->next) {
1419 if (! dumper->func_map)
1420 dumper->func_map = pset_new_ptr(3);
1421 pset_insert_ptr(dumper->func_map, func);
1423 } /* stat_register_dumper_func */
1425 /* ---------------------------------------------------------------------- */
1428 * Helper: get an ir_op from an opcode.
1430 ir_op *stat_get_op_from_opcode(ir_opcode code) {
1431 return opcode_find_entry(code, status->ir_op_hash);
1432 } /* stat_get_op_from_opcode */
1435 * Hook: A new IR op is registered.
1437 * @param ctx the hook context
1438 * @param op the new IR opcode that was created.
1440 static void stat_new_ir_op(void *ctx, ir_op *op) {
1442 if (! status->stat_options)
1447 graph_entry_t *graph = graph_get_entry(NULL, status->irg_hash);
1449 /* execute for side effect :-) */
1450 (void)opcode_get_entry(op, graph->opcode_hash);
1452 pset_insert(status->ir_op_hash, op, op->code);
1455 } /* stat_new_ir_op */
1458 * Hook: An IR op is freed.
1460 * @param ctx the hook context
1461 * @param op the IR opcode that is freed
1463 static void stat_free_ir_op(void *ctx, ir_op *op) {
1466 if (! status->stat_options)
1473 } /* stat_free_ir_op */
1476 * Hook: A new node is created.
1478 * @param ctx the hook context
1479 * @param irg the IR graph on which the node is created
1480 * @param node the new IR node that was created
1482 static void stat_new_node(void *ctx, ir_graph *irg, ir_node *node) {
1485 if (! status->stat_options)
1488 /* do NOT count during dead node elimination */
1489 if (status->in_dead_node_elim)
1494 node_entry_t *entry;
1495 graph_entry_t *graph;
1496 ir_op *op = stat_get_irn_op(node);
1498 /* increase global value */
1499 graph = graph_get_entry(NULL, status->irg_hash);
1500 entry = opcode_get_entry(op, graph->opcode_hash);
1501 cnt_inc(&entry->new_node);
1503 /* increase local value */
1504 graph = graph_get_entry(current_ir_graph, status->irg_hash);
1505 entry = opcode_get_entry(op, graph->opcode_hash);
1506 cnt_inc(&entry->new_node);
1509 } /* stat_new_node */
1512 * Hook: A node is changed into a Id node
1514 * @param ctx the hook context
1515 * @param node the IR node that will be turned into an ID
1517 static void stat_turn_into_id(void *ctx, ir_node *node) {
1519 if (! status->stat_options)
1524 node_entry_t *entry;
1525 graph_entry_t *graph;
1526 ir_op *op = stat_get_irn_op(node);
1528 /* increase global value */
1529 graph = graph_get_entry(NULL, status->irg_hash);
1530 entry = opcode_get_entry(op, graph->opcode_hash);
1531 cnt_inc(&entry->into_Id);
1533 /* increase local value */
1534 graph = graph_get_entry(current_ir_graph, status->irg_hash);
1535 entry = opcode_get_entry(op, graph->opcode_hash);
1536 cnt_inc(&entry->into_Id);
1539 } /* stat_turn_into_id */
1542 * Hook: A new graph was created
1544 * @param ctx the hook context
1545 * @param irg the new IR graph that was created
1546 * @param ent the entity of this graph
1548 static void stat_new_graph(void *ctx, ir_graph *irg, ir_entity *ent) {
1550 if (! status->stat_options)
1555 /* execute for side effect :-) */
1556 graph_entry_t * graph = graph_get_entry(irg, status->irg_hash);
1559 graph->is_deleted = 0;
1561 graph->is_leaf_call = 0;
1562 graph->is_recursive = 0;
1563 graph->is_chain_call = 0;
1564 graph->is_strict = 1;
1565 graph->is_analyzed = 0;
1568 } /* stat_new_graph */
1571 * Hook: A graph will be deleted
1573 * @param ctx the hook context
1574 * @param irg the IR graph that will be deleted
1576 * Note that we still hold the information for this graph
1577 * in our hash maps, only a flag is set which prevents this
1578 * information from being changed, it's "frozen" from now.
1580 static void stat_free_graph(void *ctx, ir_graph *irg) {
1582 if (! status->stat_options)
1587 graph_entry_t *graph = graph_get_entry(irg, status->irg_hash);
1588 graph_entry_t *global = graph_get_entry(NULL, status->irg_hash);
1590 graph->is_deleted = 1;
1592 if (status->stat_options & FIRMSTAT_COUNT_DELETED) {
1593 /* count the nodes of the graph yet, it will be destroyed later */
1594 update_graph_stat(global, graph);
1598 } /* stat_free_graph */
1601 * Hook: A walk over a graph is initiated. Do not count walks from statistic code.
1603 * @param ctx the hook context
1604 * @param irg the IR graph that will be walked
1605 * @param pre the pre walker
1606 * @param post the post walker
1608 static void stat_irg_walk(void *ctx, ir_graph *irg, generic_func *pre, generic_func *post)
1613 if (! status->stat_options)
1618 graph_entry_t *graph = graph_get_entry(irg, status->irg_hash);
1620 cnt_inc(&graph->cnt[gcnt_acc_walked]);
1623 } /* stat_irg_walk */
1626 * Hook: A walk over a graph in block-wise order is initiated. Do not count walks from statistic code.
1628 * @param ctx the hook context
1629 * @param irg the IR graph that will be walked
1630 * @param pre the pre walker
1631 * @param post the post walker
1633 static void stat_irg_walk_blkwise(void *ctx, ir_graph *irg, generic_func *pre, generic_func *post)
1635 /* for now, do NOT differentiate between blockwise and normal */
1636 stat_irg_walk(ctx, irg, pre, post);
1637 } /* stat_irg_walk_blkwise */
1640 * Hook: A walk over the graph's blocks is initiated. Do not count walks from statistic code.
1642 * @param ctx the hook context
1643 * @param irg the IR graph that will be walked
1644 * @param node the IR node
1645 * @param pre the pre walker
1646 * @param post the post walker
1648 static void stat_irg_block_walk(void *ctx, ir_graph *irg, ir_node *node, generic_func *pre, generic_func *post)
1654 if (! status->stat_options)
1659 graph_entry_t *graph = graph_get_entry(irg, status->irg_hash);
1661 cnt_inc(&graph->cnt[gcnt_acc_walked_blocks]);
1664 } /* stat_irg_block_walk */
1667 * Called for every node that is removed due to an optimization.
1669 * @param n the IR node that will be removed
1670 * @param hmap the hash map containing ir_op* -> opt_entry_t*
1671 * @param kind the optimization kind
1673 static void removed_due_opt(ir_node *n, hmap_opt_entry_t *hmap, hook_opt_kind kind) {
1675 ir_op *op = stat_get_irn_op(n);
1677 /* ignore CSE for Constants */
1678 if (kind == HOOK_OPT_CSE && (is_Const(n) || is_SymConst(n)))
1681 /* increase global value */
1682 entry = opt_get_entry(op, hmap);
1683 cnt_inc(&entry->count);
1684 } /* removed_due_opt */
1687 * Hook: Some nodes were optimized into some others due to an optimization.
1689 * @param ctx the hook context
1691 static void stat_merge_nodes(
1693 ir_node **new_node_array, int new_num_entries,
1694 ir_node **old_node_array, int old_num_entries,
1698 if (! status->stat_options)
1704 graph_entry_t *graph = graph_get_entry(current_ir_graph, status->irg_hash);
1706 cnt_inc(&status->num_opts[opt]);
1707 if (status->reassoc_run)
1708 opt = HOOK_OPT_REASSOC;
1710 for (i = 0; i < old_num_entries; ++i) {
1711 /* nodes might be in new and old, so if we found a node
1712 in both sets, this one is NOT removed */
1713 for (j = 0; j < new_num_entries; ++j) {
1714 if (old_node_array[i] == new_node_array[j])
1717 if (j >= new_num_entries) {
1720 /* sometimes we did not detect, that it is replaced by a Const */
1721 if (opt == HOOK_OPT_CONFIRM && new_num_entries == 1) {
1722 ir_op *op = get_irn_op(new_node_array[0]);
1724 if (op == op_Const || op == op_SymConst)
1725 xopt = HOOK_OPT_CONFIRM_C;
1728 removed_due_opt(old_node_array[i], graph->opt_hash[xopt], xopt);
1733 } /* stat_merge_nodes */
1736 * Hook: Reassociation is started/stopped.
1738 * @param ctx the hook context
1739 * @param flag if non-zero, reassociation is started else stopped
1741 static void stat_reassociate(void *ctx, int flag) {
1743 if (! status->stat_options)
1748 status->reassoc_run = flag;
1751 } /* stat_reassociate */
1754 * Hook: A node was lowered into other nodes
1756 * @param ctx the hook context
1757 * @param node the IR node that will be lowered
1759 static void stat_lower(void *ctx, ir_node *node) {
1761 if (! status->stat_options)
1766 graph_entry_t *graph = graph_get_entry(current_ir_graph, status->irg_hash);
1768 removed_due_opt(node, graph->opt_hash[HOOK_LOWERED], HOOK_LOWERED);
1774 * Hook: A graph was inlined.
1776 * @param ctx the hook context
1777 * @param call the IR call that will re changed into the body of
1778 * the called IR graph
1779 * @param called_irg the IR graph representing the called routine
1781 static void stat_inline(void *ctx, ir_node *call, ir_graph *called_irg)
1784 if (! status->stat_options)
1789 ir_graph *irg = get_irn_irg(call);
1790 graph_entry_t *i_graph = graph_get_entry(called_irg, status->irg_hash);
1791 graph_entry_t *graph = graph_get_entry(irg, status->irg_hash);
1793 cnt_inc(&graph->cnt[gcnt_acc_got_inlined]);
1794 cnt_inc(&i_graph->cnt[gcnt_acc_was_inlined]);
1800 * Hook: A graph with tail-recursions was optimized.
1802 * @param ctx the hook context
1804 static void stat_tail_rec(void *ctx, ir_graph *irg, int n_calls) {
1806 if (! status->stat_options)
1811 graph_entry_t *graph = graph_get_entry(irg, status->irg_hash);
1813 graph->num_tail_recursion += n_calls;
1816 } /* stat_tail_rec */
1819 * Strength reduction was performed on an iteration variable.
1821 * @param ctx the hook context
1823 static void stat_strength_red(void *ctx, ir_graph *irg, ir_node *strong) {
1825 if (! status->stat_options)
1830 graph_entry_t *graph = graph_get_entry(irg, status->irg_hash);
1831 cnt_inc(&graph->cnt[gcnt_acc_strength_red]);
1833 removed_due_opt(strong, graph->opt_hash[HOOK_OPT_STRENGTH_RED], HOOK_OPT_STRENGTH_RED);
1836 } /* stat_strength_red */
1839 * Hook: Start/Stop the dead node elimination.
1841 * @param ctx the hook context
1843 static void stat_dead_node_elim(void *ctx, ir_graph *irg, int start) {
1846 if (! status->stat_options)
1849 status->in_dead_node_elim = (start != 0);
1850 } /* stat_dead_node_elim */
1853 * Hook: if-conversion was tried.
1855 static void stat_if_conversion(void *context, ir_graph *irg, ir_node *phi,
1856 int pos, ir_node *mux, if_result_t reason)
1862 if (! status->stat_options)
1867 graph_entry_t *graph = graph_get_entry(irg, status->irg_hash);
1869 cnt_inc(&graph->cnt[gcnt_if_conv + reason]);
1872 } /* stat_if_conversion */
1875 * Hook: real function call was optimized.
1877 static void stat_func_call(void *context, ir_graph *irg, ir_node *call)
1881 if (! status->stat_options)
1886 graph_entry_t *graph = graph_get_entry(irg, status->irg_hash);
1888 cnt_inc(&graph->cnt[gcnt_acc_real_func_call]);
1891 } /* stat_func_call */
1894 * Hook: A multiply was replaced by a series of Shifts/Adds/Subs.
1896 * @param ctx the hook context
1898 static void stat_arch_dep_replace_mul_with_shifts(void *ctx, ir_node *mul) {
1900 if (! status->stat_options)
1905 graph_entry_t *graph = graph_get_entry(current_ir_graph, status->irg_hash);
1906 removed_due_opt(mul, graph->opt_hash[HOOK_OPT_ARCH_DEP], HOOK_OPT_ARCH_DEP);
1909 } /* stat_arch_dep_replace_mul_with_shifts */
1912 * Hook: A division by const was replaced.
1914 * @param ctx the hook context
1915 * @param node the division node that will be optimized
1917 static void stat_arch_dep_replace_division_by_const(void *ctx, ir_node *node) {
1919 if (! status->stat_options)
1924 graph_entry_t *graph = graph_get_entry(current_ir_graph, status->irg_hash);
1925 removed_due_opt(node, graph->opt_hash[HOOK_OPT_ARCH_DEP], HOOK_OPT_ARCH_DEP);
1928 } /* stat_arch_dep_replace_division_by_const */
1931 * Update the register pressure of a block.
1933 * @param irg the irg containing the block
1934 * @param block the block for which the reg pressure should be set
1935 * @param pressure the pressure
1936 * @param class_name the name of the register class
1938 void stat_be_block_regpressure(ir_graph *irg, ir_node *block, int pressure, const char *class_name)
1940 if (! status->stat_options)
1945 graph_entry_t *graph = graph_get_entry(irg, status->irg_hash);
1946 be_block_entry_t *block_ent;
1947 reg_pressure_entry_t *rp_ent;
1949 block_ent = be_block_get_entry(&status->be_data, get_irn_node_nr(block), graph->be_block_hash);
1950 rp_ent = obstack_alloc(&status->be_data, sizeof(*rp_ent));
1951 memset(rp_ent, 0, sizeof(*rp_ent));
1953 rp_ent->class_name = class_name;
1954 rp_ent->pressure = pressure;
1956 pset_insert(block_ent->reg_pressure, rp_ent, HASH_PTR(class_name));
1959 } /* stat_be_block_regpressure */
1962 * Update the distribution of ready nodes of a block
1964 * @param irg the irg containing the block
1965 * @param block the block for which the reg pressure should be set
1966 * @param num_ready the number of ready nodes
1968 void stat_be_block_sched_ready(ir_graph *irg, ir_node *block, int num_ready)
1970 if (! status->stat_options)
1975 graph_entry_t *graph = graph_get_entry(irg, status->irg_hash);
1976 be_block_entry_t *block_ent;
1978 block_ent = be_block_get_entry(&status->be_data, get_irn_node_nr(block), graph->be_block_hash);
1980 /* increase the counter of corresponding number of ready nodes */
1981 stat_inc_int_distrib_tbl(block_ent->sched_ready, num_ready);
1984 } /* stat_be_block_sched_ready */
1987 * Update the permutation statistic of a block.
1989 * @param class_name the name of the register class
1990 * @param n_regs number of registers in the register class
1991 * @param perm the perm node
1992 * @param block the block containing the perm
1993 * @param size the size of the perm
1994 * @param real_size number of pairs with different registers
1996 void stat_be_block_stat_perm(const char *class_name, int n_regs, ir_node *perm, ir_node *block,
1997 int size, int real_size)
1999 if (! status->stat_options)
2004 graph_entry_t *graph = graph_get_entry(get_irn_irg(block), status->irg_hash);
2005 be_block_entry_t *block_ent;
2006 perm_class_entry_t *pc_ent;
2007 perm_stat_entry_t *ps_ent;
2009 block_ent = be_block_get_entry(&status->be_data, get_irn_node_nr(block), graph->be_block_hash);
2010 pc_ent = perm_class_get_entry(&status->be_data, class_name, block_ent->perm_class_stat);
2011 ps_ent = perm_stat_get_entry(&status->be_data, perm, pc_ent->perm_stat);
2013 pc_ent->n_regs = n_regs;
2015 /* update information */
2016 ps_ent->size = size;
2017 ps_ent->real_size = real_size;
2020 } /* stat_be_block_stat_perm */
2023 * Update the permutation statistic of a single perm.
2025 * @param class_name the name of the register class
2026 * @param perm the perm node
2027 * @param block the block containing the perm
2028 * @param is_chain 1 if chain, 0 if cycle
2029 * @param size length of the cycle/chain
2030 * @param n_ops the number of ops representing this cycle/chain after lowering
2032 void stat_be_block_stat_permcycle(const char *class_name, ir_node *perm, ir_node *block,
2033 int is_chain, int size, int n_ops)
2035 if (! status->stat_options)
2040 graph_entry_t *graph = graph_get_entry(get_irn_irg(block), status->irg_hash);
2041 be_block_entry_t *block_ent;
2042 perm_class_entry_t *pc_ent;
2043 perm_stat_entry_t *ps_ent;
2045 block_ent = be_block_get_entry(&status->be_data, get_irn_node_nr(block), graph->be_block_hash);
2046 pc_ent = perm_class_get_entry(&status->be_data, class_name, block_ent->perm_class_stat);
2047 ps_ent = perm_stat_get_entry(&status->be_data, perm, pc_ent->perm_stat);
2050 ps_ent->n_copies += n_ops;
2051 stat_inc_int_distrib_tbl(ps_ent->chains, size);
2053 ps_ent->n_exchg += n_ops;
2054 stat_inc_int_distrib_tbl(ps_ent->cycles, size);
2058 } /* stat_be_block_stat_permcycle */
2060 /* Dumps a statistics snapshot. */
2061 void stat_dump_snapshot(const char *name, const char *phase)
2067 if (! status->stat_options)
2072 graph_entry_t *entry;
2073 graph_entry_t *global = graph_get_entry(NULL, status->irg_hash);
2076 * The constant counter is only global, so we clear it here.
2077 * Note that it does NOT contain the constants in DELETED
2078 * graphs due to this.
2080 if (status->stat_options & FIRMSTAT_COUNT_CONSTS)
2081 stat_const_clear(status);
2083 /* build the name */
2084 p = strrchr(name, '/');
2089 q = strrchr(name, '\\');
2091 /* NULL might be not the smallest pointer */
2092 if (q && (!p || q > p))
2100 if (l > (int) (sizeof(fname) - 1))
2101 l = sizeof(fname) - 1;
2103 memcpy(fname, name, l);
2109 strncat(fname, "firmstat-", sizeof(fname));
2110 strncat(fname, phase, sizeof(fname));
2111 strncat(fname, "-", sizeof(fname));
2112 strncat(fname, p, sizeof(fname));
2114 stat_dump_init(fname);
2116 /* calculate the graph statistics */
2117 for (entry = pset_first(status->irg_hash); entry; entry = pset_next(status->irg_hash)) {
2118 if (entry->irg == NULL) {
2119 /* special entry for the global count */
2122 if (! entry->is_deleted) {
2123 /* the graph is still alive, count the nodes on it */
2124 update_graph_stat(global, entry);
2128 /* some calculations are dependent, we pushed them on the wait_q */
2129 while (! pdeq_empty(status->wait_q)) {
2130 entry = pdeq_getr(status->wait_q);
2132 update_graph_stat_2(global, entry);
2135 /* dump per graph */
2136 for (entry = pset_first(status->irg_hash); entry; entry = pset_next(status->irg_hash)) {
2137 if (entry->irg == NULL) {
2138 /* special entry for the global count */
2142 if (! entry->is_deleted || status->stat_options & FIRMSTAT_COUNT_DELETED) {
2143 stat_dump_graph(entry);
2144 stat_dump_registered(entry);
2147 if (! entry->is_deleted) {
2148 /* clear the counter that are not accumulated */
2149 graph_clear_entry(entry, 0);
2154 stat_dump_graph(global);
2156 /* dump the const info */
2157 if (status->stat_options & FIRMSTAT_COUNT_CONSTS)
2158 stat_dump_consts(&status->const_info);
2160 /* dump the parameter distribution */
2161 stat_dump_param_tbl(status->dist_param_cnt, global);
2163 /* dump the optimization counter and clear them */
2164 stat_dump_opt_cnt(status->num_opts, ARR_SIZE(status->num_opts));
2165 clear_optimization_counter();
2169 stat_finish_pattern_history(fname);
2171 /* clear the global counter here */
2173 node_entry_t *entry;
2175 for (entry = pset_first(global->opcode_hash); entry; entry = pset_next(global->opcode_hash)) {
2176 opcode_clear_entry(entry);
2178 /* clear all global counter */
2179 graph_clear_entry(global, 1);
2183 } /* stat_dump_snapshot */
2185 /** the hook entries for the Firm statistics module */
2186 static hook_entry_t stat_hooks[hook_last];
2188 /* initialize the statistics module. */
2189 void firm_init_stat(unsigned enable_options)
2191 #define X(a) a, sizeof(a)-1
2192 #define HOOK(h, fkt) \
2193 stat_hooks[h].hook._##h = fkt; register_hook(h, &stat_hooks[h])
2196 if (! (enable_options & FIRMSTAT_ENABLED))
2199 status = XMALLOCZ(stat_info_t);
2201 /* enable statistics */
2202 status->stat_options = enable_options & FIRMSTAT_ENABLED ? enable_options : 0;
2204 /* register all hooks */
2205 HOOK(hook_new_ir_op, stat_new_ir_op);
2206 HOOK(hook_free_ir_op, stat_free_ir_op);
2207 HOOK(hook_new_node, stat_new_node);
2208 HOOK(hook_turn_into_id, stat_turn_into_id);
2209 HOOK(hook_new_graph, stat_new_graph);
2210 HOOK(hook_free_graph, stat_free_graph);
2211 HOOK(hook_irg_walk, stat_irg_walk);
2212 HOOK(hook_irg_walk_blkwise, stat_irg_walk_blkwise);
2213 HOOK(hook_irg_block_walk, stat_irg_block_walk);
2214 HOOK(hook_merge_nodes, stat_merge_nodes);
2215 HOOK(hook_reassociate, stat_reassociate);
2216 HOOK(hook_lower, stat_lower);
2217 HOOK(hook_inline, stat_inline);
2218 HOOK(hook_tail_rec, stat_tail_rec);
2219 HOOK(hook_strength_red, stat_strength_red);
2220 HOOK(hook_dead_node_elim, stat_dead_node_elim);
2221 HOOK(hook_if_conversion, stat_if_conversion);
2222 HOOK(hook_func_call, stat_func_call);
2223 HOOK(hook_arch_dep_replace_mul_with_shifts, stat_arch_dep_replace_mul_with_shifts);
2224 HOOK(hook_arch_dep_replace_division_by_const, stat_arch_dep_replace_division_by_const);
2226 obstack_init(&status->cnts);
2227 obstack_init(&status->be_data);
2229 /* create the hash-tables */
2230 status->irg_hash = new_pset(graph_cmp, 8);
2231 status->ir_op_hash = new_pset(opcode_cmp_2, 1);
2233 /* create the wait queue */
2234 status->wait_q = new_pdeq();
2236 if (enable_options & FIRMSTAT_COUNT_STRONG_OP) {
2237 /* build the pseudo-ops */
2239 _op_Phi0.code = --num;
2240 _op_Phi0.name = new_id_from_chars(X("Phi0"));
2242 _op_PhiM.code = --num;
2243 _op_PhiM.name = new_id_from_chars(X("PhiM"));
2245 _op_ProjM.code = --num;
2246 _op_ProjM.name = new_id_from_chars(X("ProjM"));
2248 _op_MulC.code = --num;
2249 _op_MulC.name = new_id_from_chars(X("MulC"));
2251 _op_DivC.code = --num;
2252 _op_DivC.name = new_id_from_chars(X("DivC"));
2254 _op_ModC.code = --num;
2255 _op_ModC.name = new_id_from_chars(X("ModC"));
2257 _op_DivModC.code = --num;
2258 _op_DivModC.name = new_id_from_chars(X("DivModC"));
2260 _op_QuotC.code = --num;
2261 _op_QuotC.name = new_id_from_chars(X("QuotC"));
2263 status->op_Phi0 = &_op_Phi0;
2264 status->op_PhiM = &_op_PhiM;
2265 status->op_ProjM = &_op_ProjM;
2266 status->op_MulC = &_op_MulC;
2267 status->op_DivC = &_op_DivC;
2268 status->op_ModC = &_op_ModC;
2269 status->op_DivModC = &_op_DivModC;
2270 status->op_QuotC = &_op_QuotC;
2272 status->op_Phi0 = NULL;
2273 status->op_PhiM = NULL;
2274 status->op_ProjM = NULL;
2275 status->op_MulC = NULL;
2276 status->op_DivC = NULL;
2277 status->op_ModC = NULL;
2278 status->op_DivModC = NULL;
2279 status->op_QuotC = NULL;
2282 /* for Florian: count the Sel depth */
2283 if (enable_options & FIRMSTAT_COUNT_SELS) {
2284 _op_SelSel.code = --num;
2285 _op_SelSel.name = new_id_from_chars(X("Sel(Sel)"));
2287 _op_SelSelSel.code = --num;
2288 _op_SelSelSel.name = new_id_from_chars(X("Sel(Sel(Sel))"));
2290 status->op_SelSel = &_op_SelSel;
2291 status->op_SelSelSel = &_op_SelSelSel;
2293 status->op_SelSel = NULL;
2294 status->op_SelSelSel = NULL;
2297 /* register the dumper */
2298 stat_register_dumper(&simple_dumper);
2300 if (enable_options & FIRMSTAT_CSV_OUTPUT)
2301 stat_register_dumper(&csv_dumper);
2303 /* initialize the pattern hash */
2304 stat_init_pattern_history(enable_options & FIRMSTAT_PATTERN_ENABLED);
2306 /* initialize the Const options */
2307 if (enable_options & FIRMSTAT_COUNT_CONSTS)
2308 stat_init_const_cnt(status);
2310 /* distribution table for parameter counts */
2311 status->dist_param_cnt = stat_new_int_distrib_tbl();
2313 clear_optimization_counter();
2317 } /* firm_init_stat */
2320 * Frees all dumper structures.
2322 static void stat_term_dumper(void) {
2323 dumper_t *dumper, *next_dumper;
2325 for (dumper = status->dumper; dumper; /* iteration done in loop body */ ) {
2326 if (dumper->func_map)
2327 del_pset(dumper->func_map);
2329 next_dumper = dumper->next;
2331 dumper = next_dumper;
2333 } /* stat_term_dumper */
2336 /* Terminates the statistics module, frees all memory. */
2337 void stat_term(void) {
2338 if (status != (stat_info_t *)&status_disable) {
2339 obstack_free(&status->be_data, NULL);
2340 obstack_free(&status->cnts, NULL);
2345 status = (stat_info_t *)&status_disable;
2349 /* returns 1 if statistics were initialized, 0 otherwise */
2350 int stat_is_active(void) {
2351 return status != (stat_info_t *)&status_disable;
2352 } /* stat_is_active */
2356 /* initialize the statistics module. */
2357 void firm_init_stat(unsigned enable_options) {}
2359 /* Dumps a statistics snapshot */
2360 void stat_dump_snapshot(const char *name, const char *phase) {}
2362 /* terminates the statistics module, frees all memory */
2363 void stat_term(void);
2365 #endif /* FIRM_STATISTICS */