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"
53 #include "besched_t.h"
57 #include "beifg_impl.h"
59 #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"
77 #include "bespillcost.h"
80 void be_ra_chordal_check(be_chordal_env_t *chordal_env) {
81 const arch_env_t *arch_env = chordal_env->birg->main_env->arch_env;
84 ir_node **nodes, *n1, *n2;
86 be_lv_t *lv = chordal_env->birg->lv;
87 DEBUG_ONLY(firm_dbg_module_t *dbg = chordal_env->dbg;)
89 /* Collect all irns */
91 pmap_foreach(chordal_env->border_heads, pme) {
93 struct list_head *head = pme->value;
94 list_for_each_entry(border_t, curr, head, list)
95 if (curr->is_def && curr->is_real)
96 if (arch_get_irn_reg_class(arch_env, curr->irn, -1) == chordal_env->cls)
97 obstack_ptr_grow(&ob, curr->irn);
99 obstack_ptr_grow(&ob, NULL);
100 nodes = (ir_node **) obstack_finish(&ob);
103 for (i = 0, n1 = nodes[i]; n1; n1 = nodes[++i]) {
104 const arch_register_t *n1_reg, *n2_reg;
106 n1_reg = arch_get_irn_register(arch_env, n1);
107 if (!arch_reg_is_allocatable(arch_env, n1, -1, n1_reg)) {
108 DBG((dbg, 0, "Register %s assigned to %+F is not allowed\n", n1_reg->name, n1));
109 assert(0 && "Register constraint does not hold");
111 for (o = i+1, n2 = nodes[o]; n2; n2 = nodes[++o]) {
112 n2_reg = arch_get_irn_register(arch_env, n2);
113 if (values_interfere(lv, n1, n2) && n1_reg == n2_reg) {
114 DBG((dbg, 0, "Values %+F and %+F interfere and have the same register assigned: %s\n", n1, n2, n1_reg->name));
115 assert(0 && "Interfering values have the same color!");
119 obstack_free(&ob, NULL);
122 int nodes_interfere(const be_chordal_env_t *env, const ir_node *a, const ir_node *b)
125 return be_ifg_connected(env->ifg, a, b);
127 return values_interfere(env->birg->lv, a, b);
131 static be_ra_chordal_opts_t options = {
135 BE_CH_LOWER_PERM_SWAP,
139 /** Enable extreme live range splitting. */
140 static int be_elr_split = 0;
143 /** Assumed loop iteration count for execution frequency estimation. */
144 static int be_loop_weight = 9;
146 static be_ra_timer_t ra_timer = {
160 static const lc_opt_enum_int_items_t spill_items[] = {
161 { "morgan", BE_CH_SPILL_MORGAN },
162 { "belady", BE_CH_SPILL_BELADY },
164 { "remat", BE_CH_SPILL_REMAT },
165 #endif /* WITH_ILP */
169 static const lc_opt_enum_int_items_t ifg_flavor_items[] = {
170 { "std", BE_CH_IFG_STD },
171 { "fast", BE_CH_IFG_FAST },
172 { "clique", BE_CH_IFG_CLIQUE },
173 { "pointer", BE_CH_IFG_POINTER },
174 { "list", BE_CH_IFG_LIST },
175 { "check", BE_CH_IFG_CHECK },
179 static const lc_opt_enum_int_items_t lower_perm_items[] = {
180 { "copy", BE_CH_LOWER_PERM_COPY },
181 { "swap", BE_CH_LOWER_PERM_SWAP },
185 static const lc_opt_enum_int_items_t lower_perm_stat_items[] = {
189 static const lc_opt_enum_int_items_t dump_items[] = {
190 { "spill", BE_CH_DUMP_SPILL },
191 { "live", BE_CH_DUMP_LIVE },
192 { "color", BE_CH_DUMP_COLOR },
193 { "copymin", BE_CH_DUMP_COPYMIN },
194 { "ssadestr", BE_CH_DUMP_SSADESTR },
195 { "tree", BE_CH_DUMP_TREE_INTV },
196 { "constr", BE_CH_DUMP_CONSTR },
197 { "lower", BE_CH_DUMP_LOWER },
198 { "spillslots", BE_CH_DUMP_SPILLSLOTS },
199 { "appel", BE_CH_DUMP_APPEL },
200 { "all", BE_CH_DUMP_ALL },
204 static const lc_opt_enum_int_items_t be_ch_vrfy_items[] = {
205 { "off", BE_CH_VRFY_OFF },
206 { "warn", BE_CH_VRFY_WARN },
207 { "assert", BE_CH_VRFY_ASSERT },
211 static lc_opt_enum_int_var_t spill_var = {
212 &options.spill_method, spill_items
215 static lc_opt_enum_int_var_t ifg_flavor_var = {
216 &options.ifg_flavor, ifg_flavor_items
219 static lc_opt_enum_int_var_t lower_perm_var = {
220 &options.lower_perm_opt, lower_perm_items
223 static lc_opt_enum_int_var_t dump_var = {
224 &options.dump_flags, dump_items
227 static lc_opt_enum_int_var_t be_ch_vrfy_var = {
228 &options.vrfy_option, be_ch_vrfy_items
231 static const lc_opt_table_entry_t be_chordal_options[] = {
232 LC_OPT_ENT_ENUM_INT ("spill", "spill method", &spill_var),
233 LC_OPT_ENT_ENUM_PTR ("ifg", "interference graph flavour", &ifg_flavor_var),
234 LC_OPT_ENT_ENUM_PTR ("perm", "perm lowering options", &lower_perm_var),
235 LC_OPT_ENT_ENUM_MASK("dump", "select dump phases", &dump_var),
236 LC_OPT_ENT_ENUM_PTR ("vrfy", "verify options", &be_ch_vrfy_var),
237 LC_OPT_ENT_BOOL ("elrsplit", "enable extreme live range splitting", &be_elr_split),
238 LC_OPT_ENT_INT ("loop_weight", "assumed amount of loop iterations for guessing the execution frequency", &be_loop_weight),
242 extern void be_spill_remat_register_options(lc_opt_entry_t *ent);
245 static void be_ra_chordal_register_options(lc_opt_entry_t *grp)
247 static int run_once = 0;
248 lc_opt_entry_t *chordal_grp;
252 chordal_grp = lc_opt_get_grp(grp, "chordal");
254 lc_opt_add_table(chordal_grp, be_chordal_options);
256 co_register_options(chordal_grp);
258 be_java_coal_register_options(chordal_grp);
261 be_spill_remat_register_options(chordal_grp);
263 be_spill_register_options(chordal_grp);
266 #endif /* WITH_LIBCORE */
268 static void dump(unsigned mask, ir_graph *irg,
269 const arch_register_class_t *cls,
271 void (*dump_func)(ir_graph *, const char *))
273 if((options.dump_flags & mask) == mask) {
276 snprintf(buf, sizeof(buf), "-%s%s", cls->name, suffix);
277 be_dump(irg, buf, dump_func);
280 be_dump(irg, suffix, dump_func);
284 static void put_ignore_colors(be_chordal_env_t *chordal_env)
286 int n_colors = chordal_env->cls->n_regs;
289 bitset_clear_all(chordal_env->ignore_colors);
290 be_abi_put_ignore_regs(chordal_env->birg->abi, chordal_env->cls, chordal_env->ignore_colors);
291 for(i = 0; i < n_colors; ++i)
292 if(arch_register_type_is(&chordal_env->cls->regs[i], ignore))
293 bitset_set(chordal_env->ignore_colors, i);
296 FILE *be_chordal_open(const be_chordal_env_t *env, const char *prefix, const char *suffix)
300 ir_snprintf(buf, sizeof(buf), "%s%F_%s%s", prefix, env->irg, env->cls->name, suffix);
301 return fopen(buf, "wt");
304 void check_ifg_implementations(be_chordal_env_t *chordal_env)
308 f = be_chordal_open(chordal_env, "std", ".log");
309 chordal_env->ifg = be_ifg_std_new(chordal_env);
310 be_ifg_check_sorted_to_file(chordal_env->ifg, f);
313 f = be_chordal_open(chordal_env, "list", ".log");
314 be_ifg_free(chordal_env->ifg);
315 chordal_env->ifg = be_ifg_list_new(chordal_env);
316 be_ifg_check_sorted_to_file(chordal_env->ifg, f);
319 f = be_chordal_open(chordal_env, "clique", ".log");
320 be_ifg_free(chordal_env->ifg);
321 chordal_env->ifg = be_ifg_clique_new(chordal_env);
322 be_ifg_check_sorted_to_file(chordal_env->ifg, f);
325 f = be_chordal_open(chordal_env, "pointer", ".log");
326 be_ifg_free(chordal_env->ifg);
327 chordal_env->ifg = be_ifg_pointer_new(chordal_env);
328 be_ifg_check_sorted_to_file(chordal_env->ifg, f);
331 chordal_env->ifg = NULL;
335 * Checks for every reload if it's user can perform the load on itself.
337 static void memory_operand_walker(ir_node *irn, void *env) {
338 be_chordal_env_t *cenv = env;
339 const arch_env_t *aenv = cenv->birg->main_env->arch_env;
340 const ir_edge_t *edge, *ne;
344 if (! be_is_Reload(irn))
347 /* always use addressmode, it's good for x86 */
349 /* only use memory operands, if the reload is only used by 1 node */
350 if(get_irn_n_edges(irn) > 1)
354 spill = be_get_Reload_mem(irn);
355 block = get_nodes_block(irn);
357 foreach_out_edge_safe(irn, edge, ne) {
358 ir_node *src = get_edge_src_irn(edge);
359 int pos = get_edge_src_pos(edge);
361 assert(src && "outedges broken!");
363 if (get_nodes_block(src) == block && arch_possible_memory_operand(aenv, src, pos)) {
364 DBG((cenv->dbg, LEVEL_3, "performing memory operand %+F at %+F\n", irn, src));
365 //arch_perform_memory_operand(aenv, src, spill, pos);
369 /* kill the Reload */
370 if (get_irn_n_edges(irn) == 0) {
372 set_irn_n(irn, 0, new_Bad());
373 set_irn_n(irn, 1, new_Bad());
378 * Starts a walk for memory operands if supported by the backend.
380 static INLINE void check_for_memory_operands(be_chordal_env_t *chordal_env) {
381 irg_walk_graph(chordal_env->irg, NULL, memory_operand_walker, chordal_env);
385 * Sorry for doing stats again...
387 typedef struct _node_stat_t {
388 unsigned int n_phis; /**< Phis of the current register class. */
389 unsigned int n_mem_phis; /**< Memory Phis (Phis with spill operands). */
390 unsigned int n_copies; /**< Copies */
391 unsigned int n_perms; /**< Perms */
392 unsigned int n_spills; /**< Spill nodes */
393 unsigned int n_reloads; /**< Reloads */
396 struct node_stat_walker {
398 const be_chordal_env_t *cenv;
402 static void node_stat_walker(ir_node *irn, void *data)
404 struct node_stat_walker *env = data;
405 const arch_env_t *aenv = env->cenv->birg->main_env->arch_env;
407 if(arch_irn_consider_in_reg_alloc(aenv, env->cenv->cls, irn)) {
409 /* if the node is a normal phi */
413 else if(arch_irn_classify(aenv, irn) & arch_irn_class_spill)
414 ++env->stat->n_spills;
416 else if(arch_irn_classify(aenv, irn) & arch_irn_class_reload)
417 ++env->stat->n_reloads;
419 else if(arch_irn_classify(aenv, irn) & arch_irn_class_copy)
420 ++env->stat->n_copies;
422 else if(arch_irn_classify(aenv, irn) & arch_irn_class_perm)
423 ++env->stat->n_perms;
426 /* a mem phi is a PhiM with a mem phi operand or a Spill operand */
427 else if(is_Phi(irn) && get_irn_mode(irn) == mode_M) {
430 for(i = get_irn_arity(irn) - 1; i >= 0; --i) {
431 ir_node *op = get_irn_n(irn, i);
433 if((is_Phi(op) && bitset_contains_irn(env->mem_phis, op)) || (arch_irn_classify(aenv, op) & arch_irn_class_spill)) {
434 bitset_add_irn(env->mem_phis, irn);
435 env->stat->n_mem_phis++;
442 static void node_stats(const be_chordal_env_t *cenv, node_stat_t *stat)
444 struct node_stat_walker env;
446 memset(stat, 0, sizeof(stat[0]));
448 env.mem_phis = bitset_irg_malloc(cenv->irg);
450 irg_walk_graph(cenv->irg, NULL, node_stat_walker, &env);
451 bitset_free(env.mem_phis);
454 static void insn_count_walker(ir_node *irn, void *data)
458 switch(get_irn_opcode(irn)) {
469 static unsigned int count_insns(ir_graph *irg)
472 irg_walk_graph(irg, insn_count_walker, NULL, &cnt);
478 * Initialize all timers.
480 static void be_init_timer(be_options_t *main_opts)
482 if (main_opts->timing == BE_TIME_ON) {
483 ra_timer.t_prolog = lc_timer_register("ra_prolog", "regalloc prolog");
484 ra_timer.t_epilog = lc_timer_register("ra_epilog", "regalloc epilog");
485 ra_timer.t_live = lc_timer_register("ra_liveness", "be liveness");
486 ra_timer.t_spill = lc_timer_register("ra_spill", "spiller");
487 ra_timer.t_spillslots = lc_timer_register("ra_spillslots", "spillslots");
488 ra_timer.t_color = lc_timer_register("ra_color", "graph coloring");
489 ra_timer.t_ifg = lc_timer_register("ra_ifg", "interference graph");
490 ra_timer.t_copymin = lc_timer_register("ra_copymin", "copy minimization");
491 ra_timer.t_ssa = lc_timer_register("ra_ssadestr", "ssa destruction");
492 ra_timer.t_verify = lc_timer_register("ra_verify", "graph verification");
493 ra_timer.t_other = lc_timer_register("ra_other", "other time");
495 LC_STOP_AND_RESET_TIMER(ra_timer.t_prolog);
496 LC_STOP_AND_RESET_TIMER(ra_timer.t_epilog);
497 LC_STOP_AND_RESET_TIMER(ra_timer.t_live);
498 LC_STOP_AND_RESET_TIMER(ra_timer.t_spill);
499 LC_STOP_AND_RESET_TIMER(ra_timer.t_spillslots);
500 LC_STOP_AND_RESET_TIMER(ra_timer.t_color);
501 LC_STOP_AND_RESET_TIMER(ra_timer.t_ifg);
502 LC_STOP_AND_RESET_TIMER(ra_timer.t_copymin);
503 LC_STOP_AND_RESET_TIMER(ra_timer.t_ssa);
504 LC_STOP_AND_RESET_TIMER(ra_timer.t_verify);
505 LC_STOP_AND_RESET_TIMER(ra_timer.t_other);
509 #define BE_TIMER_INIT(main_opts) be_init_timer(main_opts)
511 #define BE_TIMER_PUSH(timer) \
512 if (main_opts->timing == BE_TIME_ON) { \
513 if (! lc_timer_push(timer)) { \
514 if (options.vrfy_option == BE_CH_VRFY_ASSERT) \
515 assert(!"Timer already on stack, cannot be pushed twice."); \
516 else if (options.vrfy_option == BE_CH_VRFY_WARN) \
517 fprintf(stderr, "Timer %s already on stack, cannot be pushed twice.\n", \
518 lc_timer_get_name(timer)); \
521 #define BE_TIMER_POP(timer) \
522 if (main_opts->timing == BE_TIME_ON) { \
523 lc_timer_t *tmp = lc_timer_pop(); \
524 if (options.vrfy_option == BE_CH_VRFY_ASSERT) \
525 assert(tmp == timer && "Attempt to pop wrong timer."); \
526 else if (options.vrfy_option == BE_CH_VRFY_WARN && tmp != timer) \
527 fprintf(stderr, "Attempt to pop wrong timer. %s is on stack, trying to pop %s.\n", \
528 lc_timer_get_name(tmp), lc_timer_get_name(timer)); \
533 #define BE_TIMER_INIT(main_opts)
534 #define BE_TIMER_PUSH(timer)
535 #define BE_TIMER_POP(timer)
537 #endif /* WITH_LIBCORE */
540 * Performs chordal register allocation for each register class on given irg.
542 * @param birg Backend irg object
543 * @return Structure containing timer for the single phases or NULL if no timing requested.
545 static be_ra_timer_t *be_ra_chordal_main(be_irg_t *birg)
547 const be_main_env_t *main_env = birg->main_env;
548 const arch_isa_t *isa = arch_env_get_isa(main_env->arch_env);
549 ir_graph *irg = birg->irg;
550 be_options_t *main_opts = main_env->options;
554 be_chordal_env_t chordal_env;
556 BE_TIMER_INIT(main_opts);
557 BE_TIMER_PUSH(ra_timer.t_other);
558 BE_TIMER_PUSH(ra_timer.t_prolog);
560 be_assure_dom_front(birg);
561 be_assure_liveness(birg);
563 chordal_env.opts = &options;
564 chordal_env.irg = irg;
565 chordal_env.birg = birg;
566 FIRM_DBG_REGISTER(chordal_env.dbg, "firm.be.chordal");
568 obstack_init(&chordal_env.obst);
570 BE_TIMER_POP(ra_timer.t_prolog);
572 be_stat_ev("insns_before", count_insns(irg));
574 /* Perform the following for each register class. */
575 for (j = 0, m = arch_isa_get_n_reg_class(isa); j < m; ++j) {
576 node_stat_t node_stat;
577 double spillcosts = 0;
579 chordal_env.cls = arch_isa_get_reg_class(isa, j);
580 chordal_env.border_heads = pmap_create();
581 chordal_env.ignore_colors = bitset_malloc(chordal_env.cls->n_regs);
583 #ifdef FIRM_STATISTICS
584 if(be_stat_ev_is_active()) {
585 be_stat_tags[STAT_TAG_CLS] = chordal_env.cls->name;
586 be_stat_ev_push(be_stat_tags, STAT_TAG_LAST, be_stat_file);
588 /* perform some node statistics. */
589 node_stats(&chordal_env, &node_stat);
590 be_stat_ev("phis_before_spill", node_stat.n_phis);
594 /* put all ignore registers into the ignore register set. */
595 put_ignore_colors(&chordal_env);
597 be_pre_spill_prepare_constr(&chordal_env);
598 dump(BE_CH_DUMP_CONSTR, irg, chordal_env.cls, "-constr-pre", dump_ir_block_graph_sched);
600 if(be_stat_ev_is_active()) {
601 spillcosts = be_estimate_irg_costs(irg, main_env->arch_env, birg->exec_freq);
604 BE_TIMER_PUSH(ra_timer.t_spill);
607 switch(options.spill_method) {
608 case BE_CH_SPILL_MORGAN:
609 be_spill_morgan(&chordal_env);
611 case BE_CH_SPILL_BELADY:
612 be_spill_belady(&chordal_env);
615 case BE_CH_SPILL_REMAT:
616 be_spill_remat(&chordal_env);
618 #endif /* WITH_ILP */
620 fprintf(stderr, "no valid spiller selected. falling back to belady\n");
621 be_spill_belady(&chordal_env);
624 BE_TIMER_POP(ra_timer.t_spill);
626 if(be_stat_ev_is_active()) {
627 spillcosts = be_estimate_irg_costs(irg, main_env->arch_env, birg->exec_freq) - spillcosts;
628 be_stat_ev_l("spillcosts", (long) spillcosts);
630 node_stats(&chordal_env, &node_stat);
631 be_stat_ev("phis_after_spill", node_stat.n_phis);
632 be_stat_ev("mem_phis", node_stat.n_mem_phis);
633 be_stat_ev("reloads", node_stat.n_reloads);
634 be_stat_ev("spills", node_stat.n_spills);
637 DBG((chordal_env.dbg, LEVEL_1, "spill costs for %+F in regclass %s: %g\n",irg, chordal_env.cls->name, get_irg_spill_cost(&chordal_env)));
639 dump(BE_CH_DUMP_SPILL, irg, chordal_env.cls, "-spill", dump_ir_block_graph_sched);
641 check_for_memory_operands(&chordal_env);
643 be_abi_fix_stack_nodes(birg->abi, birg->lv);
645 BE_TIMER_PUSH(ra_timer.t_verify);
647 /* verify schedule and register pressure */
648 if (options.vrfy_option == BE_CH_VRFY_WARN) {
649 be_verify_schedule(irg);
650 be_verify_register_pressure(chordal_env.birg, chordal_env.cls, irg);
652 else if (options.vrfy_option == BE_CH_VRFY_ASSERT) {
653 assert(be_verify_schedule(irg) && "Schedule verification failed");
654 assert(be_verify_register_pressure(chordal_env.birg, chordal_env.cls, irg)
655 && "Register pressure verification failed");
657 BE_TIMER_POP(ra_timer.t_verify);
659 if (be_elr_split && ! splitted) {
660 extreme_liverange_splitting(&chordal_env);
665 /* Color the graph. */
666 BE_TIMER_PUSH(ra_timer.t_color);
667 be_ra_chordal_color(&chordal_env);
668 BE_TIMER_POP(ra_timer.t_color);
670 dump(BE_CH_DUMP_CONSTR, irg, chordal_env.cls, "-color", dump_ir_block_graph_sched);
672 /* Create the ifg with the selected flavor */
673 BE_TIMER_PUSH(ra_timer.t_ifg);
674 switch (options.ifg_flavor) {
676 fprintf(stderr, "no valid ifg flavour selected. falling back to std\n");
679 chordal_env.ifg = be_ifg_std_new(&chordal_env);
681 case BE_CH_IFG_CLIQUE:
682 chordal_env.ifg = be_ifg_clique_new(&chordal_env);
684 case BE_CH_IFG_POINTER:
685 chordal_env.ifg = be_ifg_pointer_new(&chordal_env);
688 chordal_env.ifg = be_ifg_list_new(&chordal_env);
690 case BE_CH_IFG_CHECK:
691 check_ifg_implementations(&chordal_env);
692 /* Build the interference graph. */
693 chordal_env.ifg = be_ifg_std_new(&chordal_env);
696 BE_TIMER_POP(ra_timer.t_ifg);
698 if(be_stat_ev_is_active()) {
700 be_ifg_stat(&chordal_env, &stat);
701 be_stat_ev("ifg_nodes", stat.n_nodes);
702 be_stat_ev("ifg_edges", stat.n_edges);
703 be_stat_ev("ifg_comps", stat.n_comps);
706 BE_TIMER_PUSH(ra_timer.t_verify);
707 if (options.vrfy_option != BE_CH_VRFY_OFF) {
708 //be_ra_chordal_check(&chordal_env);
711 BE_TIMER_POP(ra_timer.t_verify);
713 if(be_stat_ev_is_active()) {
714 node_stats(&chordal_env, &node_stat);
715 be_stat_ev("perms_before_coal", node_stat.n_perms);
716 be_stat_ev("copies_before_coal", node_stat.n_copies);
719 /* copy minimization */
720 BE_TIMER_PUSH(ra_timer.t_copymin);
721 co_driver(&chordal_env);
722 BE_TIMER_POP(ra_timer.t_copymin);
724 dump(BE_CH_DUMP_COPYMIN, irg, chordal_env.cls, "-copymin", dump_ir_block_graph_sched);
726 BE_TIMER_PUSH(ra_timer.t_verify);
728 if (options.vrfy_option != BE_CH_VRFY_OFF) {
729 //be_ra_chordal_check(&chordal_env);
732 BE_TIMER_POP(ra_timer.t_verify);
733 BE_TIMER_PUSH(ra_timer.t_ssa);
735 /* ssa destruction */
736 be_ssa_destruction(&chordal_env);
738 BE_TIMER_POP(ra_timer.t_ssa);
740 dump(BE_CH_DUMP_SSADESTR, irg, chordal_env.cls, "-ssadestr", dump_ir_block_graph_sched);
742 BE_TIMER_PUSH(ra_timer.t_verify);
743 if (options.vrfy_option != BE_CH_VRFY_OFF) {
744 be_ssa_destruction_check(&chordal_env);
745 //be_ra_chordal_check(&chordal_env);
747 BE_TIMER_POP(ra_timer.t_verify);
749 be_ifg_free(chordal_env.ifg);
750 pmap_destroy(chordal_env.border_heads);
751 bitset_free(chordal_env.ignore_colors);
753 if(be_stat_ev_is_active()) {
754 node_stats(&chordal_env, &node_stat);
755 be_stat_ev("perms_after_coal", node_stat.n_perms);
756 be_stat_ev("copies_after_coal", node_stat.n_copies);
762 BE_TIMER_PUSH(ra_timer.t_spillslots);
764 be_coalesce_spillslots(&chordal_env);
765 dump(BE_CH_DUMP_SPILLSLOTS, irg, NULL, "-spillslots", dump_ir_block_graph_sched);
767 BE_TIMER_POP(ra_timer.t_spillslots);
769 BE_TIMER_PUSH(ra_timer.t_verify);
771 /* verify spillslots */
772 if (options.vrfy_option == BE_CH_VRFY_WARN) {
773 be_verify_spillslots(main_env->arch_env, irg);
775 else if (options.vrfy_option == BE_CH_VRFY_ASSERT) {
776 assert(be_verify_spillslots(main_env->arch_env, irg) && "Spillslot verification failed");
778 BE_TIMER_POP(ra_timer.t_verify);
780 BE_TIMER_PUSH(ra_timer.t_epilog);
782 dump(BE_CH_DUMP_LOWER, irg, NULL, "-spilloff", dump_ir_block_graph_sched);
784 lower_nodes_after_ra(&chordal_env, options.lower_perm_opt & BE_CH_LOWER_PERM_COPY ? 1 : 0);
785 dump(BE_CH_DUMP_LOWER, irg, NULL, "-belower-after-ra", dump_ir_block_graph_sched);
787 obstack_free(&chordal_env.obst, NULL);
789 BE_TIMER_POP(ra_timer.t_epilog);
790 BE_TIMER_POP(ra_timer.t_other);
792 be_stat_ev("insns_after", count_insns(irg));
795 return main_opts->timing == BE_TIME_ON ? &ra_timer : NULL;
796 #endif /* WITH_LIBCORE */
800 const be_ra_t be_ra_chordal_allocator = {
802 be_ra_chordal_register_options,