X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbechordal_main.c;h=d2ebfa335594c345c4eff7e755cddf18f2ed2a49;hb=97927c8e372f337e8342b698072facf4ffa453ad;hp=cec2bde7e3881799c4fb10333b0eb9e3f5a3286c;hpb=e7cad2f17cb3e282d309bf95475a83f944236a6f;p=libfirm

diff --git a/ir/be/bechordal_main.c b/ir/be/bechordal_main.c
index cec2bde7e..d2ebfa335 100644
--- a/ir/be/bechordal_main.c
+++ b/ir/be/bechordal_main.c
@@ -2,8 +2,9 @@
  * @file   bechordal_main.c
  * @date   29.11.2005
  * @author Sebastian Hack
+ * @cvs-id $Id$
  *
- * Copyright (C) 2005 Universitaet Karlsruhe
+ * Copyright (C) 2005-2006 Universitaet Karlsruhe
  * Released under the GPL
  *
  * Driver for the chordal register allocator.
@@ -12,6 +13,8 @@
 #include "config.h"
 #endif
 
+#include <time.h>
+
 #include "obst.h"
 #include "pset.h"
 #include "list.h"
@@ -25,18 +28,25 @@
 #include <libcore/lc_timing.h>
 #endif /* WITH_LIBCORE */
 
+#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 "ircons.h"
 #include "irbitset.h"
+#include "irnode.h"
+#include "ircons.h"
 #include "debug.h"
 #include "xmalloc.h"
+#include "execfreq.h"
 
 #include "bechordal_t.h"
 #include "beabi.h"
+#include "bejavacoal.h"
 #include "beutil.h"
 #include "besched.h"
 #include "benumb_t.h"
@@ -45,22 +55,25 @@
 #include "bearch.h"
 #include "beifg_t.h"
 #include "beifg_impl.h"
+#include "benode_t.h"
+#include "bestatevent.h"
 
 #include "bespillbelady.h"
 #include "bespillmorgan.h"
+#include "bespillslots.h"
 #include "belower.h"
 
 #ifdef WITH_ILP
-#include "bespillilp.h"
 #include "bespillremat.h"
-#include "bespillappel.h"
 #endif /* WITH_ILP */
 
+#include "bejavacoal.h"
 #include "becopystat.h"
 #include "becopyopt.h"
 #include "bessadestr.h"
 #include "beverify.h"
-
+#include "bespillcost.h"
+#include "benode_t.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;
@@ -94,8 +107,8 @@ void be_ra_chordal_check(be_chordal_env_t *chordal_env) {
 		}
 		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));
+			if (values_interfere(chordal_env->lv, n1, n2) && n1_reg == n2_reg) {
+				DBG((dbg, 0, "Values %+F and %+F interfere and have the same register assigned: %s\n", n1, n2, n1_reg->name));
 				assert(0 && "Interfering values have the same color!");
 			}
 		}
@@ -108,40 +121,50 @@ int nodes_interfere(const be_chordal_env_t *env, const ir_node *a, const ir_node
 	if(env->ifg)
 		return be_ifg_connected(env->ifg, a, b);
 	else
-		return values_interfere(a, b);
+		return values_interfere(env->lv, a, b);
 }
 
 
 static be_ra_chordal_opts_t options = {
 	BE_CH_DUMP_NONE,
 	BE_CH_SPILL_BELADY,
-	BE_CH_COPYMIN_HEUR1,
 	BE_CH_IFG_STD,
 	BE_CH_LOWER_PERM_SWAP,
 	BE_CH_VRFY_WARN,
 };
 
+/* coalesce spill slots */
+static int coalesce_spill_slots = 1;
+
+/** The name of the file where the statistics are put to. */
+static char stat_file_name[2048];
+
+/** Enable extreme live range splitting. */
+static int be_elr_split = 0;
+
+/** Assumed loop iteration count for execution frequency estimation. */
+static int be_loop_weight = 9;
+
 #ifdef WITH_LIBCORE
+static be_ra_timer_t ra_timer = {
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+};
+
 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    },
