2 * @file bechordal_main.c
4 * @author Sebastian Hack
6 * Copyright (C) 2005 Universitaet Karlsruhe
7 * Released under the GPL
9 * Driver for the chordal register allocator.
22 #include <libcore/lc_opts.h>
23 #include <libcore/lc_opts_enum.h>
24 #endif /* WITH_LIBCORE */
27 #include "irgraph_t.h"
28 #include "irprintf_t.h"
36 #include "bechordal_t.h"
41 #include "besched_t.h"
45 #include "beifg_impl.h"
47 #include "bespillbelady.h"
51 #include "bespillilp.h"
54 #include "becopystat.h"
55 #include "becopyopt.h"
56 #include "bessadestr.h"
59 void be_ra_chordal_check(be_chordal_env_t *chordal_env) {
60 const arch_env_t *arch_env = chordal_env->birg->main_env->arch_env;
63 ir_node **nodes, *n1, *n2;
65 DEBUG_ONLY(firm_dbg_module_t *dbg = chordal_env->dbg;)
67 /* Collect all irns */
69 pmap_foreach(chordal_env->border_heads, pme) {
71 struct list_head *head = pme->value;
72 list_for_each_entry(border_t, curr, head, list)
73 if (curr->is_def && curr->is_real)
74 if (arch_get_irn_reg_class(arch_env, curr->irn, -1) == chordal_env->cls)
75 obstack_ptr_grow(&ob, curr->irn);
77 obstack_ptr_grow(&ob, NULL);
78 nodes = (ir_node **) obstack_finish(&ob);
81 for (i = 0, n1 = nodes[i]; n1; n1 = nodes[++i]) {
82 const arch_register_t *n1_reg, *n2_reg;
84 n1_reg = arch_get_irn_register(arch_env, n1);
85 if (!arch_reg_is_allocatable(arch_env, n1, -1, n1_reg)) {
86 DBG((dbg, 0, "Register %s assigned to %+F is not allowed\n", n1_reg->name, n1));
87 assert(0 && "Register constraint does not hold");
89 for (o = i+1, n2 = nodes[o]; n2; n2 = nodes[++o]) {
90 n2_reg = arch_get_irn_register(arch_env, n2);
91 if (values_interfere(n1, n2) && n1_reg == n2_reg) {
92 DBG((dbg, 0, "Values %+F and %+F interfere and have the same register assigned\n", n1, n2));
93 assert(0 && "Interfering values have the same color!");
97 obstack_free(&ob, NULL);
100 static void check_pressure_walker(ir_node *bl, void *data)
102 be_chordal_env_t *env = data;
103 int n_regs = arch_register_class_n_regs(env->cls);
104 bitset_t *live = bitset_irg_malloc(env->irg);
109 DEBUG_ONLY(firm_dbg_module_t *dbg = env->dbg;)
112 if(live_is_end(li) && chordal_has_class(env, li->irn))
113 bitset_add_irn(live, li->irn);
115 DBG((dbg, LEVEL_1, "end set for %+F\n", bl));
116 bitset_foreach_irn(env->irg, live, elm, irn)
117 DBG((dbg, LEVEL_1, "\t%+F\n", irn));
119 sched_foreach_reverse(bl, irn) {
120 int pressure = bitset_popcnt(live);
121 int idx = get_irn_idx(irn);
124 DBG((dbg, LEVEL_1, "%+10F@%+10F: pressure %d\n", bl, irn, pressure));
126 if(pressure > n_regs) {
128 ir_printf("%+10F@%+10F: pressure to high: %d\n", bl, irn, pressure);
129 bitset_foreach_irn(env->irg, live, elm, x)
130 ir_fprintf(stderr, "\t%+10F\n", x);
133 if(chordal_has_class(env, irn)) {
134 if(!bitset_is_set(live, idx))
135 ir_fprintf(stderr, "%+F is defined but was not live\n", irn);
136 bitset_remv_irn(live, irn);
139 for(i = 0, n = get_irn_arity(irn); i < n; i++) {
140 ir_node *op = get_irn_n(irn, i);
141 if(chordal_has_class(env, op) && !is_Phi(irn))
142 bitset_add_irn(live, op);
148 void be_check_pressure(const be_chordal_env_t *env)
150 irg_block_walk_graph(env->irg, check_pressure_walker, NULL, (void *) env);
153 int nodes_interfere(const be_chordal_env_t *env, const ir_node *a, const ir_node *b)
156 return be_ifg_connected(env->ifg, a, b);
158 return values_interfere(a, b);
162 static be_ra_chordal_opts_t options = {
167 BE_CH_LOWER_PERM_SWAP,
171 static const lc_opt_enum_int_items_t spill_items[] = {
172 { "belady", BE_CH_SPILL_BELADY },
174 { "ilp", BE_CH_SPILL_ILP },
179 static const lc_opt_enum_int_items_t copymin_items[] = {
180 { "none", BE_CH_COPYMIN_NONE },
181 { "heur1", BE_CH_COPYMIN_HEUR1 },
182 { "heur2", BE_CH_COPYMIN_HEUR2 },
183 { "stat", BE_CH_COPYMIN_STAT },
185 { "ilp1", BE_CH_COPYMIN_ILP1 },
186 { "ilp2", BE_CH_COPYMIN_ILP2 },
191 static const lc_opt_enum_int_items_t ifg_flavor_items[] = {
192 { "std", BE_CH_IFG_STD },
193 { "fast", BE_CH_IFG_FAST },
197 static const lc_opt_enum_int_items_t lower_perm_items[] = {
198 { "copy", BE_CH_LOWER_PERM_COPY },
199 { "swap", BE_CH_LOWER_PERM_SWAP },
203 static const lc_opt_enum_int_items_t lower_perm_stat_items[] = {
207 static const lc_opt_enum_int_items_t dump_items[] = {
208 { "spill", BE_CH_DUMP_SPILL },
209 { "live", BE_CH_DUMP_LIVE },
210 { "color", BE_CH_DUMP_COLOR },
211 { "copymin", BE_CH_DUMP_COPYMIN },
212 { "ssadestr", BE_CH_DUMP_SSADESTR },
213 { "tree", BE_CH_DUMP_TREE_INTV },
214 { "constr", BE_CH_DUMP_CONSTR },
215 { "lower", BE_CH_DUMP_LOWER },
219 static lc_opt_enum_int_var_t spill_var = {
220 &options.spill_method, spill_items
223 static lc_opt_enum_int_var_t copymin_var = {
224 &options.copymin_method, copymin_items
227 static lc_opt_enum_int_var_t ifg_flavor_var = {
228 &options.spill_method, ifg_flavor_items
231 static lc_opt_enum_int_var_t lower_perm_var = {
232 &options.lower_perm_opt, lower_perm_items
235 static lc_opt_enum_int_var_t dump_var = {
236 &options.dump_flags, dump_items
239 static const lc_opt_table_entry_t be_chordal_options[] = {
240 LC_OPT_ENT_ENUM_MASK("spill", "spill method (belady or ilp)", &spill_var),
241 LC_OPT_ENT_ENUM_PTR ("copymin", "copymin method (none, heur1, heur2, ilp1, ilp2 or stat)", ©min_var),
242 LC_OPT_ENT_ENUM_PTR ("ifg", "interference graph flavour (std or fast)", &ifg_flavor_var),
243 LC_OPT_ENT_ENUM_MASK("perm", "perm lowering options (copy or swap)", &lower_perm_var),
244 LC_OPT_ENT_ENUM_MASK("dump", "select dump phases", &dump_var),
248 static void be_ra_chordal_register_options(lc_opt_entry_t *grp)
250 static int run_once = 0;
251 lc_opt_entry_t *chordal_grp;
255 chordal_grp = lc_opt_get_grp(grp, "chordal");
257 lc_opt_add_table(chordal_grp, be_chordal_options);
260 co_register_options(chordal_grp);
264 static void dump(unsigned mask, ir_graph *irg,
265 const arch_register_class_t *cls,
267 void (*dump_func)(ir_graph *, const char *))
269 if(1 || ((options.dump_flags & mask) == mask)) {
272 snprintf(buf, sizeof(buf), "-%s%s", cls->name, suffix);
273 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 static void be_ra_chordal_main(const be_irg_t *bi)
303 const be_main_env_t *main_env = bi->main_env;
304 const arch_isa_t *isa = arch_env_get_isa(main_env->arch_env);
305 ir_graph *irg = bi->irg;
309 be_chordal_env_t chordal_env;
313 chordal_env.opts = &options;
314 chordal_env.irg = irg;
315 chordal_env.birg = bi;
316 chordal_env.dom_front = be_compute_dominance_frontiers(irg);
317 FIRM_DBG_REGISTER(chordal_env.dbg, "firm.be.chordal");
319 obstack_init(&chordal_env.obst);
321 /* Perform the following for each register class. */
322 for(j = 0, m = arch_isa_get_n_reg_class(isa); j < m; ++j) {
323 chordal_env.cls = arch_isa_get_reg_class(isa, j);
324 chordal_env.border_heads = pmap_create();
325 chordal_env.ignore_colors = bitset_malloc(chordal_env.cls->n_regs);
327 /* put all ignore registers into the ignore register set. */
328 put_ignore_colors(&chordal_env);
331 dump(BE_CH_DUMP_LIVE, irg, chordal_env.cls, "-live", dump_ir_block_graph_sched);
334 switch(options.spill_method) {
335 case BE_CH_SPILL_BELADY:
336 be_spill_belady(&chordal_env);
339 case BE_CH_SPILL_ILP:
340 be_spill_ilp(&chordal_env);
342 #endif /* WITH_ILP */
344 fprintf(stderr, "no valid spiller selected. falling back to belady\n");
345 be_spill_belady(&chordal_env);
347 dump(BE_CH_DUMP_SPILL, irg, chordal_env.cls, "-spill", dump_ir_block_graph_sched);
348 be_abi_fix_stack_nodes(bi->abi);
350 be_check_pressure(&chordal_env);
352 /* Color the graph. */
353 be_ra_chordal_color(&chordal_env);
354 dump(BE_CH_DUMP_CONSTR, irg, chordal_env.cls, "-color", dump_ir_block_graph_sched);
356 /* Build the interference graph. */
357 chordal_env.ifg = be_ifg_std_new(&chordal_env);
358 be_ifg_check(chordal_env.ifg);
360 /* copy minimization */
362 if (options.copymin_method != BE_CH_COPYMIN_NONE && options.copymin_method != BE_CH_COPYMIN_STAT) {
363 co = new_copy_opt(&chordal_env, co_get_costs_loop_depth);
364 co_build_ou_structure(co);
365 co_build_graph_structure(co);
368 switch(options.copymin_method) {
369 case BE_CH_COPYMIN_HEUR1:
370 co_solve_heuristic(co);
372 case BE_CH_COPYMIN_HEUR2:
373 co_solve_heuristic_new(co);
375 case BE_CH_COPYMIN_PARK_MOON:
376 co_solve_park_moon(co);
378 case BE_CH_COPYMIN_STAT:
379 co_compare_solvers(&chordal_env);
382 case BE_CH_COPYMIN_ILP1:
383 printf("FIXME: %s:%d ILP1 not yet implemented!\n", __FILE__, __LINE__);
384 co_solve_ilp1(co, 60.0);
386 case BE_CH_COPYMIN_ILP2:
387 co_solve_ilp2(co, 60.0);
389 #endif /* WITH_ILP */
390 case BE_CH_COPYMIN_NONE:
396 co_free_graph_structure(co);
397 co_free_ou_structure(co);
401 dump(BE_CH_DUMP_COPYMIN, irg, chordal_env.cls, "-copymin", dump_ir_block_graph_sched);
402 be_ra_chordal_check(&chordal_env);
404 /* ssa destruction */
405 be_ssa_destruction(&chordal_env);
406 dump(BE_CH_DUMP_SSADESTR, irg, chordal_env.cls, "-ssadestr", dump_ir_block_graph_sched);
407 be_ssa_destruction_check(&chordal_env);
408 be_ra_chordal_check(&chordal_env);
412 be_ifg_free(chordal_env.ifg);
413 pmap_destroy(chordal_env.border_heads);
414 bitset_free(chordal_env.ignore_colors);
417 be_compute_spill_offsets(&chordal_env);
419 dump(BE_CH_DUMP_LOWER, irg, NULL, "-spilloff", dump_ir_block_graph_sched);
421 lower_nodes_after_ra(&chordal_env, options.lower_perm_opt & BE_CH_LOWER_PERM_COPY ? 1 : 0);
422 dump(BE_CH_DUMP_LOWER, irg, NULL, "-belower-after-ra", dump_ir_block_graph_sched);
424 obstack_free(&chordal_env.obst, NULL);
425 be_free_dominance_frontiers(chordal_env.dom_front);
428 const be_ra_t be_ra_chordal_allocator = {
430 be_ra_chordal_register_options,