4 * Copyright: (c) Universitaet Karlsruhe
5 * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
15 #include "phiclass_t.h"
17 #include "becopyopt.h"
18 #include "becopystat.h"
23 #define DEBUG_LVL SET_LEVEL_1
24 static firm_dbg_module_t *dbg = NULL;
27 #define MAX_CLS_SIZE 20
28 #define MAX_CLS_PHIS 20
31 * For an explanation of these values see the code of copystat_dump_pretty
34 /* FROM HERE: PROBLEM CHARACTERIZATION */
40 I_PHI_CNT, /* number of phi nodes */
41 I_PHI_ARG_CNT, /* number of arguments of phis */
42 I_PHI_ARG_SELF, /* number of arguments of phis being the phi itself */
43 I_PHI_ARG_CONST, /* number of arguments of phis being consts */
44 I_PHI_ARG_PRED, /* ... being defined in a cf-pred */
45 I_PHI_ARG_GLOB, /* ... being defined elsewhere */
47 I_PHI_ARITY_E = I_PHI_ARITY_S+MAX_ARITY,
50 I_CPY_CNT, /* number of copynodes */
53 I_CLS_CNT, /* number of phi classes */
54 I_CLS_IF_FREE, /* number of pc having no interference */
55 I_CLS_IF_MAX, /* number of possible interferences in all classes */
56 I_CLS_IF_CNT, /* number of actual interferences in all classes */
58 I_CLS_SIZE_E = I_CLS_SIZE_S+MAX_CLS_SIZE,
60 I_CLS_PHIS_E = I_CLS_PHIS_S+MAX_CLS_PHIS,
62 /* FROM HERE: RESULT VLAUES */
63 /* all of them are external set */
66 I_HEUR_TIME, /* solving time in milli seconds */
67 I_ILP_TIME, /* solving time in milli seconds */
70 I_ILP_ITER, /* number of simplex iterations */
72 /* copy instructions */
73 I_COPIES_MAX, /* max possible costs of copies*/
74 I_COPIES_INIT, /* number of copies in initial allocation */
75 I_COPIES_HEUR, /* number of copies after heuristic */
76 I_COPIES_5SEC, /* number of copies after ilp with max n sec */
77 I_COPIES_30SEC, /* number of copies after ilp with max n sec */
78 I_COPIES_OPT, /* number of copies after ilp */
79 I_COPIES_IF, /* number of copies inevitable due to root-arg-interf */
85 * Holds current values. Values are added till next copystat_reset
89 static pset *all_phi_nodes;
90 static pset *all_phi_classes;
91 static pset *all_copy_nodes;
92 static ir_graph *last_irg;
94 void copystat_init(void) {
95 dbg = firm_dbg_register("ir.be.copystat");
96 firm_dbg_set_mask(dbg, DEBUG_LVL);
98 all_phi_nodes = pset_new_ptr_default();
99 all_phi_classes = pset_new_ptr_default();
100 all_copy_nodes = pset_new_ptr_default();
103 void copystat_reset(void) {
105 for (i = 0; i < ASIZE; ++i)
107 del_pset(all_phi_nodes);
108 del_pset(all_phi_classes);
109 del_pset(all_copy_nodes);
110 all_phi_nodes = pset_new_ptr_default();
111 all_phi_classes = pset_new_ptr_default();
112 all_copy_nodes = pset_new_ptr_default();
116 * Collect general data
118 static void irg_stat_walker(ir_node *node, void *env) {
119 arch_env_t *arch_env = env;
120 curr_vals[I_ALL_NODES]++; /* count all nodes */
122 if (is_Block(node)) /* count all blocks */
123 curr_vals[I_BLOCKS]++;
125 if (is_Reg_Phi(node)) /* collect phis */
126 pset_insert_ptr(all_phi_nodes, node);
128 if (is_Perm_Proj(arch_env, node))
129 pset_insert_ptr(all_copy_nodes, node);
131 /* TODO: Add 2-Addr-Code nodes */
134 static void copystat_collect_irg(ir_graph *irg, arch_env_t *arch_env) {
135 irg_walk_graph(irg, irg_stat_walker, NULL, arch_env);
136 all_phi_classes = phi_class_compute_by_phis(all_phi_nodes);
141 * @return 1 if the block at pos @p pos removed a critical edge
144 static INLINE int was_edge_critical(const ir_node *bl, int pos) {
145 const ir_edge_t *edge;
146 const ir_node *bl_at_pos, *bl_before;
147 assert(is_Block(bl));
149 /* Does bl have several predecessors ?*/
150 if (get_irn_arity(bl) <= 1)
153 /* Does the pred have exactly one predecessor */
154 bl_at_pos = get_irn_n(bl, pos);
155 if (get_irn_arity(bl_at_pos) != 1)
158 /* Does the pred of the pred have several sucsecessors */
159 bl_before = get_irn_n(bl_at_pos, 0);
160 edge = get_block_succ_first(bl_before);
161 return get_block_succ_next(bl_before, edge) ? 1 : 0;
165 * Collect phi node data
167 static void stat_phi_node(be_chordal_env_t *chordal_env, ir_node *phi) {
172 /* count all phi phis */
173 curr_vals[I_PHI_CNT]++;
176 arity = get_irn_arity(phi);
177 curr_vals[I_PHI_ARG_CNT] += arity;
178 if (arity > MAX_ARITY)
179 curr_vals[I_PHI_ARITY_E]++;
181 curr_vals[I_PHI_ARITY_S + arity]++;
183 phi_bl = get_nodes_block(phi);
184 /* type of argument {self, const, pred, glob} */
185 for (i = 0; i < arity; i++) {
186 ir_node *block_of_arg, *block_ith_pred;
187 ir_node *arg = get_irn_n(phi, i);
190 curr_vals[I_PHI_ARG_SELF]++;
194 if (iro_Const == get_irn_opcode(arg)) {
195 curr_vals[I_PHI_ARG_CONST]++;
199 /* get the pred block skipping blocks on critical edges */
200 block_ith_pred = get_Block_cfgpred_block(phi_bl, i);
201 if (was_edge_critical(phi_bl, i))
202 block_ith_pred = get_Block_cfgpred_block(block_ith_pred, 0);
204 block_of_arg = get_nodes_block(arg);
205 if (block_of_arg == block_ith_pred) {
206 curr_vals[I_PHI_ARG_PRED]++;
210 curr_vals[I_PHI_ARG_GLOB]++;
215 * Collect register-constrained node data
217 static void stat_copy_node(be_chordal_env_t *chordal_env, ir_node *root) {
218 curr_vals[I_CPY_CNT]++;
219 curr_vals[I_COPIES_MAX]++;
220 if (nodes_interfere(chordal_env, root, get_Copy_src(root))) {
221 curr_vals[I_COPIES_IF]++;
222 assert(0 && "A Perm pair (in/out) should never interfere!");
227 * Collect phi class data
229 static void stat_phi_class(be_chordal_env_t *chordal_env, pset *pc) {
230 int i, o, size, if_free, phis;
231 ir_node **members, *p;
233 /* phi class count */
234 curr_vals[I_CLS_CNT]++;
237 size = pset_count(pc);
238 if (size > MAX_CLS_SIZE)
239 curr_vals[I_CLS_SIZE_E]++;
241 curr_vals[I_CLS_SIZE_S + size]++;
243 /* get an array of all members for double iterating */
244 members = xmalloc(size * sizeof(*members));
245 DBG((dbg, LEVEL_2, "Phi-class:\n"));
246 for (i = 0, p = pset_first(pc); p; p = pset_next(pc)) {
247 DBG((dbg, LEVEL_2, " %+F\n", p));
252 /* determine number of phis on this class */
254 for (i = 0; i < size; ++i)
255 if (is_Phi(members[i]))
257 if (phis > MAX_CLS_PHIS)
258 curr_vals[I_CLS_PHIS_E]++;
260 curr_vals[I_CLS_PHIS_S + phis]++;
262 /* determine interference of phi class members */
263 curr_vals[I_CLS_IF_MAX] += size*(size-1)/2;
265 for (i = 0; i < size-1; ++i)
266 for (o = i+1; o < size; ++o)
267 if (nodes_interfere(chordal_env, members[i], members[o])) {
269 curr_vals[I_CLS_IF_CNT]++;
272 /* Does this phi class have an inner interference? */
273 curr_vals[I_CLS_IF_FREE] += if_free;
278 #define is_curr_reg_class(irn) \
279 (arch_get_irn_reg_class(chordal_env->main_env->arch_env, irn, \
280 -1) == chordal_env->cls)
282 void copystat_collect_cls(be_chordal_env_t *chordal_env) {
285 ir_graph *irg = chordal_env->irg;
287 if (last_irg != irg) {
289 copystat_collect_irg(irg, chordal_env->main_env->arch_env);
292 for (n = pset_first(all_phi_nodes); n; n = pset_next(all_phi_nodes))
293 if (is_curr_reg_class(n))
294 stat_phi_node(chordal_env, n);
296 for (n = pset_first(all_copy_nodes); n; n = pset_next(all_copy_nodes))
297 if (is_curr_reg_class(n))
298 stat_copy_node(chordal_env, n);
300 for (pc = pset_first(all_phi_classes); pc; pc = pset_next(all_phi_classes)) {
301 ir_node *member = pset_first(pc);
303 if (is_curr_reg_class(member))
304 stat_phi_class(chordal_env, pc);
308 void copystat_add_max_costs(int costs) {
309 curr_vals[I_COPIES_MAX] += costs;
311 void copystat_add_inevit_costs(int costs) {
312 curr_vals[I_COPIES_IF] += costs;
314 void copystat_add_init_costs(int costs) {
315 curr_vals[I_COPIES_INIT] += costs;
317 void copystat_add_heur_costs(int costs) {
318 curr_vals[I_COPIES_HEUR] += costs;
320 void copystat_add_ilp_5_sec_costs(int costs) {
321 curr_vals[I_COPIES_5SEC] += costs;
323 void copystat_add_ilp_30_sec_costs(int costs) {
324 curr_vals[I_COPIES_30SEC] += costs;
326 void copystat_add_opt_costs(int costs) {
327 curr_vals[I_COPIES_OPT] += costs;
329 void copystat_add_heur_time(int time) {
330 curr_vals[I_HEUR_TIME] += time;
332 void copystat_add_ilp_time(int time) {
333 curr_vals[I_ILP_TIME] += time;
335 void copystat_add_ilp_vars(int vars) {
336 curr_vals[I_ILP_VARS] += vars;
338 void copystat_add_ilp_csts(int csts) {
339 curr_vals[I_ILP_CSTR] += csts;
341 void copystat_add_ilp_iter(int iters) {
342 curr_vals[I_ILP_ITER] += iters;
345 void copystat_dump(ir_graph *irg) {
350 snprintf(buf, sizeof(buf), "%s__%s", get_irp_prog_name(), get_entity_name(get_irg_entity(irg)));
351 out = ffopen(buf, "stat", "wt");
353 fprintf(out, "%d\n", ASIZE);
354 for (i = 0; i < ASIZE; i++) {
356 if (i >= I_PHI_ARITY_S && i <= I_PHI_ARITY_E)
357 fprintf(out, "%i %i\n", curr_vals[i], curr_vals[I_PHI_CNT]);
358 else if (i >= I_CLS_SIZE_S && i <= I_CLS_SIZE_E)
359 fprintf(out, "%i %i\n", curr_vals[i], curr_vals[I_CLS_CNT]);
362 fprintf(out, "%i\n", curr_vals[i]);
368 void copystat_dump_pretty(ir_graph *irg) {
373 snprintf(buf, sizeof(buf), "%s__%s", get_irp_prog_name(), get_entity_name(get_irg_entity(irg)));
374 out = ffopen(buf, "pstat", "wt");
376 fprintf(out, "Nodes %4d\n", curr_vals[I_ALL_NODES]);
377 fprintf(out, "Blocks %4d\n", curr_vals[I_BLOCKS]);
378 fprintf(out, "CopyIrn %4d\n", curr_vals[I_CPY_CNT]);
380 fprintf(out, "\nPhis %4d\n", curr_vals[I_PHI_CNT]);
381 fprintf(out, "... argument types\n");
382 fprintf(out, " Total %4d\n", curr_vals[I_PHI_ARG_CNT]);
383 fprintf(out, " Self %4d\n", curr_vals[I_PHI_ARG_SELF]);
384 fprintf(out, " Constants %4d\n", curr_vals[I_PHI_ARG_CONST]);
385 fprintf(out, " CF-Pred %4d\n", curr_vals[I_PHI_ARG_PRED]);
386 fprintf(out, " Others %4d\n", curr_vals[I_PHI_ARG_GLOB]);
387 fprintf(out, "... arities\n");
388 for (i = I_PHI_ARITY_S; i<=I_PHI_ARITY_E; i++)
389 fprintf(out, " %2i %4d\n", i-I_PHI_ARITY_S, curr_vals[i]);
391 fprintf(out, "\nPhi classes %4d\n", curr_vals[I_CLS_CNT]);
392 fprintf(out, " compl. free %4d\n", curr_vals[I_CLS_IF_FREE]);
393 fprintf(out, " inner intf. %4d / %4d\n", curr_vals[I_CLS_IF_CNT], curr_vals[I_CLS_IF_MAX]);
394 fprintf(out, "... sizes\n");
395 for (i = I_CLS_SIZE_S; i<=I_CLS_SIZE_E; i++)
396 fprintf(out, " %2i %4d\n", i-I_CLS_SIZE_S, curr_vals[i]);
397 fprintf(out, "... contained phis\n");
398 for (i = I_CLS_PHIS_S; i<=I_CLS_PHIS_E; i++)
399 fprintf(out, " %2i %4d\n", i-I_CLS_PHIS_S, curr_vals[i]);
401 fprintf(out, "\nILP stat\n");
402 fprintf(out, " Time %8d\n", curr_vals[I_ILP_TIME]);
403 fprintf(out, " Iter %8d\n", curr_vals[I_ILP_ITER]);
405 fprintf(out, "\nCopy stat\n");
406 fprintf(out, " Max %4d\n", curr_vals[I_COPIES_MAX]);
407 fprintf(out, " Init %4d\n", curr_vals[I_COPIES_INIT]);
408 fprintf(out, " Heur %4d\n", curr_vals[I_COPIES_HEUR]);
409 fprintf(out, " Opt %4d\n", curr_vals[I_COPIES_OPT]);
410 fprintf(out, " Intf %4d\n", curr_vals[I_COPIES_IF]);