2 * @file bechordal_main.c
4 * @author Sebastian Hack
6 * Copyright (C) 2005 Universitaet Karlsruhe
7 * Released under the GPL
9 * Driver for the chordal register allocator.
20 #include "firm_config.h"
23 #include <libcore/lc_opts.h>
24 #include <libcore/lc_opts_enum.h>
25 #include <libcore/lc_timing.h>
26 #endif /* WITH_LIBCORE */
29 #include "irgraph_t.h"
30 #include "irprintf_t.h"
38 #include "bechordal_t.h"
43 #include "besched_t.h"
47 #include "beifg_impl.h"
49 #include "bespillbelady.h"
50 #include "bespillmorgan.h"
54 #include "bespillilp.h"
55 #include "bespillremat.h"
56 #include "bespillappel.h"
59 #include "becopystat.h"
60 #include "becopyopt.h"
61 #include "bessadestr.h"
65 void be_ra_chordal_check(be_chordal_env_t *chordal_env) {
66 const arch_env_t *arch_env = chordal_env->birg->main_env->arch_env;
69 ir_node **nodes, *n1, *n2;
71 DEBUG_ONLY(firm_dbg_module_t *dbg = chordal_env->dbg;)
73 /* Collect all irns */
75 pmap_foreach(chordal_env->border_heads, pme) {
77 struct list_head *head = pme->value;
78 list_for_each_entry(border_t, curr, head, list)
79 if (curr->is_def && curr->is_real)
80 if (arch_get_irn_reg_class(arch_env, curr->irn, -1) == chordal_env->cls)
81 obstack_ptr_grow(&ob, curr->irn);
83 obstack_ptr_grow(&ob, NULL);
84 nodes = (ir_node **) obstack_finish(&ob);
87 for (i = 0, n1 = nodes[i]; n1; n1 = nodes[++i]) {
88 const arch_register_t *n1_reg, *n2_reg;
90 n1_reg = arch_get_irn_register(arch_env, n1);
91 if (!arch_reg_is_allocatable(arch_env, n1, -1, n1_reg)) {
92 DBG((dbg, 0, "Register %s assigned to %+F is not allowed\n", n1_reg->name, n1));
93 assert(0 && "Register constraint does not hold");
95 for (o = i+1, n2 = nodes[o]; n2; n2 = nodes[++o]) {
96 n2_reg = arch_get_irn_register(arch_env, n2);
97 if (values_interfere(n1, n2) && n1_reg == n2_reg) {
98 DBG((dbg, 0, "Values %+F and %+F interfere and have the same register assigned: %s\n", n1, n2, n1_reg->name));
99 assert(0 && "Interfering values have the same color!");
103 obstack_free(&ob, NULL);
106 int nodes_interfere(const be_chordal_env_t *env, const ir_node *a, const ir_node *b)
109 return be_ifg_connected(env->ifg, a, b);
111 return values_interfere(a, b);
115 static be_ra_chordal_opts_t options = {
120 BE_CH_LOWER_PERM_SWAP,
124 static be_ra_timer_t ra_timer = {
137 static const lc_opt_enum_int_items_t spill_items[] = {
138 { "morgan", BE_CH_SPILL_MORGAN },
139 { "belady", BE_CH_SPILL_BELADY },
141 { "ilp", BE_CH_SPILL_ILP },
142 { "remat", BE_CH_SPILL_REMAT },
143 { "appel", BE_CH_SPILL_APPEL },
144 #endif /* WITH_ILP */
148 static const lc_opt_enum_int_items_t copymin_items[] = {
149 { "none", BE_CH_COPYMIN_NONE },
150 { "heur1", BE_CH_COPYMIN_HEUR1 },
151 { "heur2", BE_CH_COPYMIN_HEUR2 },
152 { "stat", BE_CH_COPYMIN_STAT },
153 { "park", BE_CH_COPYMIN_PARK_MOON },
155 { "ilp1", BE_CH_COPYMIN_ILP1 },
156 { "ilp2", BE_CH_COPYMIN_ILP2 },
157 #endif /* WITH_ILP */
161 static const lc_opt_enum_int_items_t ifg_flavor_items[] = {
162 { "std", BE_CH_IFG_STD },
163 { "fast", BE_CH_IFG_FAST },
164 { "clique", BE_CH_IFG_CLIQUE },
165 { "pointer", BE_CH_IFG_POINTER },
166 { "list", BE_CH_IFG_LIST },
167 { "check", BE_CH_IFG_CHECK },
171 static const lc_opt_enum_int_items_t lower_perm_items[] = {
172 { "copy", BE_CH_LOWER_PERM_COPY },
173 { "swap", BE_CH_LOWER_PERM_SWAP },
177 static const lc_opt_enum_int_items_t lower_perm_stat_items[] = {
181 static const lc_opt_enum_int_items_t dump_items[] = {
182 { "spill", BE_CH_DUMP_SPILL },
183 { "live", BE_CH_DUMP_LIVE },
184 { "color", BE_CH_DUMP_COLOR },
185 { "copymin", BE_CH_DUMP_COPYMIN },
186 { "ssadestr", BE_CH_DUMP_SSADESTR },
187 { "tree", BE_CH_DUMP_TREE_INTV },
188 { "constr", BE_CH_DUMP_CONSTR },
189 { "lower", BE_CH_DUMP_LOWER },
190 { "all", BE_CH_DUMP_ALL },
194 static const lc_opt_enum_int_items_t be_ch_vrfy_items[] = {
195 { "off", BE_CH_VRFY_OFF },
196 { "warn", BE_CH_VRFY_WARN },
197 { "assert", BE_CH_VRFY_ASSERT },
201 static lc_opt_enum_int_var_t spill_var = {
202 &options.spill_method, spill_items
205 static lc_opt_enum_int_var_t copymin_var = {
206 &options.copymin_method, copymin_items
209 static lc_opt_enum_int_var_t ifg_flavor_var = {
210 &options.ifg_flavor, ifg_flavor_items
213 static lc_opt_enum_int_var_t lower_perm_var = {
214 &options.lower_perm_opt, lower_perm_items
217 static lc_opt_enum_int_var_t dump_var = {
218 &options.dump_flags, dump_items
221 static lc_opt_enum_int_var_t be_ch_vrfy_var = {
222 &options.vrfy_option, be_ch_vrfy_items
225 static const lc_opt_table_entry_t be_chordal_options[] = {
226 LC_OPT_ENT_ENUM_PTR ("spill", "spill method (belady, ilp, remat or appel)", &spill_var),
227 LC_OPT_ENT_ENUM_PTR ("copymin", "copymin method (none, heur1, heur2, ilp1, ilp2 or stat)", ©min_var),
228 LC_OPT_ENT_ENUM_PTR ("ifg", "interference graph flavour (std, fast, clique, pointer, list, check)", &ifg_flavor_var),
229 LC_OPT_ENT_ENUM_PTR ("perm", "perm lowering options (copy or swap)", &lower_perm_var),
230 LC_OPT_ENT_ENUM_MASK("dump", "select dump phases", &dump_var),
231 LC_OPT_ENT_ENUM_PTR ("vrfy", "verify options (off, warn, assert)", &be_ch_vrfy_var),
235 static void be_ra_chordal_register_options(lc_opt_entry_t *grp)
237 static int run_once = 0;
238 lc_opt_entry_t *chordal_grp;
242 chordal_grp = lc_opt_get_grp(grp, "chordal");
244 lc_opt_add_table(chordal_grp, be_chordal_options);
247 co_register_options(chordal_grp);
249 #endif /* WITH_LIBCORE */
251 static void dump(unsigned mask, ir_graph *irg,
252 const arch_register_class_t *cls,
254 void (*dump_func)(ir_graph *, const char *))
256 if((options.dump_flags & mask) == mask) {
259 snprintf(buf, sizeof(buf), "-%s%s", cls->name, suffix);
260 be_dump(irg, buf, dump_func);
263 be_dump(irg, suffix, dump_func);
267 static void put_ignore_colors(be_chordal_env_t *chordal_env)
269 int n_colors = chordal_env->cls->n_regs;
272 bitset_clear_all(chordal_env->ignore_colors);
273 be_abi_put_ignore_regs(chordal_env->birg->abi, chordal_env->cls, chordal_env->ignore_colors);
274 for(i = 0; i < n_colors; ++i)
275 if(arch_register_type_is(&chordal_env->cls->regs[i], ignore))
276 bitset_set(chordal_env->ignore_colors, i);
279 FILE *be_chordal_open(const be_chordal_env_t *env, const char *prefix, const char *suffix)
283 ir_snprintf(buf, sizeof(buf), "%s%F_%s.%s", prefix, env->irg, env->cls->name, suffix);
284 return fopen(buf, "wt");
287 void check_ifg_implementations(be_chordal_env_t *chordal_env)
291 f = be_chordal_open(chordal_env, "std", "log");
292 chordal_env->ifg = be_ifg_std_new(chordal_env);
293 be_ifg_check_sorted_to_file(chordal_env->ifg, f);
296 f = be_chordal_open(chordal_env, "list", "log");
297 be_ifg_free(chordal_env->ifg);
298 chordal_env->ifg = be_ifg_list_new(chordal_env);
299 be_ifg_check_sorted_to_file(chordal_env->ifg, f);
302 f = be_chordal_open(chordal_env, "clique", "log");
303 be_ifg_free(chordal_env->ifg);
304 chordal_env->ifg = be_ifg_clique_new(chordal_env);
305 be_ifg_check_sorted_to_file(chordal_env->ifg, f);
308 f = be_chordal_open(chordal_env, "pointer", "log");
309 be_ifg_free(chordal_env->ifg);
310 chordal_env->ifg = be_ifg_pointer_new(chordal_env);
311 be_ifg_check_sorted_to_file(chordal_env->ifg, f);
314 chordal_env->ifg = NULL;
317 static be_ra_timer_t *be_ra_chordal_main(const be_irg_t *bi)
319 const be_main_env_t *main_env = bi->main_env;
320 const arch_isa_t *isa = arch_env_get_isa(main_env->arch_env);
321 ir_graph *irg = bi->irg;
322 be_options_t *main_opts = main_env->options;
326 be_chordal_env_t chordal_env;
328 if (main_opts->timing == BE_TIME_ON) {
329 ra_timer.t_prolog = lc_timer_register("prolog", "regalloc prolog");
330 ra_timer.t_epilog = lc_timer_register("epilog", "regalloc epilog");
331 ra_timer.t_live = lc_timer_register("liveness", "be liveness");
332 ra_timer.t_spill = lc_timer_register("spill", "spiller");
333 ra_timer.t_color = lc_timer_register("color", "graph coloring");
334 ra_timer.t_ifg = lc_timer_register("ifg", "build interference graph");
335 ra_timer.t_copymin = lc_timer_register("copymin", "copy minimization");
336 ra_timer.t_ssa = lc_timer_register("ssadestr", "ssa destruction");
338 LC_STOP_AND_RESET_TIMER(ra_timer.t_prolog);
339 LC_STOP_AND_RESET_TIMER(ra_timer.t_epilog);
340 LC_STOP_AND_RESET_TIMER(ra_timer.t_live);
341 LC_STOP_AND_RESET_TIMER(ra_timer.t_spill);
342 LC_STOP_AND_RESET_TIMER(ra_timer.t_color);
343 LC_STOP_AND_RESET_TIMER(ra_timer.t_ifg);
344 LC_STOP_AND_RESET_TIMER(ra_timer.t_copymin);
345 LC_STOP_AND_RESET_TIMER(ra_timer.t_ssa);
348 #define BE_TIME_START(timer) if (main_opts->timing == BE_TIME_ON) lc_timer_start(timer)
349 #define BE_TIME_STOP(timer) if (main_opts->timing == BE_TIME_ON) lc_timer_stop(timer)
351 BE_TIME_START(ra_timer.t_prolog);
355 chordal_env.opts = &options;
356 chordal_env.irg = irg;
357 chordal_env.birg = bi;
358 chordal_env.dom_front = be_compute_dominance_frontiers(irg);
359 FIRM_DBG_REGISTER(chordal_env.dbg, "firm.be.chordal");
361 obstack_init(&chordal_env.obst);
363 BE_TIME_STOP(ra_timer.t_prolog);
365 /* Perform the following for each register class. */
366 for(j = 0, m = arch_isa_get_n_reg_class(isa); j < m; ++j) {
368 chordal_env.cls = arch_isa_get_reg_class(isa, j);
369 chordal_env.border_heads = pmap_create();
370 chordal_env.ignore_colors = bitset_malloc(chordal_env.cls->n_regs);
372 BE_TIME_START(ra_timer.t_live);
374 /* put all ignore registers into the ignore register set. */
375 put_ignore_colors(&chordal_env);
378 dump(BE_CH_DUMP_LIVE, irg, chordal_env.cls, "-live", dump_ir_block_graph_sched);
380 BE_TIME_STOP(ra_timer.t_live);
381 BE_TIME_START(ra_timer.t_spill);
384 switch(options.spill_method) {
385 case BE_CH_SPILL_MORGAN:
386 be_spill_morgan(&chordal_env);
388 case BE_CH_SPILL_BELADY:
389 be_spill_belady(&chordal_env);
392 case BE_CH_SPILL_ILP:
393 be_spill_ilp(&chordal_env);
395 case BE_CH_SPILL_REMAT:
396 be_spill_remat(&chordal_env);
398 case BE_CH_SPILL_APPEL:
399 be_spill_appel(&chordal_env);
401 #endif /* WITH_ILP */
403 fprintf(stderr, "no valid spiller selected. falling back to belady\n");
404 be_spill_belady(&chordal_env);
406 dump(BE_CH_DUMP_SPILL, irg, chordal_env.cls, "-spill", dump_ir_block_graph_sched);
407 be_abi_fix_stack_nodes(bi->abi);
409 /* verify schedule and register pressure */
410 if (options.vrfy_option == BE_CH_VRFY_WARN) {
411 be_verify_schedule(irg);
412 be_verify_register_pressure(chordal_env.birg->main_env->arch_env, chordal_env.cls, irg);
414 else if (options.vrfy_option == BE_CH_VRFY_ASSERT) {
415 assert(be_verify_schedule(irg) && "Schedule verification failed");
416 assert(be_verify_register_pressure(chordal_env.birg->main_env->arch_env, chordal_env.cls, irg)
417 && "Register pressure verification failed");
420 BE_TIME_STOP(ra_timer.t_spill);
421 BE_TIME_START(ra_timer.t_live);
423 BE_TIME_STOP(ra_timer.t_live);
425 /* Color the graph. */
426 BE_TIME_START(ra_timer.t_color);
427 be_ra_chordal_color(&chordal_env);
428 dump(BE_CH_DUMP_CONSTR, irg, chordal_env.cls, "-color", dump_ir_block_graph_sched);
430 BE_TIME_STOP(ra_timer.t_color);
431 BE_TIME_START(ra_timer.t_ifg);
432 //be_ifg_check_performance(&chordal_env);
434 /* Create the ifg with the selected flavor */
435 switch (options.ifg_flavor) {
437 fprintf(stderr, "no valid ifg flavour selected. falling back to std\n");
440 chordal_env.ifg = be_ifg_std_new(&chordal_env);
442 case BE_CH_IFG_CLIQUE:
443 chordal_env.ifg = be_ifg_clique_new(&chordal_env);
445 case BE_CH_IFG_POINTER:
446 chordal_env.ifg = be_ifg_pointer_new(&chordal_env);
449 chordal_env.ifg = be_ifg_list_new(&chordal_env);
451 case BE_CH_IFG_CHECK:
452 check_ifg_implementations(&chordal_env);
453 /* Build the interference graph. */
454 chordal_env.ifg = be_ifg_std_new(&chordal_env);
455 //be_ifg_check(chordal_env.ifg);
456 //be_ifg_check_sorted(chordal_env.ifg);
463 be_ifg_t *std = be_ifg_std_new(&chordal_env);
464 f = be_chordal_open(&chordal_env, "std", "csv");
465 be_ifg_check_sorted_to_file(std, f);
470 f = be_chordal_open(&chordal_env, "clique", "csv");
471 be_ifg_check_sorted_to_file(chordal_env.ifg, f);
474 if (options.vrfy_option != BE_CH_VRFY_OFF)
475 be_ra_chordal_check(&chordal_env);
477 // be_ifg_check_sorted(chordal_env.ifg);
479 BE_TIME_STOP(ra_timer.t_ifg);
480 BE_TIME_START(ra_timer.t_copymin);
482 /* copy minimization */
484 if (options.copymin_method != BE_CH_COPYMIN_NONE && options.copymin_method != BE_CH_COPYMIN_STAT) {
485 co = new_copy_opt(&chordal_env, co_get_costs_loop_depth);
486 co_build_ou_structure(co);
487 co_build_graph_structure(co);
490 switch(options.copymin_method) {
491 case BE_CH_COPYMIN_HEUR1:
492 co_solve_heuristic(co);
494 case BE_CH_COPYMIN_HEUR2:
495 co_solve_heuristic_new(co);
497 case BE_CH_COPYMIN_PARK_MOON:
498 co_solve_park_moon(co);
500 case BE_CH_COPYMIN_STAT:
501 co_compare_solvers(&chordal_env);
504 case BE_CH_COPYMIN_ILP1:
505 printf("FIXME: %s:%d ILP1 not yet implemented!\n", __FILE__, __LINE__);
506 co_solve_ilp1(co, 60.0);
508 case BE_CH_COPYMIN_ILP2:
509 co_solve_ilp2(co, 60.0);
511 #endif /* WITH_ILP */
512 case BE_CH_COPYMIN_NONE:
518 co_free_graph_structure(co);
519 co_free_ou_structure(co);
523 dump(BE_CH_DUMP_COPYMIN, irg, chordal_env.cls, "-copymin", dump_ir_block_graph_sched);
524 if (options.vrfy_option != BE_CH_VRFY_OFF)
525 be_ra_chordal_check(&chordal_env);
527 BE_TIME_STOP(ra_timer.t_copymin);
528 BE_TIME_START(ra_timer.t_ssa);
530 /* ssa destruction */
531 be_ssa_destruction(&chordal_env);
532 dump(BE_CH_DUMP_SSADESTR, irg, chordal_env.cls, "-ssadestr", dump_ir_block_graph_sched);
533 if (options.vrfy_option != BE_CH_VRFY_OFF) {
534 be_ssa_destruction_check(&chordal_env);
535 be_ra_chordal_check(&chordal_env);
538 if (options.copymin_method == BE_CH_COPYMIN_STAT)
541 be_ifg_free(chordal_env.ifg);
542 pmap_destroy(chordal_env.border_heads);
543 bitset_free(chordal_env.ignore_colors);
545 BE_TIME_STOP(ra_timer.t_ssa);
548 BE_TIME_START(ra_timer.t_epilog);
550 be_compute_spill_offsets(&chordal_env);
552 dump(BE_CH_DUMP_LOWER, irg, NULL, "-spilloff", dump_ir_block_graph_sched);
554 lower_nodes_after_ra(&chordal_env, options.lower_perm_opt & BE_CH_LOWER_PERM_COPY ? 1 : 0);
555 dump(BE_CH_DUMP_LOWER, irg, NULL, "-belower-after-ra", dump_ir_block_graph_sched);
557 obstack_free(&chordal_env.obst, NULL);
558 be_free_dominance_frontiers(chordal_env.dom_front);
560 BE_TIME_STOP(ra_timer.t_epilog);
562 if (main_opts->timing == BE_TIME_ON)
568 const be_ra_t be_ra_chordal_allocator = {
570 be_ra_chordal_register_options,