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"
51 #include "bessadestr.h"
52 #include "becopystat.h"
53 #include "becopyoptmain.h"
54 #endif /* DO_SSADESTR */
57 void be_ra_chordal_check(be_chordal_env_t *chordal_env) {
58 firm_dbg_module_t *dbg = chordal_env->dbg;
59 const arch_env_t *arch_env = chordal_env->main_env->arch_env;
62 ir_node **nodes, *n1, *n2;
65 /* Collect all irns */
67 pmap_foreach(chordal_env->border_heads, pme) {
69 struct list_head *head = pme->value;
70 list_for_each_entry(border_t, curr, head, list)
71 if (curr->is_def && curr->is_real)
72 if (arch_get_irn_reg_class(arch_env, curr->irn, -1) == chordal_env->cls)
73 obstack_ptr_grow(&ob, curr->irn);
75 obstack_ptr_grow(&ob, NULL);
76 nodes = (ir_node **) obstack_finish(&ob);
79 for (i = 0, n1 = nodes[i]; n1; n1 = nodes[++i]) {
80 const arch_register_t *n1_reg, *n2_reg;
82 n1_reg = arch_get_irn_register(arch_env, n1);
83 if (!arch_reg_is_allocatable(arch_env, n1, -1, n1_reg)) {
84 DBG((dbg, 0, "Register assigned to %+F is not allowed\n", n1));
85 assert(0 && "Register constraint does not hold");
87 for (o = i+1, n2 = nodes[o]; n2; n2 = nodes[++o]) {
88 n2_reg = arch_get_irn_register(arch_env, n2);
89 if (values_interfere(n1, n2) && n1_reg == n2_reg) {
90 DBG((dbg, 0, "Values %+F and %+F interfere and have the same register assigned\n", n1, n2));
91 assert(0 && "Interfering values have the same color!");
95 obstack_free(&ob, NULL);
98 static void check_pressure_walker(ir_node *bl, void *data)
100 be_chordal_env_t *env = data;
101 firm_dbg_module_t *dbg = env->dbg;
102 int n_regs = arch_register_class_n_regs(env->cls);
104 pset *live = pset_new_ptr_default();
109 live_foreach(bl, li) {
110 if(live_is_end(li) && chordal_has_class(env, li->irn)) {
111 ir_node *irn = (ir_node *) li->irn;
112 pset_insert_ptr(live, irn);
116 DBG((dbg, LEVEL_1, "end set for %+F\n", bl));
117 for(irn = pset_first(live); irn; irn = pset_next(live))
118 DBG((dbg, LEVEL_1, "\t%+F\n", irn));
120 sched_foreach_reverse(bl, irn) {
122 int pressure = pset_count(live);
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 for(x = pset_first(live); x; x = pset_next(live))
130 ir_printf("\t%+10F\n", x);
133 if(chordal_has_class(env, irn))
134 pset_remove_ptr(live, irn);
136 for(i = 0, n = get_irn_arity(irn); i < n; i++) {
137 ir_node *op = get_irn_n(irn, i);
138 if(chordal_has_class(env, op) && !is_Phi(irn))
139 pset_insert_ptr(live, op);
145 void be_check_pressure(const be_chordal_env_t *env)
147 irg_block_walk_graph(env->irg, check_pressure_walker, NULL, (void *) env);
150 int nodes_interfere(const be_chordal_env_t *env, const ir_node *a, const ir_node *b)
153 return be_ifg_connected(env->ifg, a, b);
155 return values_interfere(a, b);
159 static be_ra_chordal_opts_t options = {
167 static const lc_opt_enum_int_items_t spill_items[] = {
168 { "belady", BE_CH_SPILL_BELADY },
169 { "ilp", BE_CH_SPILL_ILP },
173 static const lc_opt_enum_int_items_t copymin_items[] = {
174 { "heur", BE_CH_COPYMIN_HEUR },
175 { "ilp", BE_CH_COPYMIN_ILP },
179 static const lc_opt_enum_int_items_t ifg_flavor_items[] = {
180 { "std", BE_CH_IFG_STD },
181 { "fast", BE_CH_IFG_FAST },
185 static lc_opt_enum_int_var_t spill_var = {
186 &options.spill_method, spill_items
189 static lc_opt_enum_int_var_t copymin_var = {
190 &options.copymin_method, copymin_items
193 static lc_opt_enum_int_var_t ifg_flavor_var = {
194 &options.spill_method, ifg_flavor_items
197 static void be_ra_chordal_register_options(lc_opt_entry_t *grp)
199 lc_opt_entry_t *dump;
200 grp = lc_opt_get_grp(grp, "chordal");
205 static void dump(int mask, ir_graph *irg, const char *suffix,
206 void (*dump)(ir_graph *, const char *))
208 if((options.dump_flags & mask) == mask)
212 static void be_ra_chordal_main(const be_main_env_t *main_env, ir_graph *irg)
215 be_chordal_env_t chordal_env;
216 const arch_isa_t *isa = arch_env_get_isa(main_env->arch_env);
220 chordal_env.irg = irg;
221 chordal_env.dbg = firm_dbg_register("firm.be.chordal");
222 chordal_env.main_env = main_env;
223 chordal_env.dom_front = be_compute_dominance_frontiers(irg);
225 obstack_init(&chordal_env.obst);
227 /* Perform the following for each register class. */
228 for(j = 0, m = arch_isa_get_n_reg_class(isa); j < m; ++j) {
229 chordal_env.border_heads = pmap_create();
230 chordal_env.cls = arch_isa_get_reg_class(isa, j);
235 switch(options.spill_method) {
236 case BE_CH_SPILL_BELADY:
237 be_spill_belady(&chordal_env);
239 case BE_CH_SPILL_ILP:
240 be_spill_ilp(&chordal_env);
243 fprintf(stderr, "no valid spiller selected. falling back to belady\n");
244 be_spill_belady(&chordal_env);
247 dump(BE_CH_DUMP_SPILL, irg, "-spill", dump_ir_block_graph_sched);
251 be_check_pressure(&chordal_env);
253 /* Color the graph. */
254 be_ra_chordal_color(&chordal_env);
256 /* Build the interference graph. */
257 chordal_env.ifg = be_ifg_std_new(&chordal_env);
260 /* copy minimization */
261 copystat_collect_cls(&chordal_env);
262 be_copy_opt(&chordal_env);
263 dump(BE_CH_DUMP_COPYMIN, irg, "-copymin", dump_ir_block_graph_sched);
265 /* ssa destruction */
266 be_ssa_destruction(&chordal_env);
267 be_ssa_destruction_check(&chordal_env);
268 be_ra_chordal_check(&chordal_env);
269 dump(BE_CH_DUMP_SSADESTR, irg, "-ssadestr", dump_ir_block_graph_sched);
272 #endif /* DO_SSADESTR */
274 be_ifg_free(chordal_env.ifg);
275 be_numbering_done(irg);
277 pmap_destroy(chordal_env.border_heads);
280 be_free_dominance_frontiers(chordal_env.dom_front);
281 obstack_free(&chordal_env.obst, NULL);
284 const be_ra_t be_ra_chordal_allocator = {
286 be_ra_chordal_register_options,