X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbecopystat.c;h=d3447c4ce82175dd26e3ff1463d0f15e1cf749ea;hb=07ea816fa30005a2e1e94171090327233e05a112;hp=77211647967e64b7019241b293bf6d7fbf4dec96;hpb=ad8d083988ca94d6d0370f172533112f592f62df;p=libfirm diff --git a/ir/be/becopystat.c b/ir/be/becopystat.c index 772116479..d3447c4ce 100644 --- a/ir/be/becopystat.c +++ b/ir/be/becopystat.c @@ -1,109 +1,307 @@ +/* + * 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 + * @file + * @brief Copy node statistics. + * @author Daniel Grund + * @date 19.04.2005 + * @version $Id$ */ -#include -#include "list.h" +#include "config.h" + +#include + +#include "timing.h" +#include "irgraph.h" +#include "irgwalk.h" #include "irprog.h" +#include "iredges_t.h" +#include "irnodeset.h" + +#include "bechordal_t.h" +#include "benode.h" #include "beutil.h" +#include "becopyopt_t.h" #include "becopystat.h" +#include "beirg.h" +#include "bemodule.h" +#include "beintlive_t.h" + +#define DEBUG_LVL SET_LEVEL_1 +DEBUG_ONLY(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 */ -struct _irg_stat_t { - struct list_head chain; - ir_graph *irg; - const char *irg_name; - int interferers, lb, max; - int copies[3]; - //TODO double ilp_time; + /* 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 }; -typedef struct _all_stat_t { - const char *unit_name; - struct list_head irgs; -} all_stat_t; +/** + * Holds current values. Values are added till next copystat_reset + */ +int curr_vals[ASIZE]; -static all_stat_t *all_stats = NULL; +static ir_nodeset_t *all_phi_nodes; +static ir_nodeset_t *all_copy_nodes; -#define irg_list_entry(lh) list_entry(lh, irg_stat_t, chain) +BE_REGISTER_MODULE_CONSTRUCTOR(be_init_copystat) +void be_init_copystat(void) +{ + FIRM_DBG_REGISTER(dbg, "firm.be.copystat"); -irg_stat_t *new_irg_stat(copy_opt_t *co) { - irg_stat_t *is, *curr; + all_phi_nodes = ir_nodeset_new(64); + all_copy_nodes = ir_nodeset_new(64); + memset(curr_vals, 0, sizeof(curr_vals)); +} - if (!all_stats) { - all_stats = calloc(1, sizeof(*all_stats)); - all_stats->unit_name = get_irp_prog_name(); - INIT_LIST_HEAD(&all_stats->irgs); - is = calloc(1, sizeof(*is)); - is->irg_name = "CUMULATIVE"; - list_add_tail(&is->chain, &all_stats->irgs); +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; } - - /* look if we had this irg already */ - list_for_each_entry(irg_stat_t, curr, &all_stats->irgs, chain) - if (curr->irg == co->irg) - return curr; - - /* else create a new entry */ - is = calloc(1, sizeof(*is)); - is->irg = co->irg; - is->irg_name = get_entity_name(get_irg_entity(co->irg)); - list_add_tail(&is->chain, &all_stats->irgs); - return is; -} - -void irg_stat_count(irg_stat_t *is, copy_opt_t *co, int phase) { - unit_t *curr; - int max = 0, copies = 0; - - list_for_each_entry(unit_t, curr, &co->units, units) { - int i; - max += curr->interf + curr->node_count - 1; - const ir_node *root = curr->nodes[0]; - int root_color = get_irn_color(root); - copies += curr->interf; - for (i=1; inode_count; ++i) { - const ir_node *arg = curr->nodes[i]; - if (root_color != get_irn_color(arg)) - copies++; - } + if (all_copy_nodes != NULL) { + ir_nodeset_del(all_copy_nodes); + all_copy_nodes = NULL; } +} - is->copies[phase] += copies; - if (phase == 0) - is->max += max; - if (phase == 1) { - is->interferers += co_get_interferer_count(co); - is->lb += co_get_lower_bound(co); - } +/** + * @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 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; +} + +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 irg_stat_print(irg_stat_t *is) { - printf("Irg %s: %3d %3d %3d %3d %3d %3d", is->irg_name, is->interferers, is->lb, is->copies[0], is->copies[1], is->copies[2], is->max); +#ifdef WITH_ILP + +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; } -void all_stat_dump(void) { +#endif /* WITH_ILP */ + +/** + * 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; - irg_stat_t *cuml, *curr; - /* Compute cumulative values */ - cuml = irg_list_entry(all_stats->irgs.next); - cuml->interferers = 0; - cuml->lb = 0; - cuml->max = 0; - cuml->copies[0] = 0; - cuml->copies[1] = 0; - cuml->copies[2] = 0; - list_for_each_entry(irg_stat_t, curr, &all_stats->irgs, chain) { - int i = 0; - cuml->interferers += curr->interferers; - cuml->lb += curr->lb; - cuml->max += curr->max; - for (i=0; i<3; ++i) - cuml->copies[i] += curr->copies[i]; + 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_name(), get_entity_name(get_irg_entity(irg))); + buf[sizeof(buf) - 1] = '\0'; + out = be_ffopen(buf, "stat", "wt"); + + 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) + 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]); + } + + fclose(out); +} + +void copystat_dump_pretty(ir_graph *irg) +{ + int i; + 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, "\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, "... 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]); - /* dump to file */ - out = ffopen(all_stats->unit_name, "stats", "wt"); - list_for_each_entry(irg_stat_t, curr, &all_stats->irgs, chain) - fprintf(out, "%15s %3d %3d %3d %3d %3d %3d", curr->irg_name, curr->interferers, curr->lb, curr->copies[0], curr->copies[1], curr->copies[2], curr->max); fclose(out); }