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