X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbecopystat.c;h=2d7fcce0369db5a4cae247b54d5c67cb1929093c;hb=ea49f59b7723e700c720cc89c26864e68c113237;hp=6a8e28529ca9767cf5fc77452a4588d986ca9a8f;hpb=3054bbf2e0a2dcd89beadd0448dd3298105f529a;p=libfirm diff --git a/ir/be/becopystat.c b/ir/be/becopystat.c index 6a8e28529..2d7fcce03 100644 --- a/ir/be/becopystat.c +++ b/ir/be/becopystat.c @@ -1,216 +1,279 @@ +/* + * This file is part of libFirm. + * Copyright (C) 2012 University of Karlsruhe. + */ + /** - * @author Daniel Grund - * @date 19.04.2005 + * @file + * @brief Copy node statistics. + * @author Daniel Grund + * @date 19.04.2005 */ -#ifdef HAVE_CONFIG_H #include "config.h" -#endif #include -#include "phiclass_t.h" + +#include "timing.h" +#include "irgraph.h" +#include "irgwalk.h" #include "irprog.h" -#include "becopyopt.h" -#include "becopystat.h" -#include "xmalloc.h" +#include "iredges_t.h" +#include "irnodeset.h" -#ifdef DO_STAT +#include "bechordal_t.h" +#include "benode.h" +#include "beutil.h" +#include "becopyopt_t.h" +#include "becopystat.h" +#include "bemodule.h" +#include "beintlive_t.h" -static pset *all_phi_nodes; -static pset *all_phi_classes; -static pset *all_copy_nodes; +#define DEBUG_LVL SET_LEVEL_1 +DEBUG_ONLY(static firm_dbg_module_t *dbg = NULL;) -void stat_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(); -} +#define MAX_ARITY 20 +#define MAX_CLS_SIZE 20 +#define MAX_CLS_PHIS 20 -void stat_reset(void) { - int i; - for (i = 0; i < ASIZE; ++i) - curr_vals[i] = 0; -} +/** + * 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 +}; /** - * Collect general data + * Holds current values. Values are added till next copystat_reset */ -static void stat_walker(ir_node *node, void *env) { - curr_vals[I_ALL_NODES]++; /* count all nodes */ +static int curr_vals[ASIZE]; - if (is_Block(node)) /* count all blocks */ - curr_vals[I_BLOCKS]++; +static ir_nodeset_t *all_phi_nodes; +static ir_nodeset_t *all_copy_nodes; - if (is_Phi(node)) /* collect phis */ - pset_insert_ptr(all_phi_nodes, node); +BE_REGISTER_MODULE_CONSTRUCTOR(be_init_copystat) +void be_init_copystat(void) +{ + FIRM_DBG_REGISTER(dbg, "firm.be.copystat"); - if (is_Copy(node)) - pset_insert_ptr(all_copy_nodes, node); + all_phi_nodes = ir_nodeset_new(64); + all_copy_nodes = ir_nodeset_new(64); + memset(curr_vals, 0, sizeof(curr_vals)); } -/** - * Collect phi node data - */ -static void stat_phi_node(ir_node *phi) { - int arity, i; - - /* 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]++; - - /* 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; - } - - curr_vals[I_COPIES_MAX]++; /* if arg!=phi this is a possible copy */ - - if (values_interfere(phi, arg)) - curr_vals[I_COPIES_IF]++; - - if (iro_Const == get_irn_opcode(arg)) { - curr_vals[I_PHI_ARG_CONST]++; - continue; - } - - 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; - } - - curr_vals[I_PHI_ARG_GLOB]++; +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; } } /** - * Collect register-constrained node data + * @return 1 if the block at pos @p pos removed a critical edge + * 0 else */ -//TODO stat_copy_node -static void stat_copy_node(ir_node *root) { - curr_vals[I_CPY_CNT]++; -// if (values_interfere(root, arg)) -// curr_vals[I_COPIES_IF]++; +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; + + /* Does bl have several predecessors ?*/ + if (get_Block_n_cfgpreds(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 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 class data - */ -static void stat_phi_class(pset *pc) { - int i, o, size, if_free; - 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)); - for (i = 0, p = pset_first(pc); p; p = pset_next(pc)) - members[i++] = p; - assert(i == size); - - /* 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 (values_interfere(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_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_opt_costs(int costs) +{ + curr_vals[I_COPIES_OPT] += costs; +} +void copystat_add_heur_time(int time) +{ + curr_vals[I_HEUR_TIME] += time; } -void stat_collect_irg(ir_graph *irg) { - ir_node *n; - pset *pc; - - 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); - - for (n = pset_first(all_phi_nodes); n; n = pset_next(all_phi_nodes)) - stat_phi_node(n); - - for (n = pset_first(all_copy_nodes); n; n = pset_next(all_copy_nodes)) - stat_copy_node(n); +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) +{ + 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; +} - for (pc = pset_first(all_phi_classes); pc; pc = pset_next(all_phi_classes)) - stat_phi_class(pc); +/** + * 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 stat_dump(ir_graph *irg) { +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))); - FILE *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, "%s\n", get_irp_prog_name()); + fprintf(out, "%d\n", (int)ASIZE); for (i = 0; i < ASIZE; i++) { - 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 - fprintf(out, "%i\n", curr_vals[i]); + fprintf(out, "%i\n", curr_vals[i]); } - fclose(out); + fclose(out); } -//TODO stat_dump_pretty -void stat_dump_pretty(ir_graph *irg) { +void copystat_dump_pretty(ir_graph *irg) +{ int i; - FILE *out = ffopen(get_entity_name(get_irg_entity(irg)), "pretty", "wt"); - - fprintf(out, "\nPhi argument types\n"); - fprintf(out, "Total %4d\n", curr_vals[I_PHI_ARG_CNT]); - fprintf(out, "Constants %4d\n", curr_vals[I_PHI_ARG_CONST]); - fprintf(out, "CF-Pred %4d\n", curr_vals[I_PHI_ARG_PRED]); - fprintf(out, "Others %4d\n", curr_vals[I_PHI_ARG_GLOB]); - - fprintf(out, "\nPhi class interference\n"); - fprintf(out, "Blocks %4d\n", curr_vals[I_BLOCKS]); - fprintf(out, "Phis %4d\n", curr_vals[I_PHI_CNT]); - - fprintf(out, "\nPhi arity\n"); + char buf[1024]; + FILE *out; + + 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]); + fprintf(out, "CopyIrn %4d\n", curr_vals[I_CPY_CNT]); + + fprintf(out, "\nPhis %4d\n", curr_vals[I_PHI_CNT]); + fprintf(out, "... argument types\n"); + fprintf(out, " Total %4d\n", curr_vals[I_PHI_ARG_CNT]); + fprintf(out, " Self %4d\n", curr_vals[I_PHI_ARG_SELF]); + fprintf(out, " Constants %4d\n", curr_vals[I_PHI_ARG_CONST]); + fprintf(out, " CF-Pred %4d\n", curr_vals[I_PHI_ARG_PRED]); + fprintf(out, " Others %4d\n", curr_vals[I_PHI_ARG_GLOB]); + fprintf(out, "... arities\n"); for (i = I_PHI_ARITY_S; i<=I_PHI_ARITY_E; i++) - fprintf(out, "%2i %4d\n", i-I_PHI_ARITY_S, curr_vals[i]); + fprintf(out, " %2i %4d\n", i-I_PHI_ARITY_S, curr_vals[i]); - fprintf(out, "\nPhi class sizes\n"); + fprintf(out, "\nPhi classes %4d\n", curr_vals[I_CLS_CNT]); + fprintf(out, " compl. free %4d\n", curr_vals[I_CLS_IF_FREE]); + fprintf(out, " inner intf. %4d / %4d\n", curr_vals[I_CLS_IF_CNT], curr_vals[I_CLS_IF_MAX]); + 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, "\n\nTotal nodes: %4d\n", curr_vals[I_ALL_NODES]); + 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]); + fprintf(out, " Iter %8d\n", curr_vals[I_ILP_ITER]); + + fprintf(out, "\nCopy stat\n"); + fprintf(out, " Max %4d\n", curr_vals[I_COPIES_MAX]); + fprintf(out, " Init %4d\n", curr_vals[I_COPIES_INIT]); + fprintf(out, " Heur %4d\n", curr_vals[I_COPIES_HEUR]); + fprintf(out, " Opt %4d\n", curr_vals[I_COPIES_OPT]); + fprintf(out, " Intf %4d\n", curr_vals[I_COPIES_IF]); fclose(out); } - -#endif