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"
61 #include "bespillbelady.h"
62 #include "bespillmorgan.h"
63 #include "bespillslots.h"
64 #include "bespilloptions.h"
68 #include "bespillremat.h"
71 #include "bejavacoal.h"
72 #include "becopystat.h"
73 #include "becopyopt.h"
74 #include "bessadestr.h"
78 static be_ra_chordal_opts_t options = {
82 BE_CH_LOWER_PERM_SWAP,
86 /** Enable extreme live range splitting. */
87 static int be_elr_split = 0;
89 /** Assumed loop iteration count for execution frequency estimation. */
90 static int be_loop_weight = 9;
92 typedef struct _post_spill_env_t {
93 be_chordal_env_t cenv;
94 double pre_spill_cost;
98 static be_ra_timer_t ra_timer = {
112 static const lc_opt_enum_int_items_t spill_items[] = {
113 { "morgan", BE_CH_SPILL_MORGAN },
114 { "belady", BE_CH_SPILL_BELADY },
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 extern void be_spill_remat_register_options(lc_opt_entry_t *ent);
196 void be_ra_chordal_check(be_chordal_env_t *chordal_env) {
197 const arch_env_t *arch_env = chordal_env->birg->main_env->arch_env;
200 ir_node **nodes, *n1, *n2;
202 be_lv_t *lv = chordal_env->birg->lv;
203 DEBUG_ONLY(firm_dbg_module_t *dbg = chordal_env->dbg;)
205 /* Collect all irns */
207 pmap_foreach(chordal_env->border_heads, pme) {
209 struct list_head *head = pme->value;
210 list_for_each_entry(border_t, curr, head, list)
211 if (curr->is_def && curr->is_real)
212 if (arch_get_irn_reg_class(arch_env, curr->irn, -1) == chordal_env->cls)
213 obstack_ptr_grow(&ob, curr->irn);
215 obstack_ptr_grow(&ob, NULL);
216 nodes = (ir_node **) obstack_finish(&ob);
219 for (i = 0, n1 = nodes[i]; n1; n1 = nodes[++i]) {
220 const arch_register_t *n1_reg, *n2_reg;
222 n1_reg = arch_get_irn_register(arch_env, n1);
223 if (!arch_reg_is_allocatable(arch_env, n1, -1, n1_reg)) {
224 DBG((dbg, 0, "Register %s assigned to %+F is not allowed\n", n1_reg->name, n1));
225 assert(0 && "Register constraint does not hold");
227 for (o = i+1, n2 = nodes[o]; n2; n2 = nodes[++o]) {
228 n2_reg = arch_get_irn_register(arch_env, n2);
229 if (values_interfere(lv, n1, n2) && n1_reg == n2_reg) {
230 DBG((dbg, 0, "Values %+F and %+F interfere and have the same register assigned: %s\n", n1, n2, n1_reg->name));
231 assert(0 && "Interfering values have the same color!");
235 obstack_free(&ob, NULL);
238 int nodes_interfere(const be_chordal_env_t *env, const ir_node *a, const ir_node *b)
241 return be_ifg_connected(env->ifg, a, b);
243 return values_interfere(env->birg->lv, a, b);
246 static void be_ra_chordal_register_options(lc_opt_entry_t *grp)
248 static int run_once = 0;
249 lc_opt_entry_t *chordal_grp;
253 chordal_grp = lc_opt_get_grp(grp, "chordal");
255 lc_opt_add_table(chordal_grp, be_chordal_options);
257 co_register_options(chordal_grp);
259 be_java_coal_register_options(chordal_grp);
262 be_spill_remat_register_options(chordal_grp);
264 be_spill_register_options(chordal_grp);
267 #endif /* WITH_LIBCORE */
269 static void dump(unsigned mask, ir_graph *irg,
270 const arch_register_class_t *cls,
272 void (*dump_func)(ir_graph *, const char *))
274 if((options.dump_flags & mask) == mask) {
277 snprintf(buf, sizeof(buf), "-%s%s", cls->name, suffix);
278 be_dump(irg, buf, dump_func);
281 be_dump(irg, suffix, dump_func);
285 static void put_ignore_colors(be_chordal_env_t *chordal_env)
287 int n_colors = chordal_env->cls->n_regs;
290 bitset_clear_all(chordal_env->ignore_colors);
291 be_abi_put_ignore_regs(chordal_env->birg->abi, chordal_env->cls, chordal_env->ignore_colors);
292 for(i = 0; i < n_colors; ++i)
293 if(arch_register_type_is(&chordal_env->cls->regs[i], ignore))
294 bitset_set(chordal_env->ignore_colors, i);
297 FILE *be_chordal_open(const be_chordal_env_t *env, const char *prefix, const char *suffix)
301 ir_snprintf(buf, sizeof(buf), "%s%F_%s%s", prefix, env->irg, env->cls->name, suffix);
302 return fopen(buf, "wt");
305 void check_ifg_implementations(be_chordal_env_t *chordal_env)
309 f = be_chordal_open(chordal_env, "std", ".log");
310 chordal_env->ifg = be_ifg_std_new(chordal_env);
311 be_ifg_check_sorted_to_file(chordal_env->ifg, f);
314 f = be_chordal_open(chordal_env, "list", ".log");
315 be_ifg_free(chordal_env->ifg);
316 chordal_env->ifg = be_ifg_list_new(chordal_env);
317 be_ifg_check_sorted_to_file(chordal_env->ifg, f);
320 f = be_chordal_open(chordal_env, "clique", ".log");
321 be_ifg_free(chordal_env->ifg);
322 chordal_env->ifg = be_ifg_clique_new(chordal_env);
323 be_ifg_check_sorted_to_file(chordal_env->ifg, f);
326 f = be_chordal_open(chordal_env, "pointer", ".log");
327 be_ifg_free(chordal_env->ifg);
328 chordal_env->ifg = be_ifg_pointer_new(chordal_env);
329 be_ifg_check_sorted_to_file(chordal_env->ifg, f);
332 chordal_env->ifg = NULL;
336 * Checks for every reload if it's user can perform the load on itself.
338 static void memory_operand_walker(ir_node *irn, void *env) {
339 be_chordal_env_t *cenv = env;
340 const arch_env_t *aenv = cenv->birg->main_env->arch_env;
341 const ir_edge_t *edge, *ne;
345 if (! be_is_Reload(irn))
348 /* always use addressmode, it's good for x86 */
350 /* only use memory operands, if the reload is only used by 1 node */
351 if(get_irn_n_edges(irn) > 1)
355 spill = be_get_Reload_mem(irn);
356 block = get_nodes_block(irn);
358 foreach_out_edge_safe(irn, edge, ne) {
359 ir_node *src = get_edge_src_irn(edge);
360 int pos = get_edge_src_pos(edge);
362 assert(src && "outedges broken!");
364 if (get_nodes_block(src) == block && arch_possible_memory_operand(aenv, src, pos)) {
365 DBG((cenv->dbg, LEVEL_3, "performing memory operand %+F at %+F\n", irn, src));
366 arch_perform_memory_operand(aenv, src, spill, pos);
370 /* kill the Reload */
371 if (get_irn_n_edges(irn) == 0) {
373 set_irn_n(irn, be_pos_Reload_mem, 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 * Perform things which need to be done per register class before spilling.
542 static void pre_spill(const arch_isa_t *isa, int cls_idx, post_spill_env_t *pse) {
543 be_chordal_env_t *chordal_env = &pse->cenv;
544 node_stat_t node_stat;
546 chordal_env->cls = arch_isa_get_reg_class(isa, cls_idx);
547 chordal_env->border_heads = pmap_create();
548 chordal_env->ignore_colors = bitset_malloc(chordal_env->cls->n_regs);
550 #ifdef FIRM_STATISTICS
551 if (be_stat_ev_is_active()) {
552 be_stat_tags[STAT_TAG_CLS] = chordal_env->cls->name;
553 be_stat_ev_push(be_stat_tags, STAT_TAG_LAST, be_stat_file);
555 /* perform some node statistics. */
556 node_stats(chordal_env, &node_stat);
557 be_stat_ev("phis_before_spill", node_stat.n_phis);
559 #endif /* FIRM_STATISTICS */
561 /* put all ignore registers into the ignore register set. */
562 put_ignore_colors(chordal_env);
564 be_pre_spill_prepare_constr(chordal_env);
565 dump(BE_CH_DUMP_CONSTR, chordal_env->irg, chordal_env->cls, "-constr-pre", dump_ir_block_graph_sched);
567 #ifdef FIRM_STATISTICS
568 if (be_stat_ev_is_active()) {
569 pse->pre_spill_cost = be_estimate_irg_costs(chordal_env->irg,
570 chordal_env->birg->main_env->arch_env, chordal_env->birg->exec_freq);
572 #endif /* FIRM_STATISTICS */
576 * Perform things which need to be done per register class after spilling.
578 static void post_spill(post_spill_env_t *pse) {
579 be_chordal_env_t *chordal_env = &pse->cenv;
580 ir_graph *irg = chordal_env->irg;
581 be_irg_t *birg = chordal_env->birg;
582 const be_main_env_t *main_env = birg->main_env;
583 be_options_t *main_opts = main_env->options;
584 static int splitted = 0;
585 node_stat_t node_stat;
587 #ifdef FIRM_STATISTICS
588 if (be_stat_ev_is_active()) {
589 double spillcosts = be_estimate_irg_costs(irg, main_env->arch_env, birg->exec_freq) - pse->pre_spill_cost;
591 be_stat_ev_l("spillcosts", (long) spillcosts);
593 node_stats(chordal_env, &node_stat);
594 be_stat_ev("phis_after_spill", node_stat.n_phis);
595 be_stat_ev("mem_phis", node_stat.n_mem_phis);
596 be_stat_ev("reloads", node_stat.n_reloads);
597 be_stat_ev("spills", node_stat.n_spills);
599 #endif /* FIRM_STATISTICS */
601 check_for_memory_operands(chordal_env);
603 be_abi_fix_stack_nodes(birg->abi, birg->lv);
605 BE_TIMER_PUSH(ra_timer.t_verify);
607 /* verify schedule and register pressure */
608 if (chordal_env->opts->vrfy_option == BE_CH_VRFY_WARN) {
609 be_verify_schedule(irg);
610 be_verify_register_pressure(chordal_env->birg, chordal_env->cls, irg);
612 else if (chordal_env->opts->vrfy_option == BE_CH_VRFY_ASSERT) {
613 assert(be_verify_schedule(irg) && "Schedule verification failed");
614 assert(be_verify_register_pressure(chordal_env->birg, chordal_env->cls, irg)
615 && "Register pressure verification failed");
617 BE_TIMER_POP(ra_timer.t_verify);
619 if (be_elr_split && ! splitted) {
620 extreme_liverange_splitting(chordal_env);
624 /* Color the graph. */
625 BE_TIMER_PUSH(ra_timer.t_color);
626 be_ra_chordal_color(chordal_env);
627 BE_TIMER_POP(ra_timer.t_color);
629 dump(BE_CH_DUMP_CONSTR, irg, chordal_env->cls, "-color", dump_ir_block_graph_sched);
631 /* Create the ifg with the selected flavor */
632 BE_TIMER_PUSH(ra_timer.t_ifg);
633 switch (chordal_env->opts->ifg_flavor) {
635 fprintf(stderr, "no valid ifg flavour selected. falling back to std\n");
638 chordal_env->ifg = be_ifg_std_new(chordal_env);
640 case BE_CH_IFG_CLIQUE:
641 chordal_env->ifg = be_ifg_clique_new(chordal_env);
643 case BE_CH_IFG_POINTER:
644 chordal_env->ifg = be_ifg_pointer_new(chordal_env);
647 chordal_env->ifg = be_ifg_list_new(chordal_env);
649 case BE_CH_IFG_CHECK:
650 check_ifg_implementations(chordal_env);
651 /* Build the interference graph. */
652 chordal_env->ifg = be_ifg_std_new(chordal_env);
655 BE_TIMER_POP(ra_timer.t_ifg);
657 #ifdef FIRM_STATISTICS
658 if (be_stat_ev_is_active()) {
660 be_ifg_stat(chordal_env, &stat);
661 be_stat_ev("ifg_nodes", stat.n_nodes);
662 be_stat_ev("ifg_edges", stat.n_edges);
663 be_stat_ev("ifg_comps", stat.n_comps);
665 node_stats(chordal_env, &node_stat);
666 be_stat_ev("perms_before_coal", node_stat.n_perms);
667 be_stat_ev("copies_before_coal", node_stat.n_copies);
669 #endif /* FIRM_STATISTICS */
671 /* copy minimization */
672 BE_TIMER_PUSH(ra_timer.t_copymin);
673 co_driver(chordal_env);
674 BE_TIMER_POP(ra_timer.t_copymin);
676 dump(BE_CH_DUMP_COPYMIN, irg, chordal_env->cls, "-copymin", dump_ir_block_graph_sched);
678 BE_TIMER_PUSH(ra_timer.t_ssa);
680 /* ssa destruction */
681 be_ssa_destruction(chordal_env);
683 BE_TIMER_POP(ra_timer.t_ssa);
685 dump(BE_CH_DUMP_SSADESTR, irg, chordal_env->cls, "-ssadestr", dump_ir_block_graph_sched);
687 BE_TIMER_PUSH(ra_timer.t_verify);
688 if (chordal_env->opts->vrfy_option != BE_CH_VRFY_OFF) {
689 be_ssa_destruction_check(chordal_env);
691 BE_TIMER_POP(ra_timer.t_verify);
693 be_ifg_free(chordal_env->ifg);
694 pmap_destroy(chordal_env->border_heads);
695 bitset_free(chordal_env->ignore_colors);
697 #ifdef FIRM_STATISTICS
698 if (be_stat_ev_is_active()) {
699 node_stats(chordal_env, &node_stat);
700 be_stat_ev("perms_after_coal", node_stat.n_perms);
701 be_stat_ev("copies_after_coal", node_stat.n_copies);
704 #endif /* FIRM_STATISTICS */
708 * Performs chordal register allocation for each register class on given irg.
710 * @param birg Backend irg object
711 * @return Structure containing timer for the single phases or NULL if no timing requested.
713 static be_ra_timer_t *be_ra_chordal_main(be_irg_t *birg)
715 const be_main_env_t *main_env = birg->main_env;
716 const arch_isa_t *isa = arch_env_get_isa(main_env->arch_env);
717 ir_graph *irg = birg->irg;
718 be_options_t *main_opts = main_env->options;
720 be_chordal_env_t chordal_env;
722 BE_TIMER_INIT(main_opts);
723 BE_TIMER_PUSH(ra_timer.t_other);
724 BE_TIMER_PUSH(ra_timer.t_prolog);
726 be_assure_dom_front(birg);
727 be_assure_liveness(birg);
729 chordal_env.opts = &options;
730 chordal_env.irg = irg;
731 chordal_env.birg = birg;
732 FIRM_DBG_REGISTER(chordal_env.dbg, "firm.be.chordal");
734 obstack_init(&chordal_env.obst);
736 BE_TIMER_POP(ra_timer.t_prolog);
738 be_stat_ev("insns_before", count_insns(irg));
740 if (! arch_code_generator_has_spiller(birg->cg)) {
741 /* use one of the generic spiller */
743 /* Perform the following for each register class. */
744 for (j = 0, m = arch_isa_get_n_reg_class(isa); j < m; ++j) {
745 post_spill_env_t pse;
747 memcpy(&pse.cenv, &chordal_env, sizeof(chordal_env));
748 pre_spill(isa, j, &pse);
750 BE_TIMER_PUSH(ra_timer.t_spill);
752 switch(options.spill_method) {
753 case BE_CH_SPILL_MORGAN:
754 be_spill_morgan(&pse.cenv);
756 case BE_CH_SPILL_BELADY:
757 be_spill_belady(&pse.cenv);
760 case BE_CH_SPILL_REMAT:
761 be_spill_remat(&pse.cenv);
763 #endif /* WITH_ILP */
765 fprintf(stderr, "no valid spiller selected. falling back to belady\n");
766 be_spill_belady(&pse.cenv);
768 BE_TIMER_POP(ra_timer.t_spill);
770 dump(BE_CH_DUMP_SPILL, irg, pse.cenv.cls, "-spill", dump_ir_block_graph_sched);
776 post_spill_env_t *pse;
778 /* the backend has it's own spiller */
779 m = arch_isa_get_n_reg_class(isa);
781 pse = alloca(m * sizeof(pse[0]));
783 for (j = 0; j < m; ++j) {
784 memcpy(&pse[j].cenv, &chordal_env, sizeof(chordal_env));
785 pre_spill(isa, j, &pse[j]);
788 BE_TIMER_PUSH(ra_timer.t_spill);
789 arch_code_generator_spill(birg->cg, &chordal_env);
790 BE_TIMER_POP(ra_timer.t_spill);
791 dump(BE_CH_DUMP_SPILL, irg, NULL, "-spill", dump_ir_block_graph_sched);
793 for (j = 0; j < m; ++j) {
798 BE_TIMER_PUSH(ra_timer.t_spillslots);
800 be_coalesce_spillslots(&chordal_env);
801 dump(BE_CH_DUMP_SPILLSLOTS, irg, NULL, "-spillslots", dump_ir_block_graph_sched);
803 BE_TIMER_POP(ra_timer.t_spillslots);
805 BE_TIMER_PUSH(ra_timer.t_verify);
806 /* verify spillslots */
807 if (options.vrfy_option == BE_CH_VRFY_WARN) {
808 be_verify_spillslots(main_env->arch_env, irg);
810 else if (options.vrfy_option == BE_CH_VRFY_ASSERT) {
811 assert(be_verify_spillslots(main_env->arch_env, irg) && "Spillslot verification failed");
813 BE_TIMER_POP(ra_timer.t_verify);
815 BE_TIMER_PUSH(ra_timer.t_epilog);
816 dump(BE_CH_DUMP_LOWER, irg, NULL, "-spilloff", dump_ir_block_graph_sched);
818 lower_nodes_after_ra(&chordal_env, options.lower_perm_opt & BE_CH_LOWER_PERM_COPY ? 1 : 0);
819 dump(BE_CH_DUMP_LOWER, irg, NULL, "-belower-after-ra", dump_ir_block_graph_sched);
821 obstack_free(&chordal_env.obst, NULL);
822 BE_TIMER_POP(ra_timer.t_epilog);
824 BE_TIMER_POP(ra_timer.t_other);
826 be_stat_ev("insns_after", count_insns(irg));
829 return main_opts->timing == BE_TIME_ON ? &ra_timer : NULL;
830 #endif /* WITH_LIBCORE */
834 const be_ra_t be_ra_chordal_allocator = {
836 be_ra_chordal_register_options,