11 struct io_completion_data {
14 int error; /* output */
15 unsigned long bytes_done[2]; /* output */
16 struct timeval time; /* output */
20 * The ->file_map[] contains a map of blocks we have or have not done io
21 * to yet. Used to make sure we cover the entire range in a fair fashion.
23 static int random_map_free(struct fio_file *f, const unsigned long long block)
25 unsigned int idx = RAND_MAP_IDX(f, block);
26 unsigned int bit = RAND_MAP_BIT(f, block);
28 dprint(FD_RANDOM, "free: b=%llu, idx=%u, bit=%u\n", block, idx, bit);
30 return (f->file_map[idx] & (1 << bit)) == 0;
34 * Mark a given offset as used in the map.
36 static void mark_random_map(struct thread_data *td, struct io_u *io_u)
38 unsigned int min_bs = td->o.rw_min_bs;
39 struct fio_file *f = io_u->file;
40 unsigned long long block;
41 unsigned int blocks, nr_blocks;
43 block = (io_u->offset - f->file_offset) / (unsigned long long) min_bs;
44 nr_blocks = (io_u->buflen + min_bs - 1) / min_bs;
48 unsigned int this_blocks, mask;
49 unsigned int idx, bit;
52 * If we have a mixed random workload, we may
53 * encounter blocks we already did IO to.
55 if ((td->o.ddir_nr == 1) && !random_map_free(f, block)) {
61 idx = RAND_MAP_IDX(f, block);
62 bit = RAND_MAP_BIT(f, block);
64 fio_assert(td, idx < f->num_maps);
66 this_blocks = nr_blocks;
67 if (this_blocks + bit > BLOCKS_PER_MAP)
68 this_blocks = BLOCKS_PER_MAP - bit;
70 if (this_blocks == BLOCKS_PER_MAP)
73 mask = ((1U << this_blocks) - 1) << bit;
75 f->file_map[idx] |= mask;
76 nr_blocks -= this_blocks;
77 blocks += this_blocks;
81 if ((blocks * min_bs) < io_u->buflen)
82 io_u->buflen = blocks * min_bs;
85 static unsigned long long last_block(struct thread_data *td, struct fio_file *f,
88 unsigned long long max_blocks;
89 unsigned long long max_size;
92 * Hmm, should we make sure that ->io_size <= ->real_file_size?
94 max_size = f->io_size;
95 if (max_size > f->real_file_size)
96 max_size = f->real_file_size;
98 max_blocks = max_size / (unsigned long long) td->o.min_bs[ddir];
106 * Return the next free block in the map.
108 static int get_next_free_block(struct thread_data *td, struct fio_file *f,
109 enum fio_ddir ddir, unsigned long long *b)
111 unsigned long long min_bs = td->o.rw_min_bs;
114 i = f->last_free_lookup;
115 *b = (i * BLOCKS_PER_MAP);
116 while ((*b) * min_bs < f->real_file_size) {
117 if (f->file_map[i] != (unsigned int) -1) {
118 *b += ffz(f->file_map[i]);
119 if (*b > last_block(td, f, ddir))
121 f->last_free_lookup = i;
125 *b += BLOCKS_PER_MAP;
129 dprint(FD_IO, "failed finding a free block\n");
133 static int get_next_rand_offset(struct thread_data *td, struct fio_file *f,
134 enum fio_ddir ddir, unsigned long long *b)
136 unsigned long long r;
140 r = os_random_long(&td->random_state);
141 dprint(FD_RANDOM, "off rand %llu\n", r);
142 *b = (last_block(td, f, ddir) - 1)
143 * (r / ((unsigned long long) OS_RAND_MAX + 1.0));
146 * if we are not maintaining a random map, we are done.
148 if (!file_randommap(td, f))
152 * calculate map offset and check if it's free
154 if (random_map_free(f, *b))
157 dprint(FD_RANDOM, "get_next_rand_offset: offset %llu busy\n",
162 * we get here, if we didn't suceed in looking up a block. generate
163 * a random start offset into the filemap, and find the first free
168 f->last_free_lookup = (f->num_maps - 1) *
169 (r / (OS_RAND_MAX + 1.0));
170 if (!get_next_free_block(td, f, ddir, b))
173 r = os_random_long(&td->random_state);
177 * that didn't work either, try exhaustive search from the start
179 f->last_free_lookup = 0;
180 return get_next_free_block(td, f, ddir, b);
184 * For random io, generate a random new block and see if it's used. Repeat
185 * until we find a free one. For sequential io, just return the end of
186 * the last io issued.
188 static int get_next_offset(struct thread_data *td, struct io_u *io_u)
190 struct fio_file *f = io_u->file;
191 unsigned long long b;
192 enum fio_ddir ddir = io_u->ddir;
194 if (td_random(td) && (td->o.ddir_nr && !--td->ddir_nr)) {
195 td->ddir_nr = td->o.ddir_nr;
197 if (get_next_rand_offset(td, f, ddir, &b))
200 if (f->last_pos >= f->real_file_size) {
201 if (!td_random(td) ||
202 get_next_rand_offset(td, f, ddir, &b))
205 b = (f->last_pos - f->file_offset) / td->o.min_bs[ddir];
208 io_u->offset = b * td->o.min_bs[ddir];
209 if (io_u->offset >= f->io_size) {
210 dprint(FD_IO, "get_next_offset: offset %llu >= io_size %llu\n",
211 io_u->offset, f->io_size);
215 io_u->offset += f->file_offset;
216 if (io_u->offset >= f->real_file_size) {
217 dprint(FD_IO, "get_next_offset: offset %llu >= size %llu\n",
218 io_u->offset, f->real_file_size);
225 static inline int is_power_of_2(unsigned int val)
227 return (val != 0 && ((val & (val - 1)) == 0));
230 static unsigned int get_next_buflen(struct thread_data *td, struct io_u *io_u)
232 const int ddir = io_u->ddir;
233 unsigned int uninitialized_var(buflen);
234 unsigned int minbs, maxbs;
237 minbs = td->o.min_bs[ddir];
238 maxbs = td->o.max_bs[ddir];
243 r = os_random_long(&td->bsrange_state);
244 if (!td->o.bssplit_nr) {
245 buflen = 1 + (unsigned int) ((double) maxbs *
246 (r / (OS_RAND_MAX + 1.0)));
253 for (i = 0; i < td->o.bssplit_nr; i++) {
254 struct bssplit *bsp = &td->o.bssplit[i];
258 if (r <= ((OS_RAND_MAX / 100L) * perc))
262 if (!td->o.bs_unaligned && is_power_of_2(minbs))
263 buflen = (buflen + minbs - 1) & ~(minbs - 1);
266 if (io_u->offset + buflen > io_u->file->real_file_size) {
267 dprint(FD_IO, "lower buflen %u -> %u (ddir=%d)\n", buflen,
275 static void set_rwmix_bytes(struct thread_data *td)
280 * we do time or byte based switch. this is needed because
281 * buffered writes may issue a lot quicker than they complete,
282 * whereas reads do not.
284 diff = td->o.rwmix[td->rwmix_ddir ^ 1];
285 td->rwmix_issues = (td->io_issues[td->rwmix_ddir] * diff) / 100;
288 static inline enum fio_ddir get_rand_ddir(struct thread_data *td)
293 r = os_random_long(&td->rwmix_state);
294 v = 1 + (int) (100.0 * (r / (OS_RAND_MAX + 1.0)));
295 if (v <= td->o.rwmix[DDIR_READ])
302 * Return the data direction for the next io_u. If the job is a
303 * mixed read/write workload, check the rwmix cycle and switch if
306 static enum fio_ddir get_rw_ddir(struct thread_data *td)
310 * Check if it's time to seed a new data direction.
312 if (td->io_issues[td->rwmix_ddir] >= td->rwmix_issues) {
313 unsigned long long max_bytes;
317 * Put a top limit on how many bytes we do for
318 * one data direction, to avoid overflowing the
321 ddir = get_rand_ddir(td);
322 max_bytes = td->this_io_bytes[ddir];
324 (td->o.size * td->o.rwmix[ddir] / 100)) {
325 if (!td->rw_end_set[ddir]) {
326 td->rw_end_set[ddir] = 1;
327 fio_gettime(&td->rw_end[ddir], NULL);
333 if (ddir != td->rwmix_ddir)
336 td->rwmix_ddir = ddir;
338 return td->rwmix_ddir;
339 } else if (td_read(td))
345 static void put_file_log(struct thread_data *td, struct fio_file *f)
347 int ret = put_file(td, f);
350 td_verror(td, ret, "file close");
353 void put_io_u(struct thread_data *td, struct io_u *io_u)
355 assert((io_u->flags & IO_U_F_FREE) == 0);
356 io_u->flags |= IO_U_F_FREE;
359 put_file_log(td, io_u->file);
362 flist_del(&io_u->list);
363 flist_add(&io_u->list, &td->io_u_freelist);
367 void requeue_io_u(struct thread_data *td, struct io_u **io_u)
369 struct io_u *__io_u = *io_u;
371 dprint(FD_IO, "requeue %p\n", __io_u);
373 __io_u->flags |= IO_U_F_FREE;
374 if ((__io_u->flags & IO_U_F_FLIGHT) && (__io_u->ddir != DDIR_SYNC))
375 td->io_issues[__io_u->ddir]--;
377 __io_u->flags &= ~IO_U_F_FLIGHT;
379 flist_del(&__io_u->list);
380 flist_add_tail(&__io_u->list, &td->io_u_requeues);
385 static int fill_io_u(struct thread_data *td, struct io_u *io_u)
387 if (td->io_ops->flags & FIO_NOIO)
391 * see if it's time to sync
393 if (td->o.fsync_blocks &&
394 !(td->io_issues[DDIR_WRITE] % td->o.fsync_blocks) &&
395 td->io_issues[DDIR_WRITE] && should_fsync(td)) {
396 io_u->ddir = DDIR_SYNC;
400 io_u->ddir = get_rw_ddir(td);
403 * See if it's time to switch to a new zone
405 if (td->zone_bytes >= td->o.zone_size) {
407 io_u->file->last_pos += td->o.zone_skip;
408 td->io_skip_bytes += td->o.zone_skip;
412 * No log, let the seq/rand engine retrieve the next buflen and
415 if (get_next_offset(td, io_u)) {
416 dprint(FD_IO, "io_u %p, failed getting offset\n", io_u);
420 io_u->buflen = get_next_buflen(td, io_u);
422 dprint(FD_IO, "io_u %p, failed getting buflen\n", io_u);
426 if (io_u->offset + io_u->buflen > io_u->file->real_file_size) {
427 dprint(FD_IO, "io_u %p, offset too large\n", io_u);
428 dprint(FD_IO, " off=%llu/%lu > %llu\n", io_u->offset,
429 io_u->buflen, io_u->file->real_file_size);
434 * mark entry before potentially trimming io_u
436 if (td_random(td) && file_randommap(td, io_u->file))
437 mark_random_map(td, io_u);
440 * If using a write iolog, store this entry.
443 dprint_io_u(io_u, "fill_io_u");
444 td->zone_bytes += io_u->buflen;
449 static void __io_u_mark_map(unsigned int *map, unsigned int nr)
478 void io_u_mark_submit(struct thread_data *td, unsigned int nr)
480 __io_u_mark_map(td->ts.io_u_submit, nr);
481 td->ts.total_submit++;
484 void io_u_mark_complete(struct thread_data *td, unsigned int nr)
486 __io_u_mark_map(td->ts.io_u_complete, nr);
487 td->ts.total_complete++;
490 void io_u_mark_depth(struct thread_data *td, unsigned int nr)
494 switch (td->cur_depth) {
516 td->ts.io_u_map[index] += nr;
519 static void io_u_mark_lat_usec(struct thread_data *td, unsigned long usec)
556 assert(index < FIO_IO_U_LAT_U_NR);
557 td->ts.io_u_lat_u[index]++;
560 static void io_u_mark_lat_msec(struct thread_data *td, unsigned long msec)
601 assert(index < FIO_IO_U_LAT_M_NR);
602 td->ts.io_u_lat_m[index]++;
605 static void io_u_mark_latency(struct thread_data *td, unsigned long usec)
608 io_u_mark_lat_usec(td, usec);
610 io_u_mark_lat_msec(td, usec / 1000);
614 * Get next file to service by choosing one at random
616 static struct fio_file *get_next_file_rand(struct thread_data *td, int goodf,
623 long r = os_random_long(&td->next_file_state);
625 fno = (unsigned int) ((double) td->o.nr_files
626 * (r / (OS_RAND_MAX + 1.0)));
628 if (f->flags & FIO_FILE_DONE)
631 if ((!goodf || (f->flags & goodf)) && !(f->flags & badf)) {
632 dprint(FD_FILE, "get_next_file_rand: %p\n", f);
639 * Get next file to service by doing round robin between all available ones
641 static struct fio_file *get_next_file_rr(struct thread_data *td, int goodf,
644 unsigned int old_next_file = td->next_file;
648 f = td->files[td->next_file];
651 if (td->next_file >= td->o.nr_files)
654 if (f->flags & FIO_FILE_DONE) {
659 if ((!goodf || (f->flags & goodf)) && !(f->flags & badf))
663 } while (td->next_file != old_next_file);
665 dprint(FD_FILE, "get_next_file_rr: %p\n", f);
669 static struct fio_file *get_next_file(struct thread_data *td)
673 assert(td->o.nr_files <= td->files_index);
675 if (!td->nr_open_files || td->nr_done_files >= td->o.nr_files) {
676 dprint(FD_FILE, "get_next_file: nr_open=%d, nr_done=%d,"
677 " nr_files=%d\n", td->nr_open_files,
683 f = td->file_service_file;
684 if (f && (f->flags & FIO_FILE_OPEN) && td->file_service_left--)
687 if (td->o.file_service_type == FIO_FSERVICE_RR)
688 f = get_next_file_rr(td, FIO_FILE_OPEN, FIO_FILE_CLOSING);
690 f = get_next_file_rand(td, FIO_FILE_OPEN, FIO_FILE_CLOSING);
692 td->file_service_file = f;
693 td->file_service_left = td->file_service_nr - 1;
695 dprint(FD_FILE, "get_next_file: %p\n", f);
699 static struct fio_file *find_next_new_file(struct thread_data *td)
703 if (!td->nr_open_files || td->nr_done_files >= td->o.nr_files)
706 if (td->o.file_service_type == FIO_FSERVICE_RR)
707 f = get_next_file_rr(td, 0, FIO_FILE_OPEN);
709 f = get_next_file_rand(td, 0, FIO_FILE_OPEN);
714 static int set_io_u_file(struct thread_data *td, struct io_u *io_u)
719 f = get_next_file(td);
727 if (!fill_io_u(td, io_u))
731 * optimization to prevent close/open of the same file. This
732 * way we preserve queueing etc.
734 if (td->o.nr_files == 1 && td->o.time_based) {
741 * td_io_close() does a put_file() as well, so no need to
745 td_io_close_file(td, f);
746 f->flags |= FIO_FILE_DONE;
750 * probably not the right place to do this, but see
751 * if we need to open a new file
753 if (td->nr_open_files < td->o.open_files &&
754 td->o.open_files != td->o.nr_files) {
755 f = find_next_new_file(td);
757 if (!f || td_io_open_file(td, f))
768 struct io_u *__get_io_u(struct thread_data *td)
770 struct io_u *io_u = NULL;
772 if (!flist_empty(&td->io_u_requeues))
773 io_u = flist_entry(td->io_u_requeues.next, struct io_u, list);
774 else if (!queue_full(td)) {
775 io_u = flist_entry(td->io_u_freelist.next, struct io_u, list);
784 assert(io_u->flags & IO_U_F_FREE);
785 io_u->flags &= ~IO_U_F_FREE;
788 flist_del(&io_u->list);
789 flist_add(&io_u->list, &td->io_u_busylist);
797 * Return an io_u to be processed. Gets a buflen and offset, sets direction,
798 * etc. The returned io_u is fully ready to be prepped and submitted.
800 struct io_u *get_io_u(struct thread_data *td)
805 io_u = __get_io_u(td);
807 dprint(FD_IO, "__get_io_u failed\n");
812 * from a requeue, io_u already setup
818 * If using an iolog, grab next piece if any available.
820 if (td->o.read_iolog_file) {
821 if (read_iolog_get(td, io_u))
823 } else if (set_io_u_file(td, io_u)) {
824 dprint(FD_IO, "io_u %p, setting file failed\n", io_u);
829 assert(f->flags & FIO_FILE_OPEN);
831 if (io_u->ddir != DDIR_SYNC) {
832 if (!io_u->buflen && !(td->io_ops->flags & FIO_NOIO)) {
833 dprint(FD_IO, "get_io_u: zero buflen on %p\n", io_u);
837 f->last_pos = io_u->offset + io_u->buflen;
839 if (td->o.verify != VERIFY_NONE)
840 populate_verify_io_u(td, io_u);
841 else if (td->o.refill_buffers && io_u->ddir == DDIR_WRITE)
842 io_u_fill_buffer(td, io_u, io_u->xfer_buflen);
846 * Set io data pointers.
848 io_u->endpos = io_u->offset + io_u->buflen;
849 io_u->xfer_buf = io_u->buf;
850 io_u->xfer_buflen = io_u->buflen;
853 if (!td_io_prep(td, io_u)) {
854 if (!td->o.disable_slat)
855 fio_gettime(&io_u->start_time, NULL);
859 dprint(FD_IO, "get_io_u failed\n");
864 void io_u_log_error(struct thread_data *td, struct io_u *io_u)
866 const char *msg[] = { "read", "write", "sync" };
868 log_err("fio: io_u error");
871 log_err(" on file %s", io_u->file->file_name);
873 log_err(": %s\n", strerror(io_u->error));
875 log_err(" %s offset=%llu, buflen=%lu\n", msg[io_u->ddir],
876 io_u->offset, io_u->xfer_buflen);
879 td_verror(td, io_u->error, "io_u error");
882 static void io_completed(struct thread_data *td, struct io_u *io_u,
883 struct io_completion_data *icd)
886 * Older gcc's are too dumb to realize that usec is always used
887 * initialized, silence that warning.
889 unsigned long uninitialized_var(usec);
891 dprint_io_u(io_u, "io complete");
893 assert(io_u->flags & IO_U_F_FLIGHT);
894 io_u->flags &= ~IO_U_F_FLIGHT;
896 if (io_u->ddir == DDIR_SYNC) {
897 td->last_was_sync = 1;
901 td->last_was_sync = 0;
904 unsigned int bytes = io_u->buflen - io_u->resid;
905 const enum fio_ddir idx = io_u->ddir;
908 td->io_blocks[idx]++;
909 td->io_bytes[idx] += bytes;
910 td->this_io_bytes[idx] += bytes;
912 if (ramp_time_over(td)) {
913 if (!td->o.disable_clat || !td->o.disable_bw)
914 usec = utime_since(&io_u->issue_time,
917 if (!td->o.disable_clat) {
918 add_clat_sample(td, idx, usec);
919 io_u_mark_latency(td, usec);
921 if (!td->o.disable_bw)
922 add_bw_sample(td, idx, &icd->time);
925 if (td_write(td) && idx == DDIR_WRITE &&
927 td->o.verify != VERIFY_NONE)
928 log_io_piece(td, io_u);
930 icd->bytes_done[idx] += bytes;
933 ret = io_u->end_io(td, io_u);
934 if (ret && !icd->error)
938 icd->error = io_u->error;
939 io_u_log_error(td, io_u);
943 static void init_icd(struct thread_data *td, struct io_completion_data *icd,
946 if (!td->o.disable_clat || !td->o.disable_bw)
947 fio_gettime(&icd->time, NULL);
952 icd->bytes_done[0] = icd->bytes_done[1] = 0;
955 static void ios_completed(struct thread_data *td,
956 struct io_completion_data *icd)
961 for (i = 0; i < icd->nr; i++) {
962 io_u = td->io_ops->event(td, i);
964 io_completed(td, io_u, icd);
970 * Complete a single io_u for the sync engines.
972 long io_u_sync_complete(struct thread_data *td, struct io_u *io_u)
974 struct io_completion_data icd;
976 init_icd(td, &icd, 1);
977 io_completed(td, io_u, &icd);
981 return icd.bytes_done[0] + icd.bytes_done[1];
983 td_verror(td, icd.error, "io_u_sync_complete");
988 * Called to complete min_events number of io for the async engines.
990 long io_u_queued_complete(struct thread_data *td, int min_evts)
992 struct io_completion_data icd;
993 struct timespec *tvp = NULL;
995 struct timespec ts = { .tv_sec = 0, .tv_nsec = 0, };
997 dprint(FD_IO, "io_u_queued_completed: min=%d\n", min_evts);
1002 ret = td_io_getevents(td, min_evts, td->o.iodepth_batch_complete, tvp);
1004 td_verror(td, -ret, "td_io_getevents");
1009 init_icd(td, &icd, ret);
1010 ios_completed(td, &icd);
1012 return icd.bytes_done[0] + icd.bytes_done[1];
1014 td_verror(td, icd.error, "io_u_queued_complete");
1019 * Call when io_u is really queued, to update the submission latency.
1021 void io_u_queued(struct thread_data *td, struct io_u *io_u)
1023 if (!td->o.disable_slat) {
1024 unsigned long slat_time;
1026 slat_time = utime_since(&io_u->start_time, &io_u->issue_time);
1027 add_slat_sample(td, io_u->ddir, slat_time);
1032 * "randomly" fill the buffer contents
1034 void io_u_fill_buffer(struct thread_data *td, struct io_u *io_u,
1035 unsigned int max_bs)
1037 long *ptr = io_u->buf;
1039 if (!td->o.zero_buffers) {
1040 while ((void *) ptr - io_u->buf < max_bs) {
1041 *ptr = rand() * GOLDEN_RATIO_PRIME;
1045 memset(ptr, 0, max_bs);