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));
+ 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!");
}
}
static be_ra_chordal_opts_t options = {
BE_CH_DUMP_NONE,
BE_CH_SPILL_BELADY,
- BE_CH_COPYMIN_HEUR1,
+ BE_CH_COPYMIN_HEUR2,
BE_CH_IFG_STD,
BE_CH_LOWER_PERM_SWAP,
BE_CH_VRFY_WARN,
};
+static be_ra_timer_t ra_timer = {
+ NULL,
+ NULL,
+ NULL,
+ NULL,
+ NULL,
+ NULL,
+ NULL,
+ NULL,
+
+};
+
#ifdef WITH_LIBCORE
static const lc_opt_enum_int_items_t spill_items[] = {
{ "morgan", BE_CH_SPILL_MORGAN },
};
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 ("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)", ©min_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),
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");
+ 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");
+ 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");
+ 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)
+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;
+ 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;
copy_opt_t *co;
int j, m;
be_chordal_env_t chordal_env;
- //lc_timer_t *timer = lc_timer_register("getTime","get Time of copy minimization using the ifg");
- //unsigned long elapsed_milisec = 0;
+ if (main_opts->timing == BE_TIME_ON) {
+ ra_timer.t_prolog = lc_timer_register("prolog", "regalloc prolog");
+ ra_timer.t_epilog = lc_timer_register("epilog", "regalloc epilog");
+ ra_timer.t_live = lc_timer_register("liveness", "be liveness");
+ ra_timer.t_spill = lc_timer_register("spill", "spiller");
+ ra_timer.t_color = lc_timer_register("color", "graph coloring");
+ ra_timer.t_ifg = lc_timer_register("ifg", "build interference graph");
+ ra_timer.t_copymin = lc_timer_register("copymin", "copy minimization");
+ ra_timer.t_ssa = lc_timer_register("ssadestr", "ssa destruction");
+
+ 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_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);
+ }
+
+#define BE_TIME_START(timer) if (main_opts->timing == BE_TIME_ON) lc_timer_start(timer)
+#define BE_TIME_STOP(timer) if (main_opts->timing == BE_TIME_ON) lc_timer_stop(timer)
+
+ BE_TIME_START(ra_timer.t_prolog);
compute_doms(irg);
obstack_init(&chordal_env.obst);
+ BE_TIME_STOP(ra_timer.t_prolog);
+
/* Perform the following for each register class. */
for(j = 0, m = arch_isa_get_n_reg_class(isa); j < m; ++j) {
+ FILE *f;
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);
+ BE_TIME_START(ra_timer.t_live);
+
/* 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);
+ BE_TIME_STOP(ra_timer.t_live);
+ BE_TIME_START(ra_timer.t_spill);
+
/* spilling */
switch(options.spill_method) {
case BE_CH_SPILL_MORGAN:
&& "Register pressure verification failed");
}
- /* Color the graph. */
+ BE_TIME_STOP(ra_timer.t_spill);
+ BE_TIME_START(ra_timer.t_live);
be_liveness(irg);
+ BE_TIME_STOP(ra_timer.t_live);
+
+ /* Color the graph. */
+ BE_TIME_START(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);
- /* Check the implementations of the ifg */
+ BE_TIME_STOP(ra_timer.t_color);
+ BE_TIME_START(ra_timer.t_ifg);
+ //be_ifg_check_performance(&chordal_env);
+ /* Create the ifg with the selected flavor */
switch (options.ifg_flavor) {
default:
fprintf(stderr, "no valid ifg flavour selected. falling back to std\n");
break;
}
- /* start timer */
- //lc_timer_reset_and_start(timer);
+
+#if 0
+ {
+ be_ifg_t *std = be_ifg_std_new(&chordal_env);
+ f = be_chordal_open(&chordal_env, "std", "csv");
+ be_ifg_check_sorted_to_file(std, f);
+ be_ifg_free(std);
+ fclose(f);
+ }
+
+ f = be_chordal_open(&chordal_env, "clique", "csv");
+ be_ifg_check_sorted_to_file(chordal_env.ifg, f);
+ fclose(f);
+#endif
+ if (options.vrfy_option != BE_CH_VRFY_OFF)
+ be_ra_chordal_check(&chordal_env);
+
+// be_ifg_check_sorted(chordal_env.ifg);
+
+ BE_TIME_STOP(ra_timer.t_ifg);
+ BE_TIME_START(ra_timer.t_copymin);
/* copy minimization */
co = NULL;
co_build_graph_structure(co);
}
- /* stop timer */
- //lc_timer_stop(timer);
- //elapsed_milisec = lc_timer_elapsed_msec(timer);
-
- //ir_printf("%u\n", elapsed_milisec);
-
switch(options.copymin_method) {
case BE_CH_COPYMIN_HEUR1:
co_solve_heuristic(co);
}
dump(BE_CH_DUMP_COPYMIN, irg, chordal_env.cls, "-copymin", dump_ir_block_graph_sched);
- be_ra_chordal_check(&chordal_env);
+ if (options.vrfy_option != BE_CH_VRFY_OFF)
+ be_ra_chordal_check(&chordal_env);
+
+ BE_TIME_STOP(ra_timer.t_copymin);
+ BE_TIME_START(ra_timer.t_ssa);
/* 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);
+ if (options.vrfy_option != BE_CH_VRFY_OFF) {
+ be_ssa_destruction_check(&chordal_env);
+ be_ra_chordal_check(&chordal_env);
+ }
- copystat_dump(irg);
+ if (options.copymin_method == BE_CH_COPYMIN_STAT)
+ copystat_dump(irg);
be_ifg_free(chordal_env.ifg);
pmap_destroy(chordal_env.border_heads);
bitset_free(chordal_env.ignore_colors);
+
+ BE_TIME_STOP(ra_timer.t_ssa);
}
+ BE_TIME_START(ra_timer.t_epilog);
+
be_compute_spill_offsets(&chordal_env);
dump(BE_CH_DUMP_LOWER, irg, NULL, "-spilloff", dump_ir_block_graph_sched);
obstack_free(&chordal_env.obst, NULL);
be_free_dominance_frontiers(chordal_env.dom_front);
+
+ BE_TIME_STOP(ra_timer.t_epilog);
+
+ if (main_opts->timing == BE_TIME_ON)
+ return &ra_timer;
+ else
+ return NULL;
}
const be_ra_t be_ra_chordal_allocator = {