* @author Michael Beck
* @version $Id$
*/
-#ifdef HAVE_CONFIG_H
-# include "config.h"
-#endif
+#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"
/** 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;
/**
* global status
*/
-static const int status_disable = 0;
+static const unsigned status_disable = 0;
static stat_info_t *status = (stat_info_t *)&status_disable;
/**
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*
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);
static void graph_clear_entry(graph_entry_t *elem, int all) {
int i;
- /* clear accumulated / non-acumulated counter */
+ /* clear accumulated / non-accumulated counter */
for (i = all ? 0 : _gcnt_non_acc; i < _gcnt_last; ++i) {
cnt_clr(&elem->cnt[i]);
} /* for */
/**
* 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)
} /* 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 */
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);
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);
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);
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);
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);
} /* if */
break;
case iro_Mul:
- if (get_irn_op(get_Mul_left(node)) == op_Const || get_irn_op(get_Mul_right(node)) == op_Const) {
+ 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 (get_irn_op(get_Div_right(node)) == op_Const) {
+ 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 (get_irn_op(get_Mod_right(node)) == op_Const) {
+ 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 (get_irn_op(get_DivMod_right(node)) == op_Const) {
+ 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 (get_irn_op(get_Sel_ptr(node)) == op_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 (get_irn_op(get_Sel_ptr(get_Sel_ptr(node))) == op_Sel) {
+ 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 */
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);
/* 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);
/* 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 */
} /* 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);
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);
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);
/* handle statistics for special node types */
switch (op->code) {
- case iro_Const:
- if (status->stat_options & FIRMSTAT_COUNT_CONSTS) {
- /* check properties of constants */
- stat_update_const(status, node, graph);
- } /* if */
- break;
case iro_Call:
/* check for properties that depends on calls like recursion/leaf/indirect call */
stat_update_call(node, graph);
/* 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 */
/**
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);
* Register a dumper.
*/
static void stat_register_dumper(const dumper_t *dumper) {
- dumper_t *p = xmalloc(sizeof(*p));
+ 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 */
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
*
graph->is_leaf_call = 0;
graph->is_recursive = 0;
graph->is_chain_call = 0;
+ graph->is_strict = 1;
graph->is_analyzed = 0;
}
STAT_LEAVE;
*
* @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 */
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 */
}
{
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 */
graph_entry_t *graph = graph_get_entry(irg, status->irg_hash);
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 */
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 */
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 */
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;
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);
stat_finish_pattern_history(fname);
- /* clear the global counter here */
+ /* clear the global counters here */
{
node_entry_t *entry;
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];
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;
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);
_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;
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;
status->op_DivC = NULL;
status->op_ModC = NULL;
status->op_DivModC = NULL;
+ status->op_QuotC = NULL;
} /* if */
/* for Florian: count the Sel depth */
projects / libfirm / blobdiff