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 r = os_random_long(&td->random_state);
217 * that didn't work either, try exhaustive search from the start
219 f->last_free_lookup = 0;
221 if (!get_next_free_block(td, f, ddir, b))
223 f->last_free_lookup = 0;
224 return get_next_free_block(td, f, ddir, b);
231 static int get_next_rand_block(struct thread_data *td, struct fio_file *f,
232 enum fio_ddir ddir, unsigned long long *b)
234 if (get_next_rand_offset(td, f, ddir, b)) {
235 dprint(FD_IO, "%s: rand offset failed, last=%llu, size=%llu\n",
236 f->file_name, f->last_pos, f->real_file_size);
243 static int get_next_seq_block(struct thread_data *td, struct fio_file *f,
244 enum fio_ddir ddir, unsigned long long *b)
246 assert(ddir_rw(ddir));
248 if (f->last_pos < f->real_file_size) {
249 *b = (f->last_pos - f->file_offset) / td->o.min_bs[ddir];
256 static int get_next_block(struct thread_data *td, struct io_u *io_u,
257 enum fio_ddir ddir, int rw_seq, unsigned long long *b)
259 struct fio_file *f = io_u->file;
262 assert(ddir_rw(ddir));
266 ret = get_next_rand_block(td, f, ddir, b);
268 ret = get_next_seq_block(td, f, ddir, b);
270 io_u->flags |= IO_U_F_BUSY_OK;
272 if (td->o.rw_seq == RW_SEQ_SEQ) {
273 ret = get_next_seq_block(td, f, ddir, b);
275 ret = get_next_rand_block(td, f, ddir, b);
276 } else if (td->o.rw_seq == RW_SEQ_IDENT) {
277 if (f->last_start != -1ULL)
278 *b = (f->last_start - f->file_offset)
279 / td->o.min_bs[ddir];
284 log_err("fio: unknown rw_seq=%d\n", td->o.rw_seq);
293 * For random io, generate a random new block and see if it's used. Repeat
294 * until we find a free one. For sequential io, just return the end of
295 * the last io issued.
297 static int __get_next_offset(struct thread_data *td, struct io_u *io_u)
299 struct fio_file *f = io_u->file;
300 unsigned long long b;
301 enum fio_ddir ddir = io_u->ddir;
304 assert(ddir_rw(ddir));
306 if (td->o.ddir_seq_nr && !--td->ddir_seq_nr) {
308 td->ddir_seq_nr = td->o.ddir_seq_nr;
311 if (get_next_block(td, io_u, ddir, rw_seq_hit, &b))
314 io_u->offset = b * td->o.ba[ddir];
315 if (io_u->offset >= f->io_size) {
316 dprint(FD_IO, "get_next_offset: offset %llu >= io_size %llu\n",
317 io_u->offset, f->io_size);
321 io_u->offset += f->file_offset;
322 if (io_u->offset >= f->real_file_size) {
323 dprint(FD_IO, "get_next_offset: offset %llu >= size %llu\n",
324 io_u->offset, f->real_file_size);
331 static int get_next_offset(struct thread_data *td, struct io_u *io_u)
333 struct prof_io_ops *ops = &td->prof_io_ops;
335 if (ops->fill_io_u_off)
336 return ops->fill_io_u_off(td, io_u);
338 return __get_next_offset(td, io_u);
341 static unsigned int __get_next_buflen(struct thread_data *td, struct io_u *io_u)
343 const int ddir = io_u->ddir;
344 unsigned int uninitialized_var(buflen);
345 unsigned int minbs, maxbs;
348 assert(ddir_rw(ddir));
350 minbs = td->o.min_bs[ddir];
351 maxbs = td->o.max_bs[ddir];
356 r = os_random_long(&td->bsrange_state);
357 if (!td->o.bssplit_nr[ddir]) {
358 buflen = 1 + (unsigned int) ((double) maxbs *
359 (r / (OS_RAND_MAX + 1.0)));
366 for (i = 0; i < td->o.bssplit_nr[ddir]; i++) {
367 struct bssplit *bsp = &td->o.bssplit[ddir][i];
371 if (r <= ((OS_RAND_MAX / 100L) * perc))
375 if (!td->o.bs_unaligned && is_power_of_2(minbs))
376 buflen = (buflen + minbs - 1) & ~(minbs - 1);
379 if (io_u->offset + buflen > io_u->file->real_file_size) {
380 dprint(FD_IO, "lower buflen %u -> %u (ddir=%d)\n", buflen,
388 static unsigned int get_next_buflen(struct thread_data *td, struct io_u *io_u)
390 struct prof_io_ops *ops = &td->prof_io_ops;
392 if (ops->fill_io_u_size)
393 return ops->fill_io_u_size(td, io_u);
395 return __get_next_buflen(td, io_u);
398 static void set_rwmix_bytes(struct thread_data *td)
403 * we do time or byte based switch. this is needed because
404 * buffered writes may issue a lot quicker than they complete,
405 * whereas reads do not.
407 diff = td->o.rwmix[td->rwmix_ddir ^ 1];
408 td->rwmix_issues = (td->io_issues[td->rwmix_ddir] * diff) / 100;
411 static inline enum fio_ddir get_rand_ddir(struct thread_data *td)
416 r = os_random_long(&td->rwmix_state);
417 v = 1 + (int) (100.0 * (r / (OS_RAND_MAX + 1.0)));
418 if (v <= td->o.rwmix[DDIR_READ])
424 static enum fio_ddir rate_ddir(struct thread_data *td, enum fio_ddir ddir)
426 enum fio_ddir odir = ddir ^ 1;
430 assert(ddir_rw(ddir));
432 if (td->rate_pending_usleep[ddir] <= 0)
436 * We have too much pending sleep in this direction. See if we
441 * Other direction does not have too much pending, switch
443 if (td->rate_pending_usleep[odir] < 100000)
447 * Both directions have pending sleep. Sleep the minimum time
448 * and deduct from both.
450 if (td->rate_pending_usleep[ddir] <=
451 td->rate_pending_usleep[odir]) {
452 usec = td->rate_pending_usleep[ddir];
454 usec = td->rate_pending_usleep[odir];
458 usec = td->rate_pending_usleep[ddir];
460 fio_gettime(&t, NULL);
461 usec_sleep(td, usec);
462 usec = utime_since_now(&t);
464 td->rate_pending_usleep[ddir] -= usec;
467 if (td_rw(td) && __should_check_rate(td, odir))
468 td->rate_pending_usleep[odir] -= usec;
474 * Return the data direction for the next io_u. If the job is a
475 * mixed read/write workload, check the rwmix cycle and switch if
478 static enum fio_ddir get_rw_ddir(struct thread_data *td)
483 * see if it's time to fsync
485 if (td->o.fsync_blocks &&
486 !(td->io_issues[DDIR_WRITE] % td->o.fsync_blocks) &&
487 td->io_issues[DDIR_WRITE] && should_fsync(td))
491 * see if it's time to fdatasync
493 if (td->o.fdatasync_blocks &&
494 !(td->io_issues[DDIR_WRITE] % td->o.fdatasync_blocks) &&
495 td->io_issues[DDIR_WRITE] && should_fsync(td))
496 return DDIR_DATASYNC;
499 * see if it's time to sync_file_range
501 if (td->sync_file_range_nr &&
502 !(td->io_issues[DDIR_WRITE] % td->sync_file_range_nr) &&
503 td->io_issues[DDIR_WRITE] && should_fsync(td))
504 return DDIR_SYNC_FILE_RANGE;
508 * Check if it's time to seed a new data direction.
510 if (td->io_issues[td->rwmix_ddir] >= td->rwmix_issues) {
512 * Put a top limit on how many bytes we do for
513 * one data direction, to avoid overflowing the
516 ddir = get_rand_ddir(td);
518 if (ddir != td->rwmix_ddir)
521 td->rwmix_ddir = ddir;
523 ddir = td->rwmix_ddir;
524 } else if (td_read(td))
529 td->rwmix_ddir = rate_ddir(td, ddir);
530 return td->rwmix_ddir;
533 static void set_rw_ddir(struct thread_data *td, struct io_u *io_u)
535 io_u->ddir = get_rw_ddir(td);
537 if (io_u->ddir == DDIR_WRITE && (td->io_ops->flags & FIO_BARRIER) &&
538 td->o.barrier_blocks &&
539 !(td->io_issues[DDIR_WRITE] % td->o.barrier_blocks) &&
540 td->io_issues[DDIR_WRITE])
541 io_u->flags |= IO_U_F_BARRIER;
544 void put_file_log(struct thread_data *td, struct fio_file *f)
546 int ret = put_file(td, f);
549 td_verror(td, ret, "file close");
552 void put_io_u(struct thread_data *td, struct io_u *io_u)
556 io_u->flags |= IO_U_F_FREE;
557 io_u->flags &= ~IO_U_F_FREE_DEF;
560 put_file_log(td, io_u->file);
563 if (io_u->flags & IO_U_F_IN_CUR_DEPTH)
565 flist_del_init(&io_u->list);
566 flist_add(&io_u->list, &td->io_u_freelist);
568 td_io_u_free_notify(td);
571 void clear_io_u(struct thread_data *td, struct io_u *io_u)
573 io_u->flags &= ~IO_U_F_FLIGHT;
577 void requeue_io_u(struct thread_data *td, struct io_u **io_u)
579 struct io_u *__io_u = *io_u;
581 dprint(FD_IO, "requeue %p\n", __io_u);
585 __io_u->flags |= IO_U_F_FREE;
586 if ((__io_u->flags & IO_U_F_FLIGHT) && ddir_rw(__io_u->ddir))
587 td->io_issues[__io_u->ddir]--;
589 __io_u->flags &= ~IO_U_F_FLIGHT;
590 if (__io_u->flags & IO_U_F_IN_CUR_DEPTH)
592 flist_del(&__io_u->list);
593 flist_add_tail(&__io_u->list, &td->io_u_requeues);
598 static int fill_io_u(struct thread_data *td, struct io_u *io_u)
600 if (td->io_ops->flags & FIO_NOIO)
603 set_rw_ddir(td, io_u);
606 * fsync() or fdatasync() or trim etc, we are done
608 if (!ddir_rw(io_u->ddir))
612 * See if it's time to switch to a new zone
614 if (td->zone_bytes >= td->o.zone_size) {
616 io_u->file->last_pos += td->o.zone_skip;
617 td->io_skip_bytes += td->o.zone_skip;
621 * No log, let the seq/rand engine retrieve the next buflen and
624 if (get_next_offset(td, io_u)) {
625 dprint(FD_IO, "io_u %p, failed getting offset\n", io_u);
629 io_u->buflen = get_next_buflen(td, io_u);
631 dprint(FD_IO, "io_u %p, failed getting buflen\n", io_u);
635 if (io_u->offset + io_u->buflen > io_u->file->real_file_size) {
636 dprint(FD_IO, "io_u %p, offset too large\n", io_u);
637 dprint(FD_IO, " off=%llu/%lu > %llu\n", io_u->offset,
638 io_u->buflen, io_u->file->real_file_size);
643 * mark entry before potentially trimming io_u
645 if (td_random(td) && file_randommap(td, io_u->file))
646 mark_random_map(td, io_u);
649 * If using a write iolog, store this entry.
652 dprint_io_u(io_u, "fill_io_u");
653 td->zone_bytes += io_u->buflen;
658 static void __io_u_mark_map(unsigned int *map, unsigned int nr)
687 void io_u_mark_submit(struct thread_data *td, unsigned int nr)
689 __io_u_mark_map(td->ts.io_u_submit, nr);
690 td->ts.total_submit++;
693 void io_u_mark_complete(struct thread_data *td, unsigned int nr)
695 __io_u_mark_map(td->ts.io_u_complete, nr);
696 td->ts.total_complete++;
699 void io_u_mark_depth(struct thread_data *td, unsigned int nr)
703 switch (td->cur_depth) {
725 td->ts.io_u_map[idx] += nr;
728 static void io_u_mark_lat_usec(struct thread_data *td, unsigned long usec)
765 assert(idx < FIO_IO_U_LAT_U_NR);
766 td->ts.io_u_lat_u[idx]++;
769 static void io_u_mark_lat_msec(struct thread_data *td, unsigned long msec)
810 assert(idx < FIO_IO_U_LAT_M_NR);
811 td->ts.io_u_lat_m[idx]++;
814 static void io_u_mark_latency(struct thread_data *td, unsigned long usec)
817 io_u_mark_lat_usec(td, usec);
819 io_u_mark_lat_msec(td, usec / 1000);
823 * Get next file to service by choosing one at random
825 static struct fio_file *get_next_file_rand(struct thread_data *td,
826 enum fio_file_flags goodf,
827 enum fio_file_flags badf)
833 long r = os_random_long(&td->next_file_state);
836 fno = (unsigned int) ((double) td->o.nr_files
837 * (r / (OS_RAND_MAX + 1.0)));
839 if (fio_file_done(f))
842 if (!fio_file_open(f)) {
845 err = td_io_open_file(td, f);
851 if ((!goodf || (f->flags & goodf)) && !(f->flags & badf)) {
852 dprint(FD_FILE, "get_next_file_rand: %p\n", f);
856 td_io_close_file(td, f);
861 * Get next file to service by doing round robin between all available ones
863 static struct fio_file *get_next_file_rr(struct thread_data *td, int goodf,
866 unsigned int old_next_file = td->next_file;
872 f = td->files[td->next_file];
875 if (td->next_file >= td->o.nr_files)
878 dprint(FD_FILE, "trying file %s %x\n", f->file_name, f->flags);
879 if (fio_file_done(f)) {
884 if (!fio_file_open(f)) {
887 err = td_io_open_file(td, f);
889 dprint(FD_FILE, "error %d on open of %s\n",
897 dprint(FD_FILE, "goodf=%x, badf=%x, ff=%x\n", goodf, badf,
899 if ((!goodf || (f->flags & goodf)) && !(f->flags & badf))
903 td_io_close_file(td, f);
906 } while (td->next_file != old_next_file);
908 dprint(FD_FILE, "get_next_file_rr: %p\n", f);
912 static struct fio_file *__get_next_file(struct thread_data *td)
916 assert(td->o.nr_files <= td->files_index);
918 if (td->nr_done_files >= td->o.nr_files) {
919 dprint(FD_FILE, "get_next_file: nr_open=%d, nr_done=%d,"
920 " nr_files=%d\n", td->nr_open_files,
926 f = td->file_service_file;
927 if (f && fio_file_open(f) && !fio_file_closing(f)) {
928 if (td->o.file_service_type == FIO_FSERVICE_SEQ)
930 if (td->file_service_left--)
934 if (td->o.file_service_type == FIO_FSERVICE_RR ||
935 td->o.file_service_type == FIO_FSERVICE_SEQ)
936 f = get_next_file_rr(td, FIO_FILE_open, FIO_FILE_closing);
938 f = get_next_file_rand(td, FIO_FILE_open, FIO_FILE_closing);
940 td->file_service_file = f;
941 td->file_service_left = td->file_service_nr - 1;
943 dprint(FD_FILE, "get_next_file: %p [%s]\n", f, f->file_name);
947 static struct fio_file *get_next_file(struct thread_data *td)
949 struct prof_io_ops *ops = &td->prof_io_ops;
951 if (ops->get_next_file)
952 return ops->get_next_file(td);
954 return __get_next_file(td);
957 static int set_io_u_file(struct thread_data *td, struct io_u *io_u)
962 f = get_next_file(td);
969 if (!fill_io_u(td, io_u))
973 td_io_close_file(td, f);
975 fio_file_set_done(f);
977 dprint(FD_FILE, "%s: is done (%d of %d)\n", f->file_name,
978 td->nr_done_files, td->o.nr_files);
985 struct io_u *__get_io_u(struct thread_data *td)
987 struct io_u *io_u = NULL;
992 if (!flist_empty(&td->io_u_requeues))
993 io_u = flist_entry(td->io_u_requeues.next, struct io_u, list);
994 else if (!queue_full(td)) {
995 io_u = flist_entry(td->io_u_freelist.next, struct io_u, list);
1000 io_u->end_io = NULL;
1004 assert(io_u->flags & IO_U_F_FREE);
1005 io_u->flags &= ~(IO_U_F_FREE | IO_U_F_FREE_DEF);
1006 io_u->flags &= ~(IO_U_F_TRIMMED | IO_U_F_BARRIER);
1009 flist_del(&io_u->list);
1010 flist_add(&io_u->list, &td->io_u_busylist);
1012 io_u->flags |= IO_U_F_IN_CUR_DEPTH;
1013 } else if (td->o.verify_async) {
1015 * We ran out, wait for async verify threads to finish and
1018 pthread_cond_wait(&td->free_cond, &td->io_u_lock);
1026 static int check_get_trim(struct thread_data *td, struct io_u *io_u)
1028 if (td->o.trim_backlog && td->trim_entries) {
1031 if (td->trim_batch) {
1034 } else if (!(td->io_hist_len % td->o.trim_backlog) &&
1035 td->last_ddir != DDIR_READ) {
1036 td->trim_batch = td->o.trim_batch;
1037 if (!td->trim_batch)
1038 td->trim_batch = td->o.trim_backlog;
1042 if (get_trim && !get_next_trim(td, io_u))
1049 static int check_get_verify(struct thread_data *td, struct io_u *io_u)
1051 if (td->o.verify_backlog && td->io_hist_len) {
1054 if (td->verify_batch) {
1057 } else if (!(td->io_hist_len % td->o.verify_backlog) &&
1058 td->last_ddir != DDIR_READ) {
1059 td->verify_batch = td->o.verify_batch;
1060 if (!td->verify_batch)
1061 td->verify_batch = td->o.verify_backlog;
1065 if (get_verify && !get_next_verify(td, io_u))
1073 * Return an io_u to be processed. Gets a buflen and offset, sets direction,
1074 * etc. The returned io_u is fully ready to be prepped and submitted.
1076 struct io_u *get_io_u(struct thread_data *td)
1081 io_u = __get_io_u(td);
1083 dprint(FD_IO, "__get_io_u failed\n");
1087 if (check_get_verify(td, io_u))
1089 if (check_get_trim(td, io_u))
1093 * from a requeue, io_u already setup
1099 * If using an iolog, grab next piece if any available.
1101 if (td->o.read_iolog_file) {
1102 if (read_iolog_get(td, io_u))
1104 } else if (set_io_u_file(td, io_u)) {
1105 dprint(FD_IO, "io_u %p, setting file failed\n", io_u);
1110 assert(fio_file_open(f));
1112 if (ddir_rw(io_u->ddir)) {
1113 if (!io_u->buflen && !(td->io_ops->flags & FIO_NOIO)) {
1114 dprint(FD_IO, "get_io_u: zero buflen on %p\n", io_u);
1118 f->last_start = io_u->offset;
1119 f->last_pos = io_u->offset + io_u->buflen;
1121 if (td->o.verify != VERIFY_NONE && io_u->ddir == DDIR_WRITE)
1122 populate_verify_io_u(td, io_u);
1123 else if (td->o.refill_buffers && io_u->ddir == DDIR_WRITE)
1124 io_u_fill_buffer(td, io_u, io_u->xfer_buflen);
1125 else if (io_u->ddir == DDIR_READ) {
1127 * Reset the buf_filled parameters so next time if the
1128 * buffer is used for writes it is refilled.
1130 io_u->buf_filled_len = 0;
1135 * Set io data pointers.
1137 io_u->xfer_buf = io_u->buf;
1138 io_u->xfer_buflen = io_u->buflen;
1142 if (!td_io_prep(td, io_u)) {
1143 if (!td->o.disable_slat)
1144 fio_gettime(&io_u->start_time, NULL);
1148 dprint(FD_IO, "get_io_u failed\n");
1153 void io_u_log_error(struct thread_data *td, struct io_u *io_u)
1155 const char *msg[] = { "read", "write", "sync", "datasync",
1156 "sync_file_range", "wait", "trim" };
1160 log_err("fio: io_u error");
1163 log_err(" on file %s", io_u->file->file_name);
1165 log_err(": %s\n", strerror(io_u->error));
1167 log_err(" %s offset=%llu, buflen=%lu\n", msg[io_u->ddir],
1168 io_u->offset, io_u->xfer_buflen);
1171 td_verror(td, io_u->error, "io_u error");
1174 static void io_completed(struct thread_data *td, struct io_u *io_u,
1175 struct io_completion_data *icd)
1178 * Older gcc's are too dumb to realize that usec is always used
1179 * initialized, silence that warning.
1181 unsigned long uninitialized_var(usec);
1184 dprint_io_u(io_u, "io complete");
1187 assert(io_u->flags & IO_U_F_FLIGHT);
1188 io_u->flags &= ~(IO_U_F_FLIGHT | IO_U_F_BUSY_OK);
1191 if (ddir_sync(io_u->ddir)) {
1192 td->last_was_sync = 1;
1195 f->first_write = -1ULL;
1196 f->last_write = -1ULL;
1201 td->last_was_sync = 0;
1202 td->last_ddir = io_u->ddir;
1204 if (!io_u->error && ddir_rw(io_u->ddir)) {
1205 unsigned int bytes = io_u->buflen - io_u->resid;
1206 const enum fio_ddir idx = io_u->ddir;
1207 const enum fio_ddir odx = io_u->ddir ^ 1;
1210 td->io_blocks[idx]++;
1211 td->io_bytes[idx] += bytes;
1212 td->this_io_bytes[idx] += bytes;
1214 if (idx == DDIR_WRITE) {
1217 if (f->first_write == -1ULL ||
1218 io_u->offset < f->first_write)
1219 f->first_write = io_u->offset;
1220 if (f->last_write == -1ULL ||
1221 ((io_u->offset + bytes) > f->last_write))
1222 f->last_write = io_u->offset + bytes;
1226 if (ramp_time_over(td)) {
1227 unsigned long uninitialized_var(lusec);
1229 if (!td->o.disable_clat || !td->o.disable_bw)
1230 lusec = utime_since(&io_u->issue_time,
1232 if (!td->o.disable_lat) {
1233 unsigned long tusec;
1235 tusec = utime_since(&io_u->start_time,
1237 add_lat_sample(td, idx, tusec, bytes);
1239 if (!td->o.disable_clat) {
1240 add_clat_sample(td, idx, lusec, bytes);
1241 io_u_mark_latency(td, lusec);
1243 if (!td->o.disable_bw)
1244 add_bw_sample(td, idx, bytes, &icd->time);
1245 if (__should_check_rate(td, idx)) {
1246 td->rate_pending_usleep[idx] =
1247 ((td->this_io_bytes[idx] *
1248 td->rate_nsec_cycle[idx]) / 1000 -
1249 utime_since_now(&td->start));
1251 if (__should_check_rate(td, idx ^ 1))
1252 td->rate_pending_usleep[odx] =
1253 ((td->this_io_bytes[odx] *
1254 td->rate_nsec_cycle[odx]) / 1000 -
1255 utime_since_now(&td->start));
1258 if (td_write(td) && idx == DDIR_WRITE &&
1260 td->o.verify != VERIFY_NONE)
1261 log_io_piece(td, io_u);
1263 icd->bytes_done[idx] += bytes;
1266 ret = io_u->end_io(td, io_u);
1267 if (ret && !icd->error)
1270 } else if (io_u->error) {
1271 icd->error = io_u->error;
1272 io_u_log_error(td, io_u);
1274 if (td->o.continue_on_error && icd->error &&
1275 td_non_fatal_error(icd->error)) {
1277 * If there is a non_fatal error, then add to the error count
1278 * and clear all the errors.
1280 update_error_count(td, icd->error);
1287 static void init_icd(struct thread_data *td, struct io_completion_data *icd,
1290 if (!td->o.disable_clat || !td->o.disable_bw)
1291 fio_gettime(&icd->time, NULL);
1296 icd->bytes_done[0] = icd->bytes_done[1] = 0;
1299 static void ios_completed(struct thread_data *td,
1300 struct io_completion_data *icd)
1305 for (i = 0; i < icd->nr; i++) {
1306 io_u = td->io_ops->event(td, i);
1308 io_completed(td, io_u, icd);
1310 if (!(io_u->flags & IO_U_F_FREE_DEF))
1316 * Complete a single io_u for the sync engines.
1318 int io_u_sync_complete(struct thread_data *td, struct io_u *io_u,
1319 unsigned long *bytes)
1321 struct io_completion_data icd;
1323 init_icd(td, &icd, 1);
1324 io_completed(td, io_u, &icd);
1326 if (!(io_u->flags & IO_U_F_FREE_DEF))
1330 td_verror(td, icd.error, "io_u_sync_complete");
1335 bytes[0] += icd.bytes_done[0];
1336 bytes[1] += icd.bytes_done[1];
1343 * Called to complete min_events number of io for the async engines.
1345 int io_u_queued_complete(struct thread_data *td, int min_evts,
1346 unsigned long *bytes)
1348 struct io_completion_data icd;
1349 struct timespec *tvp = NULL;
1351 struct timespec ts = { .tv_sec = 0, .tv_nsec = 0, };
1353 dprint(FD_IO, "io_u_queued_completed: min=%d\n", min_evts);
1358 ret = td_io_getevents(td, min_evts, td->o.iodepth_batch_complete, tvp);
1360 td_verror(td, -ret, "td_io_getevents");
1365 init_icd(td, &icd, ret);
1366 ios_completed(td, &icd);
1368 td_verror(td, icd.error, "io_u_queued_complete");
1373 bytes[0] += icd.bytes_done[0];
1374 bytes[1] += icd.bytes_done[1];
1381 * Call when io_u is really queued, to update the submission latency.
1383 void io_u_queued(struct thread_data *td, struct io_u *io_u)
1385 if (!td->o.disable_slat) {
1386 unsigned long slat_time;
1388 slat_time = utime_since(&io_u->start_time, &io_u->issue_time);
1389 add_slat_sample(td, io_u->ddir, slat_time, io_u->xfer_buflen);
1394 * "randomly" fill the buffer contents
1396 void io_u_fill_buffer(struct thread_data *td, struct io_u *io_u,
1397 unsigned int max_bs)
1399 io_u->buf_filled_len = 0;
1401 if (!td->o.zero_buffers)
1402 fill_random_buf(io_u->buf, max_bs);
1404 memset(io_u->buf, 0, max_bs);