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