Commit | Line | Data |
---|---|---|
9f8f2064 JA |
1 | #include <stdio.h> |
2 | #include <string.h> | |
3 | #include <sys/time.h> | |
4 | #include <sys/types.h> | |
5 | #include <sys/stat.h> | |
6 | #include <dirent.h> | |
7 | #include <libgen.h> | |
8 | #include <math.h> | |
9 | ||
10 | #include "fio.h" | |
11 | ||
12 | static int last_majdev, last_mindev; | |
13 | static struct itimerval itimer; | |
14 | ||
15 | static struct list_head disk_list = LIST_HEAD_INIT(disk_list); | |
16 | ||
17 | static int get_io_ticks(struct disk_util *du, struct disk_util_stat *dus) | |
18 | { | |
19 | unsigned in_flight; | |
20 | char line[256]; | |
21 | FILE *f; | |
22 | char *p; | |
5ec10eaa | 23 | int ret; |
9f8f2064 | 24 | |
cd991b9e JA |
25 | dprint(FD_DISKUTIL, "open stat file: %s\n", du->path); |
26 | ||
9f8f2064 JA |
27 | f = fopen(du->path, "r"); |
28 | if (!f) | |
29 | return 1; | |
30 | ||
31 | p = fgets(line, sizeof(line), f); | |
32 | if (!p) { | |
33 | fclose(f); | |
34 | return 1; | |
35 | } | |
36 | ||
cd991b9e JA |
37 | dprint(FD_DISKUTIL, "%s: %s", du->path, p); |
38 | ||
39 | ret = sscanf(p, "%u %u %llu %u %u %u %llu %u %u %u %u\n", &dus->ios[0], | |
5ec10eaa JA |
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); | |
9f8f2064 | 45 | fclose(f); |
cd991b9e JA |
46 | dprint(FD_DISKUTIL, "%s: stat read ok? %d\n", du->path, ret == 1); |
47 | return ret != 11; | |
9f8f2064 JA |
48 | } |
49 | ||
50 | static void update_io_tick_disk(struct disk_util *du) | |
51 | { | |
52 | struct disk_util_stat __dus, *dus, *ldus; | |
53 | struct timeval t; | |
54 | ||
55 | if (get_io_ticks(du, &__dus)) | |
56 | return; | |
57 | ||
58 | dus = &du->dus; | |
59 | ldus = &du->last_dus; | |
60 | ||
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); | |
71 | ||
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)); | |
76 | } | |
77 | ||
78 | void update_io_ticks(void) | |
79 | { | |
80 | struct list_head *entry; | |
81 | struct disk_util *du; | |
82 | ||
cd991b9e JA |
83 | dprint(FD_DISKUTIL, "update io ticks\n"); |
84 | ||
9f8f2064 JA |
85 | list_for_each(entry, &disk_list) { |
86 | du = list_entry(entry, struct disk_util, list); | |
87 | update_io_tick_disk(du); | |
88 | } | |
89 | } | |
90 | ||
e11c410c | 91 | static struct disk_util *disk_util_exists(int major, int minor) |
9f8f2064 JA |
92 | { |
93 | struct list_head *entry; | |
94 | struct disk_util *du; | |
95 | ||
96 | list_for_each(entry, &disk_list) { | |
97 | du = list_entry(entry, struct disk_util, list); | |
98 | ||
99 | if (major == du->major && minor == du->minor) | |
e11c410c | 100 | return du; |
9f8f2064 JA |
101 | } |
102 | ||
e11c410c | 103 | return NULL; |
9f8f2064 JA |
104 | } |
105 | ||
106 | static void disk_util_add(int majdev, int mindev, char *path) | |
107 | { | |
108 | struct disk_util *du, *__du; | |
109 | struct list_head *entry; | |
110 | ||
cd991b9e JA |
111 | dprint(FD_DISKUTIL, "add maj/min %d/%d: %s\n", majdev, mindev, path); |
112 | ||
9f8f2064 JA |
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)); | |
e11c410c | 118 | du->sysfs_root = path; |
9f8f2064 JA |
119 | du->major = majdev; |
120 | du->minor = mindev; | |
121 | ||
122 | list_for_each(entry, &disk_list) { | |
123 | __du = list_entry(entry, struct disk_util, list); | |
124 | ||
cd991b9e JA |
125 | dprint(FD_DISKUTIL, "found %s in list\n", __du->name); |
126 | ||
9f8f2064 JA |
127 | if (!strcmp(du->name, __du->name)) { |
128 | free(du->name); | |
129 | free(du); | |
130 | return; | |
131 | } | |
132 | } | |
133 | ||
cd991b9e JA |
134 | dprint(FD_DISKUTIL, "add %s to list\n", du->name); |
135 | ||
9f8f2064 JA |
136 | fio_gettime(&du->time, NULL); |
137 | get_io_ticks(du, &du->last_dus); | |
138 | ||
139 | list_add_tail(&du->list, &disk_list); | |
140 | } | |
141 | ||
142 | static int check_dev_match(int majdev, int mindev, char *path) | |
143 | { | |
144 | int major, minor; | |
145 | char line[256], *p; | |
146 | FILE *f; | |
147 | ||
148 | f = fopen(path, "r"); | |
149 | if (!f) { | |
150 | perror("open path"); | |
151 | return 1; | |
152 | } | |
153 | ||
154 | p = fgets(line, sizeof(line), f); | |
155 | if (!p) { | |
156 | fclose(f); | |
157 | return 1; | |
158 | } | |
159 | ||
160 | if (sscanf(p, "%u:%u", &major, &minor) != 2) { | |
161 | fclose(f); | |
162 | return 1; | |
163 | } | |
164 | ||
165 | if (majdev == major && mindev == minor) { | |
166 | fclose(f); | |
167 | return 0; | |
168 | } | |
169 | ||
170 | fclose(f); | |
171 | return 1; | |
172 | } | |
173 | ||
174 | static int find_block_dir(int majdev, int mindev, char *path) | |
175 | { | |
176 | struct dirent *dir; | |
177 | struct stat st; | |
178 | int found = 0; | |
179 | DIR *D; | |
180 | ||
181 | D = opendir(path); | |
182 | if (!D) | |
183 | return 0; | |
184 | ||
185 | while ((dir = readdir(D)) != NULL) { | |
186 | char full_path[256]; | |
187 | ||
188 | if (!strcmp(dir->d_name, ".") || !strcmp(dir->d_name, "..")) | |
189 | continue; | |
190 | ||
191 | sprintf(full_path, "%s/%s", path, dir->d_name); | |
192 | ||
193 | if (!strcmp(dir->d_name, "dev")) { | |
194 | if (!check_dev_match(majdev, mindev, full_path)) { | |
195 | found = 1; | |
196 | break; | |
197 | } | |
198 | } | |
199 | ||
200 | if (lstat(full_path, &st) == -1) { | |
201 | perror("stat"); | |
202 | break; | |
203 | } | |
204 | ||
205 | if (!S_ISDIR(st.st_mode) || S_ISLNK(st.st_mode)) | |
206 | continue; | |
207 | ||
208 | found = find_block_dir(majdev, mindev, full_path); | |
209 | if (found) { | |
210 | strcpy(path, full_path); | |
211 | break; | |
212 | } | |
213 | } | |
214 | ||
215 | closedir(D); | |
216 | return found; | |
217 | } | |
218 | ||
219 | static void __init_disk_util(struct thread_data *td, struct fio_file *f) | |
220 | { | |
221 | struct stat st; | |
222 | char foo[PATH_MAX], tmp[PATH_MAX]; | |
e11c410c | 223 | struct disk_util *du; |
9f8f2064 JA |
224 | int mindev, majdev; |
225 | char *p; | |
226 | ||
8cc7afa9 | 227 | if (!lstat(f->file_name, &st)) { |
9f8f2064 JA |
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); | |
8cc7afa9 JA |
234 | if (fio_lookup_raw(st.st_rdev, &majdev, &mindev)) |
235 | return; | |
236 | } else if (S_ISFIFO(st.st_mode)) | |
237 | return; | |
238 | else { | |
9f8f2064 JA |
239 | majdev = major(st.st_dev); |
240 | mindev = minor(st.st_dev); | |
241 | } | |
242 | } else { | |
243 | /* | |
244 | * must be a file, open "." in that path | |
245 | */ | |
246 | strncpy(foo, f->file_name, PATH_MAX - 1); | |
247 | p = dirname(foo); | |
248 | if (stat(p, &st)) { | |
249 | perror("disk util stat"); | |
250 | return; | |
251 | } | |
252 | ||
253 | majdev = major(st.st_dev); | |
254 | mindev = minor(st.st_dev); | |
255 | } | |
256 | ||
cd991b9e JA |
257 | dprint(FD_DISKUTIL, "%s belongs to maj/min %d/%d\n", f->file_name, |
258 | majdev, mindev); | |
259 | ||
e11c410c JA |
260 | du = disk_util_exists(majdev, mindev); |
261 | if (du) { | |
262 | if (td->o.ioscheduler && !td->sysfs_root) | |
263 | td->sysfs_root = strdup(du->sysfs_root); | |
264 | ||
9f8f2064 | 265 | return; |
e11c410c | 266 | } |
9f8f2064 JA |
267 | |
268 | /* | |
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 | |
272 | * everything again. | |
273 | */ | |
274 | if (mindev == last_mindev && majdev == last_majdev) | |
275 | return; | |
276 | ||
277 | last_mindev = mindev; | |
278 | last_majdev = majdev; | |
5ec10eaa | 279 | |
9f8f2064 JA |
280 | sprintf(foo, "/sys/block"); |
281 | if (!find_block_dir(majdev, mindev, foo)) | |
282 | return; | |
283 | ||
284 | /* | |
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. | |
288 | */ | |
289 | sprintf(tmp, "%s/../queue", foo); | |
290 | if (!stat(tmp, &st)) { | |
291 | p = dirname(foo); | |
292 | sprintf(tmp, "%s/queue", p); | |
293 | if (stat(tmp, &st)) { | |
294 | log_err("unknown sysfs layout\n"); | |
295 | return; | |
296 | } | |
297 | strncpy(tmp, p, PATH_MAX - 1); | |
298 | sprintf(foo, "%s", tmp); | |
299 | } | |
300 | ||
301 | if (td->o.ioscheduler && !td->sysfs_root) | |
302 | td->sysfs_root = strdup(foo); | |
303 | ||
304 | disk_util_add(majdev, mindev, foo); | |
305 | } | |
306 | ||
307 | void init_disk_util(struct thread_data *td) | |
308 | { | |
309 | struct fio_file *f; | |
310 | unsigned int i; | |
311 | ||
312 | if (!td->o.do_disk_util || | |
313 | (td->io_ops->flags & (FIO_DISKLESSIO | FIO_NODISKUTIL))) | |
314 | return; | |
315 | ||
316 | for_each_file(td, f, i) | |
317 | __init_disk_util(td, f); | |
318 | } | |
319 | ||
320 | void disk_util_timer_arm(void) | |
321 | { | |
322 | itimer.it_value.tv_sec = 0; | |
323 | itimer.it_value.tv_usec = DISK_UTIL_MSEC * 1000; | |
324 | setitimer(ITIMER_REAL, &itimer, NULL); | |
325 | } | |
326 | ||
327 | void show_disk_util(void) | |
328 | { | |
329 | struct disk_util_stat *dus; | |
330 | struct list_head *entry, *next; | |
331 | struct disk_util *du; | |
332 | double util; | |
333 | ||
0a839f30 JA |
334 | if (list_empty(&disk_list)) |
335 | return; | |
336 | ||
9f8f2064 JA |
337 | log_info("\nDisk stats (read/write):\n"); |
338 | ||
339 | list_for_each(entry, &disk_list) { | |
340 | du = list_entry(entry, struct disk_util, list); | |
341 | dus = &du->dus; | |
342 | ||
343 | util = (double) 100 * du->dus.io_ticks / (double) du->msec; | |
344 | if (util > 100.0) | |
345 | util = 100.0; | |
346 | ||
5ec10eaa JA |
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); | |
9f8f2064 JA |
353 | } |
354 | ||
355 | /* | |
356 | * now free the list | |
357 | */ | |
358 | list_for_each_safe(entry, next, &disk_list) { | |
359 | list_del(entry); | |
360 | du = list_entry(entry, struct disk_util, list); | |
361 | free(du->name); | |
362 | free(du); | |
363 | } | |
364 | } |