X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbecopystat.c;h=c7e665231c0cd671e0730cd63f3f123952724084;hb=cf946e20e9cac9f8e42e7a1fc93886a75db7a80c;hp=f2023926687331d9b38fb25430e821d4f5bfd8e3;hpb=5f838fb985ea51236990ec8a17693a3052abb936;p=libfirm diff --git a/ir/be/becopystat.c b/ir/be/becopystat.c index f20239266..c7e665231 100644 --- a/ir/be/becopystat.c +++ b/ir/be/becopystat.c @@ -1,27 +1,51 @@ +/* + * 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 + * @version $Id$ */ -#ifdef HAVE_CONFIG_H #include "config.h" -#endif #include + +#include "timing.h" #include "irgraph.h" +#include "irgwalk.h" #include "irprog.h" -#include "iredges.h" -#include "phiclass_t.h" +#include "iredges_t.h" +#include "irnodeset.h" + +#include "bechordal_t.h" +#include "benode.h" #include "beutil.h" -#include "becopyopt.h" +#include "becopyopt_t.h" #include "becopystat.h" -#include "xmalloc.h" - -#ifdef DO_STAT +#include "beirg.h" +#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 @@ -65,8 +89,8 @@ enum vals_t { /* 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_VARS, + I_ILP_CSTR, I_ILP_ITER, /* number of simplex iterations */ /* copy instructions */ @@ -86,60 +110,29 @@ enum vals_t { */ 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 ir_nodeset_t *all_phi_nodes; +static ir_nodeset_t *all_copy_nodes; -void copystat_init(void) { - dbg = firm_dbg_register("ir.be.copystat"); - firm_dbg_set_mask(dbg, DEBUG_LVL); +void be_init_copystat(void) { + FIRM_DBG_REGISTER(dbg, "firm.be.copystat"); - 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)); } +BE_REGISTER_MODULE_CONSTRUCTOR(be_init_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(); -} - -/** - * 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_Copy(arch_env, node)) - pset_insert_ptr(all_copy_nodes, node); -} - -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; +void be_quit_copystat(void) { + ir_nodeset_del(all_phi_nodes); + ir_nodeset_del(all_copy_nodes); } +BE_REGISTER_MODULE_DESTRUCTOR(be_quit_copystat); /** * @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) { +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)); @@ -153,156 +146,12 @@ 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); -} - -#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)) - stat_phi_node(chordal_env, 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); - - 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); - } -} - void copystat_add_max_costs(int costs) { curr_vals[I_COPIES_MAX] += costs; } @@ -327,6 +176,9 @@ void copystat_add_opt_costs(int costs) { void copystat_add_heur_time(int time) { curr_vals[I_HEUR_TIME] += time; } + +#ifdef WITH_ILP + void copystat_add_ilp_time(int time) { curr_vals[I_ILP_TIME] += time; } @@ -340,13 +192,16 @@ void copystat_add_ilp_iter(int iters) { curr_vals[I_ILP_ITER] += iters; } +#endif /* WITH_ILP */ + 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); for (i = 0; i < ASIZE; i++) { @@ -360,7 +215,7 @@ void copystat_dump(ir_graph *irg) { fprintf(out, "%i\n", curr_vals[i]); } - fclose(out); + fclose(out); } void copystat_dump_pretty(ir_graph *irg) { @@ -368,8 +223,9 @@ void copystat_dump_pretty(ir_graph *irg) { 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]); @@ -409,5 +265,3 @@ void copystat_dump_pretty(ir_graph *irg) { fclose(out); } - -#endif