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 DEBUG_ONLY(firm_dbg_module_t *dbg = chordal_env->dbg;)
88 /* Collect all irns */
90 pmap_foreach(chordal_env->border_heads, pme) {
92 struct list_head *head = pme->value;
93 list_for_each_entry(border_t, curr, head, list)
94 if (curr->is_def && curr->is_real)
95 if (arch_get_irn_reg_class(arch_env, curr->irn, -1) == chordal_env->cls)
96 obstack_ptr_grow(&ob, curr->irn);
98 obstack_ptr_grow(&ob, NULL);
99 nodes = (ir_node **) obstack_finish(&ob);
102 for (i = 0, n1 = nodes[i]; n1; n1 = nodes[++i]) {
103 const arch_register_t *n1_reg, *n2_reg;
105 n1_reg = arch_get_irn_register(arch_env, n1);
106 if (!arch_reg_is_allocatable(arch_env, n1, -1, n1_reg)) {
107 DBG((dbg, 0, "Register %s assigned to %+F is not allowed\n", n1_reg->name, n1));
108 assert(0 && "Register constraint does not hold");
110 for (o = i+1, n2 = nodes[o]; n2; n2 = nodes[++o]) {
111 n2_reg = arch_get_irn_register(arch_env, n2);
112 if (values_interfere(chordal_env->lv, n1, n2) && n1_reg == n2_reg) {
113 DBG((dbg, 0, "Values %+F and %+F interfere and have the same register assigned: %s\n", n1, n2, n1_reg->name));
114 assert(0 && "Interfering values have the same color!");
118 obstack_free(&ob, NULL);
121 int nodes_interfere(const be_chordal_env_t *env, const ir_node *a, const ir_node *b)
124 return be_ifg_connected(env->ifg, a, b);
126 return values_interfere(env->lv, a, b);
130 static be_ra_chordal_opts_t options = {
134 BE_CH_LOWER_PERM_SWAP,
138 /** Enable extreme live range splitting. */
139 static int be_elr_split = 0;
141 /** Assumed loop iteration count for execution frequency estimation. */
142 static int be_loop_weight = 9;
145 static be_ra_timer_t ra_timer = {
159 static const lc_opt_enum_int_items_t spill_items[] = {
160 { "morgan", BE_CH_SPILL_MORGAN },
161 { "belady", BE_CH_SPILL_BELADY },
163 { "remat", BE_CH_SPILL_REMAT },
164 #endif /* WITH_ILP */
168 static const lc_opt_enum_int_items_t ifg_flavor_items[] = {
169 { "std", BE_CH_IFG_STD },
170 { "fast", BE_CH_IFG_FAST },
171 { "clique", BE_CH_IFG_CLIQUE },
172 { "pointer", BE_CH_IFG_POINTER },
173 { "list", BE_CH_IFG_LIST },
174 { "check", BE_CH_IFG_CHECK },
178 static const lc_opt_enum_int_items_t lower_perm_items[] = {
179 { "copy", BE_CH_LOWER_PERM_COPY },
180 { "swap", BE_CH_LOWER_PERM_SWAP },
184 static const lc_opt_enum_int_items_t lower_perm_stat_items[] = {
188 static const lc_opt_enum_int_items_t dump_items[] = {
189 { "spill", BE_CH_DUMP_SPILL },
190 { "live", BE_CH_DUMP_LIVE },
191 { "color", BE_CH_DUMP_COLOR },
192 { "copymin", BE_CH_DUMP_COPYMIN },
193 { "ssadestr", BE_CH_DUMP_SSADESTR },
194 { "tree", BE_CH_DUMP_TREE_INTV },
195 { "constr", BE_CH_DUMP_CONSTR },
196 { "lower", BE_CH_DUMP_LOWER },
197 { "spillslots", BE_CH_DUMP_SPILLSLOTS },
198 { "appel", BE_CH_DUMP_APPEL },
199 { "all", BE_CH_DUMP_ALL },
203 static const lc_opt_enum_int_items_t be_ch_vrfy_items[] = {
204 { "off", BE_CH_VRFY_OFF },
205 { "warn", BE_CH_VRFY_WARN },
206 { "assert", BE_CH_VRFY_ASSERT },
210 static lc_opt_enum_int_var_t spill_var = {
211 &options.spill_method, spill_items
214 static lc_opt_enum_int_var_t ifg_flavor_var = {
215 &options.ifg_flavor, ifg_flavor_items
218 static lc_opt_enum_int_var_t lower_perm_var = {
219 &options.lower_perm_opt, lower_perm_items
222 static lc_opt_enum_int_var_t dump_var = {
223 &options.dump_flags, dump_items
226 static lc_opt_enum_int_var_t be_ch_vrfy_var = {
227 &options.vrfy_option, be_ch_vrfy_items
230 static const lc_opt_table_entry_t be_chordal_options[] = {
231 LC_OPT_ENT_ENUM_INT ("spill", "spill method", &spill_var),
232 LC_OPT_ENT_ENUM_PTR ("ifg", "interference graph flavour", &ifg_flavor_var),
233 LC_OPT_ENT_ENUM_PTR ("perm", "perm lowering options", &lower_perm_var),
234 LC_OPT_ENT_ENUM_MASK("dump", "select dump phases", &dump_var),
235 LC_OPT_ENT_ENUM_PTR ("vrfy", "verify options", &be_ch_vrfy_var),
236 LC_OPT_ENT_BOOL ("elrsplit", "enable extreme live range splitting", &be_elr_split),
237 LC_OPT_ENT_INT ("loop_weight", "assumed amount of loop iterations for guessing the execution frequency", &be_loop_weight),
241 extern void be_spill_remat_register_options(lc_opt_entry_t *ent);
244 static void be_ra_chordal_register_options(lc_opt_entry_t *grp)
246 static int run_once = 0;
247 lc_opt_entry_t *chordal_grp;
251 chordal_grp = lc_opt_get_grp(grp, "chordal");
253 lc_opt_add_table(chordal_grp, be_chordal_options);
255 co_register_options(chordal_grp);
256 be_java_coal_register_options(chordal_grp);
258 be_spill_remat_register_options(chordal_grp);
260 be_spill_register_options(chordal_grp);
263 #endif /* WITH_LIBCORE */
265 static void dump(unsigned mask, ir_graph *irg,
266 const arch_register_class_t *cls,
268 void (*dump_func)(ir_graph *, const char *))
270 if((options.dump_flags & mask) == mask) {
273 snprintf(buf, sizeof(buf), "-%s%s", cls->name, suffix);
274 be_dump(irg, buf, dump_func);
277 be_dump(irg, suffix, dump_func);
281 static void put_ignore_colors(be_chordal_env_t *chordal_env)
283 int n_colors = chordal_env->cls->n_regs;
286 bitset_clear_all(chordal_env->ignore_colors);
287 be_abi_put_ignore_regs(chordal_env->birg->abi, chordal_env->cls, chordal_env->ignore_colors);
288 for(i = 0; i < n_colors; ++i)
289 if(arch_register_type_is(&chordal_env->cls->regs[i], ignore))
290 bitset_set(chordal_env->ignore_colors, i);
293 FILE *be_chordal_open(const be_chordal_env_t *env, const char *prefix, const char *suffix)
297 ir_snprintf(buf, sizeof(buf), "%s%F_%s%s", prefix, env->irg, env->cls->name, suffix);
298 return fopen(buf, "wt");
301 void check_ifg_implementations(be_chordal_env_t *chordal_env)
305 f = be_chordal_open(chordal_env, "std", ".log");
306 chordal_env->ifg = be_ifg_std_new(chordal_env);
307 be_ifg_check_sorted_to_file(chordal_env->ifg, f);
310 f = be_chordal_open(chordal_env, "list", ".log");
311 be_ifg_free(chordal_env->ifg);
312 chordal_env->ifg = be_ifg_list_new(chordal_env);
313 be_ifg_check_sorted_to_file(chordal_env->ifg, f);
316 f = be_chordal_open(chordal_env, "clique", ".log");
317 be_ifg_free(chordal_env->ifg);
318 chordal_env->ifg = be_ifg_clique_new(chordal_env);
319 be_ifg_check_sorted_to_file(chordal_env->ifg, f);
322 f = be_chordal_open(chordal_env, "pointer", ".log");
323 be_ifg_free(chordal_env->ifg);
324 chordal_env->ifg = be_ifg_pointer_new(chordal_env);
325 be_ifg_check_sorted_to_file(chordal_env->ifg, f);
328 chordal_env->ifg = NULL;
332 * Checks for every reload if it's user can perform the load on itself.
334 static void memory_operand_walker(ir_node *irn, void *env) {
335 be_chordal_env_t *cenv = env;
336 const arch_env_t *aenv = cenv->birg->main_env->arch_env;
337 const ir_edge_t *edge, *ne;
341 if (! be_is_Reload(irn))
344 /* always use addressmode, it's good for x86 */
346 /* only use memory operands, if the reload is only used by 1 node */
347 if(get_irn_n_edges(irn) > 1)
351 spill = be_get_Reload_mem(irn);
352 block = get_nodes_block(irn);
354 foreach_out_edge_safe(irn, edge, ne) {
355 ir_node *src = get_edge_src_irn(edge);
356 int pos = get_edge_src_pos(edge);
361 if (get_nodes_block(src) == block && arch_possible_memory_operand(aenv, src, pos)) {
362 DBG((cenv->dbg, LEVEL_3, "performing memory operand %+F at %+F\n", irn, src));
363 arch_perform_memory_operand(aenv, src, spill, pos);
367 /* kill the Reload */
368 if (get_irn_n_edges(irn) == 0) {
370 set_irn_n(irn, 0, new_Bad());
371 set_irn_n(irn, 1, new_Bad());
376 * Starts a walk for memory operands if supported by the backend.
378 static INLINE void check_for_memory_operands(be_chordal_env_t *chordal_env) {
379 irg_walk_graph(chordal_env->irg, NULL, memory_operand_walker, chordal_env);
383 * Sorry for doing stats again...
385 typedef struct _node_stat_t {
386 unsigned int n_phis; /**< Phis of the current register class. */
387 unsigned int n_mem_phis; /**< Memory Phis (Phis with spill operands). */
388 unsigned int n_copies; /**< Copies */
389 unsigned int n_perms; /**< Perms */
390 unsigned int n_spills; /**< Spill nodes */
391 unsigned int n_reloads; /**< Reloads */
394 struct node_stat_walker {
396 const be_chordal_env_t *cenv;
400 static void node_stat_walker(ir_node *irn, void *data)
402 struct node_stat_walker *env = data;
403 const arch_env_t *aenv = env->cenv->birg->main_env->arch_env;
405 if(arch_irn_consider_in_reg_alloc(aenv, env->cenv->cls, irn)) {
407 /* if the node is a normal phi */
411 else if(arch_irn_classify(aenv, irn) & arch_irn_class_spill)
412 ++env->stat->n_spills;
414 else if(arch_irn_classify(aenv, irn) & arch_irn_class_reload)
415 ++env->stat->n_reloads;
417 else if(arch_irn_classify(aenv, irn) & arch_irn_class_copy)
418 ++env->stat->n_copies;
420 else if(arch_irn_classify(aenv, irn) & arch_irn_class_perm)
421 ++env->stat->n_perms;
424 /* a mem phi is a PhiM with a mem phi operand or a Spill operand */
425 else if(is_Phi(irn) && get_irn_mode(irn) == mode_M) {
428 for(i = get_irn_arity(irn) - 1; i >= 0; --i) {
429 ir_node *op = get_irn_n(irn, i);
431 if((is_Phi(op) && bitset_contains_irn(env->mem_phis, op)) || (arch_irn_classify(aenv, op) & arch_irn_class_spill)) {
432 bitset_add_irn(env->mem_phis, irn);
433 env->stat->n_mem_phis++;
440 static void node_stats(const be_chordal_env_t *cenv, node_stat_t *stat)
442 struct node_stat_walker env;
444 memset(stat, 0, sizeof(stat[0]));
446 env.mem_phis = bitset_irg_malloc(cenv->irg);
448 irg_walk_graph(cenv->irg, NULL, node_stat_walker, &env);
449 bitset_free(env.mem_phis);
452 static void insn_count_walker(ir_node *irn, void *data)
456 switch(get_irn_opcode(irn)) {
467 static unsigned int count_insns(ir_graph *irg)
470 irg_walk_graph(irg, insn_count_walker, NULL, &cnt);
476 * Initialize all timers.
478 static void be_init_timer(be_options_t *main_opts)
480 if (main_opts->timing == BE_TIME_ON) {
481 ra_timer.t_prolog = lc_timer_register("ra_prolog", "regalloc prolog");
482 ra_timer.t_epilog = lc_timer_register("ra_epilog", "regalloc epilog");
483 ra_timer.t_live = lc_timer_register("ra_liveness", "be liveness");
484 ra_timer.t_spill = lc_timer_register("ra_spill", "spiller");
485 ra_timer.t_spillslots = lc_timer_register("ra_spillslots", "spillslots");
486 ra_timer.t_color = lc_timer_register("ra_color", "graph coloring");
487 ra_timer.t_ifg = lc_timer_register("ra_ifg", "interference graph");
488 ra_timer.t_copymin = lc_timer_register("ra_copymin", "copy minimization");
489 ra_timer.t_ssa = lc_timer_register("ra_ssadestr", "ssa destruction");
490 ra_timer.t_verify = lc_timer_register("ra_verify", "graph verification");
491 ra_timer.t_other = lc_timer_register("ra_other", "other time");
493 LC_STOP_AND_RESET_TIMER(ra_timer.t_prolog);
494 LC_STOP_AND_RESET_TIMER(ra_timer.t_epilog);
495 LC_STOP_AND_RESET_TIMER(ra_timer.t_live);
496 LC_STOP_AND_RESET_TIMER(ra_timer.t_spill);
497 LC_STOP_AND_RESET_TIMER(ra_timer.t_spillslots);
498 LC_STOP_AND_RESET_TIMER(ra_timer.t_color);
499 LC_STOP_AND_RESET_TIMER(ra_timer.t_ifg);
500 LC_STOP_AND_RESET_TIMER(ra_timer.t_copymin);
501 LC_STOP_AND_RESET_TIMER(ra_timer.t_ssa);
502 LC_STOP_AND_RESET_TIMER(ra_timer.t_verify);
503 LC_STOP_AND_RESET_TIMER(ra_timer.t_other);
507 #define BE_TIMER_INIT(main_opts) be_init_timer(main_opts)
509 #define BE_TIMER_PUSH(timer) \
510 if (main_opts->timing == BE_TIME_ON) { \
511 if (! lc_timer_push(timer)) { \
512 if (options.vrfy_option == BE_CH_VRFY_ASSERT) \
513 assert(!"Timer already on stack, cannot be pushed twice."); \
514 else if (options.vrfy_option == BE_CH_VRFY_WARN) \
515 fprintf(stderr, "Timer %s already on stack, cannot be pushed twice.\n", \
516 lc_timer_get_name(timer)); \
519 #define BE_TIMER_POP(timer) \
520 if (main_opts->timing == BE_TIME_ON) { \
521 lc_timer_t *tmp = lc_timer_pop(); \
522 if (options.vrfy_option == BE_CH_VRFY_ASSERT) \
523 assert(tmp == timer && "Attempt to pop wrong timer."); \
524 else if (options.vrfy_option == BE_CH_VRFY_WARN && tmp != timer) \
525 fprintf(stderr, "Attempt to pop wrong timer. %s is on stack, trying to pop %s.\n", \
526 lc_timer_get_name(tmp), lc_timer_get_name(timer)); \
531 #define BE_TIMER_INIT(main_opts)
532 #define BE_TIMER_PUSH(timer)
533 #define BE_TIMER_POP(timer)
535 #endif /* WITH_LIBCORE */
538 * Performs chordal register allocation for each register class on given irg.
540 * @param bi Backend irg object
541 * @return Structure containing timer for the single phases or NULL if no timing requested.
543 static be_ra_timer_t *be_ra_chordal_main(const be_irg_t *bi)
545 const be_main_env_t *main_env = bi->main_env;
546 const arch_isa_t *isa = arch_env_get_isa(main_env->arch_env);
547 ir_graph *irg = bi->irg;
548 be_options_t *main_opts = main_env->options;
552 be_chordal_env_t chordal_env;
554 BE_TIMER_INIT(main_opts);
555 BE_TIMER_PUSH(ra_timer.t_other);
556 BE_TIMER_PUSH(ra_timer.t_prolog);
560 chordal_env.opts = &options;
561 chordal_env.irg = irg;
562 chordal_env.birg = bi;
563 chordal_env.dom_front = be_compute_dominance_frontiers(irg);
564 chordal_env.exec_freq = bi->execfreqs;
565 chordal_env.lv = be_liveness(irg);
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;
578 chordal_env.cls = arch_isa_get_reg_class(isa, j);
579 chordal_env.border_heads = pmap_create();
580 chordal_env.ignore_colors = bitset_malloc(chordal_env.cls->n_regs);
582 be_stat_tags[STAT_TAG_CLS] = chordal_env.cls->name;
584 if(be_stat_ev_is_active()) {
585 be_stat_ev_push(be_stat_tags, STAT_TAG_LAST, be_stat_file);
587 /* perform some node statistics. */
588 node_stats(&chordal_env, &node_stat);
589 be_stat_ev("phis_before_spill", node_stat.n_phis);
592 /* put all ignore registers into the ignore register set. */
593 put_ignore_colors(&chordal_env);
595 BE_TIMER_PUSH(ra_timer.t_live);
596 be_liveness_recompute(chordal_env.lv);
597 BE_TIMER_POP(ra_timer.t_live);
598 dump(BE_CH_DUMP_LIVE, irg, chordal_env.cls, "-live", dump_ir_block_graph_sched);
600 be_pre_spill_prepare_constr(&chordal_env);
601 dump(BE_CH_DUMP_CONSTR, irg, chordal_env.cls, "-constr-pre", dump_ir_block_graph_sched);
603 BE_TIMER_PUSH(ra_timer.t_spill);
606 switch(options.spill_method) {
607 case BE_CH_SPILL_MORGAN:
608 be_spill_morgan(&chordal_env);
610 case BE_CH_SPILL_BELADY:
611 be_spill_belady(&chordal_env);
614 case BE_CH_SPILL_REMAT:
615 be_spill_remat(&chordal_env);
617 #endif /* WITH_ILP */
619 fprintf(stderr, "no valid spiller selected. falling back to belady\n");
620 be_spill_belady(&chordal_env);
623 BE_TIMER_POP(ra_timer.t_spill);
625 if(be_stat_ev_is_active()) {
626 node_stats(&chordal_env, &node_stat);
627 be_stat_ev("phis_after_spill", node_stat.n_phis);
628 be_stat_ev("mem_phis", node_stat.n_mem_phis);
629 be_stat_ev("reloads", node_stat.n_reloads);
630 be_stat_ev("spills", node_stat.n_spills);
633 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)));
635 dump(BE_CH_DUMP_SPILL, irg, chordal_env.cls, "-spill", dump_ir_block_graph_sched);
637 check_for_memory_operands(&chordal_env);
639 be_abi_fix_stack_nodes(bi->abi, chordal_env.lv);
641 BE_TIMER_PUSH(ra_timer.t_verify);
643 /* verify schedule and register pressure */
644 if (options.vrfy_option == BE_CH_VRFY_WARN) {
645 be_verify_schedule(irg);
646 be_verify_register_pressure(chordal_env.birg, chordal_env.cls, irg);
648 else if (options.vrfy_option == BE_CH_VRFY_ASSERT) {
649 assert(be_verify_schedule(irg) && "Schedule verification failed");
650 assert(be_verify_register_pressure(chordal_env.birg, chordal_env.cls, irg)
651 && "Register pressure verification failed");
653 BE_TIMER_POP(ra_timer.t_verify);
655 if (be_elr_split && ! splitted) {
656 extreme_liverange_splitting(&chordal_env);
661 /* Color the graph. */
662 BE_TIMER_PUSH(ra_timer.t_color);
663 be_ra_chordal_color(&chordal_env);
664 BE_TIMER_POP(ra_timer.t_color);
666 dump(BE_CH_DUMP_CONSTR, irg, chordal_env.cls, "-color", dump_ir_block_graph_sched);
668 /* Create the ifg with the selected flavor */
669 BE_TIMER_PUSH(ra_timer.t_ifg);
670 switch (options.ifg_flavor) {
672 fprintf(stderr, "no valid ifg flavour selected. falling back to std\n");
675 chordal_env.ifg = be_ifg_std_new(&chordal_env);
677 case BE_CH_IFG_CLIQUE:
678 chordal_env.ifg = be_ifg_clique_new(&chordal_env);
680 case BE_CH_IFG_POINTER:
681 chordal_env.ifg = be_ifg_pointer_new(&chordal_env);
684 chordal_env.ifg = be_ifg_list_new(&chordal_env);
686 case BE_CH_IFG_CHECK:
687 check_ifg_implementations(&chordal_env);
688 /* Build the interference graph. */
689 chordal_env.ifg = be_ifg_std_new(&chordal_env);
692 BE_TIMER_POP(ra_timer.t_ifg);
694 if(be_stat_ev_is_active()) {
696 be_ifg_stat(&chordal_env, &stat);
697 be_stat_ev("ifg_nodes", stat.n_nodes);
698 be_stat_ev("ifg_edges", stat.n_edges);
699 be_stat_ev("ifg_comps", stat.n_comps);
702 BE_TIMER_PUSH(ra_timer.t_verify);
703 if (options.vrfy_option != BE_CH_VRFY_OFF) {
704 //be_ra_chordal_check(&chordal_env);
707 BE_TIMER_POP(ra_timer.t_verify);
709 if(be_stat_ev_is_active()) {
710 node_stats(&chordal_env, &node_stat);
711 be_stat_ev("perms_before_coal", node_stat.n_perms);
712 be_stat_ev("copies_before_coal", node_stat.n_copies);
715 /* copy minimization */
716 BE_TIMER_PUSH(ra_timer.t_copymin);
717 co_driver(&chordal_env);
718 BE_TIMER_POP(ra_timer.t_copymin);
720 dump(BE_CH_DUMP_COPYMIN, irg, chordal_env.cls, "-copymin", dump_ir_block_graph_sched);
722 BE_TIMER_PUSH(ra_timer.t_verify);
724 if (options.vrfy_option != BE_CH_VRFY_OFF) {
725 //be_ra_chordal_check(&chordal_env);
728 BE_TIMER_POP(ra_timer.t_verify);
729 BE_TIMER_PUSH(ra_timer.t_ssa);
731 /* ssa destruction */
732 be_ssa_destruction(&chordal_env);
734 BE_TIMER_POP(ra_timer.t_ssa);
736 dump(BE_CH_DUMP_SSADESTR, irg, chordal_env.cls, "-ssadestr", dump_ir_block_graph_sched);
738 BE_TIMER_PUSH(ra_timer.t_verify);
739 if (options.vrfy_option != BE_CH_VRFY_OFF) {
740 be_ssa_destruction_check(&chordal_env);
741 //be_ra_chordal_check(&chordal_env);
743 BE_TIMER_POP(ra_timer.t_verify);
745 be_ifg_free(chordal_env.ifg);
746 pmap_destroy(chordal_env.border_heads);
747 bitset_free(chordal_env.ignore_colors);
749 if(be_stat_ev_is_active()) {
750 node_stats(&chordal_env, &node_stat);
751 be_stat_ev("perms_after_coal", node_stat.n_perms);
752 be_stat_ev("copies_after_coal", node_stat.n_copies);
758 BE_TIMER_PUSH(ra_timer.t_spillslots);
760 be_coalesce_spillslots(&chordal_env);
761 dump(BE_CH_DUMP_SPILLSLOTS, irg, NULL, "-spillslots", dump_ir_block_graph_sched);
763 BE_TIMER_POP(ra_timer.t_spillslots);
765 BE_TIMER_PUSH(ra_timer.t_verify);
767 /* verify spillslots */
768 if (options.vrfy_option == BE_CH_VRFY_WARN) {
769 be_verify_spillslots(main_env->arch_env, irg);
771 else if (options.vrfy_option == BE_CH_VRFY_ASSERT) {
772 assert(be_verify_spillslots(main_env->arch_env, irg) && "Spillslot verification failed");
774 BE_TIMER_POP(ra_timer.t_verify);
776 BE_TIMER_PUSH(ra_timer.t_epilog);
778 dump(BE_CH_DUMP_LOWER, irg, NULL, "-spilloff", dump_ir_block_graph_sched);
780 lower_nodes_after_ra(&chordal_env, options.lower_perm_opt & BE_CH_LOWER_PERM_COPY ? 1 : 0);
781 dump(BE_CH_DUMP_LOWER, irg, NULL, "-belower-after-ra", dump_ir_block_graph_sched);
783 obstack_free(&chordal_env.obst, NULL);
784 be_free_dominance_frontiers(chordal_env.dom_front);
785 be_liveness_free(chordal_env.lv);
787 BE_TIMER_POP(ra_timer.t_epilog);
788 BE_TIMER_POP(ra_timer.t_other);
790 be_stat_ev("insns_after", count_insns(irg));
793 return main_opts->timing == BE_TIME_ON ? &ra_timer : NULL;
794 #endif /* WITH_LIBCORE */
798 const be_ra_t be_ra_chordal_allocator = {
800 be_ra_chordal_register_options,