| 1 | #include <unistd.h> |
| 2 | #include <fcntl.h> |
| 3 | #include <string.h> |
| 4 | #include <signal.h> |
| 5 | #include <time.h> |
| 6 | #include <assert.h> |
| 7 | |
| 8 | #include "fio.h" |
| 9 | #include "os.h" |
| 10 | |
| 11 | /* |
| 12 | * Change this define to play with the timeout handling |
| 13 | */ |
| 14 | #undef FIO_USE_TIMEOUT |
| 15 | |
| 16 | struct io_completion_data { |
| 17 | int nr; /* input */ |
| 18 | |
| 19 | int error; /* output */ |
| 20 | unsigned long bytes_done[2]; /* output */ |
| 21 | struct timeval time; /* output */ |
| 22 | }; |
| 23 | |
| 24 | /* |
| 25 | * The ->file_map[] contains a map of blocks we have or have not done io |
| 26 | * to yet. Used to make sure we cover the entire range in a fair fashion. |
| 27 | */ |
| 28 | static int random_map_free(struct thread_data *td, struct fio_file *f, |
| 29 | unsigned long long block) |
| 30 | { |
| 31 | unsigned int idx = RAND_MAP_IDX(td, f, block); |
| 32 | unsigned int bit = RAND_MAP_BIT(td, f, block); |
| 33 | |
| 34 | return (f->file_map[idx] & (1UL << bit)) == 0; |
| 35 | } |
| 36 | |
| 37 | /* |
| 38 | * Mark a given offset as used in the map. |
| 39 | */ |
| 40 | static void mark_random_map(struct thread_data *td, struct io_u *io_u) |
| 41 | { |
| 42 | unsigned int min_bs = td->rw_min_bs; |
| 43 | struct fio_file *f = io_u->file; |
| 44 | unsigned long long block; |
| 45 | unsigned int blocks; |
| 46 | unsigned int nr_blocks; |
| 47 | |
| 48 | block = io_u->offset / (unsigned long long) min_bs; |
| 49 | blocks = 0; |
| 50 | nr_blocks = (io_u->buflen + min_bs - 1) / min_bs; |
| 51 | |
| 52 | while (blocks < nr_blocks) { |
| 53 | unsigned int idx, bit; |
| 54 | |
| 55 | if (!random_map_free(td, f, block)) |
| 56 | break; |
| 57 | |
| 58 | idx = RAND_MAP_IDX(td, f, block); |
| 59 | bit = RAND_MAP_BIT(td, f, block); |
| 60 | |
| 61 | fio_assert(td, idx < f->num_maps); |
| 62 | |
| 63 | f->file_map[idx] |= (1UL << bit); |
| 64 | block++; |
| 65 | blocks++; |
| 66 | } |
| 67 | |
| 68 | if ((blocks * min_bs) < io_u->buflen) |
| 69 | io_u->buflen = blocks * min_bs; |
| 70 | } |
| 71 | |
| 72 | /* |
| 73 | * Return the next free block in the map. |
| 74 | */ |
| 75 | static int get_next_free_block(struct thread_data *td, struct fio_file *f, |
| 76 | unsigned long long *b) |
| 77 | { |
| 78 | int i; |
| 79 | |
| 80 | i = f->last_free_lookup; |
| 81 | *b = (i * BLOCKS_PER_MAP); |
| 82 | while ((*b) * td->rw_min_bs < f->real_file_size) { |
| 83 | if (f->file_map[i] != -1UL) { |
| 84 | *b += ffz(f->file_map[i]); |
| 85 | f->last_free_lookup = i; |
| 86 | return 0; |
| 87 | } |
| 88 | |
| 89 | *b += BLOCKS_PER_MAP; |
| 90 | i++; |
| 91 | } |
| 92 | |
| 93 | return 1; |
| 94 | } |
| 95 | |
| 96 | /* |
| 97 | * For random io, generate a random new block and see if it's used. Repeat |
| 98 | * until we find a free one. For sequential io, just return the end of |
| 99 | * the last io issued. |
| 100 | */ |
| 101 | static int get_next_offset(struct thread_data *td, struct io_u *io_u) |
| 102 | { |
| 103 | struct fio_file *f = io_u->file; |
| 104 | const int ddir = io_u->ddir; |
| 105 | unsigned long long b, rb; |
| 106 | long r; |
| 107 | |
| 108 | if (td_random(td)) { |
| 109 | unsigned long long max_blocks = f->file_size / td->min_bs[ddir]; |
| 110 | int loops = 2; |
| 111 | |
| 112 | do { |
| 113 | r = os_random_long(&td->random_state); |
| 114 | b = ((max_blocks - 1) * r / (unsigned long long) (RAND_MAX+1.0)); |
| 115 | if (td->norandommap) |
| 116 | break; |
| 117 | rb = b + (f->file_offset / td->min_bs[ddir]); |
| 118 | loops--; |
| 119 | } while (!random_map_free(td, f, rb) && loops); |
| 120 | |
| 121 | /* |
| 122 | * if we failed to retrieve a truly random offset within |
| 123 | * the loops assigned, see if there are free ones left at all |
| 124 | */ |
| 125 | if (!loops && get_next_free_block(td, f, &b)) |
| 126 | return 1; |
| 127 | } else |
| 128 | b = f->last_pos / td->min_bs[ddir]; |
| 129 | |
| 130 | io_u->offset = (b * td->min_bs[ddir]) + f->file_offset; |
| 131 | if (io_u->offset >= f->real_file_size) |
| 132 | return 1; |
| 133 | |
| 134 | return 0; |
| 135 | } |
| 136 | |
| 137 | static unsigned int get_next_buflen(struct thread_data *td, struct io_u *io_u) |
| 138 | { |
| 139 | struct fio_file *f = io_u->file; |
| 140 | const int ddir = io_u->ddir; |
| 141 | unsigned int buflen; |
| 142 | long r; |
| 143 | |
| 144 | if (td->min_bs[ddir] == td->max_bs[ddir]) |
| 145 | buflen = td->min_bs[ddir]; |
| 146 | else { |
| 147 | r = os_random_long(&td->bsrange_state); |
| 148 | buflen = (unsigned int) (1 + (double) (td->max_bs[ddir] - 1) * r / (RAND_MAX + 1.0)); |
| 149 | if (!td->bs_unaligned) |
| 150 | buflen = (buflen + td->min_bs[ddir] - 1) & ~(td->min_bs[ddir] - 1); |
| 151 | } |
| 152 | |
| 153 | while (buflen + io_u->offset > f->real_file_size) { |
| 154 | if (buflen == td->min_bs[ddir]) |
| 155 | return 0; |
| 156 | |
| 157 | buflen = td->min_bs[ddir]; |
| 158 | } |
| 159 | |
| 160 | return buflen; |
| 161 | } |
| 162 | |
| 163 | /* |
| 164 | * Return the data direction for the next io_u. If the job is a |
| 165 | * mixed read/write workload, check the rwmix cycle and switch if |
| 166 | * necessary. |
| 167 | */ |
| 168 | static enum fio_ddir get_rw_ddir(struct thread_data *td) |
| 169 | { |
| 170 | if (td_rw(td)) { |
| 171 | struct timeval now; |
| 172 | unsigned long elapsed; |
| 173 | |
| 174 | fio_gettime(&now, NULL); |
| 175 | elapsed = mtime_since_now(&td->rwmix_switch); |
| 176 | |
| 177 | /* |
| 178 | * Check if it's time to seed a new data direction. |
| 179 | */ |
| 180 | if (elapsed >= td->rwmixcycle) { |
| 181 | unsigned int v; |
| 182 | long r; |
| 183 | |
| 184 | r = os_random_long(&td->rwmix_state); |
| 185 | v = 1 + (int) (100.0 * (r / (RAND_MAX + 1.0))); |
| 186 | if (v < td->rwmixread) |
| 187 | td->rwmix_ddir = DDIR_READ; |
| 188 | else |
| 189 | td->rwmix_ddir = DDIR_WRITE; |
| 190 | memcpy(&td->rwmix_switch, &now, sizeof(now)); |
| 191 | } |
| 192 | return td->rwmix_ddir; |
| 193 | } else if (td_read(td)) |
| 194 | return DDIR_READ; |
| 195 | else |
| 196 | return DDIR_WRITE; |
| 197 | } |
| 198 | |
| 199 | void put_io_u(struct thread_data *td, struct io_u *io_u) |
| 200 | { |
| 201 | assert((io_u->flags & IO_U_F_FREE) == 0); |
| 202 | io_u->flags |= IO_U_F_FREE; |
| 203 | |
| 204 | io_u->file = NULL; |
| 205 | list_del(&io_u->list); |
| 206 | list_add(&io_u->list, &td->io_u_freelist); |
| 207 | td->cur_depth--; |
| 208 | } |
| 209 | |
| 210 | void requeue_io_u(struct thread_data *td, struct io_u **io_u) |
| 211 | { |
| 212 | struct io_u *__io_u = *io_u; |
| 213 | |
| 214 | __io_u->flags |= IO_U_F_FREE; |
| 215 | __io_u->flags &= ~IO_U_F_FLIGHT; |
| 216 | |
| 217 | list_del(&__io_u->list); |
| 218 | list_add_tail(&__io_u->list, &td->io_u_requeues); |
| 219 | td->cur_depth--; |
| 220 | *io_u = NULL; |
| 221 | } |
| 222 | |
| 223 | static int fill_io_u(struct thread_data *td, struct io_u *io_u) |
| 224 | { |
| 225 | /* |
| 226 | * If using an iolog, grab next piece if any available. |
| 227 | */ |
| 228 | if (td->read_iolog) |
| 229 | return read_iolog_get(td, io_u); |
| 230 | |
| 231 | /* |
| 232 | * see if it's time to sync |
| 233 | */ |
| 234 | if (td->fsync_blocks && !(td->io_issues[DDIR_WRITE] % td->fsync_blocks) |
| 235 | && td->io_issues[DDIR_WRITE] && should_fsync(td)) { |
| 236 | io_u->ddir = DDIR_SYNC; |
| 237 | return 0; |
| 238 | } |
| 239 | |
| 240 | io_u->ddir = get_rw_ddir(td); |
| 241 | |
| 242 | /* |
| 243 | * No log, let the seq/rand engine retrieve the next buflen and |
| 244 | * position. |
| 245 | */ |
| 246 | if (get_next_offset(td, io_u)) |
| 247 | return 1; |
| 248 | |
| 249 | io_u->buflen = get_next_buflen(td, io_u); |
| 250 | if (!io_u->buflen) |
| 251 | return 1; |
| 252 | |
| 253 | /* |
| 254 | * mark entry before potentially trimming io_u |
| 255 | */ |
| 256 | if (!td->read_iolog && td_random(td) && !td->norandommap) |
| 257 | mark_random_map(td, io_u); |
| 258 | |
| 259 | /* |
| 260 | * If using a write iolog, store this entry. |
| 261 | */ |
| 262 | if (td->write_iolog_file) |
| 263 | write_iolog_put(td, io_u); |
| 264 | |
| 265 | return 0; |
| 266 | } |
| 267 | |
| 268 | static void io_u_mark_depth(struct thread_data *td) |
| 269 | { |
| 270 | int index = 0; |
| 271 | |
| 272 | switch (td->cur_depth) { |
| 273 | default: |
| 274 | index++; |
| 275 | case 32 ... 63: |
| 276 | index++; |
| 277 | case 16 ... 31: |
| 278 | index++; |
| 279 | case 8 ... 15: |
| 280 | index++; |
| 281 | case 4 ... 7: |
| 282 | index++; |
| 283 | case 2 ... 3: |
| 284 | index++; |
| 285 | case 1: |
| 286 | break; |
| 287 | } |
| 288 | |
| 289 | td->ts.io_u_map[index]++; |
| 290 | td->ts.total_io_u++; |
| 291 | } |
| 292 | |
| 293 | static void io_u_mark_latency(struct thread_data *td, unsigned long msec) |
| 294 | { |
| 295 | int index = 0; |
| 296 | |
| 297 | switch (msec) { |
| 298 | default: |
| 299 | index++; |
| 300 | case 1000 ... 1999: |
| 301 | index++; |
| 302 | case 750 ... 999: |
| 303 | index++; |
| 304 | case 500 ... 749: |
| 305 | index++; |
| 306 | case 250 ... 499: |
| 307 | index++; |
| 308 | case 100 ... 249: |
| 309 | index++; |
| 310 | case 50 ... 99: |
| 311 | index++; |
| 312 | case 20 ... 49: |
| 313 | index++; |
| 314 | case 10 ... 19: |
| 315 | index++; |
| 316 | case 4 ... 9: |
| 317 | index++; |
| 318 | case 2 ... 3: |
| 319 | index++; |
| 320 | case 0 ... 1: |
| 321 | break; |
| 322 | } |
| 323 | |
| 324 | td->ts.io_u_lat[index]++; |
| 325 | } |
| 326 | |
| 327 | /* |
| 328 | * Get next file to service by choosing one at random |
| 329 | */ |
| 330 | static struct fio_file *get_next_file_rand(struct thread_data *td) |
| 331 | { |
| 332 | unsigned int fileno; |
| 333 | struct fio_file *f; |
| 334 | |
| 335 | do { |
| 336 | long r = os_random_long(&td->next_file_state); |
| 337 | |
| 338 | fileno = (unsigned int) ((double) (td->open_files - 1) * r / (RAND_MAX + 1.0)); |
| 339 | f = &td->files[fileno]; |
| 340 | if (f->fd != -1) |
| 341 | return f; |
| 342 | } while (1); |
| 343 | } |
| 344 | |
| 345 | /* |
| 346 | * Get next file to service by doing round robin between all available ones |
| 347 | */ |
| 348 | static struct fio_file *get_next_file_rr(struct thread_data *td) |
| 349 | { |
| 350 | unsigned int old_next_file = td->next_file; |
| 351 | struct fio_file *f; |
| 352 | |
| 353 | do { |
| 354 | f = &td->files[td->next_file]; |
| 355 | |
| 356 | td->next_file++; |
| 357 | if (td->next_file >= td->open_files) |
| 358 | td->next_file = 0; |
| 359 | |
| 360 | if (f->fd != -1) |
| 361 | break; |
| 362 | |
| 363 | f = NULL; |
| 364 | } while (td->next_file != old_next_file); |
| 365 | |
| 366 | return f; |
| 367 | } |
| 368 | |
| 369 | static struct fio_file *get_next_file(struct thread_data *td) |
| 370 | { |
| 371 | if (!td->nr_open_files) |
| 372 | return NULL; |
| 373 | |
| 374 | if (td->file_service_type == FIO_FSERVICE_RR) |
| 375 | return get_next_file_rr(td); |
| 376 | else |
| 377 | return get_next_file_rand(td); |
| 378 | } |
| 379 | |
| 380 | struct io_u *__get_io_u(struct thread_data *td) |
| 381 | { |
| 382 | struct io_u *io_u = NULL; |
| 383 | |
| 384 | if (!list_empty(&td->io_u_requeues)) |
| 385 | io_u = list_entry(td->io_u_requeues.next, struct io_u, list); |
| 386 | else if (!queue_full(td)) { |
| 387 | io_u = list_entry(td->io_u_freelist.next, struct io_u, list); |
| 388 | |
| 389 | io_u->buflen = 0; |
| 390 | io_u->resid = 0; |
| 391 | io_u->file = NULL; |
| 392 | io_u->end_io = NULL; |
| 393 | } |
| 394 | |
| 395 | if (io_u) { |
| 396 | assert(io_u->flags & IO_U_F_FREE); |
| 397 | io_u->flags &= ~IO_U_F_FREE; |
| 398 | |
| 399 | io_u->error = 0; |
| 400 | list_del(&io_u->list); |
| 401 | list_add(&io_u->list, &td->io_u_busylist); |
| 402 | td->cur_depth++; |
| 403 | io_u_mark_depth(td); |
| 404 | } |
| 405 | |
| 406 | return io_u; |
| 407 | } |
| 408 | |
| 409 | /* |
| 410 | * Return an io_u to be processed. Gets a buflen and offset, sets direction, |
| 411 | * etc. The returned io_u is fully ready to be prepped and submitted. |
| 412 | */ |
| 413 | struct io_u *get_io_u(struct thread_data *td) |
| 414 | { |
| 415 | struct fio_file *f; |
| 416 | struct io_u *io_u; |
| 417 | |
| 418 | io_u = __get_io_u(td); |
| 419 | if (!io_u) |
| 420 | return NULL; |
| 421 | |
| 422 | /* |
| 423 | * from a requeue, io_u already setup |
| 424 | */ |
| 425 | if (io_u->file) |
| 426 | goto out; |
| 427 | |
| 428 | do { |
| 429 | f = get_next_file(td); |
| 430 | if (!f) { |
| 431 | put_io_u(td, io_u); |
| 432 | return NULL; |
| 433 | } |
| 434 | |
| 435 | io_u->file = f; |
| 436 | |
| 437 | if (!fill_io_u(td, io_u)) |
| 438 | break; |
| 439 | |
| 440 | /* |
| 441 | * No more to do for this file, close it |
| 442 | */ |
| 443 | io_u->file = NULL; |
| 444 | td_io_close_file(td, f); |
| 445 | |
| 446 | /* |
| 447 | * probably not the right place to do this, but see |
| 448 | * if we need to open a new file |
| 449 | */ |
| 450 | if (td->nr_open_files < td->nr_files && |
| 451 | td->open_files != td->nr_files) |
| 452 | reopen_file(td, f); |
| 453 | } while (1); |
| 454 | |
| 455 | if (td->zone_bytes >= td->zone_size) { |
| 456 | td->zone_bytes = 0; |
| 457 | f->last_pos += td->zone_skip; |
| 458 | } |
| 459 | |
| 460 | if (io_u->buflen + io_u->offset > f->real_file_size) { |
| 461 | if (td->io_ops->flags & FIO_RAWIO) { |
| 462 | put_io_u(td, io_u); |
| 463 | return NULL; |
| 464 | } |
| 465 | |
| 466 | io_u->buflen = f->real_file_size - io_u->offset; |
| 467 | } |
| 468 | |
| 469 | if (io_u->ddir != DDIR_SYNC) { |
| 470 | if (!io_u->buflen) { |
| 471 | put_io_u(td, io_u); |
| 472 | return NULL; |
| 473 | } |
| 474 | |
| 475 | f->last_pos = io_u->offset + io_u->buflen; |
| 476 | |
| 477 | if (td->verify != VERIFY_NONE) |
| 478 | populate_verify_io_u(td, io_u); |
| 479 | } |
| 480 | |
| 481 | /* |
| 482 | * Set io data pointers. |
| 483 | */ |
| 484 | out: |
| 485 | io_u->xfer_buf = io_u->buf; |
| 486 | io_u->xfer_buflen = io_u->buflen; |
| 487 | |
| 488 | if (td_io_prep(td, io_u)) { |
| 489 | put_io_u(td, io_u); |
| 490 | return NULL; |
| 491 | } |
| 492 | |
| 493 | fio_gettime(&io_u->start_time, NULL); |
| 494 | return io_u; |
| 495 | } |
| 496 | |
| 497 | void io_u_log_error(struct thread_data *td, struct io_u *io_u) |
| 498 | { |
| 499 | const char *msg[] = { "read", "write", "sync" }; |
| 500 | |
| 501 | log_err("fio: io_u error"); |
| 502 | |
| 503 | if (io_u->file) |
| 504 | log_err(" on file %s", io_u->file->file_name); |
| 505 | |
| 506 | log_err(": %s\n", strerror(io_u->error)); |
| 507 | |
| 508 | log_err(" %s offset=%llu, buflen=%lu\n", msg[io_u->ddir], io_u->offset, io_u->xfer_buflen); |
| 509 | |
| 510 | if (!td->error) |
| 511 | td_verror(td, io_u->error, "io_u error"); |
| 512 | } |
| 513 | |
| 514 | static void io_completed(struct thread_data *td, struct io_u *io_u, |
| 515 | struct io_completion_data *icd) |
| 516 | { |
| 517 | unsigned long msec; |
| 518 | |
| 519 | assert(io_u->flags & IO_U_F_FLIGHT); |
| 520 | io_u->flags &= ~IO_U_F_FLIGHT; |
| 521 | |
| 522 | if (io_u->ddir == DDIR_SYNC) { |
| 523 | td->last_was_sync = 1; |
| 524 | return; |
| 525 | } |
| 526 | |
| 527 | td->last_was_sync = 0; |
| 528 | |
| 529 | if (!io_u->error) { |
| 530 | unsigned int bytes = io_u->buflen - io_u->resid; |
| 531 | const enum fio_ddir idx = io_u->ddir; |
| 532 | int ret; |
| 533 | |
| 534 | td->io_blocks[idx]++; |
| 535 | td->io_bytes[idx] += bytes; |
| 536 | td->zone_bytes += bytes; |
| 537 | td->this_io_bytes[idx] += bytes; |
| 538 | |
| 539 | io_u->file->last_completed_pos = io_u->offset + io_u->buflen; |
| 540 | |
| 541 | msec = mtime_since(&io_u->issue_time, &icd->time); |
| 542 | |
| 543 | add_clat_sample(td, idx, msec); |
| 544 | add_bw_sample(td, idx, &icd->time); |
| 545 | io_u_mark_latency(td, msec); |
| 546 | |
| 547 | if ((td_rw(td) || td_write(td)) && idx == DDIR_WRITE) |
| 548 | log_io_piece(td, io_u); |
| 549 | |
| 550 | icd->bytes_done[idx] += bytes; |
| 551 | |
| 552 | if (io_u->end_io) { |
| 553 | ret = io_u->end_io(io_u); |
| 554 | if (ret && !icd->error) |
| 555 | icd->error = ret; |
| 556 | } |
| 557 | } else { |
| 558 | icd->error = io_u->error; |
| 559 | io_u_log_error(td, io_u); |
| 560 | } |
| 561 | } |
| 562 | |
| 563 | static void init_icd(struct io_completion_data *icd, int nr) |
| 564 | { |
| 565 | fio_gettime(&icd->time, NULL); |
| 566 | |
| 567 | icd->nr = nr; |
| 568 | |
| 569 | icd->error = 0; |
| 570 | icd->bytes_done[0] = icd->bytes_done[1] = 0; |
| 571 | } |
| 572 | |
| 573 | static void ios_completed(struct thread_data *td, |
| 574 | struct io_completion_data *icd) |
| 575 | { |
| 576 | struct io_u *io_u; |
| 577 | int i; |
| 578 | |
| 579 | for (i = 0; i < icd->nr; i++) { |
| 580 | io_u = td->io_ops->event(td, i); |
| 581 | |
| 582 | io_completed(td, io_u, icd); |
| 583 | put_io_u(td, io_u); |
| 584 | } |
| 585 | } |
| 586 | |
| 587 | /* |
| 588 | * Complete a single io_u for the sync engines. |
| 589 | */ |
| 590 | long io_u_sync_complete(struct thread_data *td, struct io_u *io_u) |
| 591 | { |
| 592 | struct io_completion_data icd; |
| 593 | |
| 594 | init_icd(&icd, 1); |
| 595 | io_completed(td, io_u, &icd); |
| 596 | put_io_u(td, io_u); |
| 597 | |
| 598 | if (!icd.error) |
| 599 | return icd.bytes_done[0] + icd.bytes_done[1]; |
| 600 | |
| 601 | td_verror(td, icd.error, "io_u_sync_complete"); |
| 602 | return -1; |
| 603 | } |
| 604 | |
| 605 | /* |
| 606 | * Called to complete min_events number of io for the async engines. |
| 607 | */ |
| 608 | long io_u_queued_complete(struct thread_data *td, int min_events) |
| 609 | { |
| 610 | struct io_completion_data icd; |
| 611 | struct timespec *tvp = NULL; |
| 612 | int ret; |
| 613 | |
| 614 | if (!min_events) { |
| 615 | struct timespec ts = { .tv_sec = 0, .tv_nsec = 0, }; |
| 616 | |
| 617 | tvp = &ts; |
| 618 | } |
| 619 | |
| 620 | ret = td_io_getevents(td, min_events, td->cur_depth, tvp); |
| 621 | if (ret < 0) { |
| 622 | td_verror(td, -ret, "td_io_getevents"); |
| 623 | return ret; |
| 624 | } else if (!ret) |
| 625 | return ret; |
| 626 | |
| 627 | init_icd(&icd, ret); |
| 628 | ios_completed(td, &icd); |
| 629 | if (!icd.error) |
| 630 | return icd.bytes_done[0] + icd.bytes_done[1]; |
| 631 | |
| 632 | td_verror(td, icd.error, "io_u_queued_complete"); |
| 633 | return -1; |
| 634 | } |
| 635 | |
| 636 | /* |
| 637 | * Call when io_u is really queued, to update the submission latency. |
| 638 | */ |
| 639 | void io_u_queued(struct thread_data *td, struct io_u *io_u) |
| 640 | { |
| 641 | unsigned long slat_time; |
| 642 | |
| 643 | slat_time = mtime_since(&io_u->start_time, &io_u->issue_time); |
| 644 | add_slat_sample(td, io_u->ddir, slat_time); |
| 645 | } |
| 646 | |
| 647 | #ifdef FIO_USE_TIMEOUT |
| 648 | void io_u_set_timeout(struct thread_data *td) |
| 649 | { |
| 650 | assert(td->cur_depth); |
| 651 | |
| 652 | td->timer.it_interval.tv_sec = 0; |
| 653 | td->timer.it_interval.tv_usec = 0; |
| 654 | td->timer.it_value.tv_sec = IO_U_TIMEOUT + IO_U_TIMEOUT_INC; |
| 655 | td->timer.it_value.tv_usec = 0; |
| 656 | setitimer(ITIMER_REAL, &td->timer, NULL); |
| 657 | fio_gettime(&td->timeout_end, NULL); |
| 658 | } |
| 659 | |
| 660 | static void io_u_dump(struct io_u *io_u) |
| 661 | { |
| 662 | unsigned long t_start = mtime_since_now(&io_u->start_time); |
| 663 | unsigned long t_issue = mtime_since_now(&io_u->issue_time); |
| 664 | |
| 665 | log_err("io_u=%p, t_start=%lu, t_issue=%lu\n", io_u, t_start, t_issue); |
| 666 | log_err(" buf=%p/%p, len=%lu/%lu, offset=%llu\n", io_u->buf, io_u->xfer_buf, io_u->buflen, io_u->xfer_buflen, io_u->offset); |
| 667 | log_err(" ddir=%d, fname=%s\n", io_u->ddir, io_u->file->file_name); |
| 668 | } |
| 669 | #else |
| 670 | void io_u_set_timeout(struct thread_data fio_unused *td) |
| 671 | { |
| 672 | } |
| 673 | #endif |
| 674 | |
| 675 | #ifdef FIO_USE_TIMEOUT |
| 676 | static void io_u_timeout_handler(int fio_unused sig) |
| 677 | { |
| 678 | struct thread_data *td, *__td; |
| 679 | pid_t pid = getpid(); |
| 680 | struct list_head *entry; |
| 681 | struct io_u *io_u; |
| 682 | int i; |
| 683 | |
| 684 | log_err("fio: io_u timeout\n"); |
| 685 | |
| 686 | /* |
| 687 | * TLS would be nice... |
| 688 | */ |
| 689 | td = NULL; |
| 690 | for_each_td(__td, i) { |
| 691 | if (__td->pid == pid) { |
| 692 | td = __td; |
| 693 | break; |
| 694 | } |
| 695 | } |
| 696 | |
| 697 | if (!td) { |
| 698 | log_err("fio: io_u timeout, can't find job\n"); |
| 699 | exit(1); |
| 700 | } |
| 701 | |
| 702 | if (!td->cur_depth) { |
| 703 | log_err("fio: timeout without pending work?\n"); |
| 704 | return; |
| 705 | } |
| 706 | |
| 707 | log_err("fio: io_u timeout: job=%s, pid=%d\n", td->name, td->pid); |
| 708 | |
| 709 | list_for_each(entry, &td->io_u_busylist) { |
| 710 | io_u = list_entry(entry, struct io_u, list); |
| 711 | |
| 712 | io_u_dump(io_u); |
| 713 | } |
| 714 | |
| 715 | td_verror(td, ETIMEDOUT, "io_u timeout"); |
| 716 | exit(1); |
| 717 | } |
| 718 | #endif |
| 719 | |
| 720 | void io_u_init_timeout(void) |
| 721 | { |
| 722 | #ifdef FIO_USE_TIMEOUT |
| 723 | signal(SIGALRM, io_u_timeout_handler); |
| 724 | #endif |
| 725 | } |