14 struct io_completion_data {
17 int error; /* output */
18 uint64_t bytes_done[DDIR_RWDIR_CNT]; /* output */
19 struct timespec time; /* output */
23 * The ->io_axmap contains a map of blocks we have or have not done io
24 * to yet. Used to make sure we cover the entire range in a fair fashion.
26 static bool random_map_free(struct fio_file *f, const uint64_t block)
28 return !axmap_isset(f->io_axmap, block);
32 * Mark a given offset as used in the map.
34 static void mark_random_map(struct thread_data *td, struct io_u *io_u)
36 unsigned int min_bs = td->o.min_bs[io_u->ddir];
37 struct fio_file *f = io_u->file;
38 unsigned int nr_blocks;
41 block = (io_u->offset - f->file_offset) / (uint64_t) min_bs;
42 nr_blocks = (io_u->buflen + min_bs - 1) / min_bs;
44 if (!(io_u->flags & IO_U_F_BUSY_OK))
45 nr_blocks = axmap_set_nr(f->io_axmap, block, nr_blocks);
47 if ((nr_blocks * min_bs) < io_u->buflen)
48 io_u->buflen = nr_blocks * min_bs;
51 static uint64_t last_block(struct thread_data *td, struct fio_file *f,
57 assert(ddir_rw(ddir));
60 * Hmm, should we make sure that ->io_size <= ->real_file_size?
61 * -> not for now since there is code assuming it could go either.
63 max_size = f->io_size;
64 if (max_size > f->real_file_size)
65 max_size = f->real_file_size;
68 max_size = td->o.zone_range;
70 if (td->o.min_bs[ddir] > td->o.ba[ddir])
71 max_size -= td->o.min_bs[ddir] - td->o.ba[ddir];
73 max_blocks = max_size / (uint64_t) td->o.ba[ddir];
80 static int __get_next_rand_offset(struct thread_data *td, struct fio_file *f,
81 enum fio_ddir ddir, uint64_t *b,
86 if (td->o.random_generator == FIO_RAND_GEN_TAUSWORTHE ||
87 td->o.random_generator == FIO_RAND_GEN_TAUSWORTHE64) {
89 r = __rand(&td->random_state);
91 dprint(FD_RANDOM, "off rand %llu\n", (unsigned long long) r);
93 *b = lastb * (r / (rand_max(&td->random_state) + 1.0));
97 assert(fio_file_lfsr(f));
99 if (lfsr_next(&f->lfsr, &off))
106 * if we are not maintaining a random map, we are done.
108 if (!file_randommap(td, f))
112 * calculate map offset and check if it's free
114 if (random_map_free(f, *b))
117 dprint(FD_RANDOM, "get_next_rand_offset: offset %llu busy\n",
118 (unsigned long long) *b);
120 *b = axmap_next_free(f->io_axmap, *b);
121 if (*b == (uint64_t) -1ULL)
127 static int __get_next_rand_offset_zipf(struct thread_data *td,
128 struct fio_file *f, enum fio_ddir ddir,
131 *b = zipf_next(&f->zipf);
135 static int __get_next_rand_offset_pareto(struct thread_data *td,
136 struct fio_file *f, enum fio_ddir ddir,
139 *b = pareto_next(&f->zipf);
143 static int __get_next_rand_offset_gauss(struct thread_data *td,
144 struct fio_file *f, enum fio_ddir ddir,
147 *b = gauss_next(&f->gauss);
151 static int __get_next_rand_offset_zoned_abs(struct thread_data *td,
153 enum fio_ddir ddir, uint64_t *b)
155 struct zone_split_index *zsi;
156 uint64_t lastb, send, stotal;
159 lastb = last_block(td, f, ddir);
163 if (!td->o.zone_split_nr[ddir]) {
165 return __get_next_rand_offset(td, f, ddir, b, lastb);
169 * Generate a value, v, between 1 and 100, both inclusive
171 v = rand32_between(&td->zone_state, 1, 100);
174 * Find our generated table. 'send' is the end block of this zone,
175 * 'stotal' is our start offset.
177 zsi = &td->zone_state_index[ddir][v - 1];
178 stotal = zsi->size_prev / td->o.ba[ddir];
179 send = zsi->size / td->o.ba[ddir];
182 * Should never happen
185 if (!fio_did_warn(FIO_WARN_ZONED_BUG))
186 log_err("fio: bug in zoned generation\n");
188 } else if (send > lastb) {
190 * This happens if the user specifies ranges that exceed
191 * the file/device size. We can't handle that gracefully,
194 log_err("fio: zoned_abs sizes exceed file size\n");
199 * Generate index from 0..send-stotal
201 if (__get_next_rand_offset(td, f, ddir, b, send - stotal) == 1)
208 static int __get_next_rand_offset_zoned(struct thread_data *td,
209 struct fio_file *f, enum fio_ddir ddir,
212 unsigned int v, send, stotal;
213 uint64_t offset, lastb;
214 struct zone_split_index *zsi;
216 lastb = last_block(td, f, ddir);
220 if (!td->o.zone_split_nr[ddir]) {
222 return __get_next_rand_offset(td, f, ddir, b, lastb);
226 * Generate a value, v, between 1 and 100, both inclusive
228 v = rand32_between(&td->zone_state, 1, 100);
230 zsi = &td->zone_state_index[ddir][v - 1];
231 stotal = zsi->size_perc_prev;
232 send = zsi->size_perc;
235 * Should never happen
238 if (!fio_did_warn(FIO_WARN_ZONED_BUG))
239 log_err("fio: bug in zoned generation\n");
244 * 'send' is some percentage below or equal to 100 that
245 * marks the end of the current IO range. 'stotal' marks
246 * the start, in percent.
249 offset = stotal * lastb / 100ULL;
253 lastb = lastb * (send - stotal) / 100ULL;
256 * Generate index from 0..send-of-lastb
258 if (__get_next_rand_offset(td, f, ddir, b, lastb) == 1)
262 * Add our start offset, if any
270 static int get_next_rand_offset(struct thread_data *td, struct fio_file *f,
271 enum fio_ddir ddir, uint64_t *b)
273 if (td->o.random_distribution == FIO_RAND_DIST_RANDOM) {
276 lastb = last_block(td, f, ddir);
280 return __get_next_rand_offset(td, f, ddir, b, lastb);
281 } else if (td->o.random_distribution == FIO_RAND_DIST_ZIPF)
282 return __get_next_rand_offset_zipf(td, f, ddir, b);
283 else if (td->o.random_distribution == FIO_RAND_DIST_PARETO)
284 return __get_next_rand_offset_pareto(td, f, ddir, b);
285 else if (td->o.random_distribution == FIO_RAND_DIST_GAUSS)
286 return __get_next_rand_offset_gauss(td, f, ddir, b);
287 else if (td->o.random_distribution == FIO_RAND_DIST_ZONED)
288 return __get_next_rand_offset_zoned(td, f, ddir, b);
289 else if (td->o.random_distribution == FIO_RAND_DIST_ZONED_ABS)
290 return __get_next_rand_offset_zoned_abs(td, f, ddir, b);
292 log_err("fio: unknown random distribution: %d\n", td->o.random_distribution);
296 static bool should_do_random(struct thread_data *td, enum fio_ddir ddir)
300 if (td->o.perc_rand[ddir] == 100)
303 v = rand32_between(&td->seq_rand_state[ddir], 1, 100);
305 return v <= td->o.perc_rand[ddir];
308 static void loop_cache_invalidate(struct thread_data *td, struct fio_file *f)
310 struct thread_options *o = &td->o;
312 if (o->invalidate_cache && !o->odirect) {
315 ret = file_invalidate_cache(td, f);
319 static int get_next_rand_block(struct thread_data *td, struct fio_file *f,
320 enum fio_ddir ddir, uint64_t *b)
322 if (!get_next_rand_offset(td, f, ddir, b))
325 if (td->o.time_based ||
326 (td->o.file_service_type & __FIO_FSERVICE_NONUNIFORM)) {
327 fio_file_reset(td, f);
328 if (!get_next_rand_offset(td, f, ddir, b))
330 loop_cache_invalidate(td, f);
333 dprint(FD_IO, "%s: rand offset failed, last=%llu, size=%llu\n",
334 f->file_name, (unsigned long long) f->last_pos[ddir],
335 (unsigned long long) f->real_file_size);
339 static int get_next_seq_offset(struct thread_data *td, struct fio_file *f,
340 enum fio_ddir ddir, uint64_t *offset)
342 struct thread_options *o = &td->o;
344 assert(ddir_rw(ddir));
347 * If we reach the end for a time based run, reset us back to 0
348 * and invalidate the cache, if we need to.
350 if (f->last_pos[ddir] >= f->io_size + get_start_offset(td, f) &&
352 f->last_pos[ddir] = f->file_offset;
353 loop_cache_invalidate(td, f);
356 if (f->last_pos[ddir] < f->real_file_size) {
360 * Only rewind if we already hit the end
362 if (f->last_pos[ddir] == f->file_offset &&
363 f->file_offset && o->ddir_seq_add < 0) {
364 if (f->real_file_size > f->io_size)
365 f->last_pos[ddir] = f->io_size;
367 f->last_pos[ddir] = f->real_file_size;
370 pos = f->last_pos[ddir] - f->file_offset;
371 if (pos && o->ddir_seq_add) {
372 pos += o->ddir_seq_add;
375 * If we reach beyond the end of the file
376 * with holed IO, wrap around to the
377 * beginning again. If we're doing backwards IO,
380 if (pos >= f->real_file_size) {
381 if (o->ddir_seq_add > 0)
382 pos = f->file_offset;
384 if (f->real_file_size > f->io_size)
387 pos = f->real_file_size;
389 pos += o->ddir_seq_add;
401 static int get_next_block(struct thread_data *td, struct io_u *io_u,
402 enum fio_ddir ddir, int rw_seq,
405 struct fio_file *f = io_u->file;
409 assert(ddir_rw(ddir));
415 if (should_do_random(td, ddir)) {
416 ret = get_next_rand_block(td, f, ddir, &b);
420 io_u_set(td, io_u, IO_U_F_BUSY_OK);
421 ret = get_next_seq_offset(td, f, ddir, &offset);
423 ret = get_next_rand_block(td, f, ddir, &b);
427 ret = get_next_seq_offset(td, f, ddir, &offset);
430 io_u_set(td, io_u, IO_U_F_BUSY_OK);
433 if (td->o.rw_seq == RW_SEQ_SEQ) {
434 ret = get_next_seq_offset(td, f, ddir, &offset);
436 ret = get_next_rand_block(td, f, ddir, &b);
439 } else if (td->o.rw_seq == RW_SEQ_IDENT) {
440 if (f->last_start[ddir] != -1ULL)
441 offset = f->last_start[ddir] - f->file_offset;
446 log_err("fio: unknown rw_seq=%d\n", td->o.rw_seq);
453 io_u->offset = offset;
455 io_u->offset = b * td->o.ba[ddir];
457 log_err("fio: bug in offset generation: offset=%llu, b=%llu\n", (unsigned long long) offset, (unsigned long long) b);
466 * For random io, generate a random new block and see if it's used. Repeat
467 * until we find a free one. For sequential io, just return the end of
468 * the last io issued.
470 static int get_next_offset(struct thread_data *td, struct io_u *io_u,
473 struct fio_file *f = io_u->file;
474 enum fio_ddir ddir = io_u->ddir;
477 assert(ddir_rw(ddir));
479 if (td->o.ddir_seq_nr && !--td->ddir_seq_nr) {
481 td->ddir_seq_nr = td->o.ddir_seq_nr;
484 if (get_next_block(td, io_u, ddir, rw_seq_hit, is_random))
487 if (io_u->offset >= f->io_size) {
488 dprint(FD_IO, "get_next_offset: offset %llu >= io_size %llu\n",
489 (unsigned long long) io_u->offset,
490 (unsigned long long) f->io_size);
494 io_u->offset += f->file_offset;
495 if (io_u->offset >= f->real_file_size) {
496 dprint(FD_IO, "get_next_offset: offset %llu >= size %llu\n",
497 (unsigned long long) io_u->offset,
498 (unsigned long long) f->real_file_size);
505 static inline bool io_u_fits(struct thread_data *td, struct io_u *io_u,
508 struct fio_file *f = io_u->file;
510 return io_u->offset + buflen <= f->io_size + get_start_offset(td, f);
513 static unsigned int get_next_buflen(struct thread_data *td, struct io_u *io_u,
516 int ddir = io_u->ddir;
517 unsigned int buflen = 0;
518 unsigned int minbs, maxbs;
519 uint64_t frand_max, r;
522 assert(ddir_rw(ddir));
524 if (td->o.bs_is_seq_rand)
525 ddir = is_random ? DDIR_WRITE : DDIR_READ;
527 minbs = td->o.min_bs[ddir];
528 maxbs = td->o.max_bs[ddir];
534 * If we can't satisfy the min block size from here, then fail
536 if (!io_u_fits(td, io_u, minbs))
539 frand_max = rand_max(&td->bsrange_state[ddir]);
541 r = __rand(&td->bsrange_state[ddir]);
543 if (!td->o.bssplit_nr[ddir]) {
544 buflen = 1 + (unsigned int) ((double) maxbs *
545 (r / (frand_max + 1.0)));
552 for (i = 0; i < td->o.bssplit_nr[ddir]; i++) {
553 struct bssplit *bsp = &td->o.bssplit[ddir][i];
559 if ((r / perc <= frand_max / 100ULL) &&
560 io_u_fits(td, io_u, buflen))
565 power_2 = is_power_of_2(minbs);
566 if (!td->o.bs_unaligned && power_2)
567 buflen &= ~(minbs - 1);
568 else if (!td->o.bs_unaligned && !power_2)
569 buflen -= buflen % minbs;
570 } while (!io_u_fits(td, io_u, buflen));
575 static void set_rwmix_bytes(struct thread_data *td)
580 * we do time or byte based switch. this is needed because
581 * buffered writes may issue a lot quicker than they complete,
582 * whereas reads do not.
584 diff = td->o.rwmix[td->rwmix_ddir ^ 1];
585 td->rwmix_issues = (td->io_issues[td->rwmix_ddir] * diff) / 100;
588 static inline enum fio_ddir get_rand_ddir(struct thread_data *td)
592 v = rand32_between(&td->rwmix_state, 1, 100);
594 if (v <= td->o.rwmix[DDIR_READ])
600 int io_u_quiesce(struct thread_data *td)
605 * We are going to sleep, ensure that we flush anything pending as
606 * not to skew our latency numbers.
608 * Changed to only monitor 'in flight' requests here instead of the
609 * td->cur_depth, b/c td->cur_depth does not accurately represent
610 * io's that have been actually submitted to an async engine,
611 * and cur_depth is meaningless for sync engines.
613 if (td->io_u_queued || td->cur_depth) {
616 ret = td_io_commit(td);
619 while (td->io_u_in_flight) {
622 ret = io_u_queued_complete(td, 1);
627 if (td->flags & TD_F_REGROW_LOGS)
633 static enum fio_ddir rate_ddir(struct thread_data *td, enum fio_ddir ddir)
635 enum fio_ddir odir = ddir ^ 1;
639 assert(ddir_rw(ddir));
640 now = utime_since_now(&td->start);
643 * if rate_next_io_time is in the past, need to catch up to rate
645 if (td->rate_next_io_time[ddir] <= now)
649 * We are ahead of rate in this direction. See if we
652 if (td_rw(td) && td->o.rwmix[odir]) {
654 * Other direction is behind rate, switch
656 if (td->rate_next_io_time[odir] <= now)
660 * Both directions are ahead of rate. sleep the min,
661 * switch if necessary
663 if (td->rate_next_io_time[ddir] <=
664 td->rate_next_io_time[odir]) {
665 usec = td->rate_next_io_time[ddir] - now;
667 usec = td->rate_next_io_time[odir] - now;
671 usec = td->rate_next_io_time[ddir] - now;
673 if (td->o.io_submit_mode == IO_MODE_INLINE)
676 usec_sleep(td, usec);
681 * Return the data direction for the next io_u. If the job is a
682 * mixed read/write workload, check the rwmix cycle and switch if
685 static enum fio_ddir get_rw_ddir(struct thread_data *td)
690 * See if it's time to fsync/fdatasync/sync_file_range first,
691 * and if not then move on to check regular I/Os.
693 if (should_fsync(td)) {
694 if (td->o.fsync_blocks && td->io_issues[DDIR_WRITE] &&
695 !(td->io_issues[DDIR_WRITE] % td->o.fsync_blocks))
698 if (td->o.fdatasync_blocks && td->io_issues[DDIR_WRITE] &&
699 !(td->io_issues[DDIR_WRITE] % td->o.fdatasync_blocks))
700 return DDIR_DATASYNC;
702 if (td->sync_file_range_nr && td->io_issues[DDIR_WRITE] &&
703 !(td->io_issues[DDIR_WRITE] % td->sync_file_range_nr))
704 return DDIR_SYNC_FILE_RANGE;
709 * Check if it's time to seed a new data direction.
711 if (td->io_issues[td->rwmix_ddir] >= td->rwmix_issues) {
713 * Put a top limit on how many bytes we do for
714 * one data direction, to avoid overflowing the
717 ddir = get_rand_ddir(td);
719 if (ddir != td->rwmix_ddir)
722 td->rwmix_ddir = ddir;
724 ddir = td->rwmix_ddir;
725 } else if (td_read(td))
727 else if (td_write(td))
729 else if (td_trim(td))
734 td->rwmix_ddir = rate_ddir(td, ddir);
735 return td->rwmix_ddir;
738 static void set_rw_ddir(struct thread_data *td, struct io_u *io_u)
740 enum fio_ddir ddir = get_rw_ddir(td);
742 if (td_trimwrite(td)) {
743 struct fio_file *f = io_u->file;
744 if (f->last_pos[DDIR_WRITE] == f->last_pos[DDIR_TRIM])
750 io_u->ddir = io_u->acct_ddir = ddir;
752 if (io_u->ddir == DDIR_WRITE && td_ioengine_flagged(td, FIO_BARRIER) &&
753 td->o.barrier_blocks &&
754 !(td->io_issues[DDIR_WRITE] % td->o.barrier_blocks) &&
755 td->io_issues[DDIR_WRITE])
756 io_u_set(td, io_u, IO_U_F_BARRIER);
759 void put_file_log(struct thread_data *td, struct fio_file *f)
761 unsigned int ret = put_file(td, f);
764 td_verror(td, ret, "file close");
767 void put_io_u(struct thread_data *td, struct io_u *io_u)
774 if (io_u->file && !(io_u->flags & IO_U_F_NO_FILE_PUT))
775 put_file_log(td, io_u->file);
778 io_u_set(td, io_u, IO_U_F_FREE);
780 if (io_u->flags & IO_U_F_IN_CUR_DEPTH) {
782 assert(!(td->flags & TD_F_CHILD));
784 io_u_qpush(&td->io_u_freelist, io_u);
785 td_io_u_free_notify(td);
789 void clear_io_u(struct thread_data *td, struct io_u *io_u)
791 io_u_clear(td, io_u, IO_U_F_FLIGHT);
795 void requeue_io_u(struct thread_data *td, struct io_u **io_u)
797 struct io_u *__io_u = *io_u;
798 enum fio_ddir ddir = acct_ddir(__io_u);
800 dprint(FD_IO, "requeue %p\n", __io_u);
807 io_u_set(td, __io_u, IO_U_F_FREE);
808 if ((__io_u->flags & IO_U_F_FLIGHT) && ddir_rw(ddir))
809 td->io_issues[ddir]--;
811 io_u_clear(td, __io_u, IO_U_F_FLIGHT);
812 if (__io_u->flags & IO_U_F_IN_CUR_DEPTH) {
814 assert(!(td->flags & TD_F_CHILD));
817 io_u_rpush(&td->io_u_requeues, __io_u);
818 td_io_u_free_notify(td);
823 static void __fill_io_u_zone(struct thread_data *td, struct io_u *io_u)
825 struct fio_file *f = io_u->file;
828 * See if it's time to switch to a new zone
830 if (td->zone_bytes >= td->o.zone_size && td->o.zone_skip) {
832 f->file_offset += td->o.zone_range + td->o.zone_skip;
835 * Wrap from the beginning, if we exceed the file size
837 if (f->file_offset >= f->real_file_size)
838 f->file_offset = f->real_file_size - f->file_offset;
839 f->last_pos[io_u->ddir] = f->file_offset;
840 td->io_skip_bytes += td->o.zone_skip;
844 * If zone_size > zone_range, then maintain the same zone until
845 * zone_bytes >= zone_size.
847 if (f->last_pos[io_u->ddir] >= (f->file_offset + td->o.zone_range)) {
848 dprint(FD_IO, "io_u maintain zone offset=%" PRIu64 "/last_pos=%" PRIu64 "\n",
849 f->file_offset, f->last_pos[io_u->ddir]);
850 f->last_pos[io_u->ddir] = f->file_offset;
854 * For random: if 'norandommap' is not set and zone_size > zone_range,
855 * map needs to be reset as it's done with zone_range everytime.
857 if ((td->zone_bytes % td->o.zone_range) == 0) {
858 fio_file_reset(td, f);
862 static int fill_io_u(struct thread_data *td, struct io_u *io_u)
866 if (td_ioengine_flagged(td, FIO_NOIO))
869 set_rw_ddir(td, io_u);
872 * fsync() or fdatasync() or trim etc, we are done
874 if (!ddir_rw(io_u->ddir))
878 * When file is zoned zone_range is always positive
880 if (td->o.zone_range) {
881 __fill_io_u_zone(td, io_u);
885 * No log, let the seq/rand engine retrieve the next buflen and
888 if (get_next_offset(td, io_u, &is_random)) {
889 dprint(FD_IO, "io_u %p, failed getting offset\n", io_u);
893 io_u->buflen = get_next_buflen(td, io_u, is_random);
895 dprint(FD_IO, "io_u %p, failed getting buflen\n", io_u);
899 if (io_u->offset + io_u->buflen > io_u->file->real_file_size) {
900 dprint(FD_IO, "io_u %p, off=0x%llx + len=0x%lx exceeds file size=0x%llx\n",
902 (unsigned long long) io_u->offset, io_u->buflen,
903 (unsigned long long) io_u->file->real_file_size);
908 * mark entry before potentially trimming io_u
910 if (td_random(td) && file_randommap(td, io_u->file))
911 mark_random_map(td, io_u);
914 dprint_io_u(io_u, "fill");
915 td->zone_bytes += io_u->buflen;
919 static void __io_u_mark_map(uint64_t *map, unsigned int nr)
948 void io_u_mark_submit(struct thread_data *td, unsigned int nr)
950 __io_u_mark_map(td->ts.io_u_submit, nr);
951 td->ts.total_submit++;
954 void io_u_mark_complete(struct thread_data *td, unsigned int nr)
956 __io_u_mark_map(td->ts.io_u_complete, nr);
957 td->ts.total_complete++;
960 void io_u_mark_depth(struct thread_data *td, unsigned int nr)
964 switch (td->cur_depth) {
986 td->ts.io_u_map[idx] += nr;
989 static void io_u_mark_lat_nsec(struct thread_data *td, unsigned long long nsec)
1026 assert(idx < FIO_IO_U_LAT_N_NR);
1027 td->ts.io_u_lat_n[idx]++;
1030 static void io_u_mark_lat_usec(struct thread_data *td, unsigned long long usec)
1034 assert(usec < 1000 && usec >= 1);
1067 assert(idx < FIO_IO_U_LAT_U_NR);
1068 td->ts.io_u_lat_u[idx]++;
1071 static void io_u_mark_lat_msec(struct thread_data *td, unsigned long long msec)
1114 assert(idx < FIO_IO_U_LAT_M_NR);
1115 td->ts.io_u_lat_m[idx]++;
1118 static void io_u_mark_latency(struct thread_data *td, unsigned long long nsec)
1121 io_u_mark_lat_nsec(td, nsec);
1122 else if (nsec < 1000000)
1123 io_u_mark_lat_usec(td, nsec / 1000);
1125 io_u_mark_lat_msec(td, nsec / 1000000);
1128 static unsigned int __get_next_fileno_rand(struct thread_data *td)
1130 unsigned long fileno;
1132 if (td->o.file_service_type == FIO_FSERVICE_RANDOM) {
1133 uint64_t frand_max = rand_max(&td->next_file_state);
1136 r = __rand(&td->next_file_state);
1137 return (unsigned int) ((double) td->o.nr_files
1138 * (r / (frand_max + 1.0)));
1141 if (td->o.file_service_type == FIO_FSERVICE_ZIPF)
1142 fileno = zipf_next(&td->next_file_zipf);
1143 else if (td->o.file_service_type == FIO_FSERVICE_PARETO)
1144 fileno = pareto_next(&td->next_file_zipf);
1145 else if (td->o.file_service_type == FIO_FSERVICE_GAUSS)
1146 fileno = gauss_next(&td->next_file_gauss);
1148 log_err("fio: bad file service type: %d\n", td->o.file_service_type);
1153 return fileno >> FIO_FSERVICE_SHIFT;
1157 * Get next file to service by choosing one at random
1159 static struct fio_file *get_next_file_rand(struct thread_data *td,
1160 enum fio_file_flags goodf,
1161 enum fio_file_flags badf)
1169 fno = __get_next_fileno_rand(td);
1172 if (fio_file_done(f))
1175 if (!fio_file_open(f)) {
1178 if (td->nr_open_files >= td->o.open_files)
1179 return ERR_PTR(-EBUSY);
1181 err = td_io_open_file(td, f);
1187 if ((!goodf || (f->flags & goodf)) && !(f->flags & badf)) {
1188 dprint(FD_FILE, "get_next_file_rand: %p\n", f);
1192 td_io_close_file(td, f);
1197 * Get next file to service by doing round robin between all available ones
1199 static struct fio_file *get_next_file_rr(struct thread_data *td, int goodf,
1202 unsigned int old_next_file = td->next_file;
1208 f = td->files[td->next_file];
1211 if (td->next_file >= td->o.nr_files)
1214 dprint(FD_FILE, "trying file %s %x\n", f->file_name, f->flags);
1215 if (fio_file_done(f)) {
1220 if (!fio_file_open(f)) {
1223 if (td->nr_open_files >= td->o.open_files)
1224 return ERR_PTR(-EBUSY);
1226 err = td_io_open_file(td, f);
1228 dprint(FD_FILE, "error %d on open of %s\n",
1236 dprint(FD_FILE, "goodf=%x, badf=%x, ff=%x\n", goodf, badf,
1238 if ((!goodf || (f->flags & goodf)) && !(f->flags & badf))
1242 td_io_close_file(td, f);
1245 } while (td->next_file != old_next_file);
1247 dprint(FD_FILE, "get_next_file_rr: %p\n", f);
1251 static struct fio_file *__get_next_file(struct thread_data *td)
1255 assert(td->o.nr_files <= td->files_index);
1257 if (td->nr_done_files >= td->o.nr_files) {
1258 dprint(FD_FILE, "get_next_file: nr_open=%d, nr_done=%d,"
1259 " nr_files=%d\n", td->nr_open_files,
1265 f = td->file_service_file;
1266 if (f && fio_file_open(f) && !fio_file_closing(f)) {
1267 if (td->o.file_service_type == FIO_FSERVICE_SEQ)
1269 if (td->file_service_left--)
1273 if (td->o.file_service_type == FIO_FSERVICE_RR ||
1274 td->o.file_service_type == FIO_FSERVICE_SEQ)
1275 f = get_next_file_rr(td, FIO_FILE_open, FIO_FILE_closing);
1277 f = get_next_file_rand(td, FIO_FILE_open, FIO_FILE_closing);
1282 td->file_service_file = f;
1283 td->file_service_left = td->file_service_nr - 1;
1286 dprint(FD_FILE, "get_next_file: %p [%s]\n", f, f->file_name);
1288 dprint(FD_FILE, "get_next_file: NULL\n");
1292 static struct fio_file *get_next_file(struct thread_data *td)
1294 return __get_next_file(td);
1297 static long set_io_u_file(struct thread_data *td, struct io_u *io_u)
1302 f = get_next_file(td);
1303 if (IS_ERR_OR_NULL(f))
1309 if (!fill_io_u(td, io_u))
1312 put_file_log(td, f);
1313 td_io_close_file(td, f);
1315 if (td->o.file_service_type & __FIO_FSERVICE_NONUNIFORM)
1316 fio_file_reset(td, f);
1318 fio_file_set_done(f);
1319 td->nr_done_files++;
1320 dprint(FD_FILE, "%s: is done (%d of %d)\n", f->file_name,
1321 td->nr_done_files, td->o.nr_files);
1328 static void lat_fatal(struct thread_data *td, struct io_completion_data *icd,
1329 unsigned long long tnsec, unsigned long long max_nsec)
1332 log_err("fio: latency of %llu nsec exceeds specified max (%llu nsec)\n", tnsec, max_nsec);
1333 td_verror(td, ETIMEDOUT, "max latency exceeded");
1334 icd->error = ETIMEDOUT;
1337 static void lat_new_cycle(struct thread_data *td)
1339 fio_gettime(&td->latency_ts, NULL);
1340 td->latency_ios = ddir_rw_sum(td->io_blocks);
1341 td->latency_failed = 0;
1345 * We had an IO outside the latency target. Reduce the queue depth. If we
1346 * are at QD=1, then it's time to give up.
1348 static bool __lat_target_failed(struct thread_data *td)
1350 if (td->latency_qd == 1)
1353 td->latency_qd_high = td->latency_qd;
1355 if (td->latency_qd == td->latency_qd_low)
1356 td->latency_qd_low--;
1358 td->latency_qd = (td->latency_qd + td->latency_qd_low) / 2;
1360 dprint(FD_RATE, "Ramped down: %d %d %d\n", td->latency_qd_low, td->latency_qd, td->latency_qd_high);
1363 * When we ramp QD down, quiesce existing IO to prevent
1364 * a storm of ramp downs due to pending higher depth.
1371 static bool lat_target_failed(struct thread_data *td)
1373 if (td->o.latency_percentile.u.f == 100.0)
1374 return __lat_target_failed(td);
1376 td->latency_failed++;
1380 void lat_target_init(struct thread_data *td)
1382 td->latency_end_run = 0;
1384 if (td->o.latency_target) {
1385 dprint(FD_RATE, "Latency target=%llu\n", td->o.latency_target);
1386 fio_gettime(&td->latency_ts, NULL);
1388 td->latency_qd_high = td->o.iodepth;
1389 td->latency_qd_low = 1;
1390 td->latency_ios = ddir_rw_sum(td->io_blocks);
1392 td->latency_qd = td->o.iodepth;
1395 void lat_target_reset(struct thread_data *td)
1397 if (!td->latency_end_run)
1398 lat_target_init(td);
1401 static void lat_target_success(struct thread_data *td)
1403 const unsigned int qd = td->latency_qd;
1404 struct thread_options *o = &td->o;
1406 td->latency_qd_low = td->latency_qd;
1409 * If we haven't failed yet, we double up to a failing value instead
1410 * of bisecting from highest possible queue depth. If we have set
1411 * a limit other than td->o.iodepth, bisect between that.
1413 if (td->latency_qd_high != o->iodepth)
1414 td->latency_qd = (td->latency_qd + td->latency_qd_high) / 2;
1416 td->latency_qd *= 2;
1418 if (td->latency_qd > o->iodepth)
1419 td->latency_qd = o->iodepth;
1421 dprint(FD_RATE, "Ramped up: %d %d %d\n", td->latency_qd_low, td->latency_qd, td->latency_qd_high);
1424 * Same as last one, we are done. Let it run a latency cycle, so
1425 * we get only the results from the targeted depth.
1427 if (td->latency_qd == qd) {
1428 if (td->latency_end_run) {
1429 dprint(FD_RATE, "We are done\n");
1432 dprint(FD_RATE, "Quiesce and final run\n");
1434 td->latency_end_run = 1;
1435 reset_all_stats(td);
1444 * Check if we can bump the queue depth
1446 void lat_target_check(struct thread_data *td)
1448 uint64_t usec_window;
1452 usec_window = utime_since_now(&td->latency_ts);
1453 if (usec_window < td->o.latency_window)
1456 ios = ddir_rw_sum(td->io_blocks) - td->latency_ios;
1457 success_ios = (double) (ios - td->latency_failed) / (double) ios;
1458 success_ios *= 100.0;
1460 dprint(FD_RATE, "Success rate: %.2f%% (target %.2f%%)\n", success_ios, td->o.latency_percentile.u.f);
1462 if (success_ios >= td->o.latency_percentile.u.f)
1463 lat_target_success(td);
1465 __lat_target_failed(td);
1469 * If latency target is enabled, we might be ramping up or down and not
1470 * using the full queue depth available.
1472 bool queue_full(const struct thread_data *td)
1474 const int qempty = io_u_qempty(&td->io_u_freelist);
1478 if (!td->o.latency_target)
1481 return td->cur_depth >= td->latency_qd;
1484 struct io_u *__get_io_u(struct thread_data *td)
1486 struct io_u *io_u = NULL;
1495 if (!io_u_rempty(&td->io_u_requeues))
1496 io_u = io_u_rpop(&td->io_u_requeues);
1497 else if (!queue_full(td)) {
1498 io_u = io_u_qpop(&td->io_u_freelist);
1503 io_u->end_io = NULL;
1507 assert(io_u->flags & IO_U_F_FREE);
1508 io_u_clear(td, io_u, IO_U_F_FREE | IO_U_F_NO_FILE_PUT |
1509 IO_U_F_TRIMMED | IO_U_F_BARRIER |
1513 io_u->acct_ddir = -1;
1515 assert(!(td->flags & TD_F_CHILD));
1516 io_u_set(td, io_u, IO_U_F_IN_CUR_DEPTH);
1518 } else if (td_async_processing(td)) {
1520 * We ran out, wait for async verify threads to finish and
1523 assert(!(td->flags & TD_F_CHILD));
1524 ret = pthread_cond_wait(&td->free_cond, &td->io_u_lock);
1533 static bool check_get_trim(struct thread_data *td, struct io_u *io_u)
1535 if (!(td->flags & TD_F_TRIM_BACKLOG))
1537 if (!td->trim_entries)
1540 if (td->trim_batch) {
1542 if (get_next_trim(td, io_u))
1544 } else if (!(td->io_hist_len % td->o.trim_backlog) &&
1545 td->last_ddir != DDIR_READ) {
1546 td->trim_batch = td->o.trim_batch;
1547 if (!td->trim_batch)
1548 td->trim_batch = td->o.trim_backlog;
1549 if (get_next_trim(td, io_u))
1556 static bool check_get_verify(struct thread_data *td, struct io_u *io_u)
1558 if (!(td->flags & TD_F_VER_BACKLOG))
1561 if (td->io_hist_len) {
1564 if (td->verify_batch)
1566 else if (!(td->io_hist_len % td->o.verify_backlog) &&
1567 td->last_ddir != DDIR_READ) {
1568 td->verify_batch = td->o.verify_batch;
1569 if (!td->verify_batch)
1570 td->verify_batch = td->o.verify_backlog;
1574 if (get_verify && !get_next_verify(td, io_u)) {
1584 * Fill offset and start time into the buffer content, to prevent too
1585 * easy compressible data for simple de-dupe attempts. Do this for every
1586 * 512b block in the range, since that should be the smallest block size
1587 * we can expect from a device.
1589 static void small_content_scramble(struct io_u *io_u)
1591 unsigned int i, nr_blocks = io_u->buflen >> 9;
1592 unsigned int offset;
1593 uint64_t boffset, *iptr;
1600 boffset = io_u->offset;
1602 if (io_u->buf_filled_len)
1603 io_u->buf_filled_len = 0;
1606 * Generate random index between 0..7. We do chunks of 512b, if
1607 * we assume a cacheline is 64 bytes, then we have 8 of those.
1608 * Scramble content within the blocks in the same cacheline to
1611 offset = (io_u->start_time.tv_nsec ^ boffset) & 7;
1613 for (i = 0; i < nr_blocks; i++) {
1615 * Fill offset into start of cacheline, time into end
1618 iptr = (void *) p + (offset << 6);
1621 iptr = (void *) p + 64 - 2 * sizeof(uint64_t);
1622 iptr[0] = io_u->start_time.tv_sec;
1623 iptr[1] = io_u->start_time.tv_nsec;
1631 * Return an io_u to be processed. Gets a buflen and offset, sets direction,
1632 * etc. The returned io_u is fully ready to be prepped, populated and submitted.
1634 struct io_u *get_io_u(struct thread_data *td)
1638 int do_scramble = 0;
1641 io_u = __get_io_u(td);
1643 dprint(FD_IO, "__get_io_u failed\n");
1647 if (check_get_verify(td, io_u))
1649 if (check_get_trim(td, io_u))
1653 * from a requeue, io_u already setup
1659 * If using an iolog, grab next piece if any available.
1661 if (td->flags & TD_F_READ_IOLOG) {
1662 if (read_iolog_get(td, io_u))
1664 } else if (set_io_u_file(td, io_u)) {
1666 dprint(FD_IO, "io_u %p, setting file failed\n", io_u);
1672 dprint(FD_IO, "io_u %p, setting file failed\n", io_u);
1676 assert(fio_file_open(f));
1678 if (ddir_rw(io_u->ddir)) {
1679 if (!io_u->buflen && !td_ioengine_flagged(td, FIO_NOIO)) {
1680 dprint(FD_IO, "get_io_u: zero buflen on %p\n", io_u);
1684 f->last_start[io_u->ddir] = io_u->offset;
1685 f->last_pos[io_u->ddir] = io_u->offset + io_u->buflen;
1687 if (io_u->ddir == DDIR_WRITE) {
1688 if (td->flags & TD_F_REFILL_BUFFERS) {
1689 io_u_fill_buffer(td, io_u,
1690 td->o.min_bs[DDIR_WRITE],
1692 } else if ((td->flags & TD_F_SCRAMBLE_BUFFERS) &&
1693 !(td->flags & TD_F_COMPRESS) &&
1694 !(td->flags & TD_F_DO_VERIFY))
1696 } else if (io_u->ddir == DDIR_READ) {
1698 * Reset the buf_filled parameters so next time if the
1699 * buffer is used for writes it is refilled.
1701 io_u->buf_filled_len = 0;
1706 * Set io data pointers.
1708 io_u->xfer_buf = io_u->buf;
1709 io_u->xfer_buflen = io_u->buflen;
1713 if (!td_io_prep(td, io_u)) {
1714 if (!td->o.disable_lat)
1715 fio_gettime(&io_u->start_time, NULL);
1718 small_content_scramble(io_u);
1723 dprint(FD_IO, "get_io_u failed\n");
1725 return ERR_PTR(ret);
1728 static void __io_u_log_error(struct thread_data *td, struct io_u *io_u)
1730 enum error_type_bit eb = td_error_type(io_u->ddir, io_u->error);
1732 if (td_non_fatal_error(td, eb, io_u->error) && !td->o.error_dump)
1735 log_err("fio: io_u error%s%s: %s: %s offset=%llu, buflen=%lu\n",
1736 io_u->file ? " on file " : "",
1737 io_u->file ? io_u->file->file_name : "",
1738 strerror(io_u->error),
1739 io_ddir_name(io_u->ddir),
1740 io_u->offset, io_u->xfer_buflen);
1742 if (td->io_ops->errdetails) {
1743 char *err = td->io_ops->errdetails(io_u);
1745 log_err("fio: %s\n", err);
1750 td_verror(td, io_u->error, "io_u error");
1753 void io_u_log_error(struct thread_data *td, struct io_u *io_u)
1755 __io_u_log_error(td, io_u);
1757 __io_u_log_error(td->parent, io_u);
1760 static inline bool gtod_reduce(struct thread_data *td)
1762 return (td->o.disable_clat && td->o.disable_slat && td->o.disable_bw)
1763 || td->o.gtod_reduce;
1766 static void account_io_completion(struct thread_data *td, struct io_u *io_u,
1767 struct io_completion_data *icd,
1768 const enum fio_ddir idx, unsigned int bytes)
1770 const int no_reduce = !gtod_reduce(td);
1771 unsigned long long llnsec = 0;
1776 if (!td->o.stats || td_ioengine_flagged(td, FIO_NOSTATS))
1780 llnsec = ntime_since(&io_u->issue_time, &icd->time);
1782 if (!td->o.disable_lat) {
1783 unsigned long long tnsec;
1785 tnsec = ntime_since(&io_u->start_time, &icd->time);
1786 add_lat_sample(td, idx, tnsec, bytes, io_u->offset);
1788 if (td->flags & TD_F_PROFILE_OPS) {
1789 struct prof_io_ops *ops = &td->prof_io_ops;
1792 icd->error = ops->io_u_lat(td, tnsec);
1795 if (td->o.max_latency && tnsec > td->o.max_latency)
1796 lat_fatal(td, icd, tnsec, td->o.max_latency);
1797 if (td->o.latency_target && tnsec > td->o.latency_target) {
1798 if (lat_target_failed(td))
1799 lat_fatal(td, icd, tnsec, td->o.latency_target);
1804 if (!td->o.disable_clat) {
1805 add_clat_sample(td, idx, llnsec, bytes, io_u->offset);
1806 io_u_mark_latency(td, llnsec);
1809 if (!td->o.disable_bw && per_unit_log(td->bw_log))
1810 add_bw_sample(td, io_u, bytes, llnsec);
1812 if (no_reduce && per_unit_log(td->iops_log))
1813 add_iops_sample(td, io_u, bytes);
1814 } else if (ddir_sync(idx) && !td->o.disable_clat)
1815 add_sync_clat_sample(&td->ts, llnsec);
1817 if (td->ts.nr_block_infos && io_u->ddir == DDIR_TRIM) {
1818 uint32_t *info = io_u_block_info(td, io_u);
1819 if (BLOCK_INFO_STATE(*info) < BLOCK_STATE_TRIM_FAILURE) {
1820 if (io_u->ddir == DDIR_TRIM) {
1821 *info = BLOCK_INFO(BLOCK_STATE_TRIMMED,
1822 BLOCK_INFO_TRIMS(*info) + 1);
1823 } else if (io_u->ddir == DDIR_WRITE) {
1824 *info = BLOCK_INFO_SET_STATE(BLOCK_STATE_WRITTEN,
1831 static void file_log_write_comp(const struct thread_data *td, struct fio_file *f,
1832 uint64_t offset, unsigned int bytes)
1839 if (f->first_write == -1ULL || offset < f->first_write)
1840 f->first_write = offset;
1841 if (f->last_write == -1ULL || ((offset + bytes) > f->last_write))
1842 f->last_write = offset + bytes;
1844 if (!f->last_write_comp)
1847 idx = f->last_write_idx++;
1848 f->last_write_comp[idx] = offset;
1849 if (f->last_write_idx == td->o.iodepth)
1850 f->last_write_idx = 0;
1853 static bool should_account(struct thread_data *td)
1855 return ramp_time_over(td) && (td->runstate == TD_RUNNING ||
1856 td->runstate == TD_VERIFYING);
1859 static void io_completed(struct thread_data *td, struct io_u **io_u_ptr,
1860 struct io_completion_data *icd)
1862 struct io_u *io_u = *io_u_ptr;
1863 enum fio_ddir ddir = io_u->ddir;
1864 struct fio_file *f = io_u->file;
1866 dprint_io_u(io_u, "complete");
1868 assert(io_u->flags & IO_U_F_FLIGHT);
1869 io_u_clear(td, io_u, IO_U_F_FLIGHT | IO_U_F_BUSY_OK);
1872 * Mark IO ok to verify
1876 * Remove errored entry from the verification list
1879 unlog_io_piece(td, io_u);
1881 io_u->ipo->flags &= ~IP_F_IN_FLIGHT;
1886 if (ddir_sync(ddir)) {
1887 td->last_was_sync = true;
1889 f->first_write = -1ULL;
1890 f->last_write = -1ULL;
1892 if (should_account(td))
1893 account_io_completion(td, io_u, icd, ddir, io_u->buflen);
1897 td->last_was_sync = false;
1898 td->last_ddir = ddir;
1900 if (!io_u->error && ddir_rw(ddir)) {
1901 unsigned int bytes = io_u->buflen - io_u->resid;
1904 td->io_blocks[ddir]++;
1905 td->io_bytes[ddir] += bytes;
1907 if (!(io_u->flags & IO_U_F_VER_LIST)) {
1908 td->this_io_blocks[ddir]++;
1909 td->this_io_bytes[ddir] += bytes;
1912 if (ddir == DDIR_WRITE)
1913 file_log_write_comp(td, f, io_u->offset, bytes);
1915 if (should_account(td))
1916 account_io_completion(td, io_u, icd, ddir, bytes);
1918 icd->bytes_done[ddir] += bytes;
1921 ret = io_u->end_io(td, io_u_ptr);
1923 if (ret && !icd->error)
1926 } else if (io_u->error) {
1927 icd->error = io_u->error;
1928 io_u_log_error(td, io_u);
1931 enum error_type_bit eb = td_error_type(ddir, icd->error);
1933 if (!td_non_fatal_error(td, eb, icd->error))
1937 * If there is a non_fatal error, then add to the error count
1938 * and clear all the errors.
1940 update_error_count(td, icd->error);
1948 static void init_icd(struct thread_data *td, struct io_completion_data *icd,
1953 if (!gtod_reduce(td))
1954 fio_gettime(&icd->time, NULL);
1959 for (ddir = 0; ddir < DDIR_RWDIR_CNT; ddir++)
1960 icd->bytes_done[ddir] = 0;
1963 static void ios_completed(struct thread_data *td,
1964 struct io_completion_data *icd)
1969 for (i = 0; i < icd->nr; i++) {
1970 io_u = td->io_ops->event(td, i);
1972 io_completed(td, &io_u, icd);
1980 * Complete a single io_u for the sync engines.
1982 int io_u_sync_complete(struct thread_data *td, struct io_u *io_u)
1984 struct io_completion_data icd;
1987 init_icd(td, &icd, 1);
1988 io_completed(td, &io_u, &icd);
1994 td_verror(td, icd.error, "io_u_sync_complete");
1998 for (ddir = 0; ddir < DDIR_RWDIR_CNT; ddir++)
1999 td->bytes_done[ddir] += icd.bytes_done[ddir];
2005 * Called to complete min_events number of io for the async engines.
2007 int io_u_queued_complete(struct thread_data *td, int min_evts)
2009 struct io_completion_data icd;
2010 struct timespec *tvp = NULL;
2012 struct timespec ts = { .tv_sec = 0, .tv_nsec = 0, };
2014 dprint(FD_IO, "io_u_queued_complete: min=%d\n", min_evts);
2018 else if (min_evts > td->cur_depth)
2019 min_evts = td->cur_depth;
2021 /* No worries, td_io_getevents fixes min and max if they are
2022 * set incorrectly */
2023 ret = td_io_getevents(td, min_evts, td->o.iodepth_batch_complete_max, tvp);
2025 td_verror(td, -ret, "td_io_getevents");
2030 init_icd(td, &icd, ret);
2031 ios_completed(td, &icd);
2033 td_verror(td, icd.error, "io_u_queued_complete");
2037 for (ddir = 0; ddir < DDIR_RWDIR_CNT; ddir++)
2038 td->bytes_done[ddir] += icd.bytes_done[ddir];
2044 * Call when io_u is really queued, to update the submission latency.
2046 void io_u_queued(struct thread_data *td, struct io_u *io_u)
2048 if (!td->o.disable_slat && ramp_time_over(td) && td->o.stats) {
2049 unsigned long slat_time;
2051 slat_time = ntime_since(&io_u->start_time, &io_u->issue_time);
2056 add_slat_sample(td, io_u->ddir, slat_time, io_u->xfer_buflen,
2062 * See if we should reuse the last seed, if dedupe is enabled
2064 static struct frand_state *get_buf_state(struct thread_data *td)
2068 if (!td->o.dedupe_percentage)
2069 return &td->buf_state;
2070 else if (td->o.dedupe_percentage == 100) {
2071 frand_copy(&td->buf_state_prev, &td->buf_state);
2072 return &td->buf_state;
2075 v = rand32_between(&td->dedupe_state, 1, 100);
2077 if (v <= td->o.dedupe_percentage)
2078 return &td->buf_state_prev;
2080 return &td->buf_state;
2083 static void save_buf_state(struct thread_data *td, struct frand_state *rs)
2085 if (td->o.dedupe_percentage == 100)
2086 frand_copy(rs, &td->buf_state_prev);
2087 else if (rs == &td->buf_state)
2088 frand_copy(&td->buf_state_prev, rs);
2091 void fill_io_buffer(struct thread_data *td, void *buf, unsigned int min_write,
2092 unsigned int max_bs)
2094 struct thread_options *o = &td->o;
2096 if (o->mem_type == MEM_CUDA_MALLOC)
2099 if (o->compress_percentage || o->dedupe_percentage) {
2100 unsigned int perc = td->o.compress_percentage;
2101 struct frand_state *rs;
2102 unsigned int left = max_bs;
2103 unsigned int this_write;
2106 rs = get_buf_state(td);
2108 min_write = min(min_write, left);
2111 this_write = min_not_zero(min_write,
2112 td->o.compress_chunk);
2114 fill_random_buf_percentage(rs, buf, perc,
2115 this_write, this_write,
2117 o->buffer_pattern_bytes);
2119 fill_random_buf(rs, buf, min_write);
2120 this_write = min_write;
2125 save_buf_state(td, rs);
2127 } else if (o->buffer_pattern_bytes)
2128 fill_buffer_pattern(td, buf, max_bs);
2129 else if (o->zero_buffers)
2130 memset(buf, 0, max_bs);
2132 fill_random_buf(get_buf_state(td), buf, max_bs);
2136 * "randomly" fill the buffer contents
2138 void io_u_fill_buffer(struct thread_data *td, struct io_u *io_u,
2139 unsigned int min_write, unsigned int max_bs)
2141 io_u->buf_filled_len = 0;
2142 fill_io_buffer(td, io_u->buf, min_write, max_bs);
2145 static int do_sync_file_range(const struct thread_data *td,
2148 off64_t offset, nbytes;
2150 offset = f->first_write;
2151 nbytes = f->last_write - f->first_write;
2156 return sync_file_range(f->fd, offset, nbytes, td->o.sync_file_range);
2159 int do_io_u_sync(const struct thread_data *td, struct io_u *io_u)
2163 if (io_u->ddir == DDIR_SYNC) {
2164 ret = fsync(io_u->file->fd);
2165 } else if (io_u->ddir == DDIR_DATASYNC) {
2166 #ifdef CONFIG_FDATASYNC
2167 ret = fdatasync(io_u->file->fd);
2169 ret = io_u->xfer_buflen;
2170 io_u->error = EINVAL;
2172 } else if (io_u->ddir == DDIR_SYNC_FILE_RANGE)
2173 ret = do_sync_file_range(td, io_u->file);
2175 ret = io_u->xfer_buflen;
2176 io_u->error = EINVAL;
2180 io_u->error = errno;
2185 int do_io_u_trim(const struct thread_data *td, struct io_u *io_u)
2187 #ifndef FIO_HAVE_TRIM
2188 io_u->error = EINVAL;
2191 struct fio_file *f = io_u->file;
2194 ret = os_trim(f, io_u->offset, io_u->xfer_buflen);
2196 return io_u->xfer_buflen;