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) &&
358 o->time_based && o->nr_files == 1) {
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));
420 if (td_randtrimwrite(td) && ddir == DDIR_WRITE) {
421 /* don't mark randommap for these writes */
422 io_u_set(td, io_u, IO_U_F_BUSY_OK);
423 offset = f->last_start[DDIR_TRIM];
428 if (should_do_random(td, ddir)) {
429 ret = get_next_rand_block(td, f, ddir, &b);
433 io_u_set(td, io_u, IO_U_F_BUSY_OK);
434 ret = get_next_seq_offset(td, f, ddir, &offset);
436 ret = get_next_rand_block(td, f, ddir, &b);
440 ret = get_next_seq_offset(td, f, ddir, &offset);
443 io_u_set(td, io_u, IO_U_F_BUSY_OK);
446 if (td->o.rw_seq == RW_SEQ_SEQ) {
447 ret = get_next_seq_offset(td, f, ddir, &offset);
449 ret = get_next_rand_block(td, f, ddir, &b);
452 } else if (td->o.rw_seq == RW_SEQ_IDENT) {
453 if (f->last_start[ddir] != -1ULL)
454 offset = f->last_start[ddir] - f->file_offset;
459 log_err("fio: unknown rw_seq=%d\n", td->o.rw_seq);
466 io_u->offset = offset;
468 io_u->offset = b * td->o.ba[ddir];
470 log_err("fio: bug in offset generation: offset=%llu, b=%llu\n", (unsigned long long) offset, (unsigned long long) b);
473 io_u->verify_offset = io_u->offset;
480 * For random io, generate a random new block and see if it's used. Repeat
481 * until we find a free one. For sequential io, just return the end of
482 * the last io issued.
484 static int get_next_offset(struct thread_data *td, struct io_u *io_u,
487 struct fio_file *f = io_u->file;
488 enum fio_ddir ddir = io_u->ddir;
491 assert(ddir_rw(ddir));
493 if (td->o.ddir_seq_nr && !--td->ddir_seq_nr) {
495 td->ddir_seq_nr = td->o.ddir_seq_nr;
498 if (get_next_block(td, io_u, ddir, rw_seq_hit, is_random))
501 if (io_u->offset >= f->io_size) {
502 dprint(FD_IO, "get_next_offset: offset %llu >= io_size %llu\n",
503 (unsigned long long) io_u->offset,
504 (unsigned long long) f->io_size);
508 io_u->offset += f->file_offset;
509 if (io_u->offset >= f->real_file_size) {
510 dprint(FD_IO, "get_next_offset: offset %llu >= size %llu\n",
511 (unsigned long long) io_u->offset,
512 (unsigned long long) f->real_file_size);
516 io_u->verify_offset = io_u->offset;
520 static inline bool io_u_fits(struct thread_data *td, struct io_u *io_u,
521 unsigned long long buflen)
523 struct fio_file *f = io_u->file;
525 return io_u->offset + buflen <= f->io_size + get_start_offset(td, f);
528 static unsigned long long get_next_buflen(struct thread_data *td, struct io_u *io_u,
531 int ddir = io_u->ddir;
532 unsigned long long buflen = 0;
533 unsigned long long minbs, maxbs;
534 uint64_t frand_max, r;
537 assert(ddir_rw(ddir));
539 if (td_randtrimwrite(td) && ddir == DDIR_WRITE) {
540 struct fio_file *f = io_u->file;
542 return f->last_pos[DDIR_TRIM] - f->last_start[DDIR_TRIM];
545 if (td->o.bs_is_seq_rand)
546 ddir = is_random ? DDIR_WRITE : DDIR_READ;
548 minbs = td->o.min_bs[ddir];
549 maxbs = td->o.max_bs[ddir];
555 * If we can't satisfy the min block size from here, then fail
557 if (!io_u_fits(td, io_u, minbs))
560 frand_max = rand_max(&td->bsrange_state[ddir]);
562 r = __rand(&td->bsrange_state[ddir]);
564 if (!td->o.bssplit_nr[ddir]) {
565 buflen = minbs + (unsigned long long) ((double) maxbs *
566 (r / (frand_max + 1.0)));
571 for (i = 0; i < td->o.bssplit_nr[ddir]; i++) {
572 struct bssplit *bsp = &td->o.bssplit[ddir][i];
578 if ((r / perc <= frand_max / 100ULL) &&
579 io_u_fits(td, io_u, buflen))
584 power_2 = is_power_of_2(minbs);
585 if (!td->o.bs_unaligned && power_2)
586 buflen &= ~(minbs - 1);
587 else if (!td->o.bs_unaligned && !power_2)
588 buflen -= buflen % minbs;
591 } while (!io_u_fits(td, io_u, buflen));
596 static void set_rwmix_bytes(struct thread_data *td)
601 * we do time or byte based switch. this is needed because
602 * buffered writes may issue a lot quicker than they complete,
603 * whereas reads do not.
605 diff = td->o.rwmix[td->rwmix_ddir ^ 1];
606 td->rwmix_issues = (td->io_issues[td->rwmix_ddir] * diff) / 100;
609 static inline enum fio_ddir get_rand_ddir(struct thread_data *td)
613 v = rand_between(&td->rwmix_state, 1, 100);
615 if (v <= td->o.rwmix[DDIR_READ])
621 int io_u_quiesce(struct thread_data *td)
623 int ret = 0, completed = 0, err = 0;
626 * We are going to sleep, ensure that we flush anything pending as
627 * not to skew our latency numbers.
629 * Changed to only monitor 'in flight' requests here instead of the
630 * td->cur_depth, b/c td->cur_depth does not accurately represent
631 * io's that have been actually submitted to an async engine,
632 * and cur_depth is meaningless for sync engines.
634 if (td->io_u_queued || td->cur_depth)
637 while (td->io_u_in_flight) {
638 ret = io_u_queued_complete(td, 1);
645 if (td->flags & TD_F_REGROW_LOGS)
654 static enum fio_ddir rate_ddir(struct thread_data *td, enum fio_ddir ddir)
656 enum fio_ddir odir = ddir ^ 1;
660 assert(ddir_rw(ddir));
661 now = utime_since_now(&td->epoch);
664 * if rate_next_io_time is in the past, need to catch up to rate
666 if (td->rate_next_io_time[ddir] <= now)
670 * We are ahead of rate in this direction. See if we
673 if (td_rw(td) && td->o.rwmix[odir]) {
675 * Other direction is behind rate, switch
677 if (td->rate_next_io_time[odir] <= now)
681 * Both directions are ahead of rate. sleep the min,
682 * switch if necessary
684 if (td->rate_next_io_time[ddir] <=
685 td->rate_next_io_time[odir]) {
686 usec = td->rate_next_io_time[ddir] - now;
688 usec = td->rate_next_io_time[odir] - now;
692 usec = td->rate_next_io_time[ddir] - now;
694 if (td->o.io_submit_mode == IO_MODE_INLINE)
697 if (td->o.timeout && ((usec + now) > td->o.timeout)) {
699 * check if the usec is capable of taking negative values
701 if (now > td->o.timeout) {
705 usec = td->o.timeout - now;
707 usec_sleep(td, usec);
709 now = utime_since_now(&td->epoch);
710 if ((td->o.timeout && (now > td->o.timeout)) || td->terminate)
717 * Return the data direction for the next io_u. If the job is a
718 * mixed read/write workload, check the rwmix cycle and switch if
721 static enum fio_ddir get_rw_ddir(struct thread_data *td)
726 * See if it's time to fsync/fdatasync/sync_file_range first,
727 * and if not then move on to check regular I/Os.
729 if (should_fsync(td)) {
730 if (td->o.fsync_blocks && td->io_issues[DDIR_WRITE] &&
731 !(td->io_issues[DDIR_WRITE] % td->o.fsync_blocks))
734 if (td->o.fdatasync_blocks && td->io_issues[DDIR_WRITE] &&
735 !(td->io_issues[DDIR_WRITE] % td->o.fdatasync_blocks))
736 return DDIR_DATASYNC;
738 if (td->sync_file_range_nr && td->io_issues[DDIR_WRITE] &&
739 !(td->io_issues[DDIR_WRITE] % td->sync_file_range_nr))
740 return DDIR_SYNC_FILE_RANGE;
745 * Check if it's time to seed a new data direction.
747 if (td->io_issues[td->rwmix_ddir] >= td->rwmix_issues) {
749 * Put a top limit on how many bytes we do for
750 * one data direction, to avoid overflowing the
753 ddir = get_rand_ddir(td);
755 if (ddir != td->rwmix_ddir)
758 td->rwmix_ddir = ddir;
760 ddir = td->rwmix_ddir;
761 } else if (td_read(td))
763 else if (td_write(td))
765 else if (td_trim(td))
770 td->rwmix_ddir = rate_ddir(td, ddir);
771 return td->rwmix_ddir;
774 static void set_rw_ddir(struct thread_data *td, struct io_u *io_u)
776 enum fio_ddir ddir = get_rw_ddir(td);
778 if (td->o.zone_mode == ZONE_MODE_ZBD)
779 ddir = zbd_adjust_ddir(td, io_u, ddir);
781 if (td_trimwrite(td)) {
782 struct fio_file *f = io_u->file;
783 if (f->last_pos[DDIR_WRITE] == f->last_pos[DDIR_TRIM])
789 io_u->ddir = io_u->acct_ddir = ddir;
791 if (io_u->ddir == DDIR_WRITE && td_ioengine_flagged(td, FIO_BARRIER) &&
792 td->o.barrier_blocks &&
793 !(td->io_issues[DDIR_WRITE] % td->o.barrier_blocks) &&
794 td->io_issues[DDIR_WRITE])
795 io_u_set(td, io_u, IO_U_F_BARRIER);
798 void put_file_log(struct thread_data *td, struct fio_file *f)
800 unsigned int ret = put_file(td, f);
803 td_verror(td, ret, "file close");
806 void put_io_u(struct thread_data *td, struct io_u *io_u)
808 const bool needs_lock = td_async_processing(td);
810 zbd_put_io_u(td, io_u);
818 if (io_u->file && !(io_u->flags & IO_U_F_NO_FILE_PUT))
819 put_file_log(td, io_u->file);
822 io_u_set(td, io_u, IO_U_F_FREE);
824 if (io_u->flags & IO_U_F_IN_CUR_DEPTH) {
826 assert(!(td->flags & TD_F_CHILD));
828 io_u_qpush(&td->io_u_freelist, io_u);
829 td_io_u_free_notify(td);
832 __td_io_u_unlock(td);
835 void clear_io_u(struct thread_data *td, struct io_u *io_u)
837 io_u_clear(td, io_u, IO_U_F_FLIGHT);
841 void requeue_io_u(struct thread_data *td, struct io_u **io_u)
843 const bool needs_lock = td_async_processing(td);
844 struct io_u *__io_u = *io_u;
845 enum fio_ddir ddir = acct_ddir(__io_u);
847 dprint(FD_IO, "requeue %p\n", __io_u);
855 io_u_set(td, __io_u, IO_U_F_FREE);
856 if ((__io_u->flags & IO_U_F_FLIGHT) && ddir_rw(ddir))
857 td->io_issues[ddir]--;
859 io_u_clear(td, __io_u, IO_U_F_FLIGHT);
860 if (__io_u->flags & IO_U_F_IN_CUR_DEPTH) {
862 assert(!(td->flags & TD_F_CHILD));
865 io_u_rpush(&td->io_u_requeues, __io_u);
866 td_io_u_free_notify(td);
869 __td_io_u_unlock(td);
874 static void setup_strided_zone_mode(struct thread_data *td, struct io_u *io_u)
876 struct fio_file *f = io_u->file;
878 assert(td->o.zone_mode == ZONE_MODE_STRIDED);
879 assert(td->o.zone_size);
880 assert(td->o.zone_range);
883 * See if it's time to switch to a new zone
885 if (td->zone_bytes >= td->o.zone_size) {
887 f->file_offset += td->o.zone_range + td->o.zone_skip;
890 * Wrap from the beginning, if we exceed the file size
892 if (f->file_offset >= f->real_file_size)
893 f->file_offset = get_start_offset(td, f);
895 f->last_pos[io_u->ddir] = f->file_offset;
896 td->io_skip_bytes += td->o.zone_skip;
900 * If zone_size > zone_range, then maintain the same zone until
901 * zone_bytes >= zone_size.
903 if (f->last_pos[io_u->ddir] >= (f->file_offset + td->o.zone_range)) {
904 dprint(FD_IO, "io_u maintain zone offset=%" PRIu64 "/last_pos=%" PRIu64 "\n",
905 f->file_offset, f->last_pos[io_u->ddir]);
906 f->last_pos[io_u->ddir] = f->file_offset;
910 * For random: if 'norandommap' is not set and zone_size > zone_range,
911 * map needs to be reset as it's done with zone_range everytime.
913 if ((td->zone_bytes % td->o.zone_range) == 0)
914 fio_file_reset(td, f);
917 static int fill_io_u(struct thread_data *td, struct io_u *io_u)
921 enum io_u_action ret;
923 if (td_ioengine_flagged(td, FIO_NOIO))
926 set_rw_ddir(td, io_u);
928 if (io_u->ddir == DDIR_INVAL) {
929 dprint(FD_IO, "invalid direction received ddir = %d", io_u->ddir);
933 * fsync() or fdatasync() or trim etc, we are done
935 if (!ddir_rw(io_u->ddir))
938 if (td->o.zone_mode == ZONE_MODE_STRIDED)
939 setup_strided_zone_mode(td, io_u);
940 else if (td->o.zone_mode == ZONE_MODE_ZBD)
941 setup_zbd_zone_mode(td, io_u);
944 * No log, let the seq/rand engine retrieve the next buflen and
947 if (get_next_offset(td, io_u, &is_random)) {
948 dprint(FD_IO, "io_u %p, failed getting offset\n", io_u);
952 io_u->buflen = get_next_buflen(td, io_u, is_random);
954 dprint(FD_IO, "io_u %p, failed getting buflen\n", io_u);
958 offset = io_u->offset;
959 if (td->o.zone_mode == ZONE_MODE_ZBD) {
960 ret = zbd_adjust_block(td, io_u);
965 if (io_u->offset + io_u->buflen > io_u->file->real_file_size) {
966 dprint(FD_IO, "io_u %p, off=0x%llx + len=0x%llx exceeds file size=0x%llx\n",
968 (unsigned long long) io_u->offset, io_u->buflen,
969 (unsigned long long) io_u->file->real_file_size);
974 * mark entry before potentially trimming io_u
976 if (td_random(td) && file_randommap(td, io_u->file))
977 io_u->buflen = mark_random_map(td, io_u, offset, io_u->buflen);
980 dprint_io_u(io_u, "fill");
981 io_u->verify_offset = io_u->offset;
982 td->zone_bytes += io_u->buflen;
986 static void __io_u_mark_map(uint64_t *map, unsigned int nr)
1016 void io_u_mark_submit(struct thread_data *td, unsigned int nr)
1018 __io_u_mark_map(td->ts.io_u_submit, nr);
1019 td->ts.total_submit++;
1022 void io_u_mark_complete(struct thread_data *td, unsigned int nr)
1024 __io_u_mark_map(td->ts.io_u_complete, nr);
1025 td->ts.total_complete++;
1028 void io_u_mark_depth(struct thread_data *td, unsigned int nr)
1032 switch (td->cur_depth) {
1055 td->ts.io_u_map[idx] += nr;
1058 static void io_u_mark_lat_nsec(struct thread_data *td, unsigned long long nsec)
1062 assert(nsec < 1000);
1096 assert(idx < FIO_IO_U_LAT_N_NR);
1097 td->ts.io_u_lat_n[idx]++;
1100 static void io_u_mark_lat_usec(struct thread_data *td, unsigned long long usec)
1104 assert(usec < 1000 && usec >= 1);
1138 assert(idx < FIO_IO_U_LAT_U_NR);
1139 td->ts.io_u_lat_u[idx]++;
1142 static void io_u_mark_lat_msec(struct thread_data *td, unsigned long long msec)
1186 assert(idx < FIO_IO_U_LAT_M_NR);
1187 td->ts.io_u_lat_m[idx]++;
1190 static void io_u_mark_latency(struct thread_data *td, unsigned long long nsec)
1193 io_u_mark_lat_nsec(td, nsec);
1194 else if (nsec < 1000000)
1195 io_u_mark_lat_usec(td, nsec / 1000);
1197 io_u_mark_lat_msec(td, nsec / 1000000);
1200 static unsigned int __get_next_fileno_rand(struct thread_data *td)
1202 unsigned long fileno;
1204 if (td->o.file_service_type == FIO_FSERVICE_RANDOM) {
1205 uint64_t frand_max = rand_max(&td->next_file_state);
1208 r = __rand(&td->next_file_state);
1209 return (unsigned int) ((double) td->o.nr_files
1210 * (r / (frand_max + 1.0)));
1213 if (td->o.file_service_type == FIO_FSERVICE_ZIPF)
1214 fileno = zipf_next(&td->next_file_zipf);
1215 else if (td->o.file_service_type == FIO_FSERVICE_PARETO)
1216 fileno = pareto_next(&td->next_file_zipf);
1217 else if (td->o.file_service_type == FIO_FSERVICE_GAUSS)
1218 fileno = gauss_next(&td->next_file_gauss);
1220 log_err("fio: bad file service type: %d\n", td->o.file_service_type);
1225 return fileno >> FIO_FSERVICE_SHIFT;
1229 * Get next file to service by choosing one at random
1231 static struct fio_file *get_next_file_rand(struct thread_data *td,
1232 enum fio_file_flags goodf,
1233 enum fio_file_flags badf)
1241 fno = __get_next_fileno_rand(td);
1244 if (fio_file_done(f))
1247 if (!fio_file_open(f)) {
1250 if (td->nr_open_files >= td->o.open_files)
1251 return ERR_PTR(-EBUSY);
1253 err = td_io_open_file(td, f);
1259 if ((!goodf || (f->flags & goodf)) && !(f->flags & badf)) {
1260 dprint(FD_FILE, "get_next_file_rand: %p\n", f);
1264 td_io_close_file(td, f);
1269 * Get next file to service by doing round robin between all available ones
1271 static struct fio_file *get_next_file_rr(struct thread_data *td, int goodf,
1274 unsigned int old_next_file = td->next_file;
1280 f = td->files[td->next_file];
1283 if (td->next_file >= td->o.nr_files)
1286 dprint(FD_FILE, "trying file %s %x\n", f->file_name, f->flags);
1287 if (fio_file_done(f)) {
1292 if (!fio_file_open(f)) {
1295 if (td->nr_open_files >= td->o.open_files)
1296 return ERR_PTR(-EBUSY);
1298 err = td_io_open_file(td, f);
1300 dprint(FD_FILE, "error %d on open of %s\n",
1308 dprint(FD_FILE, "goodf=%x, badf=%x, ff=%x\n", goodf, badf,
1310 if ((!goodf || (f->flags & goodf)) && !(f->flags & badf))
1314 td_io_close_file(td, f);
1317 } while (td->next_file != old_next_file);
1319 dprint(FD_FILE, "get_next_file_rr: %p\n", f);
1323 static struct fio_file *__get_next_file(struct thread_data *td)
1327 assert(td->o.nr_files <= td->files_index);
1329 if (td->nr_done_files >= td->o.nr_files) {
1330 dprint(FD_FILE, "get_next_file: nr_open=%d, nr_done=%d,"
1331 " nr_files=%d\n", td->nr_open_files,
1337 f = td->file_service_file;
1338 if (f && fio_file_open(f) && !fio_file_closing(f)) {
1339 if (td->o.file_service_type == FIO_FSERVICE_SEQ)
1341 if (td->file_service_left) {
1342 td->file_service_left--;
1347 if (td->o.file_service_type == FIO_FSERVICE_RR ||
1348 td->o.file_service_type == FIO_FSERVICE_SEQ)
1349 f = get_next_file_rr(td, FIO_FILE_open, FIO_FILE_closing);
1351 f = get_next_file_rand(td, FIO_FILE_open, FIO_FILE_closing);
1356 td->file_service_file = f;
1357 td->file_service_left = td->file_service_nr - 1;
1360 dprint(FD_FILE, "get_next_file: %p [%s]\n", f, f->file_name);
1362 dprint(FD_FILE, "get_next_file: NULL\n");
1366 static struct fio_file *get_next_file(struct thread_data *td)
1368 return __get_next_file(td);
1371 static long set_io_u_file(struct thread_data *td, struct io_u *io_u)
1376 f = get_next_file(td);
1377 if (IS_ERR_OR_NULL(f))
1383 if (!fill_io_u(td, io_u))
1386 zbd_put_io_u(td, io_u);
1388 put_file_log(td, f);
1389 td_io_close_file(td, f);
1391 if (td->o.file_service_type & __FIO_FSERVICE_NONUNIFORM)
1392 fio_file_reset(td, f);
1394 fio_file_set_done(f);
1395 td->nr_done_files++;
1396 dprint(FD_FILE, "%s: is done (%d of %d)\n", f->file_name,
1397 td->nr_done_files, td->o.nr_files);
1404 static void lat_fatal(struct thread_data *td, struct io_u *io_u, struct io_completion_data *icd,
1405 unsigned long long tnsec, unsigned long long max_nsec)
1408 log_err("fio: latency of %llu nsec exceeds specified max (%llu nsec): %s %s %llu %llu\n",
1410 io_u->file->file_name,
1411 io_ddir_name(io_u->ddir),
1412 io_u->offset, io_u->buflen);
1414 td_verror(td, ETIMEDOUT, "max latency exceeded");
1415 icd->error = ETIMEDOUT;
1418 static void lat_new_cycle(struct thread_data *td)
1420 fio_gettime(&td->latency_ts, NULL);
1421 td->latency_ios = ddir_rw_sum(td->io_blocks);
1422 td->latency_failed = 0;
1426 * We had an IO outside the latency target. Reduce the queue depth. If we
1427 * are at QD=1, then it's time to give up.
1429 static bool __lat_target_failed(struct thread_data *td)
1431 if (td->latency_qd == 1)
1434 td->latency_qd_high = td->latency_qd;
1436 if (td->latency_qd == td->latency_qd_low)
1437 td->latency_qd_low--;
1439 td->latency_qd = (td->latency_qd + td->latency_qd_low) / 2;
1440 td->latency_stable_count = 0;
1442 dprint(FD_RATE, "Ramped down: %d %d %d\n", td->latency_qd_low, td->latency_qd, td->latency_qd_high);
1445 * When we ramp QD down, quiesce existing IO to prevent
1446 * a storm of ramp downs due to pending higher depth.
1453 static bool lat_target_failed(struct thread_data *td)
1455 if (td->o.latency_percentile.u.f == 100.0)
1456 return __lat_target_failed(td);
1458 td->latency_failed++;
1462 void lat_target_init(struct thread_data *td)
1464 td->latency_end_run = 0;
1466 if (td->o.latency_target) {
1467 dprint(FD_RATE, "Latency target=%llu\n", td->o.latency_target);
1468 fio_gettime(&td->latency_ts, NULL);
1470 td->latency_qd_high = td->o.iodepth;
1471 td->latency_qd_low = 1;
1472 td->latency_ios = ddir_rw_sum(td->io_blocks);
1474 td->latency_qd = td->o.iodepth;
1477 void lat_target_reset(struct thread_data *td)
1479 if (!td->latency_end_run)
1480 lat_target_init(td);
1483 static void lat_target_success(struct thread_data *td)
1485 const unsigned int qd = td->latency_qd;
1486 struct thread_options *o = &td->o;
1488 td->latency_qd_low = td->latency_qd;
1490 if (td->latency_qd + 1 == td->latency_qd_high) {
1492 * latency_qd will not incease on lat_target_success(), so
1493 * called stable. If we stick with this queue depth, the
1494 * final latency is likely lower than latency_target. Fix
1495 * this by increasing latency_qd_high slowly. Use a naive
1496 * heuristic here. If we get lat_target_success() 3 times
1497 * in a row, increase latency_qd_high by 1.
1499 if (++td->latency_stable_count >= 3) {
1500 td->latency_qd_high++;
1501 td->latency_stable_count = 0;
1506 * If we haven't failed yet, we double up to a failing value instead
1507 * of bisecting from highest possible queue depth. If we have set
1508 * a limit other than td->o.iodepth, bisect between that.
1510 if (td->latency_qd_high != o->iodepth)
1511 td->latency_qd = (td->latency_qd + td->latency_qd_high) / 2;
1513 td->latency_qd *= 2;
1515 if (td->latency_qd > o->iodepth)
1516 td->latency_qd = o->iodepth;
1518 dprint(FD_RATE, "Ramped up: %d %d %d\n", td->latency_qd_low, td->latency_qd, td->latency_qd_high);
1521 * Same as last one, we are done. Let it run a latency cycle, so
1522 * we get only the results from the targeted depth.
1524 if (!o->latency_run && td->latency_qd == qd) {
1525 if (td->latency_end_run) {
1526 dprint(FD_RATE, "We are done\n");
1529 dprint(FD_RATE, "Quiesce and final run\n");
1531 td->latency_end_run = 1;
1532 reset_all_stats(td);
1541 * Check if we can bump the queue depth
1543 void lat_target_check(struct thread_data *td)
1545 uint64_t usec_window;
1549 usec_window = utime_since_now(&td->latency_ts);
1550 if (usec_window < td->o.latency_window)
1553 ios = ddir_rw_sum(td->io_blocks) - td->latency_ios;
1554 success_ios = (double) (ios - td->latency_failed) / (double) ios;
1555 success_ios *= 100.0;
1557 dprint(FD_RATE, "Success rate: %.2f%% (target %.2f%%)\n", success_ios, td->o.latency_percentile.u.f);
1559 if (success_ios >= td->o.latency_percentile.u.f)
1560 lat_target_success(td);
1562 __lat_target_failed(td);
1566 * If latency target is enabled, we might be ramping up or down and not
1567 * using the full queue depth available.
1569 bool queue_full(const struct thread_data *td)
1571 const int qempty = io_u_qempty(&td->io_u_freelist);
1575 if (!td->o.latency_target)
1578 return td->cur_depth >= td->latency_qd;
1581 struct io_u *__get_io_u(struct thread_data *td)
1583 const bool needs_lock = td_async_processing(td);
1584 struct io_u *io_u = NULL;
1594 if (!io_u_rempty(&td->io_u_requeues)) {
1595 io_u = io_u_rpop(&td->io_u_requeues);
1597 } else if (!queue_full(td)) {
1598 io_u = io_u_qpop(&td->io_u_freelist);
1603 io_u->end_io = NULL;
1607 assert(io_u->flags & IO_U_F_FREE);
1608 io_u_clear(td, io_u, IO_U_F_FREE | IO_U_F_NO_FILE_PUT |
1609 IO_U_F_TRIMMED | IO_U_F_BARRIER |
1613 io_u->acct_ddir = -1;
1615 assert(!(td->flags & TD_F_CHILD));
1616 io_u_set(td, io_u, IO_U_F_IN_CUR_DEPTH);
1618 } else if (td_async_processing(td)) {
1620 * We ran out, wait for async verify threads to finish and
1623 assert(!(td->flags & TD_F_CHILD));
1624 ret = pthread_cond_wait(&td->free_cond, &td->io_u_lock);
1631 __td_io_u_unlock(td);
1636 static bool check_get_trim(struct thread_data *td, struct io_u *io_u)
1638 if (!(td->flags & TD_F_TRIM_BACKLOG))
1640 if (!td->trim_entries)
1643 if (td->trim_batch) {
1645 if (get_next_trim(td, io_u))
1647 } else if (!(td->io_hist_len % td->o.trim_backlog) &&
1648 td->last_ddir != DDIR_READ) {
1649 td->trim_batch = td->o.trim_batch;
1650 if (!td->trim_batch)
1651 td->trim_batch = td->o.trim_backlog;
1652 if (get_next_trim(td, io_u))
1659 static bool check_get_verify(struct thread_data *td, struct io_u *io_u)
1661 if (!(td->flags & TD_F_VER_BACKLOG))
1664 if (td->io_hist_len) {
1667 if (td->verify_batch)
1669 else if (!(td->io_hist_len % td->o.verify_backlog) &&
1670 td->last_ddir != DDIR_READ) {
1671 td->verify_batch = td->o.verify_batch;
1672 if (!td->verify_batch)
1673 td->verify_batch = td->o.verify_backlog;
1677 if (get_verify && !get_next_verify(td, io_u)) {
1687 * Fill offset and start time into the buffer content, to prevent too
1688 * easy compressible data for simple de-dupe attempts. Do this for every
1689 * 512b block in the range, since that should be the smallest block size
1690 * we can expect from a device.
1692 static void small_content_scramble(struct io_u *io_u)
1694 unsigned long long i, nr_blocks = io_u->buflen >> 9;
1695 unsigned int offset;
1696 uint64_t boffset, *iptr;
1703 boffset = io_u->offset;
1705 if (io_u->buf_filled_len)
1706 io_u->buf_filled_len = 0;
1709 * Generate random index between 0..7. We do chunks of 512b, if
1710 * we assume a cacheline is 64 bytes, then we have 8 of those.
1711 * Scramble content within the blocks in the same cacheline to
1714 offset = (io_u->start_time.tv_nsec ^ boffset) & 7;
1716 for (i = 0; i < nr_blocks; i++) {
1718 * Fill offset into start of cacheline, time into end
1721 iptr = (void *) p + (offset << 6);
1724 iptr = (void *) p + 64 - 2 * sizeof(uint64_t);
1725 iptr[0] = io_u->start_time.tv_sec;
1726 iptr[1] = io_u->start_time.tv_nsec;
1734 * Return an io_u to be processed. Gets a buflen and offset, sets direction,
1735 * etc. The returned io_u is fully ready to be prepped, populated and submitted.
1737 struct io_u *get_io_u(struct thread_data *td)
1741 int do_scramble = 0;
1744 io_u = __get_io_u(td);
1746 dprint(FD_IO, "__get_io_u failed\n");
1750 if (check_get_verify(td, io_u))
1752 if (check_get_trim(td, io_u))
1756 * from a requeue, io_u already setup
1762 * If using an iolog, grab next piece if any available.
1764 if (td->flags & TD_F_READ_IOLOG) {
1765 if (read_iolog_get(td, io_u))
1767 } else if (set_io_u_file(td, io_u)) {
1769 dprint(FD_IO, "io_u %p, setting file failed\n", io_u);
1775 dprint(FD_IO, "io_u %p, setting file failed\n", io_u);
1779 assert(fio_file_open(f));
1781 if (ddir_rw(io_u->ddir)) {
1782 if (!io_u->buflen && !td_ioengine_flagged(td, FIO_NOIO)) {
1783 dprint(FD_IO, "get_io_u: zero buflen on %p\n", io_u);
1787 f->last_start[io_u->ddir] = io_u->offset;
1788 f->last_pos[io_u->ddir] = io_u->offset + io_u->buflen;
1790 if (io_u->ddir == DDIR_WRITE) {
1791 if (td->flags & TD_F_REFILL_BUFFERS) {
1792 io_u_fill_buffer(td, io_u,
1793 td->o.min_bs[DDIR_WRITE],
1795 } else if ((td->flags & TD_F_SCRAMBLE_BUFFERS) &&
1796 !(td->flags & TD_F_COMPRESS) &&
1797 !(td->flags & TD_F_DO_VERIFY))
1799 } else if (io_u->ddir == DDIR_READ) {
1801 * Reset the buf_filled parameters so next time if the
1802 * buffer is used for writes it is refilled.
1804 io_u->buf_filled_len = 0;
1809 * Set io data pointers.
1811 io_u->xfer_buf = io_u->buf;
1812 io_u->xfer_buflen = io_u->buflen;
1815 * Remember the issuing context priority. The IO engine may change this.
1817 io_u->ioprio = td->ioprio;
1818 io_u->clat_prio_index = 0;
1821 if (!td_io_prep(td, io_u)) {
1822 if (!td->o.disable_lat)
1823 fio_gettime(&io_u->start_time, NULL);
1826 small_content_scramble(io_u);
1831 dprint(FD_IO, "get_io_u failed\n");
1833 return ERR_PTR(ret);
1836 static void __io_u_log_error(struct thread_data *td, struct io_u *io_u)
1838 enum error_type_bit eb = td_error_type(io_u->ddir, io_u->error);
1840 if (td_non_fatal_error(td, eb, io_u->error) && !td->o.error_dump)
1843 log_err("fio: io_u error%s%s: %s: %s offset=%llu, buflen=%llu\n",
1844 io_u->file ? " on file " : "",
1845 io_u->file ? io_u->file->file_name : "",
1846 strerror(io_u->error),
1847 io_ddir_name(io_u->ddir),
1848 io_u->offset, io_u->xfer_buflen);
1850 if (td->io_ops->errdetails) {
1851 char *err = td->io_ops->errdetails(io_u);
1853 log_err("fio: %s\n", err);
1858 td_verror(td, io_u->error, "io_u error");
1861 void io_u_log_error(struct thread_data *td, struct io_u *io_u)
1863 __io_u_log_error(td, io_u);
1865 __io_u_log_error(td->parent, io_u);
1868 static inline bool gtod_reduce(struct thread_data *td)
1870 return (td->o.disable_clat && td->o.disable_slat && td->o.disable_bw)
1871 || td->o.gtod_reduce;
1874 static void trim_block_info(struct thread_data *td, struct io_u *io_u)
1876 uint32_t *info = io_u_block_info(td, io_u);
1878 if (BLOCK_INFO_STATE(*info) >= BLOCK_STATE_TRIM_FAILURE)
1881 *info = BLOCK_INFO(BLOCK_STATE_TRIMMED, BLOCK_INFO_TRIMS(*info) + 1);
1884 static void account_io_completion(struct thread_data *td, struct io_u *io_u,
1885 struct io_completion_data *icd,
1886 const enum fio_ddir idx, unsigned int bytes)
1888 const int no_reduce = !gtod_reduce(td);
1889 unsigned long long llnsec = 0;
1894 if (!td->o.stats || td_ioengine_flagged(td, FIO_NOSTATS))
1898 llnsec = ntime_since(&io_u->issue_time, &icd->time);
1900 if (!td->o.disable_lat) {
1901 unsigned long long tnsec;
1903 tnsec = ntime_since(&io_u->start_time, &icd->time);
1904 add_lat_sample(td, idx, tnsec, bytes, io_u->offset,
1905 io_u->ioprio, io_u->clat_prio_index);
1907 if (td->flags & TD_F_PROFILE_OPS) {
1908 struct prof_io_ops *ops = &td->prof_io_ops;
1911 icd->error = ops->io_u_lat(td, tnsec);
1915 if (td->o.max_latency[idx] && tnsec > td->o.max_latency[idx])
1916 lat_fatal(td, io_u, icd, tnsec, td->o.max_latency[idx]);
1917 if (td->o.latency_target && tnsec > td->o.latency_target) {
1918 if (lat_target_failed(td))
1919 lat_fatal(td, io_u, icd, tnsec, td->o.latency_target);
1925 if (!td->o.disable_clat) {
1926 add_clat_sample(td, idx, llnsec, bytes, io_u->offset,
1927 io_u->ioprio, io_u->clat_prio_index);
1928 io_u_mark_latency(td, llnsec);
1931 if (!td->o.disable_bw && per_unit_log(td->bw_log))
1932 add_bw_sample(td, io_u, bytes, llnsec);
1934 if (no_reduce && per_unit_log(td->iops_log))
1935 add_iops_sample(td, io_u, bytes);
1936 } else if (ddir_sync(idx) && !td->o.disable_clat)
1937 add_sync_clat_sample(&td->ts, llnsec);
1939 if (td->ts.nr_block_infos && io_u->ddir == DDIR_TRIM)
1940 trim_block_info(td, io_u);
1943 static void file_log_write_comp(const struct thread_data *td, struct fio_file *f,
1944 uint64_t offset, unsigned int bytes)
1951 if (f->first_write == -1ULL || offset < f->first_write)
1952 f->first_write = offset;
1953 if (f->last_write == -1ULL || ((offset + bytes) > f->last_write))
1954 f->last_write = offset + bytes;
1956 if (!f->last_write_comp)
1959 idx = f->last_write_idx++;
1960 f->last_write_comp[idx] = offset;
1961 if (f->last_write_idx == td->o.iodepth)
1962 f->last_write_idx = 0;
1965 static bool should_account(struct thread_data *td)
1967 return ramp_time_over(td) && (td->runstate == TD_RUNNING ||
1968 td->runstate == TD_VERIFYING);
1971 static void io_completed(struct thread_data *td, struct io_u **io_u_ptr,
1972 struct io_completion_data *icd)
1974 struct io_u *io_u = *io_u_ptr;
1975 enum fio_ddir ddir = io_u->ddir;
1976 struct fio_file *f = io_u->file;
1978 dprint_io_u(io_u, "complete");
1980 assert(io_u->flags & IO_U_F_FLIGHT);
1981 io_u_clear(td, io_u, IO_U_F_FLIGHT | IO_U_F_BUSY_OK);
1984 * Mark IO ok to verify
1988 * Remove errored entry from the verification list
1991 unlog_io_piece(td, io_u);
1993 atomic_store_release(&io_u->ipo->flags,
1994 io_u->ipo->flags & ~IP_F_IN_FLIGHT);
1998 if (ddir_sync(ddir)) {
1999 td->last_was_sync = true;
2001 f->first_write = -1ULL;
2002 f->last_write = -1ULL;
2004 if (should_account(td))
2005 account_io_completion(td, io_u, icd, ddir, io_u->buflen);
2009 td->last_was_sync = false;
2010 td->last_ddir = ddir;
2012 if (!io_u->error && ddir_rw(ddir)) {
2013 unsigned long long bytes = io_u->xfer_buflen - io_u->resid;
2017 * Make sure we notice short IO from here, and requeue them
2020 if (bytes && io_u->resid) {
2021 io_u->xfer_buflen = io_u->resid;
2022 io_u->xfer_buf += bytes;
2023 io_u->offset += bytes;
2024 td->ts.short_io_u[io_u->ddir]++;
2025 if (io_u->offset < io_u->file->real_file_size) {
2026 requeue_io_u(td, io_u_ptr);
2031 td->io_blocks[ddir]++;
2032 td->io_bytes[ddir] += bytes;
2034 if (!(io_u->flags & IO_U_F_VER_LIST)) {
2035 td->this_io_blocks[ddir]++;
2036 td->this_io_bytes[ddir] += bytes;
2039 if (ddir == DDIR_WRITE)
2040 file_log_write_comp(td, f, io_u->offset, bytes);
2042 if (should_account(td))
2043 account_io_completion(td, io_u, icd, ddir, bytes);
2045 icd->bytes_done[ddir] += bytes;
2048 ret = io_u->end_io(td, io_u_ptr);
2050 if (ret && !icd->error)
2053 } else if (io_u->error) {
2054 icd->error = io_u->error;
2055 io_u_log_error(td, io_u);
2058 enum error_type_bit eb = td_error_type(ddir, icd->error);
2060 if (!td_non_fatal_error(td, eb, icd->error))
2064 * If there is a non_fatal error, then add to the error count
2065 * and clear all the errors.
2067 update_error_count(td, icd->error);
2075 static void init_icd(struct thread_data *td, struct io_completion_data *icd,
2080 if (!gtod_reduce(td))
2081 fio_gettime(&icd->time, NULL);
2086 for (ddir = 0; ddir < DDIR_RWDIR_CNT; ddir++)
2087 icd->bytes_done[ddir] = 0;
2090 static void ios_completed(struct thread_data *td,
2091 struct io_completion_data *icd)
2096 for (i = 0; i < icd->nr; i++) {
2097 io_u = td->io_ops->event(td, i);
2099 io_completed(td, &io_u, icd);
2107 * Complete a single io_u for the sync engines.
2109 int io_u_sync_complete(struct thread_data *td, struct io_u *io_u)
2111 struct io_completion_data icd;
2114 init_icd(td, &icd, 1);
2115 io_completed(td, &io_u, &icd);
2121 td_verror(td, icd.error, "io_u_sync_complete");
2125 for (ddir = 0; ddir < DDIR_RWDIR_CNT; ddir++)
2126 td->bytes_done[ddir] += icd.bytes_done[ddir];
2132 * Called to complete min_events number of io for the async engines.
2134 int io_u_queued_complete(struct thread_data *td, int min_evts)
2136 struct io_completion_data icd;
2137 struct timespec *tvp = NULL;
2139 struct timespec ts = { .tv_sec = 0, .tv_nsec = 0, };
2141 dprint(FD_IO, "io_u_queued_complete: min=%d\n", min_evts);
2145 else if (min_evts > td->cur_depth)
2146 min_evts = td->cur_depth;
2148 /* No worries, td_io_getevents fixes min and max if they are
2149 * set incorrectly */
2150 ret = td_io_getevents(td, min_evts, td->o.iodepth_batch_complete_max, tvp);
2152 td_verror(td, -ret, "td_io_getevents");
2157 init_icd(td, &icd, ret);
2158 ios_completed(td, &icd);
2160 td_verror(td, icd.error, "io_u_queued_complete");
2164 for (ddir = 0; ddir < DDIR_RWDIR_CNT; ddir++)
2165 td->bytes_done[ddir] += icd.bytes_done[ddir];
2171 * Call when io_u is really queued, to update the submission latency.
2173 void io_u_queued(struct thread_data *td, struct io_u *io_u)
2175 if (!td->o.disable_slat && ramp_time_over(td) && td->o.stats) {
2176 unsigned long slat_time;
2178 slat_time = ntime_since(&io_u->start_time, &io_u->issue_time);
2183 add_slat_sample(td, io_u->ddir, slat_time, io_u->xfer_buflen,
2184 io_u->offset, io_u->ioprio);
2189 * See if we should reuse the last seed, if dedupe is enabled
2191 static struct frand_state *get_buf_state(struct thread_data *td)
2194 unsigned long long i;
2196 if (!td->o.dedupe_percentage)
2197 return &td->buf_state;
2198 else if (td->o.dedupe_percentage == 100) {
2199 frand_copy(&td->buf_state_prev, &td->buf_state);
2200 return &td->buf_state;
2203 v = rand_between(&td->dedupe_state, 1, 100);
2205 if (v <= td->o.dedupe_percentage)
2206 switch (td->o.dedupe_mode) {
2207 case DEDUPE_MODE_REPEAT:
2209 * The caller advances the returned frand_state.
2210 * A copy of prev should be returned instead since
2211 * a subsequent intention to generate a deduped buffer
2212 * might result in generating a unique one
2214 frand_copy(&td->buf_state_ret, &td->buf_state_prev);
2215 return &td->buf_state_ret;
2216 case DEDUPE_MODE_WORKING_SET:
2217 i = rand_between(&td->dedupe_working_set_index_state, 0, td->num_unique_pages - 1);
2218 frand_copy(&td->buf_state_ret, &td->dedupe_working_set_states[i]);
2219 return &td->buf_state_ret;
2221 log_err("unexpected dedupe mode %u\n", td->o.dedupe_mode);
2225 return &td->buf_state;
2228 static void save_buf_state(struct thread_data *td, struct frand_state *rs)
2230 if (td->o.dedupe_percentage == 100)
2231 frand_copy(rs, &td->buf_state_prev);
2232 else if (rs == &td->buf_state)
2233 frand_copy(&td->buf_state_prev, rs);
2236 void fill_io_buffer(struct thread_data *td, void *buf, unsigned long long min_write,
2237 unsigned long long max_bs)
2239 struct thread_options *o = &td->o;
2241 if (o->mem_type == MEM_CUDA_MALLOC)
2244 if (o->compress_percentage || o->dedupe_percentage) {
2245 unsigned int perc = td->o.compress_percentage;
2246 struct frand_state *rs = NULL;
2247 unsigned long long left = max_bs;
2248 unsigned long long this_write;
2252 * Buffers are either entirely dedupe-able or not.
2253 * If we choose to dedup, the buffer should undergo
2254 * the same manipulation as the original write. Which
2255 * means we should retrack the steps we took for compression
2259 rs = get_buf_state(td);
2261 min_write = min(min_write, left);
2263 this_write = min_not_zero(min_write,
2264 (unsigned long long) td->o.compress_chunk);
2266 fill_random_buf_percentage(rs, buf, perc,
2267 this_write, this_write,
2269 o->buffer_pattern_bytes);
2273 save_buf_state(td, rs);
2275 } else if (o->buffer_pattern_bytes)
2276 fill_buffer_pattern(td, buf, max_bs);
2277 else if (o->zero_buffers)
2278 memset(buf, 0, max_bs);
2280 fill_random_buf(get_buf_state(td), buf, max_bs);
2284 * "randomly" fill the buffer contents
2286 void io_u_fill_buffer(struct thread_data *td, struct io_u *io_u,
2287 unsigned long long min_write, unsigned long long max_bs)
2289 io_u->buf_filled_len = 0;
2290 fill_io_buffer(td, io_u->buf, min_write, max_bs);
2293 static int do_sync_file_range(const struct thread_data *td,
2296 uint64_t offset, nbytes;
2298 offset = f->first_write;
2299 nbytes = f->last_write - f->first_write;
2304 return sync_file_range(f->fd, offset, nbytes, td->o.sync_file_range);
2307 int do_io_u_sync(const struct thread_data *td, struct io_u *io_u)
2311 if (io_u->ddir == DDIR_SYNC) {
2312 #ifdef CONFIG_FCNTL_SYNC
2313 ret = fcntl(io_u->file->fd, F_FULLFSYNC);
2315 ret = fsync(io_u->file->fd);
2317 } else if (io_u->ddir == DDIR_DATASYNC) {
2318 #ifdef CONFIG_FDATASYNC
2319 ret = fdatasync(io_u->file->fd);
2321 ret = io_u->xfer_buflen;
2322 io_u->error = EINVAL;
2324 } else if (io_u->ddir == DDIR_SYNC_FILE_RANGE)
2325 ret = do_sync_file_range(td, io_u->file);
2327 ret = io_u->xfer_buflen;
2328 io_u->error = EINVAL;
2332 io_u->error = errno;
2337 int do_io_u_trim(const struct thread_data *td, struct io_u *io_u)
2339 #ifndef FIO_HAVE_TRIM
2340 io_u->error = EINVAL;
2343 struct fio_file *f = io_u->file;
2346 if (td->o.zone_mode == ZONE_MODE_ZBD) {
2347 ret = zbd_do_io_u_trim(td, io_u);
2348 if (ret == io_u_completed)
2349 return io_u->xfer_buflen;
2354 ret = os_trim(f, io_u->offset, io_u->xfer_buflen);
2356 return io_u->xfer_buflen;