-
Notifications
You must be signed in to change notification settings - Fork 1
/
histogram.c
191 lines (165 loc) · 3.76 KB
/
histogram.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
/*
* This file is part of tframetest.
*
* Copyright (c) 2023 Tuxera Inc.
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License along
* with this program; if not, write to the Free Software Foundation, Inc.,
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
#ifndef assert
#include <assert.h>
#endif
#include <stdio.h>
#include <stdint.h>
#include "tester.h"
/* Histogram buckets in ns */
static uint64_t buckets[] = {
0,
200000,
500000,
1000000,
2000000,
5000000,
10000000,
20000000,
50000000,
100000000,
200000000,
500000000,
1000000000,
};
static char *bucket_label[] = {
" 0 ",
".2 ",
".5 ",
" 1 ",
" 2 ",
" 5 ",
"10 ",
"20 ",
"50 ",
"100",
"200",
"500",
">1s",
"ovf",
};
#define buckets_cnt (sizeof(buckets) / sizeof(*buckets))
#define SUB_BUCKET_CNT 5
#define HISTOGRAM_HEIGHT 10
static inline size_t time_get_bucket(uint64_t time)
{
size_t i;
for (i = 0; i < buckets_cnt; i++) {
if (time <= buckets[i])
return i > 0 ? i - 1 : i;
}
return buckets_cnt - 1;
}
static inline size_t time_get_sub_bucket(size_t bucket, uint64_t time)
{
uint64_t min;
uint64_t max;
min = buckets[bucket];
if (bucket + 1 < buckets_cnt)
max = buckets[bucket + 1];
else
max = min;
if (max - min == 0)
return 0;
assert(time >= min && time < max);
if (time < min)
return 0;
if (time > max)
return SUB_BUCKET_CNT - 1;
time = time - min;
return (time * SUB_BUCKET_CNT) / (max - min + 1);
}
static inline void hist_collect_cnts(const test_result_t *res, uint64_t *cnts)
{
size_t i;
/*
* Categorize the completion times in buckets and sub buckets.
* Every bucket has SUB_BUCKET_CNT sub buckets, so divide the result
* into proper one.
*/
for (i = 0; i < res->frames_written; i++) {
size_t frametime = res->completion[i].frame -
res->completion[i].start;
size_t b = time_get_bucket(frametime);
size_t sb = time_get_sub_bucket(b, frametime);
++cnts[b * SUB_BUCKET_CNT + sb];
}
}
static inline uint64_t hist_cnts_max(uint64_t *cnts, size_t sbcnt)
{
uint64_t max = 0;
size_t i;
for (i = 0; i < sbcnt; i++) {
if (cnts[i] > max)
max = cnts[i];
}
return max;
}
static inline size_t hist_cnts(void)
{
return SUB_BUCKET_CNT * buckets_cnt;
}
void print_histogram(const test_result_t *res)
{
uint64_t cnts[SUB_BUCKET_CNT * (buckets_cnt + 1)] = {0};
uint64_t max;
size_t i, j;
size_t sbcnt;
if (!res->completion)
return;
sbcnt = hist_cnts();
hist_collect_cnts(res, cnts);
/* Resolve the maximum value for scale */
max = hist_cnts_max(cnts, sbcnt);
printf("\nCompletion times:\n");
for (j = 0; j < HISTOGRAM_HEIGHT; j++) {
printf("|");
for (i = 0; i < sbcnt; i++) {
uint64_t th;
uint64_t rth;
th = cnts[i] * HISTOGRAM_HEIGHT / (max + 1);
rth = HISTOGRAM_HEIGHT - 1 - th;
if (j > rth)
printf("*");
else if (cnts[i] && j == HISTOGRAM_HEIGHT - 1)
printf("*");
else
printf(" ");
}
printf("\n");
}
printf("|");
for (i = 0; i < sbcnt; i++) {
if (i % SUB_BUCKET_CNT == 0)
printf("|");
else
printf("-");
}
printf("\n");
for (i = 0; i < sbcnt; i++) {
size_t b;
b = i / SUB_BUCKET_CNT;
if (i % SUB_BUCKET_CNT == 0)
printf("%s", bucket_label[b]);
else if (i % SUB_BUCKET_CNT >= 3)
printf(" ");
}
printf("\n");
}