-	{ "remat",  BE_CH_SPILL_REMAT  },
-	{ "appel",  BE_CH_SPILL_APPEL  },
-#endif /* WITH_ILP */
-	{ 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 },
+	{ "remat",  BE_CH_SPILL_REMAT },
 #endif /* WITH_ILP */
 	{ NULL, 0 }
 };
@@ -167,15 +190,17 @@ static const lc_opt_enum_int_items_t lower_perm_stat_items[] = {
 };
 
 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     },
-	{ "all",      BE_CH_DUMP_ALL       },
+	{ "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      },
+	{ "spillslots", BE_CH_DUMP_SPILLSLOTS },
+	{ "appel",      BE_CH_DUMP_APPEL      },
+	{ "all",        BE_CH_DUMP_ALL        },
 	{ NULL, 0 }
 };
 
@@ -190,10 +215,6 @@ 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.ifg_flavor, ifg_flavor_items
 };
@@ -211,15 +232,21 @@ static lc_opt_enum_int_var_t be_ch_vrfy_var = {
 };
 
 static const lc_opt_table_entry_t be_chordal_options[] = {
-	LC_OPT_ENT_ENUM_MASK("spill",	"spill method (belady, ilp, remat or appel)", &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, fast, clique, pointer, list, check)", &ifg_flavor_var),
-	LC_OPT_ENT_ENUM_PTR ("perm",    "perm lowering options (copy or swap)", &lower_perm_var),
-	LC_OPT_ENT_ENUM_MASK("dump",    "select dump phases", &dump_var),
-	LC_OPT_ENT_ENUM_PTR ("vrfy",    "verify options (off, warn, assert)", &be_ch_vrfy_var),
+	LC_OPT_ENT_STR      ("statfile",      "the name of the statisctics file", stat_file_name, sizeof(stat_file_name)),
+	LC_OPT_ENT_BOOL     ("spill.coal",    "coalesce the spill slots (default: yes)", &coalesce_spill_slots),
+	LC_OPT_ENT_ENUM_INT ("spill",	      "spill method (belady, morgan or remat)", &spill_var),
+	LC_OPT_ENT_ENUM_PTR ("ifg",           "interference graph flavour (std, fast, clique, pointer, list, check)", &ifg_flavor_var),
+	LC_OPT_ENT_ENUM_PTR ("perm",          "perm lowering options (copy or swap)", &lower_perm_var),
+	LC_OPT_ENT_ENUM_MASK("dump",          "select dump phases", &dump_var),
+	LC_OPT_ENT_ENUM_PTR ("vrfy",          "verify options (off, warn, assert)", &be_ch_vrfy_var),
+	LC_OPT_ENT_BOOL     ("elrsplit",      "enable extreme live range splitting", &be_elr_split),
+	LC_OPT_ENT_INT      ("loop_weight",   "assumed amount of loop iterations for guessing the execution frequency", &be_loop_weight),
 	{ NULL }
 };
 
+extern void be_spill_remat_register_options(lc_opt_entry_t *ent);
+
+
 static void be_ra_chordal_register_options(lc_opt_entry_t *grp)
 {
 	static int run_once = 0;
@@ -230,9 +257,13 @@ static void be_ra_chordal_register_options(lc_opt_entry_t *grp)
 		chordal_grp = lc_opt_get_grp(grp, "chordal");
 
 		lc_opt_add_table(chordal_grp, be_chordal_options);
-	}
 
-	co_register_options(chordal_grp);
+		co_register_options(chordal_grp);
+		be_java_coal_register_options(chordal_grp);
+#ifdef WITH_ILP
+		be_spill_remat_register_options(chordal_grp);
+#endif
+	}
 }
 #endif /* WITH_LIBCORE */
 
