4 * Copyright: (c) Universitaet Karlsruhe
5 * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
12 #include <libcore/lc_timing.h>
18 #include "iredges_t.h"
19 #include "phiclass_t.h"
20 #include "bechordal_t.h"
22 #include "becopyopt_t.h"
23 #include "becopystat.h"
27 #define DEBUG_LVL SET_LEVEL_1
28 DEBUG_ONLY(static firm_dbg_module_t *dbg = NULL;)
31 #define MAX_CLS_SIZE 20
32 #define MAX_CLS_PHIS 20
35 * For an explanation of these values see the code of copystat_dump_pretty
38 /* FROM HERE: PROBLEM CHARACTERIZATION */
44 I_PHI_CNT, /* number of phi nodes */
45 I_PHI_ARG_CNT, /* number of arguments of phis */
46 I_PHI_ARG_SELF, /* number of arguments of phis being the phi itself */
47 I_PHI_ARG_CONST, /* number of arguments of phis being consts */
48 I_PHI_ARG_PRED, /* ... being defined in a cf-pred */
49 I_PHI_ARG_GLOB, /* ... being defined elsewhere */
51 I_PHI_ARITY_E = I_PHI_ARITY_S+MAX_ARITY,
54 I_CPY_CNT, /* number of copynodes */
57 I_CLS_CNT, /* number of phi classes */
58 I_CLS_IF_FREE, /* number of pc having no interference */
59 I_CLS_IF_MAX, /* number of possible interferences in all classes */
60 I_CLS_IF_CNT, /* number of actual interferences in all classes */
62 I_CLS_SIZE_E = I_CLS_SIZE_S+MAX_CLS_SIZE,
64 I_CLS_PHIS_E = I_CLS_PHIS_S+MAX_CLS_PHIS,
66 /* FROM HERE: RESULT VLAUES */
67 /* all of them are external set */
70 I_HEUR_TIME, /* solving time in milli seconds */
71 I_ILP_TIME, /* solving time in milli seconds */
74 I_ILP_ITER, /* number of simplex iterations */
76 /* copy instructions */
77 I_COPIES_MAX, /* max possible costs of copies*/
78 I_COPIES_INIT, /* number of copies in initial allocation */
79 I_COPIES_HEUR, /* number of copies after heuristic */
80 I_COPIES_5SEC, /* number of copies after ilp with max n sec */
81 I_COPIES_30SEC, /* number of copies after ilp with max n sec */
82 I_COPIES_OPT, /* number of copies after ilp */
83 I_COPIES_IF, /* number of copies inevitable due to root-arg-interf */
89 * Holds current values. Values are added till next copystat_reset
93 static pset *all_phi_nodes;
94 static pset *all_phi_classes;
95 static pset *all_copy_nodes;
96 static ir_graph *last_irg;
98 void be_init_copystat(void) {
99 FIRM_DBG_REGISTER(dbg, "firm.be.copystat");
101 all_phi_nodes = pset_new_ptr_default();
102 all_phi_classes = pset_new_ptr_default();
103 all_copy_nodes = pset_new_ptr_default();
104 memset(curr_vals, 0, sizeof(curr_vals));
106 BE_REGISTER_MODULE_CONSTRUCTOR(be_init_copystat);
108 void be_quit_copystat(void) {
109 del_pset(all_phi_nodes);
110 del_pset(all_phi_classes);
111 del_pset(all_copy_nodes);
113 BE_REGISTER_MODULE_DESTRUCTOR(be_quit_copystat);
115 void copystat_reset(void) {
121 * Collect general data
123 static void irg_stat_walker(ir_node *node, void *env) {
124 arch_env_t *arch_env = env;
125 curr_vals[I_ALL_NODES]++; /* count all nodes */
127 if (is_Block(node)) /* count all blocks */
128 curr_vals[I_BLOCKS]++;
130 if (is_Reg_Phi(node)) /* collect phis */
131 pset_insert_ptr(all_phi_nodes, node);
133 if (is_Perm_Proj(arch_env, node))
134 pset_insert_ptr(all_copy_nodes, node);
136 /* TODO: Add 2-Addr-Code nodes */
139 static void copystat_collect_irg(ir_graph *irg, arch_env_t *arch_env) {
140 irg_walk_graph(irg, irg_stat_walker, NULL, arch_env);
141 all_phi_classes = phi_class_compute_by_phis(all_phi_nodes);
146 * @return 1 if the block at pos @p pos removed a critical edge
149 static INLINE int was_edge_critical(const ir_node *bl, int pos) {
150 const ir_edge_t *edge;
151 const ir_node *bl_at_pos, *bl_before;
152 assert(is_Block(bl));
154 /* Does bl have several predecessors ?*/
155 if (get_irn_arity(bl) <= 1)
158 /* Does the pred have exactly one predecessor */
159 bl_at_pos = get_irn_n(bl, pos);
160 if (get_irn_arity(bl_at_pos) != 1)
163 /* Does the pred of the pred have several successors */
164 bl_before = get_irn_n(bl_at_pos, 0);
165 edge = get_block_succ_first(bl_before);
166 return get_block_succ_next(bl_before, edge) ? 1 : 0;
170 * Collect phi node data
172 static void stat_phi_node(be_chordal_env_t *chordal_env, ir_node *phi) {
177 /* count all phi phis */
178 curr_vals[I_PHI_CNT]++;
181 arity = get_irn_arity(phi);
182 curr_vals[I_PHI_ARG_CNT] += arity;
183 if (arity > MAX_ARITY)
184 curr_vals[I_PHI_ARITY_E]++;
186 curr_vals[I_PHI_ARITY_S + arity]++;
188 phi_bl = get_nodes_block(phi);
189 /* type of argument {self, const, pred, glob} */
190 for (i = 0; i < arity; i++) {
191 ir_node *block_of_arg, *block_ith_pred;
192 ir_node *arg = get_irn_n(phi, i);
195 curr_vals[I_PHI_ARG_SELF]++;
199 if (iro_Const == get_irn_opcode(arg)) {
200 curr_vals[I_PHI_ARG_CONST]++;
204 /* get the pred block skipping blocks on critical edges */
205 block_ith_pred = get_Block_cfgpred_block(phi_bl, i);
206 if (was_edge_critical(phi_bl, i))
207 block_ith_pred = get_Block_cfgpred_block(block_ith_pred, 0);
209 block_of_arg = get_nodes_block(arg);
210 if (block_of_arg == block_ith_pred) {
211 curr_vals[I_PHI_ARG_PRED]++;
215 curr_vals[I_PHI_ARG_GLOB]++;
220 * Collect register-constrained node data
222 static void stat_copy_node(be_chordal_env_t *chordal_env, ir_node *root) {
223 be_lv_t *lv = be_get_birg_liveness(chordal_env->birg);
224 curr_vals[I_CPY_CNT]++;
225 curr_vals[I_COPIES_MAX]++;
226 if (values_interfere(lv, root, get_Perm_src(root))) {
227 curr_vals[I_COPIES_IF]++;
228 assert(0 && "A Perm pair (in/out) should never interfere!");
233 * Collect phi class data
235 static void stat_phi_class(be_chordal_env_t *chordal_env, pset *pc) {
236 int i, o, size, if_free, phis;
237 ir_node **members, *p;
238 be_lv_t *lv = be_get_birg_liveness(chordal_env->birg);
240 /* phi class count */
241 curr_vals[I_CLS_CNT]++;
244 size = pset_count(pc);
245 if (size > MAX_CLS_SIZE)
246 curr_vals[I_CLS_SIZE_E]++;
248 curr_vals[I_CLS_SIZE_S + size]++;
250 /* get an array of all members for double iterating */
251 members = xmalloc(size * sizeof(*members));
252 DBG((dbg, LEVEL_2, "Phi-class:\n"));
253 for (i = 0, p = pset_first(pc); p; p = pset_next(pc)) {
254 DBG((dbg, LEVEL_2, " %+F\n", p));
259 /* determine number of phis on this class */
261 for (i = 0; i < size; ++i)
262 if (is_Phi(members[i]))
264 if (phis > MAX_CLS_PHIS)
265 curr_vals[I_CLS_PHIS_E]++;
267 curr_vals[I_CLS_PHIS_S + phis]++;
269 /* determine interference of phi class members */
270 curr_vals[I_CLS_IF_MAX] += size*(size-1)/2;
272 for (i = 0; i < size-1; ++i)
273 for (o = i+1; o < size; ++o)
274 if (values_interfere(lv, members[i], members[o])) {
276 curr_vals[I_CLS_IF_CNT]++;
279 /* Does this phi class have an inner interference? */
280 curr_vals[I_CLS_IF_FREE] += if_free;
285 void copystat_collect_cls(be_chordal_env_t *cenv) {
288 ir_graph *irg = cenv->irg;
289 arch_env_t *aenv = cenv->birg->main_env->arch_env;
292 copystat_collect_irg(irg, aenv);
294 for (n = pset_first(all_phi_nodes); n; n = pset_next(all_phi_nodes))
295 if (arch_get_irn_reg_class(aenv, n, -1) == cenv->cls)
296 stat_phi_node(cenv, n);
298 for (n = pset_first(all_copy_nodes); n; n = pset_next(all_copy_nodes))
299 if (arch_get_irn_reg_class(aenv, n, -1) == cenv->cls)
300 stat_copy_node(cenv, n);
302 for (pc = pset_first(all_phi_classes); pc; pc = pset_next(all_phi_classes)) {
303 ir_node *member = pset_first(pc);
305 if (arch_get_irn_reg_class(aenv, member, -1) == cenv->cls)
306 stat_phi_class(cenv, pc);
310 void copystat_add_max_costs(int costs) {
311 curr_vals[I_COPIES_MAX] += costs;
313 void copystat_add_inevit_costs(int costs) {
314 curr_vals[I_COPIES_IF] += costs;
316 void copystat_add_init_costs(int costs) {
317 curr_vals[I_COPIES_INIT] += costs;
319 void copystat_add_heur_costs(int costs) {
320 curr_vals[I_COPIES_HEUR] += costs;
322 void copystat_add_ilp_5_sec_costs(int costs) {
323 curr_vals[I_COPIES_5SEC] += costs;
325 void copystat_add_ilp_30_sec_costs(int costs) {
326 curr_vals[I_COPIES_30SEC] += costs;
328 void copystat_add_opt_costs(int costs) {
329 curr_vals[I_COPIES_OPT] += costs;
331 void copystat_add_heur_time(int time) {
332 curr_vals[I_HEUR_TIME] += time;
337 void copystat_add_ilp_time(int time) {
338 curr_vals[I_ILP_TIME] += time;
340 void copystat_add_ilp_vars(int vars) {
341 curr_vals[I_ILP_VARS] += vars;
343 void copystat_add_ilp_csts(int csts) {
344 curr_vals[I_ILP_CSTR] += csts;
346 void copystat_add_ilp_iter(int iters) {
347 curr_vals[I_ILP_ITER] += iters;
350 #endif /* WITH_ILP */
352 void copystat_dump(ir_graph *irg) {
357 snprintf(buf, sizeof(buf), "%s__%s", get_irp_prog_name(), get_entity_name(get_irg_entity(irg)));
358 buf[sizeof(buf) - 1] = '\0';
359 out = ffopen(buf, "stat", "wt");
361 fprintf(out, "%d\n", ASIZE);
362 for (i = 0; i < ASIZE; i++) {
364 if (i >= I_PHI_ARITY_S && i <= I_PHI_ARITY_E)
365 fprintf(out, "%i %i\n", curr_vals[i], curr_vals[I_PHI_CNT]);
366 else if (i >= I_CLS_SIZE_S && i <= I_CLS_SIZE_E)
367 fprintf(out, "%i %i\n", curr_vals[i], curr_vals[I_CLS_CNT]);
370 fprintf(out, "%i\n", curr_vals[i]);
376 void copystat_dump_pretty(ir_graph *irg) {
381 snprintf(buf, sizeof(buf), "%s__%s", get_irp_prog_name(), get_entity_name(get_irg_entity(irg)));
382 buf[sizeof(buf) - 1] = '\0';
383 out = ffopen(buf, "pstat", "wt");
385 fprintf(out, "Nodes %4d\n", curr_vals[I_ALL_NODES]);
386 fprintf(out, "Blocks %4d\n", curr_vals[I_BLOCKS]);
387 fprintf(out, "CopyIrn %4d\n", curr_vals[I_CPY_CNT]);
389 fprintf(out, "\nPhis %4d\n", curr_vals[I_PHI_CNT]);
390 fprintf(out, "... argument types\n");
391 fprintf(out, " Total %4d\n", curr_vals[I_PHI_ARG_CNT]);
392 fprintf(out, " Self %4d\n", curr_vals[I_PHI_ARG_SELF]);
393 fprintf(out, " Constants %4d\n", curr_vals[I_PHI_ARG_CONST]);
394 fprintf(out, " CF-Pred %4d\n", curr_vals[I_PHI_ARG_PRED]);
395 fprintf(out, " Others %4d\n", curr_vals[I_PHI_ARG_GLOB]);
396 fprintf(out, "... arities\n");
397 for (i = I_PHI_ARITY_S; i<=I_PHI_ARITY_E; i++)
398 fprintf(out, " %2i %4d\n", i-I_PHI_ARITY_S, curr_vals[i]);
400 fprintf(out, "\nPhi classes %4d\n", curr_vals[I_CLS_CNT]);
401 fprintf(out, " compl. free %4d\n", curr_vals[I_CLS_IF_FREE]);
402 fprintf(out, " inner intf. %4d / %4d\n", curr_vals[I_CLS_IF_CNT], curr_vals[I_CLS_IF_MAX]);
403 fprintf(out, "... sizes\n");
404 for (i = I_CLS_SIZE_S; i<=I_CLS_SIZE_E; i++)
405 fprintf(out, " %2i %4d\n", i-I_CLS_SIZE_S, curr_vals[i]);
406 fprintf(out, "... contained phis\n");
407 for (i = I_CLS_PHIS_S; i<=I_CLS_PHIS_E; i++)
408 fprintf(out, " %2i %4d\n", i-I_CLS_PHIS_S, curr_vals[i]);
410 fprintf(out, "\nILP stat\n");
411 fprintf(out, " Time %8d\n", curr_vals[I_ILP_TIME]);
412 fprintf(out, " Iter %8d\n", curr_vals[I_ILP_ITER]);
414 fprintf(out, "\nCopy stat\n");
415 fprintf(out, " Max %4d\n", curr_vals[I_COPIES_MAX]);
416 fprintf(out, " Init %4d\n", curr_vals[I_COPIES_INIT]);
417 fprintf(out, " Heur %4d\n", curr_vals[I_COPIES_HEUR]);
418 fprintf(out, " Opt %4d\n", curr_vals[I_COPIES_OPT]);
419 fprintf(out, " Intf %4d\n", curr_vals[I_COPIES_IF]);
425 * Helpers for saving and restoring colors of nodes.
426 * Used to get dependable and comparable benchmark results.
428 typedef struct color_saver {
429 arch_env_t *arch_env;
430 be_chordal_env_t *chordal_env;
432 int flag; /* 0 save, 1 load */
435 static void save_load(ir_node *irn, void *env) {
436 color_save_t *saver = env;
437 if (saver->chordal_env->cls == arch_get_irn_reg_class(saver->arch_env, irn, -1)) {
438 if (saver->flag == 0) { /* save */
439 const arch_register_t *reg = arch_get_irn_register(saver->arch_env, irn);
440 pmap_insert(saver->saved_colors, irn, (void *) reg);
442 arch_register_t *reg = pmap_get(saver->saved_colors, irn);
443 arch_set_irn_register(saver->arch_env, irn, reg);
448 static void save_colors(color_save_t *color_saver) {
449 color_saver->flag = 0;
450 irg_walk_graph(color_saver->chordal_env->irg, save_load, NULL, color_saver);
454 static void load_colors(color_save_t *color_saver) {
455 color_saver->flag = 1;
456 irg_walk_graph(color_saver->chordal_env->irg, save_load, NULL, color_saver);
461 * Main compare routine
463 void co_compare_solvers(be_chordal_env_t *chordal_env) {
467 int costs_inevit, costs_init, costs_solved, lower_bound;
469 phi_class_compute(chordal_env->irg);
470 copystat_collect_cls(chordal_env);
472 co = new_copy_opt(chordal_env, co_get_costs_loop_depth);
473 co_build_ou_structure(co);
474 co_build_graph_structure(co);
475 DBG((dbg, LEVEL_1, "----> CO: %s\n", co->name));
478 saver.arch_env = chordal_env->birg->main_env->arch_env;
479 saver.chordal_env = chordal_env;
480 saver.saved_colors = pmap_create();
484 costs_inevit = co_get_inevit_copy_costs(co);
485 lower_bound = co_get_lower_bound(co);
486 costs_init = co_get_copy_costs(co);
488 DBG((dbg, LEVEL_1, "Inevit Costs: %3d\n", costs_inevit));
489 DBG((dbg, LEVEL_1, "Lower Bound: %3d\n", lower_bound));
490 DBG((dbg, LEVEL_1, "Init costs: %3d\n", costs_init));
492 copystat_add_inevit_costs(costs_inevit);
493 copystat_add_init_costs(costs_init);
494 copystat_add_max_costs(co_get_max_copy_costs(co));
496 /* heuristic 1 (Daniel Grund) */
497 timer = lc_timer_register("heur1", NULL);
498 lc_timer_reset_and_start(timer);
500 co_solve_heuristic(co);
502 lc_timer_stop(timer);
504 costs_solved = co_get_copy_costs(co);
505 DBG((dbg, LEVEL_1, "HEUR1 costs: %3d\n", costs_solved));
506 copystat_add_heur_time(lc_timer_elapsed_msec(timer));
507 copystat_add_heur_costs(costs_solved);
508 assert(lower_bound <= costs_solved);
510 /* heuristic 2 (Sebastian Hack) */
511 timer = lc_timer_register("heur2", NULL);
512 lc_timer_reset_and_start(timer);
514 co_solve_heuristic_new(co);
516 lc_timer_stop(timer);
518 costs_solved = co_get_copy_costs(co);
519 DBG((dbg, LEVEL_1, "HEUR2 costs: %3d\n", costs_solved));
520 copystat_add_heur_time(lc_timer_elapsed_msec(timer));
521 copystat_add_heur_costs(costs_solved);
522 assert(lower_bound <= costs_solved);
524 /* Park & Moon register coalescing (Kimon Hoffmann) */
525 timer = lc_timer_register("park", NULL);
526 lc_timer_reset_and_start(timer);
528 co_solve_park_moon(co);
530 lc_timer_stop(timer);
532 costs_solved = co_get_copy_costs(co);
533 DBG((dbg, LEVEL_1, "Park/Moon costs: %3d\n", costs_solved));
534 copystat_add_heur_time(lc_timer_elapsed_msec(timer));
535 copystat_add_heur_costs(costs_solved);
536 assert(lower_bound <= costs_solved);
541 /* ILP 1 is not yet implemented, so it makes no sense to compare */
545 co_solve_ilp1(co, 60.0);
547 costs_solved = co_get_copy_costs(co);
548 DBG((dbg, LEVEL_1, "ILP1 costs: %3d\n", costs_solved));
549 copystat_add_opt_costs(costs_solved); /* TODO: ADAPT */
550 assert(lower_bound <= costs_solved);
558 costs_solved = co_get_copy_costs(co);
559 DBG((dbg, LEVEL_1, "ILP2 costs: %3d\n", costs_solved));
560 copystat_add_opt_costs(costs_solved); /* TODO: ADAPT */
561 assert(lower_bound <= costs_solved);
563 #endif /* WITH_ILP */
565 /* free memory for statistic structures */
566 pmap_destroy(saver.saved_colors);
567 co_free_graph_structure(co);
568 co_free_ou_structure(co);