14 static int last_majdev, last_mindev;
15 static struct disk_util *last_du;
17 static struct flist_head disk_list = FLIST_HEAD_INIT(disk_list);
19 static void disk_util_free(struct disk_util *du)
24 fio_mutex_remove(du->lock);
29 static int get_io_ticks(struct disk_util *du, struct disk_util_stat *dus)
37 dprint(FD_DISKUTIL, "open stat file: %s\n", du->path);
39 f = fopen(du->path, "r");
43 p = fgets(line, sizeof(line), f);
49 dprint(FD_DISKUTIL, "%s: %s", du->path, p);
51 ret = sscanf(p, "%u %u %llu %u %u %u %llu %u %u %u %u\n", &dus->ios[0],
52 &dus->merges[0], &dus->sectors[0],
53 &dus->ticks[0], &dus->ios[1],
54 &dus->merges[1], &dus->sectors[1],
55 &dus->ticks[1], &in_flight,
56 &dus->io_ticks, &dus->time_in_queue);
58 dprint(FD_DISKUTIL, "%s: stat read ok? %d\n", du->path, ret == 1);
62 static void update_io_tick_disk(struct disk_util *du)
64 struct disk_util_stat __dus, *dus, *ldus;
67 if (get_io_ticks(du, &__dus))
75 dus->sectors[0] += (__dus.sectors[0] - ldus->sectors[0]);
76 dus->sectors[1] += (__dus.sectors[1] - ldus->sectors[1]);
77 dus->ios[0] += (__dus.ios[0] - ldus->ios[0]);
78 dus->ios[1] += (__dus.ios[1] - ldus->ios[1]);
79 dus->merges[0] += (__dus.merges[0] - ldus->merges[0]);
80 dus->merges[1] += (__dus.merges[1] - ldus->merges[1]);
81 dus->ticks[0] += (__dus.ticks[0] - ldus->ticks[0]);
82 dus->ticks[1] += (__dus.ticks[1] - ldus->ticks[1]);
83 dus->io_ticks += (__dus.io_ticks - ldus->io_ticks);
84 dus->time_in_queue += (__dus.time_in_queue - ldus->time_in_queue);
86 fio_gettime(&t, NULL);
87 du->msec += mtime_since(&du->time, &t);
88 memcpy(&du->time, &t, sizeof(t));
89 memcpy(ldus, &__dus, sizeof(__dus));
92 void update_io_ticks(void)
94 struct flist_head *entry;
97 dprint(FD_DISKUTIL, "update io ticks\n");
99 flist_for_each(entry, &disk_list) {
100 du = flist_entry(entry, struct disk_util, list);
101 update_io_tick_disk(du);
105 static struct disk_util *disk_util_exists(int major, int minor)
107 struct flist_head *entry;
108 struct disk_util *du;
110 flist_for_each(entry, &disk_list) {
111 du = flist_entry(entry, struct disk_util, list);
113 if (major == du->major && minor == du->minor)
120 static int get_device_numbers(char *file_name, int *maj, int *min)
124 char tempname[PATH_MAX], *p;
126 if (!lstat(file_name, &st)) {
127 if (S_ISBLK(st.st_mode)) {
128 majdev = major(st.st_rdev);
129 mindev = minor(st.st_rdev);
130 } else if (S_ISCHR(st.st_mode)) {
131 majdev = major(st.st_rdev);
132 mindev = minor(st.st_rdev);
133 if (fio_lookup_raw(st.st_rdev, &majdev, &mindev))
135 } else if (S_ISFIFO(st.st_mode))
138 majdev = major(st.st_dev);
139 mindev = minor(st.st_dev);
143 * must be a file, open "." in that path
145 strncpy(tempname, file_name, PATH_MAX - 1);
146 p = dirname(tempname);
148 perror("disk util stat");
152 majdev = major(st.st_dev);
153 mindev = minor(st.st_dev);
162 static int read_block_dev_entry(char *path, int *maj, int *min)
167 f = fopen(path, "r");
173 p = fgets(line, sizeof(line), f);
179 if (sscanf(p, "%u:%u", maj, min) != 2)
185 static struct disk_util *__init_per_file_disk_util(struct thread_data *td,
186 int majdev, int mindev, char * path);
188 static void find_add_disk_slaves(struct thread_data *td, char *path,
189 struct disk_util *masterdu)
191 DIR *dirhandle = NULL;
192 struct dirent *dirent = NULL;
193 char slavesdir[PATH_MAX], temppath[PATH_MAX], slavepath[PATH_MAX];
194 struct disk_util *slavedu = NULL;
198 sprintf(slavesdir, "%s/%s",path, "slaves");
199 dirhandle = opendir(slavesdir);
203 while ((dirent = readdir(dirhandle)) != NULL) {
204 if (!strcmp(dirent->d_name, ".") || !strcmp(dirent->d_name, ".."))
207 sprintf(temppath, "%s/%s", slavesdir, dirent->d_name);
208 /* Can we always assume that the slaves device entries
209 * are links to the real directories for the slave
212 if ((linklen = readlink(temppath, slavepath, PATH_MAX-1)) < 0) {
213 perror("readlink() for slave device.");
216 slavepath[linklen]='\0';
218 sprintf(temppath, "%s/%s/dev", slavesdir, slavepath);
219 if (read_block_dev_entry(temppath, &majdev, &mindev)) {
220 perror("Error getting slave device numbers.");
224 sprintf(temppath, "%s/%s", slavesdir, slavepath);
225 __init_per_file_disk_util(td, majdev, mindev, temppath);
226 slavedu = disk_util_exists(majdev, mindev);
228 /* Should probably use an assert here. slavedu should
229 * always be present at this point. */
231 flist_add_tail(&slavedu->slavelist, &masterdu->slaves);
238 static struct disk_util *disk_util_add(struct thread_data * td, int majdev,
239 int mindev, char *path)
241 struct disk_util *du, *__du;
242 struct flist_head *entry;
244 dprint(FD_DISKUTIL, "add maj/min %d/%d: %s\n", majdev, mindev, path);
246 du = smalloc(sizeof(*du));
247 memset(du, 0, sizeof(*du));
248 INIT_FLIST_HEAD(&du->list);
249 sprintf(du->path, "%s/stat", path);
250 du->name = smalloc_strdup(basename(path));
251 du->sysfs_root = path;
254 INIT_FLIST_HEAD(&du->slavelist);
255 INIT_FLIST_HEAD(&du->slaves);
256 du->lock = fio_mutex_init(1);
259 flist_for_each(entry, &disk_list) {
260 __du = flist_entry(entry, struct disk_util, list);
262 dprint(FD_DISKUTIL, "found %s in list\n", __du->name);
264 if (!strcmp(du->name, __du->name)) {
270 dprint(FD_DISKUTIL, "add %s to list\n", du->name);
272 fio_gettime(&du->time, NULL);
273 get_io_ticks(du, &du->last_dus);
275 flist_add_tail(&du->list, &disk_list);
276 find_add_disk_slaves(td, path, du);
281 static int check_dev_match(int majdev, int mindev, char *path)
285 if (read_block_dev_entry(path, &major, &minor))
288 if (majdev == major && mindev == minor)
294 static int find_block_dir(int majdev, int mindev, char *path, int link_ok)
305 while ((dir = readdir(D)) != NULL) {
308 if (!strcmp(dir->d_name, ".") || !strcmp(dir->d_name, ".."))
311 sprintf(full_path, "%s/%s", path, dir->d_name);
313 if (!strcmp(dir->d_name, "dev")) {
314 if (!check_dev_match(majdev, mindev, full_path)) {
321 if (stat(full_path, &st) == -1) {
326 if (lstat(full_path, &st) == -1) {
332 if (!S_ISDIR(st.st_mode) || S_ISLNK(st.st_mode))
335 found = find_block_dir(majdev, mindev, full_path, 0);
337 strcpy(path, full_path);
346 static struct disk_util *__init_per_file_disk_util(struct thread_data *td,
347 int majdev, int mindev,
355 * If there's a ../queue/ directory there, we are inside a partition.
356 * Check if that is the case and jump back. For loop/md/dm etc we
357 * are already in the right spot.
359 sprintf(tmp, "%s/../queue", path);
360 if (!stat(tmp, &st)) {
362 sprintf(tmp, "%s/queue", p);
363 if (stat(tmp, &st)) {
364 log_err("unknown sysfs layout\n");
367 strncpy(tmp, p, PATH_MAX - 1);
368 sprintf(path, "%s", tmp);
371 if (td->o.ioscheduler && !td->sysfs_root)
372 td->sysfs_root = strdup(path);
374 return disk_util_add(td, majdev, mindev, path);
377 static struct disk_util *init_per_file_disk_util(struct thread_data *td,
382 struct disk_util *du;
385 if (get_device_numbers(filename, &majdev, &mindev))
388 dprint(FD_DISKUTIL, "%s belongs to maj/min %d/%d\n", filename, majdev,
391 du = disk_util_exists(majdev, mindev);
393 if (td->o.ioscheduler && !td->sysfs_root)
394 td->sysfs_root = strdup(du->sysfs_root);
400 * for an fs without a device, we will repeatedly stat through
401 * sysfs which can take oodles of time for thousands of files. so
402 * cache the last lookup and compare with that before going through
405 if (mindev == last_mindev && majdev == last_majdev)
408 last_mindev = mindev;
409 last_majdev = majdev;
411 sprintf(foo, "/sys/block");
412 if (!find_block_dir(majdev, mindev, foo, 1))
415 return __init_per_file_disk_util(td, majdev, mindev, foo);
418 static struct disk_util *__init_disk_util(struct thread_data *td,
421 return init_per_file_disk_util(td, f->file_name);
424 void init_disk_util(struct thread_data *td)
429 if (!td->o.do_disk_util ||
430 (td->io_ops->flags & (FIO_DISKLESSIO | FIO_NODISKUTIL)))
433 for_each_file(td, f, i)
434 f->du = __init_disk_util(td, f);
437 static void aggregate_slaves_stats(struct disk_util *masterdu)
439 struct disk_util_stat *dus;
440 struct flist_head *entry;
441 struct disk_util *slavedu;
442 double util, max_util = 0;
445 unsigned merges[2] = { 0, };
446 unsigned ticks[2] = { 0, };
447 unsigned time_in_queue = { 0, };
448 unsigned long long sectors[2] = { 0, };
449 unsigned ios[2] = { 0, };
451 flist_for_each(entry, &masterdu->slaves) {
452 slavedu = flist_entry(entry, struct disk_util, slavelist);
454 ios[0] += dus->ios[0];
455 ios[1] += dus->ios[1];
456 merges[0] += dus->merges[0];
457 merges[1] += dus->merges[1];
458 sectors[0] += dus->sectors[0];
459 sectors[1] += dus->sectors[1];
460 ticks[0] += dus->ticks[0];
461 ticks[1] += dus->ticks[1];
462 time_in_queue += dus->time_in_queue;
465 util = (double) (100 * dus->io_ticks / (double) slavedu->msec);
466 /* System utilization is the utilization of the
467 * component with the highest utilization.
474 if (max_util > 100.0)
477 log_info(", aggrios=%u/%u, aggrmerge=%u/%u, aggrticks=%u/%u,"
478 " aggrin_queue=%u, aggrutil=%3.2f%%",
479 ios[0]/slavecount, ios[1]/slavecount,
480 merges[0]/slavecount, merges[1]/slavecount,
481 ticks[0]/slavecount, ticks[1]/slavecount,
482 time_in_queue/slavecount, max_util);
486 void show_disk_util(void)
488 struct disk_util_stat *dus;
489 struct flist_head *entry, *next;
490 struct disk_util *du;
493 if (flist_empty(&disk_list))
496 log_info("\nDisk stats (read/write):\n");
498 flist_for_each(entry, &disk_list) {
499 du = flist_entry(entry, struct disk_util, list);
502 util = (double) 100 * du->dus.io_ticks / (double) du->msec;
506 /* If this node is the slave of a master device, as
507 * happens in case of software RAIDs, inward-indent
508 * this stats line to reflect a master-slave
509 * relationship. Because the master device gets added
510 * before the slave devices, we can safely assume that
511 * the master's stats line has been displayed in a
512 * previous iteration of this loop.
514 if(!flist_empty(&du->slavelist))
517 log_info(" %s: ios=%u/%u, merge=%u/%u, ticks=%u/%u, "
518 "in_queue=%u, util=%3.2f%%", du->name,
519 dus->ios[0], dus->ios[1],
520 dus->merges[0], dus->merges[1],
521 dus->ticks[0], dus->ticks[1],
522 dus->time_in_queue, util);
524 /* If the device has slaves, aggregate the stats for
525 * those slave devices also.
527 if(!flist_empty(&du->slaves))
528 aggregate_slaves_stats(du);
536 flist_for_each_safe(entry, next, &disk_list) {
538 du = flist_entry(entry, struct disk_util, list);