/*
- * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved.
+ * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
*
* This file is part of libFirm.
*
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 */
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;
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 */
{
graph_entry_t key;
graph_entry_t *elem;
- int i;
+ size_t i;
key.irg = irg;
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.
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) {
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);
/* 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);
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)) {
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);
*/
static void update_graph_stat_2(graph_entry_t *global, graph_entry_t *graph)
{
+ (void) global;
if (graph->is_deleted) {
/* deleted, ignore */
return;
dumper_t *dumper;
for (dumper = status->dumper; dumper; dumper = dumper->next) {
- if (dumper->dump_const_tbl)
+ 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.
* @param op the new IR opcode that was created.
*/
static void stat_new_ir_op(void *ctx, ir_op *op) {
+ (void) ctx;
if (! status->stat_options)
return;
* @param op the IR opcode that is freed
*/
static void stat_free_ir_op(void *ctx, ir_op *op) {
+ (void) ctx;
+ (void) op;
if (! status->stat_options)
return;
* @param node the new IR node that was created
*/
static void stat_new_node(void *ctx, ir_graph *irg, ir_node *node) {
+ (void) ctx;
+ (void) irg;
if (! status->stat_options)
return;
* @param node the IR node that will be turned into an ID
*/
static void stat_turn_into_id(void *ctx, ir_node *node) {
+ (void) ctx;
if (! status->stat_options)
return;
* @param ent the entity of this graph
*/
static void stat_new_graph(void *ctx, ir_graph *irg, ir_entity *ent) {
+ (void) ctx;
if (! status->stat_options)
return;
* information from being changed, it's "frozen" from now.
*/
static void stat_free_graph(void *ctx, ir_graph *irg) {
+ (void) ctx;
if (! status->stat_options)
return;
*/
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;
*/
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;
*
* @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) {
+static void removed_due_opt(ir_node *n, hmap_opt_entry_t *hmap, hook_opt_kind kind) {
ir_op *op = stat_get_irn_op(n);
opt_entry_t *entry = opt_get_entry(op, hmap);
+ /* ignore CSE for Constants */
+ if (kind == HOOK_OPT_CSE && (is_Const(n) || is_SymConst(n)))
+ return;
+
/* increase global value */
cnt_inc(&entry->count);
} /* removed_due_opt */
ir_node **old_node_array, int old_num_entries,
hook_opt_kind opt)
{
+ (void) ctx;
if (! status->stat_options)
return;
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;
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 */
}
* @param flag if non-zero, reassociation is started else stopped
*/
static void stat_reassociate(void *ctx, int flag) {
+ (void) ctx;
if (! status->stat_options)
return;
* @param node the IR node that will be lowered
*/
static void stat_lower(void *ctx, ir_node *node) {
+ (void) ctx;
if (! status->stat_options)
return;
{
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 */
*/
static void stat_inline(void *ctx, ir_node *call, ir_graph *called_irg)
{
+ (void) ctx;
if (! status->stat_options)
return;
* @param ctx the hook context
*/
static void stat_tail_rec(void *ctx, ir_graph *irg, int n_calls) {
+ (void) ctx;
if (! status->stat_options)
return;
* @param ctx the hook context
*/
static void stat_strength_red(void *ctx, ir_graph *irg, ir_node *strong) {
+ (void) ctx;
if (! status->stat_options)
return;
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 */
* @param ctx the hook context
*/
static void stat_dead_node_elim(void *ctx, ir_graph *irg, int start) {
+ (void) ctx;
+ (void) irg;
if (! status->stat_options)
return;
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;
*/
static void stat_func_call(void *context, ir_graph *irg, ir_node *call)
{
+ (void) context;
+ (void) call;
if (! status->stat_options)
return;
* @param ctx the hook context
*/
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 */
* @param node the division node that will be optimized
*/
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 */
++p;
l = p - name;
- if (l > sizeof(fname) - 1)
+ if (l > (int) (sizeof(fname) - 1))
l = sizeof(fname) - 1;
memcpy(fname, name, l);
/* 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, ARR_SIZE(status->num_opts));
+ clear_optimization_counter();
+
stat_dump_finish();
stat_finish_pattern_history(fname);
/* distribution table for parameter counts */
status->dist_param_cnt = stat_new_int_distrib_tbl();
+ clear_optimization_counter();
+
#undef HOOK
#undef X
} /* firm_init_stat */
projects / libfirm / blobdiff