X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbecopystat.c;h=15d1a255c408b77412ca1f59c08cd08165159db9;hb=1161999117f5c0f56b3af2dc9bb7150e03761905;hp=85bc5fbbb6140cd4942029658fa53992107cdb41;hpb=e1f6d63833df22cbb8771e7b1e3872949bdcd3e8;p=libfirm diff --git a/ir/be/becopystat.c b/ir/be/becopystat.c index 85bc5fbbb..15d1a255c 100644 --- a/ir/be/becopystat.c +++ b/ir/be/becopystat.c @@ -9,22 +9,31 @@ #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 "becopyopt.h" +#include "bechordal_t.h" +#include "beutil.h" +#include "becopyopt_t.h" #include "becopystat.h" -#include "xmalloc.h" -#ifdef DO_STAT +#ifdef COPYOPT_STAT + +#define DO_HEUR +#undef DO_ILP1 +#define DO_ILP2 #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 10 -#define MAX_CLS_SIZE 10 -#define MAX_CLS_PHIS 10 +#define MAX_ARITY 20 +#define MAX_CLS_SIZE 20 +#define MAX_CLS_PHIS 20 /** * For an explanation of these values see the code of copystat_dump_pretty @@ -72,6 +81,8 @@ enum vals_t { I_COPIES_MAX, /* max possible costs of copies*/ I_COPIES_INIT, /* number of copies in initial allocation */ I_COPIES_HEUR, /* number of copies after heuristic */ + I_COPIES_5SEC, /* number of copies after ilp with max n sec */ + I_COPIES_30SEC, /* number of copies after ilp with max n sec */ I_COPIES_OPT, /* number of copies after ilp */ I_COPIES_IF, /* number of copies inevitable due to root-arg-interf */ @@ -86,10 +97,10 @@ int curr_vals[ASIZE]; static pset *all_phi_nodes; static pset *all_phi_classes; 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_classes = pset_new_ptr_default(); @@ -118,18 +129,19 @@ static void irg_stat_walker(ir_node *node, void *env) { if (is_Block(node)) /* count all blocks */ curr_vals[I_BLOCKS]++; - //TODO - if (is_Phi(node) && mode_is_datab(get_irn_mode(node))) /* collect phis */ + if (is_Reg_Phi(node)) /* collect phis */ pset_insert_ptr(all_phi_nodes, node); - if (is_Copy(arch_env, node)) + if (is_Perm_Proj(arch_env, node)) pset_insert_ptr(all_copy_nodes, node); + + /* TODO: Add 2-Addr-Code nodes */ } -void copystat_collect_irg(ir_graph *irg, arch_env_t *arch_env) { +static void copystat_collect_irg(ir_graph *irg, arch_env_t *arch_env) { irg_walk_graph(irg, irg_stat_walker, NULL, arch_env); - curr_vals[I_BLOCKS] -= 2; /* substract 2 for start and end block */ all_phi_classes = phi_class_compute_by_phis(all_phi_nodes); + last_irg = irg; } /** @@ -212,7 +224,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!"); } @@ -270,27 +282,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->session_env->main_env->arch_env, irn, \ - arch_pos_make_out(0)) == 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 = cenv->irg; + arch_env_t *aenv = cenv->birg->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); } } @@ -306,6 +319,12 @@ void copystat_add_init_costs(int costs) { void copystat_add_heur_costs(int costs) { curr_vals[I_COPIES_HEUR] += costs; } +void copystat_add_ilp_5_sec_costs(int costs) { + curr_vals[I_COPIES_5SEC] += costs; +} +void copystat_add_ilp_30_sec_costs(int costs) { + curr_vals[I_COPIES_30SEC] += costs; +} void copystat_add_opt_costs(int costs) { curr_vals[I_COPIES_OPT] += costs; } @@ -395,4 +414,124 @@ 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_heur, costs_ilp1, costs_ilp2, 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)); + + +#ifdef DO_HEUR + timer = lc_timer_register("heur", NULL); + lc_timer_reset_and_start(timer); + + co_solve_heuristic(co); + + lc_timer_stop(timer); + + be_ra_chordal_check(co->cenv); + costs_heur = co_get_copy_costs(co); + DBG((dbg, LEVEL_1, "HEUR costs: %3d\n", costs_heur)); + copystat_add_heur_time(lc_timer_elapsed_msec(timer)); + copystat_add_heur_costs(costs_heur); + assert(lower_bound <= costs_heur); +#endif /* DO_HEUR */ + + +#ifdef DO_ILP1 + load_colors(&saver); + + co_solve_ilp1(co, 60.0); + + costs_ilp1 = co_get_copy_costs(co); + DBG((dbg, LEVEL_1, "ILP1 costs: %3d\n", costs_ilp1)); + copystat_add_opt_costs(costs_ilp1); /*TODO ADAPT */ + assert(lower_bound <= costs_ilp1); +#endif /* DO_ILP1 */ + + +#ifdef DO_ILP2 + load_colors(&saver); + + co_solve_ilp2(co, 60.0); + + be_ra_chordal_check(co->cenv); + costs_ilp2 = co_get_copy_costs(co); + DBG((dbg, LEVEL_1, "ILP2 costs: %3d\n", costs_ilp2)); + copystat_add_opt_costs(costs_ilp2); /*TODO ADAPT */ + assert(lower_bound <= costs_ilp2); +#endif /* DO_ILP2 */ + + pmap_destroy(saver.saved_colors); + co_free_graph_structure(co); + co_free_ou_structure(co); + free_copy_opt(co); +} + + +#endif /* COPYOPT_STAT */