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" | |
c97bd0fa | 11 | #include "smalloc.h" |
7c9b1bce | 12 | #include "diskutil.h" |
9f8f2064 JA |
13 | |
14 | static int last_majdev, last_mindev; | |
c97bd0fa | 15 | static struct disk_util *last_du; |
9f8f2064 | 16 | |
d09a64a0 | 17 | FLIST_HEAD(disk_list); |
9f8f2064 | 18 | |
2db4ecca JA |
19 | static struct disk_util *__init_per_file_disk_util(struct thread_data *td, |
20 | int majdev, int mindev, char *path); | |
21 | ||
c97bd0fa JA |
22 | static void disk_util_free(struct disk_util *du) |
23 | { | |
24 | if (du == last_du) | |
25 | last_du = NULL; | |
26 | ||
b8d541d5 JA |
27 | while (!flist_empty(&du->slaves)) { |
28 | struct disk_util *slave; | |
29 | ||
30 | slave = flist_entry(du->slaves.next, struct disk_util, slavelist); | |
31 | flist_del(&slave->slavelist); | |
32 | slave->users--; | |
33 | } | |
34 | ||
c97bd0fa | 35 | fio_mutex_remove(du->lock); |
c97bd0fa JA |
36 | sfree(du); |
37 | } | |
38 | ||
9f8f2064 JA |
39 | static int get_io_ticks(struct disk_util *du, struct disk_util_stat *dus) |
40 | { | |
41 | unsigned in_flight; | |
d09a64a0 | 42 | unsigned long long sectors[2]; |
9f8f2064 JA |
43 | char line[256]; |
44 | FILE *f; | |
45 | char *p; | |
5ec10eaa | 46 | int ret; |
9f8f2064 | 47 | |
cd991b9e JA |
48 | dprint(FD_DISKUTIL, "open stat file: %s\n", du->path); |
49 | ||
9f8f2064 JA |
50 | f = fopen(du->path, "r"); |
51 | if (!f) | |
52 | return 1; | |
53 | ||
54 | p = fgets(line, sizeof(line), f); | |
55 | if (!p) { | |
56 | fclose(f); | |
57 | return 1; | |
58 | } | |
59 | ||
cd991b9e JA |
60 | dprint(FD_DISKUTIL, "%s: %s", du->path, p); |
61 | ||
62 | ret = sscanf(p, "%u %u %llu %u %u %u %llu %u %u %u %u\n", &dus->ios[0], | |
d09a64a0 | 63 | &dus->merges[0], §ors[0], |
5ec10eaa | 64 | &dus->ticks[0], &dus->ios[1], |
d09a64a0 | 65 | &dus->merges[1], §ors[1], |
5ec10eaa JA |
66 | &dus->ticks[1], &in_flight, |
67 | &dus->io_ticks, &dus->time_in_queue); | |
9f8f2064 | 68 | fclose(f); |
cd991b9e | 69 | dprint(FD_DISKUTIL, "%s: stat read ok? %d\n", du->path, ret == 1); |
d09a64a0 JA |
70 | dus->sectors[0] = sectors[0]; |
71 | dus->sectors[1] = sectors[1]; | |
cd991b9e | 72 | return ret != 11; |
9f8f2064 JA |
73 | } |
74 | ||
75 | static void update_io_tick_disk(struct disk_util *du) | |
76 | { | |
77 | struct disk_util_stat __dus, *dus, *ldus; | |
78 | struct timeval t; | |
79 | ||
c97bd0fa JA |
80 | if (!du->users) |
81 | return; | |
90b97ac3 JA |
82 | if (get_io_ticks(du, &__dus)) |
83 | return; | |
9f8f2064 JA |
84 | |
85 | dus = &du->dus; | |
86 | ldus = &du->last_dus; | |
87 | ||
88 | dus->sectors[0] += (__dus.sectors[0] - ldus->sectors[0]); | |
89 | dus->sectors[1] += (__dus.sectors[1] - ldus->sectors[1]); | |
90 | dus->ios[0] += (__dus.ios[0] - ldus->ios[0]); | |
91 | dus->ios[1] += (__dus.ios[1] - ldus->ios[1]); | |
92 | dus->merges[0] += (__dus.merges[0] - ldus->merges[0]); | |
93 | dus->merges[1] += (__dus.merges[1] - ldus->merges[1]); | |
94 | dus->ticks[0] += (__dus.ticks[0] - ldus->ticks[0]); | |
95 | dus->ticks[1] += (__dus.ticks[1] - ldus->ticks[1]); | |
96 | dus->io_ticks += (__dus.io_ticks - ldus->io_ticks); | |
97 | dus->time_in_queue += (__dus.time_in_queue - ldus->time_in_queue); | |
98 | ||
99 | fio_gettime(&t, NULL); | |
d09a64a0 | 100 | dus->msec += mtime_since(&du->time, &t); |
9f8f2064 JA |
101 | memcpy(&du->time, &t, sizeof(t)); |
102 | memcpy(ldus, &__dus, sizeof(__dus)); | |
103 | } | |
104 | ||
105 | void update_io_ticks(void) | |
106 | { | |
01743ee1 | 107 | struct flist_head *entry; |
9f8f2064 JA |
108 | struct disk_util *du; |
109 | ||
cd991b9e JA |
110 | dprint(FD_DISKUTIL, "update io ticks\n"); |
111 | ||
01743ee1 JA |
112 | flist_for_each(entry, &disk_list) { |
113 | du = flist_entry(entry, struct disk_util, list); | |
9f8f2064 JA |
114 | update_io_tick_disk(du); |
115 | } | |
116 | } | |
117 | ||
e11c410c | 118 | static struct disk_util *disk_util_exists(int major, int minor) |
9f8f2064 | 119 | { |
01743ee1 | 120 | struct flist_head *entry; |
9f8f2064 JA |
121 | struct disk_util *du; |
122 | ||
01743ee1 JA |
123 | flist_for_each(entry, &disk_list) { |
124 | du = flist_entry(entry, struct disk_util, list); | |
9f8f2064 JA |
125 | |
126 | if (major == du->major && minor == du->minor) | |
e11c410c | 127 | return du; |
9f8f2064 JA |
128 | } |
129 | ||
e11c410c | 130 | return NULL; |
9f8f2064 JA |
131 | } |
132 | ||
67423013 ST |
133 | static int get_device_numbers(char *file_name, int *maj, int *min) |
134 | { | |
135 | struct stat st; | |
136 | int majdev, mindev; | |
137 | char tempname[PATH_MAX], *p; | |
138 | ||
139 | if (!lstat(file_name, &st)) { | |
140 | if (S_ISBLK(st.st_mode)) { | |
141 | majdev = major(st.st_rdev); | |
142 | mindev = minor(st.st_rdev); | |
143 | } else if (S_ISCHR(st.st_mode)) { | |
144 | majdev = major(st.st_rdev); | |
145 | mindev = minor(st.st_rdev); | |
146 | if (fio_lookup_raw(st.st_rdev, &majdev, &mindev)) | |
147 | return -1; | |
148 | } else if (S_ISFIFO(st.st_mode)) | |
149 | return -1; | |
150 | else { | |
151 | majdev = major(st.st_dev); | |
152 | mindev = minor(st.st_dev); | |
153 | } | |
154 | } else { | |
155 | /* | |
156 | * must be a file, open "." in that path | |
157 | */ | |
158 | strncpy(tempname, file_name, PATH_MAX - 1); | |
159 | p = dirname(tempname); | |
160 | if (stat(p, &st)) { | |
161 | perror("disk util stat"); | |
162 | return -1; | |
163 | } | |
164 | ||
165 | majdev = major(st.st_dev); | |
166 | mindev = minor(st.st_dev); | |
167 | } | |
168 | ||
169 | *min = mindev; | |
170 | *maj = majdev; | |
171 | ||
172 | return 0; | |
173 | } | |
174 | ||
175 | static int read_block_dev_entry(char *path, int *maj, int *min) | |
176 | { | |
177 | char line[256], *p; | |
178 | FILE *f; | |
179 | ||
180 | f = fopen(path, "r"); | |
181 | if (!f) { | |
182 | perror("open path"); | |
183 | return 1; | |
184 | } | |
185 | ||
186 | p = fgets(line, sizeof(line), f); | |
187 | fclose(f); | |
188 | ||
189 | if (!p) | |
190 | return 1; | |
191 | ||
192 | if (sscanf(p, "%u:%u", maj, min) != 2) | |
193 | return 1; | |
194 | ||
195 | return 0; | |
196 | } | |
197 | ||
67423013 | 198 | static void find_add_disk_slaves(struct thread_data *td, char *path, |
2db4ecca | 199 | struct disk_util *masterdu) |
67423013 ST |
200 | { |
201 | DIR *dirhandle = NULL; | |
202 | struct dirent *dirent = NULL; | |
203 | char slavesdir[PATH_MAX], temppath[PATH_MAX], slavepath[PATH_MAX]; | |
204 | struct disk_util *slavedu = NULL; | |
205 | int majdev, mindev; | |
206 | ssize_t linklen; | |
207 | ||
2db4ecca | 208 | sprintf(slavesdir, "%s/%s", path, "slaves"); |
67423013 ST |
209 | dirhandle = opendir(slavesdir); |
210 | if (!dirhandle) | |
211 | return; | |
212 | ||
213 | while ((dirent = readdir(dirhandle)) != NULL) { | |
2db4ecca JA |
214 | if (!strcmp(dirent->d_name, ".") || |
215 | !strcmp(dirent->d_name, "..")) | |
67423013 ST |
216 | continue; |
217 | ||
218 | sprintf(temppath, "%s/%s", slavesdir, dirent->d_name); | |
219 | /* Can we always assume that the slaves device entries | |
220 | * are links to the real directories for the slave | |
221 | * devices? | |
222 | */ | |
2db4ecca JA |
223 | linklen = readlink(temppath, slavepath, PATH_MAX - 0); |
224 | if (linklen < 0) { | |
67423013 ST |
225 | perror("readlink() for slave device."); |
226 | return; | |
227 | } | |
2db4ecca | 228 | slavepath[linklen] = '\0'; |
67423013 ST |
229 | |
230 | sprintf(temppath, "%s/%s/dev", slavesdir, slavepath); | |
231 | if (read_block_dev_entry(temppath, &majdev, &mindev)) { | |
232 | perror("Error getting slave device numbers."); | |
233 | return; | |
234 | } | |
235 | ||
b06de82e AB |
236 | /* |
237 | * See if this maj,min already exists | |
238 | */ | |
239 | slavedu = disk_util_exists(majdev, mindev); | |
240 | if (slavedu) | |
241 | continue; | |
242 | ||
67423013 ST |
243 | sprintf(temppath, "%s/%s", slavesdir, slavepath); |
244 | __init_per_file_disk_util(td, majdev, mindev, temppath); | |
245 | slavedu = disk_util_exists(majdev, mindev); | |
246 | ||
247 | /* Should probably use an assert here. slavedu should | |
248 | * always be present at this point. */ | |
b8d541d5 JA |
249 | if (slavedu) { |
250 | slavedu->users++; | |
67423013 | 251 | flist_add_tail(&slavedu->slavelist, &masterdu->slaves); |
b8d541d5 | 252 | } |
67423013 ST |
253 | } |
254 | ||
255 | closedir(dirhandle); | |
67423013 ST |
256 | } |
257 | ||
b8fefc2b | 258 | static struct disk_util *disk_util_add(struct thread_data *td, int majdev, |
c97bd0fa | 259 | int mindev, char *path) |
9f8f2064 JA |
260 | { |
261 | struct disk_util *du, *__du; | |
01743ee1 | 262 | struct flist_head *entry; |
9f8f2064 | 263 | |
cd991b9e JA |
264 | dprint(FD_DISKUTIL, "add maj/min %d/%d: %s\n", majdev, mindev, path); |
265 | ||
c97bd0fa | 266 | du = smalloc(sizeof(*du)); |
9f8f2064 | 267 | memset(du, 0, sizeof(*du)); |
01743ee1 | 268 | INIT_FLIST_HEAD(&du->list); |
9f8f2064 | 269 | sprintf(du->path, "%s/stat", path); |
d09a64a0 | 270 | strncpy((char *) du->dus.name, basename(path), FIO_DU_NAME_SZ); |
e11c410c | 271 | du->sysfs_root = path; |
9f8f2064 JA |
272 | du->major = majdev; |
273 | du->minor = mindev; | |
67423013 ST |
274 | INIT_FLIST_HEAD(&du->slavelist); |
275 | INIT_FLIST_HEAD(&du->slaves); | |
c97bd0fa JA |
276 | du->lock = fio_mutex_init(1); |
277 | du->users = 0; | |
9f8f2064 | 278 | |
01743ee1 JA |
279 | flist_for_each(entry, &disk_list) { |
280 | __du = flist_entry(entry, struct disk_util, list); | |
9f8f2064 | 281 | |
d09a64a0 | 282 | dprint(FD_DISKUTIL, "found %s in list\n", __du->dus.name); |
cd991b9e | 283 | |
d09a64a0 | 284 | if (!strcmp((char *) du->dus.name, (char *) __du->dus.name)) { |
c97bd0fa JA |
285 | disk_util_free(du); |
286 | return __du; | |
9f8f2064 JA |
287 | } |
288 | } | |
289 | ||
d09a64a0 | 290 | dprint(FD_DISKUTIL, "add %s to list\n", du->dus.name); |
cd991b9e | 291 | |
9f8f2064 JA |
292 | fio_gettime(&du->time, NULL); |
293 | get_io_ticks(du, &du->last_dus); | |
294 | ||
01743ee1 | 295 | flist_add_tail(&du->list, &disk_list); |
67423013 | 296 | find_add_disk_slaves(td, path, du); |
c97bd0fa | 297 | return du; |
9f8f2064 JA |
298 | } |
299 | ||
300 | static int check_dev_match(int majdev, int mindev, char *path) | |
301 | { | |
302 | int major, minor; | |
9f8f2064 | 303 | |
67423013 | 304 | if (read_block_dev_entry(path, &major, &minor)) |
9f8f2064 | 305 | return 1; |
9f8f2064 | 306 | |
c97bd0fa | 307 | if (majdev == major && mindev == minor) |
9f8f2064 | 308 | return 0; |
9f8f2064 | 309 | |
9f8f2064 JA |
310 | return 1; |
311 | } | |
312 | ||
ac0be2ac | 313 | static int find_block_dir(int majdev, int mindev, char *path, int link_ok) |
9f8f2064 JA |
314 | { |
315 | struct dirent *dir; | |
316 | struct stat st; | |
317 | int found = 0; | |
318 | DIR *D; | |
319 | ||
320 | D = opendir(path); | |
321 | if (!D) | |
322 | return 0; | |
323 | ||
324 | while ((dir = readdir(D)) != NULL) { | |
325 | char full_path[256]; | |
326 | ||
327 | if (!strcmp(dir->d_name, ".") || !strcmp(dir->d_name, "..")) | |
328 | continue; | |
329 | ||
330 | sprintf(full_path, "%s/%s", path, dir->d_name); | |
331 | ||
332 | if (!strcmp(dir->d_name, "dev")) { | |
333 | if (!check_dev_match(majdev, mindev, full_path)) { | |
334 | found = 1; | |
335 | break; | |
336 | } | |
337 | } | |
338 | ||
ac0be2ac JA |
339 | if (link_ok) { |
340 | if (stat(full_path, &st) == -1) { | |
341 | perror("stat"); | |
342 | break; | |
343 | } | |
344 | } else { | |
345 | if (lstat(full_path, &st) == -1) { | |
346 | perror("stat"); | |
347 | break; | |
348 | } | |
9f8f2064 JA |
349 | } |
350 | ||
351 | if (!S_ISDIR(st.st_mode) || S_ISLNK(st.st_mode)) | |
352 | continue; | |
353 | ||
ac0be2ac | 354 | found = find_block_dir(majdev, mindev, full_path, 0); |
9f8f2064 JA |
355 | if (found) { |
356 | strcpy(path, full_path); | |
357 | break; | |
358 | } | |
359 | } | |
360 | ||
361 | closedir(D); | |
362 | return found; | |
363 | } | |
364 | ||
c97bd0fa JA |
365 | static struct disk_util *__init_per_file_disk_util(struct thread_data *td, |
366 | int majdev, int mindev, | |
367 | char *path) | |
9f8f2064 JA |
368 | { |
369 | struct stat st; | |
67423013 | 370 | char tmp[PATH_MAX]; |
9f8f2064 JA |
371 | char *p; |
372 | ||
67423013 ST |
373 | /* |
374 | * If there's a ../queue/ directory there, we are inside a partition. | |
375 | * Check if that is the case and jump back. For loop/md/dm etc we | |
376 | * are already in the right spot. | |
377 | */ | |
378 | sprintf(tmp, "%s/../queue", path); | |
379 | if (!stat(tmp, &st)) { | |
380 | p = dirname(path); | |
381 | sprintf(tmp, "%s/queue", p); | |
382 | if (stat(tmp, &st)) { | |
383 | log_err("unknown sysfs layout\n"); | |
c97bd0fa | 384 | return NULL; |
9f8f2064 | 385 | } |
67423013 ST |
386 | strncpy(tmp, p, PATH_MAX - 1); |
387 | sprintf(path, "%s", tmp); | |
9f8f2064 JA |
388 | } |
389 | ||
67423013 ST |
390 | if (td->o.ioscheduler && !td->sysfs_root) |
391 | td->sysfs_root = strdup(path); | |
392 | ||
c97bd0fa | 393 | return disk_util_add(td, majdev, mindev, path); |
67423013 ST |
394 | } |
395 | ||
c97bd0fa JA |
396 | static struct disk_util *init_per_file_disk_util(struct thread_data *td, |
397 | char *filename) | |
67423013 ST |
398 | { |
399 | ||
400 | char foo[PATH_MAX]; | |
401 | struct disk_util *du; | |
402 | int mindev, majdev; | |
403 | ||
c97bd0fa JA |
404 | if (get_device_numbers(filename, &majdev, &mindev)) |
405 | return NULL; | |
67423013 ST |
406 | |
407 | dprint(FD_DISKUTIL, "%s belongs to maj/min %d/%d\n", filename, majdev, | |
408 | mindev); | |
cd991b9e | 409 | |
e11c410c JA |
410 | du = disk_util_exists(majdev, mindev); |
411 | if (du) { | |
412 | if (td->o.ioscheduler && !td->sysfs_root) | |
413 | td->sysfs_root = strdup(du->sysfs_root); | |
414 | ||
c97bd0fa | 415 | return du; |
e11c410c | 416 | } |
9f8f2064 JA |
417 | |
418 | /* | |
419 | * for an fs without a device, we will repeatedly stat through | |
420 | * sysfs which can take oodles of time for thousands of files. so | |
421 | * cache the last lookup and compare with that before going through | |
422 | * everything again. | |
423 | */ | |
424 | if (mindev == last_mindev && majdev == last_majdev) | |
c97bd0fa | 425 | return last_du; |
9f8f2064 JA |
426 | |
427 | last_mindev = mindev; | |
428 | last_majdev = majdev; | |
5ec10eaa | 429 | |
9f8f2064 | 430 | sprintf(foo, "/sys/block"); |
ac0be2ac | 431 | if (!find_block_dir(majdev, mindev, foo, 1)) |
c97bd0fa | 432 | return NULL; |
9f8f2064 | 433 | |
c97bd0fa | 434 | return __init_per_file_disk_util(td, majdev, mindev, foo); |
67423013 | 435 | } |
9f8f2064 | 436 | |
c97bd0fa JA |
437 | static struct disk_util *__init_disk_util(struct thread_data *td, |
438 | struct fio_file *f) | |
67423013 ST |
439 | { |
440 | return init_per_file_disk_util(td, f->file_name); | |
9f8f2064 JA |
441 | } |
442 | ||
443 | void init_disk_util(struct thread_data *td) | |
444 | { | |
445 | struct fio_file *f; | |
446 | unsigned int i; | |
447 | ||
448 | if (!td->o.do_disk_util || | |
449 | (td->io_ops->flags & (FIO_DISKLESSIO | FIO_NODISKUTIL))) | |
450 | return; | |
451 | ||
452 | for_each_file(td, f, i) | |
c97bd0fa | 453 | f->du = __init_disk_util(td, f); |
9f8f2064 JA |
454 | } |
455 | ||
f2f788dd | 456 | static void show_agg_stats(struct disk_util_agg *agg, int terse) |
d09a64a0 JA |
457 | { |
458 | if (!agg->slavecount) | |
459 | return; | |
460 | ||
f2f788dd JA |
461 | if (!terse) { |
462 | log_info(", aggrios=%u/%u, aggrmerge=%u/%u, aggrticks=%u/%u," | |
463 | " aggrin_queue=%u, aggrutil=%3.2f%%", | |
464 | agg->ios[0] / agg->slavecount, | |
465 | agg->ios[1] / agg->slavecount, | |
466 | agg->merges[0] / agg->slavecount, | |
467 | agg->merges[1] / agg->slavecount, | |
468 | agg->ticks[0] / agg->slavecount, | |
469 | agg->ticks[1] / agg->slavecount, | |
470 | agg->time_in_queue / agg->slavecount, | |
471 | agg->max_util.u.f); | |
472 | } else { | |
473 | log_info("slaves;%u;%u;%u;%u;%u;%u;%u;%3.2f%%", | |
474 | agg->ios[0] / agg->slavecount, | |
475 | agg->ios[1] / agg->slavecount, | |
476 | agg->merges[0] / agg->slavecount, | |
477 | agg->merges[1] / agg->slavecount, | |
478 | agg->ticks[0] / agg->slavecount, | |
479 | agg->ticks[1] / agg->slavecount, | |
480 | agg->time_in_queue / agg->slavecount, | |
481 | agg->max_util.u.f); | |
482 | } | |
d09a64a0 JA |
483 | } |
484 | ||
043b74b9 ST |
485 | static void aggregate_slaves_stats(struct disk_util *masterdu) |
486 | { | |
d09a64a0 | 487 | struct disk_util_agg *agg = &masterdu->agg; |
043b74b9 ST |
488 | struct disk_util_stat *dus; |
489 | struct flist_head *entry; | |
490 | struct disk_util *slavedu; | |
d09a64a0 | 491 | double util; |
043b74b9 ST |
492 | |
493 | flist_for_each(entry, &masterdu->slaves) { | |
494 | slavedu = flist_entry(entry, struct disk_util, slavelist); | |
495 | dus = &slavedu->dus; | |
d09a64a0 JA |
496 | agg->ios[0] += dus->ios[0]; |
497 | agg->ios[1] += dus->ios[1]; | |
498 | agg->merges[0] += dus->merges[0]; | |
499 | agg->merges[1] += dus->merges[1]; | |
500 | agg->sectors[0] += dus->sectors[0]; | |
501 | agg->sectors[1] += dus->sectors[1]; | |
502 | agg->ticks[0] += dus->ticks[0]; | |
503 | agg->ticks[1] += dus->ticks[1]; | |
504 | agg->time_in_queue += dus->time_in_queue; | |
505 | agg->slavecount++; | |
506 | ||
507 | util = (double) (100 * dus->io_ticks / (double) slavedu->dus.msec); | |
043b74b9 ST |
508 | /* System utilization is the utilization of the |
509 | * component with the highest utilization. | |
510 | */ | |
d09a64a0 JA |
511 | if (util > agg->max_util.u.f) |
512 | agg->max_util.u.f = util; | |
043b74b9 ST |
513 | |
514 | } | |
515 | ||
d09a64a0 JA |
516 | if (agg->max_util.u.f > 100.0) |
517 | agg->max_util.u.f = 100.0; | |
518 | } | |
519 | ||
520 | void free_disk_util(void) | |
521 | { | |
522 | struct disk_util *du; | |
043b74b9 | 523 | |
d09a64a0 JA |
524 | while (!flist_empty(&disk_list)) { |
525 | du = flist_entry(disk_list.next, struct disk_util, list); | |
526 | flist_del(&du->list); | |
527 | disk_util_free(du); | |
528 | } | |
043b74b9 | 529 | |
d09a64a0 JA |
530 | last_majdev = last_mindev = -1; |
531 | } | |
532 | ||
f2f788dd JA |
533 | void print_disk_util(struct disk_util_stat *dus, struct disk_util_agg *agg, |
534 | int terse) | |
d09a64a0 | 535 | { |
6914f59e | 536 | double util = 0; |
d09a64a0 | 537 | |
6914f59e JA |
538 | if (dus->msec) |
539 | util = (double) 100 * dus->io_ticks / (double) dus->msec; | |
d09a64a0 JA |
540 | if (util > 100.0) |
541 | util = 100.0; | |
542 | ||
543 | if (agg->slavecount) | |
544 | log_info(" "); | |
545 | ||
f2f788dd JA |
546 | if (!terse) { |
547 | log_info(" %s: ios=%u/%u, merge=%u/%u, ticks=%u/%u, " | |
548 | "in_queue=%u, util=%3.2f%%", dus->name, | |
d09a64a0 JA |
549 | dus->ios[0], dus->ios[1], |
550 | dus->merges[0], dus->merges[1], | |
551 | dus->ticks[0], dus->ticks[1], | |
552 | dus->time_in_queue, util); | |
f2f788dd | 553 | } else { |
3d7cd9b4 | 554 | log_info(";%s;%u;%u;%u;%u;%u;%u;%u;%3.2f%%", |
f2f788dd JA |
555 | dus->name, dus->ios[0], dus->ios[1], |
556 | dus->merges[0], dus->merges[1], | |
557 | dus->ticks[0], dus->ticks[1], | |
558 | dus->time_in_queue, util); | |
559 | } | |
d09a64a0 JA |
560 | |
561 | /* | |
562 | * If the device has slaves, aggregate the stats for | |
563 | * those slave devices also. | |
564 | */ | |
565 | if (agg->slavecount) | |
f2f788dd | 566 | show_agg_stats(agg, terse); |
d09a64a0 | 567 | |
f2f788dd JA |
568 | if (!terse) |
569 | log_info("\n"); | |
043b74b9 ST |
570 | } |
571 | ||
f2f788dd | 572 | void show_disk_util(int terse) |
9f8f2064 | 573 | { |
d09a64a0 | 574 | struct flist_head *entry; |
9f8f2064 | 575 | struct disk_util *du; |
9f8f2064 | 576 | |
01743ee1 | 577 | if (flist_empty(&disk_list)) |
0a839f30 JA |
578 | return; |
579 | ||
f2f788dd JA |
580 | if (!terse) |
581 | log_info("\nDisk stats (read/write):\n"); | |
9f8f2064 | 582 | |
01743ee1 JA |
583 | flist_for_each(entry, &disk_list) { |
584 | du = flist_entry(entry, struct disk_util, list); | |
9f8f2064 | 585 | |
d09a64a0 | 586 | aggregate_slaves_stats(du); |
f2f788dd | 587 | print_disk_util(&du->dus, &du->agg, terse); |
9f8f2064 JA |
588 | } |
589 | } |