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