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