diskutil.c

   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;
  23         int ret;
  24
  25         f = fopen(du->path, "r");
  26         if (!f)
  27                 return 1;
  28
  29         p = fgets(line, sizeof(line), f);
  30         if (!p) {
  31                 fclose(f);
  32                 return 1;
  33         }
  34
  35         ret = scanf(p, "%u %u %llu %u %u %u %llu %u %u %u %u\n", &dus->ios[0],
  36                                         &dus->merges[0], &dus->sectors[0],
  37                                         &dus->ticks[0], &dus->ios[1],
  38                                         &dus->merges[1], &dus->sectors[1],
  39                                         &dus->ticks[1], &in_flight,
  40                                         &dus->io_ticks, &dus->time_in_queue);
  41         if (ret != 11) {
  42                 fclose(f);
  43                 return 1;
  44         }
  45
  46         fclose(f);
  47         return 0;
  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
  83         list_for_each(entry, &disk_list) {
  84                 du = list_entry(entry, struct disk_util, list);
  85                 update_io_tick_disk(du);
  86         }
  87 }
  88
  89 static struct disk_util *disk_util_exists(int major, int minor)
  90 {
  91         struct list_head *entry;
  92         struct disk_util *du;
  93
  94         list_for_each(entry, &disk_list) {
  95                 du = list_entry(entry, struct disk_util, list);
  96
  97                 if (major == du->major && minor == du->minor)
  98                         return du;
  99         }
 100
 101         return NULL;
 102 }
 103
 104 static void disk_util_add(int majdev, int mindev, char *path)
 105 {
 106         struct disk_util *du, *__du;
 107         struct list_head *entry;
 108
 109         du = malloc(sizeof(*du));
 110         memset(du, 0, sizeof(*du));
 111         INIT_LIST_HEAD(&du->list);
 112         sprintf(du->path, "%s/stat", path);
 113         du->name = strdup(basename(path));
 114         du->sysfs_root = path;
 115         du->major = majdev;
 116         du->minor = mindev;
 117
 118         list_for_each(entry, &disk_list) {
 119                 __du = list_entry(entry, struct disk_util, list);
 120
 121                 if (!strcmp(du->name, __du->name)) {
 122                         free(du->name);
 123                         free(du);
 124                         return;
 125                 }
 126         }
 127
 128         fio_gettime(&du->time, NULL);
 129         get_io_ticks(du, &du->last_dus);
 130
 131         list_add_tail(&du->list, &disk_list);
 132 }
 133
 134 static int check_dev_match(int majdev, int mindev, char *path)
 135 {
 136         int major, minor;
 137         char line[256], *p;
 138         FILE *f;
 139
 140         f = fopen(path, "r");
 141         if (!f) {
 142                 perror("open path");
 143                 return 1;
 144         }
 145
 146         p = fgets(line, sizeof(line), f);
 147         if (!p) {
 148                 fclose(f);
 149                 return 1;
 150         }
 151
 152         if (sscanf(p, "%u:%u", &major, &minor) != 2) {
 153                 fclose(f);
 154                 return 1;
 155         }
 156
 157         if (majdev == major && mindev == minor) {
 158                 fclose(f);
 159                 return 0;
 160         }
 161
 162         fclose(f);
 163         return 1;
 164 }
 165
 166 static int find_block_dir(int majdev, int mindev, char *path)
 167 {
 168         struct dirent *dir;
 169         struct stat st;
 170         int found = 0;
 171         DIR *D;
 172
 173         D = opendir(path);
 174         if (!D)
 175                 return 0;
 176
 177         while ((dir = readdir(D)) != NULL) {
 178                 char full_path[256];
 179
 180                 if (!strcmp(dir->d_name, ".") || !strcmp(dir->d_name, ".."))
 181                         continue;
 182
 183                 sprintf(full_path, "%s/%s", path, dir->d_name);
 184
 185                 if (!strcmp(dir->d_name, "dev")) {
 186                         if (!check_dev_match(majdev, mindev, full_path)) {
 187                                 found = 1;
 188                                 break;
 189                         }
 190                 }
 191
 192                 if (lstat(full_path, &st) == -1) {
 193                         perror("stat");
 194                         break;
 195                 }
 196
 197                 if (!S_ISDIR(st.st_mode) || S_ISLNK(st.st_mode))
 198                         continue;
 199
 200                 found = find_block_dir(majdev, mindev, full_path);
 201                 if (found) {
 202                         strcpy(path, full_path);
 203                         break;
 204                 }
 205         }
 206
 207         closedir(D);
 208         return found;
 209 }
 210
 211 static void __init_disk_util(struct thread_data *td, struct fio_file *f)
 212 {
 213         struct stat st;
 214         char foo[PATH_MAX], tmp[PATH_MAX];
 215         struct disk_util *du;
 216         int mindev, majdev;
 217         char *p;
 218
 219         if (!lstat(f->file_name, &st)) {
 220                 if (S_ISBLK(st.st_mode)) {
 221                         majdev = major(st.st_rdev);
 222                         mindev = minor(st.st_rdev);
 223                 } else if (S_ISCHR(st.st_mode)) {
 224                         majdev = major(st.st_rdev);
 225                         mindev = minor(st.st_rdev);
 226                         if (fio_lookup_raw(st.st_rdev, &majdev, &mindev))
 227                                 return;
 228                 } else if (S_ISFIFO(st.st_mode))
 229                         return;
 230                 else {
 231                         majdev = major(st.st_dev);
 232                         mindev = minor(st.st_dev);
 233                 }
 234         } else {
 235                 /*
 236                  * must be a file, open "." in that path
 237                  */
 238                 strncpy(foo, f->file_name, PATH_MAX - 1);
 239                 p = dirname(foo);
 240                 if (stat(p, &st)) {
 241                         perror("disk util stat");
 242                         return;
 243                 }
 244
 245                 majdev = major(st.st_dev);
 246                 mindev = minor(st.st_dev);
 247         }
 248
 249         du = disk_util_exists(majdev, mindev);
 250         if (du) {
 251                 if (td->o.ioscheduler && !td->sysfs_root)
 252                         td->sysfs_root = strdup(du->sysfs_root);
 253
 254                 return;
 255         }
 256
 257         /*
 258          * for an fs without a device, we will repeatedly stat through
 259          * sysfs which can take oodles of time for thousands of files. so
 260          * cache the last lookup and compare with that before going through
 261          * everything again.
 262          */
 263         if (mindev == last_mindev && majdev == last_majdev)
 264                 return;
 265
 266         last_mindev = mindev;
 267         last_majdev = majdev;
 268
 269         sprintf(foo, "/sys/block");
 270         if (!find_block_dir(majdev, mindev, foo))
 271                 return;
 272
 273         /*
 274          * If there's a ../queue/ directory there, we are inside a partition.
 275          * Check if that is the case and jump back. For loop/md/dm etc we
 276          * are already in the right spot.
 277          */
 278         sprintf(tmp, "%s/../queue", foo);
 279         if (!stat(tmp, &st)) {
 280                 p = dirname(foo);
 281                 sprintf(tmp, "%s/queue", p);
 282                 if (stat(tmp, &st)) {
 283                         log_err("unknown sysfs layout\n");
 284                         return;
 285                 }
 286                 strncpy(tmp, p, PATH_MAX - 1);
 287                 sprintf(foo, "%s", tmp);
 288         }
 289
 290         if (td->o.ioscheduler && !td->sysfs_root)
 291                 td->sysfs_root = strdup(foo);
 292
 293         disk_util_add(majdev, mindev, foo);
 294 }
 295
 296 void init_disk_util(struct thread_data *td)
 297 {
 298         struct fio_file *f;
 299         unsigned int i;
 300
 301         if (!td->o.do_disk_util ||
 302             (td->io_ops->flags & (FIO_DISKLESSIO | FIO_NODISKUTIL)))
 303                 return;
 304
 305         for_each_file(td, f, i)
 306                 __init_disk_util(td, f);
 307 }
 308
 309 void disk_util_timer_arm(void)
 310 {
 311         itimer.it_value.tv_sec = 0;
 312         itimer.it_value.tv_usec = DISK_UTIL_MSEC * 1000;
 313         setitimer(ITIMER_REAL, &itimer, NULL);
 314 }
 315
 316 void show_disk_util(void)
 317 {
 318         struct disk_util_stat *dus;
 319         struct list_head *entry, *next;
 320         struct disk_util *du;
 321         double util;
 322
 323         if (list_empty(&disk_list))
 324                 return;
 325
 326         log_info("\nDisk stats (read/write):\n");
 327
 328         list_for_each(entry, &disk_list) {
 329                 du = list_entry(entry, struct disk_util, list);
 330                 dus = &du->dus;
 331
 332                 util = (double) 100 * du->dus.io_ticks / (double) du->msec;
 333                 if (util > 100.0)
 334                         util = 100.0;
 335
 336                 log_info("  %s: ios=%u/%u, merge=%u/%u, ticks=%u/%u, "
 337                          "in_queue=%u, util=%3.2f%%\n", du->name,
 338                                                 dus->ios[0], dus->ios[1],
 339                                                 dus->merges[0], dus->merges[1],
 340                                                 dus->ticks[0], dus->ticks[1],
 341                                                 dus->time_in_queue, util);
 342         }
 343
 344         /*
 345          * now free the list
 346          */
 347         list_for_each_safe(entry, next, &disk_list) {
 348                 list_del(entry);
 349                 du = list_entry(entry, struct disk_util, list);
 350                 free(du->name);
 351                 free(du);
 352         }
 353 }