X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbechordal_main.c;h=37726640c2b448d3f0ebefd748231405d6e33fe4;hb=fd96240794b2bc719ca2da1e2415ae9cef8d475a;hp=d5af416b5efc3bda35c6ee8bc00987b640fe8ec4;hpb=f436f72951577e35b60e0ea1f2e6a536e4f479bb;p=libfirm

diff --git a/ir/be/bechordal_main.c b/ir/be/bechordal_main.c
index d5af416b5..37726640c 100644
--- a/ir/be/bechordal_main.c
+++ b/ir/be/bechordal_main.c
@@ -1,149 +1,99 @@
-/**
- * @file   bechordal_main.c
- * @date   29.11.2005
- * @author Sebastian Hack
+/*
+ * Copyright (C) 1995-2008 University of Karlsruhe.  All right reserved.
+ *
+ * This file is part of libFirm.
  *
- * Copyright (C) 2005 Universitaet Karlsruhe
- * Released under the GPL
+ * This file may be distributed and/or modified under the terms of the
+ * GNU General Public License version 2 as published by the Free Software
+ * Foundation and appearing in the file LICENSE.GPL included in the
+ * packaging of this file.
  *
- * Driver for the chordal register allocator.
+ * Licensees holding valid libFirm Professional Edition licenses may use
+ * this file in accordance with the libFirm Commercial License.
+ * Agreement provided with the Software.
+ *
+ * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
+ * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+ * PURPOSE.
+ */
+
+/**
+ * @file
+ * @brief       Driver for the chordal register allocator.
+ * @author      Sebastian Hack
+ * @date        29.11.2005
  */
-#ifdef HAVE_CONFIG_H
 #include "config.h"
-#endif
+
+#include <stdlib.h>
+#include <time.h>
 
 #include "obst.h"
 #include "pset.h"
 #include "list.h"
 #include "bitset.h"
-#include "iterator.h"
 
-#ifdef WITH_LIBCORE
-#include <libcore/lc_opts.h>
-#include <libcore/lc_opts_enum.h>
-#endif /* WITH_LIBCORE */
+#include "lc_opts.h"
+#include "lc_opts_enum.h"
 
+#include "ircons_t.h"
 #include "irmode_t.h"
 #include "irgraph_t.h"
 #include "irprintf_t.h"
 #include "irgwalk.h"
+#include "ircons.h"
 #include "irdump.h"
 #include "irdom.h"
-#include "irbitset.h"
+#include "ircons.h"
+#include "irnode.h"
+#include "ircons.h"
+#include "irtools.h"
 #include "debug.h"
-#include "xmalloc.h"
+#include "execfreq.h"
+#include "iredges_t.h"
+#include "error.h"
 
 #include "bechordal_t.h"
 #include "beabi.h"
 #include "beutil.h"
 #include "besched.h"
-#include "benumb_t.h"
-#include "besched_t.h"
+#include "besched.h"
 #include "belive_t.h"
 #include "bearch.h"
-#include "beifg_t.h"
-#include "beifg_impl.h"
-
-#include "bespillbelady.h"
-#include "bespillmorgan.h"
+#include "beifg.h"
+#include "benode.h"
+#include "statev_t.h"
+#include "bestat.h"
+#include "bemodule.h"
+#include "be_t.h"
+#include "bera.h"
+#include "beirg.h"
+#include "bestack.h"
+
+#include "bespillslots.h"
+#include "bespill.h"
 #include "belower.h"
 
-#ifdef WITH_ILP
-#include "bespillilp.h"
-#endif /* WITH_ILP */
-
 #include "becopystat.h"
 #include "becopyopt.h"
 #include "bessadestr.h"
 #include "beverify.h"
+#include "benode.h"
 
