2 * @file bechordal_main.c
4 * @author Sebastian Hack
7 * Copyright (C) 2005 Universitaet Karlsruhe
8 * Released under the GPL
10 * Driver for the chordal register allocator.
21 #include "firm_config.h"
24 #include <libcore/lc_opts.h>
25 #include <libcore/lc_opts_enum.h>
26 #include <libcore/lc_timing.h>
27 #endif /* WITH_LIBCORE */
30 #include "irgraph_t.h"
31 #include "irprintf_t.h"
44 #include "bechordal_t.h"
46 #include "bejavacoal.h"
50 #include "besched_t.h"
54 #include "beifg_impl.h"
57 #include "bespillbelady.h"
58 #include "bespillmorgan.h"
62 #include "bespillremat.h"
65 #include "bejavacoal.h"
66 #include "becopystat.h"
67 #include "becopyopt.h"
68 #include "bessadestr.h"
70 #include "bespillslots.h"
71 #include "bespillcost.h"
74 void be_ra_chordal_check(be_chordal_env_t *chordal_env) {
75 const arch_env_t *arch_env = chordal_env->birg->main_env->arch_env;
78 ir_node **nodes, *n1, *n2;
80 DEBUG_ONLY(firm_dbg_module_t *dbg = chordal_env->dbg;)
82 /* Collect all irns */
84 pmap_foreach(chordal_env->border_heads, pme) {
86 struct list_head *head = pme->value;
87 list_for_each_entry(border_t, curr, head, list)
88 if (curr->is_def && curr->is_real)
89 if (arch_get_irn_reg_class(arch_env, curr->irn, -1) == chordal_env->cls)
90 obstack_ptr_grow(&ob, curr->irn);
92 obstack_ptr_grow(&ob, NULL);
93 nodes = (ir_node **) obstack_finish(&ob);
96 for (i = 0, n1 = nodes[i]; n1; n1 = nodes[++i]) {
97 const arch_register_t *n1_reg, *n2_reg;
99 n1_reg = arch_get_irn_register(arch_env, n1);
100 if (!arch_reg_is_allocatable(arch_env, n1, -1, n1_reg)) {
101 DBG((dbg, 0, "Register %s assigned to %+F is not allowed\n", n1_reg->name, n1));
102 assert(0 && "Register constraint does not hold");
104 for (o = i+1, n2 = nodes[o]; n2; n2 = nodes[++o]) {
105 n2_reg = arch_get_irn_register(arch_env, n2);
106 if (values_interfere(chordal_env->lv, n1, n2) && n1_reg == n2_reg) {
107 DBG((dbg, 0, "Values %+F and %+F interfere and have the same register assigned: %s\n", n1, n2, n1_reg->name));
108 assert(0 && "Interfering values have the same color!");
112 obstack_free(&ob, NULL);
115 int nodes_interfere(const be_chordal_env_t *env, const ir_node *a, const ir_node *b)
118 return be_ifg_connected(env->ifg, a, b);
120 return values_interfere(env->lv, a, b);
124 static be_ra_chordal_opts_t options = {
128 BE_CH_LOWER_PERM_SWAP,
132 static be_ra_timer_t ra_timer = {
146 static const lc_opt_enum_int_items_t spill_items[] = {
147 { "morgan", BE_CH_SPILL_MORGAN },
148 { "belady", BE_CH_SPILL_BELADY },
150 { "remat", BE_CH_SPILL_REMAT },
151 #endif /* WITH_ILP */
155 static const lc_opt_enum_int_items_t ifg_flavor_items[] = {
156 { "std", BE_CH_IFG_STD },
157 { "fast", BE_CH_IFG_FAST },
158 { "clique", BE_CH_IFG_CLIQUE },
159 { "pointer", BE_CH_IFG_POINTER },
160 { "list", BE_CH_IFG_LIST },
161 { "check", BE_CH_IFG_CHECK },
165 static const lc_opt_enum_int_items_t lower_perm_items[] = {
166 { "copy", BE_CH_LOWER_PERM_COPY },
167 { "swap", BE_CH_LOWER_PERM_SWAP },
171 static const lc_opt_enum_int_items_t lower_perm_stat_items[] = {
175 static const lc_opt_enum_int_items_t dump_items[] = {
176 { "spill", BE_CH_DUMP_SPILL },
177 { "live", BE_CH_DUMP_LIVE },
178 { "color", BE_CH_DUMP_COLOR },
179 { "copymin", BE_CH_DUMP_COPYMIN },
180 { "ssadestr", BE_CH_DUMP_SSADESTR },
181 { "tree", BE_CH_DUMP_TREE_INTV },
182 { "constr", BE_CH_DUMP_CONSTR },
183 { "lower", BE_CH_DUMP_LOWER },
184 { "appel", BE_CH_DUMP_APPEL },
185 { "all", BE_CH_DUMP_ALL },
189 static const lc_opt_enum_int_items_t be_ch_vrfy_items[] = {
190 { "off", BE_CH_VRFY_OFF },
191 { "warn", BE_CH_VRFY_WARN },
192 { "assert", BE_CH_VRFY_ASSERT },
196 static lc_opt_enum_int_var_t spill_var = {
197 &options.spill_method, spill_items
200 static lc_opt_enum_int_var_t ifg_flavor_var = {
201 &options.ifg_flavor, ifg_flavor_items
204 static lc_opt_enum_int_var_t lower_perm_var = {
205 &options.lower_perm_opt, lower_perm_items
208 static lc_opt_enum_int_var_t dump_var = {
209 &options.dump_flags, dump_items
212 static lc_opt_enum_int_var_t be_ch_vrfy_var = {
213 &options.vrfy_option, be_ch_vrfy_items
216 /** Enable extreme live range splitting. */
217 static int be_elr_split = 0;
219 /** Assumed loop iteration count for execution frequency estimation. */
220 static int be_loop_weight = 9;
222 static const lc_opt_table_entry_t be_chordal_options[] = {
223 LC_OPT_ENT_ENUM_INT ("spill", "spill method (belady, morgan or remat)", &spill_var),
224 LC_OPT_ENT_ENUM_PTR ("ifg", "interference graph flavour (std, fast, clique, pointer, list, check)", &ifg_flavor_var),
225 LC_OPT_ENT_ENUM_PTR ("perm", "perm lowering options (copy or swap)", &lower_perm_var),
226 LC_OPT_ENT_ENUM_MASK("dump", "select dump phases", &dump_var),
227 LC_OPT_ENT_ENUM_PTR ("vrfy", "verify options (off, warn, assert)", &be_ch_vrfy_var),
228 LC_OPT_ENT_BOOL ("elrsplit", "enable extreme live range splitting", &be_elr_split),
229 LC_OPT_ENT_INT ("loop_weight", "assumed amount of loop iterations for guessing the execution frequency", &be_loop_weight),
233 static void be_ra_chordal_register_options(lc_opt_entry_t *grp)
235 static int run_once = 0;
236 lc_opt_entry_t *chordal_grp;
240 chordal_grp = lc_opt_get_grp(grp, "chordal");
242 lc_opt_add_table(chordal_grp, be_chordal_options);
245 co_register_options(chordal_grp);
246 be_java_coal_register_options(chordal_grp);
248 #endif /* WITH_LIBCORE */
250 static void dump(unsigned mask, ir_graph *irg,
251 const arch_register_class_t *cls,
253 void (*dump_func)(ir_graph *, const char *))
255 if((options.dump_flags & mask) == mask) {
258 snprintf(buf, sizeof(buf), "-%s%s", cls->name, suffix);
259 be_dump(irg, buf, dump_func);
262 be_dump(irg, suffix, dump_func);
266 static void put_ignore_colors(be_chordal_env_t *chordal_env)
268 int n_colors = chordal_env->cls->n_regs;
271 bitset_clear_all(chordal_env->ignore_colors);
272 be_abi_put_ignore_regs(chordal_env->birg->abi, chordal_env->cls, chordal_env->ignore_colors);
273 for(i = 0; i < n_colors; ++i)
274 if(arch_register_type_is(&chordal_env->cls->regs[i], ignore))
275 bitset_set(chordal_env->ignore_colors, i);
278 FILE *be_chordal_open(const be_chordal_env_t *env, const char *prefix, const char *suffix)
282 ir_snprintf(buf, sizeof(buf), "%s%F_%s%s", prefix, env->irg, env->cls->name, suffix);
283 return fopen(buf, "wt");
286 void check_ifg_implementations(be_chordal_env_t *chordal_env)
290 f = be_chordal_open(chordal_env, "std", ".log");
291 chordal_env->ifg = be_ifg_std_new(chordal_env);
292 be_ifg_check_sorted_to_file(chordal_env->ifg, f);
295 f = be_chordal_open(chordal_env, "list", ".log");
296 be_ifg_free(chordal_env->ifg);
297 chordal_env->ifg = be_ifg_list_new(chordal_env);
298 be_ifg_check_sorted_to_file(chordal_env->ifg, f);
301 f = be_chordal_open(chordal_env, "clique", ".log");
302 be_ifg_free(chordal_env->ifg);
303 chordal_env->ifg = be_ifg_clique_new(chordal_env);
304 be_ifg_check_sorted_to_file(chordal_env->ifg, f);
307 f = be_chordal_open(chordal_env, "pointer", ".log");
308 be_ifg_free(chordal_env->ifg);
309 chordal_env->ifg = be_ifg_pointer_new(chordal_env);
310 be_ifg_check_sorted_to_file(chordal_env->ifg, f);
313 chordal_env->ifg = NULL;
317 * Checks for every reload if it's user can perform the load on itself.
319 static void memory_operand_walker(ir_node *irn, void *env) {
320 be_chordal_env_t *cenv = env;
321 const arch_env_t *aenv = cenv->birg->main_env->arch_env;
322 const ir_edge_t *edge, *ne;
325 if (! be_is_Reload(irn))
328 block = get_nodes_block(irn);
330 foreach_out_edge_safe(irn, edge, ne) {
331 ir_node *src = get_edge_src_irn(edge);
332 int pos = get_edge_src_pos(edge);
337 if (get_nodes_block(src) == block && arch_possible_memory_operand(aenv, src, pos)) {
338 DBG((cenv->dbg, LEVEL_3, "performing memory operand %+F at %+F\n", irn, src));
339 arch_perform_memory_operand(aenv, src, irn, pos);
343 /* kill the Reload */
344 if (get_irn_n_edges(irn) == 0) {
346 set_irn_n(irn, 0, new_Bad());
347 set_irn_n(irn, 1, new_Bad());
352 * Starts a walk for memory operands if supported by the backend.
354 static INLINE void check_for_memory_operands(be_chordal_env_t *chordal_env) {
355 irg_walk_graph(chordal_env->irg, NULL, memory_operand_walker, chordal_env);
359 * Performs chordal register allocation for each register class on given irg.
361 * @param bi Backend irg object
362 * @return Structure containing timer for the single phases or NULL if no timing requested.
364 static be_ra_timer_t *be_ra_chordal_main(const be_irg_t *bi)
366 const be_main_env_t *main_env = bi->main_env;
367 const arch_isa_t *isa = arch_env_get_isa(main_env->arch_env);
368 ir_graph *irg = bi->irg;
369 be_options_t *main_opts = main_env->options;
373 be_chordal_env_t chordal_env;
375 if (main_opts->timing == BE_TIME_ON) {
376 ra_timer.t_prolog = lc_timer_register("ra_prolog", "regalloc prolog");
377 ra_timer.t_epilog = lc_timer_register("ra_epilog", "regalloc epilog");
378 ra_timer.t_live = lc_timer_register("ra_liveness", "be liveness");
379 ra_timer.t_spill = lc_timer_register("ra_spill", "spiller");
380 ra_timer.t_color = lc_timer_register("ra_color", "graph coloring");
381 ra_timer.t_ifg = lc_timer_register("ra_ifg", "interference graph");
382 ra_timer.t_copymin = lc_timer_register("ra_copymin", "copy minimization");
383 ra_timer.t_ssa = lc_timer_register("ra_ssadestr", "ssa destruction");
384 ra_timer.t_verify = lc_timer_register("ra_verify", "graph verification");
385 ra_timer.t_other = lc_timer_register("ra_other", "other time");
387 LC_STOP_AND_RESET_TIMER(ra_timer.t_prolog);
388 LC_STOP_AND_RESET_TIMER(ra_timer.t_epilog);
389 LC_STOP_AND_RESET_TIMER(ra_timer.t_live);
390 LC_STOP_AND_RESET_TIMER(ra_timer.t_spill);
391 LC_STOP_AND_RESET_TIMER(ra_timer.t_color);
392 LC_STOP_AND_RESET_TIMER(ra_timer.t_ifg);
393 LC_STOP_AND_RESET_TIMER(ra_timer.t_copymin);
394 LC_STOP_AND_RESET_TIMER(ra_timer.t_ssa);
395 LC_STOP_AND_RESET_TIMER(ra_timer.t_verify);
396 LC_STOP_AND_RESET_TIMER(ra_timer.t_other);
399 #define BE_TIMER_PUSH(timer) \
400 if (main_opts->timing == BE_TIME_ON) { \
401 int res = lc_timer_push(timer); \
402 if (options.vrfy_option == BE_CH_VRFY_ASSERT) \
403 assert(res && "Timer already on stack, cannot be pushed twice."); \
404 else if (options.vrfy_option == BE_CH_VRFY_WARN && ! res) \
405 fprintf(stderr, "Timer %s already on stack, cannot be pushed twice.\n", \
406 lc_timer_get_name(timer)); \
408 #define BE_TIMER_POP(timer) \
409 if (main_opts->timing == BE_TIME_ON) { \
410 lc_timer_t *tmp = lc_timer_pop(); \
411 if (options.vrfy_option == BE_CH_VRFY_ASSERT) \
412 assert(tmp == timer && "Attempt to pop wrong timer."); \
413 else if (options.vrfy_option == BE_CH_VRFY_WARN && tmp != timer) \
414 fprintf(stderr, "Attempt to pop wrong timer. %s is on stack, trying to pop %s.\n", \
415 lc_timer_get_name(tmp), lc_timer_get_name(timer)); \
419 BE_TIMER_PUSH(ra_timer.t_other);
420 BE_TIMER_PUSH(ra_timer.t_prolog);
424 chordal_env.opts = &options;
425 chordal_env.irg = irg;
426 chordal_env.birg = bi;
427 chordal_env.dom_front = be_compute_dominance_frontiers(irg);
428 chordal_env.exec_freq = compute_execfreq(irg, be_loop_weight);
429 chordal_env.lv = be_liveness(irg);
430 FIRM_DBG_REGISTER(chordal_env.dbg, "firm.be.chordal");
432 obstack_init(&chordal_env.obst);
434 BE_TIMER_POP(ra_timer.t_prolog);
436 /* Perform the following for each register class. */
437 for (j = 0, m = arch_isa_get_n_reg_class(isa); j < m; ++j) {
439 copy_opt_t *co = NULL;
441 chordal_env.cls = arch_isa_get_reg_class(isa, j);
442 chordal_env.border_heads = pmap_create();
443 chordal_env.ignore_colors = bitset_malloc(chordal_env.cls->n_regs);
445 /* put all ignore registers into the ignore register set. */
446 put_ignore_colors(&chordal_env);
448 BE_TIMER_PUSH(ra_timer.t_live);
449 be_liveness_recompute(chordal_env.lv);
450 BE_TIMER_POP(ra_timer.t_live);
451 dump(BE_CH_DUMP_LIVE, irg, chordal_env.cls, "-live", dump_ir_block_graph_sched);
453 be_pre_spill_prepare_constr(&chordal_env);
454 dump(BE_CH_DUMP_CONSTR, irg, chordal_env.cls, "-constr-pre", dump_ir_block_graph_sched);
456 BE_TIMER_PUSH(ra_timer.t_spill);
459 switch(options.spill_method) {
460 case BE_CH_SPILL_MORGAN:
461 be_spill_morgan(&chordal_env);
463 case BE_CH_SPILL_BELADY:
464 be_spill_belady(&chordal_env);
467 case BE_CH_SPILL_REMAT:
468 be_spill_remat(&chordal_env);
470 #endif /* WITH_ILP */
472 fprintf(stderr, "no valid spiller selected. falling back to belady\n");
473 be_spill_belady(&chordal_env);
476 BE_TIMER_POP(ra_timer.t_spill);
478 DBG((chordal_env.dbg, LEVEL_1, "spill costs for %+F in regclass %s: %g\n",
480 chordal_env.cls->name,
481 get_irg_spill_cost(&chordal_env))
484 dump(BE_CH_DUMP_SPILL, irg, chordal_env.cls, "-spill", dump_ir_block_graph_sched);
485 be_compute_spill_offsets(&chordal_env);
486 //be_coalesce_spillslots(&chordal_env);
487 check_for_memory_operands(&chordal_env);
488 be_abi_fix_stack_nodes(bi->abi, chordal_env.lv);
490 BE_TIMER_PUSH(ra_timer.t_verify);
492 /* verify schedule and register pressure */
493 if (options.vrfy_option == BE_CH_VRFY_WARN) {
494 be_verify_schedule(irg);
495 be_verify_register_pressure(chordal_env.birg->main_env->arch_env, chordal_env.cls, irg);
497 else if (options.vrfy_option == BE_CH_VRFY_ASSERT) {
498 assert(be_verify_schedule(irg) && "Schedule verification failed");
499 assert(be_verify_register_pressure(chordal_env.birg->main_env->arch_env, chordal_env.cls, irg)
500 && "Register pressure verification failed");
502 BE_TIMER_POP(ra_timer.t_verify);
504 if (be_elr_split && ! splitted) {
505 extreme_liverange_splitting(&chordal_env);
510 /* Color the graph. */
511 BE_TIMER_PUSH(ra_timer.t_color);
512 be_ra_chordal_color(&chordal_env);
513 BE_TIMER_POP(ra_timer.t_color);
515 dump(BE_CH_DUMP_CONSTR, irg, chordal_env.cls, "-color", dump_ir_block_graph_sched);
517 /* Create the ifg with the selected flavor */
518 BE_TIMER_PUSH(ra_timer.t_ifg);
519 switch (options.ifg_flavor) {
521 fprintf(stderr, "no valid ifg flavour selected. falling back to std\n");
524 chordal_env.ifg = be_ifg_std_new(&chordal_env);
526 case BE_CH_IFG_CLIQUE:
527 chordal_env.ifg = be_ifg_clique_new(&chordal_env);
529 case BE_CH_IFG_POINTER:
530 chordal_env.ifg = be_ifg_pointer_new(&chordal_env);
533 chordal_env.ifg = be_ifg_list_new(&chordal_env);
535 case BE_CH_IFG_CHECK:
536 check_ifg_implementations(&chordal_env);
537 /* Build the interference graph. */
538 chordal_env.ifg = be_ifg_std_new(&chordal_env);
541 BE_TIMER_POP(ra_timer.t_ifg);
543 BE_TIMER_PUSH(ra_timer.t_verify);
544 if (options.vrfy_option != BE_CH_VRFY_OFF)
545 be_ra_chordal_check(&chordal_env);
547 BE_TIMER_POP(ra_timer.t_verify);
549 /* copy minimization */
550 BE_TIMER_PUSH(ra_timer.t_copymin);
551 co_driver(&chordal_env);
552 BE_TIMER_POP(ra_timer.t_copymin);
553 dump(BE_CH_DUMP_COPYMIN, irg, chordal_env.cls, "-copymin", dump_ir_block_graph_sched);
555 BE_TIMER_PUSH(ra_timer.t_verify);
557 if (options.vrfy_option != BE_CH_VRFY_OFF)
558 be_ra_chordal_check(&chordal_env);
560 BE_TIMER_POP(ra_timer.t_verify);
561 BE_TIMER_PUSH(ra_timer.t_ssa);
563 /* ssa destruction */
564 be_ssa_destruction(&chordal_env);
566 BE_TIMER_POP(ra_timer.t_ssa);
568 dump(BE_CH_DUMP_SSADESTR, irg, chordal_env.cls, "-ssadestr", dump_ir_block_graph_sched);
570 BE_TIMER_PUSH(ra_timer.t_verify);
571 if (options.vrfy_option != BE_CH_VRFY_OFF) {
572 be_ssa_destruction_check(&chordal_env);
573 be_ra_chordal_check(&chordal_env);
575 BE_TIMER_POP(ra_timer.t_verify);
577 be_ifg_free(chordal_env.ifg);
578 pmap_destroy(chordal_env.border_heads);
579 bitset_free(chordal_env.ignore_colors);
582 BE_TIMER_PUSH(ra_timer.t_epilog);
584 dump(BE_CH_DUMP_LOWER, irg, NULL, "-spilloff", dump_ir_block_graph_sched);
586 lower_nodes_after_ra(&chordal_env, options.lower_perm_opt & BE_CH_LOWER_PERM_COPY ? 1 : 0);
587 dump(BE_CH_DUMP_LOWER, irg, NULL, "-belower-after-ra", dump_ir_block_graph_sched);
589 obstack_free(&chordal_env.obst, NULL);
590 be_free_dominance_frontiers(chordal_env.dom_front);
591 be_liveness_free(chordal_env.lv);
592 free_execfreq(chordal_env.exec_freq);
594 BE_TIMER_POP(ra_timer.t_epilog);
595 BE_TIMER_POP(ra_timer.t_other);
600 return main_opts->timing == BE_TIME_ON ? &ra_timer : NULL;
603 const be_ra_t be_ra_chordal_allocator = {
605 be_ra_chordal_register_options,