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