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.
23 #include <gsl/gsl_linalg.h>
24 #include <gsl/gsl_vector.h>
26 #include "gaussjordan.h"
31 #include "firm_common_t.h"
36 #include "irgraph_t.h"
45 #define set_foreach(s,i) for((i)=set_first((s)); (i); (i)=set_next((s)))
47 typedef struct _walkerdata_t {
53 cmp_freq(const void *a, const void *b, size_t size)
58 return !(p->irn == q->irn);
62 set_find_freq(set * set, const ir_node * irn)
67 return set_find(set, &query, sizeof(query), HASH_PTR(irn));
71 set_insert_freq(set * set, const ir_node * irn)
77 return set_insert(set, &query, sizeof(query), HASH_PTR(irn));
81 get_block_execfreq(set * freqs, const ir_node * irn)
83 assert(is_Block(irn));
85 freq_t *freq = set_find_freq(freqs, irn);
91 #define ZERO(x) (((x) > 0) ? ((x) < 0.0001) : ((x) > -0.0001))
94 block_walker(ir_node * bb, void * data)
96 walkerdata_t *wd = data;
98 set_insert_freq(wd->set, bb);
99 set_irn_link(bb, (void*)wd->idx++);
104 solve_lgs(double * a_data, double * b_data, size_t size)
107 = gsl_matrix_view_array (a_data, size, size);
110 = gsl_vector_view_array (b_data, size);
112 gsl_vector *x = gsl_vector_alloc (size);
116 gsl_permutation * p = gsl_permutation_alloc (size);
118 gsl_linalg_LU_decomp (&m.matrix, p, &s);
120 gsl_linalg_LU_solve (&m.matrix, p, &b.vector, x);
122 gsl_permutation_free (p);
128 solve_lgs(double * A, double * b, size_t size)
130 if(firm_gaussjordansolve(A,b,size) == 0) {
139 get_cf_probability(const ir_node * bb, int pos)
141 #define LOOP_WEIGHT 9.0
147 ir_node *pred = get_Block_cfgpred_block(bb, pos);
149 if(get_loop_depth(get_irn_loop(bb)) < get_loop_depth(get_irn_loop(pred))) {
155 for(i = 0, n = get_Block_n_cfg_outs(pred); i < n; ++i) {
156 ir_node *succ = get_Block_cfg_out(pred, i);
158 if(get_loop_depth(get_irn_loop(succ)) < get_loop_depth(get_irn_loop(pred))) {
169 compute_execfreq(ir_graph * irg)
171 set *freqs = new_set(cmp_freq, 32);
184 construct_cf_backedges(irg);
189 irg_block_walk_graph(irg, block_walker, NULL, &wd);
191 size = set_count(freqs);
192 matrix = malloc(size*size*sizeof(*matrix));
193 memset(matrix, 0, size*size*sizeof(*matrix));
194 rhs = malloc(size*sizeof(*rhs));
195 memset(rhs, 0, size*sizeof(*rhs));
197 set_foreach(freqs, freq) {
198 const ir_node *bb = freq->irn;
199 size_t idx = (int)get_irn_link(bb);
201 matrix[idx*(size+1)] = -1.0;
203 if(bb == get_irg_start_block(irg)) {
204 rhs[(int)get_irn_link(bb)] = -1.0;
208 for(i = 0; i < get_Block_n_cfgpreds(bb); ++i) {
209 ir_node *pred = get_Block_cfgpred_block(bb, i);
210 size_t pred_idx = (int)get_irn_link(pred);
212 // matrix[pred_idx + idx*size] += 1.0/(double)get_Block_n_cfg_outs(pred);
213 matrix[pred_idx + idx*size] += get_cf_probability(bb, i);
217 x = solve_lgs(matrix, rhs, size);
223 set_foreach(freqs, freq) {
224 const ir_node *bb = freq->irn;
225 size_t idx = PTR_TO_INT(get_irn_link(bb));
228 freq->freq = ZERO(gsl_vector_get(x, idx)) ? 0.0 : gsl_vector_get(x, idx);
230 freq->freq = ZERO(x[idx]) ? 0.0 : x[idx];
232 ir_fprintf(stderr, "execfreq %+F: %f\n", bb, freq->freq);
244 free_execfreq(set * freqs)
246 if(freqs) del_set(freqs);