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