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

   1 /**
   2  * @author Daniel Grund
   3  * @date 19.04.2005
   4  */
   5 #include <string.h>
   6 #include "phiclass_t.h"
   7 #include "irprog.h"
   8 #include "becopyopt.h"
   9 #include "becopystat.h"
  10
  11 #ifdef DO_STAT
  12
  13 static pset *all_phi_nodes;
  14 static pset *all_phi_classes;
  15 static pset *all_copy_nodes;
  16
  17 void stat_init(void) {
  18         all_phi_nodes = pset_new_ptr_default();
  19         all_phi_classes = pset_new_ptr_default();
  20         all_copy_nodes = pset_new_ptr_default();
  21         phi_class_init();
  22 }
  23
  24 void stat_reset(void) {
  25         int i;
  26         for (i = 0; i < ASIZE; ++i)
  27                 curr_vals[i] = 0;
  28 }
  29
  30 /**
  31  * Collect general data
  32  */
  33 static void stat_walker(ir_node *node, void *env) {
  34         curr_vals[I_ALL_NODES]++; /* count all nodes */
  35
  36         if (is_Block(node)) /* count all blocks */
  37                 curr_vals[I_BLOCKS]++;
  38
  39         if (is_Phi(node)) /* collect phis */
  40                 pset_insert_ptr(all_phi_nodes, node);
  41
  42         if (is_Copy(node))
  43                 pset_insert_ptr(all_copy_nodes, node);
  44 }
  45
  46 /**
  47  * Collect phi node data
  48  */
  49 static void stat_phi_node(ir_node *phi) {
  50         int arity, i;
  51
  52         /* count all phi phis */
  53         curr_vals[I_PHI_CNT]++;
  54
  55         /* argument count */
  56         arity = get_irn_arity(phi);
  57         curr_vals[I_PHI_ARG_CNT] += arity;
  58         if (arity > MAX_ARITY)
  59                 curr_vals[I_PHI_ARITY_E]++;
  60         else
  61                 curr_vals[I_PHI_ARITY_S + arity]++;
  62
  63         /* type of argument {self, const, pred, glob} */
  64         for (i = 0; i < arity; i++) {
  65         ir_node *block_of_arg, *block_ith_pred;
  66                 ir_node *arg = get_irn_n(phi, i);
  67
  68                 if (arg == phi) {
  69                         curr_vals[I_PHI_ARG_SELF]++;
  70                         continue;
  71                 }
  72
  73                 curr_vals[I_COPIES_MAX]++; /* if arg!=phi this is a possible copy */
  74
  75                 if (values_interfere(phi, arg))
  76                         curr_vals[I_COPIES_IF]++;
  77
  78                 if (iro_Const == get_irn_opcode(arg)) {
  79                         curr_vals[I_PHI_ARG_CONST]++;
  80                         continue;
  81                 }
  82
  83                 block_of_arg = get_nodes_block(arg);
  84                 block_ith_pred = get_nodes_block(get_irn_n(get_nodes_block(phi), i));
  85                 if (block_of_arg == block_ith_pred) {
  86                         curr_vals[I_PHI_ARG_PRED]++;
  87                         continue;
  88                 }
  89
  90                 curr_vals[I_PHI_ARG_GLOB]++;
  91         }
  92 }
  93
  94 /**
  95  * Collect register-constrained node data
  96  */
  97 //TODO stat_copy_node
  98 static void stat_copy_node(ir_node *root) {
  99 //      if (values_interfere(root, arg))
 100 //              curr_vals[I_COPIES_IF]++;
 101 }
 102
 103 /**
 104  * Collect phi class data
 105  */
 106 static void stat_phi_class(pset *pc) {
 107         int i, o, size, if_free;
 108         ir_node **members, *p;
 109
 110         /* phi class count */
 111         curr_vals[I_CLS_CNT]++;
 112
 113         /* phi class size */
 114         size = pset_count(pc);
 115         if (size > MAX_CLS_SIZE)
 116                 curr_vals[I_CLS_SIZE_E]++;
 117         else
 118                 curr_vals[I_CLS_SIZE_S + size]++;
 119
 120         /* get an array of all members for double iterating */
 121         members = malloc(size * sizeof(*members));
 122         for (i = 0, p = pset_first(pc); p; p = pset_next(pc))
 123                 members[i++] = p;
 124         assert(i == size);
 125
 126         /* determine interference of phi class members */
 127         curr_vals[I_CLS_IF_MAX] += size*(size-1)/2;
 128         if_free = 1;
 129         for (i = 0; i < size-1; ++i)
 130                 for (o = i+1; o < size; ++o)
 131                         if (values_interfere(members[i], members[o])) {
 132                                 if_free = 0;
 133                                 curr_vals[I_CLS_IF_CNT]++;
 134                         }
 135
 136         /* Does this phi class have an inner interference? */
 137         curr_vals[I_CLS_IF_FREE] += if_free;
 138
 139         free(members);
 140 }
 141
 142 void stat_collect_irg(ir_graph *irg) {
 143         ir_node *n;
 144         pset *pc;
 145
 146         irg_walk_graph(irg, stat_walker, NULL, NULL);
 147         curr_vals[I_BLOCKS] -= 2; /* substract 2 for start and end block */
 148
 149         all_phi_classes = phi_class_compute_by_phis(all_phi_nodes);
 150
 151         for (n = pset_first(all_phi_nodes); n; n = pset_next(all_phi_nodes))
 152                 stat_phi_node(n);
 153
 154         for (n = pset_first(all_copy_nodes); n; n = pset_next(all_copy_nodes))
 155                 stat_copy_node(n);
 156
 157         for (pc = pset_first(all_phi_classes); pc; pc = pset_next(all_phi_classes))
 158                 stat_phi_class(pc);
 159
 160 }
 161
 162 void stat_dump(ir_graph *irg) {
 163         int i;
 164         FILE *out = ffopen(get_entity_name(get_irg_entity(irg)), "stat", "wt");
 165
 166         fprintf(out, "%s\n", get_irp_prog_name());
 167         for (i = 0; i < ASIZE; i++) {
 168                 if (i >= I_PHI_ARITY_S && i <= I_PHI_ARITY_E)
 169                         fprintf(out, "%i %i\n", curr_vals[i], curr_vals[I_PHI_CNT]);
 170                 else if (i >= I_CLS_SIZE_S && i <= I_CLS_SIZE_E)
 171                         fprintf(out, "%i %i\n", curr_vals[i], curr_vals[I_CLS_CNT]);
 172                 else
 173                         fprintf(out, "%i\n", curr_vals[i]);
 174         }
 175
 176     fclose(out);
 177 }
 178
 179 //TODO stat_dump_pretty
 180 void stat_dump_pretty(ir_graph *irg) {
 181         int i;
 182         FILE *out = ffopen(get_entity_name(get_irg_entity(irg)), "pretty", "wt");
 183
 184         fprintf(out, "\nPhi argument types\n");
 185         fprintf(out, "Total     %4d\n", curr_vals[I_PHI_ARG_CNT]);
 186         fprintf(out, "Constants %4d\n", curr_vals[I_PHI_ARG_CONST]);
 187         fprintf(out, "CF-Pred   %4d\n", curr_vals[I_PHI_ARG_PRED]);
 188         fprintf(out, "Others    %4d\n", curr_vals[I_PHI_ARG_GLOB]);
 189
 190         fprintf(out, "\nPhi class interference\n");
 191         fprintf(out, "Blocks         %4d\n", curr_vals[I_BLOCKS]);
 192         fprintf(out, "Phis           %4d\n", curr_vals[I_PHI_CNT]);
 193
 194         fprintf(out, "\nPhi arity\n");
 195         for (i = I_PHI_ARITY_S; i<=I_PHI_ARITY_E; i++)
 196                 fprintf(out, "%2i %4d\n", i-I_PHI_ARITY_S, curr_vals[i]);
 197
 198         fprintf(out, "\nPhi class sizes\n");
 199         for (i = I_CLS_SIZE_S; i<=I_CLS_SIZE_E; i++)
 200                 fprintf(out, "%2i %4d\n", i-I_CLS_SIZE_S, curr_vals[i]);
 201
 202         fprintf(out, "\n\nTotal nodes:    %4d\n", curr_vals[I_ALL_NODES]);
 203
 204         fclose(out);
 205 }
 206
 207 #endif