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