fixed some bugs
[libfirm] / ir / be / bechordal_main.c
1 /**
2  * @file   bechordal_main.c
3  * @date   29.11.2005
4  * @author Sebastian Hack
5  *
6  * Copyright (C) 2005 Universitaet Karlsruhe
7  * Released under the GPL
8  *
9  * Driver for the chordal register allocator.
10  */
11 #ifdef HAVE_CONFIG_H
12 #include "config.h"
13 #endif
14
15 #include "obst.h"
16 #include "pset.h"
17 #include "list.h"
18 #include "bitset.h"
19 #include "iterator.h"
20
21 #ifdef WITH_LIBCORE
22 #include <libcore/lc_opts.h>
23 #include <libcore/lc_opts_enum.h>
24 #endif /* WITH_LIBCORE */
25
26 #include "irmode_t.h"
27 #include "irgraph_t.h"
28 #include "irprintf_t.h"
29 #include "irgwalk.h"
30 #include "irdump.h"
31 #include "irdom.h"
32 #include "debug.h"
33 #include "xmalloc.h"
34
35 #include "bechordal_t.h"
36 #include "beutil.h"
37 #include "besched.h"
38 #include "benumb_t.h"
39 #include "besched_t.h"
40 #include "belive_t.h"
41 #include "bearch.h"
42 #include "beifg_t.h"
43 #include "beifg_impl.h"
44
45 #include "bespillbelady.h"
46 #include "bespillilp.h"
47 #include "belower.h"
48
49 #include "becopyoptmain.h"
50 #include "bessadestr.h"
51 #include "becopystat.h"
52
53
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;
57         struct obstack ob;
58         pmap_entry *pme;
59         ir_node **nodes, *n1, *n2;
60         int i, o;
61
62         /* Collect all irns */
63         obstack_init(&ob);
64         pmap_foreach(chordal_env->border_heads, pme) {
65                 border_t *curr;
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);
71         }
72         obstack_ptr_grow(&ob, NULL);
73         nodes = (ir_node **) obstack_finish(&ob);
74
75         /* Check them */
76         for (i = 0, n1 = nodes[i]; n1; n1 = nodes[++i]) {
77                 const arch_register_t *n1_reg, *n2_reg;
78
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");
83                 }
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!");
89                         }
90                 }
91         }
92         obstack_free(&ob, NULL);
93 }
94
95 static void check_pressure_walker(ir_node *bl, void *data)
96 {
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);
100
101         pset *live = pset_new_ptr_default();
102         int step = 0;
103         ir_node *irn;
104         irn_live_t *li;
105
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);
110                 }
111         }
112
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));
116
117         sched_foreach_reverse(bl, irn) {
118                 int i, n;
119                 int pressure = pset_count(live);
120
121                 DBG((dbg, LEVEL_1, "%+10F@%+10F: pressure %d\n", bl, irn, pressure));
122
123                 if(pressure > n_regs) {
124                         ir_node *x;
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);
128                 }
129
130                 if(chordal_has_class(env, irn))
131                         pset_remove_ptr(live, irn);
132
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);
137                 }
138                 step++;
139         }
140 }
141
142 void be_check_pressure(const be_chordal_env_t *env)
143 {
144         irg_block_walk_graph(env->irg, check_pressure_walker, NULL, (void *) env);
145 }
146
147 int nodes_interfere(const be_chordal_env_t *env, const ir_node *a, const ir_node *b)
148 {
149         if(env->ifg)
150                 return be_ifg_connected(env->ifg, a, b);
151         else
152                 return values_interfere(a, b);
153 }
154
155
156 static be_ra_chordal_opts_t options = {
157         BE_CH_DUMP_NONE,
158         BE_CH_SPILL_BELADY,
159         BE_CH_COPYMIN_HEUR,
160         BE_CH_IFG_STD,
161         BE_CH_LOWER_PERM_SWAP
162 };
163
164 #ifdef WITH_LIBCORE
165 static const lc_opt_enum_int_items_t spill_items[] = {
166         { "belady", BE_CH_SPILL_BELADY },
167         { "ilp",        BE_CH_SPILL_ILP },
168         { NULL, 0 }
169 };
170
171 static const lc_opt_enum_int_items_t copymin_items[] = {
172         { "heur", BE_CH_COPYMIN_HEUR },
173         { "ilp",  BE_CH_COPYMIN_ILP },
174         { NULL, 0 }
175 };
176
177 static const lc_opt_enum_int_items_t ifg_flavor_items[] = {
178         { "std",  BE_CH_IFG_STD },
179         { "fast", BE_CH_IFG_FAST },
180         { NULL, 0 }
181 };
182
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 },
186         { NULL, 0 }
187 };
188
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 },
198         { NULL, 0 }
199 };
200
201 static lc_opt_enum_int_var_t spill_var = {
202         &options.spill_method, spill_items
203 };
204
205 static lc_opt_enum_int_var_t copymin_var = {
206         &options.copymin_method, copymin_items
207 };
208
209 static lc_opt_enum_int_var_t ifg_flavor_var = {
210         &options.spill_method, ifg_flavor_items
211 };
212
213 static lc_opt_enum_int_var_t lower_perm_var = {
214         &options.lower_perm_method, lower_perm_items
215 };
216
217 static lc_opt_enum_int_var_t dump_var = {
218         &options.dump_flags, dump_items
219 };
220
221 static void be_ra_chordal_register_options(lc_opt_entry_t *grp)
222 {
223         grp = lc_opt_get_grp(grp, "chordal");
224 }
225 #endif
226
227 static void dump(unsigned mask, ir_graph *irg,
228                                  const arch_register_class_t *cls,
229                                  const char *suffix,
230                                  void (*dump_func)(ir_graph *, const char *))
231 {
232         if(1 || (options.dump_flags & mask) == mask) {
233                 if(cls) {
234                         char buf[256];
235                         snprintf(buf, sizeof(buf), "-%s%s", cls->name, suffix);
236                         dump_func(irg, buf);
237                 }
238
239                 else
240                         dump_func(irg, suffix);
241         }
242 }
243
244 static void be_ra_chordal_main(const be_irg_t *bi)
245 {
246         int j, m;
247         be_chordal_env_t chordal_env;
248         ir_graph *irg = bi->irg;
249         const be_main_env_t *main_env = bi->main_env;
250         const arch_isa_t *isa = arch_env_get_isa(main_env->arch_env);
251
252         compute_doms(irg);
253
254         chordal_env.irg          = irg;
255         chordal_env.dbg          = firm_dbg_register("firm.be.chordal");
256         chordal_env.main_env     = main_env;
257         chordal_env.dom_front    = be_compute_dominance_frontiers(irg);
258
259         obstack_init(&chordal_env.obst);
260
261         /* Perform the following for each register class. */
262         for(j = 0, m = arch_isa_get_n_reg_class(isa); j < m; ++j) {
263                 chordal_env.cls          = arch_isa_get_reg_class(isa, j);
264                 chordal_env.border_heads = pmap_create();
265
266                 be_liveness(irg);
267                 dump(BE_CH_DUMP_LIVE, irg, chordal_env.cls, "-live", dump_ir_block_graph_sched);
268
269                 /* spilling */
270                 switch(options.spill_method) {
271                 case BE_CH_SPILL_BELADY:
272                         be_spill_belady(&chordal_env);
273                         break;
274                 case BE_CH_SPILL_ILP:
275                         be_spill_ilp(&chordal_env);
276                         break;
277                 default:
278                         fprintf(stderr, "no valid spiller selected. falling back to belady\n");
279                         be_spill_belady(&chordal_env);
280                 }
281                 dump(BE_CH_DUMP_SPILL, irg, chordal_env.cls, "-spill", dump_ir_block_graph_sched);
282                 be_liveness(irg);
283                 be_check_pressure(&chordal_env);
284
285                 be_liveness(irg);
286                 be_check_pressure(&chordal_env);
287
288                 /* Color the graph. */
289                 be_ra_chordal_color(&chordal_env);
290                 dump(BE_CH_DUMP_CONSTR, irg, chordal_env.cls, "-color", dump_ir_block_graph_sched);
291
292                 /* Build the interference graph. */
293                 chordal_env.ifg = be_ifg_std_new(&chordal_env);
294                 be_ifg_check(chordal_env.ifg);
295
296                 /* copy minimization */
297                 copystat_collect_cls(&chordal_env);
298                 be_copy_opt(&chordal_env);
299                 dump(BE_CH_DUMP_COPYMIN, irg, chordal_env.cls, "-copymin", dump_ir_block_graph_sched);
300                 be_ra_chordal_check(&chordal_env);
301
302                 /* ssa destruction */
303                 be_ssa_destruction(&chordal_env);
304                 dump(BE_CH_DUMP_SSADESTR, irg, chordal_env.cls, "-ssadestr", dump_ir_block_graph_sched);
305                 be_ssa_destruction_check(&chordal_env);
306                 be_ra_chordal_check(&chordal_env);
307
308                 copystat_dump(irg);
309
310                 be_ifg_free(chordal_env.ifg);
311
312                 pmap_destroy(chordal_env.border_heads);
313         }
314
315         be_compute_spill_offsets(&chordal_env);
316
317         dump(BE_CH_DUMP_LOWER, irg, NULL, "-spilloff", dump_ir_block_graph_sched);
318
319         lower_nodes_after_ra(&chordal_env, options.lower_perm_method == BE_CH_LOWER_PERM_COPY ? 1 : 0);
320         dump(BE_CH_DUMP_LOWER, irg, NULL, "-belower-after-ra", dump_ir_block_graph_sched);
321
322         obstack_free(&chordal_env.obst, NULL);
323         be_free_dominance_frontiers(chordal_env.dom_front);
324 }
325
326 const be_ra_t be_ra_chordal_allocator = {
327 #ifdef WITH_LIBCORE
328         be_ra_chordal_register_options,
329 #endif
330         be_ra_chordal_main
331 };