/*
- * 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"
/**
{ FS_OPT_ADD_SUB, "algebraic simplification: (a + x) - x = (a - x) + x = a" },
{ FS_OPT_ADD_MUL_A_X_A, "algebraic simplification: a * x + a = a * (x + 1)" },
{ FS_OPT_SUB_0_A, "algebraic simplification: 0 - a = -a" },
+ { FS_OPT_MINUS_SUB, "algebraic simplification: -(a - b) = b - a" },
+ { FS_OPT_SUB_MINUS, "algebraic simplification: a - (-b) = a + b" },
{ FS_OPT_SUB_MUL_A_X_A, "algebraic simplification: a * x - a = a * (x - 1)" },
{ FS_OPT_SUB_SUB_X_Y_Z, "algebraic simplification: (x - y) - z = x - (y + z)" },
+ { FS_OPT_SUB_C_NOT_X, "algebraic simplification: c - ~a = a + (c+1)" },
+ { FS_OPT_SUB_TO_ADD, "algebraic simplification: (-a) - b = -(a + b), a - (b - c) = a + (c - b), a - (b * C) -> a + (b * -C)" },
+ { FS_OPT_MUL_MINUS, "algebraic simplification: (-a) * (b - c) -> a * (c - b)" },
{ FS_OPT_MUL_MINUS_1, "algebraic simplification: a * -1 = -a" },
+ { FS_OPT_MINUS_MUL_C, "algebraic simplification: (-a) * C = a * (-C)" },
+ { FS_OPT_MUL_MINUS_MINUS,"algebraic simplification: (-a) * (-b) = a * b" },
{ FS_OPT_OR, "algebraic simplification: a | a = a | 0 = 0 | a = a" },
- { FS_OPT_AND, "algebraic simplification: a & 0b1...1 = 0b1...1 & a = a & a = a" },
+ { FS_OPT_AND, "algebraic simplification: a & 0b1...1 = 0b1...1 & a = a & a = (a|X) & a = a" },
+ { FS_OPT_TO_EOR, "algebraic simplification: (a|b) & ~(a&b) = a^b" },
{ FS_OPT_EOR_A_A, "algebraic simplification: a ^ a = 0" },
{ FS_OPT_EOR_TO_NOT_BOOL,"algebraic simplification: bool ^ 1 = !bool" },
- { FS_OPT_EOR_TO_NOT, "algebraic simplification: x ^ 0b1..1 = ~x" },
+ { FS_OPT_EOR_TO_NOT, "algebraic simplification: x ^ 0b1..1 = ~x, (a ^ b) & b -> ~a & b" },
{ 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" },
{ 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_ADD_X_NOT_X, "algebraic simplification: ~x + x = -1" },
+ { FS_OPT_FP_INV_MUL, "algebraic simplification: x / y = x * (1.0/y)" },
{ FS_OPT_CONST_PHI, "constant evaluation on Phi node" },
+ { FS_OPT_PREDICATE, "predicate optimization" },
+ { FS_OPT_DEMORGAN, "optimization using DeMorgan's law" },
{ FS_BE_IA32_LEA, "ia32 Backend transformation: Lea was created" },
{ FS_BE_IA32_LOAD_LEA, "ia32 Backend transformation: Load merged with a Lea" },
{ FS_BE_IA32_STORE_LEA, "ia32 Backend transformation: Store merged with a Lea" },
*/
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;
/** prints a distribution entry */
static void simple_dump_distrib_entry(const distrib_entry_t *entry, void *env) {
- FILE *dmp_f = env;
- fprintf(dmp_f, "%12d", cnt_to_uint(&entry->cnt));
+ dumper_t *dmp = env;
+ fprintf(dmp->f, "%12d", cnt_to_uint(&entry->cnt));
} /* simple_dump_distrib_entry */
/**
stat_insert_int_distrib_tbl(b_entry->sched_ready, i);
fprintf(dmp->f, "BLK %6ld", b_entry->block_nr);
- stat_iterate_distrib_tbl(b_entry->sched_ready, simple_dump_distrib_entry, dmp->f);
+ stat_iterate_distrib_tbl(b_entry->sched_ready, simple_dump_distrib_entry, dmp);
fprintf(dmp->f, "%12.2lf", stat_calc_avg_distrib_tbl(b_entry->sched_ready));
fprintf(dmp->f, "\n");
} /* foreach_pset */
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 */
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 */
" calls : %u\n"
" indirect calls : %u\n",
entry->is_deleted ? "DELETED " : "",
- cnt_to_uint(&entry->cnt_walked), cnt_to_uint(&entry->cnt_walked_blocks),
- cnt_to_uint(&entry->cnt_was_inlined),
- cnt_to_uint(&entry->cnt_got_inlined),
- cnt_to_uint(&entry->cnt_strength_red),
+ cnt_to_uint(&entry->cnt[gcnt_acc_walked]), cnt_to_uint(&entry->cnt[gcnt_acc_walked_blocks]),
+ cnt_to_uint(&entry->cnt[gcnt_acc_was_inlined]),
+ cnt_to_uint(&entry->cnt[gcnt_acc_got_inlined]),
+ cnt_to_uint(&entry->cnt[gcnt_acc_strength_red]),
entry->is_leaf ? "YES" : "NO",
entry->is_leaf_call == LCS_NON_LEAF_CALL ? "NO" : (entry->is_leaf_call == LCS_LEAF_CALL ? "Yes" : "Maybe"),
entry->is_recursive ? "YES" : "NO",
entry->is_chain_call ? "YES" : "NO",
- cnt_to_uint(&entry->cnt_all_calls),
- cnt_to_uint(&entry->cnt_indirect_calls)
+ cnt_to_uint(&entry->cnt[gcnt_all_calls]),
+ cnt_to_uint(&entry->cnt[gcnt_indirect_calls])
);
- for (i = 0; i < sizeof(entry->cnt_if_conv)/sizeof(entry->cnt_if_conv[0]); ++i) {
- fprintf(dmp->f, " %s : %u\n", if_conv_names[i], cnt_to_uint(&entry->cnt_if_conv[i]));
+ for (i = 0; i < IF_RESULT_LAST; ++i) {
+ fprintf(dmp->f, " %s : %u\n", if_conv_names[i], cnt_to_uint(&entry->cnt[gcnt_if_conv + i]));
} /* for */
} else {
fprintf(dmp->f, "\nGlobals counts:\n");
/* address ops */
fprintf(dmp->f,
- " pure address calculation ops: %u\n"
- " all address calculation ops : %u\n",
- cnt_to_uint(&entry->cnt_pure_adr_ops),
- cnt_to_uint(&entry->cnt_all_adr_ops));
+ " pure address calc ops : %u\n"
+ " all address calc ops : %u\n",
+ cnt_to_uint(&entry->cnt[gcnt_pure_adr_ops]),
+ cnt_to_uint(&entry->cnt[gcnt_all_adr_ops])
+ );
+
+ /* Load/Store address classification */
+ fprintf(dmp->f,
+ " global Ld/St address : %u\n"
+ " local Ld/St address : %u\n"
+ " this Ld/St address : %u\n"
+ " param Ld/St address : %u\n"
+ " other Ld/St address : %u\n",
+ cnt_to_uint(&entry->cnt[gcnt_global_adr]),
+ cnt_to_uint(&entry->cnt[gcnt_local_adr]),
+ cnt_to_uint(&entry->cnt[gcnt_this_adr]),
+ cnt_to_uint(&entry->cnt[gcnt_param_adr]),
+ cnt_to_uint(&entry->cnt[gcnt_other_adr])
+ );
simple_dump_opcode_hash(dmp, entry->opcode_hash);
- simple_dump_edges(dmp, &entry->cnt_edges);
+ simple_dump_edges(dmp, &entry->cnt[gcnt_edges]);
/* effects of optimizations */
if (dump_opts) {
- int i;
+ size_t i;
- simple_dump_real_func_calls(dmp, &entry->cnt_real_func_call);
+ simple_dump_real_func_calls(dmp, &entry->cnt[gcnt_acc_real_func_call]);
simple_dump_tail_recursion(dmp, entry->num_tail_recursion);
for (i = 0; i < sizeof(entry->opt_hash)/sizeof(entry->opt_hash[0]); ++i) {
foreach_pset(entry->block_hash, b_entry) {
fprintf(dmp->f, "BLK %6ld %12u %12u %12u %12u %12u %4.8f\n",
b_entry->block_nr,
- cnt_to_uint(&b_entry->cnt_nodes),
- cnt_to_uint(&b_entry->cnt_edges),
- cnt_to_uint(&b_entry->cnt_in_edges),
- cnt_to_uint(&b_entry->cnt_out_edges),
- cnt_to_uint(&b_entry->cnt_phi_data),
- cnt_to_dbl(&b_entry->cnt_edges) / cnt_to_dbl(&b_entry->cnt_nodes)
+ cnt_to_uint(&b_entry->cnt[bcnt_nodes]),
+ cnt_to_uint(&b_entry->cnt[bcnt_edges]),
+ cnt_to_uint(&b_entry->cnt[bcnt_in_edges]),
+ cnt_to_uint(&b_entry->cnt[bcnt_out_edges]),
+ cnt_to_uint(&b_entry->cnt[bcnt_phi_data]),
+ cnt_to_dbl(&b_entry->cnt[bcnt_edges]) / cnt_to_dbl(&b_entry->cnt[bcnt_nodes])
);
} /* foreach_pset */
foreach_pset(entry->extbb_hash, eb_entry) {
fprintf(dmp->f, "ExtBB %6ld %12u %12u %12u %12u %12u %4.8f\n",
eb_entry->block_nr,
- cnt_to_uint(&eb_entry->cnt_nodes),
- cnt_to_uint(&eb_entry->cnt_edges),
- cnt_to_uint(&eb_entry->cnt_in_edges),
- cnt_to_uint(&eb_entry->cnt_out_edges),
- cnt_to_uint(&eb_entry->cnt_phi_data),
- cnt_to_dbl(&eb_entry->cnt_edges) / cnt_to_dbl(&eb_entry->cnt_nodes)
+ cnt_to_uint(&eb_entry->cnt[bcnt_nodes]),
+ cnt_to_uint(&eb_entry->cnt[bcnt_edges]),
+ cnt_to_uint(&eb_entry->cnt[bcnt_in_edges]),
+ cnt_to_uint(&eb_entry->cnt[bcnt_out_edges]),
+ cnt_to_uint(&eb_entry->cnt[bcnt_phi_data]),
+ cnt_to_dbl(&eb_entry->cnt[bcnt_edges]) / cnt_to_dbl(&eb_entry->cnt[bcnt_nodes])
);
} /* foreach_pset */
} /* if */
*/
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)
fprintf(dmp->f, "sum %12u\n", cnt_to_uint(&sum));
} /* simple_dump_const_tbl */
+/**
+ * Dumps a line of the parameter table
+ */
+static void dump_tbl_line(const distrib_entry_t *entry, void *env) {
+ dumper_t *dmp = env;
+
+ fprintf(dmp->f, "%d : %u\n", PTR_TO_INT(entry->object), cnt_to_uint(&entry->cnt));
+} /* dump_tbl_line */
+
+/**
+ * dumps the parameter distribution table
+ */
+static void simple_dump_param_tbl(dumper_t *dmp, const distrib_tbl_t *tbl, graph_entry_t *global) {
+ fprintf(dmp->f, "\nCall parameter Information:\n");
+ fprintf(dmp->f, "---------------------\n");
+
+ stat_iterate_distrib_tbl(tbl, dump_tbl_line, dmp);
+ fprintf(dmp->f, "-------------------------------\n");
+
+ fprintf(dmp->f, "Number of Calls %12u\n", cnt_to_uint(&global->cnt[gcnt_all_calls]));
+ fprintf(dmp->f, "with const params %12u\n", cnt_to_uint(&global->cnt[gcnt_call_with_cnst_arg]));
+ fprintf(dmp->f, "with all const params %12u\n", cnt_to_uint(&global->cnt[gcnt_call_with_all_cnst_arg]));
+ fprintf(dmp->f, "with local var adr params %12u\n", cnt_to_uint(&global->cnt[gcnt_call_with_local_adr]));
+} /* simple_dump_param_tbl */
+
/**
* initialize the simple dumper
*/
const dumper_t simple_dumper = {
simple_dump_graph,
simple_dump_const_tbl,
+ simple_dump_param_tbl,
simple_init,
simple_finish,
NULL,
*/
static void csv_dump_const_tbl(dumper_t *dmp, const constant_info_t *tbl)
{
+ (void) dmp;
+ (void) tbl;
/* FIXME: NYI */
} /* csv_dump_const_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 */
+
/**
* initialize the simple dumper
*/
const dumper_t csv_dumper = {
csv_dump_graph,
csv_dump_const_tbl,
+ csv_dump_param_tbl,
csv_init,
csv_finish,
NULL,