-
-void be_ra_chordal_check(be_chordal_env_t *chordal_env) {
-	const arch_env_t *arch_env = chordal_env->birg->main_env->arch_env;
-	struct obstack ob;
-	pmap_entry *pme;
-	ir_node **nodes, *n1, *n2;
-	int i, o;
-	DEBUG_ONLY(firm_dbg_module_t *dbg = chordal_env->dbg;)
-
-	/* Collect all irns */
-	obstack_init(&ob);
-	pmap_foreach(chordal_env->border_heads, pme) {
-		border_t *curr;
-		struct list_head *head = pme->value;
-		list_for_each_entry(border_t, curr, head, list)
-			if (curr->is_def && curr->is_real)
-				if (arch_get_irn_reg_class(arch_env, curr->irn, -1) == chordal_env->cls)
-					obstack_ptr_grow(&ob, curr->irn);
-	}
-	obstack_ptr_grow(&ob, NULL);
-	nodes = (ir_node **) obstack_finish(&ob);
-
-	/* Check them */
-	for (i = 0, n1 = nodes[i]; n1; n1 = nodes[++i]) {
-		const arch_register_t *n1_reg, *n2_reg;
-
-		n1_reg = arch_get_irn_register(arch_env, n1);
-		if (!arch_reg_is_allocatable(arch_env, n1, -1, n1_reg)) {
-			DBG((dbg, 0, "Register %s assigned to %+F is not allowed\n", n1_reg->name, n1));
-			assert(0 && "Register constraint does not hold");
-		}
-		for (o = i+1, n2 = nodes[o]; n2; n2 = nodes[++o]) {
-			n2_reg = arch_get_irn_register(arch_env, n2);
-			if (values_interfere(n1, n2) && n1_reg == n2_reg) {
-				DBG((dbg, 0, "Values %+F and %+F interfere and have the same register assigned\n", n1, n2));
-				assert(0 && "Interfering values have the same color!");
-			}
-		}
-	}
-	obstack_free(&ob, NULL);
-}
-
-int nodes_interfere(const be_chordal_env_t *env, const ir_node *a, const ir_node *b)
-{
-	if(env->ifg)
-		return be_ifg_connected(env->ifg, a, b);
-	else
-		return values_interfere(a, b);
-}
-
+#include "bepbqpcoloring.h"
 
 static be_ra_chordal_opts_t options = {
 	BE_CH_DUMP_NONE,
-	BE_CH_SPILL_MORGAN,
-	BE_CH_COPYMIN_HEUR1,
-	BE_CH_IFG_STD,
 	BE_CH_LOWER_PERM_SWAP,
+	BE_CH_VRFY_WARN
 };
 
