13 #include "lib/axmap.h"
18 struct io_completion_data {
21 int error; /* output */
22 uint64_t bytes_done[DDIR_RWDIR_CNT]; /* output */
23 struct timespec time; /* output */
27 * The ->io_axmap contains a map of blocks we have or have not done io
28 * to yet. Used to make sure we cover the entire range in a fair fashion.
30 static bool random_map_free(struct fio_file *f, const uint64_t block)
32 return !axmap_isset(f->io_axmap, block);
36 * Mark a given offset as used in the map.
38 static void mark_random_map(struct thread_data *td, struct io_u *io_u)
40 unsigned int min_bs = td->o.min_bs[io_u->ddir];
41 struct fio_file *f = io_u->file;
42 unsigned int nr_blocks;
45 block = (io_u->offset - f->file_offset) / (uint64_t) min_bs;
46 nr_blocks = (io_u->buflen + min_bs - 1) / min_bs;
48 if (!(io_u->flags & IO_U_F_BUSY_OK))
49 nr_blocks = axmap_set_nr(f->io_axmap, block, nr_blocks);
51 if ((nr_blocks * min_bs) < io_u->buflen)
52 io_u->buflen = nr_blocks * min_bs;
55 static uint64_t last_block(struct thread_data *td, struct fio_file *f,
61 assert(ddir_rw(ddir));
64 * Hmm, should we make sure that ->io_size <= ->real_file_size?
65 * -> not for now since there is code assuming it could go either.
67 max_size = f->io_size;
68 if (max_size > f->real_file_size)
69 max_size = f->real_file_size;
72 max_size = td->o.zone_range;
74 if (td->o.min_bs[ddir] > td->o.ba[ddir])
75 max_size -= td->o.min_bs[ddir] - td->o.ba[ddir];
77 max_blocks = max_size / (uint64_t) td->o.ba[ddir];
85 struct flist_head list;
89 static int __get_next_rand_offset(struct thread_data *td, struct fio_file *f,
90 enum fio_ddir ddir, uint64_t *b,
95 if (td->o.random_generator == FIO_RAND_GEN_TAUSWORTHE ||
96 td->o.random_generator == FIO_RAND_GEN_TAUSWORTHE64) {
98 r = __rand(&td->random_state);
100 dprint(FD_RANDOM, "off rand %llu\n", (unsigned long long) r);
102 *b = lastb * (r / (rand_max(&td->random_state) + 1.0));
106 assert(fio_file_lfsr(f));
108 if (lfsr_next(&f->lfsr, &off))
115 * if we are not maintaining a random map, we are done.
117 if (!file_randommap(td, f))
121 * calculate map offset and check if it's free
123 if (random_map_free(f, *b))
126 dprint(FD_RANDOM, "get_next_rand_offset: offset %llu busy\n",
127 (unsigned long long) *b);
129 *b = axmap_next_free(f->io_axmap, *b);
130 if (*b == (uint64_t) -1ULL)
136 static int __get_next_rand_offset_zipf(struct thread_data *td,
137 struct fio_file *f, enum fio_ddir ddir,
140 *b = zipf_next(&f->zipf);
144 static int __get_next_rand_offset_pareto(struct thread_data *td,
145 struct fio_file *f, enum fio_ddir ddir,
148 *b = pareto_next(&f->zipf);
152 static int __get_next_rand_offset_gauss(struct thread_data *td,
153 struct fio_file *f, enum fio_ddir ddir,
156 *b = gauss_next(&f->gauss);
160 static int __get_next_rand_offset_zoned_abs(struct thread_data *td,
162 enum fio_ddir ddir, uint64_t *b)
164 struct zone_split_index *zsi;
165 uint64_t lastb, send, stotal;
168 lastb = last_block(td, f, ddir);
172 if (!td->o.zone_split_nr[ddir]) {
174 return __get_next_rand_offset(td, f, ddir, b, lastb);
178 * Generate a value, v, between 1 and 100, both inclusive
180 v = rand32_between(&td->zone_state, 1, 100);
183 * Find our generated table. 'send' is the end block of this zone,
184 * 'stotal' is our start offset.
186 zsi = &td->zone_state_index[ddir][v - 1];
187 stotal = zsi->size_prev / td->o.ba[ddir];
188 send = zsi->size / td->o.ba[ddir];
191 * Should never happen
194 if (!fio_did_warn(FIO_WARN_ZONED_BUG))
195 log_err("fio: bug in zoned generation\n");
197 } else if (send > lastb) {
199 * This happens if the user specifies ranges that exceed
200 * the file/device size. We can't handle that gracefully,
203 log_err("fio: zoned_abs sizes exceed file size\n");
208 * Generate index from 0..send-stotal
210 if (__get_next_rand_offset(td, f, ddir, b, send - stotal) == 1)
217 static int __get_next_rand_offset_zoned(struct thread_data *td,
218 struct fio_file *f, enum fio_ddir ddir,
221 unsigned int v, send, stotal;
222 uint64_t offset, lastb;
223 struct zone_split_index *zsi;
225 lastb = last_block(td, f, ddir);
229 if (!td->o.zone_split_nr[ddir]) {
231 return __get_next_rand_offset(td, f, ddir, b, lastb);
235 * Generate a value, v, between 1 and 100, both inclusive
237 v = rand32_between(&td->zone_state, 1, 100);
239 zsi = &td->zone_state_index[ddir][v - 1];
240 stotal = zsi->size_perc_prev;
241 send = zsi->size_perc;
244 * Should never happen
247 if (!fio_did_warn(FIO_WARN_ZONED_BUG))
248 log_err("fio: bug in zoned generation\n");
253 * 'send' is some percentage below or equal to 100 that
254 * marks the end of the current IO range. 'stotal' marks
255 * the start, in percent.
258 offset = stotal * lastb / 100ULL;
262 lastb = lastb * (send - stotal) / 100ULL;
265 * Generate index from 0..send-of-lastb
267 if (__get_next_rand_offset(td, f, ddir, b, lastb) == 1)
271 * Add our start offset, if any
279 static int flist_cmp(void *data, struct flist_head *a, struct flist_head *b)
281 struct rand_off *r1 = flist_entry(a, struct rand_off, list);
282 struct rand_off *r2 = flist_entry(b, struct rand_off, list);
284 return r1->off - r2->off;
287 static int get_off_from_method(struct thread_data *td, struct fio_file *f,
288 enum fio_ddir ddir, uint64_t *b)
290 if (td->o.random_distribution == FIO_RAND_DIST_RANDOM) {
293 lastb = last_block(td, f, ddir);
297 return __get_next_rand_offset(td, f, ddir, b, lastb);
298 } else if (td->o.random_distribution == FIO_RAND_DIST_ZIPF)
299 return __get_next_rand_offset_zipf(td, f, ddir, b);
300 else if (td->o.random_distribution == FIO_RAND_DIST_PARETO)
301 return __get_next_rand_offset_pareto(td, f, ddir, b);
302 else if (td->o.random_distribution == FIO_RAND_DIST_GAUSS)
303 return __get_next_rand_offset_gauss(td, f, ddir, b);
304 else if (td->o.random_distribution == FIO_RAND_DIST_ZONED)
305 return __get_next_rand_offset_zoned(td, f, ddir, b);
306 else if (td->o.random_distribution == FIO_RAND_DIST_ZONED_ABS)
307 return __get_next_rand_offset_zoned_abs(td, f, ddir, b);
309 log_err("fio: unknown random distribution: %d\n", td->o.random_distribution);
314 * Sort the reads for a verify phase in batches of verifysort_nr, if
317 static inline bool should_sort_io(struct thread_data *td)
319 if (!td->o.verifysort_nr || !td->o.do_verify)
323 if (td->runstate != TD_VERIFYING)
325 if (td->o.random_generator == FIO_RAND_GEN_TAUSWORTHE ||
326 td->o.random_generator == FIO_RAND_GEN_TAUSWORTHE64)
332 static bool should_do_random(struct thread_data *td, enum fio_ddir ddir)
336 if (td->o.perc_rand[ddir] == 100)
339 v = rand32_between(&td->seq_rand_state[ddir], 1, 100);
341 return v <= td->o.perc_rand[ddir];
344 static int get_next_rand_offset(struct thread_data *td, struct fio_file *f,
345 enum fio_ddir ddir, uint64_t *b)
350 if (!should_sort_io(td))
351 return get_off_from_method(td, f, ddir, b);
353 if (!flist_empty(&td->next_rand_list)) {
355 r = flist_first_entry(&td->next_rand_list, struct rand_off, list);
362 for (i = 0; i < td->o.verifysort_nr; i++) {
363 r = malloc(sizeof(*r));
365 ret = get_off_from_method(td, f, ddir, &r->off);
371 flist_add(&r->list, &td->next_rand_list);
377 assert(!flist_empty(&td->next_rand_list));
378 flist_sort(NULL, &td->next_rand_list, flist_cmp);
382 static void loop_cache_invalidate(struct thread_data *td, struct fio_file *f)
384 struct thread_options *o = &td->o;
386 if (o->invalidate_cache && !o->odirect) {
389 ret = file_invalidate_cache(td, f);
393 static int get_next_rand_block(struct thread_data *td, struct fio_file *f,
394 enum fio_ddir ddir, uint64_t *b)
396 if (!get_next_rand_offset(td, f, ddir, b))
399 if (td->o.time_based ||
400 (td->o.file_service_type & __FIO_FSERVICE_NONUNIFORM)) {
401 fio_file_reset(td, f);
402 if (!get_next_rand_offset(td, f, ddir, b))
404 loop_cache_invalidate(td, f);
407 dprint(FD_IO, "%s: rand offset failed, last=%llu, size=%llu\n",
408 f->file_name, (unsigned long long) f->last_pos[ddir],
409 (unsigned long long) f->real_file_size);
413 static int get_next_seq_offset(struct thread_data *td, struct fio_file *f,
414 enum fio_ddir ddir, uint64_t *offset)
416 struct thread_options *o = &td->o;
418 assert(ddir_rw(ddir));
421 * If we reach the end for a time based run, reset us back to 0
422 * and invalidate the cache, if we need to.
424 if (f->last_pos[ddir] >= f->io_size + get_start_offset(td, f) &&
426 f->last_pos[ddir] = f->file_offset;
427 loop_cache_invalidate(td, f);
430 if (f->last_pos[ddir] < f->real_file_size) {
433 if (f->last_pos[ddir] == f->file_offset && o->ddir_seq_add < 0) {
434 if (f->real_file_size > f->io_size)
435 f->last_pos[ddir] = f->io_size;
437 f->last_pos[ddir] = f->real_file_size;
440 pos = f->last_pos[ddir] - f->file_offset;
441 if (pos && o->ddir_seq_add) {
442 pos += o->ddir_seq_add;
445 * If we reach beyond the end of the file
446 * with holed IO, wrap around to the
447 * beginning again. If we're doing backwards IO,
450 if (pos >= f->real_file_size) {
451 if (o->ddir_seq_add > 0)
452 pos = f->file_offset;
454 if (f->real_file_size > f->io_size)
457 pos = f->real_file_size;
459 pos += o->ddir_seq_add;
471 static int get_next_block(struct thread_data *td, struct io_u *io_u,
472 enum fio_ddir ddir, int rw_seq,
473 unsigned int *is_random)
475 struct fio_file *f = io_u->file;
479 assert(ddir_rw(ddir));
485 if (should_do_random(td, ddir)) {
486 ret = get_next_rand_block(td, f, ddir, &b);
490 io_u_set(td, io_u, IO_U_F_BUSY_OK);
491 ret = get_next_seq_offset(td, f, ddir, &offset);
493 ret = get_next_rand_block(td, f, ddir, &b);
497 ret = get_next_seq_offset(td, f, ddir, &offset);
500 io_u_set(td, io_u, IO_U_F_BUSY_OK);
503 if (td->o.rw_seq == RW_SEQ_SEQ) {
504 ret = get_next_seq_offset(td, f, ddir, &offset);
506 ret = get_next_rand_block(td, f, ddir, &b);
509 } else if (td->o.rw_seq == RW_SEQ_IDENT) {
510 if (f->last_start[ddir] != -1ULL)
511 offset = f->last_start[ddir] - f->file_offset;
516 log_err("fio: unknown rw_seq=%d\n", td->o.rw_seq);
523 io_u->offset = offset;
525 io_u->offset = b * td->o.ba[ddir];
527 log_err("fio: bug in offset generation: offset=%llu, b=%llu\n", (unsigned long long) offset, (unsigned long long) b);
536 * For random io, generate a random new block and see if it's used. Repeat
537 * until we find a free one. For sequential io, just return the end of
538 * the last io issued.
540 static int __get_next_offset(struct thread_data *td, struct io_u *io_u,
541 unsigned int *is_random)
543 struct fio_file *f = io_u->file;
544 enum fio_ddir ddir = io_u->ddir;
547 assert(ddir_rw(ddir));
549 if (td->o.ddir_seq_nr && !--td->ddir_seq_nr) {
551 td->ddir_seq_nr = td->o.ddir_seq_nr;
554 if (get_next_block(td, io_u, ddir, rw_seq_hit, is_random))
557 if (io_u->offset >= f->io_size) {
558 dprint(FD_IO, "get_next_offset: offset %llu >= io_size %llu\n",
559 (unsigned long long) io_u->offset,
560 (unsigned long long) f->io_size);
564 io_u->offset += f->file_offset;
565 if (io_u->offset >= f->real_file_size) {
566 dprint(FD_IO, "get_next_offset: offset %llu >= size %llu\n",
567 (unsigned long long) io_u->offset,
568 (unsigned long long) f->real_file_size);
575 static int get_next_offset(struct thread_data *td, struct io_u *io_u,
576 unsigned int *is_random)
578 return __get_next_offset(td, io_u, is_random);
581 static inline bool io_u_fits(struct thread_data *td, struct io_u *io_u,
584 struct fio_file *f = io_u->file;
586 return io_u->offset + buflen <= f->io_size + get_start_offset(td, f);
589 static unsigned int __get_next_buflen(struct thread_data *td, struct io_u *io_u,
590 unsigned int is_random)
592 int ddir = io_u->ddir;
593 unsigned int buflen = 0;
594 unsigned int minbs, maxbs;
595 uint64_t frand_max, r;
598 assert(ddir_rw(ddir));
600 if (td->o.bs_is_seq_rand)
601 ddir = is_random ? DDIR_WRITE: DDIR_READ;
603 minbs = td->o.min_bs[ddir];
604 maxbs = td->o.max_bs[ddir];
610 * If we can't satisfy the min block size from here, then fail
612 if (!io_u_fits(td, io_u, minbs))
615 frand_max = rand_max(&td->bsrange_state[ddir]);
617 r = __rand(&td->bsrange_state[ddir]);
619 if (!td->o.bssplit_nr[ddir]) {
620 buflen = 1 + (unsigned int) ((double) maxbs *
621 (r / (frand_max + 1.0)));
628 for (i = 0; i < td->o.bssplit_nr[ddir]; i++) {
629 struct bssplit *bsp = &td->o.bssplit[ddir][i];
635 if ((r / perc <= frand_max / 100ULL) &&
636 io_u_fits(td, io_u, buflen))
641 power_2 = is_power_of_2(minbs);
642 if (!td->o.bs_unaligned && power_2)
643 buflen &= ~(minbs - 1);
644 else if (!td->o.bs_unaligned && !power_2)
645 buflen -= buflen % minbs;
646 } while (!io_u_fits(td, io_u, buflen));
651 static unsigned int get_next_buflen(struct thread_data *td, struct io_u *io_u,
652 unsigned int is_random)
654 return __get_next_buflen(td, io_u, is_random);
657 static void set_rwmix_bytes(struct thread_data *td)
662 * we do time or byte based switch. this is needed because
663 * buffered writes may issue a lot quicker than they complete,
664 * whereas reads do not.
666 diff = td->o.rwmix[td->rwmix_ddir ^ 1];
667 td->rwmix_issues = (td->io_issues[td->rwmix_ddir] * diff) / 100;
670 static inline enum fio_ddir get_rand_ddir(struct thread_data *td)
674 v = rand32_between(&td->rwmix_state, 1, 100);
676 if (v <= td->o.rwmix[DDIR_READ])
682 int io_u_quiesce(struct thread_data *td)
687 * We are going to sleep, ensure that we flush anything pending as
688 * not to skew our latency numbers.
690 * Changed to only monitor 'in flight' requests here instead of the
691 * td->cur_depth, b/c td->cur_depth does not accurately represent
692 * io's that have been actually submitted to an async engine,
693 * and cur_depth is meaningless for sync engines.
695 if (td->io_u_queued || td->cur_depth) {
698 ret = td_io_commit(td);
701 while (td->io_u_in_flight) {
704 ret = io_u_queued_complete(td, 1);
709 if (td->flags & TD_F_REGROW_LOGS)
715 static enum fio_ddir rate_ddir(struct thread_data *td, enum fio_ddir ddir)
717 enum fio_ddir odir = ddir ^ 1;
721 assert(ddir_rw(ddir));
722 now = utime_since_now(&td->start);
725 * if rate_next_io_time is in the past, need to catch up to rate
727 if (td->rate_next_io_time[ddir] <= now)
731 * We are ahead of rate in this direction. See if we
734 if (td_rw(td) && td->o.rwmix[odir]) {
736 * Other direction is behind rate, switch
738 if (td->rate_next_io_time[odir] <= now)
742 * Both directions are ahead of rate. sleep the min,
743 * switch if necessary
745 if (td->rate_next_io_time[ddir] <=
746 td->rate_next_io_time[odir]) {
747 usec = td->rate_next_io_time[ddir] - now;
749 usec = td->rate_next_io_time[odir] - now;
753 usec = td->rate_next_io_time[ddir] - now;
755 if (td->o.io_submit_mode == IO_MODE_INLINE)
758 usec_sleep(td, usec);
763 * Return the data direction for the next io_u. If the job is a
764 * mixed read/write workload, check the rwmix cycle and switch if
767 static enum fio_ddir get_rw_ddir(struct thread_data *td)
772 * See if it's time to fsync/fdatasync/sync_file_range first,
773 * and if not then move on to check regular I/Os.
775 if (should_fsync(td)) {
776 if (td->o.fsync_blocks && td->io_issues[DDIR_WRITE] &&
777 !(td->io_issues[DDIR_WRITE] % td->o.fsync_blocks))
780 if (td->o.fdatasync_blocks && td->io_issues[DDIR_WRITE] &&
781 !(td->io_issues[DDIR_WRITE] % td->o.fdatasync_blocks))
782 return DDIR_DATASYNC;
784 if (td->sync_file_range_nr && td->io_issues[DDIR_WRITE] &&
785 !(td->io_issues[DDIR_WRITE] % td->sync_file_range_nr))
786 return DDIR_SYNC_FILE_RANGE;
791 * Check if it's time to seed a new data direction.
793 if (td->io_issues[td->rwmix_ddir] >= td->rwmix_issues) {
795 * Put a top limit on how many bytes we do for
796 * one data direction, to avoid overflowing the
799 ddir = get_rand_ddir(td);
801 if (ddir != td->rwmix_ddir)
804 td->rwmix_ddir = ddir;
806 ddir = td->rwmix_ddir;
807 } else if (td_read(td))
809 else if (td_write(td))
811 else if (td_trim(td))
816 td->rwmix_ddir = rate_ddir(td, ddir);
817 return td->rwmix_ddir;
820 static void set_rw_ddir(struct thread_data *td, struct io_u *io_u)
822 enum fio_ddir ddir = get_rw_ddir(td);
824 if (td_trimwrite(td)) {
825 struct fio_file *f = io_u->file;
826 if (f->last_pos[DDIR_WRITE] == f->last_pos[DDIR_TRIM])
832 io_u->ddir = io_u->acct_ddir = ddir;
834 if (io_u->ddir == DDIR_WRITE && td_ioengine_flagged(td, FIO_BARRIER) &&
835 td->o.barrier_blocks &&
836 !(td->io_issues[DDIR_WRITE] % td->o.barrier_blocks) &&
837 td->io_issues[DDIR_WRITE])
838 io_u_set(td, io_u, IO_U_F_BARRIER);
841 void put_file_log(struct thread_data *td, struct fio_file *f)
843 unsigned int ret = put_file(td, f);
846 td_verror(td, ret, "file close");
849 void put_io_u(struct thread_data *td, struct io_u *io_u)
856 if (io_u->file && !(io_u->flags & IO_U_F_NO_FILE_PUT))
857 put_file_log(td, io_u->file);
860 io_u_set(td, io_u, IO_U_F_FREE);
862 if (io_u->flags & IO_U_F_IN_CUR_DEPTH) {
864 assert(!(td->flags & TD_F_CHILD));
866 io_u_qpush(&td->io_u_freelist, io_u);
868 td_io_u_free_notify(td);
871 void clear_io_u(struct thread_data *td, struct io_u *io_u)
873 io_u_clear(td, io_u, IO_U_F_FLIGHT);
877 void requeue_io_u(struct thread_data *td, struct io_u **io_u)
879 struct io_u *__io_u = *io_u;
880 enum fio_ddir ddir = acct_ddir(__io_u);
882 dprint(FD_IO, "requeue %p\n", __io_u);
889 io_u_set(td, __io_u, IO_U_F_FREE);
890 if ((__io_u->flags & IO_U_F_FLIGHT) && ddir_rw(ddir))
891 td->io_issues[ddir]--;
893 io_u_clear(td, __io_u, IO_U_F_FLIGHT);
894 if (__io_u->flags & IO_U_F_IN_CUR_DEPTH) {
896 assert(!(td->flags & TD_F_CHILD));
899 io_u_rpush(&td->io_u_requeues, __io_u);
901 td_io_u_free_notify(td);
905 static void __fill_io_u_zone(struct thread_data *td, struct io_u *io_u)
907 struct fio_file *f = io_u->file;
910 * See if it's time to switch to a new zone
912 if (td->zone_bytes >= td->o.zone_size && td->o.zone_skip) {
914 f->file_offset += td->o.zone_range + td->o.zone_skip;
917 * Wrap from the beginning, if we exceed the file size
919 if (f->file_offset >= f->real_file_size)
920 f->file_offset = f->real_file_size - f->file_offset;
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);
944 static int fill_io_u(struct thread_data *td, struct io_u *io_u)
946 unsigned int is_random;
948 if (td_ioengine_flagged(td, FIO_NOIO))
951 set_rw_ddir(td, io_u);
954 * fsync() or fdatasync() or trim etc, we are done
956 if (!ddir_rw(io_u->ddir))
960 * When file is zoned zone_range is always positive
962 if (td->o.zone_range) {
963 __fill_io_u_zone(td, io_u);
967 * No log, let the seq/rand engine retrieve the next buflen and
970 if (get_next_offset(td, io_u, &is_random)) {
971 dprint(FD_IO, "io_u %p, failed getting offset\n", io_u);
975 io_u->buflen = get_next_buflen(td, io_u, is_random);
977 dprint(FD_IO, "io_u %p, failed getting buflen\n", io_u);
981 if (io_u->offset + io_u->buflen > io_u->file->real_file_size) {
982 dprint(FD_IO, "io_u %p, off=0x%llx + len=0x%lx exceeds file size=0x%llx\n",
984 (unsigned long long) io_u->offset, io_u->buflen,
985 (unsigned long long) io_u->file->real_file_size);
990 * mark entry before potentially trimming io_u
992 if (td_random(td) && file_randommap(td, io_u->file))
993 mark_random_map(td, io_u);
996 dprint_io_u(io_u, "fill");
997 td->zone_bytes += io_u->buflen;
1001 static void __io_u_mark_map(uint64_t *map, unsigned int nr)
1030 void io_u_mark_submit(struct thread_data *td, unsigned int nr)
1032 __io_u_mark_map(td->ts.io_u_submit, nr);
1033 td->ts.total_submit++;
1036 void io_u_mark_complete(struct thread_data *td, unsigned int nr)
1038 __io_u_mark_map(td->ts.io_u_complete, nr);
1039 td->ts.total_complete++;
1042 void io_u_mark_depth(struct thread_data *td, unsigned int nr)
1046 switch (td->cur_depth) {
1068 td->ts.io_u_map[idx] += nr;
1071 static void io_u_mark_lat_nsec(struct thread_data *td, unsigned long long nsec)
1075 assert(nsec < 1000);
1108 assert(idx < FIO_IO_U_LAT_N_NR);
1109 td->ts.io_u_lat_n[idx]++;
1112 static void io_u_mark_lat_usec(struct thread_data *td, unsigned long long usec)
1116 assert(usec < 1000 && usec >= 1);
1149 assert(idx < FIO_IO_U_LAT_U_NR);
1150 td->ts.io_u_lat_u[idx]++;
1153 static void io_u_mark_lat_msec(struct thread_data *td, unsigned long long msec)
1196 assert(idx < FIO_IO_U_LAT_M_NR);
1197 td->ts.io_u_lat_m[idx]++;
1200 static void io_u_mark_latency(struct thread_data *td, unsigned long long nsec)
1203 io_u_mark_lat_nsec(td, nsec);
1204 else if (nsec < 1000000)
1205 io_u_mark_lat_usec(td, nsec / 1000);
1207 io_u_mark_lat_msec(td, nsec / 1000000);
1210 static unsigned int __get_next_fileno_rand(struct thread_data *td)
1212 unsigned long fileno;
1214 if (td->o.file_service_type == FIO_FSERVICE_RANDOM) {
1215 uint64_t frand_max = rand_max(&td->next_file_state);
1218 r = __rand(&td->next_file_state);
1219 return (unsigned int) ((double) td->o.nr_files
1220 * (r / (frand_max + 1.0)));
1223 if (td->o.file_service_type == FIO_FSERVICE_ZIPF)
1224 fileno = zipf_next(&td->next_file_zipf);
1225 else if (td->o.file_service_type == FIO_FSERVICE_PARETO)
1226 fileno = pareto_next(&td->next_file_zipf);
1227 else if (td->o.file_service_type == FIO_FSERVICE_GAUSS)
1228 fileno = gauss_next(&td->next_file_gauss);
1230 log_err("fio: bad file service type: %d\n", td->o.file_service_type);
1235 return fileno >> FIO_FSERVICE_SHIFT;
1239 * Get next file to service by choosing one at random
1241 static struct fio_file *get_next_file_rand(struct thread_data *td,
1242 enum fio_file_flags goodf,
1243 enum fio_file_flags badf)
1251 fno = __get_next_fileno_rand(td);
1254 if (fio_file_done(f))
1257 if (!fio_file_open(f)) {
1260 if (td->nr_open_files >= td->o.open_files)
1261 return ERR_PTR(-EBUSY);
1263 err = td_io_open_file(td, f);
1269 if ((!goodf || (f->flags & goodf)) && !(f->flags & badf)) {
1270 dprint(FD_FILE, "get_next_file_rand: %p\n", f);
1274 td_io_close_file(td, f);
1279 * Get next file to service by doing round robin between all available ones
1281 static struct fio_file *get_next_file_rr(struct thread_data *td, int goodf,
1284 unsigned int old_next_file = td->next_file;
1290 f = td->files[td->next_file];
1293 if (td->next_file >= td->o.nr_files)
1296 dprint(FD_FILE, "trying file %s %x\n", f->file_name, f->flags);
1297 if (fio_file_done(f)) {
1302 if (!fio_file_open(f)) {
1305 if (td->nr_open_files >= td->o.open_files)
1306 return ERR_PTR(-EBUSY);
1308 err = td_io_open_file(td, f);
1310 dprint(FD_FILE, "error %d on open of %s\n",
1318 dprint(FD_FILE, "goodf=%x, badf=%x, ff=%x\n", goodf, badf,
1320 if ((!goodf || (f->flags & goodf)) && !(f->flags & badf))
1324 td_io_close_file(td, f);
1327 } while (td->next_file != old_next_file);
1329 dprint(FD_FILE, "get_next_file_rr: %p\n", f);
1333 static struct fio_file *__get_next_file(struct thread_data *td)
1337 assert(td->o.nr_files <= td->files_index);
1339 if (td->nr_done_files >= td->o.nr_files) {
1340 dprint(FD_FILE, "get_next_file: nr_open=%d, nr_done=%d,"
1341 " nr_files=%d\n", td->nr_open_files,
1347 f = td->file_service_file;
1348 if (f && fio_file_open(f) && !fio_file_closing(f)) {
1349 if (td->o.file_service_type == FIO_FSERVICE_SEQ)
1351 if (td->file_service_left--)
1355 if (td->o.file_service_type == FIO_FSERVICE_RR ||
1356 td->o.file_service_type == FIO_FSERVICE_SEQ)
1357 f = get_next_file_rr(td, FIO_FILE_open, FIO_FILE_closing);
1359 f = get_next_file_rand(td, FIO_FILE_open, FIO_FILE_closing);
1364 td->file_service_file = f;
1365 td->file_service_left = td->file_service_nr - 1;
1368 dprint(FD_FILE, "get_next_file: %p [%s]\n", f, f->file_name);
1370 dprint(FD_FILE, "get_next_file: NULL\n");
1374 static struct fio_file *get_next_file(struct thread_data *td)
1376 return __get_next_file(td);
1379 static long set_io_u_file(struct thread_data *td, struct io_u *io_u)
1384 f = get_next_file(td);
1385 if (IS_ERR_OR_NULL(f))
1391 if (!fill_io_u(td, io_u))
1394 put_file_log(td, f);
1395 td_io_close_file(td, f);
1397 if (td->o.file_service_type & __FIO_FSERVICE_NONUNIFORM)
1398 fio_file_reset(td, f);
1400 fio_file_set_done(f);
1401 td->nr_done_files++;
1402 dprint(FD_FILE, "%s: is done (%d of %d)\n", f->file_name,
1403 td->nr_done_files, td->o.nr_files);
1410 static void lat_fatal(struct thread_data *td, struct io_completion_data *icd,
1411 unsigned long long tnsec, unsigned long long max_nsec)
1414 log_err("fio: latency of %llu nsec exceeds specified max (%llu nsec)\n", tnsec, max_nsec);
1415 td_verror(td, ETIMEDOUT, "max latency exceeded");
1416 icd->error = ETIMEDOUT;
1419 static void lat_new_cycle(struct thread_data *td)
1421 fio_gettime(&td->latency_ts, NULL);
1422 td->latency_ios = ddir_rw_sum(td->io_blocks);
1423 td->latency_failed = 0;
1427 * We had an IO outside the latency target. Reduce the queue depth. If we
1428 * are at QD=1, then it's time to give up.
1430 static bool __lat_target_failed(struct thread_data *td)
1432 if (td->latency_qd == 1)
1435 td->latency_qd_high = td->latency_qd;
1437 if (td->latency_qd == td->latency_qd_low)
1438 td->latency_qd_low--;
1440 td->latency_qd = (td->latency_qd + td->latency_qd_low) / 2;
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;
1491 * If we haven't failed yet, we double up to a failing value instead
1492 * of bisecting from highest possible queue depth. If we have set
1493 * a limit other than td->o.iodepth, bisect between that.
1495 if (td->latency_qd_high != o->iodepth)
1496 td->latency_qd = (td->latency_qd + td->latency_qd_high) / 2;
1498 td->latency_qd *= 2;
1500 if (td->latency_qd > o->iodepth)
1501 td->latency_qd = o->iodepth;
1503 dprint(FD_RATE, "Ramped up: %d %d %d\n", td->latency_qd_low, td->latency_qd, td->latency_qd_high);
1506 * Same as last one, we are done. Let it run a latency cycle, so
1507 * we get only the results from the targeted depth.
1509 if (td->latency_qd == qd) {
1510 if (td->latency_end_run) {
1511 dprint(FD_RATE, "We are done\n");
1514 dprint(FD_RATE, "Quiesce and final run\n");
1516 td->latency_end_run = 1;
1517 reset_all_stats(td);
1526 * Check if we can bump the queue depth
1528 void lat_target_check(struct thread_data *td)
1530 uint64_t usec_window;
1534 usec_window = utime_since_now(&td->latency_ts);
1535 if (usec_window < td->o.latency_window)
1538 ios = ddir_rw_sum(td->io_blocks) - td->latency_ios;
1539 success_ios = (double) (ios - td->latency_failed) / (double) ios;
1540 success_ios *= 100.0;
1542 dprint(FD_RATE, "Success rate: %.2f%% (target %.2f%%)\n", success_ios, td->o.latency_percentile.u.f);
1544 if (success_ios >= td->o.latency_percentile.u.f)
1545 lat_target_success(td);
1547 __lat_target_failed(td);
1551 * If latency target is enabled, we might be ramping up or down and not
1552 * using the full queue depth available.
1554 bool queue_full(const struct thread_data *td)
1556 const int qempty = io_u_qempty(&td->io_u_freelist);
1560 if (!td->o.latency_target)
1563 return td->cur_depth >= td->latency_qd;
1566 struct io_u *__get_io_u(struct thread_data *td)
1568 struct io_u *io_u = NULL;
1576 if (!io_u_rempty(&td->io_u_requeues))
1577 io_u = io_u_rpop(&td->io_u_requeues);
1578 else if (!queue_full(td)) {
1579 io_u = io_u_qpop(&td->io_u_freelist);
1584 io_u->end_io = NULL;
1588 assert(io_u->flags & IO_U_F_FREE);
1589 io_u_clear(td, io_u, IO_U_F_FREE | IO_U_F_NO_FILE_PUT |
1590 IO_U_F_TRIMMED | IO_U_F_BARRIER |
1594 io_u->acct_ddir = -1;
1596 assert(!(td->flags & TD_F_CHILD));
1597 io_u_set(td, io_u, IO_U_F_IN_CUR_DEPTH);
1599 } else if (td_async_processing(td)) {
1601 * We ran out, wait for async verify threads to finish and
1604 assert(!(td->flags & TD_F_CHILD));
1605 assert(!pthread_cond_wait(&td->free_cond, &td->io_u_lock));
1613 static bool check_get_trim(struct thread_data *td, struct io_u *io_u)
1615 if (!(td->flags & TD_F_TRIM_BACKLOG))
1617 if (!td->trim_entries)
1620 if (td->trim_batch) {
1622 if (get_next_trim(td, io_u))
1624 } else if (!(td->io_hist_len % td->o.trim_backlog) &&
1625 td->last_ddir != DDIR_READ) {
1626 td->trim_batch = td->o.trim_batch;
1627 if (!td->trim_batch)
1628 td->trim_batch = td->o.trim_backlog;
1629 if (get_next_trim(td, io_u))
1636 static bool check_get_verify(struct thread_data *td, struct io_u *io_u)
1638 if (!(td->flags & TD_F_VER_BACKLOG))
1641 if (td->io_hist_len) {
1644 if (td->verify_batch)
1646 else if (!(td->io_hist_len % td->o.verify_backlog) &&
1647 td->last_ddir != DDIR_READ) {
1648 td->verify_batch = td->o.verify_batch;
1649 if (!td->verify_batch)
1650 td->verify_batch = td->o.verify_backlog;
1654 if (get_verify && !get_next_verify(td, io_u)) {
1664 * Fill offset and start time into the buffer content, to prevent too
1665 * easy compressible data for simple de-dupe attempts. Do this for every
1666 * 512b block in the range, since that should be the smallest block size
1667 * we can expect from a device.
1669 static void small_content_scramble(struct io_u *io_u)
1671 unsigned int i, nr_blocks = io_u->buflen >> 9;
1672 unsigned int offset;
1673 uint64_t boffset, *iptr;
1680 boffset = io_u->offset;
1682 if (io_u->buf_filled_len)
1683 io_u->buf_filled_len = 0;
1686 * Generate random index between 0..7. We do chunks of 512b, if
1687 * we assume a cacheline is 64 bytes, then we have 8 of those.
1688 * Scramble content within the blocks in the same cacheline to
1691 offset = (io_u->start_time.tv_nsec ^ boffset) & 7;
1693 for (i = 0; i < nr_blocks; i++) {
1695 * Fill offset into start of cacheline, time into end
1698 iptr = (void *) p + (offset << 6);
1701 iptr = (void *) p + 64 - 2 * sizeof(uint64_t);
1702 iptr[0] = io_u->start_time.tv_sec;
1703 iptr[1] = io_u->start_time.tv_nsec;
1711 * Return an io_u to be processed. Gets a buflen and offset, sets direction,
1712 * etc. The returned io_u is fully ready to be prepped and submitted.
1714 struct io_u *get_io_u(struct thread_data *td)
1718 int do_scramble = 0;
1721 io_u = __get_io_u(td);
1723 dprint(FD_IO, "__get_io_u failed\n");
1727 if (check_get_verify(td, io_u))
1729 if (check_get_trim(td, io_u))
1733 * from a requeue, io_u already setup
1739 * If using an iolog, grab next piece if any available.
1741 if (td->flags & TD_F_READ_IOLOG) {
1742 if (read_iolog_get(td, io_u))
1744 } else if (set_io_u_file(td, io_u)) {
1746 dprint(FD_IO, "io_u %p, setting file failed\n", io_u);
1752 dprint(FD_IO, "io_u %p, setting file failed\n", io_u);
1756 assert(fio_file_open(f));
1758 if (ddir_rw(io_u->ddir)) {
1759 if (!io_u->buflen && !td_ioengine_flagged(td, FIO_NOIO)) {
1760 dprint(FD_IO, "get_io_u: zero buflen on %p\n", io_u);
1764 f->last_start[io_u->ddir] = io_u->offset;
1765 f->last_pos[io_u->ddir] = io_u->offset + io_u->buflen;
1767 if (io_u->ddir == DDIR_WRITE) {
1768 if (td->flags & TD_F_REFILL_BUFFERS) {
1769 io_u_fill_buffer(td, io_u,
1770 td->o.min_bs[DDIR_WRITE],
1772 } else if ((td->flags & TD_F_SCRAMBLE_BUFFERS) &&
1773 !(td->flags & TD_F_COMPRESS))
1775 if (td->flags & TD_F_VER_NONE) {
1776 populate_verify_io_u(td, io_u);
1779 } else if (io_u->ddir == DDIR_READ) {
1781 * Reset the buf_filled parameters so next time if the
1782 * buffer is used for writes it is refilled.
1784 io_u->buf_filled_len = 0;
1789 * Set io data pointers.
1791 io_u->xfer_buf = io_u->buf;
1792 io_u->xfer_buflen = io_u->buflen;
1796 if (!td_io_prep(td, io_u)) {
1797 if (!td->o.disable_lat)
1798 fio_gettime(&io_u->start_time, NULL);
1801 small_content_scramble(io_u);
1806 dprint(FD_IO, "get_io_u failed\n");
1808 return ERR_PTR(ret);
1811 static void __io_u_log_error(struct thread_data *td, struct io_u *io_u)
1813 enum error_type_bit eb = td_error_type(io_u->ddir, io_u->error);
1815 if (td_non_fatal_error(td, eb, io_u->error) && !td->o.error_dump)
1818 log_err("fio: io_u error%s%s: %s: %s offset=%llu, buflen=%lu\n",
1819 io_u->file ? " on file " : "",
1820 io_u->file ? io_u->file->file_name : "",
1821 strerror(io_u->error),
1822 io_ddir_name(io_u->ddir),
1823 io_u->offset, io_u->xfer_buflen);
1825 if (td->io_ops->errdetails) {
1826 char *err = td->io_ops->errdetails(io_u);
1828 log_err("fio: %s\n", err);
1833 td_verror(td, io_u->error, "io_u error");
1836 void io_u_log_error(struct thread_data *td, struct io_u *io_u)
1838 __io_u_log_error(td, io_u);
1840 __io_u_log_error(td->parent, io_u);
1843 static inline bool gtod_reduce(struct thread_data *td)
1845 return (td->o.disable_clat && td->o.disable_slat && td->o.disable_bw)
1846 || td->o.gtod_reduce;
1849 static void account_io_completion(struct thread_data *td, struct io_u *io_u,
1850 struct io_completion_data *icd,
1851 const enum fio_ddir idx, unsigned int bytes)
1853 const int no_reduce = !gtod_reduce(td);
1854 unsigned long long llnsec = 0;
1859 if (!td->o.stats || td_ioengine_flagged(td, FIO_NOSTATS))
1863 llnsec = ntime_since(&io_u->issue_time, &icd->time);
1865 if (!td->o.disable_lat) {
1866 unsigned long long tnsec;
1868 tnsec = ntime_since(&io_u->start_time, &icd->time);
1869 add_lat_sample(td, idx, tnsec, bytes, io_u->offset);
1871 if (td->flags & TD_F_PROFILE_OPS) {
1872 struct prof_io_ops *ops = &td->prof_io_ops;
1875 icd->error = ops->io_u_lat(td, tnsec);
1878 if (td->o.max_latency && tnsec > td->o.max_latency)
1879 lat_fatal(td, icd, tnsec, td->o.max_latency);
1880 if (td->o.latency_target && tnsec > td->o.latency_target) {
1881 if (lat_target_failed(td))
1882 lat_fatal(td, icd, tnsec, td->o.latency_target);
1887 if (!td->o.disable_clat) {
1888 add_clat_sample(td, idx, llnsec, bytes, io_u->offset);
1889 io_u_mark_latency(td, llnsec);
1892 if (!td->o.disable_bw && per_unit_log(td->bw_log))
1893 add_bw_sample(td, io_u, bytes, llnsec);
1895 if (no_reduce && per_unit_log(td->iops_log))
1896 add_iops_sample(td, io_u, bytes);
1897 } else if (ddir_sync(idx) && !td->o.disable_clat)
1898 add_sync_clat_sample(&td->ts, llnsec);
1900 if (td->ts.nr_block_infos && io_u->ddir == DDIR_TRIM) {
1901 uint32_t *info = io_u_block_info(td, io_u);
1902 if (BLOCK_INFO_STATE(*info) < BLOCK_STATE_TRIM_FAILURE) {
1903 if (io_u->ddir == DDIR_TRIM) {
1904 *info = BLOCK_INFO(BLOCK_STATE_TRIMMED,
1905 BLOCK_INFO_TRIMS(*info) + 1);
1906 } else if (io_u->ddir == DDIR_WRITE) {
1907 *info = BLOCK_INFO_SET_STATE(BLOCK_STATE_WRITTEN,
1914 static void file_log_write_comp(const struct thread_data *td, struct fio_file *f,
1915 uint64_t offset, unsigned int bytes)
1922 if (f->first_write == -1ULL || offset < f->first_write)
1923 f->first_write = offset;
1924 if (f->last_write == -1ULL || ((offset + bytes) > f->last_write))
1925 f->last_write = offset + bytes;
1927 if (!f->last_write_comp)
1930 idx = f->last_write_idx++;
1931 f->last_write_comp[idx] = offset;
1932 if (f->last_write_idx == td->o.iodepth)
1933 f->last_write_idx = 0;
1936 static bool should_account(struct thread_data *td)
1938 return ramp_time_over(td) && (td->runstate == TD_RUNNING ||
1939 td->runstate == TD_VERIFYING);
1942 static void io_completed(struct thread_data *td, struct io_u **io_u_ptr,
1943 struct io_completion_data *icd)
1945 struct io_u *io_u = *io_u_ptr;
1946 enum fio_ddir ddir = io_u->ddir;
1947 struct fio_file *f = io_u->file;
1949 dprint_io_u(io_u, "complete");
1951 assert(io_u->flags & IO_U_F_FLIGHT);
1952 io_u_clear(td, io_u, IO_U_F_FLIGHT | IO_U_F_BUSY_OK);
1955 * Mark IO ok to verify
1959 * Remove errored entry from the verification list
1962 unlog_io_piece(td, io_u);
1964 io_u->ipo->flags &= ~IP_F_IN_FLIGHT;
1969 if (ddir_sync(ddir)) {
1970 td->last_was_sync = true;
1972 f->first_write = -1ULL;
1973 f->last_write = -1ULL;
1975 if (should_account(td))
1976 account_io_completion(td, io_u, icd, ddir, io_u->buflen);
1980 td->last_was_sync = false;
1981 td->last_ddir = ddir;
1983 if (!io_u->error && ddir_rw(ddir)) {
1984 unsigned int bytes = io_u->buflen - io_u->resid;
1987 td->io_blocks[ddir]++;
1988 td->io_bytes[ddir] += bytes;
1990 if (!(io_u->flags & IO_U_F_VER_LIST)) {
1991 td->this_io_blocks[ddir]++;
1992 td->this_io_bytes[ddir] += bytes;
1995 if (ddir == DDIR_WRITE)
1996 file_log_write_comp(td, f, io_u->offset, bytes);
1998 if (should_account(td))
1999 account_io_completion(td, io_u, icd, ddir, bytes);
2001 icd->bytes_done[ddir] += bytes;
2004 ret = io_u->end_io(td, io_u_ptr);
2006 if (ret && !icd->error)
2009 } else if (io_u->error) {
2010 icd->error = io_u->error;
2011 io_u_log_error(td, io_u);
2014 enum error_type_bit eb = td_error_type(ddir, icd->error);
2016 if (!td_non_fatal_error(td, eb, icd->error))
2020 * If there is a non_fatal error, then add to the error count
2021 * and clear all the errors.
2023 update_error_count(td, icd->error);
2031 static void init_icd(struct thread_data *td, struct io_completion_data *icd,
2036 if (!gtod_reduce(td))
2037 fio_gettime(&icd->time, NULL);
2042 for (ddir = 0; ddir < DDIR_RWDIR_CNT; ddir++)
2043 icd->bytes_done[ddir] = 0;
2046 static void ios_completed(struct thread_data *td,
2047 struct io_completion_data *icd)
2052 for (i = 0; i < icd->nr; i++) {
2053 io_u = td->io_ops->event(td, i);
2055 io_completed(td, &io_u, icd);
2063 * Complete a single io_u for the sync engines.
2065 int io_u_sync_complete(struct thread_data *td, struct io_u *io_u)
2067 struct io_completion_data icd;
2070 init_icd(td, &icd, 1);
2071 io_completed(td, &io_u, &icd);
2077 td_verror(td, icd.error, "io_u_sync_complete");
2081 for (ddir = 0; ddir < DDIR_RWDIR_CNT; ddir++)
2082 td->bytes_done[ddir] += icd.bytes_done[ddir];
2088 * Called to complete min_events number of io for the async engines.
2090 int io_u_queued_complete(struct thread_data *td, int min_evts)
2092 struct io_completion_data icd;
2093 struct timespec *tvp = NULL;
2095 struct timespec ts = { .tv_sec = 0, .tv_nsec = 0, };
2097 dprint(FD_IO, "io_u_queued_complete: min=%d\n", min_evts);
2101 else if (min_evts > td->cur_depth)
2102 min_evts = td->cur_depth;
2104 /* No worries, td_io_getevents fixes min and max if they are
2105 * set incorrectly */
2106 ret = td_io_getevents(td, min_evts, td->o.iodepth_batch_complete_max, tvp);
2108 td_verror(td, -ret, "td_io_getevents");
2113 init_icd(td, &icd, ret);
2114 ios_completed(td, &icd);
2116 td_verror(td, icd.error, "io_u_queued_complete");
2120 for (ddir = 0; ddir < DDIR_RWDIR_CNT; ddir++)
2121 td->bytes_done[ddir] += icd.bytes_done[ddir];
2127 * Call when io_u is really queued, to update the submission latency.
2129 void io_u_queued(struct thread_data *td, struct io_u *io_u)
2131 if (!td->o.disable_slat && ramp_time_over(td) && td->o.stats) {
2132 unsigned long slat_time;
2134 slat_time = ntime_since(&io_u->start_time, &io_u->issue_time);
2139 add_slat_sample(td, io_u->ddir, slat_time, io_u->xfer_buflen,
2145 * See if we should reuse the last seed, if dedupe is enabled
2147 static struct frand_state *get_buf_state(struct thread_data *td)
2151 if (!td->o.dedupe_percentage)
2152 return &td->buf_state;
2153 else if (td->o.dedupe_percentage == 100) {
2154 frand_copy(&td->buf_state_prev, &td->buf_state);
2155 return &td->buf_state;
2158 v = rand32_between(&td->dedupe_state, 1, 100);
2160 if (v <= td->o.dedupe_percentage)
2161 return &td->buf_state_prev;
2163 return &td->buf_state;
2166 static void save_buf_state(struct thread_data *td, struct frand_state *rs)
2168 if (td->o.dedupe_percentage == 100)
2169 frand_copy(rs, &td->buf_state_prev);
2170 else if (rs == &td->buf_state)
2171 frand_copy(&td->buf_state_prev, rs);
2174 void fill_io_buffer(struct thread_data *td, void *buf, unsigned int min_write,
2175 unsigned int max_bs)
2177 struct thread_options *o = &td->o;
2179 if (o->mem_type == MEM_CUDA_MALLOC)
2182 if (o->compress_percentage || o->dedupe_percentage) {
2183 unsigned int perc = td->o.compress_percentage;
2184 struct frand_state *rs;
2185 unsigned int left = max_bs;
2186 unsigned int this_write;
2189 rs = get_buf_state(td);
2191 min_write = min(min_write, left);
2194 this_write = min_not_zero(min_write,
2195 td->o.compress_chunk);
2197 fill_random_buf_percentage(rs, buf, perc,
2198 this_write, this_write,
2200 o->buffer_pattern_bytes);
2202 fill_random_buf(rs, buf, min_write);
2203 this_write = min_write;
2208 save_buf_state(td, rs);
2210 } else if (o->buffer_pattern_bytes)
2211 fill_buffer_pattern(td, buf, max_bs);
2212 else if (o->zero_buffers)
2213 memset(buf, 0, max_bs);
2215 fill_random_buf(get_buf_state(td), buf, max_bs);
2219 * "randomly" fill the buffer contents
2221 void io_u_fill_buffer(struct thread_data *td, struct io_u *io_u,
2222 unsigned int min_write, unsigned int max_bs)
2224 io_u->buf_filled_len = 0;
2225 fill_io_buffer(td, io_u->buf, min_write, max_bs);
2228 static int do_sync_file_range(const struct thread_data *td,
2231 off64_t offset, nbytes;
2233 offset = f->first_write;
2234 nbytes = f->last_write - f->first_write;
2239 return sync_file_range(f->fd, offset, nbytes, td->o.sync_file_range);
2242 int do_io_u_sync(const struct thread_data *td, struct io_u *io_u)
2246 if (io_u->ddir == DDIR_SYNC) {
2247 ret = fsync(io_u->file->fd);
2248 } else if (io_u->ddir == DDIR_DATASYNC) {
2249 #ifdef CONFIG_FDATASYNC
2250 ret = fdatasync(io_u->file->fd);
2252 ret = io_u->xfer_buflen;
2253 io_u->error = EINVAL;
2255 } else if (io_u->ddir == DDIR_SYNC_FILE_RANGE)
2256 ret = do_sync_file_range(td, io_u->file);
2258 ret = io_u->xfer_buflen;
2259 io_u->error = EINVAL;
2263 io_u->error = errno;
2268 int do_io_u_trim(const struct thread_data *td, struct io_u *io_u)
2270 #ifndef FIO_HAVE_TRIM
2271 io_u->error = EINVAL;
2274 struct fio_file *f = io_u->file;
2277 ret = os_trim(f, io_u->offset, io_u->xfer_buflen);
2279 return io_u->xfer_buflen;