/*
- * Project: libFIRM
- * File name: ir/ana/execution_frequency.c
- * Purpose: Compute an estimate of basic block executions.
- * Author: Goetz Lindenmaier
- * Modified by:
- * Created: 5.11.2004
- * CVS-ID: $Id$
- * Copyright: (c) 2004 Universität Karlsruhe
- * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
+ * Copyright (C) 1995-2008 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 Compute an estimate of basic block executions.
+ * @author Goetz Lindenmaier
+ * @date 5.11.2004
+ * @version $Id$
*/
-#ifdef HAVE_CONFIG_H
#include "config.h"
-#endif
#include "execution_frequency.h"
#include "firm_common_t.h"
#include "set.h"
#include "pdeq.h"
+#include "hashptr.h"
-#include "irprog.h"
+#include "irprog_t.h"
+#include "irgraph_t.h"
#include "irnode_t.h"
#include "irloop.h"
#include "irgwalk.h"
#include "interval_analysis.h"
+void set_irp_exec_freq_state(exec_freq_state s);
+
/*------------------------------------------------------------------*/
/* A hashmap mapping the frequency to block and loop nodes. Block
* and loop nodes are regions. */
static int exec_freq_cmp(const void *e1, const void *e2, size_t size) {
reg_exec_freq *ef1 = (reg_exec_freq *)e1;
reg_exec_freq *ef2 = (reg_exec_freq *)e2;
+ (void) size;
+
return (ef1->reg != ef2->reg);
}
-static INLINE unsigned int exec_freq_hash(void *e) {
- unsigned int v = (unsigned int) ((reg_exec_freq *)e)->reg;
- return v ^ (v>>8);
+static inline unsigned int exec_freq_hash(reg_exec_freq *e) {
+ return HASH_PTR(e->reg);
}
-static INLINE void set_region_exec_freq(void *reg, double freq) {
+static inline void set_region_exec_freq(void *reg, double freq) {
reg_exec_freq ef;
ef.reg = reg;
ef.freq = freq;
set_insert(exec_freq_set, &ef, sizeof(ef), exec_freq_hash(&ef));
}
-INLINE double get_region_exec_freq(void *reg) {
+double get_region_exec_freq(void *reg) {
reg_exec_freq ef, *found;
ef.reg = reg;
assert(exec_freq_set);
for (i = get_irn_arity(node) - 1; i >= 0; --i) {
ir_node *pred = get_irn_n(node, i);
if (pred->visited < current_ir_graph->visited)
- my_irg_walk_2_both(pred, pre, post, env);
+ my_irg_walk_2_both(pred, pre, post, env);
}
}
for (i = get_irn_arity(node) - 1; i >= 0; --i) {
ir_node *pred = get_irn_n(node, i);
if ((pred->op == op_Block) && (pred->visited < current_ir_graph->visited))
- my_irg_walk_2_both(pred, pre, post, env);
+ my_irg_walk_2_both(pred, pre, post, env);
}
}
}
-static void walk_pre(ir_node *n, void *env) {
-
- if (get_irn_op(n) == op_Raise)
+static void walk_pre(ir_node *n, void *env)
+{
+ (void) env;
+ if (is_Raise(n))
just_passed_a_Raise = 1;
- if ( (get_irn_op(n) == op_Proj)
- && (get_irn_op(get_Proj_pred(n)) == op_Cond)
- && (just_passed_a_Raise)) {
+ if (get_irn_op(n) == op_Proj &&
+ is_Cond(get_Proj_pred(n)) &&
+ just_passed_a_Raise) {
+ ir_node *other_proj;
ir_node *c = get_Proj_pred(n);
/* If we already visited the other Proj, and it also leads to a Raise,
we are in the middle of something. Continue searching. */
assert(get_irn_n_outs(c) == 2 && "encountered a switch cond");
- ir_node *other_proj = get_irn_out(c, 0);
+ other_proj = get_irn_out(c, 0);
if (other_proj == n) other_proj = get_irn_out(c, 1);
if (get_ProjX_probability(other_proj) == Cond_prob_exception_taken) {
set_ProjX_probability(other_proj, Cond_prob_was_exception_taken);
}
}
- if (get_irn_op(n) == op_Cond) {
+ if (is_Cond(n)) {
set_irn_link(n, Cond_list);
Cond_list = n;
}
}
-static void walk_post(ir_node *n, void *env) {
-
- if (get_irn_op(n) == op_Raise)
+static void walk_post(ir_node *n, void *env)
+{
+ (void) env;
+ if (is_Raise(n))
just_passed_a_Raise = 0;
- if ( (get_irn_op(n) == op_Proj)
- && (get_irn_op(get_Proj_pred(n)) == op_Cond)
- && ((get_ProjX_probability(n) == Cond_prob_exception_taken) ||
- (get_ProjX_probability(n) == Cond_prob_was_exception_taken) )) {
+ if (get_irn_op(n) == op_Proj &&
+ is_Cond(get_Proj_pred(n)) && (
+ get_ProjX_probability(n) == Cond_prob_exception_taken ||
+ get_ProjX_probability(n) == Cond_prob_was_exception_taken
+ )) {
just_passed_a_Raise = 1;
}
}
void precompute_cond_evaluation(void) {
ir_node *c;
- compute_outs(current_ir_graph);
+ compute_irg_outs(current_ir_graph);
just_passed_a_Raise = 0;
Cond_list = NULL;
my_irg_walk_current_graph(walk_pre, walk_post, NULL);
for (c = Cond_list; c; c = get_irn_link(c)) {
+ ir_node *p0, *p1;
+
assert(get_irn_n_outs(c) == 2 && "encountered a switch cond");
- ir_node *p0 = get_irn_out(c, 0);
- ir_node *p1 = get_irn_out(c, 1);
+ p0 = get_irn_out(c, 0);
+ p1 = get_irn_out(c, 1);
/* both are exceptions */
if ((get_ProjX_probability(p0) == Cond_prob_exception_taken) &&
- (get_ProjX_probability(p1) == Cond_prob_exception_taken) ) {
+ (get_ProjX_probability(p1) == Cond_prob_exception_taken) ) {
assert(0 && "I tried to avoid these!");
/* It's a */
set_ProjX_probability(p0, Cond_prob_normal);
}
/*------------------------------------------------------------------*/
-/* The algorithm to compute the execution freqencies.
+/* The algorithm to compute the execution frequencies.
*
* Walk the control flow loop tree which we consider the interval
* tree. Compute the execution for the lowest loop, add inner loops
static double exception_prob = 0.001;
-static INLINE int is_loop_head(ir_node *cond) {
- return false;
+static inline int is_loop_head(ir_node *cond)
+{
+ (void) cond;
+ return 0;
}
/** Weight a single region in edge.
*
* Given all outs of the predecessor region, we can compute the weight of
* this single edge. */
-static INLINE double get_weighted_region_exec_freq(void *reg, int pos) {
+static inline double get_weighted_region_exec_freq(void *reg, int pos) {
void *pred_reg = get_region_in(reg, pos);
double res, full_freq = get_region_exec_freq (pred_reg);
int n_outs = get_region_n_outs (pred_reg);
ir_node *cfop;
if (is_ir_node(reg)) {
cfop = get_Block_cfgpred((ir_node *)reg, pos);
- if (is_Proj(cfop) && (get_irn_op(get_Proj_pred(cfop)) != op_Cond))
+ if (is_Proj(cfop) && !is_Cond(get_Proj_pred(cfop)))
cfop = skip_Proj(cfop);
} else {
assert(is_ir_loop(reg));
return res;
}
-static INLINE void compute_region_freqency(void *reg, double head_weight) {
+static inline void compute_region_freqency(void *reg, double head_weight) {
int i, n_ins = get_region_n_ins(reg);
double my_freq = 0;
set_region_exec_freq(reg, my_freq);
}
-static void check_proper_head(ir_loop *l, void *reg) {
+static void check_proper_head(ir_loop *l, void *reg)
+{
int i, n_ins = get_region_n_ins(reg);
+ (void) l;
for (i = 0; i < n_ins; ++i) {
assert(!get_region_in(reg, i));
}
ir_loop *l = (ir_loop *)pdeq_getl(block_worklist);
int i, n_elems = get_loop_n_elements(l);
- /* The header is initialized with the freqency of the full loop times the iteration weight. */
+ /* The header is initialized with the frequency of the full loop times the iteration weight. */
check_proper_head(l, get_loop_element(l, 0).son);
for (i = 0; i < n_elems; ++i) {
construct_intervals(current_ir_graph);
compute_frequency(default_loop_weight);
+ set_irg_exec_freq_state(irg, exec_freq_consistent);
+ if (get_irp_exec_freq_state() == exec_freq_none)
+ set_irp_exec_freq_state(exec_freq_inconsistent);
+
/*
dump_loop_tree (current_ir_graph, "-execfreq");
dump_ir_block_graph(current_ir_graph, "-execfreq");
for (i = 0; i < n_irgs; ++i) {
compute_execution_frequency(get_irp_irg(i), default_loop_weight, exception_probability);
}
+ set_irp_exec_freq_state(exec_freq_consistent);
}
/** free occupied memory, reset */
void free_execution_frequency(void) {
+ int i, n_irgs = get_irp_n_irgs();
free_intervals();
del_set(exec_freq_set);
+
+ for (i = 0; i < n_irgs; ++i)
+ set_irg_exec_freq_state(get_irp_irg(i), exec_freq_none);
+ set_irp_exec_freq_state(exec_freq_none);
+}
+
+exec_freq_state get_irg_exec_freq_state(ir_graph *irg) {
+ return irg->execfreq_state;
+}
+void set_irg_exec_freq_state(ir_graph *irg, exec_freq_state s) {
+ if ((get_irp_exec_freq_state() == exec_freq_consistent && s != exec_freq_consistent) ||
+ (get_irp_exec_freq_state() == exec_freq_none && s != exec_freq_none))
+ irp->execfreq_state = exec_freq_inconsistent;
+ irg->execfreq_state = s;
+}
+
+/* Sets irg and irp exec freq state to inconsistent if it is set to consistent. */
+void set_irg_exec_freq_state_inconsistent(ir_graph *irg) {
+ if (get_irg_exec_freq_state(irg) == exec_freq_consistent)
+ set_irg_exec_freq_state(irg, exec_freq_inconsistent);
+}
+
+void set_irp_exec_freq_state(exec_freq_state s) {
+ irp->execfreq_state = s;
+}
+
+exec_freq_state get_irp_exec_freq_state(void) {
+ return irp->execfreq_state;
+}
+
+/* Sets irp and all irg exec freq states to inconsistent if it is set to consistent. */
+void set_irp_exec_freq_state_inconsistent(void) {
+ if (get_irp_exec_freq_state() != exec_freq_none) {
+ int i, n_irgs = get_irp_n_irgs();
+ set_irp_exec_freq_state(exec_freq_inconsistent);
+ for (i = 0; i < n_irgs; ++i) {
+ ir_graph *irg = get_irp_irg(i);
+ if (get_irg_exec_freq_state(irg) != exec_freq_none)
+ irg->execfreq_state = exec_freq_inconsistent;
+ }
+ }
}
projects / libfirm / blobdiff