13 #include "lib/axmap.h"
15 struct io_completion_data {
18 int error; /* output */
19 uint64_t bytes_done[DDIR_RWDIR_CNT]; /* output */
20 struct timeval 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 int 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 void mark_random_map(struct thread_data *td, struct io_u *io_u)
37 unsigned int min_bs = td->o.rw_min_bs;
38 struct fio_file *f = io_u->file;
39 unsigned int nr_blocks;
42 block = (io_u->offset - f->file_offset) / (uint64_t) min_bs;
43 nr_blocks = (io_u->buflen + min_bs - 1) / min_bs;
45 if (!(io_u->flags & IO_U_F_BUSY_OK))
46 nr_blocks = axmap_set_nr(f->io_axmap, block, nr_blocks);
48 if ((nr_blocks * min_bs) < io_u->buflen)
49 io_u->buflen = nr_blocks * min_bs;
52 static uint64_t last_block(struct thread_data *td, struct fio_file *f,
58 assert(ddir_rw(ddir));
61 * Hmm, should we make sure that ->io_size <= ->real_file_size?
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 max_blocks = max_size / (uint64_t) td->o.ba[ddir];
78 struct flist_head list;
82 static int __get_next_rand_offset(struct thread_data *td, struct fio_file *f,
83 enum fio_ddir ddir, uint64_t *b)
87 lastb = last_block(td, f, ddir);
91 if (td->o.random_generator == FIO_RAND_GEN_TAUSWORTHE) {
94 rmax = td->o.use_os_rand ? OS_RAND_MAX : FRAND_MAX;
96 if (td->o.use_os_rand) {
98 r = os_random_long(&td->random_state);
101 r = __rand(&td->__random_state);
104 dprint(FD_RANDOM, "off rand %llu\n", r);
106 *b = (lastb - 1) * (r / ((uint64_t) rmax + 1.0));
110 if (lfsr_next(&f->lfsr, &off, lastb))
117 * if we are not maintaining a random map, we are done.
119 if (!file_randommap(td, f))
123 * calculate map offset and check if it's free
125 if (random_map_free(f, *b))
128 dprint(FD_RANDOM, "get_next_rand_offset: offset %llu busy\n", *b);
130 *b = axmap_next_free(f->io_axmap, *b);
131 if (*b == (uint64_t) -1ULL)
137 static int __get_next_rand_offset_zipf(struct thread_data *td,
138 struct fio_file *f, enum fio_ddir ddir,
141 *b = zipf_next(&f->zipf);
145 static int __get_next_rand_offset_pareto(struct thread_data *td,
146 struct fio_file *f, enum fio_ddir ddir,
149 *b = pareto_next(&f->zipf);
153 static int flist_cmp(void *data, struct flist_head *a, struct flist_head *b)
155 struct rand_off *r1 = flist_entry(a, struct rand_off, list);
156 struct rand_off *r2 = flist_entry(b, struct rand_off, list);
158 return r1->off - r2->off;
161 static int get_off_from_method(struct thread_data *td, struct fio_file *f,
162 enum fio_ddir ddir, uint64_t *b)
164 if (td->o.random_distribution == FIO_RAND_DIST_RANDOM)
165 return __get_next_rand_offset(td, f, ddir, b);
166 else if (td->o.random_distribution == FIO_RAND_DIST_ZIPF)
167 return __get_next_rand_offset_zipf(td, f, ddir, b);
168 else if (td->o.random_distribution == FIO_RAND_DIST_PARETO)
169 return __get_next_rand_offset_pareto(td, f, ddir, b);
171 log_err("fio: unknown random distribution: %d\n", td->o.random_distribution);
176 * Sort the reads for a verify phase in batches of verifysort_nr, if
179 static inline int should_sort_io(struct thread_data *td)
181 if (!td->o.verifysort_nr || !td->o.do_verify)
185 if (td->runstate != TD_VERIFYING)
187 if (td->o.random_generator == FIO_RAND_GEN_TAUSWORTHE)
193 static int get_next_rand_offset(struct thread_data *td, struct fio_file *f,
194 enum fio_ddir ddir, uint64_t *b)
199 if (!should_sort_io(td))
200 return get_off_from_method(td, f, ddir, b);
202 if (!flist_empty(&td->next_rand_list)) {
205 r = flist_entry(td->next_rand_list.next, struct rand_off, list);
212 for (i = 0; i < td->o.verifysort_nr; i++) {
213 r = malloc(sizeof(*r));
215 ret = get_off_from_method(td, f, ddir, &r->off);
221 flist_add(&r->list, &td->next_rand_list);
227 assert(!flist_empty(&td->next_rand_list));
228 flist_sort(NULL, &td->next_rand_list, flist_cmp);
232 static int get_next_rand_block(struct thread_data *td, struct fio_file *f,
233 enum fio_ddir ddir, uint64_t *b)
235 if (!get_next_rand_offset(td, f, ddir, b))
238 if (td->o.time_based) {
239 fio_file_reset(td, f);
240 if (!get_next_rand_offset(td, f, ddir, b))
244 dprint(FD_IO, "%s: rand offset failed, last=%llu, size=%llu\n",
245 f->file_name, f->last_pos, f->real_file_size);
249 static int get_next_seq_offset(struct thread_data *td, struct fio_file *f,
250 enum fio_ddir ddir, uint64_t *offset)
252 assert(ddir_rw(ddir));
254 if (f->last_pos >= f->io_size + get_start_offset(td) && td->o.time_based)
255 f->last_pos = f->last_pos - f->io_size;
257 if (f->last_pos < f->real_file_size) {
260 if (f->last_pos == f->file_offset && td->o.ddir_seq_add < 0)
261 f->last_pos = f->real_file_size;
263 pos = f->last_pos - f->file_offset;
265 pos += td->o.ddir_seq_add;
274 static int get_next_block(struct thread_data *td, struct io_u *io_u,
275 enum fio_ddir ddir, int rw_seq)
277 struct fio_file *f = io_u->file;
281 assert(ddir_rw(ddir));
287 ret = get_next_rand_block(td, f, ddir, &b);
289 ret = get_next_seq_offset(td, f, ddir, &offset);
291 io_u->flags |= IO_U_F_BUSY_OK;
293 if (td->o.rw_seq == RW_SEQ_SEQ) {
294 ret = get_next_seq_offset(td, f, ddir, &offset);
296 ret = get_next_rand_block(td, f, ddir, &b);
297 } else if (td->o.rw_seq == RW_SEQ_IDENT) {
298 if (f->last_start != -1ULL)
299 offset = f->last_start - f->file_offset;
304 log_err("fio: unknown rw_seq=%d\n", td->o.rw_seq);
311 io_u->offset = offset;
313 io_u->offset = b * td->o.ba[ddir];
315 log_err("fio: bug in offset generation: offset=%llu, b=%llu\n",
325 * For random io, generate a random new block and see if it's used. Repeat
326 * until we find a free one. For sequential io, just return the end of
327 * the last io issued.
329 static int __get_next_offset(struct thread_data *td, struct io_u *io_u)
331 struct fio_file *f = io_u->file;
332 enum fio_ddir ddir = io_u->ddir;
335 assert(ddir_rw(ddir));
337 if (td->o.ddir_seq_nr && !--td->ddir_seq_nr) {
339 td->ddir_seq_nr = td->o.ddir_seq_nr;
342 if (get_next_block(td, io_u, ddir, rw_seq_hit))
345 if (io_u->offset >= f->io_size) {
346 dprint(FD_IO, "get_next_offset: offset %llu >= io_size %llu\n",
347 io_u->offset, f->io_size);
351 io_u->offset += f->file_offset;
352 if (io_u->offset >= f->real_file_size) {
353 dprint(FD_IO, "get_next_offset: offset %llu >= size %llu\n",
354 io_u->offset, f->real_file_size);
361 static int get_next_offset(struct thread_data *td, struct io_u *io_u)
363 if (td->flags & TD_F_PROFILE_OPS) {
364 struct prof_io_ops *ops = &td->prof_io_ops;
366 if (ops->fill_io_u_off)
367 return ops->fill_io_u_off(td, io_u);
370 return __get_next_offset(td, io_u);
373 static inline int io_u_fits(struct thread_data *td, struct io_u *io_u,
376 struct fio_file *f = io_u->file;
378 return io_u->offset + buflen <= f->io_size + get_start_offset(td);
381 static unsigned int __get_next_buflen(struct thread_data *td, struct io_u *io_u)
383 const int ddir = io_u->ddir;
384 unsigned int buflen = 0;
385 unsigned int minbs, maxbs;
386 unsigned long r, rand_max;
388 assert(ddir_rw(ddir));
390 minbs = td->o.min_bs[ddir];
391 maxbs = td->o.max_bs[ddir];
397 * If we can't satisfy the min block size from here, then fail
399 if (!io_u_fits(td, io_u, minbs))
402 if (td->o.use_os_rand)
403 rand_max = OS_RAND_MAX;
405 rand_max = FRAND_MAX;
408 if (td->o.use_os_rand)
409 r = os_random_long(&td->bsrange_state);
411 r = __rand(&td->__bsrange_state);
413 if (!td->o.bssplit_nr[ddir]) {
414 buflen = 1 + (unsigned int) ((double) maxbs *
415 (r / (rand_max + 1.0)));
422 for (i = 0; i < td->o.bssplit_nr[ddir]; i++) {
423 struct bssplit *bsp = &td->o.bssplit[ddir][i];
427 if ((r <= ((rand_max / 100L) * perc)) &&
428 io_u_fits(td, io_u, buflen))
433 if (!td->o.bs_unaligned && is_power_of_2(minbs))
434 buflen = (buflen + minbs - 1) & ~(minbs - 1);
436 } while (!io_u_fits(td, io_u, buflen));
441 static unsigned int get_next_buflen(struct thread_data *td, struct io_u *io_u)
443 if (td->flags & TD_F_PROFILE_OPS) {
444 struct prof_io_ops *ops = &td->prof_io_ops;
446 if (ops->fill_io_u_size)
447 return ops->fill_io_u_size(td, io_u);
450 return __get_next_buflen(td, io_u);
453 static void set_rwmix_bytes(struct thread_data *td)
458 * we do time or byte based switch. this is needed because
459 * buffered writes may issue a lot quicker than they complete,
460 * whereas reads do not.
462 diff = td->o.rwmix[td->rwmix_ddir ^ 1];
463 td->rwmix_issues = (td->io_issues[td->rwmix_ddir] * diff) / 100;
466 static inline enum fio_ddir get_rand_ddir(struct thread_data *td)
471 if (td->o.use_os_rand) {
472 r = os_random_long(&td->rwmix_state);
473 v = 1 + (int) (100.0 * (r / (OS_RAND_MAX + 1.0)));
475 r = __rand(&td->__rwmix_state);
476 v = 1 + (int) (100.0 * (r / (FRAND_MAX + 1.0)));
479 if (v <= td->o.rwmix[DDIR_READ])
485 static enum fio_ddir rate_ddir(struct thread_data *td, enum fio_ddir ddir)
487 enum fio_ddir odir = ddir ^ 1;
491 assert(ddir_rw(ddir));
493 if (td->rate_pending_usleep[ddir] <= 0 || !td->o.rwmix[odir])
497 * We have too much pending sleep in this direction. See if we
502 * Other direction does not have too much pending, switch
504 if (td->rate_pending_usleep[odir] < 100000)
508 * Both directions have pending sleep. Sleep the minimum time
509 * and deduct from both.
511 if (td->rate_pending_usleep[ddir] <=
512 td->rate_pending_usleep[odir]) {
513 usec = td->rate_pending_usleep[ddir];
515 usec = td->rate_pending_usleep[odir];
519 usec = td->rate_pending_usleep[ddir];
522 * We are going to sleep, ensure that we flush anything pending as
523 * not to skew our latency numbers.
525 * Changed to only monitor 'in flight' requests here instead of the
526 * td->cur_depth, b/c td->cur_depth does not accurately represent
527 * io's that have been actually submitted to an async engine,
528 * and cur_depth is meaningless for sync engines.
530 if (td->io_u_in_flight) {
533 ret = io_u_queued_complete(td, td->io_u_in_flight, NULL);
536 fio_gettime(&t, NULL);
537 usec_sleep(td, usec);
538 usec = utime_since_now(&t);
540 td->rate_pending_usleep[ddir] -= usec;
543 if (td_rw(td) && __should_check_rate(td, odir))
544 td->rate_pending_usleep[odir] -= usec;
553 * Return the data direction for the next io_u. If the job is a
554 * mixed read/write workload, check the rwmix cycle and switch if
557 static enum fio_ddir get_rw_ddir(struct thread_data *td)
562 * see if it's time to fsync
564 if (td->o.fsync_blocks &&
565 !(td->io_issues[DDIR_WRITE] % td->o.fsync_blocks) &&
566 td->io_issues[DDIR_WRITE] && should_fsync(td))
570 * see if it's time to fdatasync
572 if (td->o.fdatasync_blocks &&
573 !(td->io_issues[DDIR_WRITE] % td->o.fdatasync_blocks) &&
574 td->io_issues[DDIR_WRITE] && should_fsync(td))
575 return DDIR_DATASYNC;
578 * see if it's time to sync_file_range
580 if (td->sync_file_range_nr &&
581 !(td->io_issues[DDIR_WRITE] % td->sync_file_range_nr) &&
582 td->io_issues[DDIR_WRITE] && should_fsync(td))
583 return DDIR_SYNC_FILE_RANGE;
587 * Check if it's time to seed a new data direction.
589 if (td->io_issues[td->rwmix_ddir] >= td->rwmix_issues) {
591 * Put a top limit on how many bytes we do for
592 * one data direction, to avoid overflowing the
595 ddir = get_rand_ddir(td);
597 if (ddir != td->rwmix_ddir)
600 td->rwmix_ddir = ddir;
602 ddir = td->rwmix_ddir;
603 } else if (td_read(td))
605 else if (td_write(td))
610 td->rwmix_ddir = rate_ddir(td, ddir);
611 return td->rwmix_ddir;
614 static void set_rw_ddir(struct thread_data *td, struct io_u *io_u)
616 io_u->ddir = io_u->acct_ddir = get_rw_ddir(td);
618 if (io_u->ddir == DDIR_WRITE && (td->io_ops->flags & FIO_BARRIER) &&
619 td->o.barrier_blocks &&
620 !(td->io_issues[DDIR_WRITE] % td->o.barrier_blocks) &&
621 td->io_issues[DDIR_WRITE])
622 io_u->flags |= IO_U_F_BARRIER;
625 void put_file_log(struct thread_data *td, struct fio_file *f)
627 int ret = put_file(td, f);
630 td_verror(td, ret, "file close");
633 void put_io_u(struct thread_data *td, struct io_u *io_u)
637 if (io_u->file && !(io_u->flags & IO_U_F_FREE_DEF))
638 put_file_log(td, io_u->file);
640 io_u->flags &= ~IO_U_F_FREE_DEF;
641 io_u->flags |= IO_U_F_FREE;
643 if (io_u->flags & IO_U_F_IN_CUR_DEPTH)
645 flist_del_init(&io_u->list);
646 flist_add(&io_u->list, &td->io_u_freelist);
648 td_io_u_free_notify(td);
651 void clear_io_u(struct thread_data *td, struct io_u *io_u)
653 io_u->flags &= ~IO_U_F_FLIGHT;
657 void requeue_io_u(struct thread_data *td, struct io_u **io_u)
659 struct io_u *__io_u = *io_u;
660 enum fio_ddir ddir = acct_ddir(__io_u);
662 dprint(FD_IO, "requeue %p\n", __io_u);
666 __io_u->flags |= IO_U_F_FREE;
667 if ((__io_u->flags & IO_U_F_FLIGHT) && ddir_rw(ddir))
668 td->io_issues[ddir]--;
670 __io_u->flags &= ~IO_U_F_FLIGHT;
671 if (__io_u->flags & IO_U_F_IN_CUR_DEPTH)
673 flist_del(&__io_u->list);
674 flist_add_tail(&__io_u->list, &td->io_u_requeues);
679 static int fill_io_u(struct thread_data *td, struct io_u *io_u)
681 if (td->io_ops->flags & FIO_NOIO)
684 set_rw_ddir(td, io_u);
687 * fsync() or fdatasync() or trim etc, we are done
689 if (!ddir_rw(io_u->ddir))
693 * See if it's time to switch to a new zone
695 if (td->zone_bytes >= td->o.zone_size && td->o.zone_skip) {
697 io_u->file->file_offset += td->o.zone_range + td->o.zone_skip;
698 io_u->file->last_pos = io_u->file->file_offset;
699 td->io_skip_bytes += td->o.zone_skip;
703 * No log, let the seq/rand engine retrieve the next buflen and
706 if (get_next_offset(td, io_u)) {
707 dprint(FD_IO, "io_u %p, failed getting offset\n", io_u);
711 io_u->buflen = get_next_buflen(td, io_u);
713 dprint(FD_IO, "io_u %p, failed getting buflen\n", io_u);
717 if (io_u->offset + io_u->buflen > io_u->file->real_file_size) {
718 dprint(FD_IO, "io_u %p, offset too large\n", io_u);
719 dprint(FD_IO, " off=%llu/%lu > %llu\n", io_u->offset,
720 io_u->buflen, io_u->file->real_file_size);
725 * mark entry before potentially trimming io_u
727 if (td_random(td) && file_randommap(td, io_u->file))
728 mark_random_map(td, io_u);
731 dprint_io_u(io_u, "fill_io_u");
732 td->zone_bytes += io_u->buflen;
736 static void __io_u_mark_map(unsigned int *map, unsigned int nr)
765 void io_u_mark_submit(struct thread_data *td, unsigned int nr)
767 __io_u_mark_map(td->ts.io_u_submit, nr);
768 td->ts.total_submit++;
771 void io_u_mark_complete(struct thread_data *td, unsigned int nr)
773 __io_u_mark_map(td->ts.io_u_complete, nr);
774 td->ts.total_complete++;
777 void io_u_mark_depth(struct thread_data *td, unsigned int nr)
781 switch (td->cur_depth) {
803 td->ts.io_u_map[idx] += nr;
806 static void io_u_mark_lat_usec(struct thread_data *td, unsigned long usec)
843 assert(idx < FIO_IO_U_LAT_U_NR);
844 td->ts.io_u_lat_u[idx]++;
847 static void io_u_mark_lat_msec(struct thread_data *td, unsigned long msec)
888 assert(idx < FIO_IO_U_LAT_M_NR);
889 td->ts.io_u_lat_m[idx]++;
892 static void io_u_mark_latency(struct thread_data *td, unsigned long usec)
895 io_u_mark_lat_usec(td, usec);
897 io_u_mark_lat_msec(td, usec / 1000);
901 * Get next file to service by choosing one at random
903 static struct fio_file *get_next_file_rand(struct thread_data *td,
904 enum fio_file_flags goodf,
905 enum fio_file_flags badf)
914 if (td->o.use_os_rand) {
915 r = os_random_long(&td->next_file_state);
916 fno = (unsigned int) ((double) td->o.nr_files
917 * (r / (OS_RAND_MAX + 1.0)));
919 r = __rand(&td->__next_file_state);
920 fno = (unsigned int) ((double) td->o.nr_files
921 * (r / (FRAND_MAX + 1.0)));
925 if (fio_file_done(f))
928 if (!fio_file_open(f)) {
931 err = td_io_open_file(td, f);
937 if ((!goodf || (f->flags & goodf)) && !(f->flags & badf)) {
938 dprint(FD_FILE, "get_next_file_rand: %p\n", f);
942 td_io_close_file(td, f);
947 * Get next file to service by doing round robin between all available ones
949 static struct fio_file *get_next_file_rr(struct thread_data *td, int goodf,
952 unsigned int old_next_file = td->next_file;
958 f = td->files[td->next_file];
961 if (td->next_file >= td->o.nr_files)
964 dprint(FD_FILE, "trying file %s %x\n", f->file_name, f->flags);
965 if (fio_file_done(f)) {
970 if (!fio_file_open(f)) {
973 err = td_io_open_file(td, f);
975 dprint(FD_FILE, "error %d on open of %s\n",
983 dprint(FD_FILE, "goodf=%x, badf=%x, ff=%x\n", goodf, badf,
985 if ((!goodf || (f->flags & goodf)) && !(f->flags & badf))
989 td_io_close_file(td, f);
992 } while (td->next_file != old_next_file);
994 dprint(FD_FILE, "get_next_file_rr: %p\n", f);
998 static struct fio_file *__get_next_file(struct thread_data *td)
1002 assert(td->o.nr_files <= td->files_index);
1004 if (td->nr_done_files >= td->o.nr_files) {
1005 dprint(FD_FILE, "get_next_file: nr_open=%d, nr_done=%d,"
1006 " nr_files=%d\n", td->nr_open_files,
1012 f = td->file_service_file;
1013 if (f && fio_file_open(f) && !fio_file_closing(f)) {
1014 if (td->o.file_service_type == FIO_FSERVICE_SEQ)
1016 if (td->file_service_left--)
1020 if (td->o.file_service_type == FIO_FSERVICE_RR ||
1021 td->o.file_service_type == FIO_FSERVICE_SEQ)
1022 f = get_next_file_rr(td, FIO_FILE_open, FIO_FILE_closing);
1024 f = get_next_file_rand(td, FIO_FILE_open, FIO_FILE_closing);
1026 td->file_service_file = f;
1027 td->file_service_left = td->file_service_nr - 1;
1029 dprint(FD_FILE, "get_next_file: %p [%s]\n", f, f->file_name);
1033 static struct fio_file *get_next_file(struct thread_data *td)
1035 if (!(td->flags & TD_F_PROFILE_OPS)) {
1036 struct prof_io_ops *ops = &td->prof_io_ops;
1038 if (ops->get_next_file)
1039 return ops->get_next_file(td);
1042 return __get_next_file(td);
1045 static int set_io_u_file(struct thread_data *td, struct io_u *io_u)
1050 f = get_next_file(td);
1057 if (!fill_io_u(td, io_u))
1060 put_file_log(td, f);
1061 td_io_close_file(td, f);
1063 fio_file_set_done(f);
1064 td->nr_done_files++;
1065 dprint(FD_FILE, "%s: is done (%d of %d)\n", f->file_name,
1066 td->nr_done_files, td->o.nr_files);
1073 struct io_u *__get_io_u(struct thread_data *td)
1075 struct io_u *io_u = NULL;
1080 if (!flist_empty(&td->io_u_requeues))
1081 io_u = flist_entry(td->io_u_requeues.next, struct io_u, list);
1082 else if (!queue_full(td)) {
1083 io_u = flist_entry(td->io_u_freelist.next, struct io_u, list);
1088 io_u->end_io = NULL;
1092 assert(io_u->flags & IO_U_F_FREE);
1093 io_u->flags &= ~(IO_U_F_FREE | IO_U_F_FREE_DEF);
1094 io_u->flags &= ~(IO_U_F_TRIMMED | IO_U_F_BARRIER);
1095 io_u->flags &= ~IO_U_F_VER_LIST;
1098 io_u->acct_ddir = -1;
1099 flist_del(&io_u->list);
1100 flist_add_tail(&io_u->list, &td->io_u_busylist);
1102 io_u->flags |= IO_U_F_IN_CUR_DEPTH;
1103 } else if (td->o.verify_async) {
1105 * We ran out, wait for async verify threads to finish and
1108 pthread_cond_wait(&td->free_cond, &td->io_u_lock);
1116 static int check_get_trim(struct thread_data *td, struct io_u *io_u)
1118 if (!(td->flags & TD_F_TRIM_BACKLOG))
1121 if (td->trim_entries) {
1124 if (td->trim_batch) {
1127 } else if (!(td->io_hist_len % td->o.trim_backlog) &&
1128 td->last_ddir != DDIR_READ) {
1129 td->trim_batch = td->o.trim_batch;
1130 if (!td->trim_batch)
1131 td->trim_batch = td->o.trim_backlog;
1135 if (get_trim && !get_next_trim(td, io_u))
1142 static int check_get_verify(struct thread_data *td, struct io_u *io_u)
1144 if (!(td->flags & TD_F_VER_BACKLOG))
1147 if (td->io_hist_len) {
1150 if (td->verify_batch)
1152 else if (!(td->io_hist_len % td->o.verify_backlog) &&
1153 td->last_ddir != DDIR_READ) {
1154 td->verify_batch = td->o.verify_batch;
1155 if (!td->verify_batch)
1156 td->verify_batch = td->o.verify_backlog;
1160 if (get_verify && !get_next_verify(td, io_u)) {
1170 * Fill offset and start time into the buffer content, to prevent too
1171 * easy compressible data for simple de-dupe attempts. Do this for every
1172 * 512b block in the range, since that should be the smallest block size
1173 * we can expect from a device.
1175 static void small_content_scramble(struct io_u *io_u)
1177 unsigned int i, nr_blocks = io_u->buflen / 512;
1179 unsigned int offset;
1186 boffset = io_u->offset;
1187 io_u->buf_filled_len = 0;
1189 for (i = 0; i < nr_blocks; i++) {
1191 * Fill the byte offset into a "random" start offset of
1192 * the buffer, given by the product of the usec time
1193 * and the actual offset.
1195 offset = (io_u->start_time.tv_usec ^ boffset) & 511;
1196 offset &= ~(sizeof(uint64_t) - 1);
1197 if (offset >= 512 - sizeof(uint64_t))
1198 offset -= sizeof(uint64_t);
1199 memcpy(p + offset, &boffset, sizeof(boffset));
1201 end = p + 512 - sizeof(io_u->start_time);
1202 memcpy(end, &io_u->start_time, sizeof(io_u->start_time));
1209 * Return an io_u to be processed. Gets a buflen and offset, sets direction,
1210 * etc. The returned io_u is fully ready to be prepped and submitted.
1212 struct io_u *get_io_u(struct thread_data *td)
1216 int do_scramble = 0;
1218 io_u = __get_io_u(td);
1220 dprint(FD_IO, "__get_io_u failed\n");
1224 if (check_get_verify(td, io_u))
1226 if (check_get_trim(td, io_u))
1230 * from a requeue, io_u already setup
1236 * If using an iolog, grab next piece if any available.
1238 if (td->flags & TD_F_READ_IOLOG) {
1239 if (read_iolog_get(td, io_u))
1241 } else if (set_io_u_file(td, io_u)) {
1242 dprint(FD_IO, "io_u %p, setting file failed\n", io_u);
1247 assert(fio_file_open(f));
1249 if (ddir_rw(io_u->ddir)) {
1250 if (!io_u->buflen && !(td->io_ops->flags & FIO_NOIO)) {
1251 dprint(FD_IO, "get_io_u: zero buflen on %p\n", io_u);
1255 f->last_start = io_u->offset;
1256 f->last_pos = io_u->offset + io_u->buflen;
1258 if (io_u->ddir == DDIR_WRITE) {
1259 if (td->flags & TD_F_REFILL_BUFFERS) {
1260 io_u_fill_buffer(td, io_u,
1261 io_u->xfer_buflen, io_u->xfer_buflen);
1262 } else if (td->flags & TD_F_SCRAMBLE_BUFFERS)
1264 if (td->flags & TD_F_VER_NONE) {
1265 populate_verify_io_u(td, io_u);
1268 } else if (io_u->ddir == DDIR_READ) {
1270 * Reset the buf_filled parameters so next time if the
1271 * buffer is used for writes it is refilled.
1273 io_u->buf_filled_len = 0;
1278 * Set io data pointers.
1280 io_u->xfer_buf = io_u->buf;
1281 io_u->xfer_buflen = io_u->buflen;
1285 if (!td_io_prep(td, io_u)) {
1286 if (!td->o.disable_slat)
1287 fio_gettime(&io_u->start_time, NULL);
1289 small_content_scramble(io_u);
1293 dprint(FD_IO, "get_io_u failed\n");
1298 void io_u_log_error(struct thread_data *td, struct io_u *io_u)
1300 enum error_type_bit eb = td_error_type(io_u->ddir, io_u->error);
1301 const char *msg[] = { "read", "write", "sync", "datasync",
1302 "sync_file_range", "wait", "trim" };
1304 if (td_non_fatal_error(td, eb, io_u->error) && !td->o.error_dump)
1307 log_err("fio: io_u error");
1310 log_err(" on file %s", io_u->file->file_name);
1312 log_err(": %s\n", strerror(io_u->error));
1314 log_err(" %s offset=%llu, buflen=%lu\n", msg[io_u->ddir],
1315 io_u->offset, io_u->xfer_buflen);
1318 td_verror(td, io_u->error, "io_u error");
1321 static void account_io_completion(struct thread_data *td, struct io_u *io_u,
1322 struct io_completion_data *icd,
1323 const enum fio_ddir idx, unsigned int bytes)
1325 unsigned long lusec = 0;
1327 if (!td->o.disable_clat || !td->o.disable_bw)
1328 lusec = utime_since(&io_u->issue_time, &icd->time);
1330 if (!td->o.disable_lat) {
1331 unsigned long tusec;
1333 tusec = utime_since(&io_u->start_time, &icd->time);
1334 add_lat_sample(td, idx, tusec, bytes);
1336 if (td->o.max_latency && tusec > td->o.max_latency) {
1338 log_err("fio: latency of %lu usec exceeds specified max (%u usec)\n", tusec, td->o.max_latency);
1339 td_verror(td, ETIMEDOUT, "max latency exceeded");
1340 icd->error = ETIMEDOUT;
1344 if (!td->o.disable_clat) {
1345 add_clat_sample(td, idx, lusec, bytes);
1346 io_u_mark_latency(td, lusec);
1349 if (!td->o.disable_bw)
1350 add_bw_sample(td, idx, bytes, &icd->time);
1352 add_iops_sample(td, idx, &icd->time);
1355 static long long usec_for_io(struct thread_data *td, enum fio_ddir ddir)
1357 uint64_t secs, remainder, bps, bytes;
1359 bytes = td->this_io_bytes[ddir];
1360 bps = td->rate_bps[ddir];
1362 remainder = bytes % bps;
1363 return remainder * 1000000 / bps + secs * 1000000;
1366 static void io_completed(struct thread_data *td, struct io_u *io_u,
1367 struct io_completion_data *icd)
1371 dprint_io_u(io_u, "io complete");
1374 assert(io_u->flags & IO_U_F_FLIGHT);
1375 io_u->flags &= ~(IO_U_F_FLIGHT | IO_U_F_BUSY_OK);
1378 if (ddir_sync(io_u->ddir)) {
1379 td->last_was_sync = 1;
1382 f->first_write = -1ULL;
1383 f->last_write = -1ULL;
1388 td->last_was_sync = 0;
1389 td->last_ddir = io_u->ddir;
1391 if (!io_u->error && ddir_rw(io_u->ddir)) {
1392 unsigned int bytes = io_u->buflen - io_u->resid;
1393 const enum fio_ddir idx = io_u->ddir;
1394 const enum fio_ddir odx = io_u->ddir ^ 1;
1397 td->io_blocks[idx]++;
1398 td->this_io_blocks[idx]++;
1399 td->io_bytes[idx] += bytes;
1401 if (!(io_u->flags & IO_U_F_VER_LIST))
1402 td->this_io_bytes[idx] += bytes;
1404 if (idx == DDIR_WRITE) {
1407 if (f->first_write == -1ULL ||
1408 io_u->offset < f->first_write)
1409 f->first_write = io_u->offset;
1410 if (f->last_write == -1ULL ||
1411 ((io_u->offset + bytes) > f->last_write))
1412 f->last_write = io_u->offset + bytes;
1416 if (ramp_time_over(td) && (td->runstate == TD_RUNNING ||
1417 td->runstate == TD_VERIFYING)) {
1418 account_io_completion(td, io_u, icd, idx, bytes);
1420 if (__should_check_rate(td, idx)) {
1421 td->rate_pending_usleep[idx] =
1422 (usec_for_io(td, idx) -
1423 utime_since_now(&td->start));
1425 if (idx != DDIR_TRIM && __should_check_rate(td, odx))
1426 td->rate_pending_usleep[odx] =
1427 (usec_for_io(td, odx) -
1428 utime_since_now(&td->start));
1431 if (td_write(td) && idx == DDIR_WRITE &&
1433 td->o.verify != VERIFY_NONE &&
1434 !td->o.experimental_verify)
1435 log_io_piece(td, io_u);
1437 icd->bytes_done[idx] += bytes;
1440 ret = io_u->end_io(td, io_u);
1441 if (ret && !icd->error)
1444 } else if (io_u->error) {
1445 icd->error = io_u->error;
1446 io_u_log_error(td, io_u);
1449 enum error_type_bit eb = td_error_type(io_u->ddir, icd->error);
1450 if (!td_non_fatal_error(td, eb, icd->error))
1453 * If there is a non_fatal error, then add to the error count
1454 * and clear all the errors.
1456 update_error_count(td, icd->error);
1463 static void init_icd(struct thread_data *td, struct io_completion_data *icd,
1467 if (!td->o.disable_clat || !td->o.disable_bw)
1468 fio_gettime(&icd->time, NULL);
1473 for (ddir = DDIR_READ; ddir < DDIR_RWDIR_CNT; ddir++)
1474 icd->bytes_done[ddir] = 0;
1477 static void ios_completed(struct thread_data *td,
1478 struct io_completion_data *icd)
1483 for (i = 0; i < icd->nr; i++) {
1484 io_u = td->io_ops->event(td, i);
1486 io_completed(td, io_u, icd);
1488 if (!(io_u->flags & IO_U_F_FREE_DEF))
1494 * Complete a single io_u for the sync engines.
1496 int io_u_sync_complete(struct thread_data *td, struct io_u *io_u,
1499 struct io_completion_data icd;
1501 init_icd(td, &icd, 1);
1502 io_completed(td, io_u, &icd);
1504 if (!(io_u->flags & IO_U_F_FREE_DEF))
1508 td_verror(td, icd.error, "io_u_sync_complete");
1515 for (ddir = DDIR_READ; ddir < DDIR_RWDIR_CNT; ddir++)
1516 bytes[ddir] += icd.bytes_done[ddir];
1523 * Called to complete min_events number of io for the async engines.
1525 int io_u_queued_complete(struct thread_data *td, int min_evts,
1528 struct io_completion_data icd;
1529 struct timespec *tvp = NULL;
1531 struct timespec ts = { .tv_sec = 0, .tv_nsec = 0, };
1533 dprint(FD_IO, "io_u_queued_completed: min=%d\n", min_evts);
1538 ret = td_io_getevents(td, min_evts, td->o.iodepth_batch_complete, tvp);
1540 td_verror(td, -ret, "td_io_getevents");
1545 init_icd(td, &icd, ret);
1546 ios_completed(td, &icd);
1548 td_verror(td, icd.error, "io_u_queued_complete");
1555 for (ddir = DDIR_READ; ddir < DDIR_RWDIR_CNT; ddir++)
1556 bytes[ddir] += icd.bytes_done[ddir];
1563 * Call when io_u is really queued, to update the submission latency.
1565 void io_u_queued(struct thread_data *td, struct io_u *io_u)
1567 if (!td->o.disable_slat) {
1568 unsigned long slat_time;
1570 slat_time = utime_since(&io_u->start_time, &io_u->issue_time);
1571 add_slat_sample(td, io_u->ddir, slat_time, io_u->xfer_buflen);
1576 * "randomly" fill the buffer contents
1578 void io_u_fill_buffer(struct thread_data *td, struct io_u *io_u,
1579 unsigned int min_write, unsigned int max_bs)
1581 io_u->buf_filled_len = 0;
1583 if (!td->o.zero_buffers) {
1584 unsigned int perc = td->o.compress_percentage;
1587 unsigned int seg = min_write;
1589 seg = min(min_write, td->o.compress_chunk);
1590 fill_random_buf_percentage(&td->buf_state, io_u->buf,
1593 fill_random_buf(&td->buf_state, io_u->buf, max_bs);
1595 memset(io_u->buf, 0, max_bs);