12 static int last_majdev, last_mindev;
14 static struct flist_head disk_list = FLIST_HEAD_INIT(disk_list);
16 static int get_io_ticks(struct disk_util *du, struct disk_util_stat *dus)
24 dprint(FD_DISKUTIL, "open stat file: %s\n", du->path);
26 f = fopen(du->path, "r");
30 p = fgets(line, sizeof(line), f);
36 dprint(FD_DISKUTIL, "%s: %s", du->path, p);
38 ret = sscanf(p, "%u %u %llu %u %u %u %llu %u %u %u %u\n", &dus->ios[0],
39 &dus->merges[0], &dus->sectors[0],
40 &dus->ticks[0], &dus->ios[1],
41 &dus->merges[1], &dus->sectors[1],
42 &dus->ticks[1], &in_flight,
43 &dus->io_ticks, &dus->time_in_queue);
45 dprint(FD_DISKUTIL, "%s: stat read ok? %d\n", du->path, ret == 1);
49 static void update_io_tick_disk(struct disk_util *du)
51 struct disk_util_stat __dus, *dus, *ldus;
54 if (get_io_ticks(du, &__dus))
60 dus->sectors[0] += (__dus.sectors[0] - ldus->sectors[0]);
61 dus->sectors[1] += (__dus.sectors[1] - ldus->sectors[1]);
62 dus->ios[0] += (__dus.ios[0] - ldus->ios[0]);
63 dus->ios[1] += (__dus.ios[1] - ldus->ios[1]);
64 dus->merges[0] += (__dus.merges[0] - ldus->merges[0]);
65 dus->merges[1] += (__dus.merges[1] - ldus->merges[1]);
66 dus->ticks[0] += (__dus.ticks[0] - ldus->ticks[0]);
67 dus->ticks[1] += (__dus.ticks[1] - ldus->ticks[1]);
68 dus->io_ticks += (__dus.io_ticks - ldus->io_ticks);
69 dus->time_in_queue += (__dus.time_in_queue - ldus->time_in_queue);
71 fio_gettime(&t, NULL);
72 du->msec += mtime_since(&du->time, &t);
73 memcpy(&du->time, &t, sizeof(t));
74 memcpy(ldus, &__dus, sizeof(__dus));
77 void update_io_ticks(void)
79 struct flist_head *entry;
82 dprint(FD_DISKUTIL, "update io ticks\n");
84 flist_for_each(entry, &disk_list) {
85 du = flist_entry(entry, struct disk_util, list);
86 update_io_tick_disk(du);
90 static struct disk_util *disk_util_exists(int major, int minor)
92 struct flist_head *entry;
95 flist_for_each(entry, &disk_list) {
96 du = flist_entry(entry, struct disk_util, list);
98 if (major == du->major && minor == du->minor)
105 static void disk_util_add(int majdev, int mindev, char *path)
107 struct disk_util *du, *__du;
108 struct flist_head *entry;
110 dprint(FD_DISKUTIL, "add maj/min %d/%d: %s\n", majdev, mindev, path);
112 du = malloc(sizeof(*du));
113 memset(du, 0, sizeof(*du));
114 INIT_FLIST_HEAD(&du->list);
115 sprintf(du->path, "%s/stat", path);
116 du->name = strdup(basename(path));
117 du->sysfs_root = path;
121 flist_for_each(entry, &disk_list) {
122 __du = flist_entry(entry, struct disk_util, list);
124 dprint(FD_DISKUTIL, "found %s in list\n", __du->name);
126 if (!strcmp(du->name, __du->name)) {
133 dprint(FD_DISKUTIL, "add %s to list\n", du->name);
135 fio_gettime(&du->time, NULL);
136 get_io_ticks(du, &du->last_dus);
138 flist_add_tail(&du->list, &disk_list);
141 static int check_dev_match(int majdev, int mindev, char *path)
147 f = fopen(path, "r");
153 p = fgets(line, sizeof(line), f);
159 if (sscanf(p, "%u:%u", &major, &minor) != 2) {
164 if (majdev == major && mindev == minor) {
173 static int find_block_dir(int majdev, int mindev, char *path, int link_ok)
184 while ((dir = readdir(D)) != NULL) {
187 if (!strcmp(dir->d_name, ".") || !strcmp(dir->d_name, ".."))
190 sprintf(full_path, "%s/%s", path, dir->d_name);
192 if (!strcmp(dir->d_name, "dev")) {
193 if (!check_dev_match(majdev, mindev, full_path)) {
200 if (stat(full_path, &st) == -1) {
205 if (lstat(full_path, &st) == -1) {
211 if (!S_ISDIR(st.st_mode) || S_ISLNK(st.st_mode))
214 found = find_block_dir(majdev, mindev, full_path, 0);
216 strcpy(path, full_path);
225 static void __init_disk_util(struct thread_data *td, struct fio_file *f)
228 char foo[PATH_MAX], tmp[PATH_MAX];
229 struct disk_util *du;
233 if (!lstat(f->file_name, &st)) {
234 if (S_ISBLK(st.st_mode)) {
235 majdev = major(st.st_rdev);
236 mindev = minor(st.st_rdev);
237 } else if (S_ISCHR(st.st_mode)) {
238 majdev = major(st.st_rdev);
239 mindev = minor(st.st_rdev);
240 if (fio_lookup_raw(st.st_rdev, &majdev, &mindev))
242 } else if (S_ISFIFO(st.st_mode))
245 majdev = major(st.st_dev);
246 mindev = minor(st.st_dev);
250 * must be a file, open "." in that path
252 strncpy(foo, f->file_name, PATH_MAX - 1);
255 perror("disk util stat");
259 majdev = major(st.st_dev);
260 mindev = minor(st.st_dev);
263 dprint(FD_DISKUTIL, "%s belongs to maj/min %d/%d\n", f->file_name,
266 du = disk_util_exists(majdev, mindev);
268 if (td->o.ioscheduler && !td->sysfs_root)
269 td->sysfs_root = strdup(du->sysfs_root);
275 * for an fs without a device, we will repeatedly stat through
276 * sysfs which can take oodles of time for thousands of files. so
277 * cache the last lookup and compare with that before going through
280 if (mindev == last_mindev && majdev == last_majdev)
283 last_mindev = mindev;
284 last_majdev = majdev;
286 sprintf(foo, "/sys/block");
287 if (!find_block_dir(majdev, mindev, foo, 1))
291 * If there's a ../queue/ directory there, we are inside a partition.
292 * Check if that is the case and jump back. For loop/md/dm etc we
293 * are already in the right spot.
295 sprintf(tmp, "%s/../queue", foo);
296 if (!stat(tmp, &st)) {
298 sprintf(tmp, "%s/queue", p);
299 if (stat(tmp, &st)) {
300 log_err("unknown sysfs layout\n");
303 strncpy(tmp, p, PATH_MAX - 1);
304 sprintf(foo, "%s", tmp);
307 if (td->o.ioscheduler && !td->sysfs_root)
308 td->sysfs_root = strdup(foo);
310 disk_util_add(majdev, mindev, foo);
313 void init_disk_util(struct thread_data *td)
318 if (!td->o.do_disk_util ||
319 (td->io_ops->flags & (FIO_DISKLESSIO | FIO_NODISKUTIL)))
322 for_each_file(td, f, i)
323 __init_disk_util(td, f);
326 void show_disk_util(void)
328 struct disk_util_stat *dus;
329 struct flist_head *entry, *next;
330 struct disk_util *du;
333 if (flist_empty(&disk_list))
336 log_info("\nDisk stats (read/write):\n");
338 flist_for_each(entry, &disk_list) {
339 du = flist_entry(entry, struct disk_util, list);
342 util = (double) 100 * du->dus.io_ticks / (double) du->msec;
346 log_info(" %s: ios=%u/%u, merge=%u/%u, ticks=%u/%u, "
347 "in_queue=%u, util=%3.2f%%\n", du->name,
348 dus->ios[0], dus->ios[1],
349 dus->merges[0], dus->merges[1],
350 dus->ticks[0], dus->ticks[1],
351 dus->time_in_queue, util);
357 flist_for_each_safe(entry, next, &disk_list) {
359 du = flist_entry(entry, struct disk_util, list);