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