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 #include "config.h"
  27
  28 #ifdef FIRM_STATISTICS
  29
  30 #include <stdio.h>
  31
  32 #ifdef HAVE_STDLIB_H
  33 # include <stdlib.h>
  34 #endif
  35 #ifdef HAVE_STRING_H
  36 # include <string.h>
  37 #endif
  38
  39 #include "irouts.h"
  40 #include "irdump.h"
  41 #include "hashptr.h"
  42 #include "firmstat_t.h"
  43 #include "pattern.h"
  44 #include "dags.h"
  45 #include "stat_dmp.h"
  46 #include "xmalloc.h"
  47 #include "irhooks.h"
  48
  49 /*
  50  * need this to be static:
  51  * Special pseudo Opcodes that we need to count some interesting cases
  52  */
  53
  54 /**
  55  * The Phi0, a node that is created during SSA construction
  56  */
  57 static ir_op _op_Phi0;
  58
  59 /** The PhiM, just to count memory Phi's. */
  60 static ir_op _op_PhiM;
  61
  62 /** The Mul by Const node. */
  63 static ir_op _op_MulC;
  64
  65 /** The Div by Const node. */
  66 static ir_op _op_DivC;
  67
  68 /** The Div by Const node. */
  69 static ir_op _op_ModC;
  70
  71 /** The Div by Const node. */
  72 static ir_op _op_DivModC;
  73
  74 /** The Quot by Const node. */
  75 static ir_op _op_QuotC;
  76
  77 /** The memory Proj node. */
  78 static ir_op _op_ProjM;
  79
  80 /** A Sel of a Sel */
  81 static ir_op _op_SelSel;
  82
  83 /** A Sel of a Sel of a Sel */
  84 static ir_op _op_SelSelSel;
  85
  86 /* ---------------------------------------------------------------------------------- */
  87
  88 /** Marks the begin of a statistic (hook) function. */
  89 #define STAT_ENTER              ++status->recursive
  90
  91 /** Marks the end of a statistic (hook) functions. */
  92 #define STAT_LEAVE              --status->recursive
  93
  94 /** Allows to enter a statistic function only when we are not already in a hook. */
  95 #define STAT_ENTER_SINGLE       do { if (status->recursive > 0) return; ++status->recursive; } while (0)
  96
  97 /**
  98  * global status
  99  */
 100 static const unsigned status_disable = 0;
 101 static stat_info_t *status = (stat_info_t *)&status_disable;
 102
 103 /**
 104  * Compare two elements of the opcode hash.
 105  */
 106 static int opcode_cmp(const void *elt, const void *key) {
 107         const node_entry_t *e1 = elt;
 108         const node_entry_t *e2 = key;
 109
 110         return e1->op->code - e2->op->code;
 111 }  /* opcode_cmp */
 112
 113 /**
 114  * Compare two elements of the graph hash.
 115  */
 116 static int graph_cmp(const void *elt, const void *key) {
 117         const graph_entry_t *e1 = elt;
 118         const graph_entry_t *e2 = key;
 119
 120         return e1->irg != e2->irg;
 121 }  /* graph_cmp */
 122
 123 /**
 124  * Compare two elements of the optimization hash.
 125  */
 126 static int opt_cmp(const void *elt, const void *key) {
 127         const opt_entry_t *e1 = elt;
 128         const opt_entry_t *e2 = key;
 129
 130         return e1->op->code != e2->op->code;
 131 }  /* opt_cmp */
 132
 133 /**
 134  * Compare two elements of the block/extbb hash.
 135  */
 136 static int block_cmp(const void *elt, const void *key) {
 137         const block_entry_t *e1 = elt;
 138         const block_entry_t *e2 = key;
 139
 140         /* it's enough to compare the block number */
 141         return e1->block_nr != e2->block_nr;
 142 }  /* block_cmp */
 143
 144 /**
 145  * Compare two elements of the be_block hash.
 146  */
 147 static int be_block_cmp(const void *elt, const void *key) {
 148         const be_block_entry_t *e1 = elt;
 149         const be_block_entry_t *e2 = key;
 150
 151         return e1->block_nr != e2->block_nr;
 152 }  /* be_block_cmp */
 153
 154 /**
 155  * Compare two elements of reg pressure hash.
 156  */
 157 static int reg_pressure_cmp(const void *elt, const void *key) {
 158         const reg_pressure_entry_t *e1 = elt;
 159         const reg_pressure_entry_t *e2 = key;
 160
 161         return e1->class_name != e2->class_name;
 162 }  /* reg_pressure_cmp */
 163
 164 /**
 165  * Compare two elements of the perm_stat hash.
 166  */
 167 static int perm_stat_cmp(const void *elt, const void *key) {
 168         const perm_stat_entry_t *e1 = elt;
 169         const perm_stat_entry_t *e2 = key;
 170
 171         return e1->perm != e2->perm;
 172 }  /* perm_stat_cmp */
 173
 174 /**
 175  * Compare two elements of the perm_class hash.
 176  */
 177 static int perm_class_cmp(const void *elt, const void *key) {
 178         const perm_class_entry_t *e1 = elt;
 179         const perm_class_entry_t *e2 = key;
 180
 181         return e1->class_name != e2->class_name;
 182 }  /* perm_class_cmp */
 183
 184 /**
 185  * Compare two elements of the ir_op hash.
 186  */
 187 static int opcode_cmp_2(const void *elt, const void *key) {
 188         const ir_op *e1 = elt;
 189         const ir_op *e2 = key;
 190
 191         return e1->code != e2->code;
 192 }  /* opcode_cmp_2 */
 193
 194 /**
 195  * Compare two elements of the address_mark set.
 196  */
 197 static int address_mark_cmp(const void *elt, const void *key, size_t size) {
 198         const address_mark_entry_t *e1 = elt;
 199         const address_mark_entry_t *e2 = key;
 200         (void) size;
 201
 202         /* compare only the nodes, the rest is used as data container */
 203         return e1->node != e2->node;
 204 }  /* address_mark_cmp */
 205
 206 /**
 207  * Clear all counter in a node_entry_t.
 208  */
 209 static void opcode_clear_entry(node_entry_t *elem) {
 210         cnt_clr(&elem->cnt_alive);
 211         cnt_clr(&elem->new_node);
 212         cnt_clr(&elem->into_Id);
 213         cnt_clr(&elem->normalized);
 214 }  /* opcode_clear_entry */
 215
 216 /**
 217  * Returns the associates node_entry_t for an ir_op (and allocates
 218  * one if not yet available).
 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, NULL for the global counter
 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 i, 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         case iro_Phi:
1005                 /* check for non-strict Phi nodes */
1006                 for (i = arity - 1; i >= 0; --i) {
1007                         ir_node *pred = get_Phi_pred(node, i);
1008                         if (is_Unknown(pred)) {
1009                                 /* found an Unknown predecessor, graph is not strict */
1010                                 graph->is_strict = 0;
1011                                 break;
1012                         }
1013                 }
1014         default:
1015                 ;
1016         }  /* switch */
1017
1018         /* we want to count the constant IN nodes, not the CSE'ed constant's itself */
1019         if (status->stat_options & FIRMSTAT_COUNT_CONSTS) {
1020                 int i;
1021
1022                 for (i = get_irn_arity(node) - 1; i >= 0; --i) {
1023                         ir_node *pred = get_irn_n(node, i);
1024
1025                         if (is_Const(pred)) {
1026                                 /* check properties of constants */
1027                                 stat_update_const(status, pred, graph);
1028                         }  /* if */
1029                 }  /* for */
1030         }  /* if */
1031 }  /* update_node_stat */
1032
1033 /**
1034  * Walker for reachable nodes count for graphs on the wait_q.
1035  */
1036 static void update_node_stat_2(ir_node *node, void *env) {
1037         graph_entry_t *graph = env;
1038
1039         /* check for properties that depends on calls like recursion/leaf/indirect call */
1040         if (is_Call(node))
1041                 stat_update_call_2(node, graph);
1042 }  /* update_node_stat_2 */
1043
1044 /**
1045  * Get the current address mark.
1046  */
1047 static unsigned get_adr_mark(graph_entry_t *graph, ir_node *node) {
1048         address_mark_entry_t *value = set_find(graph->address_mark, &node, sizeof(*value), HASH_PTR(node));
1049
1050         return value ? value->mark : 0;
1051 }  /* get_adr_mark */
1052
1053 /**
1054  * Set the current address mark.
1055  */
1056 static void set_adr_mark(graph_entry_t *graph, ir_node *node, unsigned val) {
1057         address_mark_entry_t *value = set_insert(graph->address_mark, &node, sizeof(*value), HASH_PTR(node));
1058
1059         value->mark = val;
1060 }  /* set_adr_mark */
1061
1062 #undef DUMP_ADR_MODE
1063
1064 #ifdef DUMP_ADR_MODE
1065 /**
1066  * a vcg attribute hook: Color a node with a different color if
1067  * it's identified as a part of an address expression or at least referenced
1068  * by an address expression.
1069  */
1070 static int stat_adr_mark_hook(FILE *F, ir_node *node, ir_node *local)
1071 {
1072         ir_node *n           = local ? local : node;
1073         ir_graph *irg        = get_irn_irg(n);
1074         graph_entry_t *graph = graph_get_entry(irg, status->irg_hash);
1075         unsigned mark        = get_adr_mark(graph, n);
1076
1077         if (mark & MARK_ADDRESS_CALC)
1078                 fprintf(F, "color: purple");
1079         else if ((mark & (MARK_REF_ADR | MARK_REF_NON_ADR)) == MARK_REF_ADR)
1080                 fprintf(F, "color: pink");
1081         else if ((mark & (MARK_REF_ADR | MARK_REF_NON_ADR)) == (MARK_REF_ADR|MARK_REF_NON_ADR))
1082                 fprintf(F, "color: lightblue");
1083         else
1084                 return 0;
1085
1086         /* I know the color! */
1087         return 1;
1088 }  /* stat_adr_mark_hook */
1089 #endif /* DUMP_ADR_MODE */
1090
1091 /**
1092  * Return the "operational" mode of a Firm node.
1093  */
1094 static ir_mode *get_irn_op_mode(ir_node *node) {
1095         switch (get_irn_opcode(node)) {
1096         case iro_Load:
1097                 return get_Load_mode(node);
1098         case iro_Store:
1099                 return get_irn_mode(get_Store_value(node));
1100         case iro_DivMod:
1101                 return get_irn_mode(get_DivMod_left(node));
1102         case iro_Div:
1103                 return get_irn_mode(get_Div_left(node));
1104         case iro_Mod:
1105                 return get_irn_mode(get_Mod_left(node));
1106         case iro_Cmp:
1107                 /* Cmp is no address calculation, or is it? */
1108         default:
1109                 return get_irn_mode(node);
1110         }  /* switch */
1111 }  /* get_irn_op_mode */
1112
1113 /**
1114  * Post-walker that marks every node that is an address calculation.
1115  *
1116  * Users of a node must be visited first. We ensure this by
1117  * calling it in the post of an outs walk. This should work even in cycles,
1118  * while the normal pre-walk will not.
1119  */
1120 static void mark_address_calc(ir_node *node, void *env) {
1121         graph_entry_t *graph = env;
1122         ir_mode *mode = get_irn_op_mode(node);
1123         int i, n;
1124         unsigned mark_preds = MARK_REF_NON_ADR;
1125
1126         if (! mode_is_data(mode))
1127                 return;
1128
1129         if (mode_is_reference(mode)) {
1130                 /* a reference is calculated here, we are sure */
1131                 set_adr_mark(graph, node, MARK_ADDRESS_CALC);
1132
1133                 mark_preds = MARK_REF_ADR;
1134         } else {
1135                 unsigned mark = get_adr_mark(graph, node);
1136
1137                 if ((mark & (MARK_REF_ADR | MARK_REF_NON_ADR)) == MARK_REF_ADR) {
1138                         /*
1139                          * this node has no reference mode, but is only
1140                          * referenced by address calculations
1141                          */
1142                         mark_preds = MARK_REF_ADR;
1143                 }  /* if */
1144         }  /* if */
1145
1146         /* mark all predecessors */
1147         for (i = 0, n = get_irn_arity(node); i < n; ++i) {
1148                 ir_node *pred = get_irn_n(node, i);
1149
1150                 mode = get_irn_op_mode(pred);
1151                 if (! mode_is_data(mode))
1152                         continue;
1153
1154                 set_adr_mark(graph, pred, get_adr_mark(graph, pred) | mark_preds);
1155         }  /* for */
1156 }  /* mark_address_calc */
1157
1158 /**
1159  * Post-walker that marks every node that is an address calculation.
1160  *
1161  * Users of a node must be visited first. We ensure this by
1162  * calling it in the post of an outs walk. This should work even in cycles,
1163  * while the normal pre-walk will not.
1164  */
1165 static void count_adr_ops(ir_node *node, void *env) {
1166         graph_entry_t *graph = env;
1167         unsigned mark        = get_adr_mark(graph, node);
1168
1169         if (mark & MARK_ADDRESS_CALC)
1170                 cnt_inc(&graph->cnt[gcnt_pure_adr_ops]);
1171         else if ((mark & (MARK_REF_ADR | MARK_REF_NON_ADR)) == MARK_REF_ADR)
1172                 cnt_inc(&graph->cnt[gcnt_pure_adr_ops]);
1173         else if ((mark & (MARK_REF_ADR | MARK_REF_NON_ADR)) == (MARK_REF_ADR|MARK_REF_NON_ADR))
1174                 cnt_inc(&graph->cnt[gcnt_all_adr_ops]);
1175 }  /* count_adr_ops */
1176
1177 /**
1178  * Called for every graph when the graph is either deleted or stat_dump_snapshot()
1179  * is called, must recalculate all statistic info.
1180  *
1181  * @param global    The global entry
1182  * @param graph     The current entry
1183  */
1184 static void update_graph_stat(graph_entry_t *global, graph_entry_t *graph)
1185 {
1186         node_entry_t *entry;
1187         int i;
1188
1189         /* clear first the alive counter in the graph */
1190         foreach_pset(graph->opcode_hash, entry) {
1191                 cnt_clr(&entry->cnt_alive);
1192         }  /* foreach_pset */
1193
1194         /* set pessimistic values */
1195         graph->is_leaf       = 1;
1196         graph->is_leaf_call  = LCS_UNKNOWN;
1197         graph->is_recursive  = 0;
1198         graph->is_chain_call = 1;
1199         graph->is_strict     = 1;
1200
1201         /* create new block counter */
1202         graph->block_hash = new_pset(block_cmp, 5);
1203
1204         /* we need dominator info */
1205         if (graph->irg != get_const_code_irg()) {
1206                 assure_doms(graph->irg);
1207
1208                 if (status->stat_options & FIRMSTAT_COUNT_EXTBB) {
1209                         /* we need extended basic blocks */
1210                         compute_extbb(graph->irg);
1211
1212                         /* create new extbb counter */
1213                         graph->extbb_hash = new_pset(block_cmp, 5);
1214                 }  /* if */
1215         }  /* if */
1216
1217         /* count the nodes in the graph */
1218         irg_walk_graph(graph->irg, update_node_stat, NULL, graph);
1219
1220 #if 0
1221         /* Uncomment this code if chain-call means call exact one. */
1222         entry = opcode_get_entry(op_Call, graph->opcode_hash);
1223
1224         /* check if we have more than 1 call */
1225         if (cnt_gt(entry->cnt_alive, 1))
1226                 graph->is_chain_call = 0;
1227 #endif
1228
1229         /* recursive functions are never chain calls, leafs don't have calls */
1230         if (graph->is_recursive || graph->is_leaf)
1231                 graph->is_chain_call = 0;
1232
1233         /* assume we walk every graph only ONCE, we could sum here the global count */
1234         foreach_pset(graph->opcode_hash, entry) {
1235                 node_entry_t *g_entry = opcode_get_entry(entry->op, global->opcode_hash);
1236
1237                 /* update the node counter */
1238                 cnt_add(&g_entry->cnt_alive, &entry->cnt_alive);
1239         }  /* foreach_pset */
1240
1241         /* count the number of address calculation */
1242         if (graph->irg != get_const_code_irg()) {
1243                 ir_graph *rem = current_ir_graph;
1244
1245                 assure_irg_outs(graph->irg);
1246
1247                 /* Must be done an the outs graph */
1248                 current_ir_graph = graph->irg;
1249                 irg_out_walk(get_irg_start(graph->irg), NULL, mark_address_calc, graph);
1250                 current_ir_graph = rem;
1251
1252 #ifdef DUMP_ADR_MODE
1253                 /* register the vcg hook and dump the graph for test */
1254                 set_dump_node_vcgattr_hook(stat_adr_mark_hook);
1255                 dump_ir_block_graph(graph->irg, "-adr");
1256                 set_dump_node_vcgattr_hook(NULL);
1257 #endif /* DUMP_ADR_MODE */
1258
1259                 irg_walk_graph(graph->irg, NULL, count_adr_ops, graph);
1260         }  /* if */
1261
1262         /* count the DAG's */
1263         if (status->stat_options & FIRMSTAT_COUNT_DAG)
1264                 count_dags_in_graph(global, graph);
1265
1266         /* calculate the patterns of this graph */
1267         stat_calc_pattern_history(graph->irg);
1268
1269         /* leaf function did not call others */
1270         if (graph->is_leaf)
1271                 graph->is_leaf_call = LCS_NON_LEAF_CALL;
1272         else if (graph->is_leaf_call == LCS_UNKNOWN) {
1273                 /* we still don't know if this graph calls leaf-functions, so enqueue */
1274                 pdeq_putl(status->wait_q, graph);
1275         }  /* if */
1276
1277         /* we have analyzed this graph */
1278         graph->is_analyzed = 1;
1279
1280         /* accumulate all counter's */
1281         for (i = 0; i < _gcnt_last; ++i)
1282                 cnt_add(&global->cnt[i], &graph->cnt[i]);
1283 }  /* update_graph_stat */
1284
1285 /**
1286  * Called for every graph that was on the wait_q in stat_dump_snapshot()
1287  * must finish all statistic info calculations.
1288  *
1289  * @param global    The global entry
1290  * @param graph     The current entry
1291  */
1292 static void update_graph_stat_2(graph_entry_t *global, graph_entry_t *graph)
1293 {
1294         (void) global;
1295         if (graph->is_deleted) {
1296                 /* deleted, ignore */
1297                 return;
1298         }
1299
1300         if (graph->irg) {
1301                 /* count the nodes in the graph */
1302                 irg_walk_graph(graph->irg, update_node_stat_2, NULL, graph);
1303
1304                 if (graph->is_leaf_call == LCS_UNKNOWN)
1305                         graph->is_leaf_call = LCS_LEAF_CALL;
1306         }  /* if */
1307 }  /* update_graph_stat_2 */
1308
1309 /**
1310  * Register a dumper.
1311  */
1312 static void stat_register_dumper(const dumper_t *dumper) {
1313         dumper_t *p = XMALLOC(dumper_t);
1314
1315         memcpy(p, dumper, sizeof(*p));
1316
1317         p->next        = status->dumper;
1318         p->status      = status;
1319         status->dumper = p;
1320
1321         /* FIXME: memory leak */
1322 }  /* stat_register_dumper */
1323
1324 /**
1325  * Dumps the statistics of an IR graph.
1326  */
1327 static void stat_dump_graph(graph_entry_t *entry) {
1328         dumper_t *dumper;
1329
1330         for (dumper = status->dumper; dumper; dumper = dumper->next) {
1331                 if (dumper->dump_graph)
1332                         dumper->dump_graph(dumper, entry);
1333         }  /* for */
1334 }  /* stat_dump_graph */
1335
1336 /**
1337  * Calls all registered dumper functions.
1338  */
1339 static void stat_dump_registered(graph_entry_t *entry) {
1340         dumper_t *dumper;
1341
1342         for (dumper = status->dumper; dumper; dumper = dumper->next) {
1343                 if (dumper->func_map) {
1344                         dump_graph_FUNC func;
1345
1346                         foreach_pset(dumper->func_map, func)
1347                                 func(dumper, entry);
1348                 }  /* if */
1349         }  /* for */
1350 }  /* stat_dump_registered */
1351
1352 /**
1353  * Dumps a constant table.
1354  */
1355 static void stat_dump_consts(const constant_info_t *tbl) {
1356         dumper_t *dumper;
1357
1358         for (dumper = status->dumper; dumper; dumper = dumper->next) {
1359                 if (dumper->dump_const_tbl)
1360                         dumper->dump_const_tbl(dumper, tbl);
1361         }  /* for */
1362 }  /* stat_dump_consts */
1363
1364 /**
1365  * Dumps the parameter distribution
1366  */
1367 static void stat_dump_param_tbl(const distrib_tbl_t *tbl, graph_entry_t *global) {
1368         dumper_t *dumper;
1369
1370         for (dumper = status->dumper; dumper; dumper = dumper->next) {
1371                 if (dumper->dump_param_tbl)
1372                         dumper->dump_param_tbl(dumper, tbl, global);
1373         }  /* for */
1374 }  /* stat_dump_param_tbl */
1375
1376 /**
1377  * Dumps the optimization counter
1378  */
1379 static void stat_dump_opt_cnt(const counter_t *tbl, unsigned len) {
1380         dumper_t *dumper;
1381
1382         for (dumper = status->dumper; dumper; dumper = dumper->next) {
1383                 if (dumper->dump_opt_cnt)
1384                         dumper->dump_opt_cnt(dumper, tbl, len);
1385         }  /* for */
1386 }  /* stat_dump_opt_cnt */
1387
1388 /**
1389  * Initialize the dumper.
1390  */
1391 static void stat_dump_init(const char *name) {
1392         dumper_t *dumper;
1393
1394         for (dumper = status->dumper; dumper; dumper = dumper->next) {
1395                 if (dumper->init)
1396                         dumper->init(dumper, name);
1397         }  /* for */
1398 }  /* stat_dump_init */
1399
1400 /**
1401  * Finish the dumper.
1402  */
1403 static void stat_dump_finish(void) {
1404         dumper_t *dumper;
1405
1406         for (dumper = status->dumper; dumper; dumper = dumper->next) {
1407                 if (dumper->finish)
1408                         dumper->finish(dumper);
1409         }  /* for */
1410 }  /* stat_dump_finish */
1411
1412 /**
1413  * Register an additional function for all dumper.
1414  */
1415 void stat_register_dumper_func(dump_graph_FUNC func) {
1416         dumper_t *dumper;
1417
1418         for (dumper = status->dumper; dumper; dumper = dumper->next) {
1419                 if (! dumper->func_map)
1420                         dumper->func_map = pset_new_ptr(3);
1421                 pset_insert_ptr(dumper->func_map, func);
1422         }  /* for */
1423 }  /* stat_register_dumper_func */
1424
1425 /* ---------------------------------------------------------------------- */
1426
1427 /*
1428  * Helper: get an ir_op from an opcode.
1429  */
1430 ir_op *stat_get_op_from_opcode(ir_opcode code) {
1431         return opcode_find_entry(code, status->ir_op_hash);
1432 }  /* stat_get_op_from_opcode */
1433
1434 /**
1435  * Hook: A new IR op is registered.
1436  *
1437  * @param ctx  the hook context
1438  * @param op   the new IR opcode that was created.
1439  */
1440 static void stat_new_ir_op(void *ctx, ir_op *op) {
1441         (void) ctx;
1442         if (! status->stat_options)
1443                 return;
1444
1445         STAT_ENTER;
1446         {
1447                 graph_entry_t *graph = graph_get_entry(NULL, status->irg_hash);
1448
1449                 /* execute for side effect :-) */
1450                 (void)opcode_get_entry(op, graph->opcode_hash);
1451
1452                 pset_insert(status->ir_op_hash, op, op->code);
1453         }
1454         STAT_LEAVE;
1455 }  /* stat_new_ir_op */
1456
1457 /**
1458  * Hook: An IR op is freed.
1459  *
1460  * @param ctx  the hook context
1461  * @param op   the IR opcode that is freed
1462  */
1463 static void stat_free_ir_op(void *ctx, ir_op *op) {
1464         (void) ctx;
1465         (void) op;
1466         if (! status->stat_options)
1467                 return;
1468
1469         STAT_ENTER;
1470         {
1471         }
1472         STAT_LEAVE;
1473 }  /* stat_free_ir_op */
1474
1475 /**
1476  * Hook: A new node is created.
1477  *
1478  * @param ctx   the hook context
1479  * @param irg   the IR graph on which the node is created
1480  * @param node  the new IR node that was created
1481  */
1482 static void stat_new_node(void *ctx, ir_graph *irg, ir_node *node) {
1483         (void) ctx;
1484         (void) irg;
1485         if (! status->stat_options)
1486                 return;
1487
1488         /* do NOT count during dead node elimination */
1489         if (status->in_dead_node_elim)
1490                 return;
1491
1492         STAT_ENTER;
1493         {
1494                 node_entry_t *entry;
1495                 graph_entry_t *graph;
1496                 ir_op *op = stat_get_irn_op(node);
1497
1498                 /* increase global value */
1499                 graph = graph_get_entry(NULL, status->irg_hash);
1500                 entry = opcode_get_entry(op, graph->opcode_hash);
1501                 cnt_inc(&entry->new_node);
1502
1503                 /* increase local value */
1504                 graph = graph_get_entry(current_ir_graph, status->irg_hash);
1505                 entry = opcode_get_entry(op, graph->opcode_hash);
1506                 cnt_inc(&entry->new_node);
1507         }
1508         STAT_LEAVE;
1509 }  /* stat_new_node */
1510
1511 /**
1512  * Hook: A node is changed into a Id node
1513  *
1514  * @param ctx   the hook context
1515  * @param node  the IR node that will be turned into an ID
1516  */
1517 static void stat_turn_into_id(void *ctx, ir_node *node) {
1518         (void) ctx;
1519         if (! status->stat_options)
1520                 return;
1521
1522         STAT_ENTER;
1523         {
1524                 node_entry_t *entry;
1525                 graph_entry_t *graph;
1526                 ir_op *op = stat_get_irn_op(node);
1527
1528                 /* increase global value */
1529                 graph = graph_get_entry(NULL, status->irg_hash);
1530                 entry = opcode_get_entry(op, graph->opcode_hash);
1531                 cnt_inc(&entry->into_Id);
1532
1533                 /* increase local value */
1534                 graph = graph_get_entry(current_ir_graph, status->irg_hash);
1535                 entry = opcode_get_entry(op, graph->opcode_hash);
1536                 cnt_inc(&entry->into_Id);
1537         }
1538         STAT_LEAVE;
1539 }  /* stat_turn_into_id */
1540
1541 /**
1542  * Hook: A node is normalized
1543  *
1544  * @param ctx   the hook context
1545  * @param node  the IR node that was normalized
1546  */
1547 static void stat_normalize(void *ctx, ir_node *node) {
1548         (void) ctx;
1549         if (! status->stat_options)
1550                 return;
1551
1552         STAT_ENTER;
1553         {
1554                 node_entry_t *entry;
1555                 graph_entry_t *graph;
1556                 ir_op *op = stat_get_irn_op(node);
1557
1558                 /* increase global value */
1559                 graph = graph_get_entry(NULL, status->irg_hash);
1560                 entry = opcode_get_entry(op, graph->opcode_hash);
1561                 cnt_inc(&entry->normalized);
1562
1563                 /* increase local value */
1564                 graph = graph_get_entry(current_ir_graph, status->irg_hash);
1565                 entry = opcode_get_entry(op, graph->opcode_hash);
1566                 cnt_inc(&entry->normalized);
1567         }
1568         STAT_LEAVE;
1569 }  /* stat_normalize */
1570
1571 /**
1572  * Hook: A new graph was created
1573  *
1574  * @param ctx  the hook context
1575  * @param irg  the new IR graph that was created
1576  * @param ent  the entity of this graph
1577  */
1578 static void stat_new_graph(void *ctx, ir_graph *irg, ir_entity *ent) {
1579         (void) ctx;
1580         if (! status->stat_options)
1581                 return;
1582
1583         STAT_ENTER;
1584         {
1585                 /* execute for side effect :-) */
1586                 graph_entry_t * graph = graph_get_entry(irg, status->irg_hash);
1587
1588                 graph->ent           = ent;
1589                 graph->is_deleted    = 0;
1590                 graph->is_leaf       = 0;
1591                 graph->is_leaf_call  = 0;
1592                 graph->is_recursive  = 0;
1593                 graph->is_chain_call = 0;
1594                 graph->is_strict     = 1;
1595                 graph->is_analyzed   = 0;
1596         }
1597         STAT_LEAVE;
1598 }  /* stat_new_graph */
1599
1600 /**
1601  * Hook: A graph will be deleted
1602  *
1603  * @param ctx  the hook context
1604  * @param irg  the IR graph that will be deleted
1605  *
1606  * Note that we still hold the information for this graph
1607  * in our hash maps, only a flag is set which prevents this
1608  * information from being changed, it's "frozen" from now.
1609  */
1610 static void stat_free_graph(void *ctx, ir_graph *irg) {
1611         (void) ctx;
1612         if (! status->stat_options)
1613                 return;
1614
1615         STAT_ENTER;
1616         {
1617                 graph_entry_t *graph  = graph_get_entry(irg, status->irg_hash);
1618                 graph_entry_t *global = graph_get_entry(NULL, status->irg_hash);
1619
1620                 graph->is_deleted = 1;
1621
1622                 if (status->stat_options & FIRMSTAT_COUNT_DELETED) {
1623                         /* count the nodes of the graph yet, it will be destroyed later */
1624                         update_graph_stat(global, graph);
1625                 }  /* if */
1626         }
1627         STAT_LEAVE;
1628 }  /* stat_free_graph */
1629
1630 /**
1631  * Hook: A walk over a graph is initiated. Do not count walks from statistic code.
1632  *
1633  * @param ctx  the hook context
1634  * @param irg  the IR graph that will be walked
1635  * @param pre  the pre walker
1636  * @param post the post walker
1637  */
1638 static void stat_irg_walk(void *ctx, ir_graph *irg, generic_func *pre, generic_func *post)
1639 {
1640         (void) ctx;
1641         (void) pre;
1642         (void) post;
1643         if (! status->stat_options)
1644                 return;
1645
1646         STAT_ENTER_SINGLE;
1647         {
1648                 graph_entry_t *graph = graph_get_entry(irg, status->irg_hash);
1649
1650                 cnt_inc(&graph->cnt[gcnt_acc_walked]);
1651         }
1652         STAT_LEAVE;
1653 }  /* stat_irg_walk */
1654
1655 /**
1656  * Hook: A walk over a graph in block-wise order is initiated. Do not count walks from statistic code.
1657  *
1658  * @param ctx  the hook context
1659  * @param irg  the IR graph that will be walked
1660  * @param pre  the pre walker
1661  * @param post the post walker
1662  */
1663 static void stat_irg_walk_blkwise(void *ctx, ir_graph *irg, generic_func *pre, generic_func *post)
1664 {
1665         /* for now, do NOT differentiate between blockwise and normal */
1666         stat_irg_walk(ctx, irg, pre, post);
1667 }  /* stat_irg_walk_blkwise */
1668
1669 /**
1670  * Hook: A walk over the graph's blocks is initiated. Do not count walks from statistic code.
1671  *
1672  * @param ctx  the hook context
1673  * @param irg  the IR graph that will be walked
1674  * @param node the IR node
1675  * @param pre  the pre walker
1676  * @param post the post walker
1677  */
1678 static void stat_irg_block_walk(void *ctx, ir_graph *irg, ir_node *node, generic_func *pre, generic_func *post)
1679 {
1680         (void) ctx;
1681         (void) node;
1682         (void) pre;
1683         (void) post;
1684         if (! status->stat_options)
1685                 return;
1686
1687         STAT_ENTER_SINGLE;
1688         {
1689                 graph_entry_t *graph = graph_get_entry(irg, status->irg_hash);
1690
1691                 cnt_inc(&graph->cnt[gcnt_acc_walked_blocks]);
1692         }
1693         STAT_LEAVE;
1694 }  /* stat_irg_block_walk */
1695
1696 /**
1697  * Called for every node that is removed due to an optimization.
1698  *
1699  * @param n     the IR node that will be removed
1700  * @param hmap  the hash map containing ir_op* -> opt_entry_t*
1701  * @param kind  the optimization kind
1702  */
1703 static void removed_due_opt(ir_node *n, hmap_opt_entry_t *hmap, hook_opt_kind kind) {
1704         opt_entry_t *entry;
1705         ir_op *op = stat_get_irn_op(n);
1706
1707         /* ignore CSE for Constants */
1708         if (kind == HOOK_OPT_CSE && (is_Const(n) || is_SymConst(n)))
1709                 return;
1710
1711         /* increase global value */
1712         entry = opt_get_entry(op, hmap);
1713         cnt_inc(&entry->count);
1714 }  /* removed_due_opt */
1715
1716 /**
1717  * Hook: Some nodes were optimized into some others due to an optimization.
1718  *
1719  * @param ctx  the hook context
1720  */
1721 static void stat_merge_nodes(
1722     void *ctx,
1723     ir_node **new_node_array, int new_num_entries,
1724     ir_node **old_node_array, int old_num_entries,
1725     hook_opt_kind opt)
1726 {
1727         (void) ctx;
1728         if (! status->stat_options)
1729                 return;
1730
1731         STAT_ENTER;
1732         {
1733                 int i, j;
1734                 graph_entry_t *graph = graph_get_entry(current_ir_graph, status->irg_hash);
1735
1736                 cnt_inc(&status->num_opts[opt]);
1737                 if (status->reassoc_run)
1738                         opt = HOOK_OPT_REASSOC;
1739
1740                 for (i = 0; i < old_num_entries; ++i) {
1741                         /* nodes might be in new and old, so if we found a node
1742                            in both sets, this one  is NOT removed */
1743                         for (j = 0; j < new_num_entries; ++j) {
1744                                 if (old_node_array[i] == new_node_array[j])
1745                                         break;
1746                         }  /* for */
1747                         if (j >= new_num_entries) {
1748                                 int xopt = opt;
1749
1750                                 /* sometimes we did not detect, that it is replaced by a Const */
1751                                 if (opt == HOOK_OPT_CONFIRM && new_num_entries == 1) {
1752                                         ir_op *op = get_irn_op(new_node_array[0]);
1753
1754                                         if (op == op_Const || op == op_SymConst)
1755                                                 xopt = HOOK_OPT_CONFIRM_C;
1756                                 }  /* if */
1757
1758                                 removed_due_opt(old_node_array[i], graph->opt_hash[xopt], xopt);
1759                         }  /* if */
1760                 }  /* for */
1761         }
1762         STAT_LEAVE;
1763 }  /* stat_merge_nodes */
1764
1765 /**
1766  * Hook: Reassociation is started/stopped.
1767  *
1768  * @param ctx   the hook context
1769  * @param flag  if non-zero, reassociation is started else stopped
1770  */
1771 static void stat_reassociate(void *ctx, int flag) {
1772         (void) ctx;
1773         if (! status->stat_options)
1774                 return;
1775
1776         STAT_ENTER;
1777         {
1778                 status->reassoc_run = flag;
1779         }
1780         STAT_LEAVE;
1781 }  /* stat_reassociate */
1782
1783 /**
1784  * Hook: A node was lowered into other nodes
1785  *
1786  * @param ctx  the hook context
1787  * @param node the IR node that will be lowered
1788  */
1789 static void stat_lower(void *ctx, ir_node *node) {
1790         (void) ctx;
1791         if (! status->stat_options)
1792                 return;
1793
1794         STAT_ENTER;
1795         {
1796                 graph_entry_t *graph = graph_get_entry(current_ir_graph, status->irg_hash);
1797
1798                 removed_due_opt(node, graph->opt_hash[HOOK_LOWERED], HOOK_LOWERED);
1799         }
1800         STAT_LEAVE;
1801 }  /* stat_lower */
1802
1803 /**
1804  * Hook: A graph was inlined.
1805  *
1806  * @param ctx  the hook context
1807  * @param call the IR call that will re changed into the body of
1808  *             the called IR graph
1809  * @param called_irg  the IR graph representing the called routine
1810  */
1811 static void stat_inline(void *ctx, ir_node *call, ir_graph *called_irg)
1812 {
1813         (void) ctx;
1814         if (! status->stat_options)
1815                 return;
1816
1817         STAT_ENTER;
1818         {
1819                 ir_graph *irg = get_irn_irg(call);
1820                 graph_entry_t *i_graph = graph_get_entry(called_irg, status->irg_hash);
1821                 graph_entry_t *graph   = graph_get_entry(irg, status->irg_hash);
1822
1823                 cnt_inc(&graph->cnt[gcnt_acc_got_inlined]);
1824                 cnt_inc(&i_graph->cnt[gcnt_acc_was_inlined]);
1825         }
1826         STAT_LEAVE;
1827 }  /* stat_inline */
1828
1829 /**
1830  * Hook: A graph with tail-recursions was optimized.
1831  *
1832  * @param ctx  the hook context
1833  */
1834 static void stat_tail_rec(void *ctx, ir_graph *irg, int n_calls) {
1835         (void) ctx;
1836         if (! status->stat_options)
1837                 return;
1838
1839         STAT_ENTER;
1840         {
1841                 graph_entry_t *graph = graph_get_entry(irg, status->irg_hash);
1842
1843                 graph->num_tail_recursion += n_calls;
1844         }
1845         STAT_LEAVE;
1846 }  /* stat_tail_rec */
1847
1848 /**
1849  * Strength reduction was performed on an iteration variable.
1850  *
1851  * @param ctx  the hook context
1852  */
1853 static void stat_strength_red(void *ctx, ir_graph *irg, ir_node *strong) {
1854         (void) ctx;
1855         if (! status->stat_options)
1856                 return;
1857
1858         STAT_ENTER;
1859         {
1860                 graph_entry_t *graph = graph_get_entry(irg, status->irg_hash);
1861                 cnt_inc(&graph->cnt[gcnt_acc_strength_red]);
1862
1863                 removed_due_opt(strong, graph->opt_hash[HOOK_OPT_STRENGTH_RED], HOOK_OPT_STRENGTH_RED);
1864         }
1865         STAT_LEAVE;
1866 }  /* stat_strength_red */
1867
1868 /**
1869  * Hook: Start/Stop the dead node elimination.
1870  *
1871  * @param ctx  the hook context
1872  */
1873 static void stat_dead_node_elim(void *ctx, ir_graph *irg, int start) {
1874         (void) ctx;
1875         (void) irg;
1876         if (! status->stat_options)
1877                 return;
1878
1879         status->in_dead_node_elim = (start != 0);
1880 }  /* stat_dead_node_elim */
1881
1882 /**
1883  * Hook: if-conversion was tried.
1884  */
1885 static void stat_if_conversion(void *context, ir_graph *irg, ir_node *phi,
1886                                int pos, ir_node *mux, if_result_t reason)
1887 {
1888         (void) context;
1889         (void) phi;
1890         (void) pos;
1891         (void) mux;
1892         if (! status->stat_options)
1893                 return;
1894
1895         STAT_ENTER;
1896         {
1897                 graph_entry_t *graph = graph_get_entry(irg, status->irg_hash);
1898
1899                 cnt_inc(&graph->cnt[gcnt_if_conv + reason]);
1900         }
1901         STAT_LEAVE;
1902 }  /* stat_if_conversion */
1903
1904 /**
1905  * Hook: real function call was optimized.
1906  */
1907 static void stat_func_call(void *context, ir_graph *irg, ir_node *call)
1908 {
1909         (void) context;
1910         (void) call;
1911         if (! status->stat_options)
1912                 return;
1913
1914         STAT_ENTER;
1915         {
1916                 graph_entry_t *graph = graph_get_entry(irg, status->irg_hash);
1917
1918                 cnt_inc(&graph->cnt[gcnt_acc_real_func_call]);
1919         }
1920         STAT_LEAVE;
1921 }  /* stat_func_call */
1922
1923 /**
1924  * Hook: A multiply was replaced by a series of Shifts/Adds/Subs.
1925  *
1926  * @param ctx  the hook context
1927  */
1928 static void stat_arch_dep_replace_mul_with_shifts(void *ctx, ir_node *mul) {
1929         (void) ctx;
1930         if (! status->stat_options)
1931                 return;
1932
1933         STAT_ENTER;
1934         {
1935                 graph_entry_t *graph = graph_get_entry(current_ir_graph, status->irg_hash);
1936                 removed_due_opt(mul, graph->opt_hash[HOOK_OPT_ARCH_DEP], HOOK_OPT_ARCH_DEP);
1937         }
1938         STAT_LEAVE;
1939 }  /* stat_arch_dep_replace_mul_with_shifts */
1940
1941 /**
1942  * Hook: A division by const was replaced.
1943  *
1944  * @param ctx   the hook context
1945  * @param node  the division node that will be optimized
1946  */
1947 static void stat_arch_dep_replace_division_by_const(void *ctx, ir_node *node) {
1948         (void) ctx;
1949         if (! status->stat_options)
1950                 return;
1951
1952         STAT_ENTER;
1953         {
1954                 graph_entry_t *graph = graph_get_entry(current_ir_graph, status->irg_hash);
1955                 removed_due_opt(node, graph->opt_hash[HOOK_OPT_ARCH_DEP], HOOK_OPT_ARCH_DEP);
1956         }
1957         STAT_LEAVE;
1958 }  /* stat_arch_dep_replace_division_by_const */
1959
1960 /*
1961  * Update the register pressure of a block.
1962  *
1963  * @param irg        the irg containing the block
1964  * @param block      the block for which the reg pressure should be set
1965  * @param pressure   the pressure
1966  * @param class_name the name of the register class
1967  */
1968 void stat_be_block_regpressure(ir_graph *irg, ir_node *block, int pressure, const char *class_name)
1969 {
1970         if (! status->stat_options)
1971                 return;
1972
1973         STAT_ENTER;
1974         {
1975                 graph_entry_t        *graph = graph_get_entry(irg, status->irg_hash);
1976                 be_block_entry_t     *block_ent;
1977                 reg_pressure_entry_t *rp_ent;
1978
1979                 block_ent = be_block_get_entry(&status->be_data, get_irn_node_nr(block), graph->be_block_hash);
1980                 rp_ent    = obstack_alloc(&status->be_data, sizeof(*rp_ent));
1981                 memset(rp_ent, 0, sizeof(*rp_ent));
1982
1983                 rp_ent->class_name = class_name;
1984                 rp_ent->pressure   = pressure;
1985
1986                 pset_insert(block_ent->reg_pressure, rp_ent, HASH_PTR(class_name));
1987         }
1988         STAT_LEAVE;
1989 }  /* stat_be_block_regpressure */
1990
1991 /**
1992  * Update the distribution of ready nodes of a block
1993  *
1994  * @param irg        the irg containing the block
1995  * @param block      the block for which the reg pressure should be set
1996  * @param num_ready  the number of ready nodes
1997  */
1998 void stat_be_block_sched_ready(ir_graph *irg, ir_node *block, int num_ready)
1999 {
2000         if (! status->stat_options)
2001                 return;
2002
2003         STAT_ENTER;
2004         {
2005                 graph_entry_t    *graph = graph_get_entry(irg, status->irg_hash);
2006                 be_block_entry_t *block_ent;
2007
2008                 block_ent = be_block_get_entry(&status->be_data, get_irn_node_nr(block), graph->be_block_hash);
2009
2010                 /* increase the counter of corresponding number of ready nodes */
2011                 stat_inc_int_distrib_tbl(block_ent->sched_ready, num_ready);
2012         }
2013         STAT_LEAVE;
2014 }  /* stat_be_block_sched_ready */
2015
2016 /**
2017  * Update the permutation statistic of a block.
2018  *
2019  * @param class_name the name of the register class
2020  * @param n_regs     number of registers in the register class
2021  * @param perm       the perm node
2022  * @param block      the block containing the perm
2023  * @param size       the size of the perm
2024  * @param real_size  number of pairs with different registers
2025  */
2026 void stat_be_block_stat_perm(const char *class_name, int n_regs, ir_node *perm, ir_node *block,
2027                              int size, int real_size)
2028 {
2029         if (! status->stat_options)
2030                 return;
2031
2032         STAT_ENTER;
2033         {
2034                 graph_entry_t      *graph = graph_get_entry(get_irn_irg(block), status->irg_hash);
2035                 be_block_entry_t   *block_ent;
2036                 perm_class_entry_t *pc_ent;
2037                 perm_stat_entry_t  *ps_ent;
2038
2039                 block_ent = be_block_get_entry(&status->be_data, get_irn_node_nr(block), graph->be_block_hash);
2040                 pc_ent    = perm_class_get_entry(&status->be_data, class_name, block_ent->perm_class_stat);
2041                 ps_ent    = perm_stat_get_entry(&status->be_data, perm, pc_ent->perm_stat);
2042
2043                 pc_ent->n_regs = n_regs;
2044
2045                 /* update information */
2046                 ps_ent->size      = size;
2047                 ps_ent->real_size = real_size;
2048         }
2049         STAT_LEAVE;
2050 }  /* stat_be_block_stat_perm */
2051
2052 /**
2053  * Update the permutation statistic of a single perm.
2054  *
2055  * @param class_name the name of the register class
2056  * @param perm       the perm node
2057  * @param block      the block containing the perm
2058  * @param is_chain   1 if chain, 0 if cycle
2059  * @param size       length of the cycle/chain
2060  * @param n_ops      the number of ops representing this cycle/chain after lowering
2061  */
2062 void stat_be_block_stat_permcycle(const char *class_name, ir_node *perm, ir_node *block,
2063                                   int is_chain, int size, int n_ops)
2064 {
2065         if (! status->stat_options)
2066                 return;
2067
2068         STAT_ENTER;
2069         {
2070                 graph_entry_t      *graph = graph_get_entry(get_irn_irg(block), status->irg_hash);
2071                 be_block_entry_t   *block_ent;
2072                 perm_class_entry_t *pc_ent;
2073                 perm_stat_entry_t  *ps_ent;
2074
2075                 block_ent = be_block_get_entry(&status->be_data, get_irn_node_nr(block), graph->be_block_hash);
2076                 pc_ent    = perm_class_get_entry(&status->be_data, class_name, block_ent->perm_class_stat);
2077                 ps_ent    = perm_stat_get_entry(&status->be_data, perm, pc_ent->perm_stat);
2078
2079                 if (is_chain) {
2080                         ps_ent->n_copies += n_ops;
2081                         stat_inc_int_distrib_tbl(ps_ent->chains, size);
2082                 } else {
2083                         ps_ent->n_exchg += n_ops;
2084                         stat_inc_int_distrib_tbl(ps_ent->cycles, size);
2085                 }  /* if */
2086         }
2087         STAT_LEAVE;
2088 }  /* stat_be_block_stat_permcycle */
2089
2090 /* Dumps a statistics snapshot. */
2091 void stat_dump_snapshot(const char *name, const char *phase)
2092 {
2093         char fname[2048];
2094         const char *p;
2095         int l;
2096
2097         if (! status->stat_options)
2098                 return;
2099
2100         STAT_ENTER;
2101         {
2102                 graph_entry_t *entry;
2103                 graph_entry_t *global = graph_get_entry(NULL, status->irg_hash);
2104
2105                 /*
2106                  * The constant counter is only global, so we clear it here.
2107                  * Note that it does NOT contain the constants in DELETED
2108                  * graphs due to this.
2109                  */
2110                 if (status->stat_options & FIRMSTAT_COUNT_CONSTS)
2111                         stat_const_clear(status);
2112
2113                 /* build the name */
2114                 p = strrchr(name, '/');
2115 #ifdef _WIN32
2116                 {
2117                         const char *q;
2118
2119                         q = strrchr(name, '\\');
2120
2121                         /* NULL might be not the smallest pointer */
2122                         if (q && (!p || q > p))
2123                                 p = q;
2124                 }
2125 #endif /* _WIN32 */
2126                 if (p) {
2127                         ++p;
2128                         l = p - name;
2129
2130                         if (l > (int) (sizeof(fname) - 1))
2131                                 l = sizeof(fname) - 1;
2132
2133                         memcpy(fname, name, l);
2134                         fname[l] = '\0';
2135                 } else {
2136                         fname[0] = '\0';
2137                         p = name;
2138                 }  /* if */
2139                 strncat(fname, "firmstat-", sizeof(fname));
2140                 strncat(fname, phase, sizeof(fname));
2141                 strncat(fname, "-", sizeof(fname));
2142                 strncat(fname, p, sizeof(fname));
2143
2144                 stat_dump_init(fname);
2145
2146                 /* calculate the graph statistics */
2147                 for (entry = pset_first(status->irg_hash); entry; entry = pset_next(status->irg_hash)) {
2148                         if (entry->irg == NULL) {
2149                                 /* special entry for the global count */
2150                                 continue;
2151                         }  /* if */
2152                         if (! entry->is_deleted) {
2153                                 /* the graph is still alive, count the nodes on it */
2154                                 update_graph_stat(global, entry);
2155                         }  /* if */
2156                 }  /* for */
2157
2158                 /* some calculations are dependent, we pushed them on the wait_q */
2159                 while (! pdeq_empty(status->wait_q)) {
2160                         entry = pdeq_getr(status->wait_q);
2161
2162                         update_graph_stat_2(global, entry);
2163                 }  /* while */
2164
2165                 /* dump per graph */
2166                 for (entry = pset_first(status->irg_hash); entry; entry = pset_next(status->irg_hash)) {
2167                         if (entry->irg == NULL) {
2168                                 /* special entry for the global count */
2169                                 continue;
2170                         }  /* if */
2171
2172                         if (! entry->is_deleted || status->stat_options & FIRMSTAT_COUNT_DELETED) {
2173                                 stat_dump_graph(entry);
2174                                 stat_dump_registered(entry);
2175                         }  /* if */
2176
2177                         if (! entry->is_deleted) {
2178                                 /* clear the counter that are not accumulated */
2179                                 graph_clear_entry(entry, 0);
2180                         }  /* if */
2181                 }  /* for */
2182
2183                 /* dump global */
2184                 stat_dump_graph(global);
2185
2186                 /* dump the const info */
2187                 if (status->stat_options & FIRMSTAT_COUNT_CONSTS)
2188                         stat_dump_consts(&status->const_info);
2189
2190                 /* dump the parameter distribution */
2191                 stat_dump_param_tbl(status->dist_param_cnt, global);
2192
2193                 /* dump the optimization counter and clear them */
2194                 stat_dump_opt_cnt(status->num_opts, ARR_SIZE(status->num_opts));
2195                 clear_optimization_counter();
2196
2197                 stat_dump_finish();
2198
2199                 stat_finish_pattern_history(fname);
2200
2201                 /* clear the global counters here */
2202                 {
2203                         node_entry_t *entry;
2204
2205                         for (entry = pset_first(global->opcode_hash); entry; entry = pset_next(global->opcode_hash)) {
2206                                 opcode_clear_entry(entry);
2207                         }  /* for */
2208                         /* clear all global counter */
2209                         graph_clear_entry(global, /*all=*/1);
2210                 }
2211         }
2212         STAT_LEAVE;
2213 }  /* stat_dump_snapshot */
2214
2215 /** the hook entries for the Firm statistics module */
2216 static hook_entry_t stat_hooks[hook_last];
2217
2218 /* initialize the statistics module. */
2219 void firm_init_stat(unsigned enable_options)
2220 {
2221 #define X(a)  a, sizeof(a)-1
2222 #define HOOK(h, fkt) \
2223         stat_hooks[h].hook._##h = fkt; register_hook(h, &stat_hooks[h])
2224         unsigned num = 0;
2225
2226         if (! (enable_options & FIRMSTAT_ENABLED))
2227                 return;
2228
2229         status = XMALLOCZ(stat_info_t);
2230
2231         /* enable statistics */
2232         status->stat_options = enable_options & FIRMSTAT_ENABLED ? enable_options : 0;
2233
2234         /* register all hooks */
2235         HOOK(hook_new_ir_op,                          stat_new_ir_op);
2236         HOOK(hook_free_ir_op,                         stat_free_ir_op);
2237         HOOK(hook_new_node,                           stat_new_node);
2238         HOOK(hook_turn_into_id,                       stat_turn_into_id);
2239         HOOK(hook_normalize,                          stat_normalize);
2240         HOOK(hook_new_graph,                          stat_new_graph);
2241         HOOK(hook_free_graph,                         stat_free_graph);
2242         HOOK(hook_irg_walk,                           stat_irg_walk);
2243         HOOK(hook_irg_walk_blkwise,                   stat_irg_walk_blkwise);
2244         HOOK(hook_irg_block_walk,                     stat_irg_block_walk);
2245         HOOK(hook_merge_nodes,                        stat_merge_nodes);
2246         HOOK(hook_reassociate,                        stat_reassociate);
2247         HOOK(hook_lower,                              stat_lower);
2248         HOOK(hook_inline,                             stat_inline);
2249         HOOK(hook_tail_rec,                           stat_tail_rec);
2250         HOOK(hook_strength_red,                       stat_strength_red);
2251         HOOK(hook_dead_node_elim,                     stat_dead_node_elim);
2252         HOOK(hook_if_conversion,                      stat_if_conversion);
2253         HOOK(hook_func_call,                          stat_func_call);
2254         HOOK(hook_arch_dep_replace_mul_with_shifts,   stat_arch_dep_replace_mul_with_shifts);
2255         HOOK(hook_arch_dep_replace_division_by_const, stat_arch_dep_replace_division_by_const);
2256
2257         obstack_init(&status->cnts);
2258         obstack_init(&status->be_data);
2259
2260         /* create the hash-tables */
2261         status->irg_hash   = new_pset(graph_cmp, 8);
2262         status->ir_op_hash = new_pset(opcode_cmp_2, 1);
2263
2264         /* create the wait queue */
2265         status->wait_q     = new_pdeq();
2266
2267         if (enable_options & FIRMSTAT_COUNT_STRONG_OP) {
2268                 /* build the pseudo-ops */
2269
2270                 _op_Phi0.code    = --num;
2271                 _op_Phi0.name    = new_id_from_chars(X("Phi0"));
2272
2273                 _op_PhiM.code    = --num;
2274                 _op_PhiM.name    = new_id_from_chars(X("PhiM"));
2275
2276                 _op_ProjM.code   = --num;
2277                 _op_ProjM.name   = new_id_from_chars(X("ProjM"));
2278
2279                 _op_MulC.code    = --num;
2280                 _op_MulC.name    = new_id_from_chars(X("MulC"));
2281
2282                 _op_DivC.code    = --num;
2283                 _op_DivC.name    = new_id_from_chars(X("DivC"));
2284
2285                 _op_ModC.code    = --num;
2286                 _op_ModC.name    = new_id_from_chars(X("ModC"));
2287
2288                 _op_DivModC.code = --num;
2289                 _op_DivModC.name = new_id_from_chars(X("DivModC"));
2290
2291                 _op_QuotC.code   = --num;
2292                 _op_QuotC.name   = new_id_from_chars(X("QuotC"));
2293
2294                 status->op_Phi0    = &_op_Phi0;
2295                 status->op_PhiM    = &_op_PhiM;
2296                 status->op_ProjM   = &_op_ProjM;
2297                 status->op_MulC    = &_op_MulC;
2298                 status->op_DivC    = &_op_DivC;
2299                 status->op_ModC    = &_op_ModC;
2300                 status->op_DivModC = &_op_DivModC;
2301                 status->op_QuotC   = &_op_QuotC;
2302         } else {
2303                 status->op_Phi0    = NULL;
2304                 status->op_PhiM    = NULL;
2305                 status->op_ProjM   = NULL;
2306                 status->op_MulC    = NULL;
2307                 status->op_DivC    = NULL;
2308                 status->op_ModC    = NULL;
2309                 status->op_DivModC = NULL;
2310                 status->op_QuotC   = NULL;
2311         }  /* if */
2312
2313         /* for Florian: count the Sel depth */
2314         if (enable_options & FIRMSTAT_COUNT_SELS) {
2315                 _op_SelSel.code    = --num;
2316                 _op_SelSel.name    = new_id_from_chars(X("Sel(Sel)"));
2317
2318                 _op_SelSelSel.code = --num;
2319                 _op_SelSelSel.name = new_id_from_chars(X("Sel(Sel(Sel))"));
2320
2321                 status->op_SelSel    = &_op_SelSel;
2322                 status->op_SelSelSel = &_op_SelSelSel;
2323         } else {
2324                 status->op_SelSel    = NULL;
2325                 status->op_SelSelSel = NULL;
2326         }  /* if */
2327
2328         /* register the dumper */
2329         stat_register_dumper(&simple_dumper);
2330
2331         if (enable_options & FIRMSTAT_CSV_OUTPUT)
2332                 stat_register_dumper(&csv_dumper);
2333
2334         /* initialize the pattern hash */
2335         stat_init_pattern_history(enable_options & FIRMSTAT_PATTERN_ENABLED);
2336
2337         /* initialize the Const options */
2338         if (enable_options & FIRMSTAT_COUNT_CONSTS)
2339                 stat_init_const_cnt(status);
2340
2341         /* distribution table for parameter counts */
2342         status->dist_param_cnt = stat_new_int_distrib_tbl();
2343
2344         clear_optimization_counter();
2345
2346 #undef HOOK
2347 #undef X
2348 }  /* firm_init_stat */
2349
2350 /**
2351  * Frees all dumper structures.
2352  */
2353 static void stat_term_dumper(void) {
2354         dumper_t *dumper, *next_dumper;
2355
2356         for (dumper = status->dumper; dumper; /* iteration done in loop body */ ) {
2357                 if (dumper->func_map)
2358                         del_pset(dumper->func_map);
2359
2360                 next_dumper = dumper->next;
2361                 free(dumper);
2362                 dumper = next_dumper;
2363         }  /* for */
2364 }  /* stat_term_dumper */
2365
2366
2367 /* Terminates the statistics module, frees all memory. */
2368 void stat_term(void) {
2369         if (status != (stat_info_t *)&status_disable) {
2370                 obstack_free(&status->be_data, NULL);
2371                 obstack_free(&status->cnts, NULL);
2372
2373                 stat_term_dumper();
2374
2375                 xfree(status);
2376                 status = (stat_info_t *)&status_disable;
2377         }
2378 }  /* stat_term */
2379
2380 /* returns 1 if statistics were initialized, 0 otherwise */
2381 int stat_is_active(void) {
2382         return status != (stat_info_t *)&status_disable;
2383 }  /* stat_is_active */
2384
2385 #else
2386
2387 /* initialize the statistics module. */
2388 void firm_init_stat(unsigned enable_options) {}
2389
2390 /* Dumps a statistics snapshot */
2391 void stat_dump_snapshot(const char *name, const char *phase) {}
2392
2393 /* terminates the statistics module, frees all memory */
2394 void stat_term(void);
2395
2396 #endif /* FIRM_STATISTICS */