14 struct io_completion_data {
16 int account; /* input */
18 int error; /* output */
19 unsigned long bytes_done[2]; /* output */
20 struct timeval time; /* output */
24 * The ->file_map[] 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 unsigned long long block)
29 unsigned int idx = RAND_MAP_IDX(f, block);
30 unsigned int bit = RAND_MAP_BIT(f, block);
32 dprint(FD_RANDOM, "free: b=%llu, idx=%u, bit=%u\n", block, idx, bit);
34 return (f->file_map[idx] & (1UL << bit)) == 0;
38 * Mark a given offset as used in the map.
40 static void mark_random_map(struct thread_data *td, struct io_u *io_u)
42 unsigned int min_bs = td->o.rw_min_bs;
43 struct fio_file *f = io_u->file;
44 unsigned long long block;
45 unsigned int blocks, nr_blocks;
48 block = (io_u->offset - f->file_offset) / (unsigned long long) min_bs;
49 nr_blocks = (io_u->buflen + min_bs - 1) / min_bs;
51 busy_check = !(io_u->flags & IO_U_F_BUSY_OK);
54 unsigned int idx, bit;
55 unsigned long mask, this_blocks;
58 * If we have a mixed random workload, we may
59 * encounter blocks we already did IO to.
65 if ((td->o.ddir_seq_nr == 1) && !random_map_free(f, block))
68 idx = RAND_MAP_IDX(f, block);
69 bit = RAND_MAP_BIT(f, block);
71 fio_assert(td, idx < f->num_maps);
73 this_blocks = nr_blocks;
74 if (this_blocks + bit > BLOCKS_PER_MAP)
75 this_blocks = BLOCKS_PER_MAP - bit;
78 if (this_blocks == BLOCKS_PER_MAP)
81 mask = ((1UL << this_blocks) - 1) << bit;
83 if (!(f->file_map[idx] & mask))
87 } while (this_blocks);
92 f->file_map[idx] |= mask;
93 nr_blocks -= this_blocks;
94 blocks += this_blocks;
98 if ((blocks * min_bs) < io_u->buflen)
99 io_u->buflen = blocks * min_bs;
102 static unsigned long long last_block(struct thread_data *td, struct fio_file *f,
105 unsigned long long max_blocks;
106 unsigned long long max_size;
108 assert(ddir_rw(ddir));
111 * Hmm, should we make sure that ->io_size <= ->real_file_size?
113 max_size = f->io_size;
114 if (max_size > f->real_file_size)
115 max_size = f->real_file_size;
117 if (td->o.zone_range)
118 max_size = td->o.zone_range;
120 max_blocks = max_size / (unsigned long long) td->o.ba[ddir];
128 * Return the next free block in the map.
130 static int get_next_free_block(struct thread_data *td, struct fio_file *f,
131 enum fio_ddir ddir, unsigned long long *b)
133 unsigned long long block, min_bs = td->o.rw_min_bs, lastb;
136 lastb = last_block(td, f, ddir);
140 i = f->last_free_lookup;
141 block = i * BLOCKS_PER_MAP;
142 while (block * min_bs < f->real_file_size &&
143 block * min_bs < f->io_size) {
144 if (f->file_map[i] != -1UL) {
145 block += ffz(f->file_map[i]);
148 f->last_free_lookup = i;
153 block += BLOCKS_PER_MAP;
157 dprint(FD_IO, "failed finding a free block\n");
161 static int get_next_rand_offset(struct thread_data *td, struct fio_file *f,
162 enum fio_ddir ddir, unsigned long long *b)
164 unsigned long long rmax, r, lastb;
167 lastb = last_block(td, f, ddir);
171 if (f->failed_rands >= 200)
174 rmax = td->o.use_os_rand ? OS_RAND_MAX : FRAND_MAX;
176 if (td->o.use_os_rand)
177 r = os_random_long(&td->random_state);
179 r = __rand(&td->__random_state);
181 *b = (lastb - 1) * (r / ((unsigned long long) rmax + 1.0));
183 dprint(FD_RANDOM, "off rand %llu\n", r);
187 * if we are not maintaining a random map, we are done.
189 if (!file_randommap(td, f))
193 * calculate map offset and check if it's free
195 if (random_map_free(f, *b))
198 dprint(FD_RANDOM, "get_next_rand_offset: offset %llu busy\n",
202 if (!f->failed_rands++)
203 f->last_free_lookup = 0;
206 * we get here, if we didn't suceed in looking up a block. generate
207 * a random start offset into the filemap, and find the first free
212 f->last_free_lookup = (f->num_maps - 1) *
213 (r / ((unsigned long long) rmax + 1.0));
214 if (!get_next_free_block(td, f, ddir, b))
217 if (td->o.use_os_rand)
218 r = os_random_long(&td->random_state);
220 r = __rand(&td->__random_state);
224 * that didn't work either, try exhaustive search from the start
226 f->last_free_lookup = 0;
228 if (!get_next_free_block(td, f, ddir, b))
230 f->last_free_lookup = 0;
231 return get_next_free_block(td, f, ddir, b);
238 static int get_next_rand_block(struct thread_data *td, struct fio_file *f,
239 enum fio_ddir ddir, unsigned long long *b)
241 if (get_next_rand_offset(td, f, ddir, b)) {
242 dprint(FD_IO, "%s: rand offset failed, last=%llu, size=%llu\n",
243 f->file_name, f->last_pos, f->real_file_size);
250 static int get_next_seq_block(struct thread_data *td, struct fio_file *f,
251 enum fio_ddir ddir, unsigned long long *b)
253 assert(ddir_rw(ddir));
255 if (f->last_pos < f->real_file_size) {
256 unsigned long long pos;
258 if (f->last_pos == f->file_offset && td->o.ddir_seq_add < 0)
259 f->last_pos = f->real_file_size;
261 pos = f->last_pos - f->file_offset;
263 pos += td->o.ddir_seq_add;
265 *b = pos / td->o.min_bs[ddir];
272 static int get_next_block(struct thread_data *td, struct io_u *io_u,
273 enum fio_ddir ddir, int rw_seq, unsigned long long *b)
275 struct fio_file *f = io_u->file;
278 assert(ddir_rw(ddir));
282 ret = get_next_rand_block(td, f, ddir, b);
284 ret = get_next_seq_block(td, f, ddir, b);
286 io_u->flags |= IO_U_F_BUSY_OK;
288 if (td->o.rw_seq == RW_SEQ_SEQ) {
289 ret = get_next_seq_block(td, f, ddir, b);
291 ret = get_next_rand_block(td, f, ddir, b);
292 } else if (td->o.rw_seq == RW_SEQ_IDENT) {
293 if (f->last_start != -1ULL)
294 *b = (f->last_start - f->file_offset)
295 / td->o.min_bs[ddir];
300 log_err("fio: unknown rw_seq=%d\n", td->o.rw_seq);
309 * For random io, generate a random new block and see if it's used. Repeat
310 * until we find a free one. For sequential io, just return the end of
311 * the last io issued.
313 static int __get_next_offset(struct thread_data *td, struct io_u *io_u)
315 struct fio_file *f = io_u->file;
316 unsigned long long b;
317 enum fio_ddir ddir = io_u->ddir;
320 assert(ddir_rw(ddir));
322 if (td->o.ddir_seq_nr && !--td->ddir_seq_nr) {
324 td->ddir_seq_nr = td->o.ddir_seq_nr;
327 if (get_next_block(td, io_u, ddir, rw_seq_hit, &b))
330 io_u->offset = b * td->o.ba[ddir];
331 if (io_u->offset >= f->io_size) {
332 dprint(FD_IO, "get_next_offset: offset %llu >= io_size %llu\n",
333 io_u->offset, f->io_size);
337 io_u->offset += f->file_offset;
338 if (io_u->offset >= f->real_file_size) {
339 dprint(FD_IO, "get_next_offset: offset %llu >= size %llu\n",
340 io_u->offset, f->real_file_size);
347 static int get_next_offset(struct thread_data *td, struct io_u *io_u)
349 struct prof_io_ops *ops = &td->prof_io_ops;
351 if (ops->fill_io_u_off)
352 return ops->fill_io_u_off(td, io_u);
354 return __get_next_offset(td, io_u);
357 static inline int io_u_fits(struct thread_data *td, struct io_u *io_u,
360 struct fio_file *f = io_u->file;
362 return io_u->offset + buflen <= f->io_size + td->o.start_offset;
365 static unsigned int __get_next_buflen(struct thread_data *td, struct io_u *io_u)
367 const int ddir = io_u->ddir;
368 unsigned int uninitialized_var(buflen);
369 unsigned int minbs, maxbs;
370 unsigned long r, rand_max;
372 assert(ddir_rw(ddir));
374 minbs = td->o.min_bs[ddir];
375 maxbs = td->o.max_bs[ddir];
381 * If we can't satisfy the min block size from here, then fail
383 if (!io_u_fits(td, io_u, minbs))
386 if (td->o.use_os_rand)
387 rand_max = OS_RAND_MAX;
389 rand_max = FRAND_MAX;
392 if (td->o.use_os_rand)
393 r = os_random_long(&td->bsrange_state);
395 r = __rand(&td->__bsrange_state);
397 if (!td->o.bssplit_nr[ddir]) {
398 buflen = 1 + (unsigned int) ((double) maxbs *
399 (r / (rand_max + 1.0)));
406 for (i = 0; i < td->o.bssplit_nr[ddir]; i++) {
407 struct bssplit *bsp = &td->o.bssplit[ddir][i];
411 if ((r <= ((rand_max / 100L) * perc)) &&
412 io_u_fits(td, io_u, buflen))
417 if (!td->o.bs_unaligned && is_power_of_2(minbs))
418 buflen = (buflen + minbs - 1) & ~(minbs - 1);
420 } while (!io_u_fits(td, io_u, buflen));
425 static unsigned int get_next_buflen(struct thread_data *td, struct io_u *io_u)
427 struct prof_io_ops *ops = &td->prof_io_ops;
429 if (ops->fill_io_u_size)
430 return ops->fill_io_u_size(td, io_u);
432 return __get_next_buflen(td, io_u);
435 static void set_rwmix_bytes(struct thread_data *td)
440 * we do time or byte based switch. this is needed because
441 * buffered writes may issue a lot quicker than they complete,
442 * whereas reads do not.
444 diff = td->o.rwmix[td->rwmix_ddir ^ 1];
445 td->rwmix_issues = (td->io_issues[td->rwmix_ddir] * diff) / 100;
448 static inline enum fio_ddir get_rand_ddir(struct thread_data *td)
453 if (td->o.use_os_rand) {
454 r = os_random_long(&td->rwmix_state);
455 v = 1 + (int) (100.0 * (r / (OS_RAND_MAX + 1.0)));
457 r = __rand(&td->__rwmix_state);
458 v = 1 + (int) (100.0 * (r / (FRAND_MAX + 1.0)));
461 if (v <= td->o.rwmix[DDIR_READ])
467 static enum fio_ddir rate_ddir(struct thread_data *td, enum fio_ddir ddir)
469 enum fio_ddir odir = ddir ^ 1;
473 assert(ddir_rw(ddir));
475 if (td->rate_pending_usleep[ddir] <= 0)
479 * We have too much pending sleep in this direction. See if we
484 * Other direction does not have too much pending, switch
486 if (td->rate_pending_usleep[odir] < 100000)
490 * Both directions have pending sleep. Sleep the minimum time
491 * and deduct from both.
493 if (td->rate_pending_usleep[ddir] <=
494 td->rate_pending_usleep[odir]) {
495 usec = td->rate_pending_usleep[ddir];
497 usec = td->rate_pending_usleep[odir];
501 usec = td->rate_pending_usleep[ddir];
504 * We are going to sleep, ensure that we flush anything pending as
505 * not to skew our latency numbers.
507 * Changed to only monitor 'in flight' requests here instead of the
508 * td->cur_depth, b/c td->cur_depth does not accurately represent
509 * io's that have been actually submitted to an async engine,
510 * and cur_depth is meaningless for sync engines.
512 if (td->io_u_in_flight) {
515 ret = io_u_queued_complete(td, td->io_u_in_flight, NULL);
518 fio_gettime(&t, NULL);
519 usec_sleep(td, usec);
520 usec = utime_since_now(&t);
522 td->rate_pending_usleep[ddir] -= usec;
525 if (td_rw(td) && __should_check_rate(td, odir))
526 td->rate_pending_usleep[odir] -= usec;
532 * Return the data direction for the next io_u. If the job is a
533 * mixed read/write workload, check the rwmix cycle and switch if
536 static enum fio_ddir get_rw_ddir(struct thread_data *td)
541 * see if it's time to fsync
543 if (td->o.fsync_blocks &&
544 !(td->io_issues[DDIR_WRITE] % td->o.fsync_blocks) &&
545 td->io_issues[DDIR_WRITE] && should_fsync(td))
549 * see if it's time to fdatasync
551 if (td->o.fdatasync_blocks &&
552 !(td->io_issues[DDIR_WRITE] % td->o.fdatasync_blocks) &&
553 td->io_issues[DDIR_WRITE] && should_fsync(td))
554 return DDIR_DATASYNC;
557 * see if it's time to sync_file_range
559 if (td->sync_file_range_nr &&
560 !(td->io_issues[DDIR_WRITE] % td->sync_file_range_nr) &&
561 td->io_issues[DDIR_WRITE] && should_fsync(td))
562 return DDIR_SYNC_FILE_RANGE;
566 * Check if it's time to seed a new data direction.
568 if (td->io_issues[td->rwmix_ddir] >= td->rwmix_issues) {
570 * Put a top limit on how many bytes we do for
571 * one data direction, to avoid overflowing the
574 ddir = get_rand_ddir(td);
576 if (ddir != td->rwmix_ddir)
579 td->rwmix_ddir = ddir;
581 ddir = td->rwmix_ddir;
582 } else if (td_read(td))
587 td->rwmix_ddir = rate_ddir(td, ddir);
588 return td->rwmix_ddir;
591 static void set_rw_ddir(struct thread_data *td, struct io_u *io_u)
593 io_u->ddir = get_rw_ddir(td);
595 if (io_u->ddir == DDIR_WRITE && (td->io_ops->flags & FIO_BARRIER) &&
596 td->o.barrier_blocks &&
597 !(td->io_issues[DDIR_WRITE] % td->o.barrier_blocks) &&
598 td->io_issues[DDIR_WRITE])
599 io_u->flags |= IO_U_F_BARRIER;
602 void put_file_log(struct thread_data *td, struct fio_file *f)
604 int ret = put_file(td, f);
607 td_verror(td, ret, "file close");
610 void put_io_u(struct thread_data *td, struct io_u *io_u)
614 if (io_u->file && !(io_u->flags & IO_U_F_FREE_DEF))
615 put_file_log(td, io_u->file);
617 io_u->flags &= ~IO_U_F_FREE_DEF;
618 io_u->flags |= IO_U_F_FREE;
620 if (io_u->flags & IO_U_F_IN_CUR_DEPTH)
622 flist_del_init(&io_u->list);
623 flist_add(&io_u->list, &td->io_u_freelist);
625 td_io_u_free_notify(td);
628 void clear_io_u(struct thread_data *td, struct io_u *io_u)
630 io_u->flags &= ~IO_U_F_FLIGHT;
634 void requeue_io_u(struct thread_data *td, struct io_u **io_u)
636 struct io_u *__io_u = *io_u;
638 dprint(FD_IO, "requeue %p\n", __io_u);
642 __io_u->flags |= IO_U_F_FREE;
643 if ((__io_u->flags & IO_U_F_FLIGHT) && ddir_rw(__io_u->ddir))
644 td->io_issues[__io_u->ddir]--;
646 __io_u->flags &= ~IO_U_F_FLIGHT;
647 if (__io_u->flags & IO_U_F_IN_CUR_DEPTH)
649 flist_del(&__io_u->list);
650 flist_add_tail(&__io_u->list, &td->io_u_requeues);
655 static int fill_io_u(struct thread_data *td, struct io_u *io_u)
657 if (td->io_ops->flags & FIO_NOIO)
660 set_rw_ddir(td, io_u);
663 * fsync() or fdatasync() or trim etc, we are done
665 if (!ddir_rw(io_u->ddir))
669 * See if it's time to switch to a new zone
671 if (td->zone_bytes >= td->o.zone_size) {
673 io_u->file->file_offset += td->o.zone_range + td->o.zone_skip;
674 io_u->file->last_pos = io_u->file->file_offset;
675 td->io_skip_bytes += td->o.zone_skip;
679 * No log, let the seq/rand engine retrieve the next buflen and
682 if (get_next_offset(td, io_u)) {
683 dprint(FD_IO, "io_u %p, failed getting offset\n", io_u);
687 io_u->buflen = get_next_buflen(td, io_u);
689 dprint(FD_IO, "io_u %p, failed getting buflen\n", io_u);
693 if (io_u->offset + io_u->buflen > io_u->file->real_file_size) {
694 dprint(FD_IO, "io_u %p, offset too large\n", io_u);
695 dprint(FD_IO, " off=%llu/%lu > %llu\n", io_u->offset,
696 io_u->buflen, io_u->file->real_file_size);
701 * mark entry before potentially trimming io_u
703 if (td_random(td) && file_randommap(td, io_u->file))
704 mark_random_map(td, io_u);
707 * If using a write iolog, store this entry.
710 dprint_io_u(io_u, "fill_io_u");
711 td->zone_bytes += io_u->buflen;
716 static void __io_u_mark_map(unsigned int *map, unsigned int nr)
745 void io_u_mark_submit(struct thread_data *td, unsigned int nr)
747 __io_u_mark_map(td->ts.io_u_submit, nr);
748 td->ts.total_submit++;
751 void io_u_mark_complete(struct thread_data *td, unsigned int nr)
753 __io_u_mark_map(td->ts.io_u_complete, nr);
754 td->ts.total_complete++;
757 void io_u_mark_depth(struct thread_data *td, unsigned int nr)
761 switch (td->cur_depth) {
783 td->ts.io_u_map[idx] += nr;
786 static void io_u_mark_lat_usec(struct thread_data *td, unsigned long usec)
823 assert(idx < FIO_IO_U_LAT_U_NR);
824 td->ts.io_u_lat_u[idx]++;
827 static void io_u_mark_lat_msec(struct thread_data *td, unsigned long msec)
868 assert(idx < FIO_IO_U_LAT_M_NR);
869 td->ts.io_u_lat_m[idx]++;
872 static void io_u_mark_latency(struct thread_data *td, unsigned long usec)
875 io_u_mark_lat_usec(td, usec);
877 io_u_mark_lat_msec(td, usec / 1000);
881 * Get next file to service by choosing one at random
883 static struct fio_file *get_next_file_rand(struct thread_data *td,
884 enum fio_file_flags goodf,
885 enum fio_file_flags badf)
894 if (td->o.use_os_rand) {
895 r = os_random_long(&td->next_file_state);
896 fno = (unsigned int) ((double) td->o.nr_files
897 * (r / (OS_RAND_MAX + 1.0)));
899 r = __rand(&td->__next_file_state);
900 fno = (unsigned int) ((double) td->o.nr_files
901 * (r / (FRAND_MAX + 1.0)));
905 if (fio_file_done(f))
908 if (!fio_file_open(f)) {
911 err = td_io_open_file(td, f);
917 if ((!goodf || (f->flags & goodf)) && !(f->flags & badf)) {
918 dprint(FD_FILE, "get_next_file_rand: %p\n", f);
922 td_io_close_file(td, f);
927 * Get next file to service by doing round robin between all available ones
929 static struct fio_file *get_next_file_rr(struct thread_data *td, int goodf,
932 unsigned int old_next_file = td->next_file;
938 f = td->files[td->next_file];
941 if (td->next_file >= td->o.nr_files)
944 dprint(FD_FILE, "trying file %s %x\n", f->file_name, f->flags);
945 if (fio_file_done(f)) {
950 if (!fio_file_open(f)) {
953 err = td_io_open_file(td, f);
955 dprint(FD_FILE, "error %d on open of %s\n",
963 dprint(FD_FILE, "goodf=%x, badf=%x, ff=%x\n", goodf, badf,
965 if ((!goodf || (f->flags & goodf)) && !(f->flags & badf))
969 td_io_close_file(td, f);
972 } while (td->next_file != old_next_file);
974 dprint(FD_FILE, "get_next_file_rr: %p\n", f);
978 static struct fio_file *__get_next_file(struct thread_data *td)
982 assert(td->o.nr_files <= td->files_index);
984 if (td->nr_done_files >= td->o.nr_files) {
985 dprint(FD_FILE, "get_next_file: nr_open=%d, nr_done=%d,"
986 " nr_files=%d\n", td->nr_open_files,
992 f = td->file_service_file;
993 if (f && fio_file_open(f) && !fio_file_closing(f)) {
994 if (td->o.file_service_type == FIO_FSERVICE_SEQ)
996 if (td->file_service_left--)
1000 if (td->o.file_service_type == FIO_FSERVICE_RR ||
1001 td->o.file_service_type == FIO_FSERVICE_SEQ)
1002 f = get_next_file_rr(td, FIO_FILE_open, FIO_FILE_closing);
1004 f = get_next_file_rand(td, FIO_FILE_open, FIO_FILE_closing);
1006 td->file_service_file = f;
1007 td->file_service_left = td->file_service_nr - 1;
1009 dprint(FD_FILE, "get_next_file: %p [%s]\n", f, f->file_name);
1013 static struct fio_file *get_next_file(struct thread_data *td)
1015 struct prof_io_ops *ops = &td->prof_io_ops;
1017 if (ops->get_next_file)
1018 return ops->get_next_file(td);
1020 return __get_next_file(td);
1023 static int set_io_u_file(struct thread_data *td, struct io_u *io_u)
1028 f = get_next_file(td);
1035 if (!fill_io_u(td, io_u))
1038 put_file_log(td, f);
1039 td_io_close_file(td, f);
1041 fio_file_set_done(f);
1042 td->nr_done_files++;
1043 dprint(FD_FILE, "%s: is done (%d of %d)\n", f->file_name,
1044 td->nr_done_files, td->o.nr_files);
1051 struct io_u *__get_io_u(struct thread_data *td)
1053 struct io_u *io_u = NULL;
1058 if (!flist_empty(&td->io_u_requeues))
1059 io_u = flist_entry(td->io_u_requeues.next, struct io_u, list);
1060 else if (!queue_full(td)) {
1061 io_u = flist_entry(td->io_u_freelist.next, struct io_u, list);
1066 io_u->end_io = NULL;
1070 assert(io_u->flags & IO_U_F_FREE);
1071 io_u->flags &= ~(IO_U_F_FREE | IO_U_F_FREE_DEF);
1072 io_u->flags &= ~(IO_U_F_TRIMMED | IO_U_F_BARRIER);
1075 flist_del(&io_u->list);
1076 flist_add(&io_u->list, &td->io_u_busylist);
1078 io_u->flags |= IO_U_F_IN_CUR_DEPTH;
1079 } else if (td->o.verify_async) {
1081 * We ran out, wait for async verify threads to finish and
1084 pthread_cond_wait(&td->free_cond, &td->io_u_lock);
1092 static int check_get_trim(struct thread_data *td, struct io_u *io_u)
1094 if (td->o.trim_backlog && td->trim_entries) {
1097 if (td->trim_batch) {
1100 } else if (!(td->io_hist_len % td->o.trim_backlog) &&
1101 td->last_ddir != DDIR_READ) {
1102 td->trim_batch = td->o.trim_batch;
1103 if (!td->trim_batch)
1104 td->trim_batch = td->o.trim_backlog;
1108 if (get_trim && !get_next_trim(td, io_u))
1115 static int check_get_verify(struct thread_data *td, struct io_u *io_u)
1117 if (td->o.verify_backlog && td->io_hist_len) {
1120 if (td->verify_batch) {
1123 } else if (!(td->io_hist_len % td->o.verify_backlog) &&
1124 td->last_ddir != DDIR_READ) {
1125 td->verify_batch = td->o.verify_batch;
1126 if (!td->verify_batch)
1127 td->verify_batch = td->o.verify_backlog;
1131 if (get_verify && !get_next_verify(td, io_u))
1139 * Fill offset and start time into the buffer content, to prevent too
1140 * easy compressible data for simple de-dupe attempts. Do this for every
1141 * 512b block in the range, since that should be the smallest block size
1142 * we can expect from a device.
1144 static void small_content_scramble(struct io_u *io_u)
1146 unsigned int i, nr_blocks = io_u->buflen / 512;
1147 unsigned long long boffset;
1148 unsigned int offset;
1155 boffset = io_u->offset;
1156 io_u->buf_filled_len = 0;
1158 for (i = 0; i < nr_blocks; i++) {
1160 * Fill the byte offset into a "random" start offset of
1161 * the buffer, given by the product of the usec time
1162 * and the actual offset.
1164 offset = (io_u->start_time.tv_usec ^ boffset) & 511;
1165 offset &= ~(sizeof(unsigned long long) - 1);
1166 if (offset >= 512 - sizeof(unsigned long long))
1167 offset -= sizeof(unsigned long long);
1168 memcpy(p + offset, &boffset, sizeof(boffset));
1170 end = p + 512 - sizeof(io_u->start_time);
1171 memcpy(end, &io_u->start_time, sizeof(io_u->start_time));
1178 * Return an io_u to be processed. Gets a buflen and offset, sets direction,
1179 * etc. The returned io_u is fully ready to be prepped and submitted.
1181 struct io_u *get_io_u(struct thread_data *td)
1185 int do_scramble = 0;
1187 io_u = __get_io_u(td);
1189 dprint(FD_IO, "__get_io_u failed\n");
1193 if (check_get_verify(td, io_u))
1195 if (check_get_trim(td, io_u))
1199 * from a requeue, io_u already setup
1205 * If using an iolog, grab next piece if any available.
1207 if (td->o.read_iolog_file) {
1208 if (read_iolog_get(td, io_u))
1210 } else if (set_io_u_file(td, io_u)) {
1211 dprint(FD_IO, "io_u %p, setting file failed\n", io_u);
1216 assert(fio_file_open(f));
1218 if (ddir_rw(io_u->ddir)) {
1219 if (!io_u->buflen && !(td->io_ops->flags & FIO_NOIO)) {
1220 dprint(FD_IO, "get_io_u: zero buflen on %p\n", io_u);
1224 f->last_start = io_u->offset;
1225 f->last_pos = io_u->offset + io_u->buflen;
1227 if (io_u->ddir == DDIR_WRITE) {
1228 if (td->o.verify != VERIFY_NONE)
1229 populate_verify_io_u(td, io_u);
1230 else if (td->o.refill_buffers)
1231 io_u_fill_buffer(td, io_u, io_u->xfer_buflen);
1232 else if (td->o.scramble_buffers)
1234 } else if (io_u->ddir == DDIR_READ) {
1236 * Reset the buf_filled parameters so next time if the
1237 * buffer is used for writes it is refilled.
1239 io_u->buf_filled_len = 0;
1244 * Set io data pointers.
1246 io_u->xfer_buf = io_u->buf;
1247 io_u->xfer_buflen = io_u->buflen;
1251 if (!td_io_prep(td, io_u)) {
1252 if (!td->o.disable_slat)
1253 fio_gettime(&io_u->start_time, NULL);
1255 small_content_scramble(io_u);
1259 dprint(FD_IO, "get_io_u failed\n");
1264 void io_u_log_error(struct thread_data *td, struct io_u *io_u)
1266 const char *msg[] = { "read", "write", "sync", "datasync",
1267 "sync_file_range", "wait", "trim" };
1271 log_err("fio: io_u error");
1274 log_err(" on file %s", io_u->file->file_name);
1276 log_err(": %s\n", strerror(io_u->error));
1278 log_err(" %s offset=%llu, buflen=%lu\n", msg[io_u->ddir],
1279 io_u->offset, io_u->xfer_buflen);
1282 td_verror(td, io_u->error, "io_u error");
1285 static void account_io_completion(struct thread_data *td, struct io_u *io_u,
1286 struct io_completion_data *icd,
1287 const enum fio_ddir idx, unsigned int bytes)
1289 unsigned long uninitialized_var(lusec);
1294 if (!td->o.disable_clat || !td->o.disable_bw)
1295 lusec = utime_since(&io_u->issue_time, &icd->time);
1297 if (!td->o.disable_lat) {
1298 unsigned long tusec;
1300 tusec = utime_since(&io_u->start_time, &icd->time);
1301 add_lat_sample(td, idx, tusec, bytes);
1304 if (!td->o.disable_clat) {
1305 add_clat_sample(td, idx, lusec, bytes);
1306 io_u_mark_latency(td, lusec);
1309 if (!td->o.disable_bw)
1310 add_bw_sample(td, idx, bytes, &icd->time);
1312 add_iops_sample(td, idx, &icd->time);
1315 static long long usec_for_io(struct thread_data *td, enum fio_ddir ddir)
1317 unsigned long long secs, remainder, bps, bytes;
1318 bytes = td->this_io_bytes[ddir];
1319 bps = td->rate_bps[ddir];
1321 remainder = bytes % bps;
1322 return remainder * 1000000 / bps + secs * 1000000;
1325 static void io_completed(struct thread_data *td, struct io_u *io_u,
1326 struct io_completion_data *icd)
1329 * Older gcc's are too dumb to realize that usec is always used
1330 * initialized, silence that warning.
1332 unsigned long uninitialized_var(usec);
1335 dprint_io_u(io_u, "io complete");
1338 assert(io_u->flags & IO_U_F_FLIGHT);
1339 io_u->flags &= ~(IO_U_F_FLIGHT | IO_U_F_BUSY_OK);
1342 if (ddir_sync(io_u->ddir)) {
1343 td->last_was_sync = 1;
1346 f->first_write = -1ULL;
1347 f->last_write = -1ULL;
1352 td->last_was_sync = 0;
1353 td->last_ddir = io_u->ddir;
1355 if (!io_u->error && ddir_rw(io_u->ddir)) {
1356 unsigned int bytes = io_u->buflen - io_u->resid;
1357 const enum fio_ddir idx = io_u->ddir;
1358 const enum fio_ddir odx = io_u->ddir ^ 1;
1361 td->io_blocks[idx]++;
1362 td->this_io_blocks[idx]++;
1363 td->io_bytes[idx] += bytes;
1364 td->this_io_bytes[idx] += bytes;
1366 if (idx == DDIR_WRITE) {
1369 if (f->first_write == -1ULL ||
1370 io_u->offset < f->first_write)
1371 f->first_write = io_u->offset;
1372 if (f->last_write == -1ULL ||
1373 ((io_u->offset + bytes) > f->last_write))
1374 f->last_write = io_u->offset + bytes;
1378 if (ramp_time_over(td) && (td->runstate == TD_RUNNING ||
1379 td->runstate == TD_VERIFYING)) {
1380 account_io_completion(td, io_u, icd, idx, bytes);
1382 if (__should_check_rate(td, idx)) {
1383 td->rate_pending_usleep[idx] =
1384 (usec_for_io(td, idx) -
1385 utime_since_now(&td->start));
1387 if (__should_check_rate(td, odx))
1388 td->rate_pending_usleep[odx] =
1389 (usec_for_io(td, odx) -
1390 utime_since_now(&td->start));
1393 if (td_write(td) && idx == DDIR_WRITE &&
1395 td->o.verify != VERIFY_NONE)
1396 log_io_piece(td, io_u);
1398 icd->bytes_done[idx] += bytes;
1401 ret = io_u->end_io(td, io_u);
1402 if (ret && !icd->error)
1405 } else if (io_u->error) {
1406 icd->error = io_u->error;
1407 io_u_log_error(td, io_u);
1409 if (icd->error && td_non_fatal_error(icd->error) &&
1410 (td->o.continue_on_error & td_error_type(io_u->ddir, icd->error))) {
1412 * If there is a non_fatal error, then add to the error count
1413 * and clear all the errors.
1415 update_error_count(td, icd->error);
1422 static void init_icd(struct thread_data *td, struct io_completion_data *icd,
1425 if (!td->o.disable_clat || !td->o.disable_bw)
1426 fio_gettime(&icd->time, NULL);
1432 icd->bytes_done[0] = icd->bytes_done[1] = 0;
1435 static void ios_completed(struct thread_data *td,
1436 struct io_completion_data *icd)
1441 for (i = 0; i < icd->nr; i++) {
1442 io_u = td->io_ops->event(td, i);
1444 io_completed(td, io_u, icd);
1446 if (!(io_u->flags & IO_U_F_FREE_DEF))
1454 * Complete a single io_u for the sync engines.
1456 int io_u_sync_complete(struct thread_data *td, struct io_u *io_u,
1457 unsigned long *bytes)
1459 struct io_completion_data icd;
1461 init_icd(td, &icd, 1);
1462 io_completed(td, io_u, &icd);
1464 if (!(io_u->flags & IO_U_F_FREE_DEF))
1468 td_verror(td, icd.error, "io_u_sync_complete");
1473 bytes[0] += icd.bytes_done[0];
1474 bytes[1] += icd.bytes_done[1];
1481 * Called to complete min_events number of io for the async engines.
1483 int io_u_queued_complete(struct thread_data *td, int min_evts,
1484 unsigned long *bytes)
1486 struct io_completion_data icd;
1487 struct timespec *tvp = NULL;
1489 struct timespec ts = { .tv_sec = 0, .tv_nsec = 0, };
1491 dprint(FD_IO, "io_u_queued_completed: min=%d\n", min_evts);
1496 ret = td_io_getevents(td, min_evts, td->o.iodepth_batch_complete, tvp);
1498 td_verror(td, -ret, "td_io_getevents");
1503 init_icd(td, &icd, ret);
1504 ios_completed(td, &icd);
1506 td_verror(td, icd.error, "io_u_queued_complete");
1511 bytes[0] += icd.bytes_done[0];
1512 bytes[1] += icd.bytes_done[1];
1519 * Call when io_u is really queued, to update the submission latency.
1521 void io_u_queued(struct thread_data *td, struct io_u *io_u)
1523 if (!td->o.disable_slat) {
1524 unsigned long slat_time;
1526 slat_time = utime_since(&io_u->start_time, &io_u->issue_time);
1527 add_slat_sample(td, io_u->ddir, slat_time, io_u->xfer_buflen);
1532 * "randomly" fill the buffer contents
1534 void io_u_fill_buffer(struct thread_data *td, struct io_u *io_u,
1535 unsigned int max_bs)
1537 io_u->buf_filled_len = 0;
1539 if (!td->o.zero_buffers)
1540 fill_random_buf(&td->buf_state, io_u->buf, max_bs);
1542 memset(io_u->buf, 0, max_bs);