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"
47 #include "beconstrperm.h"
50 #include "becopyoptmain.h"
51 #include "bessadestr.h"
52 #include "becopystat.h"
55 void be_ra_chordal_check(be_chordal_env_t *chordal_env) {
56 firm_dbg_module_t *dbg = chordal_env->dbg;
57 const arch_env_t *arch_env = chordal_env->main_env->arch_env;
60 ir_node **nodes, *n1, *n2;
63 /* Collect all irns */
65 pmap_foreach(chordal_env->border_heads, pme) {
67 struct list_head *head = pme->value;
68 list_for_each_entry(border_t, curr, head, list)
69 if (curr->is_def && curr->is_real)
70 if (arch_get_irn_reg_class(arch_env, curr->irn, -1) == chordal_env->cls)
71 obstack_ptr_grow(&ob, curr->irn);
73 obstack_ptr_grow(&ob, NULL);
74 nodes = (ir_node **) obstack_finish(&ob);
77 for (i = 0, n1 = nodes[i]; n1; n1 = nodes[++i]) {
78 const arch_register_t *n1_reg, *n2_reg;
80 n1_reg = arch_get_irn_register(arch_env, n1);
81 if (!arch_reg_is_allocatable(arch_env, n1, -1, n1_reg)) {
82 DBG((dbg, 0, "Register %s assigned to %+F is not allowed\n", n1_reg->name, n1));
83 assert(0 && "Register constraint does not hold");
85 for (o = i+1, n2 = nodes[o]; n2; n2 = nodes[++o]) {
86 n2_reg = arch_get_irn_register(arch_env, n2);
87 if (values_interfere(n1, n2) && n1_reg == n2_reg) {
88 DBG((dbg, 0, "Values %+F and %+F interfere and have the same register assigned\n", n1, n2));
89 assert(0 && "Interfering values have the same color!");
93 obstack_free(&ob, NULL);
96 static void check_pressure_walker(ir_node *bl, void *data)
98 be_chordal_env_t *env = data;
99 firm_dbg_module_t *dbg = env->dbg;
100 int n_regs = arch_register_class_n_regs(env->cls);
102 pset *live = pset_new_ptr_default();
107 live_foreach(bl, li) {
108 if(live_is_end(li) && chordal_has_class(env, li->irn)) {
109 ir_node *irn = (ir_node *) li->irn;
110 pset_insert_ptr(live, irn);
114 DBG((dbg, LEVEL_1, "end set for %+F\n", bl));
115 for(irn = pset_first(live); irn; irn = pset_next(live))
116 DBG((dbg, LEVEL_1, "\t%+F\n", irn));
118 sched_foreach_reverse(bl, irn) {
120 int pressure = pset_count(live);
122 DBG((dbg, LEVEL_1, "%+10F@%+10F: pressure %d\n", bl, irn, pressure));
124 if(pressure > n_regs) {
126 ir_printf("%+10F@%+10F: pressure to high: %d\n", bl, irn, pressure);
127 for(x = pset_first(live); x; x = pset_next(live))
128 ir_printf("\t%+10F\n", x);
131 if(chordal_has_class(env, irn))
132 pset_remove_ptr(live, irn);
134 for(i = 0, n = get_irn_arity(irn); i < n; i++) {
135 ir_node *op = get_irn_n(irn, i);
136 if(chordal_has_class(env, op) && !is_Phi(irn))
137 pset_insert_ptr(live, op);
143 void be_check_pressure(const be_chordal_env_t *env)
145 irg_block_walk_graph(env->irg, check_pressure_walker, NULL, (void *) env);
148 int nodes_interfere(const be_chordal_env_t *env, const ir_node *a, const ir_node *b)
151 return be_ifg_connected(env->ifg, a, b);
153 return values_interfere(a, b);
157 static be_ra_chordal_opts_t options = {
162 BE_CH_LOWER_PERM_SWAP
166 static const lc_opt_enum_int_items_t spill_items[] = {
167 { "belady", BE_CH_SPILL_BELADY },
168 { "ilp", BE_CH_SPILL_ILP },
172 static const lc_opt_enum_int_items_t copymin_items[] = {
173 { "heur", BE_CH_COPYMIN_HEUR },
174 { "ilp", BE_CH_COPYMIN_ILP },
178 static const lc_opt_enum_int_items_t ifg_flavor_items[] = {
179 { "std", BE_CH_IFG_STD },
180 { "fast", BE_CH_IFG_FAST },
184 static const lc_opt_enum_int_items_t lower_perm_items[] = {
185 { "swap", BE_CH_LOWER_PERM_SWAP },
186 { "copy", BE_CH_LOWER_PERM_COPY },
190 static lc_opt_enum_int_var_t spill_var = {
191 &options.spill_method, spill_items
194 static lc_opt_enum_int_var_t copymin_var = {
195 &options.copymin_method, copymin_items
198 static lc_opt_enum_int_var_t ifg_flavor_var = {
199 &options.spill_method, ifg_flavor_items
202 static lc_opt_enum_int_var_t lower_perm_var = {
203 &options.lower_perm_method, lower_perm_items
206 static void be_ra_chordal_register_options(lc_opt_entry_t *grp)
208 grp = lc_opt_get_grp(grp, "chordal");
212 static void dump(unsigned mask, ir_graph *irg,
213 const arch_register_class_t *cls,
215 void (*dump_func)(ir_graph *, const char *))
217 if(1 || (options.dump_flags & mask) == mask) {
220 snprintf(buf, sizeof(buf), "-%s%s", cls->name, suffix);
225 dump_func(irg, suffix);
229 static void be_ra_chordal_main(const be_main_env_t *main_env, ir_graph *irg)
232 be_chordal_env_t chordal_env;
233 const arch_isa_t *isa = arch_env_get_isa(main_env->arch_env);
237 chordal_env.irg = irg;
238 chordal_env.dbg = firm_dbg_register("firm.be.chordal");
239 chordal_env.main_env = main_env;
240 chordal_env.dom_front = be_compute_dominance_frontiers(irg);
242 obstack_init(&chordal_env.obst);
244 /* Perform the following for each register class. */
245 for(j = 0, m = arch_isa_get_n_reg_class(isa); j < m; ++j) {
246 chordal_env.cls = arch_isa_get_reg_class(isa, j);
247 chordal_env.border_heads = pmap_create();
248 chordal_env.constr_irn = pset_new_ptr(32);
251 dump(BE_CH_DUMP_LIVE, irg, chordal_env.cls, "-live", dump_ir_block_graph_sched);
254 switch(options.spill_method) {
255 case BE_CH_SPILL_BELADY:
256 be_spill_belady(&chordal_env);
258 case BE_CH_SPILL_ILP:
259 be_spill_ilp(&chordal_env);
262 fprintf(stderr, "no valid spiller selected. falling back to belady\n");
263 be_spill_belady(&chordal_env);
265 dump(BE_CH_DUMP_SPILL, irg, chordal_env.cls, "-spill", dump_ir_block_graph_sched);
267 be_check_pressure(&chordal_env);
270 /* Insert perms before reg-constrained instructions */
271 be_insert_constr_perms(&chordal_env);
272 dump(BE_CH_DUMP_CONSTR, irg, chordal_env.cls, "-constr", dump_ir_block_graph_sched);
276 be_check_pressure(&chordal_env);
278 /* Color the graph. */
279 be_ra_chordal_color(&chordal_env);
280 dump(BE_CH_DUMP_CONSTR, irg, chordal_env.cls, "-color", dump_ir_block_graph_sched);
282 /* Build the interference graph. */
283 chordal_env.ifg = be_ifg_std_new(&chordal_env);
284 be_ifg_check(chordal_env.ifg);
286 /* copy minimization */
287 copystat_collect_cls(&chordal_env);
288 be_copy_opt(&chordal_env);
289 dump(BE_CH_DUMP_COPYMIN, irg, chordal_env.cls, "-copymin", dump_ir_block_graph_sched);
290 be_ra_chordal_check(&chordal_env);
292 /* ssa destruction */
293 be_ssa_destruction(&chordal_env);
294 dump(BE_CH_DUMP_SSADESTR, irg, chordal_env.cls, "-ssadestr", dump_ir_block_graph_sched);
295 be_ssa_destruction_check(&chordal_env);
296 be_ra_chordal_check(&chordal_env);
300 be_ifg_free(chordal_env.ifg);
302 pmap_destroy(chordal_env.border_heads);
303 del_pset(chordal_env.constr_irn);
306 be_compute_spill_offsets(&chordal_env);
308 dump(BE_CH_DUMP_LOWER, irg, NULL, "-spilloff", dump_ir_block_graph_sched);
310 lower_nodes_after_ra(&chordal_env, options.lower_perm_method == BE_CH_LOWER_PERM_COPY ? 1 : 0);
311 dump(BE_CH_DUMP_LOWER, irg, NULL, "-belower-after-ra", dump_ir_block_graph_sched);
313 be_free_dominance_frontiers(chordal_env.dom_front);
314 obstack_free(&chordal_env.obst, NULL);
317 const be_ra_t be_ra_chordal_allocator = {
319 be_ra_chordal_register_options,