nsz Git - libfirm/blob - ir/stat/firmstat.c

   1 /*
   2  * Copyright (C) 1995-2008 University of Karlsruhe.  All right reserved.
   3  *
   4  * This file is part of libFirm.
   5  *
   6  * This file may be distributed and/or modified under the terms of the
   7  * GNU General Public License version 2 as published by the Free Software
   8  * Foundation and appearing in the file LICENSE.GPL included in the
   9  * packaging of this file.
  10  *
  11  * Licensees holding valid libFirm Professional Edition licenses may use
  12  * this file in accordance with the libFirm Commercial License.
  13  * Agreement provided with the Software.
  14  *
  15  * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
  16  * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
  17  * PURPOSE.
  18  */
  19
  20 /**
  21  * @file
  22  * @brief   Statistics for Firm.
  23  * @author  Michael Beck
  24  * @version $Id$
  25  */
  26 #ifdef HAVE_CONFIG_H
  27 # include "config.h"
  28 #endif
  29
  30 #ifdef FIRM_STATISTICS
  31
  32 #include <stdio.h>
  33
  34 #ifdef HAVE_STDLIB_H
  35 # include <stdlib.h>
  36 #endif
  37 #ifdef HAVE_STRING_H
  38 # include <string.h>
  39 #endif
  40
  41 #include "irouts.h"
  42 #include "irdump.h"
  43 #include "hashptr.h"
  44 #include "firmstat_t.h"
  45 #include "pattern.h"
  46 #include "dags.h"
  47 #include "stat_dmp.h"
  48 #include "xmalloc.h"
  49 #include "irhooks.h"
  50
  51 /*
  52  * need this to be static:
  53  * Special pseudo Opcodes that we need to count some interesting cases
  54  */
  55
  56 /**
  57  * The Phi0, a node that is created during SSA construction
  58  */
  59 static ir_op _op_Phi0;
  60
  61 /** The PhiM, just to count memory Phi's. */
  62 static ir_op _op_PhiM;
  63
  64 /** The Mul by Const node. */
  65 static ir_op _op_MulC;
  66
  67 /** The Div by Const node. */
  68 static ir_op _op_DivC;
  69
  70 /** The Div by Const node. */
  71 static ir_op _op_ModC;
  72
  73 /** The Div by Const node. */
  74 static ir_op _op_DivModC;
  75
  76 /** The Quot by Const node. */
  77 static ir_op _op_QuotC;
  78
  79 /** The memory Proj node. */
  80 static ir_op _op_ProjM;
  81
  82 /** A Sel of a Sel */
  83 static ir_op _op_SelSel;
  84
  85 /** A Sel of a Sel of a Sel */
  86 static ir_op _op_SelSelSel;
  87
  88 /* ---------------------------------------------------------------------------------- */
  89
  90 /** Marks the begin of a statistic (hook) function. */
  91 #define STAT_ENTER              ++status->recursive
  92
  93 /** Marks the end of a statistic (hook) functions. */
  94 #define STAT_LEAVE              --status->recursive
  95
  96 /** Allows to enter a statistic function only when we are not already in a hook. */
  97 #define STAT_ENTER_SINGLE       do { if (status->recursive > 0) return; ++status->recursive; } while (0)
  98
  99 /**
 100  * global status
 101  */
 102 static const unsigned status_disable = 0;
 103 static stat_info_t *status = (stat_info_t *)&status_disable;
 104
 105 /**
 106  * Compare two elements of the opcode hash.
 107  */
 108 static int opcode_cmp(const void *elt, const void *key) {
 109         const node_entry_t *e1 = elt;
 110         const node_entry_t *e2 = key;
 111
 112         return e1->op->code - e2->op->code;
 113 }  /* opcode_cmp */
 114
 115 /**
 116  * Compare two elements of the graph hash.
 117  */
 118 static int graph_cmp(const void *elt, const void *key) {
 119         const graph_entry_t *e1 = elt;
 120         const graph_entry_t *e2 = key;
 121
 122         return e1->irg != e2->irg;
 123 }  /* graph_cmp */
 124
 125 /**
 126  * Compare two elements of the optimization hash.
 127  */
 128 static int opt_cmp(const void *elt, const void *key) {
 129         const opt_entry_t *e1 = elt;
 130         const opt_entry_t *e2 = key;
 131
 132         return e1->op->code != e2->op->code;
 133 }  /* opt_cmp */
 134
 135 /**
 136  * Compare two elements of the block/extbb hash.
 137  */
 138 static int block_cmp(const void *elt, const void *key) {
 139         const block_entry_t *e1 = elt;
 140         const block_entry_t *e2 = key;
 141
 142         /* it's enough to compare the block number */
 143         return e1->block_nr != e2->block_nr;
 144 }  /* block_cmp */
 145
 146 /**
 147  * Compare two elements of the be_block hash.
 148  */
 149 static int be_block_cmp(const void *elt, const void *key) {
 150         const be_block_entry_t *e1 = elt;
 151         const be_block_entry_t *e2 = key;
 152
 153         return e1->block_nr != e2->block_nr;
 154 }  /* be_block_cmp */
 155
 156 /**
 157  * Compare two elements of reg pressure hash.
 158  */
 159 static int reg_pressure_cmp(const void *elt, const void *key) {
 160         const reg_pressure_entry_t *e1 = elt;
 161         const reg_pressure_entry_t *e2 = key;
 162
 163         return e1->class_name != e2->class_name;
 164 }  /* reg_pressure_cmp */
 165
 166 /**
 167  * Compare two elements of the perm_stat hash.
 168  */
 169 static int perm_stat_cmp(const void *elt, const void *key) {
 170         const perm_stat_entry_t *e1 = elt;
 171         const perm_stat_entry_t *e2 = key;
 172
 173         return e1->perm != e2->perm;
 174 }  /* perm_stat_cmp */
 175
 176 /**
 177  * Compare two elements of the perm_class hash.
 178  */
 179 static int perm_class_cmp(const void *elt, const void *key) {
 180         const perm_class_entry_t *e1 = elt;
 181         const perm_class_entry_t *e2 = key;
 182
 183         return e1->class_name != e2->class_name;
 184 }  /* perm_class_cmp */
 185
 186 /**
 187  * Compare two elements of the ir_op hash.
 188  */
 189 static int opcode_cmp_2(const void *elt, const void *key) {
 190         const ir_op *e1 = elt;
 191         const ir_op *e2 = key;
 192
 193         return e1->code != e2->code;
 194 }  /* opcode_cmp_2 */
 195
 196 /**
 197  * Compare two elements of the address_mark set.
 198  */
 199 static int address_mark_cmp(const void *elt, const void *key, size_t size) {
 200         const address_mark_entry_t *e1 = elt;
 201         const address_mark_entry_t *e2 = key;
 202         (void) size;
 203
 204         /* compare only the nodes, the rest is used as data container */
 205         return e1->node != e2->node;
 206 }  /* address_mark_cmp */
 207
 208 /**
 209  * Clear all counter in a node_entry_t.
 210  */
 211 static void opcode_clear_entry(node_entry_t *elem) {
 212         cnt_clr(&elem->cnt_alive);
 213         cnt_clr(&elem->new_node);
 214         cnt_clr(&elem->into_Id);
 215 }  /* opcode_clear_entry */
 216
 217 /**
 218  * Returns the associates node_entry_t for an ir_op
 219  *
 220  * @param op    the IR operation
 221  * @param hmap  a hash map containing ir_op* -> node_entry_t*
 222  */
 223 static node_entry_t *opcode_get_entry(const ir_op *op, hmap_node_entry_t *hmap) {
 224         node_entry_t key;
 225         node_entry_t *elem;
 226
 227         key.op = op;
 228
 229         elem = pset_find(hmap, &key, op->code);
 230         if (elem)
 231                 return elem;
 232
 233         elem = obstack_alloc(&status->cnts, sizeof(*elem));
 234         memset(elem, 0, sizeof(*elem));
 235
 236         /* clear counter */
 237         opcode_clear_entry(elem);
 238
 239         elem->op = op;
 240
 241         return pset_insert(hmap, elem, op->code);
 242 }  /* opcode_get_entry */
 243
 244 /**
 245  * Returns the associates ir_op for an opcode
 246  *
 247  * @param code  the IR opcode
 248  * @param hmap  the hash map containing opcode -> ir_op*
 249  */
 250 static ir_op *opcode_find_entry(ir_opcode code, hmap_ir_op *hmap) {
 251         ir_op key;
 252
 253         key.code = code;
 254         return pset_find(hmap, &key, code);
 255 }  /* opcode_find_entry */
 256
 257 /**
 258  * Clears all counter in a graph_entry_t.
 259  *
 260  * @param elem  the graph entry
 261  * @param all   if non-zero, clears all counters, else leave accumulated ones
 262  */
 263 static void graph_clear_entry(graph_entry_t *elem, int all) {
 264         int i;
 265
 266         /* clear accumulated / non-accumulated counter */
 267         for (i = all ? 0 : _gcnt_non_acc; i < _gcnt_last; ++i) {
 268                 cnt_clr(&elem->cnt[i]);
 269         }  /* for */
 270
 271         if (elem->block_hash) {
 272                 del_pset(elem->block_hash);
 273                 elem->block_hash = NULL;
 274         }  /* if */
 275
 276         if (elem->extbb_hash) {
 277                 del_pset(elem->extbb_hash);
 278                 elem->extbb_hash = NULL;
 279         }  /* if */
 280
 281         obstack_free(&elem->recalc_cnts, NULL);
 282         obstack_init(&elem->recalc_cnts);
 283 }  /* graph_clear_entry */
 284
 285 /**
 286  * Returns the associated graph_entry_t for an IR graph.
 287  *
 288  * @param irg   the IR graph
 289  * @param hmap  the hash map containing ir_graph* -> graph_entry_t*
 290  */
 291 static graph_entry_t *graph_get_entry(ir_graph *irg, hmap_graph_entry_t *hmap)
 292 {
 293         graph_entry_t key;
 294         graph_entry_t *elem;
 295         size_t i;
 296
 297         key.irg = irg;
 298
 299         elem = pset_find(hmap, &key, HASH_PTR(irg));
 300
 301         if (elem) {
 302                 /* create hash map backend block information */
 303                 if (! elem->be_block_hash)
 304                         elem->be_block_hash = new_pset(be_block_cmp, 5);
 305
 306                 return elem;
 307         }  /* if */
 308
 309         /* allocate a new one */
 310         elem = obstack_alloc(&status->cnts, sizeof(*elem));
 311         memset(elem, 0, sizeof(*elem));
 312         obstack_init(&elem->recalc_cnts);
 313
 314         /* clear counter */
 315         graph_clear_entry(elem, 1);
 316
 317         /* new hash table for opcodes here  */
 318         elem->opcode_hash   = new_pset(opcode_cmp, 5);
 319         elem->address_mark  = new_set(address_mark_cmp, 5);
 320         elem->irg           = irg;
 321
 322         /* these hash tables are created on demand */
 323         elem->block_hash = NULL;
 324         elem->extbb_hash = NULL;
 325
 326         for (i = 0; i < sizeof(elem->opt_hash)/sizeof(elem->opt_hash[0]); ++i)
 327                 elem->opt_hash[i] = new_pset(opt_cmp, 4);
 328
 329         return pset_insert(hmap, elem, HASH_PTR(irg));
 330 }  /* graph_get_entry */
 331
 332 /**
 333  * Clear all counter in an opt_entry_t.
 334  */
 335 static void opt_clear_entry(opt_entry_t *elem) {
 336         cnt_clr(&elem->count);
 337 }  /* opt_clear_entry */
 338
 339 /**
 340  * Returns the associated opt_entry_t for an IR operation.
 341  *
 342  * @param op    the IR operation
 343  * @param hmap  the hash map containing ir_op* -> opt_entry_t*
 344  */
 345 static opt_entry_t *opt_get_entry(const ir_op *op, hmap_opt_entry_t *hmap)
 346 {
 347         opt_entry_t key;
 348         opt_entry_t *elem;
 349
 350         key.op = op;
 351
 352         elem = pset_find(hmap, &key, op->code);
 353         if (elem)
 354                 return elem;
 355
 356         elem = obstack_alloc(&status->cnts, sizeof(*elem));
 357         memset(elem, 0, sizeof(*elem));
 358
 359         /* clear new counter */
 360         opt_clear_entry(elem);
 361
 362         elem->op = op;
 363
 364         return pset_insert(hmap, elem, op->code);
 365 }  /* opt_get_entry */
 366
 367 /**
 368  * clears all counter in a block_entry_t
 369  */
 370 static void block_clear_entry(block_entry_t *elem) {
 371         int i;
 372
 373         for (i = 0; i < _bcnt_last; ++i)
 374                 cnt_clr(&elem->cnt[i]);
 375 }  /* block_clear_entry */
 376
 377 /**
 378  * Returns the associated block_entry_t for an block.
 379  *
 380  * @param block_nr  an IR  block number
 381  * @param hmap      a hash map containing long -> block_entry_t
 382  */
 383 static block_entry_t *block_get_entry(struct obstack *obst, long block_nr, hmap_block_entry_t *hmap)
 384 {
 385         block_entry_t key;
 386         block_entry_t *elem;
 387
 388         key.block_nr = block_nr;
 389
 390         elem = pset_find(hmap, &key, block_nr);
 391         if (elem)
 392                 return elem;
 393
 394         elem = obstack_alloc(obst, sizeof(*elem));
 395         memset(elem, 0, sizeof(*elem));
 396
 397         /* clear new counter */
 398         block_clear_entry(elem);
 399
 400         elem->block_nr = block_nr;
 401
 402         return pset_insert(hmap, elem, block_nr);
 403 }  /* block_get_entry */
 404
 405 /**
 406  * Clear all sets in be_block_entry_t.
 407  */
 408 static void be_block_clear_entry(be_block_entry_t *elem)
 409 {
 410         if (elem->reg_pressure)
 411                 del_pset(elem->reg_pressure);
 412
 413         if (elem->sched_ready)
 414                 stat_delete_distrib_tbl(elem->sched_ready);
 415
 416         if (elem->perm_class_stat)
 417                 del_pset(elem->perm_class_stat);
 418
 419         elem->reg_pressure    = new_pset(reg_pressure_cmp, 5);
 420         elem->sched_ready     = stat_new_int_distrib_tbl();
 421         elem->perm_class_stat = new_pset(perm_class_cmp, 5);
 422 }  /* be_block_clear_entry */
 423
 424 /**
 425  * Returns the associated be_block_entry_t for an block.
 426  *
 427  * @param block_nr  an IR  block number
 428  * @param hmap      a hash map containing long -> be_block_entry_t
 429  */
 430 static be_block_entry_t *be_block_get_entry(struct obstack *obst, long block_nr, hmap_be_block_entry_t *hmap)
 431 {
 432         be_block_entry_t key;
 433         be_block_entry_t *elem;
 434
 435         key.block_nr = block_nr;
 436
 437         elem = pset_find(hmap, &key, block_nr);
 438         if (elem)
 439                 return elem;
 440
 441         elem = obstack_alloc(obst, sizeof(*elem));
 442         memset(elem, 0, sizeof(*elem));
 443
 444         /* clear new counter */
 445         be_block_clear_entry(elem);
 446
 447         elem->block_nr = block_nr;
 448
 449         return pset_insert(hmap, elem, block_nr);
 450 }  /* be_block_get_entry */
 451
 452 /**
 453  * clears all sets in perm_class_entry_t
 454  */
 455 static void perm_class_clear_entry(perm_class_entry_t *elem) {
 456         if (elem->perm_stat)
 457                 del_pset(elem->perm_stat);
 458
 459         elem->perm_stat = new_pset(perm_stat_cmp, 5);
 460 }  /* perm_class_clear_entry */
 461
 462 /**
 463  * Returns the associated perm_class entry for a register class.
 464  *
 465  * @param class_name  the register class name
 466  * @param hmap        a hash map containing class_name -> perm_class_entry_t
 467  */
 468 static perm_class_entry_t *perm_class_get_entry(struct obstack *obst, const char *class_name,
 469                                                 hmap_perm_class_entry_t *hmap)
 470 {
 471         perm_class_entry_t key;
 472         perm_class_entry_t *elem;
 473
 474         key.class_name = class_name;
 475
 476         elem = pset_find(hmap, &key, HASH_PTR(class_name));
 477         if (elem)
 478                 return elem;
 479
 480         elem = obstack_alloc(obst, sizeof(*elem));
 481         memset(elem, 0, sizeof(*elem));
 482
 483         /* clear new counter */
 484         perm_class_clear_entry(elem);
 485
 486         elem->class_name = class_name;
 487
 488         return pset_insert(hmap, elem, HASH_PTR(class_name));
 489 }  /* perm_class_get_entry */
 490
 491 /**
 492  * clears all sets in perm_stat_entry_t
 493  */
 494 static void perm_stat_clear_entry(perm_stat_entry_t *elem) {
 495         if (elem->chains)
 496                 stat_delete_distrib_tbl(elem->chains);
 497
 498         if (elem->cycles)
 499                 stat_delete_distrib_tbl(elem->cycles);
 500
 501         elem->chains = stat_new_int_distrib_tbl();
 502         elem->cycles = stat_new_int_distrib_tbl();
 503 }  /* perm_stat_clear_entry */
 504
 505 /**
 506  * Returns the associated perm_stat entry for a perm.
 507  *
 508  * @param perm      the perm node
 509  * @param hmap      a hash map containing perm -> perm_stat_entry_t
 510  */
 511 static perm_stat_entry_t *perm_stat_get_entry(struct obstack *obst, ir_node *perm, hmap_perm_stat_entry_t *hmap)
 512 {
 513         perm_stat_entry_t key;
 514         perm_stat_entry_t *elem;
 515
 516         key.perm = perm;
 517
 518         elem = pset_find(hmap, &key, HASH_PTR(perm));
 519         if (elem)
 520                 return elem;
 521
 522         elem = obstack_alloc(obst, sizeof(*elem));
 523         memset(elem, 0, sizeof(*elem));
 524
 525         /* clear new counter */
 526         perm_stat_clear_entry(elem);
 527
 528         elem->perm = perm;
 529
 530         return pset_insert(hmap, elem, HASH_PTR(perm));
 531 }  /* perm_stat_get_entry */
 532
 533 /**
 534  * Clear optimizations counter,
 535  */
 536 static void clear_optimization_counter(void)  {
 537         int i;
 538         for (i = 0; i < FS_OPT_MAX; ++i)
 539                 cnt_clr(&status->num_opts[i]);
 540 }
 541
 542 /**
 543  * Returns the ir_op for an IR-node,
 544  * handles special cases and return pseudo op codes.
 545  *
 546  * @param none  an IR node
 547  */
 548 static ir_op *stat_get_irn_op(ir_node *node)
 549 {
 550         ir_op *op = get_irn_op(node);
 551         ir_opcode opc = op->code;
 552
 553         switch (opc) {
 554         case iro_Phi:
 555                 if (get_irn_arity(node) == 0) {
 556                         /* special case, a Phi0 node, count on extra counter */
 557                         op = status->op_Phi0 ? status->op_Phi0 : op;
 558                 } else if (get_irn_mode(node) == mode_M) {
 559                         /* special case, a Memory Phi node, count on extra counter */
 560                         op = status->op_PhiM ? status->op_PhiM : op;
 561                 }  /* if */
 562                 break;
 563         case iro_Proj:
 564                 if (get_irn_mode(node) == mode_M) {
 565                         /* special case, a Memory Proj node, count on extra counter */
 566                         op = status->op_ProjM ? status->op_ProjM : op;
 567                 }  /* if */
 568                 break;
 569         case iro_Mul:
 570                 if (is_Const(get_Mul_left(node)) || is_Const(get_Mul_right(node))) {
 571                         /* special case, a Multiply by a const, count on extra counter */
 572                         op = status->op_MulC ? status->op_MulC : op;
 573                 }  /* if */
 574                 break;
 575         case iro_Div:
 576                 if (is_Const(get_Div_right(node))) {
 577                         /* special case, a division by a const, count on extra counter */
 578                         op = status->op_DivC ? status->op_DivC : op;
 579                 }  /* if */
 580                 break;
 581         case iro_Mod:
 582                 if (is_Const(get_Mod_right(node))) {
 583                         /* special case, a module by a const, count on extra counter */
 584                         op = status->op_ModC ? status->op_ModC : op;
 585                 }  /* if */
 586                 break;
 587         case iro_DivMod:
 588                 if (is_Const(get_DivMod_right(node))) {
 589                         /* special case, a division/modulo by a const, count on extra counter */
 590                         op = status->op_DivModC ? status->op_DivModC : op;
 591                 }  /* if */
 592                 break;
 593         case iro_Quot:
 594                 if (is_Const(get_Quot_right(node))) {
 595                         /* special case, a floating point division by a const, count on extra counter */
 596                         op = status->op_QuotC ? status->op_QuotC : op;
 597                 }  /* if */
 598                 break;
 599         case iro_Sel:
 600                 if (is_Sel(get_Sel_ptr(node))) {
 601                         /* special case, a Sel of a Sel, count on extra counter */
 602                         op = status->op_SelSel ? status->op_SelSel : op;
 603                         if (is_Sel(get_Sel_ptr(get_Sel_ptr(node)))) {
 604                                 /* special case, a Sel of a Sel of a Sel, count on extra counter */
 605                                 op = status->op_SelSelSel ? status->op_SelSelSel : op;
 606                         }  /* if */
 607                 }  /* if */
 608                 break;
 609         default:
 610                 ;
 611         }  /* switch */
 612
 613         return op;
 614 }  /* stat_get_irn_op */
 615
 616 /**
 617  * update the block counter
 618  */
 619 static void undate_block_info(ir_node *node, graph_entry_t *graph)
 620 {
 621         ir_op *op = get_irn_op(node);
 622         ir_node *block;
 623         block_entry_t *b_entry;
 624         int i, arity;
 625
 626         /* check for block */
 627         if (op == op_Block) {
 628                 arity = get_irn_arity(node);
 629                 b_entry = block_get_entry(&graph->recalc_cnts, get_irn_node_nr(node), graph->block_hash);
 630                 /* mark start end block to allow to filter them out */
 631                 if (node == get_irg_start_block(graph->irg))
 632                         b_entry->is_start = 1;
 633                 else if (node == get_irg_end_block(graph->irg))
 634                         b_entry->is_end = 1;
 635
 636                 /* count all incoming edges */
 637                 for (i = 0; i < arity; ++i) {
 638                         ir_node *pred = get_irn_n(node, i);
 639                         ir_node *other_block = get_nodes_block(pred);
 640                         block_entry_t *b_entry_other = block_get_entry(&graph->recalc_cnts, get_irn_node_nr(other_block), graph->block_hash);
 641
 642                         cnt_inc(&b_entry->cnt[bcnt_in_edges]);  /* an edge coming from another block */
 643                         cnt_inc(&b_entry_other->cnt[bcnt_out_edges]);
 644                 }  /* for */
 645                 return;
 646         }  /* if */
 647
 648         block   = get_nodes_block(node);
 649         b_entry = block_get_entry(&graph->recalc_cnts, get_irn_node_nr(block), graph->block_hash);
 650
 651         if (op == op_Phi && mode_is_datab(get_irn_mode(node))) {
 652                 /* count data Phi per block */
 653                 cnt_inc(&b_entry->cnt[bcnt_phi_data]);
 654         }  /* if */
 655
 656         /* we have a new node in our block */
 657         cnt_inc(&b_entry->cnt[bcnt_nodes]);
 658
 659         /* don't count keep-alive edges */
 660         if (is_End(node))
 661                 return;
 662
 663         arity = get_irn_arity(node);
 664
 665         for (i = 0; i < arity; ++i) {
 666                 ir_node *pred = get_irn_n(node, i);
 667                 ir_node *other_block;
 668
 669                 other_block = get_nodes_block(pred);
 670
 671                 if (other_block == block)
 672                         cnt_inc(&b_entry->cnt[bcnt_edges]);     /* a in block edge */
 673                 else {
 674                         block_entry_t *b_entry_other = block_get_entry(&graph->recalc_cnts, get_irn_node_nr(other_block), graph->block_hash);
 675
 676                         cnt_inc(&b_entry->cnt[bcnt_in_edges]);  /* an edge coming from another block */
 677                         cnt_inc(&b_entry_other->cnt[bcnt_out_edges]);
 678                 }  /* if */
 679         }  /* for */
 680 }  /* undate_block_info */
 681
 682 /**
 683  * Update the extended block counter.
 684  */
 685 static void update_extbb_info(ir_node *node, graph_entry_t *graph)
 686 {
 687         ir_op *op = get_irn_op(node);
 688         ir_extblk *extbb;
 689         extbb_entry_t *eb_entry;
 690         int i, arity;
 691
 692         /* check for block */
 693         if (op == op_Block) {
 694                 extbb = get_nodes_extbb(node);
 695                 arity = get_irn_arity(node);
 696                 eb_entry = block_get_entry(&graph->recalc_cnts, get_extbb_node_nr(extbb), graph->extbb_hash);
 697
 698                 /* count all incoming edges */
 699                 for (i = 0; i < arity; ++i) {
 700                         ir_node *pred = get_irn_n(node, i);
 701                         ir_extblk *other_extbb = get_nodes_extbb(pred);
 702
 703                         if (extbb != other_extbb) {
 704                                 extbb_entry_t *eb_entry_other = block_get_entry(&graph->recalc_cnts, get_extbb_node_nr(other_extbb), graph->extbb_hash);
 705
 706                                 cnt_inc(&eb_entry->cnt[bcnt_in_edges]); /* an edge coming from another extbb */
 707                                 cnt_inc(&eb_entry_other->cnt[bcnt_out_edges]);
 708                         }  /* if */
 709                 }  /* for */
 710                 return;
 711         }  /* if */
 712
 713         extbb    = get_nodes_extbb(node);
 714         eb_entry = block_get_entry(&graph->recalc_cnts, get_extbb_node_nr(extbb), graph->extbb_hash);
 715
 716         if (op == op_Phi && mode_is_datab(get_irn_mode(node))) {
 717                 /* count data Phi per extbb */
 718                 cnt_inc(&eb_entry->cnt[bcnt_phi_data]);
 719         }  /* if */
 720
 721         /* we have a new node in our block */
 722         cnt_inc(&eb_entry->cnt[bcnt_nodes]);
 723
 724         /* don't count keep-alive edges */
 725         if (is_End(node))
 726                 return;
 727
 728         arity = get_irn_arity(node);
 729
 730         for (i = 0; i < arity; ++i) {
 731                 ir_node *pred = get_irn_n(node, i);
 732                 ir_extblk *other_extbb = get_nodes_extbb(pred);
 733
 734                 if (other_extbb == extbb)
 735                         cnt_inc(&eb_entry->cnt[bcnt_edges]);    /* a in extbb edge */
 736                 else {
 737                         extbb_entry_t *eb_entry_other = block_get_entry(&graph->recalc_cnts, get_extbb_node_nr(other_extbb), graph->extbb_hash);
 738
 739                         cnt_inc(&eb_entry->cnt[bcnt_in_edges]); /* an edge coming from another extbb */
 740                         cnt_inc(&eb_entry_other->cnt[bcnt_out_edges]);
 741                 }  /* if */
 742         }  /* for */
 743 }  /* update_extbb_info */
 744
 745 /**
 746  * Calculates how many arguments of the call are const, updates
 747  * param distribution.
 748  */
 749 static void analyse_params_of_Call(graph_entry_t *graph, ir_node *call) {
 750         int i, num_const_args = 0, num_local_adr = 0;
 751         int n = get_Call_n_params(call);
 752
 753         for (i = 0; i < n; ++i) {
 754                 ir_node *param = get_Call_param(call, i);
 755
 756                 if (is_irn_constlike(param))
 757                         ++num_const_args;
 758                 else if (is_Sel(param)) {
 759                         ir_node *base = param;
 760
 761                         do {
 762                                 base = get_Sel_ptr(base);
 763                         } while (is_Sel(base));
 764
 765                         if (base == get_irg_frame(current_ir_graph))
 766                                 ++num_local_adr;
 767                 }
 768
 769         }  /* for */
 770
 771         if (num_const_args > 0)
 772                 cnt_inc(&graph->cnt[gcnt_call_with_cnst_arg]);
 773         if (num_const_args == n)
 774                 cnt_inc(&graph->cnt[gcnt_call_with_all_cnst_arg]);
 775         if (num_local_adr > 0)
 776                 cnt_inc(&graph->cnt[gcnt_call_with_local_adr]);
 777
 778         stat_inc_int_distrib_tbl(status->dist_param_cnt, n);
 779 }  /* analyse_params_of_Call */
 780
 781 /**
 782  * Update info on calls.
 783  *
 784  * @param call   The call
 785  * @param graph  The graph entry containing the call
 786  */
 787 static void stat_update_call(ir_node *call, graph_entry_t *graph)
 788 {
 789         ir_node   *block = get_nodes_block(call);
 790         ir_node   *ptr = get_Call_ptr(call);
 791         ir_entity *ent = NULL;
 792         ir_graph  *callee = NULL;
 793
 794         /*
 795          * If the block is bad, the whole subgraph will collapse later
 796          * so do not count this call.
 797          * This happens in dead code.
 798          */
 799         if (is_Bad(block))
 800                 return;
 801
 802         cnt_inc(&graph->cnt[gcnt_all_calls]);
 803
 804         /* found a call, this function is not a leaf */
 805         graph->is_leaf = 0;
 806
 807         if (is_SymConst(ptr)) {
 808                 if (get_SymConst_kind(ptr) == symconst_addr_ent) {
 809                         /* ok, we seems to know the entity */
 810                         ent = get_SymConst_entity(ptr);
 811                         callee = get_entity_irg(ent);
 812
 813                         /* it is recursive, if it calls at least once */
 814                         if (callee == graph->irg)
 815                                 graph->is_recursive = 1;
 816                         if (callee == NULL)
 817                                 cnt_inc(&graph->cnt[gcnt_external_calls]);
 818                 }  /* if */
 819         } else {
 820                 /* indirect call, be could not predict */
 821                 cnt_inc(&graph->cnt[gcnt_indirect_calls]);
 822
 823                 /* NOT a leaf call */
 824                 graph->is_leaf_call = LCS_NON_LEAF_CALL;
 825         }  /* if */
 826
 827         /* check, if it's a chain-call: Then, the call-block
 828          * must dominate the end block. */
 829         {
 830                 ir_node *curr = get_irg_end_block(graph->irg);
 831                 int depth = get_Block_dom_depth(block);
 832
 833                 for (; curr != block && get_Block_dom_depth(curr) > depth;) {
 834                         curr = get_Block_idom(curr);
 835
 836                         if (! curr || is_no_Block(curr))
 837                                 break;
 838                 }  /* for */
 839
 840                 if (curr != block)
 841                         graph->is_chain_call = 0;
 842         }
 843
 844         /* check, if the callee is a leaf */
 845         if (callee) {
 846                 graph_entry_t *called = graph_get_entry(callee, status->irg_hash);
 847
 848                 if (called->is_analyzed) {
 849                         if (! called->is_leaf)
 850                                 graph->is_leaf_call = LCS_NON_LEAF_CALL;
 851                 }  /* if */
 852         }  /* if */
 853
 854         analyse_params_of_Call(graph, call);
 855 }  /* stat_update_call */
 856
 857 /**
 858  * Update info on calls for graphs on the wait queue.
 859  */
 860 static void stat_update_call_2(ir_node *call, graph_entry_t *graph)
 861 {
 862         ir_node   *block = get_nodes_block(call);
 863         ir_node   *ptr = get_Call_ptr(call);
 864         ir_entity *ent = NULL;
 865         ir_graph  *callee = NULL;
 866
 867         /*
 868          * If the block is bad, the whole subgraph will collapse later
 869          * so do not count this call.
 870          * This happens in dead code.
 871          */
 872         if (is_Bad(block))
 873                 return;
 874
 875         if (is_SymConst(ptr)) {
 876                 if (get_SymConst_kind(ptr) == symconst_addr_ent) {
 877                         /* ok, we seems to know the entity */
 878                         ent = get_SymConst_entity(ptr);
 879                         callee = get_entity_irg(ent);
 880                 }  /* if */
 881         }  /* if */
 882
 883         /* check, if the callee is a leaf */
 884         if (callee) {
 885                 graph_entry_t *called = graph_get_entry(callee, status->irg_hash);
 886
 887                 assert(called->is_analyzed);
 888
 889                 if (! called->is_leaf)
 890                         graph->is_leaf_call = LCS_NON_LEAF_CALL;
 891         } else
 892                 graph->is_leaf_call = LCS_NON_LEAF_CALL;
 893 }  /* stat_update_call_2 */
 894
 895 /**
 896  * Find the base address and entity of an Sel node.
 897  *
 898  * @param sel  the node
 899  *
 900  * @return the base address.
 901  */
 902 static ir_node *find_base_adr(ir_node *sel) {
 903         ir_node *ptr = get_Sel_ptr(sel);
 904
 905         while (is_Sel(ptr)) {
 906                 sel = ptr;
 907                 ptr = get_Sel_ptr(sel);
 908         }
 909         return ptr;
 910 }  /* find_base_adr */
 911
 912 /**
 913  * Update info on Load/Store address statistics.
 914  */
 915 static void stat_update_address(ir_node *node, graph_entry_t *graph) {
 916         ir_opcode opc = get_irn_opcode(node);
 917         ir_node *base;
 918         ir_graph *irg;
 919
 920         switch (opc) {
 921         case iro_SymConst:
 922                 /* a global address */
 923                 cnt_inc(&graph->cnt[gcnt_global_adr]);
 924                 break;
 925         case iro_Sel:
 926                 base = find_base_adr(node);
 927                 irg = current_ir_graph;
 928                 if (base == get_irg_tls(irg)) {
 929                         /* a TLS variable, like a global. */
 930                         cnt_inc(&graph->cnt[gcnt_global_adr]);
 931                 } else if (base == get_irg_frame(irg)) {
 932                         /* a local Variable. */
 933                         cnt_inc(&graph->cnt[gcnt_local_adr]);
 934                 } else {
 935                         /* Pointer access */
 936                         if (is_Proj(base) && skip_Proj(get_Proj_pred(base)) == get_irg_start(irg)) {
 937                                 /* pointer access through parameter, check for THIS */
 938                                 ir_entity *ent = get_irg_entity(irg);
 939
 940                                 if (ent != NULL) {
 941                                         ir_type *ent_tp = get_entity_type(ent);
 942
 943                                         if (get_method_calling_convention(ent_tp) & cc_this_call) {
 944                                                 if (get_Proj_proj(base) == 0) {
 945                                                         /* THIS pointer */
 946                                                         cnt_inc(&graph->cnt[gcnt_this_adr]);
 947                                                         goto end_parameter;
 948                                                 }  /* if */
 949                                         }  /* if */
 950                                 }  /* if */
 951                                 /* other parameter */
 952                                 cnt_inc(&graph->cnt[gcnt_param_adr]);
 953 end_parameter:  ;
 954                         } else {
 955                                 /* unknown Pointer access */
 956                                 cnt_inc(&graph->cnt[gcnt_other_adr]);
 957                         }  /* if */
 958                 }  /* if */
 959         default:
 960                 ;
 961         }  /* switch */
 962 }  /* stat_update_address */
 963
 964 /**
 965  * Walker for reachable nodes count.
 966  */
 967 static void update_node_stat(ir_node *node, void *env)
 968 {
 969         graph_entry_t *graph = env;
 970         node_entry_t *entry;
 971
 972         ir_op *op = stat_get_irn_op(node);
 973         int arity = get_irn_arity(node);
 974
 975         entry = opcode_get_entry(op, graph->opcode_hash);
 976
 977         cnt_inc(&entry->cnt_alive);
 978         cnt_add_i(&graph->cnt[gcnt_edges], arity);
 979
 980         /* count block edges */
 981         undate_block_info(node, graph);
 982
 983         /* count extended block edges */
 984         if (status->stat_options & FIRMSTAT_COUNT_EXTBB) {
 985                 if (graph->irg != get_const_code_irg())
 986                         update_extbb_info(node, graph);
 987         }  /* if */
 988
 989         /* handle statistics for special node types */
 990
 991         switch (op->code) {
 992         case iro_Call:
 993                 /* check for properties that depends on calls like recursion/leaf/indirect call */
 994                 stat_update_call(node, graph);
 995                 break;
 996         case iro_Load:
 997                 /* check address properties */
 998                 stat_update_address(get_Load_ptr(node), graph);
 999                 break;
1000         case iro_Store:
1001                 /* check address properties */
1002                 stat_update_address(get_Store_ptr(node), graph);
1003                 break;
1004         default:
1005                 ;
1006         }  /* switch */
1007
1008         /* we want to count the constant IN nodes, not the CSE'ed constant's itself */
1009         if (status->stat_options & FIRMSTAT_COUNT_CONSTS) {
1010                 int i;
1011
1012                 for (i = get_irn_arity(node) - 1; i >= 0; --i) {
1013                         ir_node *pred = get_irn_n(node, i);
1014
1015                         if (is_Const(pred)) {
1016                                 /* check properties of constants */
1017                                 stat_update_const(status, pred, graph);
1018                         }  /* if */
1019                 }  /* for */
1020         }  /* if */
1021 }  /* update_node_stat */
1022
1023 /**
1024  * Walker for reachable nodes count for graphs on the wait_q.
1025  */
1026 static void update_node_stat_2(ir_node *node, void *env) {
1027         graph_entry_t *graph = env;
1028
1029         /* check for properties that depends on calls like recursion/leaf/indirect call */
1030         if (is_Call(node))
1031                 stat_update_call_2(node, graph);
1032 }  /* update_node_stat_2 */
1033
1034 /**
1035  * Get the current address mark.
1036  */
1037 static unsigned get_adr_mark(graph_entry_t *graph, ir_node *node) {
1038         address_mark_entry_t *value = set_find(graph->address_mark, &node, sizeof(*value), HASH_PTR(node));
1039
1040         return value ? value->mark : 0;
1041 }  /* get_adr_mark */
1042
1043 /**
1044  * Set the current address mark.
1045  */
1046 static void set_adr_mark(graph_entry_t *graph, ir_node *node, unsigned val) {
1047         address_mark_entry_t *value = set_insert(graph->address_mark, &node, sizeof(*value), HASH_PTR(node));
1048
1049         value->mark = val;
1050 }  /* set_adr_mark */
1051
1052 #undef DUMP_ADR_MODE
1053
1054 #ifdef DUMP_ADR_MODE
1055 /**
1056  * a vcg attribute hook: Color a node with a different color if
1057  * it's identified as a part of an address expression or at least referenced
1058  * by an address expression.
1059  */
1060 static int stat_adr_mark_hook(FILE *F, ir_node *node, ir_node *local)
1061 {
1062         ir_node *n           = local ? local : node;
1063         ir_graph *irg        = get_irn_irg(n);
1064         graph_entry_t *graph = graph_get_entry(irg, status->irg_hash);
1065         unsigned mark        = get_adr_mark(graph, n);
1066
1067         if (mark & MARK_ADDRESS_CALC)
1068                 fprintf(F, "color: purple");
1069         else if ((mark & (MARK_REF_ADR | MARK_REF_NON_ADR)) == MARK_REF_ADR)
1070                 fprintf(F, "color: pink");
1071         else if ((mark & (MARK_REF_ADR | MARK_REF_NON_ADR)) == (MARK_REF_ADR|MARK_REF_NON_ADR))
1072                 fprintf(F, "color: lightblue");
1073         else
1074                 return 0;
1075
1076         /* I know the color! */
1077         return 1;
1078 }  /* stat_adr_mark_hook */
1079 #endif /* DUMP_ADR_MODE */
1080
1081 /**
1082  * Return the "operational" mode of a Firm node.
1083  */
1084 static ir_mode *get_irn_op_mode(ir_node *node) {
1085         switch (get_irn_opcode(node)) {
1086         case iro_Load:
1087                 return get_Load_mode(node);
1088         case iro_Store:
1089                 return get_irn_mode(get_Store_value(node));
1090         case iro_DivMod:
1091                 return get_irn_mode(get_DivMod_left(node));
1092         case iro_Div:
1093                 return get_irn_mode(get_Div_left(node));
1094         case iro_Mod:
1095                 return get_irn_mode(get_Mod_left(node));
1096         case iro_Cmp:
1097                 /* Cmp is no address calculation, or is it? */
1098         default:
1099                 return get_irn_mode(node);
1100         }  /* switch */
1101 }  /* get_irn_op_mode */
1102
1103 /**
1104  * Post-walker that marks every node that is an address calculation.
1105  *
1106  * Users of a node must be visited first. We ensure this by
1107  * calling it in the post of an outs walk. This should work even in cycles,
1108  * while the normal pre-walk will not.
1109  */
1110 static void mark_address_calc(ir_node *node, void *env) {
1111         graph_entry_t *graph = env;
1112         ir_mode *mode = get_irn_op_mode(node);
1113         int i, n;
1114         unsigned mark_preds = MARK_REF_NON_ADR;
1115
1116         if (! mode_is_data(mode))
1117                 return;
1118
1119         if (mode_is_reference(mode)) {
1120                 /* a reference is calculated here, we are sure */
1121                 set_adr_mark(graph, node, MARK_ADDRESS_CALC);
1122
1123                 mark_preds = MARK_REF_ADR;
1124         } else {
1125                 unsigned mark = get_adr_mark(graph, node);
1126
1127                 if ((mark & (MARK_REF_ADR | MARK_REF_NON_ADR)) == MARK_REF_ADR) {
1128                         /*
1129                          * this node has no reference mode, but is only
1130                          * referenced by address calculations
1131                          */
1132                         mark_preds = MARK_REF_ADR;
1133                 }  /* if */
1134         }  /* if */
1135
1136         /* mark all predecessors */
1137         for (i = 0, n = get_irn_arity(node); i < n; ++i) {
1138                 ir_node *pred = get_irn_n(node, i);
1139
1140                 mode = get_irn_op_mode(pred);
1141                 if (! mode_is_data(mode))
1142                         continue;
1143
1144                 set_adr_mark(graph, pred, get_adr_mark(graph, pred) | mark_preds);
1145         }  /* for */
1146 }  /* mark_address_calc */
1147
1148 /**
1149  * Post-walker that marks every node that is an address calculation.
1150  *
1151  * Users of a node must be visited first. We ensure this by
1152  * calling it in the post of an outs walk. This should work even in cycles,
1153  * while the normal pre-walk will not.
1154  */
1155 static void count_adr_ops(ir_node *node, void *env) {
1156         graph_entry_t *graph = env;
1157         unsigned mark        = get_adr_mark(graph, node);
1158
1159         if (mark & MARK_ADDRESS_CALC)
1160                 cnt_inc(&graph->cnt[gcnt_pure_adr_ops]);
1161         else if ((mark & (MARK_REF_ADR | MARK_REF_NON_ADR)) == MARK_REF_ADR)
1162                 cnt_inc(&graph->cnt[gcnt_pure_adr_ops]);
1163         else if ((mark & (MARK_REF_ADR | MARK_REF_NON_ADR)) == (MARK_REF_ADR|MARK_REF_NON_ADR))
1164                 cnt_inc(&graph->cnt[gcnt_all_adr_ops]);
1165 }  /* count_adr_ops */
1166
1167 /**
1168  * Called for every graph when the graph is either deleted or stat_dump_snapshot()
1169  * is called, must recalculate all statistic info.
1170  *
1171  * @param global    The global entry
1172  * @param graph     The current entry
1173  */
1174 static void update_graph_stat(graph_entry_t *global, graph_entry_t *graph)
1175 {
1176         node_entry_t *entry;
1177         int i;
1178
1179         /* clear first the alive counter in the graph */
1180         foreach_pset(graph->opcode_hash, entry) {
1181                 cnt_clr(&entry->cnt_alive);
1182         }  /* foreach_pset */
1183
1184         /* set pessimistic values */
1185         graph->is_leaf       = 1;
1186         graph->is_leaf_call  = LCS_UNKNOWN;
1187         graph->is_recursive  = 0;
1188         graph->is_chain_call = 1;
1189
1190         /* create new block counter */
1191         graph->block_hash = new_pset(block_cmp, 5);
1192
1193         /* we need dominator info */
1194         if (graph->irg != get_const_code_irg()) {
1195                 assure_doms(graph->irg);
1196
1197                 if (status->stat_options & FIRMSTAT_COUNT_EXTBB) {
1198                         /* we need extended basic blocks */
1199                         compute_extbb(graph->irg);
1200
1201                         /* create new extbb counter */
1202                         graph->extbb_hash = new_pset(block_cmp, 5);
1203                 }  /* if */
1204         }  /* if */
1205
1206         /* count the nodes in the graph */
1207         irg_walk_graph(graph->irg, update_node_stat, NULL, graph);
1208
1209 #if 0
1210         /* Uncomment this code if chain-call means call exact one. */
1211         entry = opcode_get_entry(op_Call, graph->opcode_hash);
1212
1213         /* check if we have more than 1 call */
1214         if (cnt_gt(entry->cnt_alive, 1))
1215                 graph->is_chain_call = 0;
1216 #endif
1217
1218         /* recursive functions are never chain calls, leafs don't have calls */
1219         if (graph->is_recursive || graph->is_leaf)
1220                 graph->is_chain_call = 0;
1221
1222         /* assume we walk every graph only ONCE, we could sum here the global count */
1223         foreach_pset(graph->opcode_hash, entry) {
1224                 node_entry_t *g_entry = opcode_get_entry(entry->op, global->opcode_hash);
1225
1226                 /* update the node counter */
1227                 cnt_add(&g_entry->cnt_alive, &entry->cnt_alive);
1228         }  /* foreach_pset */
1229
1230         /* count the number of address calculation */
1231         if (graph->irg != get_const_code_irg()) {
1232                 ir_graph *rem = current_ir_graph;
1233
1234                 assure_irg_outs(graph->irg);
1235
1236                 /* Must be done an the outs graph */
1237                 current_ir_graph = graph->irg;
1238                 irg_out_walk(get_irg_start(graph->irg), NULL, mark_address_calc, graph);
1239                 current_ir_graph = rem;
1240
1241 #ifdef DUMP_ADR_MODE
1242                 /* register the vcg hook and dump the graph for test */
1243                 set_dump_node_vcgattr_hook(stat_adr_mark_hook);
1244                 dump_ir_block_graph(graph->irg, "-adr");
1245                 set_dump_node_vcgattr_hook(NULL);
1246 #endif /* DUMP_ADR_MODE */
1247
1248                 irg_walk_graph(graph->irg, NULL, count_adr_ops, graph);
1249         }  /* if */
1250
1251         /* count the DAG's */
1252         if (status->stat_options & FIRMSTAT_COUNT_DAG)
1253                 count_dags_in_graph(global, graph);
1254
1255         /* calculate the patterns of this graph */
1256         stat_calc_pattern_history(graph->irg);
1257
1258         /* leaf function did not call others */
1259         if (graph->is_leaf)
1260                 graph->is_leaf_call = LCS_NON_LEAF_CALL;
1261         else if (graph->is_leaf_call == LCS_UNKNOWN) {
1262                 /* we still don't know if this graph calls leaf-functions, so enqueue */
1263                 pdeq_putl(status->wait_q, graph);
1264         }  /* if */
1265
1266         /* we have analyzed this graph */
1267         graph->is_analyzed = 1;
1268
1269         /* accumulate all counter's */
1270         for (i = 0; i < _gcnt_last; ++i)
1271                 cnt_add(&global->cnt[i], &graph->cnt[i]);
1272 }  /* update_graph_stat */
1273
1274 /**
1275  * Called for every graph that was on the wait_q in stat_dump_snapshot()
1276  * must finish all statistic info calculations.
1277  *
1278  * @param global    The global entry
1279  * @param graph     The current entry
1280  */
1281 static void update_graph_stat_2(graph_entry_t *global, graph_entry_t *graph)
1282 {
1283         (void) global;
1284         if (graph->is_deleted) {
1285                 /* deleted, ignore */
1286                 return;
1287         }
1288
1289         if (graph->irg) {
1290                 /* count the nodes in the graph */
1291                 irg_walk_graph(graph->irg, update_node_stat_2, NULL, graph);
1292
1293                 if (graph->is_leaf_call == LCS_UNKNOWN)
1294                         graph->is_leaf_call = LCS_LEAF_CALL;
1295         }  /* if */
1296 }  /* update_graph_stat_2 */
1297
1298 /**
1299  * Register a dumper.
1300  */
1301 static void stat_register_dumper(const dumper_t *dumper) {
1302         dumper_t *p = XMALLOC(dumper_t);
1303
1304         memcpy(p, dumper, sizeof(*p));
1305
1306         p->next        = status->dumper;
1307         p->status      = status;
1308         status->dumper = p;
1309
1310         /* FIXME: memory leak */
1311 }  /* stat_register_dumper */
1312
1313 /**
1314  * Dumps the statistics of an IR graph.
1315  */
1316 static void stat_dump_graph(graph_entry_t *entry) {
1317         dumper_t *dumper;
1318
1319         for (dumper = status->dumper; dumper; dumper = dumper->next) {
1320                 if (dumper->dump_graph)
1321                         dumper->dump_graph(dumper, entry);
1322         }  /* for */
1323 }  /* stat_dump_graph */
1324
1325 /**
1326  * Calls all registered dumper functions.
1327  */
1328 static void stat_dump_registered(graph_entry_t *entry) {
1329         dumper_t *dumper;
1330
1331         for (dumper = status->dumper; dumper; dumper = dumper->next) {
1332                 if (dumper->func_map) {
1333                         dump_graph_FUNC func;
1334
1335                         foreach_pset(dumper->func_map, func)
1336                                 func(dumper, entry);
1337                 }  /* if */
1338         }  /* for */
1339 }  /* stat_dump_registered */
1340
1341 /**
1342  * Dumps a constant table.
1343  */
1344 static void stat_dump_consts(const constant_info_t *tbl) {
1345         dumper_t *dumper;
1346
1347         for (dumper = status->dumper; dumper; dumper = dumper->next) {
1348                 if (dumper->dump_const_tbl)
1349                         dumper->dump_const_tbl(dumper, tbl);
1350         }  /* for */
1351 }  /* stat_dump_consts */
1352
1353 /**
1354  * Dumps the parameter distribution
1355  */
1356 static void stat_dump_param_tbl(const distrib_tbl_t *tbl, graph_entry_t *global) {
1357         dumper_t *dumper;
1358
1359         for (dumper = status->dumper; dumper; dumper = dumper->next) {
1360                 if (dumper->dump_param_tbl)
1361                         dumper->dump_param_tbl(dumper, tbl, global);
1362         }  /* for */
1363 }  /* stat_dump_param_tbl */
1364
1365 /**
1366  * Dumps the optimization counter
1367  */
1368 static void stat_dump_opt_cnt(const counter_t *tbl, unsigned len) {
1369         dumper_t *dumper;
1370
1371         for (dumper = status->dumper; dumper; dumper = dumper->next) {
1372                 if (dumper->dump_opt_cnt)
1373                         dumper->dump_opt_cnt(dumper, tbl, len);
1374         }  /* for */
1375 }  /* stat_dump_opt_cnt */
1376
1377 /**
1378  * Initialize the dumper.
1379  */
1380 static void stat_dump_init(const char *name) {
1381         dumper_t *dumper;
1382
1383         for (dumper = status->dumper; dumper; dumper = dumper->next) {
1384                 if (dumper->init)
1385                         dumper->init(dumper, name);
1386         }  /* for */
1387 }  /* stat_dump_init */
1388
1389 /**
1390  * Finish the dumper.
1391  */
1392 static void stat_dump_finish(void) {
1393         dumper_t *dumper;
1394
1395         for (dumper = status->dumper; dumper; dumper = dumper->next) {
1396                 if (dumper->finish)
1397                         dumper->finish(dumper);
1398         }  /* for */
1399 }  /* stat_dump_finish */
1400
1401 /**
1402  * Register an additional function for all dumper.
1403  */
1404 void stat_register_dumper_func(dump_graph_FUNC func) {
1405         dumper_t *dumper;
1406
1407         for (dumper = status->dumper; dumper; dumper = dumper->next) {
1408                 if (! dumper->func_map)
1409                         dumper->func_map = pset_new_ptr(3);
1410                 pset_insert_ptr(dumper->func_map, func);
1411         }  /* for */
1412 }  /* stat_register_dumper_func */
1413
1414 /* ---------------------------------------------------------------------- */
1415
1416 /*
1417  * Helper: get an ir_op from an opcode.
1418  */
1419 ir_op *stat_get_op_from_opcode(ir_opcode code) {
1420         return opcode_find_entry(code, status->ir_op_hash);
1421 }  /* stat_get_op_from_opcode */
1422
1423 /**
1424  * Hook: A new IR op is registered.
1425  *
1426  * @param ctx  the hook context
1427  * @param op   the new IR opcode that was created.
1428  */
1429 static void stat_new_ir_op(void *ctx, ir_op *op) {
1430         (void) ctx;
1431         if (! status->stat_options)
1432                 return;
1433
1434         STAT_ENTER;
1435         {
1436                 graph_entry_t *graph = graph_get_entry(NULL, status->irg_hash);
1437
1438                 /* execute for side effect :-) */
1439                 (void)opcode_get_entry(op, graph->opcode_hash);
1440
1441                 pset_insert(status->ir_op_hash, op, op->code);
1442         }
1443         STAT_LEAVE;
1444 }  /* stat_new_ir_op */
1445
1446 /**
1447  * Hook: An IR op is freed.
1448  *
1449  * @param ctx  the hook context
1450  * @param op   the IR opcode that is freed
1451  */
1452 static void stat_free_ir_op(void *ctx, ir_op *op) {
1453         (void) ctx;
1454         (void) op;
1455         if (! status->stat_options)
1456                 return;
1457
1458         STAT_ENTER;
1459         {
1460         }
1461         STAT_LEAVE;
1462 }  /* stat_free_ir_op */
1463
1464 /**
1465  * Hook: A new node is created.
1466  *
1467  * @param ctx   the hook context
1468  * @param irg   the IR graph on which the node is created
1469  * @param node  the new IR node that was created
1470  */
1471 static void stat_new_node(void *ctx, ir_graph *irg, ir_node *node) {
1472         (void) ctx;
1473         (void) irg;
1474         if (! status->stat_options)
1475                 return;
1476
1477         /* do NOT count during dead node elimination */
1478         if (status->in_dead_node_elim)
1479                 return;
1480
1481         STAT_ENTER;
1482         {
1483                 node_entry_t *entry;
1484                 graph_entry_t *graph;
1485                 ir_op *op = stat_get_irn_op(node);
1486
1487                 /* increase global value */
1488                 graph = graph_get_entry(NULL, status->irg_hash);
1489                 entry = opcode_get_entry(op, graph->opcode_hash);
1490                 cnt_inc(&entry->new_node);
1491
1492                 /* increase local value */
1493                 graph = graph_get_entry(current_ir_graph, status->irg_hash);
1494                 entry = opcode_get_entry(op, graph->opcode_hash);
1495                 cnt_inc(&entry->new_node);
1496         }
1497         STAT_LEAVE;
1498 }  /* stat_new_node */
1499
1500 /**
1501  * Hook: A node is changed into a Id node
1502  *
1503  * @param ctx   the hook context
1504  * @param node  the IR node that will be turned into an ID
1505  */
1506 static void stat_turn_into_id(void *ctx, ir_node *node) {
1507         (void) ctx;
1508         if (! status->stat_options)
1509                 return;
1510
1511         STAT_ENTER;
1512         {
1513                 node_entry_t *entry;
1514                 graph_entry_t *graph;
1515                 ir_op *op = stat_get_irn_op(node);
1516
1517                 /* increase global value */
1518                 graph = graph_get_entry(NULL, status->irg_hash);
1519                 entry = opcode_get_entry(op, graph->opcode_hash);
1520                 cnt_inc(&entry->into_Id);
1521
1522                 /* increase local value */
1523                 graph = graph_get_entry(current_ir_graph, status->irg_hash);
1524                 entry = opcode_get_entry(op, graph->opcode_hash);
1525                 cnt_inc(&entry->into_Id);
1526         }
1527         STAT_LEAVE;
1528 }  /* stat_turn_into_id */
1529
1530 /**
1531  * Hook: A new graph was created
1532  *
1533  * @param ctx  the hook context
1534  * @param irg  the new IR graph that was created
1535  * @param ent  the entity of this graph
1536  */
1537 static void stat_new_graph(void *ctx, ir_graph *irg, ir_entity *ent) {
1538         (void) ctx;
1539         if (! status->stat_options)
1540                 return;
1541
1542         STAT_ENTER;
1543         {
1544                 /* execute for side effect :-) */
1545                 graph_entry_t * graph = graph_get_entry(irg, status->irg_hash);
1546
1547                 graph->ent           = ent;
1548                 graph->is_deleted    = 0;
1549                 graph->is_leaf       = 0;
1550                 graph->is_leaf_call  = 0;
1551                 graph->is_recursive  = 0;
1552                 graph->is_chain_call = 0;
1553                 graph->is_analyzed   = 0;
1554         }
1555         STAT_LEAVE;
1556 }  /* stat_new_graph */
1557
1558 /**
1559  * Hook: A graph will be deleted
1560  *
1561  * @param ctx  the hook context
1562  * @param irg  the IR graph that will be deleted
1563  *
1564  * Note that we still hold the information for this graph
1565  * in our hash maps, only a flag is set which prevents this
1566  * information from being changed, it's "frozen" from now.
1567  */
1568 static void stat_free_graph(void *ctx, ir_graph *irg) {
1569         (void) ctx;
1570         if (! status->stat_options)
1571                 return;
1572
1573         STAT_ENTER;
1574         {
1575                 graph_entry_t *graph  = graph_get_entry(irg, status->irg_hash);
1576                 graph_entry_t *global = graph_get_entry(NULL, status->irg_hash);
1577
1578                 graph->is_deleted = 1;
1579
1580                 if (status->stat_options & FIRMSTAT_COUNT_DELETED) {
1581                         /* count the nodes of the graph yet, it will be destroyed later */
1582                         update_graph_stat(global, graph);
1583                 }  /* if */
1584         }
1585         STAT_LEAVE;
1586 }  /* stat_free_graph */
1587
1588 /**
1589  * Hook: A walk over a graph is initiated. Do not count walks from statistic code.
1590  *
1591  * @param ctx  the hook context
1592  * @param irg  the IR graph that will be walked
1593  * @param pre  the pre walker
1594  * @param post the post walker
1595  */
1596 static void stat_irg_walk(void *ctx, ir_graph *irg, generic_func *pre, generic_func *post)
1597 {
1598         (void) ctx;
1599         (void) pre;
1600         (void) post;
1601         if (! status->stat_options)
1602                 return;
1603
1604         STAT_ENTER_SINGLE;
1605         {
1606                 graph_entry_t *graph = graph_get_entry(irg, status->irg_hash);
1607
1608                 cnt_inc(&graph->cnt[gcnt_acc_walked]);
1609         }
1610         STAT_LEAVE;
1611 }  /* stat_irg_walk */
1612
1613 /**
1614  * Hook: A walk over a graph in block-wise order is initiated. Do not count walks from statistic code.
1615  *
1616  * @param ctx  the hook context
1617  * @param irg  the IR graph that will be walked
1618  * @param pre  the pre walker
1619  * @param post the post walker
1620  */
1621 static void stat_irg_walk_blkwise(void *ctx, ir_graph *irg, generic_func *pre, generic_func *post)
1622 {
1623         /* for now, do NOT differentiate between blockwise and normal */
1624         stat_irg_walk(ctx, irg, pre, post);
1625 }  /* stat_irg_walk_blkwise */
1626
1627 /**
1628  * Hook: A walk over the graph's blocks is initiated. Do not count walks from statistic code.
1629  *
1630  * @param ctx  the hook context
1631  * @param irg  the IR graph that will be walked
1632  * @param node the IR node
1633  * @param pre  the pre walker
1634  * @param post the post walker
1635  */
1636 static void stat_irg_block_walk(void *ctx, ir_graph *irg, ir_node *node, generic_func *pre, generic_func *post)
1637 {
1638         (void) ctx;
1639         (void) node;
1640         (void) pre;
1641         (void) post;
1642         if (! status->stat_options)
1643                 return;
1644
1645         STAT_ENTER_SINGLE;
1646         {
1647                 graph_entry_t *graph = graph_get_entry(irg, status->irg_hash);
1648
1649                 cnt_inc(&graph->cnt[gcnt_acc_walked_blocks]);
1650         }
1651         STAT_LEAVE;
1652 }  /* stat_irg_block_walk */
1653
1654 /**
1655  * Called for every node that is removed due to an optimization.
1656  *
1657  * @param n     the IR node that will be removed
1658  * @param hmap  the hash map containing ir_op* -> opt_entry_t*
1659  * @param kind  the optimization kind
1660  */
1661 static void removed_due_opt(ir_node *n, hmap_opt_entry_t *hmap, hook_opt_kind kind) {
1662         opt_entry_t *entry;
1663         ir_op *op = stat_get_irn_op(n);
1664
1665         /* ignore CSE for Constants */
1666         if (kind == HOOK_OPT_CSE && (is_Const(n) || is_SymConst(n)))
1667                 return;
1668
1669         /* increase global value */
1670         entry = opt_get_entry(op, hmap);
1671         cnt_inc(&entry->count);
1672 }  /* removed_due_opt */
1673
1674 /**
1675  * Hook: Some nodes were optimized into some others due to an optimization.
1676  *
1677  * @param ctx  the hook context
1678  */
1679 static void stat_merge_nodes(
1680     void *ctx,
1681     ir_node **new_node_array, int new_num_entries,
1682     ir_node **old_node_array, int old_num_entries,
1683     hook_opt_kind opt)
1684 {
1685         (void) ctx;
1686         if (! status->stat_options)
1687                 return;
1688
1689         STAT_ENTER;
1690         {
1691                 int i, j;
1692                 graph_entry_t *graph = graph_get_entry(current_ir_graph, status->irg_hash);
1693
1694                 cnt_inc(&status->num_opts[opt]);
1695                 if (status->reassoc_run)
1696                         opt = HOOK_OPT_REASSOC;
1697
1698                 for (i = 0; i < old_num_entries; ++i) {
1699                         /* nodes might be in new and old, so if we found a node
1700                            in both sets, this one  is NOT removed */
1701                         for (j = 0; j < new_num_entries; ++j) {
1702                                 if (old_node_array[i] == new_node_array[j])
1703                                         break;
1704                         }  /* for */
1705                         if (j >= new_num_entries) {
1706                                 int xopt = opt;
1707
1708                                 /* sometimes we did not detect, that it is replaced by a Const */
1709                                 if (opt == HOOK_OPT_CONFIRM && new_num_entries == 1) {
1710                                         ir_op *op = get_irn_op(new_node_array[0]);
1711
1712                                         if (op == op_Const || op == op_SymConst)
1713                                                 xopt = HOOK_OPT_CONFIRM_C;
1714                                 }  /* if */
1715
1716                                 removed_due_opt(old_node_array[i], graph->opt_hash[xopt], xopt);
1717                         }  /* if */
1718                 }  /* for */
1719         }
1720         STAT_LEAVE;
1721 }  /* stat_merge_nodes */
1722
1723 /**
1724  * Hook: Reassociation is started/stopped.
1725  *
1726  * @param ctx   the hook context
1727  * @param flag  if non-zero, reassociation is started else stopped
1728  */
1729 static void stat_reassociate(void *ctx, int flag) {
1730         (void) ctx;
1731         if (! status->stat_options)
1732                 return;
1733
1734         STAT_ENTER;
1735         {
1736                 status->reassoc_run = flag;
1737         }
1738         STAT_LEAVE;
1739 }  /* stat_reassociate */
1740
1741 /**
1742  * Hook: A node was lowered into other nodes
1743  *
1744  * @param ctx  the hook context
1745  * @param node the IR node that will be lowered
1746  */
1747 static void stat_lower(void *ctx, ir_node *node) {
1748         (void) ctx;
1749         if (! status->stat_options)
1750                 return;
1751
1752         STAT_ENTER;
1753         {
1754                 graph_entry_t *graph = graph_get_entry(current_ir_graph, status->irg_hash);
1755
1756                 removed_due_opt(node, graph->opt_hash[HOOK_LOWERED], HOOK_LOWERED);
1757         }
1758         STAT_LEAVE;
1759 }  /* stat_lower */
1760
1761 /**
1762  * Hook: A graph was inlined.
1763  *
1764  * @param ctx  the hook context
1765  * @param call the IR call that will re changed into the body of
1766  *             the called IR graph
1767  * @param called_irg  the IR graph representing the called routine
1768  */
1769 static void stat_inline(void *ctx, ir_node *call, ir_graph *called_irg)
1770 {
1771         (void) ctx;
1772         if (! status->stat_options)
1773                 return;
1774
1775         STAT_ENTER;
1776         {
1777                 ir_graph *irg = get_irn_irg(call);
1778                 graph_entry_t *i_graph = graph_get_entry(called_irg, status->irg_hash);
1779                 graph_entry_t *graph   = graph_get_entry(irg, status->irg_hash);
1780
1781                 cnt_inc(&graph->cnt[gcnt_acc_got_inlined]);
1782                 cnt_inc(&i_graph->cnt[gcnt_acc_was_inlined]);
1783         }
1784         STAT_LEAVE;
1785 }  /* stat_inline */
1786
1787 /**
1788  * Hook: A graph with tail-recursions was optimized.
1789  *
1790  * @param ctx  the hook context
1791  */
1792 static void stat_tail_rec(void *ctx, ir_graph *irg, int n_calls) {
1793         (void) ctx;
1794         if (! status->stat_options)
1795                 return;
1796
1797         STAT_ENTER;
1798         {
1799                 graph_entry_t *graph = graph_get_entry(irg, status->irg_hash);
1800
1801                 graph->num_tail_recursion += n_calls;
1802         }
1803         STAT_LEAVE;
1804 }  /* stat_tail_rec */
1805
1806 /**
1807  * Strength reduction was performed on an iteration variable.
1808  *
1809  * @param ctx  the hook context
1810  */
1811 static void stat_strength_red(void *ctx, ir_graph *irg, ir_node *strong) {
1812         (void) ctx;
1813         if (! status->stat_options)
1814                 return;
1815
1816         STAT_ENTER;
1817         {
1818                 graph_entry_t *graph = graph_get_entry(irg, status->irg_hash);
1819                 cnt_inc(&graph->cnt[gcnt_acc_strength_red]);
1820
1821                 removed_due_opt(strong, graph->opt_hash[HOOK_OPT_STRENGTH_RED], HOOK_OPT_STRENGTH_RED);
1822         }
1823         STAT_LEAVE;
1824 }  /* stat_strength_red */
1825
1826 /**
1827  * Hook: Start/Stop the dead node elimination.
1828  *
1829  * @param ctx  the hook context
1830  */
1831 static void stat_dead_node_elim(void *ctx, ir_graph *irg, int start) {
1832         (void) ctx;
1833         (void) irg;
1834         if (! status->stat_options)
1835                 return;
1836
1837         status->in_dead_node_elim = (start != 0);
1838 }  /* stat_dead_node_elim */
1839
1840 /**
1841  * Hook: if-conversion was tried.
1842  */
1843 static void stat_if_conversion(void *context, ir_graph *irg, ir_node *phi,
1844                                int pos, ir_node *mux, if_result_t reason)
1845 {
1846         (void) context;
1847         (void) phi;
1848         (void) pos;
1849         (void) mux;
1850         if (! status->stat_options)
1851                 return;
1852
1853         STAT_ENTER;
1854         {
1855                 graph_entry_t *graph = graph_get_entry(irg, status->irg_hash);
1856
1857                 cnt_inc(&graph->cnt[gcnt_if_conv + reason]);
1858         }
1859         STAT_LEAVE;
1860 }  /* stat_if_conversion */
1861
1862 /**
1863  * Hook: real function call was optimized.
1864  */
1865 static void stat_func_call(void *context, ir_graph *irg, ir_node *call)
1866 {
1867         (void) context;
1868         (void) call;
1869         if (! status->stat_options)
1870                 return;
1871
1872         STAT_ENTER;
1873         {
1874                 graph_entry_t *graph = graph_get_entry(irg, status->irg_hash);
1875
1876                 cnt_inc(&graph->cnt[gcnt_acc_real_func_call]);
1877         }
1878         STAT_LEAVE;
1879 }  /* stat_func_call */
1880
1881 /**
1882  * Hook: A multiply was replaced by a series of Shifts/Adds/Subs.
1883  *
1884  * @param ctx  the hook context
1885  */
1886 static void stat_arch_dep_replace_mul_with_shifts(void *ctx, ir_node *mul) {
1887         (void) ctx;
1888         if (! status->stat_options)
1889                 return;
1890
1891         STAT_ENTER;
1892         {
1893                 graph_entry_t *graph = graph_get_entry(current_ir_graph, status->irg_hash);
1894                 removed_due_opt(mul, graph->opt_hash[HOOK_OPT_ARCH_DEP], HOOK_OPT_ARCH_DEP);
1895         }
1896         STAT_LEAVE;
1897 }  /* stat_arch_dep_replace_mul_with_shifts */
1898
1899 /**
1900  * Hook: A division by const was replaced.
1901  *
1902  * @param ctx   the hook context
1903  * @param node  the division node that will be optimized
1904  */
1905 static void stat_arch_dep_replace_division_by_const(void *ctx, ir_node *node) {
1906         (void) ctx;
1907         if (! status->stat_options)
1908                 return;
1909
1910         STAT_ENTER;
1911         {
1912                 graph_entry_t *graph = graph_get_entry(current_ir_graph, status->irg_hash);
1913                 removed_due_opt(node, graph->opt_hash[HOOK_OPT_ARCH_DEP], HOOK_OPT_ARCH_DEP);
1914         }
1915         STAT_LEAVE;
1916 }  /* stat_arch_dep_replace_division_by_const */
1917
1918 /*
1919  * Update the register pressure of a block.
1920  *
1921  * @param irg        the irg containing the block
1922  * @param block      the block for which the reg pressure should be set
1923  * @param pressure   the pressure
1924  * @param class_name the name of the register class
1925  */
1926 void stat_be_block_regpressure(ir_graph *irg, ir_node *block, int pressure, const char *class_name)
1927 {
1928         if (! status->stat_options)
1929                 return;
1930
1931         STAT_ENTER;
1932         {
1933                 graph_entry_t        *graph = graph_get_entry(irg, status->irg_hash);
1934                 be_block_entry_t     *block_ent;
1935                 reg_pressure_entry_t *rp_ent;
1936
1937                 block_ent = be_block_get_entry(&status->be_data, get_irn_node_nr(block), graph->be_block_hash);
1938                 rp_ent    = obstack_alloc(&status->be_data, sizeof(*rp_ent));
1939                 memset(rp_ent, 0, sizeof(*rp_ent));
1940
1941                 rp_ent->class_name = class_name;
1942                 rp_ent->pressure   = pressure;
1943
1944                 pset_insert(block_ent->reg_pressure, rp_ent, HASH_PTR(class_name));
1945         }
1946         STAT_LEAVE;
1947 }  /* stat_be_block_regpressure */
1948
1949 /**
1950  * Update the distribution of ready nodes of a block
1951  *
1952  * @param irg        the irg containing the block
1953  * @param block      the block for which the reg pressure should be set
1954  * @param num_ready  the number of ready nodes
1955  */
1956 void stat_be_block_sched_ready(ir_graph *irg, ir_node *block, int num_ready)
1957 {
1958         if (! status->stat_options)
1959                 return;
1960
1961         STAT_ENTER;
1962         {
1963                 graph_entry_t    *graph = graph_get_entry(irg, status->irg_hash);
1964                 be_block_entry_t *block_ent;
1965
1966                 block_ent = be_block_get_entry(&status->be_data, get_irn_node_nr(block), graph->be_block_hash);
1967
1968                 /* increase the counter of corresponding number of ready nodes */
1969                 stat_inc_int_distrib_tbl(block_ent->sched_ready, num_ready);
1970         }
1971         STAT_LEAVE;
1972 }  /* stat_be_block_sched_ready */
1973
1974 /**
1975  * Update the permutation statistic of a block.
1976  *
1977  * @param class_name the name of the register class
1978  * @param n_regs     number of registers in the register class
1979  * @param perm       the perm node
1980  * @param block      the block containing the perm
1981  * @param size       the size of the perm
1982  * @param real_size  number of pairs with different registers
1983  */
1984 void stat_be_block_stat_perm(const char *class_name, int n_regs, ir_node *perm, ir_node *block,
1985                              int size, int real_size)
1986 {
1987         if (! status->stat_options)
1988                 return;
1989
1990         STAT_ENTER;
1991         {
1992                 graph_entry_t      *graph = graph_get_entry(get_irn_irg(block), status->irg_hash);
1993                 be_block_entry_t   *block_ent;
1994                 perm_class_entry_t *pc_ent;
1995                 perm_stat_entry_t  *ps_ent;
1996
1997                 block_ent = be_block_get_entry(&status->be_data, get_irn_node_nr(block), graph->be_block_hash);
1998                 pc_ent    = perm_class_get_entry(&status->be_data, class_name, block_ent->perm_class_stat);
1999                 ps_ent    = perm_stat_get_entry(&status->be_data, perm, pc_ent->perm_stat);
2000
2001                 pc_ent->n_regs = n_regs;
2002
2003                 /* update information */
2004                 ps_ent->size      = size;
2005                 ps_ent->real_size = real_size;
2006         }
2007         STAT_LEAVE;
2008 }  /* stat_be_block_stat_perm */
2009
2010 /**
2011  * Update the permutation statistic of a single perm.
2012  *
2013  * @param class_name the name of the register class
2014  * @param perm       the perm node
2015  * @param block      the block containing the perm
2016  * @param is_chain   1 if chain, 0 if cycle
2017  * @param size       length of the cycle/chain
2018  * @param n_ops      the number of ops representing this cycle/chain after lowering
2019  */
2020 void stat_be_block_stat_permcycle(const char *class_name, ir_node *perm, ir_node *block,
2021                                   int is_chain, int size, int n_ops)
2022 {
2023         if (! status->stat_options)
2024                 return;
2025
2026         STAT_ENTER;
2027         {
2028                 graph_entry_t      *graph = graph_get_entry(get_irn_irg(block), status->irg_hash);
2029                 be_block_entry_t   *block_ent;
2030                 perm_class_entry_t *pc_ent;
2031                 perm_stat_entry_t  *ps_ent;
2032
2033                 block_ent = be_block_get_entry(&status->be_data, get_irn_node_nr(block), graph->be_block_hash);
2034                 pc_ent    = perm_class_get_entry(&status->be_data, class_name, block_ent->perm_class_stat);
2035                 ps_ent    = perm_stat_get_entry(&status->be_data, perm, pc_ent->perm_stat);
2036
2037                 if (is_chain) {
2038                         ps_ent->n_copies += n_ops;
2039                         stat_inc_int_distrib_tbl(ps_ent->chains, size);
2040                 } else {
2041                         ps_ent->n_exchg += n_ops;
2042                         stat_inc_int_distrib_tbl(ps_ent->cycles, size);
2043                 }  /* if */
2044         }
2045         STAT_LEAVE;
2046 }  /* stat_be_block_stat_permcycle */
2047
2048 /* Dumps a statistics snapshot. */
2049 void stat_dump_snapshot(const char *name, const char *phase)
2050 {
2051         char fname[2048];
2052         const char *p;
2053         int l;
2054
2055         if (! status->stat_options)
2056                 return;
2057
2058         STAT_ENTER;
2059         {
2060                 graph_entry_t *entry;
2061                 graph_entry_t *global = graph_get_entry(NULL, status->irg_hash);
2062
2063                 /*
2064                  * The constant counter is only global, so we clear it here.
2065                  * Note that it does NOT contain the constants in DELETED
2066                  * graphs due to this.
2067                  */
2068                 if (status->stat_options & FIRMSTAT_COUNT_CONSTS)
2069                         stat_const_clear(status);
2070
2071                 /* build the name */
2072                 p = strrchr(name, '/');
2073 #ifdef _WIN32
2074                 {
2075                         const char *q;
2076
2077                         q = strrchr(name, '\\');
2078
2079                         /* NULL might be not the smallest pointer */
2080                         if (q && (!p || q > p))
2081                                 p = q;
2082                 }
2083 #endif /* _WIN32 */
2084                 if (p) {
2085                         ++p;
2086                         l = p - name;
2087
2088                         if (l > (int) (sizeof(fname) - 1))
2089                                 l = sizeof(fname) - 1;
2090
2091                         memcpy(fname, name, l);
2092                         fname[l] = '\0';
2093                 } else {
2094                         fname[0] = '\0';
2095                         p = name;
2096                 }  /* if */
2097                 strncat(fname, "firmstat-", sizeof(fname));
2098                 strncat(fname, phase, sizeof(fname));
2099                 strncat(fname, "-", sizeof(fname));
2100                 strncat(fname, p, sizeof(fname));
2101
2102                 stat_dump_init(fname);
2103
2104                 /* calculate the graph statistics */
2105                 for (entry = pset_first(status->irg_hash); entry; entry = pset_next(status->irg_hash)) {
2106                         if (entry->irg == NULL) {
2107                                 /* special entry for the global count */
2108                                 continue;
2109                         }  /* if */
2110                         if (! entry->is_deleted) {
2111                                 /* the graph is still alive, count the nodes on it */
2112                                 update_graph_stat(global, entry);
2113                         }  /* if */
2114                 }  /* for */
2115
2116                 /* some calculations are dependent, we pushed them on the wait_q */
2117                 while (! pdeq_empty(status->wait_q)) {
2118                         entry = pdeq_getr(status->wait_q);
2119
2120                         update_graph_stat_2(global, entry);
2121                 }  /* while */
2122
2123                 /* dump per graph */
2124                 for (entry = pset_first(status->irg_hash); entry; entry = pset_next(status->irg_hash)) {
2125                         if (entry->irg == NULL) {
2126                                 /* special entry for the global count */
2127                                 continue;
2128                         }  /* if */
2129
2130                         if (! entry->is_deleted || status->stat_options & FIRMSTAT_COUNT_DELETED) {
2131                                 stat_dump_graph(entry);
2132                                 stat_dump_registered(entry);
2133                         }  /* if */
2134
2135                         if (! entry->is_deleted) {
2136                                 /* clear the counter that are not accumulated */
2137                                 graph_clear_entry(entry, 0);
2138                         }  /* if */
2139                 }  /* for */
2140
2141                 /* dump global */
2142                 stat_dump_graph(global);
2143
2144                 /* dump the const info */
2145                 if (status->stat_options & FIRMSTAT_COUNT_CONSTS)
2146                         stat_dump_consts(&status->const_info);
2147
2148                 /* dump the parameter distribution */
2149                 stat_dump_param_tbl(status->dist_param_cnt, global);
2150
2151                 /* dump the optimization counter and clear them */
2152                 stat_dump_opt_cnt(status->num_opts, ARR_SIZE(status->num_opts));
2153                 clear_optimization_counter();
2154
2155                 stat_dump_finish();
2156
2157                 stat_finish_pattern_history(fname);
2158
2159                 /* clear the global counter here */
2160                 {
2161                         node_entry_t *entry;
2162
2163                         for (entry = pset_first(global->opcode_hash); entry; entry = pset_next(global->opcode_hash)) {
2164                                 opcode_clear_entry(entry);
2165                         }  /* for */
2166                         /* clear all global counter */
2167                         graph_clear_entry(global, 1);
2168                 }
2169         }
2170         STAT_LEAVE;
2171 }  /* stat_dump_snapshot */
2172
2173 /** the hook entries for the Firm statistics module */
2174 static hook_entry_t stat_hooks[hook_last];
2175
2176 /* initialize the statistics module. */
2177 void firm_init_stat(unsigned enable_options)
2178 {
2179 #define X(a)  a, sizeof(a)-1
2180 #define HOOK(h, fkt) \
2181         stat_hooks[h].hook._##h = fkt; register_hook(h, &stat_hooks[h])
2182         unsigned num = 0;
2183
2184         if (! (enable_options & FIRMSTAT_ENABLED))
2185                 return;
2186
2187         status = XMALLOCZ(stat_info_t);
2188
2189         /* enable statistics */
2190         status->stat_options = enable_options & FIRMSTAT_ENABLED ? enable_options : 0;
2191
2192         /* register all hooks */
2193         HOOK(hook_new_ir_op,                          stat_new_ir_op);
2194         HOOK(hook_free_ir_op,                         stat_free_ir_op);
2195         HOOK(hook_new_node,                           stat_new_node);
2196         HOOK(hook_turn_into_id,                       stat_turn_into_id);
2197         HOOK(hook_new_graph,                          stat_new_graph);
2198         HOOK(hook_free_graph,                         stat_free_graph);
2199         HOOK(hook_irg_walk,                           stat_irg_walk);
2200         HOOK(hook_irg_walk_blkwise,                   stat_irg_walk_blkwise);
2201         HOOK(hook_irg_block_walk,                     stat_irg_block_walk);
2202         HOOK(hook_merge_nodes,                        stat_merge_nodes);
2203         HOOK(hook_reassociate,                        stat_reassociate);
2204         HOOK(hook_lower,                              stat_lower);
2205         HOOK(hook_inline,                             stat_inline);
2206         HOOK(hook_tail_rec,                           stat_tail_rec);
2207         HOOK(hook_strength_red,                       stat_strength_red);
2208         HOOK(hook_dead_node_elim,                     stat_dead_node_elim);
2209         HOOK(hook_if_conversion,                      stat_if_conversion);
2210         HOOK(hook_func_call,                          stat_func_call);
2211         HOOK(hook_arch_dep_replace_mul_with_shifts,   stat_arch_dep_replace_mul_with_shifts);
2212         HOOK(hook_arch_dep_replace_division_by_const, stat_arch_dep_replace_division_by_const);
2213
2214         obstack_init(&status->cnts);
2215         obstack_init(&status->be_data);
2216
2217         /* create the hash-tables */
2218         status->irg_hash   = new_pset(graph_cmp, 8);
2219         status->ir_op_hash = new_pset(opcode_cmp_2, 1);
2220
2221         /* create the wait queue */
2222         status->wait_q     = new_pdeq();
2223
2224         if (enable_options & FIRMSTAT_COUNT_STRONG_OP) {
2225                 /* build the pseudo-ops */
2226
2227                 _op_Phi0.code    = --num;
2228                 _op_Phi0.name    = new_id_from_chars(X("Phi0"));
2229
2230                 _op_PhiM.code    = --num;
2231                 _op_PhiM.name    = new_id_from_chars(X("PhiM"));
2232
2233                 _op_ProjM.code   = --num;
2234                 _op_ProjM.name   = new_id_from_chars(X("ProjM"));
2235
2236                 _op_MulC.code    = --num;
2237                 _op_MulC.name    = new_id_from_chars(X("MulC"));
2238
2239                 _op_DivC.code    = --num;
2240                 _op_DivC.name    = new_id_from_chars(X("DivC"));
2241
2242                 _op_ModC.code    = --num;
2243                 _op_ModC.name    = new_id_from_chars(X("ModC"));
2244
2245                 _op_DivModC.code = --num;
2246                 _op_DivModC.name = new_id_from_chars(X("DivModC"));
2247
2248                 _op_QuotC.code   = --num;
2249                 _op_QuotC.name   = new_id_from_chars(X("QuotC"));
2250
2251                 status->op_Phi0    = &_op_Phi0;
2252                 status->op_PhiM    = &_op_PhiM;
2253                 status->op_ProjM   = &_op_ProjM;
2254                 status->op_MulC    = &_op_MulC;
2255                 status->op_DivC    = &_op_DivC;
2256                 status->op_ModC    = &_op_ModC;
2257                 status->op_DivModC = &_op_DivModC;
2258                 status->op_QuotC   = &_op_QuotC;
2259         } else {
2260                 status->op_Phi0    = NULL;
2261                 status->op_PhiM    = NULL;
2262                 status->op_ProjM   = NULL;
2263                 status->op_MulC    = NULL;
2264                 status->op_DivC    = NULL;
2265                 status->op_ModC    = NULL;
2266                 status->op_DivModC = NULL;
2267                 status->op_QuotC   = NULL;
2268         }  /* if */
2269
2270         /* for Florian: count the Sel depth */
2271         if (enable_options & FIRMSTAT_COUNT_SELS) {
2272                 _op_SelSel.code    = --num;
2273                 _op_SelSel.name    = new_id_from_chars(X("Sel(Sel)"));
2274
2275                 _op_SelSelSel.code = --num;
2276                 _op_SelSelSel.name = new_id_from_chars(X("Sel(Sel(Sel))"));
2277
2278                 status->op_SelSel    = &_op_SelSel;
2279                 status->op_SelSelSel = &_op_SelSelSel;
2280         } else {
2281                 status->op_SelSel    = NULL;
2282                 status->op_SelSelSel = NULL;
2283         }  /* if */
2284
2285         /* register the dumper */
2286         stat_register_dumper(&simple_dumper);
2287
2288         if (enable_options & FIRMSTAT_CSV_OUTPUT)
2289                 stat_register_dumper(&csv_dumper);
2290
2291         /* initialize the pattern hash */
2292         stat_init_pattern_history(enable_options & FIRMSTAT_PATTERN_ENABLED);
2293
2294         /* initialize the Const options */
2295         if (enable_options & FIRMSTAT_COUNT_CONSTS)
2296                 stat_init_const_cnt(status);
2297
2298         /* distribution table for parameter counts */
2299         status->dist_param_cnt = stat_new_int_distrib_tbl();
2300
2301         clear_optimization_counter();
2302
2303 #undef HOOK
2304 #undef X
2305 }  /* firm_init_stat */
2306
2307 /**
2308  * Frees all dumper structures.
2309  */
2310 static void stat_term_dumper(void) {
2311         dumper_t *dumper, *next_dumper;
2312
2313         for (dumper = status->dumper; dumper; /* iteration done in loop body */ ) {
2314                 if (dumper->func_map)
2315                         del_pset(dumper->func_map);
2316
2317                 next_dumper = dumper->next;
2318                 free(dumper);
2319                 dumper = next_dumper;
2320         }  /* for */
2321 }  /* stat_term_dumper */
2322
2323
2324 /* Terminates the statistics module, frees all memory. */
2325 void stat_term(void) {
2326         if (status != (stat_info_t *)&status_disable) {
2327                 obstack_free(&status->be_data, NULL);
2328                 obstack_free(&status->cnts, NULL);
2329
2330                 stat_term_dumper();
2331
2332                 xfree(status);
2333                 status = (stat_info_t *)&status_disable;
2334         }
2335 }  /* stat_term */
2336
2337 /* returns 1 if statistics were initialized, 0 otherwise */
2338 int stat_is_active(void) {
2339         return status != (stat_info_t *)&status_disable;
2340 }  /* stat_is_active */
2341
2342 #else
2343
2344 /* initialize the statistics module. */
2345 void firm_init_stat(unsigned enable_options) {}
2346
2347 /* Dumps a statistics snapshot */
2348 void stat_dump_snapshot(const char *name, const char *phase) {}
2349
2350 /* terminates the statistics module, frees all memory */
2351 void stat_term(void);
2352
2353 #endif /* FIRM_STATISTICS */