14 struct io_completion_data {
17 int error; /* output */
18 unsigned long bytes_done[2]; /* output */
19 struct timeval time; /* output */
23 * The ->file_map[] 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 int random_map_free(struct fio_file *f, const unsigned long long block)
28 unsigned int idx = RAND_MAP_IDX(f, block);
29 unsigned int bit = RAND_MAP_BIT(f, block);
31 dprint(FD_RANDOM, "free: b=%llu, idx=%u, bit=%u\n", block, idx, bit);
33 return (f->file_map[idx] & (1UL << bit)) == 0;
37 * Mark a given offset as used in the map.
39 static void mark_random_map(struct thread_data *td, struct io_u *io_u)
41 unsigned int min_bs = td->o.rw_min_bs;
42 struct fio_file *f = io_u->file;
43 unsigned long long block;
44 unsigned int blocks, nr_blocks;
47 block = (io_u->offset - f->file_offset) / (unsigned long long) min_bs;
48 nr_blocks = (io_u->buflen + min_bs - 1) / min_bs;
50 busy_check = !(io_u->flags & IO_U_F_BUSY_OK);
53 unsigned int idx, bit;
54 unsigned long mask, this_blocks;
57 * If we have a mixed random workload, we may
58 * encounter blocks we already did IO to.
64 if ((td->o.ddir_seq_nr == 1) && !random_map_free(f, block))
67 idx = RAND_MAP_IDX(f, block);
68 bit = RAND_MAP_BIT(f, block);
70 fio_assert(td, idx < f->num_maps);
72 this_blocks = nr_blocks;
73 if (this_blocks + bit > BLOCKS_PER_MAP)
74 this_blocks = BLOCKS_PER_MAP - bit;
77 if (this_blocks == BLOCKS_PER_MAP)
80 mask = ((1UL << this_blocks) - 1) << bit;
82 if (!(f->file_map[idx] & mask))
86 } while (this_blocks);
91 f->file_map[idx] |= mask;
92 nr_blocks -= this_blocks;
93 blocks += this_blocks;
97 if ((blocks * min_bs) < io_u->buflen)
98 io_u->buflen = blocks * min_bs;
101 static unsigned long long last_block(struct thread_data *td, struct fio_file *f,
104 unsigned long long max_blocks;
105 unsigned long long max_size;
107 assert(ddir_rw(ddir));
110 * Hmm, should we make sure that ->io_size <= ->real_file_size?
112 max_size = f->io_size;
113 if (max_size > f->real_file_size)
114 max_size = f->real_file_size;
116 max_blocks = max_size / (unsigned long long) td->o.ba[ddir];
124 * Return the next free block in the map.
126 static int get_next_free_block(struct thread_data *td, struct fio_file *f,
127 enum fio_ddir ddir, unsigned long long *b)
129 unsigned long long block, min_bs = td->o.rw_min_bs, lastb;
132 lastb = last_block(td, f, ddir);
136 i = f->last_free_lookup;
137 block = i * BLOCKS_PER_MAP;
138 while (block * min_bs < f->real_file_size &&
139 block * min_bs < f->io_size) {
140 if (f->file_map[i] != -1UL) {
141 block += ffz(f->file_map[i]);
144 f->last_free_lookup = i;
149 block += BLOCKS_PER_MAP;
153 dprint(FD_IO, "failed finding a free block\n");
157 static int get_next_rand_offset(struct thread_data *td, struct fio_file *f,
158 enum fio_ddir ddir, unsigned long long *b)
160 unsigned long long r, lastb;
163 lastb = last_block(td, f, ddir);
167 if (f->failed_rands >= 200)
171 if (td->o.use_os_rand) {
172 r = os_random_long(&td->random_state);
173 *b = (lastb - 1) * (r / ((unsigned long long) OS_RAND_MAX + 1.0));
175 r = __rand(&td->__random_state);
176 *b = (lastb - 1) * (r / ((unsigned long long) FRAND_MAX + 1.0));
179 dprint(FD_RANDOM, "off rand %llu\n", r);
183 * if we are not maintaining a random map, we are done.
185 if (!file_randommap(td, f))
189 * calculate map offset and check if it's free
191 if (random_map_free(f, *b))
194 dprint(FD_RANDOM, "get_next_rand_offset: offset %llu busy\n",
198 if (!f->failed_rands++)
199 f->last_free_lookup = 0;
202 * we get here, if we didn't suceed in looking up a block. generate
203 * a random start offset into the filemap, and find the first free
208 f->last_free_lookup = (f->num_maps - 1) *
209 (r / (OS_RAND_MAX + 1.0));
210 if (!get_next_free_block(td, f, ddir, b))
213 if (td->o.use_os_rand)
214 r = os_random_long(&td->random_state);
216 r = __rand(&td->__random_state);
220 * that didn't work either, try exhaustive search from the start
222 f->last_free_lookup = 0;
224 if (!get_next_free_block(td, f, ddir, b))
226 f->last_free_lookup = 0;
227 return get_next_free_block(td, f, ddir, b);
234 static int get_next_rand_block(struct thread_data *td, struct fio_file *f,
235 enum fio_ddir ddir, unsigned long long *b)
237 if (get_next_rand_offset(td, f, ddir, b)) {
238 dprint(FD_IO, "%s: rand offset failed, last=%llu, size=%llu\n",
239 f->file_name, f->last_pos, f->real_file_size);
246 static int get_next_seq_block(struct thread_data *td, struct fio_file *f,
247 enum fio_ddir ddir, unsigned long long *b)
249 assert(ddir_rw(ddir));
251 if (f->last_pos < f->real_file_size) {
252 unsigned long long pos = f->last_pos - f->file_offset;
255 pos += td->o.ddir_seq_add;
257 *b = pos / td->o.min_bs[ddir];
264 static int get_next_block(struct thread_data *td, struct io_u *io_u,
265 enum fio_ddir ddir, int rw_seq, unsigned long long *b)
267 struct fio_file *f = io_u->file;
270 assert(ddir_rw(ddir));
274 ret = get_next_rand_block(td, f, ddir, b);
276 ret = get_next_seq_block(td, f, ddir, b);
278 io_u->flags |= IO_U_F_BUSY_OK;
280 if (td->o.rw_seq == RW_SEQ_SEQ) {
281 ret = get_next_seq_block(td, f, ddir, b);
283 ret = get_next_rand_block(td, f, ddir, b);
284 } else if (td->o.rw_seq == RW_SEQ_IDENT) {
285 if (f->last_start != -1ULL)
286 *b = (f->last_start - f->file_offset)
287 / td->o.min_bs[ddir];
292 log_err("fio: unknown rw_seq=%d\n", td->o.rw_seq);
301 * For random io, generate a random new block and see if it's used. Repeat
302 * until we find a free one. For sequential io, just return the end of
303 * the last io issued.
305 static int __get_next_offset(struct thread_data *td, struct io_u *io_u)
307 struct fio_file *f = io_u->file;
308 unsigned long long b;
309 enum fio_ddir ddir = io_u->ddir;
312 assert(ddir_rw(ddir));
314 if (td->o.ddir_seq_nr && !--td->ddir_seq_nr) {
316 td->ddir_seq_nr = td->o.ddir_seq_nr;
319 if (get_next_block(td, io_u, ddir, rw_seq_hit, &b))
322 io_u->offset = b * td->o.ba[ddir];
323 if (io_u->offset >= f->io_size) {
324 dprint(FD_IO, "get_next_offset: offset %llu >= io_size %llu\n",
325 io_u->offset, f->io_size);
329 io_u->offset += f->file_offset;
330 if (io_u->offset >= f->real_file_size) {
331 dprint(FD_IO, "get_next_offset: offset %llu >= size %llu\n",
332 io_u->offset, f->real_file_size);
339 static int get_next_offset(struct thread_data *td, struct io_u *io_u)
341 struct prof_io_ops *ops = &td->prof_io_ops;
343 if (ops->fill_io_u_off)
344 return ops->fill_io_u_off(td, io_u);
346 return __get_next_offset(td, io_u);
349 static inline int io_u_fits(struct thread_data *td, struct io_u *io_u,
352 struct fio_file *f = io_u->file;
354 return io_u->offset + buflen <= f->io_size + td->o.start_offset;
357 static unsigned int __get_next_buflen(struct thread_data *td, struct io_u *io_u)
359 const int ddir = io_u->ddir;
360 unsigned int uninitialized_var(buflen);
361 unsigned int minbs, maxbs;
362 unsigned long r, rand_max;
364 assert(ddir_rw(ddir));
366 minbs = td->o.min_bs[ddir];
367 maxbs = td->o.max_bs[ddir];
372 if (td->o.use_os_rand)
373 rand_max = OS_RAND_MAX;
375 rand_max = FRAND_MAX;
378 if (td->o.use_os_rand)
379 r = os_random_long(&td->bsrange_state);
381 r = __rand(&td->__bsrange_state);
383 if (!td->o.bssplit_nr[ddir]) {
384 buflen = 1 + (unsigned int) ((double) maxbs *
385 (r / (rand_max + 1.0)));
392 for (i = 0; i < td->o.bssplit_nr[ddir]; i++) {
393 struct bssplit *bsp = &td->o.bssplit[ddir][i];
397 if ((r <= ((rand_max / 100L) * perc)) &&
398 io_u_fits(td, io_u, buflen))
403 if (!td->o.bs_unaligned && is_power_of_2(minbs))
404 buflen = (buflen + minbs - 1) & ~(minbs - 1);
406 } while (!io_u_fits(td, io_u, buflen));
411 static unsigned int get_next_buflen(struct thread_data *td, struct io_u *io_u)
413 struct prof_io_ops *ops = &td->prof_io_ops;
415 if (ops->fill_io_u_size)
416 return ops->fill_io_u_size(td, io_u);
418 return __get_next_buflen(td, io_u);
421 static void set_rwmix_bytes(struct thread_data *td)
426 * we do time or byte based switch. this is needed because
427 * buffered writes may issue a lot quicker than they complete,
428 * whereas reads do not.
430 diff = td->o.rwmix[td->rwmix_ddir ^ 1];
431 td->rwmix_issues = (td->io_issues[td->rwmix_ddir] * diff) / 100;
434 static inline enum fio_ddir get_rand_ddir(struct thread_data *td)
439 if (td->o.use_os_rand) {
440 r = os_random_long(&td->rwmix_state);
441 v = 1 + (int) (100.0 * (r / (OS_RAND_MAX + 1.0)));
443 r = __rand(&td->__rwmix_state);
444 v = 1 + (int) (100.0 * (r / (FRAND_MAX + 1.0)));
447 if (v <= td->o.rwmix[DDIR_READ])
453 static enum fio_ddir rate_ddir(struct thread_data *td, enum fio_ddir ddir)
455 enum fio_ddir odir = ddir ^ 1;
459 assert(ddir_rw(ddir));
461 if (td->rate_pending_usleep[ddir] <= 0)
465 * We have too much pending sleep in this direction. See if we
470 * Other direction does not have too much pending, switch
472 if (td->rate_pending_usleep[odir] < 100000)
476 * Both directions have pending sleep. Sleep the minimum time
477 * and deduct from both.
479 if (td->rate_pending_usleep[ddir] <=
480 td->rate_pending_usleep[odir]) {
481 usec = td->rate_pending_usleep[ddir];
483 usec = td->rate_pending_usleep[odir];
487 usec = td->rate_pending_usleep[ddir];
489 fio_gettime(&t, NULL);
490 usec_sleep(td, usec);
491 usec = utime_since_now(&t);
493 td->rate_pending_usleep[ddir] -= usec;
496 if (td_rw(td) && __should_check_rate(td, odir))
497 td->rate_pending_usleep[odir] -= usec;
503 * Return the data direction for the next io_u. If the job is a
504 * mixed read/write workload, check the rwmix cycle and switch if
507 static enum fio_ddir get_rw_ddir(struct thread_data *td)
512 * see if it's time to fsync
514 if (td->o.fsync_blocks &&
515 !(td->io_issues[DDIR_WRITE] % td->o.fsync_blocks) &&
516 td->io_issues[DDIR_WRITE] && should_fsync(td))
520 * see if it's time to fdatasync
522 if (td->o.fdatasync_blocks &&
523 !(td->io_issues[DDIR_WRITE] % td->o.fdatasync_blocks) &&
524 td->io_issues[DDIR_WRITE] && should_fsync(td))
525 return DDIR_DATASYNC;
528 * see if it's time to sync_file_range
530 if (td->sync_file_range_nr &&
531 !(td->io_issues[DDIR_WRITE] % td->sync_file_range_nr) &&
532 td->io_issues[DDIR_WRITE] && should_fsync(td))
533 return DDIR_SYNC_FILE_RANGE;
537 * Check if it's time to seed a new data direction.
539 if (td->io_issues[td->rwmix_ddir] >= td->rwmix_issues) {
541 * Put a top limit on how many bytes we do for
542 * one data direction, to avoid overflowing the
545 ddir = get_rand_ddir(td);
547 if (ddir != td->rwmix_ddir)
550 td->rwmix_ddir = ddir;
552 ddir = td->rwmix_ddir;
553 } else if (td_read(td))
558 td->rwmix_ddir = rate_ddir(td, ddir);
559 return td->rwmix_ddir;
562 static void set_rw_ddir(struct thread_data *td, struct io_u *io_u)
564 io_u->ddir = get_rw_ddir(td);
566 if (io_u->ddir == DDIR_WRITE && (td->io_ops->flags & FIO_BARRIER) &&
567 td->o.barrier_blocks &&
568 !(td->io_issues[DDIR_WRITE] % td->o.barrier_blocks) &&
569 td->io_issues[DDIR_WRITE])
570 io_u->flags |= IO_U_F_BARRIER;
573 void put_file_log(struct thread_data *td, struct fio_file *f)
575 int ret = put_file(td, f);
578 td_verror(td, ret, "file close");
581 void put_io_u(struct thread_data *td, struct io_u *io_u)
585 io_u->flags |= IO_U_F_FREE;
586 io_u->flags &= ~IO_U_F_FREE_DEF;
589 put_file_log(td, io_u->file);
592 if (io_u->flags & IO_U_F_IN_CUR_DEPTH)
594 flist_del_init(&io_u->list);
595 flist_add(&io_u->list, &td->io_u_freelist);
597 td_io_u_free_notify(td);
600 void clear_io_u(struct thread_data *td, struct io_u *io_u)
602 io_u->flags &= ~IO_U_F_FLIGHT;
606 void requeue_io_u(struct thread_data *td, struct io_u **io_u)
608 struct io_u *__io_u = *io_u;
610 dprint(FD_IO, "requeue %p\n", __io_u);
614 __io_u->flags |= IO_U_F_FREE;
615 if ((__io_u->flags & IO_U_F_FLIGHT) && ddir_rw(__io_u->ddir))
616 td->io_issues[__io_u->ddir]--;
618 __io_u->flags &= ~IO_U_F_FLIGHT;
619 if (__io_u->flags & IO_U_F_IN_CUR_DEPTH)
621 flist_del(&__io_u->list);
622 flist_add_tail(&__io_u->list, &td->io_u_requeues);
627 static int fill_io_u(struct thread_data *td, struct io_u *io_u)
629 if (td->io_ops->flags & FIO_NOIO)
632 set_rw_ddir(td, io_u);
635 * fsync() or fdatasync() or trim etc, we are done
637 if (!ddir_rw(io_u->ddir))
641 * See if it's time to switch to a new zone
643 if (td->zone_bytes >= td->o.zone_size) {
645 io_u->file->last_pos += td->o.zone_skip;
646 td->io_skip_bytes += td->o.zone_skip;
650 * No log, let the seq/rand engine retrieve the next buflen and
653 if (get_next_offset(td, io_u)) {
654 dprint(FD_IO, "io_u %p, failed getting offset\n", io_u);
658 io_u->buflen = get_next_buflen(td, io_u);
660 dprint(FD_IO, "io_u %p, failed getting buflen\n", io_u);
664 if (io_u->offset + io_u->buflen > io_u->file->real_file_size) {
665 dprint(FD_IO, "io_u %p, offset too large\n", io_u);
666 dprint(FD_IO, " off=%llu/%lu > %llu\n", io_u->offset,
667 io_u->buflen, io_u->file->real_file_size);
672 * mark entry before potentially trimming io_u
674 if (td_random(td) && file_randommap(td, io_u->file))
675 mark_random_map(td, io_u);
678 * If using a write iolog, store this entry.
681 dprint_io_u(io_u, "fill_io_u");
682 td->zone_bytes += io_u->buflen;
687 static void __io_u_mark_map(unsigned int *map, unsigned int nr)
716 void io_u_mark_submit(struct thread_data *td, unsigned int nr)
718 __io_u_mark_map(td->ts.io_u_submit, nr);
719 td->ts.total_submit++;
722 void io_u_mark_complete(struct thread_data *td, unsigned int nr)
724 __io_u_mark_map(td->ts.io_u_complete, nr);
725 td->ts.total_complete++;
728 void io_u_mark_depth(struct thread_data *td, unsigned int nr)
732 switch (td->cur_depth) {
754 td->ts.io_u_map[idx] += nr;
757 static void io_u_mark_lat_usec(struct thread_data *td, unsigned long usec)
794 assert(idx < FIO_IO_U_LAT_U_NR);
795 td->ts.io_u_lat_u[idx]++;
798 static void io_u_mark_lat_msec(struct thread_data *td, unsigned long msec)
839 assert(idx < FIO_IO_U_LAT_M_NR);
840 td->ts.io_u_lat_m[idx]++;
843 static void io_u_mark_latency(struct thread_data *td, unsigned long usec)
846 io_u_mark_lat_usec(td, usec);
848 io_u_mark_lat_msec(td, usec / 1000);
852 * Get next file to service by choosing one at random
854 static struct fio_file *get_next_file_rand(struct thread_data *td,
855 enum fio_file_flags goodf,
856 enum fio_file_flags badf)
865 if (td->o.use_os_rand) {
866 r = os_random_long(&td->next_file_state);
867 fno = (unsigned int) ((double) td->o.nr_files
868 * (r / (OS_RAND_MAX + 1.0)));
870 r = __rand(&td->__next_file_state);
871 fno = (unsigned int) ((double) td->o.nr_files
872 * (r / (FRAND_MAX + 1.0)));
876 if (fio_file_done(f))
879 if (!fio_file_open(f)) {
882 err = td_io_open_file(td, f);
888 if ((!goodf || (f->flags & goodf)) && !(f->flags & badf)) {
889 dprint(FD_FILE, "get_next_file_rand: %p\n", f);
893 td_io_close_file(td, f);
898 * Get next file to service by doing round robin between all available ones
900 static struct fio_file *get_next_file_rr(struct thread_data *td, int goodf,
903 unsigned int old_next_file = td->next_file;
909 f = td->files[td->next_file];
912 if (td->next_file >= td->o.nr_files)
915 dprint(FD_FILE, "trying file %s %x\n", f->file_name, f->flags);
916 if (fio_file_done(f)) {
921 if (!fio_file_open(f)) {
924 err = td_io_open_file(td, f);
926 dprint(FD_FILE, "error %d on open of %s\n",
934 dprint(FD_FILE, "goodf=%x, badf=%x, ff=%x\n", goodf, badf,
936 if ((!goodf || (f->flags & goodf)) && !(f->flags & badf))
940 td_io_close_file(td, f);
943 } while (td->next_file != old_next_file);
945 dprint(FD_FILE, "get_next_file_rr: %p\n", f);
949 static struct fio_file *__get_next_file(struct thread_data *td)
953 assert(td->o.nr_files <= td->files_index);
955 if (td->nr_done_files >= td->o.nr_files) {
956 dprint(FD_FILE, "get_next_file: nr_open=%d, nr_done=%d,"
957 " nr_files=%d\n", td->nr_open_files,
963 f = td->file_service_file;
964 if (f && fio_file_open(f) && !fio_file_closing(f)) {
965 if (td->o.file_service_type == FIO_FSERVICE_SEQ)
967 if (td->file_service_left--)
971 if (td->o.file_service_type == FIO_FSERVICE_RR ||
972 td->o.file_service_type == FIO_FSERVICE_SEQ)
973 f = get_next_file_rr(td, FIO_FILE_open, FIO_FILE_closing);
975 f = get_next_file_rand(td, FIO_FILE_open, FIO_FILE_closing);
977 td->file_service_file = f;
978 td->file_service_left = td->file_service_nr - 1;
980 dprint(FD_FILE, "get_next_file: %p [%s]\n", f, f->file_name);
984 static struct fio_file *get_next_file(struct thread_data *td)
986 struct prof_io_ops *ops = &td->prof_io_ops;
988 if (ops->get_next_file)
989 return ops->get_next_file(td);
991 return __get_next_file(td);
994 static int set_io_u_file(struct thread_data *td, struct io_u *io_u)
999 f = get_next_file(td);
1006 if (!fill_io_u(td, io_u))
1009 put_file_log(td, f);
1010 td_io_close_file(td, f);
1012 fio_file_set_done(f);
1013 td->nr_done_files++;
1014 dprint(FD_FILE, "%s: is done (%d of %d)\n", f->file_name,
1015 td->nr_done_files, td->o.nr_files);
1022 struct io_u *__get_io_u(struct thread_data *td)
1024 struct io_u *io_u = NULL;
1029 if (!flist_empty(&td->io_u_requeues))
1030 io_u = flist_entry(td->io_u_requeues.next, struct io_u, list);
1031 else if (!queue_full(td)) {
1032 io_u = flist_entry(td->io_u_freelist.next, struct io_u, list);
1037 io_u->end_io = NULL;
1041 assert(io_u->flags & IO_U_F_FREE);
1042 io_u->flags &= ~(IO_U_F_FREE | IO_U_F_FREE_DEF);
1043 io_u->flags &= ~(IO_U_F_TRIMMED | IO_U_F_BARRIER);
1046 flist_del(&io_u->list);
1047 flist_add(&io_u->list, &td->io_u_busylist);
1049 io_u->flags |= IO_U_F_IN_CUR_DEPTH;
1050 } else if (td->o.verify_async) {
1052 * We ran out, wait for async verify threads to finish and
1055 pthread_cond_wait(&td->free_cond, &td->io_u_lock);
1063 static int check_get_trim(struct thread_data *td, struct io_u *io_u)
1065 if (td->o.trim_backlog && td->trim_entries) {
1068 if (td->trim_batch) {
1071 } else if (!(td->io_hist_len % td->o.trim_backlog) &&
1072 td->last_ddir != DDIR_READ) {
1073 td->trim_batch = td->o.trim_batch;
1074 if (!td->trim_batch)
1075 td->trim_batch = td->o.trim_backlog;
1079 if (get_trim && !get_next_trim(td, io_u))
1086 static int check_get_verify(struct thread_data *td, struct io_u *io_u)
1088 if (td->o.verify_backlog && td->io_hist_len) {
1091 if (td->verify_batch) {
1094 } else if (!(td->io_hist_len % td->o.verify_backlog) &&
1095 td->last_ddir != DDIR_READ) {
1096 td->verify_batch = td->o.verify_batch;
1097 if (!td->verify_batch)
1098 td->verify_batch = td->o.verify_backlog;
1102 if (get_verify && !get_next_verify(td, io_u))
1110 * Return an io_u to be processed. Gets a buflen and offset, sets direction,
1111 * etc. The returned io_u is fully ready to be prepped and submitted.
1113 struct io_u *get_io_u(struct thread_data *td)
1118 io_u = __get_io_u(td);
1120 dprint(FD_IO, "__get_io_u failed\n");
1124 if (check_get_verify(td, io_u))
1126 if (check_get_trim(td, io_u))
1130 * from a requeue, io_u already setup
1136 * If using an iolog, grab next piece if any available.
1138 if (td->o.read_iolog_file) {
1139 if (read_iolog_get(td, io_u))
1141 } else if (set_io_u_file(td, io_u)) {
1142 dprint(FD_IO, "io_u %p, setting file failed\n", io_u);
1147 assert(fio_file_open(f));
1149 if (ddir_rw(io_u->ddir)) {
1150 if (!io_u->buflen && !(td->io_ops->flags & FIO_NOIO)) {
1151 dprint(FD_IO, "get_io_u: zero buflen on %p\n", io_u);
1155 f->last_start = io_u->offset;
1156 f->last_pos = io_u->offset + io_u->buflen;
1158 if (td->o.verify != VERIFY_NONE && io_u->ddir == DDIR_WRITE)
1159 populate_verify_io_u(td, io_u);
1160 else if (td->o.refill_buffers && io_u->ddir == DDIR_WRITE)
1161 io_u_fill_buffer(td, io_u, io_u->xfer_buflen);
1162 else if (io_u->ddir == DDIR_READ) {
1164 * Reset the buf_filled parameters so next time if the
1165 * buffer is used for writes it is refilled.
1167 io_u->buf_filled_len = 0;
1172 * Set io data pointers.
1174 io_u->xfer_buf = io_u->buf;
1175 io_u->xfer_buflen = io_u->buflen;
1179 if (!td_io_prep(td, io_u)) {
1180 if (!td->o.disable_slat)
1181 fio_gettime(&io_u->start_time, NULL);
1185 dprint(FD_IO, "get_io_u failed\n");
1190 void io_u_log_error(struct thread_data *td, struct io_u *io_u)
1192 const char *msg[] = { "read", "write", "sync", "datasync",
1193 "sync_file_range", "wait", "trim" };
1197 log_err("fio: io_u error");
1200 log_err(" on file %s", io_u->file->file_name);
1202 log_err(": %s\n", strerror(io_u->error));
1204 log_err(" %s offset=%llu, buflen=%lu\n", msg[io_u->ddir],
1205 io_u->offset, io_u->xfer_buflen);
1208 td_verror(td, io_u->error, "io_u error");
1211 static void io_completed(struct thread_data *td, struct io_u *io_u,
1212 struct io_completion_data *icd)
1215 * Older gcc's are too dumb to realize that usec is always used
1216 * initialized, silence that warning.
1218 unsigned long uninitialized_var(usec);
1221 dprint_io_u(io_u, "io complete");
1224 assert(io_u->flags & IO_U_F_FLIGHT);
1225 io_u->flags &= ~(IO_U_F_FLIGHT | IO_U_F_BUSY_OK);
1228 if (ddir_sync(io_u->ddir)) {
1229 td->last_was_sync = 1;
1232 f->first_write = -1ULL;
1233 f->last_write = -1ULL;
1238 td->last_was_sync = 0;
1239 td->last_ddir = io_u->ddir;
1241 if (!io_u->error && ddir_rw(io_u->ddir)) {
1242 unsigned int bytes = io_u->buflen - io_u->resid;
1243 const enum fio_ddir idx = io_u->ddir;
1244 const enum fio_ddir odx = io_u->ddir ^ 1;
1247 td->io_blocks[idx]++;
1248 td->io_bytes[idx] += bytes;
1249 td->this_io_bytes[idx] += bytes;
1251 if (idx == DDIR_WRITE) {
1254 if (f->first_write == -1ULL ||
1255 io_u->offset < f->first_write)
1256 f->first_write = io_u->offset;
1257 if (f->last_write == -1ULL ||
1258 ((io_u->offset + bytes) > f->last_write))
1259 f->last_write = io_u->offset + bytes;
1263 if (ramp_time_over(td)) {
1264 unsigned long uninitialized_var(lusec);
1266 if (!td->o.disable_clat || !td->o.disable_bw)
1267 lusec = utime_since(&io_u->issue_time,
1269 if (!td->o.disable_lat) {
1270 unsigned long tusec;
1272 tusec = utime_since(&io_u->start_time,
1274 add_lat_sample(td, idx, tusec, bytes);
1276 if (!td->o.disable_clat) {
1277 add_clat_sample(td, idx, lusec, bytes);
1278 io_u_mark_latency(td, lusec);
1280 if (!td->o.disable_bw)
1281 add_bw_sample(td, idx, bytes, &icd->time);
1282 if (__should_check_rate(td, idx)) {
1283 td->rate_pending_usleep[idx] =
1284 ((td->this_io_bytes[idx] *
1285 td->rate_nsec_cycle[idx]) / 1000 -
1286 utime_since_now(&td->start));
1288 if (__should_check_rate(td, idx ^ 1))
1289 td->rate_pending_usleep[odx] =
1290 ((td->this_io_bytes[odx] *
1291 td->rate_nsec_cycle[odx]) / 1000 -
1292 utime_since_now(&td->start));
1295 if (td_write(td) && idx == DDIR_WRITE &&
1297 td->o.verify != VERIFY_NONE)
1298 log_io_piece(td, io_u);
1300 icd->bytes_done[idx] += bytes;
1303 ret = io_u->end_io(td, io_u);
1304 if (ret && !icd->error)
1307 } else if (io_u->error) {
1308 icd->error = io_u->error;
1309 io_u_log_error(td, io_u);
1311 if (td->o.continue_on_error && icd->error &&
1312 td_non_fatal_error(icd->error)) {
1314 * If there is a non_fatal error, then add to the error count
1315 * and clear all the errors.
1317 update_error_count(td, icd->error);
1324 static void init_icd(struct thread_data *td, struct io_completion_data *icd,
1327 if (!td->o.disable_clat || !td->o.disable_bw)
1328 fio_gettime(&icd->time, NULL);
1333 icd->bytes_done[0] = icd->bytes_done[1] = 0;
1336 static void ios_completed(struct thread_data *td,
1337 struct io_completion_data *icd)
1342 for (i = 0; i < icd->nr; i++) {
1343 io_u = td->io_ops->event(td, i);
1345 io_completed(td, io_u, icd);
1347 if (!(io_u->flags & IO_U_F_FREE_DEF))
1353 * Complete a single io_u for the sync engines.
1355 int io_u_sync_complete(struct thread_data *td, struct io_u *io_u,
1356 unsigned long *bytes)
1358 struct io_completion_data icd;
1360 init_icd(td, &icd, 1);
1361 io_completed(td, io_u, &icd);
1363 if (!(io_u->flags & IO_U_F_FREE_DEF))
1367 td_verror(td, icd.error, "io_u_sync_complete");
1372 bytes[0] += icd.bytes_done[0];
1373 bytes[1] += icd.bytes_done[1];
1380 * Called to complete min_events number of io for the async engines.
1382 int io_u_queued_complete(struct thread_data *td, int min_evts,
1383 unsigned long *bytes)
1385 struct io_completion_data icd;
1386 struct timespec *tvp = NULL;
1388 struct timespec ts = { .tv_sec = 0, .tv_nsec = 0, };
1390 dprint(FD_IO, "io_u_queued_completed: min=%d\n", min_evts);
1395 ret = td_io_getevents(td, min_evts, td->o.iodepth_batch_complete, tvp);
1397 td_verror(td, -ret, "td_io_getevents");
1402 init_icd(td, &icd, ret);
1403 ios_completed(td, &icd);
1405 td_verror(td, icd.error, "io_u_queued_complete");
1410 bytes[0] += icd.bytes_done[0];
1411 bytes[1] += icd.bytes_done[1];
1418 * Call when io_u is really queued, to update the submission latency.
1420 void io_u_queued(struct thread_data *td, struct io_u *io_u)
1422 if (!td->o.disable_slat) {
1423 unsigned long slat_time;
1425 slat_time = utime_since(&io_u->start_time, &io_u->issue_time);
1426 add_slat_sample(td, io_u->ddir, slat_time, io_u->xfer_buflen);
1431 * "randomly" fill the buffer contents
1433 void io_u_fill_buffer(struct thread_data *td, struct io_u *io_u,
1434 unsigned int max_bs)
1436 io_u->buf_filled_len = 0;
1438 if (!td->o.zero_buffers)
1439 fill_random_buf(io_u->buf, max_bs);
1441 memset(io_u->buf, 0, max_bs);