fehler66 (more unsigned int -> double magic)

[libfirm] / ir / stat / stat_dmp.c

diff --git a/ir/stat/stat_dmp.c b/ir/stat/stat_dmp.c
index 8aa9e42..7516aae 100644 (file)
--- a/ir/stat/stat_dmp.c
+++ b/ir/stat/stat_dmp.c
@@ -1,18 +1,34 @@
 /*
- * Project:     libFIRM
- * File name:   ir/ir/stat_dmp.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.
+ * Copyright (C) 1995-2007 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. Dumping.
+ * @author  Michael Beck
+ * @version $Id$
  */
 #ifdef HAVE_CONFIG_H
 # include "config.h"
 #endif
 
 #include "stat_dmp.h"
+#include "irtools.h"
 #include "irhooks.h"
 
 /**
@@ -67,6 +83,9 @@ static const struct {
        { FS_OPT_NOT_CMP,        "algebraic simplification: !(a cmp b) = a !cmp b" },
        { FS_OPT_OR_SHFT_TO_ROT, "algebraic simplification: (x << c) | (x >> (bits - c)) == Rot(x, c)" },
        { FS_OPT_REASSOC_SHIFT,  "algebraic simplification: (x SHF c1) SHF c2 = x SHF (c1+c2)" },
+       { FS_OPT_SHIFT_AND,      "algebraic simplification: (a SHF c) AND (b SHF c) = (a AND b) SHF c" },
+       { FS_OPT_SHIFT_OR,       "algebraic simplification: (a SHF c) OR (b SHF c) = (a OR b) SHF c" },
+       { FS_OPT_SHIFT_EOR,      "algebraic simplification: (a SHF c) XOR (b SHF c) = (a XOR b) SHF c" },
        { FS_OPT_CONV,           "algebraic simplification: Conv could be removed" },
        { FS_OPT_CAST,           "algebraic simplification: a Cast could be removed" },
        { FS_OPT_MIN_MAX_EQ,     "algebraic simplification: Min(a,a) = Max(a,a) = a" },
@@ -77,6 +96,11 @@ static const struct {
        { FS_OPT_MUX_TO_MAX,     "algebraic simplification: Mux(a > b, a, b) = Max(a,b)" },
        { FS_OPT_MUX_TO_ABS,     "algebraic simplification: Mux(a > b, a, b) = Abs(a,b)" },
        { FS_OPT_MUX_TO_SHR,     "algebraic simplification: Mux(a > b, a, b) = a >> b" },
+       { FS_OPT_IDEM_UNARY,     "algebraic simplification: Idempotent unary operation" },
+       { FS_OPT_MINUS_NOT,      "algebraic simplification: -(~x) = x + 1" },
+       { FS_OPT_NOT_MINUS_1,    "algebraic simplification: ~(x - 1) = -x" },
+       { FS_OPT_NOT_PLUS_1,     "algebraic simplification: ~x + 1 = -x" },
+       { FS_OPT_FP_INV_MUL,     "algebraic simplification:  x / y = x * (1.0/y)" },
        { FS_OPT_CONST_PHI,      "constant evaluation on Phi node" },
        { FS_BE_IA32_LEA,        "ia32 Backend transformation: Lea was created" },
        { FS_BE_IA32_LOAD_LEA,   "ia32 Backend transformation: Load merged with a Lea" },
@@ -140,8 +164,8 @@ static void simple_dump_opcode_hash(dumper_t *dmp, pset *set)
  */
 static void simple_dump_opt_hash(dumper_t *dmp, pset *set, int index)
 {
-       assert(index < ARR_SIZE(opt_names) && "index out of range");
-       assert(opt_names[index].kind == index && "opt_names broken");
+       assert(index < (int) ARR_SIZE(opt_names) && "index out of range");
+       assert((int) opt_names[index].kind == index && "opt_names broken");
 
        if (pset_count(set) > 0) {
                opt_entry_t *entry;
@@ -276,7 +300,7 @@ static void simple_dump_be_block_permstat_class(dumper_t *dmp, perm_class_entry_
                stat_insert_int_distrib_tbl(sum_chains, i);
        }  /* for */
        fprintf(dmp->f, "\n");
-       stat_iterate_distrib_tbl(sum_chains, simple_dump_distrib_entry, dmp->f);
+       stat_iterate_distrib_tbl(sum_chains, simple_dump_distrib_entry, dmp);
        fprintf(dmp->f, "\n");
 
        /* print cycle distribution for all perms of this class in this block */
@@ -289,7 +313,7 @@ static void simple_dump_be_block_permstat_class(dumper_t *dmp, perm_class_entry_
                stat_insert_int_distrib_tbl(sum_cycles, i);
        }  /* for */
        fprintf(dmp->f, "\n");
-       stat_iterate_distrib_tbl(sum_cycles, simple_dump_distrib_entry, dmp->f);
+       stat_iterate_distrib_tbl(sum_cycles, simple_dump_distrib_entry, dmp);
        fprintf(dmp->f, "\n");
 
        /* delete temporary sum distribution tables */
@@ -446,7 +470,7 @@ static void simple_dump_graph(dumper_t *dmp, graph_entry_t *entry)
 
        /* effects of optimizations */
        if (dump_opts) {
-               int i;
+               size_t i;
 
                simple_dump_real_func_calls(dmp, &entry->cnt[gcnt_acc_real_func_call]);
                simple_dump_tail_recursion(dmp, entry->num_tail_recursion);
@@ -501,7 +525,7 @@ static void simple_dump_graph(dumper_t *dmp, graph_entry_t *entry)
  */
 static void simple_dump_const_tbl(dumper_t *dmp, const constant_info_t *tbl)
 {
-       int i;
+       size_t i;
        counter_t sum;
 
        if (! dmp->f)
@@ -676,6 +700,8 @@ static void csv_dump_graph(dumper_t *dmp, graph_entry_t *entry)
  */
 static void csv_dump_const_tbl(dumper_t *dmp, const constant_info_t *tbl)
 {
+       (void) dmp;
+       (void) tbl;
        /* FIXME: NYI */
 }  /* csv_dump_const_tbl */
 
@@ -683,6 +709,9 @@ static void csv_dump_const_tbl(dumper_t *dmp, const constant_info_t *tbl)
  * dumps the parameter distribution table
  */
 static void csv_dump_param_tbl(dumper_t *dmp, const distrib_tbl_t *tbl, graph_entry_t *global) {
+       (void) dmp;
+       (void) tbl;
+       (void) global;
        /* FIXME: NYI */
 }  /* csv_dump_param_tbl */