13 struct io_completion_data {
16 int error; /* output */
17 unsigned long bytes_done[2]; /* output */
18 struct timeval time; /* output */
22 * The ->file_map[] contains a map of blocks we have or have not done io
23 * to yet. Used to make sure we cover the entire range in a fair fashion.
25 static int random_map_free(struct fio_file *f, const unsigned long long block)
27 unsigned int idx = RAND_MAP_IDX(f, block);
28 unsigned int bit = RAND_MAP_BIT(f, block);
30 dprint(FD_RANDOM, "free: b=%llu, idx=%u, bit=%u\n", block, idx, bit);
32 return (f->file_map[idx] & (1 << bit)) == 0;
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.rw_min_bs;
41 struct fio_file *f = io_u->file;
42 unsigned long long block;
43 unsigned int blocks, nr_blocks;
45 block = (io_u->offset - f->file_offset) / (unsigned long long) min_bs;
46 nr_blocks = (io_u->buflen + min_bs - 1) / min_bs;
50 unsigned int this_blocks, mask;
51 unsigned int idx, bit;
54 * If we have a mixed random workload, we may
55 * encounter blocks we already did IO to.
57 if ((td->o.ddir_nr == 1) && !random_map_free(f, block))
60 idx = RAND_MAP_IDX(f, block);
61 bit = RAND_MAP_BIT(f, block);
63 fio_assert(td, idx < f->num_maps);
65 this_blocks = nr_blocks;
66 if (this_blocks + bit > BLOCKS_PER_MAP)
67 this_blocks = BLOCKS_PER_MAP - bit;
70 if (this_blocks == BLOCKS_PER_MAP)
73 mask = ((1U << this_blocks) - 1) << bit;
75 if (!(f->file_map[idx] & mask))
79 } while (this_blocks);
84 f->file_map[idx] |= mask;
85 nr_blocks -= this_blocks;
86 blocks += this_blocks;
90 if ((blocks * min_bs) < io_u->buflen)
91 io_u->buflen = blocks * min_bs;
94 static unsigned long long last_block(struct thread_data *td, struct fio_file *f,
97 unsigned long long max_blocks;
98 unsigned long long max_size;
101 * Hmm, should we make sure that ->io_size <= ->real_file_size?
103 max_size = f->io_size;
104 if (max_size > f->real_file_size)
105 max_size = f->real_file_size;
107 max_blocks = max_size / (unsigned long long) td->o.ba[ddir];
115 * Return the next free block in the map.
117 static int get_next_free_block(struct thread_data *td, struct fio_file *f,
118 enum fio_ddir ddir, unsigned long long *b)
120 unsigned long long min_bs = td->o.rw_min_bs;
123 i = f->last_free_lookup;
124 *b = (i * BLOCKS_PER_MAP);
125 while ((*b) * min_bs < f->real_file_size &&
126 (*b) * min_bs < f->io_size) {
127 if (f->file_map[i] != (unsigned int) -1) {
128 *b += ffz(f->file_map[i]);
129 if (*b > last_block(td, f, ddir))
131 f->last_free_lookup = i;
135 *b += BLOCKS_PER_MAP;
139 dprint(FD_IO, "failed finding a free block\n");
143 static int get_next_rand_offset(struct thread_data *td, struct fio_file *f,
144 enum fio_ddir ddir, unsigned long long *b)
146 unsigned long long r;
150 r = os_random_long(&td->random_state);
151 dprint(FD_RANDOM, "off rand %llu\n", r);
152 *b = (last_block(td, f, ddir) - 1)
153 * (r / ((unsigned long long) OS_RAND_MAX + 1.0));
156 * if we are not maintaining a random map, we are done.
158 if (!file_randommap(td, f))
162 * calculate map offset and check if it's free
164 if (random_map_free(f, *b))
167 dprint(FD_RANDOM, "get_next_rand_offset: offset %llu busy\n",
172 * we get here, if we didn't suceed in looking up a block. generate
173 * a random start offset into the filemap, and find the first free
178 f->last_free_lookup = (f->num_maps - 1) *
179 (r / (OS_RAND_MAX + 1.0));
180 if (!get_next_free_block(td, f, ddir, b))
183 r = os_random_long(&td->random_state);
187 * that didn't work either, try exhaustive search from the start
189 f->last_free_lookup = 0;
190 return get_next_free_block(td, f, ddir, b);
194 * For random io, generate a random new block and see if it's used. Repeat
195 * until we find a free one. For sequential io, just return the end of
196 * the last io issued.
198 static int __get_next_offset(struct thread_data *td, struct io_u *io_u)
200 struct fio_file *f = io_u->file;
201 unsigned long long b;
202 enum fio_ddir ddir = io_u->ddir;
204 if (td_random(td) && (td->o.ddir_nr && !--td->ddir_nr)) {
205 td->ddir_nr = td->o.ddir_nr;
207 if (get_next_rand_offset(td, f, ddir, &b)) {
208 dprint(FD_IO, "%s: getting rand offset failed\n",
213 if (f->last_pos >= f->real_file_size) {
214 if (!td_random(td) ||
215 get_next_rand_offset(td, f, ddir, &b)) {
216 dprint(FD_IO, "%s: pos %llu > size %llu\n",
217 f->file_name, f->last_pos,
222 b = (f->last_pos - f->file_offset) / td->o.min_bs[ddir];
225 io_u->offset = b * td->o.ba[ddir];
226 if (io_u->offset >= f->io_size) {
227 dprint(FD_IO, "get_next_offset: offset %llu >= io_size %llu\n",
228 io_u->offset, f->io_size);
232 io_u->offset += f->file_offset;
233 if (io_u->offset >= f->real_file_size) {
234 dprint(FD_IO, "get_next_offset: offset %llu >= size %llu\n",
235 io_u->offset, f->real_file_size);
242 static int get_next_offset(struct thread_data *td, struct io_u *io_u)
244 struct prof_io_ops *ops = &td->prof_io_ops;
246 if (ops->fill_io_u_off)
247 return ops->fill_io_u_off(td, io_u);
249 return __get_next_offset(td, io_u);
252 static unsigned int __get_next_buflen(struct thread_data *td, struct io_u *io_u)
254 const int ddir = io_u->ddir;
255 unsigned int uninitialized_var(buflen);
256 unsigned int minbs, maxbs;
259 minbs = td->o.min_bs[ddir];
260 maxbs = td->o.max_bs[ddir];
265 r = os_random_long(&td->bsrange_state);
266 if (!td->o.bssplit_nr[ddir]) {
267 buflen = 1 + (unsigned int) ((double) maxbs *
268 (r / (OS_RAND_MAX + 1.0)));
275 for (i = 0; i < td->o.bssplit_nr[ddir]; i++) {
276 struct bssplit *bsp = &td->o.bssplit[ddir][i];
280 if (r <= ((OS_RAND_MAX / 100L) * perc))
284 if (!td->o.bs_unaligned && is_power_of_2(minbs))
285 buflen = (buflen + minbs - 1) & ~(minbs - 1);
288 if (io_u->offset + buflen > io_u->file->real_file_size) {
289 dprint(FD_IO, "lower buflen %u -> %u (ddir=%d)\n", buflen,
297 static unsigned int get_next_buflen(struct thread_data *td, struct io_u *io_u)
299 struct prof_io_ops *ops = &td->prof_io_ops;
301 if (ops->fill_io_u_size)
302 return ops->fill_io_u_size(td, io_u);
304 return __get_next_buflen(td, io_u);
307 static void set_rwmix_bytes(struct thread_data *td)
312 * we do time or byte based switch. this is needed because
313 * buffered writes may issue a lot quicker than they complete,
314 * whereas reads do not.
316 diff = td->o.rwmix[td->rwmix_ddir ^ 1];
317 td->rwmix_issues = (td->io_issues[td->rwmix_ddir] * diff) / 100;
320 static inline enum fio_ddir get_rand_ddir(struct thread_data *td)
325 r = os_random_long(&td->rwmix_state);
326 v = 1 + (int) (100.0 * (r / (OS_RAND_MAX + 1.0)));
327 if (v <= td->o.rwmix[DDIR_READ])
333 static enum fio_ddir rate_ddir(struct thread_data *td, enum fio_ddir ddir)
335 enum fio_ddir odir = ddir ^ 1;
339 if (td->rate_pending_usleep[ddir] <= 0)
343 * We have too much pending sleep in this direction. See if we
348 * Other direction does not have too much pending, switch
350 if (td->rate_pending_usleep[odir] < 100000)
354 * Both directions have pending sleep. Sleep the minimum time
355 * and deduct from both.
357 if (td->rate_pending_usleep[ddir] <=
358 td->rate_pending_usleep[odir]) {
359 usec = td->rate_pending_usleep[ddir];
361 usec = td->rate_pending_usleep[odir];
365 usec = td->rate_pending_usleep[ddir];
367 fio_gettime(&t, NULL);
368 usec_sleep(td, usec);
369 usec = utime_since_now(&t);
371 td->rate_pending_usleep[ddir] -= usec;
374 if (td_rw(td) && __should_check_rate(td, odir))
375 td->rate_pending_usleep[odir] -= usec;
381 * Return the data direction for the next io_u. If the job is a
382 * mixed read/write workload, check the rwmix cycle and switch if
385 static enum fio_ddir get_rw_ddir(struct thread_data *td)
390 * see if it's time to fsync
392 if (td->o.fsync_blocks &&
393 !(td->io_issues[DDIR_WRITE] % td->o.fsync_blocks) &&
394 td->io_issues[DDIR_WRITE] && should_fsync(td))
398 * see if it's time to fdatasync
400 if (td->o.fdatasync_blocks &&
401 !(td->io_issues[DDIR_WRITE] % td->o.fdatasync_blocks) &&
402 td->io_issues[DDIR_WRITE] && should_fsync(td))
403 return DDIR_DATASYNC;
406 * see if it's time to sync_file_range
408 if (td->sync_file_range_nr &&
409 !(td->io_issues[DDIR_WRITE] % td->sync_file_range_nr) &&
410 td->io_issues[DDIR_WRITE] && should_fsync(td))
411 return DDIR_SYNC_FILE_RANGE;
415 * Check if it's time to seed a new data direction.
417 if (td->io_issues[td->rwmix_ddir] >= td->rwmix_issues) {
419 * Put a top limit on how many bytes we do for
420 * one data direction, to avoid overflowing the
423 ddir = get_rand_ddir(td);
425 if (ddir != td->rwmix_ddir)
428 td->rwmix_ddir = ddir;
430 ddir = td->rwmix_ddir;
431 } else if (td_read(td))
436 td->rwmix_ddir = rate_ddir(td, ddir);
437 return td->rwmix_ddir;
440 void put_file_log(struct thread_data *td, struct fio_file *f)
442 int ret = put_file(td, f);
445 td_verror(td, ret, "file close");
448 void put_io_u(struct thread_data *td, struct io_u *io_u)
452 io_u->flags |= IO_U_F_FREE;
453 io_u->flags &= ~IO_U_F_FREE_DEF;
456 put_file_log(td, io_u->file);
459 if (io_u->flags & IO_U_F_IN_CUR_DEPTH)
461 flist_del_init(&io_u->list);
462 flist_add(&io_u->list, &td->io_u_freelist);
464 td_io_u_free_notify(td);
467 void clear_io_u(struct thread_data *td, struct io_u *io_u)
469 io_u->flags &= ~IO_U_F_FLIGHT;
473 void requeue_io_u(struct thread_data *td, struct io_u **io_u)
475 struct io_u *__io_u = *io_u;
477 dprint(FD_IO, "requeue %p\n", __io_u);
481 __io_u->flags |= IO_U_F_FREE;
482 if ((__io_u->flags & IO_U_F_FLIGHT) && !ddir_sync(__io_u->ddir))
483 td->io_issues[__io_u->ddir]--;
485 __io_u->flags &= ~IO_U_F_FLIGHT;
486 if (__io_u->flags & IO_U_F_IN_CUR_DEPTH)
488 flist_del(&__io_u->list);
489 flist_add_tail(&__io_u->list, &td->io_u_requeues);
494 static int fill_io_u(struct thread_data *td, struct io_u *io_u)
496 if (td->io_ops->flags & FIO_NOIO)
499 io_u->ddir = get_rw_ddir(td);
502 * fsync() or fdatasync(), we are done
504 if (ddir_sync(io_u->ddir))
508 * See if it's time to switch to a new zone
510 if (td->zone_bytes >= td->o.zone_size) {
512 io_u->file->last_pos += td->o.zone_skip;
513 td->io_skip_bytes += td->o.zone_skip;
517 * No log, let the seq/rand engine retrieve the next buflen and
520 if (get_next_offset(td, io_u)) {
521 dprint(FD_IO, "io_u %p, failed getting offset\n", io_u);
525 io_u->buflen = get_next_buflen(td, io_u);
527 dprint(FD_IO, "io_u %p, failed getting buflen\n", io_u);
531 if (io_u->offset + io_u->buflen > io_u->file->real_file_size) {
532 dprint(FD_IO, "io_u %p, offset too large\n", io_u);
533 dprint(FD_IO, " off=%llu/%lu > %llu\n", io_u->offset,
534 io_u->buflen, io_u->file->real_file_size);
539 * mark entry before potentially trimming io_u
541 if (td_random(td) && file_randommap(td, io_u->file))
542 mark_random_map(td, io_u);
545 * If using a write iolog, store this entry.
548 dprint_io_u(io_u, "fill_io_u");
549 td->zone_bytes += io_u->buflen;
554 static void __io_u_mark_map(unsigned int *map, unsigned int nr)
583 void io_u_mark_submit(struct thread_data *td, unsigned int nr)
585 __io_u_mark_map(td->ts.io_u_submit, nr);
586 td->ts.total_submit++;
589 void io_u_mark_complete(struct thread_data *td, unsigned int nr)
591 __io_u_mark_map(td->ts.io_u_complete, nr);
592 td->ts.total_complete++;
595 void io_u_mark_depth(struct thread_data *td, unsigned int nr)
599 switch (td->cur_depth) {
621 td->ts.io_u_map[index] += nr;
624 static void io_u_mark_lat_usec(struct thread_data *td, unsigned long usec)
661 assert(index < FIO_IO_U_LAT_U_NR);
662 td->ts.io_u_lat_u[index]++;
665 static void io_u_mark_lat_msec(struct thread_data *td, unsigned long msec)
706 assert(index < FIO_IO_U_LAT_M_NR);
707 td->ts.io_u_lat_m[index]++;
710 static void io_u_mark_latency(struct thread_data *td, unsigned long usec)
713 io_u_mark_lat_usec(td, usec);
715 io_u_mark_lat_msec(td, usec / 1000);
719 * Get next file to service by choosing one at random
721 static struct fio_file *get_next_file_rand(struct thread_data *td,
722 enum fio_file_flags goodf,
723 enum fio_file_flags badf)
729 long r = os_random_long(&td->next_file_state);
732 fno = (unsigned int) ((double) td->o.nr_files
733 * (r / (OS_RAND_MAX + 1.0)));
735 if (fio_file_done(f))
738 if (!fio_file_open(f)) {
741 err = td_io_open_file(td, f);
747 if ((!goodf || (f->flags & goodf)) && !(f->flags & badf)) {
748 dprint(FD_FILE, "get_next_file_rand: %p\n", f);
752 td_io_close_file(td, f);
757 * Get next file to service by doing round robin between all available ones
759 static struct fio_file *get_next_file_rr(struct thread_data *td, int goodf,
762 unsigned int old_next_file = td->next_file;
768 f = td->files[td->next_file];
771 if (td->next_file >= td->o.nr_files)
774 dprint(FD_FILE, "trying file %s %x\n", f->file_name, f->flags);
775 if (fio_file_done(f)) {
780 if (!fio_file_open(f)) {
783 err = td_io_open_file(td, f);
785 dprint(FD_FILE, "error %d on open of %s\n",
793 dprint(FD_FILE, "goodf=%x, badf=%x, ff=%x\n", goodf, badf,
795 if ((!goodf || (f->flags & goodf)) && !(f->flags & badf))
799 td_io_close_file(td, f);
802 } while (td->next_file != old_next_file);
804 dprint(FD_FILE, "get_next_file_rr: %p\n", f);
808 static struct fio_file *__get_next_file(struct thread_data *td)
812 assert(td->o.nr_files <= td->files_index);
814 if (td->nr_done_files >= td->o.nr_files) {
815 dprint(FD_FILE, "get_next_file: nr_open=%d, nr_done=%d,"
816 " nr_files=%d\n", td->nr_open_files,
822 f = td->file_service_file;
823 if (f && fio_file_open(f) && !fio_file_closing(f)) {
824 if (td->o.file_service_type == FIO_FSERVICE_SEQ)
826 if (td->file_service_left--)
830 if (td->o.file_service_type == FIO_FSERVICE_RR ||
831 td->o.file_service_type == FIO_FSERVICE_SEQ)
832 f = get_next_file_rr(td, FIO_FILE_open, FIO_FILE_closing);
834 f = get_next_file_rand(td, FIO_FILE_open, FIO_FILE_closing);
836 td->file_service_file = f;
837 td->file_service_left = td->file_service_nr - 1;
839 dprint(FD_FILE, "get_next_file: %p [%s]\n", f, f->file_name);
843 static struct fio_file *get_next_file(struct thread_data *td)
845 struct prof_io_ops *ops = &td->prof_io_ops;
847 if (ops->get_next_file)
848 return ops->get_next_file(td);
850 return __get_next_file(td);
853 static int set_io_u_file(struct thread_data *td, struct io_u *io_u)
858 f = get_next_file(td);
865 if (!fill_io_u(td, io_u))
869 td_io_close_file(td, f);
871 fio_file_set_done(f);
873 dprint(FD_FILE, "%s: is done (%d of %d)\n", f->file_name,
874 td->nr_done_files, td->o.nr_files);
881 struct io_u *__get_io_u(struct thread_data *td)
883 struct io_u *io_u = NULL;
888 if (!flist_empty(&td->io_u_requeues))
889 io_u = flist_entry(td->io_u_requeues.next, struct io_u, list);
890 else if (!queue_full(td)) {
891 io_u = flist_entry(td->io_u_freelist.next, struct io_u, list);
900 assert(io_u->flags & IO_U_F_FREE);
901 io_u->flags &= ~(IO_U_F_FREE | IO_U_F_FREE_DEF);
904 flist_del(&io_u->list);
905 flist_add(&io_u->list, &td->io_u_busylist);
907 io_u->flags |= IO_U_F_IN_CUR_DEPTH;
908 } else if (td->o.verify_async) {
910 * We ran out, wait for async verify threads to finish and
913 pthread_cond_wait(&td->free_cond, &td->io_u_lock);
922 * Return an io_u to be processed. Gets a buflen and offset, sets direction,
923 * etc. The returned io_u is fully ready to be prepped and submitted.
925 struct io_u *get_io_u(struct thread_data *td)
930 io_u = __get_io_u(td);
932 dprint(FD_IO, "__get_io_u failed\n");
936 if (td->o.verify_backlog && td->io_hist_len) {
939 if (td->verify_batch) {
942 } else if (!(td->io_hist_len % td->o.verify_backlog) &&
943 td->last_ddir != DDIR_READ) {
944 td->verify_batch = td->o.verify_batch;
945 if (!td->verify_batch)
946 td->verify_batch = td->o.verify_backlog;
950 if (get_verify && !get_next_verify(td, io_u))
955 * from a requeue, io_u already setup
961 * If using an iolog, grab next piece if any available.
963 if (td->o.read_iolog_file) {
964 if (read_iolog_get(td, io_u))
966 } else if (set_io_u_file(td, io_u)) {
967 dprint(FD_IO, "io_u %p, setting file failed\n", io_u);
972 assert(fio_file_open(f));
974 if (!ddir_sync(io_u->ddir)) {
975 if (!io_u->buflen && !(td->io_ops->flags & FIO_NOIO)) {
976 dprint(FD_IO, "get_io_u: zero buflen on %p\n", io_u);
980 f->last_pos = io_u->offset + io_u->buflen;
982 if (td->o.verify != VERIFY_NONE && io_u->ddir == DDIR_WRITE)
983 populate_verify_io_u(td, io_u);
984 else if (td->o.refill_buffers && io_u->ddir == DDIR_WRITE)
985 io_u_fill_buffer(td, io_u, io_u->xfer_buflen);
989 * Set io data pointers.
991 io_u->xfer_buf = io_u->buf;
992 io_u->xfer_buflen = io_u->buflen;
995 if (!td_io_prep(td, io_u)) {
996 if (!td->o.disable_slat)
997 fio_gettime(&io_u->start_time, NULL);
1001 dprint(FD_IO, "get_io_u failed\n");
1006 void io_u_log_error(struct thread_data *td, struct io_u *io_u)
1008 const char *msg[] = { "read", "write", "sync" };
1010 log_err("fio: io_u error");
1013 log_err(" on file %s", io_u->file->file_name);
1015 log_err(": %s\n", strerror(io_u->error));
1017 log_err(" %s offset=%llu, buflen=%lu\n", msg[io_u->ddir],
1018 io_u->offset, io_u->xfer_buflen);
1021 td_verror(td, io_u->error, "io_u error");
1024 static void io_completed(struct thread_data *td, struct io_u *io_u,
1025 struct io_completion_data *icd)
1028 * Older gcc's are too dumb to realize that usec is always used
1029 * initialized, silence that warning.
1031 unsigned long uninitialized_var(usec);
1034 dprint_io_u(io_u, "io complete");
1037 assert(io_u->flags & IO_U_F_FLIGHT);
1038 io_u->flags &= ~IO_U_F_FLIGHT;
1041 if (ddir_sync(io_u->ddir)) {
1042 td->last_was_sync = 1;
1045 f->first_write = -1ULL;
1046 f->last_write = -1ULL;
1051 td->last_was_sync = 0;
1052 td->last_ddir = io_u->ddir;
1055 unsigned int bytes = io_u->buflen - io_u->resid;
1056 const enum fio_ddir idx = io_u->ddir;
1057 const enum fio_ddir odx = io_u->ddir ^ 1;
1060 td->io_blocks[idx]++;
1061 td->io_bytes[idx] += bytes;
1062 td->this_io_bytes[idx] += bytes;
1064 if (idx == DDIR_WRITE) {
1067 if (f->first_write == -1ULL ||
1068 io_u->offset < f->first_write)
1069 f->first_write = io_u->offset;
1070 if (f->last_write == -1ULL ||
1071 ((io_u->offset + bytes) > f->last_write))
1072 f->last_write = io_u->offset + bytes;
1076 if (ramp_time_over(td)) {
1077 unsigned long uninitialized_var(lusec);
1079 if (!td->o.disable_clat || !td->o.disable_bw)
1080 lusec = utime_since(&io_u->issue_time,
1083 if (!td->o.disable_clat) {
1084 add_clat_sample(td, idx, lusec, bytes);
1085 io_u_mark_latency(td, lusec);
1087 if (!td->o.disable_bw)
1088 add_bw_sample(td, idx, bytes, &icd->time);
1089 if (__should_check_rate(td, idx)) {
1090 td->rate_pending_usleep[idx] =
1091 ((td->this_io_bytes[idx] *
1092 td->rate_nsec_cycle[idx]) / 1000 -
1093 utime_since_now(&td->start));
1095 if (__should_check_rate(td, idx ^ 1))
1096 td->rate_pending_usleep[odx] =
1097 ((td->this_io_bytes[odx] *
1098 td->rate_nsec_cycle[odx]) / 1000 -
1099 utime_since_now(&td->start));
1102 if (td_write(td) && idx == DDIR_WRITE &&
1104 td->o.verify != VERIFY_NONE)
1105 log_io_piece(td, io_u);
1107 icd->bytes_done[idx] += bytes;
1110 ret = io_u->end_io(td, io_u);
1111 if (ret && !icd->error)
1115 icd->error = io_u->error;
1116 io_u_log_error(td, io_u);
1118 if (td->o.continue_on_error && icd->error &&
1119 td_non_fatal_error(icd->error)) {
1121 * If there is a non_fatal error, then add to the error count
1122 * and clear all the errors.
1124 update_error_count(td, icd->error);
1131 static void init_icd(struct thread_data *td, struct io_completion_data *icd,
1134 if (!td->o.disable_clat || !td->o.disable_bw)
1135 fio_gettime(&icd->time, NULL);
1140 icd->bytes_done[0] = icd->bytes_done[1] = 0;
1143 static void ios_completed(struct thread_data *td,
1144 struct io_completion_data *icd)
1149 for (i = 0; i < icd->nr; i++) {
1150 io_u = td->io_ops->event(td, i);
1152 io_completed(td, io_u, icd);
1154 if (!(io_u->flags & IO_U_F_FREE_DEF))
1160 * Complete a single io_u for the sync engines.
1162 int io_u_sync_complete(struct thread_data *td, struct io_u *io_u,
1163 unsigned long *bytes)
1165 struct io_completion_data icd;
1167 init_icd(td, &icd, 1);
1168 io_completed(td, io_u, &icd);
1170 if (!(io_u->flags & IO_U_F_FREE_DEF))
1174 td_verror(td, icd.error, "io_u_sync_complete");
1179 bytes[0] += icd.bytes_done[0];
1180 bytes[1] += icd.bytes_done[1];
1187 * Called to complete min_events number of io for the async engines.
1189 int io_u_queued_complete(struct thread_data *td, int min_evts,
1190 unsigned long *bytes)
1192 struct io_completion_data icd;
1193 struct timespec *tvp = NULL;
1195 struct timespec ts = { .tv_sec = 0, .tv_nsec = 0, };
1197 dprint(FD_IO, "io_u_queued_completed: min=%d\n", min_evts);
1202 ret = td_io_getevents(td, min_evts, td->o.iodepth_batch_complete, tvp);
1204 td_verror(td, -ret, "td_io_getevents");
1209 init_icd(td, &icd, ret);
1210 ios_completed(td, &icd);
1212 td_verror(td, icd.error, "io_u_queued_complete");
1217 bytes[0] += icd.bytes_done[0];
1218 bytes[1] += icd.bytes_done[1];
1225 * Call when io_u is really queued, to update the submission latency.
1227 void io_u_queued(struct thread_data *td, struct io_u *io_u)
1229 if (!td->o.disable_slat) {
1230 unsigned long slat_time;
1232 slat_time = utime_since(&io_u->start_time, &io_u->issue_time);
1233 add_slat_sample(td, io_u->ddir, slat_time, io_u->xfer_buflen);
1238 * "randomly" fill the buffer contents
1240 void io_u_fill_buffer(struct thread_data *td, struct io_u *io_u,
1241 unsigned int max_bs)
1243 if (!td->o.zero_buffers)
1244 fill_random_buf(io_u->buf, max_bs);
1246 memset(io_u->buf, 0, max_bs);