* Copyright: (c) 2006 Universität Karlsruhe
* Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
*/
-
#ifdef HAVE_CONFIG_H
#include "config.h"
#endif
#include "irnode_t.h"
#include "irloop.h"
#include "irgwalk.h"
-#include "irouts.h"
+#include "iredges.h"
#include "irprintf.h"
#include "irhooks.h"
size_t idx;
} walkerdata_t;
-struct _exec_freq_t {
+struct ir_exec_freq {
set *set;
hook_entry_t hook;
double max;
}
double
-get_block_execfreq(const exec_freq_t *ef, const ir_node * irn)
+get_block_execfreq(const ir_exec_freq *ef, const ir_node * irn)
{
if(!ef->infeasible) {
set *freqs = ef->set;
}
unsigned long
-get_block_execfreq_ulong(const exec_freq_t *ef, const ir_node *bb)
+get_block_execfreq_ulong(const ir_exec_freq *ef, const ir_node *bb)
{
double f = get_block_execfreq(ef, bb);
int res = (int) (f > ef->min_non_zero ? ef->m * f + ef->b : 1.0);
return res;
}
-#define ZERO(x) (fabs(x) < 0.0001)
+#define EPSILON 0.0001
+#define UNDEF(x) !(x > EPSILON)
static void
block_walker(ir_node * bb, void * data)
static double
get_cf_probability(ir_node *bb, int pos, double loop_weight)
{
- double sum = 0.0;
- double cur = 0.0;
- int i;
- ir_node *pred = get_Block_cfgpred_block(bb, pos);
-
- cur = get_loop_depth(get_irn_loop(bb)) < get_loop_depth(get_irn_loop(pred)) ? 1.0 : loop_weight;
-
- for(i = get_Block_n_cfg_outs(pred) - 1; i >= 0; --i) {
- ir_node *succ = get_Block_cfg_out(pred, i);
-
- sum += get_loop_depth(get_irn_loop(succ)) < get_loop_depth(get_irn_loop(pred)) ? 1.0 : loop_weight;
- }
+ double sum = 0.0;
+ double cur = 0.0;
+ const ir_node *pred = get_Block_cfgpred_block(bb, pos);
+ const ir_loop *pred_loop = get_irn_loop(pred);
+ int pred_depth = get_loop_depth(pred_loop);
+ const ir_edge_t *edge;
+
+ cur = get_loop_depth(get_irn_loop(bb)) < get_loop_depth(get_irn_loop(pred)) ? 1.0 : loop_weight;
+
+ foreach_block_succ(pred, edge) {
+ const ir_node *block = get_edge_src_irn(edge);
+ const ir_loop *loop = get_irn_loop(block);
+ int depth = get_loop_depth(loop);
+ sum += depth < pred_depth ? 1.0 : loop_weight;
+ }
- return cur/sum;
+ return cur/sum;
}
static void exec_freq_node_info(void *ctx, FILE *f, const ir_node *irn)
{
if(is_Block(irn)) {
- exec_freq_t *ef = ctx;
+ ir_exec_freq *ef = ctx;
fprintf(f, "execution frequency: %g/%lu\n", get_block_execfreq(ef, irn), get_block_execfreq_ulong(ef, irn));
}
}
-exec_freq_t *create_execfreq(ir_graph *irg)
+ir_exec_freq *create_execfreq(ir_graph *irg)
{
- exec_freq_t *execfreq = xmalloc(sizeof(execfreq[0]));
+ ir_exec_freq *execfreq = xmalloc(sizeof(execfreq[0]));
memset(execfreq, 0, sizeof(execfreq[0]));
execfreq->set = new_set(cmp_freq, 32);
return execfreq;
}
-void set_execfreq(exec_freq_t *execfreq, const ir_node *block, double freq)
+void set_execfreq(ir_exec_freq *execfreq, const ir_node *block, double freq)
{
freq_t *f = set_insert_freq(execfreq->set, block);
f->freq = freq;
}
-exec_freq_t *
+ir_exec_freq *
compute_execfreq(ir_graph * irg, double loop_weight)
{
size_t size;
int i;
freq_t *freq;
walkerdata_t wd;
- exec_freq_t *ef;
+ ir_exec_freq *ef;
set *freqs;
#ifdef USE_GSL
gsl_vector *x;
freqs = ef->set = new_set(cmp_freq, 32);
construct_cf_backedges(irg);
+ edges_assure(irg);
wd.idx = 0;
wd.set = freqs;
size_t idx = PTR_TO_INT(get_irn_link(bb));
#ifdef USE_GSL
- freq->freq = ZERO(gsl_vector_get(x, idx)) ? 0.0 : gsl_vector_get(x, idx);
+ freq->freq = UNDEF(gsl_vector_get(x, idx)) ? EPSILON : gsl_vector_get(x, idx);
#else
- freq->freq = ZERO(x[idx]) ? 0.0 : x[idx];
+ freq->freq = UNDEF(x[idx]) ? EPSILON : x[idx];
#endif
/* get the maximum exec freq */
for(j = i + 1; j < n; ++j) {
double diff = fabs(fs[i] - fs[j]);
- if(!ZERO(diff))
+ if(!UNDEF(diff))
smallest_diff = MIN(diff, smallest_diff);
}
}
}
void
-free_execfreq(exec_freq_t *ef)
+free_execfreq(ir_exec_freq *ef)
{
del_set(ef->set);
unregister_hook(hook_node_info, &ef->hook);