file: fio_files_done() can return bool
[fio.git] / diskutil.c
... / ...
CommitLineData
1#include <stdio.h>
2#include <string.h>
3#include <sys/time.h>
4#include <sys/types.h>
5#include <sys/stat.h>
6#include <dirent.h>
7#include <libgen.h>
8#include <math.h>
9#include <assert.h>
10
11#include "fio.h"
12#include "smalloc.h"
13#include "diskutil.h"
14#include "helper_thread.h"
15
16static int last_majdev, last_mindev;
17static struct disk_util *last_du;
18
19static struct fio_mutex *disk_util_mutex;
20
21FLIST_HEAD(disk_list);
22
23static struct disk_util *__init_per_file_disk_util(struct thread_data *td,
24 int majdev, int mindev, char *path);
25
26static void disk_util_free(struct disk_util *du)
27{
28 if (du == last_du)
29 last_du = NULL;
30
31 while (!flist_empty(&du->slaves)) {
32 struct disk_util *slave;
33
34 slave = flist_first_entry(&du->slaves, struct disk_util, slavelist);
35 flist_del(&slave->slavelist);
36 slave->users--;
37 }
38
39 fio_mutex_remove(du->lock);
40 sfree(du);
41}
42
43static int get_io_ticks(struct disk_util *du, struct disk_util_stat *dus)
44{
45 unsigned in_flight;
46 unsigned long long sectors[2];
47 char line[256];
48 FILE *f;
49 char *p;
50 int ret;
51
52 dprint(FD_DISKUTIL, "open stat file: %s\n", du->path);
53
54 f = fopen(du->path, "r");
55 if (!f)
56 return 1;
57
58 p = fgets(line, sizeof(line), f);
59 if (!p) {
60 fclose(f);
61 return 1;
62 }
63
64 dprint(FD_DISKUTIL, "%s: %s", du->path, p);
65
66 ret = sscanf(p, "%llu %llu %llu %llu %llu %llu %llu %llu %u %llu %llu\n",
67 (unsigned long long *) &dus->s.ios[0],
68 (unsigned long long *) &dus->s.merges[0],
69 &sectors[0],
70 (unsigned long long *) &dus->s.ticks[0],
71 (unsigned long long *) &dus->s.ios[1],
72 (unsigned long long *) &dus->s.merges[1],
73 &sectors[1],
74 (unsigned long long *) &dus->s.ticks[1],
75 &in_flight,
76 (unsigned long long *) &dus->s.io_ticks,
77 (unsigned long long *) &dus->s.time_in_queue);
78 fclose(f);
79 dprint(FD_DISKUTIL, "%s: stat read ok? %d\n", du->path, ret == 1);
80 dus->s.sectors[0] = sectors[0];
81 dus->s.sectors[1] = sectors[1];
82 return ret != 11;
83}
84
85static void update_io_tick_disk(struct disk_util *du)
86{
87 struct disk_util_stat __dus, *dus, *ldus;
88 struct timeval t;
89
90 if (!du->users)
91 return;
92 if (get_io_ticks(du, &__dus))
93 return;
94
95 dus = &du->dus;
96 ldus = &du->last_dus;
97
98 dus->s.sectors[0] += (__dus.s.sectors[0] - ldus->s.sectors[0]);
99 dus->s.sectors[1] += (__dus.s.sectors[1] - ldus->s.sectors[1]);
100 dus->s.ios[0] += (__dus.s.ios[0] - ldus->s.ios[0]);
101 dus->s.ios[1] += (__dus.s.ios[1] - ldus->s.ios[1]);
102 dus->s.merges[0] += (__dus.s.merges[0] - ldus->s.merges[0]);
103 dus->s.merges[1] += (__dus.s.merges[1] - ldus->s.merges[1]);
104 dus->s.ticks[0] += (__dus.s.ticks[0] - ldus->s.ticks[0]);
105 dus->s.ticks[1] += (__dus.s.ticks[1] - ldus->s.ticks[1]);
106 dus->s.io_ticks += (__dus.s.io_ticks - ldus->s.io_ticks);
107 dus->s.time_in_queue += (__dus.s.time_in_queue - ldus->s.time_in_queue);
108
109 fio_gettime(&t, NULL);
110 dus->s.msec += mtime_since(&du->time, &t);
111 memcpy(&du->time, &t, sizeof(t));
112 memcpy(&ldus->s, &__dus.s, sizeof(__dus.s));
113}
114
115int update_io_ticks(void)
116{
117 struct flist_head *entry;
118 struct disk_util *du;
119 int ret = 0;
120
121 dprint(FD_DISKUTIL, "update io ticks\n");
122
123 fio_mutex_down(disk_util_mutex);
124
125 if (!helper_should_exit()) {
126 flist_for_each(entry, &disk_list) {
127 du = flist_entry(entry, struct disk_util, list);
128 update_io_tick_disk(du);
129 }
130 } else
131 ret = 1;
132
133 fio_mutex_up(disk_util_mutex);
134 return ret;
135}
136
137static struct disk_util *disk_util_exists(int major, int minor)
138{
139 struct flist_head *entry;
140 struct disk_util *du;
141
142 fio_mutex_down(disk_util_mutex);
143
144 flist_for_each(entry, &disk_list) {
145 du = flist_entry(entry, struct disk_util, list);
146
147 if (major == du->major && minor == du->minor) {
148 fio_mutex_up(disk_util_mutex);
149 return du;
150 }
151 }
152
153 fio_mutex_up(disk_util_mutex);
154 return NULL;
155}
156
157static int get_device_numbers(char *file_name, int *maj, int *min)
158{
159 struct stat st;
160 int majdev, mindev;
161 char tempname[PATH_MAX], *p;
162
163 if (!lstat(file_name, &st)) {
164 if (S_ISBLK(st.st_mode)) {
165 majdev = major(st.st_rdev);
166 mindev = minor(st.st_rdev);
167 } else if (S_ISCHR(st.st_mode)) {
168 majdev = major(st.st_rdev);
169 mindev = minor(st.st_rdev);
170 if (fio_lookup_raw(st.st_rdev, &majdev, &mindev))
171 return -1;
172 } else if (S_ISFIFO(st.st_mode))
173 return -1;
174 else {
175 majdev = major(st.st_dev);
176 mindev = minor(st.st_dev);
177 }
178 } else {
179 /*
180 * must be a file, open "." in that path
181 */
182 tempname[PATH_MAX - 1] = '\0';
183 strncpy(tempname, file_name, PATH_MAX - 1);
184 p = dirname(tempname);
185 if (stat(p, &st)) {
186 perror("disk util stat");
187 return -1;
188 }
189
190 majdev = major(st.st_dev);
191 mindev = minor(st.st_dev);
192 }
193
194 *min = mindev;
195 *maj = majdev;
196
197 return 0;
198}
199
200static int read_block_dev_entry(char *path, int *maj, int *min)
201{
202 char line[256], *p;
203 FILE *f;
204
205 f = fopen(path, "r");
206 if (!f) {
207 perror("open path");
208 return 1;
209 }
210
211 p = fgets(line, sizeof(line), f);
212 fclose(f);
213
214 if (!p)
215 return 1;
216
217 if (sscanf(p, "%u:%u", maj, min) != 2)
218 return 1;
219
220 return 0;
221}
222
223static void find_add_disk_slaves(struct thread_data *td, char *path,
224 struct disk_util *masterdu)
225{
226 DIR *dirhandle = NULL;
227 struct dirent *dirent = NULL;
228 char slavesdir[PATH_MAX], temppath[PATH_MAX], slavepath[PATH_MAX];
229 struct disk_util *slavedu = NULL;
230 int majdev, mindev;
231 ssize_t linklen;
232
233 sprintf(slavesdir, "%s/%s", path, "slaves");
234 dirhandle = opendir(slavesdir);
235 if (!dirhandle)
236 return;
237
238 while ((dirent = readdir(dirhandle)) != NULL) {
239 if (!strcmp(dirent->d_name, ".") ||
240 !strcmp(dirent->d_name, ".."))
241 continue;
242
243 sprintf(temppath, "%s/%s", slavesdir, dirent->d_name);
244 /* Can we always assume that the slaves device entries
245 * are links to the real directories for the slave
246 * devices?
247 */
248 linklen = readlink(temppath, slavepath, PATH_MAX - 1);
249 if (linklen < 0) {
250 perror("readlink() for slave device.");
251 closedir(dirhandle);
252 return;
253 }
254 slavepath[linklen] = '\0';
255
256 sprintf(temppath, "%s/%s/dev", slavesdir, slavepath);
257 if (read_block_dev_entry(temppath, &majdev, &mindev)) {
258 perror("Error getting slave device numbers.");
259 closedir(dirhandle);
260 return;
261 }
262
263 /*
264 * See if this maj,min already exists
265 */
266 slavedu = disk_util_exists(majdev, mindev);
267 if (slavedu)
268 continue;
269
270 sprintf(temppath, "%s/%s", slavesdir, slavepath);
271 __init_per_file_disk_util(td, majdev, mindev, temppath);
272 slavedu = disk_util_exists(majdev, mindev);
273
274 /* Should probably use an assert here. slavedu should
275 * always be present at this point. */
276 if (slavedu) {
277 slavedu->users++;
278 flist_add_tail(&slavedu->slavelist, &masterdu->slaves);
279 }
280 }
281
282 closedir(dirhandle);
283}
284
285static struct disk_util *disk_util_add(struct thread_data *td, int majdev,
286 int mindev, char *path)
287{
288 struct disk_util *du, *__du;
289 struct flist_head *entry;
290 int l;
291
292 dprint(FD_DISKUTIL, "add maj/min %d/%d: %s\n", majdev, mindev, path);
293
294 du = smalloc(sizeof(*du));
295 if (!du) {
296 log_err("fio: smalloc() pool exhausted\n");
297 return NULL;
298 }
299
300 memset(du, 0, sizeof(*du));
301 INIT_FLIST_HEAD(&du->list);
302 l = snprintf(du->path, sizeof(du->path), "%s/stat", path);
303 if (l < 0 || l >= sizeof(du->path)) {
304 log_err("constructed path \"%.100s[...]/stat\" larger than buffer (%zu bytes)\n",
305 path, sizeof(du->path) - 1);
306 sfree(du);
307 return NULL;
308 }
309 strncpy((char *) du->dus.name, basename(path), FIO_DU_NAME_SZ - 1);
310 du->sysfs_root = path;
311 du->major = majdev;
312 du->minor = mindev;
313 INIT_FLIST_HEAD(&du->slavelist);
314 INIT_FLIST_HEAD(&du->slaves);
315 du->lock = fio_mutex_init(FIO_MUTEX_UNLOCKED);
316 du->users = 0;
317
318 fio_mutex_down(disk_util_mutex);
319
320 flist_for_each(entry, &disk_list) {
321 __du = flist_entry(entry, struct disk_util, list);
322
323 dprint(FD_DISKUTIL, "found %s in list\n", __du->dus.name);
324
325 if (!strcmp((char *) du->dus.name, (char *) __du->dus.name)) {
326 disk_util_free(du);
327 fio_mutex_up(disk_util_mutex);
328 return __du;
329 }
330 }
331
332 dprint(FD_DISKUTIL, "add %s to list\n", du->dus.name);
333
334 fio_gettime(&du->time, NULL);
335 get_io_ticks(du, &du->last_dus);
336
337 flist_add_tail(&du->list, &disk_list);
338 fio_mutex_up(disk_util_mutex);
339
340 find_add_disk_slaves(td, path, du);
341 return du;
342}
343
344static int check_dev_match(int majdev, int mindev, char *path)
345{
346 int major, minor;
347
348 if (read_block_dev_entry(path, &major, &minor))
349 return 1;
350
351 if (majdev == major && mindev == minor)
352 return 0;
353
354 return 1;
355}
356
357static int find_block_dir(int majdev, int mindev, char *path, int link_ok)
358{
359 struct dirent *dir;
360 struct stat st;
361 int found = 0;
362 DIR *D;
363
364 D = opendir(path);
365 if (!D)
366 return 0;
367
368 while ((dir = readdir(D)) != NULL) {
369 char full_path[256];
370
371 if (!strcmp(dir->d_name, ".") || !strcmp(dir->d_name, ".."))
372 continue;
373
374 sprintf(full_path, "%s/%s", path, dir->d_name);
375
376 if (!strcmp(dir->d_name, "dev")) {
377 if (!check_dev_match(majdev, mindev, full_path)) {
378 found = 1;
379 break;
380 }
381 }
382
383 if (link_ok) {
384 if (stat(full_path, &st) == -1) {
385 perror("stat");
386 break;
387 }
388 } else {
389 if (lstat(full_path, &st) == -1) {
390 perror("stat");
391 break;
392 }
393 }
394
395 if (!S_ISDIR(st.st_mode) || S_ISLNK(st.st_mode))
396 continue;
397
398 found = find_block_dir(majdev, mindev, full_path, 0);
399 if (found) {
400 strcpy(path, full_path);
401 break;
402 }
403 }
404
405 closedir(D);
406 return found;
407}
408
409static struct disk_util *__init_per_file_disk_util(struct thread_data *td,
410 int majdev, int mindev,
411 char *path)
412{
413 struct stat st;
414 char tmp[PATH_MAX];
415 char *p;
416
417 /*
418 * If there's a ../queue/ directory there, we are inside a partition.
419 * Check if that is the case and jump back. For loop/md/dm etc we
420 * are already in the right spot.
421 */
422 sprintf(tmp, "%s/../queue", path);
423 if (!stat(tmp, &st)) {
424 p = dirname(path);
425 sprintf(tmp, "%s/queue", p);
426 if (stat(tmp, &st)) {
427 log_err("unknown sysfs layout\n");
428 return NULL;
429 }
430 tmp[PATH_MAX - 1] = '\0';
431 strncpy(tmp, p, PATH_MAX - 1);
432 sprintf(path, "%s", tmp);
433 }
434
435 if (td->o.ioscheduler && !td->sysfs_root)
436 td->sysfs_root = strdup(path);
437
438 return disk_util_add(td, majdev, mindev, path);
439}
440
441static struct disk_util *init_per_file_disk_util(struct thread_data *td,
442 char *filename)
443{
444
445 char foo[PATH_MAX];
446 struct disk_util *du;
447 int mindev, majdev;
448
449 if (get_device_numbers(filename, &majdev, &mindev))
450 return NULL;
451
452 dprint(FD_DISKUTIL, "%s belongs to maj/min %d/%d\n", filename, majdev,
453 mindev);
454
455 du = disk_util_exists(majdev, mindev);
456 if (du) {
457 if (td->o.ioscheduler && !td->sysfs_root)
458 td->sysfs_root = strdup(du->sysfs_root);
459
460 return du;
461 }
462
463 /*
464 * for an fs without a device, we will repeatedly stat through
465 * sysfs which can take oodles of time for thousands of files. so
466 * cache the last lookup and compare with that before going through
467 * everything again.
468 */
469 if (mindev == last_mindev && majdev == last_majdev)
470 return last_du;
471
472 last_mindev = mindev;
473 last_majdev = majdev;
474
475 sprintf(foo, "/sys/block");
476 if (!find_block_dir(majdev, mindev, foo, 1))
477 return NULL;
478
479 return __init_per_file_disk_util(td, majdev, mindev, foo);
480}
481
482static struct disk_util *__init_disk_util(struct thread_data *td,
483 struct fio_file *f)
484{
485 return init_per_file_disk_util(td, f->file_name);
486}
487
488void init_disk_util(struct thread_data *td)
489{
490 struct fio_file *f;
491 unsigned int i;
492
493 if (!td->o.do_disk_util ||
494 td_ioengine_flagged(td, FIO_DISKLESSIO | FIO_NODISKUTIL))
495 return;
496
497 for_each_file(td, f, i)
498 f->du = __init_disk_util(td, f);
499}
500
501static void show_agg_stats(struct disk_util_agg *agg, int terse,
502 struct buf_output *out)
503{
504 if (!agg->slavecount)
505 return;
506
507 if (!terse) {
508 log_buf(out, ", aggrios=%llu/%llu, aggrmerge=%llu/%llu, "
509 "aggrticks=%llu/%llu, aggrin_queue=%llu, "
510 "aggrutil=%3.2f%%",
511 (unsigned long long) agg->ios[0] / agg->slavecount,
512 (unsigned long long) agg->ios[1] / agg->slavecount,
513 (unsigned long long) agg->merges[0] / agg->slavecount,
514 (unsigned long long) agg->merges[1] / agg->slavecount,
515 (unsigned long long) agg->ticks[0] / agg->slavecount,
516 (unsigned long long) agg->ticks[1] / agg->slavecount,
517 (unsigned long long) agg->time_in_queue / agg->slavecount,
518 agg->max_util.u.f);
519 } else {
520 log_buf(out, ";slaves;%llu;%llu;%llu;%llu;%llu;%llu;%llu;%3.2f%%",
521 (unsigned long long) agg->ios[0] / agg->slavecount,
522 (unsigned long long) agg->ios[1] / agg->slavecount,
523 (unsigned long long) agg->merges[0] / agg->slavecount,
524 (unsigned long long) agg->merges[1] / agg->slavecount,
525 (unsigned long long) agg->ticks[0] / agg->slavecount,
526 (unsigned long long) agg->ticks[1] / agg->slavecount,
527 (unsigned long long) agg->time_in_queue / agg->slavecount,
528 agg->max_util.u.f);
529 }
530}
531
532static void aggregate_slaves_stats(struct disk_util *masterdu)
533{
534 struct disk_util_agg *agg = &masterdu->agg;
535 struct disk_util_stat *dus;
536 struct flist_head *entry;
537 struct disk_util *slavedu;
538 double util;
539
540 flist_for_each(entry, &masterdu->slaves) {
541 slavedu = flist_entry(entry, struct disk_util, slavelist);
542 dus = &slavedu->dus;
543 agg->ios[0] += dus->s.ios[0];
544 agg->ios[1] += dus->s.ios[1];
545 agg->merges[0] += dus->s.merges[0];
546 agg->merges[1] += dus->s.merges[1];
547 agg->sectors[0] += dus->s.sectors[0];
548 agg->sectors[1] += dus->s.sectors[1];
549 agg->ticks[0] += dus->s.ticks[0];
550 agg->ticks[1] += dus->s.ticks[1];
551 agg->time_in_queue += dus->s.time_in_queue;
552 agg->slavecount++;
553
554 util = (double) (100 * dus->s.io_ticks / (double) slavedu->dus.s.msec);
555 /* System utilization is the utilization of the
556 * component with the highest utilization.
557 */
558 if (util > agg->max_util.u.f)
559 agg->max_util.u.f = util;
560
561 }
562
563 if (agg->max_util.u.f > 100.0)
564 agg->max_util.u.f = 100.0;
565}
566
567void disk_util_prune_entries(void)
568{
569 fio_mutex_down(disk_util_mutex);
570
571 while (!flist_empty(&disk_list)) {
572 struct disk_util *du;
573
574 du = flist_first_entry(&disk_list, struct disk_util, list);
575 flist_del(&du->list);
576 disk_util_free(du);
577 }
578
579 last_majdev = last_mindev = -1;
580 fio_mutex_up(disk_util_mutex);
581 fio_mutex_remove(disk_util_mutex);
582}
583
584void print_disk_util(struct disk_util_stat *dus, struct disk_util_agg *agg,
585 int terse, struct buf_output *out)
586{
587 double util = 0;
588
589 if (dus->s.msec)
590 util = (double) 100 * dus->s.io_ticks / (double) dus->s.msec;
591 if (util > 100.0)
592 util = 100.0;
593
594 if (!terse) {
595 if (agg->slavecount)
596 log_buf(out, " ");
597
598 log_buf(out, " %s: ios=%llu/%llu, merge=%llu/%llu, "
599 "ticks=%llu/%llu, in_queue=%llu, util=%3.2f%%",
600 dus->name,
601 (unsigned long long) dus->s.ios[0],
602 (unsigned long long) dus->s.ios[1],
603 (unsigned long long) dus->s.merges[0],
604 (unsigned long long) dus->s.merges[1],
605 (unsigned long long) dus->s.ticks[0],
606 (unsigned long long) dus->s.ticks[1],
607 (unsigned long long) dus->s.time_in_queue,
608 util);
609 } else {
610 log_buf(out, ";%s;%llu;%llu;%llu;%llu;%llu;%llu;%llu;%3.2f%%",
611 dus->name,
612 (unsigned long long) dus->s.ios[0],
613 (unsigned long long) dus->s.ios[1],
614 (unsigned long long) dus->s.merges[0],
615 (unsigned long long) dus->s.merges[1],
616 (unsigned long long) dus->s.ticks[0],
617 (unsigned long long) dus->s.ticks[1],
618 (unsigned long long) dus->s.time_in_queue,
619 util);
620 }
621
622 /*
623 * If the device has slaves, aggregate the stats for
624 * those slave devices also.
625 */
626 show_agg_stats(agg, terse, out);
627
628 if (!terse)
629 log_buf(out, "\n");
630}
631
632void json_array_add_disk_util(struct disk_util_stat *dus,
633 struct disk_util_agg *agg, struct json_array *array)
634{
635 struct json_object *obj;
636 double util = 0;
637
638 if (dus->s.msec)
639 util = (double) 100 * dus->s.io_ticks / (double) dus->s.msec;
640 if (util > 100.0)
641 util = 100.0;
642
643 obj = json_create_object();
644 json_array_add_value_object(array, obj);
645
646 json_object_add_value_string(obj, "name", dus->name);
647 json_object_add_value_int(obj, "read_ios", dus->s.ios[0]);
648 json_object_add_value_int(obj, "write_ios", dus->s.ios[1]);
649 json_object_add_value_int(obj, "read_merges", dus->s.merges[0]);
650 json_object_add_value_int(obj, "write_merges", dus->s.merges[1]);
651 json_object_add_value_int(obj, "read_ticks", dus->s.ticks[0]);
652 json_object_add_value_int(obj, "write_ticks", dus->s.ticks[1]);
653 json_object_add_value_int(obj, "in_queue", dus->s.time_in_queue);
654 json_object_add_value_float(obj, "util", util);
655
656 /*
657 * If the device has slaves, aggregate the stats for
658 * those slave devices also.
659 */
660 if (!agg->slavecount)
661 return;
662 json_object_add_value_int(obj, "aggr_read_ios",
663 agg->ios[0] / agg->slavecount);
664 json_object_add_value_int(obj, "aggr_write_ios",
665 agg->ios[1] / agg->slavecount);
666 json_object_add_value_int(obj, "aggr_read_merges",
667 agg->merges[0] / agg->slavecount);
668 json_object_add_value_int(obj, "aggr_write_merge",
669 agg->merges[1] / agg->slavecount);
670 json_object_add_value_int(obj, "aggr_read_ticks",
671 agg->ticks[0] / agg->slavecount);
672 json_object_add_value_int(obj, "aggr_write_ticks",
673 agg->ticks[1] / agg->slavecount);
674 json_object_add_value_int(obj, "aggr_in_queue",
675 agg->time_in_queue / agg->slavecount);
676 json_object_add_value_float(obj, "aggr_util", agg->max_util.u.f);
677}
678
679static void json_object_add_disk_utils(struct json_object *obj,
680 struct flist_head *head)
681{
682 struct json_array *array = json_create_array();
683 struct flist_head *entry;
684 struct disk_util *du;
685
686 json_object_add_value_array(obj, "disk_util", array);
687
688 flist_for_each(entry, head) {
689 du = flist_entry(entry, struct disk_util, list);
690
691 aggregate_slaves_stats(du);
692 json_array_add_disk_util(&du->dus, &du->agg, array);
693 }
694}
695
696void show_disk_util(int terse, struct json_object *parent,
697 struct buf_output *out)
698{
699 struct flist_head *entry;
700 struct disk_util *du;
701 bool do_json;
702
703 if (!disk_util_mutex)
704 return;
705
706 fio_mutex_down(disk_util_mutex);
707
708 if (flist_empty(&disk_list)) {
709 fio_mutex_up(disk_util_mutex);
710 return;
711 }
712
713 if ((output_format & FIO_OUTPUT_JSON) && parent)
714 do_json = true;
715 else
716 do_json = false;
717
718 if (!terse && !do_json)
719 log_buf(out, "\nDisk stats (read/write):\n");
720
721 if (do_json)
722 json_object_add_disk_utils(parent, &disk_list);
723 else if (output_format & ~(FIO_OUTPUT_JSON | FIO_OUTPUT_JSON_PLUS)) {
724 flist_for_each(entry, &disk_list) {
725 du = flist_entry(entry, struct disk_util, list);
726
727 aggregate_slaves_stats(du);
728 print_disk_util(&du->dus, &du->agg, terse, out);
729 }
730 }
731
732 fio_mutex_up(disk_util_mutex);
733}
734
735void setup_disk_util(void)
736{
737 disk_util_mutex = fio_mutex_init(FIO_MUTEX_UNLOCKED);
738}