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