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" |
10ba535a | 11 | |
97601024 JA |
12 | struct io_completion_data { |
13 | int nr; /* input */ | |
97601024 JA |
14 | |
15 | int error; /* output */ | |
16 | unsigned long bytes_done[2]; /* output */ | |
17 | struct timeval time; /* output */ | |
18 | }; | |
19 | ||
10ba535a JA |
20 | /* |
21 | * The ->file_map[] contains a map of blocks we have or have not done io | |
22 | * to yet. Used to make sure we cover the entire range in a fair fashion. | |
23 | */ | |
aec2de20 | 24 | static int random_map_free(struct fio_file *f, const unsigned long long block) |
10ba535a | 25 | { |
aec2de20 JA |
26 | unsigned int idx = RAND_MAP_IDX(f, block); |
27 | unsigned int bit = RAND_MAP_BIT(f, block); | |
10ba535a | 28 | |
84422acd JA |
29 | dprint(FD_RANDOM, "free: b=%llu, idx=%u, bit=%u\n", block, idx, bit); |
30 | ||
de605666 | 31 | return (f->file_map[idx] & (1 << bit)) == 0; |
10ba535a JA |
32 | } |
33 | ||
df415585 JA |
34 | /* |
35 | * Mark a given offset as used in the map. | |
36 | */ | |
9bf2061e | 37 | static void mark_random_map(struct thread_data *td, struct io_u *io_u) |
df415585 | 38 | { |
2dc1bbeb | 39 | unsigned int min_bs = td->o.rw_min_bs; |
9bf2061e | 40 | struct fio_file *f = io_u->file; |
a00735e6 | 41 | unsigned long long block; |
3e3357b1 | 42 | unsigned int blocks, nr_blocks; |
df415585 | 43 | |
b9c5b644 | 44 | block = (io_u->offset - f->file_offset) / (unsigned long long) min_bs; |
c685b5b2 | 45 | nr_blocks = (io_u->buflen + min_bs - 1) / min_bs; |
3e3357b1 | 46 | blocks = 0; |
c685b5b2 | 47 | |
3e3357b1 JA |
48 | while (nr_blocks) { |
49 | unsigned int this_blocks, mask; | |
df415585 JA |
50 | unsigned int idx, bit; |
51 | ||
1e3d53ac JA |
52 | /* |
53 | * If we have a mixed random workload, we may | |
54 | * encounter blocks we already did IO to. | |
55 | */ | |
8b113b4f JA |
56 | if ((td->o.ddir_nr == 1) && !random_map_free(f, block)) { |
57 | if (!blocks) | |
58 | blocks = 1; | |
df415585 | 59 | break; |
8b113b4f | 60 | } |
df415585 | 61 | |
aec2de20 JA |
62 | idx = RAND_MAP_IDX(f, block); |
63 | bit = RAND_MAP_BIT(f, block); | |
df415585 | 64 | |
0032bf9f | 65 | fio_assert(td, idx < f->num_maps); |
df415585 | 66 | |
3e3357b1 JA |
67 | this_blocks = nr_blocks; |
68 | if (this_blocks + bit > BLOCKS_PER_MAP) | |
69 | this_blocks = BLOCKS_PER_MAP - bit; | |
70 | ||
71 | if (this_blocks == BLOCKS_PER_MAP) | |
72 | mask = -1U; | |
73 | else | |
74 | mask = ((1U << this_blocks) - 1) << bit; | |
75 | ||
3e3357b1 JA |
76 | f->file_map[idx] |= mask; |
77 | nr_blocks -= this_blocks; | |
78 | blocks += this_blocks; | |
c9dd34b2 | 79 | block += this_blocks; |
df415585 JA |
80 | } |
81 | ||
a00735e6 JA |
82 | if ((blocks * min_bs) < io_u->buflen) |
83 | io_u->buflen = blocks * min_bs; | |
df415585 JA |
84 | } |
85 | ||
3e3357b1 JA |
86 | static unsigned long long last_block(struct thread_data *td, struct fio_file *f, |
87 | enum fio_ddir ddir) | |
2ba1c290 JA |
88 | { |
89 | unsigned long long max_blocks; | |
d9dd70f7 | 90 | unsigned long long max_size; |
2ba1c290 | 91 | |
d9dd70f7 JA |
92 | /* |
93 | * Hmm, should we make sure that ->io_size <= ->real_file_size? | |
94 | */ | |
95 | max_size = f->io_size; | |
96 | if (max_size > f->real_file_size) | |
97 | max_size = f->real_file_size; | |
98 | ||
2b7a01d0 | 99 | max_blocks = max_size / (unsigned long long) td->o.ba[ddir]; |
2ba1c290 JA |
100 | if (!max_blocks) |
101 | return 0; | |
102 | ||
67778e88 | 103 | return max_blocks; |
2ba1c290 JA |
104 | } |
105 | ||
10ba535a JA |
106 | /* |
107 | * Return the next free block in the map. | |
108 | */ | |
109 | static int get_next_free_block(struct thread_data *td, struct fio_file *f, | |
4ba66134 | 110 | enum fio_ddir ddir, unsigned long long *b) |
10ba535a | 111 | { |
84422acd | 112 | unsigned long long min_bs = td->o.rw_min_bs; |
10ba535a JA |
113 | int i; |
114 | ||
c685b5b2 JA |
115 | i = f->last_free_lookup; |
116 | *b = (i * BLOCKS_PER_MAP); | |
899c29f2 RR |
117 | while ((*b) * min_bs < f->real_file_size && |
118 | (*b) * min_bs < f->io_size) { | |
de605666 | 119 | if (f->file_map[i] != (unsigned int) -1) { |
697a606c | 120 | *b += ffz(f->file_map[i]); |
4ba66134 | 121 | if (*b > last_block(td, f, ddir)) |
2ba1c290 | 122 | break; |
c685b5b2 | 123 | f->last_free_lookup = i; |
10ba535a JA |
124 | return 0; |
125 | } | |
126 | ||
127 | *b += BLOCKS_PER_MAP; | |
128 | i++; | |
129 | } | |
130 | ||
2ba1c290 | 131 | dprint(FD_IO, "failed finding a free block\n"); |
10ba535a JA |
132 | return 1; |
133 | } | |
134 | ||
ec4015da | 135 | static int get_next_rand_offset(struct thread_data *td, struct fio_file *f, |
4ba66134 | 136 | enum fio_ddir ddir, unsigned long long *b) |
ec4015da | 137 | { |
84422acd | 138 | unsigned long long r; |
ec4015da JA |
139 | int loops = 5; |
140 | ||
141 | do { | |
142 | r = os_random_long(&td->random_state); | |
84422acd | 143 | dprint(FD_RANDOM, "off rand %llu\n", r); |
5ec10eaa | 144 | *b = (last_block(td, f, ddir) - 1) |
dc873b6f | 145 | * (r / ((unsigned long long) OS_RAND_MAX + 1.0)); |
2ba1c290 | 146 | |
43c63a78 JA |
147 | /* |
148 | * if we are not maintaining a random map, we are done. | |
149 | */ | |
303032ae | 150 | if (!file_randommap(td, f)) |
43c63a78 JA |
151 | return 0; |
152 | ||
153 | /* | |
84422acd | 154 | * calculate map offset and check if it's free |
43c63a78 | 155 | */ |
aec2de20 | 156 | if (random_map_free(f, *b)) |
43c63a78 JA |
157 | return 0; |
158 | ||
84422acd JA |
159 | dprint(FD_RANDOM, "get_next_rand_offset: offset %llu busy\n", |
160 | *b); | |
43c63a78 | 161 | } while (--loops); |
ec4015da JA |
162 | |
163 | /* | |
43c63a78 JA |
164 | * we get here, if we didn't suceed in looking up a block. generate |
165 | * a random start offset into the filemap, and find the first free | |
166 | * block from there. | |
ec4015da | 167 | */ |
43c63a78 JA |
168 | loops = 10; |
169 | do { | |
dc873b6f JA |
170 | f->last_free_lookup = (f->num_maps - 1) * |
171 | (r / (OS_RAND_MAX + 1.0)); | |
4ba66134 | 172 | if (!get_next_free_block(td, f, ddir, b)) |
43c63a78 | 173 | return 0; |
ec4015da | 174 | |
43c63a78 JA |
175 | r = os_random_long(&td->random_state); |
176 | } while (--loops); | |
177 | ||
178 | /* | |
179 | * that didn't work either, try exhaustive search from the start | |
180 | */ | |
181 | f->last_free_lookup = 0; | |
4ba66134 | 182 | return get_next_free_block(td, f, ddir, b); |
ec4015da JA |
183 | } |
184 | ||
10ba535a JA |
185 | /* |
186 | * For random io, generate a random new block and see if it's used. Repeat | |
187 | * until we find a free one. For sequential io, just return the end of | |
188 | * the last io issued. | |
189 | */ | |
9bf2061e | 190 | static int get_next_offset(struct thread_data *td, struct io_u *io_u) |
10ba535a | 191 | { |
9bf2061e | 192 | struct fio_file *f = io_u->file; |
ec4015da | 193 | unsigned long long b; |
4ba66134 | 194 | enum fio_ddir ddir = io_u->ddir; |
10ba535a | 195 | |
ec4015da JA |
196 | if (td_random(td) && (td->o.ddir_nr && !--td->ddir_nr)) { |
197 | td->ddir_nr = td->o.ddir_nr; | |
211097b2 | 198 | |
683023e8 JA |
199 | if (get_next_rand_offset(td, f, ddir, &b)) { |
200 | dprint(FD_IO, "%s: getting rand offset failed\n", | |
201 | f->file_name); | |
bca4ed4d | 202 | return 1; |
683023e8 | 203 | } |
43063a1c | 204 | } else { |
0c3d768a | 205 | if (f->last_pos >= f->real_file_size) { |
4ba66134 | 206 | if (!td_random(td) || |
683023e8 JA |
207 | get_next_rand_offset(td, f, ddir, &b)) { |
208 | dprint(FD_IO, "%s: pos %llu > size %llu\n", | |
209 | f->file_name, f->last_pos, | |
210 | f->real_file_size); | |
0c3d768a | 211 | return 1; |
683023e8 | 212 | } |
bcdedd0a | 213 | } else |
4ba66134 | 214 | b = (f->last_pos - f->file_offset) / td->o.min_bs[ddir]; |
43063a1c | 215 | } |
10ba535a | 216 | |
2b7a01d0 | 217 | io_u->offset = b * td->o.ba[ddir]; |
009bd847 JA |
218 | if (io_u->offset >= f->io_size) { |
219 | dprint(FD_IO, "get_next_offset: offset %llu >= io_size %llu\n", | |
220 | io_u->offset, f->io_size); | |
221 | return 1; | |
222 | } | |
223 | ||
224 | io_u->offset += f->file_offset; | |
2ba1c290 JA |
225 | if (io_u->offset >= f->real_file_size) { |
226 | dprint(FD_IO, "get_next_offset: offset %llu >= size %llu\n", | |
227 | io_u->offset, f->real_file_size); | |
10ba535a | 228 | return 1; |
2ba1c290 | 229 | } |
10ba535a JA |
230 | |
231 | return 0; | |
232 | } | |
233 | ||
f3059de1 JA |
234 | static inline int is_power_of_2(unsigned int val) |
235 | { | |
236 | return (val != 0 && ((val & (val - 1)) == 0)); | |
237 | } | |
238 | ||
9bf2061e | 239 | static unsigned int get_next_buflen(struct thread_data *td, struct io_u *io_u) |
10ba535a | 240 | { |
bca4ed4d | 241 | const int ddir = io_u->ddir; |
f3f552b9 | 242 | unsigned int uninitialized_var(buflen); |
f3059de1 | 243 | unsigned int minbs, maxbs; |
10ba535a JA |
244 | long r; |
245 | ||
f3059de1 JA |
246 | minbs = td->o.min_bs[ddir]; |
247 | maxbs = td->o.max_bs[ddir]; | |
248 | ||
249 | if (minbs == maxbs) | |
250 | buflen = minbs; | |
10ba535a JA |
251 | else { |
252 | r = os_random_long(&td->bsrange_state); | |
720e84ad | 253 | if (!td->o.bssplit_nr[ddir]) { |
f3059de1 JA |
254 | buflen = 1 + (unsigned int) ((double) maxbs * |
255 | (r / (OS_RAND_MAX + 1.0))); | |
256 | if (buflen < minbs) | |
257 | buflen = minbs; | |
5ec10eaa | 258 | } else { |
564ca972 JA |
259 | long perc = 0; |
260 | unsigned int i; | |
261 | ||
720e84ad JA |
262 | for (i = 0; i < td->o.bssplit_nr[ddir]; i++) { |
263 | struct bssplit *bsp = &td->o.bssplit[ddir][i]; | |
564ca972 JA |
264 | |
265 | buflen = bsp->bs; | |
266 | perc += bsp->perc; | |
f3059de1 | 267 | if (r <= ((OS_RAND_MAX / 100L) * perc)) |
564ca972 JA |
268 | break; |
269 | } | |
270 | } | |
f3059de1 JA |
271 | if (!td->o.bs_unaligned && is_power_of_2(minbs)) |
272 | buflen = (buflen + minbs - 1) & ~(minbs - 1); | |
10ba535a JA |
273 | } |
274 | ||
4ba66134 JA |
275 | if (io_u->offset + buflen > io_u->file->real_file_size) { |
276 | dprint(FD_IO, "lower buflen %u -> %u (ddir=%d)\n", buflen, | |
f3059de1 JA |
277 | minbs, ddir); |
278 | buflen = minbs; | |
4ba66134 | 279 | } |
6a5e6884 | 280 | |
10ba535a JA |
281 | return buflen; |
282 | } | |
283 | ||
afe24a5a JA |
284 | static void set_rwmix_bytes(struct thread_data *td) |
285 | { | |
afe24a5a JA |
286 | unsigned int diff; |
287 | ||
288 | /* | |
289 | * we do time or byte based switch. this is needed because | |
290 | * buffered writes may issue a lot quicker than they complete, | |
291 | * whereas reads do not. | |
292 | */ | |
e47f799f | 293 | diff = td->o.rwmix[td->rwmix_ddir ^ 1]; |
04c540d9 | 294 | td->rwmix_issues = (td->io_issues[td->rwmix_ddir] * diff) / 100; |
e47f799f JA |
295 | } |
296 | ||
297 | static inline enum fio_ddir get_rand_ddir(struct thread_data *td) | |
298 | { | |
299 | unsigned int v; | |
300 | long r; | |
301 | ||
302 | r = os_random_long(&td->rwmix_state); | |
dc873b6f | 303 | v = 1 + (int) (100.0 * (r / (OS_RAND_MAX + 1.0))); |
04c540d9 | 304 | if (v <= td->o.rwmix[DDIR_READ]) |
e47f799f JA |
305 | return DDIR_READ; |
306 | ||
307 | return DDIR_WRITE; | |
afe24a5a JA |
308 | } |
309 | ||
581e7141 JA |
310 | static enum fio_ddir rate_ddir(struct thread_data *td, enum fio_ddir ddir) |
311 | { | |
312 | enum fio_ddir odir = ddir ^ 1; | |
313 | struct timeval t; | |
314 | long usec; | |
315 | ||
316 | if (td->rate_pending_usleep[ddir] <= 0) | |
317 | return ddir; | |
318 | ||
319 | /* | |
320 | * We have too much pending sleep in this direction. See if we | |
321 | * should switch. | |
322 | */ | |
323 | if (td_rw(td)) { | |
324 | /* | |
325 | * Other direction does not have too much pending, switch | |
326 | */ | |
327 | if (td->rate_pending_usleep[odir] < 100000) | |
328 | return odir; | |
329 | ||
330 | /* | |
331 | * Both directions have pending sleep. Sleep the minimum time | |
332 | * and deduct from both. | |
333 | */ | |
334 | if (td->rate_pending_usleep[ddir] <= | |
335 | td->rate_pending_usleep[odir]) { | |
336 | usec = td->rate_pending_usleep[ddir]; | |
337 | } else { | |
338 | usec = td->rate_pending_usleep[odir]; | |
339 | ddir = odir; | |
340 | } | |
341 | } else | |
342 | usec = td->rate_pending_usleep[ddir]; | |
343 | ||
344 | fio_gettime(&t, NULL); | |
345 | usec_sleep(td, usec); | |
346 | usec = utime_since_now(&t); | |
347 | ||
348 | td->rate_pending_usleep[ddir] -= usec; | |
349 | ||
350 | odir = ddir ^ 1; | |
351 | if (td_rw(td) && __should_check_rate(td, odir)) | |
352 | td->rate_pending_usleep[odir] -= usec; | |
353 | ||
354 | return ddir; | |
355 | } | |
356 | ||
10ba535a JA |
357 | /* |
358 | * Return the data direction for the next io_u. If the job is a | |
359 | * mixed read/write workload, check the rwmix cycle and switch if | |
360 | * necessary. | |
361 | */ | |
1e97cce9 | 362 | static enum fio_ddir get_rw_ddir(struct thread_data *td) |
10ba535a | 363 | { |
581e7141 JA |
364 | enum fio_ddir ddir; |
365 | ||
5f9099ea JA |
366 | /* |
367 | * see if it's time to fsync | |
368 | */ | |
369 | if (td->o.fsync_blocks && | |
370 | !(td->io_issues[DDIR_WRITE] % td->o.fsync_blocks) && | |
371 | td->io_issues[DDIR_WRITE] && should_fsync(td)) | |
372 | return DDIR_SYNC; | |
373 | ||
374 | /* | |
375 | * see if it's time to fdatasync | |
376 | */ | |
377 | if (td->o.fdatasync_blocks && | |
378 | !(td->io_issues[DDIR_WRITE] % td->o.fdatasync_blocks) && | |
379 | td->io_issues[DDIR_WRITE] && should_fsync(td)) | |
380 | return DDIR_DATASYNC; | |
381 | ||
10ba535a | 382 | if (td_rw(td)) { |
10ba535a JA |
383 | /* |
384 | * Check if it's time to seed a new data direction. | |
385 | */ | |
e4928662 | 386 | if (td->io_issues[td->rwmix_ddir] >= td->rwmix_issues) { |
e47f799f JA |
387 | /* |
388 | * Put a top limit on how many bytes we do for | |
389 | * one data direction, to avoid overflowing the | |
390 | * ranges too much | |
391 | */ | |
392 | ddir = get_rand_ddir(td); | |
e47f799f JA |
393 | |
394 | if (ddir != td->rwmix_ddir) | |
395 | set_rwmix_bytes(td); | |
396 | ||
397 | td->rwmix_ddir = ddir; | |
10ba535a | 398 | } |
581e7141 | 399 | ddir = td->rwmix_ddir; |
10ba535a | 400 | } else if (td_read(td)) |
581e7141 | 401 | ddir = DDIR_READ; |
10ba535a | 402 | else |
581e7141 JA |
403 | ddir = DDIR_WRITE; |
404 | ||
405 | td->rwmix_ddir = rate_ddir(td, ddir); | |
406 | return td->rwmix_ddir; | |
10ba535a JA |
407 | } |
408 | ||
60f2c658 JA |
409 | static void put_file_log(struct thread_data *td, struct fio_file *f) |
410 | { | |
411 | int ret = put_file(td, f); | |
412 | ||
413 | if (ret) | |
414 | td_verror(td, ret, "file close"); | |
415 | } | |
416 | ||
10ba535a JA |
417 | void put_io_u(struct thread_data *td, struct io_u *io_u) |
418 | { | |
0c6e7517 JA |
419 | assert((io_u->flags & IO_U_F_FREE) == 0); |
420 | io_u->flags |= IO_U_F_FREE; | |
421 | ||
60f2c658 JA |
422 | if (io_u->file) |
423 | put_file_log(td, io_u->file); | |
2dbdab7e | 424 | |
10ba535a | 425 | io_u->file = NULL; |
01743ee1 JA |
426 | flist_del(&io_u->list); |
427 | flist_add(&io_u->list, &td->io_u_freelist); | |
10ba535a JA |
428 | td->cur_depth--; |
429 | } | |
430 | ||
f2bba182 RR |
431 | void clear_io_u(struct thread_data *td, struct io_u *io_u) |
432 | { | |
433 | io_u->flags &= ~IO_U_F_FLIGHT; | |
434 | put_io_u(td, io_u); | |
435 | } | |
436 | ||
755200a3 JA |
437 | void requeue_io_u(struct thread_data *td, struct io_u **io_u) |
438 | { | |
439 | struct io_u *__io_u = *io_u; | |
440 | ||
465221b0 JA |
441 | dprint(FD_IO, "requeue %p\n", __io_u); |
442 | ||
4d2e0f49 | 443 | __io_u->flags |= IO_U_F_FREE; |
5f9099ea | 444 | if ((__io_u->flags & IO_U_F_FLIGHT) && !ddir_sync(__io_u->ddir)) |
e4f54adb | 445 | td->io_issues[__io_u->ddir]--; |
5ec10eaa | 446 | |
4d2e0f49 JA |
447 | __io_u->flags &= ~IO_U_F_FLIGHT; |
448 | ||
01743ee1 JA |
449 | flist_del(&__io_u->list); |
450 | flist_add_tail(&__io_u->list, &td->io_u_requeues); | |
755200a3 JA |
451 | td->cur_depth--; |
452 | *io_u = NULL; | |
453 | } | |
454 | ||
9bf2061e | 455 | static int fill_io_u(struct thread_data *td, struct io_u *io_u) |
10ba535a | 456 | { |
b4c5e1ac JA |
457 | if (td->io_ops->flags & FIO_NOIO) |
458 | goto out; | |
459 | ||
5f9099ea JA |
460 | io_u->ddir = get_rw_ddir(td); |
461 | ||
87dc1ab1 | 462 | /* |
5f9099ea | 463 | * fsync() or fdatasync(), we are done |
87dc1ab1 | 464 | */ |
5f9099ea | 465 | if (ddir_sync(io_u->ddir)) |
c38e9468 | 466 | goto out; |
a00735e6 | 467 | |
48f5abd3 JA |
468 | /* |
469 | * See if it's time to switch to a new zone | |
470 | */ | |
471 | if (td->zone_bytes >= td->o.zone_size) { | |
472 | td->zone_bytes = 0; | |
473 | io_u->file->last_pos += td->o.zone_skip; | |
474 | td->io_skip_bytes += td->o.zone_skip; | |
475 | } | |
476 | ||
10ba535a | 477 | /* |
c685b5b2 JA |
478 | * No log, let the seq/rand engine retrieve the next buflen and |
479 | * position. | |
10ba535a | 480 | */ |
2ba1c290 JA |
481 | if (get_next_offset(td, io_u)) { |
482 | dprint(FD_IO, "io_u %p, failed getting offset\n", io_u); | |
bca4ed4d | 483 | return 1; |
2ba1c290 | 484 | } |
10ba535a | 485 | |
9bf2061e | 486 | io_u->buflen = get_next_buflen(td, io_u); |
2ba1c290 JA |
487 | if (!io_u->buflen) { |
488 | dprint(FD_IO, "io_u %p, failed getting buflen\n", io_u); | |
bca4ed4d | 489 | return 1; |
2ba1c290 | 490 | } |
bca4ed4d | 491 | |
2ba1c290 JA |
492 | if (io_u->offset + io_u->buflen > io_u->file->real_file_size) { |
493 | dprint(FD_IO, "io_u %p, offset too large\n", io_u); | |
4ba66134 JA |
494 | dprint(FD_IO, " off=%llu/%lu > %llu\n", io_u->offset, |
495 | io_u->buflen, io_u->file->real_file_size); | |
6a5e6884 | 496 | return 1; |
2ba1c290 | 497 | } |
6a5e6884 | 498 | |
bca4ed4d JA |
499 | /* |
500 | * mark entry before potentially trimming io_u | |
501 | */ | |
303032ae | 502 | if (td_random(td) && file_randommap(td, io_u->file)) |
9bf2061e | 503 | mark_random_map(td, io_u); |
bca4ed4d JA |
504 | |
505 | /* | |
506 | * If using a write iolog, store this entry. | |
507 | */ | |
c38e9468 | 508 | out: |
2ba1c290 | 509 | dprint_io_u(io_u, "fill_io_u"); |
d9d91e39 | 510 | td->zone_bytes += io_u->buflen; |
f29b25a3 | 511 | log_io_u(td, io_u); |
bca4ed4d | 512 | return 0; |
10ba535a JA |
513 | } |
514 | ||
838bc709 JA |
515 | static void __io_u_mark_map(unsigned int *map, unsigned int nr) |
516 | { | |
517 | int index = 0; | |
518 | ||
519 | switch (nr) { | |
520 | default: | |
521 | index = 6; | |
522 | break; | |
523 | case 33 ... 64: | |
524 | index = 5; | |
525 | break; | |
526 | case 17 ... 32: | |
527 | index = 4; | |
528 | break; | |
529 | case 9 ... 16: | |
530 | index = 3; | |
531 | break; | |
532 | case 5 ... 8: | |
533 | index = 2; | |
534 | break; | |
535 | case 1 ... 4: | |
536 | index = 1; | |
537 | case 0: | |
538 | break; | |
539 | } | |
540 | ||
541 | map[index]++; | |
542 | } | |
543 | ||
544 | void io_u_mark_submit(struct thread_data *td, unsigned int nr) | |
545 | { | |
546 | __io_u_mark_map(td->ts.io_u_submit, nr); | |
547 | td->ts.total_submit++; | |
548 | } | |
549 | ||
550 | void io_u_mark_complete(struct thread_data *td, unsigned int nr) | |
551 | { | |
552 | __io_u_mark_map(td->ts.io_u_complete, nr); | |
553 | td->ts.total_complete++; | |
554 | } | |
555 | ||
d8005759 | 556 | void io_u_mark_depth(struct thread_data *td, unsigned int nr) |
71619dc2 JA |
557 | { |
558 | int index = 0; | |
559 | ||
560 | switch (td->cur_depth) { | |
561 | default: | |
a783e61a JA |
562 | index = 6; |
563 | break; | |
71619dc2 | 564 | case 32 ... 63: |
a783e61a JA |
565 | index = 5; |
566 | break; | |
71619dc2 | 567 | case 16 ... 31: |
a783e61a JA |
568 | index = 4; |
569 | break; | |
71619dc2 | 570 | case 8 ... 15: |
a783e61a JA |
571 | index = 3; |
572 | break; | |
71619dc2 | 573 | case 4 ... 7: |
a783e61a JA |
574 | index = 2; |
575 | break; | |
71619dc2 | 576 | case 2 ... 3: |
a783e61a | 577 | index = 1; |
71619dc2 JA |
578 | case 1: |
579 | break; | |
580 | } | |
581 | ||
3bec7ae0 | 582 | td->ts.io_u_map[index] += nr; |
71619dc2 JA |
583 | } |
584 | ||
04a0feae JA |
585 | static void io_u_mark_lat_usec(struct thread_data *td, unsigned long usec) |
586 | { | |
587 | int index = 0; | |
588 | ||
589 | assert(usec < 1000); | |
590 | ||
591 | switch (usec) { | |
592 | case 750 ... 999: | |
593 | index = 9; | |
594 | break; | |
595 | case 500 ... 749: | |
596 | index = 8; | |
597 | break; | |
598 | case 250 ... 499: | |
599 | index = 7; | |
600 | break; | |
601 | case 100 ... 249: | |
602 | index = 6; | |
603 | break; | |
604 | case 50 ... 99: | |
605 | index = 5; | |
606 | break; | |
607 | case 20 ... 49: | |
608 | index = 4; | |
609 | break; | |
610 | case 10 ... 19: | |
611 | index = 3; | |
612 | break; | |
613 | case 4 ... 9: | |
614 | index = 2; | |
615 | break; | |
616 | case 2 ... 3: | |
617 | index = 1; | |
618 | case 0 ... 1: | |
619 | break; | |
620 | } | |
621 | ||
622 | assert(index < FIO_IO_U_LAT_U_NR); | |
623 | td->ts.io_u_lat_u[index]++; | |
624 | } | |
625 | ||
626 | static void io_u_mark_lat_msec(struct thread_data *td, unsigned long msec) | |
ec118304 JA |
627 | { |
628 | int index = 0; | |
629 | ||
630 | switch (msec) { | |
631 | default: | |
04a0feae JA |
632 | index = 11; |
633 | break; | |
8abdce66 | 634 | case 1000 ... 1999: |
04a0feae JA |
635 | index = 10; |
636 | break; | |
8abdce66 | 637 | case 750 ... 999: |
04a0feae JA |
638 | index = 9; |
639 | break; | |
8abdce66 | 640 | case 500 ... 749: |
04a0feae JA |
641 | index = 8; |
642 | break; | |
8abdce66 | 643 | case 250 ... 499: |
04a0feae JA |
644 | index = 7; |
645 | break; | |
8abdce66 | 646 | case 100 ... 249: |
04a0feae JA |
647 | index = 6; |
648 | break; | |
8abdce66 | 649 | case 50 ... 99: |
04a0feae JA |
650 | index = 5; |
651 | break; | |
8abdce66 | 652 | case 20 ... 49: |
04a0feae JA |
653 | index = 4; |
654 | break; | |
8abdce66 | 655 | case 10 ... 19: |
04a0feae JA |
656 | index = 3; |
657 | break; | |
8abdce66 | 658 | case 4 ... 9: |
04a0feae JA |
659 | index = 2; |
660 | break; | |
ec118304 | 661 | case 2 ... 3: |
04a0feae | 662 | index = 1; |
ec118304 JA |
663 | case 0 ... 1: |
664 | break; | |
665 | } | |
666 | ||
04a0feae JA |
667 | assert(index < FIO_IO_U_LAT_M_NR); |
668 | td->ts.io_u_lat_m[index]++; | |
669 | } | |
670 | ||
671 | static void io_u_mark_latency(struct thread_data *td, unsigned long usec) | |
672 | { | |
673 | if (usec < 1000) | |
674 | io_u_mark_lat_usec(td, usec); | |
675 | else | |
676 | io_u_mark_lat_msec(td, usec / 1000); | |
ec118304 JA |
677 | } |
678 | ||
0aabe160 JA |
679 | /* |
680 | * Get next file to service by choosing one at random | |
681 | */ | |
2cc52930 JA |
682 | static struct fio_file *get_next_file_rand(struct thread_data *td, |
683 | enum fio_file_flags goodf, | |
d6aed795 | 684 | enum fio_file_flags badf) |
0aabe160 | 685 | { |
0aabe160 | 686 | struct fio_file *f; |
1c178180 | 687 | int fno; |
0aabe160 JA |
688 | |
689 | do { | |
7c83c089 | 690 | long r = os_random_long(&td->next_file_state); |
87b10676 | 691 | int opened = 0; |
7c83c089 | 692 | |
5ec10eaa | 693 | fno = (unsigned int) ((double) td->o.nr_files |
dc873b6f | 694 | * (r / (OS_RAND_MAX + 1.0))); |
126d65c6 | 695 | f = td->files[fno]; |
d6aed795 | 696 | if (fio_file_done(f)) |
059e63c0 | 697 | continue; |
1c178180 | 698 | |
d6aed795 | 699 | if (!fio_file_open(f)) { |
87b10676 JA |
700 | int err; |
701 | ||
702 | err = td_io_open_file(td, f); | |
703 | if (err) | |
704 | continue; | |
705 | opened = 1; | |
706 | } | |
707 | ||
2ba1c290 JA |
708 | if ((!goodf || (f->flags & goodf)) && !(f->flags & badf)) { |
709 | dprint(FD_FILE, "get_next_file_rand: %p\n", f); | |
0aabe160 | 710 | return f; |
2ba1c290 | 711 | } |
87b10676 JA |
712 | if (opened) |
713 | td_io_close_file(td, f); | |
0aabe160 JA |
714 | } while (1); |
715 | } | |
716 | ||
717 | /* | |
718 | * Get next file to service by doing round robin between all available ones | |
719 | */ | |
1c178180 JA |
720 | static struct fio_file *get_next_file_rr(struct thread_data *td, int goodf, |
721 | int badf) | |
3d7c391d JA |
722 | { |
723 | unsigned int old_next_file = td->next_file; | |
724 | struct fio_file *f; | |
725 | ||
726 | do { | |
87b10676 JA |
727 | int opened = 0; |
728 | ||
126d65c6 | 729 | f = td->files[td->next_file]; |
3d7c391d JA |
730 | |
731 | td->next_file++; | |
2dc1bbeb | 732 | if (td->next_file >= td->o.nr_files) |
3d7c391d JA |
733 | td->next_file = 0; |
734 | ||
87b10676 | 735 | dprint(FD_FILE, "trying file %s %x\n", f->file_name, f->flags); |
d6aed795 | 736 | if (fio_file_done(f)) { |
d5ed68ea | 737 | f = NULL; |
059e63c0 | 738 | continue; |
d5ed68ea | 739 | } |
059e63c0 | 740 | |
d6aed795 | 741 | if (!fio_file_open(f)) { |
87b10676 JA |
742 | int err; |
743 | ||
744 | err = td_io_open_file(td, f); | |
b5696bfc JA |
745 | if (err) { |
746 | dprint(FD_FILE, "error %d on open of %s\n", | |
747 | err, f->file_name); | |
87c27b45 | 748 | f = NULL; |
87b10676 | 749 | continue; |
b5696bfc | 750 | } |
87b10676 JA |
751 | opened = 1; |
752 | } | |
753 | ||
b5696bfc | 754 | dprint(FD_FILE, "goodf=%x, badf=%x, ff=%x\n", goodf, badf, f->flags); |
1c178180 | 755 | if ((!goodf || (f->flags & goodf)) && !(f->flags & badf)) |
3d7c391d JA |
756 | break; |
757 | ||
87b10676 JA |
758 | if (opened) |
759 | td_io_close_file(td, f); | |
760 | ||
3d7c391d JA |
761 | f = NULL; |
762 | } while (td->next_file != old_next_file); | |
763 | ||
2ba1c290 | 764 | dprint(FD_FILE, "get_next_file_rr: %p\n", f); |
3d7c391d JA |
765 | return f; |
766 | } | |
767 | ||
bdb4e2e9 JA |
768 | static struct fio_file *get_next_file(struct thread_data *td) |
769 | { | |
1907dbc6 JA |
770 | struct fio_file *f; |
771 | ||
2dc1bbeb | 772 | assert(td->o.nr_files <= td->files_index); |
1c178180 | 773 | |
b5696bfc | 774 | if (td->nr_done_files >= td->o.nr_files) { |
5ec10eaa JA |
775 | dprint(FD_FILE, "get_next_file: nr_open=%d, nr_done=%d," |
776 | " nr_files=%d\n", td->nr_open_files, | |
777 | td->nr_done_files, | |
778 | td->o.nr_files); | |
bdb4e2e9 | 779 | return NULL; |
2ba1c290 | 780 | } |
bdb4e2e9 | 781 | |
1907dbc6 | 782 | f = td->file_service_file; |
d6aed795 | 783 | if (f && fio_file_open(f) && !fio_file_closing(f)) { |
a086c257 JA |
784 | if (td->o.file_service_type == FIO_FSERVICE_SEQ) |
785 | goto out; | |
786 | if (td->file_service_left--) | |
787 | goto out; | |
788 | } | |
1907dbc6 | 789 | |
a086c257 JA |
790 | if (td->o.file_service_type == FIO_FSERVICE_RR || |
791 | td->o.file_service_type == FIO_FSERVICE_SEQ) | |
d6aed795 | 792 | f = get_next_file_rr(td, FIO_FILE_open, FIO_FILE_closing); |
bdb4e2e9 | 793 | else |
d6aed795 | 794 | f = get_next_file_rand(td, FIO_FILE_open, FIO_FILE_closing); |
1907dbc6 JA |
795 | |
796 | td->file_service_file = f; | |
797 | td->file_service_left = td->file_service_nr - 1; | |
2ba1c290 | 798 | out: |
683023e8 | 799 | dprint(FD_FILE, "get_next_file: %p [%s]\n", f, f->file_name); |
1907dbc6 | 800 | return f; |
bdb4e2e9 JA |
801 | } |
802 | ||
429f6675 JA |
803 | static int set_io_u_file(struct thread_data *td, struct io_u *io_u) |
804 | { | |
805 | struct fio_file *f; | |
806 | ||
807 | do { | |
808 | f = get_next_file(td); | |
809 | if (!f) | |
810 | return 1; | |
811 | ||
429f6675 JA |
812 | io_u->file = f; |
813 | get_file(f); | |
814 | ||
815 | if (!fill_io_u(td, io_u)) | |
816 | break; | |
817 | ||
b5696bfc | 818 | put_file_log(td, f); |
429f6675 | 819 | td_io_close_file(td, f); |
b5696bfc | 820 | io_u->file = NULL; |
d6aed795 | 821 | fio_file_set_done(f); |
429f6675 | 822 | td->nr_done_files++; |
87b10676 | 823 | dprint(FD_FILE, "%s: is done (%d of %d)\n", f->file_name, td->nr_done_files, td->o.nr_files); |
429f6675 JA |
824 | } while (1); |
825 | ||
826 | return 0; | |
827 | } | |
828 | ||
829 | ||
10ba535a JA |
830 | struct io_u *__get_io_u(struct thread_data *td) |
831 | { | |
832 | struct io_u *io_u = NULL; | |
833 | ||
01743ee1 JA |
834 | if (!flist_empty(&td->io_u_requeues)) |
835 | io_u = flist_entry(td->io_u_requeues.next, struct io_u, list); | |
755200a3 | 836 | else if (!queue_full(td)) { |
01743ee1 | 837 | io_u = flist_entry(td->io_u_freelist.next, struct io_u, list); |
10ba535a | 838 | |
6040dabc | 839 | io_u->buflen = 0; |
10ba535a | 840 | io_u->resid = 0; |
755200a3 | 841 | io_u->file = NULL; |
d7762cf8 | 842 | io_u->end_io = NULL; |
755200a3 JA |
843 | } |
844 | ||
845 | if (io_u) { | |
0c6e7517 JA |
846 | assert(io_u->flags & IO_U_F_FREE); |
847 | io_u->flags &= ~IO_U_F_FREE; | |
848 | ||
755200a3 | 849 | io_u->error = 0; |
01743ee1 JA |
850 | flist_del(&io_u->list); |
851 | flist_add(&io_u->list, &td->io_u_busylist); | |
10ba535a JA |
852 | td->cur_depth++; |
853 | } | |
854 | ||
855 | return io_u; | |
856 | } | |
857 | ||
858 | /* | |
859 | * Return an io_u to be processed. Gets a buflen and offset, sets direction, | |
860 | * etc. The returned io_u is fully ready to be prepped and submitted. | |
861 | */ | |
3d7c391d | 862 | struct io_u *get_io_u(struct thread_data *td) |
10ba535a | 863 | { |
3d7c391d | 864 | struct fio_file *f; |
10ba535a JA |
865 | struct io_u *io_u; |
866 | ||
867 | io_u = __get_io_u(td); | |
2ba1c290 JA |
868 | if (!io_u) { |
869 | dprint(FD_IO, "__get_io_u failed\n"); | |
10ba535a | 870 | return NULL; |
2ba1c290 | 871 | } |
10ba535a | 872 | |
755200a3 JA |
873 | /* |
874 | * from a requeue, io_u already setup | |
875 | */ | |
876 | if (io_u->file) | |
77f392bf | 877 | goto out; |
755200a3 | 878 | |
429f6675 JA |
879 | /* |
880 | * If using an iolog, grab next piece if any available. | |
881 | */ | |
882 | if (td->o.read_iolog_file) { | |
883 | if (read_iolog_get(td, io_u)) | |
884 | goto err_put; | |
2ba1c290 JA |
885 | } else if (set_io_u_file(td, io_u)) { |
886 | dprint(FD_IO, "io_u %p, setting file failed\n", io_u); | |
429f6675 | 887 | goto err_put; |
2ba1c290 | 888 | } |
5ec10eaa | 889 | |
429f6675 | 890 | f = io_u->file; |
d6aed795 | 891 | assert(fio_file_open(f)); |
97af62ce | 892 | |
5f9099ea | 893 | if (!ddir_sync(io_u->ddir)) { |
d0656a93 | 894 | if (!io_u->buflen && !(td->io_ops->flags & FIO_NOIO)) { |
2ba1c290 | 895 | dprint(FD_IO, "get_io_u: zero buflen on %p\n", io_u); |
429f6675 | 896 | goto err_put; |
2ba1c290 | 897 | } |
10ba535a | 898 | |
36167d82 | 899 | f->last_pos = io_u->offset + io_u->buflen; |
10ba535a | 900 | |
c311cd2a | 901 | if (td->o.verify != VERIFY_NONE && io_u->ddir == DDIR_WRITE) |
87dc1ab1 | 902 | populate_verify_io_u(td, io_u); |
e4dad9c6 JA |
903 | else if (td->o.refill_buffers && io_u->ddir == DDIR_WRITE) |
904 | io_u_fill_buffer(td, io_u, io_u->xfer_buflen); | |
87dc1ab1 | 905 | } |
10ba535a | 906 | |
165faf16 JA |
907 | /* |
908 | * Set io data pointers. | |
909 | */ | |
cec6b55d JA |
910 | io_u->xfer_buf = io_u->buf; |
911 | io_u->xfer_buflen = io_u->buflen; | |
5973cafb | 912 | |
6ac7a331 | 913 | out: |
429f6675 | 914 | if (!td_io_prep(td, io_u)) { |
993bf48b JA |
915 | if (!td->o.disable_slat) |
916 | fio_gettime(&io_u->start_time, NULL); | |
429f6675 | 917 | return io_u; |
36167d82 | 918 | } |
429f6675 | 919 | err_put: |
2ba1c290 | 920 | dprint(FD_IO, "get_io_u failed\n"); |
429f6675 JA |
921 | put_io_u(td, io_u); |
922 | return NULL; | |
10ba535a JA |
923 | } |
924 | ||
5451792e JA |
925 | void io_u_log_error(struct thread_data *td, struct io_u *io_u) |
926 | { | |
927 | const char *msg[] = { "read", "write", "sync" }; | |
928 | ||
929 | log_err("fio: io_u error"); | |
930 | ||
931 | if (io_u->file) | |
932 | log_err(" on file %s", io_u->file->file_name); | |
933 | ||
934 | log_err(": %s\n", strerror(io_u->error)); | |
935 | ||
5ec10eaa JA |
936 | log_err(" %s offset=%llu, buflen=%lu\n", msg[io_u->ddir], |
937 | io_u->offset, io_u->xfer_buflen); | |
5451792e JA |
938 | |
939 | if (!td->error) | |
940 | td_verror(td, io_u->error, "io_u error"); | |
941 | } | |
942 | ||
97601024 JA |
943 | static void io_completed(struct thread_data *td, struct io_u *io_u, |
944 | struct io_completion_data *icd) | |
10ba535a | 945 | { |
dbad30b0 JA |
946 | /* |
947 | * Older gcc's are too dumb to realize that usec is always used | |
948 | * initialized, silence that warning. | |
949 | */ | |
950 | unsigned long uninitialized_var(usec); | |
10ba535a | 951 | |
2ba1c290 JA |
952 | dprint_io_u(io_u, "io complete"); |
953 | ||
0c6e7517 JA |
954 | assert(io_u->flags & IO_U_F_FLIGHT); |
955 | io_u->flags &= ~IO_U_F_FLIGHT; | |
956 | ||
5f9099ea | 957 | if (ddir_sync(io_u->ddir)) { |
87dc1ab1 JA |
958 | td->last_was_sync = 1; |
959 | return; | |
960 | } | |
961 | ||
962 | td->last_was_sync = 0; | |
963 | ||
10ba535a JA |
964 | if (!io_u->error) { |
965 | unsigned int bytes = io_u->buflen - io_u->resid; | |
1e97cce9 | 966 | const enum fio_ddir idx = io_u->ddir; |
b29ee5b3 | 967 | int ret; |
10ba535a | 968 | |
b29ee5b3 JA |
969 | td->io_blocks[idx]++; |
970 | td->io_bytes[idx] += bytes; | |
971 | td->this_io_bytes[idx] += bytes; | |
10ba535a | 972 | |
b29ee5b3 | 973 | if (ramp_time_over(td)) { |
40e1a6f0 JA |
974 | unsigned long uninitialized_var(lusec); |
975 | unsigned long uninitialized_var(rusec); | |
976 | ||
977 | if (!td->o.disable_clat || !td->o.disable_bw) | |
978 | lusec = utime_since(&io_u->issue_time, | |
979 | &icd->time); | |
980 | if (__should_check_rate(td, idx) || | |
981 | __should_check_rate(td, idx ^ 1)) | |
982 | rusec = utime_since(&io_u->start_time, | |
9520ebb9 | 983 | &icd->time); |
721938ae | 984 | |
9520ebb9 | 985 | if (!td->o.disable_clat) { |
306ddc97 | 986 | add_clat_sample(td, idx, usec, bytes); |
40e1a6f0 | 987 | io_u_mark_latency(td, lusec); |
9520ebb9 JA |
988 | } |
989 | if (!td->o.disable_bw) | |
306ddc97 | 990 | add_bw_sample(td, idx, bytes, &icd->time); |
b23b6a2f JA |
991 | if (__should_check_rate(td, idx)) { |
992 | td->rate_pending_usleep[idx] += | |
993 | (long) td->rate_usec_cycle[idx] - rusec; | |
994 | } | |
581e7141 | 995 | if (__should_check_rate(td, idx ^ 1)) |
b23b6a2f | 996 | td->rate_pending_usleep[idx ^ 1] -= rusec; |
721938ae | 997 | } |
10ba535a | 998 | |
660a1cb5 | 999 | if (td_write(td) && idx == DDIR_WRITE && |
8670579e | 1000 | td->o.do_verify && |
41128405 | 1001 | td->o.verify != VERIFY_NONE) |
10ba535a JA |
1002 | log_io_piece(td, io_u); |
1003 | ||
b29ee5b3 | 1004 | icd->bytes_done[idx] += bytes; |
3af6ef39 | 1005 | |
d7762cf8 | 1006 | if (io_u->end_io) { |
36690c9b | 1007 | ret = io_u->end_io(td, io_u); |
3af6ef39 JA |
1008 | if (ret && !icd->error) |
1009 | icd->error = ret; | |
1010 | } | |
5451792e | 1011 | } else { |
10ba535a | 1012 | icd->error = io_u->error; |
5451792e JA |
1013 | io_u_log_error(td, io_u); |
1014 | } | |
f2bba182 RR |
1015 | if (td->o.continue_on_error && icd->error && |
1016 | td_non_fatal_error(icd->error)) { | |
1017 | /* | |
1018 | * If there is a non_fatal error, then add to the error count | |
1019 | * and clear all the errors. | |
1020 | */ | |
1021 | update_error_count(td, icd->error); | |
1022 | td_clear_error(td); | |
1023 | icd->error = 0; | |
1024 | io_u->error = 0; | |
1025 | } | |
10ba535a JA |
1026 | } |
1027 | ||
9520ebb9 JA |
1028 | static void init_icd(struct thread_data *td, struct io_completion_data *icd, |
1029 | int nr) | |
10ba535a | 1030 | { |
9520ebb9 JA |
1031 | if (!td->o.disable_clat || !td->o.disable_bw) |
1032 | fio_gettime(&icd->time, NULL); | |
02bcaa8c | 1033 | |
3af6ef39 JA |
1034 | icd->nr = nr; |
1035 | ||
10ba535a JA |
1036 | icd->error = 0; |
1037 | icd->bytes_done[0] = icd->bytes_done[1] = 0; | |
36167d82 JA |
1038 | } |
1039 | ||
97601024 JA |
1040 | static void ios_completed(struct thread_data *td, |
1041 | struct io_completion_data *icd) | |
36167d82 JA |
1042 | { |
1043 | struct io_u *io_u; | |
1044 | int i; | |
1045 | ||
10ba535a JA |
1046 | for (i = 0; i < icd->nr; i++) { |
1047 | io_u = td->io_ops->event(td, i); | |
1048 | ||
1049 | io_completed(td, io_u, icd); | |
1050 | put_io_u(td, io_u); | |
1051 | } | |
1052 | } | |
97601024 | 1053 | |
e7e6cfb4 JA |
1054 | /* |
1055 | * Complete a single io_u for the sync engines. | |
1056 | */ | |
581e7141 JA |
1057 | int io_u_sync_complete(struct thread_data *td, struct io_u *io_u, |
1058 | unsigned long *bytes) | |
97601024 JA |
1059 | { |
1060 | struct io_completion_data icd; | |
1061 | ||
9520ebb9 | 1062 | init_icd(td, &icd, 1); |
97601024 JA |
1063 | io_completed(td, io_u, &icd); |
1064 | put_io_u(td, io_u); | |
1065 | ||
581e7141 JA |
1066 | if (icd.error) { |
1067 | td_verror(td, icd.error, "io_u_sync_complete"); | |
1068 | return -1; | |
1069 | } | |
97601024 | 1070 | |
581e7141 JA |
1071 | if (bytes) { |
1072 | bytes[0] += icd.bytes_done[0]; | |
1073 | bytes[1] += icd.bytes_done[1]; | |
1074 | } | |
1075 | ||
1076 | return 0; | |
97601024 JA |
1077 | } |
1078 | ||
e7e6cfb4 JA |
1079 | /* |
1080 | * Called to complete min_events number of io for the async engines. | |
1081 | */ | |
581e7141 JA |
1082 | int io_u_queued_complete(struct thread_data *td, int min_evts, |
1083 | unsigned long *bytes) | |
97601024 | 1084 | { |
97601024 | 1085 | struct io_completion_data icd; |
00de55ef | 1086 | struct timespec *tvp = NULL; |
97601024 | 1087 | int ret; |
4d06a338 | 1088 | struct timespec ts = { .tv_sec = 0, .tv_nsec = 0, }; |
97601024 | 1089 | |
4950421a | 1090 | dprint(FD_IO, "io_u_queued_completed: min=%d\n", min_evts); |
b271fe62 | 1091 | |
4950421a | 1092 | if (!min_evts) |
00de55ef | 1093 | tvp = &ts; |
97601024 | 1094 | |
4950421a | 1095 | ret = td_io_getevents(td, min_evts, td->o.iodepth_batch_complete, tvp); |
97601024 | 1096 | if (ret < 0) { |
e1161c32 | 1097 | td_verror(td, -ret, "td_io_getevents"); |
97601024 JA |
1098 | return ret; |
1099 | } else if (!ret) | |
1100 | return ret; | |
1101 | ||
9520ebb9 | 1102 | init_icd(td, &icd, ret); |
97601024 | 1103 | ios_completed(td, &icd); |
581e7141 JA |
1104 | if (icd.error) { |
1105 | td_verror(td, icd.error, "io_u_queued_complete"); | |
1106 | return -1; | |
1107 | } | |
97601024 | 1108 | |
581e7141 JA |
1109 | if (bytes) { |
1110 | bytes[0] += icd.bytes_done[0]; | |
1111 | bytes[1] += icd.bytes_done[1]; | |
1112 | } | |
1113 | ||
1114 | return 0; | |
97601024 | 1115 | } |
7e77dd02 JA |
1116 | |
1117 | /* | |
1118 | * Call when io_u is really queued, to update the submission latency. | |
1119 | */ | |
1120 | void io_u_queued(struct thread_data *td, struct io_u *io_u) | |
1121 | { | |
9520ebb9 JA |
1122 | if (!td->o.disable_slat) { |
1123 | unsigned long slat_time; | |
7e77dd02 | 1124 | |
9520ebb9 | 1125 | slat_time = utime_since(&io_u->start_time, &io_u->issue_time); |
29a90ddb | 1126 | add_slat_sample(td, io_u->ddir, slat_time, io_u->xfer_buflen); |
9520ebb9 | 1127 | } |
7e77dd02 | 1128 | } |
433afcb4 | 1129 | |
5973cafb JA |
1130 | /* |
1131 | * "randomly" fill the buffer contents | |
1132 | */ | |
1133 | void io_u_fill_buffer(struct thread_data *td, struct io_u *io_u, | |
1134 | unsigned int max_bs) | |
1135 | { | |
1136 | long *ptr = io_u->buf; | |
1137 | ||
1138 | if (!td->o.zero_buffers) { | |
1139 | while ((void *) ptr - io_u->buf < max_bs) { | |
1140 | *ptr = rand() * GOLDEN_RATIO_PRIME; | |
1141 | ptr++; | |
1142 | } | |
1143 | } else | |
1144 | memset(ptr, 0, max_bs); | |
1145 | } |