-#ifdef WITH_LIBCORE
-static const lc_opt_enum_int_items_t spill_items[] = {
-	{ "morgan", BE_CH_SPILL_MORGAN },
-	{ "belady", BE_CH_SPILL_BELADY },
-#ifdef WITH_ILP
-	{ "ilp",	BE_CH_SPILL_ILP },
-#endif
-	{ NULL, 0 }
-};
-
-static const lc_opt_enum_int_items_t copymin_items[] = {
-	{ "none",  BE_CH_COPYMIN_NONE      },
-	{ "heur1", BE_CH_COPYMIN_HEUR1     },
-	{ "heur2", BE_CH_COPYMIN_HEUR2     },
-	{ "stat",  BE_CH_COPYMIN_STAT      },
-	{ "park",  BE_CH_COPYMIN_PARK_MOON },
-#ifdef WITH_ILP
-	{ "ilp1",  BE_CH_COPYMIN_ILP1 },
-	{ "ilp2",  BE_CH_COPYMIN_ILP2 },
-#endif
-	{ NULL, 0 }
-};
-
-static const lc_opt_enum_int_items_t ifg_flavor_items[] = {
-	{ "std",  BE_CH_IFG_STD },
-	{ "fast", BE_CH_IFG_FAST },
-	{ NULL, 0 }
-};
+typedef struct post_spill_env_t {
+	be_chordal_env_t            cenv;
+	ir_graph                    *irg;
+	const arch_register_class_t *cls;
+	double                      pre_spill_cost;
+} post_spill_env_t;
 
 static const lc_opt_enum_int_items_t lower_perm_items[] = {
 	{ "copy", BE_CH_LOWER_PERM_COPY },
@@ -151,239 +101,367 @@ static const lc_opt_enum_int_items_t lower_perm_items[] = {
 	{ NULL, 0 }
 };
 
-static const lc_opt_enum_int_items_t lower_perm_stat_items[] = {
+static const lc_opt_enum_mask_items_t dump_items[] = {
+	{ "none",       BE_CH_DUMP_NONE       },
+	{ "spill",      BE_CH_DUMP_SPILL      },
+	{ "live",       BE_CH_DUMP_LIVE       },
+	{ "color",      BE_CH_DUMP_COLOR      },
+	{ "copymin",    BE_CH_DUMP_COPYMIN    },
+	{ "ssadestr",   BE_CH_DUMP_SSADESTR   },
+	{ "tree",       BE_CH_DUMP_TREE_INTV  },
+	{ "split",      BE_CH_DUMP_SPLIT      },
+	{ "constr",     BE_CH_DUMP_CONSTR     },
+	{ "lower",      BE_CH_DUMP_LOWER      },
+	{ "spillslots", BE_CH_DUMP_SPILLSLOTS },
+	{ "appel",      BE_CH_DUMP_APPEL      },
+	{ "all",        BE_CH_DUMP_ALL        },
 	{ NULL, 0 }
 };
 
-static const lc_opt_enum_int_items_t dump_items[] = {
-	{ "spill",    BE_CH_DUMP_SPILL },
-	{ "live",     BE_CH_DUMP_LIVE },
-	{ "color",    BE_CH_DUMP_COLOR },
-	{ "copymin",  BE_CH_DUMP_COPYMIN },
-	{ "ssadestr", BE_CH_DUMP_SSADESTR },
-	{ "tree",     BE_CH_DUMP_TREE_INTV },
-	{ "constr",   BE_CH_DUMP_CONSTR },
-	{ "lower",    BE_CH_DUMP_LOWER },
+static const lc_opt_enum_int_items_t be_ch_vrfy_items[] = {
+	{ "off",    BE_CH_VRFY_OFF    },
+	{ "warn",   BE_CH_VRFY_WARN   },
+	{ "assert", BE_CH_VRFY_ASSERT },
 	{ NULL, 0 }
 };
 
-static lc_opt_enum_int_var_t spill_var = {
-	&options.spill_method, spill_items
-};
-
-static lc_opt_enum_int_var_t copymin_var = {
-	&options.copymin_method, copymin_items
-};
-
-static lc_opt_enum_int_var_t ifg_flavor_var = {
-	&options.spill_method, ifg_flavor_items
-};
-
 static lc_opt_enum_int_var_t lower_perm_var = {
 	&options.lower_perm_opt, lower_perm_items
 };
 
-static lc_opt_enum_int_var_t dump_var = {
+static lc_opt_enum_mask_var_t dump_var = {
 	&options.dump_flags, dump_items
 };
 
+static lc_opt_enum_int_var_t be_ch_vrfy_var = {
+	&options.vrfy_option, be_ch_vrfy_items
+};
+
 static const lc_opt_table_entry_t be_chordal_options[] = {
-	LC_OPT_ENT_ENUM_MASK("spill",   "spill method (belady or ilp)", &spill_var),
-	LC_OPT_ENT_ENUM_PTR ("copymin", "copymin method (none, heur1, heur2, ilp1, ilp2 or stat)", &copymin_var),
-	LC_OPT_ENT_ENUM_PTR ("ifg",     "interference graph flavour (std or fast)", &ifg_flavor_var),
-	LC_OPT_ENT_ENUM_MASK("perm",    "perm lowering options (copy or swap)", &lower_perm_var),
-	LC_OPT_ENT_ENUM_MASK("dump",    "select dump phases", &dump_var),
-	{ NULL }
+	LC_OPT_ENT_ENUM_INT ("perm",          "perm lowering options", &lower_perm_var),
+	LC_OPT_ENT_ENUM_MASK("dump",          "select dump phases", &dump_var),
+	LC_OPT_ENT_ENUM_INT ("verify",        "verify options", &be_ch_vrfy_var),
+	LC_OPT_LAST
 };
 
-static void be_ra_chordal_register_options(lc_opt_entry_t *grp)
-{
-	static int run_once = 0;
-	lc_opt_entry_t *chordal_grp;
+static be_module_list_entry_t *colorings = NULL;
+static const be_ra_chordal_coloring_t *selected_coloring = NULL;
 
-	if (! run_once) {
-		run_once    = 1;
-		chordal_grp = lc_opt_get_grp(grp, "chordal");
+void be_register_chordal_coloring(const char *name, be_ra_chordal_coloring_t *coloring)
+{
+	if (selected_coloring == NULL)
+		selected_coloring = coloring;
 
-		lc_opt_add_table(chordal_grp, be_chordal_options);
-	}
+	be_add_module_to_list(&colorings, name, coloring);
+}
 
-	co_register_options(chordal_grp);
+static void be_ra_chordal_coloring(be_chordal_env_t *env)
+{
+	selected_coloring->allocate(env);
 }
-#endif
 
 static void dump(unsigned mask, ir_graph *irg,
 				 const arch_register_class_t *cls,
-				 const char *suffix,
-				 void (*dump_func)(ir_graph *, const char *))
+				 const char *suffix)
 {
-	if(1 || ((options.dump_flags & mask) == mask)) {
-		if(cls) {
+	if ((options.dump_flags & mask) == mask) {
+		if (cls) {
 			char buf[256];
-			snprintf(buf, sizeof(buf), "-%s%s", cls->name, suffix);
-			be_dump(irg, buf, dump_func);
+			snprintf(buf, sizeof(buf), "%s-%s", cls->name, suffix);
+			dump_ir_graph(irg, buf);
+		} else {
+			dump_ir_graph(irg, suffix);
 		}
+	}
+}
 
-		else
-			be_dump(irg, suffix, dump_func);
+/**
+ * Post-Walker: Checks for the given reload if has only one user that can perform the
+ * reload as part of its address mode.
+ * Fold the reload into the user it that is possible.
+ */
+static void memory_operand_walker(ir_node *irn, void *env)
+{
+	ir_node *block;
+	ir_node *spill;
+
+	(void)env;
+
+	if (! be_is_Reload(irn))
+		return;
+
+	/* only use memory operands, if the reload is only used by 1 node */
+	if (get_irn_n_edges(irn) > 1)
+		return;
+
+	spill = be_get_Reload_mem(irn);
+	block = get_nodes_block(irn);
+
+	foreach_out_edge_safe(irn, edge) {
+		ir_node *src = get_edge_src_irn(edge);
+		int     pos  = get_edge_src_pos(edge);
+
+		assert(src && "outedges broken!");
+
+		if (get_nodes_block(src) == block && arch_possible_memory_operand(src, pos)) {
+			arch_perform_memory_operand(src, spill, pos);
+		}
+	}
+
+	/* kill the Reload if it was folded */
+	if (get_irn_n_edges(irn) == 0) {
+		ir_graph *irg = get_irn_irg(irn);
+		ir_mode  *frame_mode = get_irn_mode(get_irn_n(irn, n_be_Reload_frame));
+		sched_remove(irn);
+		set_irn_n(irn, n_be_Reload_mem, new_r_Bad(irg, mode_X));
+		set_irn_n(irn, n_be_Reload_frame, new_r_Bad(irg, frame_mode));
 	}
 }
 
-static void put_ignore_colors(be_chordal_env_t *chordal_env)
+/**
+ * Starts a walk for memory operands if supported by the backend.
+ */
+void check_for_memory_operands(ir_graph *irg)
 {
-	int n_colors = chordal_env->cls->n_regs;
-	int i;
-
-	bitset_clear_all(chordal_env->ignore_colors);
-	be_abi_put_ignore_regs(chordal_env->birg->abi, chordal_env->cls, chordal_env->ignore_colors);
-	for(i = 0; i < n_colors; ++i)
-		if(arch_register_type_is(&chordal_env->cls->regs[i], ignore))
-			bitset_set(chordal_env->ignore_colors, i);
+	irg_walk_graph(irg, NULL, memory_operand_walker, NULL);
 }
 
-FILE *be_chordal_open(const be_chordal_env_t *env, const char *prefix, const char *suffix)
+
+static be_node_stats_t last_node_stats;
+
+/**
+ * Perform things which need to be done per register class before spilling.
+ */
+static void pre_spill(post_spill_env_t *pse, const arch_register_class_t *cls)
 {
-	char buf[1024];
+	be_chordal_env_t *chordal_env = &pse->cenv;
+	ir_graph         *irg         = pse->irg;
+
+	pse->cls                      = cls;
+	chordal_env->cls              = cls;
+	chordal_env->border_heads     = pmap_create();
+	chordal_env->allocatable_regs = bitset_malloc(chordal_env->cls->n_regs);
 
-	ir_snprintf(buf, sizeof(buf), "%s%F_%s.%s", prefix, env->irg, env->cls->name, suffix);
-	return fopen(buf, "wt");
+	be_assure_live_chk(irg);
+
+	if (stat_ev_enabled) {
+		pse->pre_spill_cost = be_estimate_irg_costs(irg);
+	}
+
+	/* put all ignore registers into the ignore register set. */
+	be_put_allocatable_regs(irg, pse->cls, chordal_env->allocatable_regs);
+
+	be_timer_push(T_RA_CONSTR);
+	be_pre_spill_prepare_constr(irg, chordal_env->cls);
+	be_timer_pop(T_RA_CONSTR);
+
+	dump(BE_CH_DUMP_CONSTR, irg, pse->cls, "constr-pre");
 }
 
-static void be_ra_chordal_main(const be_irg_t *bi)
+/**
+ * Perform things which need to be done per register class after spilling.
+ */
+static void post_spill(post_spill_env_t *pse, int iteration)
 {
-	const be_main_env_t *main_env = bi->main_env;
-	const arch_isa_t    *isa      = arch_env_get_isa(main_env->arch_env);
-	ir_graph            *irg      = bi->irg;
-	copy_opt_t          *co;
+	be_chordal_env_t *chordal_env = &pse->cenv;
+	ir_graph         *irg         = pse->irg;
+	int               allocatable_regs = be_get_n_allocatable_regs(irg, chordal_env->cls);
+
+	/* some special classes contain only ignore regs, no work to be done */
+	if (allocatable_regs > 0) {
+		stat_ev_dbl("bechordal_spillcosts", be_estimate_irg_costs(irg) - pse->pre_spill_cost);
+
+		/*
+			If we have a backend provided spiller, post spill is
+			called in a loop after spilling for each register class.
+			But we only need to fix stack nodes once in this case.
+		*/
+		be_timer_push(T_RA_SPILL_APPLY);
+		check_for_memory_operands(irg);
+		if (iteration == 0) {
+			be_abi_fix_stack_nodes(irg);
+		}
+		be_timer_pop(T_RA_SPILL_APPLY);
+
+
+		/* verify schedule and register pressure */
+		be_timer_push(T_VERIFY);
+		if (chordal_env->opts->vrfy_option == BE_CH_VRFY_WARN) {
+			be_verify_schedule(irg);
+			be_verify_register_pressure(irg, pse->cls);
+		} else if (chordal_env->opts->vrfy_option == BE_CH_VRFY_ASSERT) {
+			assert(be_verify_schedule(irg) && "Schedule verification failed");
+			assert(be_verify_register_pressure(irg, pse->cls)
+				&& "Register pressure verification failed");
+		}
+		be_timer_pop(T_VERIFY);
 
-	int j, m;
-	be_chordal_env_t chordal_env;
+		/* Color the graph. */
+		be_timer_push(T_RA_COLOR);
+		be_ra_chordal_coloring(chordal_env);
+		be_timer_pop(T_RA_COLOR);
 
-	compute_doms(irg);
+		dump(BE_CH_DUMP_CONSTR, irg, pse->cls, "color");
 
-	chordal_env.opts          = &options;
-	chordal_env.irg           = irg;
-	chordal_env.birg          = bi;
-	chordal_env.dom_front     = be_compute_dominance_frontiers(irg);
-	FIRM_DBG_REGISTER(chordal_env.dbg, "firm.be.chordal");
+		/* Create the ifg with the selected flavor */
+		be_timer_push(T_RA_IFG);
+		chordal_env->ifg = be_create_ifg(chordal_env);
+		be_timer_pop(T_RA_IFG);
 
-	obstack_init(&chordal_env.obst);
+		if (stat_ev_enabled) {
+			be_ifg_stat_t   stat;
+			be_node_stats_t node_stats;
 
-	/* Perform the following for each register class. */
-	for(j = 0, m = arch_isa_get_n_reg_class(isa); j < m; ++j) {
-		chordal_env.cls           = arch_isa_get_reg_class(isa, j);
-		chordal_env.border_heads  = pmap_create();
-		chordal_env.ignore_colors = bitset_malloc(chordal_env.cls->n_regs);
-
-		/* put all ignore registers into the ignore register set. */
-		put_ignore_colors(&chordal_env);
-
-		be_liveness(irg);
-		dump(BE_CH_DUMP_LIVE, irg, chordal_env.cls, "-live", dump_ir_block_graph_sched);
-
-		/* spilling */
-		switch(options.spill_method) {
-		case BE_CH_SPILL_MORGAN:
-			be_spill_morgan(&chordal_env);
-			break;
-		case BE_CH_SPILL_BELADY:
-			be_spill_belady(&chordal_env);
-			break;
-#ifdef WITH_ILP
-		case BE_CH_SPILL_ILP:
-			be_spill_ilp(&chordal_env);
-			break;
-#endif /* WITH_ILP */
-		default:
-			fprintf(stderr, "no valid spiller selected. falling back to belady\n");
-			be_spill_belady(&chordal_env);
-		}
-		dump(BE_CH_DUMP_SPILL, irg, chordal_env.cls, "-spill", dump_ir_block_graph_sched);
-		be_abi_fix_stack_nodes(bi->abi);
+			be_ifg_stat(irg, chordal_env->ifg, &stat);
+			stat_ev_dbl("bechordal_ifg_nodes", stat.n_nodes);
+			stat_ev_dbl("bechordal_ifg_edges", stat.n_edges);
+			stat_ev_dbl("bechordal_ifg_comps", stat.n_comps);
 
-		DEBUG_ONLY(be_verify_schedule(irg);)
-		DEBUG_ONLY(be_verify_register_pressure(chordal_env.birg->main_env->arch_env, chordal_env.cls, irg);)
+			be_collect_node_stats(&node_stats, irg);
+			be_subtract_node_stats(&node_stats, &last_node_stats);
 
-		/* Color the graph. */
-		be_liveness(irg);
-		be_ra_chordal_color(&chordal_env);
-		dump(BE_CH_DUMP_CONSTR, irg, chordal_env.cls, "-color", dump_ir_block_graph_sched);
-
-		/* Build the interference graph. */
-		chordal_env.ifg = be_ifg_std_new(&chordal_env);
-		be_ifg_check(chordal_env.ifg);
-
-		/* copy minimization */
-		co = NULL;
-		if (options.copymin_method != BE_CH_COPYMIN_NONE && options.copymin_method != BE_CH_COPYMIN_STAT) {
-			co = new_copy_opt(&chordal_env, co_get_costs_loop_depth);
-			co_build_ou_structure(co);
-			co_build_graph_structure(co);
+			stat_ev_dbl("bechordal_perms_before_coal",
+					node_stats[BE_STAT_PERMS]);
+			stat_ev_dbl("bechordal_copies_before_coal",
+					node_stats[BE_STAT_COPIES]);
 		}
 
-		switch(options.copymin_method) {
-			case BE_CH_COPYMIN_HEUR1:
-				co_solve_heuristic(co);
-				break;
-			case BE_CH_COPYMIN_HEUR2:
-				co_solve_heuristic_new(co);
-				break;
-			case BE_CH_COPYMIN_PARK_MOON:
-				co_solve_park_moon(co);
-				break;
-			case BE_CH_COPYMIN_STAT:
-				co_compare_solvers(&chordal_env);
-				break;
-#ifdef WITH_ILP
-			case BE_CH_COPYMIN_ILP1:
-				printf("FIXME: %s:%d ILP1 not yet implemented!\n", __FILE__, __LINE__);
-				co_solve_ilp1(co, 60.0);
-				break;
-			case BE_CH_COPYMIN_ILP2:
-				co_solve_ilp2(co, 60.0);
-				break;
-#endif /* WITH_ILP */
-			case BE_CH_COPYMIN_NONE:
-			default:
-				break;
+		be_timer_push(T_RA_COPYMIN);
+		co_driver(chordal_env);
+		be_timer_pop(T_RA_COPYMIN);
+
+		dump(BE_CH_DUMP_COPYMIN, irg, pse->cls, "copymin");
+
+		/* ssa destruction */
+		be_timer_push(T_RA_SSA);
+		be_ssa_destruction(chordal_env);
+		be_timer_pop(T_RA_SSA);
+
+		dump(BE_CH_DUMP_SSADESTR, irg, pse->cls, "ssadestr");
+
+		if (chordal_env->opts->vrfy_option != BE_CH_VRFY_OFF) {
+			be_timer_push(T_VERIFY);
+			be_ssa_destruction_check(chordal_env);
+			be_timer_pop(T_VERIFY);
 		}
 
-		if (co) {
-			co_free_graph_structure(co);
-			co_free_ou_structure(co);
-			free_copy_opt(co);
+		/* the ifg exists only if there are allocatable regs */
+		be_ifg_free(chordal_env->ifg);
+	}
+
+	/* free some always allocated data structures */
+	pmap_destroy(chordal_env->border_heads);
+	bitset_free(chordal_env->allocatable_regs);
+}
+
+/**
+ * Performs chordal register allocation for each register class on given irg.
+ *
+ * @param irg    the graph
+ * @return Structure containing timer for the single phases or NULL if no
+ *         timing requested.
+ */
+static void be_ra_chordal_main(ir_graph *irg)
+{
+	const arch_env_t *arch_env = be_get_irg_arch_env(irg);
+	int               j;
+	int               m;
+	be_chordal_env_t  chordal_env;
+	struct obstack    obst;
+
+	be_timer_push(T_RA_OTHER);
+
+	be_timer_push(T_RA_PROLOG);
+
+	chordal_env.obst             = &obst;
+	chordal_env.opts             = &options;
+	chordal_env.irg              = irg;
+	chordal_env.border_heads     = NULL;
+	chordal_env.ifg              = NULL;
+	chordal_env.allocatable_regs = NULL;
+
+	obstack_init(&obst);
+
+	be_timer_pop(T_RA_PROLOG);
+
+	if (stat_ev_enabled) {
+		be_collect_node_stats(&last_node_stats, irg);
+	}
+
+	/* use one of the generic spiller */
+
+	/* Perform the following for each register class. */
+	for (j = 0, m = arch_env->n_register_classes; j < m; ++j) {
+		post_spill_env_t pse;
+		const arch_register_class_t *cls = &arch_env->register_classes[j];
+
+		if (arch_register_class_flags(cls) & arch_register_class_flag_manual_ra)
+			continue;
+
+
+		stat_ev_ctx_push_str("bechordal_cls", cls->name);
+
+		if (stat_ev_enabled) {
+			be_do_stat_reg_pressure(irg, cls);
 		}
 
-		dump(BE_CH_DUMP_COPYMIN, irg, chordal_env.cls, "-copymin", dump_ir_block_graph_sched);
-		be_ra_chordal_check(&chordal_env);
+		pse.cenv = chordal_env;
+		pse.irg = irg;
+		pre_spill(&pse, cls);
 
-		/* ssa destruction */
-		be_ssa_destruction(&chordal_env);
-		dump(BE_CH_DUMP_SSADESTR, irg, chordal_env.cls, "-ssadestr", dump_ir_block_graph_sched);
-		be_ssa_destruction_check(&chordal_env);
-		be_ra_chordal_check(&chordal_env);
+		be_timer_push(T_RA_SPILL);
+		be_do_spill(irg, cls);
+		be_timer_pop(T_RA_SPILL);
+
+		dump(BE_CH_DUMP_SPILL, irg, pse.cls, "spill");
 
-		copystat_dump(irg);
+		post_spill(&pse, 0);
 
-		be_ifg_free(chordal_env.ifg);
-		pmap_destroy(chordal_env.border_heads);
-		bitset_free(chordal_env.ignore_colors);
+		if (stat_ev_enabled) {
+			be_node_stats_t node_stats;
+
+			be_collect_node_stats(&node_stats, irg);
+			be_subtract_node_stats(&node_stats, &last_node_stats);
+			be_emit_node_stats(&node_stats, "bechordal_");
+
+			be_copy_node_stats(&last_node_stats, &node_stats);
+			stat_ev_ctx_pop("bechordal_cls");
+		}
 	}
 
-	be_compute_spill_offsets(&chordal_env);
+	be_timer_push(T_VERIFY);
+	if (chordal_env.opts->vrfy_option == BE_CH_VRFY_WARN) {
+		be_verify_register_allocation(irg);
+	} else if (chordal_env.opts->vrfy_option == BE_CH_VRFY_ASSERT) {
+		assert(be_verify_register_allocation(irg)
+				&& "Register allocation invalid");
+	}
+	be_timer_pop(T_VERIFY);
 
-	dump(BE_CH_DUMP_LOWER, irg, NULL, "-spilloff", dump_ir_block_graph_sched);
+	be_timer_push(T_RA_EPILOG);
+	lower_nodes_after_ra(irg, options.lower_perm_opt == BE_CH_LOWER_PERM_COPY);
+	dump(BE_CH_DUMP_LOWER, irg, NULL, "belower-after-ra");
 
-	lower_nodes_after_ra(&chordal_env, options.lower_perm_opt & BE_CH_LOWER_PERM_COPY ? 1 : 0);
-	dump(BE_CH_DUMP_LOWER, irg, NULL, "-belower-after-ra", dump_ir_block_graph_sched);
+	obstack_free(&obst, NULL);
+	be_invalidate_live_sets(irg);
+	be_timer_pop(T_RA_EPILOG);
 
-	obstack_free(&chordal_env.obst, NULL);
-	be_free_dominance_frontiers(chordal_env.dom_front);
+	be_timer_pop(T_RA_OTHER);
 }
 
-const be_ra_t be_ra_chordal_allocator = {
-#ifdef WITH_LIBCORE
-	be_ra_chordal_register_options,
-#endif
-	be_ra_chordal_main
-};
+BE_REGISTER_MODULE_CONSTRUCTOR(be_init_chordal_main)
+void be_init_chordal_main(void)
+{
+	static be_ra_t be_ra_chordal_allocator = {
+		be_ra_chordal_main,
+	};
+
+	lc_opt_entry_t *be_grp = lc_opt_get_grp(firm_opt_get_root(), "be");
+	lc_opt_entry_t *ra_grp = lc_opt_get_grp(be_grp, "ra");
+	lc_opt_entry_t *chordal_grp = lc_opt_get_grp(ra_grp, "chordal");
+
+	be_register_allocator("chordal", &be_ra_chordal_allocator);
+
+	lc_opt_add_table(chordal_grp, be_chordal_options);
+	be_add_module_list_opt(chordal_grp, "coloring", "select coloring method", &colorings, (void**) &selected_coloring);
+}