projects / fio.git / blame
? search:
summary | shortlog | log | commit | commitdiff | tree
blob | blame (incremental) | history | HEAD
stat: remove duplicated code in show_mixed_ddir_status()
[fio.git] / stat.c
CommitLineData
3c39a379
JA		 1#include <stdio.h>
2#include <string.h>
3#include <sys/time.h>
5c4e1dbc 4#include <sys/stat.h>
3c39a379
JA		 5#include <math.h>
6
7#include "fio.h"
7c9b1bce 8#include "diskutil.h"
c7c6cb4c 9#include "lib/ieee754.h"
cc372b17 10#include "json.h"
44404c5a 11#include "lib/getrusage.h"
f2a2ce0e 12#include "idletime.h"
0f38bbef 13#include "lib/pow2.h"
a666cab8 14#include "lib/output_buffer.h"
a39fb9ea 15#include "helper_thread.h"
90d2d53f 16#include "smalloc.h"
fd5d733f 17#include "zbd.h"
f5bff36e 18#include "oslib/asprintf.h"
3c39a379 19
3d0d549a
BP		 20#ifdef WIN32
21#define LOG_MSEC_SLACK 2
22#else
674456bf 23#define LOG_MSEC_SLACK 1
3d0d549a 24#endif
d454a205 25
971caeb1 26struct fio_sem *stat_sem;
cef9175e 27
210dd0fc
JA		 28void clear_rusage_stat(struct thread_data *td)
29{
30 struct thread_stat *ts = &td->ts;
31
32 fio_getrusage(&td->ru_start);
33 ts->usr_time = ts->sys_time = 0;
34 ts->ctx = 0;
35 ts->minf = ts->majf = 0;
36}
37
3c39a379
JA		 38void update_rusage_stat(struct thread_data *td)
39{
756867bd 40 struct thread_stat *ts = &td->ts;
3c39a379 41
44404c5a 42 fio_getrusage(&td->ru_end);
8b6a404c 43 ts->usr_time += mtime_since_tv(&td->ru_start.ru_utime,
c8aaba19 44 &td->ru_end.ru_utime);
8b6a404c 45 ts->sys_time += mtime_since_tv(&td->ru_start.ru_stime,
c8aaba19
JA		 46 &td->ru_end.ru_stime);
47 ts->ctx += td->ru_end.ru_nvcsw + td->ru_end.ru_nivcsw
48 - (td->ru_start.ru_nvcsw + td->ru_start.ru_nivcsw);
49 ts->minf += td->ru_end.ru_minflt - td->ru_start.ru_minflt;
50 ts->majf += td->ru_end.ru_majflt - td->ru_start.ru_majflt;
5ec10eaa 51
c8aaba19 52 memcpy(&td->ru_start, &td->ru_end, sizeof(td->ru_end));
3c39a379
JA		 53}
54
83349190
YH		 55/*
56 * Given a latency, return the index of the corresponding bucket in
57 * the structure tracking percentiles.
58 *
59 * (1) find the group (and error bits) that the value (latency)
60 * belongs to by looking at its MSB. (2) find the bucket number in the
61 * group by looking at the index bits.
62 *
63 */
d6bb626e 64static unsigned int plat_val_to_idx(unsigned long long val)
83349190
YH		 65{
66 unsigned int msb, error_bits, base, offset, idx;
67
68 /* Find MSB starting from bit 0 */
69 if (val == 0)
70 msb = 0;
71 else
d6bb626e 72 msb = (sizeof(val)*8) - __builtin_clzll(val) - 1;
83349190 73
716050f2
JA		 74 /*
75 * MSB <= (FIO_IO_U_PLAT_BITS-1), cannot be rounded off. Use
76 * all bits of the sample as index
77 */
83349190
YH		 78 if (msb <= FIO_IO_U_PLAT_BITS)
79 return val;
80
81 /* Compute the number of error bits to discard*/
82 error_bits = msb - FIO_IO_U_PLAT_BITS;
83
84 /* Compute the number of buckets before the group */
85 base = (error_bits + 1) << FIO_IO_U_PLAT_BITS;
86
716050f2
JA		 87 /*
88 * Discard the error bits and apply the mask to find the
3c3ed070 89 * index for the buckets in the group
716050f2 90 */
83349190
YH		 91 offset = (FIO_IO_U_PLAT_VAL - 1) & (val >> error_bits);
92
93 /* Make sure the index does not exceed (array size - 1) */
3c3ed070 94 idx = (base + offset) < (FIO_IO_U_PLAT_NR - 1) ?
83349190
YH		 95 (base + offset) : (FIO_IO_U_PLAT_NR - 1);
96
97 return idx;
98}
99
100/*
101 * Convert the given index of the bucket array to the value
102 * represented by the bucket
103 */
129e4193 104static unsigned long long plat_idx_to_val(unsigned int idx)
83349190 105{
c8b44cfa
RL		 106 unsigned int error_bits;
107 unsigned long long k, base;
83349190
YH		 108
109 assert(idx < FIO_IO_U_PLAT_NR);
110
111 /* MSB <= (FIO_IO_U_PLAT_BITS-1), cannot be rounded off. Use
112 * all bits of the sample as index */
3c3ed070 113 if (idx < (FIO_IO_U_PLAT_VAL << 1))
83349190
YH		 114 return idx;
115
116 /* Find the group and compute the minimum value of that group */
3c3ed070 117 error_bits = (idx >> FIO_IO_U_PLAT_BITS) - 1;
c8b44cfa 118 base = ((unsigned long long) 1) << (error_bits + FIO_IO_U_PLAT_BITS);
83349190
YH		 119
120 /* Find its bucket number of the group */
121 k = idx % FIO_IO_U_PLAT_VAL;
122
123 /* Return the mean of the range of the bucket */
124 return base + ((k + 0.5) * (1 << error_bits));
125}
126
127static int double_cmp(const void *a, const void *b)
128{
802ad4a8
JA		 129 const fio_fp64_t fa = *(const fio_fp64_t *) a;
130 const fio_fp64_t fb = *(const fio_fp64_t *) b;
83349190
YH		 131 int cmp = 0;
132
802ad4a8 133 if (fa.u.f > fb.u.f)
83349190 134 cmp = 1;
802ad4a8 135 else if (fa.u.f < fb.u.f)
83349190
YH		 136 cmp = -1;
137
138 return cmp;
139}
140
6cc0e5aa 141unsigned int calc_clat_percentiles(uint64_t *io_u_plat, unsigned long long nr,
d6bb626e
VF		 142 fio_fp64_t *plist, unsigned long long **output,
143 unsigned long long *maxv, unsigned long long *minv)
83349190 144{
447b94e1 145 unsigned long long sum = 0;
1db92cb6 146 unsigned int len, i, j = 0;
d6bb626e 147 unsigned long long *ovals = NULL;
8985b491 148 bool is_last;
1db92cb6 149
d6bb626e 150 *minv = -1ULL;
1db92cb6 151 *maxv = 0;
83349190 152
802ad4a8
JA		 153 len = 0;
154 while (len < FIO_IO_U_LIST_MAX_LEN && plist[len].u.f != 0.0)
155 len++;
716050f2 156
351de8de 157 if (!len)
1db92cb6 158 return 0;
351de8de 159
716050f2 160 /*
802ad4a8
JA		 161 * Sort the percentile list. Note that it may already be sorted if
162 * we are using the default values, but since it's a short list this
163 * isn't a worry. Also note that this does not work for NaN values.
716050f2 164 */
802ad4a8 165 if (len > 1)
68e0dc1a 166 qsort(plist, len, sizeof(plist[0]), double_cmp);
83349190 167
5d89c625
VF		 168 ovals = malloc(len * sizeof(*ovals));
169 if (!ovals)
170 return 0;
171
4f6f8298
JA		 172 /*
173 * Calculate bucket values, note down max and min values
174 */
8985b491 175 is_last = false;
07511a63 176 for (i = 0; i < FIO_IO_U_PLAT_NR && !is_last; i++) {
83349190 177 sum += io_u_plat[i];
298d751e 178 while (sum >= ((long double) plist[j].u.f / 100.0 * nr)) {
802ad4a8 179 assert(plist[j].u.f <= 100.0);
83349190 180
4f6f8298 181 ovals[j] = plat_idx_to_val(i);
1db92cb6
JA		 182 if (ovals[j] < *minv)
183 *minv = ovals[j];
184 if (ovals[j] > *maxv)
185 *maxv = ovals[j];
07511a63 186
8985b491 187 is_last = (j == len - 1) != 0;
07511a63
JA		 188 if (is_last)
189 break;
190
4f6f8298
JA		 191 j++;
192 }
193 }
83349190 194
298d751e
VF		 195 if (!is_last)
196 log_err("fio: error calculating latency percentiles\n");
197
1db92cb6
JA		 198 *output = ovals;
199 return len;
200}
201
202/*
203 * Find and display the p-th percentile of clat
204 */
6cc0e5aa 205static void show_clat_percentiles(uint64_t *io_u_plat, unsigned long long nr,
a666cab8 206 fio_fp64_t *plist, unsigned int precision,
b2b3eefe 207 const char *pre, struct buf_output *out)
1db92cb6 208{
d6bb626e
VF		 209 unsigned int divisor, len, i, j = 0;
210 unsigned long long minv, maxv;
211 unsigned long long *ovals;
8985b491 212 int per_line, scale_down, time_width;
8985b491 213 bool is_last;
eef02441 214 char fmt[32];
1db92cb6
JA		 215
216 len = calc_clat_percentiles(io_u_plat, nr, plist, &ovals, &maxv, &minv);
b2b3eefe 217 if (!len || !ovals)
824d8186 218 return;
1db92cb6 219
4f6f8298 220 /*
d6bb626e
VF		 221 * We default to nsecs, but if the value range is such that we
222 * should scale down to usecs or msecs, do that.
4f6f8298 223 */
d6bb626e
VF		 224 if (minv > 2000000 && maxv > 99999999ULL) {
225 scale_down = 2;
226 divisor = 1000000;
b599759b 227 log_buf(out, " %s percentiles (msec):\n |", pre);
d6bb626e
VF		 228 } else if (minv > 2000 && maxv > 99999) {
229 scale_down = 1;
230 divisor = 1000;
b599759b 231 log_buf(out, " %s percentiles (usec):\n |", pre);
4f6f8298
JA		 232 } else {
233 scale_down = 0;
d6bb626e 234 divisor = 1;
b599759b 235 log_buf(out, " %s percentiles (nsec):\n |", pre);
4f6f8298 236 }
83349190 237
619adf9c 238
d6bb626e 239 time_width = max(5, (int) (log10(maxv / divisor) + 1));
74558486
JA		 240 snprintf(fmt, sizeof(fmt), " %%%u.%ufth=[%%%dllu]%%c", precision + 3,
241 precision, time_width);
242 /* fmt will be something like " %5.2fth=[%4llu]%c" */
d6bb626e 243 per_line = (80 - 7) / (precision + 10 + time_width);
81ab0b3a 244
d6bb626e 245 for (j = 0; j < len; j++) {
4f6f8298 246 /* for formatting */
eef02441 247 if (j != 0 && (j % per_line) == 0)
a666cab8 248 log_buf(out, " |");
83349190 249
4f6f8298 250 /* end of the list */
8985b491 251 is_last = (j == len - 1) != 0;
83349190 252
d6bb626e 253 for (i = 0; i < scale_down; i++)
4f6f8298
JA		 254 ovals[j] = (ovals[j] + 999) / 1000;
255
d6bb626e 256 log_buf(out, fmt, plist[j].u.f, ovals[j], is_last ? '\n' : ',');
4f6f8298
JA		 257
258 if (is_last)
259 break;
260
eef02441 261 if ((j % per_line) == per_line - 1) /* for formatting */
a666cab8 262 log_buf(out, "\n");
83349190 263 }
4f6f8298 264
283feb79 265 free(ovals);
83349190
YH		 266}
267
74558486
JA		 268bool calc_lat(struct io_stat *is, unsigned long long *min,
269 unsigned long long *max, double *mean, double *dev)
3c39a379 270{
ee0ccb79 271 double n = (double) is->samples;
3c39a379 272
ee0ccb79 273 if (n == 0)
8aa89d70 274 return false;
3c39a379
JA		 275
276 *min = is->min_val;
277 *max = is->max_val;
802ad4a8 278 *mean = is->mean.u.f;
e6d276f2 279
68704084 280 if (n > 1.0)
802ad4a8 281 *dev = sqrt(is->S.u.f / (n - 1.0));
ef9c5c40 282 else
4b43f54e 283 *dev = 0;
ef9c5c40 284
8aa89d70 285 return true;
3c39a379
JA		 286}
287
5cb8a8cd
BP		 288void show_mixed_group_stats(struct group_run_stats *rs, struct buf_output *out)
289{
290 char *io, *agg, *min, *max;
291 char *ioalt, *aggalt, *minalt, *maxalt;
6dc75062
JA		 292 uint64_t io_mix = 0, agg_mix = 0, min_mix = -1, max_mix = 0;
293 uint64_t min_run = -1, max_run = 0;
5cb8a8cd 294 const int i2p = is_power_of_2(rs->kb_base);
6dc75062 295 int i;
5cb8a8cd
BP		 296
297 for (i = 0; i < DDIR_RWDIR_CNT; i++) {
298 if (!rs->max_run[i])
299 continue;
300 io_mix += rs->iobytes[i];
301 agg_mix += rs->agg[i];
302 min_mix = min_mix < rs->min_bw[i] ? min_mix : rs->min_bw[i];
303 max_mix = max_mix > rs->max_bw[i] ? max_mix : rs->max_bw[i];
304 min_run = min_run < rs->min_run[i] ? min_run : rs->min_run[i];
305 max_run = max_run > rs->max_run[i] ? max_run : rs->max_run[i];
306 }
307 io = num2str(io_mix, rs->sig_figs, 1, i2p, N2S_BYTE);
308 ioalt = num2str(io_mix, rs->sig_figs, 1, !i2p, N2S_BYTE);
309 agg = num2str(agg_mix, rs->sig_figs, 1, i2p, rs->unit_base);
310 aggalt = num2str(agg_mix, rs->sig_figs, 1, !i2p, rs->unit_base);
311 min = num2str(min_mix, rs->sig_figs, 1, i2p, rs->unit_base);
312 minalt = num2str(min_mix, rs->sig_figs, 1, !i2p, rs->unit_base);
313 max = num2str(max_mix, rs->sig_figs, 1, i2p, rs->unit_base);
314 maxalt = num2str(max_mix, rs->sig_figs, 1, !i2p, rs->unit_base);
315 log_buf(out, " MIXED: bw=%s (%s), %s-%s (%s-%s), io=%s (%s), run=%llu-%llumsec\n",
316 agg, aggalt, min, max, minalt, maxalt, io, ioalt,
317 (unsigned long long) min_run,
318 (unsigned long long) max_run);
319 free(io);
320 free(agg);
321 free(min);
322 free(max);
323 free(ioalt);
324 free(aggalt);
325 free(minalt);
326 free(maxalt);
327}
328
a666cab8 329void show_group_stats(struct group_run_stats *rs, struct buf_output *out)
3c39a379 330{
d694a6a7
RE		 331 char *io, *agg, *min, *max;
332 char *ioalt, *aggalt, *minalt, *maxalt;
42da5c8b 333 const char *str[] = { " READ", " WRITE" , " TRIM"};
dbe1125e
JA		 334 int i;
335
a666cab8 336 log_buf(out, "\nRun status group %d (all jobs):\n", rs->groupid);
3c39a379 337
6eaf09d6 338 for (i = 0; i < DDIR_RWDIR_CNT; i++) {
90fef2d1
JA		 339 const int i2p = is_power_of_2(rs->kb_base);
340
dbe1125e
JA		 341 if (!rs->max_run[i])
342 continue;
343
e883cb35
JF		 344 io = num2str(rs->iobytes[i], rs->sig_figs, 1, i2p, N2S_BYTE);
345 ioalt = num2str(rs->iobytes[i], rs->sig_figs, 1, !i2p, N2S_BYTE);
346 agg = num2str(rs->agg[i], rs->sig_figs, 1, i2p, rs->unit_base);
347 aggalt = num2str(rs->agg[i], rs->sig_figs, 1, !i2p, rs->unit_base);
348 min = num2str(rs->min_bw[i], rs->sig_figs, 1, i2p, rs->unit_base);
349 minalt = num2str(rs->min_bw[i], rs->sig_figs, 1, !i2p, rs->unit_base);
350 max = num2str(rs->max_bw[i], rs->sig_figs, 1, i2p, rs->unit_base);
351 maxalt = num2str(rs->max_bw[i], rs->sig_figs, 1, !i2p, rs->unit_base);
d694a6a7 352 log_buf(out, "%s: bw=%s (%s), %s-%s (%s-%s), io=%s (%s), run=%llu-%llumsec\n",
5cb8a8cd 353 (rs->unified_rw_rep == UNIFIED_MIXED) ? " MIXED" : str[i],
d694a6a7 354 agg, aggalt, min, max, minalt, maxalt, io, ioalt,
4e0a8fa2
JA		 355 (unsigned long long) rs->min_run[i],
356 (unsigned long long) rs->max_run[i]);
dbe1125e 357
d694a6a7
RE		 358 free(io);
359 free(agg);
360 free(min);
361 free(max);
362 free(ioalt);
363 free(aggalt);
364 free(minalt);
365 free(maxalt);
dbe1125e 366 }
6dc75062 367
5cb8a8cd 368 /* Need to aggregate statisitics to show mixed values */
6dc75062 369 if (rs->unified_rw_rep == UNIFIED_BOTH)
5cb8a8cd 370 show_mixed_group_stats(rs, out);
3c39a379
JA		 371}
372
6cc0e5aa 373void stat_calc_dist(uint64_t *map, unsigned long total, double *io_u_dist)
2270890c
JA		 374{
375 int i;
376
377 /*
378 * Do depth distribution calculations
379 */
380 for (i = 0; i < FIO_IO_U_MAP_NR; i++) {
838bc709
JA		 381 if (total) {
382 io_u_dist[i] = (double) map[i] / (double) total;
383 io_u_dist[i] *= 100.0;
384 if (io_u_dist[i] < 0.1 && map[i])
385 io_u_dist[i] = 0.1;
386 } else
387 io_u_dist[i] = 0.0;
2270890c
JA		 388 }
389}
390
04a0feae 391static void stat_calc_lat(struct thread_stat *ts, double *dst,
6cc0e5aa 392 uint64_t *src, int nr)
2270890c 393{
d79db122 394 unsigned long total = ddir_rw_sum(ts->total_io_u);
2270890c
JA		 395 int i;
396
397 /*
398 * Do latency distribution calculations
399 */
04a0feae 400 for (i = 0; i < nr; i++) {
838bc709
JA		 401 if (total) {
402 dst[i] = (double) src[i] / (double) total;
403 dst[i] *= 100.0;
404 if (dst[i] < 0.01 && src[i])
405 dst[i] = 0.01;
406 } else
407 dst[i] = 0.0;
2270890c
JA		 408 }
409}
410
247823cc
VF		 411/*
412 * To keep the terse format unaltered, add all of the ns latency
413 * buckets to the first us latency bucket
414 */
52e4c651 415static void stat_calc_lat_nu(struct thread_stat *ts, double *io_u_lat_u)
247823cc
VF		 416{
417 unsigned long ntotal = 0, total = ddir_rw_sum(ts->total_io_u);
418 int i;
419
420 stat_calc_lat(ts, io_u_lat_u, ts->io_u_lat_u, FIO_IO_U_LAT_U_NR);
421
422 for (i = 0; i < FIO_IO_U_LAT_N_NR; i++)
423 ntotal += ts->io_u_lat_n[i];
424
425 io_u_lat_u[0] += 100.0 * (double) ntotal / (double) total;
426}
427
d6bb626e
VF		 428void stat_calc_lat_n(struct thread_stat *ts, double *io_u_lat)
429{
430 stat_calc_lat(ts, io_u_lat, ts->io_u_lat_n, FIO_IO_U_LAT_N_NR);
431}
432
e5bd1347 433void stat_calc_lat_u(struct thread_stat *ts, double *io_u_lat)
04a0feae
JA		 434{
435 stat_calc_lat(ts, io_u_lat, ts->io_u_lat_u, FIO_IO_U_LAT_U_NR);
436}
437
e5bd1347 438void stat_calc_lat_m(struct thread_stat *ts, double *io_u_lat)
04a0feae
JA		 439{
440 stat_calc_lat(ts, io_u_lat, ts->io_u_lat_m, FIO_IO_U_LAT_M_NR);
441}
442
74558486
JA		 443static void display_lat(const char *name, unsigned long long min,
444 unsigned long long max, double mean, double dev,
445 struct buf_output *out)
ea2accc5 446{
d6bb626e 447 const char *base = "(nsec)";
b29ad562 448 char *minp, *maxp;
ea2accc5 449
d6bb626e 450 if (nsec_to_msec(&min, &max, &mean, &dev))
b29ad562 451 base = "(msec)";
d6bb626e
VF		 452 else if (nsec_to_usec(&min, &max, &mean, &dev))
453 base = "(usec)";
b29ad562 454
d694a6a7
RE		 455 minp = num2str(min, 6, 1, 0, N2S_NONE);
456 maxp = num2str(max, 6, 1, 0, N2S_NONE);
b29ad562 457
a666cab8 458 log_buf(out, " %s %s: min=%s, max=%s, avg=%5.02f,"
b29ad562
JA		 459 " stdev=%5.02f\n", name, base, minp, maxp, mean, dev);
460
461 free(minp);
462 free(maxp);
ea2accc5
JA		 463}
464
5c0abd5e 465static double convert_agg_kbytes_percent(struct group_run_stats *rs, int ddir, int mean)
466{
467 double p_of_agg = 100.0;
468 if (rs && rs->agg[ddir] > 1024) {
106e14ce 469 p_of_agg = mean * 100.0 / (double) (rs->agg[ddir] / 1024.0);
5c0abd5e 470
471 if (p_of_agg > 100.0)
472 p_of_agg = 100.0;
473 }
474 return p_of_agg;
475}
476
756867bd 477static void show_ddir_status(struct group_run_stats *rs, struct thread_stat *ts,
a666cab8 478 int ddir, struct buf_output *out)
3c39a379 479{
d6bb626e
VF		 480 unsigned long runt;
481 unsigned long long min, max, bw, iops;
3c39a379 482 double mean, dev;
96563db9 483 char *io_p, *bw_p, *bw_p_alt, *iops_p, *post_st = NULL;
90fef2d1 484 int i2p;
3c39a379 485
b2b3eefe
JA		 486 if (ddir_sync(ddir)) {
487 if (calc_lat(&ts->sync_stat, &min, &max, &mean, &dev)) {
488 log_buf(out, " %s:\n", "fsync/fdatasync/sync_file_range");
425d3e0e 489 display_lat(io_ddir_name(ddir), min, max, mean, dev, out);
b2b3eefe
JA		 490 show_clat_percentiles(ts->io_u_sync_plat,
491 ts->sync_stat.samples,
492 ts->percentile_list,
493 ts->percentile_precision,
425d3e0e 494 io_ddir_name(ddir), out);
b2b3eefe
JA		 495 }
496 return;
497 }
498
ff58fced
JA		 499 assert(ddir_rw(ddir));
500
756867bd 501 if (!ts->runtime[ddir])
3c39a379
JA		 502 return;
503
90fef2d1 504 i2p = is_power_of_2(rs->kb_base);
8879fd15
JA		 505 runt = ts->runtime[ddir];
506
507 bw = (1000 * ts->io_bytes[ddir]) / runt;
e883cb35
JF		 508 io_p = num2str(ts->io_bytes[ddir], ts->sig_figs, 1, i2p, N2S_BYTE);
509 bw_p = num2str(bw, ts->sig_figs, 1, i2p, ts->unit_base);
510 bw_p_alt = num2str(bw, ts->sig_figs, 1, !i2p, ts->unit_base);
8879fd15 511
0aacc50c 512 iops = (1000 * (uint64_t)ts->total_io_u[ddir]) / runt;
e883cb35 513 iops_p = num2str(iops, ts->sig_figs, 1, 0, N2S_NONE);
fd5d733f 514 if (ddir == DDIR_WRITE)
96563db9
JA		 515 post_st = zbd_write_status(ts);
516 else if (ddir == DDIR_READ && ts->cachehit && ts->cachemiss) {
517 uint64_t total;
518 double hit;
519
520 total = ts->cachehit + ts->cachemiss;
521 hit = (double) ts->cachehit / (double) total;
522 hit *= 100.0;
523 if (asprintf(&post_st, "; Cachehit=%0.2f%%", hit) < 0)
524 post_st = NULL;
525 }
dbe1125e 526
fd5d733f 527 log_buf(out, " %s: IOPS=%s, BW=%s (%s)(%s/%llumsec)%s\n",
5cb8a8cd 528 (ts->unified_rw_rep == UNIFIED_MIXED) ? "mixed" : io_ddir_name(ddir),
d694a6a7 529 iops_p, bw_p, bw_p_alt, io_p,
fd5d733f 530 (unsigned long long) ts->runtime[ddir],
96563db9 531 post_st ? : "");
dbe1125e 532
96563db9 533 free(post_st);
dbe1125e
JA		 534 free(io_p);
535 free(bw_p);
d694a6a7 536 free(bw_p_alt);
b3605062 537 free(iops_p);
3c39a379 538
b29ad562 539 if (calc_lat(&ts->slat_stat[ddir], &min, &max, &mean, &dev))
a666cab8 540 display_lat("slat", min, max, mean, dev, out);
b29ad562 541 if (calc_lat(&ts->clat_stat[ddir], &min, &max, &mean, &dev))
a666cab8 542 display_lat("clat", min, max, mean, dev, out);
b29ad562 543 if (calc_lat(&ts->lat_stat[ddir], &min, &max, &mean, &dev))
a666cab8 544 display_lat(" lat", min, max, mean, dev, out);
2e86a90c
VF		 545 if (calc_lat(&ts->clat_high_prio_stat[ddir], &min, &max, &mean, &dev)) {
546 display_lat(ts->lat_percentiles ? "high prio_lat" : "high prio_clat",
38ec5c51 547 min, max, mean, dev, out);
2e86a90c
VF		 548 if (calc_lat(&ts->clat_low_prio_stat[ddir], &min, &max, &mean, &dev))
549 display_lat(ts->lat_percentiles ? "low prio_lat" : "low prio_clat",
550 min, max, mean, dev, out);
551 }
02af0988 552
56440e63
VF		 553 if (ts->slat_percentiles && ts->slat_stat[ddir].samples > 0)
554 show_clat_percentiles(ts->io_u_plat[FIO_SLAT][ddir],
555 ts->slat_stat[ddir].samples,
556 ts->percentile_list,
557 ts->percentile_precision, "slat", out);
558 if (ts->clat_percentiles && ts->clat_stat[ddir].samples > 0)
559 show_clat_percentiles(ts->io_u_plat[FIO_CLAT][ddir],
560 ts->clat_stat[ddir].samples,
561 ts->percentile_list,
562 ts->percentile_precision, "clat", out);
563 if (ts->lat_percentiles && ts->lat_stat[ddir].samples > 0)
564 show_clat_percentiles(ts->io_u_plat[FIO_LAT][ddir],
565 ts->lat_stat[ddir].samples,
566 ts->percentile_list,
567 ts->percentile_precision, "lat", out);
568
b599759b 569 if (ts->clat_percentiles || ts->lat_percentiles) {
38ec5c51 570 const char *name = ts->lat_percentiles ? "lat" : "clat";
b2a432bf 571 char prio_name[32];
af1600c1
SW		 572 uint64_t samples;
573
56440e63 574 if (ts->lat_percentiles)
af1600c1 575 samples = ts->lat_stat[ddir].samples;
56440e63
VF		 576 else
577 samples = ts->clat_stat[ddir].samples;
b2a432bf
PC		 578
579 /* Only print this if some high and low priority stats were collected */
580 if (ts->clat_high_prio_stat[ddir].samples > 0 &&
efd78265 581 ts->clat_low_prio_stat[ddir].samples > 0)
b2a432bf
PC		 582 {
583 sprintf(prio_name, "high prio (%.2f%%) %s",
584 100. * (double) ts->clat_high_prio_stat[ddir].samples / (double) samples,
585 name);
586 show_clat_percentiles(ts->io_u_plat_high_prio[ddir],
587 ts->clat_high_prio_stat[ddir].samples,
588 ts->percentile_list,
589 ts->percentile_precision, prio_name, out);
590
591 sprintf(prio_name, "low prio (%.2f%%) %s",
efd78265 592 100. * (double) ts->clat_low_prio_stat[ddir].samples / (double) samples,
b2a432bf 593 name);
efd78265
VF		 594 show_clat_percentiles(ts->io_u_plat_low_prio[ddir],
595 ts->clat_low_prio_stat[ddir].samples,
b2a432bf
PC		 596 ts->percentile_list,
597 ts->percentile_precision, prio_name, out);
598 }
83349190 599 }
56440e63 600
079ad09b 601 if (calc_lat(&ts->bw_stat[ddir], &min, &max, &mean, &dev)) {
142c7f2d 602 double p_of_agg = 100.0, fkb_base = (double)rs->kb_base;
d694a6a7
RE		 603 const char *bw_str;
604
605 if ((rs->unit_base == 1) && i2p)
606 bw_str = "Kibit";
607 else if (rs->unit_base == 1)
608 bw_str = "kbit";
609 else if (i2p)
610 bw_str = "KiB";
611 else
612 bw_str = "kB";
d686990a 613
5c0abd5e 614 p_of_agg = convert_agg_kbytes_percent(rs, ddir, mean);
d1707474 615
d686990a
SN		 616 if (rs->unit_base == 1) {
617 min *= 8.0;
618 max *= 8.0;
619 mean *= 8.0;
620 dev *= 8.0;
621 }
3c39a379 622
142c7f2d
SN		 623 if (mean > fkb_base * fkb_base) {
624 min /= fkb_base;
625 max /= fkb_base;
626 mean /= fkb_base;
627 dev /= fkb_base;
d694a6a7 628 bw_str = (rs->unit_base == 1 ? "Mibit" : "MiB");
b7017e32
JA		 629 }
630
54c05828 631 log_buf(out, " bw (%5s/s): min=%5llu, max=%5llu, per=%3.2f%%, "
29eb371b 632 "avg=%5.02f, stdev=%5.02f, samples=%" PRIu64 "\n",
54c05828
AH		 633 bw_str, min, max, p_of_agg, mean, dev,
634 (&ts->bw_stat[ddir])->samples);
3c39a379 635 }
188b6016 636 if (calc_lat(&ts->iops_stat[ddir], &min, &max, &mean, &dev)) {
21ba6606 637 log_buf(out, " iops : min=%5llu, max=%5llu, "
29eb371b 638 "avg=%5.02f, stdev=%5.02f, samples=%" PRIu64 "\n",
54c05828 639 min, max, mean, dev, (&ts->iops_stat[ddir])->samples);
188b6016 640 }
3c39a379
JA		 641}
642
53d966f8
NC		 643static void show_mixed_ddir_status(struct group_run_stats *rs,
644 struct thread_stat *ts,
645 struct buf_output *out)
646{
647 struct thread_stat *ts_lcl;
648
649 /*
650 * Handle aggregation of Reads (ddir = 0), Writes (ddir = 1), and
651 * Trims (ddir = 2)
652 */
653 ts_lcl = malloc(sizeof(struct thread_stat));
654 memset((void *)ts_lcl, 0, sizeof(struct thread_stat));
655 /* calculate mixed stats */
656 ts_lcl->unified_rw_rep = UNIFIED_MIXED;
657 init_thread_stat_min_vals(ts_lcl);
658 ts_lcl->lat_percentiles = ts->lat_percentiles;
659 ts_lcl->clat_percentiles = ts->clat_percentiles;
660 ts_lcl->slat_percentiles = ts->slat_percentiles;
661 ts_lcl->percentile_precision = ts->percentile_precision;
662 memcpy(ts_lcl->percentile_list, ts->percentile_list, sizeof(ts->percentile_list));
663
664 sum_thread_stats(ts_lcl, ts);
665
666 show_ddir_status(rs, ts_lcl, DDIR_READ, out);
667 free(ts_lcl);
668}
669
8985b491
JA		 670static bool show_lat(double *io_u_lat, int nr, const char **ranges,
671 const char *msg, struct buf_output *out)
04a0feae 672{
8985b491
JA		 673 bool new_line = true, shown = false;
674 int i, line = 0;
04a0feae
JA		 675
676 for (i = 0; i < nr; i++) {
677 if (io_u_lat[i] <= 0.0)
678 continue;
8985b491 679 shown = true;
04a0feae 680 if (new_line) {
4539ed73 681 if (line)
a666cab8 682 log_buf(out, "\n");
4a19fcaa 683 log_buf(out, " lat (%s) : ", msg);
8985b491 684 new_line = false;
04a0feae
JA		 685 line = 0;
686 }
687 if (line)
a666cab8
JA		 688 log_buf(out, ", ");
689 log_buf(out, "%s%3.2f%%", ranges[i], io_u_lat[i]);
04a0feae
JA		 690 line++;
691 if (line == 5)
8985b491 692 new_line = true;
04a0feae 693 }
7e1773ba
JA		 694
695 if (shown)
a666cab8 696 log_buf(out, "\n");
7e1773ba 697
8985b491 698 return true;
04a0feae
JA		 699}
700
d6bb626e
VF		 701static void show_lat_n(double *io_u_lat_n, struct buf_output *out)
702{
703 const char *ranges[] = { "2=", "4=", "10=", "20=", "50=", "100=",
704 "250=", "500=", "750=", "1000=", };
705
706 show_lat(io_u_lat_n, FIO_IO_U_LAT_N_NR, ranges, "nsec", out);
707}
708
a666cab8 709static void show_lat_u(double *io_u_lat_u, struct buf_output *out)
04a0feae
JA		 710{
711 const char *ranges[] = { "2=", "4=", "10=", "20=", "50=", "100=",
712 "250=", "500=", "750=", "1000=", };
713
a666cab8 714 show_lat(io_u_lat_u, FIO_IO_U_LAT_U_NR, ranges, "usec", out);
04a0feae
JA		 715}
716
a666cab8 717static void show_lat_m(double *io_u_lat_m, struct buf_output *out)
04a0feae
JA		 718{
719 const char *ranges[] = { "2=", "4=", "10=", "20=", "50=", "100=",
720 "250=", "500=", "750=", "1000=", "2000=",
721 ">=2000=", };
722
a666cab8 723 show_lat(io_u_lat_m, FIO_IO_U_LAT_M_NR, ranges, "msec", out);
04a0feae
JA		 724}
725
a666cab8 726static void show_latencies(struct thread_stat *ts, struct buf_output *out)
04a0feae 727{
d6bb626e 728 double io_u_lat_n[FIO_IO_U_LAT_N_NR];
c551f65a
JA		 729 double io_u_lat_u[FIO_IO_U_LAT_U_NR];
730 double io_u_lat_m[FIO_IO_U_LAT_M_NR];
731
d6bb626e 732 stat_calc_lat_n(ts, io_u_lat_n);
5a18988e
JA		 733 stat_calc_lat_u(ts, io_u_lat_u);
734 stat_calc_lat_m(ts, io_u_lat_m);
735
d6bb626e 736 show_lat_n(io_u_lat_n, out);
a666cab8
JA		 737 show_lat_u(io_u_lat_u, out);
738 show_lat_m(io_u_lat_m, out);
04a0feae
JA		 739}
740
66347cfa
DE		 741static int block_state_category(int block_state)
742{
743 switch (block_state) {
744 case BLOCK_STATE_UNINIT:
745 return 0;
746 case BLOCK_STATE_TRIMMED:
747 case BLOCK_STATE_WRITTEN:
748 return 1;
749 case BLOCK_STATE_WRITE_FAILURE:
750 case BLOCK_STATE_TRIM_FAILURE:
751 return 2;
752 default:
081c2dc3 753 /* Silence compile warning on some BSDs and have a return */
66347cfa 754 assert(0);
07ff5841 755 return -1;
66347cfa
DE		 756 }
757}
758
759static int compare_block_infos(const void *bs1, const void *bs2)
760{
5fff9543
JF		 761 uint64_t block1 = *(uint64_t *)bs1;
762 uint64_t block2 = *(uint64_t *)bs2;
66347cfa
DE		 763 int state1 = BLOCK_INFO_STATE(block1);
764 int state2 = BLOCK_INFO_STATE(block2);
765 int bscat1 = block_state_category(state1);
766 int bscat2 = block_state_category(state2);
767 int cycles1 = BLOCK_INFO_TRIMS(block1);
768 int cycles2 = BLOCK_INFO_TRIMS(block2);
769
770 if (bscat1 < bscat2)
771 return -1;
772 if (bscat1 > bscat2)
773 return 1;
774
775 if (cycles1 < cycles2)
776 return -1;
777 if (cycles1 > cycles2)
778 return 1;
779
780 if (state1 < state2)
781 return -1;
782 if (state1 > state2)
783 return 1;
784
785 assert(block1 == block2);
786 return 0;
787}
788
789static int calc_block_percentiles(int nr_block_infos, uint32_t *block_infos,
790 fio_fp64_t *plist, unsigned int **percentiles,
791 unsigned int *types)
792{
793 int len = 0;
794 int i, nr_uninit;
795
796 qsort(block_infos, nr_block_infos, sizeof(uint32_t), compare_block_infos);
797
798 while (len < FIO_IO_U_LIST_MAX_LEN && plist[len].u.f != 0.0)
799 len++;
800
801 if (!len)
802 return 0;
803
804 /*
805 * Sort the percentile list. Note that it may already be sorted if
806 * we are using the default values, but since it's a short list this
807 * isn't a worry. Also note that this does not work for NaN values.
808 */
809 if (len > 1)
68e0dc1a 810 qsort(plist, len, sizeof(plist[0]), double_cmp);
66347cfa 811
66347cfa
DE		 812 /* Start only after the uninit entries end */
813 for (nr_uninit = 0;
814 nr_uninit < nr_block_infos
815 && BLOCK_INFO_STATE(block_infos[nr_uninit]) == BLOCK_STATE_UNINIT;
816 nr_uninit ++)
817 ;
818
819 if (nr_uninit == nr_block_infos)
820 return 0;
821
822 *percentiles = calloc(len, sizeof(**percentiles));
823
824 for (i = 0; i < len; i++) {
825 int idx = (plist[i].u.f * (nr_block_infos - nr_uninit) / 100)
826 + nr_uninit;
827 (*percentiles)[i] = BLOCK_INFO_TRIMS(block_infos[idx]);
828 }
829
830 memset(types, 0, sizeof(*types) * BLOCK_STATE_COUNT);
831 for (i = 0; i < nr_block_infos; i++)
832 types[BLOCK_INFO_STATE(block_infos[i])]++;
833
834 return len;
835}
836
837static const char *block_state_names[] = {
838 [BLOCK_STATE_UNINIT] = "unwritten",
839 [BLOCK_STATE_TRIMMED] = "trimmed",
840 [BLOCK_STATE_WRITTEN] = "written",
841 [BLOCK_STATE_TRIM_FAILURE] = "trim failure",
842 [BLOCK_STATE_WRITE_FAILURE] = "write failure",
843};
844
845static void show_block_infos(int nr_block_infos, uint32_t *block_infos,
a666cab8 846 fio_fp64_t *plist, struct buf_output *out)
66347cfa
DE		 847{
848 int len, pos, i;
849 unsigned int *percentiles = NULL;
850 unsigned int block_state_counts[BLOCK_STATE_COUNT];
851
852 len = calc_block_percentiles(nr_block_infos, block_infos, plist,
853 &percentiles, block_state_counts);
854
a666cab8 855 log_buf(out, " block lifetime percentiles :\n |");
66347cfa
DE		 856 pos = 0;
857 for (i = 0; i < len; i++) {
858 uint32_t block_info = percentiles[i];
859#define LINE_LENGTH 75
860 char str[LINE_LENGTH];
861 int strln = snprintf(str, LINE_LENGTH, " %3.2fth=%u%c",
862 plist[i].u.f, block_info,
863 i == len - 1 ? '\n' : ',');
864 assert(strln < LINE_LENGTH);
865 if (pos + strln > LINE_LENGTH) {
866 pos = 0;
a666cab8 867 log_buf(out, "\n |");
66347cfa 868 }
a666cab8 869 log_buf(out, "%s", str);
66347cfa
DE		 870 pos += strln;
871#undef LINE_LENGTH
872 }
873 if (percentiles)
874 free(percentiles);
875
a666cab8 876 log_buf(out, " states :");
66347cfa 877 for (i = 0; i < BLOCK_STATE_COUNT; i++)
a666cab8 878 log_buf(out, " %s=%u%c",
66347cfa
DE		 879 block_state_names[i], block_state_counts[i],
880 i == BLOCK_STATE_COUNT - 1 ? '\n' : ',');
881}
882
d685adfb
VF		 883static void show_ss_normal(struct thread_stat *ts, struct buf_output *out)
884{
d694a6a7 885 char *p1, *p1alt, *p2;
d685adfb
VF		 886 unsigned long long bw_mean, iops_mean;
887 const int i2p = is_power_of_2(ts->kb_base);
888
0c13c969 889 if (!ts->ss_dur)
d685adfb
VF		 890 return;
891
bb49c8bd
VF		 892 bw_mean = steadystate_bw_mean(ts);
893 iops_mean = steadystate_iops_mean(ts);
d685adfb 894
e883cb35
JF		 895 p1 = num2str(bw_mean / ts->kb_base, ts->sig_figs, ts->kb_base, i2p, ts->unit_base);
896 p1alt = num2str(bw_mean / ts->kb_base, ts->sig_figs, ts->kb_base, !i2p, ts->unit_base);
897 p2 = num2str(iops_mean, ts->sig_figs, 1, 0, N2S_NONE);
d685adfb 898
d694a6a7 899 log_buf(out, " steadystate : attained=%s, bw=%s (%s), iops=%s, %s%s=%.3f%s\n",
c8caba48 900 ts->ss_state & FIO_SS_ATTAINED ? "yes" : "no",
d694a6a7 901 p1, p1alt, p2,
c8caba48
JA		 902 ts->ss_state & FIO_SS_IOPS ? "iops" : "bw",
903 ts->ss_state & FIO_SS_SLOPE ? " slope": " mean dev",
bb49c8bd 904 ts->ss_criterion.u.f,
c8caba48 905 ts->ss_state & FIO_SS_PCT ? "%" : "");
d685adfb
VF		 906
907 free(p1);
d694a6a7 908 free(p1alt);
d685adfb
VF		 909 free(p2);
910}
911
2a2fdab1
L		 912static void show_agg_stats(struct disk_util_agg *agg, int terse,
913 struct buf_output *out)
914{
915 if (!agg->slavecount)
916 return;
917
918 if (!terse) {
919 log_buf(out, ", aggrios=%llu/%llu, aggrmerge=%llu/%llu, "
920 "aggrticks=%llu/%llu, aggrin_queue=%llu, "
921 "aggrutil=%3.2f%%",
922 (unsigned long long) agg->ios[0] / agg->slavecount,
923 (unsigned long long) agg->ios[1] / agg->slavecount,
924 (unsigned long long) agg->merges[0] / agg->slavecount,
925 (unsigned long long) agg->merges[1] / agg->slavecount,
926 (unsigned long long) agg->ticks[0] / agg->slavecount,
927 (unsigned long long) agg->ticks[1] / agg->slavecount,
928 (unsigned long long) agg->time_in_queue / agg->slavecount,
929 agg->max_util.u.f);
930 } else {
931 log_buf(out, ";slaves;%llu;%llu;%llu;%llu;%llu;%llu;%llu;%3.2f%%",
932 (unsigned long long) agg->ios[0] / agg->slavecount,
933 (unsigned long long) agg->ios[1] / agg->slavecount,
934 (unsigned long long) agg->merges[0] / agg->slavecount,
935 (unsigned long long) agg->merges[1] / agg->slavecount,
936 (unsigned long long) agg->ticks[0] / agg->slavecount,
937 (unsigned long long) agg->ticks[1] / agg->slavecount,
938 (unsigned long long) agg->time_in_queue / agg->slavecount,
939 agg->max_util.u.f);
940 }
941}
942
943static void aggregate_slaves_stats(struct disk_util *masterdu)
944{
945 struct disk_util_agg *agg = &masterdu->agg;
946 struct disk_util_stat *dus;
947 struct flist_head *entry;
948 struct disk_util *slavedu;
949 double util;
950
951 flist_for_each(entry, &masterdu->slaves) {
952 slavedu = flist_entry(entry, struct disk_util, slavelist);
953 dus = &slavedu->dus;
954 agg->ios[0] += dus->s.ios[0];
955 agg->ios[1] += dus->s.ios[1];
956 agg->merges[0] += dus->s.merges[0];
957 agg->merges[1] += dus->s.merges[1];
958 agg->sectors[0] += dus->s.sectors[0];
959 agg->sectors[1] += dus->s.sectors[1];
960 agg->ticks[0] += dus->s.ticks[0];
961 agg->ticks[1] += dus->s.ticks[1];
962 agg->time_in_queue += dus->s.time_in_queue;
963 agg->slavecount++;
964
965 util = (double) (100 * dus->s.io_ticks / (double) slavedu->dus.s.msec);
966 /* System utilization is the utilization of the
967 * component with the highest utilization.
968 */
969 if (util > agg->max_util.u.f)
970 agg->max_util.u.f = util;
971
972 }
973
974 if (agg->max_util.u.f > 100.0)
975 agg->max_util.u.f = 100.0;
976}
977
978void print_disk_util(struct disk_util_stat *dus, struct disk_util_agg *agg,
979 int terse, struct buf_output *out)
980{
981 double util = 0;
982
983 if (dus->s.msec)
984 util = (double) 100 * dus->s.io_ticks / (double) dus->s.msec;
985 if (util > 100.0)
986 util = 100.0;
987
988 if (!terse) {
989 if (agg->slavecount)
990 log_buf(out, " ");
991
992 log_buf(out, " %s: ios=%llu/%llu, merge=%llu/%llu, "
993 "ticks=%llu/%llu, in_queue=%llu, util=%3.2f%%",
994 dus->name,
995 (unsigned long long) dus->s.ios[0],
996 (unsigned long long) dus->s.ios[1],
997 (unsigned long long) dus->s.merges[0],
998 (unsigned long long) dus->s.merges[1],
999 (unsigned long long) dus->s.ticks[0],
1000 (unsigned long long) dus->s.ticks[1],
1001 (unsigned long long) dus->s.time_in_queue,
1002 util);
1003 } else {
1004 log_buf(out, ";%s;%llu;%llu;%llu;%llu;%llu;%llu;%llu;%3.2f%%",
1005 dus->name,
1006 (unsigned long long) dus->s.ios[0],
1007 (unsigned long long) dus->s.ios[1],
1008 (unsigned long long) dus->s.merges[0],
1009 (unsigned long long) dus->s.merges[1],
1010 (unsigned long long) dus->s.ticks[0],
1011 (unsigned long long) dus->s.ticks[1],
1012 (unsigned long long) dus->s.time_in_queue,
1013 util);
1014 }
1015
1016 /*
1017 * If the device has slaves, aggregate the stats for
1018 * those slave devices also.
1019 */
1020 show_agg_stats(agg, terse, out);
1021
1022 if (!terse)
1023 log_buf(out, "\n");
1024}
1025
1026void json_array_add_disk_util(struct disk_util_stat *dus,
1027 struct disk_util_agg *agg, struct json_array *array)
1028{
1029 struct json_object *obj;
1030 double util = 0;
1031
1032 if (dus->s.msec)
1033 util = (double) 100 * dus->s.io_ticks / (double) dus->s.msec;
1034 if (util > 100.0)
1035 util = 100.0;
1036
1037 obj = json_create_object();
1038 json_array_add_value_object(array, obj);
1039
eb2f29b7 1040 json_object_add_value_string(obj, "name", (const char *)dus->name);
2a2fdab1
L		 1041 json_object_add_value_int(obj, "read_ios", dus->s.ios[0]);
1042 json_object_add_value_int(obj, "write_ios", dus->s.ios[1]);
1043 json_object_add_value_int(obj, "read_merges", dus->s.merges[0]);
1044 json_object_add_value_int(obj, "write_merges", dus->s.merges[1]);
1045 json_object_add_value_int(obj, "read_ticks", dus->s.ticks[0]);
1046 json_object_add_value_int(obj, "write_ticks", dus->s.ticks[1]);
1047 json_object_add_value_int(obj, "in_queue", dus->s.time_in_queue);
1048 json_object_add_value_float(obj, "util", util);
1049
1050 /*
1051 * If the device has slaves, aggregate the stats for
1052 * those slave devices also.
1053 */
1054 if (!agg->slavecount)
1055 return;
1056 json_object_add_value_int(obj, "aggr_read_ios",
1057 agg->ios[0] / agg->slavecount);
1058 json_object_add_value_int(obj, "aggr_write_ios",
1059 agg->ios[1] / agg->slavecount);
1060 json_object_add_value_int(obj, "aggr_read_merges",
1061 agg->merges[0] / agg->slavecount);
1062 json_object_add_value_int(obj, "aggr_write_merge",
1063 agg->merges[1] / agg->slavecount);
1064 json_object_add_value_int(obj, "aggr_read_ticks",
1065 agg->ticks[0] / agg->slavecount);
1066 json_object_add_value_int(obj, "aggr_write_ticks",
1067 agg->ticks[1] / agg->slavecount);
1068 json_object_add_value_int(obj, "aggr_in_queue",
1069 agg->time_in_queue / agg->slavecount);
1070 json_object_add_value_float(obj, "aggr_util", agg->max_util.u.f);
1071}
1072
1073static void json_object_add_disk_utils(struct json_object *obj,
1074 struct flist_head *head)
1075{
1076 struct json_array *array = json_create_array();
1077 struct flist_head *entry;
1078 struct disk_util *du;
1079
1080 json_object_add_value_array(obj, "disk_util", array);
1081
1082 flist_for_each(entry, head) {
1083 du = flist_entry(entry, struct disk_util, list);
1084
1085 aggregate_slaves_stats(du);
1086 json_array_add_disk_util(&du->dus, &du->agg, array);
1087 }
1088}
1089
1090void show_disk_util(int terse, struct json_object *parent,
1091 struct buf_output *out)
1092{
1093 struct flist_head *entry;
1094 struct disk_util *du;
1095 bool do_json;
1096
1097 if (!is_running_backend())
1098 return;
1099
6dc75062 1100 if (flist_empty(&disk_list))
2a2fdab1 1101 return;
2a2fdab1
L		 1102
1103 if ((output_format & FIO_OUTPUT_JSON) && parent)
1104 do_json = true;
1105 else
1106 do_json = false;
1107
1108 if (!terse && !do_json)
1109 log_buf(out, "\nDisk stats (read/write):\n");
1110
6dc75062 1111 if (do_json) {
2a2fdab1 1112 json_object_add_disk_utils(parent, &disk_list);
6dc75062 1113 } else if (output_format & ~(FIO_OUTPUT_JSON | FIO_OUTPUT_JSON_PLUS)) {
2a2fdab1
L		 1114 flist_for_each(entry, &disk_list) {
1115 du = flist_entry(entry, struct disk_util, list);
1116
1117 aggregate_slaves_stats(du);
1118 print_disk_util(&du->dus, &du->agg, terse, out);
1119 }
1120 }
1121}
1122
10aa136b 1123static void show_thread_status_normal(struct thread_stat *ts,
a666cab8
JA		 1124 struct group_run_stats *rs,
1125 struct buf_output *out)
3c39a379
JA		 1126{
1127 double usr_cpu, sys_cpu;
69008999 1128 unsigned long runtime;
71619dc2 1129 double io_u_dist[FIO_IO_U_MAP_NR];
57a64324 1130 time_t time_p;
35326842 1131 char time_buf[32];
3c39a379 1132
9966af7b 1133 if (!ddir_rw_sum(ts->io_bytes) && !ddir_rw_sum(ts->total_io_u))
3c39a379 1134 return;
7a4e480d 1135
33477b4b 1136 memset(time_buf, 0, sizeof(time_buf));
3c39a379 1137
57a64324 1138 time(&time_p);
45054cbe 1139 os_ctime_r((const time_t *) &time_p, time_buf, sizeof(time_buf));
57a64324 1140
5ec10eaa 1141 if (!ts->error) {
a666cab8 1142 log_buf(out, "%s: (groupid=%d, jobs=%d): err=%2d: pid=%d: %s",
5ec10eaa 1143 ts->name, ts->groupid, ts->members,
57a64324 1144 ts->error, (int) ts->pid, time_buf);
5ec10eaa 1145 } else {
a666cab8 1146 log_buf(out, "%s: (groupid=%d, jobs=%d): err=%2d (%s): pid=%d: %s",
5ec10eaa 1147 ts->name, ts->groupid, ts->members,
57a64324
JA		 1148 ts->error, ts->verror, (int) ts->pid,
1149 time_buf);
5ec10eaa 1150 }
3c39a379 1151
259e47de 1152 if (strlen(ts->description))
a666cab8 1153 log_buf(out, " Description : [%s]\n", ts->description);
7bdce1bd 1154
dde39f8c
AD		 1155 for_each_rw_ddir(ddir) {
1156 if (ts->io_bytes[ddir])
1157 show_ddir_status(rs, ts, ddir, out);
1158 }
3c39a379 1159
5cb8a8cd
BP		 1160 if (ts->unified_rw_rep == UNIFIED_BOTH)
1161 show_mixed_ddir_status(rs, ts, out);
1162
a666cab8 1163 show_latencies(ts, out);
7e1773ba 1164
b2b3eefe
JA		 1165 if (ts->sync_stat.samples)
1166 show_ddir_status(rs, ts, DDIR_SYNC, out);
1167
756867bd 1168 runtime = ts->total_run_time;
69008999 1169 if (runtime) {
1e97cce9 1170 double runt = (double) runtime;
3c39a379 1171
756867bd
JA		 1172 usr_cpu = (double) ts->usr_time * 100 / runt;
1173 sys_cpu = (double) ts->sys_time * 100 / runt;
3c39a379
JA		 1174 } else {
1175 usr_cpu = 0;
1176 sys_cpu = 0;
1177 }
1178
a666cab8 1179 log_buf(out, " cpu : usr=%3.2f%%, sys=%3.2f%%, ctx=%llu,"
4e0a8fa2
JA		 1180 " majf=%llu, minf=%llu\n", usr_cpu, sys_cpu,
1181 (unsigned long long) ts->ctx,
1182 (unsigned long long) ts->majf,
1183 (unsigned long long) ts->minf);
71619dc2 1184
d79db122 1185 stat_calc_dist(ts->io_u_map, ddir_rw_sum(ts->total_io_u), io_u_dist);
a666cab8 1186 log_buf(out, " IO depths : 1=%3.1f%%, 2=%3.1f%%, 4=%3.1f%%, 8=%3.1f%%,"
5ec10eaa
JA		 1187 " 16=%3.1f%%, 32=%3.1f%%, >=64=%3.1f%%\n", io_u_dist[0],
1188 io_u_dist[1], io_u_dist[2],
1189 io_u_dist[3], io_u_dist[4],
1190 io_u_dist[5], io_u_dist[6]);
838bc709
JA		 1191
1192 stat_calc_dist(ts->io_u_submit, ts->total_submit, io_u_dist);
a666cab8 1193 log_buf(out, " submit : 0=%3.1f%%, 4=%3.1f%%, 8=%3.1f%%, 16=%3.1f%%,"
838bc709
JA		 1194 " 32=%3.1f%%, 64=%3.1f%%, >=64=%3.1f%%\n", io_u_dist[0],
1195 io_u_dist[1], io_u_dist[2],
1196 io_u_dist[3], io_u_dist[4],
1197 io_u_dist[5], io_u_dist[6]);
1198 stat_calc_dist(ts->io_u_complete, ts->total_complete, io_u_dist);
a666cab8 1199 log_buf(out, " complete : 0=%3.1f%%, 4=%3.1f%%, 8=%3.1f%%, 16=%3.1f%%,"
838bc709
JA		 1200 " 32=%3.1f%%, 64=%3.1f%%, >=64=%3.1f%%\n", io_u_dist[0],
1201 io_u_dist[1], io_u_dist[2],
1202 io_u_dist[3], io_u_dist[4],
1203 io_u_dist[5], io_u_dist[6]);
7f3ecee2
JA		 1204 log_buf(out, " issued rwts: total=%llu,%llu,%llu,%llu"
1205 " short=%llu,%llu,%llu,0"
1206 " dropped=%llu,%llu,%llu,0\n",
4e0a8fa2
JA		 1207 (unsigned long long) ts->total_io_u[0],
1208 (unsigned long long) ts->total_io_u[1],
1209 (unsigned long long) ts->total_io_u[2],
7f3ecee2 1210 (unsigned long long) ts->total_io_u[3],
4e0a8fa2
JA		 1211 (unsigned long long) ts->short_io_u[0],
1212 (unsigned long long) ts->short_io_u[1],
3bcb9d94
JA		 1213 (unsigned long long) ts->short_io_u[2],
1214 (unsigned long long) ts->drop_io_u[0],
1215 (unsigned long long) ts->drop_io_u[1],
1216 (unsigned long long) ts->drop_io_u[2]);
f2bba182 1217 if (ts->continue_on_error) {
a666cab8 1218 log_buf(out, " errors : total=%llu, first_error=%d/<%s>\n",
4e0a8fa2 1219 (unsigned long long)ts->total_err_count,
1ec99eea
JA		 1220 ts->first_error,
1221 strerror(ts->first_error));
f2bba182 1222 }
3e260a46 1223 if (ts->latency_depth) {
a666cab8 1224 log_buf(out, " latency : target=%llu, window=%llu, percentile=%.2f%%, depth=%u\n",
3e260a46
JA		 1225 (unsigned long long)ts->latency_target,
1226 (unsigned long long)ts->latency_window,
1227 ts->latency_percentile.u.f,
1228 ts->latency_depth);
1229 }
66347cfa
DE		 1230
1231 if (ts->nr_block_infos)
1232 show_block_infos(ts->nr_block_infos, ts->block_infos,
a666cab8 1233 ts->percentile_list, out);
d685adfb 1234
bb49c8bd 1235 if (ts->ss_dur)
d685adfb 1236 show_ss_normal(ts, out);
3c39a379
JA		 1237}
1238
756867bd 1239static void show_ddir_status_terse(struct thread_stat *ts,
a666cab8 1240 struct group_run_stats *rs, int ddir,
a2c95580 1241 int ver, struct buf_output *out)
c6ae0a5b 1242{
d6bb626e
VF		 1243 unsigned long long min, max, minv, maxv, bw, iops;
1244 unsigned long long *ovals = NULL;
c6ae0a5b 1245 double mean, dev;
d6bb626e 1246 unsigned int len;
a2c95580 1247 int i, bw_stat;
c6ae0a5b 1248
ff58fced
JA		 1249 assert(ddir_rw(ddir));
1250
312b4af2
JA		 1251 iops = bw = 0;
1252 if (ts->runtime[ddir]) {
1253 uint64_t runt = ts->runtime[ddir];
1254
420b104a 1255 bw = ((1000 * ts->io_bytes[ddir]) / runt) / 1024; /* KiB/s */
312b4af2
JA		 1256 iops = (1000 * (uint64_t) ts->total_io_u[ddir]) / runt;
1257 }
c6ae0a5b 1258
a666cab8 1259 log_buf(out, ";%llu;%llu;%llu;%llu",
4e0a8fa2
JA		 1260 (unsigned long long) ts->io_bytes[ddir] >> 10, bw, iops,
1261 (unsigned long long) ts->runtime[ddir]);
c6ae0a5b 1262
079ad09b 1263 if (calc_lat(&ts->slat_stat[ddir], &min, &max, &mean, &dev))
247823cc 1264 log_buf(out, ";%llu;%llu;%f;%f", min/1000, max/1000, mean/1000, dev/1000);
c6ae0a5b 1265 else
d6bb626e 1266 log_buf(out, ";%llu;%llu;%f;%f", 0ULL, 0ULL, 0.0, 0.0);
c6ae0a5b 1267
079ad09b 1268 if (calc_lat(&ts->clat_stat[ddir], &min, &max, &mean, &dev))
247823cc 1269 log_buf(out, ";%llu;%llu;%f;%f", min/1000, max/1000, mean/1000, dev/1000);
c6ae0a5b 1270 else
d6bb626e 1271 log_buf(out, ";%llu;%llu;%f;%f", 0ULL, 0ULL, 0.0, 0.0);
c6ae0a5b 1272
6dc75062 1273 if (ts->lat_percentiles) {
56440e63
VF		 1274 len = calc_clat_percentiles(ts->io_u_plat[FIO_LAT][ddir],
1275 ts->lat_stat[ddir].samples,
1276 ts->percentile_list, &ovals, &maxv,
1277 &minv);
6dc75062 1278 } else if (ts->clat_percentiles) {
df8781b6 1279 len = calc_clat_percentiles(ts->io_u_plat[FIO_CLAT][ddir],
1db92cb6
JA		 1280 ts->clat_stat[ddir].samples,
1281 ts->percentile_list, &ovals, &maxv,
1282 &minv);
6dc75062 1283 } else {
1db92cb6 1284 len = 0;
6dc75062
JA		 1285 }
1286
1db92cb6
JA		 1287 for (i = 0; i < FIO_IO_U_LIST_MAX_LEN; i++) {
1288 if (i >= len) {
a666cab8 1289 log_buf(out, ";0%%=0");
1db92cb6
JA		 1290 continue;
1291 }
247823cc 1292 log_buf(out, ";%f%%=%llu", ts->percentile_list[i].u.f, ovals[i]/1000);
1db92cb6 1293 }
2341a37a
K		 1294
1295 if (calc_lat(&ts->lat_stat[ddir], &min, &max, &mean, &dev))
247823cc 1296 log_buf(out, ";%llu;%llu;%f;%f", min/1000, max/1000, mean/1000, dev/1000);
2341a37a 1297 else
d6bb626e 1298 log_buf(out, ";%llu;%llu;%f;%f", 0ULL, 0ULL, 0.0, 0.0);
2341a37a 1299
283feb79 1300 free(ovals);
1db92cb6 1301
a2c95580
AH		 1302 bw_stat = calc_lat(&ts->bw_stat[ddir], &min, &max, &mean, &dev);
1303 if (bw_stat) {
19d3e967
JA		 1304 double p_of_agg = 100.0;
1305
1306 if (rs->agg[ddir]) {
d1707474 1307 p_of_agg = mean * 100 / (double) (rs->agg[ddir] / 1024);
19d3e967
JA		 1308 if (p_of_agg > 100.0)
1309 p_of_agg = 100.0;
1310 }
c6ae0a5b 1311
d6bb626e 1312 log_buf(out, ";%llu;%llu;%f%%;%f;%f", min, max, p_of_agg, mean, dev);
6dc75062 1313 } else {
d6bb626e 1314 log_buf(out, ";%llu;%llu;%f%%;%f;%f", 0ULL, 0ULL, 0.0, 0.0, 0.0);
6dc75062 1315 }
a2c95580
AH		 1316
1317 if (ver == 5) {
1318 if (bw_stat)
29eb371b 1319 log_buf(out, ";%" PRIu64, (&ts->bw_stat[ddir])->samples);
a2c95580
AH		 1320 else
1321 log_buf(out, ";%lu", 0UL);
1322
1323 if (calc_lat(&ts->iops_stat[ddir], &min, &max, &mean, &dev))
29eb371b 1324 log_buf(out, ";%llu;%llu;%f;%f;%" PRIu64, min, max,
a2c95580
AH		 1325 mean, dev, (&ts->iops_stat[ddir])->samples);
1326 else
1327 log_buf(out, ";%llu;%llu;%f;%f;%lu", 0ULL, 0ULL, 0.0, 0.0, 0UL);
1328 }
c6ae0a5b
JA		 1329}
1330
5cb8a8cd
BP		 1331static void show_mixed_ddir_status_terse(struct thread_stat *ts,
1332 struct group_run_stats *rs,
1333 int ver, struct buf_output *out)
1334{
1335 struct thread_stat *ts_lcl;
5cb8a8cd 1336
6dc75062
JA		 1337 /*
1338 * Handle aggregation of Reads (ddir = 0), Writes (ddir = 1), and
1339 * Trims (ddir = 2)
1340 */
5cb8a8cd
BP		 1341 ts_lcl = malloc(sizeof(struct thread_stat));
1342 memset((void *)ts_lcl, 0, sizeof(struct thread_stat));
6dc75062
JA		 1343 /* calculate mixed stats */
1344 ts_lcl->unified_rw_rep = UNIFIED_MIXED;
6619fc32 1345 init_thread_stat_min_vals(ts_lcl);
5cb8a8cd
BP		 1346 ts_lcl->lat_percentiles = ts->lat_percentiles;
1347 ts_lcl->clat_percentiles = ts->clat_percentiles;
1348 ts_lcl->slat_percentiles = ts->slat_percentiles;
6dc75062 1349 ts_lcl->percentile_precision = ts->percentile_precision;
5cb8a8cd
BP		 1350 memcpy(ts_lcl->percentile_list, ts->percentile_list, sizeof(ts->percentile_list));
1351
016869be 1352 sum_thread_stats(ts_lcl, ts);
5cb8a8cd
BP		 1353
1354 /* add the aggregated stats to json parent */
1355 show_ddir_status_terse(ts_lcl, rs, DDIR_READ, ver, out);
1356 free(ts_lcl);
1357}
1358
6dc75062
JA		 1359static struct json_object *add_ddir_lat_json(struct thread_stat *ts,
1360 uint32_t percentiles,
1361 struct io_stat *lat_stat,
1362 uint64_t *io_u_plat)
56440e63
VF		 1363{
1364 char buf[120];
1365 double mean, dev;
1366 unsigned int i, len;
1367 struct json_object *lat_object, *percentile_object, *clat_bins_object;
1368 unsigned long long min, max, maxv, minv, *ovals = NULL;
1369
1370 if (!calc_lat(lat_stat, &min, &max, &mean, &dev)) {
1371 min = max = 0;
1372 mean = dev = 0.0;
1373 }
1374 lat_object = json_create_object();
1375 json_object_add_value_int(lat_object, "min", min);
1376 json_object_add_value_int(lat_object, "max", max);
1377 json_object_add_value_float(lat_object, "mean", mean);
1378 json_object_add_value_float(lat_object, "stddev", dev);
1379 json_object_add_value_int(lat_object, "N", lat_stat->samples);
1380
1381 if (percentiles && lat_stat->samples) {
1382 len = calc_clat_percentiles(io_u_plat, lat_stat->samples,
1383 ts->percentile_list, &ovals, &maxv, &minv);
1384
1385 if (len > FIO_IO_U_LIST_MAX_LEN)
1386 len = FIO_IO_U_LIST_MAX_LEN;
1387
1388 percentile_object = json_create_object();
1389 json_object_add_value_object(lat_object, "percentile", percentile_object);
1390 for (i = 0; i < len; i++) {
1391 snprintf(buf, sizeof(buf), "%f", ts->percentile_list[i].u.f);
1392 json_object_add_value_int(percentile_object, buf, ovals[i]);
1393 }
1394 free(ovals);
1395
1396 if (output_format & FIO_OUTPUT_JSON_PLUS) {
1397 clat_bins_object = json_create_object();
1398 json_object_add_value_object(lat_object, "bins", clat_bins_object);
1399
1400 for(i = 0; i < FIO_IO_U_PLAT_NR; i++)
1401 if (io_u_plat[i]) {
1402 snprintf(buf, sizeof(buf), "%llu", plat_idx_to_val(i));
1403 json_object_add_value_int(clat_bins_object, buf, io_u_plat[i]);
1404 }
1405 }
1406 }
1407
1408 return lat_object;
1409}
1410
cc372b17
SL		 1411static void add_ddir_status_json(struct thread_stat *ts,
1412 struct group_run_stats *rs, int ddir, struct json_object *parent)
1413{
56440e63 1414 unsigned long long min, max;
aedd021d 1415 unsigned long long bw_bytes, bw;
9f68fe3a 1416 double mean, dev, iops;
56440e63 1417 struct json_object *dir_object, *tmp_object;
cc372b17
SL		 1418 double p_of_agg = 100.0;
1419
b2b3eefe 1420 assert(ddir_rw(ddir) || ddir_sync(ddir));
cc372b17 1421
5cb8a8cd 1422 if ((ts->unified_rw_rep == UNIFIED_MIXED) && ddir != DDIR_READ)
771e58be
JA		 1423 return;
1424
cc372b17 1425 dir_object = json_create_object();
771e58be 1426 json_object_add_value_object(parent,
5cb8a8cd 1427 (ts->unified_rw_rep == UNIFIED_MIXED) ? "mixed" : io_ddir_name(ddir), dir_object);
cc372b17 1428
b2b3eefe
JA		 1429 if (ddir_rw(ddir)) {
1430 bw_bytes = 0;
1431 bw = 0;
1432 iops = 0.0;
1433 if (ts->runtime[ddir]) {
1434 uint64_t runt = ts->runtime[ddir];
cc372b17 1435
b2b3eefe
JA		 1436 bw_bytes = ((1000 * ts->io_bytes[ddir]) / runt); /* Bytes/s */
1437 bw = bw_bytes / 1024; /* KiB/s */
1438 iops = (1000.0 * (uint64_t) ts->total_io_u[ddir]) / runt;
1439 }
cc372b17 1440
b2b3eefe
JA		 1441 json_object_add_value_int(dir_object, "io_bytes", ts->io_bytes[ddir]);
1442 json_object_add_value_int(dir_object, "io_kbytes", ts->io_bytes[ddir] >> 10);
1443 json_object_add_value_int(dir_object, "bw_bytes", bw_bytes);
1444 json_object_add_value_int(dir_object, "bw", bw);
1445 json_object_add_value_float(dir_object, "iops", iops);
1446 json_object_add_value_int(dir_object, "runtime", ts->runtime[ddir]);
1447 json_object_add_value_int(dir_object, "total_ios", ts->total_io_u[ddir]);
1448 json_object_add_value_int(dir_object, "short_ios", ts->short_io_u[ddir]);
1449 json_object_add_value_int(dir_object, "drop_ios", ts->drop_io_u[ddir]);
1450
56440e63
VF		 1451 tmp_object = add_ddir_lat_json(ts, ts->slat_percentiles,
1452 &ts->slat_stat[ddir], ts->io_u_plat[FIO_SLAT][ddir]);
b2b3eefe 1453 json_object_add_value_object(dir_object, "slat_ns", tmp_object);
56440e63
VF		 1454
1455 tmp_object = add_ddir_lat_json(ts, ts->clat_percentiles,
1456 &ts->clat_stat[ddir], ts->io_u_plat[FIO_CLAT][ddir]);
b2b3eefe 1457 json_object_add_value_object(dir_object, "clat_ns", tmp_object);
cc372b17 1458
56440e63
VF		 1459 tmp_object = add_ddir_lat_json(ts, ts->lat_percentiles,
1460 &ts->lat_stat[ddir], ts->io_u_plat[FIO_LAT][ddir]);
b2b3eefe 1461 json_object_add_value_object(dir_object, "lat_ns", tmp_object);
56440e63 1462 } else {
f5ec8123 1463 json_object_add_value_int(dir_object, "total_ios", ts->total_io_u[DDIR_SYNC]);
56440e63
VF		 1464 tmp_object = add_ddir_lat_json(ts, ts->lat_percentiles | ts->clat_percentiles,
1465 &ts->sync_stat, ts->io_u_sync_plat);
1466 json_object_add_value_object(dir_object, "lat_ns", tmp_object);
513e37ee
VF		 1467 }
1468
56440e63
VF		 1469 if (!ddir_rw(ddir))
1470 return;
b2a432bf
PC		 1471
1472 /* Only print PRIO latencies if some high priority samples were gathered */
1473 if (ts->clat_high_prio_stat[ddir].samples > 0) {
56440e63 1474 const char *high, *low;
b2a432bf 1475
56440e63 1476 if (ts->lat_percentiles) {
efd78265 1477 high = "lat_high_prio";
56440e63
VF		 1478 low = "lat_low_prio";
1479 } else {
efd78265 1480 high = "clat_high_prio";
56440e63 1481 low = "clat_low_prio";
b2a432bf 1482 }
b2a432bf 1483
56440e63
VF		 1484 tmp_object = add_ddir_lat_json(ts, ts->clat_percentiles | ts->lat_percentiles,
1485 &ts->clat_high_prio_stat[ddir], ts->io_u_plat_high_prio[ddir]);
1486 json_object_add_value_object(dir_object, high, tmp_object);
b2b3eefe 1487
56440e63 1488 tmp_object = add_ddir_lat_json(ts, ts->clat_percentiles | ts->lat_percentiles,
efd78265 1489 &ts->clat_low_prio_stat[ddir], ts->io_u_plat_low_prio[ddir]);
56440e63 1490 json_object_add_value_object(dir_object, low, tmp_object);
cc372b17 1491 }
24cab44e 1492
b9e1b491 1493 if (calc_lat(&ts->bw_stat[ddir], &min, &max, &mean, &dev)) {
5c0abd5e 1494 p_of_agg = convert_agg_kbytes_percent(rs, ddir, mean);
cc372b17
SL		 1495 } else {
1496 min = max = 0;
1497 p_of_agg = mean = dev = 0.0;
1498 }
56440e63 1499
cc372b17
SL		 1500 json_object_add_value_int(dir_object, "bw_min", min);
1501 json_object_add_value_int(dir_object, "bw_max", max);
a806bf2e 1502 json_object_add_value_float(dir_object, "bw_agg", p_of_agg);
cc372b17
SL		 1503 json_object_add_value_float(dir_object, "bw_mean", mean);
1504 json_object_add_value_float(dir_object, "bw_dev", dev);
54c05828
AH		 1505 json_object_add_value_int(dir_object, "bw_samples",
1506 (&ts->bw_stat[ddir])->samples);
188b6016
AH		 1507
1508 if (!calc_lat(&ts->iops_stat[ddir], &min, &max, &mean, &dev)) {
1509 min = max = 0;
1510 mean = dev = 0.0;
1511 }
1512 json_object_add_value_int(dir_object, "iops_min", min);
1513 json_object_add_value_int(dir_object, "iops_max", max);
1514 json_object_add_value_float(dir_object, "iops_mean", mean);
1515 json_object_add_value_float(dir_object, "iops_stddev", dev);
54c05828
AH		 1516 json_object_add_value_int(dir_object, "iops_samples",
1517 (&ts->iops_stat[ddir])->samples);
96563db9
JA		 1518
1519 if (ts->cachehit + ts->cachemiss) {
1520 uint64_t total;
1521 double hit;
1522
1523 total = ts->cachehit + ts->cachemiss;
1524 hit = (double) ts->cachehit / (double) total;
1525 hit *= 100.0;
1526 json_object_add_value_float(dir_object, "cachehit", hit);
1527 }
cc372b17
SL		 1528}
1529
5cb8a8cd
BP		 1530static void add_mixed_ddir_status_json(struct thread_stat *ts,
1531 struct group_run_stats *rs, struct json_object *parent)
1532{
1533 struct thread_stat *ts_lcl;
5cb8a8cd 1534
6dc75062
JA		 1535 /*
1536 * Handle aggregation of Reads (ddir = 0), Writes (ddir = 1), and
1537 * Trims (ddir = 2)
1538 */
5cb8a8cd
BP		 1539 ts_lcl = malloc(sizeof(struct thread_stat));
1540 memset((void *)ts_lcl, 0, sizeof(struct thread_stat));
6dc75062
JA		 1541 /* calculate mixed stats */
1542 ts_lcl->unified_rw_rep = UNIFIED_MIXED;
6619fc32 1543 init_thread_stat_min_vals(ts_lcl);
5cb8a8cd
BP		 1544 ts_lcl->lat_percentiles = ts->lat_percentiles;
1545 ts_lcl->clat_percentiles = ts->clat_percentiles;
1546 ts_lcl->slat_percentiles = ts->slat_percentiles;
6dc75062 1547 ts_lcl->percentile_precision = ts->percentile_precision;
5cb8a8cd
BP		 1548 memcpy(ts_lcl->percentile_list, ts->percentile_list, sizeof(ts->percentile_list));
1549
016869be 1550 sum_thread_stats(ts_lcl, ts);
5cb8a8cd
BP		 1551
1552 /* add the aggregated stats to json parent */
1553 add_ddir_status_json(ts_lcl, rs, DDIR_READ, parent);
1554 free(ts_lcl);
1555}
1556
bef2112b
AH		 1557static void show_thread_status_terse_all(struct thread_stat *ts,
1558 struct group_run_stats *rs, int ver,
1559 struct buf_output *out)
4d658652
JA		 1560{
1561 double io_u_dist[FIO_IO_U_MAP_NR];
1562 double io_u_lat_u[FIO_IO_U_LAT_U_NR];
1563 double io_u_lat_m[FIO_IO_U_LAT_M_NR];
1564 double usr_cpu, sys_cpu;
1565 int i;
1566
1567 /* General Info */
bef2112b
AH		 1568 if (ver == 2)
1569 log_buf(out, "2;%s;%d;%d", ts->name, ts->groupid, ts->error);
1570 else
1571 log_buf(out, "%d;%s;%s;%d;%d", ver, fio_version_string,
1572 ts->name, ts->groupid, ts->error);
c6ae0a5b 1573
5cb8a8cd 1574 /* Log Read Status, or mixed if unified_rw_rep = 1 */
a2c95580 1575 show_ddir_status_terse(ts, rs, DDIR_READ, ver, out);
5cb8a8cd
BP		 1576 if (ts->unified_rw_rep != UNIFIED_MIXED) {
1577 /* Log Write Status */
1578 show_ddir_status_terse(ts, rs, DDIR_WRITE, ver, out);
1579 /* Log Trim Status */
1580 if (ver == 2 || ver == 4 || ver == 5)
1581 show_ddir_status_terse(ts, rs, DDIR_TRIM, ver, out);
1582 }
1583 if (ts->unified_rw_rep == UNIFIED_BOTH)
1584 show_mixed_ddir_status_terse(ts, rs, ver, out);
562c2d2f 1585 /* CPU Usage */
756867bd
JA		 1586 if (ts->total_run_time) {
1587 double runt = (double) ts->total_run_time;
c6ae0a5b 1588
756867bd
JA		 1589 usr_cpu = (double) ts->usr_time * 100 / runt;
1590 sys_cpu = (double) ts->sys_time * 100 / runt;
c6ae0a5b
JA		 1591 } else {
1592 usr_cpu = 0;
1593 sys_cpu = 0;
1594 }
1595
a666cab8 1596 log_buf(out, ";%f%%;%f%%;%llu;%llu;%llu", usr_cpu, sys_cpu,
4e0a8fa2
JA		 1597 (unsigned long long) ts->ctx,
1598 (unsigned long long) ts->majf,
1599 (unsigned long long) ts->minf);
2270890c 1600
562c2d2f 1601 /* Calc % distribution of IO depths, usecond, msecond latency */
d79db122 1602 stat_calc_dist(ts->io_u_map, ddir_rw_sum(ts->total_io_u), io_u_dist);
247823cc 1603 stat_calc_lat_nu(ts, io_u_lat_u);
04a0feae 1604 stat_calc_lat_m(ts, io_u_lat_m);
2270890c 1605
562c2d2f 1606 /* Only show fixed 7 I/O depth levels*/
a666cab8 1607 log_buf(out, ";%3.1f%%;%3.1f%%;%3.1f%%;%3.1f%%;%3.1f%%;%3.1f%%;%3.1f%%",
5ec10eaa
JA		 1608 io_u_dist[0], io_u_dist[1], io_u_dist[2], io_u_dist[3],
1609 io_u_dist[4], io_u_dist[5], io_u_dist[6]);
2270890c 1610
562c2d2f 1611 /* Microsecond latency */
04a0feae 1612 for (i = 0; i < FIO_IO_U_LAT_U_NR; i++)
a666cab8 1613 log_buf(out, ";%3.2f%%", io_u_lat_u[i]);
562c2d2f 1614 /* Millisecond latency */
04a0feae 1615 for (i = 0; i < FIO_IO_U_LAT_M_NR; i++)
a666cab8 1616 log_buf(out, ";%3.2f%%", io_u_lat_m[i]);
f2f788dd
JA		 1617
1618 /* disk util stats, if any */
24a97130 1619 if (ver >= 3 && is_running_backend())
bef2112b 1620 show_disk_util(1, NULL, out);
f2f788dd 1621
562c2d2f 1622 /* Additional output if continue_on_error set - default off*/
f2bba182 1623 if (ts->continue_on_error)
a666cab8 1624 log_buf(out, ";%llu;%d", (unsigned long long) ts->total_err_count, ts->first_error);
2270890c 1625
562c2d2f 1626 /* Additional output if description is set */
d5495f0b
VF		 1627 if (strlen(ts->description)) {
1628 if (ver == 2)
1629 log_buf(out, "\n");
a666cab8 1630 log_buf(out, ";%s", ts->description);
d5495f0b 1631 }
946e4276 1632
a666cab8 1633 log_buf(out, "\n");
756867bd
JA		 1634}
1635
a89ba4b1 1636static void json_add_job_opts(struct json_object *root, const char *name,
0cf542af 1637 struct flist_head *opt_list)
66e19a38
JA		 1638{
1639 struct json_object *dir_object;
1640 struct flist_head *entry;
1641 struct print_option *p;
1642
1643 if (flist_empty(opt_list))
1644 return;
1645
1646 dir_object = json_create_object();
1647 json_object_add_value_object(root, name, dir_object);
1648
1649 flist_for_each(entry, opt_list) {
66e19a38 1650 p = flist_entry(entry, struct print_option, list);
c42b48fe 1651 json_object_add_value_string(dir_object, p->name, p->value);
66e19a38
JA		 1652 }
1653}
1654
cc372b17 1655static struct json_object *show_thread_status_json(struct thread_stat *ts,
66e19a38
JA		 1656 struct group_run_stats *rs,
1657 struct flist_head *opt_list)
cc372b17
SL		 1658{
1659 struct json_object *root, *tmp;
b01af66b 1660 struct jobs_eta *je;
cc372b17 1661 double io_u_dist[FIO_IO_U_MAP_NR];
d6bb626e 1662 double io_u_lat_n[FIO_IO_U_LAT_N_NR];
cc372b17
SL		 1663 double io_u_lat_u[FIO_IO_U_LAT_U_NR];
1664 double io_u_lat_m[FIO_IO_U_LAT_M_NR];
1665 double usr_cpu, sys_cpu;
1666 int i;
b01af66b
CJ		 1667 size_t size;
1668
cc372b17
SL		 1669 root = json_create_object();
1670 json_object_add_value_string(root, "jobname", ts->name);
1671 json_object_add_value_int(root, "groupid", ts->groupid);
1672 json_object_add_value_int(root, "error", ts->error);
1673
b01af66b 1674 /* ETA Info */
c5103619 1675 je = get_jobs_eta(true, &size);
2de615ad
JA		 1676 if (je) {
1677 json_object_add_value_int(root, "eta", je->eta_sec);
1678 json_object_add_value_int(root, "elapsed", je->elapsed_sec);
1679 }
b01af66b 1680
66e19a38 1681 if (opt_list)
0cf542af 1682 json_add_job_opts(root, "job options", opt_list);
66e19a38 1683
cc372b17
SL		 1684 add_ddir_status_json(ts, rs, DDIR_READ, root);
1685 add_ddir_status_json(ts, rs, DDIR_WRITE, root);
f3afa57e 1686 add_ddir_status_json(ts, rs, DDIR_TRIM, root);
b2b3eefe 1687 add_ddir_status_json(ts, rs, DDIR_SYNC, root);
cc372b17 1688
5cb8a8cd
BP		 1689 if (ts->unified_rw_rep == UNIFIED_BOTH)
1690 add_mixed_ddir_status_json(ts, rs, root);
1691
cc372b17
SL		 1692 /* CPU Usage */
1693 if (ts->total_run_time) {
1694 double runt = (double) ts->total_run_time;
1695
1696 usr_cpu = (double) ts->usr_time * 100 / runt;
1697 sys_cpu = (double) ts->sys_time * 100 / runt;
1698 } else {
1699 usr_cpu = 0;
1700 sys_cpu = 0;
1701 }
bcbb4c6c 1702 json_object_add_value_int(root, "job_runtime", ts->total_run_time);
cc372b17
SL		 1703 json_object_add_value_float(root, "usr_cpu", usr_cpu);
1704 json_object_add_value_float(root, "sys_cpu", sys_cpu);
1705 json_object_add_value_int(root, "ctx", ts->ctx);
1706 json_object_add_value_int(root, "majf", ts->majf);
1707 json_object_add_value_int(root, "minf", ts->minf);
1708
ec3e3648 1709 /* Calc % distribution of IO depths */
d79db122 1710 stat_calc_dist(ts->io_u_map, ddir_rw_sum(ts->total_io_u), io_u_dist);
cc372b17
SL		 1711 tmp = json_create_object();
1712 json_object_add_value_object(root, "iodepth_level", tmp);
1713 /* Only show fixed 7 I/O depth levels*/
1714 for (i = 0; i < 7; i++) {
1715 char name[20];
1716 if (i < 6)
98ffb8f3 1717 snprintf(name, 20, "%d", 1 << i);
cc372b17 1718 else
98ffb8f3 1719 snprintf(name, 20, ">=%d", 1 << i);
cc372b17
SL		 1720 json_object_add_value_float(tmp, (const char *)name, io_u_dist[i]);
1721 }
1722
ec3e3648
VF		 1723 /* Calc % distribution of submit IO depths */
1724 stat_calc_dist(ts->io_u_submit, ts->total_submit, io_u_dist);
1725 tmp = json_create_object();
1726 json_object_add_value_object(root, "iodepth_submit", tmp);
1727 /* Only show fixed 7 I/O depth levels*/
1728 for (i = 0; i < 7; i++) {
1729 char name[20];
1730 if (i == 0)
1731 snprintf(name, 20, "0");
1732 else if (i < 6)
1733 snprintf(name, 20, "%d", 1 << (i+1));
1734 else
1735 snprintf(name, 20, ">=%d", 1 << i);
1736 json_object_add_value_float(tmp, (const char *)name, io_u_dist[i]);
1737 }
1738
1739 /* Calc % distribution of completion IO depths */
1740 stat_calc_dist(ts->io_u_complete, ts->total_complete, io_u_dist);
1741 tmp = json_create_object();
1742 json_object_add_value_object(root, "iodepth_complete", tmp);
1743 /* Only show fixed 7 I/O depth levels*/
1744 for (i = 0; i < 7; i++) {
1745 char name[20];
1746 if (i == 0)
1747 snprintf(name, 20, "0");
1748 else if (i < 6)
1749 snprintf(name, 20, "%d", 1 << (i+1));
1750 else
1751 snprintf(name, 20, ">=%d", 1 << i);
1752 json_object_add_value_float(tmp, (const char *)name, io_u_dist[i]);
1753 }
1754
1755 /* Calc % distribution of nsecond, usecond, msecond latency */
1756 stat_calc_dist(ts->io_u_map, ddir_rw_sum(ts->total_io_u), io_u_dist);
1757 stat_calc_lat_n(ts, io_u_lat_n);
1758 stat_calc_lat_u(ts, io_u_lat_u);
1759 stat_calc_lat_m(ts, io_u_lat_m);
1760
d6bb626e 1761 /* Nanosecond latency */
cc372b17 1762 tmp = json_create_object();
d6bb626e
VF		 1763 json_object_add_value_object(root, "latency_ns", tmp);
1764 for (i = 0; i < FIO_IO_U_LAT_N_NR; i++) {
1765 const char *ranges[] = { "2", "4", "10", "20", "50", "100",
1766 "250", "500", "750", "1000", };
1767 json_object_add_value_float(tmp, ranges[i], io_u_lat_n[i]);
1768 }
cc372b17 1769 /* Microsecond latency */
d6bb626e
VF		 1770 tmp = json_create_object();
1771 json_object_add_value_object(root, "latency_us", tmp);
cc372b17
SL		 1772 for (i = 0; i < FIO_IO_U_LAT_U_NR; i++) {
1773 const char *ranges[] = { "2", "4", "10", "20", "50", "100",
1774 "250", "500", "750", "1000", };
1775 json_object_add_value_float(tmp, ranges[i], io_u_lat_u[i]);
1776 }
1777 /* Millisecond latency */
1778 tmp = json_create_object();
1779 json_object_add_value_object(root, "latency_ms", tmp);
1780 for (i = 0; i < FIO_IO_U_LAT_M_NR; i++) {
1781 const char *ranges[] = { "2", "4", "10", "20", "50", "100",
1782 "250", "500", "750", "1000", "2000",
1783 ">=2000", };
1784 json_object_add_value_float(tmp, ranges[i], io_u_lat_m[i]);
1785 }
1786
1787 /* Additional output if continue_on_error set - default off*/
1788 if (ts->continue_on_error) {
1789 json_object_add_value_int(root, "total_err", ts->total_err_count);
952b05e0 1790 json_object_add_value_int(root, "first_error", ts->first_error);
cc372b17
SL		 1791 }
1792
3e260a46
JA		 1793 if (ts->latency_depth) {
1794 json_object_add_value_int(root, "latency_depth", ts->latency_depth);
1795 json_object_add_value_int(root, "latency_target", ts->latency_target);
1796 json_object_add_value_float(root, "latency_percentile", ts->latency_percentile.u.f);
1797 json_object_add_value_int(root, "latency_window", ts->latency_window);
1798 }
1799
cc372b17
SL		 1800 /* Additional output if description is set */
1801 if (strlen(ts->description))
1802 json_object_add_value_string(root, "desc", ts->description);
1803
66347cfa
DE		 1804 if (ts->nr_block_infos) {
1805 /* Block error histogram and types */
1806 int len;
1807 unsigned int *percentiles = NULL;
1808 unsigned int block_state_counts[BLOCK_STATE_COUNT];
1809
1810 len = calc_block_percentiles(ts->nr_block_infos, ts->block_infos,
1811 ts->percentile_list,
1812 &percentiles, block_state_counts);
1813
1814 if (len) {
1815 struct json_object *block, *percentile_object, *states;
8a68c41c 1816 int state;
66347cfa
DE		 1817 block = json_create_object();
1818 json_object_add_value_object(root, "block", block);
1819
1820 percentile_object = json_create_object();
1821 json_object_add_value_object(block, "percentiles",
1822 percentile_object);
1823 for (i = 0; i < len; i++) {
1824 char buf[20];
1825 snprintf(buf, sizeof(buf), "%f",
1826 ts->percentile_list[i].u.f);
1827 json_object_add_value_int(percentile_object,
c0a6be6c 1828 buf,
66347cfa
DE		 1829 percentiles[i]);
1830 }
1831
1832 states = json_create_object();
1833 json_object_add_value_object(block, "states", states);
1834 for (state = 0; state < BLOCK_STATE_COUNT; state++) {
1835 json_object_add_value_int(states,
1836 block_state_names[state],
1837 block_state_counts[state]);
1838 }
1839 free(percentiles);
1840 }
1841 }
1842
bb49c8bd 1843 if (ts->ss_dur) {
ba8fb6f6
VF		 1844 struct json_object *data;
1845 struct json_array *iops, *bw;
a43f4461 1846 int j, k, l;
6da94b07 1847 char ss_buf[64];
16e56d25 1848
6da94b07 1849 snprintf(ss_buf, sizeof(ss_buf), "%s%s:%f%s",
c8caba48
JA		 1850 ts->ss_state & FIO_SS_IOPS ? "iops" : "bw",
1851 ts->ss_state & FIO_SS_SLOPE ? "_slope" : "",
bb49c8bd 1852 (float) ts->ss_limit.u.f,
c8caba48 1853 ts->ss_state & FIO_SS_PCT ? "%" : "");
16e56d25
VF		 1854
1855 tmp = json_create_object();
1856 json_object_add_value_object(root, "steadystate", tmp);
6da94b07 1857 json_object_add_value_string(tmp, "ss", ss_buf);
bb49c8bd 1858 json_object_add_value_int(tmp, "duration", (int)ts->ss_dur);
c8caba48 1859 json_object_add_value_int(tmp, "attained", (ts->ss_state & FIO_SS_ATTAINED) > 0);
6da94b07 1860
bb49c8bd 1861 snprintf(ss_buf, sizeof(ss_buf), "%f%s", (float) ts->ss_criterion.u.f,
c8caba48 1862 ts->ss_state & FIO_SS_PCT ? "%" : "");
6da94b07 1863 json_object_add_value_string(tmp, "criterion", ss_buf);
bb49c8bd
VF		 1864 json_object_add_value_float(tmp, "max_deviation", ts->ss_deviation.u.f);
1865 json_object_add_value_float(tmp, "slope", ts->ss_slope.u.f);
ba8fb6f6
VF		 1866
1867 data = json_create_object();
1868 json_object_add_value_object(tmp, "data", data);
1869 bw = json_create_array();
1870 iops = json_create_array();
412c7d91
VF		 1871
1872 /*
1873 ** if ss was attained or the buffer is not full,
1874 ** ss->head points to the first element in the list.
1875 ** otherwise it actually points to the second element
1876 ** in the list
1877 */
c8caba48 1878 if ((ts->ss_state & FIO_SS_ATTAINED) || !(ts->ss_state & FIO_SS_BUFFER_FULL))
bb49c8bd 1879 j = ts->ss_head;
412c7d91 1880 else
bb49c8bd 1881 j = ts->ss_head == 0 ? ts->ss_dur - 1 : ts->ss_head - 1;
a43f4461
JA		 1882 for (l = 0; l < ts->ss_dur; l++) {
1883 k = (j + l) % ts->ss_dur;
bb49c8bd
VF		 1884 json_array_add_value_int(bw, ts->ss_bw_data[k]);
1885 json_array_add_value_int(iops, ts->ss_iops_data[k]);
16e56d25 1886 }
bb49c8bd
VF		 1887 json_object_add_value_int(data, "bw_mean", steadystate_bw_mean(ts));
1888 json_object_add_value_int(data, "iops_mean", steadystate_iops_mean(ts));
6da94b07
VF		 1889 json_object_add_value_array(data, "iops", iops);
1890 json_object_add_value_array(data, "bw", bw);
16e56d25
VF		 1891 }
1892
cc372b17
SL		 1893 return root;
1894}
1895
4d658652 1896static void show_thread_status_terse(struct thread_stat *ts,
a666cab8
JA		 1897 struct group_run_stats *rs,
1898 struct buf_output *out)
4d658652 1899{
a2c95580 1900 if (terse_version >= 2 && terse_version <= 5)
bef2112b 1901 show_thread_status_terse_all(ts, rs, terse_version, out);
4d658652
JA		 1902 else
1903 log_err("fio: bad terse version!? %d\n", terse_version);
1904}
1905
952b05e0 1906struct json_object *show_thread_status(struct thread_stat *ts,
a666cab8 1907 struct group_run_stats *rs,
0279b880 1908 struct flist_head *opt_list,
a666cab8 1909 struct buf_output *out)
952b05e0 1910{
129fb2d4
JA		 1911 struct json_object *ret = NULL;
1912
1913 if (output_format & FIO_OUTPUT_TERSE)
a666cab8 1914 show_thread_status_terse(ts, rs, out);
129fb2d4 1915 if (output_format & FIO_OUTPUT_JSON)
0279b880 1916 ret = show_thread_status_json(ts, rs, opt_list);
129fb2d4 1917 if (output_format & FIO_OUTPUT_NORMAL)
a666cab8 1918 show_thread_status_normal(ts, rs, out);
129fb2d4
JA		 1919
1920 return ret;
952b05e0
CF		 1921}
1922
70750d6a 1923static void __sum_stat(struct io_stat *dst, struct io_stat *src, bool first)
756867bd
JA		 1924{
1925 double mean, S;
1926
1927 dst->min_val = min(dst->min_val, src->min_val);
1928 dst->max_val = max(dst->max_val, src->max_val);
756867bd
JA		 1929
1930 /*
cdcac5cf
YH		 1931 * Compute new mean and S after the merge
1932 * <http://en.wikipedia.org/wiki/Algorithms_for_calculating_variance
1933 * #Parallel_algorithm>
756867bd 1934 */
fd595830 1935 if (first) {
802ad4a8
JA		 1936 mean = src->mean.u.f;
1937 S = src->S.u.f;
756867bd 1938 } else {
802ad4a8 1939 double delta = src->mean.u.f - dst->mean.u.f;
cdcac5cf 1940
802ad4a8
JA		 1941 mean = ((src->mean.u.f * src->samples) +
1942 (dst->mean.u.f * dst->samples)) /
cdcac5cf
YH		 1943 (dst->samples + src->samples);
1944
802ad4a8 1945 S = src->S.u.f + dst->S.u.f + pow(delta, 2.0) *
cdcac5cf
YH		 1946 (dst->samples * src->samples) /
1947 (dst->samples + src->samples);
756867bd
JA		 1948 }
1949
cdcac5cf 1950 dst->samples += src->samples;
802ad4a8
JA		 1951 dst->mean.u.f = mean;
1952 dst->S.u.f = S;
70750d6a
JA		 1953
1954}
1955
1956/*
1957 * We sum two kinds of stats - one that is time based, in which case we
1958 * apply the proper summing technique, and then one that is iops/bw
1959 * numbers. For group_reporting, we should just add those up, not make
1960 * them the mean of everything.
1961 */
016869be 1962static void sum_stat(struct io_stat *dst, struct io_stat *src, bool pure_sum)
70750d6a 1963{
016869be
NC		 1964 bool first = dst->samples == 0;
1965
70750d6a
JA		 1966 if (src->samples == 0)
1967 return;
1968
1969 if (!pure_sum) {
1970 __sum_stat(dst, src, first);
1971 return;
1972 }
1973
68afa5b5
JA		 1974 if (first) {
1975 dst->min_val = src->min_val;
1976 dst->max_val = src->max_val;
1977 dst->samples = src->samples;
1978 dst->mean.u.f = src->mean.u.f;
1979 dst->S.u.f = src->S.u.f;
1980 } else {
1981 dst->min_val += src->min_val;
1982 dst->max_val += src->max_val;
1983 dst->samples += src->samples;
1984 dst->mean.u.f += src->mean.u.f;
1985 dst->S.u.f += src->S.u.f;
1986 }
756867bd
JA		 1987}
1988
37f0c1ae
JA		 1989void sum_group_stats(struct group_run_stats *dst, struct group_run_stats *src)
1990{
1991 int i;
1992
6eaf09d6 1993 for (i = 0; i < DDIR_RWDIR_CNT; i++) {
37f0c1ae
JA		 1994 if (dst->max_run[i] < src->max_run[i])
1995 dst->max_run[i] = src->max_run[i];
1996 if (dst->min_run[i] && dst->min_run[i] > src->min_run[i])
1997 dst->min_run[i] = src->min_run[i];
1998 if (dst->max_bw[i] < src->max_bw[i])
1999 dst->max_bw[i] = src->max_bw[i];
2000 if (dst->min_bw[i] && dst->min_bw[i] > src->min_bw[i])
2001 dst->min_bw[i] = src->min_bw[i];
2002
af7f87cb 2003 dst->iobytes[i] += src->iobytes[i];
37f0c1ae
JA		 2004 dst->agg[i] += src->agg[i];
2005 }
2006
dbae1bd6
JA		 2007 if (!dst->kb_base)
2008 dst->kb_base = src->kb_base;
2009 if (!dst->unit_base)
2010 dst->unit_base = src->unit_base;
18aa1998
JF		 2011 if (!dst->sig_figs)
2012 dst->sig_figs = src->sig_figs;
37f0c1ae
JA		 2013}
2014
016869be 2015void sum_thread_stats(struct thread_stat *dst, struct thread_stat *src)
5b9babb7 2016{
df8781b6 2017 int k, l, m;
5b9babb7 2018
6eaf09d6 2019 for (l = 0; l < DDIR_RWDIR_CNT; l++) {
6dc75062 2020 if (dst->unified_rw_rep != UNIFIED_MIXED) {
016869be
NC		 2021 sum_stat(&dst->clat_stat[l], &src->clat_stat[l], false);
2022 sum_stat(&dst->clat_high_prio_stat[l], &src->clat_high_prio_stat[l], false);
2023 sum_stat(&dst->clat_low_prio_stat[l], &src->clat_low_prio_stat[l], false);
2024 sum_stat(&dst->slat_stat[l], &src->slat_stat[l], false);
2025 sum_stat(&dst->lat_stat[l], &src->lat_stat[l], false);
2026 sum_stat(&dst->bw_stat[l], &src->bw_stat[l], true);
2027 sum_stat(&dst->iops_stat[l], &src->iops_stat[l], true);
771e58be
JA		 2028
2029 dst->io_bytes[l] += src->io_bytes[l];
2030
2031 if (dst->runtime[l] < src->runtime[l])
2032 dst->runtime[l] = src->runtime[l];
2033 } else {
016869be
NC		 2034 sum_stat(&dst->clat_stat[0], &src->clat_stat[l], false);
2035 sum_stat(&dst->clat_high_prio_stat[0], &src->clat_high_prio_stat[l], false);
2036 sum_stat(&dst->clat_low_prio_stat[0], &src->clat_low_prio_stat[l], false);
2037 sum_stat(&dst->slat_stat[0], &src->slat_stat[l], false);
2038 sum_stat(&dst->lat_stat[0], &src->lat_stat[l], false);
2039 sum_stat(&dst->bw_stat[0], &src->bw_stat[l], true);
2040 sum_stat(&dst->iops_stat[0], &src->iops_stat[l], true);
771e58be
JA		 2041
2042 dst->io_bytes[0] += src->io_bytes[l];
2043
2044 if (dst->runtime[0] < src->runtime[l])
2045 dst->runtime[0] = src->runtime[l];
2046 }
5b9babb7
JA		 2047 }
2048
016869be 2049 sum_stat(&dst->sync_stat, &src->sync_stat, false);
5b9babb7
JA		 2050 dst->usr_time += src->usr_time;
2051 dst->sys_time += src->sys_time;
2052 dst->ctx += src->ctx;
2053 dst->majf += src->majf;
2054 dst->minf += src->minf;
2055
b2b3eefe 2056 for (k = 0; k < FIO_IO_U_MAP_NR; k++) {
5b9babb7 2057 dst->io_u_map[k] += src->io_u_map[k];
5b9babb7 2058 dst->io_u_submit[k] += src->io_u_submit[k];
5b9babb7 2059 dst->io_u_complete[k] += src->io_u_complete[k];
b2b3eefe 2060 }
bf14b39e
VF		 2061
2062 for (k = 0; k < FIO_IO_U_LAT_N_NR; k++)
d6bb626e 2063 dst->io_u_lat_n[k] += src->io_u_lat_n[k];
bf14b39e 2064 for (k = 0; k < FIO_IO_U_LAT_U_NR; k++)
5b9babb7 2065 dst->io_u_lat_u[k] += src->io_u_lat_u[k];
bf14b39e 2066 for (k = 0; k < FIO_IO_U_LAT_M_NR; k++)
5b9babb7 2067 dst->io_u_lat_m[k] += src->io_u_lat_m[k];
bf14b39e 2068
6eaf09d6 2069 for (k = 0; k < DDIR_RWDIR_CNT; k++) {
6dc75062 2070 if (dst->unified_rw_rep != UNIFIED_MIXED) {
771e58be
JA		 2071 dst->total_io_u[k] += src->total_io_u[k];
2072 dst->short_io_u[k] += src->short_io_u[k];
3bcb9d94 2073 dst->drop_io_u[k] += src->drop_io_u[k];
771e58be
JA		 2074 } else {
2075 dst->total_io_u[0] += src->total_io_u[k];
2076 dst->short_io_u[0] += src->short_io_u[k];
3bcb9d94 2077 dst->drop_io_u[0] += src->drop_io_u[k];
771e58be 2078 }
5b9babb7
JA		 2079 }
2080
7f3ecee2
JA		 2081 dst->total_io_u[DDIR_SYNC] += src->total_io_u[DDIR_SYNC];
2082
df8781b6
VF		 2083 for (k = 0; k < FIO_LAT_CNT; k++)
2084 for (l = 0; l < DDIR_RWDIR_CNT; l++)
2085 for (m = 0; m < FIO_IO_U_PLAT_NR; m++)
6dc75062 2086 if (dst->unified_rw_rep != UNIFIED_MIXED)
df8781b6
VF		 2087 dst->io_u_plat[k][l][m] += src->io_u_plat[k][l][m];
2088 else
2089 dst->io_u_plat[k][0][m] += src->io_u_plat[k][l][m];
771e58be 2090
df8781b6
VF		 2091 for (k = 0; k < FIO_IO_U_PLAT_NR; k++)
2092 dst->io_u_sync_plat[k] += src->io_u_sync_plat[k];
2093
2094 for (k = 0; k < DDIR_RWDIR_CNT; k++) {
771e58be 2095 for (m = 0; m < FIO_IO_U_PLAT_NR; m++) {
6dc75062 2096 if (dst->unified_rw_rep != UNIFIED_MIXED) {
b2a432bf 2097 dst->io_u_plat_high_prio[k][m] += src->io_u_plat_high_prio[k][m];
efd78265 2098 dst->io_u_plat_low_prio[k][m] += src->io_u_plat_low_prio[k][m];
b2a432bf 2099 } else {
b2a432bf 2100 dst->io_u_plat_high_prio[0][m] += src->io_u_plat_high_prio[k][m];
efd78265 2101 dst->io_u_plat_low_prio[0][m] += src->io_u_plat_low_prio[k][m];
b2a432bf
PC		 2102 }
2103
771e58be 2104 }
5b9babb7
JA		 2105 }
2106
2107 dst->total_run_time += src->total_run_time;
2108 dst->total_submit += src->total_submit;
2109 dst->total_complete += src->total_complete;
fd5d733f 2110 dst->nr_zone_resets += src->nr_zone_resets;
96563db9
JA		 2111 dst->cachehit += src->cachehit;
2112 dst->cachemiss += src->cachemiss;
5b9babb7
JA		 2113}
2114
37f0c1ae
JA		 2115void init_group_run_stat(struct group_run_stats *gs)
2116{
6eaf09d6 2117 int i;
37f0c1ae 2118 memset(gs, 0, sizeof(*gs));
6eaf09d6
SL		 2119
2120 for (i = 0; i < DDIR_RWDIR_CNT; i++)
2121 gs->min_bw[i] = gs->min_run[i] = ~0UL;
37f0c1ae
JA		 2122}
2123
6619fc32 2124void init_thread_stat_min_vals(struct thread_stat *ts)
37f0c1ae 2125{
6619fc32
NC		 2126 int i;
2127
2128 for (i = 0; i < DDIR_RWDIR_CNT; i++) {
2129 ts->clat_stat[i].min_val = ULONG_MAX;
2130 ts->slat_stat[i].min_val = ULONG_MAX;
2131 ts->lat_stat[i].min_val = ULONG_MAX;
2132 ts->bw_stat[i].min_val = ULONG_MAX;
2133 ts->iops_stat[i].min_val = ULONG_MAX;
2134 ts->clat_high_prio_stat[i].min_val = ULONG_MAX;
2135 ts->clat_low_prio_stat[i].min_val = ULONG_MAX;
2136 }
2137 ts->sync_stat.min_val = ULONG_MAX;
2138}
37f0c1ae 2139
6619fc32
NC		 2140void init_thread_stat(struct thread_stat *ts)
2141{
37f0c1ae
JA		 2142 memset(ts, 0, sizeof(*ts));
2143
6619fc32 2144 init_thread_stat_min_vals(ts);
37f0c1ae
JA		 2145 ts->groupid = -1;
2146}
2147
83f7b64e 2148void __show_run_stats(void)
3c39a379
JA		 2149{
2150 struct group_run_stats *runstats, *rs;
2151 struct thread_data *td;
756867bd 2152 struct thread_stat *threadstats, *ts;
4da24b69 2153 int i, j, k, nr_ts, last_ts, idx;
8985b491
JA		 2154 bool kb_base_warned = false;
2155 bool unit_base_warned = false;
cc372b17
SL		 2156 struct json_object *root = NULL;
2157 struct json_array *array = NULL;
a666cab8 2158 struct buf_output output[FIO_OUTPUT_NR];
66e19a38 2159 struct flist_head **opt_lists;
a666cab8 2160
3c39a379
JA		 2161 runstats = malloc(sizeof(struct group_run_stats) * (groupid + 1));
2162
37f0c1ae
JA		 2163 for (i = 0; i < groupid + 1; i++)
2164 init_group_run_stat(&runstats[i]);
3c39a379 2165
756867bd
JA		 2166 /*
2167 * find out how many threads stats we need. if group reporting isn't
2168 * enabled, it's one-per-td.
2169 */
2170 nr_ts = 0;
2171 last_ts = -1;
2172 for_each_td(td, i) {
2dc1bbeb 2173 if (!td->o.group_reporting) {
756867bd
JA		 2174 nr_ts++;
2175 continue;
2176 }
2177 if (last_ts == td->groupid)
2178 continue;
8243be59
JA		 2179 if (!td->o.stats)
2180 continue;
756867bd
JA		 2181
2182 last_ts = td->groupid;
2183 nr_ts++;
2184 }
2185
2186 threadstats = malloc(nr_ts * sizeof(struct thread_stat));
66e19a38 2187 opt_lists = malloc(nr_ts * sizeof(struct flist_head *));
756867bd 2188
66e19a38 2189 for (i = 0; i < nr_ts; i++) {
37f0c1ae 2190 init_thread_stat(&threadstats[i]);
66e19a38
JA		 2191 opt_lists[i] = NULL;
2192 }
756867bd
JA		 2193
2194 j = 0;
2195 last_ts = -1;
197574e4 2196 idx = 0;
34572e28 2197 for_each_td(td, i) {
8243be59
JA		 2198 if (!td->o.stats)
2199 continue;
2dc1bbeb
JA		 2200 if (idx && (!td->o.group_reporting ||
2201 (td->o.group_reporting && last_ts != td->groupid))) {
7abd0e3a
JA		 2202 idx = 0;
2203 j++;
2204 }
2205
2206 last_ts = td->groupid;
2207
756867bd
JA		 2208 ts = &threadstats[j];
2209
83349190 2210 ts->clat_percentiles = td->o.clat_percentiles;
b599759b 2211 ts->lat_percentiles = td->o.lat_percentiles;
56440e63 2212 ts->slat_percentiles = td->o.slat_percentiles;
435d195a 2213 ts->percentile_precision = td->o.percentile_precision;
fd112d34 2214 memcpy(ts->percentile_list, td->o.percentile_list, sizeof(td->o.percentile_list));
66e19a38 2215 opt_lists[j] = &td->opt_list;
83349190 2216
197574e4 2217 idx++;
6586ee89 2218 ts->members++;
756867bd 2219
7abd0e3a 2220 if (ts->groupid == -1) {
2dc84ba7
JA		 2221 /*
2222 * These are per-group shared already
2223 */
36833fb0 2224 snprintf(ts->name, sizeof(ts->name), "%s", td->o.name);
a64e88da 2225 if (td->o.description)
36833fb0
BVA		 2226 snprintf(ts->description,
2227 sizeof(ts->description), "%s",
2228 td->o.description);
a64e88da 2229 else
4e59d0f3 2230 memset(ts->description, 0, FIO_JOBDESC_SIZE);
a64e88da 2231
2f122b13
JA		 2232 /*
2233 * If multiple entries in this group, this is
2234 * the first member.
2235 */
2236 ts->thread_number = td->thread_number;
756867bd 2237 ts->groupid = td->groupid;
2dc84ba7
JA		 2238
2239 /*
2240 * first pid in group, not very useful...
2241 */
756867bd 2242 ts->pid = td->pid;
90fef2d1
JA		 2243
2244 ts->kb_base = td->o.kb_base;
ad705bcb 2245 ts->unit_base = td->o.unit_base;
e883cb35 2246 ts->sig_figs = td->o.sig_figs;
771e58be 2247 ts->unified_rw_rep = td->o.unified_rw_rep;
90fef2d1
JA		 2248 } else if (ts->kb_base != td->o.kb_base && !kb_base_warned) {
2249 log_info("fio: kb_base differs for jobs in group, using"
2250 " %u as the base\n", ts->kb_base);
8985b491 2251 kb_base_warned = true;
ad705bcb
SN		 2252 } else if (ts->unit_base != td->o.unit_base && !unit_base_warned) {
2253 log_info("fio: unit_base differs for jobs in group, using"
2254 " %u as the base\n", ts->unit_base);
8985b491 2255 unit_base_warned = true;
2dc84ba7
JA		 2256 }
2257
f2bba182
RR		 2258 ts->continue_on_error = td->o.continue_on_error;
2259 ts->total_err_count += td->total_err_count;
2260 ts->first_error = td->first_error;
2261 if (!ts->error) {
2262 if (!td->error && td->o.continue_on_error &&
2263 td->first_error) {
2264 ts->error = td->first_error;
36833fb0
BVA		 2265 snprintf(ts->verror, sizeof(ts->verror), "%s",
2266 td->verror);
f2bba182
RR		 2267 } else if (td->error) {
2268 ts->error = td->error;
36833fb0
BVA		 2269 snprintf(ts->verror, sizeof(ts->verror), "%s",
2270 td->verror);
f2bba182 2271 }
756867bd
JA		 2272 }
2273
3e260a46
JA		 2274 ts->latency_depth = td->latency_qd;
2275 ts->latency_target = td->o.latency_target;
2276 ts->latency_percentile = td->o.latency_percentile;
2277 ts->latency_window = td->o.latency_window;
2278
0e4dd95c 2279 ts->nr_block_infos = td->ts.nr_block_infos;
4da24b69
JA		 2280 for (k = 0; k < ts->nr_block_infos; k++)
2281 ts->block_infos[k] = td->ts.block_infos[k];
0e4dd95c 2282
016869be 2283 sum_thread_stats(ts, &td->ts);
16e56d25 2284
bb49c8bd
VF		 2285 if (td->o.ss_dur) {
2286 ts->ss_state = td->ss.state;
2287 ts->ss_dur = td->ss.dur;
2288 ts->ss_head = td->ss.head;
bb49c8bd
VF		 2289 ts->ss_bw_data = td->ss.bw_data;
2290 ts->ss_iops_data = td->ss.iops_data;
2291 ts->ss_limit.u.f = td->ss.limit;
2292 ts->ss_slope.u.f = td->ss.slope;
2293 ts->ss_deviation.u.f = td->ss.deviation;
2294 ts->ss_criterion.u.f = td->ss.criterion;
2295 }
16e56d25 2296 else
bb49c8bd 2297 ts->ss_dur = ts->ss_state = 0;
756867bd
JA		 2298 }
2299
2300 for (i = 0; i < nr_ts; i++) {
94370ac4 2301 unsigned long long bw;
3c39a379 2302
756867bd 2303 ts = &threadstats[i];
dedb88eb
JA		 2304 if (ts->groupid == -1)
2305 continue;
756867bd 2306 rs = &runstats[ts->groupid];
90fef2d1 2307 rs->kb_base = ts->kb_base;
ad705bcb 2308 rs->unit_base = ts->unit_base;
e883cb35 2309 rs->sig_figs = ts->sig_figs;
5cb8a8cd 2310 rs->unified_rw_rep |= ts->unified_rw_rep;
3c39a379 2311
6eaf09d6 2312 for (j = 0; j < DDIR_RWDIR_CNT; j++) {
94370ac4
JA		 2313 if (!ts->runtime[j])
2314 continue;
2315 if (ts->runtime[j] < rs->min_run[j] || !rs->min_run[j])
2316 rs->min_run[j] = ts->runtime[j];
2317 if (ts->runtime[j] > rs->max_run[j])
2318 rs->max_run[j] = ts->runtime[j];
2319
2320 bw = 0;
af7f87cb
RE		 2321 if (ts->runtime[j])
2322 bw = ts->io_bytes[j] * 1000 / ts->runtime[j];
94370ac4
JA		 2323 if (bw < rs->min_bw[j])
2324 rs->min_bw[j] = bw;
2325 if (bw > rs->max_bw[j])
2326 rs->max_bw[j] = bw;
2327
af7f87cb 2328 rs->iobytes[j] += ts->io_bytes[j];
94370ac4 2329 }
3c39a379
JA		 2330 }
2331
2332 for (i = 0; i < groupid + 1; i++) {
6eaf09d6
SL		 2333 int ddir;
2334
3c39a379
JA		 2335 rs = &runstats[i];
2336
6eaf09d6
SL		 2337 for (ddir = 0; ddir < DDIR_RWDIR_CNT; ddir++) {
2338 if (rs->max_run[ddir])
af7f87cb 2339 rs->agg[ddir] = (rs->iobytes[ddir] * 1000) /
6eaf09d6
SL		 2340 rs->max_run[ddir];
2341 }
3c39a379
JA		 2342 }
2343
a666cab8 2344 for (i = 0; i < FIO_OUTPUT_NR; i++)
e250c0a9 2345 buf_output_init(&output[i]);
a666cab8 2346
3c39a379
JA		 2347 /*
2348 * don't overwrite last signal output
2349 */
129fb2d4 2350 if (output_format & FIO_OUTPUT_NORMAL)
a666cab8 2351 log_buf(&output[__FIO_OUTPUT_NORMAL], "\n");
129fb2d4 2352 if (output_format & FIO_OUTPUT_JSON) {
66e19a38 2353 struct thread_data *global;
35326842 2354 char time_buf[32];
aa7d2ef0
RH		 2355 struct timeval now;
2356 unsigned long long ms_since_epoch;
afd74e2a 2357 time_t tv_sec;
91e53870 2358
aa7d2ef0
RH		 2359 gettimeofday(&now, NULL);
2360 ms_since_epoch = (unsigned long long)(now.tv_sec) * 1000 +
2361 (unsigned long long)(now.tv_usec) / 1000;
2362
afd74e2a
BVA		 2363 tv_sec = now.tv_sec;
2364 os_ctime_r(&tv_sec, time_buf, sizeof(time_buf));
1d272416
JA		 2365 if (time_buf[strlen(time_buf) - 1] == '\n')
2366 time_buf[strlen(time_buf) - 1] = '\0';
91e53870 2367
cc372b17
SL		 2368 root = json_create_object();
2369 json_object_add_value_string(root, "fio version", fio_version_string);
aa7d2ef0
RH		 2370 json_object_add_value_int(root, "timestamp", now.tv_sec);
2371 json_object_add_value_int(root, "timestamp_ms", ms_since_epoch);
91e53870 2372 json_object_add_value_string(root, "time", time_buf);
66e19a38 2373 global = get_global_options();
0cf542af 2374 json_add_job_opts(root, "global options", &global->opt_list);
cc372b17
SL		 2375 array = json_create_array();
2376 json_object_add_value_array(root, "jobs", array);
2377 }
3c39a379 2378
0279b880
JA		 2379 if (is_backend)
2380 fio_server_send_job_options(&get_global_options()->opt_list, -1U);
2381
756867bd
JA		 2382 for (i = 0; i < nr_ts; i++) {
2383 ts = &threadstats[i];
2384 rs = &runstats[ts->groupid];
3c39a379 2385
0279b880
JA		 2386 if (is_backend) {
2387 fio_server_send_job_options(opt_lists[i], i);
a64e88da 2388 fio_server_send_ts(ts, rs);
0279b880 2389 } else {
129fb2d4 2390 if (output_format & FIO_OUTPUT_TERSE)
a666cab8 2391 show_thread_status_terse(ts, rs, &output[__FIO_OUTPUT_TERSE]);
129fb2d4 2392 if (output_format & FIO_OUTPUT_JSON) {
66e19a38 2393 struct json_object *tmp = show_thread_status_json(ts, rs, opt_lists[i]);
129fb2d4
JA		 2394 json_array_add_value_object(array, tmp);
2395 }
2396 if (output_format & FIO_OUTPUT_NORMAL)
a666cab8 2397 show_thread_status_normal(ts, rs, &output[__FIO_OUTPUT_NORMAL]);
129fb2d4 2398 }
3c39a379 2399 }
ab34ddd1 2400 if (!is_backend && (output_format & FIO_OUTPUT_JSON)) {
cc372b17 2401 /* disk util stats, if any */
a666cab8 2402 show_disk_util(1, root, &output[__FIO_OUTPUT_JSON]);
cc372b17 2403
a666cab8 2404 show_idle_prof_stats(FIO_OUTPUT_JSON, root, &output[__FIO_OUTPUT_JSON]);
f2a2ce0e 2405
a666cab8
JA		 2406 json_print_object(root, &output[__FIO_OUTPUT_JSON]);
2407 log_buf(&output[__FIO_OUTPUT_JSON], "\n");
cc372b17
SL		 2408 json_free_object(root);
2409 }
3c39a379 2410
72c27ff8
JA		 2411 for (i = 0; i < groupid + 1; i++) {
2412 rs = &runstats[i];
3c39a379 2413
72c27ff8 2414 rs->groupid = i;
d09a64a0 2415 if (is_backend)
72c27ff8 2416 fio_server_send_gs(rs);
129fb2d4 2417 else if (output_format & FIO_OUTPUT_NORMAL)
a666cab8 2418 show_group_stats(rs, &output[__FIO_OUTPUT_NORMAL]);
c6ae0a5b 2419 }
eecf272f 2420
72c27ff8
JA		 2421 if (is_backend)
2422 fio_server_send_du();
129fb2d4 2423 else if (output_format & FIO_OUTPUT_NORMAL) {
a666cab8
JA		 2424 show_disk_util(0, NULL, &output[__FIO_OUTPUT_NORMAL]);
2425 show_idle_prof_stats(FIO_OUTPUT_NORMAL, NULL, &output[__FIO_OUTPUT_NORMAL]);
60904003 2426 }
f2a2ce0e 2427
3d57c0e9 2428 for (i = 0; i < FIO_OUTPUT_NR; i++) {
3dc3aa41 2429 struct buf_output *out = &output[i];
8dd0eca3 2430
3dc3aa41 2431 log_info_buf(out->buf, out->buflen);
3dc3aa41 2432 buf_output_free(out);
3d57c0e9 2433 }
2b8c71b0 2434
7ceefc09
FS		 2435 fio_idle_prof_cleanup();
2436
fdd5f15f 2437 log_info_flush();
eecf272f 2438 free(runstats);
756867bd 2439 free(threadstats);
66e19a38 2440 free(opt_lists);
3c39a379
JA		 2441}
2442
966f8ef9 2443int __show_running_run_stats(void)
b852e7cf
JA		 2444{
2445 struct thread_data *td;
2446 unsigned long long *rt;
8b6a404c 2447 struct timespec ts;
b852e7cf
JA		 2448 int i;
2449
971caeb1 2450 fio_sem_down(stat_sem);
90811930 2451
b852e7cf 2452 rt = malloc(thread_number * sizeof(unsigned long long));
8b6a404c 2453 fio_gettime(&ts, NULL);
b852e7cf
JA		 2454
2455 for_each_td(td, i) {
c97f1ad6 2456 td->update_rusage = 1;
dde39f8c
AD		 2457 for_each_rw_ddir(ddir) {
2458 td->ts.io_bytes[ddir] = td->io_bytes[ddir];
2459 }
8b6a404c 2460 td->ts.total_run_time = mtime_since(&td->epoch, &ts);
6c041a88 2461
8b6a404c 2462 rt[i] = mtime_since(&td->start, &ts);
6c041a88 2463 if (td_read(td) && td->ts.io_bytes[DDIR_READ])
2464 td->ts.runtime[DDIR_READ] += rt[i];
2465 if (td_write(td) && td->ts.io_bytes[DDIR_WRITE])
2466 td->ts.runtime[DDIR_WRITE] += rt[i];
2467 if (td_trim(td) && td->ts.io_bytes[DDIR_TRIM])
2468 td->ts.runtime[DDIR_TRIM] += rt[i];
b852e7cf
JA		 2469 }
2470
c97f1ad6 2471 for_each_td(td, i) {
fda2cfac
JA		 2472 if (td->runstate >= TD_EXITED)
2473 continue;
c97f1ad6
JA		 2474 if (td->rusage_sem) {
2475 td->update_rusage = 1;
971caeb1 2476 fio_sem_down(td->rusage_sem);
c97f1ad6
JA		 2477 }
2478 td->update_rusage = 0;
2479 }
2480
cef9175e 2481 __show_run_stats();
b852e7cf
JA		 2482
2483 for_each_td(td, i) {
6c041a88 2484 if (td_read(td) && td->ts.io_bytes[DDIR_READ])
b852e7cf 2485 td->ts.runtime[DDIR_READ] -= rt[i];
6c041a88 2486 if (td_write(td) && td->ts.io_bytes[DDIR_WRITE])
b852e7cf 2487 td->ts.runtime[DDIR_WRITE] -= rt[i];
6c041a88 2488 if (td_trim(td) && td->ts.io_bytes[DDIR_TRIM])
6eaf09d6 2489 td->ts.runtime[DDIR_TRIM] -= rt[i];
b852e7cf
JA		 2490 }
2491
2492 free(rt);
971caeb1 2493 fio_sem_up(stat_sem);
966f8ef9
BVA		 2494
2495 return 0;
b852e7cf
JA		 2496}
2497
8985b491 2498static bool status_file_disabled;
06464907 2499
dac45f23 2500#define FIO_STATUS_FILE "fio-dump-status"
06464907
JA		 2501
2502static int check_status_file(void)
2503{
2504 struct stat sb;
a0bafb7d
BC		 2505 const char *temp_dir;
2506 char fio_status_file_path[PATH_MAX];
06464907 2507
77d99675
JA		 2508 if (status_file_disabled)
2509 return 0;
2510
a0bafb7d 2511 temp_dir = getenv("TMPDIR");
48b16e27 2512 if (temp_dir == NULL) {
a0bafb7d 2513 temp_dir = getenv("TEMP");
48b16e27
JA		 2514 if (temp_dir && strlen(temp_dir) >= PATH_MAX)
2515 temp_dir = NULL;
2516 }
a0bafb7d
BC		 2517 if (temp_dir == NULL)
2518 temp_dir = "/tmp";
3544731c
BVA		 2519#ifdef __COVERITY__
2520 __coverity_tainted_data_sanitize__(temp_dir);
2521#endif
a0bafb7d
BC		 2522
2523 snprintf(fio_status_file_path, sizeof(fio_status_file_path), "%s/%s", temp_dir, FIO_STATUS_FILE);
2524
2525 if (stat(fio_status_file_path, &sb))
06464907
JA		 2526 return 0;
2527
77d99675
JA		 2528 if (unlink(fio_status_file_path) < 0) {
2529 log_err("fio: failed to unlink %s: %s\n", fio_status_file_path,
2530 strerror(errno));
2531 log_err("fio: disabling status file updates\n");
8985b491 2532 status_file_disabled = true;
77d99675
JA		 2533 }
2534
06464907
JA		 2535 return 1;
2536}
2537
2538void check_for_running_stats(void)
2539{
06464907
JA		 2540 if (check_status_file()) {
2541 show_running_run_stats();
2542 return;
2543 }
2544}
2545
d6bb626e 2546static inline void add_stat_sample(struct io_stat *is, unsigned long long data)
3c39a379 2547{
68704084 2548 double val = data;
6660cc67 2549 double delta;
68704084
JA		 2550
2551 if (data > is->max_val)
2552 is->max_val = data;
2553 if (data < is->min_val)
2554 is->min_val = data;
2555
802ad4a8 2556 delta = val - is->mean.u.f;
ef11d737 2557 if (delta) {
802ad4a8
JA		 2558 is->mean.u.f += delta / (is->samples + 1.0);
2559 is->S.u.f += delta * (val - is->mean.u.f);
ef11d737 2560 }
3c39a379 2561
3c39a379
JA		 2562 is->samples++;
2563}
2564
7e419452
JA		 2565/*
2566 * Return a struct io_logs, which is added to the tail of the log
2567 * list for 'iolog'.
2568 */
2569static struct io_logs *get_new_log(struct io_log *iolog)
2570{
0a852a50 2571 size_t new_samples;
7e419452
JA		 2572 struct io_logs *cur_log;
2573
2574 /*
2575 * Cap the size at MAX_LOG_ENTRIES, so we don't keep doubling
2576 * forever
2577 */
0a852a50
DLM		 2578 if (!iolog->cur_log_max) {
2579 new_samples = iolog->td->o.log_entries;
2580 } else {
7e419452
JA		 2581 new_samples = iolog->cur_log_max * 2;
2582 if (new_samples > MAX_LOG_ENTRIES)
2583 new_samples = MAX_LOG_ENTRIES;
2584 }
2585
90d2d53f 2586 cur_log = smalloc(sizeof(*cur_log));
7e419452
JA		 2587 if (cur_log) {
2588 INIT_FLIST_HEAD(&cur_log->list);
0a852a50 2589 cur_log->log = calloc(new_samples, log_entry_sz(iolog));
7e419452
JA		 2590 if (cur_log->log) {
2591 cur_log->nr_samples = 0;
2592 cur_log->max_samples = new_samples;
2593 flist_add_tail(&cur_log->list, &iolog->io_logs);
2594 iolog->cur_log_max = new_samples;
2595 return cur_log;
2596 }
90d2d53f 2597 sfree(cur_log);
7e419452
JA		 2598 }
2599
2600 return NULL;
2601}
2602
1fed2080
JA		 2603/*
2604 * Add and return a new log chunk, or return current log if big enough
2605 */
2606static struct io_logs *regrow_log(struct io_log *iolog)
7e419452
JA		 2607{
2608 struct io_logs *cur_log;
1fed2080 2609 int i;
7e419452 2610
1fed2080 2611 if (!iolog || iolog->disabled)
2ab71dc4 2612 goto disable;
7e419452 2613
1fed2080 2614 cur_log = iolog_cur_log(iolog);
a9afa45a
JA		 2615 if (!cur_log) {
2616 cur_log = get_new_log(iolog);
2617 if (!cur_log)
2618 return NULL;
2619 }
2620
7e419452
JA		 2621 if (cur_log->nr_samples < cur_log->max_samples)
2622 return cur_log;
2623
2624 /*
2625 * No room for a new sample. If we're compressing on the fly, flush
2626 * out the current chunk
2627 */
2628 if (iolog->log_gz) {
2629 if (iolog_cur_flush(iolog, cur_log)) {
2630 log_err("fio: failed flushing iolog! Will stop logging.\n");
2631 return NULL;
2632 }
2633 }
2634
2635 /*
2636 * Get a new log array, and add to our list
2637 */
2638 cur_log = get_new_log(iolog);
1fed2080
JA		 2639 if (!cur_log) {
2640 log_err("fio: failed extending iolog! Will stop logging.\n");
2641 return NULL;
2642 }
2643
2644 if (!iolog->pending || !iolog->pending->nr_samples)
80a24ba9 2645 return cur_log;
7e419452 2646
1fed2080
JA		 2647 /*
2648 * Flush pending items to new log
2649 */
2650 for (i = 0; i < iolog->pending->nr_samples; i++) {
2651 struct io_sample *src, *dst;
2652
2653 src = get_sample(iolog, iolog->pending, i);
2654 dst = get_sample(iolog, cur_log, i);
2655 memcpy(dst, src, log_entry_sz(iolog));
2656 }
0b2eef49 2657 cur_log->nr_samples = iolog->pending->nr_samples;
1fed2080
JA		 2658
2659 iolog->pending->nr_samples = 0;
2660 return cur_log;
2ab71dc4
JA		 2661disable:
2662 if (iolog)
2663 iolog->disabled = true;
2664 return NULL;
1fed2080
JA		 2665}
2666
2667void regrow_logs(struct thread_data *td)
2668{
2ab71dc4
JA		 2669 regrow_log(td->slat_log);
2670 regrow_log(td->clat_log);
1e613c9c 2671 regrow_log(td->clat_hist_log);
2ab71dc4
JA		 2672 regrow_log(td->lat_log);
2673 regrow_log(td->bw_log);
2674 regrow_log(td->iops_log);
1fed2080
JA		 2675 td->flags &= ~TD_F_REGROW_LOGS;
2676}
2677
76204de3
PM		 2678void regrow_agg_logs(void)
2679{
2680 enum fio_ddir ddir;
2681
2682 for (ddir = 0; ddir < DDIR_RWDIR_CNT; ddir++)
2683 regrow_log(agg_io_log[ddir]);
2684}
2685
1fed2080
JA		 2686static struct io_logs *get_cur_log(struct io_log *iolog)
2687{
2688 struct io_logs *cur_log;
2689
2690 cur_log = iolog_cur_log(iolog);
2691 if (!cur_log) {
2692 cur_log = get_new_log(iolog);
2693 if (!cur_log)
2694 return NULL;
2695 }
2696
2697 if (cur_log->nr_samples < cur_log->max_samples)
2698 return cur_log;
2699
2700 /*
1eb467fb
JA		 2701 * Out of space. If we're in IO offload mode, or we're not doing
2702 * per unit logging (hence logging happens outside of the IO thread
2703 * as well), add a new log chunk inline. If we're doing inline
2704 * submissions, flag 'td' as needing a log regrow and we'll take
2705 * care of it on the submission side.
1fed2080 2706 */
ab5643cb 2707 if ((iolog->td && iolog->td->o.io_submit_mode == IO_MODE_OFFLOAD) ||
1eb467fb 2708 !per_unit_log(iolog))
1fed2080
JA		 2709 return regrow_log(iolog);
2710
ab5643cb
IK		 2711 if (iolog->td)
2712 iolog->td->flags |= TD_F_REGROW_LOGS;
2713 if (iolog->pending)
2714 assert(iolog->pending->nr_samples < iolog->pending->max_samples);
1fed2080 2715 return iolog->pending;
7e419452
JA		 2716}
2717
af2fde19 2718static void __add_log_sample(struct io_log *iolog, union io_sample_data data,
5fff9543 2719 enum fio_ddir ddir, unsigned long long bs,
03ec570f
DLM		 2720 unsigned long t, uint64_t offset,
2721 unsigned int priority)
3c39a379 2722{
7e419452 2723 struct io_logs *cur_log;
306ddc97 2724
3c568239
JA		 2725 if (iolog->disabled)
2726 return;
7e419452 2727 if (flist_empty(&iolog->io_logs))
8355119b 2728 iolog->avg_last[ddir] = t;
b8bc8cba 2729
7e419452
JA		 2730 cur_log = get_cur_log(iolog);
2731 if (cur_log) {
2732 struct io_sample *s;
3c39a379 2733
7e419452 2734 s = get_sample(iolog, cur_log, cur_log->nr_samples);
3c39a379 2735
af2fde19 2736 s->data = data;
a9179eeb 2737 s->time = t + (iolog->td ? iolog->td->unix_epoch : 0);
7e419452
JA		 2738 io_sample_set_ddir(iolog, s, ddir);
2739 s->bs = bs;
03ec570f 2740 s->priority = priority;
ae588852 2741
7e419452
JA		 2742 if (iolog->log_offset) {
2743 struct io_sample_offset *so = (void *) s;
ae588852 2744
7e419452
JA		 2745 so->offset = offset;
2746 }
ae588852 2747
7e419452
JA		 2748 cur_log->nr_samples++;
2749 return;
ae588852
JA		 2750 }
2751
7e419452 2752 iolog->disabled = true;
3c39a379
JA		 2753}
2754
7fb28d36
JA		 2755static inline void reset_io_stat(struct io_stat *ios)
2756{
5b8f19b7
JA		 2757 ios->min_val = -1ULL;
2758 ios->max_val = ios->samples = 0;
7fb28d36
JA		 2759 ios->mean.u.f = ios->S.u.f = 0;
2760}
2761
6bb58215
JA		 2762void reset_io_stats(struct thread_data *td)
2763{
2764 struct thread_stat *ts = &td->ts;
df8781b6 2765 int i, j, k;
6bb58215
JA		 2766
2767 for (i = 0; i < DDIR_RWDIR_CNT; i++) {
b2a432bf 2768 reset_io_stat(&ts->clat_high_prio_stat[i]);
efd78265 2769 reset_io_stat(&ts->clat_low_prio_stat[i]);
6bb58215
JA		 2770 reset_io_stat(&ts->clat_stat[i]);
2771 reset_io_stat(&ts->slat_stat[i]);
2772 reset_io_stat(&ts->lat_stat[i]);
2773 reset_io_stat(&ts->bw_stat[i]);
2774 reset_io_stat(&ts->iops_stat[i]);
2775
2776 ts->io_bytes[i] = 0;
2777 ts->runtime[i] = 0;
71cb78c1
VF		 2778 ts->total_io_u[i] = 0;
2779 ts->short_io_u[i] = 0;
2780 ts->drop_io_u[i] = 0;
6bb58215 2781
b2b3eefe 2782 for (j = 0; j < FIO_IO_U_PLAT_NR; j++) {
b2a432bf 2783 ts->io_u_plat_high_prio[i][j] = 0;
efd78265 2784 ts->io_u_plat_low_prio[i][j] = 0;
b2b3eefe
JA		 2785 if (!i)
2786 ts->io_u_sync_plat[j] = 0;
2787 }
6bb58215
JA		 2788 }
2789
df8781b6
VF		 2790 for (i = 0; i < FIO_LAT_CNT; i++)
2791 for (j = 0; j < DDIR_RWDIR_CNT; j++)
2792 for (k = 0; k < FIO_IO_U_PLAT_NR; k++)
2793 ts->io_u_plat[i][j][k] = 0;
2794
7f3ecee2
JA		 2795 ts->total_io_u[DDIR_SYNC] = 0;
2796
6bb58215
JA		 2797 for (i = 0; i < FIO_IO_U_MAP_NR; i++) {
2798 ts->io_u_map[i] = 0;
2799 ts->io_u_submit[i] = 0;
2800 ts->io_u_complete[i] = 0;
71cb78c1
VF		 2801 }
2802
d6bb626e
VF		 2803 for (i = 0; i < FIO_IO_U_LAT_N_NR; i++)
2804 ts->io_u_lat_n[i] = 0;
71cb78c1 2805 for (i = 0; i < FIO_IO_U_LAT_U_NR; i++)
6bb58215 2806 ts->io_u_lat_u[i] = 0;
71cb78c1 2807 for (i = 0; i < FIO_IO_U_LAT_M_NR; i++)
6bb58215 2808 ts->io_u_lat_m[i] = 0;
6bb58215 2809
71cb78c1
VF		 2810 ts->total_submit = 0;
2811 ts->total_complete = 0;
fd5d733f 2812 ts->nr_zone_resets = 0;
96563db9 2813 ts->cachehit = ts->cachemiss = 0;
6bb58215
JA		 2814}
2815
d96d3bb3 2816static void __add_stat_to_log(struct io_log *iolog, enum fio_ddir ddir,
03ec570f 2817 unsigned long elapsed, bool log_max)
99007068
PO		 2818{
2819 /*
2820 * Note an entry in the log. Use the mean from the logged samples,
2821 * making sure to properly round up. Only write a log entry if we
2822 * had actual samples done.
2823 */
d96d3bb3 2824 if (iolog->avg_window[ddir].samples) {
af2fde19 2825 union io_sample_data data;
99007068 2826
e6989e10 2827 if (log_max)
af2fde19 2828 data.val = iolog->avg_window[ddir].max_val;
e6989e10 2829 else
af2fde19 2830 data.val = iolog->avg_window[ddir].mean.u.f + 0.50;
e6989e10 2831
03ec570f 2832 __add_log_sample(iolog, data, ddir, 0, elapsed, 0, 0);
99007068 2833 }
99007068 2834
d96d3bb3
JA		 2835 reset_io_stat(&iolog->avg_window[ddir]);
2836}
99007068 2837
e6989e10 2838static void _add_stat_to_log(struct io_log *iolog, unsigned long elapsed,
03ec570f 2839 bool log_max)
d96d3bb3
JA		 2840{
2841 int ddir;
99007068 2842
d96d3bb3 2843 for (ddir = 0; ddir < DDIR_RWDIR_CNT; ddir++)
03ec570f 2844 __add_stat_to_log(iolog, ddir, elapsed, log_max);
99007068
PO		 2845}
2846
674456bf
JF		 2847static unsigned long add_log_sample(struct thread_data *td,
2848 struct io_log *iolog,
2849 union io_sample_data data,
5fff9543 2850 enum fio_ddir ddir, unsigned long long bs,
03ec570f 2851 uint64_t offset, unsigned int ioprio)
bb3884d8 2852{
7fb28d36 2853 unsigned long elapsed, this_window;
b8bc8cba 2854
ff58fced 2855 if (!ddir_rw(ddir))
d454a205 2856 return 0;
ff58fced 2857
b8bc8cba
JA		 2858 elapsed = mtime_since_now(&td->epoch);
2859
2860 /*
2861 * If no time averaging, just add the log sample.
2862 */
2863 if (!iolog->avg_msec) {
03ec570f
DLM		 2864 __add_log_sample(iolog, data, ddir, bs, elapsed, offset,
2865 ioprio);
d454a205 2866 return 0;
b8bc8cba
JA		 2867 }
2868
2869 /*
2870 * Add the sample. If the time period has passed, then
2871 * add that entry to the log and clear.
2872 */
af2fde19 2873 add_stat_sample(&iolog->avg_window[ddir], data.val);
b8bc8cba 2874
7fb28d36
JA		 2875 /*
2876 * If period hasn't passed, adding the above sample is all we
2877 * need to do.
2878 */
8355119b
SW		 2879 this_window = elapsed - iolog->avg_last[ddir];
2880 if (elapsed < iolog->avg_last[ddir])
2881 return iolog->avg_last[ddir] - elapsed;
f5a568cf 2882 else if (this_window < iolog->avg_msec) {
674456bf 2883 unsigned long diff = iolog->avg_msec - this_window;
d454a205 2884
b392f36d 2885 if (inline_log(iolog) || diff > LOG_MSEC_SLACK)
d454a205
JA		 2886 return diff;
2887 }
b8bc8cba 2888
03ec570f 2889 __add_stat_to_log(iolog, ddir, elapsed, td->o.log_max != 0);
b8bc8cba 2890
58a2d29d
JL		 2891 iolog->avg_last[ddir] = elapsed - (elapsed % iolog->avg_msec);
2892
d454a205 2893 return iolog->avg_msec;
99007068 2894}
6eaf09d6 2895
a47591e4 2896void finalize_logs(struct thread_data *td, bool unit_logs)
99007068
PO		 2897{
2898 unsigned long elapsed;
6eaf09d6 2899
99007068 2900 elapsed = mtime_since_now(&td->epoch);
b8bc8cba 2901
a47591e4 2902 if (td->clat_log && unit_logs)
03ec570f 2903 _add_stat_to_log(td->clat_log, elapsed, td->o.log_max != 0);
a47591e4 2904 if (td->slat_log && unit_logs)
03ec570f 2905 _add_stat_to_log(td->slat_log, elapsed, td->o.log_max != 0);
a47591e4 2906 if (td->lat_log && unit_logs)
03ec570f 2907 _add_stat_to_log(td->lat_log, elapsed, td->o.log_max != 0);
a47591e4 2908 if (td->bw_log && (unit_logs == per_unit_log(td->bw_log)))
03ec570f 2909 _add_stat_to_log(td->bw_log, elapsed, td->o.log_max != 0);
a47591e4 2910 if (td->iops_log && (unit_logs == per_unit_log(td->iops_log)))
03ec570f 2911 _add_stat_to_log(td->iops_log, elapsed, td->o.log_max != 0);
bb3884d8
JA		 2912}
2913
03ec570f
DLM		 2914void add_agg_sample(union io_sample_data data, enum fio_ddir ddir,
2915 unsigned long long bs)
bb3884d8 2916{
ff58fced 2917 struct io_log *iolog;
bb3884d8 2918
ff58fced
JA		 2919 if (!ddir_rw(ddir))
2920 return;
2921
2922 iolog = agg_io_log[ddir];
03ec570f 2923 __add_log_sample(iolog, data, ddir, bs, mtime_since_genesis(), 0, 0);
bb3884d8
JA		 2924}
2925
b2b3eefe
JA		 2926void add_sync_clat_sample(struct thread_stat *ts, unsigned long long nsec)
2927{
2928 unsigned int idx = plat_val_to_idx(nsec);
2929 assert(idx < FIO_IO_U_PLAT_NR);
2930
2931 ts->io_u_sync_plat[idx]++;
2932 add_stat_sample(&ts->sync_stat, nsec);
2933}
2934
ed7f3a07
NC		 2935static inline void add_lat_percentile_sample(struct thread_stat *ts,
2936 unsigned long long nsec,
2937 enum fio_ddir ddir,
2938 enum fio_lat lat)
83349190 2939{
d6bb626e 2940 unsigned int idx = plat_val_to_idx(nsec);
83349190
YH		 2941 assert(idx < FIO_IO_U_PLAT_NR);
2942
56440e63
VF		 2943 ts->io_u_plat[lat][ddir][idx]++;
2944}
b2a432bf 2945
ed7f3a07
NC		 2946static inline void add_lat_percentile_prio_sample(struct thread_stat *ts,
2947 unsigned long long nsec,
2948 enum fio_ddir ddir,
2949 bool high_prio)
56440e63
VF		 2950{
2951 unsigned int idx = plat_val_to_idx(nsec);
2952
03ec570f 2953 if (!high_prio)
efd78265 2954 ts->io_u_plat_low_prio[ddir][idx]++;
56440e63 2955 else
b2a432bf 2956 ts->io_u_plat_high_prio[ddir][idx]++;
83349190
YH		 2957}
2958
1e97cce9 2959void add_clat_sample(struct thread_data *td, enum fio_ddir ddir,
5fff9543 2960 unsigned long long nsec, unsigned long long bs,
03ec570f 2961 uint64_t offset, unsigned int ioprio, bool high_prio)
3c39a379 2962{
26b3a188 2963 const bool needs_lock = td_async_processing(td);
1e613c9c 2964 unsigned long elapsed, this_window;
756867bd 2965 struct thread_stat *ts = &td->ts;
1e613c9c 2966 struct io_log *iolog = td->clat_hist_log;
079ad09b 2967
26b3a188
JA		 2968 if (needs_lock)
2969 __td_io_u_lock(td);
75dc383e 2970
d6bb626e 2971 add_stat_sample(&ts->clat_stat[ddir], nsec);
3c39a379 2972
717569b1
NC		 2973 /*
2974 * When lat_percentiles=1 (default 0), the reported high/low priority
2975 * percentiles and stats are used for describing total latency values,
2976 * even though the variable names themselves start with clat_.
2977 *
2978 * Because of the above definition, add a prio stat sample only when
2979 * lat_percentiles=0. add_lat_sample() will add the prio stat sample
2980 * when lat_percentiles=1.
2981 */
38ec5c51 2982 if (!ts->lat_percentiles) {
03ec570f 2983 if (high_prio)
38ec5c51
VF		 2984 add_stat_sample(&ts->clat_high_prio_stat[ddir], nsec);
2985 else
efd78265 2986 add_stat_sample(&ts->clat_low_prio_stat[ddir], nsec);
b2a432bf
PC		 2987 }
2988
7b9f733a 2989 if (td->clat_log)
d6bb626e 2990 add_log_sample(td, td->clat_log, sample_val(nsec), ddir, bs,
03ec570f 2991 offset, ioprio);
83349190 2992
b2a432bf 2993 if (ts->clat_percentiles) {
717569b1
NC		 2994 /*
2995 * Because of the above definition, add a prio lat percentile
2996 * sample only when lat_percentiles=0. add_lat_sample() will add
2997 * the prio lat percentile sample when lat_percentiles=1.
2998 */
bf65f7c8
NC		 2999 add_lat_percentile_sample(ts, nsec, ddir, FIO_CLAT);
3000 if (!ts->lat_percentiles)
3001 add_lat_percentile_prio_sample(ts, nsec, ddir,
3002 high_prio);
b2a432bf 3003 }
75dc383e 3004
1e613c9c 3005 if (iolog && iolog->hist_msec) {
93168285
JA		 3006 struct io_hist *hw = &iolog->hist_window[ddir];
3007
3008 hw->samples++;
1e613c9c 3009 elapsed = mtime_since_now(&td->epoch);
93168285 3010 if (!hw->hist_last)
1e613c9c
KC		 3011 hw->hist_last = elapsed;
3012 this_window = elapsed - hw->hist_last;
7a4e480d 3013
1e613c9c 3014 if (this_window >= iolog->hist_msec) {
6cc0e5aa 3015 uint64_t *io_u_plat;
65a4d15c 3016 struct io_u_plat_entry *dst;
93168285 3017
1e613c9c 3018 /*
93168285
JA		 3019 * Make a byte-for-byte copy of the latency histogram
3020 * stored in td->ts.io_u_plat[ddir], recording it in a
3021 * log sample. Note that the matching call to free() is
3022 * located in iolog.c after printing this sample to the
3023 * log file.
1e613c9c 3024 */
df8781b6 3025 io_u_plat = (uint64_t *) td->ts.io_u_plat[FIO_CLAT][ddir];
65a4d15c
KC		 3026 dst = malloc(sizeof(struct io_u_plat_entry));
3027 memcpy(&(dst->io_u_plat), io_u_plat,
1fb9250b 3028 FIO_IO_U_PLAT_NR * sizeof(uint64_t));
d730bc58 3029 flist_add(&dst->list, &hw->list);
af2fde19 3030 __add_log_sample(iolog, sample_plat(dst), ddir, bs,
03ec570f 3031 elapsed, offset, ioprio);
1e613c9c
KC		 3032
3033 /*
93168285
JA		 3034 * Update the last time we recorded as being now, minus
3035 * any drift in time we encountered before actually
3036 * making the record.
1e613c9c
KC		 3037 */
3038 hw->hist_last = elapsed - (this_window - iolog->hist_msec);
3039 hw->samples = 0;
3040 }
3041 }
3042
26b3a188
JA		 3043 if (needs_lock)
3044 __td_io_u_unlock(td);
3c39a379
JA		 3045}
3046
1e97cce9 3047void add_slat_sample(struct thread_data *td, enum fio_ddir ddir,
03ec570f
DLM		 3048 unsigned long long nsec, unsigned long long bs,
3049 uint64_t offset, unsigned int ioprio)
3c39a379 3050{
26b3a188 3051 const bool needs_lock = td_async_processing(td);
756867bd 3052 struct thread_stat *ts = &td->ts;
079ad09b 3053
ff58fced
JA		 3054 if (!ddir_rw(ddir))
3055 return;
3056
26b3a188
JA		 3057 if (needs_lock)
3058 __td_io_u_lock(td);
75dc383e 3059
56440e63 3060 add_stat_sample(&ts->slat_stat[ddir], nsec);
3c39a379 3061
7b9f733a 3062 if (td->slat_log)
03ec570f
DLM		 3063 add_log_sample(td, td->slat_log, sample_val(nsec), ddir, bs,
3064 offset, ioprio);
75dc383e 3065
56440e63 3066 if (ts->slat_percentiles)
3dd92a75 3067 add_lat_percentile_sample(ts, nsec, ddir, FIO_SLAT);
56440e63 3068
26b3a188
JA		 3069 if (needs_lock)
3070 __td_io_u_unlock(td);
3c39a379
JA		 3071}
3072
02af0988 3073void add_lat_sample(struct thread_data *td, enum fio_ddir ddir,
5fff9543 3074 unsigned long long nsec, unsigned long long bs,
03ec570f 3075 uint64_t offset, unsigned int ioprio, bool high_prio)
02af0988 3076{
26b3a188 3077 const bool needs_lock = td_async_processing(td);
02af0988
JA		 3078 struct thread_stat *ts = &td->ts;
3079
ff58fced
JA		 3080 if (!ddir_rw(ddir))
3081 return;
3082
26b3a188
JA		 3083 if (needs_lock)
3084 __td_io_u_lock(td);
75dc383e 3085
d6bb626e 3086 add_stat_sample(&ts->lat_stat[ddir], nsec);
02af0988 3087
7b9f733a 3088 if (td->lat_log)
d6bb626e 3089 add_log_sample(td, td->lat_log, sample_val(nsec), ddir, bs,
03ec570f 3090 offset, ioprio);
75dc383e 3091
717569b1
NC		 3092 /*
3093 * When lat_percentiles=1 (default 0), the reported high/low priority
3094 * percentiles and stats are used for describing total latency values,
3095 * even though the variable names themselves start with clat_.
3096 *
3097 * Because of the above definition, add a prio stat and prio lat
3098 * percentile sample only when lat_percentiles=1. add_clat_sample() will
3099 * add the prio stat and prio lat percentile sample when
3100 * lat_percentiles=0.
3101 */
38ec5c51 3102 if (ts->lat_percentiles) {
bf65f7c8
NC		 3103 add_lat_percentile_sample(ts, nsec, ddir, FIO_LAT);
3104 add_lat_percentile_prio_sample(ts, nsec, ddir, high_prio);
03ec570f 3105 if (high_prio)
38ec5c51
VF		 3106 add_stat_sample(&ts->clat_high_prio_stat[ddir], nsec);
3107 else
efd78265 3108 add_stat_sample(&ts->clat_low_prio_stat[ddir], nsec);
b599759b 3109
38ec5c51 3110 }
26b3a188
JA		 3111 if (needs_lock)
3112 __td_io_u_unlock(td);
02af0988
JA		 3113}
3114
a47591e4 3115void add_bw_sample(struct thread_data *td, struct io_u *io_u,
d6bb626e 3116 unsigned int bytes, unsigned long long spent)
a47591e4 3117{
26b3a188 3118 const bool needs_lock = td_async_processing(td);
a47591e4
JA		 3119 struct thread_stat *ts = &td->ts;
3120 unsigned long rate;
3121
3122 if (spent)
d6bb626e 3123 rate = (unsigned long) (bytes * 1000000ULL / spent);
a47591e4
JA		 3124 else
3125 rate = 0;
3126
26b3a188
JA		 3127 if (needs_lock)
3128 __td_io_u_lock(td);
a47591e4
JA		 3129
3130 add_stat_sample(&ts->bw_stat[io_u->ddir], rate);
3131
3132 if (td->bw_log)
af2fde19 3133 add_log_sample(td, td->bw_log, sample_val(rate), io_u->ddir,
03ec570f 3134 bytes, io_u->offset, io_u->ioprio);
a47591e4
JA		 3135
3136 td->stat_io_bytes[io_u->ddir] = td->this_io_bytes[io_u->ddir];
26b3a188
JA		 3137
3138 if (needs_lock)
3139 __td_io_u_unlock(td);
a47591e4
JA		 3140}
3141
8b6a404c
VF		 3142static int __add_samples(struct thread_data *td, struct timespec *parent_tv,
3143 struct timespec *t, unsigned int avg_time,
4843277a
JA		 3144 uint64_t *this_io_bytes, uint64_t *stat_io_bytes,
3145 struct io_stat *stat, struct io_log *log,
3146 bool is_kb)
3c39a379 3147{
26b3a188 3148 const bool needs_lock = td_async_processing(td);
ff58fced 3149 unsigned long spent, rate;
a47591e4 3150 enum fio_ddir ddir;
674456bf 3151 unsigned long next, next_log;
d454a205 3152
4843277a 3153 next_log = avg_time;
ff58fced 3154
4843277a 3155 spent = mtime_since(parent_tv, t);
58a2d29d 3156 if (spent < avg_time && avg_time - spent > LOG_MSEC_SLACK)
4843277a 3157 return avg_time - spent;
9602d8df 3158
26b3a188
JA		 3159 if (needs_lock)
3160 __td_io_u_lock(td);
a9da8ab2 3161
9602d8df 3162 /*
5daa4ebe
JC		 3163 * Compute both read and write rates for the interval.
3164 */
c1f50f76 3165 for (ddir = 0; ddir < DDIR_RWDIR_CNT; ddir++) {
5daa4ebe
JC		 3166 uint64_t delta;
3167
4843277a 3168 delta = this_io_bytes[ddir] - stat_io_bytes[ddir];
5daa4ebe
JC		 3169 if (!delta)
3170 continue; /* No entries for interval */
3c39a379 3171
4843277a
JA		 3172 if (spent) {
3173 if (is_kb)
3174 rate = delta * 1000 / spent / 1024; /* KiB/s */
3175 else
3176 rate = (delta * 1000) / spent;
3177 } else
0956264f
JA		 3178 rate = 0;
3179
4843277a 3180 add_stat_sample(&stat[ddir], rate);
3c39a379 3181
37181709 3182 if (log) {
5fff9543 3183 unsigned long long bs = 0;
66b98c9f
JA		 3184
3185 if (td->o.min_bs[ddir] == td->o.max_bs[ddir])
3186 bs = td->o.min_bs[ddir];
3187
03ec570f
DLM		 3188 next = add_log_sample(td, log, sample_val(rate), ddir,
3189 bs, 0, 0);
d454a205 3190 next_log = min(next_log, next);
66b98c9f 3191 }
5daa4ebe 3192
4843277a 3193 stat_io_bytes[ddir] = this_io_bytes[ddir];
5daa4ebe 3194 }
3c39a379 3195
cdb8308d 3196 *parent_tv = *t;
a47591e4 3197
26b3a188
JA		 3198 if (needs_lock)
3199 __td_io_u_unlock(td);
a47591e4 3200
4843277a
JA		 3201 if (spent <= avg_time)
3202 next = avg_time;
306fea38 3203 else
4843277a 3204 next = avg_time - (1 + spent - avg_time);
a47591e4 3205
d454a205 3206 return min(next, next_log);
a47591e4
JA		 3207}
3208
8b6a404c 3209static int add_bw_samples(struct thread_data *td, struct timespec *t)
4843277a
JA		 3210{
3211 return __add_samples(td, &td->bw_sample_time, t, td->o.bw_avg_time,
3212 td->this_io_bytes, td->stat_io_bytes,
3213 td->ts.bw_stat, td->bw_log, true);
3214}
3215
a47591e4
JA		 3216void add_iops_sample(struct thread_data *td, struct io_u *io_u,
3217 unsigned int bytes)
3218{
26b3a188 3219 const bool needs_lock = td_async_processing(td);
a47591e4
JA		 3220 struct thread_stat *ts = &td->ts;
3221
26b3a188
JA		 3222 if (needs_lock)
3223 __td_io_u_lock(td);
a47591e4
JA		 3224
3225 add_stat_sample(&ts->iops_stat[io_u->ddir], 1);
3226
3227 if (td->iops_log)
af2fde19 3228 add_log_sample(td, td->iops_log, sample_val(1), io_u->ddir,
03ec570f 3229 bytes, io_u->offset, io_u->ioprio);
a47591e4
JA		 3230
3231 td->stat_io_blocks[io_u->ddir] = td->this_io_blocks[io_u->ddir];
26b3a188
JA		 3232
3233 if (needs_lock)
3234 __td_io_u_unlock(td);
3c39a379 3235}
c8eeb9df 3236
8b6a404c 3237static int add_iops_samples(struct thread_data *td, struct timespec *t)
c8eeb9df 3238{
4843277a
JA		 3239 return __add_samples(td, &td->iops_sample_time, t, td->o.iops_avg_time,
3240 td->this_io_blocks, td->stat_io_blocks,
3241 td->ts.iops_stat, td->iops_log, false);
a47591e4
JA		 3242}
3243
3244/*
3245 * Returns msecs to next event
3246 */
3247int calc_log_samples(void)
3248{
3249 struct thread_data *td;
58a2d29d 3250 unsigned int next = ~0U, tmp = 0, next_mod = 0, log_avg_msec_min = -1U;
8b6a404c 3251 struct timespec now;
a47591e4 3252 int i;
58a2d29d 3253 long elapsed_time = 0;
a47591e4
JA		 3254
3255 fio_gettime(&now, NULL);
3256
3257 for_each_td(td, i) {
58a2d29d
JL		 3258 elapsed_time = mtime_since_now(&td->epoch);
3259
8243be59
JA		 3260 if (!td->o.stats)
3261 continue;
6a89b401 3262 if (in_ramp_time(td) ||
a47591e4
JA		 3263 !(td->runstate == TD_RUNNING || td->runstate == TD_VERIFYING)) {
3264 next = min(td->o.iops_avg_time, td->o.bw_avg_time);
3265 continue;
3266 }
37181709
AH		 3267 if (!td->bw_log ||
3268 (td->bw_log && !per_unit_log(td->bw_log))) {
a47591e4 3269 tmp = add_bw_samples(td, &now);
58a2d29d
JL		 3270
3271 if (td->bw_log)
3272 log_avg_msec_min = min(log_avg_msec_min, (unsigned int)td->bw_log->avg_msec);
a47591e4 3273 }
37181709
AH		 3274 if (!td->iops_log ||
3275 (td->iops_log && !per_unit_log(td->iops_log))) {
a47591e4 3276 tmp = add_iops_samples(td, &now);
58a2d29d
JL		 3277
3278 if (td->iops_log)
3279 log_avg_msec_min = min(log_avg_msec_min, (unsigned int)td->iops_log->avg_msec);
a47591e4 3280 }
58a2d29d
JL		 3281
3282 if (tmp < next)
3283 next = tmp;
a47591e4
JA		 3284 }
3285
58a2d29d
JL		 3286 /* if log_avg_msec_min has not been changed, set it to 0 */
3287 if (log_avg_msec_min == -1U)
3288 log_avg_msec_min = 0;
3289
3290 if (log_avg_msec_min == 0)
3291 next_mod = elapsed_time;
3292 else
3293 next_mod = elapsed_time % log_avg_msec_min;
3294
3295 /* correction to keep the time on the log avg msec boundary */
3296 next = min(next, (log_avg_msec_min - next_mod));
3297
a47591e4 3298 return next == ~0U ? 0 : next;
c8eeb9df 3299}
cef9175e
JA		 3300
3301void stat_init(void)
3302{
971caeb1 3303 stat_sem = fio_sem_init(FIO_SEM_UNLOCKED);
cef9175e
JA		 3304}
3305
3306void stat_exit(void)
3307{
3308 /*
3309 * When we have the mutex, we know out-of-band access to it
3310 * have ended.
3311 */
971caeb1
BVA		 3312 fio_sem_down(stat_sem);
3313 fio_sem_remove(stat_sem);
cef9175e 3314}
b2ee7647 3315
b2ee7647
JA		 3316/*
3317 * Called from signal handler. Wake up status thread.
3318 */
3319void show_running_run_stats(void)
3320{
a47591e4 3321 helper_do_stat();
b2ee7647 3322}
66347cfa
DE		 3323
3324uint32_t *io_u_block_info(struct thread_data *td, struct io_u *io_u)
3325{
3326 /* Ignore io_u's which span multiple blocks--they will just get
3327 * inaccurate counts. */
3328 int idx = (io_u->offset - io_u->file->file_offset)
3329 / td->o.bs[DDIR_TRIM];
3330 uint32_t *info = &td->ts.block_infos[idx];
3331 assert(idx < td->ts.nr_block_infos);
3332 return info;
3333}
5c0abd5e 3334
fio - Flexible IO Tester