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);
517 * For randtrimwrite, we decide whether to issue a trim or a write
518 * based on whether the offsets for the most recent trim and write
519 * operations match. If they don't match that means we just issued a
520 * new trim and the next operation should be a write. If they *do*
521 * match that means we just completed a trim+write pair and the next
522 * command should be a trim.
524 * This works fine for sequential workloads but for random workloads
525 * it's possible to complete a trim+write pair and then have the next
526 * randomly generated offset match the previous offset. If that happens
527 * we need to alter the offset for the last write operation in order
528 * to ensure that we issue a write operation the next time through.
530 if (td_randtrimwrite(td) && ddir == DDIR_TRIM &&
531 f->last_start[DDIR_TRIM] == io_u->offset)
532 f->last_start[DDIR_WRITE]--;
534 io_u->verify_offset = io_u->offset;
538 static inline bool io_u_fits(struct thread_data *td, struct io_u *io_u,
539 unsigned long long buflen)
541 struct fio_file *f = io_u->file;
543 return io_u->offset + buflen <= f->io_size + get_start_offset(td, f);
546 static unsigned long long get_next_buflen(struct thread_data *td, struct io_u *io_u,
549 int ddir = io_u->ddir;
550 unsigned long long buflen = 0;
551 unsigned long long minbs, maxbs;
552 uint64_t frand_max, r;
555 assert(ddir_rw(ddir));
557 if (td_randtrimwrite(td) && ddir == DDIR_WRITE) {
558 struct fio_file *f = io_u->file;
560 return f->last_pos[DDIR_TRIM] - f->last_start[DDIR_TRIM];
563 if (td->o.bs_is_seq_rand)
564 ddir = is_random ? DDIR_WRITE : DDIR_READ;
566 minbs = td->o.min_bs[ddir];
567 maxbs = td->o.max_bs[ddir];
573 * If we can't satisfy the min block size from here, then fail
575 if (!io_u_fits(td, io_u, minbs))
578 frand_max = rand_max(&td->bsrange_state[ddir]);
580 r = __rand(&td->bsrange_state[ddir]);
582 if (!td->o.bssplit_nr[ddir]) {
583 buflen = minbs + (unsigned long long) ((double) maxbs *
584 (r / (frand_max + 1.0)));
589 for (i = 0; i < td->o.bssplit_nr[ddir]; i++) {
590 struct bssplit *bsp = &td->o.bssplit[ddir][i];
596 if ((r / perc <= frand_max / 100ULL) &&
597 io_u_fits(td, io_u, buflen))
602 power_2 = is_power_of_2(minbs);
603 if (!td->o.bs_unaligned && power_2)
604 buflen &= ~(minbs - 1);
605 else if (!td->o.bs_unaligned && !power_2)
606 buflen -= buflen % minbs;
609 } while (!io_u_fits(td, io_u, buflen));
614 static void set_rwmix_bytes(struct thread_data *td)
619 * we do time or byte based switch. this is needed because
620 * buffered writes may issue a lot quicker than they complete,
621 * whereas reads do not.
623 diff = td->o.rwmix[td->rwmix_ddir ^ 1];
624 td->rwmix_issues = (td->io_issues[td->rwmix_ddir] * diff) / 100;
627 static inline enum fio_ddir get_rand_ddir(struct thread_data *td)
631 v = rand_between(&td->rwmix_state, 1, 100);
633 if (v <= td->o.rwmix[DDIR_READ])
639 int io_u_quiesce(struct thread_data *td)
641 int ret = 0, completed = 0, err = 0;
644 * We are going to sleep, ensure that we flush anything pending as
645 * not to skew our latency numbers.
647 * Changed to only monitor 'in flight' requests here instead of the
648 * td->cur_depth, b/c td->cur_depth does not accurately represent
649 * io's that have been actually submitted to an async engine,
650 * and cur_depth is meaningless for sync engines.
652 if (td->io_u_queued || td->cur_depth)
655 while (td->io_u_in_flight) {
656 ret = io_u_queued_complete(td, 1);
663 if (td->flags & TD_F_REGROW_LOGS)
672 static enum fio_ddir rate_ddir(struct thread_data *td, enum fio_ddir ddir)
674 enum fio_ddir odir = ddir ^ 1;
678 assert(ddir_rw(ddir));
679 now = utime_since_now(&td->epoch);
682 * if rate_next_io_time is in the past, need to catch up to rate
684 if (td->rate_next_io_time[ddir] <= now)
688 * We are ahead of rate in this direction. See if we
691 if (td_rw(td) && td->o.rwmix[odir]) {
693 * Other direction is behind rate, switch
695 if (td->rate_next_io_time[odir] <= now)
699 * Both directions are ahead of rate. sleep the min,
700 * switch if necessary
702 if (td->rate_next_io_time[ddir] <=
703 td->rate_next_io_time[odir]) {
704 usec = td->rate_next_io_time[ddir] - now;
706 usec = td->rate_next_io_time[odir] - now;
710 usec = td->rate_next_io_time[ddir] - now;
712 if (td->o.io_submit_mode == IO_MODE_INLINE)
715 if (td->o.timeout && ((usec + now) > td->o.timeout)) {
717 * check if the usec is capable of taking negative values
719 if (now > td->o.timeout) {
723 usec = td->o.timeout - now;
725 usec_sleep(td, usec);
727 now = utime_since_now(&td->epoch);
728 if ((td->o.timeout && (now > td->o.timeout)) || td->terminate)
735 * Return the data direction for the next io_u. If the job is a
736 * mixed read/write workload, check the rwmix cycle and switch if
739 static enum fio_ddir get_rw_ddir(struct thread_data *td)
744 * See if it's time to fsync/fdatasync/sync_file_range first,
745 * and if not then move on to check regular I/Os.
747 if (should_fsync(td)) {
748 if (td->o.fsync_blocks && td->io_issues[DDIR_WRITE] &&
749 !(td->io_issues[DDIR_WRITE] % td->o.fsync_blocks))
752 if (td->o.fdatasync_blocks && td->io_issues[DDIR_WRITE] &&
753 !(td->io_issues[DDIR_WRITE] % td->o.fdatasync_blocks))
754 return DDIR_DATASYNC;
756 if (td->sync_file_range_nr && td->io_issues[DDIR_WRITE] &&
757 !(td->io_issues[DDIR_WRITE] % td->sync_file_range_nr))
758 return DDIR_SYNC_FILE_RANGE;
763 * Check if it's time to seed a new data direction.
765 if (td->io_issues[td->rwmix_ddir] >= td->rwmix_issues) {
767 * Put a top limit on how many bytes we do for
768 * one data direction, to avoid overflowing the
771 ddir = get_rand_ddir(td);
773 if (ddir != td->rwmix_ddir)
776 td->rwmix_ddir = ddir;
778 ddir = td->rwmix_ddir;
779 } else if (td_read(td))
781 else if (td_write(td))
783 else if (td_trim(td))
788 if (!should_check_rate(td)) {
790 * avoid time-consuming call to utime_since_now() if rate checking
791 * isn't being used. this imrpoves IOPs 50%. See:
792 * https://github.com/axboe/fio/issues/1501#issuecomment-1418327049
794 td->rwmix_ddir = ddir;
796 td->rwmix_ddir = rate_ddir(td, ddir);
797 return td->rwmix_ddir;
800 static void set_rw_ddir(struct thread_data *td, struct io_u *io_u)
802 enum fio_ddir ddir = get_rw_ddir(td);
804 if (td->o.zone_mode == ZONE_MODE_ZBD)
805 ddir = zbd_adjust_ddir(td, io_u, ddir);
807 if (td_trimwrite(td)) {
808 struct fio_file *f = io_u->file;
809 if (f->last_start[DDIR_WRITE] == f->last_start[DDIR_TRIM])
815 io_u->ddir = io_u->acct_ddir = ddir;
817 if (io_u->ddir == DDIR_WRITE && td_ioengine_flagged(td, FIO_BARRIER) &&
818 td->o.barrier_blocks &&
819 !(td->io_issues[DDIR_WRITE] % td->o.barrier_blocks) &&
820 td->io_issues[DDIR_WRITE])
821 io_u_set(td, io_u, IO_U_F_BARRIER);
824 void put_file_log(struct thread_data *td, struct fio_file *f)
826 unsigned int ret = put_file(td, f);
829 td_verror(td, ret, "file close");
832 void put_io_u(struct thread_data *td, struct io_u *io_u)
834 const bool needs_lock = td_async_processing(td);
836 zbd_put_io_u(td, io_u);
844 if (io_u->file && !(io_u->flags & IO_U_F_NO_FILE_PUT))
845 put_file_log(td, io_u->file);
848 io_u_set(td, io_u, IO_U_F_FREE);
850 if (io_u->flags & IO_U_F_IN_CUR_DEPTH) {
852 assert(!(td->flags & TD_F_CHILD));
854 io_u_qpush(&td->io_u_freelist, io_u);
855 td_io_u_free_notify(td);
858 __td_io_u_unlock(td);
861 void clear_io_u(struct thread_data *td, struct io_u *io_u)
863 io_u_clear(td, io_u, IO_U_F_FLIGHT);
867 void requeue_io_u(struct thread_data *td, struct io_u **io_u)
869 const bool needs_lock = td_async_processing(td);
870 struct io_u *__io_u = *io_u;
871 enum fio_ddir ddir = acct_ddir(__io_u);
873 dprint(FD_IO, "requeue %p\n", __io_u);
881 io_u_set(td, __io_u, IO_U_F_FREE);
882 if ((__io_u->flags & IO_U_F_FLIGHT) && ddir_rw(ddir))
883 td->io_issues[ddir]--;
885 io_u_clear(td, __io_u, IO_U_F_FLIGHT);
886 if (__io_u->flags & IO_U_F_IN_CUR_DEPTH) {
888 assert(!(td->flags & TD_F_CHILD));
891 io_u_rpush(&td->io_u_requeues, __io_u);
892 td_io_u_free_notify(td);
895 __td_io_u_unlock(td);
900 static void setup_strided_zone_mode(struct thread_data *td, struct io_u *io_u)
902 struct fio_file *f = io_u->file;
904 assert(td->o.zone_mode == ZONE_MODE_STRIDED);
905 assert(td->o.zone_size);
906 assert(td->o.zone_range);
909 * See if it's time to switch to a new zone
911 if (td->zone_bytes >= td->o.zone_size) {
913 f->file_offset += td->o.zone_range + td->o.zone_skip;
916 * Wrap from the beginning, if we exceed the file size
918 if (f->file_offset >= f->real_file_size)
919 f->file_offset = get_start_offset(td, f);
921 f->last_pos[io_u->ddir] = f->file_offset;
922 td->io_skip_bytes += td->o.zone_skip;
926 * If zone_size > zone_range, then maintain the same zone until
927 * zone_bytes >= zone_size.
929 if (f->last_pos[io_u->ddir] >= (f->file_offset + td->o.zone_range)) {
930 dprint(FD_IO, "io_u maintain zone offset=%" PRIu64 "/last_pos=%" PRIu64 "\n",
931 f->file_offset, f->last_pos[io_u->ddir]);
932 f->last_pos[io_u->ddir] = f->file_offset;
936 * For random: if 'norandommap' is not set and zone_size > zone_range,
937 * map needs to be reset as it's done with zone_range everytime.
939 if ((td->zone_bytes % td->o.zone_range) == 0)
940 fio_file_reset(td, f);
943 static int fill_io_u(struct thread_data *td, struct io_u *io_u)
947 enum io_u_action ret;
949 if (td_ioengine_flagged(td, FIO_NOIO))
952 set_rw_ddir(td, io_u);
954 if (io_u->ddir == DDIR_INVAL) {
955 dprint(FD_IO, "invalid direction received ddir = %d", io_u->ddir);
959 * fsync() or fdatasync() or trim etc, we are done
961 if (!ddir_rw(io_u->ddir))
964 if (td->o.zone_mode == ZONE_MODE_STRIDED)
965 setup_strided_zone_mode(td, io_u);
966 else if (td->o.zone_mode == ZONE_MODE_ZBD)
967 setup_zbd_zone_mode(td, io_u);
970 * No log, let the seq/rand engine retrieve the next buflen and
973 if (get_next_offset(td, io_u, &is_random)) {
974 dprint(FD_IO, "io_u %p, failed getting offset\n", io_u);
978 io_u->buflen = get_next_buflen(td, io_u, is_random);
980 dprint(FD_IO, "io_u %p, failed getting buflen\n", io_u);
984 offset = io_u->offset;
985 if (td->o.zone_mode == ZONE_MODE_ZBD) {
986 ret = zbd_adjust_block(td, io_u);
987 if (ret == io_u_eof) {
988 dprint(FD_IO, "zbd_adjust_block() returned io_u_eof\n");
994 fdp_fill_dspec_data(td, io_u);
996 if (io_u->offset + io_u->buflen > io_u->file->real_file_size) {
997 dprint(FD_IO, "io_u %p, off=0x%llx + len=0x%llx exceeds file size=0x%llx\n",
999 (unsigned long long) io_u->offset, io_u->buflen,
1000 (unsigned long long) io_u->file->real_file_size);
1005 * mark entry before potentially trimming io_u
1007 if (td_random(td) && file_randommap(td, io_u->file))
1008 io_u->buflen = mark_random_map(td, io_u, offset, io_u->buflen);
1011 dprint_io_u(io_u, "fill");
1012 io_u->verify_offset = io_u->offset;
1013 td->zone_bytes += io_u->buflen;
1017 static void __io_u_mark_map(uint64_t *map, unsigned int nr)
1047 void io_u_mark_submit(struct thread_data *td, unsigned int nr)
1049 __io_u_mark_map(td->ts.io_u_submit, nr);
1050 td->ts.total_submit++;
1053 void io_u_mark_complete(struct thread_data *td, unsigned int nr)
1055 __io_u_mark_map(td->ts.io_u_complete, nr);
1056 td->ts.total_complete++;
1059 void io_u_mark_depth(struct thread_data *td, unsigned int nr)
1063 switch (td->cur_depth) {
1086 td->ts.io_u_map[idx] += nr;
1089 static void io_u_mark_lat_nsec(struct thread_data *td, unsigned long long nsec)
1093 assert(nsec < 1000);
1127 assert(idx < FIO_IO_U_LAT_N_NR);
1128 td->ts.io_u_lat_n[idx]++;
1131 static void io_u_mark_lat_usec(struct thread_data *td, unsigned long long usec)
1135 assert(usec < 1000 && usec >= 1);
1169 assert(idx < FIO_IO_U_LAT_U_NR);
1170 td->ts.io_u_lat_u[idx]++;
1173 static void io_u_mark_lat_msec(struct thread_data *td, unsigned long long msec)
1217 assert(idx < FIO_IO_U_LAT_M_NR);
1218 td->ts.io_u_lat_m[idx]++;
1221 static void io_u_mark_latency(struct thread_data *td, unsigned long long nsec)
1224 io_u_mark_lat_nsec(td, nsec);
1225 else if (nsec < 1000000)
1226 io_u_mark_lat_usec(td, nsec / 1000);
1228 io_u_mark_lat_msec(td, nsec / 1000000);
1231 static unsigned int __get_next_fileno_rand(struct thread_data *td)
1233 unsigned long fileno;
1235 if (td->o.file_service_type == FIO_FSERVICE_RANDOM) {
1236 uint64_t frand_max = rand_max(&td->next_file_state);
1239 r = __rand(&td->next_file_state);
1240 return (unsigned int) ((double) td->o.nr_files
1241 * (r / (frand_max + 1.0)));
1244 if (td->o.file_service_type == FIO_FSERVICE_ZIPF)
1245 fileno = zipf_next(&td->next_file_zipf);
1246 else if (td->o.file_service_type == FIO_FSERVICE_PARETO)
1247 fileno = pareto_next(&td->next_file_zipf);
1248 else if (td->o.file_service_type == FIO_FSERVICE_GAUSS)
1249 fileno = gauss_next(&td->next_file_gauss);
1251 log_err("fio: bad file service type: %d\n", td->o.file_service_type);
1256 return fileno >> FIO_FSERVICE_SHIFT;
1260 * Get next file to service by choosing one at random
1262 static struct fio_file *get_next_file_rand(struct thread_data *td,
1263 enum fio_file_flags goodf,
1264 enum fio_file_flags badf)
1272 fno = __get_next_fileno_rand(td);
1275 if (fio_file_done(f))
1278 if (!fio_file_open(f)) {
1281 if (td->nr_open_files >= td->o.open_files)
1282 return ERR_PTR(-EBUSY);
1284 err = td_io_open_file(td, f);
1290 if ((!goodf || (f->flags & goodf)) && !(f->flags & badf)) {
1291 dprint(FD_FILE, "get_next_file_rand: %p\n", f);
1295 td_io_close_file(td, f);
1300 * Get next file to service by doing round robin between all available ones
1302 static struct fio_file *get_next_file_rr(struct thread_data *td, int goodf,
1305 unsigned int old_next_file = td->next_file;
1311 f = td->files[td->next_file];
1314 if (td->next_file >= td->o.nr_files)
1317 dprint(FD_FILE, "trying file %s %x\n", f->file_name, f->flags);
1318 if (fio_file_done(f)) {
1323 if (!fio_file_open(f)) {
1326 if (td->nr_open_files >= td->o.open_files)
1327 return ERR_PTR(-EBUSY);
1329 err = td_io_open_file(td, f);
1331 dprint(FD_FILE, "error %d on open of %s\n",
1339 dprint(FD_FILE, "goodf=%x, badf=%x, ff=%x\n", goodf, badf,
1341 if ((!goodf || (f->flags & goodf)) && !(f->flags & badf))
1345 td_io_close_file(td, f);
1348 } while (td->next_file != old_next_file);
1350 dprint(FD_FILE, "get_next_file_rr: %p\n", f);
1354 static struct fio_file *__get_next_file(struct thread_data *td)
1358 assert(td->o.nr_files <= td->files_index);
1360 if (td->nr_done_files >= td->o.nr_files) {
1361 dprint(FD_FILE, "get_next_file: nr_open=%d, nr_done=%d,"
1362 " nr_files=%d\n", td->nr_open_files,
1368 f = td->file_service_file;
1369 if (f && fio_file_open(f) && !fio_file_closing(f)) {
1370 if (td->o.file_service_type == FIO_FSERVICE_SEQ)
1372 if (td->file_service_left) {
1373 td->file_service_left--;
1378 if (td->o.file_service_type == FIO_FSERVICE_RR ||
1379 td->o.file_service_type == FIO_FSERVICE_SEQ)
1380 f = get_next_file_rr(td, FIO_FILE_open, FIO_FILE_closing);
1382 f = get_next_file_rand(td, FIO_FILE_open, FIO_FILE_closing);
1387 td->file_service_file = f;
1388 td->file_service_left = td->file_service_nr - 1;
1391 dprint(FD_FILE, "get_next_file: %p [%s]\n", f, f->file_name);
1393 dprint(FD_FILE, "get_next_file: NULL\n");
1397 static struct fio_file *get_next_file(struct thread_data *td)
1399 return __get_next_file(td);
1402 static long set_io_u_file(struct thread_data *td, struct io_u *io_u)
1407 f = get_next_file(td);
1408 if (IS_ERR_OR_NULL(f))
1414 if (!fill_io_u(td, io_u))
1417 zbd_put_io_u(td, io_u);
1419 put_file_log(td, f);
1420 td_io_close_file(td, f);
1422 if (td->o.file_service_type & __FIO_FSERVICE_NONUNIFORM)
1423 fio_file_reset(td, f);
1425 fio_file_set_done(f);
1426 td->nr_done_files++;
1427 dprint(FD_FILE, "%s: is done (%d of %d)\n", f->file_name,
1428 td->nr_done_files, td->o.nr_files);
1435 static void lat_fatal(struct thread_data *td, struct io_u *io_u, struct io_completion_data *icd,
1436 unsigned long long tnsec, unsigned long long max_nsec)
1439 log_err("fio: latency of %llu nsec exceeds specified max (%llu nsec): %s %s %llu %llu\n",
1441 io_u->file->file_name,
1442 io_ddir_name(io_u->ddir),
1443 io_u->offset, io_u->buflen);
1445 td_verror(td, ETIMEDOUT, "max latency exceeded");
1446 icd->error = ETIMEDOUT;
1449 static void lat_new_cycle(struct thread_data *td)
1451 fio_gettime(&td->latency_ts, NULL);
1452 td->latency_ios = ddir_rw_sum(td->io_blocks);
1453 td->latency_failed = 0;
1457 * We had an IO outside the latency target. Reduce the queue depth. If we
1458 * are at QD=1, then it's time to give up.
1460 static bool __lat_target_failed(struct thread_data *td)
1462 if (td->latency_qd == 1)
1465 td->latency_qd_high = td->latency_qd;
1467 if (td->latency_qd == td->latency_qd_low)
1468 td->latency_qd_low--;
1470 td->latency_qd = (td->latency_qd + td->latency_qd_low) / 2;
1471 td->latency_stable_count = 0;
1473 dprint(FD_RATE, "Ramped down: %d %d %d\n", td->latency_qd_low, td->latency_qd, td->latency_qd_high);
1476 * When we ramp QD down, quiesce existing IO to prevent
1477 * a storm of ramp downs due to pending higher depth.
1484 static bool lat_target_failed(struct thread_data *td)
1486 if (td->o.latency_percentile.u.f == 100.0)
1487 return __lat_target_failed(td);
1489 td->latency_failed++;
1493 void lat_target_init(struct thread_data *td)
1495 td->latency_end_run = 0;
1497 if (td->o.latency_target) {
1498 dprint(FD_RATE, "Latency target=%llu\n", td->o.latency_target);
1499 fio_gettime(&td->latency_ts, NULL);
1501 td->latency_qd_high = td->o.iodepth;
1502 td->latency_qd_low = 1;
1503 td->latency_ios = ddir_rw_sum(td->io_blocks);
1505 td->latency_qd = td->o.iodepth;
1508 void lat_target_reset(struct thread_data *td)
1510 if (!td->latency_end_run)
1511 lat_target_init(td);
1514 static void lat_target_success(struct thread_data *td)
1516 const unsigned int qd = td->latency_qd;
1517 struct thread_options *o = &td->o;
1519 td->latency_qd_low = td->latency_qd;
1521 if (td->latency_qd + 1 == td->latency_qd_high) {
1523 * latency_qd will not incease on lat_target_success(), so
1524 * called stable. If we stick with this queue depth, the
1525 * final latency is likely lower than latency_target. Fix
1526 * this by increasing latency_qd_high slowly. Use a naive
1527 * heuristic here. If we get lat_target_success() 3 times
1528 * in a row, increase latency_qd_high by 1.
1530 if (++td->latency_stable_count >= 3) {
1531 td->latency_qd_high++;
1532 td->latency_stable_count = 0;
1537 * If we haven't failed yet, we double up to a failing value instead
1538 * of bisecting from highest possible queue depth. If we have set
1539 * a limit other than td->o.iodepth, bisect between that.
1541 if (td->latency_qd_high != o->iodepth)
1542 td->latency_qd = (td->latency_qd + td->latency_qd_high) / 2;
1544 td->latency_qd *= 2;
1546 if (td->latency_qd > o->iodepth)
1547 td->latency_qd = o->iodepth;
1549 dprint(FD_RATE, "Ramped up: %d %d %d\n", td->latency_qd_low, td->latency_qd, td->latency_qd_high);
1552 * Same as last one, we are done. Let it run a latency cycle, so
1553 * we get only the results from the targeted depth.
1555 if (!o->latency_run && td->latency_qd == qd) {
1556 if (td->latency_end_run) {
1557 dprint(FD_RATE, "We are done\n");
1560 dprint(FD_RATE, "Quiesce and final run\n");
1562 td->latency_end_run = 1;
1563 reset_all_stats(td);
1572 * Check if we can bump the queue depth
1574 void lat_target_check(struct thread_data *td)
1576 uint64_t usec_window;
1580 usec_window = utime_since_now(&td->latency_ts);
1581 if (usec_window < td->o.latency_window)
1584 ios = ddir_rw_sum(td->io_blocks) - td->latency_ios;
1585 success_ios = (double) (ios - td->latency_failed) / (double) ios;
1586 success_ios *= 100.0;
1588 dprint(FD_RATE, "Success rate: %.2f%% (target %.2f%%)\n", success_ios, td->o.latency_percentile.u.f);
1590 if (success_ios >= td->o.latency_percentile.u.f)
1591 lat_target_success(td);
1593 __lat_target_failed(td);
1597 * If latency target is enabled, we might be ramping up or down and not
1598 * using the full queue depth available.
1600 bool queue_full(const struct thread_data *td)
1602 const int qempty = io_u_qempty(&td->io_u_freelist);
1606 if (!td->o.latency_target)
1609 return td->cur_depth >= td->latency_qd;
1612 struct io_u *__get_io_u(struct thread_data *td)
1614 const bool needs_lock = td_async_processing(td);
1615 struct io_u *io_u = NULL;
1625 if (!io_u_rempty(&td->io_u_requeues)) {
1626 io_u = io_u_rpop(&td->io_u_requeues);
1628 } else if (!queue_full(td)) {
1629 io_u = io_u_qpop(&td->io_u_freelist);
1634 io_u->end_io = NULL;
1638 assert(io_u->flags & IO_U_F_FREE);
1639 io_u_clear(td, io_u, IO_U_F_FREE | IO_U_F_NO_FILE_PUT |
1640 IO_U_F_TRIMMED | IO_U_F_BARRIER |
1644 io_u->acct_ddir = -1;
1646 assert(!(td->flags & TD_F_CHILD));
1647 io_u_set(td, io_u, IO_U_F_IN_CUR_DEPTH);
1649 } else if (td_async_processing(td)) {
1651 * We ran out, wait for async verify threads to finish and
1654 assert(!(td->flags & TD_F_CHILD));
1655 ret = pthread_cond_wait(&td->free_cond, &td->io_u_lock);
1662 __td_io_u_unlock(td);
1667 static bool check_get_trim(struct thread_data *td, struct io_u *io_u)
1669 if (!(td->flags & TD_F_TRIM_BACKLOG))
1671 if (!td->trim_entries)
1674 if (td->trim_batch) {
1676 if (get_next_trim(td, io_u))
1678 } else if (!(td->io_hist_len % td->o.trim_backlog) &&
1679 td->last_ddir != DDIR_READ) {
1680 td->trim_batch = td->o.trim_batch;
1681 if (!td->trim_batch)
1682 td->trim_batch = td->o.trim_backlog;
1683 if (get_next_trim(td, io_u))
1690 static bool check_get_verify(struct thread_data *td, struct io_u *io_u)
1692 if (!(td->flags & TD_F_VER_BACKLOG))
1695 if (td->io_hist_len) {
1698 if (td->verify_batch)
1700 else if (!(td->io_hist_len % td->o.verify_backlog) &&
1701 td->last_ddir != DDIR_READ) {
1702 td->verify_batch = td->o.verify_batch;
1703 if (!td->verify_batch)
1704 td->verify_batch = td->o.verify_backlog;
1708 if (get_verify && !get_next_verify(td, io_u)) {
1718 * Fill offset and start time into the buffer content, to prevent too
1719 * easy compressible data for simple de-dupe attempts. Do this for every
1720 * 512b block in the range, since that should be the smallest block size
1721 * we can expect from a device.
1723 static void small_content_scramble(struct io_u *io_u)
1725 unsigned long long i, nr_blocks = io_u->buflen >> 9;
1726 unsigned int offset;
1727 uint64_t boffset, *iptr;
1734 boffset = io_u->offset;
1736 if (io_u->buf_filled_len)
1737 io_u->buf_filled_len = 0;
1740 * Generate random index between 0..7. We do chunks of 512b, if
1741 * we assume a cacheline is 64 bytes, then we have 8 of those.
1742 * Scramble content within the blocks in the same cacheline to
1745 offset = (io_u->start_time.tv_nsec ^ boffset) & 7;
1747 for (i = 0; i < nr_blocks; i++) {
1749 * Fill offset into start of cacheline, time into end
1752 iptr = (void *) p + (offset << 6);
1755 iptr = (void *) p + 64 - 2 * sizeof(uint64_t);
1756 iptr[0] = io_u->start_time.tv_sec;
1757 iptr[1] = io_u->start_time.tv_nsec;
1765 * Return an io_u to be processed. Gets a buflen and offset, sets direction,
1766 * etc. The returned io_u is fully ready to be prepped, populated and submitted.
1768 struct io_u *get_io_u(struct thread_data *td)
1772 int do_scramble = 0;
1775 io_u = __get_io_u(td);
1777 dprint(FD_IO, "__get_io_u failed\n");
1781 if (check_get_verify(td, io_u))
1783 if (check_get_trim(td, io_u))
1787 * from a requeue, io_u already setup
1793 * If using an iolog, grab next piece if any available.
1795 if (td->flags & TD_F_READ_IOLOG) {
1796 if (read_iolog_get(td, io_u))
1798 } else if (set_io_u_file(td, io_u)) {
1800 dprint(FD_IO, "io_u %p, setting file failed\n", io_u);
1806 dprint(FD_IO, "io_u %p, setting file failed\n", io_u);
1810 assert(fio_file_open(f));
1812 if (ddir_rw(io_u->ddir)) {
1813 if (!io_u->buflen && !td_ioengine_flagged(td, FIO_NOIO)) {
1814 dprint(FD_IO, "get_io_u: zero buflen on %p\n", io_u);
1818 f->last_start[io_u->ddir] = io_u->offset;
1819 f->last_pos[io_u->ddir] = io_u->offset + io_u->buflen;
1821 if (io_u->ddir == DDIR_WRITE) {
1822 if (td->flags & TD_F_REFILL_BUFFERS) {
1823 io_u_fill_buffer(td, io_u,
1824 td->o.min_bs[DDIR_WRITE],
1826 } else if ((td->flags & TD_F_SCRAMBLE_BUFFERS) &&
1827 !(td->flags & TD_F_COMPRESS) &&
1828 !(td->flags & TD_F_DO_VERIFY))
1830 } else if (io_u->ddir == DDIR_READ) {
1832 * Reset the buf_filled parameters so next time if the
1833 * buffer is used for writes it is refilled.
1835 io_u->buf_filled_len = 0;
1840 * Set io data pointers.
1842 io_u->xfer_buf = io_u->buf;
1843 io_u->xfer_buflen = io_u->buflen;
1846 * Remember the issuing context priority. The IO engine may change this.
1848 io_u->ioprio = td->ioprio;
1849 io_u->clat_prio_index = 0;
1852 if (!td_io_prep(td, io_u)) {
1853 if (!td->o.disable_lat)
1854 fio_gettime(&io_u->start_time, NULL);
1857 small_content_scramble(io_u);
1862 dprint(FD_IO, "get_io_u failed\n");
1864 return ERR_PTR(ret);
1867 static void __io_u_log_error(struct thread_data *td, struct io_u *io_u)
1869 enum error_type_bit eb = td_error_type(io_u->ddir, io_u->error);
1871 if (td_non_fatal_error(td, eb, io_u->error) && !td->o.error_dump)
1874 log_err("fio: io_u error%s%s: %s: %s offset=%llu, buflen=%llu\n",
1875 io_u->file ? " on file " : "",
1876 io_u->file ? io_u->file->file_name : "",
1877 strerror(io_u->error),
1878 io_ddir_name(io_u->ddir),
1879 io_u->offset, io_u->xfer_buflen);
1881 if (td->io_ops->errdetails) {
1882 char *err = td->io_ops->errdetails(io_u);
1884 log_err("fio: %s\n", err);
1889 td_verror(td, io_u->error, "io_u error");
1892 void io_u_log_error(struct thread_data *td, struct io_u *io_u)
1894 __io_u_log_error(td, io_u);
1896 __io_u_log_error(td->parent, io_u);
1899 static inline bool gtod_reduce(struct thread_data *td)
1901 return (td->o.disable_clat && td->o.disable_slat && td->o.disable_bw)
1902 || td->o.gtod_reduce;
1905 static void trim_block_info(struct thread_data *td, struct io_u *io_u)
1907 uint32_t *info = io_u_block_info(td, io_u);
1909 if (BLOCK_INFO_STATE(*info) >= BLOCK_STATE_TRIM_FAILURE)
1912 *info = BLOCK_INFO(BLOCK_STATE_TRIMMED, BLOCK_INFO_TRIMS(*info) + 1);
1915 static void account_io_completion(struct thread_data *td, struct io_u *io_u,
1916 struct io_completion_data *icd,
1917 const enum fio_ddir idx, unsigned int bytes)
1919 const int no_reduce = !gtod_reduce(td);
1920 unsigned long long llnsec = 0;
1925 if (!td->o.stats || td_ioengine_flagged(td, FIO_NOSTATS))
1929 llnsec = ntime_since(&io_u->issue_time, &icd->time);
1931 if (!td->o.disable_lat) {
1932 unsigned long long tnsec;
1934 tnsec = ntime_since(&io_u->start_time, &icd->time);
1935 add_lat_sample(td, idx, tnsec, bytes, io_u->offset,
1936 io_u->ioprio, io_u->clat_prio_index);
1938 if (td->flags & TD_F_PROFILE_OPS) {
1939 struct prof_io_ops *ops = &td->prof_io_ops;
1942 icd->error = ops->io_u_lat(td, tnsec);
1946 if (td->o.max_latency[idx] && tnsec > td->o.max_latency[idx])
1947 lat_fatal(td, io_u, icd, tnsec, td->o.max_latency[idx]);
1948 if (td->o.latency_target && tnsec > td->o.latency_target) {
1949 if (lat_target_failed(td))
1950 lat_fatal(td, io_u, icd, tnsec, td->o.latency_target);
1956 if (!td->o.disable_clat) {
1957 add_clat_sample(td, idx, llnsec, bytes, io_u->offset,
1958 io_u->ioprio, io_u->clat_prio_index);
1959 io_u_mark_latency(td, llnsec);
1962 if (!td->o.disable_bw && per_unit_log(td->bw_log))
1963 add_bw_sample(td, io_u, bytes, llnsec);
1965 if (no_reduce && per_unit_log(td->iops_log))
1966 add_iops_sample(td, io_u, bytes);
1967 } else if (ddir_sync(idx) && !td->o.disable_clat)
1968 add_sync_clat_sample(&td->ts, llnsec);
1970 if (td->ts.nr_block_infos && io_u->ddir == DDIR_TRIM)
1971 trim_block_info(td, io_u);
1974 static void file_log_write_comp(const struct thread_data *td, struct fio_file *f,
1975 uint64_t offset, unsigned int bytes)
1982 if (f->first_write == -1ULL || offset < f->first_write)
1983 f->first_write = offset;
1984 if (f->last_write == -1ULL || ((offset + bytes) > f->last_write))
1985 f->last_write = offset + bytes;
1987 if (!f->last_write_comp)
1990 idx = f->last_write_idx++;
1991 f->last_write_comp[idx] = offset;
1992 if (f->last_write_idx == td->o.iodepth)
1993 f->last_write_idx = 0;
1996 static bool should_account(struct thread_data *td)
1998 return ramp_time_over(td) && (td->runstate == TD_RUNNING ||
1999 td->runstate == TD_VERIFYING);
2002 static void io_completed(struct thread_data *td, struct io_u **io_u_ptr,
2003 struct io_completion_data *icd)
2005 struct io_u *io_u = *io_u_ptr;
2006 enum fio_ddir ddir = io_u->ddir;
2007 struct fio_file *f = io_u->file;
2009 dprint_io_u(io_u, "complete");
2011 assert(io_u->flags & IO_U_F_FLIGHT);
2012 io_u_clear(td, io_u, IO_U_F_FLIGHT | IO_U_F_BUSY_OK | IO_U_F_PATTERN_DONE);
2015 * Mark IO ok to verify
2019 * Remove errored entry from the verification list
2022 unlog_io_piece(td, io_u);
2024 atomic_store_release(&io_u->ipo->flags,
2025 io_u->ipo->flags & ~IP_F_IN_FLIGHT);
2029 if (ddir_sync(ddir)) {
2032 td->last_was_sync = true;
2034 f->first_write = -1ULL;
2035 f->last_write = -1ULL;
2037 if (should_account(td))
2038 account_io_completion(td, io_u, icd, ddir, io_u->buflen);
2042 td->last_was_sync = false;
2043 td->last_ddir = ddir;
2045 if (!io_u->error && ddir_rw(ddir)) {
2046 unsigned long long bytes = io_u->xfer_buflen - io_u->resid;
2050 * Make sure we notice short IO from here, and requeue them
2053 if (bytes && io_u->resid) {
2054 io_u->xfer_buflen = io_u->resid;
2055 io_u->xfer_buf += bytes;
2056 io_u->offset += bytes;
2057 td->ts.short_io_u[io_u->ddir]++;
2058 if (io_u->offset < io_u->file->real_file_size) {
2059 requeue_io_u(td, io_u_ptr);
2064 td->io_blocks[ddir]++;
2065 td->io_bytes[ddir] += bytes;
2067 if (!(io_u->flags & IO_U_F_VER_LIST)) {
2068 td->this_io_blocks[ddir]++;
2069 td->this_io_bytes[ddir] += bytes;
2072 if (ddir == DDIR_WRITE)
2073 file_log_write_comp(td, f, io_u->offset, bytes);
2075 if (should_account(td))
2076 account_io_completion(td, io_u, icd, ddir, bytes);
2078 icd->bytes_done[ddir] += bytes;
2081 ret = io_u->end_io(td, io_u_ptr);
2083 if (ret && !icd->error)
2086 } else if (io_u->error) {
2088 icd->error = io_u->error;
2089 io_u_log_error(td, io_u);
2092 enum error_type_bit eb = td_error_type(ddir, icd->error);
2094 if (!td_non_fatal_error(td, eb, icd->error))
2098 * If there is a non_fatal error, then add to the error count
2099 * and clear all the errors.
2101 update_error_count(td, icd->error);
2109 static void init_icd(struct thread_data *td, struct io_completion_data *icd,
2114 if (!gtod_reduce(td))
2115 fio_gettime(&icd->time, NULL);
2120 for (ddir = 0; ddir < DDIR_RWDIR_CNT; ddir++)
2121 icd->bytes_done[ddir] = 0;
2124 static void ios_completed(struct thread_data *td,
2125 struct io_completion_data *icd)
2130 for (i = 0; i < icd->nr; i++) {
2131 io_u = td->io_ops->event(td, i);
2133 io_completed(td, &io_u, icd);
2140 static void io_u_update_bytes_done(struct thread_data *td,
2141 struct io_completion_data *icd)
2145 if (td->runstate == TD_VERIFYING) {
2146 td->bytes_verified += icd->bytes_done[DDIR_READ];
2150 for (ddir = 0; ddir < DDIR_RWDIR_CNT; ddir++)
2151 td->bytes_done[ddir] += icd->bytes_done[ddir];
2155 * Complete a single io_u for the sync engines.
2157 int io_u_sync_complete(struct thread_data *td, struct io_u *io_u)
2159 struct io_completion_data icd;
2161 init_icd(td, &icd, 1);
2162 io_completed(td, &io_u, &icd);
2168 td_verror(td, icd.error, "io_u_sync_complete");
2172 io_u_update_bytes_done(td, &icd);
2178 * Called to complete min_events number of io for the async engines.
2180 int io_u_queued_complete(struct thread_data *td, int min_evts)
2182 struct io_completion_data icd;
2183 struct timespec *tvp = NULL;
2185 struct timespec ts = { .tv_sec = 0, .tv_nsec = 0, };
2187 dprint(FD_IO, "io_u_queued_complete: min=%d\n", min_evts);
2191 else if (min_evts > td->cur_depth)
2192 min_evts = td->cur_depth;
2194 /* No worries, td_io_getevents fixes min and max if they are
2195 * set incorrectly */
2196 ret = td_io_getevents(td, min_evts, td->o.iodepth_batch_complete_max, tvp);
2198 td_verror(td, -ret, "td_io_getevents");
2203 init_icd(td, &icd, ret);
2204 ios_completed(td, &icd);
2206 td_verror(td, icd.error, "io_u_queued_complete");
2210 io_u_update_bytes_done(td, &icd);
2216 * Call when io_u is really queued, to update the submission latency.
2218 void io_u_queued(struct thread_data *td, struct io_u *io_u)
2220 if (!td->o.disable_slat && ramp_time_over(td) && td->o.stats) {
2221 unsigned long slat_time;
2223 slat_time = ntime_since(&io_u->start_time, &io_u->issue_time);
2228 add_slat_sample(td, io_u->ddir, slat_time, io_u->xfer_buflen,
2229 io_u->offset, io_u->ioprio);
2234 * See if we should reuse the last seed, if dedupe is enabled
2236 static struct frand_state *get_buf_state(struct thread_data *td)
2239 unsigned long long i;
2241 if (!td->o.dedupe_percentage)
2242 return &td->buf_state;
2243 else if (td->o.dedupe_percentage == 100) {
2244 frand_copy(&td->buf_state_prev, &td->buf_state);
2245 return &td->buf_state;
2248 v = rand_between(&td->dedupe_state, 1, 100);
2250 if (v <= td->o.dedupe_percentage)
2251 switch (td->o.dedupe_mode) {
2252 case DEDUPE_MODE_REPEAT:
2254 * The caller advances the returned frand_state.
2255 * A copy of prev should be returned instead since
2256 * a subsequent intention to generate a deduped buffer
2257 * might result in generating a unique one
2259 frand_copy(&td->buf_state_ret, &td->buf_state_prev);
2260 return &td->buf_state_ret;
2261 case DEDUPE_MODE_WORKING_SET:
2262 i = rand_between(&td->dedupe_working_set_index_state, 0, td->num_unique_pages - 1);
2263 frand_copy(&td->buf_state_ret, &td->dedupe_working_set_states[i]);
2264 return &td->buf_state_ret;
2266 log_err("unexpected dedupe mode %u\n", td->o.dedupe_mode);
2270 return &td->buf_state;
2273 static void save_buf_state(struct thread_data *td, struct frand_state *rs)
2275 if (td->o.dedupe_percentage == 100)
2276 frand_copy(rs, &td->buf_state_prev);
2277 else if (rs == &td->buf_state)
2278 frand_copy(&td->buf_state_prev, rs);
2281 void fill_io_buffer(struct thread_data *td, void *buf, unsigned long long min_write,
2282 unsigned long long max_bs)
2284 struct thread_options *o = &td->o;
2286 if (o->mem_type == MEM_CUDA_MALLOC)
2289 if (o->compress_percentage || o->dedupe_percentage) {
2290 unsigned int perc = td->o.compress_percentage;
2291 struct frand_state *rs = NULL;
2292 unsigned long long left = max_bs;
2293 unsigned long long this_write;
2297 * Buffers are either entirely dedupe-able or not.
2298 * If we choose to dedup, the buffer should undergo
2299 * the same manipulation as the original write. Which
2300 * means we should retrack the steps we took for compression
2304 rs = get_buf_state(td);
2306 min_write = min(min_write, left);
2308 this_write = min_not_zero(min_write,
2309 (unsigned long long) td->o.compress_chunk);
2311 fill_random_buf_percentage(rs, buf, perc,
2312 this_write, this_write,
2314 o->buffer_pattern_bytes);
2318 save_buf_state(td, rs);
2320 } else if (o->buffer_pattern_bytes)
2321 fill_buffer_pattern(td, buf, max_bs);
2322 else if (o->zero_buffers)
2323 memset(buf, 0, max_bs);
2325 fill_random_buf(get_buf_state(td), buf, max_bs);
2329 * "randomly" fill the buffer contents
2331 void io_u_fill_buffer(struct thread_data *td, struct io_u *io_u,
2332 unsigned long long min_write, unsigned long long max_bs)
2334 io_u->buf_filled_len = 0;
2335 fill_io_buffer(td, io_u->buf, min_write, max_bs);
2338 static int do_sync_file_range(const struct thread_data *td,
2341 uint64_t offset, nbytes;
2343 offset = f->first_write;
2344 nbytes = f->last_write - f->first_write;
2349 return sync_file_range(f->fd, offset, nbytes, td->o.sync_file_range);
2352 int do_io_u_sync(const struct thread_data *td, struct io_u *io_u)
2356 if (io_u->ddir == DDIR_SYNC) {
2357 #ifdef CONFIG_FCNTL_SYNC
2358 ret = fcntl(io_u->file->fd, F_FULLFSYNC);
2360 ret = fsync(io_u->file->fd);
2362 } else if (io_u->ddir == DDIR_DATASYNC) {
2363 #ifdef CONFIG_FDATASYNC
2364 ret = fdatasync(io_u->file->fd);
2366 ret = io_u->xfer_buflen;
2367 io_u->error = EINVAL;
2369 } else if (io_u->ddir == DDIR_SYNC_FILE_RANGE)
2370 ret = do_sync_file_range(td, io_u->file);
2372 ret = io_u->xfer_buflen;
2373 io_u->error = EINVAL;
2377 io_u->error = errno;
2382 int do_io_u_trim(const struct thread_data *td, struct io_u *io_u)
2384 #ifndef FIO_HAVE_TRIM
2385 io_u->error = EINVAL;
2388 struct fio_file *f = io_u->file;
2391 if (td->o.zone_mode == ZONE_MODE_ZBD) {
2392 ret = zbd_do_io_u_trim(td, io_u);
2393 if (ret == io_u_completed)
2394 return io_u->xfer_buflen;
2399 ret = os_trim(f, io_u->offset, io_u->xfer_buflen);
2401 return io_u->xfer_buflen;