3 * File name: ir/ir/firmstat.c
4 * Purpose: Statistics for Firm.
8 * Copyright: (c) 2004 Universität Karlsruhe
9 * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
16 #ifdef FIRM_STATISTICS
30 #include "firmstat_t.h"
38 * need this to be static:
39 * Special pseudo Opcodes that we need to count some interesting cases
43 * The Phi0, a node that is created during SSA construction
45 static ir_op _op_Phi0;
47 /** The PhiM, just to count memory Phi's. */
48 static ir_op _op_PhiM;
50 /** The Mul by Const node. */
51 static ir_op _op_MulC;
53 /** The Div by Const node. */
54 static ir_op _op_DivC;
56 /** The Div by Const node. */
57 static ir_op _op_ModC;
59 /** The Div by Const node. */
60 static ir_op _op_DivModC;
62 /** The memory Proj node. */
63 static ir_op _op_ProjM;
66 static ir_op _op_SelSel;
68 /** A Sel of a Sel of a Sel */
69 static ir_op _op_SelSelSel;
71 /* ---------------------------------------------------------------------------------- */
73 /** Marks the begin of a statistic (hook) function. */
74 #define STAT_ENTER ++status->recursive
76 /** Marks the end of a statistic (hook) functions. */
77 #define STAT_LEAVE --status->recursive
79 /** Allows to enter a statistic function only when we are not already in a hook. */
80 #define STAT_ENTER_SINGLE do { if (status->recursive > 0) return; ++status->recursive; } while (0)
85 static const int status_disable = 0;
86 static stat_info_t *status = (stat_info_t *)&status_disable;
89 * Compare two elements of the opcode hash.
91 static int opcode_cmp(const void *elt, const void *key)
93 const node_entry_t *e1 = elt;
94 const node_entry_t *e2 = key;
96 return e1->op->code - e2->op->code;
100 * Compare two elements of the graph hash.
102 static int graph_cmp(const void *elt, const void *key)
104 const graph_entry_t *e1 = elt;
105 const graph_entry_t *e2 = key;
107 return e1->irg != e2->irg;
111 * Compare two elements of the optimization hash.
113 static int opt_cmp(const void *elt, const void *key)
115 const opt_entry_t *e1 = elt;
116 const opt_entry_t *e2 = key;
118 return e1->op->code != e2->op->code;
122 * Compare two elements of the block/extbb hash.
124 static int block_cmp(const void *elt, const void *key)
126 const block_entry_t *e1 = elt;
127 const block_entry_t *e2 = key;
129 return e1->block_nr != e2->block_nr;
133 * Compare two elements of the be_block hash.
135 static int be_block_cmp(const void *elt, const void *key)
137 const be_block_entry_t *e1 = elt;
138 const be_block_entry_t *e2 = key;
140 return e1->block_nr != e2->block_nr;
144 * Compare two elements of reg pressure hash.
146 static int reg_pressure_cmp(const void *elt, const void *key)
148 const reg_pressure_entry_t *e1 = elt;
149 const reg_pressure_entry_t *e2 = key;
151 return e1->class_name != e2->class_name;
152 } /* reg_pressure_cmp */
155 * Compare two elements of the perm_stat hash.
157 static int perm_stat_cmp(const void *elt, const void *key)
159 const perm_stat_entry_t *e1 = elt;
160 const perm_stat_entry_t *e2 = key;
162 return e1->perm != e2->perm;
163 } /* perm_stat_cmp */
166 * Compare two elements of the perm_class hash.
168 static int perm_class_cmp(const void *elt, const void *key)
170 const perm_class_entry_t *e1 = elt;
171 const perm_class_entry_t *e2 = key;
173 return e1->class_name != e2->class_name;
174 } /* perm_class_cmp */
177 * Compare two elements of the ir_op hash.
179 static int opcode_cmp_2(const void *elt, const void *key)
181 const ir_op *e1 = elt;
182 const ir_op *e2 = key;
184 return e1->code != e2->code;
188 * Compare two elements of the address_mark set.
190 static int address_mark_cmp(const void *elt, const void *key, size_t size)
192 const address_mark_entry_t *e1 = elt;
193 const address_mark_entry_t *e2 = key;
195 /* compare only the nodes, the rest is used as data container */
196 return e1->node != e2->node;
197 } /* address_mark_cmp */
200 * Clear all counter in a node_entry_t.
202 static void opcode_clear_entry(node_entry_t *elem)
204 cnt_clr(&elem->cnt_alive);
205 cnt_clr(&elem->new_node);
206 cnt_clr(&elem->into_Id);
207 } /* opcode_clear_entry */
210 * Returns the associates node_entry_t for an ir_op
212 * @param op the IR operation
213 * @param hmap a hash map containing ir_op* -> node_entry_t*
215 static node_entry_t *opcode_get_entry(const ir_op *op, hmap_node_entry_t *hmap)
222 elem = pset_find(hmap, &key, op->code);
226 elem = obstack_alloc(&status->cnts, sizeof(*elem));
227 memset(elem, 0, sizeof(*elem));
230 opcode_clear_entry(elem);
234 return pset_insert(hmap, elem, op->code);
235 } /* opcode_get_entry */
238 * Returns the associates ir_op for an opcode
240 * @param code the IR opcode
241 * @param hmap the hash map containing opcode -> ir_op*
243 static ir_op *opcode_find_entry(opcode code, hmap_ir_op *hmap)
248 return pset_find(hmap, &key, code);
249 } /* opcode_find_entry */
252 * clears all counter in a graph_entry_t
254 static void graph_clear_entry(graph_entry_t *elem, int all)
257 cnt_clr(&elem->cnt_walked);
258 cnt_clr(&elem->cnt_walked_blocks);
259 cnt_clr(&elem->cnt_was_inlined);
260 cnt_clr(&elem->cnt_got_inlined);
261 cnt_clr(&elem->cnt_strength_red);
262 cnt_clr(&elem->cnt_real_func_call);
264 cnt_clr(&elem->cnt_edges);
265 cnt_clr(&elem->cnt_all_calls);
266 cnt_clr(&elem->cnt_call_with_cnst_arg);
267 cnt_clr(&elem->cnt_indirect_calls);
269 if (elem->block_hash) {
270 del_pset(elem->block_hash);
271 elem->block_hash = NULL;
274 if (elem->extbb_hash) {
275 del_pset(elem->extbb_hash);
276 elem->extbb_hash = NULL;
279 obstack_free(&elem->recalc_cnts, NULL);
280 obstack_init(&elem->recalc_cnts);
281 } /* graph_clear_entry */
284 * Returns the associated graph_entry_t for an IR graph.
286 * @param irg the IR graph
287 * @param hmap the hash map containing ir_graph* -> graph_entry_t*
289 static graph_entry_t *graph_get_entry(ir_graph *irg, hmap_graph_entry_t *hmap)
297 elem = pset_find(hmap, &key, HASH_PTR(irg));
300 /* create hash map backend block information */
301 if (! elem->be_block_hash)
302 elem->be_block_hash = new_pset(be_block_cmp, 5);
307 /* allocate a new one */
308 elem = obstack_alloc(&status->cnts, sizeof(*elem));
309 memset(elem, 0, sizeof(*elem));
310 obstack_init(&elem->recalc_cnts);
313 graph_clear_entry(elem, 1);
315 /* new hash table for opcodes here */
316 elem->opcode_hash = new_pset(opcode_cmp, 5);
317 elem->address_mark = new_set(address_mark_cmp, 5);
320 /* these hash tables are created on demand */
321 elem->block_hash = NULL;
322 elem->extbb_hash = NULL;
324 for (i = 0; i < sizeof(elem->opt_hash)/sizeof(elem->opt_hash[0]); ++i)
325 elem->opt_hash[i] = new_pset(opt_cmp, 4);
327 return pset_insert(hmap, elem, HASH_PTR(irg));
328 } /* graph_get_entry */
331 * Clear all counter in an opt_entry_t.
333 static void opt_clear_entry(opt_entry_t *elem)
335 cnt_clr(&elem->count);
336 } /* opt_clear_entry */
339 * Returns the associated opt_entry_t for an IR operation.
341 * @param op the IR operation
342 * @param hmap the hash map containing ir_op* -> opt_entry_t*
344 static opt_entry_t *opt_get_entry(const ir_op *op, hmap_opt_entry_t *hmap)
351 elem = pset_find(hmap, &key, op->code);
355 elem = obstack_alloc(&status->cnts, sizeof(*elem));
356 memset(elem, 0, sizeof(*elem));
358 /* clear new counter */
359 opt_clear_entry(elem);
363 return pset_insert(hmap, elem, op->code);
364 } /* opt_get_entry */
367 * clears all counter in a block_entry_t
369 static void block_clear_entry(block_entry_t *elem)
371 cnt_clr(&elem->cnt_nodes);
372 cnt_clr(&elem->cnt_edges);
373 cnt_clr(&elem->cnt_in_edges);
374 cnt_clr(&elem->cnt_out_edges);
375 cnt_clr(&elem->cnt_phi_data);
379 * Returns the associated block_entry_t for an block.
381 * @param block_nr an IR block number
382 * @param hmap a hash map containing long -> block_entry_t
384 static block_entry_t *block_get_entry(struct obstack *obst, long block_nr, hmap_block_entry_t *hmap)
389 key.block_nr = block_nr;
391 elem = pset_find(hmap, &key, block_nr);
395 elem = obstack_alloc(obst, sizeof(*elem));
396 memset(elem, 0, sizeof(*elem));
398 /* clear new counter */
399 block_clear_entry(elem);
401 elem->block_nr = block_nr;
403 return pset_insert(hmap, elem, block_nr);
404 } /* block_get_entry */
407 * Clear all sets in be_block_entry_t.
409 static void be_block_clear_entry(be_block_entry_t *elem)
411 if (elem->reg_pressure)
412 del_pset(elem->reg_pressure);
414 if (elem->sched_ready)
415 stat_delete_distrib_tbl(elem->sched_ready);
417 if (elem->perm_class_stat)
418 del_pset(elem->perm_class_stat);
420 elem->reg_pressure = new_pset(reg_pressure_cmp, 5);
421 elem->sched_ready = stat_new_int_distrib_tbl();
422 elem->perm_class_stat = new_pset(perm_class_cmp, 5);
423 } /* be_block_clear_entry */
426 * Returns the associated be_block_entry_t for an block.
428 * @param block_nr an IR block number
429 * @param hmap a hash map containing long -> be_block_entry_t
431 static be_block_entry_t *be_block_get_entry(struct obstack *obst, long block_nr, hmap_be_block_entry_t *hmap)
433 be_block_entry_t key;
434 be_block_entry_t *elem;
436 key.block_nr = block_nr;
438 elem = pset_find(hmap, &key, block_nr);
442 elem = obstack_alloc(obst, sizeof(*elem));
443 memset(elem, 0, sizeof(*elem));
445 /* clear new counter */
446 be_block_clear_entry(elem);
448 elem->block_nr = block_nr;
450 return pset_insert(hmap, elem, block_nr);
451 } /* be_block_get_entry */
454 * clears all sets in perm_class_entry_t
456 static void perm_class_clear_entry(perm_class_entry_t *elem) {
458 del_pset(elem->perm_stat);
460 elem->perm_stat = new_pset(perm_stat_cmp, 5);
464 * Returns the associated perm_class entry for a register class.
466 * @param class_name the register class name
467 * @param hmap a hash map containing class_name -> perm_class_entry_t
469 static perm_class_entry_t *perm_class_get_entry(struct obstack *obst, const char *class_name,
470 hmap_perm_class_entry_t *hmap)
472 perm_class_entry_t key;
473 perm_class_entry_t *elem;
475 key.class_name = class_name;
477 elem = pset_find(hmap, &key, HASH_PTR(class_name));
481 elem = obstack_alloc(obst, sizeof(*elem));
482 memset(elem, 0, sizeof(*elem));
484 /* clear new counter */
485 perm_class_clear_entry(elem);
487 elem->class_name = class_name;
489 return pset_insert(hmap, elem, HASH_PTR(class_name));
490 } /* perm_class_get_entry */
493 * clears all sets in perm_stat_entry_t
495 static void perm_stat_clear_entry(perm_stat_entry_t *elem) {
497 stat_delete_distrib_tbl(elem->chains);
500 stat_delete_distrib_tbl(elem->cycles);
502 elem->chains = stat_new_int_distrib_tbl();
503 elem->cycles = stat_new_int_distrib_tbl();
504 } /* perm_stat_clear_entry */
507 * Returns the associated perm_stat entry for a perm.
509 * @param perm the perm node
510 * @param hmap a hash map containing perm -> perm_stat_entry_t
512 static perm_stat_entry_t *perm_stat_get_entry(struct obstack *obst, ir_node *perm, hmap_perm_stat_entry_t *hmap)
514 perm_stat_entry_t key;
515 perm_stat_entry_t *elem;
519 elem = pset_find(hmap, &key, HASH_PTR(perm));
523 elem = obstack_alloc(obst, sizeof(*elem));
524 memset(elem, 0, sizeof(*elem));
526 /* clear new counter */
527 perm_stat_clear_entry(elem);
531 return pset_insert(hmap, elem, HASH_PTR(perm));
532 } /* perm_stat_get_entry */
535 * Returns the ir_op for an IR-node,
536 * handles special cases and return pseudo op codes.
538 * @param none an IR node
540 static ir_op *stat_get_irn_op(ir_node *node)
542 ir_op *op = get_irn_op(node);
544 if (op == op_Phi && get_irn_arity(node) == 0) {
545 /* special case, a Phi0 node, count on extra counter */
546 op = status->op_Phi0 ? status->op_Phi0 : op;
547 } else if (op == op_Phi && get_irn_mode(node) == mode_M) {
548 /* special case, a Memory Phi node, count on extra counter */
549 op = status->op_PhiM ? status->op_PhiM : op;
550 } else if (op == op_Proj && get_irn_mode(node) == mode_M) {
551 /* special case, a Memory Proj node, count on extra counter */
552 op = status->op_ProjM ? status->op_ProjM : op;
553 } else if (op == op_Mul &&
554 (get_irn_op(get_Mul_left(node)) == op_Const || get_irn_op(get_Mul_right(node)) == op_Const)) {
555 /* special case, a Multiply by a const, count on extra counter */
556 op = status->op_MulC ? status->op_MulC : op;
557 } else if (op == op_Div && get_irn_op(get_Div_right(node)) == op_Const) {
558 /* special case, a division by a const, count on extra counter */
559 op = status->op_DivC ? status->op_DivC : op;
560 } else if (op == op_Mod && get_irn_op(get_Mod_right(node)) == op_Const) {
561 /* special case, a module by a const, count on extra counter */
562 op = status->op_ModC ? status->op_ModC : op;
563 } else if (op == op_DivMod && get_irn_op(get_DivMod_right(node)) == op_Const) {
564 /* special case, a division/modulo by a const, count on extra counter */
565 op = status->op_DivModC ? status->op_DivModC : op;
566 } else if (op == op_Sel && get_irn_op(get_Sel_ptr(node)) == op_Sel) {
567 /* special case, a Sel of a Sel, count on extra counter */
568 op = status->op_SelSel ? status->op_SelSel : op;
570 if (get_irn_op(get_Sel_ptr(get_Sel_ptr(node))) == op_Sel) {
571 /* special case, a Sel of a Sel of a Sel, count on extra counter */
572 op = status->op_SelSelSel ? status->op_SelSelSel : op;
577 } /* stat_get_irn_op */
580 * update the block counter
582 static void undate_block_info(ir_node *node, graph_entry_t *graph)
584 ir_op *op = get_irn_op(node);
586 block_entry_t *b_entry;
589 /* check for block */
590 if (op == op_Block) {
591 arity = get_irn_arity(node);
592 b_entry = block_get_entry(&graph->recalc_cnts, get_irn_node_nr(node), graph->block_hash);
594 /* count all incoming edges */
595 for (i = 0; i < arity; ++i) {
596 ir_node *pred = get_irn_n(node, i);
597 ir_node *other_block = get_nodes_block(pred);
598 block_entry_t *b_entry_other = block_get_entry(&graph->recalc_cnts, get_irn_node_nr(other_block), graph->block_hash);
600 cnt_inc(&b_entry->cnt_in_edges); /* an edge coming from another block */
601 cnt_inc(&b_entry_other->cnt_out_edges);
606 block = get_nodes_block(node);
607 b_entry = block_get_entry(&graph->recalc_cnts, get_irn_node_nr(block), graph->block_hash);
609 if (op == op_Phi && mode_is_datab(get_irn_mode(node))) {
610 /* count data Phi per block */
611 cnt_inc(&b_entry->cnt_phi_data);
614 /* we have a new node in our block */
615 cnt_inc(&b_entry->cnt_nodes);
617 /* don't count keep-alive edges */
618 if (get_irn_op(node) == op_End)
621 arity = get_irn_arity(node);
623 for (i = 0; i < arity; ++i) {
624 ir_node *pred = get_irn_n(node, i);
625 ir_node *other_block;
627 other_block = get_nodes_block(pred);
629 if (other_block == block)
630 cnt_inc(&b_entry->cnt_edges); /* a in block edge */
632 block_entry_t *b_entry_other = block_get_entry(&graph->recalc_cnts, get_irn_node_nr(other_block), graph->block_hash);
634 cnt_inc(&b_entry->cnt_in_edges); /* an edge coming from another block */
635 cnt_inc(&b_entry_other->cnt_out_edges);
638 } /* undate_block_info */
641 * Update the extended block counter.
643 static void update_extbb_info(ir_node *node, graph_entry_t *graph)
645 ir_op *op = get_irn_op(node);
647 extbb_entry_t *eb_entry;
650 /* check for block */
651 if (op == op_Block) {
652 extbb = get_nodes_extbb(node);
653 arity = get_irn_arity(node);
654 eb_entry = block_get_entry(&graph->recalc_cnts, get_extbb_node_nr(extbb), graph->extbb_hash);
656 /* count all incoming edges */
657 for (i = 0; i < arity; ++i) {
658 ir_node *pred = get_irn_n(node, i);
659 ir_extblk *other_extbb = get_nodes_extbb(pred);
661 if (extbb != other_extbb) {
662 extbb_entry_t *eb_entry_other = block_get_entry(&graph->recalc_cnts, get_extbb_node_nr(other_extbb), graph->extbb_hash);
664 cnt_inc(&eb_entry->cnt_in_edges); /* an edge coming from another extbb */
665 cnt_inc(&eb_entry_other->cnt_out_edges);
671 extbb = get_nodes_extbb(node);
672 eb_entry = block_get_entry(&graph->recalc_cnts, get_extbb_node_nr(extbb), graph->extbb_hash);
674 if (op == op_Phi && mode_is_datab(get_irn_mode(node))) {
675 /* count data Phi per extbb */
676 cnt_inc(&eb_entry->cnt_phi_data);
679 /* we have a new node in our block */
680 cnt_inc(&eb_entry->cnt_nodes);
682 /* don't count keep-alive edges */
683 if (get_irn_op(node) == op_End)
686 arity = get_irn_arity(node);
688 for (i = 0; i < arity; ++i) {
689 ir_node *pred = get_irn_n(node, i);
690 ir_extblk *other_extbb = get_nodes_extbb(pred);
692 if (other_extbb == extbb)
693 cnt_inc(&eb_entry->cnt_edges); /* a in extbb edge */
695 extbb_entry_t *eb_entry_other = block_get_entry(&graph->recalc_cnts, get_extbb_node_nr(other_extbb), graph->extbb_hash);
697 cnt_inc(&eb_entry->cnt_in_edges); /* an edge coming from another extbb */
698 cnt_inc(&eb_entry_other->cnt_out_edges);
701 } /* update_extbb_info */
703 /** Calculates how many arguments of the call are const. */
704 static int cnt_const_args(ir_node *call)
707 int n = get_Call_n_params(call);
709 for (i = 0; i < n; ++i) {
710 ir_node *param = get_Call_param(call, i);
711 ir_op *op = get_irn_op(param);
713 if (op == op_Const || op == op_SymConst)
717 } /* cnt_const_args */
720 * Update info on calls.
722 * @param call The call
723 * @param graph The graph entry containing the call
725 static void stat_update_call(ir_node *call, graph_entry_t *graph)
727 ir_node *block = get_nodes_block(call);
728 ir_node *ptr = get_Call_ptr(call);
730 ir_graph *callee = NULL;
734 * If the block is bad, the whole subgraph will collapse later
735 * so do not count this call.
736 * This happens in dead code.
741 cnt_inc(&graph->cnt_all_calls);
743 /* found a call, this function is not a leaf */
746 if (get_irn_op(ptr) == op_SymConst) {
747 if (get_SymConst_kind(ptr) == symconst_addr_ent) {
748 /* ok, we seems to know the entity */
749 ent = get_SymConst_entity(ptr);
750 callee = get_entity_irg(ent);
752 /* it is recursive, if it calls at least once */
753 if (callee == graph->irg)
754 graph->is_recursive = 1;
757 /* indirect call, be could not predict */
758 cnt_inc(&graph->cnt_indirect_calls);
760 /* NOT a leaf call */
761 graph->is_leaf_call = LCS_NON_LEAF_CALL;
764 /* check, if it's a chain-call: Then, the call-block
765 * must dominate the end block. */
767 ir_node *curr = get_irg_end_block(graph->irg);
768 int depth = get_Block_dom_depth(block);
770 for (; curr != block && get_Block_dom_depth(curr) > depth;) {
771 curr = get_Block_idom(curr);
773 if (! curr || is_no_Block(curr))
778 graph->is_chain_call = 0;
781 /* check, if the callee is a leaf */
783 graph_entry_t *called = graph_get_entry(callee, status->irg_hash);
785 if (called->is_analyzed) {
786 if (! called->is_leaf)
787 graph->is_leaf_call = LCS_NON_LEAF_CALL;
791 /* check, if arguments of the call are const */
792 num_const_args = cnt_const_args(call);
794 if (num_const_args > 0)
795 cnt_inc(&graph->cnt_call_with_cnst_arg);
796 } /* stat_update_call */
799 * Update info on calls for graphs on the wait queue.
801 static void stat_update_call_2(ir_node *call, graph_entry_t *graph)
803 ir_node *block = get_nodes_block(call);
804 ir_node *ptr = get_Call_ptr(call);
806 ir_graph *callee = NULL;
809 * If the block is bad, the whole subgraph will collapse later
810 * so do not count this call.
811 * This happens in dead code.
816 if (get_irn_op(ptr) == op_SymConst) {
817 if (get_SymConst_kind(ptr) == symconst_addr_ent) {
818 /* ok, we seems to know the entity */
819 ent = get_SymConst_entity(ptr);
820 callee = get_entity_irg(ent);
824 /* check, if the callee is a leaf */
826 graph_entry_t *called = graph_get_entry(callee, status->irg_hash);
828 assert(called->is_analyzed);
830 if (! called->is_leaf)
831 graph->is_leaf_call = LCS_NON_LEAF_CALL;
833 graph->is_leaf_call = LCS_NON_LEAF_CALL;
834 } /* stat_update_call_2 */
837 * Walker for reachable nodes count.
839 static void update_node_stat(ir_node *node, void *env)
841 graph_entry_t *graph = env;
844 ir_op *op = stat_get_irn_op(node);
845 int arity = get_irn_arity(node);
847 entry = opcode_get_entry(op, graph->opcode_hash);
849 cnt_inc(&entry->cnt_alive);
850 cnt_add_i(&graph->cnt_edges, arity);
852 /* count block edges */
853 undate_block_info(node, graph);
855 /* count extended block edges */
856 if (status->stat_options & FIRMSTAT_COUNT_EXTBB) {
857 if (graph->irg != get_const_code_irg())
858 update_extbb_info(node, graph);
861 /* handle statistics for special node types */
863 if (op == op_Const) {
864 if (status->stat_options & FIRMSTAT_COUNT_CONSTS) {
865 /* check properties of constants */
866 stat_update_const(status, node, graph);
868 } else if (op == op_Call) {
869 /* check for properties that depends on calls like recursion/leaf/indirect call */
870 stat_update_call(node, graph);
872 } /* update_node_stat */
875 * Walker for reachable nodes count for graphs on the wait_q.
877 static void update_node_stat_2(ir_node *node, void *env)
879 graph_entry_t *graph = env;
881 /* check for properties that depends on calls like recursion/leaf/indirect call */
883 stat_update_call_2(node, graph);
884 } /* update_node_stat_2 */
887 * Get the current address mark.
889 static unsigned get_adr_mark(graph_entry_t *graph, ir_node *node)
891 address_mark_entry_t *value = set_find(graph->address_mark, &node, sizeof(*value), HASH_PTR(node));
893 return value ? value->mark : 0;
897 * Set the current address mark.
899 static void set_adr_mark(graph_entry_t *graph, ir_node *node, unsigned val)
901 address_mark_entry_t *value = set_insert(graph->address_mark, &node, sizeof(*value), HASH_PTR(node));
908 * a vcg attribute hook: Color a node with a different color if
909 * it's identified as a part of an address expression or at least referenced
910 * by an address expression.
912 static int stat_adr_mark_hook(FILE *F, ir_node *node, ir_node *local)
914 ir_node *n = local ? local : node;
915 ir_graph *irg = get_irn_irg(n);
916 graph_entry_t *graph = graph_get_entry(irg, status->irg_hash);
917 unsigned mark = get_adr_mark(graph, n);
919 if (mark & MARK_ADDRESS_CALC)
920 fprintf(F, "color: purple");
921 else if ((mark & (MARK_REF_ADR | MARK_REF_NON_ADR)) == MARK_REF_ADR)
922 fprintf(F, "color: pink");
923 else if ((mark & (MARK_REF_ADR | MARK_REF_NON_ADR)) == (MARK_REF_ADR|MARK_REF_NON_ADR))
924 fprintf(F, "color: lightblue");
928 /* I know the color! */
930 } /* stat_adr_mark_hook */
934 * walker that marks every node that is an address calculation
936 * predecessor nodes must be visited first. We ensure this by
937 * calling in in the post of an outs walk. This should work even in cycles,
938 * while the pre in a normal walk will not.
940 static void mark_address_calc(ir_node *node, void *env)
942 graph_entry_t *graph = env;
943 ir_mode *mode = get_irn_mode(node);
945 unsigned mark_preds = MARK_REF_NON_ADR;
947 if (! mode_is_numP(mode))
950 if (mode_is_reference(mode)) {
951 /* a reference is calculated here, we are sure */
952 set_adr_mark(graph, node, MARK_ADDRESS_CALC);
954 mark_preds = MARK_REF_ADR;
956 unsigned mark = get_adr_mark(graph, node);
958 if ((mark & (MARK_REF_ADR | MARK_REF_NON_ADR)) == MARK_REF_ADR) {
960 * this node has not an reference mode, but is only
961 * referenced by address calculations
963 mark_preds = MARK_REF_ADR;
967 /* mark all predecessors */
968 for (i = 0, n = get_irn_arity(node); i < n; ++i) {
969 ir_node *pred = get_irn_n(node, i);
971 set_adr_mark(graph, pred, get_adr_mark(graph, pred) | mark_preds);
973 } /* mark_address_calc */
976 * Called for every graph when the graph is either deleted or stat_dump_snapshot()
977 * is called, must recalculate all statistic info.
979 * @param global The global entry
980 * @param graph The current entry
982 static void update_graph_stat(graph_entry_t *global, graph_entry_t *graph)
986 /* clear first the alive counter in the graph */
987 for (entry = pset_first(graph->opcode_hash); entry; entry = pset_next(graph->opcode_hash)) {
988 cnt_clr(&entry->cnt_alive);
991 /* set pessimistic values */
993 graph->is_leaf_call = LCS_UNKNOWN;
994 graph->is_recursive = 0;
995 graph->is_chain_call = 1;
997 /* create new block counter */
998 graph->block_hash = new_pset(block_cmp, 5);
1000 /* we need dominator info */
1001 if (graph->irg != get_const_code_irg()) {
1002 assure_doms(graph->irg);
1004 if (status->stat_options & FIRMSTAT_COUNT_EXTBB) {
1005 /* we need extended basic blocks */
1006 compute_extbb(graph->irg);
1008 /* create new extbb counter */
1009 graph->extbb_hash = new_pset(block_cmp, 5);
1013 /* count the nodes in the graph */
1014 irg_walk_graph(graph->irg, update_node_stat, NULL, graph);
1017 /* Uncomment this code if chain-call means call exact one */
1018 entry = opcode_get_entry(op_Call, graph->opcode_hash);
1020 /* check if we have more than 1 call */
1021 if (cnt_gt(entry->cnt_alive, 1))
1022 graph->is_chain_call = 0;
1025 /* recursive functions are never chain calls, leafs don't have calls */
1026 if (graph->is_recursive || graph->is_leaf)
1027 graph->is_chain_call = 0;
1029 /* assume we walk every graph only ONCE, we could sum here the global count */
1030 for (entry = pset_first(graph->opcode_hash); entry; entry = pset_next(graph->opcode_hash)) {
1031 node_entry_t *g_entry = opcode_get_entry(entry->op, global->opcode_hash);
1033 /* update the node counter */
1034 cnt_add(&g_entry->cnt_alive, &entry->cnt_alive);
1037 /* update the edge counter */
1038 cnt_add(&global->cnt_edges, &graph->cnt_edges);
1040 /* count the number of address calculation */
1041 if (graph->irg != get_const_code_irg()) {
1042 ir_graph *rem = current_ir_graph;
1044 if (get_irg_outs_state(graph->irg) != outs_consistent)
1045 compute_irg_outs(graph->irg);
1047 /* Must be done an the outs graph */
1048 current_ir_graph = graph->irg;
1049 irg_out_walk(get_irg_start(graph->irg), NULL, mark_address_calc, graph);
1050 current_ir_graph = rem;
1053 /* register the vcg hook and dump the graph for test */
1054 set_dump_node_vcgattr_hook(stat_adr_mark_hook);
1055 dump_ir_block_graph(graph->irg, "-adr");
1056 set_dump_node_vcgattr_hook(NULL);
1060 /* count the DAG's */
1061 if (status->stat_options & FIRMSTAT_COUNT_DAG)
1062 count_dags_in_graph(global, graph);
1064 /* calculate the patterns of this graph */
1065 stat_calc_pattern_history(graph->irg);
1067 /* leaf function did not call others */
1069 graph->is_leaf_call = LCS_NON_LEAF_CALL;
1070 else if (graph->is_leaf_call == LCS_UNKNOWN) {
1071 /* we still don't know if this graph calls leaf-functions, so enqueue */
1072 pdeq_putl(status->wait_q, graph);
1075 /* we have analyzed this graph */
1076 graph->is_analyzed = 1;
1077 } /* update_graph_stat */
1080 * Called for every graph that was on the wait_q in stat_dump_snapshot()
1081 * must finish all statistic info calculations.
1083 * @param global The global entry
1084 * @param graph The current entry
1086 static void update_graph_stat_2(graph_entry_t *global, graph_entry_t *graph)
1088 if (graph->is_deleted) {
1089 /* deleted, ignore */
1094 /* count the nodes in the graph */
1095 irg_walk_graph(graph->irg, update_node_stat_2, NULL, graph);
1097 if (graph->is_leaf_call == LCS_UNKNOWN)
1098 graph->is_leaf_call = LCS_LEAF_CALL;
1100 } /* update_graph_stat_2 */
1103 * Register a dumper.
1105 static void stat_register_dumper(const dumper_t *dumper)
1107 dumper_t *p = xmalloc(sizeof(*p));
1110 memcpy(p, dumper, sizeof(*p));
1112 p->next = status->dumper;
1117 /* FIXME: memory leak */
1118 } /* stat_register_dumper */
1121 * Dumps the statistics of an IR graph.
1123 static void stat_dump_graph(graph_entry_t *entry)
1127 for (dumper = status->dumper; dumper; dumper = dumper->next) {
1128 if (dumper->dump_graph)
1129 dumper->dump_graph(dumper, entry);
1131 } /* stat_dump_graph */
1134 * Calls all registered dumper functions.
1136 static void stat_dump_registered(graph_entry_t *entry)
1140 for (dumper = status->dumper; dumper; dumper = dumper->next) {
1141 if (dumper->func_map) {
1142 dump_graph_FUNC func;
1144 foreach_pset(dumper->func_map, func)
1145 func(dumper, entry);
1148 } /* stat_dump_registered */
1151 * Dumps a constant table.
1153 static void stat_dump_consts(const constant_info_t *tbl)
1157 for (dumper = status->dumper; dumper; dumper = dumper->next) {
1158 if (dumper->dump_const_tbl)
1159 dumper->dump_const_tbl(dumper, tbl);
1161 } /* stat_dump_consts */
1164 * Initialize the dumper.
1166 static void stat_dump_init(const char *name)
1170 for (dumper = status->dumper; dumper; dumper = dumper->next) {
1172 dumper->init(dumper, name);
1174 } /* stat_dump_init */
1177 * Finish the dumper.
1179 static void stat_dump_finish(void)
1183 for (dumper = status->dumper; dumper; dumper = dumper->next) {
1185 dumper->finish(dumper);
1187 } /* stat_dump_finish */
1190 * Register an additional function for all dumper.
1192 void stat_register_dumper_func(dump_graph_FUNC func) {
1195 for (dumper = status->dumper; dumper; dumper = dumper->next) {
1196 if (! dumper->func_map)
1197 dumper->func_map = pset_new_ptr(3);
1198 pset_insert_ptr(dumper->func_map, func);
1200 } /* stat_register_dumper_func */
1202 /* ---------------------------------------------------------------------- */
1205 * Helper: get an ir_op from an opcode.
1207 ir_op *stat_get_op_from_opcode(opcode code)
1209 return opcode_find_entry(code, status->ir_op_hash);
1210 } /* stat_get_op_from_opcode */
1213 * Hook: A new IR op is registered.
1215 * @param ctx the hook context
1216 * @param op the new IR opcode that was created.
1218 static void stat_new_ir_op(void *ctx, ir_op *op)
1220 if (! status->stat_options)
1225 graph_entry_t *graph = graph_get_entry(NULL, status->irg_hash);
1227 /* execute for side effect :-) */
1228 (void)opcode_get_entry(op, graph->opcode_hash);
1230 pset_insert(status->ir_op_hash, op, op->code);
1233 } /* stat_new_ir_op */
1236 * Hook: An IR op is freed.
1238 * @param ctx the hook context
1239 * @param op the IR opcode that is freed
1241 static void stat_free_ir_op(void *ctx, ir_op *op)
1243 if (! status->stat_options)
1250 } /* stat_free_ir_op */
1253 * Hook: A new node is created.
1255 * @param ctx the hook context
1256 * @param irg the IR graph on which the node is created
1257 * @param node the new IR node that was created
1259 static void stat_new_node(void *ctx, ir_graph *irg, ir_node *node)
1261 if (! status->stat_options)
1264 /* do NOT count during dead node elimination */
1265 if (status->in_dead_node_elim > 0)
1270 node_entry_t *entry;
1271 graph_entry_t *graph;
1272 ir_op *op = stat_get_irn_op(node);
1274 /* increase global value */
1275 graph = graph_get_entry(NULL, status->irg_hash);
1276 entry = opcode_get_entry(op, graph->opcode_hash);
1277 cnt_inc(&entry->new_node);
1279 /* increase local value */
1280 graph = graph_get_entry(current_ir_graph, status->irg_hash);
1281 entry = opcode_get_entry(op, graph->opcode_hash);
1282 cnt_inc(&entry->new_node);
1285 } /* stat_new_node */
1288 * Hook: A node is changed into a Id node
1290 * @param ctx the hook context
1291 * @param node the IR node that will be turned into an ID
1293 static void stat_turn_into_id(void *ctx, ir_node *node)
1295 if (! status->stat_options)
1300 node_entry_t *entry;
1301 graph_entry_t *graph;
1302 ir_op *op = stat_get_irn_op(node);
1304 /* increase global value */
1305 graph = graph_get_entry(NULL, status->irg_hash);
1306 entry = opcode_get_entry(op, graph->opcode_hash);
1307 cnt_inc(&entry->into_Id);
1309 /* increase local value */
1310 graph = graph_get_entry(current_ir_graph, status->irg_hash);
1311 entry = opcode_get_entry(op, graph->opcode_hash);
1312 cnt_inc(&entry->into_Id);
1315 } /* stat_turn_into_id */
1318 * Hook: A new graph was created
1320 * @param ctx the hook context
1321 * @param irg the new IR graph that was created
1322 * @param ent the entity of this graph
1324 static void stat_new_graph(void *ctx, ir_graph *irg, entity *ent)
1326 if (! status->stat_options)
1331 /* execute for side effect :-) */
1332 graph_entry_t * graph = graph_get_entry(irg, status->irg_hash);
1335 graph->is_deleted = 0;
1337 graph->is_leaf_call = 0;
1338 graph->is_recursive = 0;
1339 graph->is_chain_call = 0;
1340 graph->is_analyzed = 0;
1343 } /* stat_new_graph */
1346 * Hook: A graph will be deleted
1348 * @param ctx the hook context
1349 * @param irg the IR graph that will be deleted
1351 * Note that we still hold the information for this graph
1352 * in our hash maps, only a flag is set which prevents this
1353 * information from being changed, it's "frozen" from now.
1355 static void stat_free_graph(void *ctx, ir_graph *irg)
1357 if (! status->stat_options)
1362 graph_entry_t *graph = graph_get_entry(irg, status->irg_hash);
1363 graph_entry_t *global = graph_get_entry(NULL, status->irg_hash);
1365 graph->is_deleted = 1;
1367 if (status->stat_options & FIRMSTAT_COUNT_DELETED) {
1368 /* count the nodes of the graph yet, it will be destroyed later */
1369 update_graph_stat(global, graph);
1373 } /* stat_free_graph */
1376 * Hook: A walk over a graph is initiated. Do not count walks from statistic code.
1378 * @param ctx the hook context
1379 * @param irg the IR graph that will be walked
1380 * @param pre the pre walker
1381 * @param post the post walker
1383 static void stat_irg_walk(void *ctx, ir_graph *irg, generic_func *pre, generic_func *post)
1385 if (! status->stat_options)
1390 graph_entry_t *graph = graph_get_entry(irg, status->irg_hash);
1392 cnt_inc(&graph->cnt_walked);
1395 } /* stat_irg_walk */
1398 * Hook: A walk over a graph in block-wise order is initiated. Do not count walks from statistic code.
1400 * @param ctx the hook context
1401 * @param irg the IR graph that will be walked
1402 * @param pre the pre walker
1403 * @param post the post walker
1405 static void stat_irg_walk_blkwise(void *ctx, ir_graph *irg, generic_func *pre, generic_func *post)
1407 /* for now, do NOT differentiate between blockwise and normal */
1408 stat_irg_walk(ctx, irg, pre, post);
1409 } /* stat_irg_walk_blkwise */
1412 * Hook: A walk over the graph's blocks is initiated. Do not count walks from statistic code.
1414 * @param ctx the hook context
1415 * @param irg the IR graph that will be walked
1416 * @param node the IR node
1417 * @param pre the pre walker
1418 * @param post the post walker
1420 static void stat_irg_block_walk(void *ctx, ir_graph *irg, ir_node *node, generic_func *pre, generic_func *post)
1422 if (! status->stat_options)
1427 graph_entry_t *graph = graph_get_entry(irg, status->irg_hash);
1429 cnt_inc(&graph->cnt_walked_blocks);
1432 } /* stat_irg_block_walk */
1435 * Called for every node that is removed due to an optimization.
1437 * @param n the IR node that will be removed
1438 * @param hmap the hash map containing ir_op* -> opt_entry_t*
1440 static void removed_due_opt(ir_node *n, hmap_opt_entry_t *hmap)
1442 ir_op *op = stat_get_irn_op(n);
1443 opt_entry_t *entry = opt_get_entry(op, hmap);
1445 /* increase global value */
1446 cnt_inc(&entry->count);
1447 } /* removed_due_opt */
1450 * Hook: Some nodes were optimized into some others due to an optimization.
1452 * @param ctx the hook context
1454 static void stat_merge_nodes(
1456 ir_node **new_node_array, int new_num_entries,
1457 ir_node **old_node_array, int old_num_entries,
1460 if (! status->stat_options)
1466 graph_entry_t *graph = graph_get_entry(current_ir_graph, status->irg_hash);
1468 if (status->reassoc_run)
1469 opt = HOOK_OPT_REASSOC;
1471 for (i = 0; i < old_num_entries; ++i) {
1472 for (j = 0; j < new_num_entries; ++j) {
1473 if (old_node_array[i] == new_node_array[j])
1476 /* nodes might be in new and old, these are NOT removed */
1477 if (j >= new_num_entries) {
1480 /* sometimes we did not detect, that it is replaced by a Const */
1481 if (opt == HOOK_OPT_CONFIRM && new_num_entries == 1) {
1482 ir_op *op = get_irn_op(new_node_array[0]);
1484 if (op == op_Const || op == op_SymConst)
1485 xopt = HOOK_OPT_CONFIRM_C;
1488 removed_due_opt(old_node_array[i], graph->opt_hash[xopt]);
1494 } /* stat_merge_nodes */
1497 * Hook: Reassociation is started/stopped.
1499 * @param ctx the hook context
1500 * @param flag if non-zero, reassociation is started else stopped
1502 static void stat_reassociate(void *ctx, int flag)
1504 if (! status->stat_options)
1509 status->reassoc_run = flag;
1512 } /* stat_reassociate */
1515 * Hook: A node was lowered into other nodes
1517 * @param ctx the hook context
1518 * @param node the IR node that will be lowered
1520 static void stat_lower(void *ctx, ir_node *node)
1522 if (! status->stat_options)
1527 graph_entry_t *graph = graph_get_entry(current_ir_graph, status->irg_hash);
1529 removed_due_opt(node, graph->opt_hash[HOOK_LOWERED]);
1535 * Hook: A graph was inlined.
1537 * @param ctx the hook context
1538 * @param call the IR call that will re changed into the body of
1539 * the called IR graph
1540 * @param called_irg the IR graph representing the called routine
1542 static void stat_inline(void *ctx, ir_node *call, ir_graph *called_irg)
1544 if (! status->stat_options)
1549 ir_graph *irg = get_irn_irg(call);
1550 graph_entry_t *i_graph = graph_get_entry(called_irg, status->irg_hash);
1551 graph_entry_t *graph = graph_get_entry(irg, status->irg_hash);
1553 cnt_inc(&graph->cnt_got_inlined);
1554 cnt_inc(&i_graph->cnt_was_inlined);
1560 * Hook: A graph with tail-recursions was optimized.
1562 * @param ctx the hook context
1564 static void stat_tail_rec(void *ctx, ir_graph *irg, int n_calls)
1566 if (! status->stat_options)
1571 graph_entry_t *graph = graph_get_entry(irg, status->irg_hash);
1573 graph->num_tail_recursion += n_calls;
1576 } /* stat_tail_rec */
1579 * Strength reduction was performed on an iteration variable.
1581 * @param ctx the hook context
1583 static void stat_strength_red(void *ctx, ir_graph *irg, ir_node *strong)
1585 if (! status->stat_options)
1590 graph_entry_t *graph = graph_get_entry(irg, status->irg_hash);
1591 cnt_inc(&graph->cnt_strength_red);
1593 removed_due_opt(strong, graph->opt_hash[HOOK_OPT_STRENGTH_RED]);
1596 } /* stat_strength_red */
1599 * Hook: Start/Stop the dead node elimination.
1601 * @param ctx the hook context
1603 static void stat_dead_node_elim(void *ctx, ir_graph *irg, int start)
1605 if (! status->stat_options)
1609 ++status->in_dead_node_elim;
1611 --status->in_dead_node_elim;
1612 } /* stat_dead_node_elim */
1615 * Hook: if-conversion was tried.
1617 static void stat_if_conversion(void *context, ir_graph *irg, ir_node *phi,
1618 int pos, ir_node *mux, if_result_t reason)
1620 if (! status->stat_options)
1625 graph_entry_t *graph = graph_get_entry(irg, status->irg_hash);
1627 cnt_inc(&graph->cnt_if_conv[reason]);
1630 } /* stat_if_conversion */
1633 * Hook: real function call was optimized.
1635 static void stat_func_call(void *context, ir_graph *irg, ir_node *call)
1637 if (! status->stat_options)
1642 graph_entry_t *graph = graph_get_entry(irg, status->irg_hash);
1644 cnt_inc(&graph->cnt_real_func_call);
1647 } /* stat_func_call */
1650 * Hook: A multiply was replaced by a series of Shifts/Adds/Subs.
1652 * @param ctx the hook context
1654 static void stat_arch_dep_replace_mul_with_shifts(void *ctx, ir_node *mul)
1656 if (! status->stat_options)
1661 graph_entry_t *graph = graph_get_entry(current_ir_graph, status->irg_hash);
1662 removed_due_opt(mul, graph->opt_hash[HOOK_OPT_ARCH_DEP]);
1665 } /* stat_arch_dep_replace_mul_with_shifts */
1668 * Hook: A division by const was replaced.
1670 * @param ctx the hook context
1671 * @param node the division node that will be optimized
1673 static void stat_arch_dep_replace_division_by_const(void *ctx, ir_node *node)
1675 if (! status->stat_options)
1680 graph_entry_t *graph = graph_get_entry(current_ir_graph, status->irg_hash);
1681 removed_due_opt(node, graph->opt_hash[HOOK_OPT_ARCH_DEP]);
1684 } /* stat_arch_dep_replace_division_by_const */
1687 * Update the register pressure of a block.
1689 * @param irg the irg containing the block
1690 * @param block the block for which the reg pressure should be set
1691 * @param pressure the pressure
1692 * @param class_name the name of the register class
1694 void stat_be_block_regpressure(ir_graph *irg, ir_node *block, int pressure, const char *class_name)
1696 if (! status->stat_options)
1701 graph_entry_t *graph = graph_get_entry(irg, status->irg_hash);
1702 be_block_entry_t *block_ent;
1703 reg_pressure_entry_t *rp_ent;
1705 block_ent = be_block_get_entry(&status->be_data, get_irn_node_nr(block), graph->be_block_hash);
1706 rp_ent = obstack_alloc(&status->be_data, sizeof(*rp_ent));
1707 memset(rp_ent, 0, sizeof(*rp_ent));
1709 rp_ent->class_name = class_name;
1710 rp_ent->pressure = pressure;
1712 pset_insert(block_ent->reg_pressure, rp_ent, HASH_PTR(class_name));
1715 } /* stat_be_block_regpressure */
1718 * Update the distribution of ready nodes of a block
1720 * @param irg the irg containing the block
1721 * @param block the block for which the reg pressure should be set
1722 * @param num_ready the number of ready nodes
1724 void stat_be_block_sched_ready(ir_graph *irg, ir_node *block, int num_ready)
1726 if (! status->stat_options)
1731 graph_entry_t *graph = graph_get_entry(irg, status->irg_hash);
1732 be_block_entry_t *block_ent;
1734 block_ent = be_block_get_entry(&status->be_data, get_irn_node_nr(block), graph->be_block_hash);
1736 /* increase the counter of corresponding number of ready nodes */
1737 stat_inc_int_distrib_tbl(block_ent->sched_ready, num_ready);
1740 } /* stat_be_block_sched_ready */
1743 * Update the permutation statistic of a block.
1745 * @param class_name the name of the register class
1746 * @param n_regs number of registers in the register class
1747 * @param perm the perm node
1748 * @param block the block containing the perm
1749 * @param size the size of the perm
1750 * @param real_size number of pairs with different registers
1752 void stat_be_block_stat_perm(const char *class_name, int n_regs, ir_node *perm, ir_node *block,
1753 int size, int real_size)
1755 if (! status->stat_options)
1760 graph_entry_t *graph = graph_get_entry(get_irn_irg(block), status->irg_hash);
1761 be_block_entry_t *block_ent;
1762 perm_class_entry_t *pc_ent;
1763 perm_stat_entry_t *ps_ent;
1765 block_ent = be_block_get_entry(&status->be_data, get_irn_node_nr(block), graph->be_block_hash);
1766 pc_ent = perm_class_get_entry(&status->be_data, class_name, block_ent->perm_class_stat);
1767 ps_ent = perm_stat_get_entry(&status->be_data, perm, pc_ent->perm_stat);
1769 pc_ent->n_regs = n_regs;
1771 /* update information */
1772 ps_ent->size = size;
1773 ps_ent->real_size = real_size;
1776 } /* stat_be_block_stat_perm */
1779 * Update the permutation statistic of a single perm.
1781 * @param class_name the name of the register class
1782 * @param perm the perm node
1783 * @param block the block containing the perm
1784 * @param is_chain 1 if chain, 0 if cycle
1785 * @param size length of the cycle/chain
1786 * @param n_ops the number of ops representing this cycle/chain after lowering
1788 void stat_be_block_stat_permcycle(const char *class_name, ir_node *perm, ir_node *block,
1789 int is_chain, int size, int n_ops)
1791 if (! status->stat_options)
1796 graph_entry_t *graph = graph_get_entry(get_irn_irg(block), status->irg_hash);
1797 be_block_entry_t *block_ent;
1798 perm_class_entry_t *pc_ent;
1799 perm_stat_entry_t *ps_ent;
1801 block_ent = be_block_get_entry(&status->be_data, get_irn_node_nr(block), graph->be_block_hash);
1802 pc_ent = perm_class_get_entry(&status->be_data, class_name, block_ent->perm_class_stat);
1803 ps_ent = perm_stat_get_entry(&status->be_data, perm, pc_ent->perm_stat);
1806 ps_ent->n_copies += n_ops;
1807 stat_inc_int_distrib_tbl(ps_ent->chains, size);
1809 ps_ent->n_exchg += n_ops;
1810 stat_inc_int_distrib_tbl(ps_ent->cycles, size);
1814 } /* stat_be_block_stat_permcycle */
1816 /* Dumps a statistics snapshot. */
1817 void stat_dump_snapshot(const char *name, const char *phase)
1823 if (! status->stat_options)
1828 graph_entry_t *entry;
1829 graph_entry_t *global = graph_get_entry(NULL, status->irg_hash);
1832 * The constant counter is only global, so we clear it here.
1833 * Note that it does NOT contain the constants in DELETED
1834 * graphs due to this.
1836 if (status->stat_options & FIRMSTAT_COUNT_CONSTS)
1837 stat_const_clear(status);
1839 /* build the name */
1840 p = strrchr(name, '/');
1845 q = strrchr(name, '\\');
1847 /* NULL might be not the smallest pointer */
1848 if (q && (!p || q > p))
1856 if (l > sizeof(fname) - 1)
1857 l = sizeof(fname) - 1;
1859 memcpy(fname, name, l);
1865 strncat(fname, "firmstat-", sizeof(fname));
1866 strncat(fname, phase, sizeof(fname));
1867 strncat(fname, "-", sizeof(fname));
1868 strncat(fname, p, sizeof(fname));
1870 stat_dump_init(fname);
1872 /* calculate the graph statistics */
1873 for (entry = pset_first(status->irg_hash); entry; entry = pset_next(status->irg_hash)) {
1874 if (entry->irg == NULL) {
1875 /* special entry for the global count */
1878 if (! entry->is_deleted) {
1879 /* the graph is still alive, count the nodes on it */
1880 update_graph_stat(global, entry);
1884 /* some calculations are dependent, we pushed them on the wait_q */
1885 while (! pdeq_empty(status->wait_q)) {
1886 entry = pdeq_getr(status->wait_q);
1888 update_graph_stat_2(global, entry);
1891 /* dump per graph */
1892 for (entry = pset_first(status->irg_hash); entry; entry = pset_next(status->irg_hash)) {
1893 if (entry->irg == NULL) {
1894 /* special entry for the global count */
1898 if (! entry->is_deleted || status->stat_options & FIRMSTAT_COUNT_DELETED) {
1899 stat_dump_graph(entry);
1900 stat_dump_registered(entry);
1903 if (! entry->is_deleted) {
1904 /* clear the counter that are not accumulated */
1905 graph_clear_entry(entry, 0);
1910 stat_dump_graph(global);
1912 /* dump the const info */
1913 if (status->stat_options & FIRMSTAT_COUNT_CONSTS)
1914 stat_dump_consts(&status->const_info);
1918 stat_finish_pattern_history();
1920 /* clear the global counter here */
1922 node_entry_t *entry;
1924 for (entry = pset_first(global->opcode_hash); entry; entry = pset_next(global->opcode_hash)) {
1925 opcode_clear_entry(entry);
1927 /* clear all global counter */
1928 graph_clear_entry(global, 1);
1932 } /* stat_dump_snapshot */
1934 /** the hook entries for the Firm statistics module */
1935 static hook_entry_t stat_hooks[hook_last];
1937 /* initialize the statistics module. */
1938 void firm_init_stat(unsigned enable_options)
1940 #define X(a) a, sizeof(a)-1
1941 #define HOOK(h, fkt) \
1942 stat_hooks[h].hook._##h = fkt; register_hook(h, &stat_hooks[h])
1945 if (! (enable_options & FIRMSTAT_ENABLED))
1948 status = xmalloc(sizeof(*status));
1949 memset(status, 0, sizeof(*status));
1951 /* enable statistics */
1952 status->stat_options = enable_options & FIRMSTAT_ENABLED ? enable_options : 0;
1954 /* register all hooks */
1955 HOOK(hook_new_ir_op, stat_new_ir_op);
1956 HOOK(hook_free_ir_op, stat_free_ir_op);
1957 HOOK(hook_new_node, stat_new_node);
1958 HOOK(hook_turn_into_id, stat_turn_into_id);
1959 HOOK(hook_new_graph, stat_new_graph);
1960 HOOK(hook_free_graph, stat_free_graph);
1961 HOOK(hook_irg_walk, stat_irg_walk);
1962 HOOK(hook_irg_walk_blkwise, stat_irg_walk_blkwise);
1963 HOOK(hook_irg_block_walk, stat_irg_block_walk);
1964 HOOK(hook_merge_nodes, stat_merge_nodes);
1965 HOOK(hook_reassociate, stat_reassociate);
1966 HOOK(hook_lower, stat_lower);
1967 HOOK(hook_inline, stat_inline);
1968 HOOK(hook_tail_rec, stat_tail_rec);
1969 HOOK(hook_strength_red, stat_strength_red);
1970 HOOK(hook_dead_node_elim, stat_dead_node_elim);
1971 HOOK(hook_if_conversion, stat_if_conversion);
1972 HOOK(hook_func_call, stat_func_call);
1973 HOOK(hook_arch_dep_replace_mul_with_shifts, stat_arch_dep_replace_mul_with_shifts);
1974 HOOK(hook_arch_dep_replace_division_by_const, stat_arch_dep_replace_division_by_const);
1976 obstack_init(&status->cnts);
1977 obstack_init(&status->be_data);
1979 /* create the hash-tables */
1980 status->irg_hash = new_pset(graph_cmp, 8);
1981 status->ir_op_hash = new_pset(opcode_cmp_2, 1);
1983 /* create the wait queue */
1984 status->wait_q = new_pdeq();
1986 if (enable_options & FIRMSTAT_COUNT_STRONG_OP) {
1987 /* build the pseudo-ops */
1989 _op_Phi0.code = --num;
1990 _op_Phi0.name = new_id_from_chars(X("Phi0"));
1992 _op_PhiM.code = --num;
1993 _op_PhiM.name = new_id_from_chars(X("PhiM"));
1995 _op_ProjM.code = --num;
1996 _op_ProjM.name = new_id_from_chars(X("ProjM"));
1998 _op_MulC.code = --num;
1999 _op_MulC.name = new_id_from_chars(X("MulC"));
2001 _op_DivC.code = --num;
2002 _op_DivC.name = new_id_from_chars(X("DivC"));
2004 _op_ModC.code = --num;
2005 _op_ModC.name = new_id_from_chars(X("ModC"));
2007 _op_DivModC.code = --num;
2008 _op_DivModC.name = new_id_from_chars(X("DivModC"));
2010 status->op_Phi0 = &_op_Phi0;
2011 status->op_PhiM = &_op_PhiM;
2012 status->op_ProjM = &_op_ProjM;
2013 status->op_MulC = &_op_MulC;
2014 status->op_DivC = &_op_DivC;
2015 status->op_ModC = &_op_ModC;
2016 status->op_DivModC = &_op_DivModC;
2018 status->op_Phi0 = NULL;
2019 status->op_PhiM = NULL;
2020 status->op_ProjM = NULL;
2021 status->op_MulC = NULL;
2022 status->op_DivC = NULL;
2023 status->op_ModC = NULL;
2024 status->op_DivModC = NULL;
2027 /* for Florian: count the Sel depth */
2028 if (enable_options & FIRMSTAT_COUNT_SELS) {
2029 _op_SelSel.code = --num;
2030 _op_SelSel.name = new_id_from_chars(X("Sel(Sel)"));
2032 _op_SelSelSel.code = --num;
2033 _op_SelSelSel.name = new_id_from_chars(X("Sel(Sel(Sel))"));
2035 status->op_SelSel = &_op_SelSel;
2036 status->op_SelSelSel = &_op_SelSelSel;
2038 status->op_SelSel = NULL;
2039 status->op_SelSelSel = NULL;
2042 /* register the dumper */
2043 stat_register_dumper(&simple_dumper);
2045 if (enable_options & FIRMSTAT_CSV_OUTPUT)
2046 stat_register_dumper(&csv_dumper);
2048 /* initialize the pattern hash */
2049 stat_init_pattern_history(enable_options & FIRMSTAT_PATTERN_ENABLED);
2051 /* initialize the Const options */
2052 if (enable_options & FIRMSTAT_COUNT_CONSTS)
2053 stat_init_const_cnt(status);
2057 } /* firm_init_stat */
2060 * Frees all dumper structures.
2062 static void stat_term_dumper(void) {
2063 dumper_t *dumper, *next_dumper;
2065 for (dumper = status->dumper; dumper; /* iteration done in loop body */ ) {
2066 if (dumper->func_map)
2067 del_pset(dumper->func_map);
2069 next_dumper = dumper->next;
2071 dumper = next_dumper;
2073 } /* stat_term_dumper */
2076 /* Terminates the statistics module, frees all memory. */
2077 void stat_term(void) {
2078 if (status != (stat_info_t *)&status_disable) {
2079 obstack_free(&status->be_data, NULL);
2080 obstack_free(&status->cnts, NULL);
2085 status = (stat_info_t *)&status_disable;
2089 /* returns 1 if statistics were initialized, 0 otherwise */
2090 int stat_is_active(void) {
2091 return status != (stat_info_t *)&status_disable;
2092 } /* stat_is_active */
2096 /* initialize the statistics module. */
2097 void firm_init_stat(unsigned enable_options) {}
2099 /* Dumps a statistics snapshot */
2100 void stat_dump_snapshot(const char *name, const char *phase) {}
2102 /* terminates the statistics module, frees all memory */
2103 void stat_term(void);
2105 #endif /* FIRM_STATISTICS */