fix trailing whitespaces and tabulators in the middle of a line

[libfirm] / ir / ana / execfreq.c

diff --git a/ir/ana/execfreq.c b/ir/ana/execfreq.c
index 14b4f5d..83c9e4c 100644 (file)
--- a/ir/ana/execfreq.c
+++ b/ir/ana/execfreq.c
@@ -61,15 +61,15 @@
 #endif
 
 
-#define EPSILON                     1e-5
+#define EPSILON          1e-5
 #define UNDEF(x)         (fabs(x) < EPSILON)
 #define SEIDEL_TOLERANCE 1e-7
 
 #define MAX_INT_FREQ 1000000
 
-#define set_foreach(s,i) for((i)=set_first((s)); (i); (i)=set_next((s)))
+#define set_foreach(s,i) for ((i)=set_first((s)); (i); (i)=set_next((s)))
 
-typedef struct _freq_t {
+typedef struct freq_t {
        const ir_node    *irn;
        int               idx;
        double            freq;
@@ -84,8 +84,7 @@ struct ir_exec_freq {
        unsigned infeasible : 1;
 };
 
-static int
-cmp_freq(const void *a, const void *b, size_t size)
+static int cmp_freq(const void *a, const void *b, size_t size)
 {
        const freq_t *p = a;
        const freq_t *q = b;
@@ -94,8 +93,7 @@ cmp_freq(const void *a, const void *b, size_t size)
        return !(p->irn == q->irn);
 }
 
-static freq_t *
-set_find_freq(set * set, const ir_node * irn)
+static freq_t *set_find_freq(set *set, const ir_node *irn)
 {
        freq_t     query;
 
@@ -103,8 +101,7 @@ set_find_freq(set * set, const ir_node * irn)
        return set_find(set, &query, sizeof(query), HASH_PTR(irn));
 }
 
-static freq_t *
-set_insert_freq(set * set, const ir_node * irn)
+static freq_t *set_insert_freq(set *set, const ir_node *irn)
 {
        freq_t query;
 
@@ -114,10 +111,9 @@ set_insert_freq(set * set, const ir_node * irn)
        return set_insert(set, &query, sizeof(query), HASH_PTR(irn));
 }
 
-double
-get_block_execfreq(const ir_exec_freq *ef, const ir_node * irn)
+double get_block_execfreq(const ir_exec_freq *ef, const ir_node *irn)
 {
-       if(!ef->infeasible) {
+       if (!ef->infeasible) {
                set *freqs = ef->set;
                freq_t *freq;
                assert(is_Block(irn));
@@ -139,8 +135,7 @@ get_block_execfreq_ulong(const ir_exec_freq *ef, const ir_node *bb)
        return res;
 }
 
-static double *
-solve_lgs(gs_matrix_t *mat, double *x, int size)
+static double *solve_lgs(gs_matrix_t *mat, double *x, int size)
 {
        double init = 1.0 / size;
        double dev;
@@ -155,7 +150,7 @@ solve_lgs(gs_matrix_t *mat, double *x, int size)
        do {
                ++iter;
                dev = gs_matrix_gauss_seidel(mat, x, size);
-       } while(fabs(dev) > SEIDEL_TOLERANCE);
+       } while (fabs(dev) > SEIDEL_TOLERANCE);
        stat_ev_tim_pop("execfreq_seidel_time");
        stat_ev_dbl("execfreq_seidel_iter", iter);
 
@@ -181,8 +176,7 @@ solve_lgs(gs_matrix_t *mat, double *x, int size)
 /*
  * Determine probability that predecessor pos takes this cf edge.
  */
-static double
-get_cf_probability(ir_node *bb, int pos, double loop_weight)
+static double get_cf_probability(ir_node *bb, int pos, double loop_weight)
 {
        double           sum = 0.0;
        double           cur = 1.0;
@@ -224,7 +218,7 @@ get_cf_probability(ir_node *bb, int pos, double loop_weight)
 
 static void exec_freq_node_info(void *ctx, FILE *f, const ir_node *irn)
 {
-       if(is_Block(irn)) {
+       if (is_Block(irn)) {
                ir_exec_freq *ef = ctx;
                fprintf(f, "execution frequency: %g/%lu\n", get_block_execfreq(ef, irn), get_block_execfreq_ulong(ef, irn));
        }
@@ -236,6 +230,10 @@ ir_exec_freq *create_execfreq(ir_graph *irg)
        execfreq->set = new_set(cmp_freq, 32);
 
        memset(&execfreq->hook, 0, sizeof(execfreq->hook));
+
+       // set reasonable values to convert double execfreq to ulong execfreq
+       execfreq->m = 1.0;
+
        execfreq->hook.context = execfreq;
        execfreq->hook.hook._hook_node_info = exec_freq_node_info;
        register_hook(hook_node_info, &execfreq->hook);
@@ -256,8 +254,7 @@ static void collect_blocks(ir_node *bl, void *data)
        set_insert_freq(freqs, bl);
 }
 
-ir_exec_freq *
-compute_execfreq(ir_graph * irg, double loop_weight)
+ir_exec_freq *compute_execfreq(ir_graph *irg, double loop_weight)
 {
        gs_matrix_t  *mat;
        int           size;
@@ -305,7 +302,7 @@ compute_execfreq(ir_graph * irg, double loop_weight)
                freq->idx = idx;
 
                /* Sum of (execution frequency of predecessor * probability of cf edge) ... */
-               for(i = get_Block_n_cfgpreds(bb) - 1; i >= 0; --i) {
+               for (i = get_Block_n_cfgpreds(bb) - 1; i >= 0; --i) {
                        ir_node *pred = get_Block_cfgpred_block(bb, i);
                        int pred_idx  = size - dfs_get_post_num(dfs, pred) - 1;
 
@@ -366,7 +363,7 @@ compute_execfreq(ir_graph * irg, double loop_weight)
                ef->max = MAX(ef->max, freq->freq);
 
                /* Get the minimum non-zero execution frequency. */
-               if(freq->freq > 0.0)
+               if (freq->freq > 0.0)
                        ef->min_non_zero = MIN(ef->min_non_zero, freq->freq);
        }
 
@@ -389,14 +386,14 @@ compute_execfreq(ir_graph * irg, double loop_weight)
                 * find the smallest difference of the execution frequencies
                 * we try to ressolve it with 1 integer.
                 */
-               for(i = 0; i < n; ++i) {
-                       if(fs[i] <= 0.0)
+               for (i = 0; i < n; ++i) {
+                       if (fs[i] <= 0.0)
                                continue;
 
-                       for(j = i + 1; j < n; ++j) {
+                       for (j = i + 1; j < n; ++j) {
                                double diff = fabs(fs[i] - fs[j]);
 
-                               if(!UNDEF(diff))
+                               if (!UNDEF(diff))
                                        smallest_diff = MIN(diff, smallest_diff);
                        }
                }
@@ -411,7 +408,7 @@ compute_execfreq(ir_graph * irg, double loop_weight)
                 * if the slope is so high that the largest integer would be larger than MAX_INT_FREQ
                 * set the largest int freq to that upper limit and recompute the translation function
                 */
-               if(ef->m * h2 + ef->b > MAX_INT_FREQ) {
+               if (ef->m * h2 + ef->b > MAX_INT_FREQ) {
                        ef->m = (h1 - l1) / (h2 - l2);
                        ef->b = l1 - ef->m * l2;
                }
@@ -429,8 +426,7 @@ compute_execfreq(ir_graph * irg, double loop_weight)
        return ef;
 }
 
-void
-free_execfreq(ir_exec_freq *ef)
+void free_execfreq(ir_exec_freq *ef)
 {
        del_set(ef->set);
        unregister_hook(hook_node_info, &ef->hook);