15 struct io_completion_data {
18 int error; /* output */
19 uint64_t bytes_done[DDIR_RWDIR_CNT]; /* output */
20 struct timespec time; /* output */
24 * The ->io_axmap contains a map of blocks we have or have not done io
25 * to yet. Used to make sure we cover the entire range in a fair fashion.
27 static bool random_map_free(struct fio_file *f, const uint64_t block)
29 return !axmap_isset(f->io_axmap, block);
33 * Mark a given offset as used in the map.
35 static uint64_t mark_random_map(struct thread_data *td, struct io_u *io_u,
36 uint64_t offset, uint64_t buflen)
38 unsigned long long min_bs = td->o.min_bs[io_u->ddir];
39 struct fio_file *f = io_u->file;
40 unsigned long long nr_blocks;
43 block = (offset - f->file_offset) / (uint64_t) min_bs;
44 nr_blocks = (buflen + min_bs - 1) / min_bs;
45 assert(nr_blocks > 0);
47 if (!(io_u->flags & IO_U_F_BUSY_OK)) {
48 nr_blocks = axmap_set_nr(f->io_axmap, block, nr_blocks);
49 assert(nr_blocks > 0);
52 if ((nr_blocks * min_bs) < buflen)
53 buflen = nr_blocks * min_bs;
58 static uint64_t last_block(struct thread_data *td, struct fio_file *f,
64 assert(ddir_rw(ddir));
67 * Hmm, should we make sure that ->io_size <= ->real_file_size?
68 * -> not for now since there is code assuming it could go either.
70 max_size = f->io_size;
71 if (max_size > f->real_file_size)
72 max_size = f->real_file_size;
74 if (td->o.zone_mode == ZONE_MODE_STRIDED && td->o.zone_range)
75 max_size = td->o.zone_range;
77 if (td->o.min_bs[ddir] > td->o.ba[ddir])
78 max_size -= td->o.min_bs[ddir] - td->o.ba[ddir];
80 max_blocks = max_size / (uint64_t) td->o.ba[ddir];
87 static int __get_next_rand_offset(struct thread_data *td, struct fio_file *f,
88 enum fio_ddir ddir, uint64_t *b,
93 if (td->o.random_generator == FIO_RAND_GEN_TAUSWORTHE ||
94 td->o.random_generator == FIO_RAND_GEN_TAUSWORTHE64) {
96 r = __rand(&td->random_state);
98 dprint(FD_RANDOM, "off rand %llu\n", (unsigned long long) r);
100 *b = lastb * (r / (rand_max(&td->random_state) + 1.0));
104 assert(fio_file_lfsr(f));
106 if (lfsr_next(&f->lfsr, &off))
113 * if we are not maintaining a random map, we are done.
115 if (!file_randommap(td, f))
119 * calculate map offset and check if it's free
121 if (random_map_free(f, *b))
124 dprint(FD_RANDOM, "get_next_rand_offset: offset %llu busy\n",
125 (unsigned long long) *b);
127 *b = axmap_next_free(f->io_axmap, *b);
128 if (*b == (uint64_t) -1ULL)
134 static int __get_next_rand_offset_zipf(struct thread_data *td,
135 struct fio_file *f, enum fio_ddir ddir,
138 *b = zipf_next(&f->zipf);
142 static int __get_next_rand_offset_pareto(struct thread_data *td,
143 struct fio_file *f, enum fio_ddir ddir,
146 *b = pareto_next(&f->zipf);
150 static int __get_next_rand_offset_gauss(struct thread_data *td,
151 struct fio_file *f, enum fio_ddir ddir,
154 *b = gauss_next(&f->gauss);
158 static int __get_next_rand_offset_zoned_abs(struct thread_data *td,
160 enum fio_ddir ddir, uint64_t *b)
162 struct zone_split_index *zsi;
163 uint64_t lastb, send, stotal;
166 lastb = last_block(td, f, ddir);
170 if (!td->o.zone_split_nr[ddir]) {
172 return __get_next_rand_offset(td, f, ddir, b, lastb);
176 * Generate a value, v, between 1 and 100, both inclusive
178 v = rand_between(&td->zone_state, 1, 100);
181 * Find our generated table. 'send' is the end block of this zone,
182 * 'stotal' is our start offset.
184 zsi = &td->zone_state_index[ddir][v - 1];
185 stotal = zsi->size_prev / td->o.ba[ddir];
186 send = zsi->size / td->o.ba[ddir];
189 * Should never happen
192 if (!fio_did_warn(FIO_WARN_ZONED_BUG))
193 log_err("fio: bug in zoned generation\n");
195 } else if (send > lastb) {
197 * This happens if the user specifies ranges that exceed
198 * the file/device size. We can't handle that gracefully,
201 log_err("fio: zoned_abs sizes exceed file size\n");
206 * Generate index from 0..send-stotal
208 if (__get_next_rand_offset(td, f, ddir, b, send - stotal) == 1)
215 static int __get_next_rand_offset_zoned(struct thread_data *td,
216 struct fio_file *f, enum fio_ddir ddir,
219 unsigned int v, send, stotal;
220 uint64_t offset, lastb;
221 struct zone_split_index *zsi;
223 lastb = last_block(td, f, ddir);
227 if (!td->o.zone_split_nr[ddir]) {
229 return __get_next_rand_offset(td, f, ddir, b, lastb);
233 * Generate a value, v, between 1 and 100, both inclusive
235 v = rand_between(&td->zone_state, 1, 100);
237 zsi = &td->zone_state_index[ddir][v - 1];
238 stotal = zsi->size_perc_prev;
239 send = zsi->size_perc;
242 * Should never happen
245 if (!fio_did_warn(FIO_WARN_ZONED_BUG))
246 log_err("fio: bug in zoned generation\n");
251 * 'send' is some percentage below or equal to 100 that
252 * marks the end of the current IO range. 'stotal' marks
253 * the start, in percent.
256 offset = stotal * lastb / 100ULL;
260 lastb = lastb * (send - stotal) / 100ULL;
263 * Generate index from 0..send-of-lastb
265 if (__get_next_rand_offset(td, f, ddir, b, lastb) == 1)
269 * Add our start offset, if any
277 static int get_next_rand_offset(struct thread_data *td, struct fio_file *f,
278 enum fio_ddir ddir, uint64_t *b)
280 if (td->o.random_distribution == FIO_RAND_DIST_RANDOM) {
283 lastb = last_block(td, f, ddir);
287 return __get_next_rand_offset(td, f, ddir, b, lastb);
288 } else if (td->o.random_distribution == FIO_RAND_DIST_ZIPF)
289 return __get_next_rand_offset_zipf(td, f, ddir, b);
290 else if (td->o.random_distribution == FIO_RAND_DIST_PARETO)
291 return __get_next_rand_offset_pareto(td, f, ddir, b);
292 else if (td->o.random_distribution == FIO_RAND_DIST_GAUSS)
293 return __get_next_rand_offset_gauss(td, f, ddir, b);
294 else if (td->o.random_distribution == FIO_RAND_DIST_ZONED)
295 return __get_next_rand_offset_zoned(td, f, ddir, b);
296 else if (td->o.random_distribution == FIO_RAND_DIST_ZONED_ABS)
297 return __get_next_rand_offset_zoned_abs(td, f, ddir, b);
299 log_err("fio: unknown random distribution: %d\n", td->o.random_distribution);
303 static bool should_do_random(struct thread_data *td, enum fio_ddir ddir)
307 if (td->o.perc_rand[ddir] == 100)
310 v = rand_between(&td->seq_rand_state[ddir], 1, 100);
312 return v <= td->o.perc_rand[ddir];
315 static void loop_cache_invalidate(struct thread_data *td, struct fio_file *f)
317 struct thread_options *o = &td->o;
319 if (o->invalidate_cache && !o->odirect) {
322 ret = file_invalidate_cache(td, f);
326 static int get_next_rand_block(struct thread_data *td, struct fio_file *f,
327 enum fio_ddir ddir, uint64_t *b)
329 if (!get_next_rand_offset(td, f, ddir, b))
332 if (td->o.time_based ||
333 (td->o.file_service_type & __FIO_FSERVICE_NONUNIFORM)) {
334 fio_file_reset(td, f);
335 loop_cache_invalidate(td, f);
336 if (!get_next_rand_offset(td, f, ddir, b))
340 dprint(FD_IO, "%s: rand offset failed, last=%llu, size=%llu\n",
341 f->file_name, (unsigned long long) f->last_pos[ddir],
342 (unsigned long long) f->real_file_size);
346 static int get_next_seq_offset(struct thread_data *td, struct fio_file *f,
347 enum fio_ddir ddir, uint64_t *offset)
349 struct thread_options *o = &td->o;
351 assert(ddir_rw(ddir));
354 * If we reach the end for a time based run, reset us back to 0
355 * and invalidate the cache, if we need to.
357 if (f->last_pos[ddir] >= f->io_size + get_start_offset(td, f) &&
359 f->last_pos[ddir] = f->file_offset;
360 loop_cache_invalidate(td, f);
363 if (f->last_pos[ddir] < f->real_file_size) {
367 * Only rewind if we already hit the end
369 if (f->last_pos[ddir] == f->file_offset &&
370 f->file_offset && o->ddir_seq_add < 0) {
371 if (f->real_file_size > f->io_size)
372 f->last_pos[ddir] = f->io_size;
374 f->last_pos[ddir] = f->real_file_size;
377 pos = f->last_pos[ddir] - f->file_offset;
378 if (pos && o->ddir_seq_add) {
379 pos += o->ddir_seq_add;
382 * If we reach beyond the end of the file
383 * with holed IO, wrap around to the
384 * beginning again. If we're doing backwards IO,
387 if (pos >= f->real_file_size) {
388 if (o->ddir_seq_add > 0)
389 pos = f->file_offset;
391 if (f->real_file_size > f->io_size)
394 pos = f->real_file_size;
396 pos += o->ddir_seq_add;
408 static int get_next_block(struct thread_data *td, struct io_u *io_u,
409 enum fio_ddir ddir, int rw_seq,
412 struct fio_file *f = io_u->file;
416 assert(ddir_rw(ddir));
422 if (should_do_random(td, ddir)) {
423 ret = get_next_rand_block(td, f, ddir, &b);
427 io_u_set(td, io_u, IO_U_F_BUSY_OK);
428 ret = get_next_seq_offset(td, f, ddir, &offset);
430 ret = get_next_rand_block(td, f, ddir, &b);
434 ret = get_next_seq_offset(td, f, ddir, &offset);
437 io_u_set(td, io_u, IO_U_F_BUSY_OK);
440 if (td->o.rw_seq == RW_SEQ_SEQ) {
441 ret = get_next_seq_offset(td, f, ddir, &offset);
443 ret = get_next_rand_block(td, f, ddir, &b);
446 } else if (td->o.rw_seq == RW_SEQ_IDENT) {
447 if (f->last_start[ddir] != -1ULL)
448 offset = f->last_start[ddir] - f->file_offset;
453 log_err("fio: unknown rw_seq=%d\n", td->o.rw_seq);
460 io_u->offset = offset;
462 io_u->offset = b * td->o.ba[ddir];
464 log_err("fio: bug in offset generation: offset=%llu, b=%llu\n", (unsigned long long) offset, (unsigned long long) b);
467 io_u->verify_offset = io_u->offset;
474 * For random io, generate a random new block and see if it's used. Repeat
475 * until we find a free one. For sequential io, just return the end of
476 * the last io issued.
478 static int get_next_offset(struct thread_data *td, struct io_u *io_u,
481 struct fio_file *f = io_u->file;
482 enum fio_ddir ddir = io_u->ddir;
485 assert(ddir_rw(ddir));
487 if (td->o.ddir_seq_nr && !--td->ddir_seq_nr) {
489 td->ddir_seq_nr = td->o.ddir_seq_nr;
492 if (get_next_block(td, io_u, ddir, rw_seq_hit, is_random))
495 if (io_u->offset >= f->io_size) {
496 dprint(FD_IO, "get_next_offset: offset %llu >= io_size %llu\n",
497 (unsigned long long) io_u->offset,
498 (unsigned long long) f->io_size);
502 io_u->offset += f->file_offset;
503 if (io_u->offset >= f->real_file_size) {
504 dprint(FD_IO, "get_next_offset: offset %llu >= size %llu\n",
505 (unsigned long long) io_u->offset,
506 (unsigned long long) f->real_file_size);
510 io_u->verify_offset = io_u->offset;
514 static inline bool io_u_fits(struct thread_data *td, struct io_u *io_u,
515 unsigned long long buflen)
517 struct fio_file *f = io_u->file;
519 return io_u->offset + buflen <= f->io_size + get_start_offset(td, f);
522 static unsigned long long get_next_buflen(struct thread_data *td, struct io_u *io_u,
525 int ddir = io_u->ddir;
526 unsigned long long buflen = 0;
527 unsigned long long minbs, maxbs;
528 uint64_t frand_max, r;
531 assert(ddir_rw(ddir));
533 if (td->o.bs_is_seq_rand)
534 ddir = is_random ? DDIR_WRITE : DDIR_READ;
536 minbs = td->o.min_bs[ddir];
537 maxbs = td->o.max_bs[ddir];
543 * If we can't satisfy the min block size from here, then fail
545 if (!io_u_fits(td, io_u, minbs))
548 frand_max = rand_max(&td->bsrange_state[ddir]);
550 r = __rand(&td->bsrange_state[ddir]);
552 if (!td->o.bssplit_nr[ddir]) {
553 buflen = minbs + (unsigned long long) ((double) maxbs *
554 (r / (frand_max + 1.0)));
559 for (i = 0; i < td->o.bssplit_nr[ddir]; i++) {
560 struct bssplit *bsp = &td->o.bssplit[ddir][i];
566 if ((r / perc <= frand_max / 100ULL) &&
567 io_u_fits(td, io_u, buflen))
572 power_2 = is_power_of_2(minbs);
573 if (!td->o.bs_unaligned && power_2)
574 buflen &= ~(minbs - 1);
575 else if (!td->o.bs_unaligned && !power_2)
576 buflen -= buflen % minbs;
579 } while (!io_u_fits(td, io_u, buflen));
584 static void set_rwmix_bytes(struct thread_data *td)
589 * we do time or byte based switch. this is needed because
590 * buffered writes may issue a lot quicker than they complete,
591 * whereas reads do not.
593 diff = td->o.rwmix[td->rwmix_ddir ^ 1];
594 td->rwmix_issues = (td->io_issues[td->rwmix_ddir] * diff) / 100;
597 static inline enum fio_ddir get_rand_ddir(struct thread_data *td)
601 v = rand_between(&td->rwmix_state, 1, 100);
603 if (v <= td->o.rwmix[DDIR_READ])
609 int io_u_quiesce(struct thread_data *td)
611 int ret = 0, completed = 0, err = 0;
614 * We are going to sleep, ensure that we flush anything pending as
615 * not to skew our latency numbers.
617 * Changed to only monitor 'in flight' requests here instead of the
618 * td->cur_depth, b/c td->cur_depth does not accurately represent
619 * io's that have been actually submitted to an async engine,
620 * and cur_depth is meaningless for sync engines.
622 if (td->io_u_queued || td->cur_depth)
625 while (td->io_u_in_flight) {
626 ret = io_u_queued_complete(td, 1);
633 if (td->flags & TD_F_REGROW_LOGS)
642 static enum fio_ddir rate_ddir(struct thread_data *td, enum fio_ddir ddir)
644 enum fio_ddir odir = ddir ^ 1;
648 assert(ddir_rw(ddir));
649 now = utime_since_now(&td->epoch);
652 * if rate_next_io_time is in the past, need to catch up to rate
654 if (td->rate_next_io_time[ddir] <= now)
658 * We are ahead of rate in this direction. See if we
661 if (td_rw(td) && td->o.rwmix[odir]) {
663 * Other direction is behind rate, switch
665 if (td->rate_next_io_time[odir] <= now)
669 * Both directions are ahead of rate. sleep the min,
670 * switch if necessary
672 if (td->rate_next_io_time[ddir] <=
673 td->rate_next_io_time[odir]) {
674 usec = td->rate_next_io_time[ddir] - now;
676 usec = td->rate_next_io_time[odir] - now;
680 usec = td->rate_next_io_time[ddir] - now;
682 if (td->o.io_submit_mode == IO_MODE_INLINE)
685 if (td->o.timeout && ((usec + now) > td->o.timeout)) {
687 * check if the usec is capable of taking negative values
689 if (now > td->o.timeout) {
693 usec = td->o.timeout - now;
695 usec_sleep(td, usec);
697 now = utime_since_now(&td->epoch);
698 if ((td->o.timeout && (now > td->o.timeout)) || td->terminate)
705 * Return the data direction for the next io_u. If the job is a
706 * mixed read/write workload, check the rwmix cycle and switch if
709 static enum fio_ddir get_rw_ddir(struct thread_data *td)
714 * See if it's time to fsync/fdatasync/sync_file_range first,
715 * and if not then move on to check regular I/Os.
717 if (should_fsync(td)) {
718 if (td->o.fsync_blocks && td->io_issues[DDIR_WRITE] &&
719 !(td->io_issues[DDIR_WRITE] % td->o.fsync_blocks))
722 if (td->o.fdatasync_blocks && td->io_issues[DDIR_WRITE] &&
723 !(td->io_issues[DDIR_WRITE] % td->o.fdatasync_blocks))
724 return DDIR_DATASYNC;
726 if (td->sync_file_range_nr && td->io_issues[DDIR_WRITE] &&
727 !(td->io_issues[DDIR_WRITE] % td->sync_file_range_nr))
728 return DDIR_SYNC_FILE_RANGE;
733 * Check if it's time to seed a new data direction.
735 if (td->io_issues[td->rwmix_ddir] >= td->rwmix_issues) {
737 * Put a top limit on how many bytes we do for
738 * one data direction, to avoid overflowing the
741 ddir = get_rand_ddir(td);
743 if (ddir != td->rwmix_ddir)
746 td->rwmix_ddir = ddir;
748 ddir = td->rwmix_ddir;
749 } else if (td_read(td))
751 else if (td_write(td))
753 else if (td_trim(td))
758 td->rwmix_ddir = rate_ddir(td, ddir);
759 return td->rwmix_ddir;
762 static void set_rw_ddir(struct thread_data *td, struct io_u *io_u)
764 enum fio_ddir ddir = get_rw_ddir(td);
766 if (td->o.zone_mode == ZONE_MODE_ZBD)
767 ddir = zbd_adjust_ddir(td, io_u, ddir);
769 if (td_trimwrite(td)) {
770 struct fio_file *f = io_u->file;
771 if (f->last_pos[DDIR_WRITE] == f->last_pos[DDIR_TRIM])
777 io_u->ddir = io_u->acct_ddir = ddir;
779 if (io_u->ddir == DDIR_WRITE && td_ioengine_flagged(td, FIO_BARRIER) &&
780 td->o.barrier_blocks &&
781 !(td->io_issues[DDIR_WRITE] % td->o.barrier_blocks) &&
782 td->io_issues[DDIR_WRITE])
783 io_u_set(td, io_u, IO_U_F_BARRIER);
786 void put_file_log(struct thread_data *td, struct fio_file *f)
788 unsigned int ret = put_file(td, f);
791 td_verror(td, ret, "file close");
794 void put_io_u(struct thread_data *td, struct io_u *io_u)
796 const bool needs_lock = td_async_processing(td);
798 zbd_put_io_u(td, io_u);
806 if (io_u->file && !(io_u->flags & IO_U_F_NO_FILE_PUT))
807 put_file_log(td, io_u->file);
810 io_u_set(td, io_u, IO_U_F_FREE);
812 if (io_u->flags & IO_U_F_IN_CUR_DEPTH) {
814 assert(!(td->flags & TD_F_CHILD));
816 io_u_qpush(&td->io_u_freelist, io_u);
817 td_io_u_free_notify(td);
820 __td_io_u_unlock(td);
823 void clear_io_u(struct thread_data *td, struct io_u *io_u)
825 io_u_clear(td, io_u, IO_U_F_FLIGHT);
829 void requeue_io_u(struct thread_data *td, struct io_u **io_u)
831 const bool needs_lock = td_async_processing(td);
832 struct io_u *__io_u = *io_u;
833 enum fio_ddir ddir = acct_ddir(__io_u);
835 dprint(FD_IO, "requeue %p\n", __io_u);
843 io_u_set(td, __io_u, IO_U_F_FREE);
844 if ((__io_u->flags & IO_U_F_FLIGHT) && ddir_rw(ddir))
845 td->io_issues[ddir]--;
847 io_u_clear(td, __io_u, IO_U_F_FLIGHT);
848 if (__io_u->flags & IO_U_F_IN_CUR_DEPTH) {
850 assert(!(td->flags & TD_F_CHILD));
853 io_u_rpush(&td->io_u_requeues, __io_u);
854 td_io_u_free_notify(td);
857 __td_io_u_unlock(td);
862 static void setup_strided_zone_mode(struct thread_data *td, struct io_u *io_u)
864 struct fio_file *f = io_u->file;
866 assert(td->o.zone_mode == ZONE_MODE_STRIDED);
867 assert(td->o.zone_size);
868 assert(td->o.zone_range);
871 * See if it's time to switch to a new zone
873 if (td->zone_bytes >= td->o.zone_size) {
875 f->file_offset += td->o.zone_range + td->o.zone_skip;
878 * Wrap from the beginning, if we exceed the file size
880 if (f->file_offset >= f->real_file_size)
881 f->file_offset = get_start_offset(td, f);
883 f->last_pos[io_u->ddir] = f->file_offset;
884 td->io_skip_bytes += td->o.zone_skip;
888 * If zone_size > zone_range, then maintain the same zone until
889 * zone_bytes >= zone_size.
891 if (f->last_pos[io_u->ddir] >= (f->file_offset + td->o.zone_range)) {
892 dprint(FD_IO, "io_u maintain zone offset=%" PRIu64 "/last_pos=%" PRIu64 "\n",
893 f->file_offset, f->last_pos[io_u->ddir]);
894 f->last_pos[io_u->ddir] = f->file_offset;
898 * For random: if 'norandommap' is not set and zone_size > zone_range,
899 * map needs to be reset as it's done with zone_range everytime.
901 if ((td->zone_bytes % td->o.zone_range) == 0)
902 fio_file_reset(td, f);
905 static int fill_io_u(struct thread_data *td, struct io_u *io_u)
909 enum io_u_action ret;
911 if (td_ioengine_flagged(td, FIO_NOIO))
914 set_rw_ddir(td, io_u);
916 if (io_u->ddir == DDIR_INVAL) {
917 dprint(FD_IO, "invalid direction received ddir = %d", io_u->ddir);
921 * fsync() or fdatasync() or trim etc, we are done
923 if (!ddir_rw(io_u->ddir))
926 if (td->o.zone_mode == ZONE_MODE_STRIDED)
927 setup_strided_zone_mode(td, io_u);
928 else if (td->o.zone_mode == ZONE_MODE_ZBD)
929 setup_zbd_zone_mode(td, io_u);
932 * No log, let the seq/rand engine retrieve the next buflen and
935 if (get_next_offset(td, io_u, &is_random)) {
936 dprint(FD_IO, "io_u %p, failed getting offset\n", io_u);
940 io_u->buflen = get_next_buflen(td, io_u, is_random);
942 dprint(FD_IO, "io_u %p, failed getting buflen\n", io_u);
946 offset = io_u->offset;
947 if (td->o.zone_mode == ZONE_MODE_ZBD) {
948 ret = zbd_adjust_block(td, io_u);
953 if (io_u->offset + io_u->buflen > io_u->file->real_file_size) {
954 dprint(FD_IO, "io_u %p, off=0x%llx + len=0x%llx exceeds file size=0x%llx\n",
956 (unsigned long long) io_u->offset, io_u->buflen,
957 (unsigned long long) io_u->file->real_file_size);
962 * mark entry before potentially trimming io_u
964 if (td_random(td) && file_randommap(td, io_u->file))
965 io_u->buflen = mark_random_map(td, io_u, offset, io_u->buflen);
968 dprint_io_u(io_u, "fill");
969 io_u->verify_offset = io_u->offset;
970 td->zone_bytes += io_u->buflen;
974 static void __io_u_mark_map(uint64_t *map, unsigned int nr)
1004 void io_u_mark_submit(struct thread_data *td, unsigned int nr)
1006 __io_u_mark_map(td->ts.io_u_submit, nr);
1007 td->ts.total_submit++;
1010 void io_u_mark_complete(struct thread_data *td, unsigned int nr)
1012 __io_u_mark_map(td->ts.io_u_complete, nr);
1013 td->ts.total_complete++;
1016 void io_u_mark_depth(struct thread_data *td, unsigned int nr)
1020 switch (td->cur_depth) {
1043 td->ts.io_u_map[idx] += nr;
1046 static void io_u_mark_lat_nsec(struct thread_data *td, unsigned long long nsec)
1050 assert(nsec < 1000);
1084 assert(idx < FIO_IO_U_LAT_N_NR);
1085 td->ts.io_u_lat_n[idx]++;
1088 static void io_u_mark_lat_usec(struct thread_data *td, unsigned long long usec)
1092 assert(usec < 1000 && usec >= 1);
1126 assert(idx < FIO_IO_U_LAT_U_NR);
1127 td->ts.io_u_lat_u[idx]++;
1130 static void io_u_mark_lat_msec(struct thread_data *td, unsigned long long msec)
1174 assert(idx < FIO_IO_U_LAT_M_NR);
1175 td->ts.io_u_lat_m[idx]++;
1178 static void io_u_mark_latency(struct thread_data *td, unsigned long long nsec)
1181 io_u_mark_lat_nsec(td, nsec);
1182 else if (nsec < 1000000)
1183 io_u_mark_lat_usec(td, nsec / 1000);
1185 io_u_mark_lat_msec(td, nsec / 1000000);
1188 static unsigned int __get_next_fileno_rand(struct thread_data *td)
1190 unsigned long fileno;
1192 if (td->o.file_service_type == FIO_FSERVICE_RANDOM) {
1193 uint64_t frand_max = rand_max(&td->next_file_state);
1196 r = __rand(&td->next_file_state);
1197 return (unsigned int) ((double) td->o.nr_files
1198 * (r / (frand_max + 1.0)));
1201 if (td->o.file_service_type == FIO_FSERVICE_ZIPF)
1202 fileno = zipf_next(&td->next_file_zipf);
1203 else if (td->o.file_service_type == FIO_FSERVICE_PARETO)
1204 fileno = pareto_next(&td->next_file_zipf);
1205 else if (td->o.file_service_type == FIO_FSERVICE_GAUSS)
1206 fileno = gauss_next(&td->next_file_gauss);
1208 log_err("fio: bad file service type: %d\n", td->o.file_service_type);
1213 return fileno >> FIO_FSERVICE_SHIFT;
1217 * Get next file to service by choosing one at random
1219 static struct fio_file *get_next_file_rand(struct thread_data *td,
1220 enum fio_file_flags goodf,
1221 enum fio_file_flags badf)
1229 fno = __get_next_fileno_rand(td);
1232 if (fio_file_done(f))
1235 if (!fio_file_open(f)) {
1238 if (td->nr_open_files >= td->o.open_files)
1239 return ERR_PTR(-EBUSY);
1241 err = td_io_open_file(td, f);
1247 if ((!goodf || (f->flags & goodf)) && !(f->flags & badf)) {
1248 dprint(FD_FILE, "get_next_file_rand: %p\n", f);
1252 td_io_close_file(td, f);
1257 * Get next file to service by doing round robin between all available ones
1259 static struct fio_file *get_next_file_rr(struct thread_data *td, int goodf,
1262 unsigned int old_next_file = td->next_file;
1268 f = td->files[td->next_file];
1271 if (td->next_file >= td->o.nr_files)
1274 dprint(FD_FILE, "trying file %s %x\n", f->file_name, f->flags);
1275 if (fio_file_done(f)) {
1280 if (!fio_file_open(f)) {
1283 if (td->nr_open_files >= td->o.open_files)
1284 return ERR_PTR(-EBUSY);
1286 err = td_io_open_file(td, f);
1288 dprint(FD_FILE, "error %d on open of %s\n",
1296 dprint(FD_FILE, "goodf=%x, badf=%x, ff=%x\n", goodf, badf,
1298 if ((!goodf || (f->flags & goodf)) && !(f->flags & badf))
1302 td_io_close_file(td, f);
1305 } while (td->next_file != old_next_file);
1307 dprint(FD_FILE, "get_next_file_rr: %p\n", f);
1311 static struct fio_file *__get_next_file(struct thread_data *td)
1315 assert(td->o.nr_files <= td->files_index);
1317 if (td->nr_done_files >= td->o.nr_files) {
1318 dprint(FD_FILE, "get_next_file: nr_open=%d, nr_done=%d,"
1319 " nr_files=%d\n", td->nr_open_files,
1325 f = td->file_service_file;
1326 if (f && fio_file_open(f) && !fio_file_closing(f)) {
1327 if (td->o.file_service_type == FIO_FSERVICE_SEQ)
1329 if (td->file_service_left) {
1330 td->file_service_left--;
1335 if (td->o.file_service_type == FIO_FSERVICE_RR ||
1336 td->o.file_service_type == FIO_FSERVICE_SEQ)
1337 f = get_next_file_rr(td, FIO_FILE_open, FIO_FILE_closing);
1339 f = get_next_file_rand(td, FIO_FILE_open, FIO_FILE_closing);
1344 td->file_service_file = f;
1345 td->file_service_left = td->file_service_nr - 1;
1348 dprint(FD_FILE, "get_next_file: %p [%s]\n", f, f->file_name);
1350 dprint(FD_FILE, "get_next_file: NULL\n");
1354 static struct fio_file *get_next_file(struct thread_data *td)
1356 return __get_next_file(td);
1359 static long set_io_u_file(struct thread_data *td, struct io_u *io_u)
1364 f = get_next_file(td);
1365 if (IS_ERR_OR_NULL(f))
1371 if (!fill_io_u(td, io_u))
1374 zbd_put_io_u(td, io_u);
1376 put_file_log(td, f);
1377 td_io_close_file(td, f);
1379 if (td->o.file_service_type & __FIO_FSERVICE_NONUNIFORM)
1380 fio_file_reset(td, f);
1382 fio_file_set_done(f);
1383 td->nr_done_files++;
1384 dprint(FD_FILE, "%s: is done (%d of %d)\n", f->file_name,
1385 td->nr_done_files, td->o.nr_files);
1392 static void lat_fatal(struct thread_data *td, struct io_u *io_u, struct io_completion_data *icd,
1393 unsigned long long tnsec, unsigned long long max_nsec)
1396 log_err("fio: latency of %llu nsec exceeds specified max (%llu nsec): %s %s %llu %llu\n",
1398 io_u->file->file_name,
1399 io_ddir_name(io_u->ddir),
1400 io_u->offset, io_u->buflen);
1402 td_verror(td, ETIMEDOUT, "max latency exceeded");
1403 icd->error = ETIMEDOUT;
1406 static void lat_new_cycle(struct thread_data *td)
1408 fio_gettime(&td->latency_ts, NULL);
1409 td->latency_ios = ddir_rw_sum(td->io_blocks);
1410 td->latency_failed = 0;
1414 * We had an IO outside the latency target. Reduce the queue depth. If we
1415 * are at QD=1, then it's time to give up.
1417 static bool __lat_target_failed(struct thread_data *td)
1419 if (td->latency_qd == 1)
1422 td->latency_qd_high = td->latency_qd;
1424 if (td->latency_qd == td->latency_qd_low)
1425 td->latency_qd_low--;
1427 td->latency_qd = (td->latency_qd + td->latency_qd_low) / 2;
1428 td->latency_stable_count = 0;
1430 dprint(FD_RATE, "Ramped down: %d %d %d\n", td->latency_qd_low, td->latency_qd, td->latency_qd_high);
1433 * When we ramp QD down, quiesce existing IO to prevent
1434 * a storm of ramp downs due to pending higher depth.
1441 static bool lat_target_failed(struct thread_data *td)
1443 if (td->o.latency_percentile.u.f == 100.0)
1444 return __lat_target_failed(td);
1446 td->latency_failed++;
1450 void lat_target_init(struct thread_data *td)
1452 td->latency_end_run = 0;
1454 if (td->o.latency_target) {
1455 dprint(FD_RATE, "Latency target=%llu\n", td->o.latency_target);
1456 fio_gettime(&td->latency_ts, NULL);
1458 td->latency_qd_high = td->o.iodepth;
1459 td->latency_qd_low = 1;
1460 td->latency_ios = ddir_rw_sum(td->io_blocks);
1462 td->latency_qd = td->o.iodepth;
1465 void lat_target_reset(struct thread_data *td)
1467 if (!td->latency_end_run)
1468 lat_target_init(td);
1471 static void lat_target_success(struct thread_data *td)
1473 const unsigned int qd = td->latency_qd;
1474 struct thread_options *o = &td->o;
1476 td->latency_qd_low = td->latency_qd;
1478 if (td->latency_qd + 1 == td->latency_qd_high) {
1480 * latency_qd will not incease on lat_target_success(), so
1481 * called stable. If we stick with this queue depth, the
1482 * final latency is likely lower than latency_target. Fix
1483 * this by increasing latency_qd_high slowly. Use a naive
1484 * heuristic here. If we get lat_target_success() 3 times
1485 * in a row, increase latency_qd_high by 1.
1487 if (++td->latency_stable_count >= 3) {
1488 td->latency_qd_high++;
1489 td->latency_stable_count = 0;
1494 * If we haven't failed yet, we double up to a failing value instead
1495 * of bisecting from highest possible queue depth. If we have set
1496 * a limit other than td->o.iodepth, bisect between that.
1498 if (td->latency_qd_high != o->iodepth)
1499 td->latency_qd = (td->latency_qd + td->latency_qd_high) / 2;
1501 td->latency_qd *= 2;
1503 if (td->latency_qd > o->iodepth)
1504 td->latency_qd = o->iodepth;
1506 dprint(FD_RATE, "Ramped up: %d %d %d\n", td->latency_qd_low, td->latency_qd, td->latency_qd_high);
1509 * Same as last one, we are done. Let it run a latency cycle, so
1510 * we get only the results from the targeted depth.
1512 if (!o->latency_run && td->latency_qd == qd) {
1513 if (td->latency_end_run) {
1514 dprint(FD_RATE, "We are done\n");
1517 dprint(FD_RATE, "Quiesce and final run\n");
1519 td->latency_end_run = 1;
1520 reset_all_stats(td);
1529 * Check if we can bump the queue depth
1531 void lat_target_check(struct thread_data *td)
1533 uint64_t usec_window;
1537 usec_window = utime_since_now(&td->latency_ts);
1538 if (usec_window < td->o.latency_window)
1541 ios = ddir_rw_sum(td->io_blocks) - td->latency_ios;
1542 success_ios = (double) (ios - td->latency_failed) / (double) ios;
1543 success_ios *= 100.0;
1545 dprint(FD_RATE, "Success rate: %.2f%% (target %.2f%%)\n", success_ios, td->o.latency_percentile.u.f);
1547 if (success_ios >= td->o.latency_percentile.u.f)
1548 lat_target_success(td);
1550 __lat_target_failed(td);
1554 * If latency target is enabled, we might be ramping up or down and not
1555 * using the full queue depth available.
1557 bool queue_full(const struct thread_data *td)
1559 const int qempty = io_u_qempty(&td->io_u_freelist);
1563 if (!td->o.latency_target)
1566 return td->cur_depth >= td->latency_qd;
1569 struct io_u *__get_io_u(struct thread_data *td)
1571 const bool needs_lock = td_async_processing(td);
1572 struct io_u *io_u = NULL;
1582 if (!io_u_rempty(&td->io_u_requeues)) {
1583 io_u = io_u_rpop(&td->io_u_requeues);
1585 } else if (!queue_full(td)) {
1586 io_u = io_u_qpop(&td->io_u_freelist);
1591 io_u->end_io = NULL;
1595 assert(io_u->flags & IO_U_F_FREE);
1596 io_u_clear(td, io_u, IO_U_F_FREE | IO_U_F_NO_FILE_PUT |
1597 IO_U_F_TRIMMED | IO_U_F_BARRIER |
1601 io_u->acct_ddir = -1;
1603 assert(!(td->flags & TD_F_CHILD));
1604 io_u_set(td, io_u, IO_U_F_IN_CUR_DEPTH);
1606 } else if (td_async_processing(td)) {
1608 * We ran out, wait for async verify threads to finish and
1611 assert(!(td->flags & TD_F_CHILD));
1612 ret = pthread_cond_wait(&td->free_cond, &td->io_u_lock);
1619 __td_io_u_unlock(td);
1624 static bool check_get_trim(struct thread_data *td, struct io_u *io_u)
1626 if (!(td->flags & TD_F_TRIM_BACKLOG))
1628 if (!td->trim_entries)
1631 if (td->trim_batch) {
1633 if (get_next_trim(td, io_u))
1635 } else if (!(td->io_hist_len % td->o.trim_backlog) &&
1636 td->last_ddir != DDIR_READ) {
1637 td->trim_batch = td->o.trim_batch;
1638 if (!td->trim_batch)
1639 td->trim_batch = td->o.trim_backlog;
1640 if (get_next_trim(td, io_u))
1647 static bool check_get_verify(struct thread_data *td, struct io_u *io_u)
1649 if (!(td->flags & TD_F_VER_BACKLOG))
1652 if (td->io_hist_len) {
1655 if (td->verify_batch)
1657 else if (!(td->io_hist_len % td->o.verify_backlog) &&
1658 td->last_ddir != DDIR_READ) {
1659 td->verify_batch = td->o.verify_batch;
1660 if (!td->verify_batch)
1661 td->verify_batch = td->o.verify_backlog;
1665 if (get_verify && !get_next_verify(td, io_u)) {
1675 * Fill offset and start time into the buffer content, to prevent too
1676 * easy compressible data for simple de-dupe attempts. Do this for every
1677 * 512b block in the range, since that should be the smallest block size
1678 * we can expect from a device.
1680 static void small_content_scramble(struct io_u *io_u)
1682 unsigned long long i, nr_blocks = io_u->buflen >> 9;
1683 unsigned int offset;
1684 uint64_t boffset, *iptr;
1691 boffset = io_u->offset;
1693 if (io_u->buf_filled_len)
1694 io_u->buf_filled_len = 0;
1697 * Generate random index between 0..7. We do chunks of 512b, if
1698 * we assume a cacheline is 64 bytes, then we have 8 of those.
1699 * Scramble content within the blocks in the same cacheline to
1702 offset = (io_u->start_time.tv_nsec ^ boffset) & 7;
1704 for (i = 0; i < nr_blocks; i++) {
1706 * Fill offset into start of cacheline, time into end
1709 iptr = (void *) p + (offset << 6);
1712 iptr = (void *) p + 64 - 2 * sizeof(uint64_t);
1713 iptr[0] = io_u->start_time.tv_sec;
1714 iptr[1] = io_u->start_time.tv_nsec;
1722 * Return an io_u to be processed. Gets a buflen and offset, sets direction,
1723 * etc. The returned io_u is fully ready to be prepped, populated and submitted.
1725 struct io_u *get_io_u(struct thread_data *td)
1729 int do_scramble = 0;
1732 io_u = __get_io_u(td);
1734 dprint(FD_IO, "__get_io_u failed\n");
1738 if (check_get_verify(td, io_u))
1740 if (check_get_trim(td, io_u))
1744 * from a requeue, io_u already setup
1750 * If using an iolog, grab next piece if any available.
1752 if (td->flags & TD_F_READ_IOLOG) {
1753 if (read_iolog_get(td, io_u))
1755 } else if (set_io_u_file(td, io_u)) {
1757 dprint(FD_IO, "io_u %p, setting file failed\n", io_u);
1763 dprint(FD_IO, "io_u %p, setting file failed\n", io_u);
1767 assert(fio_file_open(f));
1769 if (ddir_rw(io_u->ddir)) {
1770 if (!io_u->buflen && !td_ioengine_flagged(td, FIO_NOIO)) {
1771 dprint(FD_IO, "get_io_u: zero buflen on %p\n", io_u);
1775 f->last_start[io_u->ddir] = io_u->offset;
1776 f->last_pos[io_u->ddir] = io_u->offset + io_u->buflen;
1778 if (io_u->ddir == DDIR_WRITE) {
1779 if (td->flags & TD_F_REFILL_BUFFERS) {
1780 io_u_fill_buffer(td, io_u,
1781 td->o.min_bs[DDIR_WRITE],
1783 } else if ((td->flags & TD_F_SCRAMBLE_BUFFERS) &&
1784 !(td->flags & TD_F_COMPRESS) &&
1785 !(td->flags & TD_F_DO_VERIFY))
1787 } else if (io_u->ddir == DDIR_READ) {
1789 * Reset the buf_filled parameters so next time if the
1790 * buffer is used for writes it is refilled.
1792 io_u->buf_filled_len = 0;
1797 * Set io data pointers.
1799 io_u->xfer_buf = io_u->buf;
1800 io_u->xfer_buflen = io_u->buflen;
1803 * Remember the issuing context priority. The IO engine may change this.
1805 io_u->ioprio = td->ioprio;
1806 io_u->clat_prio_index = 0;
1809 if (!td_io_prep(td, io_u)) {
1810 if (!td->o.disable_lat)
1811 fio_gettime(&io_u->start_time, NULL);
1814 small_content_scramble(io_u);
1819 dprint(FD_IO, "get_io_u failed\n");
1821 return ERR_PTR(ret);
1824 static void __io_u_log_error(struct thread_data *td, struct io_u *io_u)
1826 enum error_type_bit eb = td_error_type(io_u->ddir, io_u->error);
1828 if (td_non_fatal_error(td, eb, io_u->error) && !td->o.error_dump)
1831 log_err("fio: io_u error%s%s: %s: %s offset=%llu, buflen=%llu\n",
1832 io_u->file ? " on file " : "",
1833 io_u->file ? io_u->file->file_name : "",
1834 strerror(io_u->error),
1835 io_ddir_name(io_u->ddir),
1836 io_u->offset, io_u->xfer_buflen);
1838 if (td->io_ops->errdetails) {
1839 char *err = td->io_ops->errdetails(io_u);
1841 log_err("fio: %s\n", err);
1846 td_verror(td, io_u->error, "io_u error");
1849 void io_u_log_error(struct thread_data *td, struct io_u *io_u)
1851 __io_u_log_error(td, io_u);
1853 __io_u_log_error(td->parent, io_u);
1856 static inline bool gtod_reduce(struct thread_data *td)
1858 return (td->o.disable_clat && td->o.disable_slat && td->o.disable_bw)
1859 || td->o.gtod_reduce;
1862 static void trim_block_info(struct thread_data *td, struct io_u *io_u)
1864 uint32_t *info = io_u_block_info(td, io_u);
1866 if (BLOCK_INFO_STATE(*info) >= BLOCK_STATE_TRIM_FAILURE)
1869 *info = BLOCK_INFO(BLOCK_STATE_TRIMMED, BLOCK_INFO_TRIMS(*info) + 1);
1872 static void account_io_completion(struct thread_data *td, struct io_u *io_u,
1873 struct io_completion_data *icd,
1874 const enum fio_ddir idx, unsigned int bytes)
1876 const int no_reduce = !gtod_reduce(td);
1877 unsigned long long llnsec = 0;
1882 if (!td->o.stats || td_ioengine_flagged(td, FIO_NOSTATS))
1886 llnsec = ntime_since(&io_u->issue_time, &icd->time);
1888 if (!td->o.disable_lat) {
1889 unsigned long long tnsec;
1891 tnsec = ntime_since(&io_u->start_time, &icd->time);
1892 add_lat_sample(td, idx, tnsec, bytes, io_u->offset,
1893 io_u->ioprio, io_u->clat_prio_index);
1895 if (td->flags & TD_F_PROFILE_OPS) {
1896 struct prof_io_ops *ops = &td->prof_io_ops;
1899 icd->error = ops->io_u_lat(td, tnsec);
1903 if (td->o.max_latency[idx] && tnsec > td->o.max_latency[idx])
1904 lat_fatal(td, io_u, icd, tnsec, td->o.max_latency[idx]);
1905 if (td->o.latency_target && tnsec > td->o.latency_target) {
1906 if (lat_target_failed(td))
1907 lat_fatal(td, io_u, icd, tnsec, td->o.latency_target);
1913 if (!td->o.disable_clat) {
1914 add_clat_sample(td, idx, llnsec, bytes, io_u->offset,
1915 io_u->ioprio, io_u->clat_prio_index);
1916 io_u_mark_latency(td, llnsec);
1919 if (!td->o.disable_bw && per_unit_log(td->bw_log))
1920 add_bw_sample(td, io_u, bytes, llnsec);
1922 if (no_reduce && per_unit_log(td->iops_log))
1923 add_iops_sample(td, io_u, bytes);
1924 } else if (ddir_sync(idx) && !td->o.disable_clat)
1925 add_sync_clat_sample(&td->ts, llnsec);
1927 if (td->ts.nr_block_infos && io_u->ddir == DDIR_TRIM)
1928 trim_block_info(td, io_u);
1931 static void file_log_write_comp(const struct thread_data *td, struct fio_file *f,
1932 uint64_t offset, unsigned int bytes)
1939 if (f->first_write == -1ULL || offset < f->first_write)
1940 f->first_write = offset;
1941 if (f->last_write == -1ULL || ((offset + bytes) > f->last_write))
1942 f->last_write = offset + bytes;
1944 if (!f->last_write_comp)
1947 idx = f->last_write_idx++;
1948 f->last_write_comp[idx] = offset;
1949 if (f->last_write_idx == td->o.iodepth)
1950 f->last_write_idx = 0;
1953 static bool should_account(struct thread_data *td)
1955 return ramp_time_over(td) && (td->runstate == TD_RUNNING ||
1956 td->runstate == TD_VERIFYING);
1959 static void io_completed(struct thread_data *td, struct io_u **io_u_ptr,
1960 struct io_completion_data *icd)
1962 struct io_u *io_u = *io_u_ptr;
1963 enum fio_ddir ddir = io_u->ddir;
1964 struct fio_file *f = io_u->file;
1966 dprint_io_u(io_u, "complete");
1968 assert(io_u->flags & IO_U_F_FLIGHT);
1969 io_u_clear(td, io_u, IO_U_F_FLIGHT | IO_U_F_BUSY_OK);
1972 * Mark IO ok to verify
1976 * Remove errored entry from the verification list
1979 unlog_io_piece(td, io_u);
1981 atomic_store_release(&io_u->ipo->flags,
1982 io_u->ipo->flags & ~IP_F_IN_FLIGHT);
1986 if (ddir_sync(ddir)) {
1987 td->last_was_sync = true;
1989 f->first_write = -1ULL;
1990 f->last_write = -1ULL;
1992 if (should_account(td))
1993 account_io_completion(td, io_u, icd, ddir, io_u->buflen);
1997 td->last_was_sync = false;
1998 td->last_ddir = ddir;
2000 if (!io_u->error && ddir_rw(ddir)) {
2001 unsigned long long bytes = io_u->xfer_buflen - io_u->resid;
2005 * Make sure we notice short IO from here, and requeue them
2008 if (bytes && io_u->resid) {
2009 io_u->xfer_buflen = io_u->resid;
2010 io_u->xfer_buf += bytes;
2011 io_u->offset += bytes;
2012 td->ts.short_io_u[io_u->ddir]++;
2013 if (io_u->offset < io_u->file->real_file_size) {
2014 requeue_io_u(td, io_u_ptr);
2019 td->io_blocks[ddir]++;
2020 td->io_bytes[ddir] += bytes;
2022 if (!(io_u->flags & IO_U_F_VER_LIST)) {
2023 td->this_io_blocks[ddir]++;
2024 td->this_io_bytes[ddir] += bytes;
2027 if (ddir == DDIR_WRITE)
2028 file_log_write_comp(td, f, io_u->offset, bytes);
2030 if (should_account(td))
2031 account_io_completion(td, io_u, icd, ddir, bytes);
2033 icd->bytes_done[ddir] += bytes;
2036 ret = io_u->end_io(td, io_u_ptr);
2038 if (ret && !icd->error)
2041 } else if (io_u->error) {
2042 icd->error = io_u->error;
2043 io_u_log_error(td, io_u);
2046 enum error_type_bit eb = td_error_type(ddir, icd->error);
2048 if (!td_non_fatal_error(td, eb, icd->error))
2052 * If there is a non_fatal error, then add to the error count
2053 * and clear all the errors.
2055 update_error_count(td, icd->error);
2063 static void init_icd(struct thread_data *td, struct io_completion_data *icd,
2068 if (!gtod_reduce(td))
2069 fio_gettime(&icd->time, NULL);
2074 for (ddir = 0; ddir < DDIR_RWDIR_CNT; ddir++)
2075 icd->bytes_done[ddir] = 0;
2078 static void ios_completed(struct thread_data *td,
2079 struct io_completion_data *icd)
2084 for (i = 0; i < icd->nr; i++) {
2085 io_u = td->io_ops->event(td, i);
2087 io_completed(td, &io_u, icd);
2095 * Complete a single io_u for the sync engines.
2097 int io_u_sync_complete(struct thread_data *td, struct io_u *io_u)
2099 struct io_completion_data icd;
2102 init_icd(td, &icd, 1);
2103 io_completed(td, &io_u, &icd);
2109 td_verror(td, icd.error, "io_u_sync_complete");
2113 for (ddir = 0; ddir < DDIR_RWDIR_CNT; ddir++)
2114 td->bytes_done[ddir] += icd.bytes_done[ddir];
2120 * Called to complete min_events number of io for the async engines.
2122 int io_u_queued_complete(struct thread_data *td, int min_evts)
2124 struct io_completion_data icd;
2125 struct timespec *tvp = NULL;
2127 struct timespec ts = { .tv_sec = 0, .tv_nsec = 0, };
2129 dprint(FD_IO, "io_u_queued_complete: min=%d\n", min_evts);
2133 else if (min_evts > td->cur_depth)
2134 min_evts = td->cur_depth;
2136 /* No worries, td_io_getevents fixes min and max if they are
2137 * set incorrectly */
2138 ret = td_io_getevents(td, min_evts, td->o.iodepth_batch_complete_max, tvp);
2140 td_verror(td, -ret, "td_io_getevents");
2145 init_icd(td, &icd, ret);
2146 ios_completed(td, &icd);
2148 td_verror(td, icd.error, "io_u_queued_complete");
2152 for (ddir = 0; ddir < DDIR_RWDIR_CNT; ddir++)
2153 td->bytes_done[ddir] += icd.bytes_done[ddir];
2159 * Call when io_u is really queued, to update the submission latency.
2161 void io_u_queued(struct thread_data *td, struct io_u *io_u)
2163 if (!td->o.disable_slat && ramp_time_over(td) && td->o.stats) {
2164 unsigned long slat_time;
2166 slat_time = ntime_since(&io_u->start_time, &io_u->issue_time);
2171 add_slat_sample(td, io_u->ddir, slat_time, io_u->xfer_buflen,
2172 io_u->offset, io_u->ioprio);
2177 * See if we should reuse the last seed, if dedupe is enabled
2179 static struct frand_state *get_buf_state(struct thread_data *td)
2182 unsigned long long i;
2184 if (!td->o.dedupe_percentage)
2185 return &td->buf_state;
2186 else if (td->o.dedupe_percentage == 100) {
2187 frand_copy(&td->buf_state_prev, &td->buf_state);
2188 return &td->buf_state;
2191 v = rand_between(&td->dedupe_state, 1, 100);
2193 if (v <= td->o.dedupe_percentage)
2194 switch (td->o.dedupe_mode) {
2195 case DEDUPE_MODE_REPEAT:
2197 * The caller advances the returned frand_state.
2198 * A copy of prev should be returned instead since
2199 * a subsequent intention to generate a deduped buffer
2200 * might result in generating a unique one
2202 frand_copy(&td->buf_state_ret, &td->buf_state_prev);
2203 return &td->buf_state_ret;
2204 case DEDUPE_MODE_WORKING_SET:
2205 i = rand_between(&td->dedupe_working_set_index_state, 0, td->num_unique_pages - 1);
2206 frand_copy(&td->buf_state_ret, &td->dedupe_working_set_states[i]);
2207 return &td->buf_state_ret;
2209 log_err("unexpected dedupe mode %u\n", td->o.dedupe_mode);
2213 return &td->buf_state;
2216 static void save_buf_state(struct thread_data *td, struct frand_state *rs)
2218 if (td->o.dedupe_percentage == 100)
2219 frand_copy(rs, &td->buf_state_prev);
2220 else if (rs == &td->buf_state)
2221 frand_copy(&td->buf_state_prev, rs);
2224 void fill_io_buffer(struct thread_data *td, void *buf, unsigned long long min_write,
2225 unsigned long long max_bs)
2227 struct thread_options *o = &td->o;
2229 if (o->mem_type == MEM_CUDA_MALLOC)
2232 if (o->compress_percentage || o->dedupe_percentage) {
2233 unsigned int perc = td->o.compress_percentage;
2234 struct frand_state *rs = NULL;
2235 unsigned long long left = max_bs;
2236 unsigned long long this_write;
2240 * Buffers are either entirely dedupe-able or not.
2241 * If we choose to dedup, the buffer should undergo
2242 * the same manipulation as the original write. Which
2243 * means we should retrack the steps we took for compression
2247 rs = get_buf_state(td);
2249 min_write = min(min_write, left);
2251 this_write = min_not_zero(min_write,
2252 (unsigned long long) td->o.compress_chunk);
2254 fill_random_buf_percentage(rs, buf, perc,
2255 this_write, this_write,
2257 o->buffer_pattern_bytes);
2261 save_buf_state(td, rs);
2263 } else if (o->buffer_pattern_bytes)
2264 fill_buffer_pattern(td, buf, max_bs);
2265 else if (o->zero_buffers)
2266 memset(buf, 0, max_bs);
2268 fill_random_buf(get_buf_state(td), buf, max_bs);
2272 * "randomly" fill the buffer contents
2274 void io_u_fill_buffer(struct thread_data *td, struct io_u *io_u,
2275 unsigned long long min_write, unsigned long long max_bs)
2277 io_u->buf_filled_len = 0;
2278 fill_io_buffer(td, io_u->buf, min_write, max_bs);
2281 static int do_sync_file_range(const struct thread_data *td,
2284 uint64_t offset, nbytes;
2286 offset = f->first_write;
2287 nbytes = f->last_write - f->first_write;
2292 return sync_file_range(f->fd, offset, nbytes, td->o.sync_file_range);
2295 int do_io_u_sync(const struct thread_data *td, struct io_u *io_u)
2299 if (io_u->ddir == DDIR_SYNC) {
2300 #ifdef CONFIG_FCNTL_SYNC
2301 ret = fcntl(io_u->file->fd, F_FULLFSYNC);
2303 ret = fsync(io_u->file->fd);
2305 } else if (io_u->ddir == DDIR_DATASYNC) {
2306 #ifdef CONFIG_FDATASYNC
2307 ret = fdatasync(io_u->file->fd);
2309 ret = io_u->xfer_buflen;
2310 io_u->error = EINVAL;
2312 } else if (io_u->ddir == DDIR_SYNC_FILE_RANGE)
2313 ret = do_sync_file_range(td, io_u->file);
2315 ret = io_u->xfer_buflen;
2316 io_u->error = EINVAL;
2320 io_u->error = errno;
2325 int do_io_u_trim(const struct thread_data *td, struct io_u *io_u)
2327 #ifndef FIO_HAVE_TRIM
2328 io_u->error = EINVAL;
2331 struct fio_file *f = io_u->file;
2334 if (td->o.zone_mode == ZONE_MODE_ZBD) {
2335 ret = zbd_do_io_u_trim(td, io_u);
2336 if (ret == io_u_completed)
2337 return io_u->xfer_buflen;
2342 ret = os_trim(f, io_u->offset, io_u->xfer_buflen);
2344 return io_u->xfer_buflen;