Optimize the code that copies strings
[fio.git] / diskutil.c
... / ...
CommitLineData
1#include <stdio.h>
2#include <string.h>
3#include <sys/types.h>
4#include <sys/stat.h>
5#include <sys/sysmacros.h>
6#include <dirent.h>
7#include <libgen.h>
8#ifdef CONFIG_VALGRIND_DEV
9#include <valgrind/drd.h>
10#else
11#define DRD_IGNORE_VAR(x) do { } while (0)
12#endif
13
14#include "fio.h"
15#include "smalloc.h"
16#include "diskutil.h"
17#include "helper_thread.h"
18
19static int last_majdev, last_mindev;
20static struct disk_util *last_du;
21
22static struct fio_sem *disk_util_sem;
23
24static struct disk_util *__init_per_file_disk_util(struct thread_data *td,
25 int majdev, int mindev, char *path);
26
27static void disk_util_free(struct disk_util *du)
28{
29 if (du == last_du)
30 last_du = NULL;
31
32 while (!flist_empty(&du->slaves)) {
33 struct disk_util *slave;
34
35 slave = flist_first_entry(&du->slaves, struct disk_util, slavelist);
36 flist_del(&slave->slavelist);
37 slave->users--;
38 }
39
40 fio_sem_remove(du->lock);
41 free(du->sysfs_root);
42 sfree(du);
43}
44
45static int get_io_ticks(struct disk_util *du, struct disk_util_stat *dus)
46{
47 unsigned in_flight;
48 unsigned long long sectors[2];
49 char line[256];
50 FILE *f;
51 char *p;
52 int ret;
53
54 dprint(FD_DISKUTIL, "open stat file: %s\n", du->path);
55
56 f = fopen(du->path, "r");
57 if (!f)
58 return 1;
59
60 p = fgets(line, sizeof(line), f);
61 if (!p) {
62 fclose(f);
63 return 1;
64 }
65
66 dprint(FD_DISKUTIL, "%s: %s", du->path, p);
67
68 ret = sscanf(p, "%llu %llu %llu %llu %llu %llu %llu %llu %u %llu %llu\n",
69 (unsigned long long *) &dus->s.ios[0],
70 (unsigned long long *) &dus->s.merges[0],
71 &sectors[0],
72 (unsigned long long *) &dus->s.ticks[0],
73 (unsigned long long *) &dus->s.ios[1],
74 (unsigned long long *) &dus->s.merges[1],
75 &sectors[1],
76 (unsigned long long *) &dus->s.ticks[1],
77 &in_flight,
78 (unsigned long long *) &dus->s.io_ticks,
79 (unsigned long long *) &dus->s.time_in_queue);
80 fclose(f);
81 dprint(FD_DISKUTIL, "%s: stat read ok? %d\n", du->path, ret == 1);
82 dus->s.sectors[0] = sectors[0];
83 dus->s.sectors[1] = sectors[1];
84 return ret != 11;
85}
86
87static void update_io_tick_disk(struct disk_util *du)
88{
89 struct disk_util_stat __dus, *dus, *ldus;
90 struct timespec t;
91
92 if (!du->users)
93 return;
94 if (get_io_ticks(du, &__dus))
95 return;
96
97 dus = &du->dus;
98 ldus = &du->last_dus;
99
100 dus->s.sectors[0] += (__dus.s.sectors[0] - ldus->s.sectors[0]);
101 dus->s.sectors[1] += (__dus.s.sectors[1] - ldus->s.sectors[1]);
102 dus->s.ios[0] += (__dus.s.ios[0] - ldus->s.ios[0]);
103 dus->s.ios[1] += (__dus.s.ios[1] - ldus->s.ios[1]);
104 dus->s.merges[0] += (__dus.s.merges[0] - ldus->s.merges[0]);
105 dus->s.merges[1] += (__dus.s.merges[1] - ldus->s.merges[1]);
106 dus->s.ticks[0] += (__dus.s.ticks[0] - ldus->s.ticks[0]);
107 dus->s.ticks[1] += (__dus.s.ticks[1] - ldus->s.ticks[1]);
108 dus->s.io_ticks += (__dus.s.io_ticks - ldus->s.io_ticks);
109 dus->s.time_in_queue += (__dus.s.time_in_queue - ldus->s.time_in_queue);
110
111 fio_gettime(&t, NULL);
112 dus->s.msec += mtime_since(&du->time, &t);
113 memcpy(&du->time, &t, sizeof(t));
114 memcpy(&ldus->s, &__dus.s, sizeof(__dus.s));
115}
116
117int update_io_ticks(void)
118{
119 struct flist_head *entry;
120 struct disk_util *du;
121 int ret = 0;
122
123 dprint(FD_DISKUTIL, "update io ticks\n");
124
125 fio_sem_down(disk_util_sem);
126
127 if (!helper_should_exit()) {
128 flist_for_each(entry, &disk_list) {
129 du = flist_entry(entry, struct disk_util, list);
130 update_io_tick_disk(du);
131 }
132 } else
133 ret = 1;
134
135 fio_sem_up(disk_util_sem);
136 return ret;
137}
138
139static struct disk_util *disk_util_exists(int major, int minor)
140{
141 struct flist_head *entry;
142 struct disk_util *du;
143
144 fio_sem_down(disk_util_sem);
145
146 flist_for_each(entry, &disk_list) {
147 du = flist_entry(entry, struct disk_util, list);
148
149 if (major == du->major && minor == du->minor) {
150 fio_sem_up(disk_util_sem);
151 return du;
152 }
153 }
154
155 fio_sem_up(disk_util_sem);
156 return NULL;
157}
158
159static int get_device_numbers(char *file_name, int *maj, int *min)
160{
161 struct stat st;
162 int majdev, mindev;
163 char tempname[PATH_MAX], *p;
164
165 if (!lstat(file_name, &st)) {
166 if (S_ISBLK(st.st_mode)) {
167 majdev = major(st.st_rdev);
168 mindev = minor(st.st_rdev);
169 } else if (S_ISCHR(st.st_mode)) {
170 majdev = major(st.st_rdev);
171 mindev = minor(st.st_rdev);
172 if (fio_lookup_raw(st.st_rdev, &majdev, &mindev))
173 return -1;
174 } else if (S_ISFIFO(st.st_mode))
175 return -1;
176 else {
177 majdev = major(st.st_dev);
178 mindev = minor(st.st_dev);
179 }
180 } else {
181 /*
182 * must be a file, open "." in that path
183 */
184 snprintf(tempname, ARRAY_SIZE(tempname), "%s", file_name);
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 nowarn_snprintf(temppath, sizeof(temppath), "%s/%s", slavesdir,
245 dirent->d_name);
246 /* Can we always assume that the slaves device entries
247 * are links to the real directories for the slave
248 * devices?
249 */
250 linklen = readlink(temppath, slavepath, PATH_MAX - 1);
251 if (linklen < 0) {
252 perror("readlink() for slave device.");
253 closedir(dirhandle);
254 return;
255 }
256 slavepath[linklen] = '\0';
257
258 nowarn_snprintf(temppath, sizeof(temppath), "%s/%s/dev",
259 slavesdir, slavepath);
260 if (access(temppath, F_OK) != 0)
261 nowarn_snprintf(temppath, sizeof(temppath),
262 "%s/%s/device/dev", slavesdir,
263 slavepath);
264 if (read_block_dev_entry(temppath, &majdev, &mindev)) {
265 perror("Error getting slave device numbers");
266 closedir(dirhandle);
267 return;
268 }
269
270 /*
271 * See if this maj,min already exists
272 */
273 slavedu = disk_util_exists(majdev, mindev);
274 if (slavedu)
275 continue;
276
277 nowarn_snprintf(temppath, sizeof(temppath), "%s/%s", slavesdir,
278 slavepath);
279 __init_per_file_disk_util(td, majdev, mindev, temppath);
280 slavedu = disk_util_exists(majdev, mindev);
281
282 /* Should probably use an assert here. slavedu should
283 * always be present at this point. */
284 if (slavedu) {
285 slavedu->users++;
286 flist_add_tail(&slavedu->slavelist, &masterdu->slaves);
287 }
288 }
289
290 closedir(dirhandle);
291}
292
293static struct disk_util *disk_util_add(struct thread_data *td, int majdev,
294 int mindev, char *path)
295{
296 struct disk_util *du, *__du;
297 struct flist_head *entry;
298 int l;
299
300 dprint(FD_DISKUTIL, "add maj/min %d/%d: %s\n", majdev, mindev, path);
301
302 du = smalloc(sizeof(*du));
303 if (!du)
304 return NULL;
305
306 DRD_IGNORE_VAR(du->users);
307 memset(du, 0, sizeof(*du));
308 INIT_FLIST_HEAD(&du->list);
309 l = snprintf(du->path, sizeof(du->path), "%s/stat", path);
310 if (l < 0 || l >= sizeof(du->path)) {
311 log_err("constructed path \"%.100s[...]/stat\" larger than buffer (%zu bytes)\n",
312 path, sizeof(du->path) - 1);
313 sfree(du);
314 return NULL;
315 }
316 snprintf((char *) du->dus.name, ARRAY_SIZE(du->dus.name), "%s",
317 basename(path));
318 du->sysfs_root = strdup(path);
319 du->major = majdev;
320 du->minor = mindev;
321 INIT_FLIST_HEAD(&du->slavelist);
322 INIT_FLIST_HEAD(&du->slaves);
323 du->lock = fio_sem_init(FIO_SEM_UNLOCKED);
324 du->users = 0;
325
326 fio_sem_down(disk_util_sem);
327
328 flist_for_each(entry, &disk_list) {
329 __du = flist_entry(entry, struct disk_util, list);
330
331 dprint(FD_DISKUTIL, "found %s in list\n", __du->dus.name);
332
333 if (!strcmp((char *) du->dus.name, (char *) __du->dus.name)) {
334 disk_util_free(du);
335 fio_sem_up(disk_util_sem);
336 return __du;
337 }
338 }
339
340 dprint(FD_DISKUTIL, "add %s to list\n", du->dus.name);
341
342 fio_gettime(&du->time, NULL);
343 get_io_ticks(du, &du->last_dus);
344
345 flist_add_tail(&du->list, &disk_list);
346 fio_sem_up(disk_util_sem);
347
348 find_add_disk_slaves(td, path, du);
349 return du;
350}
351
352static int check_dev_match(int majdev, int mindev, char *path)
353{
354 int major, minor;
355
356 if (read_block_dev_entry(path, &major, &minor))
357 return 1;
358
359 if (majdev == major && mindev == minor)
360 return 0;
361
362 return 1;
363}
364
365static int find_block_dir(int majdev, int mindev, char *path, int link_ok)
366{
367 struct dirent *dir;
368 struct stat st;
369 int found = 0;
370 DIR *D;
371
372 D = opendir(path);
373 if (!D)
374 return 0;
375
376 while ((dir = readdir(D)) != NULL) {
377 char full_path[257];
378
379 if (!strcmp(dir->d_name, ".") || !strcmp(dir->d_name, ".."))
380 continue;
381
382 sprintf(full_path, "%s/%s", path, dir->d_name);
383
384 if (!strcmp(dir->d_name, "dev")) {
385 if (!check_dev_match(majdev, mindev, full_path)) {
386 found = 1;
387 break;
388 }
389 }
390
391 if (link_ok) {
392 if (stat(full_path, &st) == -1) {
393 perror("stat");
394 break;
395 }
396 } else {
397 if (lstat(full_path, &st) == -1) {
398 perror("stat");
399 break;
400 }
401 }
402
403 if (!S_ISDIR(st.st_mode) || S_ISLNK(st.st_mode))
404 continue;
405
406 found = find_block_dir(majdev, mindev, full_path, 0);
407 if (found) {
408 strcpy(path, full_path);
409 break;
410 }
411 }
412
413 closedir(D);
414 return found;
415}
416
417static struct disk_util *__init_per_file_disk_util(struct thread_data *td,
418 int majdev, int mindev,
419 char *path)
420{
421 struct stat st;
422 char tmp[PATH_MAX];
423 char *p;
424
425 /*
426 * If there's a ../queue/ directory there, we are inside a partition.
427 * Check if that is the case and jump back. For loop/md/dm etc we
428 * are already in the right spot.
429 */
430 sprintf(tmp, "%s/../queue", path);
431 if (!stat(tmp, &st)) {
432 p = dirname(path);
433 sprintf(tmp, "%s/queue", p);
434 if (stat(tmp, &st)) {
435 log_err("unknown sysfs layout\n");
436 return NULL;
437 }
438 snprintf(tmp, ARRAY_SIZE(tmp), "%s", p);
439 sprintf(path, "%s", tmp);
440 }
441
442 return disk_util_add(td, majdev, mindev, path);
443}
444
445static struct disk_util *init_per_file_disk_util(struct thread_data *td,
446 char *filename)
447{
448
449 char foo[PATH_MAX];
450 struct disk_util *du;
451 int mindev, majdev;
452
453 if (get_device_numbers(filename, &majdev, &mindev))
454 return NULL;
455
456 dprint(FD_DISKUTIL, "%s belongs to maj/min %d/%d\n", filename, majdev,
457 mindev);
458
459 du = disk_util_exists(majdev, mindev);
460 if (du)
461 return du;
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_sem_down(disk_util_sem);
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_sem_up(disk_util_sem);
581 fio_sem_remove(disk_util_sem);
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 (!is_running_backend())
704 return;
705
706 fio_sem_down(disk_util_sem);
707
708 if (flist_empty(&disk_list)) {
709 fio_sem_up(disk_util_sem);
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_sem_up(disk_util_sem);
733}
734
735void setup_disk_util(void)
736{
737 disk_util_sem = fio_sem_init(FIO_SEM_UNLOCKED);
738}