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 {
63 unsigned infeasible : 1;
67 cmp_freq(const void *a, const void *b, size_t size)
72 return !(p->irn == q->irn);
76 set_find_freq(set * set, const ir_node * irn)
81 return set_find(set, &query, sizeof(query), HASH_PTR(irn));
85 set_insert_freq(set * set, const ir_node * irn)
91 return set_insert(set, &query, sizeof(query), HASH_PTR(irn));
95 get_block_execfreq(const exec_freq_t *ef, const ir_node * irn)
100 assert(is_Block(irn));
101 freq = set_find_freq(freqs, irn);
109 #define ZERO(x) (fabs(x) < 0.0001)
112 block_walker(ir_node * bb, void * data)
114 walkerdata_t *wd = data;
116 set_insert_freq(wd->set, bb);
117 set_irn_link(bb, (void*)wd->idx++);
122 solve_lgs(double * a_data, double * b_data, size_t size)
125 = gsl_matrix_view_array (a_data, size, size);
128 = gsl_vector_view_array (b_data, size);
130 gsl_vector *x = gsl_vector_alloc (size);
134 gsl_permutation * p = gsl_permutation_alloc (size);
136 gsl_linalg_LU_decomp (&m.matrix, p, &s);
138 gsl_linalg_LU_solve (&m.matrix, p, &b.vector, x);
140 gsl_permutation_free (p);
146 solve_lgs(double * A, double * b, size_t size)
148 if(firm_gaussjordansolve(A,b,size) == 0) {
157 get_cf_probability(ir_node *bb, int pos, double loop_weight)
162 ir_node *pred = get_Block_cfgpred_block(bb, pos);
164 cur = get_loop_depth(get_irn_loop(bb)) < get_loop_depth(get_irn_loop(pred)) ? 1.0 : loop_weight;
166 for(i = get_Block_n_cfg_outs(pred) - 1; i >= 0; --i) {
167 ir_node *succ = get_Block_cfg_out(pred, i);
169 sum += get_loop_depth(get_irn_loop(succ)) < get_loop_depth(get_irn_loop(pred)) ? 1.0 : loop_weight;
175 static void exec_freq_node_info(void *ctx, FILE *f, const ir_node *irn)
178 exec_freq_t *ef = ctx;
179 fprintf(f, "execution frequency: %g\n", get_block_execfreq(ef, irn));
184 compute_execfreq(ir_graph * irg, double loop_weight)
200 ef = xmalloc(sizeof(ef[0]));
201 memset(ef, 0, sizeof(ef[0]));
202 freqs = ef->set = new_set(cmp_freq, 32);
204 construct_cf_backedges(irg);
209 irg_block_walk_graph(irg, block_walker, NULL, &wd);
211 size = set_count(freqs);
212 matrix = xmalloc(size*size*sizeof(*matrix));
213 memset(matrix, 0, size*size*sizeof(*matrix));
214 rhs = xmalloc(size*sizeof(*rhs));
215 memset(rhs, 0, size*sizeof(*rhs));
217 set_foreach(freqs, freq) {
218 ir_node *bb = (ir_node *)freq->irn;
219 size_t idx = (int)get_irn_link(bb);
221 matrix[idx * (size + 1)] = -1.0;
223 if (bb == get_irg_start_block(irg)) {
224 rhs[(int)get_irn_link(bb)] = -1.0;
228 for(i = get_Block_n_cfgpreds(bb) - 1; i >= 0; --i) {
229 ir_node *pred = get_Block_cfgpred_block(bb, i);
230 size_t pred_idx = (int)get_irn_link(pred);
232 // matrix[pred_idx + idx*size] += 1.0/(double)get_Block_n_cfg_outs(pred);
233 matrix[pred_idx + idx * size] += get_cf_probability(bb, i, loop_weight);
237 x = solve_lgs(matrix, rhs, size);
243 set_foreach(freqs, freq) {
244 const ir_node *bb = freq->irn;
245 size_t idx = PTR_TO_INT(get_irn_link(bb));
248 freq->freq = ZERO(gsl_vector_get(x, idx)) ? 0.0 : gsl_vector_get(x, idx);
250 freq->freq = ZERO(x[idx]) ? 0.0 : x[idx];
252 // ir_fprintf(stderr, "execfreq %+F: %f\n", bb, freq->freq);
260 memset(&ef->hook, 0, sizeof(ef->hook));
261 ef->hook.context = ef;
262 ef->hook.hook._hook_node_info = exec_freq_node_info;
263 register_hook(hook_node_info, &ef->hook);
269 free_execfreq(exec_freq_t *ef)
272 unregister_hook(hook_node_info, &ef->hook);