X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbecopystat.c;h=7fa9c069b356ba0dc55e735276a187031a908e0e;hb=1b8713c0eca7389d9db2a74302e206d718edc902;hp=6bfaf83eeab41df8ef96b78dfd691c59aae021b7;hpb=bc5bba8779ba627cad1d0762abe8d054c6528037;p=libfirm diff --git a/ir/be/becopystat.c b/ir/be/becopystat.c index 6bfaf83ee..7fa9c069b 100644 --- a/ir/be/becopystat.c +++ b/ir/be/becopystat.c @@ -11,19 +11,85 @@ #include #include "irgraph.h" #include "irprog.h" +#include "iredges.h" #include "phiclass_t.h" +#include "beutil.h" #include "becopyopt.h" #include "becopystat.h" #include "xmalloc.h" #ifdef DO_STAT -#define DEBUG_LVL 0 //SET_LEVEL_1 +#define DEBUG_LVL SET_LEVEL_1 static firm_dbg_module_t *dbg = NULL; +#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 + */ +enum vals_t { + /* FROM HERE: PROBLEM CHARACTERIZATION */ + + I_ALL_NODES = 0, + 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_ARITY_S, + I_PHI_ARITY_E = I_PHI_ARITY_S+MAX_ARITY, + + /* copy nodes */ + 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_SIZE_S, + I_CLS_SIZE_E = I_CLS_SIZE_S+MAX_CLS_SIZE, + I_CLS_PHIS_S, + I_CLS_PHIS_E = I_CLS_PHIS_S+MAX_CLS_PHIS, + + /* FROM HERE: RESULT VLAUES */ + /* 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 */ + + /* 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 */ + + ASIZE +}; + +/** + * 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; void copystat_init(void) { dbg = firm_dbg_register("ir.be.copystat"); @@ -32,7 +98,6 @@ void copystat_init(void) { all_phi_nodes = pset_new_ptr_default(); all_phi_classes = pset_new_ptr_default(); all_copy_nodes = pset_new_ptr_default(); - phi_class_init(); } void copystat_reset(void) { @@ -50,17 +115,50 @@ void copystat_reset(void) { /** * Collect general data */ -static void stat_walker(ir_node *node, void *env) { +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_Phi(node)) /* collect phis */ + if (is_Reg_Phi(node)) /* collect phis */ pset_insert_ptr(all_phi_nodes, node); - if (is_Copy(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; +} + +/** + * @return 1 if the block at pos @p pos removed a critical edge + * 0 else + */ +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)); + + /* Does bl have several predecessors ?*/ + if (get_irn_arity(bl) <= 1) + return 0; + + /* Does the pred have exactly one predecessor */ + bl_at_pos = get_irn_n(bl, pos); + if (get_irn_arity(bl_at_pos) != 1) + return 0; + + /* Does the pred of the pred have several sucsecessors */ + 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; } /** @@ -68,6 +166,7 @@ static void stat_walker(ir_node *node, void *env) { */ 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 */ @@ -81,19 +180,12 @@ static void stat_phi_node(be_chordal_env_t *chordal_env, ir_node *phi) { 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 (phi != arg) { - curr_vals[I_COPIES_MAX]++; /* if arg!=phi this is a possible copy */ - if (nodes_interfere(chordal_env, phi, arg)) { - DBG((dbg, LEVEL_1, "%e -- In Block %N: %n %N %n %N\n", get_irg_entity(chordal_env->irg), get_nodes_block(phi), phi, phi, arg, arg)); - curr_vals[I_COPIES_IF]++; - } - } - if (arg == phi) { curr_vals[I_PHI_ARG_SELF]++; continue; @@ -104,8 +196,12 @@ static void stat_phi_node(be_chordal_env_t *chordal_env, ir_node *phi) { 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); - block_ith_pred = get_nodes_block(get_irn_n(get_nodes_block(phi), i)); if (block_of_arg == block_ith_pred) { curr_vals[I_PHI_ARG_PRED]++; continue; @@ -131,7 +227,7 @@ static void stat_copy_node(be_chordal_env_t *chordal_env, ir_node *root) { * Collect phi class data */ static void stat_phi_class(be_chordal_env_t *chordal_env, pset *pc) { - int i, o, size, if_free; + int i, o, size, if_free, phis; ir_node **members, *p; /* phi class count */ @@ -146,10 +242,23 @@ static void stat_phi_class(be_chordal_env_t *chordal_env, pset *pc) { /* get an array of all members for double iterating */ members = xmalloc(size * sizeof(*members)); - for (i = 0, p = pset_first(pc); p; p = pset_next(pc)) + 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; @@ -166,17 +275,19 @@ static void stat_phi_class(be_chordal_env_t *chordal_env, pset *pc) { xfree(members); } -void copystat_collect_irg(ir_graph *irg) { - irg_walk_graph(irg, stat_walker, NULL, NULL); - curr_vals[I_BLOCKS] -= 2; /* substract 2 for start and end block */ - all_phi_classes = phi_class_compute_by_phis(all_phi_nodes); -} - -#define is_curr_reg_class(irn) (arch_get_irn_reg_class(chordal_env->arch_env, irn, arch_pos_make_out(0)) == chordal_env->cls) +#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) { ir_node *n; pset *pc; + ir_graph *irg = chordal_env->irg; + + if (last_irg != irg) { + copystat_reset(); + copystat_collect_irg(irg, chordal_env->main_env->arch_env); + } for (n = pset_first(all_phi_nodes); n; n = pset_next(all_phi_nodes)) if (is_curr_reg_class(n)) @@ -194,6 +305,43 @@ void copystat_collect_cls(be_chordal_env_t *chordal_env) { } } +void copystat_add_max_costs(int costs) { + curr_vals[I_COPIES_MAX] += costs; +} +void copystat_add_inevit_costs(int costs) { + curr_vals[I_COPIES_IF] += costs; +} +void copystat_add_init_costs(int costs) { + curr_vals[I_COPIES_INIT] += 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; +} +void copystat_add_heur_time(int time) { + curr_vals[I_HEUR_TIME] += time; +} +void copystat_add_ilp_time(int time) { + curr_vals[I_ILP_TIME] += time; +} +void copystat_add_ilp_vars(int vars) { + curr_vals[I_ILP_VARS] += vars; +} +void copystat_add_ilp_csts(int csts) { + curr_vals[I_ILP_CSTR] += csts; +} +void copystat_add_ilp_iter(int iters) { + curr_vals[I_ILP_ITER] += iters; +} + void copystat_dump(ir_graph *irg) { int i; char buf[1024]; @@ -202,13 +350,15 @@ void copystat_dump(ir_graph *irg) { snprintf(buf, sizeof(buf), "%s__%s", get_irp_prog_name(), get_entity_name(get_irg_entity(irg))); out = ffopen(buf, "stat", "wt"); - fprintf(out, "%s\n", get_irp_prog_name()); + fprintf(out, "%d\n", ASIZE); for (i = 0; i < ASIZE; i++) { +#if 0 if (i >= I_PHI_ARITY_S && i <= I_PHI_ARITY_E) fprintf(out, "%i %i\n", curr_vals[i], curr_vals[I_PHI_CNT]); else if (i >= I_CLS_SIZE_S && i <= I_CLS_SIZE_E) fprintf(out, "%i %i\n", curr_vals[i], curr_vals[I_CLS_CNT]); else +#endif fprintf(out, "%i\n", curr_vals[i]); } @@ -244,6 +394,9 @@ void copystat_dump_pretty(ir_graph *irg) { fprintf(out, "... sizes\n"); for (i = I_CLS_SIZE_S; i<=I_CLS_SIZE_E; i++) fprintf(out, " %2i %4d\n", i-I_CLS_SIZE_S, curr_vals[i]); + fprintf(out, "... contained phis\n"); + for (i = I_CLS_PHIS_S; i<=I_CLS_PHIS_E; i++) + fprintf(out, " %2i %4d\n", i-I_CLS_PHIS_S, curr_vals[i]); fprintf(out, "\nILP stat\n"); fprintf(out, " Time %8d\n", curr_vals[I_ILP_TIME]);