13 #include "lib/axmap.h"
16 struct io_completion_data {
19 int error; /* output */
20 uint64_t bytes_done[DDIR_RWDIR_CNT]; /* output */
21 struct timeval time; /* output */
25 * The ->io_axmap 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 fio_file *f, const uint64_t block)
30 return !axmap_isset(f->io_axmap, block);
34 * Mark a given offset as used in the map.
36 static void mark_random_map(struct thread_data *td, struct io_u *io_u)
38 unsigned int min_bs = td->o.rw_min_bs;
39 struct fio_file *f = io_u->file;
40 unsigned int nr_blocks;
43 block = (io_u->offset - f->file_offset) / (uint64_t) min_bs;
44 nr_blocks = (io_u->buflen + min_bs - 1) / min_bs;
46 if (!(io_u->flags & IO_U_F_BUSY_OK))
47 nr_blocks = axmap_set_nr(f->io_axmap, block, nr_blocks);
49 if ((nr_blocks * min_bs) < io_u->buflen)
50 io_u->buflen = nr_blocks * min_bs;
53 static uint64_t last_block(struct thread_data *td, struct fio_file *f,
59 assert(ddir_rw(ddir));
62 * Hmm, should we make sure that ->io_size <= ->real_file_size?
64 max_size = f->io_size;
65 if (max_size > f->real_file_size)
66 max_size = f->real_file_size;
69 max_size = td->o.zone_range;
71 max_blocks = max_size / (uint64_t) td->o.ba[ddir];
79 struct flist_head list;
83 static int __get_next_rand_offset(struct thread_data *td, struct fio_file *f,
84 enum fio_ddir ddir, uint64_t *b)
88 lastb = last_block(td, f, ddir);
92 if (td->o.random_generator == FIO_RAND_GEN_TAUSWORTHE) {
95 rmax = td->o.use_os_rand ? OS_RAND_MAX : FRAND_MAX;
97 if (td->o.use_os_rand) {
99 r = os_random_long(&td->random_state);
102 r = __rand(&td->__random_state);
105 dprint(FD_RANDOM, "off rand %llu\n", (unsigned long long) r);
107 *b = lastb * (r / ((uint64_t) rmax + 1.0));
111 if (lfsr_next(&f->lfsr, &off, lastb))
118 * if we are not maintaining a random map, we are done.
120 if (!file_randommap(td, f))
124 * calculate map offset and check if it's free
126 if (random_map_free(f, *b))
129 dprint(FD_RANDOM, "get_next_rand_offset: offset %llu busy\n",
130 (unsigned long long) *b);
132 *b = axmap_next_free(f->io_axmap, *b);
133 if (*b == (uint64_t) -1ULL)
139 static int __get_next_rand_offset_zipf(struct thread_data *td,
140 struct fio_file *f, enum fio_ddir ddir,
143 *b = zipf_next(&f->zipf);
147 static int __get_next_rand_offset_pareto(struct thread_data *td,
148 struct fio_file *f, enum fio_ddir ddir,
151 *b = pareto_next(&f->zipf);
155 static int flist_cmp(void *data, struct flist_head *a, struct flist_head *b)
157 struct rand_off *r1 = flist_entry(a, struct rand_off, list);
158 struct rand_off *r2 = flist_entry(b, struct rand_off, list);
160 return r1->off - r2->off;
163 static int get_off_from_method(struct thread_data *td, struct fio_file *f,
164 enum fio_ddir ddir, uint64_t *b)
166 if (td->o.random_distribution == FIO_RAND_DIST_RANDOM)
167 return __get_next_rand_offset(td, f, ddir, b);
168 else if (td->o.random_distribution == FIO_RAND_DIST_ZIPF)
169 return __get_next_rand_offset_zipf(td, f, ddir, b);
170 else if (td->o.random_distribution == FIO_RAND_DIST_PARETO)
171 return __get_next_rand_offset_pareto(td, f, ddir, b);
173 log_err("fio: unknown random distribution: %d\n", td->o.random_distribution);
178 * Sort the reads for a verify phase in batches of verifysort_nr, if
181 static inline int should_sort_io(struct thread_data *td)
183 if (!td->o.verifysort_nr || !td->o.do_verify)
187 if (td->runstate != TD_VERIFYING)
189 if (td->o.random_generator == FIO_RAND_GEN_TAUSWORTHE)
195 static int should_do_random(struct thread_data *td, enum fio_ddir ddir)
200 if (td->o.perc_rand[ddir] == 100)
203 if (td->o.use_os_rand) {
204 r = os_random_long(&td->seq_rand_state[ddir]);
205 v = 1 + (int) (100.0 * (r / (OS_RAND_MAX + 1.0)));
207 r = __rand(&td->__seq_rand_state[ddir]);
208 v = 1 + (int) (100.0 * (r / (FRAND_MAX + 1.0)));
211 return v <= td->o.perc_rand[ddir];
214 static int get_next_rand_offset(struct thread_data *td, struct fio_file *f,
215 enum fio_ddir ddir, uint64_t *b)
220 if (!should_sort_io(td))
221 return get_off_from_method(td, f, ddir, b);
223 if (!flist_empty(&td->next_rand_list)) {
226 r = flist_entry(td->next_rand_list.next, struct rand_off, list);
233 for (i = 0; i < td->o.verifysort_nr; i++) {
234 r = malloc(sizeof(*r));
236 ret = get_off_from_method(td, f, ddir, &r->off);
242 flist_add(&r->list, &td->next_rand_list);
248 assert(!flist_empty(&td->next_rand_list));
249 flist_sort(NULL, &td->next_rand_list, flist_cmp);
253 static int get_next_rand_block(struct thread_data *td, struct fio_file *f,
254 enum fio_ddir ddir, uint64_t *b)
256 if (!get_next_rand_offset(td, f, ddir, b))
259 if (td->o.time_based) {
260 fio_file_reset(td, f);
261 if (!get_next_rand_offset(td, f, ddir, b))
265 dprint(FD_IO, "%s: rand offset failed, last=%llu, size=%llu\n",
266 f->file_name, (unsigned long long) f->last_pos,
267 (unsigned long long) f->real_file_size);
271 static int get_next_seq_offset(struct thread_data *td, struct fio_file *f,
272 enum fio_ddir ddir, uint64_t *offset)
274 assert(ddir_rw(ddir));
276 if (f->last_pos >= f->io_size + get_start_offset(td, f) && td->o.time_based)
277 f->last_pos = f->last_pos - f->io_size;
279 if (f->last_pos < f->real_file_size) {
282 if (f->last_pos == f->file_offset && td->o.ddir_seq_add < 0)
283 f->last_pos = f->real_file_size;
285 pos = f->last_pos - f->file_offset;
287 pos += td->o.ddir_seq_add;
296 static int get_next_block(struct thread_data *td, struct io_u *io_u,
297 enum fio_ddir ddir, int rw_seq,
298 unsigned int *is_random)
300 struct fio_file *f = io_u->file;
304 assert(ddir_rw(ddir));
310 if (should_do_random(td, ddir)) {
311 ret = get_next_rand_block(td, f, ddir, &b);
315 io_u->flags |= IO_U_F_BUSY_OK;
316 ret = get_next_seq_offset(td, f, ddir, &offset);
318 ret = get_next_rand_block(td, f, ddir, &b);
322 ret = get_next_seq_offset(td, f, ddir, &offset);
325 io_u->flags |= IO_U_F_BUSY_OK;
328 if (td->o.rw_seq == RW_SEQ_SEQ) {
329 ret = get_next_seq_offset(td, f, ddir, &offset);
331 ret = get_next_rand_block(td, f, ddir, &b);
334 } else if (td->o.rw_seq == RW_SEQ_IDENT) {
335 if (f->last_start != -1ULL)
336 offset = f->last_start - f->file_offset;
341 log_err("fio: unknown rw_seq=%d\n", td->o.rw_seq);
348 io_u->offset = offset;
350 io_u->offset = b * td->o.ba[ddir];
352 log_err("fio: bug in offset generation: offset=%llu, b=%llu\n", (unsigned long long) offset, (unsigned long long) b);
361 * For random io, generate a random new block and see if it's used. Repeat
362 * until we find a free one. For sequential io, just return the end of
363 * the last io issued.
365 static int __get_next_offset(struct thread_data *td, struct io_u *io_u,
366 unsigned int *is_random)
368 struct fio_file *f = io_u->file;
369 enum fio_ddir ddir = io_u->ddir;
372 assert(ddir_rw(ddir));
374 if (td->o.ddir_seq_nr && !--td->ddir_seq_nr) {
376 td->ddir_seq_nr = td->o.ddir_seq_nr;
379 if (get_next_block(td, io_u, ddir, rw_seq_hit, is_random))
382 if (io_u->offset >= f->io_size) {
383 dprint(FD_IO, "get_next_offset: offset %llu >= io_size %llu\n",
384 (unsigned long long) io_u->offset,
385 (unsigned long long) f->io_size);
389 io_u->offset += f->file_offset;
390 if (io_u->offset >= f->real_file_size) {
391 dprint(FD_IO, "get_next_offset: offset %llu >= size %llu\n",
392 (unsigned long long) io_u->offset,
393 (unsigned long long) f->real_file_size);
400 static int get_next_offset(struct thread_data *td, struct io_u *io_u,
401 unsigned int *is_random)
403 if (td->flags & TD_F_PROFILE_OPS) {
404 struct prof_io_ops *ops = &td->prof_io_ops;
406 if (ops->fill_io_u_off)
407 return ops->fill_io_u_off(td, io_u, is_random);
410 return __get_next_offset(td, io_u, is_random);
413 static inline int io_u_fits(struct thread_data *td, struct io_u *io_u,
416 struct fio_file *f = io_u->file;
418 return io_u->offset + buflen <= f->io_size + get_start_offset(td, f);
421 static unsigned int __get_next_buflen(struct thread_data *td, struct io_u *io_u,
422 unsigned int is_random)
424 int ddir = io_u->ddir;
425 unsigned int buflen = 0;
426 unsigned int minbs, maxbs;
427 unsigned long r, rand_max;
429 assert(ddir_rw(ddir));
431 if (td->o.bs_is_seq_rand)
432 ddir = is_random ? DDIR_WRITE: DDIR_READ;
434 minbs = td->o.min_bs[ddir];
435 maxbs = td->o.max_bs[ddir];
441 * If we can't satisfy the min block size from here, then fail
443 if (!io_u_fits(td, io_u, minbs))
446 if (td->o.use_os_rand)
447 rand_max = OS_RAND_MAX;
449 rand_max = FRAND_MAX;
452 if (td->o.use_os_rand)
453 r = os_random_long(&td->bsrange_state);
455 r = __rand(&td->__bsrange_state);
457 if (!td->o.bssplit_nr[ddir]) {
458 buflen = 1 + (unsigned int) ((double) maxbs *
459 (r / (rand_max + 1.0)));
466 for (i = 0; i < td->o.bssplit_nr[ddir]; i++) {
467 struct bssplit *bsp = &td->o.bssplit[ddir][i];
471 if ((r <= ((rand_max / 100L) * perc)) &&
472 io_u_fits(td, io_u, buflen))
477 if (td->o.do_verify && td->o.verify != VERIFY_NONE)
478 buflen = (buflen + td->o.verify_interval - 1) &
479 ~(td->o.verify_interval - 1);
481 if (!td->o.bs_unaligned && is_power_of_2(minbs))
482 buflen = (buflen + minbs - 1) & ~(minbs - 1);
484 } while (!io_u_fits(td, io_u, buflen));
489 static unsigned int get_next_buflen(struct thread_data *td, struct io_u *io_u,
490 unsigned int is_random)
492 if (td->flags & TD_F_PROFILE_OPS) {
493 struct prof_io_ops *ops = &td->prof_io_ops;
495 if (ops->fill_io_u_size)
496 return ops->fill_io_u_size(td, io_u, is_random);
499 return __get_next_buflen(td, io_u, is_random);
502 static void set_rwmix_bytes(struct thread_data *td)
507 * we do time or byte based switch. this is needed because
508 * buffered writes may issue a lot quicker than they complete,
509 * whereas reads do not.
511 diff = td->o.rwmix[td->rwmix_ddir ^ 1];
512 td->rwmix_issues = (td->io_issues[td->rwmix_ddir] * diff) / 100;
515 static inline enum fio_ddir get_rand_ddir(struct thread_data *td)
520 if (td->o.use_os_rand) {
521 r = os_random_long(&td->rwmix_state);
522 v = 1 + (int) (100.0 * (r / (OS_RAND_MAX + 1.0)));
524 r = __rand(&td->__rwmix_state);
525 v = 1 + (int) (100.0 * (r / (FRAND_MAX + 1.0)));
528 if (v <= td->o.rwmix[DDIR_READ])
534 void io_u_quiesce(struct thread_data *td)
537 * We are going to sleep, ensure that we flush anything pending as
538 * not to skew our latency numbers.
540 * Changed to only monitor 'in flight' requests here instead of the
541 * td->cur_depth, b/c td->cur_depth does not accurately represent
542 * io's that have been actually submitted to an async engine,
543 * and cur_depth is meaningless for sync engines.
545 while (td->io_u_in_flight) {
548 ret = io_u_queued_complete(td, 1, NULL);
552 static enum fio_ddir rate_ddir(struct thread_data *td, enum fio_ddir ddir)
554 enum fio_ddir odir = ddir ^ 1;
558 assert(ddir_rw(ddir));
560 if (td->rate_pending_usleep[ddir] <= 0)
564 * We have too much pending sleep in this direction. See if we
567 if (td_rw(td) && td->o.rwmix[odir]) {
569 * Other direction does not have too much pending, switch
571 if (td->rate_pending_usleep[odir] < 100000)
575 * Both directions have pending sleep. Sleep the minimum time
576 * and deduct from both.
578 if (td->rate_pending_usleep[ddir] <=
579 td->rate_pending_usleep[odir]) {
580 usec = td->rate_pending_usleep[ddir];
582 usec = td->rate_pending_usleep[odir];
586 usec = td->rate_pending_usleep[ddir];
590 fio_gettime(&t, NULL);
591 usec_sleep(td, usec);
592 usec = utime_since_now(&t);
594 td->rate_pending_usleep[ddir] -= usec;
597 if (td_rw(td) && __should_check_rate(td, odir))
598 td->rate_pending_usleep[odir] -= usec;
607 * Return the data direction for the next io_u. If the job is a
608 * mixed read/write workload, check the rwmix cycle and switch if
611 static enum fio_ddir get_rw_ddir(struct thread_data *td)
616 * see if it's time to fsync
618 if (td->o.fsync_blocks &&
619 !(td->io_issues[DDIR_WRITE] % td->o.fsync_blocks) &&
620 td->io_issues[DDIR_WRITE] && should_fsync(td))
624 * see if it's time to fdatasync
626 if (td->o.fdatasync_blocks &&
627 !(td->io_issues[DDIR_WRITE] % td->o.fdatasync_blocks) &&
628 td->io_issues[DDIR_WRITE] && should_fsync(td))
629 return DDIR_DATASYNC;
632 * see if it's time to sync_file_range
634 if (td->sync_file_range_nr &&
635 !(td->io_issues[DDIR_WRITE] % td->sync_file_range_nr) &&
636 td->io_issues[DDIR_WRITE] && should_fsync(td))
637 return DDIR_SYNC_FILE_RANGE;
641 * Check if it's time to seed a new data direction.
643 if (td->io_issues[td->rwmix_ddir] >= td->rwmix_issues) {
645 * Put a top limit on how many bytes we do for
646 * one data direction, to avoid overflowing the
649 ddir = get_rand_ddir(td);
651 if (ddir != td->rwmix_ddir)
654 td->rwmix_ddir = ddir;
656 ddir = td->rwmix_ddir;
657 } else if (td_read(td))
659 else if (td_write(td))
664 td->rwmix_ddir = rate_ddir(td, ddir);
665 return td->rwmix_ddir;
668 static void set_rw_ddir(struct thread_data *td, struct io_u *io_u)
670 io_u->ddir = io_u->acct_ddir = get_rw_ddir(td);
672 if (io_u->ddir == DDIR_WRITE && (td->io_ops->flags & FIO_BARRIER) &&
673 td->o.barrier_blocks &&
674 !(td->io_issues[DDIR_WRITE] % td->o.barrier_blocks) &&
675 td->io_issues[DDIR_WRITE])
676 io_u->flags |= IO_U_F_BARRIER;
679 void put_file_log(struct thread_data *td, struct fio_file *f)
681 unsigned int ret = put_file(td, f);
684 td_verror(td, ret, "file close");
687 void put_io_u(struct thread_data *td, struct io_u *io_u)
691 if (io_u->file && !(io_u->flags & IO_U_F_FREE_DEF))
692 put_file_log(td, io_u->file);
694 io_u->flags &= ~IO_U_F_FREE_DEF;
695 io_u->flags |= IO_U_F_FREE;
697 if (io_u->flags & IO_U_F_IN_CUR_DEPTH)
699 io_u_qpush(&td->io_u_freelist, io_u);
701 td_io_u_free_notify(td);
704 void clear_io_u(struct thread_data *td, struct io_u *io_u)
706 io_u->flags &= ~IO_U_F_FLIGHT;
710 void requeue_io_u(struct thread_data *td, struct io_u **io_u)
712 struct io_u *__io_u = *io_u;
713 enum fio_ddir ddir = acct_ddir(__io_u);
715 dprint(FD_IO, "requeue %p\n", __io_u);
719 __io_u->flags |= IO_U_F_FREE;
720 if ((__io_u->flags & IO_U_F_FLIGHT) && ddir_rw(ddir))
721 td->io_issues[ddir]--;
723 __io_u->flags &= ~IO_U_F_FLIGHT;
724 if (__io_u->flags & IO_U_F_IN_CUR_DEPTH)
727 io_u_rpush(&td->io_u_requeues, __io_u);
732 static int fill_io_u(struct thread_data *td, struct io_u *io_u)
734 unsigned int is_random;
736 if (td->io_ops->flags & FIO_NOIO)
739 set_rw_ddir(td, io_u);
742 * fsync() or fdatasync() or trim etc, we are done
744 if (!ddir_rw(io_u->ddir))
748 * See if it's time to switch to a new zone
750 if (td->zone_bytes >= td->o.zone_size && td->o.zone_skip) {
752 io_u->file->file_offset += td->o.zone_range + td->o.zone_skip;
753 io_u->file->last_pos = io_u->file->file_offset;
754 td->io_skip_bytes += td->o.zone_skip;
758 * No log, let the seq/rand engine retrieve the next buflen and
761 if (get_next_offset(td, io_u, &is_random)) {
762 dprint(FD_IO, "io_u %p, failed getting offset\n", io_u);
766 io_u->buflen = get_next_buflen(td, io_u, is_random);
768 dprint(FD_IO, "io_u %p, failed getting buflen\n", io_u);
772 if (io_u->offset + io_u->buflen > io_u->file->real_file_size) {
773 dprint(FD_IO, "io_u %p, offset too large\n", io_u);
774 dprint(FD_IO, " off=%llu/%lu > %llu\n",
775 (unsigned long long) io_u->offset, io_u->buflen,
776 (unsigned long long) io_u->file->real_file_size);
781 * mark entry before potentially trimming io_u
783 if (td_random(td) && file_randommap(td, io_u->file))
784 mark_random_map(td, io_u);
787 dprint_io_u(io_u, "fill_io_u");
788 td->zone_bytes += io_u->buflen;
792 static void __io_u_mark_map(unsigned int *map, unsigned int nr)
821 void io_u_mark_submit(struct thread_data *td, unsigned int nr)
823 __io_u_mark_map(td->ts.io_u_submit, nr);
824 td->ts.total_submit++;
827 void io_u_mark_complete(struct thread_data *td, unsigned int nr)
829 __io_u_mark_map(td->ts.io_u_complete, nr);
830 td->ts.total_complete++;
833 void io_u_mark_depth(struct thread_data *td, unsigned int nr)
837 switch (td->cur_depth) {
859 td->ts.io_u_map[idx] += nr;
862 static void io_u_mark_lat_usec(struct thread_data *td, unsigned long usec)
899 assert(idx < FIO_IO_U_LAT_U_NR);
900 td->ts.io_u_lat_u[idx]++;
903 static void io_u_mark_lat_msec(struct thread_data *td, unsigned long msec)
944 assert(idx < FIO_IO_U_LAT_M_NR);
945 td->ts.io_u_lat_m[idx]++;
948 static void io_u_mark_latency(struct thread_data *td, unsigned long usec)
951 io_u_mark_lat_usec(td, usec);
953 io_u_mark_lat_msec(td, usec / 1000);
957 * Get next file to service by choosing one at random
959 static struct fio_file *get_next_file_rand(struct thread_data *td,
960 enum fio_file_flags goodf,
961 enum fio_file_flags badf)
970 if (td->o.use_os_rand) {
971 r = os_random_long(&td->next_file_state);
972 fno = (unsigned int) ((double) td->o.nr_files
973 * (r / (OS_RAND_MAX + 1.0)));
975 r = __rand(&td->__next_file_state);
976 fno = (unsigned int) ((double) td->o.nr_files
977 * (r / (FRAND_MAX + 1.0)));
981 if (fio_file_done(f))
984 if (!fio_file_open(f)) {
987 if (td->nr_open_files >= td->o.open_files)
988 return ERR_PTR(-EBUSY);
990 err = td_io_open_file(td, f);
996 if ((!goodf || (f->flags & goodf)) && !(f->flags & badf)) {
997 dprint(FD_FILE, "get_next_file_rand: %p\n", f);
1001 td_io_close_file(td, f);
1006 * Get next file to service by doing round robin between all available ones
1008 static struct fio_file *get_next_file_rr(struct thread_data *td, int goodf,
1011 unsigned int old_next_file = td->next_file;
1017 f = td->files[td->next_file];
1020 if (td->next_file >= td->o.nr_files)
1023 dprint(FD_FILE, "trying file %s %x\n", f->file_name, f->flags);
1024 if (fio_file_done(f)) {
1029 if (!fio_file_open(f)) {
1032 if (td->nr_open_files >= td->o.open_files)
1033 return ERR_PTR(-EBUSY);
1035 err = td_io_open_file(td, f);
1037 dprint(FD_FILE, "error %d on open of %s\n",
1045 dprint(FD_FILE, "goodf=%x, badf=%x, ff=%x\n", goodf, badf,
1047 if ((!goodf || (f->flags & goodf)) && !(f->flags & badf))
1051 td_io_close_file(td, f);
1054 } while (td->next_file != old_next_file);
1056 dprint(FD_FILE, "get_next_file_rr: %p\n", f);
1060 static struct fio_file *__get_next_file(struct thread_data *td)
1064 assert(td->o.nr_files <= td->files_index);
1066 if (td->nr_done_files >= td->o.nr_files) {
1067 dprint(FD_FILE, "get_next_file: nr_open=%d, nr_done=%d,"
1068 " nr_files=%d\n", td->nr_open_files,
1074 f = td->file_service_file;
1075 if (f && fio_file_open(f) && !fio_file_closing(f)) {
1076 if (td->o.file_service_type == FIO_FSERVICE_SEQ)
1078 if (td->file_service_left--)
1082 if (td->o.file_service_type == FIO_FSERVICE_RR ||
1083 td->o.file_service_type == FIO_FSERVICE_SEQ)
1084 f = get_next_file_rr(td, FIO_FILE_open, FIO_FILE_closing);
1086 f = get_next_file_rand(td, FIO_FILE_open, FIO_FILE_closing);
1091 td->file_service_file = f;
1092 td->file_service_left = td->file_service_nr - 1;
1095 dprint(FD_FILE, "get_next_file: %p [%s]\n", f, f->file_name);
1097 dprint(FD_FILE, "get_next_file: NULL\n");
1101 static struct fio_file *get_next_file(struct thread_data *td)
1103 if (!(td->flags & TD_F_PROFILE_OPS)) {
1104 struct prof_io_ops *ops = &td->prof_io_ops;
1106 if (ops->get_next_file)
1107 return ops->get_next_file(td);
1110 return __get_next_file(td);
1113 static long set_io_u_file(struct thread_data *td, struct io_u *io_u)
1118 f = get_next_file(td);
1119 if (IS_ERR_OR_NULL(f))
1125 if (!fill_io_u(td, io_u))
1128 put_file_log(td, f);
1129 td_io_close_file(td, f);
1131 fio_file_set_done(f);
1132 td->nr_done_files++;
1133 dprint(FD_FILE, "%s: is done (%d of %d)\n", f->file_name,
1134 td->nr_done_files, td->o.nr_files);
1140 static void lat_fatal(struct thread_data *td, struct io_completion_data *icd,
1141 unsigned long tusec, unsigned long max_usec)
1144 log_err("fio: latency of %lu usec exceeds specified max (%lu usec)\n", tusec, max_usec);
1145 td_verror(td, ETIMEDOUT, "max latency exceeded");
1146 icd->error = ETIMEDOUT;
1149 static void lat_new_cycle(struct thread_data *td)
1151 fio_gettime(&td->latency_ts, NULL);
1152 td->latency_ios = ddir_rw_sum(td->io_blocks);
1153 td->latency_failed = 0;
1157 * We had an IO outside the latency target. Reduce the queue depth. If we
1158 * are at QD=1, then it's time to give up.
1160 static int __lat_target_failed(struct thread_data *td)
1162 if (td->latency_qd == 1)
1165 td->latency_qd_high = td->latency_qd;
1167 if (td->latency_qd == td->latency_qd_low)
1168 td->latency_qd_low--;
1170 td->latency_qd = (td->latency_qd + td->latency_qd_low) / 2;
1172 dprint(FD_RATE, "Ramped down: %d %d %d\n", td->latency_qd_low, td->latency_qd, td->latency_qd_high);
1175 * When we ramp QD down, quiesce existing IO to prevent
1176 * a storm of ramp downs due to pending higher depth.
1183 static int lat_target_failed(struct thread_data *td)
1185 if (td->o.latency_percentile.u.f == 100.0)
1186 return __lat_target_failed(td);
1188 td->latency_failed++;
1192 void lat_target_init(struct thread_data *td)
1194 td->latency_end_run = 0;
1196 if (td->o.latency_target) {
1197 dprint(FD_RATE, "Latency target=%llu\n", td->o.latency_target);
1198 fio_gettime(&td->latency_ts, NULL);
1200 td->latency_qd_high = td->o.iodepth;
1201 td->latency_qd_low = 1;
1202 td->latency_ios = ddir_rw_sum(td->io_blocks);
1204 td->latency_qd = td->o.iodepth;
1207 void lat_target_reset(struct thread_data *td)
1209 if (!td->latency_end_run)
1210 lat_target_init(td);
1213 static void lat_target_success(struct thread_data *td)
1215 const unsigned int qd = td->latency_qd;
1216 struct thread_options *o = &td->o;
1218 td->latency_qd_low = td->latency_qd;
1221 * If we haven't failed yet, we double up to a failing value instead
1222 * of bisecting from highest possible queue depth. If we have set
1223 * a limit other than td->o.iodepth, bisect between that.
1225 if (td->latency_qd_high != o->iodepth)
1226 td->latency_qd = (td->latency_qd + td->latency_qd_high) / 2;
1228 td->latency_qd *= 2;
1230 if (td->latency_qd > o->iodepth)
1231 td->latency_qd = o->iodepth;
1233 dprint(FD_RATE, "Ramped up: %d %d %d\n", td->latency_qd_low, td->latency_qd, td->latency_qd_high);
1236 * Same as last one, we are done. Let it run a latency cycle, so
1237 * we get only the results from the targeted depth.
1239 if (td->latency_qd == qd) {
1240 if (td->latency_end_run) {
1241 dprint(FD_RATE, "We are done\n");
1244 dprint(FD_RATE, "Quiesce and final run\n");
1246 td->latency_end_run = 1;
1247 reset_all_stats(td);
1256 * Check if we can bump the queue depth
1258 void lat_target_check(struct thread_data *td)
1260 uint64_t usec_window;
1264 usec_window = utime_since_now(&td->latency_ts);
1265 if (usec_window < td->o.latency_window)
1268 ios = ddir_rw_sum(td->io_blocks) - td->latency_ios;
1269 success_ios = (double) (ios - td->latency_failed) / (double) ios;
1270 success_ios *= 100.0;
1272 dprint(FD_RATE, "Success rate: %.2f%% (target %.2f%%)\n", success_ios, td->o.latency_percentile.u.f);
1274 if (success_ios >= td->o.latency_percentile.u.f)
1275 lat_target_success(td);
1277 __lat_target_failed(td);
1281 * If latency target is enabled, we might be ramping up or down and not
1282 * using the full queue depth available.
1284 int queue_full(struct thread_data *td)
1286 const int qempty = io_u_qempty(&td->io_u_freelist);
1290 if (!td->o.latency_target)
1293 return td->cur_depth >= td->latency_qd;
1296 struct io_u *__get_io_u(struct thread_data *td)
1298 struct io_u *io_u = NULL;
1303 if (!io_u_rempty(&td->io_u_requeues))
1304 io_u = io_u_rpop(&td->io_u_requeues);
1305 else if (!queue_full(td)) {
1306 io_u = io_u_qpop(&td->io_u_freelist);
1311 io_u->end_io = NULL;
1315 assert(io_u->flags & IO_U_F_FREE);
1316 io_u->flags &= ~(IO_U_F_FREE | IO_U_F_FREE_DEF);
1317 io_u->flags &= ~(IO_U_F_TRIMMED | IO_U_F_BARRIER);
1318 io_u->flags &= ~IO_U_F_VER_LIST;
1321 io_u->acct_ddir = -1;
1323 io_u->flags |= IO_U_F_IN_CUR_DEPTH;
1325 } else if (td->o.verify_async) {
1327 * We ran out, wait for async verify threads to finish and
1330 pthread_cond_wait(&td->free_cond, &td->io_u_lock);
1338 static int check_get_trim(struct thread_data *td, struct io_u *io_u)
1340 if (!(td->flags & TD_F_TRIM_BACKLOG))
1343 if (td->trim_entries) {
1346 if (td->trim_batch) {
1349 } else if (!(td->io_hist_len % td->o.trim_backlog) &&
1350 td->last_ddir != DDIR_READ) {
1351 td->trim_batch = td->o.trim_batch;
1352 if (!td->trim_batch)
1353 td->trim_batch = td->o.trim_backlog;
1357 if (get_trim && !get_next_trim(td, io_u))
1364 static int check_get_verify(struct thread_data *td, struct io_u *io_u)
1366 if (!(td->flags & TD_F_VER_BACKLOG))
1369 if (td->io_hist_len) {
1372 if (td->verify_batch)
1374 else if (!(td->io_hist_len % td->o.verify_backlog) &&
1375 td->last_ddir != DDIR_READ) {
1376 td->verify_batch = td->o.verify_batch;
1377 if (!td->verify_batch)
1378 td->verify_batch = td->o.verify_backlog;
1382 if (get_verify && !get_next_verify(td, io_u)) {
1392 * Fill offset and start time into the buffer content, to prevent too
1393 * easy compressible data for simple de-dupe attempts. Do this for every
1394 * 512b block in the range, since that should be the smallest block size
1395 * we can expect from a device.
1397 static void small_content_scramble(struct io_u *io_u)
1399 unsigned int i, nr_blocks = io_u->buflen / 512;
1401 unsigned int offset;
1408 boffset = io_u->offset;
1409 io_u->buf_filled_len = 0;
1411 for (i = 0; i < nr_blocks; i++) {
1413 * Fill the byte offset into a "random" start offset of
1414 * the buffer, given by the product of the usec time
1415 * and the actual offset.
1417 offset = (io_u->start_time.tv_usec ^ boffset) & 511;
1418 offset &= ~(sizeof(uint64_t) - 1);
1419 if (offset >= 512 - sizeof(uint64_t))
1420 offset -= sizeof(uint64_t);
1421 memcpy(p + offset, &boffset, sizeof(boffset));
1423 end = p + 512 - sizeof(io_u->start_time);
1424 memcpy(end, &io_u->start_time, sizeof(io_u->start_time));
1431 * Return an io_u to be processed. Gets a buflen and offset, sets direction,
1432 * etc. The returned io_u is fully ready to be prepped and submitted.
1434 struct io_u *get_io_u(struct thread_data *td)
1438 int do_scramble = 0;
1441 io_u = __get_io_u(td);
1443 dprint(FD_IO, "__get_io_u failed\n");
1447 if (check_get_verify(td, io_u))
1449 if (check_get_trim(td, io_u))
1453 * from a requeue, io_u already setup
1459 * If using an iolog, grab next piece if any available.
1461 if (td->flags & TD_F_READ_IOLOG) {
1462 if (read_iolog_get(td, io_u))
1464 } else if (set_io_u_file(td, io_u)) {
1466 dprint(FD_IO, "io_u %p, setting file failed\n", io_u);
1472 dprint(FD_IO, "io_u %p, setting file failed\n", io_u);
1476 assert(fio_file_open(f));
1478 if (ddir_rw(io_u->ddir)) {
1479 if (!io_u->buflen && !(td->io_ops->flags & FIO_NOIO)) {
1480 dprint(FD_IO, "get_io_u: zero buflen on %p\n", io_u);
1484 f->last_start = io_u->offset;
1485 f->last_pos = io_u->offset + io_u->buflen;
1487 if (io_u->ddir == DDIR_WRITE) {
1488 if (td->flags & TD_F_REFILL_BUFFERS) {
1489 io_u_fill_buffer(td, io_u,
1490 io_u->xfer_buflen, io_u->xfer_buflen);
1491 } else if ((td->flags & TD_F_SCRAMBLE_BUFFERS) &&
1492 !(td->flags & TD_F_COMPRESS))
1494 if (td->flags & TD_F_VER_NONE) {
1495 populate_verify_io_u(td, io_u);
1498 } else if (io_u->ddir == DDIR_READ) {
1500 * Reset the buf_filled parameters so next time if the
1501 * buffer is used for writes it is refilled.
1503 io_u->buf_filled_len = 0;
1508 * Set io data pointers.
1510 io_u->xfer_buf = io_u->buf;
1511 io_u->xfer_buflen = io_u->buflen;
1515 if (!td_io_prep(td, io_u)) {
1516 if (!td->o.disable_slat)
1517 fio_gettime(&io_u->start_time, NULL);
1519 small_content_scramble(io_u);
1523 dprint(FD_IO, "get_io_u failed\n");
1525 return ERR_PTR(ret);
1528 void io_u_log_error(struct thread_data *td, struct io_u *io_u)
1530 enum error_type_bit eb = td_error_type(io_u->ddir, io_u->error);
1531 const char *msg[] = { "read", "write", "sync", "datasync",
1532 "sync_file_range", "wait", "trim" };
1534 if (td_non_fatal_error(td, eb, io_u->error) && !td->o.error_dump)
1537 log_err("fio: io_u error");
1540 log_err(" on file %s", io_u->file->file_name);
1542 log_err(": %s\n", strerror(io_u->error));
1544 log_err(" %s offset=%llu, buflen=%lu\n", msg[io_u->ddir],
1545 io_u->offset, io_u->xfer_buflen);
1548 td_verror(td, io_u->error, "io_u error");
1551 static inline int gtod_reduce(struct thread_data *td)
1553 return td->o.disable_clat && td->o.disable_lat && td->o.disable_slat
1554 && td->o.disable_bw;
1557 static void account_io_completion(struct thread_data *td, struct io_u *io_u,
1558 struct io_completion_data *icd,
1559 const enum fio_ddir idx, unsigned int bytes)
1561 unsigned long lusec = 0;
1563 if (!gtod_reduce(td))
1564 lusec = utime_since(&io_u->issue_time, &icd->time);
1566 if (!td->o.disable_lat) {
1567 unsigned long tusec;
1569 tusec = utime_since(&io_u->start_time, &icd->time);
1570 add_lat_sample(td, idx, tusec, bytes);
1572 if (td->flags & TD_F_PROFILE_OPS) {
1573 struct prof_io_ops *ops = &td->prof_io_ops;
1576 icd->error = ops->io_u_lat(td, tusec);
1579 if (td->o.max_latency && tusec > td->o.max_latency)
1580 lat_fatal(td, icd, tusec, td->o.max_latency);
1581 if (td->o.latency_target && tusec > td->o.latency_target) {
1582 if (lat_target_failed(td))
1583 lat_fatal(td, icd, tusec, td->o.latency_target);
1587 if (!td->o.disable_clat) {
1588 add_clat_sample(td, idx, lusec, bytes);
1589 io_u_mark_latency(td, lusec);
1592 if (!td->o.disable_bw)
1593 add_bw_sample(td, idx, bytes, &icd->time);
1595 if (!gtod_reduce(td))
1596 add_iops_sample(td, idx, bytes, &icd->time);
1599 static long long usec_for_io(struct thread_data *td, enum fio_ddir ddir)
1601 uint64_t secs, remainder, bps, bytes;
1603 bytes = td->this_io_bytes[ddir];
1604 bps = td->rate_bps[ddir];
1606 remainder = bytes % bps;
1607 return remainder * 1000000 / bps + secs * 1000000;
1610 static void io_completed(struct thread_data *td, struct io_u *io_u,
1611 struct io_completion_data *icd)
1615 dprint_io_u(io_u, "io complete");
1618 assert(io_u->flags & IO_U_F_FLIGHT);
1619 io_u->flags &= ~(IO_U_F_FLIGHT | IO_U_F_BUSY_OK);
1622 * Mark IO ok to verify
1626 * Remove errored entry from the verification list
1629 unlog_io_piece(td, io_u);
1631 io_u->ipo->flags &= ~IP_F_IN_FLIGHT;
1638 if (ddir_sync(io_u->ddir)) {
1639 td->last_was_sync = 1;
1642 f->first_write = -1ULL;
1643 f->last_write = -1ULL;
1648 td->last_was_sync = 0;
1649 td->last_ddir = io_u->ddir;
1651 if (!io_u->error && ddir_rw(io_u->ddir)) {
1652 unsigned int bytes = io_u->buflen - io_u->resid;
1653 const enum fio_ddir idx = io_u->ddir;
1654 const enum fio_ddir odx = io_u->ddir ^ 1;
1657 td->io_blocks[idx]++;
1658 td->this_io_blocks[idx]++;
1659 td->io_bytes[idx] += bytes;
1661 if (!(io_u->flags & IO_U_F_VER_LIST))
1662 td->this_io_bytes[idx] += bytes;
1664 if (idx == DDIR_WRITE) {
1667 if (f->first_write == -1ULL ||
1668 io_u->offset < f->first_write)
1669 f->first_write = io_u->offset;
1670 if (f->last_write == -1ULL ||
1671 ((io_u->offset + bytes) > f->last_write))
1672 f->last_write = io_u->offset + bytes;
1676 if (ramp_time_over(td) && (td->runstate == TD_RUNNING ||
1677 td->runstate == TD_VERIFYING)) {
1678 account_io_completion(td, io_u, icd, idx, bytes);
1680 if (__should_check_rate(td, idx)) {
1681 td->rate_pending_usleep[idx] =
1682 (usec_for_io(td, idx) -
1683 utime_since_now(&td->start));
1685 if (idx != DDIR_TRIM && __should_check_rate(td, odx))
1686 td->rate_pending_usleep[odx] =
1687 (usec_for_io(td, odx) -
1688 utime_since_now(&td->start));
1691 icd->bytes_done[idx] += bytes;
1694 ret = io_u->end_io(td, io_u);
1695 if (ret && !icd->error)
1698 } else if (io_u->error) {
1699 icd->error = io_u->error;
1700 io_u_log_error(td, io_u);
1703 enum error_type_bit eb = td_error_type(io_u->ddir, icd->error);
1704 if (!td_non_fatal_error(td, eb, icd->error))
1707 * If there is a non_fatal error, then add to the error count
1708 * and clear all the errors.
1710 update_error_count(td, icd->error);
1717 static void init_icd(struct thread_data *td, struct io_completion_data *icd,
1722 if (!gtod_reduce(td))
1723 fio_gettime(&icd->time, NULL);
1728 for (ddir = DDIR_READ; ddir < DDIR_RWDIR_CNT; ddir++)
1729 icd->bytes_done[ddir] = 0;
1732 static void ios_completed(struct thread_data *td,
1733 struct io_completion_data *icd)
1738 for (i = 0; i < icd->nr; i++) {
1739 io_u = td->io_ops->event(td, i);
1741 io_completed(td, io_u, icd);
1743 if (!(io_u->flags & IO_U_F_FREE_DEF))
1749 * Complete a single io_u for the sync engines.
1751 int io_u_sync_complete(struct thread_data *td, struct io_u *io_u,
1754 struct io_completion_data icd;
1756 init_icd(td, &icd, 1);
1757 io_completed(td, io_u, &icd);
1759 if (!(io_u->flags & IO_U_F_FREE_DEF))
1763 td_verror(td, icd.error, "io_u_sync_complete");
1770 for (ddir = DDIR_READ; ddir < DDIR_RWDIR_CNT; ddir++)
1771 bytes[ddir] += icd.bytes_done[ddir];
1778 * Called to complete min_events number of io for the async engines.
1780 int io_u_queued_complete(struct thread_data *td, int min_evts,
1783 struct io_completion_data icd;
1784 struct timespec *tvp = NULL;
1786 struct timespec ts = { .tv_sec = 0, .tv_nsec = 0, };
1788 dprint(FD_IO, "io_u_queued_completed: min=%d\n", min_evts);
1793 ret = td_io_getevents(td, min_evts, td->o.iodepth_batch_complete, tvp);
1795 td_verror(td, -ret, "td_io_getevents");
1800 init_icd(td, &icd, ret);
1801 ios_completed(td, &icd);
1803 td_verror(td, icd.error, "io_u_queued_complete");
1810 for (ddir = DDIR_READ; ddir < DDIR_RWDIR_CNT; ddir++)
1811 bytes[ddir] += icd.bytes_done[ddir];
1818 * Call when io_u is really queued, to update the submission latency.
1820 void io_u_queued(struct thread_data *td, struct io_u *io_u)
1822 if (!td->o.disable_slat) {
1823 unsigned long slat_time;
1825 slat_time = utime_since(&io_u->start_time, &io_u->issue_time);
1826 add_slat_sample(td, io_u->ddir, slat_time, io_u->xfer_buflen);
1830 void fill_io_buffer(struct thread_data *td, void *buf, unsigned int min_write,
1831 unsigned int max_bs)
1833 if (td->o.buffer_pattern_bytes)
1834 fill_buffer_pattern(td, buf, max_bs);
1835 else if (!td->o.zero_buffers) {
1836 unsigned int perc = td->o.compress_percentage;
1839 unsigned int seg = min_write;
1841 seg = min(min_write, td->o.compress_chunk);
1845 fill_random_buf_percentage(&td->buf_state, buf,
1848 fill_random_buf(&td->buf_state, buf, max_bs);
1850 memset(buf, 0, max_bs);
1854 * "randomly" fill the buffer contents
1856 void io_u_fill_buffer(struct thread_data *td, struct io_u *io_u,
1857 unsigned int min_write, unsigned int max_bs)
1859 io_u->buf_filled_len = 0;
1860 fill_io_buffer(td, io_u->buf, min_write, max_bs);