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