X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbecopystat.c;h=fa6ee3eb33d0e0a71f07bff62a04d193dc0e3414;hb=ff9b23893ba556b55fb18b0203a804179a4ea5d4;hp=7fa9c069b356ba0dc55e735276a187031a908e0e;hpb=e4766594e9640777c92da56f37dbdce7b41385a0;p=libfirm diff --git a/ir/be/becopystat.c b/ir/be/becopystat.c index 7fa9c069b..fa6ee3eb3 100644 --- a/ir/be/becopystat.c +++ b/ir/be/becopystat.c @@ -9,19 +9,21 @@ #endif #include +#include + +#include "xmalloc.h" #include "irgraph.h" +#include "irgwalk.h" #include "irprog.h" -#include "iredges.h" +#include "iredges_t.h" #include "phiclass_t.h" +#include "bechordal_t.h" #include "beutil.h" -#include "becopyopt.h" +#include "becopyopt_t.h" #include "becopystat.h" -#include "xmalloc.h" - -#ifdef DO_STAT #define DEBUG_LVL SET_LEVEL_1 -static firm_dbg_module_t *dbg = NULL; +DEBUG_ONLY(static firm_dbg_module_t *dbg = NULL;) #define MAX_ARITY 20 #define MAX_CLS_SIZE 20 @@ -65,8 +67,8 @@ enum vals_t { /* ilp values */ I_HEUR_TIME, /* solving time in milli seconds */ I_ILP_TIME, /* solving time in milli seconds */ - I_ILP_VARS, - I_ILP_CSTR, + I_ILP_VARS, + I_ILP_CSTR, I_ILP_ITER, /* number of simplex iterations */ /* copy instructions */ @@ -92,12 +94,11 @@ static pset *all_copy_nodes; static ir_graph *last_irg; void copystat_init(void) { - dbg = firm_dbg_register("ir.be.copystat"); - firm_dbg_set_mask(dbg, DEBUG_LVL); + FIRM_DBG_REGISTER(dbg, "firm.be.copystat"); - all_phi_nodes = pset_new_ptr_default(); + all_phi_nodes = pset_new_ptr_default(); all_phi_classes = pset_new_ptr_default(); - all_copy_nodes = pset_new_ptr_default(); + all_copy_nodes = pset_new_ptr_default(); } void copystat_reset(void) { @@ -119,14 +120,14 @@ static void irg_stat_walker(ir_node *node, void *env) { arch_env_t *arch_env = env; curr_vals[I_ALL_NODES]++; /* count all nodes */ - if (is_Block(node)) /* count all blocks */ - curr_vals[I_BLOCKS]++; + if (is_Block(node)) /* count all blocks */ + curr_vals[I_BLOCKS]++; - if (is_Reg_Phi(node)) /* collect phis */ - pset_insert_ptr(all_phi_nodes, node); + if (is_Reg_Phi(node)) /* collect phis */ + pset_insert_ptr(all_phi_nodes, node); - if (is_Perm_Proj(arch_env, node)) - pset_insert_ptr(all_copy_nodes, node); + if (is_Perm_Proj(arch_env, node)) + pset_insert_ptr(all_copy_nodes, node); /* TODO: Add 2-Addr-Code nodes */ } @@ -155,7 +156,7 @@ static INLINE int was_edge_critical(const ir_node *bl, int pos) { if (get_irn_arity(bl_at_pos) != 1) return 0; - /* Does the pred of the pred have several sucsecessors */ + /* Does the pred of the pred have several successors */ bl_before = get_irn_n(bl_at_pos, 0); edge = get_block_succ_first(bl_before); return get_block_succ_next(bl_before, edge) ? 1 : 0; @@ -217,7 +218,7 @@ static void stat_phi_node(be_chordal_env_t *chordal_env, ir_node *phi) { static void stat_copy_node(be_chordal_env_t *chordal_env, ir_node *root) { curr_vals[I_CPY_CNT]++; curr_vals[I_COPIES_MAX]++; - if (nodes_interfere(chordal_env, root, get_Copy_src(root))) { + if (nodes_interfere(chordal_env, root, get_Perm_src(root))) { curr_vals[I_COPIES_IF]++; assert(0 && "A Perm pair (in/out) should never interfere!"); } @@ -275,33 +276,28 @@ static void stat_phi_class(be_chordal_env_t *chordal_env, pset *pc) { xfree(members); } -#define is_curr_reg_class(irn) \ - (arch_get_irn_reg_class(chordal_env->main_env->arch_env, irn, \ - -1) == chordal_env->cls) - -void copystat_collect_cls(be_chordal_env_t *chordal_env) { +void copystat_collect_cls(be_chordal_env_t *cenv) { ir_node *n; pset *pc; - ir_graph *irg = chordal_env->irg; + ir_graph *irg = cenv->irg; + arch_env_t *aenv = cenv->birg->main_env->arch_env; - if (last_irg != irg) { - copystat_reset(); - copystat_collect_irg(irg, chordal_env->main_env->arch_env); - } + copystat_reset(); + copystat_collect_irg(irg, aenv); for (n = pset_first(all_phi_nodes); n; n = pset_next(all_phi_nodes)) - if (is_curr_reg_class(n)) - stat_phi_node(chordal_env, n); + if (arch_get_irn_reg_class(aenv, n, -1) == cenv->cls) + stat_phi_node(cenv, n); for (n = pset_first(all_copy_nodes); n; n = pset_next(all_copy_nodes)) - if (is_curr_reg_class(n)) - stat_copy_node(chordal_env, n); + if (arch_get_irn_reg_class(aenv, n, -1) == cenv->cls) + stat_copy_node(cenv, n); for (pc = pset_first(all_phi_classes); pc; pc = pset_next(all_phi_classes)) { ir_node *member = pset_first(pc); pset_break(pc); - if (is_curr_reg_class(member)) - stat_phi_class(chordal_env, pc); + if (arch_get_irn_reg_class(aenv, member, -1) == cenv->cls) + stat_phi_class(cenv, pc); } } @@ -329,6 +325,9 @@ void copystat_add_opt_costs(int costs) { void copystat_add_heur_time(int time) { curr_vals[I_HEUR_TIME] += time; } + +#ifdef WITH_ILP + void copystat_add_ilp_time(int time) { curr_vals[I_ILP_TIME] += time; } @@ -342,12 +341,15 @@ void copystat_add_ilp_iter(int iters) { curr_vals[I_ILP_ITER] += iters; } +#endif /* WITH_ILP */ + void copystat_dump(ir_graph *irg) { int i; char buf[1024]; FILE *out; snprintf(buf, sizeof(buf), "%s__%s", get_irp_prog_name(), get_entity_name(get_irg_entity(irg))); + buf[sizeof(buf) - 1] = '\0'; out = ffopen(buf, "stat", "wt"); fprintf(out, "%d\n", ASIZE); @@ -362,7 +364,7 @@ void copystat_dump(ir_graph *irg) { fprintf(out, "%i\n", curr_vals[i]); } - fclose(out); + fclose(out); } void copystat_dump_pretty(ir_graph *irg) { @@ -371,6 +373,7 @@ void copystat_dump_pretty(ir_graph *irg) { FILE *out; snprintf(buf, sizeof(buf), "%s__%s", get_irp_prog_name(), get_entity_name(get_irg_entity(irg))); + buf[sizeof(buf) - 1] = '\0'; out = ffopen(buf, "pstat", "wt"); fprintf(out, "Nodes %4d\n", curr_vals[I_ALL_NODES]); @@ -412,4 +415,153 @@ void copystat_dump_pretty(ir_graph *irg) { fclose(out); } -#endif +/** + * Helpers for saving and restoring colors of nodes. + * Used to get dependable and comparable benchmark results. + */ +typedef struct color_saver { + arch_env_t *arch_env; + be_chordal_env_t *chordal_env; + pmap *saved_colors; + int flag; /* 0 save, 1 load */ +} color_save_t; + +static void save_load(ir_node *irn, void *env) { + color_save_t *saver = env; + if (saver->chordal_env->cls == arch_get_irn_reg_class(saver->arch_env, irn, -1)) { + if (saver->flag == 0) { /* save */ + const arch_register_t *reg = arch_get_irn_register(saver->arch_env, irn); + pmap_insert(saver->saved_colors, irn, (void *) reg); + } else { /*load */ + arch_register_t *reg = pmap_get(saver->saved_colors, irn); + arch_set_irn_register(saver->arch_env, irn, reg); + } + } +} + +static void save_colors(color_save_t *color_saver) { + color_saver->flag = 0; + irg_walk_graph(color_saver->chordal_env->irg, save_load, NULL, color_saver); +} + +static void load_colors(color_save_t *color_saver) { + color_saver->flag = 1; + irg_walk_graph(color_saver->chordal_env->irg, save_load, NULL, color_saver); +} + +/** + * Main compare routine + */ +void co_compare_solvers(be_chordal_env_t *chordal_env) { + copy_opt_t *co; + lc_timer_t *timer; + color_save_t saver; + int costs_inevit, costs_init, costs_solved, lower_bound; + + phi_class_compute(chordal_env->irg); + copystat_collect_cls(chordal_env); + + co = new_copy_opt(chordal_env, co_get_costs_loop_depth); + co_build_ou_structure(co); + co_build_graph_structure(co); + DBG((dbg, LEVEL_1, "----> CO: %s\n", co->name)); + + /* save colors */ + saver.arch_env = chordal_env->birg->main_env->arch_env; + saver.chordal_env = chordal_env; + saver.saved_colors = pmap_create(); + save_colors(&saver); + be_ra_chordal_check(co->cenv); + + /* initial values */ + costs_inevit = co_get_inevit_copy_costs(co); + lower_bound = co_get_lower_bound(co); + costs_init = co_get_copy_costs(co); + + DBG((dbg, LEVEL_1, "Inevit Costs: %3d\n", costs_inevit)); + DBG((dbg, LEVEL_1, "Lower Bound: %3d\n", lower_bound)); + DBG((dbg, LEVEL_1, "Init costs: %3d\n", costs_init)); + + copystat_add_inevit_costs(costs_inevit); + copystat_add_init_costs(costs_init); + copystat_add_max_costs(co_get_max_copy_costs(co)); + + /* heuristic 1 (Daniel Grund) */ + timer = lc_timer_register("heur1", NULL); + lc_timer_reset_and_start(timer); + + co_solve_heuristic(co); + + lc_timer_stop(timer); + + be_ra_chordal_check(co->cenv); + costs_solved = co_get_copy_costs(co); + DBG((dbg, LEVEL_1, "HEUR1 costs: %3d\n", costs_solved)); + copystat_add_heur_time(lc_timer_elapsed_msec(timer)); + copystat_add_heur_costs(costs_solved); + assert(lower_bound <= costs_solved); + + /* heuristic 2 (Sebastian Hack) */ + timer = lc_timer_register("heur2", NULL); + lc_timer_reset_and_start(timer); + + co_solve_heuristic_new(co); + + lc_timer_stop(timer); + + be_ra_chordal_check(co->cenv); + costs_solved = co_get_copy_costs(co); + DBG((dbg, LEVEL_1, "HEUR2 costs: %3d\n", costs_solved)); + copystat_add_heur_time(lc_timer_elapsed_msec(timer)); + copystat_add_heur_costs(costs_solved); + assert(lower_bound <= costs_solved); + + /* Park & Moon register coalescing (Kimon Hoffmann) */ + timer = lc_timer_register("park", NULL); + lc_timer_reset_and_start(timer); + + co_solve_park_moon(co); + + lc_timer_stop(timer); + + be_ra_chordal_check(co->cenv); + costs_solved = co_get_copy_costs(co); + DBG((dbg, LEVEL_1, "Park/Moon costs: %3d\n", costs_solved)); + copystat_add_heur_time(lc_timer_elapsed_msec(timer)); + copystat_add_heur_costs(costs_solved); + assert(lower_bound <= costs_solved); + + +#ifdef WITH_ILP + + /* ILP 1 is not yet implemented, so it makes no sense to compare */ +#if 0 + load_colors(&saver); + + co_solve_ilp1(co, 60.0); + + costs_solved = co_get_copy_costs(co); + DBG((dbg, LEVEL_1, "ILP1 costs: %3d\n", costs_solved)); + copystat_add_opt_costs(costs_solved); /* TODO: ADAPT */ + assert(lower_bound <= costs_solved); +#endif /* 0 */ + + /* ILP 2 */ + load_colors(&saver); + + co_solve_ilp2(co); + + be_ra_chordal_check(co->cenv); + costs_solved = co_get_copy_costs(co); + DBG((dbg, LEVEL_1, "ILP2 costs: %3d\n", costs_solved)); + copystat_add_opt_costs(costs_solved); /* TODO: ADAPT */ + assert(lower_bound <= costs_solved); + +#endif /* WITH_ILP */ + + /* free memory for statistic structures */ + pmap_destroy(saver.saved_colors); + co_free_graph_structure(co); + co_free_ou_structure(co); + free_copy_opt(co); +}