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