2 * @file bechordal_main.c
4 * @author Sebastian Hack
7 * Copyright (C) 2005-2006 Universitaet Karlsruhe
8 * Released under the GPL
10 * Driver for the chordal register allocator.
23 #include "firm_config.h"
26 #include <libcore/lc_opts.h>
27 #include <libcore/lc_opts_enum.h>
28 #include <libcore/lc_timing.h>
29 #endif /* WITH_LIBCORE */
33 #include "irgraph_t.h"
34 #include "irprintf_t.h"
47 #include "bechordal_t.h"
49 #include "bejavacoal.h"
52 #include "besched_t.h"
56 #include "beifg_impl.h"
58 #include "bestatevent.h"
62 #include "bespillbelady.h"
63 #include "bespillmorgan.h"
64 #include "bespillslots.h"
65 #include "bespilloptions.h"
69 #include "bespillremat.h"
72 #include "bejavacoal.h"
73 #include "becopystat.h"
74 #include "becopyopt.h"
75 #include "bessadestr.h"
79 static be_ra_chordal_opts_t options = {
83 BE_CH_LOWER_PERM_SWAP,
87 /** Enable extreme live range splitting. */
88 static int be_elr_split = 0;
90 /** Assumed loop iteration count for execution frequency estimation. */
91 static int be_loop_weight = 9;
93 typedef struct _post_spill_env_t {
94 be_chordal_env_t cenv;
95 double pre_spill_cost;
98 static be_ra_timer_t ra_timer = {
112 static const lc_opt_enum_int_items_t spill_items[] = {
113 { "belady", BE_CH_SPILL_BELADY },
114 { "morgan", BE_CH_SPILL_MORGAN },
116 { "remat", BE_CH_SPILL_REMAT },
117 #endif /* WITH_ILP */
121 static const lc_opt_enum_int_items_t ifg_flavor_items[] = {
122 { "std", BE_CH_IFG_STD },
123 { "fast", BE_CH_IFG_FAST },
124 { "clique", BE_CH_IFG_CLIQUE },
125 { "pointer", BE_CH_IFG_POINTER },
126 { "list", BE_CH_IFG_LIST },
127 { "check", BE_CH_IFG_CHECK },
131 static const lc_opt_enum_int_items_t lower_perm_items[] = {
132 { "copy", BE_CH_LOWER_PERM_COPY },
133 { "swap", BE_CH_LOWER_PERM_SWAP },
137 static const lc_opt_enum_int_items_t lower_perm_stat_items[] = {
141 static const lc_opt_enum_int_items_t dump_items[] = {
142 { "spill", BE_CH_DUMP_SPILL },
143 { "live", BE_CH_DUMP_LIVE },
144 { "color", BE_CH_DUMP_COLOR },
145 { "copymin", BE_CH_DUMP_COPYMIN },
146 { "ssadestr", BE_CH_DUMP_SSADESTR },
147 { "tree", BE_CH_DUMP_TREE_INTV },
148 { "constr", BE_CH_DUMP_CONSTR },
149 { "lower", BE_CH_DUMP_LOWER },
150 { "spillslots", BE_CH_DUMP_SPILLSLOTS },
151 { "appel", BE_CH_DUMP_APPEL },
152 { "all", BE_CH_DUMP_ALL },
156 static const lc_opt_enum_int_items_t be_ch_vrfy_items[] = {
157 { "off", BE_CH_VRFY_OFF },
158 { "warn", BE_CH_VRFY_WARN },
159 { "assert", BE_CH_VRFY_ASSERT },
163 static lc_opt_enum_int_var_t spill_var = {
164 &options.spill_method, spill_items
167 static lc_opt_enum_int_var_t ifg_flavor_var = {
168 &options.ifg_flavor, ifg_flavor_items
171 static lc_opt_enum_int_var_t lower_perm_var = {
172 &options.lower_perm_opt, lower_perm_items
175 static lc_opt_enum_int_var_t dump_var = {
176 &options.dump_flags, dump_items
179 static lc_opt_enum_int_var_t be_ch_vrfy_var = {
180 &options.vrfy_option, be_ch_vrfy_items
183 static const lc_opt_table_entry_t be_chordal_options[] = {
184 LC_OPT_ENT_ENUM_INT ("spill", "spill method", &spill_var),
185 LC_OPT_ENT_ENUM_PTR ("ifg", "interference graph flavour", &ifg_flavor_var),
186 LC_OPT_ENT_ENUM_PTR ("perm", "perm lowering options", &lower_perm_var),
187 LC_OPT_ENT_ENUM_MASK("dump", "select dump phases", &dump_var),
188 LC_OPT_ENT_ENUM_PTR ("vrfy", "verify options", &be_ch_vrfy_var),
189 LC_OPT_ENT_BOOL ("elrsplit", "enable extreme live range splitting", &be_elr_split),
190 LC_OPT_ENT_INT ("loop_weight", "assumed amount of loop iterations for guessing the execution frequency", &be_loop_weight),
194 void be_ra_chordal_check(be_chordal_env_t *chordal_env) {
195 const arch_env_t *arch_env = chordal_env->birg->main_env->arch_env;
198 ir_node **nodes, *n1, *n2;
200 be_lv_t *lv = chordal_env->birg->lv;
201 DEBUG_ONLY(firm_dbg_module_t *dbg = chordal_env->dbg;)
203 /* Collect all irns */
205 pmap_foreach(chordal_env->border_heads, pme) {
207 struct list_head *head = pme->value;
208 list_for_each_entry(border_t, curr, head, list)
209 if (curr->is_def && curr->is_real)
210 if (arch_get_irn_reg_class(arch_env, curr->irn, -1) == chordal_env->cls)
211 obstack_ptr_grow(&ob, curr->irn);
213 obstack_ptr_grow(&ob, NULL);
214 nodes = (ir_node **) obstack_finish(&ob);
217 for (i = 0, n1 = nodes[i]; n1; n1 = nodes[++i]) {
218 const arch_register_t *n1_reg, *n2_reg;
220 n1_reg = arch_get_irn_register(arch_env, n1);
221 if (!arch_reg_is_allocatable(arch_env, n1, -1, n1_reg)) {
222 DBG((dbg, 0, "Register %s assigned to %+F is not allowed\n", n1_reg->name, n1));
223 assert(0 && "Register constraint does not hold");
225 for (o = i+1, n2 = nodes[o]; n2; n2 = nodes[++o]) {
226 n2_reg = arch_get_irn_register(arch_env, n2);
227 if (values_interfere(lv, n1, n2) && n1_reg == n2_reg) {
228 DBG((dbg, 0, "Values %+F and %+F interfere and have the same register assigned: %s\n", n1, n2, n1_reg->name));
229 assert(0 && "Interfering values have the same color!");
233 obstack_free(&ob, NULL);
236 int nodes_interfere(const be_chordal_env_t *env, const ir_node *a, const ir_node *b)
239 return be_ifg_connected(env->ifg, a, b);
241 return values_interfere(env->birg->lv, a, b);
244 static void dump(unsigned mask, ir_graph *irg,
245 const arch_register_class_t *cls,
247 void (*dump_func)(ir_graph *, const char *))
249 if((options.dump_flags & mask) == mask) {
252 snprintf(buf, sizeof(buf), "-%s%s", cls->name, suffix);
253 be_dump(irg, buf, dump_func);
256 be_dump(irg, suffix, dump_func);
260 static void put_ignore_colors(be_chordal_env_t *chordal_env)
262 int n_colors = chordal_env->cls->n_regs;
265 bitset_clear_all(chordal_env->ignore_colors);
266 be_abi_put_ignore_regs(chordal_env->birg->abi, chordal_env->cls, chordal_env->ignore_colors);
267 for(i = 0; i < n_colors; ++i)
268 if(arch_register_type_is(&chordal_env->cls->regs[i], ignore))
269 bitset_set(chordal_env->ignore_colors, i);
272 FILE *be_chordal_open(const be_chordal_env_t *env, const char *prefix, const char *suffix)
276 ir_snprintf(buf, sizeof(buf), "%s%F_%s%s", prefix, env->irg, env->cls->name, suffix);
277 return fopen(buf, "wt");
280 void check_ifg_implementations(be_chordal_env_t *chordal_env)
284 f = be_chordal_open(chordal_env, "std", ".log");
285 chordal_env->ifg = be_ifg_std_new(chordal_env);
286 be_ifg_check_sorted_to_file(chordal_env->ifg, f);
289 f = be_chordal_open(chordal_env, "list", ".log");
290 be_ifg_free(chordal_env->ifg);
291 chordal_env->ifg = be_ifg_list_new(chordal_env);
292 be_ifg_check_sorted_to_file(chordal_env->ifg, f);
295 f = be_chordal_open(chordal_env, "clique", ".log");
296 be_ifg_free(chordal_env->ifg);
297 chordal_env->ifg = be_ifg_clique_new(chordal_env);
298 be_ifg_check_sorted_to_file(chordal_env->ifg, f);
301 f = be_chordal_open(chordal_env, "pointer", ".log");
302 be_ifg_free(chordal_env->ifg);
303 chordal_env->ifg = be_ifg_pointer_new(chordal_env);
304 be_ifg_check_sorted_to_file(chordal_env->ifg, f);
307 chordal_env->ifg = NULL;
311 * Checks for every reload if it's user can perform the load on itself.
313 static void memory_operand_walker(ir_node *irn, void *env) {
314 be_chordal_env_t *cenv = env;
315 const arch_env_t *aenv = cenv->birg->main_env->arch_env;
316 const ir_edge_t *edge, *ne;
320 if (! be_is_Reload(irn))
323 /* only use memory operands, if the reload is only used by 1 node */
324 if(get_irn_n_edges(irn) > 1)
327 spill = be_get_Reload_mem(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);
334 assert(src && "outedges broken!");
336 if (get_nodes_block(src) == block && arch_possible_memory_operand(aenv, src, pos)) {
337 DBG((cenv->dbg, LEVEL_3, "performing memory operand %+F at %+F\n", irn, src));
338 arch_perform_memory_operand(aenv, src, spill, pos);
342 /* kill the Reload */
343 if (get_irn_n_edges(irn) == 0) {
345 set_irn_n(irn, be_pos_Reload_mem, new_Bad());
350 * Starts a walk for memory operands if supported by the backend.
352 static INLINE void check_for_memory_operands(be_chordal_env_t *chordal_env) {
353 irg_walk_graph(chordal_env->irg, NULL, memory_operand_walker, chordal_env);
357 * Sorry for doing stats again...
359 typedef struct _node_stat_t {
360 unsigned int n_phis; /**< Phis of the current register class. */
361 unsigned int n_mem_phis; /**< Memory Phis (Phis with spill operands). */
362 unsigned int n_copies; /**< Copies */
363 unsigned int n_perms; /**< Perms */
364 unsigned int n_spills; /**< Spill nodes */
365 unsigned int n_reloads; /**< Reloads */
368 struct node_stat_walker {
370 const be_chordal_env_t *cenv;
374 static void node_stat_walker(ir_node *irn, void *data)
376 struct node_stat_walker *env = data;
377 const arch_env_t *aenv = env->cenv->birg->main_env->arch_env;
379 if(arch_irn_consider_in_reg_alloc(aenv, env->cenv->cls, irn)) {
381 /* if the node is a normal phi */
385 else if(arch_irn_classify(aenv, irn) & arch_irn_class_spill)
386 ++env->stat->n_spills;
388 else if(arch_irn_classify(aenv, irn) & arch_irn_class_reload)
389 ++env->stat->n_reloads;
391 else if(arch_irn_classify(aenv, irn) & arch_irn_class_copy)
392 ++env->stat->n_copies;
394 else if(arch_irn_classify(aenv, irn) & arch_irn_class_perm)
395 ++env->stat->n_perms;
398 /* a mem phi is a PhiM with a mem phi operand or a Spill operand */
399 else if(is_Phi(irn) && get_irn_mode(irn) == mode_M) {
402 for(i = get_irn_arity(irn) - 1; i >= 0; --i) {
403 ir_node *op = get_irn_n(irn, i);
405 if((is_Phi(op) && bitset_contains_irn(env->mem_phis, op)) || (arch_irn_classify(aenv, op) & arch_irn_class_spill)) {
406 bitset_add_irn(env->mem_phis, irn);
407 env->stat->n_mem_phis++;
414 static void node_stats(const be_chordal_env_t *cenv, node_stat_t *stat)
416 struct node_stat_walker env;
418 memset(stat, 0, sizeof(stat[0]));
420 env.mem_phis = bitset_irg_malloc(cenv->irg);
422 irg_walk_graph(cenv->irg, NULL, node_stat_walker, &env);
423 bitset_free(env.mem_phis);
426 static void insn_count_walker(ir_node *irn, void *data)
430 switch(get_irn_opcode(irn)) {
441 static unsigned int count_insns(ir_graph *irg)
444 irg_walk_graph(irg, insn_count_walker, NULL, &cnt);
450 * Initialize all timers.
452 static void be_init_timer(be_options_t *main_opts)
454 if (main_opts->timing == BE_TIME_ON) {
455 ra_timer.t_prolog = lc_timer_register("ra_prolog", "regalloc prolog");
456 ra_timer.t_epilog = lc_timer_register("ra_epilog", "regalloc epilog");
457 ra_timer.t_live = lc_timer_register("ra_liveness", "be liveness");
458 ra_timer.t_spill = lc_timer_register("ra_spill", "spiller");
459 ra_timer.t_spillslots = lc_timer_register("ra_spillslots", "spillslots");
460 ra_timer.t_color = lc_timer_register("ra_color", "graph coloring");
461 ra_timer.t_ifg = lc_timer_register("ra_ifg", "interference graph");
462 ra_timer.t_copymin = lc_timer_register("ra_copymin", "copy minimization");
463 ra_timer.t_ssa = lc_timer_register("ra_ssadestr", "ssa destruction");
464 ra_timer.t_verify = lc_timer_register("ra_verify", "graph verification");
465 ra_timer.t_other = lc_timer_register("ra_other", "other time");
467 LC_STOP_AND_RESET_TIMER(ra_timer.t_prolog);
468 LC_STOP_AND_RESET_TIMER(ra_timer.t_epilog);
469 LC_STOP_AND_RESET_TIMER(ra_timer.t_live);
470 LC_STOP_AND_RESET_TIMER(ra_timer.t_spill);
471 LC_STOP_AND_RESET_TIMER(ra_timer.t_spillslots);
472 LC_STOP_AND_RESET_TIMER(ra_timer.t_color);
473 LC_STOP_AND_RESET_TIMER(ra_timer.t_ifg);
474 LC_STOP_AND_RESET_TIMER(ra_timer.t_copymin);
475 LC_STOP_AND_RESET_TIMER(ra_timer.t_ssa);
476 LC_STOP_AND_RESET_TIMER(ra_timer.t_verify);
477 LC_STOP_AND_RESET_TIMER(ra_timer.t_other);
481 #define BE_TIMER_INIT(main_opts) be_init_timer(main_opts)
483 #define BE_TIMER_PUSH(timer) \
484 if (main_opts->timing == BE_TIME_ON) { \
485 if (! lc_timer_push(timer)) { \
486 if (options.vrfy_option == BE_CH_VRFY_ASSERT) \
487 assert(!"Timer already on stack, cannot be pushed twice."); \
488 else if (options.vrfy_option == BE_CH_VRFY_WARN) \
489 fprintf(stderr, "Timer %s already on stack, cannot be pushed twice.\n", \
490 lc_timer_get_name(timer)); \
493 #define BE_TIMER_POP(timer) \
494 if (main_opts->timing == BE_TIME_ON) { \
495 lc_timer_t *tmp = lc_timer_pop(); \
496 if (options.vrfy_option == BE_CH_VRFY_ASSERT) \
497 assert(tmp == timer && "Attempt to pop wrong timer."); \
498 else if (options.vrfy_option == BE_CH_VRFY_WARN && tmp != timer) \
499 fprintf(stderr, "Attempt to pop wrong timer. %s is on stack, trying to pop %s.\n", \
500 lc_timer_get_name(tmp), lc_timer_get_name(timer)); \
505 #define BE_TIMER_INIT(main_opts)
506 #define BE_TIMER_PUSH(timer)
507 #define BE_TIMER_POP(timer)
509 #endif /* WITH_LIBCORE */
512 * Perform things which need to be done per register class before spilling.
514 static void pre_spill(const arch_isa_t *isa, int cls_idx, post_spill_env_t *pse) {
515 be_chordal_env_t *chordal_env = &pse->cenv;
516 node_stat_t node_stat;
518 chordal_env->cls = arch_isa_get_reg_class(isa, cls_idx);
519 chordal_env->border_heads = pmap_create();
520 chordal_env->ignore_colors = bitset_malloc(chordal_env->cls->n_regs);
522 #ifdef FIRM_STATISTICS
523 if (be_stat_ev_is_active()) {
524 be_stat_tags[STAT_TAG_CLS] = chordal_env->cls->name;
525 be_stat_ev_push(be_stat_tags, STAT_TAG_LAST, be_stat_file);
527 /* perform some node statistics. */
528 node_stats(chordal_env, &node_stat);
529 be_stat_ev("phis_before_spill", node_stat.n_phis);
531 #endif /* FIRM_STATISTICS */
533 /* put all ignore registers into the ignore register set. */
534 put_ignore_colors(chordal_env);
536 be_pre_spill_prepare_constr(chordal_env);
537 dump(BE_CH_DUMP_CONSTR, chordal_env->irg, chordal_env->cls, "-constr-pre", dump_ir_block_graph_sched);
539 #ifdef FIRM_STATISTICS
540 if (be_stat_ev_is_active()) {
541 pse->pre_spill_cost = be_estimate_irg_costs(chordal_env->irg,
542 chordal_env->birg->main_env->arch_env, chordal_env->birg->exec_freq);
544 #endif /* FIRM_STATISTICS */
548 * Perform things which need to be done per register class after spilling.
550 static void post_spill(post_spill_env_t *pse) {
551 be_chordal_env_t *chordal_env = &pse->cenv;
552 ir_graph *irg = chordal_env->irg;
553 be_irg_t *birg = chordal_env->birg;
554 const be_main_env_t *main_env = birg->main_env;
555 be_options_t *main_opts = main_env->options;
556 static int splitted = 0;
557 node_stat_t node_stat;
559 #ifdef FIRM_STATISTICS
560 if (be_stat_ev_is_active()) {
561 double spillcosts = be_estimate_irg_costs(irg, main_env->arch_env, birg->exec_freq) - pse->pre_spill_cost;
563 be_stat_ev_l("spillcosts", (long) spillcosts);
565 node_stats(chordal_env, &node_stat);
566 be_stat_ev("phis_after_spill", node_stat.n_phis);
567 be_stat_ev("mem_phis", node_stat.n_mem_phis);
568 be_stat_ev("reloads", node_stat.n_reloads);
569 be_stat_ev("spills", node_stat.n_spills);
571 #endif /* FIRM_STATISTICS */
573 check_for_memory_operands(chordal_env);
575 be_abi_fix_stack_nodes(birg->abi, birg->lv);
577 BE_TIMER_PUSH(ra_timer.t_verify);
579 /* verify schedule and register pressure */
580 if (chordal_env->opts->vrfy_option == BE_CH_VRFY_WARN) {
581 be_verify_schedule(irg);
582 be_verify_register_pressure(chordal_env->birg, chordal_env->cls, irg);
584 else if (chordal_env->opts->vrfy_option == BE_CH_VRFY_ASSERT) {
585 assert(be_verify_schedule(irg) && "Schedule verification failed");
586 assert(be_verify_register_pressure(chordal_env->birg, chordal_env->cls, irg)
587 && "Register pressure verification failed");
589 BE_TIMER_POP(ra_timer.t_verify);
591 if (be_elr_split && ! splitted) {
592 extreme_liverange_splitting(chordal_env);
596 /* Color the graph. */
597 BE_TIMER_PUSH(ra_timer.t_color);
598 be_ra_chordal_color(chordal_env);
599 BE_TIMER_POP(ra_timer.t_color);
601 dump(BE_CH_DUMP_CONSTR, irg, chordal_env->cls, "-color", dump_ir_block_graph_sched);
603 /* Create the ifg with the selected flavor */
604 BE_TIMER_PUSH(ra_timer.t_ifg);
605 switch (chordal_env->opts->ifg_flavor) {
607 fprintf(stderr, "no valid ifg flavour selected. falling back to std\n");
610 chordal_env->ifg = be_ifg_std_new(chordal_env);
612 case BE_CH_IFG_CLIQUE:
613 chordal_env->ifg = be_ifg_clique_new(chordal_env);
615 case BE_CH_IFG_POINTER:
616 chordal_env->ifg = be_ifg_pointer_new(chordal_env);
619 chordal_env->ifg = be_ifg_list_new(chordal_env);
621 case BE_CH_IFG_CHECK:
622 check_ifg_implementations(chordal_env);
623 /* Build the interference graph. */
624 chordal_env->ifg = be_ifg_std_new(chordal_env);
627 BE_TIMER_POP(ra_timer.t_ifg);
629 #ifdef FIRM_STATISTICS
630 if (be_stat_ev_is_active()) {
632 be_ifg_stat(chordal_env, &stat);
633 be_stat_ev("ifg_nodes", stat.n_nodes);
634 be_stat_ev("ifg_edges", stat.n_edges);
635 be_stat_ev("ifg_comps", stat.n_comps);
637 node_stats(chordal_env, &node_stat);
638 be_stat_ev("perms_before_coal", node_stat.n_perms);
639 be_stat_ev("copies_before_coal", node_stat.n_copies);
641 #endif /* FIRM_STATISTICS */
643 /* copy minimization */
644 BE_TIMER_PUSH(ra_timer.t_copymin);
645 co_driver(chordal_env);
646 BE_TIMER_POP(ra_timer.t_copymin);
648 dump(BE_CH_DUMP_COPYMIN, irg, chordal_env->cls, "-copymin", dump_ir_block_graph_sched);
650 BE_TIMER_PUSH(ra_timer.t_ssa);
652 /* ssa destruction */
653 be_ssa_destruction(chordal_env);
655 BE_TIMER_POP(ra_timer.t_ssa);
657 dump(BE_CH_DUMP_SSADESTR, irg, chordal_env->cls, "-ssadestr", dump_ir_block_graph_sched);
659 BE_TIMER_PUSH(ra_timer.t_verify);
660 if (chordal_env->opts->vrfy_option != BE_CH_VRFY_OFF) {
661 be_ssa_destruction_check(chordal_env);
663 BE_TIMER_POP(ra_timer.t_verify);
665 be_ifg_free(chordal_env->ifg);
666 pmap_destroy(chordal_env->border_heads);
667 bitset_free(chordal_env->ignore_colors);
669 #ifdef FIRM_STATISTICS
670 if (be_stat_ev_is_active()) {
671 node_stats(chordal_env, &node_stat);
672 be_stat_ev("perms_after_coal", node_stat.n_perms);
673 be_stat_ev("copies_after_coal", node_stat.n_copies);
676 #endif /* FIRM_STATISTICS */
680 * Performs chordal register allocation for each register class on given irg.
682 * @param birg Backend irg object
683 * @return Structure containing timer for the single phases or NULL if no timing requested.
685 static void be_ra_chordal_main(be_irg_t *birg)
687 const be_main_env_t *main_env = birg->main_env;
688 const arch_isa_t *isa = arch_env_get_isa(main_env->arch_env);
689 ir_graph *irg = birg->irg;
690 be_options_t *main_opts = main_env->options;
692 be_chordal_env_t chordal_env;
694 BE_TIMER_INIT(main_opts);
695 BE_TIMER_PUSH(ra_timer.t_other);
696 BE_TIMER_PUSH(ra_timer.t_prolog);
698 be_assure_dom_front(birg);
699 be_assure_liveness(birg);
701 chordal_env.opts = &options;
702 chordal_env.irg = irg;
703 chordal_env.birg = birg;
704 FIRM_DBG_REGISTER(chordal_env.dbg, "firm.be.chordal");
706 obstack_init(&chordal_env.obst);
708 BE_TIMER_POP(ra_timer.t_prolog);
710 be_stat_ev("insns_before", count_insns(irg));
712 if (! arch_code_generator_has_spiller(birg->cg)) {
713 /* use one of the generic spiller */
715 /* Perform the following for each register class. */
716 for (j = 0, m = arch_isa_get_n_reg_class(isa); j < m; ++j) {
717 post_spill_env_t pse;
719 memcpy(&pse.cenv, &chordal_env, sizeof(chordal_env));
720 pre_spill(isa, j, &pse);
722 BE_TIMER_PUSH(ra_timer.t_spill);
724 switch(options.spill_method) {
725 case BE_CH_SPILL_MORGAN:
726 be_spill_morgan(&pse.cenv);
728 case BE_CH_SPILL_BELADY:
729 be_spill_belady(&pse.cenv);
732 case BE_CH_SPILL_REMAT:
733 be_spill_remat(&pse.cenv);
735 #endif /* WITH_ILP */
737 fprintf(stderr, "no valid spiller selected. falling back to belady\n");
738 be_spill_belady(&pse.cenv);
740 BE_TIMER_POP(ra_timer.t_spill);
742 dump(BE_CH_DUMP_SPILL, irg, pse.cenv.cls, "-spill", dump_ir_block_graph_sched);
748 post_spill_env_t *pse;
750 /* the backend has it's own spiller */
751 m = arch_isa_get_n_reg_class(isa);
753 pse = alloca(m * sizeof(pse[0]));
755 for (j = 0; j < m; ++j) {
756 memcpy(&pse[j].cenv, &chordal_env, sizeof(chordal_env));
757 pre_spill(isa, j, &pse[j]);
760 BE_TIMER_PUSH(ra_timer.t_spill);
761 arch_code_generator_spill(birg->cg, &chordal_env);
762 BE_TIMER_POP(ra_timer.t_spill);
763 dump(BE_CH_DUMP_SPILL, irg, NULL, "-spill", dump_ir_block_graph_sched);
765 for (j = 0; j < m; ++j) {
770 BE_TIMER_PUSH(ra_timer.t_spillslots);
772 be_coalesce_spillslots(&chordal_env);
773 dump(BE_CH_DUMP_SPILLSLOTS, irg, NULL, "-spillslots", dump_ir_block_graph_sched);
775 BE_TIMER_POP(ra_timer.t_spillslots);
777 BE_TIMER_PUSH(ra_timer.t_verify);
778 /* verify spillslots */
779 if (options.vrfy_option == BE_CH_VRFY_WARN) {
780 be_verify_spillslots(main_env->arch_env, irg);
782 else if (options.vrfy_option == BE_CH_VRFY_ASSERT) {
783 assert(be_verify_spillslots(main_env->arch_env, irg) && "Spillslot verification failed");
785 BE_TIMER_POP(ra_timer.t_verify);
787 BE_TIMER_PUSH(ra_timer.t_epilog);
788 dump(BE_CH_DUMP_LOWER, irg, NULL, "-spilloff", dump_ir_block_graph_sched);
790 lower_nodes_after_ra(&chordal_env, options.lower_perm_opt & BE_CH_LOWER_PERM_COPY ? 1 : 0);
791 dump(BE_CH_DUMP_LOWER, irg, NULL, "-belower-after-ra", dump_ir_block_graph_sched);
793 obstack_free(&chordal_env.obst, NULL);
794 BE_TIMER_POP(ra_timer.t_epilog);
796 BE_TIMER_POP(ra_timer.t_other);
798 be_stat_ev("insns_after", count_insns(irg));
803 static be_ra_t be_ra_chordal_allocator = {
807 void be_init_chordal(void)
809 lc_opt_entry_t *be_grp = lc_opt_get_grp(firm_opt_get_root(), "be");
810 lc_opt_entry_t *ra_grp = lc_opt_get_grp(be_grp, "ra");
811 lc_opt_entry_t *chordal_grp = lc_opt_get_grp(ra_grp, "chordal");
813 lc_opt_add_table(chordal_grp, be_chordal_options);
815 be_register_allocator("chordal", &be_ra_chordal_allocator);
818 BE_REGISTER_MODULE_CONSTRUCTOR(be_init_chordal);