3 * File name: ir/ana/execfreq.c
4 * Purpose: Compute an estimate of basic block executions.
5 * Author: Adam M. Szalkowski
9 * Copyright: (c) 2006 Universität Karlsruhe
10 * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
24 #include <gsl/gsl_linalg.h>
25 #include <gsl/gsl_vector.h>
27 #include "gaussjordan.h"
32 #include "firm_common_t.h"
37 #include "irgraph_t.h"
47 #define set_foreach(s,i) for((i)=set_first((s)); (i); (i)=set_next((s)))
49 typedef struct _freq_t {
55 typedef struct _walkerdata_t {
64 unsigned infeasible : 1;
68 cmp_freq(const void *a, const void *b, size_t size)
73 return !(p->irn == q->irn);
77 set_find_freq(set * set, const ir_node * irn)
82 return set_find(set, &query, sizeof(query), HASH_PTR(irn));
86 set_insert_freq(set * set, const ir_node * irn)
92 return set_insert(set, &query, sizeof(query), HASH_PTR(irn));
96 get_block_execfreq(const exec_freq_t *ef, const ir_node * irn)
101 assert(is_Block(irn));
102 freq = set_find_freq(freqs, irn);
111 get_block_execfreq_ulong(const exec_freq_t *ef, const ir_node *bb)
113 double f = get_block_execfreq(ef, bb);
114 return (unsigned long) (f / ef->min_non_zero);
117 #define ZERO(x) (fabs(x) < 0.0001)
120 block_walker(ir_node * bb, void * data)
122 walkerdata_t *wd = data;
124 set_insert_freq(wd->set, bb);
125 set_irn_link(bb, (void*)wd->idx++);
130 solve_lgs(double * a_data, double * b_data, size_t size)
133 = gsl_matrix_view_array (a_data, size, size);
136 = gsl_vector_view_array (b_data, size);
138 gsl_vector *x = gsl_vector_alloc (size);
142 gsl_permutation * p = gsl_permutation_alloc (size);
144 gsl_linalg_LU_decomp (&m.matrix, p, &s);
146 gsl_linalg_LU_solve (&m.matrix, p, &b.vector, x);
148 gsl_permutation_free (p);
154 solve_lgs(double * A, double * b, size_t size)
156 if(firm_gaussjordansolve(A,b,size) == 0) {
165 get_cf_probability(ir_node *bb, int pos, double loop_weight)
170 ir_node *pred = get_Block_cfgpred_block(bb, pos);
172 cur = get_loop_depth(get_irn_loop(bb)) < get_loop_depth(get_irn_loop(pred)) ? 1.0 : loop_weight;
174 for(i = get_Block_n_cfg_outs(pred) - 1; i >= 0; --i) {
175 ir_node *succ = get_Block_cfg_out(pred, i);
177 sum += get_loop_depth(get_irn_loop(succ)) < get_loop_depth(get_irn_loop(pred)) ? 1.0 : loop_weight;
183 static void exec_freq_node_info(void *ctx, FILE *f, const ir_node *irn)
186 exec_freq_t *ef = ctx;
187 fprintf(f, "execution frequency: %g/%lu\n", get_block_execfreq(ef, irn), get_block_execfreq_ulong(ef, irn));
192 compute_execfreq(ir_graph * irg, double loop_weight)
208 ef = xmalloc(sizeof(ef[0]));
209 memset(ef, 0, sizeof(ef[0]));
210 ef->min_non_zero = 1e50; /* initialize with a reasonable large number. */
211 freqs = ef->set = new_set(cmp_freq, 32);
213 construct_cf_backedges(irg);
218 irg_block_walk_graph(irg, block_walker, NULL, &wd);
220 size = set_count(freqs);
221 matrix = xmalloc(size*size*sizeof(*matrix));
222 memset(matrix, 0, size*size*sizeof(*matrix));
223 rhs = xmalloc(size*sizeof(*rhs));
224 memset(rhs, 0, size*sizeof(*rhs));
226 set_foreach(freqs, freq) {
227 ir_node *bb = (ir_node *)freq->irn;
228 size_t idx = (int)get_irn_link(bb);
230 matrix[idx * (size + 1)] = -1.0;
232 if (bb == get_irg_start_block(irg)) {
233 rhs[(int)get_irn_link(bb)] = -1.0;
237 for(i = get_Block_n_cfgpreds(bb) - 1; i >= 0; --i) {
238 ir_node *pred = get_Block_cfgpred_block(bb, i);
239 size_t pred_idx = (int)get_irn_link(pred);
241 // matrix[pred_idx + idx*size] += 1.0/(double)get_Block_n_cfg_outs(pred);
242 matrix[pred_idx + idx * size] += get_cf_probability(bb, i, loop_weight);
246 x = solve_lgs(matrix, rhs, size);
252 set_foreach(freqs, freq) {
253 const ir_node *bb = freq->irn;
254 size_t idx = PTR_TO_INT(get_irn_link(bb));
257 freq->freq = ZERO(gsl_vector_get(x, idx)) ? 0.0 : gsl_vector_get(x, idx);
259 freq->freq = ZERO(x[idx]) ? 0.0 : x[idx];
261 /* Get the minimum non-zero execution frequency. */
262 if(freq->freq != 0.0)
263 ef->min_non_zero = MIN(ef->min_non_zero, freq->freq);
271 memset(&ef->hook, 0, sizeof(ef->hook));
272 ef->hook.context = ef;
273 ef->hook.hook._hook_node_info = exec_freq_node_info;
274 register_hook(hook_node_info, &ef->hook);
280 free_execfreq(exec_freq_t *ef)
283 unregister_hook(hook_node_info, &ef->hook);