* @file
* @brief Statistics for Firm. Dumping.
* @author Michael Beck
- * @version $Id$
*/
#include "config.h"
#include "irtools.h"
#include "irhooks.h"
#include "util.h"
+#include "fourcc.h"
/**
* names of the optimizations
{ (hook_opt_kind)FS_OPT_MUX_TO_MIN, "algebraic simplification: Mux(a < b, a, b) = Min(a,b)" },
{ (hook_opt_kind)FS_OPT_MUX_TO_MAX, "algebraic simplification: Mux(a > b, a, b) = Max(a,b)" },
{ (hook_opt_kind)FS_OPT_MUX_TO_BITOP, "algebraic simplification: Mux((a & 2^x) ==/!= 0, 2^x, 0) = (a & 2^x) (xor 2^x)" },
- { (hook_opt_kind)FS_OPT_IDEM_UNARY, "algebraic simplification: Idempotent unary operation" },
+ { (hook_opt_kind)FS_OPT_INVOLUTION, "algebraic simplification: OP(OP(x)) = x" },
{ (hook_opt_kind)FS_OPT_MINUS_NOT, "algebraic simplification: -(~x) = x + 1" },
{ (hook_opt_kind)FS_OPT_NOT_MINUS_1, "algebraic simplification: ~(x - 1) = -x" },
{ (hook_opt_kind)FS_OPT_NOT_PLUS_1, "algebraic simplification: ~x + 1 = -x" },
*/
static void simple_dump_opcode_hash(dumper_t *dmp, pset *set)
{
- node_entry_t *entry;
counter_t f_alive;
counter_t f_new_node;
counter_t f_Id;
cnt_clr(&f_normlized);
fprintf(dmp->f, "%-16s %-8s %-8s %-8s %-8s\n", "Opcode", "alive", "created", "->Id", "normalized");
- foreach_pset(set, node_entry_t*, entry) {
+ foreach_pset(set, node_entry_t, entry) {
fprintf(dmp->f, "%-16s %8u %8u %8u %8u\n",
get_id_str(entry->op->name),
cnt_to_uint(&entry->cnt_alive),
static void simple_dump_opt_hash(dumper_t *dmp, pset *set, int index)
{
if (pset_count(set) > 0) {
- opt_entry_t *entry;
const char *name = get_opt_name(index);
fprintf(dmp->f, "\n%s:\n", name);
fprintf(dmp->f, "%-16s %-8s\n", "Opcode", "deref");
- foreach_pset(set, opt_entry_t*, entry) {
+ foreach_pset(set, opt_entry_t, entry) {
fprintf(dmp->f, "%-16s %8u\n",
get_id_str(entry->op->name), cnt_to_uint(&entry->count));
} /* foreach_pset */
*/
static void simple_dump_be_block_reg_pressure(dumper_t *dmp, graph_entry_t *entry)
{
- be_block_entry_t *b_entry = (be_block_entry_t*)pset_first(entry->be_block_hash);
- reg_pressure_entry_t *rp_entry;
-
/* return if no be statistic information available */
- if (! b_entry)
+ be_block_entry_t *const b_first = pset_first(be_block_entry_t, entry->be_block_hash);
+ if (!b_first)
return;
fprintf(dmp->f, "\nREG PRESSURE:\n");
fprintf(dmp->f, "%12s", "Block Nr");
/* print table head (register class names) */
- foreach_pset(b_entry->reg_pressure, reg_pressure_entry_t*, rp_entry)
+ foreach_pset(b_first->reg_pressure, reg_pressure_entry_t, rp_entry)
fprintf(dmp->f, "%15s", rp_entry->class_name);
fprintf(dmp->f, "\n");
/* print the reg pressure for all blocks and register classes */
- for (/* b_entry is already initialized */ ;
- b_entry;
- b_entry = (be_block_entry_t*)pset_next(entry->be_block_hash)) {
+ foreach_pset(entry->block_hash, be_block_entry_t, b_entry) {
fprintf(dmp->f, "BLK %6ld", b_entry->block_nr);
- foreach_pset(b_entry->reg_pressure, reg_pressure_entry_t*, rp_entry)
+ foreach_pset(b_entry->reg_pressure, reg_pressure_entry_t, rp_entry)
fprintf(dmp->f, "%15d", rp_entry->pressure);
fprintf(dmp->f, "\n");
} /* for */
static void simple_dump_be_block_sched_ready(dumper_t *dmp, graph_entry_t *entry)
{
if (pset_count(entry->be_block_hash) > 0) {
- be_block_entry_t *b_entry;
- int i;
+ int i;
fprintf(dmp->f, "\nSCHEDULING: NUMBER OF READY NODES\n");
fprintf(dmp->f, "%12s %12s %12s %12s %12s %12s %12s\n",
"Block Nr", "1 node", "2 nodes", "3 nodes", "4 nodes", "5 or more", "AVERAGE");
- foreach_pset(entry->be_block_hash, be_block_entry_t*, b_entry) {
+ foreach_pset(entry->be_block_hash, be_block_entry_t, b_entry) {
/* this ensures that all keys from 1 to 5 are in the table */
for (i = 1; i < 6; ++i)
stat_insert_int_distrib_tbl(b_entry->sched_ready, i);
*/
static void simple_dump_be_block_permstat_class(dumper_t *dmp, perm_class_entry_t *entry)
{
- perm_stat_entry_t *ps_ent;
- distrib_tbl_t *sum_chains = stat_new_int_distrib_tbl();
- distrib_tbl_t *sum_cycles = stat_new_int_distrib_tbl();
- char buf[16];
- int i;
+ distrib_tbl_t *sum_chains = stat_new_int_distrib_tbl();
+ distrib_tbl_t *sum_cycles = stat_new_int_distrib_tbl();
+ char buf[16];
+ int i;
fprintf(dmp->f, "%12s %12s %12s %12s %12s %12s\n",
"size",
"# exchanges"
);
- foreach_pset(entry->perm_stat, perm_stat_entry_t*, ps_ent) {
+ foreach_pset(entry->perm_stat, perm_stat_entry_t, ps_ent) {
fprintf(dmp->f, "%12d %12d %12d %12d %12d %12d\n",
ps_ent->size,
ps_ent->real_size,
static void simple_dump_be_block_permstat(dumper_t *dmp, graph_entry_t *entry)
{
if (pset_count(entry->be_block_hash) > 0) {
- be_block_entry_t *b_entry;
-
fprintf(dmp->f, "\nPERMUTATION STATISTICS BEGIN:\n");
- foreach_pset(entry->be_block_hash, be_block_entry_t*, b_entry) {
- perm_class_entry_t *pc_ent;
-
+ foreach_pset(entry->be_block_hash, be_block_entry_t, b_entry) {
fprintf(dmp->f, "BLOCK %ld:\n", b_entry->block_nr);
if (b_entry->perm_class_stat) {
- foreach_pset(b_entry->perm_class_stat, perm_class_entry_t*, pc_ent) {
+ foreach_pset(b_entry->perm_class_stat, perm_class_entry_t, pc_ent) {
fprintf(dmp->f, "register class %s:\n", pc_ent->class_name);
simple_dump_be_block_permstat_class(dmp, pc_ent);
} /* foreach_pset */
*/
static void simple_dump_graph(dumper_t *dmp, graph_entry_t *entry)
{
- int i, dump_opts = 1;
- block_entry_t *b_entry;
- extbb_entry_t *eb_entry;
+ int dump_opts = 1;
if (! dmp->f)
return;
if (entry->irg) {
ir_graph *const_irg = get_const_code_irg();
+ int i;
if (entry->irg == const_irg)
fprintf(dmp->f, "\nConst code Irg %p", (void *)entry->irg);
/* 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);
- for (i = 0; i < sizeof(entry->opt_hash)/sizeof(entry->opt_hash[0]); ++i) {
+ for (i = 0; i != ARRAY_SIZE(entry->opt_hash); ++i) {
simple_dump_opt_hash(dmp, entry->opt_hash[i], i);
} /* for */
/* dump block info */
fprintf(dmp->f, "\n%12s %12s %12s %12s %12s %12s %12s\n", "Block Nr", "Nodes", "intern E", "incoming E", "outgoing E", "Phi", "quot");
- foreach_pset(entry->block_hash, block_entry_t*, b_entry) {
+ foreach_pset(entry->block_hash, block_entry_t, b_entry) {
fprintf(dmp->f, "BLK %6ld %12u %12u %12u %12u %12u %4.8f %s\n",
b_entry->block_nr,
cnt_to_uint(&b_entry->cnt[bcnt_nodes]),
/* dump block permutation statistics */
simple_dump_be_block_permstat(dmp, entry);
-
- if (dmp->status->stat_options & FIRMSTAT_COUNT_EXTBB && entry->extbb_hash) {
- /* dump extended block info */
- fprintf(dmp->f, "\n%12s %12s %12s %12s %12s %12s %12s\n", "Extbb Nr", "Nodes", "intern E", "incoming E", "outgoing E", "Phi", "quot");
- foreach_pset(entry->extbb_hash, extbb_entry_t*, 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[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 */
}
} /* simple_dump_graph */
{
dumper_t *dmp = (dumper_t*)env;
- fprintf(dmp->f, "%d : %u\n", PTR_TO_INT(entry->object), cnt_to_uint(&entry->cnt));
+ fprintf(dmp->f, "%ld : %u\n", (long int)PTR_TO_INT(entry->object),
+ cnt_to_uint(&entry->cnt));
} /* dump_tbl_line */
/**
*/
static void csv_count_nodes(dumper_t *dmp, graph_entry_t *graph, counter_t cnt[])
{
- node_entry_t *entry;
int i;
for (i = 0; i < 4; ++i)
cnt_clr(&cnt[i]);
- foreach_pset(graph->opcode_hash, node_entry_t*, entry) {
+ foreach_pset(graph->opcode_hash, node_entry_t, entry) {
if (entry->op == op_Phi) {
/* normal Phi */
cnt_add(&cnt[1], &entry->cnt_alive);
ir_graph *const_irg = get_const_code_irg();
if (entry->irg == const_irg) {
- name = "<Const code Irg>";
return;
} else {
if (entry->ent)
projects / libfirm / blobdiff