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->o.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;
56 * If we have a mixed random workload, we may
57 * encounter blocks we already did IO to.
59 if (!td->o.ddir_nr && !random_map_free(td, f, block))
62 idx = RAND_MAP_IDX(td, f, block);
63 bit = RAND_MAP_BIT(td, f, block);
65 fio_assert(td, idx < f->num_maps);
67 f->file_map[idx] |= (1UL << bit);
72 if ((blocks * min_bs) < io_u->buflen)
73 io_u->buflen = blocks * min_bs;
77 * Return the next free block in the map.
79 static int get_next_free_block(struct thread_data *td, struct fio_file *f,
80 unsigned long long *b)
84 i = f->last_free_lookup;
85 *b = (i * BLOCKS_PER_MAP);
86 while ((*b) * td->o.rw_min_bs < f->real_file_size) {
87 if (f->file_map[i] != -1UL) {
88 *b += ffz(f->file_map[i]);
89 f->last_free_lookup = i;
100 static int get_next_rand_offset(struct thread_data *td, struct fio_file *f,
101 int ddir, unsigned long long *b)
103 unsigned long long max_blocks = f->file_size / td->o.min_bs[ddir];
104 unsigned long long r, rb;
108 r = os_random_long(&td->random_state);
112 *b = ((max_blocks - 1) * r / (unsigned long long) (RAND_MAX+1.0));
113 if (td->o.norandommap)
115 rb = *b + (f->file_offset / td->o.min_bs[ddir]);
117 } while (!random_map_free(td, f, rb) && loops);
120 * if we failed to retrieve a truly random offset within
121 * the loops assigned, see if there are free ones left at all
123 if (!loops && get_next_free_block(td, f, b))
130 * For random io, generate a random new block and see if it's used. Repeat
131 * until we find a free one. For sequential io, just return the end of
132 * the last io issued.
134 static int get_next_offset(struct thread_data *td, struct io_u *io_u)
136 struct fio_file *f = io_u->file;
137 const int ddir = io_u->ddir;
138 unsigned long long b;
140 if (td_random(td) && (td->o.ddir_nr && !--td->ddir_nr)) {
141 td->ddir_nr = td->o.ddir_nr;
143 if (get_next_rand_offset(td, f, ddir, &b))
146 b = f->last_pos / td->o.min_bs[ddir];
148 io_u->offset = (b * td->o.min_bs[ddir]) + f->file_offset;
149 if (io_u->offset >= f->real_file_size)
155 static unsigned int get_next_buflen(struct thread_data *td, struct io_u *io_u)
157 struct fio_file *f = io_u->file;
158 const int ddir = io_u->ddir;
162 if (td->o.min_bs[ddir] == td->o.max_bs[ddir])
163 buflen = td->o.min_bs[ddir];
165 r = os_random_long(&td->bsrange_state);
166 buflen = (unsigned int) (1 + (double) (td->o.max_bs[ddir] - 1) * r / (RAND_MAX + 1.0));
167 if (!td->o.bs_unaligned)
168 buflen = (buflen + td->o.min_bs[ddir] - 1) & ~(td->o.min_bs[ddir] - 1);
171 while (buflen + io_u->offset > f->real_file_size) {
172 if (buflen == td->o.min_bs[ddir]) {
173 if (!td->o.odirect) {
174 assert(io_u->offset <= f->real_file_size);
175 buflen = f->real_file_size - io_u->offset;
181 buflen = td->o.min_bs[ddir];
187 static void set_rwmix_bytes(struct thread_data *td)
189 unsigned long long rbytes;
193 * we do time or byte based switch. this is needed because
194 * buffered writes may issue a lot quicker than they complete,
195 * whereas reads do not.
197 rbytes = td->io_bytes[td->rwmix_ddir] - td->rwmix_bytes;
198 diff = td->o.rwmix[td->rwmix_ddir ^ 1];
200 td->rwmix_bytes = td->io_bytes[td->rwmix_ddir] + (rbytes * ((100 - diff)) / diff);
203 static inline enum fio_ddir get_rand_ddir(struct thread_data *td)
208 r = os_random_long(&td->rwmix_state);
209 v = 1 + (int) (100.0 * (r / (RAND_MAX + 1.0)));
210 if (v < td->o.rwmix[DDIR_READ])
217 * Return the data direction for the next io_u. If the job is a
218 * mixed read/write workload, check the rwmix cycle and switch if
221 static enum fio_ddir get_rw_ddir(struct thread_data *td)
225 unsigned long elapsed;
228 fio_gettime(&now, NULL);
229 elapsed = mtime_since_now(&td->rwmix_switch);
232 * if this is the first cycle, make it shorter
234 cycle = td->o.rwmixcycle;
235 if (!td->rwmix_bytes)
239 * Check if it's time to seed a new data direction.
241 if (elapsed >= cycle ||
242 td->io_bytes[td->rwmix_ddir] >= td->rwmix_bytes) {
243 unsigned long long max_bytes;
247 * Put a top limit on how many bytes we do for
248 * one data direction, to avoid overflowing the
251 ddir = get_rand_ddir(td);
252 max_bytes = td->this_io_bytes[ddir];
253 if (max_bytes >= (td->io_size * td->o.rwmix[ddir] / 100)) {
254 if (!td->rw_end_set[ddir]) {
255 td->rw_end_set[ddir] = 1;
256 memcpy(&td->rw_end[ddir], &now, sizeof(now));
261 if (ddir != td->rwmix_ddir)
264 td->rwmix_ddir = ddir;
265 memcpy(&td->rwmix_switch, &now, sizeof(now));
267 return td->rwmix_ddir;
268 } else if (td_read(td))
274 void put_io_u(struct thread_data *td, struct io_u *io_u)
276 assert((io_u->flags & IO_U_F_FREE) == 0);
277 io_u->flags |= IO_U_F_FREE;
280 list_del(&io_u->list);
281 list_add(&io_u->list, &td->io_u_freelist);
285 void requeue_io_u(struct thread_data *td, struct io_u **io_u)
287 struct io_u *__io_u = *io_u;
289 __io_u->flags |= IO_U_F_FREE;
290 __io_u->flags &= ~IO_U_F_FLIGHT;
292 list_del(&__io_u->list);
293 list_add_tail(&__io_u->list, &td->io_u_requeues);
298 static int fill_io_u(struct thread_data *td, struct io_u *io_u)
301 * If using an iolog, grab next piece if any available.
303 if (td->o.read_iolog)
304 return read_iolog_get(td, io_u);
307 * see if it's time to sync
309 if (td->o.fsync_blocks &&
310 !(td->io_issues[DDIR_WRITE] % td->o.fsync_blocks) &&
311 td->io_issues[DDIR_WRITE] && should_fsync(td)) {
312 io_u->ddir = DDIR_SYNC;
316 io_u->ddir = get_rw_ddir(td);
319 * No log, let the seq/rand engine retrieve the next buflen and
322 if (get_next_offset(td, io_u))
325 io_u->buflen = get_next_buflen(td, io_u);
330 * mark entry before potentially trimming io_u
332 if (!td->o.read_iolog && td_random(td) && !td->o.norandommap)
333 mark_random_map(td, io_u);
336 * If using a write iolog, store this entry.
338 if (td->o.write_iolog_file)
339 write_iolog_put(td, io_u);
344 void io_u_mark_depth(struct thread_data *td, struct io_u *io_u)
348 if (io_u->ddir == DDIR_SYNC)
351 switch (td->cur_depth) {
368 td->ts.io_u_map[index]++;
369 td->ts.total_io_u[io_u->ddir]++;
372 static void io_u_mark_latency(struct thread_data *td, unsigned long msec)
403 td->ts.io_u_lat[index]++;
407 * Get next file to service by choosing one at random
409 static struct fio_file *get_next_file_rand(struct thread_data *td, int goodf,
416 long r = os_random_long(&td->next_file_state);
418 fno = (unsigned int) ((double) td->o.nr_files * (r / (RAND_MAX + 1.0)));
421 if ((!goodf || (f->flags & goodf)) && !(f->flags & badf))
427 * Get next file to service by doing round robin between all available ones
429 static struct fio_file *get_next_file_rr(struct thread_data *td, int goodf,
432 unsigned int old_next_file = td->next_file;
436 f = &td->files[td->next_file];
439 if (td->next_file >= td->o.nr_files)
442 if ((!goodf || (f->flags & goodf)) && !(f->flags & badf))
446 } while (td->next_file != old_next_file);
451 static struct fio_file *get_next_file(struct thread_data *td)
455 assert(td->o.nr_files <= td->files_index);
457 if (!td->nr_open_files)
460 f = td->file_service_file;
461 if (f && (f->flags & FIO_FILE_OPEN) && td->file_service_left--)
464 if (td->o.file_service_type == FIO_FSERVICE_RR)
465 f = get_next_file_rr(td, FIO_FILE_OPEN, FIO_FILE_CLOSING);
467 f = get_next_file_rand(td, FIO_FILE_OPEN, FIO_FILE_CLOSING);
469 td->file_service_file = f;
470 td->file_service_left = td->file_service_nr - 1;
474 static struct fio_file *find_next_new_file(struct thread_data *td)
478 if (td->o.file_service_type == FIO_FSERVICE_RR)
479 f = get_next_file_rr(td, 0, FIO_FILE_OPEN);
481 f = get_next_file_rand(td, 0, FIO_FILE_OPEN);
486 struct io_u *__get_io_u(struct thread_data *td)
488 struct io_u *io_u = NULL;
490 if (!list_empty(&td->io_u_requeues))
491 io_u = list_entry(td->io_u_requeues.next, struct io_u, list);
492 else if (!queue_full(td)) {
493 io_u = list_entry(td->io_u_freelist.next, struct io_u, list);
502 assert(io_u->flags & IO_U_F_FREE);
503 io_u->flags &= ~IO_U_F_FREE;
506 list_del(&io_u->list);
507 list_add(&io_u->list, &td->io_u_busylist);
515 * Return an io_u to be processed. Gets a buflen and offset, sets direction,
516 * etc. The returned io_u is fully ready to be prepped and submitted.
518 struct io_u *get_io_u(struct thread_data *td)
524 io_u = __get_io_u(td);
529 * from a requeue, io_u already setup
535 f = get_next_file(td);
544 if (!fill_io_u(td, io_u))
548 * No more to do for this file, close it
551 td_io_close_file(td, f);
554 * probably not the right place to do this, but see
555 * if we need to open a new file
557 if (td->nr_open_files < td->o.open_files &&
558 td->o.open_files != td->o.nr_files) {
559 f = find_next_new_file(td);
561 if (!f || (ret = td_io_open_file(td, f))) {
569 if (td->zone_bytes >= td->o.zone_size) {
571 f->last_pos += td->o.zone_skip;
574 if (io_u->buflen + io_u->offset > f->real_file_size) {
575 if (td->io_ops->flags & FIO_RAWIO) {
580 io_u->buflen = f->real_file_size - io_u->offset;
583 if (io_u->ddir != DDIR_SYNC) {
589 f->last_pos = io_u->offset + io_u->buflen;
591 if (td->o.verify != VERIFY_NONE)
592 populate_verify_io_u(td, io_u);
596 * Set io data pointers.
599 io_u->xfer_buf = io_u->buf;
600 io_u->xfer_buflen = io_u->buflen;
602 if (td_io_prep(td, io_u)) {
607 fio_gettime(&io_u->start_time, NULL);
611 void io_u_log_error(struct thread_data *td, struct io_u *io_u)
613 const char *msg[] = { "read", "write", "sync" };
615 log_err("fio: io_u error");
618 log_err(" on file %s", io_u->file->file_name);
620 log_err(": %s\n", strerror(io_u->error));
622 log_err(" %s offset=%llu, buflen=%lu\n", msg[io_u->ddir], io_u->offset, io_u->xfer_buflen);
625 td_verror(td, io_u->error, "io_u error");
628 static void io_completed(struct thread_data *td, struct io_u *io_u,
629 struct io_completion_data *icd)
633 assert(io_u->flags & IO_U_F_FLIGHT);
634 io_u->flags &= ~IO_U_F_FLIGHT;
636 put_file(td, io_u->file);
638 if (io_u->ddir == DDIR_SYNC) {
639 td->last_was_sync = 1;
643 td->last_was_sync = 0;
646 unsigned int bytes = io_u->buflen - io_u->resid;
647 const enum fio_ddir idx = io_u->ddir;
650 td->io_blocks[idx]++;
651 td->io_bytes[idx] += bytes;
652 td->zone_bytes += bytes;
653 td->this_io_bytes[idx] += bytes;
655 io_u->file->last_completed_pos = io_u->offset + io_u->buflen;
657 msec = mtime_since(&io_u->issue_time, &icd->time);
659 add_clat_sample(td, idx, msec);
660 add_bw_sample(td, idx, &icd->time);
661 io_u_mark_latency(td, msec);
663 if ((td_rw(td) || td_write(td)) && idx == DDIR_WRITE)
664 log_io_piece(td, io_u);
666 icd->bytes_done[idx] += bytes;
669 ret = io_u->end_io(td, io_u);
670 if (ret && !icd->error)
674 icd->error = io_u->error;
675 io_u_log_error(td, io_u);
679 static void init_icd(struct io_completion_data *icd, int nr)
681 fio_gettime(&icd->time, NULL);
686 icd->bytes_done[0] = icd->bytes_done[1] = 0;
689 static void ios_completed(struct thread_data *td,
690 struct io_completion_data *icd)
695 for (i = 0; i < icd->nr; i++) {
696 io_u = td->io_ops->event(td, i);
698 io_completed(td, io_u, icd);
704 * Complete a single io_u for the sync engines.
706 long io_u_sync_complete(struct thread_data *td, struct io_u *io_u)
708 struct io_completion_data icd;
711 io_completed(td, io_u, &icd);
715 return icd.bytes_done[0] + icd.bytes_done[1];
717 td_verror(td, icd.error, "io_u_sync_complete");
722 * Called to complete min_events number of io for the async engines.
724 long io_u_queued_complete(struct thread_data *td, int min_events)
726 struct io_completion_data icd;
727 struct timespec *tvp = NULL;
729 struct timespec ts = { .tv_sec = 0, .tv_nsec = 0, };
734 ret = td_io_getevents(td, min_events, td->cur_depth, tvp);
736 td_verror(td, -ret, "td_io_getevents");
742 ios_completed(td, &icd);
744 return icd.bytes_done[0] + icd.bytes_done[1];
746 td_verror(td, icd.error, "io_u_queued_complete");
751 * Call when io_u is really queued, to update the submission latency.
753 void io_u_queued(struct thread_data *td, struct io_u *io_u)
755 unsigned long slat_time;
757 slat_time = mtime_since(&io_u->start_time, &io_u->issue_time);
758 add_slat_sample(td, io_u->ddir, slat_time);
761 #ifdef FIO_USE_TIMEOUT
762 void io_u_set_timeout(struct thread_data *td)
764 assert(td->cur_depth);
766 td->timer.it_interval.tv_sec = 0;
767 td->timer.it_interval.tv_usec = 0;
768 td->timer.it_value.tv_sec = IO_U_TIMEOUT + IO_U_TIMEOUT_INC;
769 td->timer.it_value.tv_usec = 0;
770 setitimer(ITIMER_REAL, &td->timer, NULL);
771 fio_gettime(&td->timeout_end, NULL);
774 static void io_u_dump(struct io_u *io_u)
776 unsigned long t_start = mtime_since_now(&io_u->start_time);
777 unsigned long t_issue = mtime_since_now(&io_u->issue_time);
779 log_err("io_u=%p, t_start=%lu, t_issue=%lu\n", io_u, t_start, t_issue);
780 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);
781 log_err(" ddir=%d, fname=%s\n", io_u->ddir, io_u->file->file_name);
784 void io_u_set_timeout(struct thread_data fio_unused *td)
789 #ifdef FIO_USE_TIMEOUT
790 static void io_u_timeout_handler(int fio_unused sig)
792 struct thread_data *td, *__td;
793 pid_t pid = getpid();
794 struct list_head *entry;
798 log_err("fio: io_u timeout\n");
801 * TLS would be nice...
804 for_each_td(__td, i) {
805 if (__td->pid == pid) {
812 log_err("fio: io_u timeout, can't find job\n");
816 if (!td->cur_depth) {
817 log_err("fio: timeout without pending work?\n");
821 log_err("fio: io_u timeout: job=%s, pid=%d\n", td->o.name, td->pid);
823 list_for_each(entry, &td->io_u_busylist) {
824 io_u = list_entry(entry, struct io_u, list);
829 td_verror(td, ETIMEDOUT, "io_u timeout");
834 void io_u_init_timeout(void)
836 #ifdef FIO_USE_TIMEOUT
837 signal(SIGALRM, io_u_timeout_handler);