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