12 * Change this define to play with the timeout handling
14 #undef FIO_USE_TIMEOUT
16 struct io_completion_data {
19 int error; /* output */
20 unsigned long bytes_done[2]; /* output */
21 struct timeval time; /* output */
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.
28 static int random_map_free(struct thread_data *td, struct fio_file *f,
29 unsigned long long block)
31 unsigned int idx = RAND_MAP_IDX(td, f, block);
32 unsigned int bit = RAND_MAP_BIT(td, f, block);
34 return (f->file_map[idx] & (1UL << bit)) == 0;
38 * Mark a given offset as used in the map.
40 static void mark_random_map(struct thread_data *td, struct io_u *io_u)
42 unsigned int min_bs = td->rw_min_bs;
43 struct fio_file *f = io_u->file;
44 unsigned long long block;
46 unsigned int nr_blocks;
48 block = io_u->offset / (unsigned long long) min_bs;
50 nr_blocks = (io_u->buflen + min_bs - 1) / min_bs;
52 while (blocks < nr_blocks) {
53 unsigned int idx, bit;
55 if (!random_map_free(td, f, block))
58 idx = RAND_MAP_IDX(td, f, block);
59 bit = RAND_MAP_BIT(td, f, block);
61 fio_assert(td, idx < f->num_maps);
63 f->file_map[idx] |= (1UL << bit);
68 if ((blocks * min_bs) < io_u->buflen)
69 io_u->buflen = blocks * min_bs;
73 * Return the next free block in the map.
75 static int get_next_free_block(struct thread_data *td, struct fio_file *f,
76 unsigned long long *b)
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;
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
101 static int get_next_offset(struct thread_data *td, struct io_u *io_u)
103 struct fio_file *f = io_u->file;
104 const int ddir = io_u->ddir;
105 unsigned long long b, rb;
109 unsigned long long max_blocks = f->file_size / td->min_bs[ddir];
113 r = os_random_long(&td->random_state);
114 b = ((max_blocks - 1) * r / (unsigned long long) (RAND_MAX+1.0));
117 rb = b + (f->file_offset / td->min_bs[ddir]);
119 } while (!random_map_free(td, f, rb) && loops);
122 * if we failed to retrieve a truly random offset within
123 * the loops assigned, see if there are free ones left at all
125 if (!loops && get_next_free_block(td, f, &b))
128 b = f->last_pos / td->min_bs[ddir];
130 io_u->offset = (b * td->min_bs[ddir]) + f->file_offset;
131 if (io_u->offset >= f->real_file_size)
137 static unsigned int get_next_buflen(struct thread_data *td, struct io_u *io_u)
139 struct fio_file *f = io_u->file;
140 const int ddir = io_u->ddir;
144 if (td->min_bs[ddir] == td->max_bs[ddir])
145 buflen = td->min_bs[ddir];
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);
153 while (buflen + io_u->offset > f->real_file_size) {
154 if (buflen == td->min_bs[ddir])
157 buflen = td->min_bs[ddir];
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
168 static enum fio_ddir get_rw_ddir(struct thread_data *td)
172 unsigned long elapsed;
174 fio_gettime(&now, NULL);
175 elapsed = mtime_since_now(&td->rwmix_switch);
178 * Check if it's time to seed a new data direction.
180 if (elapsed >= td->rwmixcycle) {
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;
189 td->rwmix_ddir = DDIR_WRITE;
190 memcpy(&td->rwmix_switch, &now, sizeof(now));
192 return td->rwmix_ddir;
193 } else if (td_read(td))
199 void put_io_u(struct thread_data *td, struct io_u *io_u)
201 assert((io_u->flags & IO_U_F_FREE) == 0);
202 io_u->flags |= IO_U_F_FREE;
205 list_del(&io_u->list);
206 list_add(&io_u->list, &td->io_u_freelist);
210 void requeue_io_u(struct thread_data *td, struct io_u **io_u)
212 struct io_u *__io_u = *io_u;
214 __io_u->flags |= IO_U_F_FREE;
215 __io_u->flags &= ~IO_U_F_FLIGHT;
217 list_del(&__io_u->list);
218 list_add_tail(&__io_u->list, &td->io_u_requeues);
223 static int fill_io_u(struct thread_data *td, struct io_u *io_u)
226 * If using an iolog, grab next piece if any available.
229 return read_iolog_get(td, io_u);
232 * see if it's time to sync
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;
240 io_u->ddir = get_rw_ddir(td);
243 * No log, let the seq/rand engine retrieve the next buflen and
246 if (get_next_offset(td, io_u))
249 io_u->buflen = get_next_buflen(td, io_u);
254 * mark entry before potentially trimming io_u
256 if (!td->read_iolog && td_random(td) && !td->norandommap)
257 mark_random_map(td, io_u);
260 * If using a write iolog, store this entry.
262 if (td->write_iolog_file)
263 write_iolog_put(td, io_u);
268 static void io_u_mark_depth(struct thread_data *td)
272 switch (td->cur_depth) {
289 td->io_u_map[index]++;
293 static void io_u_mark_latency(struct thread_data *td, unsigned long msec)
324 td->io_u_lat[index]++;
328 * Get next file to service by choosing one at random
330 static struct fio_file *get_next_file_rand(struct thread_data *td)
336 long r = os_random_long(&td->next_file_state);
338 fileno = (unsigned int) ((double) (td->nr_files - 1) * r / (RAND_MAX + 1.0));
339 f = &td->files[fileno];
346 * Get next file to service by doing round robin between all available ones
348 static struct fio_file *get_next_file_rr(struct thread_data *td)
350 unsigned int old_next_file = td->next_file;
354 f = &td->files[td->next_file];
357 if (td->next_file >= td->nr_files)
364 } while (td->next_file != old_next_file);
369 static struct fio_file *get_next_file(struct thread_data *td)
371 if (!td->nr_open_files)
374 if (td->file_service_type == FIO_FSERVICE_RR)
375 return get_next_file_rr(td);
377 return get_next_file_rand(td);
380 struct io_u *__get_io_u(struct thread_data *td)
382 struct io_u *io_u = NULL;
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);
396 assert(io_u->flags & IO_U_F_FREE);
397 io_u->flags &= ~IO_U_F_FREE;
400 list_del(&io_u->list);
401 list_add(&io_u->list, &td->io_u_busylist);
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.
413 struct io_u *get_io_u(struct thread_data *td)
418 io_u = __get_io_u(td);
423 * from a requeue, io_u already setup
429 f = get_next_file(td);
437 if (!fill_io_u(td, io_u))
441 * No more to do for this file, close it
447 if (td->zone_bytes >= td->zone_size) {
449 f->last_pos += td->zone_skip;
452 if (io_u->buflen + io_u->offset > f->real_file_size) {
453 if (td->io_ops->flags & FIO_RAWIO) {
458 io_u->buflen = f->real_file_size - io_u->offset;
461 if (io_u->ddir != DDIR_SYNC) {
467 f->last_pos = io_u->offset + io_u->buflen;
469 if (td->verify != VERIFY_NONE)
470 populate_verify_io_u(td, io_u);
474 * Set io data pointers.
477 io_u->xfer_buf = io_u->buf;
478 io_u->xfer_buflen = io_u->buflen;
480 if (td_io_prep(td, io_u)) {
485 fio_gettime(&io_u->start_time, NULL);
489 void io_u_log_error(struct thread_data *td, struct io_u *io_u)
491 const char *msg[] = { "read", "write", "sync" };
493 log_err("fio: io_u error");
496 log_err(" on file %s", io_u->file->file_name);
498 log_err(": %s\n", strerror(io_u->error));
500 log_err(" %s offset=%llu, buflen=%lu\n", msg[io_u->ddir], io_u->offset, io_u->xfer_buflen);
503 td_verror(td, io_u->error, "io_u error");
506 static void io_completed(struct thread_data *td, struct io_u *io_u,
507 struct io_completion_data *icd)
511 assert(io_u->flags & IO_U_F_FLIGHT);
512 io_u->flags &= ~IO_U_F_FLIGHT;
514 if (io_u->ddir == DDIR_SYNC) {
515 td->last_was_sync = 1;
519 td->last_was_sync = 0;
522 unsigned int bytes = io_u->buflen - io_u->resid;
523 const enum fio_ddir idx = io_u->ddir;
526 td->io_blocks[idx]++;
527 td->io_bytes[idx] += bytes;
528 td->zone_bytes += bytes;
529 td->this_io_bytes[idx] += bytes;
531 io_u->file->last_completed_pos = io_u->offset + io_u->buflen;
533 msec = mtime_since(&io_u->issue_time, &icd->time);
535 add_clat_sample(td, idx, msec);
536 add_bw_sample(td, idx, &icd->time);
537 io_u_mark_latency(td, msec);
539 if ((td_rw(td) || td_write(td)) && idx == DDIR_WRITE)
540 log_io_piece(td, io_u);
542 icd->bytes_done[idx] += bytes;
545 ret = io_u->end_io(io_u);
546 if (ret && !icd->error)
550 icd->error = io_u->error;
551 io_u_log_error(td, io_u);
555 static void init_icd(struct io_completion_data *icd, int nr)
557 fio_gettime(&icd->time, NULL);
562 icd->bytes_done[0] = icd->bytes_done[1] = 0;
565 static void ios_completed(struct thread_data *td,
566 struct io_completion_data *icd)
571 for (i = 0; i < icd->nr; i++) {
572 io_u = td->io_ops->event(td, i);
574 io_completed(td, io_u, icd);
580 * Complete a single io_u for the sync engines.
582 long io_u_sync_complete(struct thread_data *td, struct io_u *io_u)
584 struct io_completion_data icd;
587 io_completed(td, io_u, &icd);
591 return icd.bytes_done[0] + icd.bytes_done[1];
593 td_verror(td, icd.error, "io_u_sync_complete");
598 * Called to complete min_events number of io for the async engines.
600 long io_u_queued_complete(struct thread_data *td, int min_events)
602 struct io_completion_data icd;
603 struct timespec *tvp = NULL;
607 struct timespec ts = { .tv_sec = 0, .tv_nsec = 0, };
612 ret = td_io_getevents(td, min_events, td->cur_depth, tvp);
614 td_verror(td, -ret, "td_io_getevents");
620 ios_completed(td, &icd);
622 return icd.bytes_done[0] + icd.bytes_done[1];
624 td_verror(td, icd.error, "io_u_queued_complete");
629 * Call when io_u is really queued, to update the submission latency.
631 void io_u_queued(struct thread_data *td, struct io_u *io_u)
633 unsigned long slat_time;
635 slat_time = mtime_since(&io_u->start_time, &io_u->issue_time);
636 add_slat_sample(td, io_u->ddir, slat_time);
639 #ifdef FIO_USE_TIMEOUT
640 void io_u_set_timeout(struct thread_data *td)
642 assert(td->cur_depth);
644 td->timer.it_interval.tv_sec = 0;
645 td->timer.it_interval.tv_usec = 0;
646 td->timer.it_value.tv_sec = IO_U_TIMEOUT + IO_U_TIMEOUT_INC;
647 td->timer.it_value.tv_usec = 0;
648 setitimer(ITIMER_REAL, &td->timer, NULL);
649 fio_gettime(&td->timeout_end, NULL);
652 static void io_u_dump(struct io_u *io_u)
654 unsigned long t_start = mtime_since_now(&io_u->start_time);
655 unsigned long t_issue = mtime_since_now(&io_u->issue_time);
657 log_err("io_u=%p, t_start=%lu, t_issue=%lu\n", io_u, t_start, t_issue);
658 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);
659 log_err(" ddir=%d, fname=%s\n", io_u->ddir, io_u->file->file_name);
662 void io_u_set_timeout(struct thread_data fio_unused *td)
667 #ifdef FIO_USE_TIMEOUT
668 static void io_u_timeout_handler(int fio_unused sig)
670 struct thread_data *td, *__td;
671 pid_t pid = getpid();
672 struct list_head *entry;
676 log_err("fio: io_u timeout\n");
679 * TLS would be nice...
682 for_each_td(__td, i) {
683 if (__td->pid == pid) {
690 log_err("fio: io_u timeout, can't find job\n");
694 if (!td->cur_depth) {
695 log_err("fio: timeout without pending work?\n");
699 log_err("fio: io_u timeout: job=%s, pid=%d\n", td->name, td->pid);
701 list_for_each(entry, &td->io_u_busylist) {
702 io_u = list_entry(entry, struct io_u, list);
707 td_verror(td, ETIMEDOUT, "io_u timeout");
712 void io_u_init_timeout(void)
714 #ifdef FIO_USE_TIMEOUT
715 signal(SIGALRM, io_u_timeout_handler);