Unify and fixup error handling
[fio.git] / stat.c
CommitLineData
3c39a379
JA
1#include <stdio.h>
2#include <string.h>
3#include <sys/time.h>
4#include <sys/types.h>
5c4e1dbc 5#include <sys/stat.h>
3c39a379
JA
6#include <dirent.h>
7#include <libgen.h>
8#include <math.h>
9
10#include "fio.h"
3c39a379
JA
11
12static struct itimerval itimer;
5c4e1dbc 13static struct list_head disk_list = LIST_HEAD_INIT(disk_list);
3c39a379 14
dbe1125e
JA
15/*
16 * Cheasy number->string conversion, complete with carry rounding error.
17 */
18static char *num2str(unsigned long num, int maxlen, int base)
19{
20 /*
21 * could be passed in for 10^3 base, but every caller expects
22 * 2^10 base right now.
23 */
c8c51efd 24 const unsigned int thousand = 1024;
f3502ba2 25 char postfix[] = { 'K', 'M', 'G', 'P', 'E' };
dbe1125e
JA
26 char *buf;
27 int i;
28
29 buf = malloc(128);
30
31 for (i = 0; base > 1; i++)
32 base /= thousand;
33
34 do {
35 int len, carry = 0;
36
37 len = sprintf(buf, "%'lu", num);
38 if (len <= maxlen) {
39 buf[len] = postfix[i];
40 buf[len + 1] = '\0';
41 return buf;
42 }
43
44 if ((num % thousand) >= (thousand / 2))
45 carry = 1;
46
47 num /= thousand;
48 num += carry;
49 i++;
f3502ba2 50 } while (i <= 5);
dbe1125e
JA
51
52 return buf;
53}
54
3c39a379
JA
55static int get_io_ticks(struct disk_util *du, struct disk_util_stat *dus)
56{
57 unsigned in_flight;
58 char line[256];
59 FILE *f;
60 char *p;
61
62 f = fopen(du->path, "r");
63 if (!f)
64 return 1;
65
66 p = fgets(line, sizeof(line), f);
67 if (!p) {
68 fclose(f);
69 return 1;
70 }
71
72 if (sscanf(p, "%u %u %llu %u %u %u %llu %u %u %u %u\n", &dus->ios[0], &dus->merges[0], &dus->sectors[0], &dus->ticks[0], &dus->ios[1], &dus->merges[1], &dus->sectors[1], &dus->ticks[1], &in_flight, &dus->io_ticks, &dus->time_in_queue) != 11) {
73 fclose(f);
74 return 1;
75 }
76
77 fclose(f);
78 return 0;
79}
80
81static void update_io_tick_disk(struct disk_util *du)
82{
83 struct disk_util_stat __dus, *dus, *ldus;
84 struct timeval t;
85
86 if (get_io_ticks(du, &__dus))
87 return;
88
89 dus = &du->dus;
90 ldus = &du->last_dus;
91
92 dus->sectors[0] += (__dus.sectors[0] - ldus->sectors[0]);
93 dus->sectors[1] += (__dus.sectors[1] - ldus->sectors[1]);
94 dus->ios[0] += (__dus.ios[0] - ldus->ios[0]);
95 dus->ios[1] += (__dus.ios[1] - ldus->ios[1]);
96 dus->merges[0] += (__dus.merges[0] - ldus->merges[0]);
97 dus->merges[1] += (__dus.merges[1] - ldus->merges[1]);
98 dus->ticks[0] += (__dus.ticks[0] - ldus->ticks[0]);
99 dus->ticks[1] += (__dus.ticks[1] - ldus->ticks[1]);
100 dus->io_ticks += (__dus.io_ticks - ldus->io_ticks);
101 dus->time_in_queue += (__dus.time_in_queue - ldus->time_in_queue);
102
02bcaa8c 103 fio_gettime(&t, NULL);
3c39a379
JA
104 du->msec += mtime_since(&du->time, &t);
105 memcpy(&du->time, &t, sizeof(t));
106 memcpy(ldus, &__dus, sizeof(__dus));
107}
108
109void update_io_ticks(void)
110{
111 struct list_head *entry;
112 struct disk_util *du;
113
114 list_for_each(entry, &disk_list) {
115 du = list_entry(entry, struct disk_util, list);
116 update_io_tick_disk(du);
117 }
118}
119
120static int disk_util_exists(dev_t dev)
121{
122 struct list_head *entry;
123 struct disk_util *du;
124
125 list_for_each(entry, &disk_list) {
126 du = list_entry(entry, struct disk_util, list);
127
128 if (du->dev == dev)
129 return 1;
130 }
131
132 return 0;
133}
134
135static void disk_util_add(dev_t dev, char *path)
136{
1188caf8
JA
137 struct disk_util *du, *__du;
138 struct list_head *entry;
3c39a379 139
1188caf8 140 du = malloc(sizeof(*du));
3c39a379
JA
141 memset(du, 0, sizeof(*du));
142 INIT_LIST_HEAD(&du->list);
143 sprintf(du->path, "%s/stat", path);
144 du->name = strdup(basename(path));
145 du->dev = dev;
146
1188caf8
JA
147 list_for_each(entry, &disk_list) {
148 __du = list_entry(entry, struct disk_util, list);
149
150 if (!strcmp(du->name, __du->name)) {
151 free(du->name);
152 free(du);
153 return;
154 }
155 }
156
02bcaa8c 157 fio_gettime(&du->time, NULL);
3c39a379
JA
158 get_io_ticks(du, &du->last_dus);
159
160 list_add_tail(&du->list, &disk_list);
161}
162
163static int check_dev_match(dev_t dev, char *path)
164{
165 unsigned int major, minor;
166 char line[256], *p;
167 FILE *f;
168
169 f = fopen(path, "r");
170 if (!f) {
171 perror("open path");
172 return 1;
173 }
174
175 p = fgets(line, sizeof(line), f);
176 if (!p) {
177 fclose(f);
178 return 1;
179 }
180
181 if (sscanf(p, "%u:%u", &major, &minor) != 2) {
182 fclose(f);
183 return 1;
184 }
185
186 if (((major << 8) | minor) == dev) {
187 fclose(f);
188 return 0;
189 }
190
191 fclose(f);
192 return 1;
193}
194
195static int find_block_dir(dev_t dev, char *path)
196{
197 struct dirent *dir;
198 struct stat st;
199 int found = 0;
200 DIR *D;
201
202 D = opendir(path);
203 if (!D)
204 return 0;
205
206 while ((dir = readdir(D)) != NULL) {
207 char full_path[256];
208
209 if (!strcmp(dir->d_name, ".") || !strcmp(dir->d_name, ".."))
210 continue;
3c39a379
JA
211
212 sprintf(full_path, "%s/%s", path, dir->d_name);
213
214 if (!strcmp(dir->d_name, "dev")) {
215 if (!check_dev_match(dev, full_path)) {
216 found = 1;
217 break;
218 }
219 }
220
3307d653 221 if (lstat(full_path, &st) == -1) {
3c39a379
JA
222 perror("stat");
223 break;
224 }
225
226 if (!S_ISDIR(st.st_mode) || S_ISLNK(st.st_mode))
227 continue;
228
229 found = find_block_dir(dev, full_path);
230 if (found) {
231 strcpy(path, full_path);
232 break;
233 }
234 }
235
236 closedir(D);
237 return found;
238}
239
240void init_disk_util(struct thread_data *td)
241{
53cdc686 242 struct fio_file *f;
3c39a379 243 struct stat st;
0bbab0e7 244 char foo[PATH_MAX], tmp[PATH_MAX];
3c39a379
JA
245 dev_t dev;
246 char *p;
247
4d9345ae 248 if (!td->do_disk_util || (td->io_ops->flags & (FIO_NETIO | FIO_NULLIO)))
3c39a379
JA
249 return;
250
53cdc686
JA
251 /*
252 * Just use the same file, they are on the same device.
253 */
254 f = &td->files[0];
255 if (!stat(f->file_name, &st)) {
3c39a379
JA
256 if (S_ISBLK(st.st_mode))
257 dev = st.st_rdev;
258 else
259 dev = st.st_dev;
260 } else {
261 /*
262 * must be a file, open "." in that path
263 */
0bbab0e7 264 strncpy(foo, f->file_name, PATH_MAX - 1);
3c39a379
JA
265 p = dirname(foo);
266 if (stat(p, &st)) {
267 perror("disk util stat");
268 return;
269 }
270
271 dev = st.st_dev;
272 }
273
274 if (disk_util_exists(dev))
275 return;
276
277 sprintf(foo, "/sys/block");
278 if (!find_block_dir(dev, foo))
279 return;
280
281 /*
282 * If there's a ../queue/ directory there, we are inside a partition.
283 * Check if that is the case and jump back. For loop/md/dm etc we
284 * are already in the right spot.
285 */
286 sprintf(tmp, "%s/../queue", foo);
287 if (!stat(tmp, &st)) {
288 p = dirname(foo);
289 sprintf(tmp, "%s/queue", p);
290 if (stat(tmp, &st)) {
3b70d7e5 291 log_err("unknown sysfs layout\n");
3c39a379
JA
292 return;
293 }
0bbab0e7 294 strncpy(tmp, p, PATH_MAX - 1);
84585003 295 sprintf(foo, "%s", tmp);
3c39a379
JA
296 }
297
eecf272f
JA
298 if (td->ioscheduler)
299 td->sysfs_root = strdup(foo);
300
3c39a379
JA
301 disk_util_add(dev, foo);
302}
303
304void disk_util_timer_arm(void)
305{
306 itimer.it_value.tv_sec = 0;
307 itimer.it_value.tv_usec = DISK_UTIL_MSEC * 1000;
308 setitimer(ITIMER_REAL, &itimer, NULL);
309}
310
311void update_rusage_stat(struct thread_data *td)
312{
3c39a379
JA
313 getrusage(RUSAGE_SELF, &td->ru_end);
314
315 td->usr_time += mtime_since(&td->ru_start.ru_utime, &td->ru_end.ru_utime);
316 td->sys_time += mtime_since(&td->ru_start.ru_stime, &td->ru_end.ru_stime);
317 td->ctx += td->ru_end.ru_nvcsw + td->ru_end.ru_nivcsw - (td->ru_start.ru_nvcsw + td->ru_start.ru_nivcsw);
3c39a379
JA
318
319 memcpy(&td->ru_start, &td->ru_end, sizeof(td->ru_end));
320}
321
322static int calc_lat(struct io_stat *is, unsigned long *min, unsigned long *max,
323 double *mean, double *dev)
324{
68704084 325 double n = is->samples;
3c39a379
JA
326
327 if (is->samples == 0)
328 return 0;
329
330 *min = is->min_val;
331 *max = is->max_val;
332
333 n = (double) is->samples;
68704084 334 *mean = is->mean;
e6d276f2 335
68704084
JA
336 if (n > 1.0)
337 *dev = sqrt(is->S / (n - 1.0));
ef9c5c40 338 else
68704084 339 *dev = -1.0;
ef9c5c40 340
3c39a379
JA
341 return 1;
342}
343
344static void show_group_stats(struct group_run_stats *rs, int id)
345{
dbe1125e
JA
346 char *p1, *p2, *p3, *p4;
347 const char *ddir_str[] = { " READ", " WRITE" };
348 int i;
349
eb8bbf48 350 fprintf(f_out, "\nRun status group %d (all jobs):\n", id);
3c39a379 351
dbe1125e
JA
352 for (i = 0; i <= DDIR_WRITE; i++) {
353 if (!rs->max_run[i])
354 continue;
355
356 p1 = num2str(rs->io_kb[i], 6, 1);
357 p2 = num2str(rs->agg[i], 6, 1);
358 p3 = num2str(rs->min_bw[i], 6, 1);
359 p4 = num2str(rs->max_bw[i], 6, 1);
360
361 fprintf(f_out, "%s: io=%siB, aggrb=%siB/s, minb=%siB/s, maxb=%siB/s, mint=%llumsec, maxt=%llumsec\n", ddir_str[i], p1, p2, p3, p4, rs->min_run[0], rs->max_run[0]);
362
363 free(p1);
364 free(p2);
365 free(p3);
366 free(p4);
367 }
3c39a379
JA
368}
369
370static void show_disk_util(void)
371{
372 struct disk_util_stat *dus;
b4a6a59a 373 struct list_head *entry, *next;
3c39a379
JA
374 struct disk_util *du;
375 double util;
376
eb8bbf48 377 fprintf(f_out, "\nDisk stats (read/write):\n");
3c39a379
JA
378
379 list_for_each(entry, &disk_list) {
380 du = list_entry(entry, struct disk_util, list);
381 dus = &du->dus;
382
383 util = (double) 100 * du->dus.io_ticks / (double) du->msec;
384 if (util > 100.0)
385 util = 100.0;
386
eb8bbf48 387 fprintf(f_out, " %s: ios=%u/%u, merge=%u/%u, ticks=%u/%u, in_queue=%u, util=%3.2f%%\n", du->name, dus->ios[0], dus->ios[1], dus->merges[0], dus->merges[1], dus->ticks[0], dus->ticks[1], dus->time_in_queue, util);
3c39a379 388 }
b4a6a59a
JA
389
390 /*
391 * now free the list
392 */
393 list_for_each_safe(entry, next, &disk_list) {
394 list_del(entry);
395 du = list_entry(entry, struct disk_util, list);
396 free(du->name);
397 free(du);
398 }
3c39a379
JA
399}
400
401static void show_ddir_status(struct thread_data *td, struct group_run_stats *rs,
402 int ddir)
403{
3c9b60c1 404 const char *ddir_str[] = { "read ", "write" };
3c39a379
JA
405 unsigned long min, max;
406 unsigned long long bw;
407 double mean, dev;
dbe1125e 408 char *io_p, *bw_p;
3c39a379
JA
409
410 if (!td->runtime[ddir])
411 return;
412
413 bw = td->io_bytes[ddir] / td->runtime[ddir];
dbe1125e
JA
414 io_p = num2str(td->io_bytes[ddir] >> 10, 6, 1);
415 bw_p = num2str(bw, 6, 1);
416
417 fprintf(f_out, " %s: io=%siB, bw=%siB/s, runt=%6lumsec\n", ddir_str[ddir], io_p, bw_p, td->runtime[ddir]);
418
419 free(io_p);
420 free(bw_p);
3c39a379
JA
421
422 if (calc_lat(&td->slat_stat[ddir], &min, &max, &mean, &dev))
6104ddb6 423 fprintf(f_out, " slat (msec): min=%5lu, max=%5lu, avg=%5.02f, stdev=%5.02f\n", min, max, mean, dev);
3c39a379
JA
424
425 if (calc_lat(&td->clat_stat[ddir], &min, &max, &mean, &dev))
6104ddb6 426 fprintf(f_out, " clat (msec): min=%5lu, max=%5lu, avg=%5.02f, stdev=%5.02f\n", min, max, mean, dev);
3c39a379
JA
427
428 if (calc_lat(&td->bw_stat[ddir], &min, &max, &mean, &dev)) {
429 double p_of_agg;
430
431 p_of_agg = mean * 100 / (double) rs->agg[ddir];
6104ddb6 432 fprintf(f_out, " bw (KiB/s) : min=%5lu, max=%5lu, per=%3.2f%%, avg=%5.02f, stdev=%5.02f\n", min, max, p_of_agg, mean, dev);
3c39a379
JA
433 }
434}
435
436static void show_thread_status(struct thread_data *td,
437 struct group_run_stats *rs)
438{
439 double usr_cpu, sys_cpu;
69008999 440 unsigned long runtime;
71619dc2 441 double io_u_dist[FIO_IO_U_MAP_NR];
ec118304 442 double io_u_lat[FIO_IO_U_LAT_NR];
71619dc2 443 int i;
3c39a379 444
6d663077 445 if (!(td->io_bytes[0] + td->io_bytes[1]))
3c39a379
JA
446 return;
447
6d663077
JA
448 if (!td->error)
449 fprintf(f_out, "%s: (groupid=%d): err=%2d: pid=%d\n",td->name, td->groupid, td->error, td->pid);
450 else
451 fprintf(f_out, "%s: (groupid=%d): err=%2d (%s): pid=%d\n",td->name, td->groupid, td->error, td->verror, td->pid);
3c39a379
JA
452
453 show_ddir_status(td, rs, td->ddir);
454 if (td->io_bytes[td->ddir ^ 1])
455 show_ddir_status(td, rs, td->ddir ^ 1);
456
69008999
JA
457 runtime = mtime_since(&td->epoch, &td->end_time);
458 if (runtime) {
1e97cce9 459 double runt = (double) runtime;
3c39a379
JA
460
461 usr_cpu = (double) td->usr_time * 100 / runt;
462 sys_cpu = (double) td->sys_time * 100 / runt;
463 } else {
464 usr_cpu = 0;
465 sys_cpu = 0;
466 }
467
eb8bbf48 468 fprintf(f_out, " cpu : usr=%3.2f%%, sys=%3.2f%%, ctx=%lu\n", usr_cpu, sys_cpu, td->ctx);
71619dc2
JA
469
470 /*
471 * Do depth distribution calculations
472 */
473 for (i = 0; i < FIO_IO_U_MAP_NR; i++) {
474 io_u_dist[i] = (double) td->io_u_map[i] / (double) td->total_io_u;
475 io_u_dist[i] *= 100.0;
476 }
477
5d458077 478 fprintf(f_out, " IO depths : 1=%3.1f%%, 2=%3.1f%%, 4=%3.1f%%, 8=%3.1f%%, 16=%3.1f%%, 32=%3.1f%%, >=64=%3.1f%%\n", io_u_dist[0], io_u_dist[1], io_u_dist[2], io_u_dist[3], io_u_dist[4], io_u_dist[5], io_u_dist[6]);
61697c37 479
ec118304
JA
480 /*
481 * Do latency distribution calculations
482 */
483 for (i = 0; i < FIO_IO_U_LAT_NR; i++) {
484 io_u_lat[i] = (double) td->io_u_lat[i] / (double) td->total_io_u;
485 io_u_lat[i] *= 100.0;
486 }
487
488 fprintf(f_out, " lat (msec): 2=%3.1f%%, 4=%3.1f%%, 8=%3.1f%%, 16=%3.1f%%, 32=%3.1f%%, 64=%3.1f%%, 128=%3.1f%%\n", io_u_lat[0], io_u_lat[1], io_u_lat[2], io_u_lat[3], io_u_lat[4], io_u_lat[5], io_u_lat[6]);
489 fprintf(f_out, " lat (msec): 256=%3.1f%%, 512=%3.1f%%, 1024=%3.1f%%, >=2048=%3.1f%%\n", io_u_lat[7], io_u_lat[8], io_u_lat[9], io_u_lat[10]);
490
61697c37
JA
491 if (td->description)
492 fprintf(f_out, "%s\n", td->description);
3c39a379
JA
493}
494
c6ae0a5b
JA
495static void show_ddir_status_terse(struct thread_data *td,
496 struct group_run_stats *rs, int ddir)
497{
498 unsigned long min, max;
499 unsigned long long bw;
500 double mean, dev;
501
502 bw = 0;
503 if (td->runtime[ddir])
504 bw = td->io_bytes[ddir] / td->runtime[ddir];
505
506 fprintf(f_out, ",%llu,%llu,%lu", td->io_bytes[ddir] >> 10, bw, td->runtime[ddir]);
507
508 if (calc_lat(&td->slat_stat[ddir], &min, &max, &mean, &dev))
509 fprintf(f_out, ",%lu,%lu,%f,%f", min, max, mean, dev);
510 else
511 fprintf(f_out, ",%lu,%lu,%f,%f", 0UL, 0UL, 0.0, 0.0);
512
513 if (calc_lat(&td->clat_stat[ddir], &min, &max, &mean, &dev))
514 fprintf(f_out, ",%lu,%lu,%f,%f", min, max, mean, dev);
515 else
516 fprintf(f_out, ",%lu,%lu,%f,%f", 0UL, 0UL, 0.0, 0.0);
517
518 if (calc_lat(&td->bw_stat[ddir], &min, &max, &mean, &dev)) {
519 double p_of_agg;
520
521 p_of_agg = mean * 100 / (double) rs->agg[ddir];
522 fprintf(f_out, ",%lu,%lu,%f%%,%f,%f", min, max, p_of_agg, mean, dev);
523 } else
524 fprintf(f_out, ",%lu,%lu,%f%%,%f,%f", 0UL, 0UL, 0.0, 0.0, 0.0);
525
526}
527
528
529static void show_thread_status_terse(struct thread_data *td,
530 struct group_run_stats *rs)
531{
532 double usr_cpu, sys_cpu;
533
534 fprintf(f_out, "%s,%d,%d",td->name, td->groupid, td->error);
535
536 show_ddir_status_terse(td, rs, 0);
537 show_ddir_status_terse(td, rs, 1);
538
539 if (td->runtime[0] + td->runtime[1]) {
1e97cce9 540 double runt = (double) (td->runtime[0] + td->runtime[1]);
c6ae0a5b
JA
541
542 usr_cpu = (double) td->usr_time * 100 / runt;
543 sys_cpu = (double) td->sys_time * 100 / runt;
544 } else {
545 usr_cpu = 0;
546 sys_cpu = 0;
547 }
548
549 fprintf(f_out, ",%f%%,%f%%,%lu\n", usr_cpu, sys_cpu, td->ctx);
550}
551
3c39a379
JA
552void show_run_stats(void)
553{
554 struct group_run_stats *runstats, *rs;
555 struct thread_data *td;
556 int i;
557
558 runstats = malloc(sizeof(struct group_run_stats) * (groupid + 1));
559
560 for (i = 0; i < groupid + 1; i++) {
561 rs = &runstats[i];
562
563 memset(rs, 0, sizeof(*rs));
564 rs->min_bw[0] = rs->min_run[0] = ~0UL;
565 rs->min_bw[1] = rs->min_run[1] = ~0UL;
566 }
567
34572e28 568 for_each_td(td, i) {
3c39a379
JA
569 unsigned long long rbw, wbw;
570
3c39a379
JA
571 rs = &runstats[td->groupid];
572
573 if (td->runtime[0] < rs->min_run[0] || !rs->min_run[0])
574 rs->min_run[0] = td->runtime[0];
575 if (td->runtime[0] > rs->max_run[0])
576 rs->max_run[0] = td->runtime[0];
577 if (td->runtime[1] < rs->min_run[1] || !rs->min_run[1])
578 rs->min_run[1] = td->runtime[1];
579 if (td->runtime[1] > rs->max_run[1])
580 rs->max_run[1] = td->runtime[1];
581
582 rbw = wbw = 0;
583 if (td->runtime[0])
584 rbw = td->io_bytes[0] / (unsigned long long) td->runtime[0];
585 if (td->runtime[1])
586 wbw = td->io_bytes[1] / (unsigned long long) td->runtime[1];
587
588 if (rbw < rs->min_bw[0])
589 rs->min_bw[0] = rbw;
590 if (wbw < rs->min_bw[1])
591 rs->min_bw[1] = wbw;
592 if (rbw > rs->max_bw[0])
593 rs->max_bw[0] = rbw;
594 if (wbw > rs->max_bw[1])
595 rs->max_bw[1] = wbw;
596
597 rs->io_kb[0] += td->io_bytes[0] >> 10;
598 rs->io_kb[1] += td->io_bytes[1] >> 10;
599 }
600
601 for (i = 0; i < groupid + 1; i++) {
602 rs = &runstats[i];
603
604 if (rs->max_run[0])
605 rs->agg[0] = (rs->io_kb[0]*1024) / rs->max_run[0];
606 if (rs->max_run[1])
607 rs->agg[1] = (rs->io_kb[1]*1024) / rs->max_run[1];
608 }
609
610 /*
611 * don't overwrite last signal output
612 */
c6ae0a5b
JA
613 if (!terse_output)
614 printf("\n");
3c39a379 615
34572e28 616 for_each_td(td, i) {
3c39a379
JA
617 rs = &runstats[td->groupid];
618
c6ae0a5b
JA
619 if (terse_output)
620 show_thread_status_terse(td, rs);
621 else
622 show_thread_status(td, rs);
3c39a379
JA
623 }
624
c6ae0a5b
JA
625 if (!terse_output) {
626 for (i = 0; i < groupid + 1; i++)
627 show_group_stats(&runstats[i], i);
3c39a379 628
c6ae0a5b
JA
629 show_disk_util();
630 }
eecf272f
JA
631
632 free(runstats);
3c39a379
JA
633}
634
68704084 635static inline void add_stat_sample(struct io_stat *is, unsigned long data)
3c39a379 636{
68704084
JA
637 double val = data;
638 double delta, n;
639
640 if (data > is->max_val)
641 is->max_val = data;
642 if (data < is->min_val)
643 is->min_val = data;
644
645 delta = val - is->mean;
646 n = is->samples + 1.0;
647 is->mean += delta / n;
648 is->S += delta * (val - is->mean);
3c39a379 649
3c39a379
JA
650 is->samples++;
651}
652
bb3884d8
JA
653static void __add_log_sample(struct io_log *iolog, unsigned long val,
654 enum fio_ddir ddir, unsigned long time)
3c39a379
JA
655{
656 if (iolog->nr_samples == iolog->max_samples) {
657 int new_size = sizeof(struct io_sample) * iolog->max_samples*2;
658
659 iolog->log = realloc(iolog->log, new_size);
660 iolog->max_samples <<= 1;
661 }
662
663 iolog->log[iolog->nr_samples].val = val;
bb3884d8 664 iolog->log[iolog->nr_samples].time = time;
3c39a379
JA
665 iolog->log[iolog->nr_samples].ddir = ddir;
666 iolog->nr_samples++;
667}
668
bb3884d8
JA
669static void add_log_sample(struct thread_data *td, struct io_log *iolog,
670 unsigned long val, enum fio_ddir ddir)
671{
672 __add_log_sample(iolog, val, ddir, mtime_since_now(&td->epoch));
673}
674
675void add_agg_sample(unsigned long val, enum fio_ddir ddir)
676{
677 struct io_log *iolog = agg_io_log[ddir];
678
679 __add_log_sample(iolog, val, ddir, mtime_since_genesis());
680}
681
1e97cce9
JA
682void add_clat_sample(struct thread_data *td, enum fio_ddir ddir,
683 unsigned long msec)
3c39a379
JA
684{
685 add_stat_sample(&td->clat_stat[ddir], msec);
686
687 if (td->clat_log)
688 add_log_sample(td, td->clat_log, msec, ddir);
689}
690
1e97cce9
JA
691void add_slat_sample(struct thread_data *td, enum fio_ddir ddir,
692 unsigned long msec)
3c39a379
JA
693{
694 add_stat_sample(&td->slat_stat[ddir], msec);
695
696 if (td->slat_log)
697 add_log_sample(td, td->slat_log, msec, ddir);
698}
699
1e97cce9
JA
700void add_bw_sample(struct thread_data *td, enum fio_ddir ddir,
701 struct timeval *t)
3c39a379 702{
02bcaa8c 703 unsigned long spent = mtime_since(&td->stat_sample_time[ddir], t);
3c39a379
JA
704 unsigned long rate;
705
706 if (spent < td->bw_avg_time)
707 return;
708
709 rate = (td->this_io_bytes[ddir] - td->stat_io_bytes[ddir]) / spent;
710 add_stat_sample(&td->bw_stat[ddir], rate);
711
712 if (td->bw_log)
713 add_log_sample(td, td->bw_log, rate, ddir);
714
02bcaa8c 715 fio_gettime(&td->stat_sample_time[ddir], NULL);
3c39a379
JA
716 td->stat_io_bytes[ddir] = td->this_io_bytes[ddir];
717}
718
719