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" |
7ebd796f | 13 | #include "lib/axmap.h" |
002fe734 | 14 | #include "err.h" |
0f38bbef | 15 | #include "lib/pow2.h" |
4b157ac6 | 16 | #include "minmax.h" |
10ba535a | 17 | |
97601024 JA |
18 | struct io_completion_data { |
19 | int nr; /* input */ | |
97601024 JA |
20 | |
21 | int error; /* output */ | |
100f49f1 | 22 | uint64_t bytes_done[DDIR_RWDIR_CNT]; /* output */ |
97601024 JA |
23 | struct timeval time; /* output */ |
24 | }; | |
25 | ||
10ba535a | 26 | /* |
7ebd796f | 27 | * The ->io_axmap contains a map of blocks we have or have not done io |
10ba535a JA |
28 | * to yet. Used to make sure we cover the entire range in a fair fashion. |
29 | */ | |
e39c0676 | 30 | static bool random_map_free(struct fio_file *f, const uint64_t block) |
10ba535a | 31 | { |
7ebd796f | 32 | return !axmap_isset(f->io_axmap, block); |
10ba535a JA |
33 | } |
34 | ||
df415585 JA |
35 | /* |
36 | * Mark a given offset as used in the map. | |
37 | */ | |
9bf2061e | 38 | static void mark_random_map(struct thread_data *td, struct io_u *io_u) |
df415585 | 39 | { |
2dc1bbeb | 40 | unsigned int min_bs = td->o.rw_min_bs; |
9bf2061e | 41 | struct fio_file *f = io_u->file; |
51ede0b1 | 42 | unsigned int nr_blocks; |
1ae83d45 | 43 | uint64_t block; |
df415585 | 44 | |
1ae83d45 | 45 | block = (io_u->offset - f->file_offset) / (uint64_t) min_bs; |
c685b5b2 | 46 | nr_blocks = (io_u->buflen + min_bs - 1) / min_bs; |
df415585 | 47 | |
2ab9e98b | 48 | if (!(io_u->flags & IO_U_F_BUSY_OK)) |
7ebd796f | 49 | nr_blocks = axmap_set_nr(f->io_axmap, block, nr_blocks); |
df415585 | 50 | |
51ede0b1 JA |
51 | if ((nr_blocks * min_bs) < io_u->buflen) |
52 | io_u->buflen = nr_blocks * min_bs; | |
df415585 JA |
53 | } |
54 | ||
74776733 JA |
55 | static uint64_t last_block(struct thread_data *td, struct fio_file *f, |
56 | enum fio_ddir ddir) | |
2ba1c290 | 57 | { |
74776733 JA |
58 | uint64_t max_blocks; |
59 | uint64_t max_size; | |
2ba1c290 | 60 | |
ff58fced JA |
61 | assert(ddir_rw(ddir)); |
62 | ||
d9dd70f7 JA |
63 | /* |
64 | * Hmm, should we make sure that ->io_size <= ->real_file_size? | |
65 | */ | |
66 | max_size = f->io_size; | |
67 | if (max_size > f->real_file_size) | |
68 | max_size = f->real_file_size; | |
69 | ||
ed335855 SN |
70 | if (td->o.zone_range) |
71 | max_size = td->o.zone_range; | |
72 | ||
0412d12e JE |
73 | if (td->o.min_bs[ddir] > td->o.ba[ddir]) |
74 | max_size -= td->o.min_bs[ddir] - td->o.ba[ddir]; | |
75 | ||
1ae83d45 | 76 | max_blocks = max_size / (uint64_t) td->o.ba[ddir]; |
2ba1c290 JA |
77 | if (!max_blocks) |
78 | return 0; | |
79 | ||
67778e88 | 80 | return max_blocks; |
2ba1c290 JA |
81 | } |
82 | ||
1ae83d45 JA |
83 | struct rand_off { |
84 | struct flist_head list; | |
85 | uint64_t off; | |
86 | }; | |
87 | ||
e25839d4 | 88 | static int __get_next_rand_offset(struct thread_data *td, struct fio_file *f, |
e0a04ac1 JA |
89 | enum fio_ddir ddir, uint64_t *b, |
90 | uint64_t lastb) | |
ec4015da | 91 | { |
6f49f8bc | 92 | uint64_t r; |
5e0baa7f | 93 | |
c3546b53 JA |
94 | if (td->o.random_generator == FIO_RAND_GEN_TAUSWORTHE || |
95 | td->o.random_generator == FIO_RAND_GEN_TAUSWORTHE64) { | |
6f49f8bc | 96 | |
d6b72507 | 97 | r = __rand(&td->random_state); |
8055e41d | 98 | |
4b91ee8f | 99 | dprint(FD_RANDOM, "off rand %llu\n", (unsigned long long) r); |
8055e41d | 100 | |
e0a04ac1 | 101 | *b = lastb * (r / (rand_max(&td->random_state) + 1.0)); |
51ede0b1 | 102 | } else { |
8055e41d | 103 | uint64_t off = 0; |
43c63a78 | 104 | |
967d1b63 JA |
105 | assert(fio_file_lfsr(f)); |
106 | ||
6f49f8bc | 107 | if (lfsr_next(&f->lfsr, &off)) |
8055e41d | 108 | return 1; |
ec4015da | 109 | |
8055e41d JA |
110 | *b = off; |
111 | } | |
0ce8b119 | 112 | |
ec4015da | 113 | /* |
51ede0b1 | 114 | * if we are not maintaining a random map, we are done. |
ec4015da | 115 | */ |
51ede0b1 JA |
116 | if (!file_randommap(td, f)) |
117 | goto ret; | |
43c63a78 JA |
118 | |
119 | /* | |
51ede0b1 | 120 | * calculate map offset and check if it's free |
43c63a78 | 121 | */ |
51ede0b1 JA |
122 | if (random_map_free(f, *b)) |
123 | goto ret; | |
124 | ||
4b91ee8f JA |
125 | dprint(FD_RANDOM, "get_next_rand_offset: offset %llu busy\n", |
126 | (unsigned long long) *b); | |
51ede0b1 | 127 | |
7ebd796f | 128 | *b = axmap_next_free(f->io_axmap, *b); |
51ede0b1 JA |
129 | if (*b == (uint64_t) -1ULL) |
130 | return 1; | |
0ce8b119 JA |
131 | ret: |
132 | return 0; | |
ec4015da JA |
133 | } |
134 | ||
925fee33 JA |
135 | static int __get_next_rand_offset_zipf(struct thread_data *td, |
136 | struct fio_file *f, enum fio_ddir ddir, | |
1ae83d45 | 137 | uint64_t *b) |
e25839d4 | 138 | { |
9c6f6316 | 139 | *b = zipf_next(&f->zipf); |
e25839d4 JA |
140 | return 0; |
141 | } | |
142 | ||
925fee33 JA |
143 | static int __get_next_rand_offset_pareto(struct thread_data *td, |
144 | struct fio_file *f, enum fio_ddir ddir, | |
1ae83d45 | 145 | uint64_t *b) |
925fee33 | 146 | { |
9c6f6316 | 147 | *b = pareto_next(&f->zipf); |
925fee33 JA |
148 | return 0; |
149 | } | |
150 | ||
56d9fa4b JA |
151 | static int __get_next_rand_offset_gauss(struct thread_data *td, |
152 | struct fio_file *f, enum fio_ddir ddir, | |
153 | uint64_t *b) | |
154 | { | |
155 | *b = gauss_next(&f->gauss); | |
156 | return 0; | |
157 | } | |
158 | ||
e0a04ac1 JA |
159 | static int __get_next_rand_offset_zoned(struct thread_data *td, |
160 | struct fio_file *f, enum fio_ddir ddir, | |
161 | uint64_t *b) | |
162 | { | |
163 | unsigned int v, send, stotal; | |
164 | uint64_t offset, lastb; | |
165 | static int warned; | |
166 | struct zone_split_index *zsi; | |
167 | ||
168 | lastb = last_block(td, f, ddir); | |
169 | if (!lastb) | |
170 | return 1; | |
171 | ||
172 | if (!td->o.zone_split_nr[ddir]) { | |
173 | bail: | |
174 | return __get_next_rand_offset(td, f, ddir, b, lastb); | |
175 | } | |
176 | ||
177 | /* | |
178 | * Generate a value, v, between 1 and 100, both inclusive | |
179 | */ | |
180 | v = rand_between(&td->zone_state, 1, 100); | |
181 | ||
182 | zsi = &td->zone_state_index[ddir][v - 1]; | |
183 | stotal = zsi->size_perc_prev; | |
184 | send = zsi->size_perc; | |
185 | ||
186 | /* | |
187 | * Should never happen | |
188 | */ | |
189 | if (send == -1U) { | |
190 | if (!warned) { | |
191 | log_err("fio: bug in zoned generation\n"); | |
192 | warned = 1; | |
193 | } | |
194 | goto bail; | |
195 | } | |
196 | ||
197 | /* | |
198 | * 'send' is some percentage below or equal to 100 that | |
199 | * marks the end of the current IO range. 'stotal' marks | |
200 | * the start, in percent. | |
201 | */ | |
202 | if (stotal) | |
203 | offset = stotal * lastb / 100ULL; | |
204 | else | |
205 | offset = 0; | |
206 | ||
207 | lastb = lastb * (send - stotal) / 100ULL; | |
208 | ||
209 | /* | |
210 | * Generate index from 0..send-of-lastb | |
211 | */ | |
212 | if (__get_next_rand_offset(td, f, ddir, b, lastb) == 1) | |
213 | return 1; | |
214 | ||
215 | /* | |
216 | * Add our start offset, if any | |
217 | */ | |
218 | if (offset) | |
219 | *b += offset; | |
220 | ||
221 | return 0; | |
222 | } | |
56d9fa4b | 223 | |
1ae83d45 JA |
224 | static int flist_cmp(void *data, struct flist_head *a, struct flist_head *b) |
225 | { | |
226 | struct rand_off *r1 = flist_entry(a, struct rand_off, list); | |
227 | struct rand_off *r2 = flist_entry(b, struct rand_off, list); | |
228 | ||
229 | return r1->off - r2->off; | |
230 | } | |
231 | ||
232 | static int get_off_from_method(struct thread_data *td, struct fio_file *f, | |
233 | enum fio_ddir ddir, uint64_t *b) | |
e25839d4 | 234 | { |
e0a04ac1 JA |
235 | if (td->o.random_distribution == FIO_RAND_DIST_RANDOM) { |
236 | uint64_t lastb; | |
237 | ||
238 | lastb = last_block(td, f, ddir); | |
239 | if (!lastb) | |
240 | return 1; | |
241 | ||
242 | return __get_next_rand_offset(td, f, ddir, b, lastb); | |
243 | } else if (td->o.random_distribution == FIO_RAND_DIST_ZIPF) | |
e25839d4 | 244 | return __get_next_rand_offset_zipf(td, f, ddir, b); |
925fee33 JA |
245 | else if (td->o.random_distribution == FIO_RAND_DIST_PARETO) |
246 | return __get_next_rand_offset_pareto(td, f, ddir, b); | |
56d9fa4b JA |
247 | else if (td->o.random_distribution == FIO_RAND_DIST_GAUSS) |
248 | return __get_next_rand_offset_gauss(td, f, ddir, b); | |
e0a04ac1 JA |
249 | else if (td->o.random_distribution == FIO_RAND_DIST_ZONED) |
250 | return __get_next_rand_offset_zoned(td, f, ddir, b); | |
e25839d4 JA |
251 | |
252 | log_err("fio: unknown random distribution: %d\n", td->o.random_distribution); | |
253 | return 1; | |
254 | } | |
255 | ||
bcd5abfa JA |
256 | /* |
257 | * Sort the reads for a verify phase in batches of verifysort_nr, if | |
258 | * specified. | |
259 | */ | |
e39c0676 | 260 | static inline bool should_sort_io(struct thread_data *td) |
bcd5abfa JA |
261 | { |
262 | if (!td->o.verifysort_nr || !td->o.do_verify) | |
e39c0676 | 263 | return false; |
bcd5abfa | 264 | if (!td_random(td)) |
e39c0676 | 265 | return false; |
bcd5abfa | 266 | if (td->runstate != TD_VERIFYING) |
e39c0676 | 267 | return false; |
c3546b53 JA |
268 | if (td->o.random_generator == FIO_RAND_GEN_TAUSWORTHE || |
269 | td->o.random_generator == FIO_RAND_GEN_TAUSWORTHE64) | |
e39c0676 | 270 | return false; |
bcd5abfa | 271 | |
e39c0676 | 272 | return true; |
bcd5abfa JA |
273 | } |
274 | ||
e39c0676 | 275 | static bool should_do_random(struct thread_data *td, enum fio_ddir ddir) |
211c9b89 JA |
276 | { |
277 | unsigned int v; | |
211c9b89 | 278 | |
d9472271 | 279 | if (td->o.perc_rand[ddir] == 100) |
e39c0676 | 280 | return true; |
211c9b89 | 281 | |
e0a04ac1 | 282 | v = rand_between(&td->seq_rand_state[ddir], 1, 100); |
211c9b89 | 283 | |
d9472271 | 284 | return v <= td->o.perc_rand[ddir]; |
211c9b89 JA |
285 | } |
286 | ||
1ae83d45 JA |
287 | static int get_next_rand_offset(struct thread_data *td, struct fio_file *f, |
288 | enum fio_ddir ddir, uint64_t *b) | |
289 | { | |
290 | struct rand_off *r; | |
291 | int i, ret = 1; | |
292 | ||
bcd5abfa | 293 | if (!should_sort_io(td)) |
1ae83d45 JA |
294 | return get_off_from_method(td, f, ddir, b); |
295 | ||
296 | if (!flist_empty(&td->next_rand_list)) { | |
1ae83d45 | 297 | fetch: |
9342d5f8 | 298 | r = flist_first_entry(&td->next_rand_list, struct rand_off, list); |
1ae83d45 JA |
299 | flist_del(&r->list); |
300 | *b = r->off; | |
301 | free(r); | |
302 | return 0; | |
303 | } | |
304 | ||
305 | for (i = 0; i < td->o.verifysort_nr; i++) { | |
306 | r = malloc(sizeof(*r)); | |
307 | ||
308 | ret = get_off_from_method(td, f, ddir, &r->off); | |
309 | if (ret) { | |
310 | free(r); | |
311 | break; | |
312 | } | |
313 | ||
314 | flist_add(&r->list, &td->next_rand_list); | |
315 | } | |
316 | ||
317 | if (ret && !i) | |
318 | return ret; | |
319 | ||
320 | assert(!flist_empty(&td->next_rand_list)); | |
321 | flist_sort(NULL, &td->next_rand_list, flist_cmp); | |
322 | goto fetch; | |
323 | } | |
324 | ||
38dad62d | 325 | static int get_next_rand_block(struct thread_data *td, struct fio_file *f, |
1ae83d45 | 326 | enum fio_ddir ddir, uint64_t *b) |
38dad62d | 327 | { |
c04e4661 DE |
328 | if (!get_next_rand_offset(td, f, ddir, b)) |
329 | return 0; | |
330 | ||
331 | if (td->o.time_based) { | |
33c48814 | 332 | fio_file_reset(td, f); |
c04e4661 DE |
333 | if (!get_next_rand_offset(td, f, ddir, b)) |
334 | return 0; | |
38dad62d JA |
335 | } |
336 | ||
c04e4661 | 337 | dprint(FD_IO, "%s: rand offset failed, last=%llu, size=%llu\n", |
f1dfb668 | 338 | f->file_name, (unsigned long long) f->last_pos[ddir], |
4b91ee8f | 339 | (unsigned long long) f->real_file_size); |
c04e4661 | 340 | return 1; |
38dad62d JA |
341 | } |
342 | ||
37cf9e3c | 343 | static int get_next_seq_offset(struct thread_data *td, struct fio_file *f, |
1ae83d45 | 344 | enum fio_ddir ddir, uint64_t *offset) |
38dad62d | 345 | { |
ac002339 JA |
346 | struct thread_options *o = &td->o; |
347 | ||
ff58fced JA |
348 | assert(ddir_rw(ddir)); |
349 | ||
f1dfb668 | 350 | if (f->last_pos[ddir] >= f->io_size + get_start_offset(td, f) && |
19ddc35b JA |
351 | o->time_based) { |
352 | struct thread_options *o = &td->o; | |
353 | uint64_t io_size = f->io_size + (f->io_size % o->min_bs[ddir]); | |
354 | ||
355 | if (io_size > f->last_pos[ddir]) | |
356 | f->last_pos[ddir] = 0; | |
357 | else | |
358 | f->last_pos[ddir] = f->last_pos[ddir] - io_size; | |
359 | } | |
c04e4661 | 360 | |
f1dfb668 | 361 | if (f->last_pos[ddir] < f->real_file_size) { |
1ae83d45 | 362 | uint64_t pos; |
059b0802 | 363 | |
f1dfb668 JA |
364 | if (f->last_pos[ddir] == f->file_offset && o->ddir_seq_add < 0) |
365 | f->last_pos[ddir] = f->real_file_size; | |
a66da7a2 | 366 | |
f1dfb668 | 367 | pos = f->last_pos[ddir] - f->file_offset; |
ac002339 JA |
368 | if (pos && o->ddir_seq_add) { |
369 | pos += o->ddir_seq_add; | |
370 | ||
371 | /* | |
372 | * If we reach beyond the end of the file | |
373 | * with holed IO, wrap around to the | |
374 | * beginning again. | |
375 | */ | |
376 | if (pos >= f->real_file_size) | |
377 | pos = f->file_offset; | |
378 | } | |
059b0802 | 379 | |
37cf9e3c | 380 | *offset = pos; |
38dad62d JA |
381 | return 0; |
382 | } | |
383 | ||
384 | return 1; | |
385 | } | |
386 | ||
387 | static int get_next_block(struct thread_data *td, struct io_u *io_u, | |
6aca9b3d JA |
388 | enum fio_ddir ddir, int rw_seq, |
389 | unsigned int *is_random) | |
38dad62d JA |
390 | { |
391 | struct fio_file *f = io_u->file; | |
1ae83d45 | 392 | uint64_t b, offset; |
38dad62d JA |
393 | int ret; |
394 | ||
ff58fced JA |
395 | assert(ddir_rw(ddir)); |
396 | ||
37cf9e3c JA |
397 | b = offset = -1ULL; |
398 | ||
38dad62d | 399 | if (rw_seq) { |
211c9b89 | 400 | if (td_random(td)) { |
6aca9b3d | 401 | if (should_do_random(td, ddir)) { |
211c9b89 | 402 | ret = get_next_rand_block(td, f, ddir, &b); |
6aca9b3d JA |
403 | *is_random = 1; |
404 | } else { | |
405 | *is_random = 0; | |
a9da8ab2 | 406 | io_u_set(io_u, IO_U_F_BUSY_OK); |
211c9b89 JA |
407 | ret = get_next_seq_offset(td, f, ddir, &offset); |
408 | if (ret) | |
409 | ret = get_next_rand_block(td, f, ddir, &b); | |
410 | } | |
6aca9b3d JA |
411 | } else { |
412 | *is_random = 0; | |
37cf9e3c | 413 | ret = get_next_seq_offset(td, f, ddir, &offset); |
6aca9b3d | 414 | } |
38dad62d | 415 | } else { |
a9da8ab2 | 416 | io_u_set(io_u, IO_U_F_BUSY_OK); |
6aca9b3d | 417 | *is_random = 0; |
38dad62d JA |
418 | |
419 | if (td->o.rw_seq == RW_SEQ_SEQ) { | |
37cf9e3c | 420 | ret = get_next_seq_offset(td, f, ddir, &offset); |
6aca9b3d | 421 | if (ret) { |
37cf9e3c | 422 | ret = get_next_rand_block(td, f, ddir, &b); |
6aca9b3d JA |
423 | *is_random = 0; |
424 | } | |
38dad62d | 425 | } else if (td->o.rw_seq == RW_SEQ_IDENT) { |
f1dfb668 JA |
426 | if (f->last_start[ddir] != -1ULL) |
427 | offset = f->last_start[ddir] - f->file_offset; | |
38dad62d | 428 | else |
37cf9e3c | 429 | offset = 0; |
38dad62d JA |
430 | ret = 0; |
431 | } else { | |
432 | log_err("fio: unknown rw_seq=%d\n", td->o.rw_seq); | |
433 | ret = 1; | |
434 | } | |
435 | } | |
6d68b997 | 436 | |
37cf9e3c JA |
437 | if (!ret) { |
438 | if (offset != -1ULL) | |
439 | io_u->offset = offset; | |
440 | else if (b != -1ULL) | |
441 | io_u->offset = b * td->o.ba[ddir]; | |
442 | else { | |
4e0a8fa2 | 443 | log_err("fio: bug in offset generation: offset=%llu, b=%llu\n", (unsigned long long) offset, (unsigned long long) b); |
37cf9e3c JA |
444 | ret = 1; |
445 | } | |
446 | } | |
447 | ||
38dad62d JA |
448 | return ret; |
449 | } | |
450 | ||
10ba535a JA |
451 | /* |
452 | * For random io, generate a random new block and see if it's used. Repeat | |
453 | * until we find a free one. For sequential io, just return the end of | |
454 | * the last io issued. | |
455 | */ | |
6aca9b3d JA |
456 | static int __get_next_offset(struct thread_data *td, struct io_u *io_u, |
457 | unsigned int *is_random) | |
10ba535a | 458 | { |
9bf2061e | 459 | struct fio_file *f = io_u->file; |
4ba66134 | 460 | enum fio_ddir ddir = io_u->ddir; |
38dad62d | 461 | int rw_seq_hit = 0; |
10ba535a | 462 | |
ff58fced JA |
463 | assert(ddir_rw(ddir)); |
464 | ||
38dad62d JA |
465 | if (td->o.ddir_seq_nr && !--td->ddir_seq_nr) { |
466 | rw_seq_hit = 1; | |
5736c10d | 467 | td->ddir_seq_nr = td->o.ddir_seq_nr; |
38dad62d | 468 | } |
211097b2 | 469 | |
6aca9b3d | 470 | if (get_next_block(td, io_u, ddir, rw_seq_hit, is_random)) |
38dad62d | 471 | return 1; |
10ba535a | 472 | |
009bd847 JA |
473 | if (io_u->offset >= f->io_size) { |
474 | dprint(FD_IO, "get_next_offset: offset %llu >= io_size %llu\n", | |
4b91ee8f JA |
475 | (unsigned long long) io_u->offset, |
476 | (unsigned long long) f->io_size); | |
009bd847 JA |
477 | return 1; |
478 | } | |
479 | ||
480 | io_u->offset += f->file_offset; | |
2ba1c290 JA |
481 | if (io_u->offset >= f->real_file_size) { |
482 | dprint(FD_IO, "get_next_offset: offset %llu >= size %llu\n", | |
4b91ee8f JA |
483 | (unsigned long long) io_u->offset, |
484 | (unsigned long long) f->real_file_size); | |
10ba535a | 485 | return 1; |
2ba1c290 | 486 | } |
10ba535a JA |
487 | |
488 | return 0; | |
489 | } | |
490 | ||
6aca9b3d JA |
491 | static int get_next_offset(struct thread_data *td, struct io_u *io_u, |
492 | unsigned int *is_random) | |
15dc1934 | 493 | { |
d72be545 JA |
494 | if (td->flags & TD_F_PROFILE_OPS) { |
495 | struct prof_io_ops *ops = &td->prof_io_ops; | |
7eb36574 | 496 | |
d72be545 | 497 | if (ops->fill_io_u_off) |
6aca9b3d | 498 | return ops->fill_io_u_off(td, io_u, is_random); |
d72be545 | 499 | } |
15dc1934 | 500 | |
6aca9b3d | 501 | return __get_next_offset(td, io_u, is_random); |
15dc1934 JA |
502 | } |
503 | ||
e39c0676 JA |
504 | static inline bool io_u_fits(struct thread_data *td, struct io_u *io_u, |
505 | unsigned int buflen) | |
79944128 JA |
506 | { |
507 | struct fio_file *f = io_u->file; | |
508 | ||
bedc9dc2 | 509 | return io_u->offset + buflen <= f->io_size + get_start_offset(td, f); |
79944128 JA |
510 | } |
511 | ||
6aca9b3d JA |
512 | static unsigned int __get_next_buflen(struct thread_data *td, struct io_u *io_u, |
513 | unsigned int is_random) | |
10ba535a | 514 | { |
6aca9b3d | 515 | int ddir = io_u->ddir; |
24d23ca7 | 516 | unsigned int buflen = 0; |
f3059de1 | 517 | unsigned int minbs, maxbs; |
c3546b53 | 518 | uint64_t frand_max; |
54a21917 | 519 | unsigned long r; |
10ba535a | 520 | |
9ee1c647 | 521 | assert(ddir_rw(ddir)); |
6aca9b3d JA |
522 | |
523 | if (td->o.bs_is_seq_rand) | |
524 | ddir = is_random ? DDIR_WRITE: DDIR_READ; | |
ff58fced | 525 | |
f3059de1 JA |
526 | minbs = td->o.min_bs[ddir]; |
527 | maxbs = td->o.max_bs[ddir]; | |
528 | ||
79944128 JA |
529 | if (minbs == maxbs) |
530 | return minbs; | |
531 | ||
52c58027 JA |
532 | /* |
533 | * If we can't satisfy the min block size from here, then fail | |
534 | */ | |
535 | if (!io_u_fits(td, io_u, minbs)) | |
536 | return 0; | |
537 | ||
c3546b53 | 538 | frand_max = rand_max(&td->bsrange_state); |
79944128 | 539 | do { |
d6b72507 | 540 | r = __rand(&td->bsrange_state); |
4c07ad86 | 541 | |
720e84ad | 542 | if (!td->o.bssplit_nr[ddir]) { |
f3059de1 | 543 | buflen = 1 + (unsigned int) ((double) maxbs * |
c3546b53 | 544 | (r / (frand_max + 1.0))); |
f3059de1 JA |
545 | if (buflen < minbs) |
546 | buflen = minbs; | |
5ec10eaa | 547 | } else { |
564ca972 JA |
548 | long perc = 0; |
549 | unsigned int i; | |
550 | ||
720e84ad JA |
551 | for (i = 0; i < td->o.bssplit_nr[ddir]; i++) { |
552 | struct bssplit *bsp = &td->o.bssplit[ddir][i]; | |
564ca972 JA |
553 | |
554 | buflen = bsp->bs; | |
555 | perc += bsp->perc; | |
c3546b53 | 556 | if ((r <= ((frand_max / 100L) * perc)) && |
79944128 | 557 | io_u_fits(td, io_u, buflen)) |
564ca972 JA |
558 | break; |
559 | } | |
560 | } | |
79944128 | 561 | |
ced5db25 | 562 | if (td->o.verify != VERIFY_NONE) |
a9f70b1f JB |
563 | buflen = (buflen + td->o.verify_interval - 1) & |
564 | ~(td->o.verify_interval - 1); | |
565 | ||
f3059de1 | 566 | if (!td->o.bs_unaligned && is_power_of_2(minbs)) |
7c306bb1 | 567 | buflen &= ~(minbs - 1); |
10ba535a | 568 | |
79944128 | 569 | } while (!io_u_fits(td, io_u, buflen)); |
6a5e6884 | 570 | |
10ba535a JA |
571 | return buflen; |
572 | } | |
573 | ||
6aca9b3d JA |
574 | static unsigned int get_next_buflen(struct thread_data *td, struct io_u *io_u, |
575 | unsigned int is_random) | |
15dc1934 | 576 | { |
d72be545 JA |
577 | if (td->flags & TD_F_PROFILE_OPS) { |
578 | struct prof_io_ops *ops = &td->prof_io_ops; | |
7eb36574 | 579 | |
d72be545 | 580 | if (ops->fill_io_u_size) |
6aca9b3d | 581 | return ops->fill_io_u_size(td, io_u, is_random); |
d72be545 | 582 | } |
15dc1934 | 583 | |
6aca9b3d | 584 | return __get_next_buflen(td, io_u, is_random); |
15dc1934 JA |
585 | } |
586 | ||
afe24a5a JA |
587 | static void set_rwmix_bytes(struct thread_data *td) |
588 | { | |
afe24a5a JA |
589 | unsigned int diff; |
590 | ||
591 | /* | |
592 | * we do time or byte based switch. this is needed because | |
593 | * buffered writes may issue a lot quicker than they complete, | |
594 | * whereas reads do not. | |
595 | */ | |
e47f799f | 596 | diff = td->o.rwmix[td->rwmix_ddir ^ 1]; |
04c540d9 | 597 | td->rwmix_issues = (td->io_issues[td->rwmix_ddir] * diff) / 100; |
e47f799f JA |
598 | } |
599 | ||
600 | static inline enum fio_ddir get_rand_ddir(struct thread_data *td) | |
601 | { | |
602 | unsigned int v; | |
e47f799f | 603 | |
e0a04ac1 | 604 | v = rand_between(&td->rwmix_state, 1, 100); |
4c07ad86 | 605 | |
04c540d9 | 606 | if (v <= td->o.rwmix[DDIR_READ]) |
e47f799f JA |
607 | return DDIR_READ; |
608 | ||
609 | return DDIR_WRITE; | |
afe24a5a JA |
610 | } |
611 | ||
0d593542 | 612 | int io_u_quiesce(struct thread_data *td) |
002e7183 | 613 | { |
0d593542 JA |
614 | int completed = 0; |
615 | ||
002e7183 JA |
616 | /* |
617 | * We are going to sleep, ensure that we flush anything pending as | |
618 | * not to skew our latency numbers. | |
619 | * | |
620 | * Changed to only monitor 'in flight' requests here instead of the | |
621 | * td->cur_depth, b/c td->cur_depth does not accurately represent | |
622 | * io's that have been actually submitted to an async engine, | |
623 | * and cur_depth is meaningless for sync engines. | |
624 | */ | |
9cc80b6d JA |
625 | if (td->io_u_queued || td->cur_depth) { |
626 | int fio_unused ret; | |
627 | ||
628 | ret = td_io_commit(td); | |
629 | } | |
630 | ||
002e7183 JA |
631 | while (td->io_u_in_flight) { |
632 | int fio_unused ret; | |
633 | ||
55312f9f | 634 | ret = io_u_queued_complete(td, 1); |
0d593542 JA |
635 | if (ret > 0) |
636 | completed += ret; | |
002e7183 | 637 | } |
0d593542 JA |
638 | |
639 | return completed; | |
002e7183 JA |
640 | } |
641 | ||
581e7141 JA |
642 | static enum fio_ddir rate_ddir(struct thread_data *td, enum fio_ddir ddir) |
643 | { | |
644 | enum fio_ddir odir = ddir ^ 1; | |
50a8ce86 | 645 | long usec, now; |
581e7141 | 646 | |
ff58fced | 647 | assert(ddir_rw(ddir)); |
50a8ce86 | 648 | now = utime_since_now(&td->start); |
ff58fced | 649 | |
50a8ce86 D |
650 | /* |
651 | * if rate_next_io_time is in the past, need to catch up to rate | |
652 | */ | |
653 | if (td->rate_next_io_time[ddir] <= now) | |
581e7141 JA |
654 | return ddir; |
655 | ||
656 | /* | |
50a8ce86 | 657 | * We are ahead of rate in this direction. See if we |
581e7141 JA |
658 | * should switch. |
659 | */ | |
315fcfec | 660 | if (td_rw(td) && td->o.rwmix[odir]) { |
581e7141 | 661 | /* |
50a8ce86 | 662 | * Other direction is behind rate, switch |
581e7141 | 663 | */ |
50a8ce86 | 664 | if (td->rate_next_io_time[odir] <= now) |
581e7141 JA |
665 | return odir; |
666 | ||
667 | /* | |
50a8ce86 D |
668 | * Both directions are ahead of rate. sleep the min |
669 | * switch if necissary | |
581e7141 | 670 | */ |
50a8ce86 D |
671 | if (td->rate_next_io_time[ddir] <= |
672 | td->rate_next_io_time[odir]) { | |
673 | usec = td->rate_next_io_time[ddir] - now; | |
581e7141 | 674 | } else { |
50a8ce86 | 675 | usec = td->rate_next_io_time[odir] - now; |
581e7141 JA |
676 | ddir = odir; |
677 | } | |
678 | } else | |
50a8ce86 | 679 | usec = td->rate_next_io_time[ddir] - now; |
581e7141 | 680 | |
a9da8ab2 JA |
681 | if (td->o.io_submit_mode == IO_MODE_INLINE) |
682 | io_u_quiesce(td); | |
78c1eda5 | 683 | |
9cc80b6d | 684 | usec = usec_sleep(td, usec); |
581e7141 | 685 | |
581e7141 JA |
686 | return ddir; |
687 | } | |
688 | ||
10ba535a JA |
689 | /* |
690 | * Return the data direction for the next io_u. If the job is a | |
691 | * mixed read/write workload, check the rwmix cycle and switch if | |
692 | * necessary. | |
693 | */ | |
1e97cce9 | 694 | static enum fio_ddir get_rw_ddir(struct thread_data *td) |
10ba535a | 695 | { |
581e7141 JA |
696 | enum fio_ddir ddir; |
697 | ||
5f9099ea JA |
698 | /* |
699 | * see if it's time to fsync | |
700 | */ | |
701 | if (td->o.fsync_blocks && | |
702 | !(td->io_issues[DDIR_WRITE] % td->o.fsync_blocks) && | |
703 | td->io_issues[DDIR_WRITE] && should_fsync(td)) | |
704 | return DDIR_SYNC; | |
705 | ||
706 | /* | |
707 | * see if it's time to fdatasync | |
708 | */ | |
709 | if (td->o.fdatasync_blocks && | |
710 | !(td->io_issues[DDIR_WRITE] % td->o.fdatasync_blocks) && | |
711 | td->io_issues[DDIR_WRITE] && should_fsync(td)) | |
712 | return DDIR_DATASYNC; | |
713 | ||
44f29692 JA |
714 | /* |
715 | * see if it's time to sync_file_range | |
716 | */ | |
717 | if (td->sync_file_range_nr && | |
718 | !(td->io_issues[DDIR_WRITE] % td->sync_file_range_nr) && | |
719 | td->io_issues[DDIR_WRITE] && should_fsync(td)) | |
720 | return DDIR_SYNC_FILE_RANGE; | |
721 | ||
10ba535a | 722 | if (td_rw(td)) { |
10ba535a JA |
723 | /* |
724 | * Check if it's time to seed a new data direction. | |
725 | */ | |
e4928662 | 726 | if (td->io_issues[td->rwmix_ddir] >= td->rwmix_issues) { |
e47f799f JA |
727 | /* |
728 | * Put a top limit on how many bytes we do for | |
729 | * one data direction, to avoid overflowing the | |
730 | * ranges too much | |
731 | */ | |
732 | ddir = get_rand_ddir(td); | |
e47f799f JA |
733 | |
734 | if (ddir != td->rwmix_ddir) | |
735 | set_rwmix_bytes(td); | |
736 | ||
737 | td->rwmix_ddir = ddir; | |
10ba535a | 738 | } |
581e7141 | 739 | ddir = td->rwmix_ddir; |
10ba535a | 740 | } else if (td_read(td)) |
581e7141 | 741 | ddir = DDIR_READ; |
6eaf09d6 | 742 | else if (td_write(td)) |
581e7141 | 743 | ddir = DDIR_WRITE; |
6eaf09d6 SL |
744 | else |
745 | ddir = DDIR_TRIM; | |
581e7141 JA |
746 | |
747 | td->rwmix_ddir = rate_ddir(td, ddir); | |
748 | return td->rwmix_ddir; | |
10ba535a JA |
749 | } |
750 | ||
1ef2b6be JA |
751 | static void set_rw_ddir(struct thread_data *td, struct io_u *io_u) |
752 | { | |
0e4dd95c DE |
753 | enum fio_ddir ddir = get_rw_ddir(td); |
754 | ||
82a90686 | 755 | if (td_trimwrite(td)) { |
0e4dd95c DE |
756 | struct fio_file *f = io_u->file; |
757 | if (f->last_pos[DDIR_WRITE] == f->last_pos[DDIR_TRIM]) | |
758 | ddir = DDIR_TRIM; | |
759 | else | |
760 | ddir = DDIR_WRITE; | |
761 | } | |
762 | ||
763 | io_u->ddir = io_u->acct_ddir = ddir; | |
1ef2b6be JA |
764 | |
765 | if (io_u->ddir == DDIR_WRITE && (td->io_ops->flags & FIO_BARRIER) && | |
766 | td->o.barrier_blocks && | |
767 | !(td->io_issues[DDIR_WRITE] % td->o.barrier_blocks) && | |
768 | td->io_issues[DDIR_WRITE]) | |
a9da8ab2 | 769 | io_u_set(io_u, IO_U_F_BARRIER); |
1ef2b6be JA |
770 | } |
771 | ||
e8462bd8 | 772 | void put_file_log(struct thread_data *td, struct fio_file *f) |
60f2c658 | 773 | { |
71b84caa | 774 | unsigned int ret = put_file(td, f); |
60f2c658 JA |
775 | |
776 | if (ret) | |
777 | td_verror(td, ret, "file close"); | |
778 | } | |
779 | ||
10ba535a JA |
780 | void put_io_u(struct thread_data *td, struct io_u *io_u) |
781 | { | |
a9da8ab2 JA |
782 | if (td->parent) |
783 | td = td->parent; | |
784 | ||
e8462bd8 JA |
785 | td_io_u_lock(td); |
786 | ||
f8b0bd10 | 787 | if (io_u->file && !(io_u->flags & IO_U_F_NO_FILE_PUT)) |
60f2c658 | 788 | put_file_log(td, io_u->file); |
f8b0bd10 | 789 | |
10ba535a | 790 | io_u->file = NULL; |
a9da8ab2 | 791 | io_u_set(io_u, IO_U_F_FREE); |
d7ee2a7d | 792 | |
a9da8ab2 | 793 | if (io_u->flags & IO_U_F_IN_CUR_DEPTH) { |
0c41214f | 794 | td->cur_depth--; |
a9da8ab2 JA |
795 | assert(!(td->flags & TD_F_CHILD)); |
796 | } | |
2ae0b204 | 797 | io_u_qpush(&td->io_u_freelist, io_u); |
e8462bd8 JA |
798 | td_io_u_unlock(td); |
799 | td_io_u_free_notify(td); | |
10ba535a JA |
800 | } |
801 | ||
f2bba182 RR |
802 | void clear_io_u(struct thread_data *td, struct io_u *io_u) |
803 | { | |
a9da8ab2 | 804 | io_u_clear(io_u, IO_U_F_FLIGHT); |
f2bba182 RR |
805 | put_io_u(td, io_u); |
806 | } | |
807 | ||
755200a3 JA |
808 | void requeue_io_u(struct thread_data *td, struct io_u **io_u) |
809 | { | |
810 | struct io_u *__io_u = *io_u; | |
bcd5abfa | 811 | enum fio_ddir ddir = acct_ddir(__io_u); |
755200a3 | 812 | |
465221b0 JA |
813 | dprint(FD_IO, "requeue %p\n", __io_u); |
814 | ||
a9da8ab2 JA |
815 | if (td->parent) |
816 | td = td->parent; | |
817 | ||
e8462bd8 JA |
818 | td_io_u_lock(td); |
819 | ||
a9da8ab2 | 820 | io_u_set(__io_u, IO_U_F_FREE); |
bcd5abfa JA |
821 | if ((__io_u->flags & IO_U_F_FLIGHT) && ddir_rw(ddir)) |
822 | td->io_issues[ddir]--; | |
5ec10eaa | 823 | |
a9da8ab2 JA |
824 | io_u_clear(__io_u, IO_U_F_FLIGHT); |
825 | if (__io_u->flags & IO_U_F_IN_CUR_DEPTH) { | |
0c41214f | 826 | td->cur_depth--; |
a9da8ab2 JA |
827 | assert(!(td->flags & TD_F_CHILD)); |
828 | } | |
2ae0b204 JA |
829 | |
830 | io_u_rpush(&td->io_u_requeues, __io_u); | |
e8462bd8 | 831 | td_io_u_unlock(td); |
a9da8ab2 | 832 | td_io_u_free_notify(td); |
755200a3 JA |
833 | *io_u = NULL; |
834 | } | |
835 | ||
9bf2061e | 836 | static int fill_io_u(struct thread_data *td, struct io_u *io_u) |
10ba535a | 837 | { |
6aca9b3d JA |
838 | unsigned int is_random; |
839 | ||
b4c5e1ac JA |
840 | if (td->io_ops->flags & FIO_NOIO) |
841 | goto out; | |
842 | ||
1ef2b6be | 843 | set_rw_ddir(td, io_u); |
5f9099ea | 844 | |
87dc1ab1 | 845 | /* |
ff58fced | 846 | * fsync() or fdatasync() or trim etc, we are done |
87dc1ab1 | 847 | */ |
ff58fced | 848 | if (!ddir_rw(io_u->ddir)) |
c38e9468 | 849 | goto out; |
a00735e6 | 850 | |
48f5abd3 JA |
851 | /* |
852 | * See if it's time to switch to a new zone | |
853 | */ | |
13af05ae | 854 | if (td->zone_bytes >= td->o.zone_size && td->o.zone_skip) { |
4c8be5b1 JA |
855 | struct fio_file *f = io_u->file; |
856 | ||
48f5abd3 | 857 | td->zone_bytes = 0; |
4c8be5b1 JA |
858 | f->file_offset += td->o.zone_range + td->o.zone_skip; |
859 | ||
860 | /* | |
861 | * Wrap from the beginning, if we exceed the file size | |
862 | */ | |
863 | if (f->file_offset >= f->real_file_size) | |
864 | f->file_offset = f->real_file_size - f->file_offset; | |
f1dfb668 | 865 | f->last_pos[io_u->ddir] = f->file_offset; |
48f5abd3 JA |
866 | td->io_skip_bytes += td->o.zone_skip; |
867 | } | |
868 | ||
10ba535a | 869 | /* |
c685b5b2 JA |
870 | * No log, let the seq/rand engine retrieve the next buflen and |
871 | * position. | |
10ba535a | 872 | */ |
6aca9b3d | 873 | if (get_next_offset(td, io_u, &is_random)) { |
2ba1c290 | 874 | dprint(FD_IO, "io_u %p, failed getting offset\n", io_u); |
bca4ed4d | 875 | return 1; |
2ba1c290 | 876 | } |
10ba535a | 877 | |
6aca9b3d | 878 | io_u->buflen = get_next_buflen(td, io_u, is_random); |
2ba1c290 JA |
879 | if (!io_u->buflen) { |
880 | dprint(FD_IO, "io_u %p, failed getting buflen\n", io_u); | |
bca4ed4d | 881 | return 1; |
2ba1c290 | 882 | } |
bca4ed4d | 883 | |
2ba1c290 JA |
884 | if (io_u->offset + io_u->buflen > io_u->file->real_file_size) { |
885 | dprint(FD_IO, "io_u %p, offset too large\n", io_u); | |
4b91ee8f JA |
886 | dprint(FD_IO, " off=%llu/%lu > %llu\n", |
887 | (unsigned long long) io_u->offset, io_u->buflen, | |
888 | (unsigned long long) io_u->file->real_file_size); | |
6a5e6884 | 889 | return 1; |
2ba1c290 | 890 | } |
6a5e6884 | 891 | |
bca4ed4d JA |
892 | /* |
893 | * mark entry before potentially trimming io_u | |
894 | */ | |
303032ae | 895 | if (td_random(td) && file_randommap(td, io_u->file)) |
9bf2061e | 896 | mark_random_map(td, io_u); |
bca4ed4d | 897 | |
c38e9468 | 898 | out: |
2ba1c290 | 899 | dprint_io_u(io_u, "fill_io_u"); |
d9d91e39 | 900 | td->zone_bytes += io_u->buflen; |
bca4ed4d | 901 | return 0; |
10ba535a JA |
902 | } |
903 | ||
838bc709 JA |
904 | static void __io_u_mark_map(unsigned int *map, unsigned int nr) |
905 | { | |
2b13e716 | 906 | int idx = 0; |
838bc709 JA |
907 | |
908 | switch (nr) { | |
909 | default: | |
2b13e716 | 910 | idx = 6; |
838bc709 JA |
911 | break; |
912 | case 33 ... 64: | |
2b13e716 | 913 | idx = 5; |
838bc709 JA |
914 | break; |
915 | case 17 ... 32: | |
2b13e716 | 916 | idx = 4; |
838bc709 JA |
917 | break; |
918 | case 9 ... 16: | |
2b13e716 | 919 | idx = 3; |
838bc709 JA |
920 | break; |
921 | case 5 ... 8: | |
2b13e716 | 922 | idx = 2; |
838bc709 JA |
923 | break; |
924 | case 1 ... 4: | |
2b13e716 | 925 | idx = 1; |
838bc709 JA |
926 | case 0: |
927 | break; | |
928 | } | |
929 | ||
2b13e716 | 930 | map[idx]++; |
838bc709 JA |
931 | } |
932 | ||
933 | void io_u_mark_submit(struct thread_data *td, unsigned int nr) | |
934 | { | |
935 | __io_u_mark_map(td->ts.io_u_submit, nr); | |
936 | td->ts.total_submit++; | |
937 | } | |
938 | ||
939 | void io_u_mark_complete(struct thread_data *td, unsigned int nr) | |
940 | { | |
941 | __io_u_mark_map(td->ts.io_u_complete, nr); | |
942 | td->ts.total_complete++; | |
943 | } | |
944 | ||
d8005759 | 945 | void io_u_mark_depth(struct thread_data *td, unsigned int nr) |
71619dc2 | 946 | { |
2b13e716 | 947 | int idx = 0; |
71619dc2 JA |
948 | |
949 | switch (td->cur_depth) { | |
950 | default: | |
2b13e716 | 951 | idx = 6; |
a783e61a | 952 | break; |
71619dc2 | 953 | case 32 ... 63: |
2b13e716 | 954 | idx = 5; |
a783e61a | 955 | break; |
71619dc2 | 956 | case 16 ... 31: |
2b13e716 | 957 | idx = 4; |
a783e61a | 958 | break; |
71619dc2 | 959 | case 8 ... 15: |
2b13e716 | 960 | idx = 3; |
a783e61a | 961 | break; |
71619dc2 | 962 | case 4 ... 7: |
2b13e716 | 963 | idx = 2; |
a783e61a | 964 | break; |
71619dc2 | 965 | case 2 ... 3: |
2b13e716 | 966 | idx = 1; |
71619dc2 JA |
967 | case 1: |
968 | break; | |
969 | } | |
970 | ||
2b13e716 | 971 | td->ts.io_u_map[idx] += nr; |
71619dc2 JA |
972 | } |
973 | ||
04a0feae JA |
974 | static void io_u_mark_lat_usec(struct thread_data *td, unsigned long usec) |
975 | { | |
2b13e716 | 976 | int idx = 0; |
04a0feae JA |
977 | |
978 | assert(usec < 1000); | |
979 | ||
980 | switch (usec) { | |
981 | case 750 ... 999: | |
2b13e716 | 982 | idx = 9; |
04a0feae JA |
983 | break; |
984 | case 500 ... 749: | |
2b13e716 | 985 | idx = 8; |
04a0feae JA |
986 | break; |
987 | case 250 ... 499: | |
2b13e716 | 988 | idx = 7; |
04a0feae JA |
989 | break; |
990 | case 100 ... 249: | |
2b13e716 | 991 | idx = 6; |
04a0feae JA |
992 | break; |
993 | case 50 ... 99: | |
2b13e716 | 994 | idx = 5; |
04a0feae JA |
995 | break; |
996 | case 20 ... 49: | |
2b13e716 | 997 | idx = 4; |
04a0feae JA |
998 | break; |
999 | case 10 ... 19: | |
2b13e716 | 1000 | idx = 3; |
04a0feae JA |
1001 | break; |
1002 | case 4 ... 9: | |
2b13e716 | 1003 | idx = 2; |
04a0feae JA |
1004 | break; |
1005 | case 2 ... 3: | |
2b13e716 | 1006 | idx = 1; |
04a0feae JA |
1007 | case 0 ... 1: |
1008 | break; | |
1009 | } | |
1010 | ||
2b13e716 JA |
1011 | assert(idx < FIO_IO_U_LAT_U_NR); |
1012 | td->ts.io_u_lat_u[idx]++; | |
04a0feae JA |
1013 | } |
1014 | ||
1015 | static void io_u_mark_lat_msec(struct thread_data *td, unsigned long msec) | |
ec118304 | 1016 | { |
2b13e716 | 1017 | int idx = 0; |
ec118304 JA |
1018 | |
1019 | switch (msec) { | |
1020 | default: | |
2b13e716 | 1021 | idx = 11; |
04a0feae | 1022 | break; |
8abdce66 | 1023 | case 1000 ... 1999: |
2b13e716 | 1024 | idx = 10; |
04a0feae | 1025 | break; |
8abdce66 | 1026 | case 750 ... 999: |
2b13e716 | 1027 | idx = 9; |
04a0feae | 1028 | break; |
8abdce66 | 1029 | case 500 ... 749: |
2b13e716 | 1030 | idx = 8; |
04a0feae | 1031 | break; |
8abdce66 | 1032 | case 250 ... 499: |
2b13e716 | 1033 | idx = 7; |
04a0feae | 1034 | break; |
8abdce66 | 1035 | case 100 ... 249: |
2b13e716 | 1036 | idx = 6; |
04a0feae | 1037 | break; |
8abdce66 | 1038 | case 50 ... 99: |
2b13e716 | 1039 | idx = 5; |
04a0feae | 1040 | break; |
8abdce66 | 1041 | case 20 ... 49: |
2b13e716 | 1042 | idx = 4; |
04a0feae | 1043 | break; |
8abdce66 | 1044 | case 10 ... 19: |
2b13e716 | 1045 | idx = 3; |
04a0feae | 1046 | break; |
8abdce66 | 1047 | case 4 ... 9: |
2b13e716 | 1048 | idx = 2; |
04a0feae | 1049 | break; |
ec118304 | 1050 | case 2 ... 3: |
2b13e716 | 1051 | idx = 1; |
ec118304 JA |
1052 | case 0 ... 1: |
1053 | break; | |
1054 | } | |
1055 | ||
2b13e716 JA |
1056 | assert(idx < FIO_IO_U_LAT_M_NR); |
1057 | td->ts.io_u_lat_m[idx]++; | |
04a0feae JA |
1058 | } |
1059 | ||
1060 | static void io_u_mark_latency(struct thread_data *td, unsigned long usec) | |
1061 | { | |
1062 | if (usec < 1000) | |
1063 | io_u_mark_lat_usec(td, usec); | |
1064 | else | |
1065 | io_u_mark_lat_msec(td, usec / 1000); | |
ec118304 JA |
1066 | } |
1067 | ||
0aabe160 JA |
1068 | /* |
1069 | * Get next file to service by choosing one at random | |
1070 | */ | |
2cc52930 JA |
1071 | static struct fio_file *get_next_file_rand(struct thread_data *td, |
1072 | enum fio_file_flags goodf, | |
d6aed795 | 1073 | enum fio_file_flags badf) |
0aabe160 | 1074 | { |
c3546b53 | 1075 | uint64_t frand_max = rand_max(&td->next_file_state); |
0aabe160 | 1076 | struct fio_file *f; |
1c178180 | 1077 | int fno; |
0aabe160 JA |
1078 | |
1079 | do { | |
87b10676 | 1080 | int opened = 0; |
1294c3ec | 1081 | unsigned long r; |
4c07ad86 | 1082 | |
d6b72507 | 1083 | r = __rand(&td->next_file_state); |
54a21917 | 1084 | fno = (unsigned int) ((double) td->o.nr_files |
c3546b53 | 1085 | * (r / (frand_max + 1.0))); |
7c83c089 | 1086 | |
126d65c6 | 1087 | f = td->files[fno]; |
d6aed795 | 1088 | if (fio_file_done(f)) |
059e63c0 | 1089 | continue; |
1c178180 | 1090 | |
d6aed795 | 1091 | if (!fio_file_open(f)) { |
87b10676 JA |
1092 | int err; |
1093 | ||
002fe734 JA |
1094 | if (td->nr_open_files >= td->o.open_files) |
1095 | return ERR_PTR(-EBUSY); | |
1096 | ||
87b10676 JA |
1097 | err = td_io_open_file(td, f); |
1098 | if (err) | |
1099 | continue; | |
1100 | opened = 1; | |
1101 | } | |
1102 | ||
2ba1c290 JA |
1103 | if ((!goodf || (f->flags & goodf)) && !(f->flags & badf)) { |
1104 | dprint(FD_FILE, "get_next_file_rand: %p\n", f); | |
0aabe160 | 1105 | return f; |
2ba1c290 | 1106 | } |
87b10676 JA |
1107 | if (opened) |
1108 | td_io_close_file(td, f); | |
0aabe160 JA |
1109 | } while (1); |
1110 | } | |
1111 | ||
1112 | /* | |
1113 | * Get next file to service by doing round robin between all available ones | |
1114 | */ | |
1c178180 JA |
1115 | static struct fio_file *get_next_file_rr(struct thread_data *td, int goodf, |
1116 | int badf) | |
3d7c391d JA |
1117 | { |
1118 | unsigned int old_next_file = td->next_file; | |
1119 | struct fio_file *f; | |
1120 | ||
1121 | do { | |
87b10676 JA |
1122 | int opened = 0; |
1123 | ||
126d65c6 | 1124 | f = td->files[td->next_file]; |
3d7c391d JA |
1125 | |
1126 | td->next_file++; | |
2dc1bbeb | 1127 | if (td->next_file >= td->o.nr_files) |
3d7c391d JA |
1128 | td->next_file = 0; |
1129 | ||
87b10676 | 1130 | dprint(FD_FILE, "trying file %s %x\n", f->file_name, f->flags); |
d6aed795 | 1131 | if (fio_file_done(f)) { |
d5ed68ea | 1132 | f = NULL; |
059e63c0 | 1133 | continue; |
d5ed68ea | 1134 | } |
059e63c0 | 1135 | |
d6aed795 | 1136 | if (!fio_file_open(f)) { |
87b10676 JA |
1137 | int err; |
1138 | ||
002fe734 JA |
1139 | if (td->nr_open_files >= td->o.open_files) |
1140 | return ERR_PTR(-EBUSY); | |
1141 | ||
87b10676 | 1142 | err = td_io_open_file(td, f); |
b5696bfc JA |
1143 | if (err) { |
1144 | dprint(FD_FILE, "error %d on open of %s\n", | |
1145 | err, f->file_name); | |
87c27b45 | 1146 | f = NULL; |
87b10676 | 1147 | continue; |
b5696bfc | 1148 | } |
87b10676 JA |
1149 | opened = 1; |
1150 | } | |
1151 | ||
0b9d69ec JA |
1152 | dprint(FD_FILE, "goodf=%x, badf=%x, ff=%x\n", goodf, badf, |
1153 | f->flags); | |
1c178180 | 1154 | if ((!goodf || (f->flags & goodf)) && !(f->flags & badf)) |
3d7c391d JA |
1155 | break; |
1156 | ||
87b10676 JA |
1157 | if (opened) |
1158 | td_io_close_file(td, f); | |
1159 | ||
3d7c391d JA |
1160 | f = NULL; |
1161 | } while (td->next_file != old_next_file); | |
1162 | ||
2ba1c290 | 1163 | dprint(FD_FILE, "get_next_file_rr: %p\n", f); |
3d7c391d JA |
1164 | return f; |
1165 | } | |
1166 | ||
7eb36574 | 1167 | static struct fio_file *__get_next_file(struct thread_data *td) |
bdb4e2e9 | 1168 | { |
1907dbc6 JA |
1169 | struct fio_file *f; |
1170 | ||
2dc1bbeb | 1171 | assert(td->o.nr_files <= td->files_index); |
1c178180 | 1172 | |
b5696bfc | 1173 | if (td->nr_done_files >= td->o.nr_files) { |
5ec10eaa JA |
1174 | dprint(FD_FILE, "get_next_file: nr_open=%d, nr_done=%d," |
1175 | " nr_files=%d\n", td->nr_open_files, | |
1176 | td->nr_done_files, | |
1177 | td->o.nr_files); | |
bdb4e2e9 | 1178 | return NULL; |
2ba1c290 | 1179 | } |
bdb4e2e9 | 1180 | |
1907dbc6 | 1181 | f = td->file_service_file; |
d6aed795 | 1182 | if (f && fio_file_open(f) && !fio_file_closing(f)) { |
a086c257 JA |
1183 | if (td->o.file_service_type == FIO_FSERVICE_SEQ) |
1184 | goto out; | |
1185 | if (td->file_service_left--) | |
1186 | goto out; | |
1187 | } | |
1907dbc6 | 1188 | |
a086c257 JA |
1189 | if (td->o.file_service_type == FIO_FSERVICE_RR || |
1190 | td->o.file_service_type == FIO_FSERVICE_SEQ) | |
d6aed795 | 1191 | f = get_next_file_rr(td, FIO_FILE_open, FIO_FILE_closing); |
bdb4e2e9 | 1192 | else |
d6aed795 | 1193 | f = get_next_file_rand(td, FIO_FILE_open, FIO_FILE_closing); |
1907dbc6 | 1194 | |
002fe734 JA |
1195 | if (IS_ERR(f)) |
1196 | return f; | |
1197 | ||
1907dbc6 JA |
1198 | td->file_service_file = f; |
1199 | td->file_service_left = td->file_service_nr - 1; | |
2ba1c290 | 1200 | out: |
0dac421f JA |
1201 | if (f) |
1202 | dprint(FD_FILE, "get_next_file: %p [%s]\n", f, f->file_name); | |
1203 | else | |
1204 | dprint(FD_FILE, "get_next_file: NULL\n"); | |
1907dbc6 | 1205 | return f; |
bdb4e2e9 JA |
1206 | } |
1207 | ||
7eb36574 JA |
1208 | static struct fio_file *get_next_file(struct thread_data *td) |
1209 | { | |
372d8962 | 1210 | if (td->flags & TD_F_PROFILE_OPS) { |
d72be545 | 1211 | struct prof_io_ops *ops = &td->prof_io_ops; |
7eb36574 | 1212 | |
d72be545 JA |
1213 | if (ops->get_next_file) |
1214 | return ops->get_next_file(td); | |
1215 | } | |
7eb36574 JA |
1216 | |
1217 | return __get_next_file(td); | |
1218 | } | |
1219 | ||
002fe734 | 1220 | static long set_io_u_file(struct thread_data *td, struct io_u *io_u) |
429f6675 JA |
1221 | { |
1222 | struct fio_file *f; | |
1223 | ||
1224 | do { | |
1225 | f = get_next_file(td); | |
002fe734 JA |
1226 | if (IS_ERR_OR_NULL(f)) |
1227 | return PTR_ERR(f); | |
429f6675 | 1228 | |
429f6675 JA |
1229 | io_u->file = f; |
1230 | get_file(f); | |
1231 | ||
1232 | if (!fill_io_u(td, io_u)) | |
1233 | break; | |
1234 | ||
b5696bfc | 1235 | put_file_log(td, f); |
429f6675 | 1236 | td_io_close_file(td, f); |
b5696bfc | 1237 | io_u->file = NULL; |
d6aed795 | 1238 | fio_file_set_done(f); |
429f6675 | 1239 | td->nr_done_files++; |
0b9d69ec JA |
1240 | dprint(FD_FILE, "%s: is done (%d of %d)\n", f->file_name, |
1241 | td->nr_done_files, td->o.nr_files); | |
429f6675 JA |
1242 | } while (1); |
1243 | ||
1244 | return 0; | |
1245 | } | |
1246 | ||
3e260a46 JA |
1247 | static void lat_fatal(struct thread_data *td, struct io_completion_data *icd, |
1248 | unsigned long tusec, unsigned long max_usec) | |
1249 | { | |
1250 | if (!td->error) | |
1251 | log_err("fio: latency of %lu usec exceeds specified max (%lu usec)\n", tusec, max_usec); | |
1252 | td_verror(td, ETIMEDOUT, "max latency exceeded"); | |
1253 | icd->error = ETIMEDOUT; | |
1254 | } | |
1255 | ||
1256 | static void lat_new_cycle(struct thread_data *td) | |
1257 | { | |
1258 | fio_gettime(&td->latency_ts, NULL); | |
1259 | td->latency_ios = ddir_rw_sum(td->io_blocks); | |
1260 | td->latency_failed = 0; | |
1261 | } | |
1262 | ||
1263 | /* | |
1264 | * We had an IO outside the latency target. Reduce the queue depth. If we | |
1265 | * are at QD=1, then it's time to give up. | |
1266 | */ | |
e39c0676 | 1267 | static bool __lat_target_failed(struct thread_data *td) |
3e260a46 JA |
1268 | { |
1269 | if (td->latency_qd == 1) | |
e39c0676 | 1270 | return true; |
3e260a46 JA |
1271 | |
1272 | td->latency_qd_high = td->latency_qd; | |
6bb58215 JA |
1273 | |
1274 | if (td->latency_qd == td->latency_qd_low) | |
1275 | td->latency_qd_low--; | |
1276 | ||
3e260a46 JA |
1277 | td->latency_qd = (td->latency_qd + td->latency_qd_low) / 2; |
1278 | ||
1279 | dprint(FD_RATE, "Ramped down: %d %d %d\n", td->latency_qd_low, td->latency_qd, td->latency_qd_high); | |
1280 | ||
1281 | /* | |
1282 | * When we ramp QD down, quiesce existing IO to prevent | |
1283 | * a storm of ramp downs due to pending higher depth. | |
1284 | */ | |
1285 | io_u_quiesce(td); | |
1286 | lat_new_cycle(td); | |
e39c0676 | 1287 | return false; |
3e260a46 JA |
1288 | } |
1289 | ||
e39c0676 | 1290 | static bool lat_target_failed(struct thread_data *td) |
3e260a46 JA |
1291 | { |
1292 | if (td->o.latency_percentile.u.f == 100.0) | |
1293 | return __lat_target_failed(td); | |
1294 | ||
1295 | td->latency_failed++; | |
e39c0676 | 1296 | return false; |
3e260a46 JA |
1297 | } |
1298 | ||
1299 | void lat_target_init(struct thread_data *td) | |
1300 | { | |
6bb58215 JA |
1301 | td->latency_end_run = 0; |
1302 | ||
3e260a46 JA |
1303 | if (td->o.latency_target) { |
1304 | dprint(FD_RATE, "Latency target=%llu\n", td->o.latency_target); | |
1305 | fio_gettime(&td->latency_ts, NULL); | |
1306 | td->latency_qd = 1; | |
1307 | td->latency_qd_high = td->o.iodepth; | |
1308 | td->latency_qd_low = 1; | |
1309 | td->latency_ios = ddir_rw_sum(td->io_blocks); | |
1310 | } else | |
1311 | td->latency_qd = td->o.iodepth; | |
1312 | } | |
1313 | ||
6bb58215 JA |
1314 | void lat_target_reset(struct thread_data *td) |
1315 | { | |
1316 | if (!td->latency_end_run) | |
1317 | lat_target_init(td); | |
1318 | } | |
1319 | ||
3e260a46 JA |
1320 | static void lat_target_success(struct thread_data *td) |
1321 | { | |
1322 | const unsigned int qd = td->latency_qd; | |
6bb58215 | 1323 | struct thread_options *o = &td->o; |
3e260a46 JA |
1324 | |
1325 | td->latency_qd_low = td->latency_qd; | |
1326 | ||
1327 | /* | |
1328 | * If we haven't failed yet, we double up to a failing value instead | |
1329 | * of bisecting from highest possible queue depth. If we have set | |
1330 | * a limit other than td->o.iodepth, bisect between that. | |
1331 | */ | |
6bb58215 | 1332 | if (td->latency_qd_high != o->iodepth) |
3e260a46 JA |
1333 | td->latency_qd = (td->latency_qd + td->latency_qd_high) / 2; |
1334 | else | |
1335 | td->latency_qd *= 2; | |
1336 | ||
6bb58215 JA |
1337 | if (td->latency_qd > o->iodepth) |
1338 | td->latency_qd = o->iodepth; | |
3e260a46 JA |
1339 | |
1340 | dprint(FD_RATE, "Ramped up: %d %d %d\n", td->latency_qd_low, td->latency_qd, td->latency_qd_high); | |
6bb58215 | 1341 | |
3e260a46 | 1342 | /* |
6bb58215 JA |
1343 | * Same as last one, we are done. Let it run a latency cycle, so |
1344 | * we get only the results from the targeted depth. | |
3e260a46 | 1345 | */ |
6bb58215 JA |
1346 | if (td->latency_qd == qd) { |
1347 | if (td->latency_end_run) { | |
1348 | dprint(FD_RATE, "We are done\n"); | |
1349 | td->done = 1; | |
1350 | } else { | |
1351 | dprint(FD_RATE, "Quiesce and final run\n"); | |
1352 | io_u_quiesce(td); | |
1353 | td->latency_end_run = 1; | |
1354 | reset_all_stats(td); | |
1355 | reset_io_stats(td); | |
1356 | } | |
1357 | } | |
3e260a46 JA |
1358 | |
1359 | lat_new_cycle(td); | |
1360 | } | |
1361 | ||
1362 | /* | |
1363 | * Check if we can bump the queue depth | |
1364 | */ | |
1365 | void lat_target_check(struct thread_data *td) | |
1366 | { | |
1367 | uint64_t usec_window; | |
1368 | uint64_t ios; | |
1369 | double success_ios; | |
1370 | ||
1371 | usec_window = utime_since_now(&td->latency_ts); | |
1372 | if (usec_window < td->o.latency_window) | |
1373 | return; | |
1374 | ||
1375 | ios = ddir_rw_sum(td->io_blocks) - td->latency_ios; | |
1376 | success_ios = (double) (ios - td->latency_failed) / (double) ios; | |
1377 | success_ios *= 100.0; | |
1378 | ||
1379 | dprint(FD_RATE, "Success rate: %.2f%% (target %.2f%%)\n", success_ios, td->o.latency_percentile.u.f); | |
1380 | ||
1381 | if (success_ios >= td->o.latency_percentile.u.f) | |
1382 | lat_target_success(td); | |
1383 | else | |
1384 | __lat_target_failed(td); | |
1385 | } | |
1386 | ||
1387 | /* | |
1388 | * If latency target is enabled, we might be ramping up or down and not | |
1389 | * using the full queue depth available. | |
1390 | */ | |
e39c0676 | 1391 | bool queue_full(const struct thread_data *td) |
3e260a46 JA |
1392 | { |
1393 | const int qempty = io_u_qempty(&td->io_u_freelist); | |
1394 | ||
1395 | if (qempty) | |
e39c0676 | 1396 | return true; |
3e260a46 | 1397 | if (!td->o.latency_target) |
e39c0676 | 1398 | return false; |
3e260a46 JA |
1399 | |
1400 | return td->cur_depth >= td->latency_qd; | |
1401 | } | |
429f6675 | 1402 | |
10ba535a JA |
1403 | struct io_u *__get_io_u(struct thread_data *td) |
1404 | { | |
0cae66f6 | 1405 | struct io_u *io_u = NULL; |
10ba535a | 1406 | |
ca09be4b JA |
1407 | if (td->stop_io) |
1408 | return NULL; | |
1409 | ||
e8462bd8 JA |
1410 | td_io_u_lock(td); |
1411 | ||
1412 | again: | |
2ae0b204 JA |
1413 | if (!io_u_rempty(&td->io_u_requeues)) |
1414 | io_u = io_u_rpop(&td->io_u_requeues); | |
3e260a46 | 1415 | else if (!queue_full(td)) { |
2ae0b204 | 1416 | io_u = io_u_qpop(&td->io_u_freelist); |
10ba535a | 1417 | |
225ba9e3 | 1418 | io_u->file = NULL; |
6040dabc | 1419 | io_u->buflen = 0; |
10ba535a | 1420 | io_u->resid = 0; |
d7762cf8 | 1421 | io_u->end_io = NULL; |
755200a3 JA |
1422 | } |
1423 | ||
1424 | if (io_u) { | |
0c6e7517 | 1425 | assert(io_u->flags & IO_U_F_FREE); |
a9da8ab2 | 1426 | io_u_clear(io_u, IO_U_F_FREE | IO_U_F_NO_FILE_PUT | |
f8b0bd10 JA |
1427 | IO_U_F_TRIMMED | IO_U_F_BARRIER | |
1428 | IO_U_F_VER_LIST); | |
0c6e7517 | 1429 | |
755200a3 | 1430 | io_u->error = 0; |
bcd5abfa | 1431 | io_u->acct_ddir = -1; |
10ba535a | 1432 | td->cur_depth++; |
a9da8ab2 JA |
1433 | assert(!(td->flags & TD_F_CHILD)); |
1434 | io_u_set(io_u, IO_U_F_IN_CUR_DEPTH); | |
f9401285 | 1435 | io_u->ipo = NULL; |
a9da8ab2 | 1436 | } else if (td_async_processing(td)) { |
1dec3e07 JA |
1437 | /* |
1438 | * We ran out, wait for async verify threads to finish and | |
1439 | * return one | |
1440 | */ | |
a9da8ab2 JA |
1441 | assert(!(td->flags & TD_F_CHILD)); |
1442 | assert(!pthread_cond_wait(&td->free_cond, &td->io_u_lock)); | |
1dec3e07 | 1443 | goto again; |
10ba535a JA |
1444 | } |
1445 | ||
e8462bd8 | 1446 | td_io_u_unlock(td); |
10ba535a JA |
1447 | return io_u; |
1448 | } | |
1449 | ||
e39c0676 | 1450 | static bool check_get_trim(struct thread_data *td, struct io_u *io_u) |
10ba535a | 1451 | { |
d72be545 | 1452 | if (!(td->flags & TD_F_TRIM_BACKLOG)) |
e39c0676 | 1453 | return false; |
d72be545 JA |
1454 | |
1455 | if (td->trim_entries) { | |
0d29de83 | 1456 | int get_trim = 0; |
10ba535a | 1457 | |
0d29de83 JA |
1458 | if (td->trim_batch) { |
1459 | td->trim_batch--; | |
1460 | get_trim = 1; | |
1461 | } else if (!(td->io_hist_len % td->o.trim_backlog) && | |
1462 | td->last_ddir != DDIR_READ) { | |
1463 | td->trim_batch = td->o.trim_batch; | |
1464 | if (!td->trim_batch) | |
1465 | td->trim_batch = td->o.trim_backlog; | |
1466 | get_trim = 1; | |
1467 | } | |
1468 | ||
1469 | if (get_trim && !get_next_trim(td, io_u)) | |
e39c0676 | 1470 | return true; |
2ba1c290 | 1471 | } |
10ba535a | 1472 | |
e39c0676 | 1473 | return false; |
0d29de83 JA |
1474 | } |
1475 | ||
e39c0676 | 1476 | static bool check_get_verify(struct thread_data *td, struct io_u *io_u) |
0d29de83 | 1477 | { |
d72be545 | 1478 | if (!(td->flags & TD_F_VER_BACKLOG)) |
e39c0676 | 1479 | return false; |
d72be545 JA |
1480 | |
1481 | if (td->io_hist_len) { | |
9e144189 JA |
1482 | int get_verify = 0; |
1483 | ||
d1ece0c7 | 1484 | if (td->verify_batch) |
9e144189 | 1485 | get_verify = 1; |
d1ece0c7 | 1486 | else if (!(td->io_hist_len % td->o.verify_backlog) && |
9e144189 JA |
1487 | td->last_ddir != DDIR_READ) { |
1488 | td->verify_batch = td->o.verify_batch; | |
f8a75c99 JA |
1489 | if (!td->verify_batch) |
1490 | td->verify_batch = td->o.verify_backlog; | |
9e144189 JA |
1491 | get_verify = 1; |
1492 | } | |
1493 | ||
d1ece0c7 JA |
1494 | if (get_verify && !get_next_verify(td, io_u)) { |
1495 | td->verify_batch--; | |
e39c0676 | 1496 | return true; |
d1ece0c7 | 1497 | } |
9e144189 JA |
1498 | } |
1499 | ||
e39c0676 | 1500 | return false; |
0d29de83 JA |
1501 | } |
1502 | ||
de789769 JA |
1503 | /* |
1504 | * Fill offset and start time into the buffer content, to prevent too | |
23f394d5 JA |
1505 | * easy compressible data for simple de-dupe attempts. Do this for every |
1506 | * 512b block in the range, since that should be the smallest block size | |
1507 | * we can expect from a device. | |
de789769 JA |
1508 | */ |
1509 | static void small_content_scramble(struct io_u *io_u) | |
1510 | { | |
23f394d5 | 1511 | unsigned int i, nr_blocks = io_u->buflen / 512; |
1ae83d45 | 1512 | uint64_t boffset; |
23f394d5 JA |
1513 | unsigned int offset; |
1514 | void *p, *end; | |
de789769 | 1515 | |
23f394d5 JA |
1516 | if (!nr_blocks) |
1517 | return; | |
1518 | ||
1519 | p = io_u->xfer_buf; | |
fba76ee8 | 1520 | boffset = io_u->offset; |
81f0366c | 1521 | io_u->buf_filled_len = 0; |
fad82f76 | 1522 | |
23f394d5 JA |
1523 | for (i = 0; i < nr_blocks; i++) { |
1524 | /* | |
1525 | * Fill the byte offset into a "random" start offset of | |
1526 | * the buffer, given by the product of the usec time | |
1527 | * and the actual offset. | |
1528 | */ | |
fad82f76 | 1529 | offset = (io_u->start_time.tv_usec ^ boffset) & 511; |
1ae83d45 JA |
1530 | offset &= ~(sizeof(uint64_t) - 1); |
1531 | if (offset >= 512 - sizeof(uint64_t)) | |
1532 | offset -= sizeof(uint64_t); | |
fba76ee8 | 1533 | memcpy(p + offset, &boffset, sizeof(boffset)); |
23f394d5 JA |
1534 | |
1535 | end = p + 512 - sizeof(io_u->start_time); | |
1536 | memcpy(end, &io_u->start_time, sizeof(io_u->start_time)); | |
1537 | p += 512; | |
fad82f76 | 1538 | boffset += 512; |
23f394d5 | 1539 | } |
de789769 JA |
1540 | } |
1541 | ||
0d29de83 JA |
1542 | /* |
1543 | * Return an io_u to be processed. Gets a buflen and offset, sets direction, | |
1544 | * etc. The returned io_u is fully ready to be prepped and submitted. | |
1545 | */ | |
1546 | struct io_u *get_io_u(struct thread_data *td) | |
1547 | { | |
1548 | struct fio_file *f; | |
1549 | struct io_u *io_u; | |
de789769 | 1550 | int do_scramble = 0; |
002fe734 | 1551 | long ret = 0; |
0d29de83 JA |
1552 | |
1553 | io_u = __get_io_u(td); | |
1554 | if (!io_u) { | |
1555 | dprint(FD_IO, "__get_io_u failed\n"); | |
1556 | return NULL; | |
1557 | } | |
1558 | ||
1559 | if (check_get_verify(td, io_u)) | |
1560 | goto out; | |
1561 | if (check_get_trim(td, io_u)) | |
1562 | goto out; | |
1563 | ||
755200a3 JA |
1564 | /* |
1565 | * from a requeue, io_u already setup | |
1566 | */ | |
1567 | if (io_u->file) | |
77f392bf | 1568 | goto out; |
755200a3 | 1569 | |
429f6675 JA |
1570 | /* |
1571 | * If using an iolog, grab next piece if any available. | |
1572 | */ | |
d72be545 | 1573 | if (td->flags & TD_F_READ_IOLOG) { |
429f6675 JA |
1574 | if (read_iolog_get(td, io_u)) |
1575 | goto err_put; | |
2ba1c290 | 1576 | } else if (set_io_u_file(td, io_u)) { |
002fe734 | 1577 | ret = -EBUSY; |
2ba1c290 | 1578 | dprint(FD_IO, "io_u %p, setting file failed\n", io_u); |
429f6675 | 1579 | goto err_put; |
2ba1c290 | 1580 | } |
5ec10eaa | 1581 | |
429f6675 | 1582 | f = io_u->file; |
002fe734 JA |
1583 | if (!f) { |
1584 | dprint(FD_IO, "io_u %p, setting file failed\n", io_u); | |
1585 | goto err_put; | |
1586 | } | |
1587 | ||
d6aed795 | 1588 | assert(fio_file_open(f)); |
97af62ce | 1589 | |
ff58fced | 1590 | if (ddir_rw(io_u->ddir)) { |
d0656a93 | 1591 | if (!io_u->buflen && !(td->io_ops->flags & FIO_NOIO)) { |
2ba1c290 | 1592 | dprint(FD_IO, "get_io_u: zero buflen on %p\n", io_u); |
429f6675 | 1593 | goto err_put; |
2ba1c290 | 1594 | } |
10ba535a | 1595 | |
f1dfb668 JA |
1596 | f->last_start[io_u->ddir] = io_u->offset; |
1597 | f->last_pos[io_u->ddir] = io_u->offset + io_u->buflen; | |
10ba535a | 1598 | |
fd68418e | 1599 | if (io_u->ddir == DDIR_WRITE) { |
d72be545 | 1600 | if (td->flags & TD_F_REFILL_BUFFERS) { |
9c42684e | 1601 | io_u_fill_buffer(td, io_u, |
1066358a | 1602 | td->o.min_bs[DDIR_WRITE], |
9e129577 | 1603 | io_u->buflen); |
ff441ae8 | 1604 | } else if ((td->flags & TD_F_SCRAMBLE_BUFFERS) && |
bedc9dc2 | 1605 | !(td->flags & TD_F_COMPRESS)) |
fd68418e | 1606 | do_scramble = 1; |
d72be545 | 1607 | if (td->flags & TD_F_VER_NONE) { |
629f1d71 JA |
1608 | populate_verify_io_u(td, io_u); |
1609 | do_scramble = 0; | |
1610 | } | |
fd68418e | 1611 | } else if (io_u->ddir == DDIR_READ) { |
cbe8d756 RR |
1612 | /* |
1613 | * Reset the buf_filled parameters so next time if the | |
1614 | * buffer is used for writes it is refilled. | |
1615 | */ | |
cbe8d756 RR |
1616 | io_u->buf_filled_len = 0; |
1617 | } | |
87dc1ab1 | 1618 | } |
10ba535a | 1619 | |
165faf16 JA |
1620 | /* |
1621 | * Set io data pointers. | |
1622 | */ | |
cec6b55d JA |
1623 | io_u->xfer_buf = io_u->buf; |
1624 | io_u->xfer_buflen = io_u->buflen; | |
5973cafb | 1625 | |
6ac7a331 | 1626 | out: |
0d29de83 | 1627 | assert(io_u->file); |
429f6675 | 1628 | if (!td_io_prep(td, io_u)) { |
3ecc8c67 | 1629 | if (!td->o.disable_lat) |
993bf48b | 1630 | fio_gettime(&io_u->start_time, NULL); |
de789769 JA |
1631 | if (do_scramble) |
1632 | small_content_scramble(io_u); | |
429f6675 | 1633 | return io_u; |
36167d82 | 1634 | } |
429f6675 | 1635 | err_put: |
2ba1c290 | 1636 | dprint(FD_IO, "get_io_u failed\n"); |
429f6675 | 1637 | put_io_u(td, io_u); |
002fe734 | 1638 | return ERR_PTR(ret); |
10ba535a JA |
1639 | } |
1640 | ||
a9da8ab2 | 1641 | static void __io_u_log_error(struct thread_data *td, struct io_u *io_u) |
5451792e | 1642 | { |
8b28bd41 | 1643 | enum error_type_bit eb = td_error_type(io_u->ddir, io_u->error); |
825f818e | 1644 | |
8b28bd41 DM |
1645 | if (td_non_fatal_error(td, eb, io_u->error) && !td->o.error_dump) |
1646 | return; | |
5451792e | 1647 | |
709c8313 RE |
1648 | log_err("fio: io_u error%s%s: %s: %s offset=%llu, buflen=%lu\n", |
1649 | io_u->file ? " on file " : "", | |
1650 | io_u->file ? io_u->file->file_name : "", | |
1651 | strerror(io_u->error), | |
1652 | io_ddir_name(io_u->ddir), | |
1653 | io_u->offset, io_u->xfer_buflen); | |
5451792e | 1654 | |
5ad7be56 KD |
1655 | if (td->io_ops->errdetails) { |
1656 | char *err = td->io_ops->errdetails(io_u); | |
1657 | ||
1658 | log_err("fio: %s\n", err); | |
1659 | free(err); | |
1660 | } | |
1661 | ||
5451792e JA |
1662 | if (!td->error) |
1663 | td_verror(td, io_u->error, "io_u error"); | |
1664 | } | |
1665 | ||
a9da8ab2 JA |
1666 | void io_u_log_error(struct thread_data *td, struct io_u *io_u) |
1667 | { | |
1668 | __io_u_log_error(td, io_u); | |
1669 | if (td->parent) | |
1670 | __io_u_log_error(td, io_u); | |
1671 | } | |
1672 | ||
e39c0676 | 1673 | static inline bool gtod_reduce(struct thread_data *td) |
aba6c951 | 1674 | { |
3ecc8c67 JA |
1675 | return (td->o.disable_clat && td->o.disable_slat && td->o.disable_bw) |
1676 | || td->o.gtod_reduce; | |
aba6c951 JA |
1677 | } |
1678 | ||
c8eeb9df JA |
1679 | static void account_io_completion(struct thread_data *td, struct io_u *io_u, |
1680 | struct io_completion_data *icd, | |
1681 | const enum fio_ddir idx, unsigned int bytes) | |
1682 | { | |
a9da8ab2 | 1683 | const int no_reduce = !gtod_reduce(td); |
24d23ca7 | 1684 | unsigned long lusec = 0; |
c8eeb9df | 1685 | |
75dc383e JA |
1686 | if (td->parent) |
1687 | td = td->parent; | |
1688 | ||
a9da8ab2 | 1689 | if (no_reduce) |
c8eeb9df JA |
1690 | lusec = utime_since(&io_u->issue_time, &icd->time); |
1691 | ||
1692 | if (!td->o.disable_lat) { | |
1693 | unsigned long tusec; | |
1694 | ||
1695 | tusec = utime_since(&io_u->start_time, &icd->time); | |
ae588852 | 1696 | add_lat_sample(td, idx, tusec, bytes, io_u->offset); |
15501535 | 1697 | |
d4afedfd JA |
1698 | if (td->flags & TD_F_PROFILE_OPS) { |
1699 | struct prof_io_ops *ops = &td->prof_io_ops; | |
1700 | ||
1701 | if (ops->io_u_lat) | |
1702 | icd->error = ops->io_u_lat(td, tusec); | |
1703 | } | |
1704 | ||
3e260a46 JA |
1705 | if (td->o.max_latency && tusec > td->o.max_latency) |
1706 | lat_fatal(td, icd, tusec, td->o.max_latency); | |
1707 | if (td->o.latency_target && tusec > td->o.latency_target) { | |
1708 | if (lat_target_failed(td)) | |
1709 | lat_fatal(td, icd, tusec, td->o.latency_target); | |
15501535 | 1710 | } |
c8eeb9df JA |
1711 | } |
1712 | ||
1713 | if (!td->o.disable_clat) { | |
ae588852 | 1714 | add_clat_sample(td, idx, lusec, bytes, io_u->offset); |
c8eeb9df JA |
1715 | io_u_mark_latency(td, lusec); |
1716 | } | |
1717 | ||
1718 | if (!td->o.disable_bw) | |
1719 | add_bw_sample(td, idx, bytes, &icd->time); | |
1720 | ||
a9da8ab2 | 1721 | if (no_reduce) |
aba6c951 | 1722 | add_iops_sample(td, idx, bytes, &icd->time); |
66347cfa DE |
1723 | |
1724 | if (td->ts.nr_block_infos && io_u->ddir == DDIR_TRIM) { | |
1725 | uint32_t *info = io_u_block_info(td, io_u); | |
1726 | if (BLOCK_INFO_STATE(*info) < BLOCK_STATE_TRIM_FAILURE) { | |
1727 | if (io_u->ddir == DDIR_TRIM) { | |
1728 | *info = BLOCK_INFO(BLOCK_STATE_TRIMMED, | |
1729 | BLOCK_INFO_TRIMS(*info) + 1); | |
1730 | } else if (io_u->ddir == DDIR_WRITE) { | |
1731 | *info = BLOCK_INFO_SET_STATE(BLOCK_STATE_WRITTEN, | |
1732 | *info); | |
1733 | } | |
1734 | } | |
1735 | } | |
c8eeb9df JA |
1736 | } |
1737 | ||
f8b0bd10 | 1738 | static void io_completed(struct thread_data *td, struct io_u **io_u_ptr, |
97601024 | 1739 | struct io_completion_data *icd) |
10ba535a | 1740 | { |
f8b0bd10 JA |
1741 | struct io_u *io_u = *io_u_ptr; |
1742 | enum fio_ddir ddir = io_u->ddir; | |
1743 | struct fio_file *f = io_u->file; | |
10ba535a | 1744 | |
2ba1c290 JA |
1745 | dprint_io_u(io_u, "io complete"); |
1746 | ||
0c6e7517 | 1747 | assert(io_u->flags & IO_U_F_FLIGHT); |
a9da8ab2 | 1748 | io_u_clear(io_u, IO_U_F_FLIGHT | IO_U_F_BUSY_OK); |
f9401285 JA |
1749 | |
1750 | /* | |
1751 | * Mark IO ok to verify | |
1752 | */ | |
1753 | if (io_u->ipo) { | |
890b6656 JA |
1754 | /* |
1755 | * Remove errored entry from the verification list | |
1756 | */ | |
1757 | if (io_u->error) | |
1758 | unlog_io_piece(td, io_u); | |
1759 | else { | |
1760 | io_u->ipo->flags &= ~IP_F_IN_FLIGHT; | |
1761 | write_barrier(); | |
1762 | } | |
f9401285 JA |
1763 | } |
1764 | ||
f8b0bd10 | 1765 | if (ddir_sync(ddir)) { |
87dc1ab1 | 1766 | td->last_was_sync = 1; |
44f29692 JA |
1767 | if (f) { |
1768 | f->first_write = -1ULL; | |
1769 | f->last_write = -1ULL; | |
1770 | } | |
87dc1ab1 JA |
1771 | return; |
1772 | } | |
1773 | ||
1774 | td->last_was_sync = 0; | |
f8b0bd10 | 1775 | td->last_ddir = ddir; |
87dc1ab1 | 1776 | |
f8b0bd10 | 1777 | if (!io_u->error && ddir_rw(ddir)) { |
10ba535a | 1778 | unsigned int bytes = io_u->buflen - io_u->resid; |
b29ee5b3 | 1779 | int ret; |
10ba535a | 1780 | |
f8b0bd10 JA |
1781 | td->io_blocks[ddir]++; |
1782 | td->this_io_blocks[ddir]++; | |
1783 | td->io_bytes[ddir] += bytes; | |
ae2fafc8 | 1784 | |
1785 | if (!(io_u->flags & IO_U_F_VER_LIST)) | |
f8b0bd10 JA |
1786 | td->this_io_bytes[ddir] += bytes; |
1787 | ||
ca09be4b JA |
1788 | if (ddir == DDIR_WRITE) { |
1789 | if (f) { | |
1790 | if (f->first_write == -1ULL || | |
1791 | io_u->offset < f->first_write) | |
1792 | f->first_write = io_u->offset; | |
1793 | if (f->last_write == -1ULL || | |
1794 | ((io_u->offset + bytes) > f->last_write)) | |
1795 | f->last_write = io_u->offset + bytes; | |
1796 | } | |
1797 | if (td->last_write_comp) { | |
1798 | int idx = td->last_write_idx++; | |
1799 | ||
1800 | td->last_write_comp[idx] = io_u->offset; | |
1801 | if (td->last_write_idx == td->o.iodepth) | |
1802 | td->last_write_idx = 0; | |
1803 | } | |
44f29692 JA |
1804 | } |
1805 | ||
6b1190fd | 1806 | if (ramp_time_over(td) && (td->runstate == TD_RUNNING || |
50a8ce86 | 1807 | td->runstate == TD_VERIFYING)) |
f8b0bd10 | 1808 | account_io_completion(td, io_u, icd, ddir, bytes); |
40e1a6f0 | 1809 | |
f8b0bd10 | 1810 | icd->bytes_done[ddir] += bytes; |
3af6ef39 | 1811 | |
d7762cf8 | 1812 | if (io_u->end_io) { |
f8b0bd10 JA |
1813 | ret = io_u->end_io(td, io_u_ptr); |
1814 | io_u = *io_u_ptr; | |
3af6ef39 JA |
1815 | if (ret && !icd->error) |
1816 | icd->error = ret; | |
1817 | } | |
ff58fced | 1818 | } else if (io_u->error) { |
10ba535a | 1819 | icd->error = io_u->error; |
5451792e JA |
1820 | io_u_log_error(td, io_u); |
1821 | } | |
8b28bd41 | 1822 | if (icd->error) { |
f8b0bd10 JA |
1823 | enum error_type_bit eb = td_error_type(ddir, icd->error); |
1824 | ||
8b28bd41 DM |
1825 | if (!td_non_fatal_error(td, eb, icd->error)) |
1826 | return; | |
f8b0bd10 | 1827 | |
f2bba182 RR |
1828 | /* |
1829 | * If there is a non_fatal error, then add to the error count | |
1830 | * and clear all the errors. | |
1831 | */ | |
1832 | update_error_count(td, icd->error); | |
1833 | td_clear_error(td); | |
1834 | icd->error = 0; | |
f8b0bd10 JA |
1835 | if (io_u) |
1836 | io_u->error = 0; | |
f2bba182 | 1837 | } |
10ba535a JA |
1838 | } |
1839 | ||
9520ebb9 JA |
1840 | static void init_icd(struct thread_data *td, struct io_completion_data *icd, |
1841 | int nr) | |
10ba535a | 1842 | { |
6eaf09d6 | 1843 | int ddir; |
aba6c951 JA |
1844 | |
1845 | if (!gtod_reduce(td)) | |
9520ebb9 | 1846 | fio_gettime(&icd->time, NULL); |
02bcaa8c | 1847 | |
3af6ef39 JA |
1848 | icd->nr = nr; |
1849 | ||
10ba535a | 1850 | icd->error = 0; |
6eaf09d6 SL |
1851 | for (ddir = DDIR_READ; ddir < DDIR_RWDIR_CNT; ddir++) |
1852 | icd->bytes_done[ddir] = 0; | |
36167d82 JA |
1853 | } |
1854 | ||
97601024 JA |
1855 | static void ios_completed(struct thread_data *td, |
1856 | struct io_completion_data *icd) | |
36167d82 JA |
1857 | { |
1858 | struct io_u *io_u; | |
1859 | int i; | |
1860 | ||
10ba535a JA |
1861 | for (i = 0; i < icd->nr; i++) { |
1862 | io_u = td->io_ops->event(td, i); | |
1863 | ||
f8b0bd10 | 1864 | io_completed(td, &io_u, icd); |
e8462bd8 | 1865 | |
f8b0bd10 | 1866 | if (io_u) |
e8462bd8 | 1867 | put_io_u(td, io_u); |
10ba535a JA |
1868 | } |
1869 | } | |
97601024 | 1870 | |
e7e6cfb4 JA |
1871 | /* |
1872 | * Complete a single io_u for the sync engines. | |
1873 | */ | |
55312f9f | 1874 | int io_u_sync_complete(struct thread_data *td, struct io_u *io_u) |
97601024 JA |
1875 | { |
1876 | struct io_completion_data icd; | |
55312f9f | 1877 | int ddir; |
97601024 | 1878 | |
9520ebb9 | 1879 | init_icd(td, &icd, 1); |
f8b0bd10 | 1880 | io_completed(td, &io_u, &icd); |
e8462bd8 | 1881 | |
f8b0bd10 | 1882 | if (io_u) |
e8462bd8 | 1883 | put_io_u(td, io_u); |
97601024 | 1884 | |
581e7141 JA |
1885 | if (icd.error) { |
1886 | td_verror(td, icd.error, "io_u_sync_complete"); | |
1887 | return -1; | |
1888 | } | |
97601024 | 1889 | |
55312f9f JA |
1890 | for (ddir = DDIR_READ; ddir < DDIR_RWDIR_CNT; ddir++) |
1891 | td->bytes_done[ddir] += icd.bytes_done[ddir]; | |
581e7141 JA |
1892 | |
1893 | return 0; | |
97601024 JA |
1894 | } |
1895 | ||
e7e6cfb4 JA |
1896 | /* |
1897 | * Called to complete min_events number of io for the async engines. | |
1898 | */ | |
55312f9f | 1899 | int io_u_queued_complete(struct thread_data *td, int min_evts) |
97601024 | 1900 | { |
97601024 | 1901 | struct io_completion_data icd; |
00de55ef | 1902 | struct timespec *tvp = NULL; |
55312f9f | 1903 | int ret, ddir; |
4d06a338 | 1904 | struct timespec ts = { .tv_sec = 0, .tv_nsec = 0, }; |
97601024 | 1905 | |
4950421a | 1906 | dprint(FD_IO, "io_u_queued_completed: min=%d\n", min_evts); |
b271fe62 | 1907 | |
4950421a | 1908 | if (!min_evts) |
00de55ef | 1909 | tvp = &ts; |
5fb4b366 RE |
1910 | else if (min_evts > td->cur_depth) |
1911 | min_evts = td->cur_depth; | |
97601024 | 1912 | |
82407585 RP |
1913 | /* No worries, td_io_getevents fixes min and max if they are |
1914 | * set incorrectly */ | |
1915 | ret = td_io_getevents(td, min_evts, td->o.iodepth_batch_complete_max, tvp); | |
97601024 | 1916 | if (ret < 0) { |
e1161c32 | 1917 | td_verror(td, -ret, "td_io_getevents"); |
97601024 JA |
1918 | return ret; |
1919 | } else if (!ret) | |
1920 | return ret; | |
1921 | ||
9520ebb9 | 1922 | init_icd(td, &icd, ret); |
97601024 | 1923 | ios_completed(td, &icd); |
581e7141 JA |
1924 | if (icd.error) { |
1925 | td_verror(td, icd.error, "io_u_queued_complete"); | |
1926 | return -1; | |
1927 | } | |
97601024 | 1928 | |
55312f9f JA |
1929 | for (ddir = DDIR_READ; ddir < DDIR_RWDIR_CNT; ddir++) |
1930 | td->bytes_done[ddir] += icd.bytes_done[ddir]; | |
581e7141 | 1931 | |
0d593542 | 1932 | return ret; |
97601024 | 1933 | } |
7e77dd02 JA |
1934 | |
1935 | /* | |
1936 | * Call when io_u is really queued, to update the submission latency. | |
1937 | */ | |
1938 | void io_u_queued(struct thread_data *td, struct io_u *io_u) | |
1939 | { | |
9520ebb9 JA |
1940 | if (!td->o.disable_slat) { |
1941 | unsigned long slat_time; | |
7e77dd02 | 1942 | |
9520ebb9 | 1943 | slat_time = utime_since(&io_u->start_time, &io_u->issue_time); |
75dc383e JA |
1944 | |
1945 | if (td->parent) | |
1946 | td = td->parent; | |
1947 | ||
ae588852 JA |
1948 | add_slat_sample(td, io_u->ddir, slat_time, io_u->xfer_buflen, |
1949 | io_u->offset); | |
9520ebb9 | 1950 | } |
7e77dd02 | 1951 | } |
433afcb4 | 1952 | |
5c94b008 JA |
1953 | /* |
1954 | * See if we should reuse the last seed, if dedupe is enabled | |
1955 | */ | |
9451b93e | 1956 | static struct frand_state *get_buf_state(struct thread_data *td) |
5c94b008 JA |
1957 | { |
1958 | unsigned int v; | |
5c94b008 JA |
1959 | |
1960 | if (!td->o.dedupe_percentage) | |
1961 | return &td->buf_state; | |
732eedd0 | 1962 | else if (td->o.dedupe_percentage == 100) { |
9451b93e JA |
1963 | frand_copy(&td->buf_state_prev, &td->buf_state); |
1964 | return &td->buf_state; | |
732eedd0 | 1965 | } |
5c94b008 | 1966 | |
e0a04ac1 | 1967 | v = rand_between(&td->dedupe_state, 1, 100); |
5c94b008 JA |
1968 | |
1969 | if (v <= td->o.dedupe_percentage) | |
1970 | return &td->buf_state_prev; | |
1971 | ||
1972 | return &td->buf_state; | |
1973 | } | |
1974 | ||
9451b93e | 1975 | static void save_buf_state(struct thread_data *td, struct frand_state *rs) |
5c94b008 | 1976 | { |
9451b93e JA |
1977 | if (td->o.dedupe_percentage == 100) |
1978 | frand_copy(rs, &td->buf_state_prev); | |
1979 | else if (rs == &td->buf_state) | |
5c94b008 JA |
1980 | frand_copy(&td->buf_state_prev, rs); |
1981 | } | |
1982 | ||
cc86c395 JA |
1983 | void fill_io_buffer(struct thread_data *td, void *buf, unsigned int min_write, |
1984 | unsigned int max_bs) | |
5973cafb | 1985 | { |
d1af2894 JA |
1986 | struct thread_options *o = &td->o; |
1987 | ||
4eff3e57 | 1988 | if (o->compress_percentage || o->dedupe_percentage) { |
9c42684e | 1989 | unsigned int perc = td->o.compress_percentage; |
5c94b008 | 1990 | struct frand_state *rs; |
1066358a | 1991 | unsigned int left = max_bs; |
1e7f82e2 | 1992 | unsigned int this_write; |
5c94b008 | 1993 | |
1066358a | 1994 | do { |
9451b93e | 1995 | rs = get_buf_state(td); |
9c42684e | 1996 | |
1066358a | 1997 | min_write = min(min_write, left); |
f97a43a1 | 1998 | |
1066358a | 1999 | if (perc) { |
4b157ac6 JA |
2000 | this_write = min_not_zero(min_write, |
2001 | td->o.compress_chunk); | |
1e7f82e2 JA |
2002 | |
2003 | fill_random_buf_percentage(rs, buf, perc, | |
2004 | this_write, this_write, | |
2005 | o->buffer_pattern, | |
2006 | o->buffer_pattern_bytes); | |
2007 | } else { | |
1066358a | 2008 | fill_random_buf(rs, buf, min_write); |
1e7f82e2 JA |
2009 | this_write = min_write; |
2010 | } | |
1066358a | 2011 | |
1e7f82e2 JA |
2012 | buf += this_write; |
2013 | left -= this_write; | |
9451b93e | 2014 | save_buf_state(td, rs); |
1066358a | 2015 | } while (left); |
d1af2894 JA |
2016 | } else if (o->buffer_pattern_bytes) |
2017 | fill_buffer_pattern(td, buf, max_bs); | |
999d245e | 2018 | else if (o->zero_buffers) |
cc86c395 | 2019 | memset(buf, 0, max_bs); |
999d245e | 2020 | else |
9451b93e | 2021 | fill_random_buf(get_buf_state(td), buf, max_bs); |
cc86c395 JA |
2022 | } |
2023 | ||
2024 | /* | |
2025 | * "randomly" fill the buffer contents | |
2026 | */ | |
2027 | void io_u_fill_buffer(struct thread_data *td, struct io_u *io_u, | |
2028 | unsigned int min_write, unsigned int max_bs) | |
2029 | { | |
2030 | io_u->buf_filled_len = 0; | |
2031 | fill_io_buffer(td, io_u->buf, min_write, max_bs); | |
5973cafb | 2032 | } |