X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fstat%2Ffirmstat.c;h=3aa6fe4e019332517500a9e952716d3333060877;hb=ab182d4b9ed44239ab3ff1d08b2f8e14a3699ccf;hp=6b31faff579a358a29e0e0e89ac61307d15ce5b6;hpb=f667113899d26608e395458858dd22ad780d8beb;p=libfirm

diff --git a/ir/stat/firmstat.c b/ir/stat/firmstat.c
index 6b31faff5..3aa6fe4e0 100644
--- a/ir/stat/firmstat.c
+++ b/ir/stat/firmstat.c
@@ -1,38 +1,47 @@
 /*
- * Project:     libFIRM
- * File name:   ir/ir/firmstat.c
- * Purpose:     Statistics for Firm.
- * Author:      Michael Beck
- * Created:
- * CVS-ID:      $Id$
- * Copyright:   (c) 2004 Universität Karlsruhe
- * Licence:     This file protected by GPL -  GNU GENERAL PUBLIC LICENSE.
- */
-
-#ifdef HAVE_CONFIG_H
-# include "config.h"
-#endif
+ * Copyright (C) 1995-2008 University of Karlsruhe.  All right reserved.
+ *
+ * This file is part of libFirm.
+ *
+ * This file may be distributed and/or modified under the terms of the
+ * GNU General Public License version 2 as published by the Free Software
+ * Foundation and appearing in the file LICENSE.GPL included in the
+ * packaging of this file.
+ *
+ * Licensees holding valid libFirm Professional Edition licenses may use
+ * this file in accordance with the libFirm Commercial License.
+ * Agreement provided with the Software.
+ *
+ * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
+ * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+ * PURPOSE.
+ */
+
+/**
+ * @file
+ * @brief   Statistics for Firm.
+ * @author  Michael Beck
+ * @version $Id$
+ */
+#include "config.h"
 
 #ifdef FIRM_STATISTICS
 
 #include <stdio.h>
-
-#ifdef HAVE_STDLIB_H
-# include <stdlib.h>
-#endif
-#ifdef HAVE_STRING_H
-# include <string.h>
-#endif
+#include <stdlib.h>
+#include <string.h>
 
 #include "irouts.h"
 #include "irdump.h"
 #include "hashptr.h"
 #include "firmstat_t.h"
+#include "irpass_t.h"
 #include "pattern.h"
 #include "dags.h"
 #include "stat_dmp.h"
 #include "xmalloc.h"
 #include "irhooks.h"
+#include "util.h"
 
 /*
  * need this to be static:
@@ -59,6 +68,9 @@ static ir_op _op_ModC;
 /** The Div by Const node. */
 static ir_op _op_DivModC;
 
+/** The Quot by Const node. */
+static ir_op _op_QuotC;
+
 /** The memory Proj node. */
 static ir_op _op_ProjM;
 
@@ -82,13 +94,14 @@ static ir_op _op_SelSelSel;
 /**
  * global status
  */
-static const int status_disable = 0;
+static const unsigned status_disable = 0;
 static stat_info_t *status = (stat_info_t *)&status_disable;
 
 /**
  * Compare two elements of the opcode hash.
  */
