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)
85 assert(is_Block(irn));
87 freq = set_find_freq(freqs, irn);
94 #define ZERO(x) (((x) > 0) ? ((x) < 0.0001) : ((x) > -0.0001))
97 block_walker(ir_node * bb, void * data)
99 walkerdata_t *wd = data;
101 set_insert_freq(wd->set, bb);
102 set_irn_link(bb, (void*)wd->idx++);
107 solve_lgs(double * a_data, double * b_data, size_t size)
110 = gsl_matrix_view_array (a_data, size, size);
113 = gsl_vector_view_array (b_data, size);
115 gsl_vector *x = gsl_vector_alloc (size);
119 gsl_permutation * p = gsl_permutation_alloc (size);
121 gsl_linalg_LU_decomp (&m.matrix, p, &s);
123 gsl_linalg_LU_solve (&m.matrix, p, &b.vector, x);
125 gsl_permutation_free (p);
131 solve_lgs(double * A, double * b, size_t size)
133 if(firm_gaussjordansolve(A,b,size) == 0) {
142 get_cf_probability(ir_node *bb, int pos)
144 #define LOOP_WEIGHT 9.0
149 ir_node *pred = get_Block_cfgpred_block(bb, pos);
151 cur = get_loop_depth(get_irn_loop(bb)) < get_loop_depth(get_irn_loop(pred)) ? 1.0 : LOOP_WEIGHT;
153 for(i = 0, n = get_Block_n_cfg_outs(pred); i < n; ++i) {
154 ir_node *succ = get_Block_cfg_out(pred, i);
156 sum += get_loop_depth(get_irn_loop(succ)) < get_loop_depth(get_irn_loop(pred)) ? 1.0 : LOOP_WEIGHT;
163 compute_execfreq(ir_graph * irg)
165 set *freqs = new_set(cmp_freq, 32);
178 construct_cf_backedges(irg);
183 irg_block_walk_graph(irg, block_walker, NULL, &wd);
185 size = set_count(freqs);
186 matrix = xmalloc(size*size*sizeof(*matrix));
187 memset(matrix, 0, size*size*sizeof(*matrix));
188 rhs = xmalloc(size*sizeof(*rhs));
189 memset(rhs, 0, size*sizeof(*rhs));
191 set_foreach(freqs, freq) {
192 ir_node *bb = (ir_node *)freq->irn;
193 size_t idx = (int)get_irn_link(bb);
195 matrix[idx * (size + 1)] = -1.0;
197 if (bb == get_irg_start_block(irg)) {
198 rhs[(int)get_irn_link(bb)] = -1.0;
202 for(i = get_Block_n_cfgpreds(bb) - 1; i >= 0; --i) {
203 ir_node *pred = get_Block_cfgpred_block(bb, i);
204 size_t pred_idx = (int)get_irn_link(pred);
206 // matrix[pred_idx + idx*size] += 1.0/(double)get_Block_n_cfg_outs(pred);
207 matrix[pred_idx + idx * size] += get_cf_probability(bb, i);
211 x = solve_lgs(matrix, rhs, size);
217 set_foreach(freqs, freq) {
218 const ir_node *bb = freq->irn;
219 size_t idx = PTR_TO_INT(get_irn_link(bb));
222 freq->freq = ZERO(gsl_vector_get(x, idx)) ? 0.0 : gsl_vector_get(x, idx);
224 freq->freq = ZERO(x[idx]) ? 0.0 : x[idx];
226 // ir_fprintf(stderr, "execfreq %+F: %f\n", bb, freq->freq);
238 free_execfreq(set * freqs)
240 if(freqs) del_set(freqs);