2 * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Driver for the chordal register allocator.
23 * @author Sebastian Hack
39 #include "lc_opts_enum.h"
43 #include "irgraph_t.h"
44 #include "irprintf_t.h"
55 #include "iredges_t.h"
57 #include "bechordal_t.h"
61 #include "besched_t.h"
65 #include "beifg_impl.h"
67 #include "bestatevent.h"
74 #include "bespillslots.h"
75 #include "bespilloptions.h"
78 #include "becopystat.h"
79 #include "becopyopt.h"
80 #include "bessadestr.h"
84 static be_ra_chordal_opts_t options = {
86 BE_CH_LOWER_PERM_SWAP,
92 typedef struct _post_spill_env_t {
93 be_chordal_env_t cenv;
95 const arch_register_class_t *cls;
96 double pre_spill_cost;
99 static be_options_t *main_opts;
101 static const lc_opt_enum_int_items_t lower_perm_items[] = {
102 { "copy", BE_CH_LOWER_PERM_COPY },
103 { "swap", BE_CH_LOWER_PERM_SWAP },
107 static const lc_opt_enum_int_items_t lower_perm_stat_items[] = {
111 static const lc_opt_enum_int_items_t dump_items[] = {
112 { "none", BE_CH_DUMP_NONE },
113 { "spill", BE_CH_DUMP_SPILL },
114 { "live", BE_CH_DUMP_LIVE },
115 { "color", BE_CH_DUMP_COLOR },
116 { "copymin", BE_CH_DUMP_COPYMIN },
117 { "ssadestr", BE_CH_DUMP_SSADESTR },
118 { "tree", BE_CH_DUMP_TREE_INTV },
119 { "constr", BE_CH_DUMP_CONSTR },
120 { "lower", BE_CH_DUMP_LOWER },
121 { "spillslots", BE_CH_DUMP_SPILLSLOTS },
122 { "appel", BE_CH_DUMP_APPEL },
123 { "all", BE_CH_DUMP_ALL },
127 static const lc_opt_enum_int_items_t be_ch_vrfy_items[] = {
128 { "off", BE_CH_VRFY_OFF },
129 { "warn", BE_CH_VRFY_WARN },
130 { "assert", BE_CH_VRFY_ASSERT },
134 static lc_opt_enum_int_var_t lower_perm_var = {
135 &options.lower_perm_opt, lower_perm_items
138 static lc_opt_enum_int_var_t dump_var = {
139 &options.dump_flags, dump_items
142 static lc_opt_enum_int_var_t be_ch_vrfy_var = {
143 &options.vrfy_option, be_ch_vrfy_items
146 static const lc_opt_table_entry_t be_chordal_options[] = {
147 LC_OPT_ENT_ENUM_PTR ("perm", "perm lowering options", &lower_perm_var),
148 LC_OPT_ENT_ENUM_MASK("dump", "select dump phases", &dump_var),
149 LC_OPT_ENT_ENUM_PTR ("vrfy", "verify options", &be_ch_vrfy_var),
153 static void dump(unsigned mask, ir_graph *irg,
154 const arch_register_class_t *cls,
156 void (*dump_func)(ir_graph *, const char *))
158 if((options.dump_flags & mask) == mask) {
161 snprintf(buf, sizeof(buf), "-%s%s", cls->name, suffix);
162 be_dump(irg, buf, dump_func);
165 be_dump(irg, suffix, dump_func);
170 * Checks for every reload if its user can perform the load on itself.
172 static void memory_operand_walker(ir_node *irn, void *env)
174 const ir_edge_t *edge, *ne;
180 if (! be_is_Reload(irn))
183 /* only use memory operands, if the reload is only used by 1 node */
184 if(get_irn_n_edges(irn) > 1)
187 spill = be_get_Reload_mem(irn);
188 block = get_nodes_block(irn);
190 foreach_out_edge_safe(irn, edge, ne) {
191 ir_node *src = get_edge_src_irn(edge);
192 int pos = get_edge_src_pos(edge);
194 assert(src && "outedges broken!");
196 if (get_nodes_block(src) == block && arch_possible_memory_operand(src, pos)) {
197 arch_perform_memory_operand(src, spill, pos);
201 /* kill the Reload */
202 if (get_irn_n_edges(irn) == 0) {
204 set_irn_n(irn, be_pos_Reload_mem, new_Bad());
205 set_irn_n(irn, be_pos_Reload_frame, new_Bad());
210 * Starts a walk for memory operands if supported by the backend.
212 static INLINE void check_for_memory_operands(ir_graph *irg)
214 irg_walk_graph(irg, NULL, memory_operand_walker, NULL);
218 static be_node_stats_t last_node_stats;
221 * Perform things which need to be done per register class before spilling.
223 static void pre_spill(post_spill_env_t *pse, const arch_register_class_t *cls)
225 be_chordal_env_t *chordal_env = &pse->cenv;
226 be_irg_t *birg = pse->birg;
227 ir_graph *irg = be_get_birg_irg(birg);
230 chordal_env->cls = cls;
231 chordal_env->border_heads = pmap_create();
232 chordal_env->ignore_colors = bitset_malloc(chordal_env->cls->n_regs);
234 be_assure_liveness(birg);
235 be_liveness_assure_chk(be_get_birg_liveness(birg));
237 stat_ev_do(pse->pre_spill_cost = be_estimate_irg_costs(irg, birg->exec_freq));
239 /* put all ignore registers into the ignore register set. */
240 be_put_ignore_regs(birg, pse->cls, chordal_env->ignore_colors);
242 BE_TIMER_PUSH(t_ra_constr);
243 be_pre_spill_prepare_constr(chordal_env);
244 BE_TIMER_POP(t_ra_constr);
246 dump(BE_CH_DUMP_CONSTR, birg->irg, pse->cls, "-constr-pre", dump_ir_block_graph_sched);
250 * Perform things which need to be done per register class after spilling.
252 static void post_spill(post_spill_env_t *pse, int iteration) {
253 be_chordal_env_t *chordal_env = &pse->cenv;
254 be_irg_t *birg = pse->birg;
255 ir_graph *irg = birg->irg;
256 int colors_n = arch_register_class_n_regs(chordal_env->cls);
257 int allocatable_regs = colors_n - be_put_ignore_regs(birg, chordal_env->cls, NULL);
259 /* some special classes contain only ignore regs, no work to be done */
260 if (allocatable_regs > 0) {
261 stat_ev_dbl("bechordal_spillcosts", be_estimate_irg_costs(irg, birg->exec_freq) - pse->pre_spill_cost);
264 If we have a backend provided spiller, post spill is
265 called in a loop after spilling for each register class.
266 But we only need to fix stack nodes once in this case.
268 BE_TIMER_PUSH(t_ra_spill_apply);
269 check_for_memory_operands(irg);
270 if (iteration == 0) {
271 be_abi_fix_stack_nodes(birg->abi);
273 BE_TIMER_POP(t_ra_spill_apply);
275 BE_TIMER_PUSH(t_verify);
277 /* verify schedule and register pressure */
278 if (chordal_env->opts->vrfy_option == BE_CH_VRFY_WARN) {
279 be_verify_schedule(birg);
280 be_verify_register_pressure(birg, pse->cls, irg);
281 } else if (chordal_env->opts->vrfy_option == BE_CH_VRFY_ASSERT) {
282 assert(be_verify_schedule(birg) && "Schedule verification failed");
283 assert(be_verify_register_pressure(birg, pse->cls, irg)
284 && "Register pressure verification failed");
286 BE_TIMER_POP(t_verify);
288 /* Color the graph. */
289 BE_TIMER_PUSH(t_ra_color);
290 be_ra_chordal_color(chordal_env);
291 BE_TIMER_POP(t_ra_color);
293 dump(BE_CH_DUMP_CONSTR, irg, pse->cls, "-color", dump_ir_block_graph_sched);
295 /* Create the ifg with the selected flavor */
296 BE_TIMER_PUSH(t_ra_ifg);
297 chordal_env->ifg = be_create_ifg(chordal_env);
298 BE_TIMER_POP(t_ra_ifg);
302 be_node_stats_t node_stats;
304 be_ifg_stat(birg, chordal_env->ifg, &stat);
305 stat_ev_dbl("bechordal_ifg_nodes", stat.n_nodes);
306 stat_ev_dbl("bechordal_ifg_edges", stat.n_edges);
307 stat_ev_dbl("bechordal_ifg_comps", stat.n_comps);
309 be_collect_node_stats(&node_stats, birg);
310 be_subtract_node_stats(&node_stats, &last_node_stats);
312 stat_ev_dbl("bechordal_perms_before_coal",
313 node_stats[BE_STAT_PERMS]);
314 stat_ev_dbl("bechordal_copies_before_coal",
315 node_stats[BE_STAT_COPIES]);
318 /* copy minimization */
319 BE_TIMER_PUSH(t_ra_copymin);
320 co_driver(chordal_env);
321 BE_TIMER_POP(t_ra_copymin);
323 dump(BE_CH_DUMP_COPYMIN, irg, pse->cls, "-copymin", dump_ir_block_graph_sched);
326 /* ssa destruction */
327 BE_TIMER_PUSH(t_ra_ssa);
328 be_ssa_destruction(chordal_env);
329 BE_TIMER_POP(t_ra_ssa);
331 dump(BE_CH_DUMP_SSADESTR, irg, pse->cls, "-ssadestr", dump_ir_block_graph_sched);
333 if (chordal_env->opts->vrfy_option != BE_CH_VRFY_OFF) {
334 BE_TIMER_PUSH(t_verify);
335 be_ssa_destruction_check(chordal_env);
336 BE_TIMER_POP(t_verify);
339 /* the ifg exists only if there are allocatable regs */
340 be_ifg_free(chordal_env->ifg);
343 /* free some always allocated data structures */
344 pmap_destroy(chordal_env->border_heads);
345 bitset_free(chordal_env->ignore_colors);
349 * Performs chordal register allocation for each register class on given irg.
351 * @param birg Backend irg object
352 * @return Structure containing timer for the single phases or NULL if no timing requested.
354 static void be_ra_chordal_main(be_irg_t *birg)
356 const be_main_env_t *main_env = birg->main_env;
357 const arch_env_t *arch_env = main_env->arch_env;
358 ir_graph *irg = birg->irg;
360 be_chordal_env_t chordal_env;
363 main_opts = main_env->options;
365 BE_TIMER_PUSH(t_ra_other);
367 BE_TIMER_PUSH(t_ra_prolog);
369 be_assure_liveness(birg);
371 chordal_env.obst = &obst;
372 chordal_env.opts = &options;
373 chordal_env.irg = irg;
374 chordal_env.birg = birg;
375 chordal_env.border_heads = NULL;
376 chordal_env.ifg = NULL;
377 chordal_env.ignore_colors = NULL;
381 BE_TIMER_POP(t_ra_prolog);
384 be_collect_node_stats(&last_node_stats, birg);
387 if (! arch_code_generator_has_spiller(birg->cg)) {
388 /* use one of the generic spiller */
390 /* Perform the following for each register class. */
391 for (j = 0, m = arch_env_get_n_reg_class(arch_env); j < m; ++j) {
392 post_spill_env_t pse;
393 const arch_register_class_t *cls
394 = arch_env_get_reg_class(arch_env, j);
396 if(arch_register_class_flags(cls) & arch_register_class_flag_manual_ra)
400 stat_ev_ctx_push_str("bechordal_cls", cls->name);
403 be_do_stat_reg_pressure(birg, cls);
406 memcpy(&pse.cenv, &chordal_env, sizeof(chordal_env));
408 pre_spill(&pse, cls);
410 BE_TIMER_PUSH(t_ra_spill);
411 be_do_spill(birg, cls);
412 BE_TIMER_POP(t_ra_spill);
414 dump(BE_CH_DUMP_SPILL, irg, pse.cls, "-spill",
415 dump_ir_block_graph_sched);
420 be_node_stats_t node_stats;
422 be_collect_node_stats(&node_stats, birg);
423 be_subtract_node_stats(&node_stats, &last_node_stats);
424 be_emit_node_stats(&node_stats, "bechordal_");
426 be_copy_node_stats(&last_node_stats, &node_stats);
427 stat_ev_ctx_pop("bechordal_cls");
431 post_spill_env_t *pse;
433 /* the backend has its own spiller */
434 m = arch_env_get_n_reg_class(arch_env);
436 pse = alloca(m * sizeof(pse[0]));
438 for (j = 0; j < m; ++j) {
439 memcpy(&pse[j].cenv, &chordal_env, sizeof(chordal_env));
441 pre_spill(&pse[j], pse[j].cls);
444 BE_TIMER_PUSH(t_ra_spill);
445 arch_code_generator_spill(birg->cg, birg);
446 BE_TIMER_POP(t_ra_spill);
447 dump(BE_CH_DUMP_SPILL, irg, NULL, "-spill", dump_ir_block_graph_sched);
449 for (j = 0; j < m; ++j) {
450 post_spill(&pse[j], j);
454 BE_TIMER_PUSH(t_verify);
455 be_verify_register_allocation(birg);
456 BE_TIMER_POP(t_verify);
458 BE_TIMER_PUSH(t_ra_epilog);
459 lower_nodes_after_ra(birg, options.lower_perm_opt & BE_CH_LOWER_PERM_COPY ? 1 : 0);
460 dump(BE_CH_DUMP_LOWER, irg, NULL, "-belower-after-ra", dump_ir_block_graph_sched);
462 obstack_free(&obst, NULL);
463 be_liveness_invalidate(be_get_birg_liveness(birg));
464 BE_TIMER_POP(t_ra_epilog);
466 BE_TIMER_POP(t_ra_other);
469 static be_ra_t be_ra_chordal_allocator = {
473 void be_init_chordal_main(void)
475 lc_opt_entry_t *be_grp = lc_opt_get_grp(firm_opt_get_root(), "be");
476 lc_opt_entry_t *ra_grp = lc_opt_get_grp(be_grp, "ra");
477 lc_opt_entry_t *chordal_grp = lc_opt_get_grp(ra_grp, "chordal");
479 lc_opt_add_table(chordal_grp, be_chordal_options);
481 be_register_allocator("chordal", &be_ra_chordal_allocator);
484 BE_REGISTER_MODULE_CONSTRUCTOR(be_init_chordal_main);