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