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"
35 #include "bechordal_t.h"
40 #include "besched_t.h"
44 #include "beifg_impl.h"
46 #include "bespillbelady.h"
50 #include "bespillilp.h"
53 #include "becopystat.h"
54 #include "becopyopt.h"
55 #include "bessadestr.h"
58 void be_ra_chordal_check(be_chordal_env_t *chordal_env) {
59 const arch_env_t *arch_env = chordal_env->birg->main_env->arch_env;
62 ir_node **nodes, *n1, *n2;
64 DEBUG_ONLY(firm_dbg_module_t *dbg = chordal_env->dbg;)
66 /* Collect all irns */
68 pmap_foreach(chordal_env->border_heads, pme) {
70 struct list_head *head = pme->value;
71 list_for_each_entry(border_t, curr, head, list)
72 if (curr->is_def && curr->is_real)
73 if (arch_get_irn_reg_class(arch_env, curr->irn, -1) == chordal_env->cls)
74 obstack_ptr_grow(&ob, curr->irn);
76 obstack_ptr_grow(&ob, NULL);
77 nodes = (ir_node **) obstack_finish(&ob);
80 for (i = 0, n1 = nodes[i]; n1; n1 = nodes[++i]) {
81 const arch_register_t *n1_reg, *n2_reg;
83 n1_reg = arch_get_irn_register(arch_env, n1);
84 if (!arch_reg_is_allocatable(arch_env, n1, -1, n1_reg)) {
85 DBG((dbg, 0, "Register %s assigned to %+F is not allowed\n", n1_reg->name, n1));
86 assert(0 && "Register constraint does not hold");
88 for (o = i+1, n2 = nodes[o]; n2; n2 = nodes[++o]) {
89 n2_reg = arch_get_irn_register(arch_env, n2);
90 if (values_interfere(n1, n2) && n1_reg == n2_reg) {
91 DBG((dbg, 0, "Values %+F and %+F interfere and have the same register assigned\n", n1, n2));
92 assert(0 && "Interfering values have the same color!");
96 obstack_free(&ob, NULL);
99 static void check_pressure_walker(ir_node *bl, void *data)
101 be_chordal_env_t *env = data;
102 int n_regs = arch_register_class_n_regs(env->cls);
104 pset *live = pset_new_ptr_default();
108 DEBUG_ONLY(firm_dbg_module_t *dbg = env->dbg;)
110 live_foreach(bl, li) {
111 if(live_is_end(li) && chordal_has_class(env, li->irn)) {
112 ir_node *irn = (ir_node *) li->irn;
113 pset_insert_ptr(live, irn);
117 DBG((dbg, LEVEL_1, "end set for %+F\n", bl));
118 for(irn = pset_first(live); irn; irn = pset_next(live))
119 DBG((dbg, LEVEL_1, "\t%+F\n", irn));
121 sched_foreach_reverse(bl, irn) {
123 int pressure = pset_count(live);
125 DBG((dbg, LEVEL_1, "%+10F@%+10F: pressure %d\n", bl, irn, pressure));
127 if(pressure > n_regs) {
129 ir_printf("%+10F@%+10F: pressure to high: %d\n", bl, irn, pressure);
130 for(x = pset_first(live); x; x = pset_next(live))
131 ir_printf("\t%+10F\n", x);
134 if(chordal_has_class(env, irn))
135 pset_remove_ptr(live, irn);
137 for(i = 0, n = get_irn_arity(irn); i < n; i++) {
138 ir_node *op = get_irn_n(irn, i);
139 if(chordal_has_class(env, op) && !is_Phi(irn))
140 pset_insert_ptr(live, op);
146 void be_check_pressure(const be_chordal_env_t *env)
148 irg_block_walk_graph(env->irg, check_pressure_walker, NULL, (void *) env);
151 int nodes_interfere(const be_chordal_env_t *env, const ir_node *a, const ir_node *b)
154 return be_ifg_connected(env->ifg, a, b);
156 return values_interfere(a, b);
160 static be_ra_chordal_opts_t options = {
165 BE_CH_LOWER_PERM_SWAP,
169 static const lc_opt_enum_int_items_t spill_items[] = {
170 { "belady", BE_CH_SPILL_BELADY },
172 { "ilp", BE_CH_SPILL_ILP },
177 static const lc_opt_enum_int_items_t copymin_items[] = {
178 { "none", BE_CH_COPYMIN_NONE },
179 { "heur", BE_CH_COPYMIN_HEUR },
181 { "ilp", BE_CH_COPYMIN_ILP },
186 static const lc_opt_enum_int_items_t ifg_flavor_items[] = {
187 { "std", BE_CH_IFG_STD },
188 { "fast", BE_CH_IFG_FAST },
192 static const lc_opt_enum_int_items_t lower_perm_items[] = {
193 { "copy", BE_CH_LOWER_PERM_COPY },
194 { "swap", BE_CH_LOWER_PERM_SWAP },
198 static const lc_opt_enum_int_items_t lower_perm_stat_items[] = {
202 static const lc_opt_enum_int_items_t dump_items[] = {
203 { "spill", BE_CH_DUMP_SPILL },
204 { "live", BE_CH_DUMP_LIVE },
205 { "color", BE_CH_DUMP_COLOR },
206 { "copymin", BE_CH_DUMP_COPYMIN },
207 { "ssadestr", BE_CH_DUMP_SSADESTR },
208 { "tree", BE_CH_DUMP_TREE_INTV },
209 { "constr", BE_CH_DUMP_CONSTR },
210 { "lower", BE_CH_DUMP_LOWER },
214 static lc_opt_enum_int_var_t spill_var = {
215 &options.spill_method, spill_items
218 static lc_opt_enum_int_var_t copymin_var = {
219 &options.copymin_method, copymin_items
222 static lc_opt_enum_int_var_t ifg_flavor_var = {
223 &options.spill_method, ifg_flavor_items
226 static lc_opt_enum_int_var_t lower_perm_var = {
227 &options.lower_perm_opt, lower_perm_items
230 static lc_opt_enum_int_var_t dump_var = {
231 &options.dump_flags, dump_items
234 static const lc_opt_table_entry_t be_chordal_options[] = {
235 LC_OPT_ENT_ENUM_MASK("spill", "spill method (belady or ilp)", &spill_var),
236 LC_OPT_ENT_ENUM_PTR("copymin", "copymin method (none, heur or ilp)", ©min_var),
237 LC_OPT_ENT_ENUM_PTR("ifg", "interference graph flavour (std or fast)", &ifg_flavor_var),
238 LC_OPT_ENT_ENUM_MASK("perm", "perm lowering options (copy, swap)", &lower_perm_var),
239 LC_OPT_ENT_ENUM_MASK("dump", "select dump phases", &dump_var),
243 static void be_ra_chordal_register_options(lc_opt_entry_t *grp)
245 static int run_once = 0;
246 lc_opt_entry_t *chordal_grp;
250 chordal_grp = lc_opt_get_grp(grp, "chordal");
252 lc_opt_add_table(chordal_grp, be_chordal_options);
257 static void dump(unsigned mask, ir_graph *irg,
258 const arch_register_class_t *cls,
260 void (*dump_func)(ir_graph *, const char *))
262 if(1 || ((options.dump_flags & mask) == mask)) {
265 snprintf(buf, sizeof(buf), "-%s%s", cls->name, suffix);
266 be_dump(irg, buf, dump_func);
270 be_dump(irg, suffix, dump_func);
274 static void put_ignore_colors(be_chordal_env_t *chordal_env)
276 int n_colors = chordal_env->cls->n_regs;
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);
286 static void be_ra_chordal_main(const be_irg_t *bi)
288 const be_main_env_t *main_env = bi->main_env;
289 const arch_isa_t *isa = arch_env_get_isa(main_env->arch_env);
290 ir_graph *irg = bi->irg;
293 be_chordal_env_t chordal_env;
297 chordal_env.opts = &options;
298 chordal_env.irg = irg;
299 chordal_env.birg = bi;
300 chordal_env.dom_front = be_compute_dominance_frontiers(irg);
301 FIRM_DBG_REGISTER(chordal_env.dbg, "firm.be.chordal");
303 obstack_init(&chordal_env.obst);
305 /* Perform the following for each register class. */
306 for(j = 0, m = arch_isa_get_n_reg_class(isa); j < m; ++j) {
307 chordal_env.cls = arch_isa_get_reg_class(isa, j);
308 chordal_env.border_heads = pmap_create();
309 chordal_env.ignore_colors = bitset_malloc(chordal_env.cls->n_regs);
311 /* put all ignore registers into the ignore register set. */
312 put_ignore_colors(&chordal_env);
315 dump(BE_CH_DUMP_LIVE, irg, chordal_env.cls, "-live", dump_ir_block_graph_sched);
318 switch(options.spill_method) {
319 case BE_CH_SPILL_BELADY:
320 be_spill_belady(&chordal_env);
323 case BE_CH_SPILL_ILP:
324 be_spill_ilp(&chordal_env);
326 #endif /* WITH_ILP */
328 fprintf(stderr, "no valid spiller selected. falling back to belady\n");
329 be_spill_belady(&chordal_env);
331 dump(BE_CH_DUMP_SPILL, irg, chordal_env.cls, "-spill", dump_ir_block_graph_sched);
333 be_check_pressure(&chordal_env);
335 /* Color the graph. */
336 be_ra_chordal_color(&chordal_env);
337 dump(BE_CH_DUMP_CONSTR, irg, chordal_env.cls, "-color", dump_ir_block_graph_sched);
339 /* Build the interference graph. */
340 chordal_env.ifg = be_ifg_std_new(&chordal_env);
341 be_ifg_check(chordal_env.ifg);
343 /* copy minimization */
345 co_compare_solvers(&chordal_env);
347 if (options.copymin_method != BE_CH_COPYMIN_NONE)
349 copy_opt_t *co = new_copy_opt(&chordal_env, co_get_costs_loop_depth);
350 co_build_ou_structure(co);
351 co_solve_heuristic(co);
352 co_free_ou_structure(co);
356 dump(BE_CH_DUMP_COPYMIN, irg, chordal_env.cls, "-copymin", dump_ir_block_graph_sched);
357 be_ra_chordal_check(&chordal_env);
359 /* ssa destruction */
360 be_ssa_destruction(&chordal_env);
361 dump(BE_CH_DUMP_SSADESTR, irg, chordal_env.cls, "-ssadestr", dump_ir_block_graph_sched);
362 be_ssa_destruction_check(&chordal_env);
363 be_ra_chordal_check(&chordal_env);
367 be_ifg_free(chordal_env.ifg);
368 pmap_destroy(chordal_env.border_heads);
369 bitset_free(chordal_env.ignore_colors);
372 be_compute_spill_offsets(&chordal_env);
374 dump(BE_CH_DUMP_LOWER, irg, NULL, "-spilloff", dump_ir_block_graph_sched);
376 lower_nodes_after_ra(&chordal_env, options.lower_perm_opt & BE_CH_LOWER_PERM_COPY ? 1 : 0);
377 dump(BE_CH_DUMP_LOWER, irg, NULL, "-belower-after-ra", dump_ir_block_graph_sched);
379 obstack_free(&chordal_env.obst, NULL);
380 be_free_dominance_frontiers(chordal_env.dom_front);
383 const be_ra_t be_ra_chordal_allocator = {
385 be_ra_chordal_register_options,