-static int opcode_cmp(const void *elt, const void *key) {
+static int opcode_cmp(const void *elt, const void *key)
+{
 	const node_entry_t *e1 = elt;
 	const node_entry_t *e2 = key;
 
@@ -98,7 +111,8 @@ static int opcode_cmp(const void *elt, const void *key) {
 /**
  * Compare two elements of the graph hash.
  */
-static int graph_cmp(const void *elt, const void *key) {
+static int graph_cmp(const void *elt, const void *key)
+{
 	const graph_entry_t *e1 = elt;
 	const graph_entry_t *e2 = key;
 
@@ -108,7 +122,8 @@ static int graph_cmp(const void *elt, const void *key) {
 /**
  * Compare two elements of the optimization hash.
  */
-static int opt_cmp(const void *elt, const void *key) {
+static int opt_cmp(const void *elt, const void *key)
+{
 	const opt_entry_t *e1 = elt;
 	const opt_entry_t *e2 = key;
 
@@ -118,17 +133,20 @@ static int opt_cmp(const void *elt, const void *key) {
 /**
  * Compare two elements of the block/extbb hash.
  */
-static int block_cmp(const void *elt, const void *key) {
+static int block_cmp(const void *elt, const void *key)
+{
 	const block_entry_t *e1 = elt;
 	const block_entry_t *e2 = key;
 
+	/* it's enough to compare the block number */
 	return e1->block_nr != e2->block_nr;
 }  /* block_cmp */
 
 /**
  * Compare two elements of the be_block hash.
  */
-static int be_block_cmp(const void *elt, const void *key) {
+static int be_block_cmp(const void *elt, const void *key)
+{
 	const be_block_entry_t *e1 = elt;
 	const be_block_entry_t *e2 = key;
 
@@ -138,7 +156,8 @@ static int be_block_cmp(const void *elt, const void *key) {
 /**
  * Compare two elements of reg pressure hash.
  */
-static int reg_pressure_cmp(const void *elt, const void *key) {
+static int reg_pressure_cmp(const void *elt, const void *key)
+{
 	const reg_pressure_entry_t *e1 = elt;
 	const reg_pressure_entry_t *e2 = key;
 
@@ -148,7 +167,8 @@ static int reg_pressure_cmp(const void *elt, const void *key) {
 /**
  * Compare two elements of the perm_stat hash.
  */
-static int perm_stat_cmp(const void *elt, const void *key) {
+static int perm_stat_cmp(const void *elt, const void *key)
+{
 	const perm_stat_entry_t *e1 = elt;
 	const perm_stat_entry_t *e2 = key;
 
@@ -158,7 +178,8 @@ static int perm_stat_cmp(const void *elt, const void *key) {
 /**
  * Compare two elements of the perm_class hash.
  */
-static int perm_class_cmp(const void *elt, const void *key) {
+static int perm_class_cmp(const void *elt, const void *key)
+{
 	const perm_class_entry_t *e1 = elt;
 	const perm_class_entry_t *e2 = key;
 
@@ -168,7 +189,8 @@ static int perm_class_cmp(const void *elt, const void *key) {
 /**
  * Compare two elements of the ir_op hash.
  */
-static int opcode_cmp_2(const void *elt, const void *key) {
+static int opcode_cmp_2(const void *elt, const void *key)
+{
 	const ir_op *e1 = elt;
 	const ir_op *e2 = key;
 
@@ -178,9 +200,11 @@ static int opcode_cmp_2(const void *elt, const void *key) {
 /**
  * Compare two elements of the address_mark set.
  */
-static int address_mark_cmp(const void *elt, const void *key, size_t size) {
+static int address_mark_cmp(const void *elt, const void *key, size_t size)
+{
 	const address_mark_entry_t *e1 = elt;
 	const address_mark_entry_t *e2 = key;
+	(void) size;
 
 	/* compare only the nodes, the rest is used as data container */
 	return e1->node != e2->node;
@@ -189,19 +213,23 @@ static int address_mark_cmp(const void *elt, const void *key, size_t size) {
 /**
  * Clear all counter in a node_entry_t.
  */
-static void opcode_clear_entry(node_entry_t *elem) {
+static void opcode_clear_entry(node_entry_t *elem)
+{
 	cnt_clr(&elem->cnt_alive);
 	cnt_clr(&elem->new_node);
 	cnt_clr(&elem->into_Id);
+	cnt_clr(&elem->normalized);
 }  /* opcode_clear_entry */
 
 /**
- * Returns the associates node_entry_t for an ir_op
+ * Returns the associates node_entry_t for an ir_op (and allocates
+ * one if not yet available).
  *
  * @param op    the IR operation
  * @param hmap  a hash map containing ir_op* -> node_entry_t*
  */
-static node_entry_t *opcode_get_entry(const ir_op *op, hmap_node_entry_t *hmap) {
+static node_entry_t *opcode_get_entry(const ir_op *op, hmap_node_entry_t *hmap)
+{
 	node_entry_t key;
 	node_entry_t *elem;
 
@@ -211,8 +239,7 @@ static node_entry_t *opcode_get_entry(const ir_op *op, hmap_node_entry_t *hmap)
 	if (elem)
 		return elem;
 
-	elem = obstack_alloc(&status->cnts, sizeof(*elem));
-	memset(elem, 0, sizeof(*elem));
+	elem = OALLOCZ(&status->cnts, node_entry_t);
 
 	/* clear counter */
 	opcode_clear_entry(elem);
@@ -228,7 +255,8 @@ static node_entry_t *opcode_get_entry(const ir_op *op, hmap_node_entry_t *hmap)
  * @param code  the IR opcode
  * @param hmap  the hash map containing opcode -> ir_op*
  */
-static ir_op *opcode_find_entry(ir_opcode code, hmap_ir_op *hmap) {
+static ir_op *opcode_find_entry(ir_opcode code, hmap_ir_op *hmap)
+{
 	ir_op key;
 
 	key.code = code;
@@ -241,21 +269,14 @@ static ir_op *opcode_find_entry(ir_opcode code, hmap_ir_op *hmap) {
  * @param elem  the graph entry
  * @param all   if non-zero, clears all counters, else leave accumulated ones
  */
-static void graph_clear_entry(graph_entry_t *elem, int all) {
-	if (all) {
-		cnt_clr(&elem->cnt_walked);
-		cnt_clr(&elem->cnt_walked_blocks);
-		cnt_clr(&elem->cnt_was_inlined);
-		cnt_clr(&elem->cnt_got_inlined);
-		cnt_clr(&elem->cnt_strength_red);
-		cnt_clr(&elem->cnt_real_func_call);
-	}  /* if */
-	cnt_clr(&elem->cnt_edges);
-	cnt_clr(&elem->cnt_all_calls);
-	cnt_clr(&elem->cnt_call_with_cnst_arg);
-	cnt_clr(&elem->cnt_indirect_calls);
-	cnt_clr(&elem->cnt_pure_adr_ops);
-	cnt_clr(&elem->cnt_all_adr_ops);
+static void graph_clear_entry(graph_entry_t *elem, int all)
+{
+	int i;
+
+	/* clear accumulated / non-accumulated counter */
+	for (i = all ? 0 : _gcnt_non_acc; i < _gcnt_last; ++i) {
+		cnt_clr(&elem->cnt[i]);
+	}  /* for */
 
 	if (elem->block_hash) {
 		del_pset(elem->block_hash);
@@ -274,14 +295,14 @@ static void graph_clear_entry(graph_entry_t *elem, int all) {
 /**
  * Returns the associated graph_entry_t for an IR graph.
  *
- * @param irg   the IR graph
+ * @param irg   the IR graph, NULL for the global counter
  * @param hmap  the hash map containing ir_graph* -> graph_entry_t*
  */
 static graph_entry_t *graph_get_entry(ir_graph *irg, hmap_graph_entry_t *hmap)
 {
 	graph_entry_t key;
 	graph_entry_t *elem;
-	int i;
+	size_t i;
 
 	key.irg = irg;
 
@@ -296,8 +317,7 @@ static graph_entry_t *graph_get_entry(ir_graph *irg, hmap_graph_entry_t *hmap)
 	}  /* if */
 
 	/* allocate a new one */
-	elem = obstack_alloc(&status->cnts, sizeof(*elem));
-	memset(elem, 0, sizeof(*elem));
+	elem = OALLOCZ(&status->cnts, graph_entry_t);
 	obstack_init(&elem->recalc_cnts);
 
 	/* clear counter */
@@ -321,7 +341,8 @@ static graph_entry_t *graph_get_entry(ir_graph *irg, hmap_graph_entry_t *hmap)
 /**
  * Clear all counter in an opt_entry_t.
  */
-static void opt_clear_entry(opt_entry_t *elem) {
+static void opt_clear_entry(opt_entry_t *elem)
+{
 	cnt_clr(&elem->count);
 }  /* opt_clear_entry */
 
@@ -342,8 +363,7 @@ static opt_entry_t *opt_get_entry(const ir_op *op, hmap_opt_entry_t *hmap)
 	if (elem)
 		return elem;
 
-	elem = obstack_alloc(&status->cnts, sizeof(*elem));
-	memset(elem, 0, sizeof(*elem));
+	elem = OALLOCZ(&status->cnts, opt_entry_t);
 
 	/* clear new counter */
 	opt_clear_entry(elem);
@@ -356,12 +376,12 @@ static opt_entry_t *opt_get_entry(const ir_op *op, hmap_opt_entry_t *hmap)
 /**
  * clears all counter in a block_entry_t
  */
-static void block_clear_entry(block_entry_t *elem) {
-	cnt_clr(&elem->cnt_nodes);
-	cnt_clr(&elem->cnt_edges);
-	cnt_clr(&elem->cnt_in_edges);
-	cnt_clr(&elem->cnt_out_edges);
-	cnt_clr(&elem->cnt_phi_data);
+static void block_clear_entry(block_entry_t *elem)
+{
+	int i;
+
+	for (i = 0; i < _bcnt_last; ++i)
+		cnt_clr(&elem->cnt[i]);
 }  /* block_clear_entry */
 
 /**
@@ -381,8 +401,7 @@ static block_entry_t *block_get_entry(struct obstack *obst, long block_nr, hmap_
 	if (elem)
 		return elem;
 
-	elem = obstack_alloc(obst, sizeof(*elem));
-	memset(elem, 0, sizeof(*elem));
+	elem = OALLOCZ(obst, block_entry_t);
 
 	/* clear new counter */
 	block_clear_entry(elem);
@@ -428,8 +447,7 @@ static be_block_entry_t *be_block_get_entry(struct obstack *obst, long block_nr,
 	if (elem)
 		return elem;
 
-	elem = obstack_alloc(obst, sizeof(*elem));
-	memset(elem, 0, sizeof(*elem));
+	elem = OALLOCZ(obst, be_block_entry_t);
 
 	/* clear new counter */
 	be_block_clear_entry(elem);
@@ -442,7 +460,8 @@ static be_block_entry_t *be_block_get_entry(struct obstack *obst, long block_nr,
 /**
  * clears all sets in perm_class_entry_t
  */
-static void perm_class_clear_entry(perm_class_entry_t *elem) {
+static void perm_class_clear_entry(perm_class_entry_t *elem)
+{
 	if (elem->perm_stat)
 		del_pset(elem->perm_stat);
 
@@ -467,8 +486,7 @@ static perm_class_entry_t *perm_class_get_entry(struct obstack *obst, const char
 	if (elem)
 		return elem;
 
-	elem = obstack_alloc(obst, sizeof(*elem));
-	memset(elem, 0, sizeof(*elem));
+	elem = OALLOCZ(obst, perm_class_entry_t);
 
 	/* clear new counter */
 	perm_class_clear_entry(elem);
@@ -481,7 +499,8 @@ static perm_class_entry_t *perm_class_get_entry(struct obstack *obst, const char
 /**
  * clears all sets in perm_stat_entry_t
  */
-static void perm_stat_clear_entry(perm_stat_entry_t *elem) {
+static void perm_stat_clear_entry(perm_stat_entry_t *elem)
+{
 	if (elem->chains)
 		stat_delete_distrib_tbl(elem->chains);
 
@@ -509,8 +528,7 @@ static perm_stat_entry_t *perm_stat_get_entry(struct obstack *obst, ir_node *per
 	if (elem)
 		return elem;
 
-	elem = obstack_alloc(obst, sizeof(*elem));
-	memset(elem, 0, sizeof(*elem));
+	elem = OALLOCZ(obst, perm_stat_entry_t);
 
 	/* clear new counter */
 	perm_stat_clear_entry(elem);
@@ -520,6 +538,16 @@ static perm_stat_entry_t *perm_stat_get_entry(struct obstack *obst, ir_node *per
 	return pset_insert(hmap, elem, HASH_PTR(perm));
 }  /* perm_stat_get_entry */
 
+/**
+ * Clear optimizations counter,
+ */
+static void clear_optimization_counter(void)
+{
+	int i;
+	for (i = 0; i < FS_OPT_MAX; ++i)
+		cnt_clr(&status->num_opts[i]);
+}
+
 /**
  * Returns the ir_op for an IR-node,
  * handles special cases and return pseudo op codes.
@@ -529,38 +557,67 @@ static perm_stat_entry_t *perm_stat_get_entry(struct obstack *obst, ir_node *per
 static ir_op *stat_get_irn_op(ir_node *node)
 {
 	ir_op *op = get_irn_op(node);
-
-	if (op == op_Phi && get_irn_arity(node) == 0) {
-		/* special case, a Phi0 node, count on extra counter */
-		op = status->op_Phi0 ? status->op_Phi0 : op;
-	} else if (op == op_Phi && get_irn_mode(node) == mode_M) {
-		/* special case, a Memory Phi node, count on extra counter */
-		op = status->op_PhiM ? status->op_PhiM : op;
-	} else if (op == op_Proj && get_irn_mode(node) == mode_M) {
-		/* special case, a Memory Proj node, count on extra counter */
-		op = status->op_ProjM ? status->op_ProjM : op;
-	} else if (op == op_Mul &&
-		(get_irn_op(get_Mul_left(node)) == op_Const || get_irn_op(get_Mul_right(node)) == op_Const)) {
-		/* special case, a Multiply by a const, count on extra counter */
-		op = status->op_MulC ? status->op_MulC : op;
-	} else if (op == op_Div && get_irn_op(get_Div_right(node)) == op_Const) {
-		/* special case, a division by a const, count on extra counter */
-		op = status->op_DivC ? status->op_DivC : op;
-	} else if (op == op_Mod && get_irn_op(get_Mod_right(node)) == op_Const) {
-		/* special case, a module by a const, count on extra counter */
-		op = status->op_ModC ? status->op_ModC : op;
-	} else if (op == op_DivMod && get_irn_op(get_DivMod_right(node)) == op_Const) {
-		/* special case, a division/modulo by a const, count on extra counter */
-		op = status->op_DivModC ? status->op_DivModC : op;
-	} else if (op == op_Sel && get_irn_op(get_Sel_ptr(node)) == op_Sel) {
-		/* special case, a Sel of a Sel, count on extra counter */
-		op = status->op_SelSel ? status->op_SelSel : op;
-
-		if (get_irn_op(get_Sel_ptr(get_Sel_ptr(node))) == op_Sel) {
-			/* special case, a Sel of a Sel of a Sel, count on extra counter */
-			op = status->op_SelSelSel ? status->op_SelSelSel : op;
+	ir_opcode opc = op->code;
+
+	switch (opc) {
+	case iro_Phi:
+		if (get_irn_arity(node) == 0) {
+			/* special case, a Phi0 node, count on extra counter */
+			op = status->op_Phi0 ? status->op_Phi0 : op;
+		} else if (get_irn_mode(node) == mode_M) {
+			/* special case, a Memory Phi node, count on extra counter */
+			op = status->op_PhiM ? status->op_PhiM : op;
 		}  /* if */
-	}  /* if */
+		break;
+	case iro_Proj:
+		if (get_irn_mode(node) == mode_M) {
+			/* special case, a Memory Proj node, count on extra counter */
+			op = status->op_ProjM ? status->op_ProjM : op;
+		}  /* if */
+		break;
+	case iro_Mul:
+		if (is_Const(get_Mul_left(node)) || is_Const(get_Mul_right(node))) {
+			/* special case, a Multiply by a const, count on extra counter */
+			op = status->op_MulC ? status->op_MulC : op;
+		}  /* if */
+		break;
+	case iro_Div:
+		if (is_Const(get_Div_right(node))) {
+			/* special case, a division by a const, count on extra counter */
+			op = status->op_DivC ? status->op_DivC : op;
+		}  /* if */
+		break;
+	case iro_Mod:
+		if (is_Const(get_Mod_right(node))) {
+			/* special case, a module by a const, count on extra counter */
+			op = status->op_ModC ? status->op_ModC : op;
+		}  /* if */
+		break;
+	case iro_DivMod:
+		if (is_Const(get_DivMod_right(node))) {
+			/* special case, a division/modulo by a const, count on extra counter */
+			op = status->op_DivModC ? status->op_DivModC : op;
+		}  /* if */
+		break;
+	case iro_Quot:
+		if (is_Const(get_Quot_right(node))) {
+			/* special case, a floating point division by a const, count on extra counter */
+			op = status->op_QuotC ? status->op_QuotC : op;
+		}  /* if */
+		break;
+	case iro_Sel:
+		if (is_Sel(get_Sel_ptr(node))) {
+			/* special case, a Sel of a Sel, count on extra counter */
+			op = status->op_SelSel ? status->op_SelSel : op;
+			if (is_Sel(get_Sel_ptr(get_Sel_ptr(node)))) {
+				/* special case, a Sel of a Sel of a Sel, count on extra counter */
+				op = status->op_SelSelSel ? status->op_SelSelSel : op;
+			}  /* if */
+		}  /* if */
+		break;
+	default:
+		;
+	}  /* switch */
 
 	return op;
 }  /* stat_get_irn_op */
@@ -579,6 +636,11 @@ static void undate_block_info(ir_node *node, graph_entry_t *graph)
 	if (op == op_Block) {
 		arity = get_irn_arity(node);
 		b_entry = block_get_entry(&graph->recalc_cnts, get_irn_node_nr(node), graph->block_hash);
+		/* mark start end block to allow to filter them out */
+		if (node == get_irg_start_block(graph->irg))
+			b_entry->is_start = 1;
+		else if (node == get_irg_end_block(graph->irg))
+			b_entry->is_end = 1;
 
 		/* count all incoming edges */
 		for (i = 0; i < arity; ++i) {
@@ -586,8 +648,8 @@ static void undate_block_info(ir_node *node, graph_entry_t *graph)
 			ir_node *other_block = get_nodes_block(pred);
 			block_entry_t *b_entry_other = block_get_entry(&graph->recalc_cnts, get_irn_node_nr(other_block), graph->block_hash);
 
-			cnt_inc(&b_entry->cnt_in_edges);	/* an edge coming from another block */
-			cnt_inc(&b_entry_other->cnt_out_edges);
+			cnt_inc(&b_entry->cnt[bcnt_in_edges]);	/* an edge coming from another block */
+			cnt_inc(&b_entry_other->cnt[bcnt_out_edges]);
 		}  /* for */
 		return;
 	}  /* if */
@@ -597,14 +659,14 @@ static void undate_block_info(ir_node *node, graph_entry_t *graph)
 
 	if (op == op_Phi && mode_is_datab(get_irn_mode(node))) {
 		/* count data Phi per block */
-		cnt_inc(&b_entry->cnt_phi_data);
+		cnt_inc(&b_entry->cnt[bcnt_phi_data]);
 	}  /* if */
 
 	/* we have a new node in our block */
-	cnt_inc(&b_entry->cnt_nodes);
+	cnt_inc(&b_entry->cnt[bcnt_nodes]);
 
 	/* don't count keep-alive edges */
-	if (get_irn_op(node) == op_End)
+	if (is_End(node))
 		return;
 
 	arity = get_irn_arity(node);
@@ -616,12 +678,12 @@ static void undate_block_info(ir_node *node, graph_entry_t *graph)
 		other_block = get_nodes_block(pred);
 
 		if (other_block == block)
-			cnt_inc(&b_entry->cnt_edges);	/* a in block edge */
+			cnt_inc(&b_entry->cnt[bcnt_edges]);	/* a in block edge */
 		else {
 			block_entry_t *b_entry_other = block_get_entry(&graph->recalc_cnts, get_irn_node_nr(other_block), graph->block_hash);
 
-			cnt_inc(&b_entry->cnt_in_edges);	/* an edge coming from another block */
-			cnt_inc(&b_entry_other->cnt_out_edges);
+			cnt_inc(&b_entry->cnt[bcnt_in_edges]);	/* an edge coming from another block */
+			cnt_inc(&b_entry_other->cnt[bcnt_out_edges]);
 		}  /* if */
 	}  /* for */
 }  /* undate_block_info */
@@ -650,8 +712,8 @@ static void update_extbb_info(ir_node *node, graph_entry_t *graph)
 			if (extbb != other_extbb) {
 				extbb_entry_t *eb_entry_other = block_get_entry(&graph->recalc_cnts, get_extbb_node_nr(other_extbb), graph->extbb_hash);
 
-				cnt_inc(&eb_entry->cnt_in_edges);	/* an edge coming from another extbb */
-				cnt_inc(&eb_entry_other->cnt_out_edges);
+				cnt_inc(&eb_entry->cnt[bcnt_in_edges]);	/* an edge coming from another extbb */
+				cnt_inc(&eb_entry_other->cnt[bcnt_out_edges]);
 			}  /* if */
 		}  /* for */
 		return;
@@ -662,14 +724,14 @@ static void update_extbb_info(ir_node *node, graph_entry_t *graph)
 
 	if (op == op_Phi && mode_is_datab(get_irn_mode(node))) {
 		/* count data Phi per extbb */
-		cnt_inc(&eb_entry->cnt_phi_data);
+		cnt_inc(&eb_entry->cnt[bcnt_phi_data]);
 	}  /* if */
 
 	/* we have a new node in our block */
-	cnt_inc(&eb_entry->cnt_nodes);
+	cnt_inc(&eb_entry->cnt[bcnt_nodes]);
 
 	/* don't count keep-alive edges */
-	if (get_irn_op(node) == op_End)
+	if (is_End(node))
 		return;
 
 	arity = get_irn_arity(node);
@@ -679,30 +741,52 @@ static void update_extbb_info(ir_node *node, graph_entry_t *graph)
 		ir_extblk *other_extbb = get_nodes_extbb(pred);
 
 		if (other_extbb == extbb)
-			cnt_inc(&eb_entry->cnt_edges);	/* a in extbb edge */
+			cnt_inc(&eb_entry->cnt[bcnt_edges]);	/* a in extbb edge */
 		else {
 			extbb_entry_t *eb_entry_other = block_get_entry(&graph->recalc_cnts, get_extbb_node_nr(other_extbb), graph->extbb_hash);
 
-			cnt_inc(&eb_entry->cnt_in_edges);	/* an edge coming from another extbb */
-			cnt_inc(&eb_entry_other->cnt_out_edges);
+			cnt_inc(&eb_entry->cnt[bcnt_in_edges]);	/* an edge coming from another extbb */
+			cnt_inc(&eb_entry_other->cnt[bcnt_out_edges]);
 		}  /* if */
 	}  /* for */
 }  /* update_extbb_info */
 
-/** Calculates how many arguments of the call are const. */
-static int cnt_const_args(ir_node *call) {
-	int i, res = 0;
+/**
+ * Calculates how many arguments of the call are const, updates
+ * param distribution.
+ */
+static void analyse_params_of_Call(graph_entry_t *graph, ir_node *call)
+{
+	int i, num_const_args = 0, num_local_adr = 0;
 	int n = get_Call_n_params(call);
 
 	for (i = 0; i < n; ++i) {
 		ir_node *param = get_Call_param(call, i);
-		ir_op   *op = get_irn_op(param);
 
-		if (op == op_Const || op == op_SymConst)
-			++res;
+		if (is_irn_constlike(param))
+			++num_const_args;
+		else if (is_Sel(param)) {
+			ir_node *base = param;
+
+			do {
+				base = get_Sel_ptr(base);
+			} while (is_Sel(base));
+
+			if (base == get_irg_frame(current_ir_graph))
+				++num_local_adr;
+		}
+
 	}  /* for */
-	return res;
-}  /* cnt_const_args */
+
+	if (num_const_args > 0)
+		cnt_inc(&graph->cnt[gcnt_call_with_cnst_arg]);
+	if (num_const_args == n)
+		cnt_inc(&graph->cnt[gcnt_call_with_all_cnst_arg]);
+	if (num_local_adr > 0)
+		cnt_inc(&graph->cnt[gcnt_call_with_local_adr]);
+
+	stat_inc_int_distrib_tbl(status->dist_param_cnt, n);
+}  /* analyse_params_of_Call */
 
 /**
  * Update info on calls.
@@ -716,7 +800,6 @@ static void stat_update_call(ir_node *call, graph_entry_t *graph)
 	ir_node   *ptr = get_Call_ptr(call);
 	ir_entity *ent = NULL;
 	ir_graph  *callee = NULL;
-	int       num_const_args;
 
 	/*
 	 * If the block is bad, the whole subgraph will collapse later
@@ -726,12 +809,12 @@ static void stat_update_call(ir_node *call, graph_entry_t *graph)
 	if (is_Bad(block))
 		return;
 
-	cnt_inc(&graph->cnt_all_calls);
+	cnt_inc(&graph->cnt[gcnt_all_calls]);
 
 	/* found a call, this function is not a leaf */
 	graph->is_leaf = 0;
 
-	if (get_irn_op(ptr) == op_SymConst) {
+	if (is_SymConst(ptr)) {
 		if (get_SymConst_kind(ptr) == symconst_addr_ent) {
 			/* ok, we seems to know the entity */
 			ent = get_SymConst_entity(ptr);
@@ -740,17 +823,19 @@ static void stat_update_call(ir_node *call, graph_entry_t *graph)
 			/* it is recursive, if it calls at least once */
 			if (callee == graph->irg)
 				graph->is_recursive = 1;
+			if (callee == NULL)
+				cnt_inc(&graph->cnt[gcnt_external_calls]);
 		}  /* if */
 	} else {
 		/* indirect call, be could not predict */
-		cnt_inc(&graph->cnt_indirect_calls);
+		cnt_inc(&graph->cnt[gcnt_indirect_calls]);
 
 		/* NOT a leaf call */
 		graph->is_leaf_call = LCS_NON_LEAF_CALL;
 	}  /* if */
 
 	/* check, if it's a chain-call: Then, the call-block
-	* must dominate the end block. */
+	 * must dominate the end block. */
 	{
 		ir_node *curr = get_irg_end_block(graph->irg);
 		int depth = get_Block_dom_depth(block);
@@ -758,7 +843,7 @@ static void stat_update_call(ir_node *call, graph_entry_t *graph)
 		for (; curr != block && get_Block_dom_depth(curr) > depth;) {
 			curr = get_Block_idom(curr);
 
-			if (! curr || is_no_Block(curr))
+			if (! curr || !is_Block(curr))
 				break;
 		}  /* for */
 
@@ -776,11 +861,7 @@ static void stat_update_call(ir_node *call, graph_entry_t *graph)
 		}  /* if */
 	}  /* if */
 
-	/* check, if arguments of the call are const */
-	num_const_args = cnt_const_args(call);
-
-	if (num_const_args > 0)
-		cnt_inc(&graph->cnt_call_with_cnst_arg);
+	analyse_params_of_Call(graph, call);
 }  /* stat_update_call */
 
 /**
@@ -801,7 +882,7 @@ static void stat_update_call_2(ir_node *call, graph_entry_t *graph)
 	if (is_Bad(block))
 		return;
 
-	if (get_irn_op(ptr) == op_SymConst) {
+	if (is_SymConst(ptr)) {
 		if (get_SymConst_kind(ptr) == symconst_addr_ent) {
 			/* ok, we seems to know the entity */
 			ent = get_SymConst_entity(ptr);
@@ -821,6 +902,77 @@ static void stat_update_call_2(ir_node *call, graph_entry_t *graph)
 		graph->is_leaf_call = LCS_NON_LEAF_CALL;
 }  /* stat_update_call_2 */
 
+/**
+ * Find the base address and entity of an Sel node.
+ *
+ * @param sel  the node
+ *
+ * @return the base address.
+ */
+static ir_node *find_base_adr(ir_node *sel)
+{
+	ir_node *ptr = get_Sel_ptr(sel);
+
+	while (is_Sel(ptr)) {
+		sel = ptr;
+		ptr = get_Sel_ptr(sel);
+	}
+	return ptr;
+}  /* find_base_adr */
+
+/**
+ * Update info on Load/Store address statistics.
+ */
+static void stat_update_address(ir_node *node, graph_entry_t *graph)
+{
+	ir_opcode opc = get_irn_opcode(node);
+	ir_node *base;
+	ir_graph *irg;
+
+	switch (opc) {
+	case iro_SymConst:
+		/* a global address */
+		cnt_inc(&graph->cnt[gcnt_global_adr]);
+		break;
+	case iro_Sel:
+		base = find_base_adr(node);
+		irg = current_ir_graph;
+		if (base == get_irg_tls(irg)) {
+			/* a TLS variable, like a global. */
+			cnt_inc(&graph->cnt[gcnt_global_adr]);
+		} else if (base == get_irg_frame(irg)) {
+			/* a local Variable. */
+			cnt_inc(&graph->cnt[gcnt_local_adr]);
+		} else {
+			/* Pointer access */
+			if (is_Proj(base) && skip_Proj(get_Proj_pred(base)) == get_irg_start(irg)) {
+				/* pointer access through parameter, check for THIS */
+				ir_entity *ent = get_irg_entity(irg);
+
+				if (ent != NULL) {
+					ir_type *ent_tp = get_entity_type(ent);
+
+					if (get_method_calling_convention(ent_tp) & cc_this_call) {
+						if (get_Proj_proj(base) == 0) {
+							/* THIS pointer */
+							cnt_inc(&graph->cnt[gcnt_this_adr]);
+							goto end_parameter;
+						}  /* if */
+					}  /* if */
+				}  /* if */
+				/* other parameter */
+				cnt_inc(&graph->cnt[gcnt_param_adr]);
+end_parameter:	;
+			} else {
+				/* unknown Pointer access */
+				cnt_inc(&graph->cnt[gcnt_other_adr]);
+			}  /* if */
+		}  /* if */
+	default:
+		;
+	}  /* switch */
+}  /* stat_update_address */
+
 /**
  * Walker for reachable nodes count.
  */
@@ -830,12 +982,12 @@ static void update_node_stat(ir_node *node, void *env)
 	node_entry_t *entry;
 
 	ir_op *op = stat_get_irn_op(node);
-	int arity = get_irn_arity(node);
+	int i, arity = get_irn_arity(node);
 
 	entry = opcode_get_entry(op, graph->opcode_hash);
 
 	cnt_inc(&entry->cnt_alive);
-	cnt_add_i(&graph->cnt_edges, arity);
+	cnt_add_i(&graph->cnt[gcnt_edges], arity);
 
 	/* count block edges */
 	undate_block_info(node, graph);
@@ -848,21 +1000,53 @@ static void update_node_stat(ir_node *node, void *env)
 
 	/* handle statistics for special node types */
 
-	if (op == op_Const) {
-		if (status->stat_options & FIRMSTAT_COUNT_CONSTS) {
-			/* check properties of constants */
-			stat_update_const(status, node, graph);
-		}  /* if */
-	} else if (op == op_Call) {
+	switch (op->code) {
+	case iro_Call:
 		/* check for properties that depends on calls like recursion/leaf/indirect call */
 		stat_update_call(node, graph);
+		break;
+	case iro_Load:
+		/* check address properties */
+		stat_update_address(get_Load_ptr(node), graph);
+		break;
+	case iro_Store:
+		/* check address properties */
+		stat_update_address(get_Store_ptr(node), graph);
+		break;
+	case iro_Phi:
+		/* check for non-strict Phi nodes */
+		for (i = arity - 1; i >= 0; --i) {
+			ir_node *pred = get_Phi_pred(node, i);
+			if (is_Unknown(pred)) {
+				/* found an Unknown predecessor, graph is not strict */
+				graph->is_strict = 0;
+				break;
+			}
+		}
+	default:
+		;
+	}  /* switch */
+
+	/* we want to count the constant IN nodes, not the CSE'ed constant's itself */
+	if (status->stat_options & FIRMSTAT_COUNT_CONSTS) {
+		int i;
+
+		for (i = get_irn_arity(node) - 1; i >= 0; --i) {
+			ir_node *pred = get_irn_n(node, i);
+
+			if (is_Const(pred)) {
+				/* check properties of constants */
+				stat_update_const(status, pred, graph);
+			}  /* if */
+		}  /* for */
 	}  /* if */
 }  /* update_node_stat */
 
 /**
  * Walker for reachable nodes count for graphs on the wait_q.
  */
-static void update_node_stat_2(ir_node *node, void *env) {
+static void update_node_stat_2(ir_node *node, void *env)
+{
 	graph_entry_t *graph = env;
 
 	/* check for properties that depends on calls like recursion/leaf/indirect call */
@@ -873,7 +1057,8 @@ static void update_node_stat_2(ir_node *node, void *env) {
 /**
  * Get the current address mark.
  */
-static unsigned get_adr_mark(graph_entry_t *graph, ir_node *node) {
+static unsigned get_adr_mark(graph_entry_t *graph, ir_node *node)
+{
 	address_mark_entry_t *value = set_find(graph->address_mark, &node, sizeof(*value), HASH_PTR(node));
 
 	return value ? value->mark : 0;
@@ -882,7 +1067,8 @@ static unsigned get_adr_mark(graph_entry_t *graph, ir_node *node) {
 /**
  * Set the current address mark.
  */
-static void set_adr_mark(graph_entry_t *graph, ir_node *node, unsigned val) {
+static void set_adr_mark(graph_entry_t *graph, ir_node *node, unsigned val)
+{
 	address_mark_entry_t *value = set_insert(graph->address_mark, &node, sizeof(*value), HASH_PTR(node));
 
 	value->mark = val;
@@ -920,7 +1106,8 @@ static int stat_adr_mark_hook(FILE *F, ir_node *node, ir_node *local)
 /**
  * Return the "operational" mode of a Firm node.
  */
-static ir_mode *get_irn_op_mode(ir_node *node) {
+static ir_mode *get_irn_op_mode(ir_node *node)
+{
 	switch (get_irn_opcode(node)) {
 	case iro_Load:
 		return get_Load_mode(node);
@@ -946,13 +1133,14 @@ static ir_mode *get_irn_op_mode(ir_node *node) {
  * calling it in the post of an outs walk. This should work even in cycles,
  * while the normal pre-walk will not.
  */
-static void mark_address_calc(ir_node *node, void *env) {
+static void mark_address_calc(ir_node *node, void *env)
+{
 	graph_entry_t *graph = env;
 	ir_mode *mode = get_irn_op_mode(node);
 	int i, n;
 	unsigned mark_preds = MARK_REF_NON_ADR;
 
-	if (! mode_is_numP(mode))
+	if (! mode_is_data(mode))
 		return;
 
 	if (mode_is_reference(mode)) {
@@ -977,7 +1165,7 @@ static void mark_address_calc(ir_node *node, void *env) {
 		ir_node *pred = get_irn_n(node, i);
 
 		mode = get_irn_op_mode(pred);
-		if (! mode_is_numP(mode))
+		if (! mode_is_data(mode))
 			continue;
 
 		set_adr_mark(graph, pred, get_adr_mark(graph, pred) | mark_preds);
@@ -991,16 +1179,17 @@ static void mark_address_calc(ir_node *node, void *env) {
  * calling it in the post of an outs walk. This should work even in cycles,
  * while the normal pre-walk will not.
  */
-static void count_adr_ops(ir_node *node, void *env) {
+static void count_adr_ops(ir_node *node, void *env)
+{
 	graph_entry_t *graph = env;
 	unsigned mark        = get_adr_mark(graph, node);
 
 	if (mark & MARK_ADDRESS_CALC)
-		cnt_inc(&graph->cnt_pure_adr_ops);
+		cnt_inc(&graph->cnt[gcnt_pure_adr_ops]);
 	else if ((mark & (MARK_REF_ADR | MARK_REF_NON_ADR)) == MARK_REF_ADR)
-		cnt_inc(&graph->cnt_pure_adr_ops);
+		cnt_inc(&graph->cnt[gcnt_pure_adr_ops]);
 	else if ((mark & (MARK_REF_ADR | MARK_REF_NON_ADR)) == (MARK_REF_ADR|MARK_REF_NON_ADR))
-		cnt_inc(&graph->cnt_all_adr_ops);
+		cnt_inc(&graph->cnt[gcnt_all_adr_ops]);
 }  /* count_adr_ops */
 
 /**
@@ -1013,17 +1202,19 @@ static void count_adr_ops(ir_node *node, void *env) {
 static void update_graph_stat(graph_entry_t *global, graph_entry_t *graph)
 {
 	node_entry_t *entry;
+	int i;
 
 	/* clear first the alive counter in the graph */
-	for (entry = pset_first(graph->opcode_hash); entry; entry = pset_next(graph->opcode_hash)) {
+	foreach_pset(graph->opcode_hash, entry) {
 		cnt_clr(&entry->cnt_alive);
-	}  /* for */
+	}  /* foreach_pset */
 
 	/* set pessimistic values */
 	graph->is_leaf       = 1;
 	graph->is_leaf_call  = LCS_UNKNOWN;
 	graph->is_recursive  = 0;
 	graph->is_chain_call = 1;
+	graph->is_strict     = 1;
 
 	/* create new block counter */
 	graph->block_hash = new_pset(block_cmp, 5);
@@ -1058,15 +1249,12 @@ static void update_graph_stat(graph_entry_t *global, graph_entry_t *graph)
 		graph->is_chain_call = 0;
 
 	/* assume we walk every graph only ONCE, we could sum here the global count */
-	for (entry = pset_first(graph->opcode_hash); entry; entry = pset_next(graph->opcode_hash)) {
+	foreach_pset(graph->opcode_hash, entry) {
 		node_entry_t *g_entry = opcode_get_entry(entry->op, global->opcode_hash);
 
 		/* update the node counter */
 		cnt_add(&g_entry->cnt_alive, &entry->cnt_alive);
-	}  /* for */
-
-	/* update the edge counter */
-	cnt_add(&global->cnt_edges, &graph->cnt_edges);
+	}  /* foreach_pset */
 
 	/* count the number of address calculation */
 	if (graph->irg != get_const_code_irg()) {
@@ -1106,6 +1294,10 @@ static void update_graph_stat(graph_entry_t *global, graph_entry_t *graph)
 
 	/* we have analyzed this graph */
 	graph->is_analyzed = 1;
+
+	/* accumulate all counter's */
+	for (i = 0; i < _gcnt_last; ++i)
+		cnt_add(&global->cnt[i], &graph->cnt[i]);
 }  /* update_graph_stat */
 
 /**
@@ -1117,6 +1309,7 @@ static void update_graph_stat(graph_entry_t *global, graph_entry_t *graph)
  */
 static void update_graph_stat_2(graph_entry_t *global, graph_entry_t *graph)
 {
+	(void) global;
 	if (graph->is_deleted) {
 		/* deleted, ignore */
 		return;
@@ -1134,16 +1327,15 @@ static void update_graph_stat_2(graph_entry_t *global, graph_entry_t *graph)
 /**
  * Register a dumper.
  */
-static void stat_register_dumper(const dumper_t *dumper) {
-	dumper_t *p = xmalloc(sizeof(*p));
+static void stat_register_dumper(const dumper_t *dumper)
+{
+	dumper_t *p = XMALLOC(dumper_t);
 
-	if (p) {
-		memcpy(p, dumper, sizeof(*p));
+	memcpy(p, dumper, sizeof(*p));
 
-		p->next        = status->dumper;
-		p->status      = status;
-		status->dumper = p;
-	}
+	p->next        = status->dumper;
+	p->status      = status;
+	status->dumper = p;
 
 	/* FIXME: memory leak */
 }  /* stat_register_dumper */
@@ -1151,7 +1343,8 @@ static void stat_register_dumper(const dumper_t *dumper) {
 /**
  * Dumps the statistics of an IR graph.
  */
-static void stat_dump_graph(graph_entry_t *entry) {
+static void stat_dump_graph(graph_entry_t *entry)
+{
 	dumper_t *dumper;
 
 	for (dumper = status->dumper; dumper; dumper = dumper->next) {
@@ -1163,7 +1356,8 @@ static void stat_dump_graph(graph_entry_t *entry) {
 /**
  * Calls all registered dumper functions.
  */
-static void stat_dump_registered(graph_entry_t *entry) {
+static void stat_dump_registered(graph_entry_t *entry)
+{
 	dumper_t *dumper;
 
 	for (dumper = status->dumper; dumper; dumper = dumper->next) {
@@ -1179,7 +1373,8 @@ static void stat_dump_registered(graph_entry_t *entry) {
 /**
  * Dumps a constant table.
  */
-static void stat_dump_consts(const constant_info_t *tbl) {
+static void stat_dump_consts(const constant_info_t *tbl)
+{
 	dumper_t *dumper;
 
 	for (dumper = status->dumper; dumper; dumper = dumper->next) {
@@ -1188,10 +1383,37 @@ static void stat_dump_consts(const constant_info_t *tbl) {
 	}  /* for */
 }  /* stat_dump_consts */
 
+/**
+ * Dumps the parameter distribution
+ */
+static void stat_dump_param_tbl(const distrib_tbl_t *tbl, graph_entry_t *global)
+{
+	dumper_t *dumper;
+
+	for (dumper = status->dumper; dumper; dumper = dumper->next) {
+		if (dumper->dump_param_tbl)
+			dumper->dump_param_tbl(dumper, tbl, global);
+	}  /* for */
+}  /* stat_dump_param_tbl */
+
+/**
+ * Dumps the optimization counter
+ */
+static void stat_dump_opt_cnt(const counter_t *tbl, unsigned len)
+{
+	dumper_t *dumper;
+
+	for (dumper = status->dumper; dumper; dumper = dumper->next) {
+		if (dumper->dump_opt_cnt)
+			dumper->dump_opt_cnt(dumper, tbl, len);
+	}  /* for */
+}  /* stat_dump_opt_cnt */
+
 /**
  * Initialize the dumper.
  */
-static void stat_dump_init(const char *name) {
+static void stat_dump_init(const char *name)
+{
 	dumper_t *dumper;
 
 	for (dumper = status->dumper; dumper; dumper = dumper->next) {
@@ -1203,7 +1425,8 @@ static void stat_dump_init(const char *name) {
 /**
  * Finish the dumper.
  */
-static void stat_dump_finish(void) {
+static void stat_dump_finish(void)
+{
 	dumper_t *dumper;
 
 	for (dumper = status->dumper; dumper; dumper = dumper->next) {
@@ -1215,7 +1438,8 @@ static void stat_dump_finish(void) {
 /**
  * Register an additional function for all dumper.
  */
-void stat_register_dumper_func(dump_graph_FUNC func) {
+void stat_register_dumper_func(dump_graph_FUNC func)
+{
 	dumper_t *dumper;
 
 	for (dumper = status->dumper; dumper; dumper = dumper->next) {
@@ -1230,7 +1454,8 @@ void stat_register_dumper_func(dump_graph_FUNC func) {
 /*
  * Helper: get an ir_op from an opcode.
  */
-ir_op *stat_get_op_from_opcode(ir_opcode code) {
+ir_op *stat_get_op_from_opcode(ir_opcode code)
+{
 	return opcode_find_entry(code, status->ir_op_hash);
 }  /* stat_get_op_from_opcode */
 
@@ -1240,7 +1465,9 @@ ir_op *stat_get_op_from_opcode(ir_opcode code) {
  * @param ctx  the hook context
  * @param op   the new IR opcode that was created.
  */
-static void stat_new_ir_op(void *ctx, ir_op *op) {
+static void stat_new_ir_op(void *ctx, ir_op *op)
+{
+	(void) ctx;
 	if (! status->stat_options)
 		return;
 
@@ -1262,7 +1489,10 @@ static void stat_new_ir_op(void *ctx, ir_op *op) {
  * @param ctx  the hook context
  * @param op   the IR opcode that is freed
  */
-static void stat_free_ir_op(void *ctx, ir_op *op) {
+static void stat_free_ir_op(void *ctx, ir_op *op)
+{
+	(void) ctx;
+	(void) op;
 	if (! status->stat_options)
 		return;
 
@@ -1279,12 +1509,15 @@ static void stat_free_ir_op(void *ctx, ir_op *op) {
  * @param irg   the IR graph on which the node is created
  * @param node  the new IR node that was created
  */
-static void stat_new_node(void *ctx, ir_graph *irg, ir_node *node) {
+static void stat_new_node(void *ctx, ir_graph *irg, ir_node *node)
+{
+	(void) ctx;
+	(void) irg;
 	if (! status->stat_options)
 		return;
 
 	/* do NOT count during dead node elimination */
-	if (status->in_dead_node_elim > 0)
+	if (status->in_dead_node_elim)
 		return;
 
 	STAT_ENTER;
@@ -1312,7 +1545,9 @@ static void stat_new_node(void *ctx, ir_graph *irg, ir_node *node) {
  * @param ctx   the hook context
  * @param node  the IR node that will be turned into an ID
  */
-static void stat_turn_into_id(void *ctx, ir_node *node) {
+static void stat_turn_into_id(void *ctx, ir_node *node)
+{
+	(void) ctx;
 	if (! status->stat_options)
 		return;
 
@@ -1335,6 +1570,37 @@ static void stat_turn_into_id(void *ctx, ir_node *node) {
 	STAT_LEAVE;
 }  /* stat_turn_into_id */
 
+/**
+ * Hook: A node is normalized
+ *
+ * @param ctx   the hook context
+ * @param node  the IR node that was normalized
+ */
+static void stat_normalize(void *ctx, ir_node *node)
+{
+	(void) ctx;
+	if (! status->stat_options)
+		return;
+
+	STAT_ENTER;
+	{
+		node_entry_t *entry;
+		graph_entry_t *graph;
+		ir_op *op = stat_get_irn_op(node);
+
+		/* increase global value */
+		graph = graph_get_entry(NULL, status->irg_hash);
+		entry = opcode_get_entry(op, graph->opcode_hash);
+		cnt_inc(&entry->normalized);
+
+		/* increase local value */
+		graph = graph_get_entry(current_ir_graph, status->irg_hash);
+		entry = opcode_get_entry(op, graph->opcode_hash);
+		cnt_inc(&entry->normalized);
+	}
+	STAT_LEAVE;
+}  /* stat_normalize */
+
 /**
  * Hook: A new graph was created
  *
@@ -1342,7 +1608,9 @@ static void stat_turn_into_id(void *ctx, ir_node *node) {
  * @param irg  the new IR graph that was created
  * @param ent  the entity of this graph
  */
-static void stat_new_graph(void *ctx, ir_graph *irg, ir_entity *ent) {
+static void stat_new_graph(void *ctx, ir_graph *irg, ir_entity *ent)
+{
+	(void) ctx;
 	if (! status->stat_options)
 		return;
 
@@ -1357,6 +1625,7 @@ static void stat_new_graph(void *ctx, ir_graph *irg, ir_entity *ent) {
 		graph->is_leaf_call  = 0;
 		graph->is_recursive  = 0;
 		graph->is_chain_call = 0;
+		graph->is_strict     = 1;
 		graph->is_analyzed   = 0;
 	}
 	STAT_LEAVE;
@@ -1372,7 +1641,9 @@ static void stat_new_graph(void *ctx, ir_graph *irg, ir_entity *ent) {
  * in our hash maps, only a flag is set which prevents this
  * information from being changed, it's "frozen" from now.
  */
-static void stat_free_graph(void *ctx, ir_graph *irg) {
+static void stat_free_graph(void *ctx, ir_graph *irg)
+{
+	(void) ctx;
 	if (! status->stat_options)
 		return;
 
@@ -1401,6 +1672,9 @@ static void stat_free_graph(void *ctx, ir_graph *irg) {
  */
 static void stat_irg_walk(void *ctx, ir_graph *irg, generic_func *pre, generic_func *post)
 {
+	(void) ctx;
+	(void) pre;
+	(void) post;
 	if (! status->stat_options)
 		return;
 
@@ -1408,7 +1682,7 @@ static void stat_irg_walk(void *ctx, ir_graph *irg, generic_func *pre, generic_f
 	{
 		graph_entry_t *graph = graph_get_entry(irg, status->irg_hash);
 
-		cnt_inc(&graph->cnt_walked);
+		cnt_inc(&graph->cnt[gcnt_acc_walked]);
 	}
 	STAT_LEAVE;
 }  /* stat_irg_walk */
@@ -1438,6 +1712,10 @@ static void stat_irg_walk_blkwise(void *ctx, ir_graph *irg, generic_func *pre, g
  */
 static void stat_irg_block_walk(void *ctx, ir_graph *irg, ir_node *node, generic_func *pre, generic_func *post)
 {
+	(void) ctx;
+	(void) node;
+	(void) pre;
+	(void) post;
 	if (! status->stat_options)
 		return;
 
@@ -1445,7 +1723,7 @@ static void stat_irg_block_walk(void *ctx, ir_graph *irg, ir_node *node, generic
 	{
 		graph_entry_t *graph = graph_get_entry(irg, status->irg_hash);
 
-		cnt_inc(&graph->cnt_walked_blocks);
+		cnt_inc(&graph->cnt[gcnt_acc_walked_blocks]);
 	}
 	STAT_LEAVE;
 }  /* stat_irg_block_walk */
@@ -1455,12 +1733,19 @@ static void stat_irg_block_walk(void *ctx, ir_graph *irg, ir_node *node, generic
  *
  * @param n     the IR node that will be removed
  * @param hmap  the hash map containing ir_op* -> opt_entry_t*
+ * @param kind  the optimization kind
  */
-static void removed_due_opt(ir_node *n, hmap_opt_entry_t *hmap) {
-	ir_op *op          = stat_get_irn_op(n);
-	opt_entry_t *entry = opt_get_entry(op, hmap);
+static void removed_due_opt(ir_node *n, hmap_opt_entry_t *hmap, hook_opt_kind kind)
+{
+	opt_entry_t *entry;
+	ir_op *op = stat_get_irn_op(n);
+
+	/* ignore CSE for Constants */
+	if (kind == HOOK_OPT_CSE && (is_Const(n) || is_SymConst(n)))
+		return;
 
 	/* increase global value */
+	entry = opt_get_entry(op, hmap);
 	cnt_inc(&entry->count);
 }  /* removed_due_opt */
 
@@ -1475,6 +1760,7 @@ static void stat_merge_nodes(
     ir_node **old_node_array, int old_num_entries,
     hook_opt_kind opt)
 {
+	(void) ctx;
 	if (! status->stat_options)
 		return;
 
@@ -1483,6 +1769,7 @@ static void stat_merge_nodes(
 		int i, j;
 		graph_entry_t *graph = graph_get_entry(current_ir_graph, status->irg_hash);
 
+		cnt_inc(&status->num_opts[opt]);
 		if (status->reassoc_run)
 			opt = HOOK_OPT_REASSOC;
 
@@ -1504,7 +1791,7 @@ static void stat_merge_nodes(
 						xopt = HOOK_OPT_CONFIRM_C;
 				}  /* if */
 
-				removed_due_opt(old_node_array[i], graph->opt_hash[xopt]);
+				removed_due_opt(old_node_array[i], graph->opt_hash[xopt], xopt);
 			}  /* if */
 		}  /* for */
 	}
@@ -1517,7 +1804,9 @@ static void stat_merge_nodes(
  * @param ctx   the hook context
  * @param flag  if non-zero, reassociation is started else stopped
  */
-static void stat_reassociate(void *ctx, int flag) {
+static void stat_reassociate(void *ctx, int flag)
+{
+	(void) ctx;
 	if (! status->stat_options)
 		return;
 
@@ -1534,7 +1823,9 @@ static void stat_reassociate(void *ctx, int flag) {
  * @param ctx  the hook context
  * @param node the IR node that will be lowered
  */
-static void stat_lower(void *ctx, ir_node *node) {
+static void stat_lower(void *ctx, ir_node *node)
+{
+	(void) ctx;
 	if (! status->stat_options)
 		return;
 
@@ -1542,7 +1833,7 @@ static void stat_lower(void *ctx, ir_node *node) {
 	{
 		graph_entry_t *graph = graph_get_entry(current_ir_graph, status->irg_hash);
 
-		removed_due_opt(node, graph->opt_hash[HOOK_LOWERED]);
+		removed_due_opt(node, graph->opt_hash[HOOK_LOWERED], HOOK_LOWERED);
 	}
 	STAT_LEAVE;
 }  /* stat_lower */
@@ -1557,6 +1848,7 @@ static void stat_lower(void *ctx, ir_node *node) {
  */
 static void stat_inline(void *ctx, ir_node *call, ir_graph *called_irg)
 {
+	(void) ctx;
 	if (! status->stat_options)
 		return;
 
@@ -1566,8 +1858,8 @@ static void stat_inline(void *ctx, ir_node *call, ir_graph *called_irg)
 		graph_entry_t *i_graph = graph_get_entry(called_irg, status->irg_hash);
 		graph_entry_t *graph   = graph_get_entry(irg, status->irg_hash);
 
-		cnt_inc(&graph->cnt_got_inlined);
-		cnt_inc(&i_graph->cnt_was_inlined);
+		cnt_inc(&graph->cnt[gcnt_acc_got_inlined]);
+		cnt_inc(&i_graph->cnt[gcnt_acc_was_inlined]);
 	}
 	STAT_LEAVE;
 }  /* stat_inline */
@@ -1577,7 +1869,9 @@ static void stat_inline(void *ctx, ir_node *call, ir_graph *called_irg)
  *
  * @param ctx  the hook context
  */
-static void stat_tail_rec(void *ctx, ir_graph *irg, int n_calls) {
+static void stat_tail_rec(void *ctx, ir_graph *irg, int n_calls)
+{
+	(void) ctx;
 	if (! status->stat_options)
 		return;
 
@@ -1595,16 +1889,18 @@ static void stat_tail_rec(void *ctx, ir_graph *irg, int n_calls) {
  *
  * @param ctx  the hook context
  */
-static void stat_strength_red(void *ctx, ir_graph *irg, ir_node *strong) {
+static void stat_strength_red(void *ctx, ir_graph *irg, ir_node *strong)
+{
+	(void) ctx;
 	if (! status->stat_options)
 		return;
 
 	STAT_ENTER;
 	{
 		graph_entry_t *graph = graph_get_entry(irg, status->irg_hash);
-		cnt_inc(&graph->cnt_strength_red);
+		cnt_inc(&graph->cnt[gcnt_acc_strength_red]);
 
-		removed_due_opt(strong, graph->opt_hash[HOOK_OPT_STRENGTH_RED]);
+		removed_due_opt(strong, graph->opt_hash[HOOK_OPT_STRENGTH_RED], HOOK_OPT_STRENGTH_RED);
 	}
 	STAT_LEAVE;
 }  /* stat_strength_red */
@@ -1614,14 +1910,14 @@ static void stat_strength_red(void *ctx, ir_graph *irg, ir_node *strong) {
  *
  * @param ctx  the hook context
  */
-static void stat_dead_node_elim(void *ctx, ir_graph *irg, int start) {
+static void stat_dead_node_elim(void *ctx, ir_graph *irg, int start)
+{
+	(void) ctx;
+	(void) irg;
 	if (! status->stat_options)
 		return;
 
-	if (start)
-		++status->in_dead_node_elim;
-	else
-		--status->in_dead_node_elim;
+	status->in_dead_node_elim = (start != 0);
 }  /* stat_dead_node_elim */
 
 /**
@@ -1630,6 +1926,10 @@ static void stat_dead_node_elim(void *ctx, ir_graph *irg, int start) {
 static void stat_if_conversion(void *context, ir_graph *irg, ir_node *phi,
                                int pos, ir_node *mux, if_result_t reason)
 {
+	(void) context;
+	(void) phi;
+	(void) pos;
+	(void) mux;
 	if (! status->stat_options)
 		return;
 
@@ -1637,7 +1937,7 @@ static void stat_if_conversion(void *context, ir_graph *irg, ir_node *phi,
 	{
 		graph_entry_t *graph = graph_get_entry(irg, status->irg_hash);
 
-		cnt_inc(&graph->cnt_if_conv[reason]);
+		cnt_inc(&graph->cnt[gcnt_if_conv + reason]);
 	}
 	STAT_LEAVE;
 }  /* stat_if_conversion */
@@ -1647,6 +1947,8 @@ static void stat_if_conversion(void *context, ir_graph *irg, ir_node *phi,
  */
 static void stat_func_call(void *context, ir_graph *irg, ir_node *call)
 {
+	(void) context;
+	(void) call;
 	if (! status->stat_options)
 		return;
 
@@ -1654,7 +1956,7 @@ static void stat_func_call(void *context, ir_graph *irg, ir_node *call)
 	{
 		graph_entry_t *graph = graph_get_entry(irg, status->irg_hash);
 
-		cnt_inc(&graph->cnt_real_func_call);
+		cnt_inc(&graph->cnt[gcnt_acc_real_func_call]);
 	}
 	STAT_LEAVE;
 }  /* stat_func_call */
@@ -1664,14 +1966,16 @@ static void stat_func_call(void *context, ir_graph *irg, ir_node *call)
  *
  * @param ctx  the hook context
  */
-static void stat_arch_dep_replace_mul_with_shifts(void *ctx, ir_node *mul) {
+static void stat_arch_dep_replace_mul_with_shifts(void *ctx, ir_node *mul)
+{
+	(void) ctx;
 	if (! status->stat_options)
 		return;
 
 	STAT_ENTER;
 	{
 		graph_entry_t *graph = graph_get_entry(current_ir_graph, status->irg_hash);
-		removed_due_opt(mul, graph->opt_hash[HOOK_OPT_ARCH_DEP]);
+		removed_due_opt(mul, graph->opt_hash[HOOK_OPT_ARCH_DEP], HOOK_OPT_ARCH_DEP);
 	}
 	STAT_LEAVE;
 }  /* stat_arch_dep_replace_mul_with_shifts */
@@ -1682,14 +1986,16 @@ static void stat_arch_dep_replace_mul_with_shifts(void *ctx, ir_node *mul) {
  * @param ctx   the hook context
  * @param node  the division node that will be optimized
  */
-static void stat_arch_dep_replace_division_by_const(void *ctx, ir_node *node) {
+static void stat_arch_dep_replace_division_by_const(void *ctx, ir_node *node)
+{
+	(void) ctx;
 	if (! status->stat_options)
 		return;
 
 	STAT_ENTER;
 	{
 		graph_entry_t *graph = graph_get_entry(current_ir_graph, status->irg_hash);
-		removed_due_opt(node, graph->opt_hash[HOOK_OPT_ARCH_DEP]);
+		removed_due_opt(node, graph->opt_hash[HOOK_OPT_ARCH_DEP], HOOK_OPT_ARCH_DEP);
 	}
 	STAT_LEAVE;
 }  /* stat_arch_dep_replace_division_by_const */
@@ -1714,8 +2020,7 @@ void stat_be_block_regpressure(ir_graph *irg, ir_node *block, int pressure, cons
 		reg_pressure_entry_t *rp_ent;
 
 		block_ent = be_block_get_entry(&status->be_data, get_irn_node_nr(block), graph->be_block_hash);
-		rp_ent    = obstack_alloc(&status->be_data, sizeof(*rp_ent));
-		memset(rp_ent, 0, sizeof(*rp_ent));
+		rp_ent    = OALLOCZ(&status->be_data, reg_pressure_entry_t);
 
 		rp_ent->class_name = class_name;
 		rp_ent->pressure   = pressure;
@@ -1864,7 +2169,7 @@ void stat_dump_snapshot(const char *name, const char *phase)
 			++p;
 			l = p - name;
 
-			if (l > sizeof(fname) - 1)
+			if (l > (int) (sizeof(fname) - 1))
 				l = sizeof(fname) - 1;
 
 			memcpy(fname, name, l);
@@ -1873,10 +2178,10 @@ void stat_dump_snapshot(const char *name, const char *phase)
 			fname[0] = '\0';
 			p = name;
 		}  /* if */
-		strncat(fname, "firmstat-", sizeof(fname));
-		strncat(fname, phase, sizeof(fname));
-		strncat(fname, "-", sizeof(fname));
-		strncat(fname, p, sizeof(fname));
+		strncat(fname, "firmstat-", sizeof(fname)-1);
+		strncat(fname, phase, sizeof(fname)-1);
+		strncat(fname, "-", sizeof(fname)-1);
+		strncat(fname, p, sizeof(fname)-1);
 
 		stat_dump_init(fname);
 
@@ -1924,11 +2229,18 @@ void stat_dump_snapshot(const char *name, const char *phase)
 		if (status->stat_options & FIRMSTAT_COUNT_CONSTS)
 			stat_dump_consts(&status->const_info);
 
+		/* dump the parameter distribution */
+		stat_dump_param_tbl(status->dist_param_cnt, global);
+
+		/* dump the optimization counter and clear them */
+		stat_dump_opt_cnt(status->num_opts, ARRAY_SIZE(status->num_opts));
+		clear_optimization_counter();
+
 		stat_dump_finish();
 
 		stat_finish_pattern_history(fname);
 
-		/* clear the global counter here */
+		/* clear the global counters here */
 		{
 			node_entry_t *entry;
 
@@ -1936,12 +2248,68 @@ void stat_dump_snapshot(const char *name, const char *phase)
 				opcode_clear_entry(entry);
 			}  /* for */
 			/* clear all global counter */
-			graph_clear_entry(global, 1);
+			graph_clear_entry(global, /*all=*/1);
 		}
 	}
 	STAT_LEAVE;
 }  /* stat_dump_snapshot */
 
+struct pass_t {
+	ir_prog_pass_t pass;
+	const char     *fname;
+	const char     *phase;
+};
+
+/**
+ * Wrapper to run stat_dump_snapshot() as a ir_prog wrapper.
+ */
+static int stat_dump_snapshot_wrapper(ir_prog *irp, void *context)
+{
+	struct pass_t *pass = context;
+
+	(void)irp;
+	stat_dump_snapshot(pass->fname, pass->phase);
+	return 0;
+}  /* stat_dump_snapshot_wrapper */
+
+/**
+ * Ensure that no verifier is run from the wrapper.
+ */
+static int no_verify(ir_prog *prog, void *ctx)
+{
+	(void)prog;
+	(void)ctx;
+	return 0;
+}
+
+/**
+ * Ensure that no dumper is run from the wrapper.
+ */
+static void no_dump(ir_prog *prog, void *ctx, unsigned idx)
+{
+	(void)prog;
+	(void)ctx;
+	(void)idx;
+}
+
+/* create an ir_pog pass */
+ir_prog_pass_t *stat_dump_snapshot_pass(
+	const char *name, const char *fname, const char *phase)
+{
+	struct pass_t *pass = XMALLOCZ(struct pass_t);
+
+	def_prog_pass_constructor(
+		&pass->pass, name ? name : "stat_snapshot", stat_dump_snapshot_wrapper);
+	pass->fname = fname;
+	pass->phase = phase;
+
+	/* no dump/verify */
+	pass->pass.dump_irprog   = no_dump;
+	pass->pass.verify_irprog = no_verify;
+
+	return &pass->pass;
+}  /* stat_dump_snapshot_pass */
+
 /** the hook entries for the Firm statistics module */
 static hook_entry_t stat_hooks[hook_last];
 
@@ -1956,8 +2324,7 @@ void firm_init_stat(unsigned enable_options)
 	if (! (enable_options & FIRMSTAT_ENABLED))
 		return;
 
-	status = xmalloc(sizeof(*status));
-	memset(status, 0, sizeof(*status));
+	status = XMALLOCZ(stat_info_t);
 
 	/* enable statistics */
 	status->stat_options = enable_options & FIRMSTAT_ENABLED ? enable_options : 0;
@@ -1967,6 +2334,7 @@ void firm_init_stat(unsigned enable_options)
 	HOOK(hook_free_ir_op,                         stat_free_ir_op);
 	HOOK(hook_new_node,                           stat_new_node);
 	HOOK(hook_turn_into_id,                       stat_turn_into_id);
+	HOOK(hook_normalize,                          stat_normalize);
 	HOOK(hook_new_graph,                          stat_new_graph);
 	HOOK(hook_free_graph,                         stat_free_graph);
 	HOOK(hook_irg_walk,                           stat_irg_walk);
@@ -2018,6 +2386,9 @@ void firm_init_stat(unsigned enable_options)
 		_op_DivModC.code = --num;
 		_op_DivModC.name = new_id_from_chars(X("DivModC"));
 
+		_op_QuotC.code   = --num;
+		_op_QuotC.name   = new_id_from_chars(X("QuotC"));
+
 		status->op_Phi0    = &_op_Phi0;
 		status->op_PhiM    = &_op_PhiM;
 		status->op_ProjM   = &_op_ProjM;
@@ -2025,6 +2396,7 @@ void firm_init_stat(unsigned enable_options)
 		status->op_DivC    = &_op_DivC;
 		status->op_ModC    = &_op_ModC;
 		status->op_DivModC = &_op_DivModC;
+		status->op_QuotC   = &_op_QuotC;
 	} else {
 		status->op_Phi0    = NULL;
 		status->op_PhiM    = NULL;
@@ -2033,6 +2405,7 @@ void firm_init_stat(unsigned enable_options)
 		status->op_DivC    = NULL;
 		status->op_ModC    = NULL;
 		status->op_DivModC = NULL;
+		status->op_QuotC   = NULL;
 	}  /* if */
 
 	/* for Florian: count the Sel depth */
@@ -2063,6 +2436,11 @@ void firm_init_stat(unsigned enable_options)
 	if (enable_options & FIRMSTAT_COUNT_CONSTS)
 		stat_init_const_cnt(status);
 
+	/* distribution table for parameter counts */
+	status->dist_param_cnt = stat_new_int_distrib_tbl();
+
+	clear_optimization_counter();
+
 #undef HOOK
 #undef X
 }  /* firm_init_stat */
@@ -2070,7 +2448,8 @@ void firm_init_stat(unsigned enable_options)
 /**
  * Frees all dumper structures.
  */
-static void stat_term_dumper(void) {
+static void stat_term_dumper(void)
+{
 	dumper_t *dumper, *next_dumper;
 
 	for (dumper = status->dumper; dumper; /* iteration done in loop body */ ) {
@@ -2085,7 +2464,8 @@ static void stat_term_dumper(void) {
 
 
 /* Terminates the statistics module, frees all memory. */
-void stat_term(void) {
+void stat_term(void)
+{
 	if (status != (stat_info_t *)&status_disable) {
 		obstack_free(&status->be_data, NULL);
 		obstack_free(&status->cnts, NULL);
@@ -2098,7 +2478,8 @@ void stat_term(void) {
 }  /* stat_term */
 
 /* returns 1 if statistics were initialized, 0 otherwise */
-int stat_is_active(void) {
+int stat_is_active(void)
+{
 	return status != (stat_info_t *)&status_disable;
 }  /* stat_is_active */