X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbecopystat.c;h=7063e98cca4495a74ae6b86e33ed72995cfec066;hb=df2faee01a5832057bb3ca0ba5f67e979c916e19;hp=467b4647fb951cad88cf3ed6c16b681ccc917033;hpb=646d941217399e4bc713359fd5ad393e4db8b905;p=libfirm diff --git a/ir/be/becopystat.c b/ir/be/becopystat.c index 467b4647f..7063e98cc 100644 --- a/ir/be/becopystat.c +++ b/ir/be/becopystat.c @@ -1,31 +1,49 @@ +/* + * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved. + * + * This file is part of libFirm. + * + * 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. + * + * 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. + */ + /** - * Author: Daniel Grund - * Date: 19.04.2005 - * Copyright: (c) Universitaet Karlsruhe - * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE. + * @file + * @brief Copy node statistics. + * @author Daniel Grund + * @date 19.04.2005 */ -#ifdef HAVE_CONFIG_H #include "config.h" -#endif #include -#include -#include "xmalloc.h" +#include "timing.h" #include "irgraph.h" #include "irgwalk.h" #include "irprog.h" #include "iredges_t.h" -#include "phiclass_t.h" +#include "irnodeset.h" + #include "bechordal_t.h" +#include "benode.h" #include "beutil.h" #include "becopyopt_t.h" #include "becopystat.h" - -#ifdef COPYOPT_STAT +#include "bemodule.h" +#include "beintlive_t.h" #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 @@ -41,23 +59,23 @@ enum vals_t { I_BLOCKS, /* phi nodes */ - I_PHI_CNT, /* number of phi nodes */ - I_PHI_ARG_CNT, /* number of arguments of phis */ - I_PHI_ARG_SELF, /* number of arguments of phis being the phi itself */ - I_PHI_ARG_CONST, /* number of arguments of phis being consts */ - I_PHI_ARG_PRED, /* ... being defined in a cf-pred */ - I_PHI_ARG_GLOB, /* ... being defined elsewhere */ + I_PHI_CNT, /* number of phi nodes */ + I_PHI_ARG_CNT, /* number of arguments of phis */ + I_PHI_ARG_SELF, /* number of arguments of phis being the phi itself */ + I_PHI_ARG_CONST, /* number of arguments of phis being consts */ + I_PHI_ARG_PRED, /* ... being defined in a cf-pred */ + I_PHI_ARG_GLOB, /* ... being defined elsewhere */ I_PHI_ARITY_S, I_PHI_ARITY_E = I_PHI_ARITY_S+MAX_ARITY, /* copy nodes */ - I_CPY_CNT, /* number of copynodes */ + I_CPY_CNT, /* number of copynodes */ /* phi classes */ - I_CLS_CNT, /* number of phi classes */ - I_CLS_IF_FREE, /* number of pc having no interference */ - I_CLS_IF_MAX, /* number of possible interferences in all classes */ - I_CLS_IF_CNT, /* number of actual interferences in all classes */ + I_CLS_CNT, /* number of phi classes */ + I_CLS_IF_FREE, /* number of pc having no interference */ + I_CLS_IF_MAX, /* number of possible interferences in all classes */ + I_CLS_IF_CNT, /* number of actual interferences in all classes */ I_CLS_SIZE_S, I_CLS_SIZE_E = I_CLS_SIZE_S+MAX_CLS_SIZE, I_CLS_PHIS_S, @@ -67,20 +85,20 @@ enum vals_t { /* all of them are external set */ /* 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_ITER, /* number of simplex iterations */ + I_HEUR_TIME, /* solving time in milli seconds */ + I_ILP_TIME, /* solving time in milli seconds */ + I_ILP_VARS, + I_ILP_CSTR, + I_ILP_ITER, /* number of simplex iterations */ /* copy instructions */ - 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 */ + 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 */ ASIZE }; @@ -88,64 +106,40 @@ enum vals_t { /** * Holds current values. Values are added till next copystat_reset */ -int curr_vals[ASIZE]; - -static pset *all_phi_nodes; -static pset *all_phi_classes; -static pset *all_copy_nodes; -static ir_graph *last_irg; +static int curr_vals[ASIZE]; -void copystat_init(void) { - dbg = firm_dbg_register("ir.be.copystat"); - firm_dbg_set_mask(dbg, DEBUG_LVL); +static ir_nodeset_t *all_phi_nodes; +static ir_nodeset_t *all_copy_nodes; - all_phi_nodes = pset_new_ptr_default(); - all_phi_classes = pset_new_ptr_default(); - all_copy_nodes = pset_new_ptr_default(); -} +BE_REGISTER_MODULE_CONSTRUCTOR(be_init_copystat) +void be_init_copystat(void) +{ + FIRM_DBG_REGISTER(dbg, "firm.be.copystat"); -void copystat_reset(void) { - int i; - for (i = 0; i < ASIZE; ++i) - curr_vals[i] = 0; - del_pset(all_phi_nodes); - del_pset(all_phi_classes); - del_pset(all_copy_nodes); - all_phi_nodes = pset_new_ptr_default(); - all_phi_classes = pset_new_ptr_default(); - all_copy_nodes = pset_new_ptr_default(); + all_phi_nodes = ir_nodeset_new(64); + all_copy_nodes = ir_nodeset_new(64); + memset(curr_vals, 0, sizeof(curr_vals)); } -/** - * Collect general data - */ -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_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); - - /* TODO: Add 2-Addr-Code nodes */ -} - -static void copystat_collect_irg(ir_graph *irg, arch_env_t *arch_env) { - irg_walk_graph(irg, irg_stat_walker, NULL, arch_env); - all_phi_classes = phi_class_compute_by_phis(all_phi_nodes); - last_irg = irg; +BE_REGISTER_MODULE_DESTRUCTOR(be_quit_copystat) +void be_quit_copystat(void) +{ + if (all_phi_nodes != NULL) { + ir_nodeset_del(all_phi_nodes); + all_phi_nodes = NULL; + } + if (all_copy_nodes != NULL) { + ir_nodeset_del(all_copy_nodes); + all_copy_nodes = NULL; + } } /** * @return 1 if the block at pos @p pos removed a critical edge - * 0 else + * 0 else */ -static INLINE int was_edge_critical(const ir_node *bl, int pos) { +static inline int was_edge_critical(const ir_node *bl, int pos) +{ const ir_edge_t *edge; const ir_node *bl_at_pos, *bl_before; assert(is_Block(bl)); @@ -159,199 +153,90 @@ 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; } -/** - * Collect phi node data - */ -static void stat_phi_node(be_chordal_env_t *chordal_env, ir_node *phi) { - int arity, i; - ir_node *phi_bl; - assert(is_Phi(phi)); - - /* count all phi phis */ - curr_vals[I_PHI_CNT]++; - - /* argument count */ - arity = get_irn_arity(phi); - curr_vals[I_PHI_ARG_CNT] += arity; - if (arity > MAX_ARITY) - curr_vals[I_PHI_ARITY_E]++; - else - curr_vals[I_PHI_ARITY_S + arity]++; - - phi_bl = get_nodes_block(phi); - /* type of argument {self, const, pred, glob} */ - for (i = 0; i < arity; i++) { - ir_node *block_of_arg, *block_ith_pred; - ir_node *arg = get_irn_n(phi, i); - - if (arg == phi) { - curr_vals[I_PHI_ARG_SELF]++; - continue; - } - - if (iro_Const == get_irn_opcode(arg)) { - curr_vals[I_PHI_ARG_CONST]++; - continue; - } - - /* get the pred block skipping blocks on critical edges */ - block_ith_pred = get_Block_cfgpred_block(phi_bl, i); - if (was_edge_critical(phi_bl, i)) - block_ith_pred = get_Block_cfgpred_block(block_ith_pred, 0); - - block_of_arg = get_nodes_block(arg); - if (block_of_arg == block_ith_pred) { - curr_vals[I_PHI_ARG_PRED]++; - continue; - } - - curr_vals[I_PHI_ARG_GLOB]++; - } -} - -/** - * Collect register-constrained node data - */ -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))) { - curr_vals[I_COPIES_IF]++; - assert(0 && "A Perm pair (in/out) should never interfere!"); - } -} - -/** - * Collect phi class data - */ -static void stat_phi_class(be_chordal_env_t *chordal_env, pset *pc) { - int i, o, size, if_free, phis; - ir_node **members, *p; - - /* phi class count */ - curr_vals[I_CLS_CNT]++; - - /* phi class size */ - size = pset_count(pc); - if (size > MAX_CLS_SIZE) - curr_vals[I_CLS_SIZE_E]++; - else - curr_vals[I_CLS_SIZE_S + size]++; - - /* get an array of all members for double iterating */ - members = xmalloc(size * sizeof(*members)); - DBG((dbg, LEVEL_2, "Phi-class:\n")); - for (i = 0, p = pset_first(pc); p; p = pset_next(pc)) { - DBG((dbg, LEVEL_2, " %+F\n", p)); - members[i++] = p; - } - assert(i == size); - - /* determine number of phis on this class */ - phis = 0; - for (i = 0; i < size; ++i) - if (is_Phi(members[i])) - phis++; - if (phis > MAX_CLS_PHIS) - curr_vals[I_CLS_PHIS_E]++; - else - curr_vals[I_CLS_PHIS_S + phis]++; - - /* determine interference of phi class members */ - curr_vals[I_CLS_IF_MAX] += size*(size-1)/2; - if_free = 1; - for (i = 0; i < size-1; ++i) - for (o = i+1; o < size; ++o) - if (nodes_interfere(chordal_env, members[i], members[o])) { - if_free = 0; - curr_vals[I_CLS_IF_CNT]++; - } - - /* Does this phi class have an inner interference? */ - curr_vals[I_CLS_IF_FREE] += if_free; - - xfree(members); -} - -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; - - if (last_irg != irg) { - copystat_reset(); - copystat_collect_irg(irg, aenv); - } - - for (n = pset_first(all_phi_nodes); n; n = pset_next(all_phi_nodes)) - 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 (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 (arch_get_irn_reg_class(aenv, member, -1) == cenv->cls) - stat_phi_class(cenv, pc); - } -} - -void copystat_add_max_costs(int costs) { +void copystat_add_max_costs(int costs) +{ curr_vals[I_COPIES_MAX] += costs; } -void copystat_add_inevit_costs(int costs) { +void copystat_add_inevit_costs(int costs) +{ curr_vals[I_COPIES_IF] += costs; } -void copystat_add_init_costs(int costs) { +void copystat_add_init_costs(int costs) +{ curr_vals[I_COPIES_INIT] += costs; } -void copystat_add_heur_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) { +void copystat_add_opt_costs(int costs) +{ curr_vals[I_COPIES_OPT] += costs; } -void copystat_add_heur_time(int time) { +void copystat_add_heur_time(int time) +{ curr_vals[I_HEUR_TIME] += time; } -void copystat_add_ilp_time(int time) { + +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_ilp_time(int time) +{ curr_vals[I_ILP_TIME] += time; } -void copystat_add_ilp_vars(int vars) { +void copystat_add_ilp_vars(int vars) +{ curr_vals[I_ILP_VARS] += vars; } -void copystat_add_ilp_csts(int csts) { +void copystat_add_ilp_csts(int csts) +{ curr_vals[I_ILP_CSTR] += csts; } -void copystat_add_ilp_iter(int iters) { +void copystat_add_ilp_iter(int iters) +{ curr_vals[I_ILP_ITER] += iters; } -void copystat_dump(ir_graph *irg) { +/** + * Opens a file named base.ext with the mode mode. + */ +static FILE *be_ffopen(const char *base, const char *ext, const char *mode) +{ + FILE *out; + char buf[1024]; + + snprintf(buf, sizeof(buf), "%s.%s", base, ext); + buf[sizeof(buf) - 1] = '\0'; + if (! (out = fopen(buf, mode))) { + fprintf(stderr, "Cannot open file %s in mode %s\n", buf, mode); + return NULL; + } + return out; +} + +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))); - out = ffopen(buf, "stat", "wt"); + snprintf(buf, sizeof(buf), "%s__%s", get_irp_name(), get_entity_name(get_irg_entity(irg))); + buf[sizeof(buf) - 1] = '\0'; + out = be_ffopen(buf, "stat", "wt"); - fprintf(out, "%d\n", ASIZE); + fprintf(out, "%d\n", (int)ASIZE); for (i = 0; i < ASIZE; i++) { #if 0 if (i >= I_PHI_ARITY_S && i <= I_PHI_ARITY_E) @@ -363,16 +248,18 @@ void copystat_dump(ir_graph *irg) { fprintf(out, "%i\n", curr_vals[i]); } - fclose(out); + fclose(out); } -void copystat_dump_pretty(ir_graph *irg) { +void copystat_dump_pretty(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))); - out = ffopen(buf, "pstat", "wt"); + snprintf(buf, sizeof(buf), "%s__%s", get_irp_name(), get_entity_name(get_irg_entity(irg))); + buf[sizeof(buf) - 1] = '\0'; + out = be_ffopen(buf, "pstat", "wt"); fprintf(out, "Nodes %4d\n", curr_vals[I_ALL_NODES]); fprintf(out, "Blocks %4d\n", curr_vals[I_BLOCKS]); @@ -412,115 +299,3 @@ void copystat_dump_pretty(ir_graph *irg) { fclose(out); } - -/** - * 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; - - co = new_copy_opt(chordal_env, co_get_costs_loop_depth); - DBG((dbg, LEVEL_1, "----> CO: %s\n", co->name)); - phi_class_compute(chordal_env->irg); - - /* 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); - - /* 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); - 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); - - 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); - free_copy_opt(co); -} - - -#endif /* COPYOPT_STAT */