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