4 * Copyright: (c) Universitaet Karlsruhe
5 * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
12 #include "phiclass_t.h"
14 #include "becopyopt.h"
15 #include "becopystat.h"
20 static pset *all_phi_nodes;
21 static pset *all_phi_classes;
22 static pset *all_copy_nodes;
24 void stat_init(void) {
25 all_phi_nodes = pset_new_ptr_default();
26 all_phi_classes = pset_new_ptr_default();
27 all_copy_nodes = pset_new_ptr_default();
31 void stat_reset(void) {
33 for (i = 0; i < ASIZE; ++i)
38 * Collect general data
40 static void stat_walker(ir_node *node, void *env) {
41 curr_vals[I_ALL_NODES]++; /* count all nodes */
43 if (is_Block(node)) /* count all blocks */
44 curr_vals[I_BLOCKS]++;
46 if (is_Phi(node)) /* collect phis */
47 pset_insert_ptr(all_phi_nodes, node);
50 pset_insert_ptr(all_copy_nodes, node);
54 * Collect phi node data
56 static void stat_phi_node(ir_node *phi) {
59 /* count all phi phis */
60 curr_vals[I_PHI_CNT]++;
63 arity = get_irn_arity(phi);
64 curr_vals[I_PHI_ARG_CNT] += arity;
65 if (arity > MAX_ARITY)
66 curr_vals[I_PHI_ARITY_E]++;
68 curr_vals[I_PHI_ARITY_S + arity]++;
70 /* type of argument {self, const, pred, glob} */
71 for (i = 0; i < arity; i++) {
72 ir_node *block_of_arg, *block_ith_pred;
73 ir_node *arg = get_irn_n(phi, i);
76 curr_vals[I_PHI_ARG_SELF]++;
80 curr_vals[I_COPIES_MAX]++; /* if arg!=phi this is a possible copy */
82 if (values_interfere(phi, arg))
83 curr_vals[I_COPIES_IF]++;
85 if (iro_Const == get_irn_opcode(arg)) {
86 curr_vals[I_PHI_ARG_CONST]++;
90 block_of_arg = get_nodes_block(arg);
91 block_ith_pred = get_nodes_block(get_irn_n(get_nodes_block(phi), i));
92 if (block_of_arg == block_ith_pred) {
93 curr_vals[I_PHI_ARG_PRED]++;
97 curr_vals[I_PHI_ARG_GLOB]++;
102 * Collect register-constrained node data
104 //TODO stat_copy_node
105 static void stat_copy_node(ir_node *root) {
106 curr_vals[I_CPY_CNT]++;
107 // if (values_interfere(root, arg))
108 // curr_vals[I_COPIES_IF]++;
112 * Collect phi class data
114 static void stat_phi_class(pset *pc) {
115 int i, o, size, if_free;
116 ir_node **members, *p;
118 /* phi class count */
119 curr_vals[I_CLS_CNT]++;
122 size = pset_count(pc);
123 if (size > MAX_CLS_SIZE)
124 curr_vals[I_CLS_SIZE_E]++;
126 curr_vals[I_CLS_SIZE_S + size]++;
128 /* get an array of all members for double iterating */
129 members = xmalloc(size * sizeof(*members));
130 for (i = 0, p = pset_first(pc); p; p = pset_next(pc))
134 /* determine interference of phi class members */
135 curr_vals[I_CLS_IF_MAX] += size*(size-1)/2;
137 for (i = 0; i < size-1; ++i)
138 for (o = i+1; o < size; ++o)
139 if (values_interfere(members[i], members[o])) {
141 curr_vals[I_CLS_IF_CNT]++;
144 /* Does this phi class have an inner interference? */
145 curr_vals[I_CLS_IF_FREE] += if_free;
150 void stat_collect_irg(ir_graph *irg) {
154 irg_walk_graph(irg, stat_walker, NULL, NULL);
155 curr_vals[I_BLOCKS] -= 2; /* substract 2 for start and end block */
157 all_phi_classes = phi_class_compute_by_phis(all_phi_nodes);
159 for (n = pset_first(all_phi_nodes); n; n = pset_next(all_phi_nodes))
162 for (n = pset_first(all_copy_nodes); n; n = pset_next(all_copy_nodes))
165 for (pc = pset_first(all_phi_classes); pc; pc = pset_next(all_phi_classes))
170 void stat_dump(ir_graph *irg) {
174 snprintf(buf, sizeof(buf), "%s__%s", get_irp_prog_name(), get_entity_name(get_irg_entity(irg)));
175 FILE *out = ffopen(buf, "stat", "wt");
177 fprintf(out, "%s\n", get_irp_prog_name());
178 for (i = 0; i < ASIZE; i++) {
179 if (i >= I_PHI_ARITY_S && i <= I_PHI_ARITY_E)
180 fprintf(out, "%i %i\n", curr_vals[i], curr_vals[I_PHI_CNT]);
181 else if (i >= I_CLS_SIZE_S && i <= I_CLS_SIZE_E)
182 fprintf(out, "%i %i\n", curr_vals[i], curr_vals[I_CLS_CNT]);
184 fprintf(out, "%i\n", curr_vals[i]);
190 //TODO stat_dump_pretty
191 void stat_dump_pretty(ir_graph *irg) {
193 FILE *out = ffopen(get_entity_name(get_irg_entity(irg)), "pretty", "wt");
195 fprintf(out, "\nPhi argument types\n");
196 fprintf(out, "Total %4d\n", curr_vals[I_PHI_ARG_CNT]);
197 fprintf(out, "Constants %4d\n", curr_vals[I_PHI_ARG_CONST]);
198 fprintf(out, "CF-Pred %4d\n", curr_vals[I_PHI_ARG_PRED]);
199 fprintf(out, "Others %4d\n", curr_vals[I_PHI_ARG_GLOB]);
201 fprintf(out, "\nPhi class interference\n");
202 fprintf(out, "Blocks %4d\n", curr_vals[I_BLOCKS]);
203 fprintf(out, "Phis %4d\n", curr_vals[I_PHI_CNT]);
205 fprintf(out, "\nPhi arity\n");
206 for (i = I_PHI_ARITY_S; i<=I_PHI_ARITY_E; i++)
207 fprintf(out, "%2i %4d\n", i-I_PHI_ARITY_S, curr_vals[i]);
209 fprintf(out, "\nPhi class sizes\n");
210 for (i = I_CLS_SIZE_S; i<=I_CLS_SIZE_E; i++)
211 fprintf(out, "%2i %4d\n", i-I_CLS_SIZE_S, curr_vals[i]);
213 fprintf(out, "\n\nTotal nodes: %4d\n", curr_vals[I_ALL_NODES]);