10 #include "phiclass_t.h"
12 #include "becopyopt.h"
13 #include "becopystat.h"
18 static pset *all_phi_nodes;
19 static pset *all_phi_classes;
20 static pset *all_copy_nodes;
22 void stat_init(void) {
23 all_phi_nodes = pset_new_ptr_default();
24 all_phi_classes = pset_new_ptr_default();
25 all_copy_nodes = pset_new_ptr_default();
29 void stat_reset(void) {
31 for (i = 0; i < ASIZE; ++i)
36 * Collect general data
38 static void stat_walker(ir_node *node, void *env) {
39 curr_vals[I_ALL_NODES]++; /* count all nodes */
41 if (is_Block(node)) /* count all blocks */
42 curr_vals[I_BLOCKS]++;
44 if (is_Phi(node)) /* collect phis */
45 pset_insert_ptr(all_phi_nodes, node);
48 pset_insert_ptr(all_copy_nodes, node);
52 * Collect phi node data
54 static void stat_phi_node(ir_node *phi) {
57 /* count all phi phis */
58 curr_vals[I_PHI_CNT]++;
61 arity = get_irn_arity(phi);
62 curr_vals[I_PHI_ARG_CNT] += arity;
63 if (arity > MAX_ARITY)
64 curr_vals[I_PHI_ARITY_E]++;
66 curr_vals[I_PHI_ARITY_S + arity]++;
68 /* type of argument {self, const, pred, glob} */
69 for (i = 0; i < arity; i++) {
70 ir_node *block_of_arg, *block_ith_pred;
71 ir_node *arg = get_irn_n(phi, i);
74 curr_vals[I_PHI_ARG_SELF]++;
78 curr_vals[I_COPIES_MAX]++; /* if arg!=phi this is a possible copy */
80 if (values_interfere(phi, arg))
81 curr_vals[I_COPIES_IF]++;
83 if (iro_Const == get_irn_opcode(arg)) {
84 curr_vals[I_PHI_ARG_CONST]++;
88 block_of_arg = get_nodes_block(arg);
89 block_ith_pred = get_nodes_block(get_irn_n(get_nodes_block(phi), i));
90 if (block_of_arg == block_ith_pred) {
91 curr_vals[I_PHI_ARG_PRED]++;
95 curr_vals[I_PHI_ARG_GLOB]++;
100 * Collect register-constrained node data
102 //TODO stat_copy_node
103 static void stat_copy_node(ir_node *root) {
104 curr_vals[I_CPY_CNT]++;
105 // if (values_interfere(root, arg))
106 // curr_vals[I_COPIES_IF]++;
110 * Collect phi class data
112 static void stat_phi_class(pset *pc) {
113 int i, o, size, if_free;
114 ir_node **members, *p;
116 /* phi class count */
117 curr_vals[I_CLS_CNT]++;
120 size = pset_count(pc);
121 if (size > MAX_CLS_SIZE)
122 curr_vals[I_CLS_SIZE_E]++;
124 curr_vals[I_CLS_SIZE_S + size]++;
126 /* get an array of all members for double iterating */
127 members = xmalloc(size * sizeof(*members));
128 for (i = 0, p = pset_first(pc); p; p = pset_next(pc))
132 /* determine interference of phi class members */
133 curr_vals[I_CLS_IF_MAX] += size*(size-1)/2;
135 for (i = 0; i < size-1; ++i)
136 for (o = i+1; o < size; ++o)
137 if (values_interfere(members[i], members[o])) {
139 curr_vals[I_CLS_IF_CNT]++;
142 /* Does this phi class have an inner interference? */
143 curr_vals[I_CLS_IF_FREE] += if_free;
148 void stat_collect_irg(ir_graph *irg) {
152 irg_walk_graph(irg, stat_walker, NULL, NULL);
153 curr_vals[I_BLOCKS] -= 2; /* substract 2 for start and end block */
155 all_phi_classes = phi_class_compute_by_phis(all_phi_nodes);
157 for (n = pset_first(all_phi_nodes); n; n = pset_next(all_phi_nodes))
160 for (n = pset_first(all_copy_nodes); n; n = pset_next(all_copy_nodes))
163 for (pc = pset_first(all_phi_classes); pc; pc = pset_next(all_phi_classes))
168 void stat_dump(ir_graph *irg) {
172 snprintf(buf, sizeof(buf), "%s__%s", get_irp_prog_name(), get_entity_name(get_irg_entity(irg)));
173 FILE *out = ffopen(buf, "stat", "wt");
175 fprintf(out, "%s\n", get_irp_prog_name());
176 for (i = 0; i < ASIZE; i++) {
177 if (i >= I_PHI_ARITY_S && i <= I_PHI_ARITY_E)
178 fprintf(out, "%i %i\n", curr_vals[i], curr_vals[I_PHI_CNT]);
179 else if (i >= I_CLS_SIZE_S && i <= I_CLS_SIZE_E)
180 fprintf(out, "%i %i\n", curr_vals[i], curr_vals[I_CLS_CNT]);
182 fprintf(out, "%i\n", curr_vals[i]);
188 //TODO stat_dump_pretty
189 void stat_dump_pretty(ir_graph *irg) {
191 FILE *out = ffopen(get_entity_name(get_irg_entity(irg)), "pretty", "wt");
193 fprintf(out, "\nPhi argument types\n");
194 fprintf(out, "Total %4d\n", curr_vals[I_PHI_ARG_CNT]);
195 fprintf(out, "Constants %4d\n", curr_vals[I_PHI_ARG_CONST]);
196 fprintf(out, "CF-Pred %4d\n", curr_vals[I_PHI_ARG_PRED]);
197 fprintf(out, "Others %4d\n", curr_vals[I_PHI_ARG_GLOB]);
199 fprintf(out, "\nPhi class interference\n");
200 fprintf(out, "Blocks %4d\n", curr_vals[I_BLOCKS]);
201 fprintf(out, "Phis %4d\n", curr_vals[I_PHI_CNT]);
203 fprintf(out, "\nPhi arity\n");
204 for (i = I_PHI_ARITY_S; i<=I_PHI_ARITY_E; i++)
205 fprintf(out, "%2i %4d\n", i-I_PHI_ARITY_S, curr_vals[i]);
207 fprintf(out, "\nPhi class sizes\n");
208 for (i = I_CLS_SIZE_S; i<=I_CLS_SIZE_E; i++)
209 fprintf(out, "%2i %4d\n", i-I_CLS_SIZE_S, curr_vals[i]);
211 fprintf(out, "\n\nTotal nodes: %4d\n", curr_vals[I_ALL_NODES]);