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