@@ -268,7 +299,7 @@ FILE *be_chordal_open(const be_chordal_env_t *env, const char *prefix, const cha
 {
 	char buf[1024];
 
-	ir_snprintf(buf, sizeof(buf), "%s%F_%s.%s", prefix, env->irg, env->cls->name, suffix);
+	ir_snprintf(buf, sizeof(buf), "%s%F_%s%s", prefix, env->irg, env->cls->name, suffix);
 	return fopen(buf, "wt");
 }
 
@@ -276,64 +307,334 @@ void check_ifg_implementations(be_chordal_env_t *chordal_env)
 {
 	FILE *f;
 
-	f = be_chordal_open(chordal_env, "std", "log");
+	f = be_chordal_open(chordal_env, "std", ".log");
 	chordal_env->ifg = be_ifg_std_new(chordal_env);
-	be_ifg_check_sorted(chordal_env->ifg, f);
+	be_ifg_check_sorted_to_file(chordal_env->ifg, f);
 	fclose(f);
 
-	f = be_chordal_open(chordal_env, "list", "log");
+	f = be_chordal_open(chordal_env, "list", ".log");
+	be_ifg_free(chordal_env->ifg);
 	chordal_env->ifg = be_ifg_list_new(chordal_env);
-	be_ifg_check_sorted(chordal_env->ifg, f);
+	be_ifg_check_sorted_to_file(chordal_env->ifg, f);
 	fclose(f);
 
-	f = be_chordal_open(chordal_env, "clique", "log");
+	f = be_chordal_open(chordal_env, "clique", ".log");
+	be_ifg_free(chordal_env->ifg);
 	chordal_env->ifg = be_ifg_clique_new(chordal_env);
-	be_ifg_check_sorted(chordal_env->ifg, f);
+	be_ifg_check_sorted_to_file(chordal_env->ifg, f);
 	fclose(f);
 
-	f = be_chordal_open(chordal_env, "pointer", "log");
+	f = be_chordal_open(chordal_env, "pointer", ".log");
+	be_ifg_free(chordal_env->ifg);
 	chordal_env->ifg = be_ifg_pointer_new(chordal_env);
-	be_ifg_check_sorted(chordal_env->ifg, f);
+	be_ifg_check_sorted_to_file(chordal_env->ifg, f);
 	fclose(f);
 
 	chordal_env->ifg = NULL;
 };
 
-static void be_ra_chordal_main(const be_irg_t *bi)
+/**
+ * Checks for every reload if it's user can perform the load on itself.
+ */
+static void memory_operand_walker(ir_node *irn, void *env) {
+	be_chordal_env_t *cenv = env;
+	const arch_env_t *aenv = cenv->birg->main_env->arch_env;
+	const ir_edge_t  *edge, *ne;
+	ir_node          *block;
+	ir_node          *spill;
+
+	if (! be_is_Reload(irn))
+		return;
+
+	/* always use addressmode, it's good for x86 */
+#if 0
+	/* only use memory operands, if the reload is only used by 1 node */
+	if(get_irn_n_edges(irn) > 1)
+		return;
+#endif
+
+	spill = be_get_Reload_mem(irn);
+	block = get_nodes_block(irn);
+
+	foreach_out_edge_safe(irn, edge, ne) {
+		ir_node *src = get_edge_src_irn(edge);
+		int     pos  = get_edge_src_pos(edge);
+
+		if (! src)
+			continue;
+
+		if (get_nodes_block(src) == block && arch_possible_memory_operand(aenv, src, pos)) {
+			DBG((cenv->dbg, LEVEL_3, "performing memory operand %+F at %+F\n", irn, src));
+			arch_perform_memory_operand(aenv, src, spill, pos);
+		}
+	}
+
+	/* kill the Reload */
+	if (get_irn_n_edges(irn) == 0) {
+		sched_remove(irn);
+		set_irn_n(irn, 0, new_Bad());
+		set_irn_n(irn, 1, new_Bad());
+	}
+}
+
+/**
+ * Starts a walk for memory operands if supported by the backend.
+ */
+static INLINE void check_for_memory_operands(be_chordal_env_t *chordal_env) {
+	irg_walk_graph(chordal_env->irg, NULL, memory_operand_walker, chordal_env);
+}
+
+/**
+ * Sorry for doing stats again...
+ */
+typedef struct _node_stat_t {
+	unsigned int n_phis;      /**< Phis of the current register class. */
+	unsigned int n_mem_phis;  /**< Memory Phis (Phis with spill operands). */
+	unsigned int n_copies;    /**< Copies */
+	unsigned int n_perms;     /**< Perms */
+	unsigned int n_spills;    /**< Spill nodes */
+	unsigned int n_reloads;   /**< Reloads */
+} node_stat_t;
+
+struct node_stat_walker {
+	node_stat_t *stat;
+	const be_chordal_env_t *cenv;
+	bitset_t *mem_phis;
+};
+
+static void node_stat_walker(ir_node *irn, void *data)
+{
+	struct node_stat_walker *env = data;
+	const arch_env_t *aenv       = env->cenv->birg->main_env->arch_env;
+
+	if(arch_irn_consider_in_reg_alloc(aenv, env->cenv->cls, irn)) {
+
+		/* if the node is a normal phi */
+		if(is_Phi(irn))
+			env->stat->n_phis++;
+
+		else if(arch_irn_classify(aenv, irn) & arch_irn_class_spill)
+			++env->stat->n_spills;
+
+		else if(arch_irn_classify(aenv, irn) & arch_irn_class_reload)
+			++env->stat->n_reloads;
+
+		else if(arch_irn_classify(aenv, irn) & arch_irn_class_copy)
+			++env->stat->n_copies;
+
+		else if(arch_irn_classify(aenv, irn) & arch_irn_class_perm)
+			++env->stat->n_perms;
+	}
+
+	/* a mem phi is a PhiM with a mem phi operand or a Spill operand */
+	else if(is_Phi(irn) && get_irn_mode(irn) == mode_M) {
+		int i;
+
+		for(i = get_irn_arity(irn) - 1; i >= 0; --i) {
+			ir_node *op = get_irn_n(irn, i);
+
+			if((is_Phi(op) && bitset_contains_irn(env->mem_phis, op)) || (arch_irn_classify(aenv, op) & arch_irn_class_spill)) {
+				bitset_add_irn(env->mem_phis, irn);
+				env->stat->n_mem_phis++;
+				break;
+			}
+		}
+	}
+}
+
+static void node_stats(const be_chordal_env_t *cenv, node_stat_t *stat)
+{
+	struct node_stat_walker env;
+
+	memset(stat, 0, sizeof(stat[0]));
+	env.cenv     = cenv;
+	env.mem_phis = bitset_irg_malloc(cenv->irg);
+	env.stat     = stat;
+	irg_walk_graph(cenv->irg, NULL, node_stat_walker, &env);
+	bitset_free(env.mem_phis);
+}
+
+static void insn_count_walker(ir_node *irn, void *data)
+{
+	int *cnt = data;
+
+	switch(get_irn_opcode(irn)) {
+	case iro_Proj:
+	case iro_Phi:
+	case iro_Start:
+	case iro_End:
+		break;
+	default:
+		(*cnt)++;
+	}
+}
+
+static unsigned int count_insns(ir_graph *irg)
 {
-	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;
+	int cnt = 0;
+	irg_walk_graph(irg, insn_count_walker, NULL, &cnt);
+	return cnt;
+}
+
+#ifdef WITH_LIBCORE
+/**
+ * Initialize all timers.
+ */
+static void be_init_timer(be_options_t *main_opts)
+{
+	if (main_opts->timing == BE_TIME_ON) {
+		ra_timer.t_prolog     = lc_timer_register("ra_prolog",     "regalloc prolog");
+		ra_timer.t_epilog     = lc_timer_register("ra_epilog",     "regalloc epilog");
+		ra_timer.t_live       = lc_timer_register("ra_liveness",   "be liveness");
+		ra_timer.t_spill      = lc_timer_register("ra_spill",      "spiller");
+		ra_timer.t_spillslots = lc_timer_register("ra_spillslots", "spillslots");
+		ra_timer.t_color      = lc_timer_register("ra_color",      "graph coloring");
+		ra_timer.t_ifg        = lc_timer_register("ra_ifg",        "interference graph");
+		ra_timer.t_copymin    = lc_timer_register("ra_copymin",    "copy minimization");
+		ra_timer.t_ssa        = lc_timer_register("ra_ssadestr",   "ssa destruction");
+		ra_timer.t_verify     = lc_timer_register("ra_verify",     "graph verification");
+		ra_timer.t_other      = lc_timer_register("ra_other",      "other time");
+
+		LC_STOP_AND_RESET_TIMER(ra_timer.t_prolog);
+		LC_STOP_AND_RESET_TIMER(ra_timer.t_epilog);
+		LC_STOP_AND_RESET_TIMER(ra_timer.t_live);
+		LC_STOP_AND_RESET_TIMER(ra_timer.t_spill);
+		LC_STOP_AND_RESET_TIMER(ra_timer.t_spillslots);
+		LC_STOP_AND_RESET_TIMER(ra_timer.t_color);
+		LC_STOP_AND_RESET_TIMER(ra_timer.t_ifg);
+		LC_STOP_AND_RESET_TIMER(ra_timer.t_copymin);
+		LC_STOP_AND_RESET_TIMER(ra_timer.t_ssa);
+		LC_STOP_AND_RESET_TIMER(ra_timer.t_verify);
+		LC_STOP_AND_RESET_TIMER(ra_timer.t_other);
+	}
+}
+
+#define BE_TIMER_INIT(main_opts)	be_init_timer(main_opts)
+
+#define BE_TIMER_PUSH(timer)                                                            \
+	if (main_opts->timing == BE_TIME_ON) {                                              \
+		if (! lc_timer_push(timer)) {                                                   \
+			if (options.vrfy_option == BE_CH_VRFY_ASSERT)                               \
+				assert(!"Timer already on stack, cannot be pushed twice.");             \
+			else if (options.vrfy_option == BE_CH_VRFY_WARN)                            \
+				fprintf(stderr, "Timer %s already on stack, cannot be pushed twice.\n", \
+					lc_timer_get_name(timer));                                          \
+		}                                                                               \
+	}
+#define BE_TIMER_POP(timer)                                                                    \
+	if (main_opts->timing == BE_TIME_ON) {                                                     \
+		lc_timer_t *tmp = lc_timer_pop();                                                      \
+		if (options.vrfy_option == BE_CH_VRFY_ASSERT)                                          \
+			assert(tmp == timer && "Attempt to pop wrong timer.");                             \
+		else if (options.vrfy_option == BE_CH_VRFY_WARN && tmp != timer)                       \
+			fprintf(stderr, "Attempt to pop wrong timer. %s is on stack, trying to pop %s.\n", \
+				lc_timer_get_name(tmp), lc_timer_get_name(timer));                             \
+		timer = tmp;                                                                           \
+	}
+#else
 
-	int j, m;
+#define BE_TIMER_INIT(main_opts)
+#define BE_TIMER_PUSH(timer)
+#define BE_TIMER_POP(timer)
+
+#endif /* WITH_LIBCORE */
+
+enum {
+	STAT_TAG_FILE = 0,
+	STAT_TAG_TIME = 1,
+	STAT_TAG_IRG  = 2,
+	STAT_TAG_CLS  = 3,
+	STAT_TAG_LAST
+};
+
+/**
+ * Performs chordal register allocation for each register class on given irg.
+ *
+ * @param bi  Backend irg object
+ * @return Structure containing timer for the single phases or NULL if no timing requested.
+ */
+static be_ra_timer_t *be_ra_chordal_main(const be_irg_t *bi)
+{
+	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;
+	be_options_t        *main_opts = main_env->options;
+	int                   splitted = 0;
+	FILE                *stat_file = NULL;
+
+	char time_str[32];
+	char irg_name[128];
+	int j, m, line;
 	be_chordal_env_t chordal_env;
+	const char *stat_tags[STAT_TAG_LAST];
+
+	/* if we want to do some statistics, push the environment. */
+	if(strlen(stat_file_name) > 0 && (stat_file = fopen(stat_file_name, "at")) != NULL) {
 
-	//lc_timer_t *timer = lc_timer_register("getTime","get Time of copy minimization using the ifg");
-	//unsigned long elapsed_milisec = 0;
+		/* initialize the statistics tags */
+		ir_snprintf(time_str, sizeof(time_str),"%u", time(NULL));
+		ir_snprintf(irg_name, sizeof(irg_name), "%F", irg);
+
+		stat_tags[STAT_TAG_FILE] = be_retrieve_dbg_info(get_entity_dbg_info(get_irg_entity(irg)), &line);
+		stat_tags[STAT_TAG_TIME] = time_str;
+		stat_tags[STAT_TAG_IRG]  = irg_name;
+		stat_tags[STAT_TAG_CLS]  = "<all>";
+
+		be_stat_ev_push(stat_tags, STAT_TAG_LAST, stat_file);
+	}
+
+	BE_TIMER_INIT(main_opts);
+	BE_TIMER_PUSH(ra_timer.t_other);
+	BE_TIMER_PUSH(ra_timer.t_prolog);
 
 	compute_doms(irg);
 
-	chordal_env.opts          = &options;
-	chordal_env.irg           = irg;
-	chordal_env.birg          = bi;
-	chordal_env.dom_front     = be_compute_dominance_frontiers(irg);
+	chordal_env.opts      = &options;
+	chordal_env.irg       = irg;
+	chordal_env.birg      = bi;
+	chordal_env.dom_front = be_compute_dominance_frontiers(irg);
+	chordal_env.exec_freq = bi->execfreqs;
+		/*compute_execfreq(irg, be_loop_weight);*/
+	chordal_env.lv        = be_liveness(irg);
 	FIRM_DBG_REGISTER(chordal_env.dbg, "firm.be.chordal");
 
 	obstack_init(&chordal_env.obst);
 
+	BE_TIMER_POP(ra_timer.t_prolog);
+
+	be_stat_ev("insns_before", count_insns(irg));
+
 	/* Perform the following for each register class. */
-	for(j = 0, m = arch_isa_get_n_reg_class(isa); j < m; ++j) {
+	for (j = 0, m = arch_isa_get_n_reg_class(isa); j < m; ++j) {
+		node_stat_t node_stat;
+
 		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);
 
+		stat_tags[STAT_TAG_CLS] = chordal_env.cls->name;
+
+		if(stat_file) {
+			be_stat_ev_push(stat_tags, STAT_TAG_LAST, stat_file);
+
+			/* perform some node statistics. */
+			node_stats(&chordal_env, &node_stat);
+			be_stat_ev("phis_before_spill", node_stat.n_phis);
+		}
+
 		/* put all ignore registers into the ignore register set. */
 		put_ignore_colors(&chordal_env);
 
-		be_liveness(irg);
+		BE_TIMER_PUSH(ra_timer.t_live);
+		be_liveness_recompute(chordal_env.lv);
+		BE_TIMER_POP(ra_timer.t_live);
 		dump(BE_CH_DUMP_LIVE, irg, chordal_env.cls, "-live", dump_ir_block_graph_sched);
 
+		be_pre_spill_prepare_constr(&chordal_env);
+		dump(BE_CH_DUMP_CONSTR, irg, chordal_env.cls, "-constr-pre", dump_ir_block_graph_sched);
+
+		BE_TIMER_PUSH(ra_timer.t_spill);
+
 		/* spilling */
 		switch(options.spill_method) {
 		case BE_CH_SPILL_MORGAN:
@@ -343,41 +644,62 @@ static void be_ra_chordal_main(const be_irg_t *bi)
 			be_spill_belady(&chordal_env);
 			break;
 #ifdef WITH_ILP
-		case BE_CH_SPILL_ILP:
-			be_spill_ilp(&chordal_env);
-			break;
-                case BE_CH_SPILL_REMAT:
-                        be_spill_remat(&chordal_env);
-                        break;
-		case BE_CH_SPILL_APPEL:
-			be_spill_appel(&chordal_env);
+		case BE_CH_SPILL_REMAT:
+			be_spill_remat(&chordal_env);
 			break;
 #endif /* WITH_ILP */
 		default:
 			fprintf(stderr, "no valid spiller selected. falling back to belady\n");
 			be_spill_belady(&chordal_env);
 		}
+
+		BE_TIMER_POP(ra_timer.t_spill);
+
+		if(stat_file) {
+			node_stats(&chordal_env, &node_stat);
+			be_stat_ev("phis_after_spill", node_stat.n_phis);
+			be_stat_ev("mem_phis", node_stat.n_mem_phis);
+			be_stat_ev("reloads", node_stat.n_reloads);
+			be_stat_ev("spills", node_stat.n_spills);
+		}
+
+		DBG((chordal_env.dbg, LEVEL_1, "spill costs for %+F in regclass %s: %g\n",irg, chordal_env.cls->name, get_irg_spill_cost(&chordal_env)));
+
 		dump(BE_CH_DUMP_SPILL, irg, chordal_env.cls, "-spill", dump_ir_block_graph_sched);
-		be_abi_fix_stack_nodes(bi->abi);
+
+		check_for_memory_operands(&chordal_env);
+
+		be_abi_fix_stack_nodes(bi->abi, chordal_env.lv);
+
+		BE_TIMER_PUSH(ra_timer.t_verify);
 
 		/* verify schedule and register pressure */
 		if (options.vrfy_option == BE_CH_VRFY_WARN) {
 			be_verify_schedule(irg);
-			be_verify_register_pressure(chordal_env.birg->main_env->arch_env, chordal_env.cls, irg);
+			be_verify_register_pressure(chordal_env.birg, chordal_env.cls, irg);
 		}
 		else if (options.vrfy_option == BE_CH_VRFY_ASSERT) {
 			assert(be_verify_schedule(irg) && "Schedule verification failed");
-			assert(be_verify_register_pressure(chordal_env.birg->main_env->arch_env, chordal_env.cls, irg)
+			assert(be_verify_register_pressure(chordal_env.birg, chordal_env.cls, irg)
 				&& "Register pressure verification failed");
 		}
+		BE_TIMER_POP(ra_timer.t_verify);
+
+		if (be_elr_split && ! splitted) {
+			extreme_liverange_splitting(&chordal_env);
+			splitted = 1;
+		}
+
 
 		/* Color the graph. */
-		be_liveness(irg);
+		BE_TIMER_PUSH(ra_timer.t_color);
 		be_ra_chordal_color(&chordal_env);
-		dump(BE_CH_DUMP_CONSTR, irg, chordal_env.cls, "-color", dump_ir_block_graph_sched);
+		BE_TIMER_POP(ra_timer.t_color);
 
-		/* Check the implementations of the ifg */
+		dump(BE_CH_DUMP_CONSTR, irg, chordal_env.cls, "-color", dump_ir_block_graph_sched);
 
+		/* Create the ifg with the selected flavor */
+		BE_TIMER_PUSH(ra_timer.t_ifg);
 		switch (options.ifg_flavor) {
 			default:
 				fprintf(stderr, "no valid ifg flavour selected. falling back to std\n");
@@ -398,78 +720,93 @@ static void be_ra_chordal_main(const be_irg_t *bi)
 				check_ifg_implementations(&chordal_env);
 				/* Build the interference graph. */
 				chordal_env.ifg = be_ifg_std_new(&chordal_env);
-				//be_ifg_check(chordal_env.ifg);
-				//be_ifg_check_sorted(chordal_env.ifg);
 				break;
 		}
+		BE_TIMER_POP(ra_timer.t_ifg);
+
+		if(stat_file) {
+			be_ifg_stat_t stat;
+			be_ifg_stat(&chordal_env, &stat);
+			be_stat_ev("ifg_nodes", stat.n_nodes);
+			be_stat_ev("ifg_edges", stat.n_edges);
+			be_stat_ev("ifg_comps", stat.n_comps);
+		}
 
-		/* start timer */
-		//lc_timer_reset_and_start(timer);
+		BE_TIMER_PUSH(ra_timer.t_verify);
+		if (options.vrfy_option != BE_CH_VRFY_OFF) {
+			//be_ra_chordal_check(&chordal_env);
+		}
 
-		/* 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);
+		BE_TIMER_POP(ra_timer.t_verify);
+
+		if(stat_file) {
+			node_stats(&chordal_env, &node_stat);
+			be_stat_ev("perms_before_coal", node_stat.n_perms);
+			be_stat_ev("copies_before_coal", node_stat.n_copies);
 		}
 
-		/* stop timer */
-		//lc_timer_stop(timer);
-		//elapsed_milisec = lc_timer_elapsed_msec(timer);
+		/* copy minimization */
+		BE_TIMER_PUSH(ra_timer.t_copymin);
+		co_driver(&chordal_env);
+		BE_TIMER_POP(ra_timer.t_copymin);
 
-		//ir_printf("%u\n", elapsed_milisec);
+		dump(BE_CH_DUMP_COPYMIN, irg, chordal_env.cls, "-copymin", dump_ir_block_graph_sched);
 
-		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(ra_timer.t_verify);
 
-		if (co) {
-			co_free_graph_structure(co);
-			co_free_ou_structure(co);
-			free_copy_opt(co);
+		if (options.vrfy_option != BE_CH_VRFY_OFF) {
+			//be_ra_chordal_check(&chordal_env);
 		}
 
-		dump(BE_CH_DUMP_COPYMIN, irg, chordal_env.cls, "-copymin", dump_ir_block_graph_sched);
-		be_ra_chordal_check(&chordal_env);
+		BE_TIMER_POP(ra_timer.t_verify);
+		BE_TIMER_PUSH(ra_timer.t_ssa);
 
 		/* ssa destruction */
 		be_ssa_destruction(&chordal_env);
+
+		BE_TIMER_POP(ra_timer.t_ssa);
+
 		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);
 
-		copystat_dump(irg);
+		BE_TIMER_PUSH(ra_timer.t_verify);
+		if (options.vrfy_option != BE_CH_VRFY_OFF) {
+			be_ssa_destruction_check(&chordal_env);
+			//be_ra_chordal_check(&chordal_env);
+		}
+		BE_TIMER_POP(ra_timer.t_verify);
 
 		be_ifg_free(chordal_env.ifg);
 		pmap_destroy(chordal_env.border_heads);
 		bitset_free(chordal_env.ignore_colors);
+
+		if(stat_file) {
+			node_stats(&chordal_env, &node_stat);
+			be_stat_ev("perms_after_coal", node_stat.n_perms);
+			be_stat_ev("copies_after_coal", node_stat.n_copies);
+		}
+
+		be_stat_ev_pop();
 	}
 
-	be_compute_spill_offsets(&chordal_env);
+	BE_TIMER_PUSH(ra_timer.t_spillslots);
+
+	be_coalesce_spillslots(&chordal_env, coalesce_spill_slots);
+	dump(BE_CH_DUMP_SPILLSLOTS, irg, NULL, "-spillslots", dump_ir_block_graph_sched);
+
+	BE_TIMER_POP(ra_timer.t_spillslots);
+
+	BE_TIMER_PUSH(ra_timer.t_verify);
+
+	/* verify spillslots */
+	if (options.vrfy_option == BE_CH_VRFY_WARN) {
+		be_verify_spillslots(main_env->arch_env, irg);
+	}
+	else if (options.vrfy_option == BE_CH_VRFY_ASSERT) {
+		assert(be_verify_spillslots(main_env->arch_env, irg) && "Spillslot verification failed");
+	}
+	BE_TIMER_POP(ra_timer.t_verify);
+
+	BE_TIMER_PUSH(ra_timer.t_epilog);
 
 	dump(BE_CH_DUMP_LOWER, irg, NULL, "-spilloff", dump_ir_block_graph_sched);
 
@@ -478,11 +815,29 @@ static void be_ra_chordal_main(const be_irg_t *bi)
 
 	obstack_free(&chordal_env.obst, NULL);
 	be_free_dominance_frontiers(chordal_env.dom_front);
+	be_liveness_free(chordal_env.lv);
+	//free_execfreq(chordal_env.exec_freq);
+
+	BE_TIMER_POP(ra_timer.t_epilog);
+	BE_TIMER_POP(ra_timer.t_other);
+
+	be_stat_ev("insns_after", count_insns(irg));
+	be_stat_ev_pop();
+
+	if(stat_file)
+		fclose(stat_file);
+
+#ifdef WITH_LIBCORE
+	return main_opts->timing == BE_TIME_ON ? &ra_timer : NULL;
+#endif /* WITH_LIBCORE */
+	return NULL;
 }
 
 const be_ra_t be_ra_chordal_allocator = {
 #ifdef WITH_LIBCORE
 	be_ra_chordal_register_options,
-#endif
 	be_ra_chordal_main
+#else
+	0
+#endif
 };