nsz Git - libfirm/blob - ir/be/becopystat.c

   1 /**
   2  * Author:      Daniel Grund
   3  * Date:                19.04.2005
   4  * Copyright:   (c) Universitaet Karlsruhe
   5  * Licence:     This file protected by GPL -  GNU GENERAL PUBLIC LICENSE.
   6  */
   7 #ifdef HAVE_CONFIG_H
   8 #include "config.h"
   9 #endif
  10
  11 #include <string.h>
  12 #include "irgraph.h"
  13 #include "irprog.h"
  14 #include "phiclass_t.h"
  15 #include "becopyopt.h"
  16 #include "becopystat.h"
  17 #include "xmalloc.h"
  18
  19 #ifdef DO_STAT
  20
  21 #define DEBUG_LVL 0 //SET_LEVEL_1
  22 static firm_dbg_module_t *dbg = NULL;
  23
  24 static pset *all_phi_nodes;
  25 static pset *all_phi_classes;
  26 static pset *all_copy_nodes;
  27
  28 void copystat_init(void) {
  29         dbg = firm_dbg_register("ir.be.copystat");
  30         firm_dbg_set_mask(dbg, DEBUG_LVL);
  31
  32         all_phi_nodes = pset_new_ptr_default();
  33         all_phi_classes = pset_new_ptr_default();
  34         all_copy_nodes = pset_new_ptr_default();
  35         phi_class_init();
  36 }
  37
  38 void copystat_reset(void) {
  39         int i;
  40         for (i = 0; i < ASIZE; ++i)
  41                 curr_vals[i] = 0;
  42         del_pset(all_phi_nodes);
  43         del_pset(all_phi_classes);
  44         del_pset(all_copy_nodes);
  45         all_phi_nodes = pset_new_ptr_default();
  46         all_phi_classes = pset_new_ptr_default();
  47         all_copy_nodes = pset_new_ptr_default();
  48 }
  49
  50 /**
  51  * Collect general data
  52  */
  53 static void irg_stat_walker(ir_node *node, void *env) {
  54         arch_env_t *arch_env = env;
  55         curr_vals[I_ALL_NODES]++; /* count all nodes */
  56
  57         if (is_Block(node)) /* count all blocks */
  58                 curr_vals[I_BLOCKS]++;
  59
  60         if (is_Phi(node)) /* collect phis */
  61                 pset_insert_ptr(all_phi_nodes, node);
  62
  63         if (is_Copy(arch_env, node))
  64                 pset_insert_ptr(all_copy_nodes, node);
  65 }
  66
  67 void copystat_collect_irg(ir_graph *irg, arch_env_t *arch_env) {
  68         irg_walk_graph(irg, irg_stat_walker, NULL, arch_env);
  69         curr_vals[I_BLOCKS] -= 2; /* substract 2 for start and end block */
  70         all_phi_classes = phi_class_compute_by_phis(all_phi_nodes);
  71 }
  72
  73 /**
  74  * Collect phi node data
  75  */
  76 static void stat_phi_node(be_chordal_env_t *chordal_env, ir_node *phi) {
  77         int arity, i;
  78         assert(is_Phi(phi));
  79
  80         /* count all phi phis */
  81         curr_vals[I_PHI_CNT]++;
  82
  83         /* argument count */
  84         arity = get_irn_arity(phi);
  85         curr_vals[I_PHI_ARG_CNT] += arity;
  86         if (arity > MAX_ARITY)
  87                 curr_vals[I_PHI_ARITY_E]++;
  88         else
  89                 curr_vals[I_PHI_ARITY_S + arity]++;
  90
  91         /* type of argument {self, const, pred, glob} */
  92         for (i = 0; i < arity; i++) {
  93         ir_node *block_of_arg, *block_ith_pred;
  94                 ir_node *arg = get_irn_n(phi, i);
  95
  96                 if (phi != arg) {
  97                         curr_vals[I_COPIES_MAX]++; /* if arg!=phi this is a possible copy */
  98                         if (nodes_interfere(chordal_env, phi, arg)) {
  99                                 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));
 100                                 curr_vals[I_COPIES_IF]++;
 101                         }
 102                 }
 103
 104                 if (arg == phi) {
 105                         curr_vals[I_PHI_ARG_SELF]++;
 106                         continue;
 107                 }
 108
 109                 if (iro_Const == get_irn_opcode(arg)) {
 110                         curr_vals[I_PHI_ARG_CONST]++;
 111                         continue;
 112                 }
 113
 114                 block_of_arg = get_Block_cfgpred_block(get_nodes_block(phi), i);
 115                 block_ith_pred = get_nodes_block(get_irn_n(get_nodes_block(phi), i));
 116                 if (block_of_arg == block_ith_pred) {
 117                         curr_vals[I_PHI_ARG_PRED]++;
 118                         continue;
 119                 }
 120
 121                 curr_vals[I_PHI_ARG_GLOB]++;
 122         }
 123 }
 124
 125 /**
 126  * Collect register-constrained node data
 127  */
 128 static void stat_copy_node(be_chordal_env_t *chordal_env, ir_node *root) {
 129         curr_vals[I_CPY_CNT]++;
 130         curr_vals[I_COPIES_MAX]++;
 131         if (nodes_interfere(chordal_env, root, get_Copy_src(root))) {
 132                 curr_vals[I_COPIES_IF]++;
 133                 assert(0 && "A Perm pair (in/out) should never interfere!");
 134         }
 135 }
 136
 137 /**
 138  * Collect phi class data
 139  */
 140 static void stat_phi_class(be_chordal_env_t *chordal_env, pset *pc) {
 141         int i, o, size, if_free, phis;
 142         ir_node **members, *p;
 143
 144         /* phi class count */
 145         curr_vals[I_CLS_CNT]++;
 146
 147         /* phi class size */
 148         size = pset_count(pc);
 149         if (size > MAX_CLS_SIZE)
 150                 curr_vals[I_CLS_SIZE_E]++;
 151         else
 152                 curr_vals[I_CLS_SIZE_S + size]++;
 153
 154         /* get an array of all members for double iterating */
 155         members = xmalloc(size * sizeof(*members));
 156         for (i = 0, p = pset_first(pc); p; p = pset_next(pc))
 157                 members[i++] = p;
 158         assert(i == size);
 159
 160         /* determine number of phis on this class */
 161         phis = 0;
 162         for (i = 0; i < size-1; ++i)
 163                 if (is_Phi(members[i]))
 164                         phis++;
 165         if (phis > MAX_CLS_PHIS)
 166                 curr_vals[I_CLS_PHIS_E]++;
 167         else
 168                 curr_vals[I_CLS_PHIS_S + phis]++;
 169
 170         /* determine interference of phi class members */
 171         curr_vals[I_CLS_IF_MAX] += size*(size-1)/2;
 172         if_free = 1;
 173         for (i = 0; i < size-1; ++i)
 174                 for (o = i+1; o < size; ++o)
 175                         if (nodes_interfere(chordal_env, members[i], members[o])) {
 176                                 if_free = 0;
 177                                 curr_vals[I_CLS_IF_CNT]++;
 178                         }
 179
 180         /* Does this phi class have an inner interference? */
 181         curr_vals[I_CLS_IF_FREE] += if_free;
 182
 183         xfree(members);
 184 }
 185
 186 #define is_curr_reg_class(irn) (arch_get_irn_reg_class(chordal_env->arch_env, irn, arch_pos_make_out(0)) == chordal_env->cls)
 187
 188 void copystat_collect_cls(be_chordal_env_t *chordal_env) {
 189         ir_node *n;
 190         pset *pc;
 191
 192         for (n = pset_first(all_phi_nodes); n; n = pset_next(all_phi_nodes))
 193                 if (is_curr_reg_class(n))
 194                         stat_phi_node(chordal_env, n);
 195
 196         for (n = pset_first(all_copy_nodes); n; n = pset_next(all_copy_nodes))
 197                 if (is_curr_reg_class(n))
 198                         stat_copy_node(chordal_env, n);
 199
 200         for (pc = pset_first(all_phi_classes); pc; pc = pset_next(all_phi_classes)) {
 201                 ir_node *member = pset_first(pc);
 202                 pset_break(pc);
 203                 if (is_curr_reg_class(member))
 204                         stat_phi_class(chordal_env, pc);
 205         }
 206 }
 207
 208 void copystat_dump(ir_graph *irg) {
 209         int i;
 210         char buf[1024];
 211         FILE *out;
 212
 213         snprintf(buf, sizeof(buf), "%s__%s", get_irp_prog_name(), get_entity_name(get_irg_entity(irg)));
 214         out = ffopen(buf, "stat", "wt");
 215
 216         fprintf(out, "%s\n", get_irp_prog_name());
 217         for (i = 0; i < ASIZE; i++) {
 218                 if (i >= I_PHI_ARITY_S && i <= I_PHI_ARITY_E)
 219                         fprintf(out, "%i %i\n", curr_vals[i], curr_vals[I_PHI_CNT]);
 220                 else if (i >= I_CLS_SIZE_S && i <= I_CLS_SIZE_E)
 221                         fprintf(out, "%i %i\n", curr_vals[i], curr_vals[I_CLS_CNT]);
 222                 else
 223                         fprintf(out, "%i\n", curr_vals[i]);
 224         }
 225
 226     fclose(out);
 227 }
 228
 229 void copystat_dump_pretty(ir_graph *irg) {
 230         int i;
 231         char buf[1024];
 232         FILE *out;
 233
 234         snprintf(buf, sizeof(buf), "%s__%s", get_irp_prog_name(), get_entity_name(get_irg_entity(irg)));
 235         out = ffopen(buf, "pstat", "wt");
 236
 237         fprintf(out, "Nodes     %4d\n", curr_vals[I_ALL_NODES]);
 238         fprintf(out, "Blocks    %4d\n", curr_vals[I_BLOCKS]);
 239         fprintf(out, "CopyIrn   %4d\n", curr_vals[I_CPY_CNT]);
 240
 241         fprintf(out, "\nPhis      %4d\n", curr_vals[I_PHI_CNT]);
 242         fprintf(out, "... argument types\n");
 243         fprintf(out, " Total      %4d\n", curr_vals[I_PHI_ARG_CNT]);
 244         fprintf(out, " Self       %4d\n", curr_vals[I_PHI_ARG_SELF]);
 245         fprintf(out, " Constants  %4d\n", curr_vals[I_PHI_ARG_CONST]);
 246         fprintf(out, " CF-Pred    %4d\n", curr_vals[I_PHI_ARG_PRED]);
 247         fprintf(out, " Others     %4d\n", curr_vals[I_PHI_ARG_GLOB]);
 248         fprintf(out, "... arities\n");
 249         for (i = I_PHI_ARITY_S; i<=I_PHI_ARITY_E; i++)
 250                 fprintf(out, " %2i %4d\n", i-I_PHI_ARITY_S, curr_vals[i]);
 251
 252         fprintf(out, "\nPhi classes   %4d\n", curr_vals[I_CLS_CNT]);
 253         fprintf(out, " compl. free  %4d\n", curr_vals[I_CLS_IF_FREE]);
 254         fprintf(out, " inner intf.  %4d / %4d\n", curr_vals[I_CLS_IF_CNT], curr_vals[I_CLS_IF_MAX]);
 255         fprintf(out, "... sizes\n");
 256         for (i = I_CLS_SIZE_S; i<=I_CLS_SIZE_E; i++)
 257                 fprintf(out, " %2i %4d\n", i-I_CLS_SIZE_S, curr_vals[i]);
 258         fprintf(out, "... contained phis\n");
 259         for (i = I_CLS_PHIS_S; i<=I_CLS_PHIS_E; i++)
 260                 fprintf(out, " %2i %4d\n", i-I_CLS_PHIS_S, curr_vals[i]);
 261
 262         fprintf(out, "\nILP stat\n");
 263         fprintf(out, " Time %8d\n", curr_vals[I_ILP_TIME]);
 264         fprintf(out, " Iter %8d\n", curr_vals[I_ILP_ITER]);
 265
 266         fprintf(out, "\nCopy stat\n");
 267         fprintf(out, " Max  %4d\n", curr_vals[I_COPIES_MAX]);
 268         fprintf(out, " Init %4d\n", curr_vals[I_COPIES_INIT]);
 269         fprintf(out, " Heur %4d\n", curr_vals[I_COPIES_HEUR]);
 270         fprintf(out, " Opt  %4d\n", curr_vals[I_COPIES_OPT]);
 271         fprintf(out, " Intf %4d\n", curr_vals[I_COPIES_IF]);
 272
 273         fclose(out);
 274 }
 275
 276 #endif