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)) {
63 idx = RAND_MAP_IDX(f, block);
64 bit = RAND_MAP_BIT(f, block);
66 fio_assert(td, idx < f->num_maps);
68 this_blocks = nr_blocks;
69 if (this_blocks + bit > BLOCKS_PER_MAP)
70 this_blocks = BLOCKS_PER_MAP - bit;
72 if (this_blocks == BLOCKS_PER_MAP)
75 mask = ((1U << this_blocks) - 1) << bit;
77 f->file_map[idx] |= mask;
78 nr_blocks -= this_blocks;
79 blocks += this_blocks;
83 if ((blocks * min_bs) < io_u->buflen)
84 io_u->buflen = blocks * min_bs;
87 static unsigned long long last_block(struct thread_data *td, struct fio_file *f,
90 unsigned long long max_blocks;
91 unsigned long long max_size;
94 * Hmm, should we make sure that ->io_size <= ->real_file_size?
96 max_size = f->io_size;
97 if (max_size > f->real_file_size)
98 max_size = f->real_file_size;
100 max_blocks = max_size / (unsigned long long) td->o.ba[ddir];
108 * Return the next free block in the map.
110 static int get_next_free_block(struct thread_data *td, struct fio_file *f,
111 enum fio_ddir ddir, unsigned long long *b)
113 unsigned long long min_bs = td->o.rw_min_bs;
116 i = f->last_free_lookup;
117 *b = (i * BLOCKS_PER_MAP);
118 while ((*b) * min_bs < f->real_file_size &&
119 (*b) * min_bs < f->io_size) {
120 if (f->file_map[i] != (unsigned int) -1) {
121 *b += ffz(f->file_map[i]);
122 if (*b > last_block(td, f, ddir))
124 f->last_free_lookup = i;
128 *b += BLOCKS_PER_MAP;
132 dprint(FD_IO, "failed finding a free block\n");
136 static int get_next_rand_offset(struct thread_data *td, struct fio_file *f,
137 enum fio_ddir ddir, unsigned long long *b)
139 unsigned long long r;
143 r = os_random_long(&td->random_state);
144 dprint(FD_RANDOM, "off rand %llu\n", r);
145 *b = (last_block(td, f, ddir) - 1)
146 * (r / ((unsigned long long) OS_RAND_MAX + 1.0));
149 * if we are not maintaining a random map, we are done.
151 if (!file_randommap(td, f))
155 * calculate map offset and check if it's free
157 if (random_map_free(f, *b))
160 dprint(FD_RANDOM, "get_next_rand_offset: offset %llu busy\n",
165 * we get here, if we didn't suceed in looking up a block. generate
166 * a random start offset into the filemap, and find the first free
171 f->last_free_lookup = (f->num_maps - 1) *
172 (r / (OS_RAND_MAX + 1.0));
173 if (!get_next_free_block(td, f, ddir, b))
176 r = os_random_long(&td->random_state);
180 * that didn't work either, try exhaustive search from the start
182 f->last_free_lookup = 0;
183 return get_next_free_block(td, f, ddir, b);
187 * For random io, generate a random new block and see if it's used. Repeat
188 * until we find a free one. For sequential io, just return the end of
189 * the last io issued.
191 static int __get_next_offset(struct thread_data *td, struct io_u *io_u)
193 struct fio_file *f = io_u->file;
194 unsigned long long b;
195 enum fio_ddir ddir = io_u->ddir;
197 if (td_random(td) && (td->o.ddir_nr && !--td->ddir_nr)) {
198 td->ddir_nr = td->o.ddir_nr;
200 if (get_next_rand_offset(td, f, ddir, &b)) {
201 dprint(FD_IO, "%s: getting rand offset failed\n",
206 if (f->last_pos >= f->real_file_size) {
207 if (!td_random(td) ||
208 get_next_rand_offset(td, f, ddir, &b)) {
209 dprint(FD_IO, "%s: pos %llu > size %llu\n",
210 f->file_name, f->last_pos,
215 b = (f->last_pos - f->file_offset) / td->o.min_bs[ddir];
218 io_u->offset = b * td->o.ba[ddir];
219 if (io_u->offset >= f->io_size) {
220 dprint(FD_IO, "get_next_offset: offset %llu >= io_size %llu\n",
221 io_u->offset, f->io_size);
225 io_u->offset += f->file_offset;
226 if (io_u->offset >= f->real_file_size) {
227 dprint(FD_IO, "get_next_offset: offset %llu >= size %llu\n",
228 io_u->offset, f->real_file_size);
235 static int get_next_offset(struct thread_data *td, struct io_u *io_u)
237 struct prof_io_ops *ops = &td->prof_io_ops;
239 if (ops->fill_io_u_off)
240 return ops->fill_io_u_off(td, io_u);
242 return __get_next_offset(td, io_u);
245 static unsigned int __get_next_buflen(struct thread_data *td, struct io_u *io_u)
247 const int ddir = io_u->ddir;
248 unsigned int uninitialized_var(buflen);
249 unsigned int minbs, maxbs;
252 minbs = td->o.min_bs[ddir];
253 maxbs = td->o.max_bs[ddir];
258 r = os_random_long(&td->bsrange_state);
259 if (!td->o.bssplit_nr[ddir]) {
260 buflen = 1 + (unsigned int) ((double) maxbs *
261 (r / (OS_RAND_MAX + 1.0)));
268 for (i = 0; i < td->o.bssplit_nr[ddir]; i++) {
269 struct bssplit *bsp = &td->o.bssplit[ddir][i];
273 if (r <= ((OS_RAND_MAX / 100L) * perc))
277 if (!td->o.bs_unaligned && is_power_of_2(minbs))
278 buflen = (buflen + minbs - 1) & ~(minbs - 1);
281 if (io_u->offset + buflen > io_u->file->real_file_size) {
282 dprint(FD_IO, "lower buflen %u -> %u (ddir=%d)\n", buflen,
290 static unsigned int get_next_buflen(struct thread_data *td, struct io_u *io_u)
292 struct prof_io_ops *ops = &td->prof_io_ops;
294 if (ops->fill_io_u_size)
295 return ops->fill_io_u_size(td, io_u);
297 return __get_next_buflen(td, io_u);
300 static void set_rwmix_bytes(struct thread_data *td)
305 * we do time or byte based switch. this is needed because
306 * buffered writes may issue a lot quicker than they complete,
307 * whereas reads do not.
309 diff = td->o.rwmix[td->rwmix_ddir ^ 1];
310 td->rwmix_issues = (td->io_issues[td->rwmix_ddir] * diff) / 100;
313 static inline enum fio_ddir get_rand_ddir(struct thread_data *td)
318 r = os_random_long(&td->rwmix_state);
319 v = 1 + (int) (100.0 * (r / (OS_RAND_MAX + 1.0)));
320 if (v <= td->o.rwmix[DDIR_READ])
326 static enum fio_ddir rate_ddir(struct thread_data *td, enum fio_ddir ddir)
328 enum fio_ddir odir = ddir ^ 1;
332 if (td->rate_pending_usleep[ddir] <= 0)
336 * We have too much pending sleep in this direction. See if we
341 * Other direction does not have too much pending, switch
343 if (td->rate_pending_usleep[odir] < 100000)
347 * Both directions have pending sleep. Sleep the minimum time
348 * and deduct from both.
350 if (td->rate_pending_usleep[ddir] <=
351 td->rate_pending_usleep[odir]) {
352 usec = td->rate_pending_usleep[ddir];
354 usec = td->rate_pending_usleep[odir];
358 usec = td->rate_pending_usleep[ddir];
360 fio_gettime(&t, NULL);
361 usec_sleep(td, usec);
362 usec = utime_since_now(&t);
364 td->rate_pending_usleep[ddir] -= usec;
367 if (td_rw(td) && __should_check_rate(td, odir))
368 td->rate_pending_usleep[odir] -= usec;
374 * Return the data direction for the next io_u. If the job is a
375 * mixed read/write workload, check the rwmix cycle and switch if
378 static enum fio_ddir get_rw_ddir(struct thread_data *td)
383 * see if it's time to fsync
385 if (td->o.fsync_blocks &&
386 !(td->io_issues[DDIR_WRITE] % td->o.fsync_blocks) &&
387 td->io_issues[DDIR_WRITE] && should_fsync(td))
391 * see if it's time to fdatasync
393 if (td->o.fdatasync_blocks &&
394 !(td->io_issues[DDIR_WRITE] % td->o.fdatasync_blocks) &&
395 td->io_issues[DDIR_WRITE] && should_fsync(td))
396 return DDIR_DATASYNC;
399 * see if it's time to sync_file_range
401 if (td->sync_file_range_nr &&
402 !(td->io_issues[DDIR_WRITE] % td->sync_file_range_nr) &&
403 td->io_issues[DDIR_WRITE] && should_fsync(td))
404 return DDIR_SYNC_FILE_RANGE;
408 * Check if it's time to seed a new data direction.
410 if (td->io_issues[td->rwmix_ddir] >= td->rwmix_issues) {
412 * Put a top limit on how many bytes we do for
413 * one data direction, to avoid overflowing the
416 ddir = get_rand_ddir(td);
418 if (ddir != td->rwmix_ddir)
421 td->rwmix_ddir = ddir;
423 ddir = td->rwmix_ddir;
424 } else if (td_read(td))
429 td->rwmix_ddir = rate_ddir(td, ddir);
430 return td->rwmix_ddir;
433 void put_file_log(struct thread_data *td, struct fio_file *f)
435 int ret = put_file(td, f);
438 td_verror(td, ret, "file close");
441 void put_io_u(struct thread_data *td, struct io_u *io_u)
445 io_u->flags |= IO_U_F_FREE;
446 io_u->flags &= ~IO_U_F_FREE_DEF;
449 put_file_log(td, io_u->file);
452 if (io_u->flags & IO_U_F_IN_CUR_DEPTH)
454 flist_del_init(&io_u->list);
455 flist_add(&io_u->list, &td->io_u_freelist);
457 td_io_u_free_notify(td);
460 void clear_io_u(struct thread_data *td, struct io_u *io_u)
462 io_u->flags &= ~IO_U_F_FLIGHT;
466 void requeue_io_u(struct thread_data *td, struct io_u **io_u)
468 struct io_u *__io_u = *io_u;
470 dprint(FD_IO, "requeue %p\n", __io_u);
474 __io_u->flags |= IO_U_F_FREE;
475 if ((__io_u->flags & IO_U_F_FLIGHT) && !ddir_sync(__io_u->ddir))
476 td->io_issues[__io_u->ddir]--;
478 __io_u->flags &= ~IO_U_F_FLIGHT;
479 if (__io_u->flags & IO_U_F_IN_CUR_DEPTH)
481 flist_del(&__io_u->list);
482 flist_add_tail(&__io_u->list, &td->io_u_requeues);
487 static int fill_io_u(struct thread_data *td, struct io_u *io_u)
489 if (td->io_ops->flags & FIO_NOIO)
492 io_u->ddir = get_rw_ddir(td);
495 * fsync() or fdatasync(), we are done
497 if (ddir_sync(io_u->ddir))
501 * See if it's time to switch to a new zone
503 if (td->zone_bytes >= td->o.zone_size) {
505 io_u->file->last_pos += td->o.zone_skip;
506 td->io_skip_bytes += td->o.zone_skip;
510 * No log, let the seq/rand engine retrieve the next buflen and
513 if (get_next_offset(td, io_u)) {
514 dprint(FD_IO, "io_u %p, failed getting offset\n", io_u);
518 io_u->buflen = get_next_buflen(td, io_u);
520 dprint(FD_IO, "io_u %p, failed getting buflen\n", io_u);
524 if (io_u->offset + io_u->buflen > io_u->file->real_file_size) {
525 dprint(FD_IO, "io_u %p, offset too large\n", io_u);
526 dprint(FD_IO, " off=%llu/%lu > %llu\n", io_u->offset,
527 io_u->buflen, io_u->file->real_file_size);
532 * mark entry before potentially trimming io_u
534 if (td_random(td) && file_randommap(td, io_u->file))
535 mark_random_map(td, io_u);
538 * If using a write iolog, store this entry.
541 dprint_io_u(io_u, "fill_io_u");
542 td->zone_bytes += io_u->buflen;
547 static void __io_u_mark_map(unsigned int *map, unsigned int nr)
576 void io_u_mark_submit(struct thread_data *td, unsigned int nr)
578 __io_u_mark_map(td->ts.io_u_submit, nr);
579 td->ts.total_submit++;
582 void io_u_mark_complete(struct thread_data *td, unsigned int nr)
584 __io_u_mark_map(td->ts.io_u_complete, nr);
585 td->ts.total_complete++;
588 void io_u_mark_depth(struct thread_data *td, unsigned int nr)
592 switch (td->cur_depth) {
614 td->ts.io_u_map[index] += nr;
617 static void io_u_mark_lat_usec(struct thread_data *td, unsigned long usec)
654 assert(index < FIO_IO_U_LAT_U_NR);
655 td->ts.io_u_lat_u[index]++;
658 static void io_u_mark_lat_msec(struct thread_data *td, unsigned long msec)
699 assert(index < FIO_IO_U_LAT_M_NR);
700 td->ts.io_u_lat_m[index]++;
703 static void io_u_mark_latency(struct thread_data *td, unsigned long usec)
706 io_u_mark_lat_usec(td, usec);
708 io_u_mark_lat_msec(td, usec / 1000);
712 * Get next file to service by choosing one at random
714 static struct fio_file *get_next_file_rand(struct thread_data *td,
715 enum fio_file_flags goodf,
716 enum fio_file_flags badf)
722 long r = os_random_long(&td->next_file_state);
725 fno = (unsigned int) ((double) td->o.nr_files
726 * (r / (OS_RAND_MAX + 1.0)));
728 if (fio_file_done(f))
731 if (!fio_file_open(f)) {
734 err = td_io_open_file(td, f);
740 if ((!goodf || (f->flags & goodf)) && !(f->flags & badf)) {
741 dprint(FD_FILE, "get_next_file_rand: %p\n", f);
745 td_io_close_file(td, f);
750 * Get next file to service by doing round robin between all available ones
752 static struct fio_file *get_next_file_rr(struct thread_data *td, int goodf,
755 unsigned int old_next_file = td->next_file;
761 f = td->files[td->next_file];
764 if (td->next_file >= td->o.nr_files)
767 dprint(FD_FILE, "trying file %s %x\n", f->file_name, f->flags);
768 if (fio_file_done(f)) {
773 if (!fio_file_open(f)) {
776 err = td_io_open_file(td, f);
778 dprint(FD_FILE, "error %d on open of %s\n",
786 dprint(FD_FILE, "goodf=%x, badf=%x, ff=%x\n", goodf, badf,
788 if ((!goodf || (f->flags & goodf)) && !(f->flags & badf))
792 td_io_close_file(td, f);
795 } while (td->next_file != old_next_file);
797 dprint(FD_FILE, "get_next_file_rr: %p\n", f);
801 static struct fio_file *__get_next_file(struct thread_data *td)
805 assert(td->o.nr_files <= td->files_index);
807 if (td->nr_done_files >= td->o.nr_files) {
808 dprint(FD_FILE, "get_next_file: nr_open=%d, nr_done=%d,"
809 " nr_files=%d\n", td->nr_open_files,
815 f = td->file_service_file;
816 if (f && fio_file_open(f) && !fio_file_closing(f)) {
817 if (td->o.file_service_type == FIO_FSERVICE_SEQ)
819 if (td->file_service_left--)
823 if (td->o.file_service_type == FIO_FSERVICE_RR ||
824 td->o.file_service_type == FIO_FSERVICE_SEQ)
825 f = get_next_file_rr(td, FIO_FILE_open, FIO_FILE_closing);
827 f = get_next_file_rand(td, FIO_FILE_open, FIO_FILE_closing);
829 td->file_service_file = f;
830 td->file_service_left = td->file_service_nr - 1;
832 dprint(FD_FILE, "get_next_file: %p [%s]\n", f, f->file_name);
836 static struct fio_file *get_next_file(struct thread_data *td)
838 struct prof_io_ops *ops = &td->prof_io_ops;
840 if (ops->get_next_file)
841 return ops->get_next_file(td);
843 return __get_next_file(td);
846 static int set_io_u_file(struct thread_data *td, struct io_u *io_u)
851 f = get_next_file(td);
858 if (!fill_io_u(td, io_u))
862 td_io_close_file(td, f);
864 fio_file_set_done(f);
866 dprint(FD_FILE, "%s: is done (%d of %d)\n", f->file_name,
867 td->nr_done_files, td->o.nr_files);
874 struct io_u *__get_io_u(struct thread_data *td)
876 struct io_u *io_u = NULL;
881 if (!flist_empty(&td->io_u_requeues))
882 io_u = flist_entry(td->io_u_requeues.next, struct io_u, list);
883 else if (!queue_full(td)) {
884 io_u = flist_entry(td->io_u_freelist.next, struct io_u, list);
893 assert(io_u->flags & IO_U_F_FREE);
894 io_u->flags &= ~(IO_U_F_FREE | IO_U_F_FREE_DEF);
897 flist_del(&io_u->list);
898 flist_add(&io_u->list, &td->io_u_busylist);
900 io_u->flags |= IO_U_F_IN_CUR_DEPTH;
901 } else if (td->o.verify_async) {
903 * We ran out, wait for async verify threads to finish and
906 pthread_cond_wait(&td->free_cond, &td->io_u_lock);
915 * Return an io_u to be processed. Gets a buflen and offset, sets direction,
916 * etc. The returned io_u is fully ready to be prepped and submitted.
918 struct io_u *get_io_u(struct thread_data *td)
923 io_u = __get_io_u(td);
925 dprint(FD_IO, "__get_io_u failed\n");
930 * from a requeue, io_u already setup
936 * If using an iolog, grab next piece if any available.
938 if (td->o.read_iolog_file) {
939 if (read_iolog_get(td, io_u))
941 } else if (set_io_u_file(td, io_u)) {
942 dprint(FD_IO, "io_u %p, setting file failed\n", io_u);
947 assert(fio_file_open(f));
949 if (!ddir_sync(io_u->ddir)) {
950 if (!io_u->buflen && !(td->io_ops->flags & FIO_NOIO)) {
951 dprint(FD_IO, "get_io_u: zero buflen on %p\n", io_u);
955 f->last_pos = io_u->offset + io_u->buflen;
957 if (td->o.verify != VERIFY_NONE && io_u->ddir == DDIR_WRITE)
958 populate_verify_io_u(td, io_u);
959 else if (td->o.refill_buffers && io_u->ddir == DDIR_WRITE)
960 io_u_fill_buffer(td, io_u, io_u->xfer_buflen);
964 * Set io data pointers.
966 io_u->xfer_buf = io_u->buf;
967 io_u->xfer_buflen = io_u->buflen;
970 if (!td_io_prep(td, io_u)) {
971 if (!td->o.disable_slat)
972 fio_gettime(&io_u->start_time, NULL);
976 dprint(FD_IO, "get_io_u failed\n");
981 void io_u_log_error(struct thread_data *td, struct io_u *io_u)
983 const char *msg[] = { "read", "write", "sync" };
985 log_err("fio: io_u error");
988 log_err(" on file %s", io_u->file->file_name);
990 log_err(": %s\n", strerror(io_u->error));
992 log_err(" %s offset=%llu, buflen=%lu\n", msg[io_u->ddir],
993 io_u->offset, io_u->xfer_buflen);
996 td_verror(td, io_u->error, "io_u error");
999 static void io_completed(struct thread_data *td, struct io_u *io_u,
1000 struct io_completion_data *icd)
1003 * Older gcc's are too dumb to realize that usec is always used
1004 * initialized, silence that warning.
1006 unsigned long uninitialized_var(usec);
1009 dprint_io_u(io_u, "io complete");
1012 assert(io_u->flags & IO_U_F_FLIGHT);
1013 io_u->flags &= ~IO_U_F_FLIGHT;
1016 if (ddir_sync(io_u->ddir)) {
1017 td->last_was_sync = 1;
1020 f->first_write = -1ULL;
1021 f->last_write = -1ULL;
1026 td->last_was_sync = 0;
1029 unsigned int bytes = io_u->buflen - io_u->resid;
1030 const enum fio_ddir idx = io_u->ddir;
1031 const enum fio_ddir odx = io_u->ddir ^ 1;
1034 td->io_blocks[idx]++;
1035 td->io_bytes[idx] += bytes;
1036 td->this_io_bytes[idx] += bytes;
1038 if (idx == DDIR_WRITE) {
1041 if (f->first_write == -1ULL ||
1042 io_u->offset < f->first_write)
1043 f->first_write = io_u->offset;
1044 if (f->last_write == -1ULL ||
1045 ((io_u->offset + bytes) > f->last_write))
1046 f->last_write = io_u->offset + bytes;
1050 if (ramp_time_over(td)) {
1051 unsigned long uninitialized_var(lusec);
1053 if (!td->o.disable_clat || !td->o.disable_bw)
1054 lusec = utime_since(&io_u->issue_time,
1057 if (!td->o.disable_clat) {
1058 add_clat_sample(td, idx, lusec, bytes);
1059 io_u_mark_latency(td, lusec);
1061 if (!td->o.disable_bw)
1062 add_bw_sample(td, idx, bytes, &icd->time);
1063 if (__should_check_rate(td, idx)) {
1064 td->rate_pending_usleep[idx] =
1065 ((td->this_io_bytes[idx] *
1066 td->rate_nsec_cycle[idx]) / 1000 -
1067 utime_since_now(&td->start));
1069 if (__should_check_rate(td, idx ^ 1))
1070 td->rate_pending_usleep[odx] =
1071 ((td->this_io_bytes[odx] *
1072 td->rate_nsec_cycle[odx]) / 1000 -
1073 utime_since_now(&td->start));
1076 if (td_write(td) && idx == DDIR_WRITE &&
1078 td->o.verify != VERIFY_NONE)
1079 log_io_piece(td, io_u);
1081 icd->bytes_done[idx] += bytes;
1084 ret = io_u->end_io(td, io_u);
1085 if (ret && !icd->error)
1089 icd->error = io_u->error;
1090 io_u_log_error(td, io_u);
1092 if (td->o.continue_on_error && icd->error &&
1093 td_non_fatal_error(icd->error)) {
1095 * If there is a non_fatal error, then add to the error count
1096 * and clear all the errors.
1098 update_error_count(td, icd->error);
1105 static void init_icd(struct thread_data *td, struct io_completion_data *icd,
1108 if (!td->o.disable_clat || !td->o.disable_bw)
1109 fio_gettime(&icd->time, NULL);
1114 icd->bytes_done[0] = icd->bytes_done[1] = 0;
1117 static void ios_completed(struct thread_data *td,
1118 struct io_completion_data *icd)
1123 for (i = 0; i < icd->nr; i++) {
1124 io_u = td->io_ops->event(td, i);
1126 io_completed(td, io_u, icd);
1128 if (!(io_u->flags & IO_U_F_FREE_DEF))
1134 * Complete a single io_u for the sync engines.
1136 int io_u_sync_complete(struct thread_data *td, struct io_u *io_u,
1137 unsigned long *bytes)
1139 struct io_completion_data icd;
1141 init_icd(td, &icd, 1);
1142 io_completed(td, io_u, &icd);
1144 if (!(io_u->flags & IO_U_F_FREE_DEF))
1148 td_verror(td, icd.error, "io_u_sync_complete");
1153 bytes[0] += icd.bytes_done[0];
1154 bytes[1] += icd.bytes_done[1];
1161 * Called to complete min_events number of io for the async engines.
1163 int io_u_queued_complete(struct thread_data *td, int min_evts,
1164 unsigned long *bytes)
1166 struct io_completion_data icd;
1167 struct timespec *tvp = NULL;
1169 struct timespec ts = { .tv_sec = 0, .tv_nsec = 0, };
1171 dprint(FD_IO, "io_u_queued_completed: min=%d\n", min_evts);
1176 ret = td_io_getevents(td, min_evts, td->o.iodepth_batch_complete, tvp);
1178 td_verror(td, -ret, "td_io_getevents");
1183 init_icd(td, &icd, ret);
1184 ios_completed(td, &icd);
1186 td_verror(td, icd.error, "io_u_queued_complete");
1191 bytes[0] += icd.bytes_done[0];
1192 bytes[1] += icd.bytes_done[1];
1199 * Call when io_u is really queued, to update the submission latency.
1201 void io_u_queued(struct thread_data *td, struct io_u *io_u)
1203 if (!td->o.disable_slat) {
1204 unsigned long slat_time;
1206 slat_time = utime_since(&io_u->start_time, &io_u->issue_time);
1207 add_slat_sample(td, io_u->ddir, slat_time, io_u->xfer_buflen);
1212 * "randomly" fill the buffer contents
1214 void io_u_fill_buffer(struct thread_data *td, struct io_u *io_u,
1215 unsigned int max_bs)
1217 long *ptr = io_u->buf;
1219 if (!td->o.zero_buffers) {
1220 unsigned long r = __rand(&__fio_rand_state);
1222 if (sizeof(int) != sizeof(*ptr))
1223 r *= (unsigned long) __rand(&__fio_rand_state);
1225 while ((void *) ptr - io_u->buf < max_bs) {
1228 r *= GOLDEN_RATIO_PRIME;
1232 memset(ptr, 0, max_bs);