7849e5991c8cab95843029a7d9485f9185e09fa3
[libfirm] / ir / be / bechordal_main.c
1 /**
2  * @file   bechordal_main.c
3  * @date   29.11.2005
4  * @author Sebastian Hack
5  * @cvs-id $Id$
6  *
7  * Copyright (C) 2005 Universitaet Karlsruhe
8  * Released under the GPL
9  *
10  * Driver for the chordal register allocator.
11  */
12 #ifdef HAVE_CONFIG_H
13 #include "config.h"
14 #endif
15
16 #include "obst.h"
17 #include "pset.h"
18 #include "list.h"
19 #include "bitset.h"
20 #include "iterator.h"
21 #include "firm_config.h"
22
23 #ifdef WITH_LIBCORE
24 #include <libcore/lc_opts.h>
25 #include <libcore/lc_opts_enum.h>
26 #include <libcore/lc_timing.h>
27 #endif /* WITH_LIBCORE */
28
29 #include "irmode_t.h"
30 #include "irgraph_t.h"
31 #include "irprintf_t.h"
32 #include "irgwalk.h"
33 #include "ircons.h"
34 #include "irdump.h"
35 #include "irdom.h"
36 #include "ircons.h"
37 #include "irbitset.h"
38 #include "irnode.h"
39 #include "ircons.h"
40 #include "debug.h"
41 #include "xmalloc.h"
42 #include "execfreq.h"
43
44 #include "bechordal_t.h"
45 #include "beabi.h"
46 #include "bejavacoal.h"
47 #include "beutil.h"
48 #include "besched.h"
49 #include "benumb_t.h"
50 #include "besched_t.h"
51 #include "belive_t.h"
52 #include "bearch.h"
53 #include "beifg_t.h"
54 #include "beifg_impl.h"
55 #include "benode_t.h"
56
57 #include "bespillbelady.h"
58 #include "bespillmorgan.h"
59 #include "bespillslots.h"
60 #include "belower.h"
61
62 #ifdef WITH_ILP
63 #include "bespillremat.h"
64 #endif /* WITH_ILP */
65
66 #include "bejavacoal.h"
67 #include "becopystat.h"
68 #include "becopyopt.h"
69 #include "bessadestr.h"
70 #include "beverify.h"
71 #include "bespillcost.h"
72 #include "benode_t.h"
73
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;
76         struct obstack ob;
77         pmap_entry *pme;
78         ir_node **nodes, *n1, *n2;
79         int i, o;
80         DEBUG_ONLY(firm_dbg_module_t *dbg = chordal_env->dbg;)
81
82         /* Collect all irns */
83         obstack_init(&ob);
84         pmap_foreach(chordal_env->border_heads, pme) {
85                 border_t *curr;
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);
91         }
92         obstack_ptr_grow(&ob, NULL);
93         nodes = (ir_node **) obstack_finish(&ob);
94
95         /* Check them */
96         for (i = 0, n1 = nodes[i]; n1; n1 = nodes[++i]) {
97                 const arch_register_t *n1_reg, *n2_reg;
98
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");
103                 }
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!");
109                         }
110                 }
111         }
112         obstack_free(&ob, NULL);
113 }
114
115 int nodes_interfere(const be_chordal_env_t *env, const ir_node *a, const ir_node *b)
116 {
117         if(env->ifg)
118                 return be_ifg_connected(env->ifg, a, b);
119         else
120                 return values_interfere(env->lv, a, b);
121 }
122
123
124 static be_ra_chordal_opts_t options = {
125         BE_CH_DUMP_NONE,
126         BE_CH_SPILL_BELADY,
127         BE_CH_IFG_STD,
128         BE_CH_LOWER_PERM_SWAP,
129         BE_CH_VRFY_WARN,
130 };
131
132 static be_ra_timer_t ra_timer = {
133         NULL,
134         NULL,
135         NULL,
136         NULL,
137         NULL,
138         NULL,
139         NULL,
140         NULL,
141         NULL,
142         NULL,
143         NULL,
144 };
145
146 #ifdef WITH_LIBCORE
147 static const lc_opt_enum_int_items_t spill_items[] = {
148         { "morgan", BE_CH_SPILL_MORGAN },
149         { "belady", BE_CH_SPILL_BELADY },
150 #ifdef WITH_ILP
151         { "remat",  BE_CH_SPILL_REMAT },
152 #endif /* WITH_ILP */
153         { NULL, 0 }
154 };
155
156 static const lc_opt_enum_int_items_t ifg_flavor_items[] = {
157         { "std",     BE_CH_IFG_STD     },
158         { "fast",    BE_CH_IFG_FAST    },
159         { "clique",  BE_CH_IFG_CLIQUE  },
160         { "pointer", BE_CH_IFG_POINTER },
161         { "list",    BE_CH_IFG_LIST    },
162         { "check",   BE_CH_IFG_CHECK   },
163         { NULL,      0                 }
164 };
165
166 static const lc_opt_enum_int_items_t lower_perm_items[] = {
167         { "copy", BE_CH_LOWER_PERM_COPY },
168         { "swap", BE_CH_LOWER_PERM_SWAP },
169         { NULL, 0 }
170 };
171
172 static const lc_opt_enum_int_items_t lower_perm_stat_items[] = {
173         { NULL, 0 }
174 };
175
176 static const lc_opt_enum_int_items_t dump_items[] = {
177         { "spill",      BE_CH_DUMP_SPILL      },
178         { "live",       BE_CH_DUMP_LIVE       },
179         { "color",      BE_CH_DUMP_COLOR      },
180         { "copymin",    BE_CH_DUMP_COPYMIN    },
181         { "ssadestr",   BE_CH_DUMP_SSADESTR   },
182         { "tree",       BE_CH_DUMP_TREE_INTV  },
183         { "constr",     BE_CH_DUMP_CONSTR     },
184         { "lower",      BE_CH_DUMP_LOWER      },
185         { "spillslots", BE_CH_DUMP_SPILLSLOTS },
186         { "appel",      BE_CH_DUMP_APPEL      },
187         { "all",        BE_CH_DUMP_ALL        },
188         { NULL, 0 }
189 };
190
191 static const lc_opt_enum_int_items_t be_ch_vrfy_items[] = {
192         { "off",    BE_CH_VRFY_OFF    },
193         { "warn",   BE_CH_VRFY_WARN   },
194         { "assert", BE_CH_VRFY_ASSERT },
195         { NULL, 0 }
196 };
197
198 static lc_opt_enum_int_var_t spill_var = {
199         &options.spill_method, spill_items
200 };
201
202 static lc_opt_enum_int_var_t ifg_flavor_var = {
203         &options.ifg_flavor, ifg_flavor_items
204 };
205
206 static lc_opt_enum_int_var_t lower_perm_var = {
207         &options.lower_perm_opt, lower_perm_items
208 };
209
210 static lc_opt_enum_int_var_t dump_var = {
211         &options.dump_flags, dump_items
212 };
213
214 static lc_opt_enum_int_var_t be_ch_vrfy_var = {
215         &options.vrfy_option, be_ch_vrfy_items
216 };
217
218 /** Enable extreme live range splitting. */
219 static int be_elr_split = 0;
220
221 /** Assumed loop iteration count for execution frequency estimation. */
222 static int be_loop_weight = 9;
223
224 static const lc_opt_table_entry_t be_chordal_options[] = {
225         LC_OPT_ENT_ENUM_INT ("spill",         "spill method (belady, morgan or remat)", &spill_var),
226         LC_OPT_ENT_ENUM_PTR ("ifg",           "interference graph flavour (std, fast, clique, pointer, list, check)", &ifg_flavor_var),
227         LC_OPT_ENT_ENUM_PTR ("perm",          "perm lowering options (copy or swap)", &lower_perm_var),
228         LC_OPT_ENT_ENUM_MASK("dump",          "select dump phases", &dump_var),
229         LC_OPT_ENT_ENUM_PTR ("vrfy",          "verify options (off, warn, assert)", &be_ch_vrfy_var),
230         LC_OPT_ENT_BOOL     ("elrsplit",      "enable extreme live range splitting", &be_elr_split),
231         LC_OPT_ENT_INT      ("loop_weight",   "assumed amount of loop iterations for guessing the execution frequency", &be_loop_weight),
232         { NULL }
233 };
234
235 extern void be_spill_remat_register_options(lc_opt_entry_t *ent);
236
237
238 static void be_ra_chordal_register_options(lc_opt_entry_t *grp)
239 {
240         static int run_once = 0;
241         lc_opt_entry_t *chordal_grp;
242
243         if (! run_once) {
244                 run_once    = 1;
245                 chordal_grp = lc_opt_get_grp(grp, "chordal");
246
247                 lc_opt_add_table(chordal_grp, be_chordal_options);
248         }
249
250         co_register_options(chordal_grp);
251         be_java_coal_register_options(chordal_grp);
252 #ifdef WITH_ILP
253         be_spill_remat_register_options(chordal_grp);
254 #endif
255 }
256 #endif /* WITH_LIBCORE */
257
258 static void dump(unsigned mask, ir_graph *irg,
259                                  const arch_register_class_t *cls,
260                                  const char *suffix,
261                                  void (*dump_func)(ir_graph *, const char *))
262 {
263         if((options.dump_flags & mask) == mask) {
264                 if (cls) {
265                         char buf[256];
266                         snprintf(buf, sizeof(buf), "-%s%s", cls->name, suffix);
267                         be_dump(irg, buf, dump_func);
268                 }
269                 else
270                         be_dump(irg, suffix, dump_func);
271         }
272 }
273
274 static void put_ignore_colors(be_chordal_env_t *chordal_env)
275 {
276         int n_colors = chordal_env->cls->n_regs;
277         int i;
278
279         bitset_clear_all(chordal_env->ignore_colors);
280         be_abi_put_ignore_regs(chordal_env->birg->abi, chordal_env->cls, chordal_env->ignore_colors);
281         for(i = 0; i < n_colors; ++i)
282                 if(arch_register_type_is(&chordal_env->cls->regs[i], ignore))
283                         bitset_set(chordal_env->ignore_colors, i);
284 }
285
286 FILE *be_chordal_open(const be_chordal_env_t *env, const char *prefix, const char *suffix)
287 {
288         char buf[1024];
289
290         ir_snprintf(buf, sizeof(buf), "%s%F_%s%s", prefix, env->irg, env->cls->name, suffix);
291         return fopen(buf, "wt");
292 }
293
294 void check_ifg_implementations(be_chordal_env_t *chordal_env)
295 {
296         FILE *f;
297
298         f = be_chordal_open(chordal_env, "std", ".log");
299         chordal_env->ifg = be_ifg_std_new(chordal_env);
300         be_ifg_check_sorted_to_file(chordal_env->ifg, f);
301         fclose(f);
302
303         f = be_chordal_open(chordal_env, "list", ".log");
304         be_ifg_free(chordal_env->ifg);
305         chordal_env->ifg = be_ifg_list_new(chordal_env);
306         be_ifg_check_sorted_to_file(chordal_env->ifg, f);
307         fclose(f);
308
309         f = be_chordal_open(chordal_env, "clique", ".log");
310         be_ifg_free(chordal_env->ifg);
311         chordal_env->ifg = be_ifg_clique_new(chordal_env);
312         be_ifg_check_sorted_to_file(chordal_env->ifg, f);
313         fclose(f);
314
315         f = be_chordal_open(chordal_env, "pointer", ".log");
316         be_ifg_free(chordal_env->ifg);
317         chordal_env->ifg = be_ifg_pointer_new(chordal_env);
318         be_ifg_check_sorted_to_file(chordal_env->ifg, f);
319         fclose(f);
320
321         chordal_env->ifg = NULL;
322 };
323
324 /**
325  * Checks for every reload if it's user can perform the load on itself.
326  */
327 static void memory_operand_walker(ir_node *irn, void *env) {
328         be_chordal_env_t *cenv = env;
329         const arch_env_t *aenv = cenv->birg->main_env->arch_env;
330         const ir_edge_t  *edge, *ne;
331         ir_node          *block;
332         ir_node          *spill;
333
334         if (! be_is_Reload(irn))
335                 return;
336
337         // only use memory operands, if the reload is only used by 1 node
338         if(get_irn_n_edges(irn) > 1)
339                 return;
340
341         spill = be_get_Reload_mem(irn);
342         block = get_nodes_block(irn);
343
344         foreach_out_edge_safe(irn, edge, ne) {
345                 ir_node *src = get_edge_src_irn(edge);
346                 int     pos  = get_edge_src_pos(edge);
347
348                 if (! src)
349                         continue;
350
351                 if (get_nodes_block(src) == block && arch_possible_memory_operand(aenv, src, pos)) {
352                         DBG((cenv->dbg, LEVEL_3, "performing memory operand %+F at %+F\n", irn, src));
353                         arch_perform_memory_operand(aenv, src, spill, pos);
354                 }
355         }
356
357         /* kill the Reload */
358         if (get_irn_n_edges(irn) == 0) {
359                 sched_remove(irn);
360                 set_irn_n(irn, 0, new_Bad());
361                 set_irn_n(irn, 1, new_Bad());
362         }
363 }
364
365 /**
366  * Starts a walk for memory operands if supported by the backend.
367  */
368 static INLINE void check_for_memory_operands(be_chordal_env_t *chordal_env) {
369         irg_walk_graph(chordal_env->irg, NULL, memory_operand_walker, chordal_env);
370 }
371
372 /**
373  * Performs chordal register allocation for each register class on given irg.
374  *
375  * @param bi  Backend irg object
376  * @return Structure containing timer for the single phases or NULL if no timing requested.
377  */
378 static be_ra_timer_t *be_ra_chordal_main(const be_irg_t *bi)
379 {
380         const be_main_env_t *main_env  = bi->main_env;
381         const arch_isa_t    *isa       = arch_env_get_isa(main_env->arch_env);
382         ir_graph            *irg       = bi->irg;
383         be_options_t        *main_opts = main_env->options;
384         int                  splitted  = 0;
385
386         int j, m;
387         be_chordal_env_t chordal_env;
388
389         if (main_opts->timing == BE_TIME_ON) {
390                 ra_timer.t_prolog  = lc_timer_register("ra_prolog",   "regalloc prolog");
391                 ra_timer.t_epilog  = lc_timer_register("ra_epilog",   "regalloc epilog");
392                 ra_timer.t_live    = lc_timer_register("ra_liveness", "be liveness");
393                 ra_timer.t_spill   = lc_timer_register("ra_spill",    "spiller");
394                 ra_timer.t_spillslots = lc_timer_register("ra_spillslots",    "spillslots");
395                 ra_timer.t_color   = lc_timer_register("ra_color",    "graph coloring");
396                 ra_timer.t_ifg     = lc_timer_register("ra_ifg",      "interference graph");
397                 ra_timer.t_copymin = lc_timer_register("ra_copymin",  "copy minimization");
398                 ra_timer.t_ssa     = lc_timer_register("ra_ssadestr", "ssa destruction");
399                 ra_timer.t_verify  = lc_timer_register("ra_verify",   "graph verification");
400                 ra_timer.t_other   = lc_timer_register("ra_other",    "other time");
401
402                 LC_STOP_AND_RESET_TIMER(ra_timer.t_prolog);
403                 LC_STOP_AND_RESET_TIMER(ra_timer.t_epilog);
404                 LC_STOP_AND_RESET_TIMER(ra_timer.t_live);
405                 LC_STOP_AND_RESET_TIMER(ra_timer.t_spill);
406                 LC_STOP_AND_RESET_TIMER(ra_timer.t_spillslots);
407                 LC_STOP_AND_RESET_TIMER(ra_timer.t_color);
408                 LC_STOP_AND_RESET_TIMER(ra_timer.t_ifg);
409                 LC_STOP_AND_RESET_TIMER(ra_timer.t_copymin);
410                 LC_STOP_AND_RESET_TIMER(ra_timer.t_ssa);
411                 LC_STOP_AND_RESET_TIMER(ra_timer.t_verify);
412                 LC_STOP_AND_RESET_TIMER(ra_timer.t_other);
413         }
414
415 #define BE_TIMER_PUSH(timer)                                                        \
416         if (main_opts->timing == BE_TIME_ON) {                                          \
417                 int res = lc_timer_push(timer);                                             \
418                 if (options.vrfy_option == BE_CH_VRFY_ASSERT)                               \
419                         assert(res && "Timer already on stack, cannot be pushed twice.");       \
420                 else if (options.vrfy_option == BE_CH_VRFY_WARN && ! res)                   \
421                         fprintf(stderr, "Timer %s already on stack, cannot be pushed twice.\n", \
422                                 lc_timer_get_name(timer));                                          \
423         }
424 #define BE_TIMER_POP(timer)                                                                    \
425         if (main_opts->timing == BE_TIME_ON) {                                                     \
426                 lc_timer_t *tmp = lc_timer_pop();                                                      \
427                 if (options.vrfy_option == BE_CH_VRFY_ASSERT)                                          \
428                         assert(tmp == timer && "Attempt to pop wrong timer.");                             \
429                 else if (options.vrfy_option == BE_CH_VRFY_WARN && tmp != timer)                       \
430                         fprintf(stderr, "Attempt to pop wrong timer. %s is on stack, trying to pop %s.\n", \
431                                 lc_timer_get_name(tmp), lc_timer_get_name(timer));                             \
432                 timer = tmp;                                                                           \
433         }
434
435         BE_TIMER_PUSH(ra_timer.t_other);
436         BE_TIMER_PUSH(ra_timer.t_prolog);
437
438         compute_doms(irg);
439
440         chordal_env.opts      = &options;
441         chordal_env.irg       = irg;
442         chordal_env.birg      = bi;
443         chordal_env.dom_front = be_compute_dominance_frontiers(irg);
444         chordal_env.exec_freq = compute_execfreq(irg, be_loop_weight);
445         chordal_env.lv        = be_liveness(irg);
446         FIRM_DBG_REGISTER(chordal_env.dbg, "firm.be.chordal");
447
448         obstack_init(&chordal_env.obst);
449
450         BE_TIMER_POP(ra_timer.t_prolog);
451
452         /* Perform the following for each register class. */
453         for (j = 0, m = arch_isa_get_n_reg_class(isa); j < m; ++j) {
454                 chordal_env.cls           = arch_isa_get_reg_class(isa, j);
455                 chordal_env.border_heads  = pmap_create();
456                 chordal_env.ignore_colors = bitset_malloc(chordal_env.cls->n_regs);
457
458                 /* put all ignore registers into the ignore register set. */
459                 put_ignore_colors(&chordal_env);
460
461                 BE_TIMER_PUSH(ra_timer.t_live);
462                 be_liveness_recompute(chordal_env.lv);
463                 BE_TIMER_POP(ra_timer.t_live);
464                 dump(BE_CH_DUMP_LIVE, irg, chordal_env.cls, "-live", dump_ir_block_graph_sched);
465
466                 be_pre_spill_prepare_constr(&chordal_env);
467                 dump(BE_CH_DUMP_CONSTR, irg, chordal_env.cls, "-constr-pre", dump_ir_block_graph_sched);
468
469                 BE_TIMER_PUSH(ra_timer.t_spill);
470
471                 /* spilling */
472                 switch(options.spill_method) {
473                 case BE_CH_SPILL_MORGAN:
474                         be_spill_morgan(&chordal_env);
475                         break;
476                 case BE_CH_SPILL_BELADY:
477                         be_spill_belady(&chordal_env);
478                         break;
479 #ifdef WITH_ILP
480                 case BE_CH_SPILL_REMAT:
481                         be_spill_remat(&chordal_env);
482                         break;
483 #endif /* WITH_ILP */
484                 default:
485                         fprintf(stderr, "no valid spiller selected. falling back to belady\n");
486                         be_spill_belady(&chordal_env);
487                 }
488
489                 BE_TIMER_POP(ra_timer.t_spill);
490
491                 DBG((chordal_env.dbg, LEVEL_1, "spill costs for %+F in regclass %s: %g\n",
492                       irg,
493                       chordal_env.cls->name,
494                       get_irg_spill_cost(&chordal_env))
495                     );
496
497                 dump(BE_CH_DUMP_SPILL, irg, chordal_env.cls, "-spill", dump_ir_block_graph_sched);
498
499                 check_for_memory_operands(&chordal_env);
500
501                 be_abi_fix_stack_nodes(bi->abi, chordal_env.lv);
502
503                 BE_TIMER_PUSH(ra_timer.t_verify);
504
505                 /* verify schedule and register pressure */
506                 if (options.vrfy_option == BE_CH_VRFY_WARN) {
507                         be_verify_schedule(irg);
508                         be_verify_register_pressure(chordal_env.birg->main_env->arch_env, chordal_env.cls, irg);
509                 }
510                 else if (options.vrfy_option == BE_CH_VRFY_ASSERT) {
511                         assert(be_verify_schedule(irg) && "Schedule verification failed");
512                         assert(be_verify_register_pressure(chordal_env.birg->main_env->arch_env, chordal_env.cls, irg)
513                                 && "Register pressure verification failed");
514                 }
515                 BE_TIMER_POP(ra_timer.t_verify);
516
517                 if (be_elr_split && ! splitted) {
518                         extreme_liverange_splitting(&chordal_env);
519                         splitted = 1;
520                 }
521
522
523                 /* Color the graph. */
524                 BE_TIMER_PUSH(ra_timer.t_color);
525                 be_ra_chordal_color(&chordal_env);
526                 BE_TIMER_POP(ra_timer.t_color);
527
528                 dump(BE_CH_DUMP_CONSTR, irg, chordal_env.cls, "-color", dump_ir_block_graph_sched);
529
530                 /* Create the ifg with the selected flavor */
531                 BE_TIMER_PUSH(ra_timer.t_ifg);
532                 switch (options.ifg_flavor) {
533                         default:
534                                 fprintf(stderr, "no valid ifg flavour selected. falling back to std\n");
535                         case BE_CH_IFG_STD:
536                         case BE_CH_IFG_FAST:
537                                 chordal_env.ifg = be_ifg_std_new(&chordal_env);
538                                 break;
539                         case BE_CH_IFG_CLIQUE:
540                                 chordal_env.ifg = be_ifg_clique_new(&chordal_env);
541                                 break;
542                         case BE_CH_IFG_POINTER:
543                                 chordal_env.ifg = be_ifg_pointer_new(&chordal_env);
544                                 break;
545                         case BE_CH_IFG_LIST:
546                                 chordal_env.ifg = be_ifg_list_new(&chordal_env);
547                                 break;
548                         case BE_CH_IFG_CHECK:
549                                 check_ifg_implementations(&chordal_env);
550                                 /* Build the interference graph. */
551                                 chordal_env.ifg = be_ifg_std_new(&chordal_env);
552                                 break;
553                 }
554                 BE_TIMER_POP(ra_timer.t_ifg);
555
556                 BE_TIMER_PUSH(ra_timer.t_verify);
557                 if (options.vrfy_option != BE_CH_VRFY_OFF)
558                         be_ra_chordal_check(&chordal_env);
559
560                 BE_TIMER_POP(ra_timer.t_verify);
561
562                 /* copy minimization */
563                 BE_TIMER_PUSH(ra_timer.t_copymin);
564                 co_driver(&chordal_env);
565                 BE_TIMER_POP(ra_timer.t_copymin);
566                 dump(BE_CH_DUMP_COPYMIN, irg, chordal_env.cls, "-copymin", dump_ir_block_graph_sched);
567
568                 BE_TIMER_PUSH(ra_timer.t_verify);
569
570                 if (options.vrfy_option != BE_CH_VRFY_OFF)
571                         be_ra_chordal_check(&chordal_env);
572
573                 BE_TIMER_POP(ra_timer.t_verify);
574                 BE_TIMER_PUSH(ra_timer.t_ssa);
575
576                 /* ssa destruction */
577                 be_ssa_destruction(&chordal_env);
578
579                 BE_TIMER_POP(ra_timer.t_ssa);
580
581                 dump(BE_CH_DUMP_SSADESTR, irg, chordal_env.cls, "-ssadestr", dump_ir_block_graph_sched);
582
583                 BE_TIMER_PUSH(ra_timer.t_verify);
584                 if (options.vrfy_option != BE_CH_VRFY_OFF) {
585                         be_ssa_destruction_check(&chordal_env);
586                         be_ra_chordal_check(&chordal_env);
587                 }
588                 BE_TIMER_POP(ra_timer.t_verify);
589
590                 be_ifg_free(chordal_env.ifg);
591                 pmap_destroy(chordal_env.border_heads);
592                 bitset_free(chordal_env.ignore_colors);
593         }
594
595         BE_TIMER_PUSH(ra_timer.t_spillslots);
596
597         be_coalesce_spillslots(&chordal_env);
598         dump(BE_CH_DUMP_SPILLSLOTS, irg, NULL, "-spillslots", dump_ir_block_graph_sched);
599
600         BE_TIMER_POP(ra_timer.t_spillslots);
601
602         BE_TIMER_PUSH(ra_timer.t_verify);
603
604         /* verify spillslots */
605         if (options.vrfy_option == BE_CH_VRFY_WARN) {
606                 be_verify_spillslots(main_env->arch_env, irg);
607         }
608         else if (options.vrfy_option == BE_CH_VRFY_ASSERT) {
609                 assert(be_verify_spillslots(main_env->arch_env, irg) && "Spillslot verification failed");
610         }
611         BE_TIMER_POP(ra_timer.t_verify);
612
613         BE_TIMER_PUSH(ra_timer.t_epilog);
614
615         dump(BE_CH_DUMP_LOWER, irg, NULL, "-spilloff", dump_ir_block_graph_sched);
616
617         lower_nodes_after_ra(&chordal_env, options.lower_perm_opt & BE_CH_LOWER_PERM_COPY ? 1 : 0);
618         dump(BE_CH_DUMP_LOWER, irg, NULL, "-belower-after-ra", dump_ir_block_graph_sched);
619
620         obstack_free(&chordal_env.obst, NULL);
621         be_free_dominance_frontiers(chordal_env.dom_front);
622         be_liveness_free(chordal_env.lv);
623         free_execfreq(chordal_env.exec_freq);
624
625         BE_TIMER_POP(ra_timer.t_epilog);
626         BE_TIMER_POP(ra_timer.t_other);
627
628 #undef BE_TIMER_PUSH
629 #undef BE_TIMER_POP
630
631         return main_opts->timing == BE_TIME_ON ? &ra_timer : NULL;
632 }
633
634 const be_ra_t be_ra_chordal_allocator = {
635 #ifdef WITH_LIBCORE
636         be_ra_chordal_register_options,
637 #endif
638         be_ra_chordal_main
639 };