steadystate: use uint64_t for storing bw and iops calculations and related values...
[fio.git] / steadystate.c
CommitLineData
ba8fb6f6
VF
1#include <stdlib.h>
2
16e56d25
VF
3#include "fio.h"
4#include "steadystate.h"
5#include "helper_thread.h"
6
84784e07 7bool steadystate_enabled = false;
4cd5b75b 8
f0c50c66
JA
9static void steadystate_alloc(struct thread_data *td)
10{
11 int i;
12
bb49c8bd
VF
13 td->ss.bw_data = malloc(td->ss.dur * sizeof(uint64_t));
14 td->ss.iops_data = malloc(td->ss.dur * sizeof(uint64_t));
f0c50c66
JA
15 /* initialize so that it is obvious if the cache is not full in the output */
16 for (i = 0; i < td->ss.dur; i++)
17 td->ss.iops_data[i] = td->ss.bw_data[i] = 0;
bb49c8bd
VF
18
19 td->ss.state |= __FIO_SS_DATA;
f0c50c66
JA
20}
21
4cd5b75b 22void steadystate_setup(void)
16e56d25
VF
23{
24 int i, prev_groupid;
25 struct thread_data *td, *prev_td;
26
84784e07 27 if (!steadystate_enabled)
16e56d25
VF
28 return;
29
30 /*
31 * if group reporting is enabled, identify the last td
32 * for each group and use it for storing steady state
33 * data
34 */
35 prev_groupid = -1;
36 prev_td = NULL;
37 for_each_td(td, i) {
bb49c8bd 38 if (!td->ss.dur)
ba8fb6f6
VF
39 continue;
40
41 if (!td->o.group_reporting) {
42 steadystate_alloc(td);
16e56d25 43 continue;
ba8fb6f6 44 }
16e56d25
VF
45
46 if (prev_groupid != td->groupid) {
ba8fb6f6 47 if (prev_td != NULL) {
ba8fb6f6
VF
48 steadystate_alloc(prev_td);
49 }
16e56d25
VF
50 prev_groupid = td->groupid;
51 }
52 prev_td = td;
53 }
54
ba8fb6f6 55 if (prev_td != NULL && prev_td->o.group_reporting) {
ba8fb6f6
VF
56 steadystate_alloc(prev_td);
57 }
58}
59
9d193019 60static bool steadystate_slope(uint64_t iops, uint64_t bw,
4cd5b75b 61 struct thread_data *td)
16e56d25 62{
ba8fb6f6 63 int i, j;
16e56d25 64 double result;
16e56d25 65 struct steadystate_data *ss = &td->ss;
9d193019 66 uint64_t new_val;
16e56d25 67
ba8fb6f6
VF
68 ss->bw_data[ss->tail] = bw;
69 ss->iops_data[ss->tail] = iops;
16e56d25 70
5b4b6586 71 if (ss->state & __FIO_SS_IOPS)
7be78a8a
JA
72 new_val = iops;
73 else
74 new_val = bw;
75
17df7023
VF
76 if (ss->state & __FIO_SS_BUFFER_FULL || ss->tail - ss->head == ss->dur - 1) {
77 if (!(ss->state & __FIO_SS_BUFFER_FULL)) {
78 /* first time through */
79 for(i = 0, ss->sum_y = 0; i < ss->dur; i++) {
5b4b6586 80 if (ss->state & __FIO_SS_IOPS)
7be78a8a
JA
81 ss->sum_y += ss->iops_data[i];
82 else
83 ss->sum_y += ss->bw_data[i];
17df7023 84 j = (ss->head + i) % ss->dur;
5b4b6586 85 if (ss->state & __FIO_SS_IOPS)
94f218f6 86 ss->sum_xy += i * ss->iops_data[j];
7be78a8a 87 else
94f218f6 88 ss->sum_xy += i * ss->bw_data[j];
16e56d25 89 }
17df7023 90 ss->state |= __FIO_SS_BUFFER_FULL;
16e56d25
VF
91 } else { /* easy to update the sums */
92 ss->sum_y -= ss->oldest_y;
ba8fb6f6
VF
93 ss->sum_y += new_val;
94 ss->sum_xy = ss->sum_xy - ss->sum_y + ss->dur * new_val;
16e56d25
VF
95 }
96
5b4b6586 97 if (ss->state & __FIO_SS_IOPS)
7be78a8a
JA
98 ss->oldest_y = ss->iops_data[ss->head];
99 else
100 ss->oldest_y = ss->bw_data[ss->head];
16e56d25
VF
101
102 /*
7be78a8a
JA
103 * calculate slope as (sum_xy - sum_x * sum_y / n) / (sum_(x^2)
104 * - (sum_x)^2 / n) This code assumes that all x values are
105 * equally spaced when they are often off by a few milliseconds.
106 * This assumption greatly simplifies the calculations.
16e56d25 107 */
7be78a8a
JA
108 ss->slope = (ss->sum_xy - (double) ss->sum_x * ss->sum_y / ss->dur) /
109 (ss->sum_x_sq - (double) ss->sum_x * ss->sum_x / ss->dur);
e6a6a984 110 if (ss->state & __FIO_SS_PCT)
7be78a8a
JA
111 ss->criterion = 100.0 * ss->slope / (ss->sum_y / ss->dur);
112 else
113 ss->criterion = ss->slope;
16e56d25 114
7be78a8a
JA
115 dprint(FD_STEADYSTATE, "sum_y: %llu, sum_xy: %llu, slope: %f, "
116 "criterion: %f, limit: %f\n",
9d193019
VF
117 (unsigned long long) ss->sum_y,
118 (unsigned long long) ss->sum_xy,
119 ss->slope, ss->criterion, ss->limit);
16e56d25 120
6da94b07 121 result = ss->criterion * (ss->criterion < 0.0 ? -1.0 : 1.0);
16e56d25
VF
122 if (result < ss->limit)
123 return true;
124 }
125
126 ss->tail = (ss->tail + 1) % ss->dur;
127 if (ss->tail <= ss->head)
128 ss->head = (ss->head + 1) % ss->dur;
4cd5b75b 129
16e56d25
VF
130 return false;
131}
132
9d193019 133static bool steadystate_deviation(uint64_t iops, uint64_t bw,
4cd5b75b 134 struct thread_data *td)
16e56d25
VF
135{
136 int i;
137 double diff;
138 double mean;
16e56d25
VF
139
140 struct steadystate_data *ss = &td->ss;
141
ba8fb6f6
VF
142 ss->bw_data[ss->tail] = bw;
143 ss->iops_data[ss->tail] = iops;
16e56d25 144
17df7023
VF
145 if (ss->state & __FIO_SS_BUFFER_FULL || ss->tail - ss->head == ss->dur - 1) {
146 if (!(ss->state & __FIO_SS_BUFFER_FULL)) {
147 /* first time through */
148 for(i = 0, ss->sum_y = 0; i < ss->dur; i++)
5b4b6586 149 if (ss->state & __FIO_SS_IOPS)
7be78a8a
JA
150 ss->sum_y += ss->iops_data[i];
151 else
152 ss->sum_y += ss->bw_data[i];
17df7023 153 ss->state |= __FIO_SS_BUFFER_FULL;
16e56d25
VF
154 } else { /* easy to update the sum */
155 ss->sum_y -= ss->oldest_y;
5b4b6586 156 if (ss->state & __FIO_SS_IOPS)
7be78a8a
JA
157 ss->sum_y += ss->iops_data[ss->tail];
158 else
159 ss->sum_y += ss->bw_data[ss->tail];
16e56d25
VF
160 }
161
5b4b6586 162 if (ss->state & __FIO_SS_IOPS)
7be78a8a
JA
163 ss->oldest_y = ss->iops_data[ss->head];
164 else
165 ss->oldest_y = ss->bw_data[ss->head];
166
16e56d25 167 mean = (double) ss->sum_y / ss->dur;
ba8fb6f6 168 ss->deviation = 0.0;
16e56d25 169
4cd5b75b 170 for (i = 0; i < ss->dur; i++) {
5b4b6586 171 if (ss->state & __FIO_SS_IOPS)
7be78a8a
JA
172 diff = ss->iops_data[i] - mean;
173 else
174 diff = ss->bw_data[i] - mean;
6da94b07 175 ss->deviation = max(ss->deviation, diff * (diff < 0.0 ? -1.0 : 1.0));
16e56d25
VF
176 }
177
e6a6a984 178 if (ss->state & __FIO_SS_PCT)
7be78a8a
JA
179 ss->criterion = 100.0 * ss->deviation / mean;
180 else
181 ss->criterion = ss->deviation;
16e56d25 182
7be78a8a
JA
183 dprint(FD_STEADYSTATE, "sum_y: %llu, mean: %f, max diff: %f, "
184 "objective: %f, limit: %f\n",
9d193019
VF
185 (unsigned long long) ss->sum_y, mean,
186 ss->deviation, ss->criterion, ss->limit);
16e56d25
VF
187
188 if (ss->criterion < ss->limit)
189 return true;
190 }
191
192 ss->tail = (ss->tail + 1) % ss->dur;
193 if (ss->tail <= ss->head)
194 ss->head = (ss->head + 1) % ss->dur;
4cd5b75b 195
16e56d25
VF
196 return false;
197}
4cd5b75b
JA
198
199void steadystate_check(void)
200{
201 int i, j, ddir, prev_groupid, group_ramp_time_over = 0;
202 unsigned long rate_time;
203 struct thread_data *td, *td2;
204 struct timeval now;
9d193019
VF
205 uint64_t group_bw = 0, group_iops = 0;
206 uint64_t td_iops, td_bytes;
4cd5b75b
JA
207 bool ret;
208
209 prev_groupid = -1;
210 for_each_td(td, i) {
211 struct steadystate_data *ss = &td->ss;
212
7be78a8a 213 if (!ss->dur || td->runstate <= TD_SETTING_UP ||
5b4b6586 214 td->runstate >= TD_EXITED || (ss->state & __FIO_SS_ATTAINED))
4cd5b75b
JA
215 continue;
216
217 td_iops = 0;
218 td_bytes = 0;
219 if (!td->o.group_reporting ||
220 (td->o.group_reporting && td->groupid != prev_groupid)) {
221 group_bw = 0;
222 group_iops = 0;
223 group_ramp_time_over = 0;
224 }
225 prev_groupid = td->groupid;
226
227 fio_gettime(&now, NULL);
5b4b6586 228 if (ss->ramp_time && !(ss->state & __FIO_SS_RAMP_OVER)) {
4cd5b75b
JA
229 /*
230 * Begin recording data one second after ss->ramp_time
231 * has elapsed
232 */
233 if (utime_since(&td->epoch, &now) >= (ss->ramp_time + 1000000L))
5b4b6586
JA
234 ss->state |= __FIO_SS_RAMP_OVER;
235 }
4cd5b75b
JA
236
237 td_io_u_lock(td);
238 for (ddir = DDIR_READ; ddir < DDIR_RWDIR_CNT; ddir++) {
239 td_iops += td->io_blocks[ddir];
240 td_bytes += td->io_bytes[ddir];
241 }
242 td_io_u_unlock(td);
243
244 rate_time = mtime_since(&ss->prev_time, &now);
245 memcpy(&ss->prev_time, &now, sizeof(now));
246
247 /*
248 * Begin monitoring when job starts but don't actually use
249 * data in checking stopping criterion until ss->ramp_time is
250 * over. This ensures that we will have a sane value in
251 * prev_iops/bw the first time through after ss->ramp_time
252 * is done.
253 */
5b4b6586 254 if (ss->state & __FIO_SS_RAMP_OVER) {
4cd5b75b
JA
255 group_bw += 1000 * (td_bytes - ss->prev_bytes) / rate_time;
256 group_iops += 1000 * (td_iops - ss->prev_iops) / rate_time;
257 ++group_ramp_time_over;
258 }
259 ss->prev_iops = td_iops;
260 ss->prev_bytes = td_bytes;
261
ec55e631 262 if (td->o.group_reporting && !(ss->state & __FIO_SS_DATA))
4cd5b75b
JA
263 continue;
264
7be78a8a
JA
265 /*
266 * Don't begin checking criterion until ss->ramp_time is over
267 * for at least one thread in group
268 */
4cd5b75b
JA
269 if (!group_ramp_time_over)
270 continue;
271
7be78a8a
JA
272 dprint(FD_STEADYSTATE, "steadystate_check() thread: %d, "
273 "groupid: %u, rate_msec: %ld, "
9d193019
VF
274 "iops: %llu, bw: %llu, head: %d, tail: %d\n",
275 i, td->groupid, rate_time,
276 (unsigned long long) group_iops,
277 (unsigned long long) group_bw,
278 ss->head, ss->tail);
4cd5b75b 279
f0c50c66 280 if (td->o.ss & __FIO_SS_SLOPE)
4cd5b75b
JA
281 ret = steadystate_slope(group_iops, group_bw, td);
282 else
283 ret = steadystate_deviation(group_iops, group_bw, td);
284
285 if (ret) {
286 if (td->o.group_reporting) {
287 for_each_td(td2, j) {
288 if (td2->groupid == td->groupid) {
5b4b6586 289 td2->ss.state |= __FIO_SS_ATTAINED;
4cd5b75b
JA
290 fio_mark_td_terminate(td2);
291 }
292 }
293 } else {
5b4b6586 294 ss->state |= __FIO_SS_ATTAINED;
4cd5b75b
JA
295 fio_mark_td_terminate(td);
296 }
297 }
298 }
299}
300
56a90eba 301int td_steadystate_init(struct thread_data *td)
f0c50c66
JA
302{
303 struct steadystate_data *ss = &td->ss;
304 struct thread_options *o = &td->o;
56a90eba
VF
305 struct thread_data *td2;
306 int j;
f0c50c66
JA
307
308 memset(ss, 0, sizeof(*ss));
309
56a90eba
VF
310 if (o->ss_dur) {
311 steadystate_enabled = true;
312 o->ss_dur /= 1000000L;
313
314 /* put all steady state info in one place */
315 ss->dur = o->ss_dur;
316 ss->limit = o->ss_limit.u.f;
317 ss->ramp_time = o->ss_ramp_time;
f0c50c66 318
56a90eba
VF
319 ss->state = o->ss;
320 if (!td->ss.ramp_time)
321 ss->state |= __FIO_SS_RAMP_OVER;
4cd5b75b 322
56a90eba
VF
323 ss->sum_x = o->ss_dur * (o->ss_dur - 1) / 2;
324 ss->sum_x_sq = (o->ss_dur - 1) * (o->ss_dur) * (2*o->ss_dur - 1) / 6;
56a90eba 325 }
5b4b6586 326
56a90eba
VF
327 /* make sure that ss options are consistent within reporting group */
328 for_each_td(td2, j) {
329 if (td2->groupid == td->groupid) {
330 struct steadystate_data *ss2 = &td2->ss;
331
332 if (ss2->dur != ss->dur ||
333 ss2->limit != ss->limit ||
334 ss2->ramp_time != ss->ramp_time ||
56a90eba
VF
335 ss2->state != ss->state ||
336 ss2->sum_x != ss->sum_x ||
337 ss2->sum_x_sq != ss->sum_x_sq) {
338 td_verror(td, EINVAL, "job rejected: steadystate options must be consistent within reporting groups");
339 return 1;
340 }
341 }
342 }
f0c50c66 343
56a90eba 344 return 0;
f0c50c66 345}
d685adfb 346
9d193019 347uint64_t steadystate_bw_mean(struct thread_stat *ts)
d685adfb
VF
348{
349 int i;
9d193019 350 uint64_t sum;
d685adfb 351
bb49c8bd
VF
352 for (i = 0, sum = 0; i < ts->ss_dur; i++)
353 sum += ts->ss_bw_data[i];
d685adfb 354
bb49c8bd 355 return sum / ts->ss_dur;
d685adfb
VF
356}
357
9d193019 358uint64_t steadystate_iops_mean(struct thread_stat *ts)
d685adfb
VF
359{
360 int i;
9d193019 361 uint64_t sum;
d685adfb 362
bb49c8bd
VF
363 for (i = 0, sum = 0; i < ts->ss_dur; i++)
364 sum += ts->ss_iops_data[i];
d685adfb 365
bb49c8bd 366 return sum / ts->ss_dur;
d685adfb 367}