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"
39 #include "besched_t.h"
43 #include "beifg_impl.h"
45 #include "bespillbelady.h"
46 #include "bespillilp.h"
49 #include "becopyoptmain.h"
50 #include "bessadestr.h"
51 #include "becopystat.h"
54 void be_ra_chordal_check(be_chordal_env_t *chordal_env) {
55 firm_dbg_module_t *dbg = chordal_env->dbg;
56 const arch_env_t *arch_env = chordal_env->main_env->arch_env;
59 ir_node **nodes, *n1, *n2;
62 /* Collect all irns */
64 pmap_foreach(chordal_env->border_heads, pme) {
66 struct list_head *head = pme->value;
67 list_for_each_entry(border_t, curr, head, list)
68 if (curr->is_def && curr->is_real)
69 if (arch_get_irn_reg_class(arch_env, curr->irn, -1) == chordal_env->cls)
70 obstack_ptr_grow(&ob, curr->irn);
72 obstack_ptr_grow(&ob, NULL);
73 nodes = (ir_node **) obstack_finish(&ob);
76 for (i = 0, n1 = nodes[i]; n1; n1 = nodes[++i]) {
77 const arch_register_t *n1_reg, *n2_reg;
79 n1_reg = arch_get_irn_register(arch_env, n1);
80 if (!arch_reg_is_allocatable(arch_env, n1, -1, n1_reg)) {
81 DBG((dbg, 0, "Register %s assigned to %+F is not allowed\n", n1_reg->name, n1));
82 assert(0 && "Register constraint does not hold");
84 for (o = i+1, n2 = nodes[o]; n2; n2 = nodes[++o]) {
85 n2_reg = arch_get_irn_register(arch_env, n2);
86 if (values_interfere(n1, n2) && n1_reg == n2_reg) {
87 DBG((dbg, 0, "Values %+F and %+F interfere and have the same register assigned\n", n1, n2));
88 assert(0 && "Interfering values have the same color!");
92 obstack_free(&ob, NULL);
95 static void check_pressure_walker(ir_node *bl, void *data)
97 be_chordal_env_t *env = data;
98 firm_dbg_module_t *dbg = env->dbg;
99 int n_regs = arch_register_class_n_regs(env->cls);
101 pset *live = pset_new_ptr_default();
106 live_foreach(bl, li) {
107 if(live_is_end(li) && chordal_has_class(env, li->irn)) {
108 ir_node *irn = (ir_node *) li->irn;
109 pset_insert_ptr(live, irn);
113 DBG((dbg, LEVEL_1, "end set for %+F\n", bl));
114 for(irn = pset_first(live); irn; irn = pset_next(live))
115 DBG((dbg, LEVEL_1, "\t%+F\n", irn));
117 sched_foreach_reverse(bl, irn) {
119 int pressure = pset_count(live);
121 DBG((dbg, LEVEL_1, "%+10F@%+10F: pressure %d\n", bl, irn, pressure));
123 if(pressure > n_regs) {
125 ir_printf("%+10F@%+10F: pressure to high: %d\n", bl, irn, pressure);
126 for(x = pset_first(live); x; x = pset_next(live))
127 ir_printf("\t%+10F\n", x);
130 if(chordal_has_class(env, irn))
131 pset_remove_ptr(live, irn);
133 for(i = 0, n = get_irn_arity(irn); i < n; i++) {
134 ir_node *op = get_irn_n(irn, i);
135 if(chordal_has_class(env, op) && !is_Phi(irn))
136 pset_insert_ptr(live, op);
142 void be_check_pressure(const be_chordal_env_t *env)
144 irg_block_walk_graph(env->irg, check_pressure_walker, NULL, (void *) env);
147 int nodes_interfere(const be_chordal_env_t *env, const ir_node *a, const ir_node *b)
150 return be_ifg_connected(env->ifg, a, b);
152 return values_interfere(a, b);
156 static be_ra_chordal_opts_t options = {
161 BE_CH_LOWER_PERM_SWAP
165 static const lc_opt_enum_int_items_t spill_items[] = {
166 { "belady", BE_CH_SPILL_BELADY },
167 { "ilp", BE_CH_SPILL_ILP },
171 static const lc_opt_enum_int_items_t copymin_items[] = {
172 { "heur", BE_CH_COPYMIN_HEUR },
173 { "ilp", BE_CH_COPYMIN_ILP },
177 static const lc_opt_enum_int_items_t ifg_flavor_items[] = {
178 { "std", BE_CH_IFG_STD },
179 { "fast", BE_CH_IFG_FAST },
183 static const lc_opt_enum_int_items_t lower_perm_items[] = {
184 { "swap", BE_CH_LOWER_PERM_SWAP },
185 { "copy", BE_CH_LOWER_PERM_COPY },
189 static const lc_opt_enum_int_items_t dump_items[] = {
190 { "spill", BE_CH_DUMP_SPILL },
191 { "live", BE_CH_DUMP_LIVE },
192 { "color", BE_CH_DUMP_COLOR },
193 { "copymin", BE_CH_DUMP_COPYMIN },
194 { "ssadestr", BE_CH_DUMP_SSADESTR },
195 { "tree", BE_CH_DUMP_TREE_INTV },
196 { "constr", BE_CH_DUMP_CONSTR },
197 { "lower", BE_CH_DUMP_LOWER },
201 static lc_opt_enum_int_var_t spill_var = {
202 &options.spill_method, spill_items
205 static lc_opt_enum_int_var_t copymin_var = {
206 &options.copymin_method, copymin_items
209 static lc_opt_enum_int_var_t ifg_flavor_var = {
210 &options.spill_method, ifg_flavor_items
213 static lc_opt_enum_int_var_t lower_perm_var = {
214 &options.lower_perm_method, lower_perm_items
217 static lc_opt_enum_int_var_t dump_var = {
218 &options.dump_flags, dump_items
221 static void be_ra_chordal_register_options(lc_opt_entry_t *grp)
223 grp = lc_opt_get_grp(grp, "chordal");
227 static void dump(unsigned mask, ir_graph *irg,
228 const arch_register_class_t *cls,
230 void (*dump_func)(ir_graph *, const char *))
232 if(1 || (options.dump_flags & mask) == mask) {
235 snprintf(buf, sizeof(buf), "-%s%s", cls->name, suffix);
240 dump_func(irg, suffix);
244 static void be_ra_chordal_main(const be_main_env_t *main_env, ir_graph *irg)
247 be_chordal_env_t chordal_env;
248 const arch_isa_t *isa = arch_env_get_isa(main_env->arch_env);
252 chordal_env.irg = irg;
253 chordal_env.dbg = firm_dbg_register("firm.be.chordal");
254 chordal_env.main_env = main_env;
255 chordal_env.dom_front = be_compute_dominance_frontiers(irg);
257 obstack_init(&chordal_env.obst);
259 /* Perform the following for each register class. */
260 for(j = 0, m = arch_isa_get_n_reg_class(isa); j < m; ++j) {
261 chordal_env.cls = arch_isa_get_reg_class(isa, j);
262 chordal_env.border_heads = pmap_create();
265 dump(BE_CH_DUMP_LIVE, irg, chordal_env.cls, "-live", dump_ir_block_graph_sched);
268 switch(options.spill_method) {
269 case BE_CH_SPILL_BELADY:
270 be_spill_belady(&chordal_env);
272 case BE_CH_SPILL_ILP:
273 be_spill_ilp(&chordal_env);
276 fprintf(stderr, "no valid spiller selected. falling back to belady\n");
277 be_spill_belady(&chordal_env);
279 dump(BE_CH_DUMP_SPILL, irg, chordal_env.cls, "-spill", dump_ir_block_graph_sched);
281 be_check_pressure(&chordal_env);
284 be_check_pressure(&chordal_env);
286 /* Color the graph. */
287 be_ra_chordal_color(&chordal_env);
288 dump(BE_CH_DUMP_CONSTR, irg, chordal_env.cls, "-color", dump_ir_block_graph_sched);
290 /* Build the interference graph. */
291 chordal_env.ifg = be_ifg_std_new(&chordal_env);
292 be_ifg_check(chordal_env.ifg);
294 /* copy minimization */
295 copystat_collect_cls(&chordal_env);
296 be_copy_opt(&chordal_env);
297 dump(BE_CH_DUMP_COPYMIN, irg, chordal_env.cls, "-copymin", dump_ir_block_graph_sched);
298 be_ra_chordal_check(&chordal_env);
300 /* ssa destruction */
301 be_ssa_destruction(&chordal_env);
302 dump(BE_CH_DUMP_SSADESTR, irg, chordal_env.cls, "-ssadestr", dump_ir_block_graph_sched);
303 be_ssa_destruction_check(&chordal_env);
304 be_ra_chordal_check(&chordal_env);
308 be_ifg_free(chordal_env.ifg);
310 pmap_destroy(chordal_env.border_heads);
313 be_compute_spill_offsets(&chordal_env);
315 dump(BE_CH_DUMP_LOWER, irg, NULL, "-spilloff", dump_ir_block_graph_sched);
317 lower_nodes_after_ra(&chordal_env, options.lower_perm_method == BE_CH_LOWER_PERM_COPY ? 1 : 0);
318 dump(BE_CH_DUMP_LOWER, irg, NULL, "-belower-after-ra", dump_ir_block_graph_sched);
320 be_free_dominance_frontiers(chordal_env.dom_front);
321 obstack_free(&chordal_env.obst, NULL);
324 const be_ra_t be_ra_chordal_allocator = {
326 be_ra_chordal_register_options,