projects / fio.git / blame_incremental
? search:
summary | shortlog | log | commit | commitdiff | tree
blob | blame (non-incremental) | history | HEAD
log: add printf() attribute to log_*() functions
[fio.git] / io_u.c
... / ...
CommitLineData
1#include <unistd.h>
2#include <fcntl.h>
3#include <string.h>
4#include <signal.h>
5#include <time.h>
6#include <assert.h>
7
8#include "fio.h"
9#include "hash.h"
10#include "verify.h"
11#include "trim.h"
12#include "lib/rand.h"
13#include "lib/axmap.h"
14
15struct io_completion_data {
16 int nr; /* input */
17
18 int error; /* output */
19 uint64_t bytes_done[DDIR_RWDIR_CNT]; /* output */
20 struct timeval time; /* output */
21};
22
23/*
24 * The ->io_axmap 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.
26 */
27static int random_map_free(struct fio_file *f, const uint64_t block)
28{
29 return !axmap_isset(f->io_axmap, block);
30}
31
32/*
33 * Mark a given offset as used in the map.
34 */
35static void mark_random_map(struct thread_data *td, struct io_u *io_u)
36{
37 unsigned int min_bs = td->o.rw_min_bs;
38 struct fio_file *f = io_u->file;
39 unsigned int nr_blocks;
40 uint64_t block;
41
42 block = (io_u->offset - f->file_offset) / (uint64_t) min_bs;
43 nr_blocks = (io_u->buflen + min_bs - 1) / min_bs;
44
45 if (!(io_u->flags & IO_U_F_BUSY_OK))
46 nr_blocks = axmap_set_nr(f->io_axmap, block, nr_blocks);
47
48 if ((nr_blocks * min_bs) < io_u->buflen)
49 io_u->buflen = nr_blocks * min_bs;
50}
51
52static uint64_t last_block(struct thread_data *td, struct fio_file *f,
53 enum fio_ddir ddir)
54{
55 uint64_t max_blocks;
56 uint64_t max_size;
57
58 assert(ddir_rw(ddir));
59
60 /*
61 * Hmm, should we make sure that ->io_size <= ->real_file_size?
62 */
63 max_size = f->io_size;
64 if (max_size > f->real_file_size)
65 max_size = f->real_file_size;
66
67 if (td->o.zone_range)
68 max_size = td->o.zone_range;
69
70 max_blocks = max_size / (uint64_t) td->o.ba[ddir];
71 if (!max_blocks)
72 return 0;
73
74 return max_blocks;
75}
76
77struct rand_off {
78 struct flist_head list;
79 uint64_t off;
80};
81
82static int __get_next_rand_offset(struct thread_data *td, struct fio_file *f,
83 enum fio_ddir ddir, uint64_t *b)
84{
85 uint64_t r, lastb;
86
87 lastb = last_block(td, f, ddir);
88 if (!lastb)
89 return 1;
90
91 if (td->o.random_generator == FIO_RAND_GEN_TAUSWORTHE) {
92 uint64_t rmax;
93
94 rmax = td->o.use_os_rand ? OS_RAND_MAX : FRAND_MAX;
95
96 if (td->o.use_os_rand) {
97 rmax = OS_RAND_MAX;
98 r = os_random_long(&td->random_state);
99 } else {
100 rmax = FRAND_MAX;
101 r = __rand(&td->__random_state);
102 }
103
104 dprint(FD_RANDOM, "off rand %llu\n", (unsigned long long) r);
105
106 *b = (lastb - 1) * (r / ((uint64_t) rmax + 1.0));
107 } else {
108 uint64_t off = 0;
109
110 if (lfsr_next(&f->lfsr, &off, lastb))
111 return 1;
112
113 *b = off;
114 }
115
116 /*
117 * if we are not maintaining a random map, we are done.
118 */
119 if (!file_randommap(td, f))
120 goto ret;
121
122 /*
123 * calculate map offset and check if it's free
124 */
125 if (random_map_free(f, *b))
126 goto ret;
127
128 dprint(FD_RANDOM, "get_next_rand_offset: offset %llu busy\n",
129 (unsigned long long) *b);
130
131 *b = axmap_next_free(f->io_axmap, *b);
132 if (*b == (uint64_t) -1ULL)
133 return 1;
134ret:
135 return 0;
136}
137
138static int __get_next_rand_offset_zipf(struct thread_data *td,
139 struct fio_file *f, enum fio_ddir ddir,
140 uint64_t *b)
141{
142 *b = zipf_next(&f->zipf);
143 return 0;
144}
145
146static int __get_next_rand_offset_pareto(struct thread_data *td,
147 struct fio_file *f, enum fio_ddir ddir,
148 uint64_t *b)
149{
150 *b = pareto_next(&f->zipf);
151 return 0;
152}
153
154static int flist_cmp(void *data, struct flist_head *a, struct flist_head *b)
155{
156 struct rand_off *r1 = flist_entry(a, struct rand_off, list);
157 struct rand_off *r2 = flist_entry(b, struct rand_off, list);
158
159 return r1->off - r2->off;
160}
161
162static int get_off_from_method(struct thread_data *td, struct fio_file *f,
163 enum fio_ddir ddir, uint64_t *b)
164{
165 if (td->o.random_distribution == FIO_RAND_DIST_RANDOM)
166 return __get_next_rand_offset(td, f, ddir, b);
167 else if (td->o.random_distribution == FIO_RAND_DIST_ZIPF)
168 return __get_next_rand_offset_zipf(td, f, ddir, b);
169 else if (td->o.random_distribution == FIO_RAND_DIST_PARETO)
170 return __get_next_rand_offset_pareto(td, f, ddir, b);
171
172 log_err("fio: unknown random distribution: %d\n", td->o.random_distribution);
173 return 1;
174}
175
176/*
177 * Sort the reads for a verify phase in batches of verifysort_nr, if
178 * specified.
179 */
180static inline int should_sort_io(struct thread_data *td)
181{
182 if (!td->o.verifysort_nr || !td->o.do_verify)
183 return 0;
184 if (!td_random(td))
185 return 0;
186 if (td->runstate != TD_VERIFYING)
187 return 0;
188 if (td->o.random_generator == FIO_RAND_GEN_TAUSWORTHE)
189 return 0;
190
191 return 1;
192}
193
194static int get_next_rand_offset(struct thread_data *td, struct fio_file *f,
195 enum fio_ddir ddir, uint64_t *b)
196{
197 struct rand_off *r;
198 int i, ret = 1;
199
200 if (!should_sort_io(td))
201 return get_off_from_method(td, f, ddir, b);
202
203 if (!flist_empty(&td->next_rand_list)) {
204 struct rand_off *r;
205fetch:
206 r = flist_entry(td->next_rand_list.next, struct rand_off, list);
207 flist_del(&r->list);
208 *b = r->off;
209 free(r);
210 return 0;
211 }
212
213 for (i = 0; i < td->o.verifysort_nr; i++) {
214 r = malloc(sizeof(*r));
215
216 ret = get_off_from_method(td, f, ddir, &r->off);
217 if (ret) {
218 free(r);
219 break;
220 }
221
222 flist_add(&r->list, &td->next_rand_list);
223 }
224
225 if (ret && !i)
226 return ret;
227
228 assert(!flist_empty(&td->next_rand_list));
229 flist_sort(NULL, &td->next_rand_list, flist_cmp);
230 goto fetch;
231}
232
233static int get_next_rand_block(struct thread_data *td, struct fio_file *f,
234 enum fio_ddir ddir, uint64_t *b)
235{
236 if (!get_next_rand_offset(td, f, ddir, b))
237 return 0;
238
239 if (td->o.time_based) {
240 fio_file_reset(td, f);
241 if (!get_next_rand_offset(td, f, ddir, b))
242 return 0;
243 }
244
245 dprint(FD_IO, "%s: rand offset failed, last=%llu, size=%llu\n",
246 f->file_name, (unsigned long long) f->last_pos,
247 (unsigned long long) f->real_file_size);
248 return 1;
249}
250
251static int get_next_seq_offset(struct thread_data *td, struct fio_file *f,
252 enum fio_ddir ddir, uint64_t *offset)
253{
254 assert(ddir_rw(ddir));
255
256 if (f->last_pos >= f->io_size + get_start_offset(td) && td->o.time_based)
257 f->last_pos = f->last_pos - f->io_size;
258
259 if (f->last_pos < f->real_file_size) {
260 uint64_t pos;
261
262 if (f->last_pos == f->file_offset && td->o.ddir_seq_add < 0)
263 f->last_pos = f->real_file_size;
264
265 pos = f->last_pos - f->file_offset;
266 if (pos)
267 pos += td->o.ddir_seq_add;
268
269 *offset = pos;
270 return 0;
271 }
272
273 return 1;
274}
275
276static int get_next_block(struct thread_data *td, struct io_u *io_u,
277 enum fio_ddir ddir, int rw_seq)
278{
279 struct fio_file *f = io_u->file;
280 uint64_t b, offset;
281 int ret;
282
283 assert(ddir_rw(ddir));
284
285 b = offset = -1ULL;
286
287 if (rw_seq) {
288 if (td_random(td))
289 ret = get_next_rand_block(td, f, ddir, &b);
290 else
291 ret = get_next_seq_offset(td, f, ddir, &offset);
292 } else {
293 io_u->flags |= IO_U_F_BUSY_OK;
294
295 if (td->o.rw_seq == RW_SEQ_SEQ) {
296 ret = get_next_seq_offset(td, f, ddir, &offset);
297 if (ret)
298 ret = get_next_rand_block(td, f, ddir, &b);
299 } else if (td->o.rw_seq == RW_SEQ_IDENT) {
300 if (f->last_start != -1ULL)
301 offset = f->last_start - f->file_offset;
302 else
303 offset = 0;
304 ret = 0;
305 } else {
306 log_err("fio: unknown rw_seq=%d\n", td->o.rw_seq);
307 ret = 1;
308 }
309 }
310
311 if (!ret) {
312 if (offset != -1ULL)
313 io_u->offset = offset;
314 else if (b != -1ULL)
315 io_u->offset = b * td->o.ba[ddir];
316 else {
317 log_err("fio: bug in offset generation: offset=%llu, b=%llu\n",
318 offset, b);
319 ret = 1;
320 }
321 }
322
323 return ret;
324}
325
326/*
327 * For random io, generate a random new block and see if it's used. Repeat
328 * until we find a free one. For sequential io, just return the end of
329 * the last io issued.
330 */
331static int __get_next_offset(struct thread_data *td, struct io_u *io_u)
332{
333 struct fio_file *f = io_u->file;
334 enum fio_ddir ddir = io_u->ddir;
335 int rw_seq_hit = 0;
336
337 assert(ddir_rw(ddir));
338
339 if (td->o.ddir_seq_nr && !--td->ddir_seq_nr) {
340 rw_seq_hit = 1;
341 td->ddir_seq_nr = td->o.ddir_seq_nr;
342 }
343
344 if (get_next_block(td, io_u, ddir, rw_seq_hit))
345 return 1;
346
347 if (io_u->offset >= f->io_size) {
348 dprint(FD_IO, "get_next_offset: offset %llu >= io_size %llu\n",
349 (unsigned long long) io_u->offset,
350 (unsigned long long) f->io_size);
351 return 1;
352 }
353
354 io_u->offset += f->file_offset;
355 if (io_u->offset >= f->real_file_size) {
356 dprint(FD_IO, "get_next_offset: offset %llu >= size %llu\n",
357 (unsigned long long) io_u->offset,
358 (unsigned long long) f->real_file_size);
359 return 1;
360 }
361
362 return 0;
363}
364
365static int get_next_offset(struct thread_data *td, struct io_u *io_u)
366{
367 if (td->flags & TD_F_PROFILE_OPS) {
368 struct prof_io_ops *ops = &td->prof_io_ops;
369
370 if (ops->fill_io_u_off)
371 return ops->fill_io_u_off(td, io_u);
372 }
373
374 return __get_next_offset(td, io_u);
375}
376
377static inline int io_u_fits(struct thread_data *td, struct io_u *io_u,
378 unsigned int buflen)
379{
380 struct fio_file *f = io_u->file;
381
382 return io_u->offset + buflen <= f->io_size + get_start_offset(td);
383}
384
385static unsigned int __get_next_buflen(struct thread_data *td, struct io_u *io_u)
386{
387 const int ddir = io_u->ddir;
388 unsigned int buflen = 0;
389 unsigned int minbs, maxbs;
390 unsigned long r, rand_max;
391
392 assert(ddir_rw(ddir));
393
394 minbs = td->o.min_bs[ddir];
395 maxbs = td->o.max_bs[ddir];
396
397 if (minbs == maxbs)
398 return minbs;
399
400 /*
401 * If we can't satisfy the min block size from here, then fail
402 */
403 if (!io_u_fits(td, io_u, minbs))
404 return 0;
405
406 if (td->o.use_os_rand)
407 rand_max = OS_RAND_MAX;
408 else
409 rand_max = FRAND_MAX;
410
411 do {
412 if (td->o.use_os_rand)
413 r = os_random_long(&td->bsrange_state);
414 else
415 r = __rand(&td->__bsrange_state);
416
417 if (!td->o.bssplit_nr[ddir]) {
418 buflen = 1 + (unsigned int) ((double) maxbs *
419 (r / (rand_max + 1.0)));
420 if (buflen < minbs)
421 buflen = minbs;
422 } else {
423 long perc = 0;
424 unsigned int i;
425
426 for (i = 0; i < td->o.bssplit_nr[ddir]; i++) {
427 struct bssplit *bsp = &td->o.bssplit[ddir][i];
428
429 buflen = bsp->bs;
430 perc += bsp->perc;
431 if ((r <= ((rand_max / 100L) * perc)) &&
432 io_u_fits(td, io_u, buflen))
433 break;
434 }
435 }
436
437 if (!td->o.bs_unaligned && is_power_of_2(minbs))
438 buflen = (buflen + minbs - 1) & ~(minbs - 1);
439
440 } while (!io_u_fits(td, io_u, buflen));
441
442 return buflen;
443}
444
445static unsigned int get_next_buflen(struct thread_data *td, struct io_u *io_u)
446{
447 if (td->flags & TD_F_PROFILE_OPS) {
448 struct prof_io_ops *ops = &td->prof_io_ops;
449
450 if (ops->fill_io_u_size)
451 return ops->fill_io_u_size(td, io_u);
452 }
453
454 return __get_next_buflen(td, io_u);
455}
456
457static void set_rwmix_bytes(struct thread_data *td)
458{
459 unsigned int diff;
460
461 /*
462 * we do time or byte based switch. this is needed because
463 * buffered writes may issue a lot quicker than they complete,
464 * whereas reads do not.
465 */
466 diff = td->o.rwmix[td->rwmix_ddir ^ 1];
467 td->rwmix_issues = (td->io_issues[td->rwmix_ddir] * diff) / 100;
468}
469
470static inline enum fio_ddir get_rand_ddir(struct thread_data *td)
471{
472 unsigned int v;
473 unsigned long r;
474
475 if (td->o.use_os_rand) {
476 r = os_random_long(&td->rwmix_state);
477 v = 1 + (int) (100.0 * (r / (OS_RAND_MAX + 1.0)));
478 } else {
479 r = __rand(&td->__rwmix_state);
480 v = 1 + (int) (100.0 * (r / (FRAND_MAX + 1.0)));
481 }
482
483 if (v <= td->o.rwmix[DDIR_READ])
484 return DDIR_READ;
485
486 return DDIR_WRITE;
487}
488
489static enum fio_ddir rate_ddir(struct thread_data *td, enum fio_ddir ddir)
490{
491 enum fio_ddir odir = ddir ^ 1;
492 struct timeval t;
493 long usec;
494
495 assert(ddir_rw(ddir));
496
497 if (td->rate_pending_usleep[ddir] <= 0)
498 return ddir;
499
500 /*
501 * We have too much pending sleep in this direction. See if we
502 * should switch.
503 */
504 if (td_rw(td) && td->o.rwmix[odir]) {
505 /*
506 * Other direction does not have too much pending, switch
507 */
508 if (td->rate_pending_usleep[odir] < 100000)
509 return odir;
510
511 /*
512 * Both directions have pending sleep. Sleep the minimum time
513 * and deduct from both.
514 */
515 if (td->rate_pending_usleep[ddir] <=
516 td->rate_pending_usleep[odir]) {
517 usec = td->rate_pending_usleep[ddir];
518 } else {
519 usec = td->rate_pending_usleep[odir];
520 ddir = odir;
521 }
522 } else
523 usec = td->rate_pending_usleep[ddir];
524
525 /*
526 * We are going to sleep, ensure that we flush anything pending as
527 * not to skew our latency numbers.
528 *
529 * Changed to only monitor 'in flight' requests here instead of the
530 * td->cur_depth, b/c td->cur_depth does not accurately represent
531 * io's that have been actually submitted to an async engine,
532 * and cur_depth is meaningless for sync engines.
533 */
534 while (td->io_u_in_flight) {
535 int fio_unused ret;
536
537 ret = io_u_queued_complete(td, 1, NULL);
538 }
539
540 fio_gettime(&t, NULL);
541 usec_sleep(td, usec);
542 usec = utime_since_now(&t);
543
544 td->rate_pending_usleep[ddir] -= usec;
545
546 odir = ddir ^ 1;
547 if (td_rw(td) && __should_check_rate(td, odir))
548 td->rate_pending_usleep[odir] -= usec;
549
550 if (ddir_trim(ddir))
551 return ddir;
552
553 return ddir;
554}
555
556/*
557 * Return the data direction for the next io_u. If the job is a
558 * mixed read/write workload, check the rwmix cycle and switch if
559 * necessary.
560 */
561static enum fio_ddir get_rw_ddir(struct thread_data *td)
562{
563 enum fio_ddir ddir;
564
565 /*
566 * see if it's time to fsync
567 */
568 if (td->o.fsync_blocks &&
569 !(td->io_issues[DDIR_WRITE] % td->o.fsync_blocks) &&
570 td->io_issues[DDIR_WRITE] && should_fsync(td))
571 return DDIR_SYNC;
572
573 /*
574 * see if it's time to fdatasync
575 */
576 if (td->o.fdatasync_blocks &&
577 !(td->io_issues[DDIR_WRITE] % td->o.fdatasync_blocks) &&
578 td->io_issues[DDIR_WRITE] && should_fsync(td))
579 return DDIR_DATASYNC;
580
581 /*
582 * see if it's time to sync_file_range
583 */
584 if (td->sync_file_range_nr &&
585 !(td->io_issues[DDIR_WRITE] % td->sync_file_range_nr) &&
586 td->io_issues[DDIR_WRITE] && should_fsync(td))
587 return DDIR_SYNC_FILE_RANGE;
588
589 if (td_rw(td)) {
590 /*
591 * Check if it's time to seed a new data direction.
592 */
593 if (td->io_issues[td->rwmix_ddir] >= td->rwmix_issues) {
594 /*
595 * Put a top limit on how many bytes we do for
596 * one data direction, to avoid overflowing the
597 * ranges too much
598 */
599 ddir = get_rand_ddir(td);
600
601 if (ddir != td->rwmix_ddir)
602 set_rwmix_bytes(td);
603
604 td->rwmix_ddir = ddir;
605 }
606 ddir = td->rwmix_ddir;
607 } else if (td_read(td))
608 ddir = DDIR_READ;
609 else if (td_write(td))
610 ddir = DDIR_WRITE;
611 else
612 ddir = DDIR_TRIM;
613
614 td->rwmix_ddir = rate_ddir(td, ddir);
615 return td->rwmix_ddir;
616}
617
618static void set_rw_ddir(struct thread_data *td, struct io_u *io_u)
619{
620 io_u->ddir = io_u->acct_ddir = get_rw_ddir(td);
621
622 if (io_u->ddir == DDIR_WRITE && (td->io_ops->flags & FIO_BARRIER) &&
623 td->o.barrier_blocks &&
624 !(td->io_issues[DDIR_WRITE] % td->o.barrier_blocks) &&
625 td->io_issues[DDIR_WRITE])
626 io_u->flags |= IO_U_F_BARRIER;
627}
628
629void put_file_log(struct thread_data *td, struct fio_file *f)
630{
631 int ret = put_file(td, f);
632
633 if (ret)
634 td_verror(td, ret, "file close");
635}
636
637void put_io_u(struct thread_data *td, struct io_u *io_u)
638{
639 td_io_u_lock(td);
640
641 if (io_u->file && !(io_u->flags & IO_U_F_FREE_DEF))
642 put_file_log(td, io_u->file);
643 io_u->file = NULL;
644 io_u->flags &= ~IO_U_F_FREE_DEF;
645 io_u->flags |= IO_U_F_FREE;
646
647 if (io_u->flags & IO_U_F_IN_CUR_DEPTH)
648 td->cur_depth--;
649 flist_del_init(&io_u->list);
650 flist_add(&io_u->list, &td->io_u_freelist);
651 td_io_u_unlock(td);
652 td_io_u_free_notify(td);
653}
654
655void clear_io_u(struct thread_data *td, struct io_u *io_u)
656{
657 io_u->flags &= ~IO_U_F_FLIGHT;
658 put_io_u(td, io_u);
659}
660
661void requeue_io_u(struct thread_data *td, struct io_u **io_u)
662{
663 struct io_u *__io_u = *io_u;
664 enum fio_ddir ddir = acct_ddir(__io_u);
665
666 dprint(FD_IO, "requeue %p\n", __io_u);
667
668 td_io_u_lock(td);
669
670 __io_u->flags |= IO_U_F_FREE;
671 if ((__io_u->flags & IO_U_F_FLIGHT) && ddir_rw(ddir))
672 td->io_issues[ddir]--;
673
674 __io_u->flags &= ~IO_U_F_FLIGHT;
675 if (__io_u->flags & IO_U_F_IN_CUR_DEPTH)
676 td->cur_depth--;
677 flist_del(&__io_u->list);
678 flist_add_tail(&__io_u->list, &td->io_u_requeues);
679 td_io_u_unlock(td);
680 *io_u = NULL;
681}
682
683static int fill_io_u(struct thread_data *td, struct io_u *io_u)
684{
685 if (td->io_ops->flags & FIO_NOIO)
686 goto out;
687
688 set_rw_ddir(td, io_u);
689
690 /*
691 * fsync() or fdatasync() or trim etc, we are done
692 */
693 if (!ddir_rw(io_u->ddir))
694 goto out;
695
696 /*
697 * See if it's time to switch to a new zone
698 */
699 if (td->zone_bytes >= td->o.zone_size && td->o.zone_skip) {
700 td->zone_bytes = 0;
701 io_u->file->file_offset += td->o.zone_range + td->o.zone_skip;
702 io_u->file->last_pos = io_u->file->file_offset;
703 td->io_skip_bytes += td->o.zone_skip;
704 }
705
706 /*
707 * No log, let the seq/rand engine retrieve the next buflen and
708 * position.
709 */
710 if (get_next_offset(td, io_u)) {
711 dprint(FD_IO, "io_u %p, failed getting offset\n", io_u);
712 return 1;
713 }
714
715 io_u->buflen = get_next_buflen(td, io_u);
716 if (!io_u->buflen) {
717 dprint(FD_IO, "io_u %p, failed getting buflen\n", io_u);
718 return 1;
719 }
720
721 if (io_u->offset + io_u->buflen > io_u->file->real_file_size) {
722 dprint(FD_IO, "io_u %p, offset too large\n", io_u);
723 dprint(FD_IO, " off=%llu/%lu > %llu\n",
724 (unsigned long long) io_u->offset, io_u->buflen,
725 (unsigned long long) io_u->file->real_file_size);
726 return 1;
727 }
728
729 /*
730 * mark entry before potentially trimming io_u
731 */
732 if (td_random(td) && file_randommap(td, io_u->file))
733 mark_random_map(td, io_u);
734
735out:
736 dprint_io_u(io_u, "fill_io_u");
737 td->zone_bytes += io_u->buflen;
738 return 0;
739}
740
741static void __io_u_mark_map(unsigned int *map, unsigned int nr)
742{
743 int idx = 0;
744
745 switch (nr) {
746 default:
747 idx = 6;
748 break;
749 case 33 ... 64:
750 idx = 5;
751 break;
752 case 17 ... 32:
753 idx = 4;
754 break;
755 case 9 ... 16:
756 idx = 3;
757 break;
758 case 5 ... 8:
759 idx = 2;
760 break;
761 case 1 ... 4:
762 idx = 1;
763 case 0:
764 break;
765 }
766
767 map[idx]++;
768}
769
770void io_u_mark_submit(struct thread_data *td, unsigned int nr)
771{
772 __io_u_mark_map(td->ts.io_u_submit, nr);
773 td->ts.total_submit++;
774}
775
776void io_u_mark_complete(struct thread_data *td, unsigned int nr)
777{
778 __io_u_mark_map(td->ts.io_u_complete, nr);
779 td->ts.total_complete++;
780}
781
782void io_u_mark_depth(struct thread_data *td, unsigned int nr)
783{
784 int idx = 0;
785
786 switch (td->cur_depth) {
787 default:
788 idx = 6;
789 break;
790 case 32 ... 63:
791 idx = 5;
792 break;
793 case 16 ... 31:
794 idx = 4;
795 break;
796 case 8 ... 15:
797 idx = 3;
798 break;
799 case 4 ... 7:
800 idx = 2;
801 break;
802 case 2 ... 3:
803 idx = 1;
804 case 1:
805 break;
806 }
807
808 td->ts.io_u_map[idx] += nr;
809}
810
811static void io_u_mark_lat_usec(struct thread_data *td, unsigned long usec)
812{
813 int idx = 0;
814
815 assert(usec < 1000);
816
817 switch (usec) {
818 case 750 ... 999:
819 idx = 9;
820 break;
821 case 500 ... 749:
822 idx = 8;
823 break;
824 case 250 ... 499:
825 idx = 7;
826 break;
827 case 100 ... 249:
828 idx = 6;
829 break;
830 case 50 ... 99:
831 idx = 5;
832 break;
833 case 20 ... 49:
834 idx = 4;
835 break;
836 case 10 ... 19:
837 idx = 3;
838 break;
839 case 4 ... 9:
840 idx = 2;
841 break;
842 case 2 ... 3:
843 idx = 1;
844 case 0 ... 1:
845 break;
846 }
847
848 assert(idx < FIO_IO_U_LAT_U_NR);
849 td->ts.io_u_lat_u[idx]++;
850}
851
852static void io_u_mark_lat_msec(struct thread_data *td, unsigned long msec)
853{
854 int idx = 0;
855
856 switch (msec) {
857 default:
858 idx = 11;
859 break;
860 case 1000 ... 1999:
861 idx = 10;
862 break;
863 case 750 ... 999:
864 idx = 9;
865 break;
866 case 500 ... 749:
867 idx = 8;
868 break;
869 case 250 ... 499:
870 idx = 7;
871 break;
872 case 100 ... 249:
873 idx = 6;
874 break;
875 case 50 ... 99:
876 idx = 5;
877 break;
878 case 20 ... 49:
879 idx = 4;
880 break;
881 case 10 ... 19:
882 idx = 3;
883 break;
884 case 4 ... 9:
885 idx = 2;
886 break;
887 case 2 ... 3:
888 idx = 1;
889 case 0 ... 1:
890 break;
891 }
892
893 assert(idx < FIO_IO_U_LAT_M_NR);
894 td->ts.io_u_lat_m[idx]++;
895}
896
897static void io_u_mark_latency(struct thread_data *td, unsigned long usec)
898{
899 if (usec < 1000)
900 io_u_mark_lat_usec(td, usec);
901 else
902 io_u_mark_lat_msec(td, usec / 1000);
903}
904
905/*
906 * Get next file to service by choosing one at random
907 */
908static struct fio_file *get_next_file_rand(struct thread_data *td,
909 enum fio_file_flags goodf,
910 enum fio_file_flags badf)
911{
912 struct fio_file *f;
913 int fno;
914
915 do {
916 int opened = 0;
917 unsigned long r;
918
919 if (td->o.use_os_rand) {
920 r = os_random_long(&td->next_file_state);
921 fno = (unsigned int) ((double) td->o.nr_files
922 * (r / (OS_RAND_MAX + 1.0)));
923 } else {
924 r = __rand(&td->__next_file_state);
925 fno = (unsigned int) ((double) td->o.nr_files
926 * (r / (FRAND_MAX + 1.0)));
927 }
928
929 f = td->files[fno];
930 if (fio_file_done(f))
931 continue;
932
933 if (!fio_file_open(f)) {
934 int err;
935
936 err = td_io_open_file(td, f);
937 if (err)
938 continue;
939 opened = 1;
940 }
941
942 if ((!goodf || (f->flags & goodf)) && !(f->flags & badf)) {
943 dprint(FD_FILE, "get_next_file_rand: %p\n", f);
944 return f;
945 }
946 if (opened)
947 td_io_close_file(td, f);
948 } while (1);
949}
950
951/*
952 * Get next file to service by doing round robin between all available ones
953 */
954static struct fio_file *get_next_file_rr(struct thread_data *td, int goodf,
955 int badf)
956{
957 unsigned int old_next_file = td->next_file;
958 struct fio_file *f;
959
960 do {
961 int opened = 0;
962
963 f = td->files[td->next_file];
964
965 td->next_file++;
966 if (td->next_file >= td->o.nr_files)
967 td->next_file = 0;
968
969 dprint(FD_FILE, "trying file %s %x\n", f->file_name, f->flags);
970 if (fio_file_done(f)) {
971 f = NULL;
972 continue;
973 }
974
975 if (!fio_file_open(f)) {
976 int err;
977
978 err = td_io_open_file(td, f);
979 if (err) {
980 dprint(FD_FILE, "error %d on open of %s\n",
981 err, f->file_name);
982 f = NULL;
983 continue;
984 }
985 opened = 1;
986 }
987
988 dprint(FD_FILE, "goodf=%x, badf=%x, ff=%x\n", goodf, badf,
989 f->flags);
990 if ((!goodf || (f->flags & goodf)) && !(f->flags & badf))
991 break;
992
993 if (opened)
994 td_io_close_file(td, f);
995
996 f = NULL;
997 } while (td->next_file != old_next_file);
998
999 dprint(FD_FILE, "get_next_file_rr: %p\n", f);
1000 return f;
1001}
1002
1003static struct fio_file *__get_next_file(struct thread_data *td)
1004{
1005 struct fio_file *f;
1006
1007 assert(td->o.nr_files <= td->files_index);
1008
1009 if (td->nr_done_files >= td->o.nr_files) {
1010 dprint(FD_FILE, "get_next_file: nr_open=%d, nr_done=%d,"
1011 " nr_files=%d\n", td->nr_open_files,
1012 td->nr_done_files,
1013 td->o.nr_files);
1014 return NULL;
1015 }
1016
1017 f = td->file_service_file;
1018 if (f && fio_file_open(f) && !fio_file_closing(f)) {
1019 if (td->o.file_service_type == FIO_FSERVICE_SEQ)
1020 goto out;
1021 if (td->file_service_left--)
1022 goto out;
1023 }
1024
1025 if (td->o.file_service_type == FIO_FSERVICE_RR ||
1026 td->o.file_service_type == FIO_FSERVICE_SEQ)
1027 f = get_next_file_rr(td, FIO_FILE_open, FIO_FILE_closing);
1028 else
1029 f = get_next_file_rand(td, FIO_FILE_open, FIO_FILE_closing);
1030
1031 td->file_service_file = f;
1032 td->file_service_left = td->file_service_nr - 1;
1033out:
1034 dprint(FD_FILE, "get_next_file: %p [%s]\n", f, f->file_name);
1035 return f;
1036}
1037
1038static struct fio_file *get_next_file(struct thread_data *td)
1039{
1040 if (!(td->flags & TD_F_PROFILE_OPS)) {
1041 struct prof_io_ops *ops = &td->prof_io_ops;
1042
1043 if (ops->get_next_file)
1044 return ops->get_next_file(td);
1045 }
1046
1047 return __get_next_file(td);
1048}
1049
1050static int set_io_u_file(struct thread_data *td, struct io_u *io_u)
1051{
1052 struct fio_file *f;
1053
1054 do {
1055 f = get_next_file(td);
1056 if (!f)
1057 return 1;
1058
1059 io_u->file = f;
1060 get_file(f);
1061
1062 if (!fill_io_u(td, io_u))
1063 break;
1064
1065 put_file_log(td, f);
1066 td_io_close_file(td, f);
1067 io_u->file = NULL;
1068 fio_file_set_done(f);
1069 td->nr_done_files++;
1070 dprint(FD_FILE, "%s: is done (%d of %d)\n", f->file_name,
1071 td->nr_done_files, td->o.nr_files);
1072 } while (1);
1073
1074 return 0;
1075}
1076
1077
1078struct io_u *__get_io_u(struct thread_data *td)
1079{
1080 struct io_u *io_u = NULL;
1081
1082 td_io_u_lock(td);
1083
1084again:
1085 if (!flist_empty(&td->io_u_requeues))
1086 io_u = flist_entry(td->io_u_requeues.next, struct io_u, list);
1087 else if (!queue_full(td)) {
1088 io_u = flist_entry(td->io_u_freelist.next, struct io_u, list);
1089
1090 io_u->buflen = 0;
1091 io_u->resid = 0;
1092 io_u->file = NULL;
1093 io_u->end_io = NULL;
1094 }
1095
1096 if (io_u) {
1097 assert(io_u->flags & IO_U_F_FREE);
1098 io_u->flags &= ~(IO_U_F_FREE | IO_U_F_FREE_DEF);
1099 io_u->flags &= ~(IO_U_F_TRIMMED | IO_U_F_BARRIER);
1100 io_u->flags &= ~IO_U_F_VER_LIST;
1101
1102 io_u->error = 0;
1103 io_u->acct_ddir = -1;
1104 flist_del(&io_u->list);
1105 flist_add_tail(&io_u->list, &td->io_u_busylist);
1106 td->cur_depth++;
1107 io_u->flags |= IO_U_F_IN_CUR_DEPTH;
1108 } else if (td->o.verify_async) {
1109 /*
1110 * We ran out, wait for async verify threads to finish and
1111 * return one
1112 */
1113 pthread_cond_wait(&td->free_cond, &td->io_u_lock);
1114 goto again;
1115 }
1116
1117 td_io_u_unlock(td);
1118 return io_u;
1119}
1120
1121static int check_get_trim(struct thread_data *td, struct io_u *io_u)
1122{
1123 if (!(td->flags & TD_F_TRIM_BACKLOG))
1124 return 0;
1125
1126 if (td->trim_entries) {
1127 int get_trim = 0;
1128
1129 if (td->trim_batch) {
1130 td->trim_batch--;
1131 get_trim = 1;
1132 } else if (!(td->io_hist_len % td->o.trim_backlog) &&
1133 td->last_ddir != DDIR_READ) {
1134 td->trim_batch = td->o.trim_batch;
1135 if (!td->trim_batch)
1136 td->trim_batch = td->o.trim_backlog;
1137 get_trim = 1;
1138 }
1139
1140 if (get_trim && !get_next_trim(td, io_u))
1141 return 1;
1142 }
1143
1144 return 0;
1145}
1146
1147static int check_get_verify(struct thread_data *td, struct io_u *io_u)
1148{
1149 if (!(td->flags & TD_F_VER_BACKLOG))
1150 return 0;
1151
1152 if (td->io_hist_len) {
1153 int get_verify = 0;
1154
1155 if (td->verify_batch)
1156 get_verify = 1;
1157 else if (!(td->io_hist_len % td->o.verify_backlog) &&
1158 td->last_ddir != DDIR_READ) {
1159 td->verify_batch = td->o.verify_batch;
1160 if (!td->verify_batch)
1161 td->verify_batch = td->o.verify_backlog;
1162 get_verify = 1;
1163 }
1164
1165 if (get_verify && !get_next_verify(td, io_u)) {
1166 td->verify_batch--;
1167 return 1;
1168 }
1169 }
1170
1171 return 0;
1172}
1173
1174/*
1175 * Fill offset and start time into the buffer content, to prevent too
1176 * easy compressible data for simple de-dupe attempts. Do this for every
1177 * 512b block in the range, since that should be the smallest block size
1178 * we can expect from a device.
1179 */
1180static void small_content_scramble(struct io_u *io_u)
1181{
1182 unsigned int i, nr_blocks = io_u->buflen / 512;
1183 uint64_t boffset;
1184 unsigned int offset;
1185 void *p, *end;
1186
1187 if (!nr_blocks)
1188 return;
1189
1190 p = io_u->xfer_buf;
1191 boffset = io_u->offset;
1192 io_u->buf_filled_len = 0;
1193
1194 for (i = 0; i < nr_blocks; i++) {
1195 /*
1196 * Fill the byte offset into a "random" start offset of
1197 * the buffer, given by the product of the usec time
1198 * and the actual offset.
1199 */
1200 offset = (io_u->start_time.tv_usec ^ boffset) & 511;
1201 offset &= ~(sizeof(uint64_t) - 1);
1202 if (offset >= 512 - sizeof(uint64_t))
1203 offset -= sizeof(uint64_t);
1204 memcpy(p + offset, &boffset, sizeof(boffset));
1205
1206 end = p + 512 - sizeof(io_u->start_time);
1207 memcpy(end, &io_u->start_time, sizeof(io_u->start_time));
1208 p += 512;
1209 boffset += 512;
1210 }
1211}
1212
1213/*
1214 * Return an io_u to be processed. Gets a buflen and offset, sets direction,
1215 * etc. The returned io_u is fully ready to be prepped and submitted.
1216 */
1217struct io_u *get_io_u(struct thread_data *td)
1218{
1219 struct fio_file *f;
1220 struct io_u *io_u;
1221 int do_scramble = 0;
1222
1223 io_u = __get_io_u(td);
1224 if (!io_u) {
1225 dprint(FD_IO, "__get_io_u failed\n");
1226 return NULL;
1227 }
1228
1229 if (check_get_verify(td, io_u))
1230 goto out;
1231 if (check_get_trim(td, io_u))
1232 goto out;
1233
1234 /*
1235 * from a requeue, io_u already setup
1236 */
1237 if (io_u->file)
1238 goto out;
1239
1240 /*
1241 * If using an iolog, grab next piece if any available.
1242 */
1243 if (td->flags & TD_F_READ_IOLOG) {
1244 if (read_iolog_get(td, io_u))
1245 goto err_put;
1246 } else if (set_io_u_file(td, io_u)) {
1247 dprint(FD_IO, "io_u %p, setting file failed\n", io_u);
1248 goto err_put;
1249 }
1250
1251 f = io_u->file;
1252 assert(fio_file_open(f));
1253
1254 if (ddir_rw(io_u->ddir)) {
1255 if (!io_u->buflen && !(td->io_ops->flags & FIO_NOIO)) {
1256 dprint(FD_IO, "get_io_u: zero buflen on %p\n", io_u);
1257 goto err_put;
1258 }
1259
1260 f->last_start = io_u->offset;
1261 f->last_pos = io_u->offset + io_u->buflen;
1262
1263 if (io_u->ddir == DDIR_WRITE) {
1264 if (td->flags & TD_F_REFILL_BUFFERS) {
1265 io_u_fill_buffer(td, io_u,
1266 io_u->xfer_buflen, io_u->xfer_buflen);
1267 } else if (td->flags & TD_F_SCRAMBLE_BUFFERS)
1268 do_scramble = 1;
1269 if (td->flags & TD_F_VER_NONE) {
1270 populate_verify_io_u(td, io_u);
1271 do_scramble = 0;
1272 }
1273 } else if (io_u->ddir == DDIR_READ) {
1274 /*
1275 * Reset the buf_filled parameters so next time if the
1276 * buffer is used for writes it is refilled.
1277 */
1278 io_u->buf_filled_len = 0;
1279 }
1280 }
1281
1282 /*
1283 * Set io data pointers.
1284 */
1285 io_u->xfer_buf = io_u->buf;
1286 io_u->xfer_buflen = io_u->buflen;
1287
1288out:
1289 assert(io_u->file);
1290 if (!td_io_prep(td, io_u)) {
1291 if (!td->o.disable_slat)
1292 fio_gettime(&io_u->start_time, NULL);
1293 if (do_scramble)
1294 small_content_scramble(io_u);
1295 return io_u;
1296 }
1297err_put:
1298 dprint(FD_IO, "get_io_u failed\n");
1299 put_io_u(td, io_u);
1300 return NULL;
1301}
1302
1303void io_u_log_error(struct thread_data *td, struct io_u *io_u)
1304{
1305 enum error_type_bit eb = td_error_type(io_u->ddir, io_u->error);
1306 const char *msg[] = { "read", "write", "sync", "datasync",
1307 "sync_file_range", "wait", "trim" };
1308
1309 if (td_non_fatal_error(td, eb, io_u->error) && !td->o.error_dump)
1310 return;
1311
1312 log_err("fio: io_u error");
1313
1314 if (io_u->file)
1315 log_err(" on file %s", io_u->file->file_name);
1316
1317 log_err(": %s\n", strerror(io_u->error));
1318
1319 log_err(" %s offset=%llu, buflen=%lu\n", msg[io_u->ddir],
1320 io_u->offset, io_u->xfer_buflen);
1321
1322 if (!td->error)
1323 td_verror(td, io_u->error, "io_u error");
1324}
1325
1326static void account_io_completion(struct thread_data *td, struct io_u *io_u,
1327 struct io_completion_data *icd,
1328 const enum fio_ddir idx, unsigned int bytes)
1329{
1330 unsigned long lusec = 0;
1331
1332 if (!td->o.disable_clat || !td->o.disable_bw)
1333 lusec = utime_since(&io_u->issue_time, &icd->time);
1334
1335 if (!td->o.disable_lat) {
1336 unsigned long tusec;
1337
1338 tusec = utime_since(&io_u->start_time, &icd->time);
1339 add_lat_sample(td, idx, tusec, bytes);
1340
1341 if (td->o.max_latency && tusec > td->o.max_latency) {
1342 if (!td->error)
1343 log_err("fio: latency of %lu usec exceeds specified max (%u usec)\n", tusec, td->o.max_latency);
1344 td_verror(td, ETIMEDOUT, "max latency exceeded");
1345 icd->error = ETIMEDOUT;
1346 }
1347 }
1348
1349 if (!td->o.disable_clat) {
1350 add_clat_sample(td, idx, lusec, bytes);
1351 io_u_mark_latency(td, lusec);
1352 }
1353
1354 if (!td->o.disable_bw)
1355 add_bw_sample(td, idx, bytes, &icd->time);
1356
1357 add_iops_sample(td, idx, &icd->time);
1358}
1359
1360static long long usec_for_io(struct thread_data *td, enum fio_ddir ddir)
1361{
1362 uint64_t secs, remainder, bps, bytes;
1363
1364 bytes = td->this_io_bytes[ddir];
1365 bps = td->rate_bps[ddir];
1366 secs = bytes / bps;
1367 remainder = bytes % bps;
1368 return remainder * 1000000 / bps + secs * 1000000;
1369}
1370
1371static void io_completed(struct thread_data *td, struct io_u *io_u,
1372 struct io_completion_data *icd)
1373{
1374 struct fio_file *f;
1375
1376 dprint_io_u(io_u, "io complete");
1377
1378 td_io_u_lock(td);
1379 assert(io_u->flags & IO_U_F_FLIGHT);
1380 io_u->flags &= ~(IO_U_F_FLIGHT | IO_U_F_BUSY_OK);
1381 td_io_u_unlock(td);
1382
1383 if (ddir_sync(io_u->ddir)) {
1384 td->last_was_sync = 1;
1385 f = io_u->file;
1386 if (f) {
1387 f->first_write = -1ULL;
1388 f->last_write = -1ULL;
1389 }
1390 return;
1391 }
1392
1393 td->last_was_sync = 0;
1394 td->last_ddir = io_u->ddir;
1395
1396 if (!io_u->error && ddir_rw(io_u->ddir)) {
1397 unsigned int bytes = io_u->buflen - io_u->resid;
1398 const enum fio_ddir idx = io_u->ddir;
1399 const enum fio_ddir odx = io_u->ddir ^ 1;
1400 int ret;
1401
1402 td->io_blocks[idx]++;
1403 td->this_io_blocks[idx]++;
1404 td->io_bytes[idx] += bytes;
1405
1406 if (!(io_u->flags & IO_U_F_VER_LIST))
1407 td->this_io_bytes[idx] += bytes;
1408
1409 if (idx == DDIR_WRITE) {
1410 f = io_u->file;
1411 if (f) {
1412 if (f->first_write == -1ULL ||
1413 io_u->offset < f->first_write)
1414 f->first_write = io_u->offset;
1415 if (f->last_write == -1ULL ||
1416 ((io_u->offset + bytes) > f->last_write))
1417 f->last_write = io_u->offset + bytes;
1418 }
1419 }
1420
1421 if (ramp_time_over(td) && (td->runstate == TD_RUNNING ||
1422 td->runstate == TD_VERIFYING)) {
1423 account_io_completion(td, io_u, icd, idx, bytes);
1424
1425 if (__should_check_rate(td, idx)) {
1426 td->rate_pending_usleep[idx] =
1427 (usec_for_io(td, idx) -
1428 utime_since_now(&td->start));
1429 }
1430 if (idx != DDIR_TRIM && __should_check_rate(td, odx))
1431 td->rate_pending_usleep[odx] =
1432 (usec_for_io(td, odx) -
1433 utime_since_now(&td->start));
1434 }
1435
1436 if (td_write(td) && idx == DDIR_WRITE &&
1437 td->o.do_verify &&
1438 td->o.verify != VERIFY_NONE &&
1439 !td->o.experimental_verify)
1440 log_io_piece(td, io_u);
1441
1442 icd->bytes_done[idx] += bytes;
1443
1444 if (io_u->end_io) {
1445 ret = io_u->end_io(td, io_u);
1446 if (ret && !icd->error)
1447 icd->error = ret;
1448 }
1449 } else if (io_u->error) {
1450 icd->error = io_u->error;
1451 io_u_log_error(td, io_u);
1452 }
1453 if (icd->error) {
1454 enum error_type_bit eb = td_error_type(io_u->ddir, icd->error);
1455 if (!td_non_fatal_error(td, eb, icd->error))
1456 return;
1457 /*
1458 * If there is a non_fatal error, then add to the error count
1459 * and clear all the errors.
1460 */
1461 update_error_count(td, icd->error);
1462 td_clear_error(td);
1463 icd->error = 0;
1464 io_u->error = 0;
1465 }
1466}
1467
1468static void init_icd(struct thread_data *td, struct io_completion_data *icd,
1469 int nr)
1470{
1471 int ddir;
1472 if (!td->o.disable_clat || !td->o.disable_bw)
1473 fio_gettime(&icd->time, NULL);
1474
1475 icd->nr = nr;
1476
1477 icd->error = 0;
1478 for (ddir = DDIR_READ; ddir < DDIR_RWDIR_CNT; ddir++)
1479 icd->bytes_done[ddir] = 0;
1480}
1481
1482static void ios_completed(struct thread_data *td,
1483 struct io_completion_data *icd)
1484{
1485 struct io_u *io_u;
1486 int i;
1487
1488 for (i = 0; i < icd->nr; i++) {
1489 io_u = td->io_ops->event(td, i);
1490
1491 io_completed(td, io_u, icd);
1492
1493 if (!(io_u->flags & IO_U_F_FREE_DEF))
1494 put_io_u(td, io_u);
1495 }
1496}
1497
1498/*
1499 * Complete a single io_u for the sync engines.
1500 */
1501int io_u_sync_complete(struct thread_data *td, struct io_u *io_u,
1502 uint64_t *bytes)
1503{
1504 struct io_completion_data icd;
1505
1506 init_icd(td, &icd, 1);
1507 io_completed(td, io_u, &icd);
1508
1509 if (!(io_u->flags & IO_U_F_FREE_DEF))
1510 put_io_u(td, io_u);
1511
1512 if (icd.error) {
1513 td_verror(td, icd.error, "io_u_sync_complete");
1514 return -1;
1515 }
1516
1517 if (bytes) {
1518 int ddir;
1519
1520 for (ddir = DDIR_READ; ddir < DDIR_RWDIR_CNT; ddir++)
1521 bytes[ddir] += icd.bytes_done[ddir];
1522 }
1523
1524 return 0;
1525}
1526
1527/*
1528 * Called to complete min_events number of io for the async engines.
1529 */
1530int io_u_queued_complete(struct thread_data *td, int min_evts,
1531 uint64_t *bytes)
1532{
1533 struct io_completion_data icd;
1534 struct timespec *tvp = NULL;
1535 int ret;
1536 struct timespec ts = { .tv_sec = 0, .tv_nsec = 0, };
1537
1538 dprint(FD_IO, "io_u_queued_completed: min=%d\n", min_evts);
1539
1540 if (!min_evts)
1541 tvp = &ts;
1542
1543 ret = td_io_getevents(td, min_evts, td->o.iodepth_batch_complete, tvp);
1544 if (ret < 0) {
1545 td_verror(td, -ret, "td_io_getevents");
1546 return ret;
1547 } else if (!ret)
1548 return ret;
1549
1550 init_icd(td, &icd, ret);
1551 ios_completed(td, &icd);
1552 if (icd.error) {
1553 td_verror(td, icd.error, "io_u_queued_complete");
1554 return -1;
1555 }
1556
1557 if (bytes) {
1558 int ddir;
1559
1560 for (ddir = DDIR_READ; ddir < DDIR_RWDIR_CNT; ddir++)
1561 bytes[ddir] += icd.bytes_done[ddir];
1562 }
1563
1564 return 0;
1565}
1566
1567/*
1568 * Call when io_u is really queued, to update the submission latency.
1569 */
1570void io_u_queued(struct thread_data *td, struct io_u *io_u)
1571{
1572 if (!td->o.disable_slat) {
1573 unsigned long slat_time;
1574
1575 slat_time = utime_since(&io_u->start_time, &io_u->issue_time);
1576 add_slat_sample(td, io_u->ddir, slat_time, io_u->xfer_buflen);
1577 }
1578}
1579
1580/*
1581 * "randomly" fill the buffer contents
1582 */
1583void io_u_fill_buffer(struct thread_data *td, struct io_u *io_u,
1584 unsigned int min_write, unsigned int max_bs)
1585{
1586 io_u->buf_filled_len = 0;
1587
1588 if (!td->o.zero_buffers) {
1589 unsigned int perc = td->o.compress_percentage;
1590
1591 if (perc) {
1592 unsigned int seg = min_write;
1593
1594 seg = min(min_write, td->o.compress_chunk);
1595 fill_random_buf_percentage(&td->buf_state, io_u->buf,
1596 perc, seg, max_bs);
1597 } else
1598 fill_random_buf(&td->buf_state, io_u->buf, max_bs);
1599 } else
1600 memset(io_u->buf, 0, max_bs);
1601}
fio - Flexible IO Tester