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)
24 f = fopen(du->path, "r");
28 p = fgets(line, sizeof(line), f);
34 if (sscanf(p, "%u %u %llu %u %u %u %llu %u %u %u %u\n", &dus->ios[0], &dus->merges[0], &dus->sectors[0], &dus->ticks[0], &dus->ios[1], &dus->merges[1], &dus->sectors[1], &dus->ticks[1], &in_flight, &dus->io_ticks, &dus->time_in_queue) != 11) {
43 static void update_io_tick_disk(struct disk_util *du)
45 struct disk_util_stat __dus, *dus, *ldus;
48 if (get_io_ticks(du, &__dus))
54 dus->sectors[0] += (__dus.sectors[0] - ldus->sectors[0]);
55 dus->sectors[1] += (__dus.sectors[1] - ldus->sectors[1]);
56 dus->ios[0] += (__dus.ios[0] - ldus->ios[0]);
57 dus->ios[1] += (__dus.ios[1] - ldus->ios[1]);
58 dus->merges[0] += (__dus.merges[0] - ldus->merges[0]);
59 dus->merges[1] += (__dus.merges[1] - ldus->merges[1]);
60 dus->ticks[0] += (__dus.ticks[0] - ldus->ticks[0]);
61 dus->ticks[1] += (__dus.ticks[1] - ldus->ticks[1]);
62 dus->io_ticks += (__dus.io_ticks - ldus->io_ticks);
63 dus->time_in_queue += (__dus.time_in_queue - ldus->time_in_queue);
65 fio_gettime(&t, NULL);
66 du->msec += mtime_since(&du->time, &t);
67 memcpy(&du->time, &t, sizeof(t));
68 memcpy(ldus, &__dus, sizeof(__dus));
71 void update_io_ticks(void)
73 struct list_head *entry;
76 list_for_each(entry, &disk_list) {
77 du = list_entry(entry, struct disk_util, list);
78 update_io_tick_disk(du);
82 static struct disk_util *disk_util_exists(int major, int minor)
84 struct list_head *entry;
87 list_for_each(entry, &disk_list) {
88 du = list_entry(entry, struct disk_util, list);
90 if (major == du->major && minor == du->minor)
97 static void disk_util_add(int majdev, int mindev, char *path)
99 struct disk_util *du, *__du;
100 struct list_head *entry;
102 du = malloc(sizeof(*du));
103 memset(du, 0, sizeof(*du));
104 INIT_LIST_HEAD(&du->list);
105 sprintf(du->path, "%s/stat", path);
106 du->name = strdup(basename(path));
107 du->sysfs_root = path;
111 list_for_each(entry, &disk_list) {
112 __du = list_entry(entry, struct disk_util, list);
114 if (!strcmp(du->name, __du->name)) {
121 fio_gettime(&du->time, NULL);
122 get_io_ticks(du, &du->last_dus);
124 list_add_tail(&du->list, &disk_list);
127 static int check_dev_match(int majdev, int mindev, char *path)
133 f = fopen(path, "r");
139 p = fgets(line, sizeof(line), f);
145 if (sscanf(p, "%u:%u", &major, &minor) != 2) {
150 if (majdev == major && mindev == minor) {
159 static int find_block_dir(int majdev, int mindev, char *path)
170 while ((dir = readdir(D)) != NULL) {
173 if (!strcmp(dir->d_name, ".") || !strcmp(dir->d_name, ".."))
176 sprintf(full_path, "%s/%s", path, dir->d_name);
178 if (!strcmp(dir->d_name, "dev")) {
179 if (!check_dev_match(majdev, mindev, full_path)) {
185 if (lstat(full_path, &st) == -1) {
190 if (!S_ISDIR(st.st_mode) || S_ISLNK(st.st_mode))
193 found = find_block_dir(majdev, mindev, full_path);
195 strcpy(path, full_path);
204 static void __init_disk_util(struct thread_data *td, struct fio_file *f)
207 char foo[PATH_MAX], tmp[PATH_MAX];
208 struct disk_util *du;
212 if (!lstat(f->file_name, &st)) {
213 if (S_ISBLK(st.st_mode)) {
214 majdev = major(st.st_rdev);
215 mindev = minor(st.st_rdev);
216 } else if (S_ISCHR(st.st_mode)) {
217 majdev = major(st.st_rdev);
218 mindev = minor(st.st_rdev);
219 if (fio_lookup_raw(st.st_rdev, &majdev, &mindev))
221 } else if (S_ISFIFO(st.st_mode))
224 majdev = major(st.st_dev);
225 mindev = minor(st.st_dev);
229 * must be a file, open "." in that path
231 strncpy(foo, f->file_name, PATH_MAX - 1);
234 perror("disk util stat");
238 majdev = major(st.st_dev);
239 mindev = minor(st.st_dev);
242 du = disk_util_exists(majdev, mindev);
244 if (td->o.ioscheduler && !td->sysfs_root)
245 td->sysfs_root = strdup(du->sysfs_root);
251 * for an fs without a device, we will repeatedly stat through
252 * sysfs which can take oodles of time for thousands of files. so
253 * cache the last lookup and compare with that before going through
256 if (mindev == last_mindev && majdev == last_majdev)
259 last_mindev = mindev;
260 last_majdev = majdev;
262 sprintf(foo, "/sys/block");
263 if (!find_block_dir(majdev, mindev, foo))
267 * If there's a ../queue/ directory there, we are inside a partition.
268 * Check if that is the case and jump back. For loop/md/dm etc we
269 * are already in the right spot.
271 sprintf(tmp, "%s/../queue", foo);
272 if (!stat(tmp, &st)) {
274 sprintf(tmp, "%s/queue", p);
275 if (stat(tmp, &st)) {
276 log_err("unknown sysfs layout\n");
279 strncpy(tmp, p, PATH_MAX - 1);
280 sprintf(foo, "%s", tmp);
283 if (td->o.ioscheduler && !td->sysfs_root)
284 td->sysfs_root = strdup(foo);
286 disk_util_add(majdev, mindev, foo);
289 void init_disk_util(struct thread_data *td)
294 if (!td->o.do_disk_util ||
295 (td->io_ops->flags & (FIO_DISKLESSIO | FIO_NODISKUTIL)))
298 for_each_file(td, f, i)
299 __init_disk_util(td, f);
302 void disk_util_timer_arm(void)
304 itimer.it_value.tv_sec = 0;
305 itimer.it_value.tv_usec = DISK_UTIL_MSEC * 1000;
306 setitimer(ITIMER_REAL, &itimer, NULL);
309 void show_disk_util(void)
311 struct disk_util_stat *dus;
312 struct list_head *entry, *next;
313 struct disk_util *du;
316 log_info("\nDisk stats (read/write):\n");
318 list_for_each(entry, &disk_list) {
319 du = list_entry(entry, struct disk_util, list);
322 util = (double) 100 * du->dus.io_ticks / (double) du->msec;
326 log_info(" %s: ios=%u/%u, merge=%u/%u, ticks=%u/%u, in_queue=%u, util=%3.2f%%\n", du->name, dus->ios[0], dus->ios[1], dus->merges[0], dus->merges[1], dus->ticks[0], dus->ticks[1], dus->time_in_queue, util);
332 list_for_each_safe(entry, next, &disk_list) {
334 du = list_entry(entry, struct disk_util, list);