12 static int last_majdev, last_mindev;
13 static struct itimerval itimer;
15 static struct list_head disk_list = LIST_HEAD_INIT(disk_list);
17 static int get_io_ticks(struct disk_util *du, struct disk_util_stat *dus)
25 dprint(FD_DISKUTIL, "open stat file: %s\n", du->path);
27 f = fopen(du->path, "r");
31 p = fgets(line, sizeof(line), f);
37 dprint(FD_DISKUTIL, "%s: %s", du->path, p);
39 ret = sscanf(p, "%u %u %llu %u %u %u %llu %u %u %u %u\n", &dus->ios[0],
40 &dus->merges[0], &dus->sectors[0],
41 &dus->ticks[0], &dus->ios[1],
42 &dus->merges[1], &dus->sectors[1],
43 &dus->ticks[1], &in_flight,
44 &dus->io_ticks, &dus->time_in_queue);
46 dprint(FD_DISKUTIL, "%s: stat read ok? %d\n", du->path, ret == 1);
50 static void update_io_tick_disk(struct disk_util *du)
52 struct disk_util_stat __dus, *dus, *ldus;
55 if (get_io_ticks(du, &__dus))
61 dus->sectors[0] += (__dus.sectors[0] - ldus->sectors[0]);
62 dus->sectors[1] += (__dus.sectors[1] - ldus->sectors[1]);
63 dus->ios[0] += (__dus.ios[0] - ldus->ios[0]);
64 dus->ios[1] += (__dus.ios[1] - ldus->ios[1]);
65 dus->merges[0] += (__dus.merges[0] - ldus->merges[0]);
66 dus->merges[1] += (__dus.merges[1] - ldus->merges[1]);
67 dus->ticks[0] += (__dus.ticks[0] - ldus->ticks[0]);
68 dus->ticks[1] += (__dus.ticks[1] - ldus->ticks[1]);
69 dus->io_ticks += (__dus.io_ticks - ldus->io_ticks);
70 dus->time_in_queue += (__dus.time_in_queue - ldus->time_in_queue);
72 fio_gettime(&t, NULL);
73 du->msec += mtime_since(&du->time, &t);
74 memcpy(&du->time, &t, sizeof(t));
75 memcpy(ldus, &__dus, sizeof(__dus));
78 void update_io_ticks(void)
80 struct list_head *entry;
83 dprint(FD_DISKUTIL, "update io ticks\n");
85 list_for_each(entry, &disk_list) {
86 du = list_entry(entry, struct disk_util, list);
87 update_io_tick_disk(du);
91 static struct disk_util *disk_util_exists(int major, int minor)
93 struct list_head *entry;
96 list_for_each(entry, &disk_list) {
97 du = list_entry(entry, struct disk_util, list);
99 if (major == du->major && minor == du->minor)
106 static void disk_util_add(int majdev, int mindev, char *path)
108 struct disk_util *du, *__du;
109 struct list_head *entry;
111 dprint(FD_DISKUTIL, "add maj/min %d/%d: %s\n", majdev, mindev, path);
113 du = malloc(sizeof(*du));
114 memset(du, 0, sizeof(*du));
115 INIT_LIST_HEAD(&du->list);
116 sprintf(du->path, "%s/stat", path);
117 du->name = strdup(basename(path));
118 du->sysfs_root = path;
122 list_for_each(entry, &disk_list) {
123 __du = list_entry(entry, struct disk_util, list);
125 dprint(FD_DISKUTIL, "found %s in list\n", __du->name);
127 if (!strcmp(du->name, __du->name)) {
134 dprint(FD_DISKUTIL, "add %s to list\n", du->name);
136 fio_gettime(&du->time, NULL);
137 get_io_ticks(du, &du->last_dus);
139 list_add_tail(&du->list, &disk_list);
142 static int check_dev_match(int majdev, int mindev, char *path)
148 f = fopen(path, "r");
154 p = fgets(line, sizeof(line), f);
160 if (sscanf(p, "%u:%u", &major, &minor) != 2) {
165 if (majdev == major && mindev == minor) {
174 static int find_block_dir(int majdev, int mindev, char *path)
185 while ((dir = readdir(D)) != NULL) {
188 if (!strcmp(dir->d_name, ".") || !strcmp(dir->d_name, ".."))
191 sprintf(full_path, "%s/%s", path, dir->d_name);
193 if (!strcmp(dir->d_name, "dev")) {
194 if (!check_dev_match(majdev, mindev, full_path)) {
200 if (lstat(full_path, &st) == -1) {
205 if (!S_ISDIR(st.st_mode) || S_ISLNK(st.st_mode))
208 found = find_block_dir(majdev, mindev, full_path);
210 strcpy(path, full_path);
219 static void __init_disk_util(struct thread_data *td, struct fio_file *f)
222 char foo[PATH_MAX], tmp[PATH_MAX];
223 struct disk_util *du;
227 if (!lstat(f->file_name, &st)) {
228 if (S_ISBLK(st.st_mode)) {
229 majdev = major(st.st_rdev);
230 mindev = minor(st.st_rdev);
231 } else if (S_ISCHR(st.st_mode)) {
232 majdev = major(st.st_rdev);
233 mindev = minor(st.st_rdev);
234 if (fio_lookup_raw(st.st_rdev, &majdev, &mindev))
236 } else if (S_ISFIFO(st.st_mode))
239 majdev = major(st.st_dev);
240 mindev = minor(st.st_dev);
244 * must be a file, open "." in that path
246 strncpy(foo, f->file_name, PATH_MAX - 1);
249 perror("disk util stat");
253 majdev = major(st.st_dev);
254 mindev = minor(st.st_dev);
257 dprint(FD_DISKUTIL, "%s belongs to maj/min %d/%d\n", f->file_name,
260 du = disk_util_exists(majdev, mindev);
262 if (td->o.ioscheduler && !td->sysfs_root)
263 td->sysfs_root = strdup(du->sysfs_root);
269 * for an fs without a device, we will repeatedly stat through
270 * sysfs which can take oodles of time for thousands of files. so
271 * cache the last lookup and compare with that before going through
274 if (mindev == last_mindev && majdev == last_majdev)
277 last_mindev = mindev;
278 last_majdev = majdev;
280 sprintf(foo, "/sys/block");
281 if (!find_block_dir(majdev, mindev, foo))
285 * If there's a ../queue/ directory there, we are inside a partition.
286 * Check if that is the case and jump back. For loop/md/dm etc we
287 * are already in the right spot.
289 sprintf(tmp, "%s/../queue", foo);
290 if (!stat(tmp, &st)) {
292 sprintf(tmp, "%s/queue", p);
293 if (stat(tmp, &st)) {
294 log_err("unknown sysfs layout\n");
297 strncpy(tmp, p, PATH_MAX - 1);
298 sprintf(foo, "%s", tmp);
301 if (td->o.ioscheduler && !td->sysfs_root)
302 td->sysfs_root = strdup(foo);
304 disk_util_add(majdev, mindev, foo);
307 void init_disk_util(struct thread_data *td)
312 if (!td->o.do_disk_util ||
313 (td->io_ops->flags & (FIO_DISKLESSIO | FIO_NODISKUTIL)))
316 for_each_file(td, f, i)
317 __init_disk_util(td, f);
320 void disk_util_timer_arm(void)
322 itimer.it_value.tv_sec = 0;
323 itimer.it_value.tv_usec = DISK_UTIL_MSEC * 1000;
324 setitimer(ITIMER_REAL, &itimer, NULL);
327 void show_disk_util(void)
329 struct disk_util_stat *dus;
330 struct list_head *entry, *next;
331 struct disk_util *du;
334 if (list_empty(&disk_list))
337 log_info("\nDisk stats (read/write):\n");
339 list_for_each(entry, &disk_list) {
340 du = list_entry(entry, struct disk_util, list);
343 util = (double) 100 * du->dus.io_ticks / (double) du->msec;
347 log_info(" %s: ios=%u/%u, merge=%u/%u, ticks=%u/%u, "
348 "in_queue=%u, util=%3.2f%%\n", du->name,
349 dus->ios[0], dus->ios[1],
350 dus->merges[0], dus->merges[1],
351 dus->ticks[0], dus->ticks[1],
352 dus->time_in_queue, util);
358 list_for_each_safe(entry, next, &disk_list) {
360 du = list_entry(entry, struct disk_util, list);