6 #include "phiclass_t.h"
9 #include "becopystat.h"
13 static pset *all_phi_nodes;
14 static pset *all_phi_classes;
15 static pset *all_copy_nodes;
17 void stat_init(void) {
18 all_phi_nodes = pset_new_ptr_default();
19 all_phi_classes = pset_new_ptr_default();
20 all_copy_nodes = pset_new_ptr_default();
24 void stat_reset(void) {
26 for (i = 0; i < ASIZE; ++i)
31 * Collect general data
33 static void stat_walker(ir_node *node, void *env) {
34 curr_vals[I_ALL_NODES]++; /* count all nodes */
36 if (is_Block(node)) /* count all blocks */
37 curr_vals[I_BLOCKS]++;
39 if (is_Phi(node)) /* collect phis */
40 pset_insert_ptr(all_phi_nodes, node);
43 pset_insert_ptr(all_copy_nodes, node);
47 * Collect phi node data
49 static void stat_phi_node(ir_node *phi) {
52 /* count all phi phis */
53 curr_vals[I_PHI_CNT]++;
56 arity = get_irn_arity(phi);
57 curr_vals[I_PHI_ARG_CNT] += arity;
58 if (arity > MAX_ARITY)
59 curr_vals[I_PHI_ARITY_E]++;
61 curr_vals[I_PHI_ARITY_S + arity]++;
63 /* type of argument {self, const, pred, glob} */
64 for (i = 0; i < arity; i++) {
65 ir_node *block_of_arg, *block_ith_pred;
66 ir_node *arg = get_irn_n(phi, i);
69 curr_vals[I_PHI_ARG_SELF]++;
73 curr_vals[I_COPIES_MAX]++; /* if arg!=phi this is a possible copy */
75 if (values_interfere(phi, arg))
76 curr_vals[I_COPIES_IF]++;
78 if (iro_Const == get_irn_opcode(arg)) {
79 curr_vals[I_PHI_ARG_CONST]++;
83 block_of_arg = get_nodes_block(arg);
84 block_ith_pred = get_nodes_block(get_irn_n(get_nodes_block(phi), i));
85 if (block_of_arg == block_ith_pred) {
86 curr_vals[I_PHI_ARG_PRED]++;
90 curr_vals[I_PHI_ARG_GLOB]++;
95 * Collect register-constrained node data
98 static void stat_copy_node(ir_node *root) {
99 // if (values_interfere(root, arg))
100 // curr_vals[I_COPIES_IF]++;
104 * Collect phi class data
106 static void stat_phi_class(pset *pc) {
107 int i, o, size, if_free;
108 ir_node **members, *p;
110 /* phi class count */
111 curr_vals[I_CLS_CNT]++;
114 size = pset_count(pc);
115 if (size > MAX_CLS_SIZE)
116 curr_vals[I_CLS_SIZE_E]++;
118 curr_vals[I_CLS_SIZE_S + size]++;
120 /* get an array of all members for double iterating */
121 members = malloc(size * sizeof(*members));
122 for (i = 0, p = pset_first(pc); p; p = pset_next(pc))
126 /* determine interference of phi class members */
127 curr_vals[I_CLS_IF_MAX] += size*(size-1)/2;
129 for (i = 0; i < size-1; ++i)
130 for (o = i+1; o < size; ++o)
131 if (values_interfere(members[i], members[o])) {
133 curr_vals[I_CLS_IF_CNT]++;
136 /* Does this phi class have an inner interference? */
137 curr_vals[I_CLS_IF_FREE] += if_free;
142 void stat_collect_irg(ir_graph *irg) {
146 irg_walk_graph(irg, stat_walker, NULL, NULL);
147 curr_vals[I_BLOCKS] -= 2; /* substract 2 for start and end block */
149 all_phi_classes = phi_class_compute_by_phis(all_phi_nodes);
151 for (n = pset_first(all_phi_nodes); n; n = pset_next(all_phi_nodes))
154 for (n = pset_first(all_copy_nodes); n; n = pset_next(all_copy_nodes))
157 for (pc = pset_first(all_phi_classes); pc; pc = pset_next(all_phi_classes))
162 void stat_dump(ir_graph *irg) {
164 FILE *out = ffopen(get_entity_name(get_irg_entity(irg)), "stat", "wt");
166 fprintf(out, "%s\n", get_irp_prog_name());
167 for (i = 0; i < ASIZE; i++) {
168 if (i >= I_PHI_ARITY_S && i <= I_PHI_ARITY_E)
169 fprintf(out, "%i %i\n", curr_vals[i], curr_vals[I_PHI_CNT]);
170 else if (i >= I_CLS_SIZE_S && i <= I_CLS_SIZE_E)
171 fprintf(out, "%i %i\n", curr_vals[i], curr_vals[I_CLS_CNT]);
173 fprintf(out, "%i\n", curr_vals[i]);
179 //TODO stat_dump_pretty
180 void stat_dump_pretty(ir_graph *irg) {
182 FILE *out = ffopen(get_entity_name(get_irg_entity(irg)), "pretty", "wt");
184 fprintf(out, "\nPhi argument types\n");
185 fprintf(out, "Total %4d\n", curr_vals[I_PHI_ARG_CNT]);
186 fprintf(out, "Constants %4d\n", curr_vals[I_PHI_ARG_CONST]);
187 fprintf(out, "CF-Pred %4d\n", curr_vals[I_PHI_ARG_PRED]);
188 fprintf(out, "Others %4d\n", curr_vals[I_PHI_ARG_GLOB]);
190 fprintf(out, "\nPhi class interference\n");
191 fprintf(out, "Blocks %4d\n", curr_vals[I_BLOCKS]);
192 fprintf(out, "Phis %4d\n", curr_vals[I_PHI_CNT]);
194 fprintf(out, "\nPhi arity\n");
195 for (i = I_PHI_ARITY_S; i<=I_PHI_ARITY_E; i++)
196 fprintf(out, "%2i %4d\n", i-I_PHI_ARITY_S, curr_vals[i]);
198 fprintf(out, "\nPhi class sizes\n");
199 for (i = I_CLS_SIZE_S; i<=I_CLS_SIZE_E; i++)
200 fprintf(out, "%2i %4d\n", i-I_CLS_SIZE_S, curr_vals[i]);
202 fprintf(out, "\n\nTotal nodes: %4d\n", curr_vals[I_ALL_NODES]);