lib/bench/bench_ctl.c

92  * for the values below min (bin_count), and one for those above (bin_count + 1)
94 static inline size_t val2bin(size_t bin_count, cycles_t min, cycles_t max,
97     cycles_t bin_width = (max - min) / bin_count;
100         return bin_count;
102         return bin_count + 1;
109 static inline cycles_t bin2val(size_t bin_count, cycles_t min, cycles_t max,
112     cycles_t bin_width = (max - min) / bin_count;
118  * The array has bin_count + 2 elements. result[bin_count] contains the number
119  * of values below the minium, result[bin_count + 1] those above the maximum.
124                                 size_t bin_count,
132     bins = calloc(bin_count + 2, sizeof(size_t));
136         bins[val2bin(bin_count, min, max, *v)]++;
244                                     size_t bin_count,
254     bins = do_bincounting(ctl, dimension, bin_count, min, max);
256     printf("%sbellow,%"PRIuCYCLES"\n", prefix, bins[bin_count]);
257     printf("%sabove,%"PRIuCYCLES"\n", prefix, bins[bin_count+1]);
258     for (i = 0; i < bin_count; i++) {
260             val = bin2val(bin_count, min, max, i);