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