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 | */ | |
15dc1934 | 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 | ||
15dc1934 JA |
234 | static int get_next_offset(struct thread_data *td, struct io_u *io_u) |
235 | { | |
7eb36574 JA |
236 | struct prof_io_ops *ops = &td->prof_io_ops; |
237 | ||
238 | if (ops->fill_io_u_off) | |
239 | return ops->fill_io_u_off(td, io_u); | |
15dc1934 JA |
240 | |
241 | return __get_next_offset(td, io_u); | |
242 | } | |
243 | ||
244 | static unsigned int __get_next_buflen(struct thread_data *td, struct io_u *io_u) | |
10ba535a | 245 | { |
bca4ed4d | 246 | const int ddir = io_u->ddir; |
f3f552b9 | 247 | unsigned int uninitialized_var(buflen); |
f3059de1 | 248 | unsigned int minbs, maxbs; |
10ba535a JA |
249 | long r; |
250 | ||
f3059de1 JA |
251 | minbs = td->o.min_bs[ddir]; |
252 | maxbs = td->o.max_bs[ddir]; | |
253 | ||
254 | if (minbs == maxbs) | |
255 | buflen = minbs; | |
10ba535a JA |
256 | else { |
257 | r = os_random_long(&td->bsrange_state); | |
720e84ad | 258 | if (!td->o.bssplit_nr[ddir]) { |
f3059de1 JA |
259 | buflen = 1 + (unsigned int) ((double) maxbs * |
260 | (r / (OS_RAND_MAX + 1.0))); | |
261 | if (buflen < minbs) | |
262 | buflen = minbs; | |
5ec10eaa | 263 | } else { |
564ca972 JA |
264 | long perc = 0; |
265 | unsigned int i; | |
266 | ||
720e84ad JA |
267 | for (i = 0; i < td->o.bssplit_nr[ddir]; i++) { |
268 | struct bssplit *bsp = &td->o.bssplit[ddir][i]; | |
564ca972 JA |
269 | |
270 | buflen = bsp->bs; | |
271 | perc += bsp->perc; | |
f3059de1 | 272 | if (r <= ((OS_RAND_MAX / 100L) * perc)) |
564ca972 JA |
273 | break; |
274 | } | |
275 | } | |
f3059de1 JA |
276 | if (!td->o.bs_unaligned && is_power_of_2(minbs)) |
277 | buflen = (buflen + minbs - 1) & ~(minbs - 1); | |
10ba535a JA |
278 | } |
279 | ||
4ba66134 JA |
280 | if (io_u->offset + buflen > io_u->file->real_file_size) { |
281 | dprint(FD_IO, "lower buflen %u -> %u (ddir=%d)\n", buflen, | |
f3059de1 JA |
282 | minbs, ddir); |
283 | buflen = minbs; | |
4ba66134 | 284 | } |
6a5e6884 | 285 | |
10ba535a JA |
286 | return buflen; |
287 | } | |
288 | ||
15dc1934 JA |
289 | static unsigned int get_next_buflen(struct thread_data *td, struct io_u *io_u) |
290 | { | |
7eb36574 JA |
291 | struct prof_io_ops *ops = &td->prof_io_ops; |
292 | ||
293 | if (ops->fill_io_u_size) | |
294 | return ops->fill_io_u_size(td, io_u); | |
15dc1934 JA |
295 | |
296 | return __get_next_buflen(td, io_u); | |
297 | } | |
298 | ||
afe24a5a JA |
299 | static void set_rwmix_bytes(struct thread_data *td) |
300 | { | |
afe24a5a JA |
301 | unsigned int diff; |
302 | ||
303 | /* | |
304 | * we do time or byte based switch. this is needed because | |
305 | * buffered writes may issue a lot quicker than they complete, | |
306 | * whereas reads do not. | |
307 | */ | |
e47f799f | 308 | diff = td->o.rwmix[td->rwmix_ddir ^ 1]; |
04c540d9 | 309 | td->rwmix_issues = (td->io_issues[td->rwmix_ddir] * diff) / 100; |
e47f799f JA |
310 | } |
311 | ||
312 | static inline enum fio_ddir get_rand_ddir(struct thread_data *td) | |
313 | { | |
314 | unsigned int v; | |
315 | long r; | |
316 | ||
317 | r = os_random_long(&td->rwmix_state); | |
dc873b6f | 318 | v = 1 + (int) (100.0 * (r / (OS_RAND_MAX + 1.0))); |
04c540d9 | 319 | if (v <= td->o.rwmix[DDIR_READ]) |
e47f799f JA |
320 | return DDIR_READ; |
321 | ||
322 | return DDIR_WRITE; | |
afe24a5a JA |
323 | } |
324 | ||
581e7141 JA |
325 | static enum fio_ddir rate_ddir(struct thread_data *td, enum fio_ddir ddir) |
326 | { | |
327 | enum fio_ddir odir = ddir ^ 1; | |
328 | struct timeval t; | |
329 | long usec; | |
330 | ||
331 | if (td->rate_pending_usleep[ddir] <= 0) | |
332 | return ddir; | |
333 | ||
334 | /* | |
335 | * We have too much pending sleep in this direction. See if we | |
336 | * should switch. | |
337 | */ | |
338 | if (td_rw(td)) { | |
339 | /* | |
340 | * Other direction does not have too much pending, switch | |
341 | */ | |
342 | if (td->rate_pending_usleep[odir] < 100000) | |
343 | return odir; | |
344 | ||
345 | /* | |
346 | * Both directions have pending sleep. Sleep the minimum time | |
347 | * and deduct from both. | |
348 | */ | |
349 | if (td->rate_pending_usleep[ddir] <= | |
350 | td->rate_pending_usleep[odir]) { | |
351 | usec = td->rate_pending_usleep[ddir]; | |
352 | } else { | |
353 | usec = td->rate_pending_usleep[odir]; | |
354 | ddir = odir; | |
355 | } | |
356 | } else | |
357 | usec = td->rate_pending_usleep[ddir]; | |
358 | ||
359 | fio_gettime(&t, NULL); | |
360 | usec_sleep(td, usec); | |
361 | usec = utime_since_now(&t); | |
362 | ||
363 | td->rate_pending_usleep[ddir] -= usec; | |
364 | ||
365 | odir = ddir ^ 1; | |
366 | if (td_rw(td) && __should_check_rate(td, odir)) | |
367 | td->rate_pending_usleep[odir] -= usec; | |
0b9d69ec | 368 | |
581e7141 JA |
369 | return ddir; |
370 | } | |
371 | ||
10ba535a JA |
372 | /* |
373 | * Return the data direction for the next io_u. If the job is a | |
374 | * mixed read/write workload, check the rwmix cycle and switch if | |
375 | * necessary. | |
376 | */ | |
1e97cce9 | 377 | static enum fio_ddir get_rw_ddir(struct thread_data *td) |
10ba535a | 378 | { |
581e7141 JA |
379 | enum fio_ddir ddir; |
380 | ||
5f9099ea JA |
381 | /* |
382 | * see if it's time to fsync | |
383 | */ | |
384 | if (td->o.fsync_blocks && | |
385 | !(td->io_issues[DDIR_WRITE] % td->o.fsync_blocks) && | |
386 | td->io_issues[DDIR_WRITE] && should_fsync(td)) | |
387 | return DDIR_SYNC; | |
388 | ||
389 | /* | |
390 | * see if it's time to fdatasync | |
391 | */ | |
392 | if (td->o.fdatasync_blocks && | |
393 | !(td->io_issues[DDIR_WRITE] % td->o.fdatasync_blocks) && | |
394 | td->io_issues[DDIR_WRITE] && should_fsync(td)) | |
395 | return DDIR_DATASYNC; | |
396 | ||
10ba535a | 397 | if (td_rw(td)) { |
10ba535a JA |
398 | /* |
399 | * Check if it's time to seed a new data direction. | |
400 | */ | |
e4928662 | 401 | if (td->io_issues[td->rwmix_ddir] >= td->rwmix_issues) { |
e47f799f JA |
402 | /* |
403 | * Put a top limit on how many bytes we do for | |
404 | * one data direction, to avoid overflowing the | |
405 | * ranges too much | |
406 | */ | |
407 | ddir = get_rand_ddir(td); | |
e47f799f JA |
408 | |
409 | if (ddir != td->rwmix_ddir) | |
410 | set_rwmix_bytes(td); | |
411 | ||
412 | td->rwmix_ddir = ddir; | |
10ba535a | 413 | } |
581e7141 | 414 | ddir = td->rwmix_ddir; |
10ba535a | 415 | } else if (td_read(td)) |
581e7141 | 416 | ddir = DDIR_READ; |
10ba535a | 417 | else |
581e7141 JA |
418 | ddir = DDIR_WRITE; |
419 | ||
420 | td->rwmix_ddir = rate_ddir(td, ddir); | |
421 | return td->rwmix_ddir; | |
10ba535a JA |
422 | } |
423 | ||
e8462bd8 | 424 | void put_file_log(struct thread_data *td, struct fio_file *f) |
60f2c658 JA |
425 | { |
426 | int ret = put_file(td, f); | |
427 | ||
428 | if (ret) | |
429 | td_verror(td, ret, "file close"); | |
430 | } | |
431 | ||
10ba535a JA |
432 | void put_io_u(struct thread_data *td, struct io_u *io_u) |
433 | { | |
e8462bd8 JA |
434 | td_io_u_lock(td); |
435 | ||
0c6e7517 | 436 | io_u->flags |= IO_U_F_FREE; |
e8462bd8 | 437 | io_u->flags &= ~IO_U_F_FREE_DEF; |
0c6e7517 | 438 | |
60f2c658 JA |
439 | if (io_u->file) |
440 | put_file_log(td, io_u->file); | |
2dbdab7e | 441 | |
10ba535a | 442 | io_u->file = NULL; |
0c41214f RR |
443 | if (io_u->flags & IO_U_F_IN_CUR_DEPTH) |
444 | td->cur_depth--; | |
e8462bd8 | 445 | flist_del_init(&io_u->list); |
01743ee1 | 446 | flist_add(&io_u->list, &td->io_u_freelist); |
e8462bd8 JA |
447 | td_io_u_unlock(td); |
448 | td_io_u_free_notify(td); | |
10ba535a JA |
449 | } |
450 | ||
f2bba182 RR |
451 | void clear_io_u(struct thread_data *td, struct io_u *io_u) |
452 | { | |
453 | io_u->flags &= ~IO_U_F_FLIGHT; | |
454 | put_io_u(td, io_u); | |
455 | } | |
456 | ||
755200a3 JA |
457 | void requeue_io_u(struct thread_data *td, struct io_u **io_u) |
458 | { | |
459 | struct io_u *__io_u = *io_u; | |
460 | ||
465221b0 JA |
461 | dprint(FD_IO, "requeue %p\n", __io_u); |
462 | ||
e8462bd8 JA |
463 | td_io_u_lock(td); |
464 | ||
4d2e0f49 | 465 | __io_u->flags |= IO_U_F_FREE; |
5f9099ea | 466 | if ((__io_u->flags & IO_U_F_FLIGHT) && !ddir_sync(__io_u->ddir)) |
e4f54adb | 467 | td->io_issues[__io_u->ddir]--; |
5ec10eaa | 468 | |
4d2e0f49 | 469 | __io_u->flags &= ~IO_U_F_FLIGHT; |
0c41214f RR |
470 | if (__io_u->flags & IO_U_F_IN_CUR_DEPTH) |
471 | td->cur_depth--; | |
01743ee1 JA |
472 | flist_del(&__io_u->list); |
473 | flist_add_tail(&__io_u->list, &td->io_u_requeues); | |
e8462bd8 | 474 | td_io_u_unlock(td); |
755200a3 JA |
475 | *io_u = NULL; |
476 | } | |
477 | ||
9bf2061e | 478 | static int fill_io_u(struct thread_data *td, struct io_u *io_u) |
10ba535a | 479 | { |
b4c5e1ac JA |
480 | if (td->io_ops->flags & FIO_NOIO) |
481 | goto out; | |
482 | ||
5f9099ea JA |
483 | io_u->ddir = get_rw_ddir(td); |
484 | ||
87dc1ab1 | 485 | /* |
5f9099ea | 486 | * fsync() or fdatasync(), we are done |
87dc1ab1 | 487 | */ |
5f9099ea | 488 | if (ddir_sync(io_u->ddir)) |
c38e9468 | 489 | goto out; |
a00735e6 | 490 | |
48f5abd3 JA |
491 | /* |
492 | * See if it's time to switch to a new zone | |
493 | */ | |
494 | if (td->zone_bytes >= td->o.zone_size) { | |
495 | td->zone_bytes = 0; | |
496 | io_u->file->last_pos += td->o.zone_skip; | |
497 | td->io_skip_bytes += td->o.zone_skip; | |
498 | } | |
499 | ||
10ba535a | 500 | /* |
c685b5b2 JA |
501 | * No log, let the seq/rand engine retrieve the next buflen and |
502 | * position. | |
10ba535a | 503 | */ |
2ba1c290 JA |
504 | if (get_next_offset(td, io_u)) { |
505 | dprint(FD_IO, "io_u %p, failed getting offset\n", io_u); | |
bca4ed4d | 506 | return 1; |
2ba1c290 | 507 | } |
10ba535a | 508 | |
9bf2061e | 509 | io_u->buflen = get_next_buflen(td, io_u); |
2ba1c290 JA |
510 | if (!io_u->buflen) { |
511 | dprint(FD_IO, "io_u %p, failed getting buflen\n", io_u); | |
bca4ed4d | 512 | return 1; |
2ba1c290 | 513 | } |
bca4ed4d | 514 | |
2ba1c290 JA |
515 | if (io_u->offset + io_u->buflen > io_u->file->real_file_size) { |
516 | dprint(FD_IO, "io_u %p, offset too large\n", io_u); | |
4ba66134 JA |
517 | dprint(FD_IO, " off=%llu/%lu > %llu\n", io_u->offset, |
518 | io_u->buflen, io_u->file->real_file_size); | |
6a5e6884 | 519 | return 1; |
2ba1c290 | 520 | } |
6a5e6884 | 521 | |
bca4ed4d JA |
522 | /* |
523 | * mark entry before potentially trimming io_u | |
524 | */ | |
303032ae | 525 | if (td_random(td) && file_randommap(td, io_u->file)) |
9bf2061e | 526 | mark_random_map(td, io_u); |
bca4ed4d JA |
527 | |
528 | /* | |
529 | * If using a write iolog, store this entry. | |
530 | */ | |
c38e9468 | 531 | out: |
2ba1c290 | 532 | dprint_io_u(io_u, "fill_io_u"); |
d9d91e39 | 533 | td->zone_bytes += io_u->buflen; |
f29b25a3 | 534 | log_io_u(td, io_u); |
bca4ed4d | 535 | return 0; |
10ba535a JA |
536 | } |
537 | ||
838bc709 JA |
538 | static void __io_u_mark_map(unsigned int *map, unsigned int nr) |
539 | { | |
540 | int index = 0; | |
541 | ||
542 | switch (nr) { | |
543 | default: | |
544 | index = 6; | |
545 | break; | |
546 | case 33 ... 64: | |
547 | index = 5; | |
548 | break; | |
549 | case 17 ... 32: | |
550 | index = 4; | |
551 | break; | |
552 | case 9 ... 16: | |
553 | index = 3; | |
554 | break; | |
555 | case 5 ... 8: | |
556 | index = 2; | |
557 | break; | |
558 | case 1 ... 4: | |
559 | index = 1; | |
560 | case 0: | |
561 | break; | |
562 | } | |
563 | ||
564 | map[index]++; | |
565 | } | |
566 | ||
567 | void io_u_mark_submit(struct thread_data *td, unsigned int nr) | |
568 | { | |
569 | __io_u_mark_map(td->ts.io_u_submit, nr); | |
570 | td->ts.total_submit++; | |
571 | } | |
572 | ||
573 | void io_u_mark_complete(struct thread_data *td, unsigned int nr) | |
574 | { | |
575 | __io_u_mark_map(td->ts.io_u_complete, nr); | |
576 | td->ts.total_complete++; | |
577 | } | |
578 | ||
d8005759 | 579 | void io_u_mark_depth(struct thread_data *td, unsigned int nr) |
71619dc2 JA |
580 | { |
581 | int index = 0; | |
582 | ||
583 | switch (td->cur_depth) { | |
584 | default: | |
a783e61a JA |
585 | index = 6; |
586 | break; | |
71619dc2 | 587 | case 32 ... 63: |
a783e61a JA |
588 | index = 5; |
589 | break; | |
71619dc2 | 590 | case 16 ... 31: |
a783e61a JA |
591 | index = 4; |
592 | break; | |
71619dc2 | 593 | case 8 ... 15: |
a783e61a JA |
594 | index = 3; |
595 | break; | |
71619dc2 | 596 | case 4 ... 7: |
a783e61a JA |
597 | index = 2; |
598 | break; | |
71619dc2 | 599 | case 2 ... 3: |
a783e61a | 600 | index = 1; |
71619dc2 JA |
601 | case 1: |
602 | break; | |
603 | } | |
604 | ||
3bec7ae0 | 605 | td->ts.io_u_map[index] += nr; |
71619dc2 JA |
606 | } |
607 | ||
04a0feae JA |
608 | static void io_u_mark_lat_usec(struct thread_data *td, unsigned long usec) |
609 | { | |
610 | int index = 0; | |
611 | ||
612 | assert(usec < 1000); | |
613 | ||
614 | switch (usec) { | |
615 | case 750 ... 999: | |
616 | index = 9; | |
617 | break; | |
618 | case 500 ... 749: | |
619 | index = 8; | |
620 | break; | |
621 | case 250 ... 499: | |
622 | index = 7; | |
623 | break; | |
624 | case 100 ... 249: | |
625 | index = 6; | |
626 | break; | |
627 | case 50 ... 99: | |
628 | index = 5; | |
629 | break; | |
630 | case 20 ... 49: | |
631 | index = 4; | |
632 | break; | |
633 | case 10 ... 19: | |
634 | index = 3; | |
635 | break; | |
636 | case 4 ... 9: | |
637 | index = 2; | |
638 | break; | |
639 | case 2 ... 3: | |
640 | index = 1; | |
641 | case 0 ... 1: | |
642 | break; | |
643 | } | |
644 | ||
645 | assert(index < FIO_IO_U_LAT_U_NR); | |
646 | td->ts.io_u_lat_u[index]++; | |
647 | } | |
648 | ||
649 | static void io_u_mark_lat_msec(struct thread_data *td, unsigned long msec) | |
ec118304 JA |
650 | { |
651 | int index = 0; | |
652 | ||
653 | switch (msec) { | |
654 | default: | |
04a0feae JA |
655 | index = 11; |
656 | break; | |
8abdce66 | 657 | case 1000 ... 1999: |
04a0feae JA |
658 | index = 10; |
659 | break; | |
8abdce66 | 660 | case 750 ... 999: |
04a0feae JA |
661 | index = 9; |
662 | break; | |
8abdce66 | 663 | case 500 ... 749: |
04a0feae JA |
664 | index = 8; |
665 | break; | |
8abdce66 | 666 | case 250 ... 499: |
04a0feae JA |
667 | index = 7; |
668 | break; | |
8abdce66 | 669 | case 100 ... 249: |
04a0feae JA |
670 | index = 6; |
671 | break; | |
8abdce66 | 672 | case 50 ... 99: |
04a0feae JA |
673 | index = 5; |
674 | break; | |
8abdce66 | 675 | case 20 ... 49: |
04a0feae JA |
676 | index = 4; |
677 | break; | |
8abdce66 | 678 | case 10 ... 19: |
04a0feae JA |
679 | index = 3; |
680 | break; | |
8abdce66 | 681 | case 4 ... 9: |
04a0feae JA |
682 | index = 2; |
683 | break; | |
ec118304 | 684 | case 2 ... 3: |
04a0feae | 685 | index = 1; |
ec118304 JA |
686 | case 0 ... 1: |
687 | break; | |
688 | } | |
689 | ||
04a0feae JA |
690 | assert(index < FIO_IO_U_LAT_M_NR); |
691 | td->ts.io_u_lat_m[index]++; | |
692 | } | |
693 | ||
694 | static void io_u_mark_latency(struct thread_data *td, unsigned long usec) | |
695 | { | |
696 | if (usec < 1000) | |
697 | io_u_mark_lat_usec(td, usec); | |
698 | else | |
699 | io_u_mark_lat_msec(td, usec / 1000); | |
ec118304 JA |
700 | } |
701 | ||
0aabe160 JA |
702 | /* |
703 | * Get next file to service by choosing one at random | |
704 | */ | |
2cc52930 JA |
705 | static struct fio_file *get_next_file_rand(struct thread_data *td, |
706 | enum fio_file_flags goodf, | |
d6aed795 | 707 | enum fio_file_flags badf) |
0aabe160 | 708 | { |
0aabe160 | 709 | struct fio_file *f; |
1c178180 | 710 | int fno; |
0aabe160 JA |
711 | |
712 | do { | |
7c83c089 | 713 | long r = os_random_long(&td->next_file_state); |
87b10676 | 714 | int opened = 0; |
7c83c089 | 715 | |
5ec10eaa | 716 | fno = (unsigned int) ((double) td->o.nr_files |
dc873b6f | 717 | * (r / (OS_RAND_MAX + 1.0))); |
126d65c6 | 718 | f = td->files[fno]; |
d6aed795 | 719 | if (fio_file_done(f)) |
059e63c0 | 720 | continue; |
1c178180 | 721 | |
d6aed795 | 722 | if (!fio_file_open(f)) { |
87b10676 JA |
723 | int err; |
724 | ||
725 | err = td_io_open_file(td, f); | |
726 | if (err) | |
727 | continue; | |
728 | opened = 1; | |
729 | } | |
730 | ||
2ba1c290 JA |
731 | if ((!goodf || (f->flags & goodf)) && !(f->flags & badf)) { |
732 | dprint(FD_FILE, "get_next_file_rand: %p\n", f); | |
0aabe160 | 733 | return f; |
2ba1c290 | 734 | } |
87b10676 JA |
735 | if (opened) |
736 | td_io_close_file(td, f); | |
0aabe160 JA |
737 | } while (1); |
738 | } | |
739 | ||
740 | /* | |
741 | * Get next file to service by doing round robin between all available ones | |
742 | */ | |
1c178180 JA |
743 | static struct fio_file *get_next_file_rr(struct thread_data *td, int goodf, |
744 | int badf) | |
3d7c391d JA |
745 | { |
746 | unsigned int old_next_file = td->next_file; | |
747 | struct fio_file *f; | |
748 | ||
749 | do { | |
87b10676 JA |
750 | int opened = 0; |
751 | ||
126d65c6 | 752 | f = td->files[td->next_file]; |
3d7c391d JA |
753 | |
754 | td->next_file++; | |
2dc1bbeb | 755 | if (td->next_file >= td->o.nr_files) |
3d7c391d JA |
756 | td->next_file = 0; |
757 | ||
87b10676 | 758 | dprint(FD_FILE, "trying file %s %x\n", f->file_name, f->flags); |
d6aed795 | 759 | if (fio_file_done(f)) { |
d5ed68ea | 760 | f = NULL; |
059e63c0 | 761 | continue; |
d5ed68ea | 762 | } |
059e63c0 | 763 | |
d6aed795 | 764 | if (!fio_file_open(f)) { |
87b10676 JA |
765 | int err; |
766 | ||
767 | err = td_io_open_file(td, f); | |
b5696bfc JA |
768 | if (err) { |
769 | dprint(FD_FILE, "error %d on open of %s\n", | |
770 | err, f->file_name); | |
87c27b45 | 771 | f = NULL; |
87b10676 | 772 | continue; |
b5696bfc | 773 | } |
87b10676 JA |
774 | opened = 1; |
775 | } | |
776 | ||
0b9d69ec JA |
777 | dprint(FD_FILE, "goodf=%x, badf=%x, ff=%x\n", goodf, badf, |
778 | f->flags); | |
1c178180 | 779 | if ((!goodf || (f->flags & goodf)) && !(f->flags & badf)) |
3d7c391d JA |
780 | break; |
781 | ||
87b10676 JA |
782 | if (opened) |
783 | td_io_close_file(td, f); | |
784 | ||
3d7c391d JA |
785 | f = NULL; |
786 | } while (td->next_file != old_next_file); | |
787 | ||
2ba1c290 | 788 | dprint(FD_FILE, "get_next_file_rr: %p\n", f); |
3d7c391d JA |
789 | return f; |
790 | } | |
791 | ||
7eb36574 | 792 | static struct fio_file *__get_next_file(struct thread_data *td) |
bdb4e2e9 | 793 | { |
1907dbc6 JA |
794 | struct fio_file *f; |
795 | ||
2dc1bbeb | 796 | assert(td->o.nr_files <= td->files_index); |
1c178180 | 797 | |
b5696bfc | 798 | if (td->nr_done_files >= td->o.nr_files) { |
5ec10eaa JA |
799 | dprint(FD_FILE, "get_next_file: nr_open=%d, nr_done=%d," |
800 | " nr_files=%d\n", td->nr_open_files, | |
801 | td->nr_done_files, | |
802 | td->o.nr_files); | |
bdb4e2e9 | 803 | return NULL; |
2ba1c290 | 804 | } |
bdb4e2e9 | 805 | |
1907dbc6 | 806 | f = td->file_service_file; |
d6aed795 | 807 | if (f && fio_file_open(f) && !fio_file_closing(f)) { |
a086c257 JA |
808 | if (td->o.file_service_type == FIO_FSERVICE_SEQ) |
809 | goto out; | |
810 | if (td->file_service_left--) | |
811 | goto out; | |
812 | } | |
1907dbc6 | 813 | |
a086c257 JA |
814 | if (td->o.file_service_type == FIO_FSERVICE_RR || |
815 | td->o.file_service_type == FIO_FSERVICE_SEQ) | |
d6aed795 | 816 | f = get_next_file_rr(td, FIO_FILE_open, FIO_FILE_closing); |
bdb4e2e9 | 817 | else |
d6aed795 | 818 | f = get_next_file_rand(td, FIO_FILE_open, FIO_FILE_closing); |
1907dbc6 JA |
819 | |
820 | td->file_service_file = f; | |
821 | td->file_service_left = td->file_service_nr - 1; | |
2ba1c290 | 822 | out: |
683023e8 | 823 | dprint(FD_FILE, "get_next_file: %p [%s]\n", f, f->file_name); |
1907dbc6 | 824 | return f; |
bdb4e2e9 JA |
825 | } |
826 | ||
7eb36574 JA |
827 | static struct fio_file *get_next_file(struct thread_data *td) |
828 | { | |
829 | struct prof_io_ops *ops = &td->prof_io_ops; | |
830 | ||
831 | if (ops->get_next_file) | |
832 | return ops->get_next_file(td); | |
833 | ||
834 | return __get_next_file(td); | |
835 | } | |
836 | ||
429f6675 JA |
837 | static int set_io_u_file(struct thread_data *td, struct io_u *io_u) |
838 | { | |
839 | struct fio_file *f; | |
840 | ||
841 | do { | |
842 | f = get_next_file(td); | |
843 | if (!f) | |
844 | return 1; | |
845 | ||
429f6675 JA |
846 | io_u->file = f; |
847 | get_file(f); | |
848 | ||
849 | if (!fill_io_u(td, io_u)) | |
850 | break; | |
851 | ||
b5696bfc | 852 | put_file_log(td, f); |
429f6675 | 853 | td_io_close_file(td, f); |
b5696bfc | 854 | io_u->file = NULL; |
d6aed795 | 855 | fio_file_set_done(f); |
429f6675 | 856 | td->nr_done_files++; |
0b9d69ec JA |
857 | dprint(FD_FILE, "%s: is done (%d of %d)\n", f->file_name, |
858 | td->nr_done_files, td->o.nr_files); | |
429f6675 JA |
859 | } while (1); |
860 | ||
861 | return 0; | |
862 | } | |
863 | ||
864 | ||
10ba535a JA |
865 | struct io_u *__get_io_u(struct thread_data *td) |
866 | { | |
867 | struct io_u *io_u = NULL; | |
868 | ||
e8462bd8 JA |
869 | td_io_u_lock(td); |
870 | ||
871 | again: | |
01743ee1 JA |
872 | if (!flist_empty(&td->io_u_requeues)) |
873 | io_u = flist_entry(td->io_u_requeues.next, struct io_u, list); | |
755200a3 | 874 | else if (!queue_full(td)) { |
01743ee1 | 875 | io_u = flist_entry(td->io_u_freelist.next, struct io_u, list); |
10ba535a | 876 | |
6040dabc | 877 | io_u->buflen = 0; |
10ba535a | 878 | io_u->resid = 0; |
755200a3 | 879 | io_u->file = NULL; |
d7762cf8 | 880 | io_u->end_io = NULL; |
755200a3 JA |
881 | } |
882 | ||
e8462bd8 JA |
883 | /* |
884 | * We ran out, wait for async verify threads to finish and return one | |
885 | */ | |
886 | if (!io_u && td->o.verify_async) { | |
887 | pthread_cond_wait(&td->free_cond, &td->io_u_lock); | |
888 | goto again; | |
889 | } | |
890 | ||
755200a3 | 891 | if (io_u) { |
0c6e7517 | 892 | assert(io_u->flags & IO_U_F_FREE); |
2ecc1b57 | 893 | io_u->flags &= ~(IO_U_F_FREE | IO_U_F_FREE_DEF); |
0c6e7517 | 894 | |
755200a3 | 895 | io_u->error = 0; |
01743ee1 JA |
896 | flist_del(&io_u->list); |
897 | flist_add(&io_u->list, &td->io_u_busylist); | |
10ba535a | 898 | td->cur_depth++; |
0c41214f | 899 | io_u->flags |= IO_U_F_IN_CUR_DEPTH; |
10ba535a JA |
900 | } |
901 | ||
e8462bd8 | 902 | td_io_u_unlock(td); |
10ba535a JA |
903 | return io_u; |
904 | } | |
905 | ||
906 | /* | |
907 | * Return an io_u to be processed. Gets a buflen and offset, sets direction, | |
908 | * etc. The returned io_u is fully ready to be prepped and submitted. | |
909 | */ | |
3d7c391d | 910 | struct io_u *get_io_u(struct thread_data *td) |
10ba535a | 911 | { |
3d7c391d | 912 | struct fio_file *f; |
10ba535a JA |
913 | struct io_u *io_u; |
914 | ||
915 | io_u = __get_io_u(td); | |
2ba1c290 JA |
916 | if (!io_u) { |
917 | dprint(FD_IO, "__get_io_u failed\n"); | |
10ba535a | 918 | return NULL; |
2ba1c290 | 919 | } |
10ba535a | 920 | |
755200a3 JA |
921 | /* |
922 | * from a requeue, io_u already setup | |
923 | */ | |
924 | if (io_u->file) | |
77f392bf | 925 | goto out; |
755200a3 | 926 | |
429f6675 JA |
927 | /* |
928 | * If using an iolog, grab next piece if any available. | |
929 | */ | |
930 | if (td->o.read_iolog_file) { | |
931 | if (read_iolog_get(td, io_u)) | |
932 | goto err_put; | |
2ba1c290 JA |
933 | } else if (set_io_u_file(td, io_u)) { |
934 | dprint(FD_IO, "io_u %p, setting file failed\n", io_u); | |
429f6675 | 935 | goto err_put; |
2ba1c290 | 936 | } |
5ec10eaa | 937 | |
429f6675 | 938 | f = io_u->file; |
d6aed795 | 939 | assert(fio_file_open(f)); |
97af62ce | 940 | |
5f9099ea | 941 | if (!ddir_sync(io_u->ddir)) { |
d0656a93 | 942 | if (!io_u->buflen && !(td->io_ops->flags & FIO_NOIO)) { |
2ba1c290 | 943 | dprint(FD_IO, "get_io_u: zero buflen on %p\n", io_u); |
429f6675 | 944 | goto err_put; |
2ba1c290 | 945 | } |
10ba535a | 946 | |
36167d82 | 947 | f->last_pos = io_u->offset + io_u->buflen; |
10ba535a | 948 | |
c311cd2a | 949 | if (td->o.verify != VERIFY_NONE && io_u->ddir == DDIR_WRITE) |
87dc1ab1 | 950 | populate_verify_io_u(td, io_u); |
e4dad9c6 JA |
951 | else if (td->o.refill_buffers && io_u->ddir == DDIR_WRITE) |
952 | io_u_fill_buffer(td, io_u, io_u->xfer_buflen); | |
87dc1ab1 | 953 | } |
10ba535a | 954 | |
165faf16 JA |
955 | /* |
956 | * Set io data pointers. | |
957 | */ | |
cec6b55d JA |
958 | io_u->xfer_buf = io_u->buf; |
959 | io_u->xfer_buflen = io_u->buflen; | |
5973cafb | 960 | |
6ac7a331 | 961 | out: |
429f6675 | 962 | if (!td_io_prep(td, io_u)) { |
993bf48b JA |
963 | if (!td->o.disable_slat) |
964 | fio_gettime(&io_u->start_time, NULL); | |
429f6675 | 965 | return io_u; |
36167d82 | 966 | } |
429f6675 | 967 | err_put: |
2ba1c290 | 968 | dprint(FD_IO, "get_io_u failed\n"); |
429f6675 JA |
969 | put_io_u(td, io_u); |
970 | return NULL; | |
10ba535a JA |
971 | } |
972 | ||
5451792e JA |
973 | void io_u_log_error(struct thread_data *td, struct io_u *io_u) |
974 | { | |
975 | const char *msg[] = { "read", "write", "sync" }; | |
976 | ||
977 | log_err("fio: io_u error"); | |
978 | ||
979 | if (io_u->file) | |
980 | log_err(" on file %s", io_u->file->file_name); | |
981 | ||
982 | log_err(": %s\n", strerror(io_u->error)); | |
983 | ||
5ec10eaa JA |
984 | log_err(" %s offset=%llu, buflen=%lu\n", msg[io_u->ddir], |
985 | io_u->offset, io_u->xfer_buflen); | |
5451792e JA |
986 | |
987 | if (!td->error) | |
988 | td_verror(td, io_u->error, "io_u error"); | |
989 | } | |
990 | ||
97601024 JA |
991 | static void io_completed(struct thread_data *td, struct io_u *io_u, |
992 | struct io_completion_data *icd) | |
10ba535a | 993 | { |
dbad30b0 JA |
994 | /* |
995 | * Older gcc's are too dumb to realize that usec is always used | |
996 | * initialized, silence that warning. | |
997 | */ | |
998 | unsigned long uninitialized_var(usec); | |
10ba535a | 999 | |
2ba1c290 JA |
1000 | dprint_io_u(io_u, "io complete"); |
1001 | ||
2ecc1b57 | 1002 | td_io_u_lock(td); |
0c6e7517 JA |
1003 | assert(io_u->flags & IO_U_F_FLIGHT); |
1004 | io_u->flags &= ~IO_U_F_FLIGHT; | |
2ecc1b57 | 1005 | td_io_u_unlock(td); |
0c6e7517 | 1006 | |
5f9099ea | 1007 | if (ddir_sync(io_u->ddir)) { |
87dc1ab1 JA |
1008 | td->last_was_sync = 1; |
1009 | return; | |
1010 | } | |
1011 | ||
1012 | td->last_was_sync = 0; | |
1013 | ||
10ba535a JA |
1014 | if (!io_u->error) { |
1015 | unsigned int bytes = io_u->buflen - io_u->resid; | |
1e97cce9 | 1016 | const enum fio_ddir idx = io_u->ddir; |
ba3e4e0c | 1017 | const enum fio_ddir odx = io_u->ddir ^ 1; |
b29ee5b3 | 1018 | int ret; |
10ba535a | 1019 | |
b29ee5b3 JA |
1020 | td->io_blocks[idx]++; |
1021 | td->io_bytes[idx] += bytes; | |
1022 | td->this_io_bytes[idx] += bytes; | |
10ba535a | 1023 | |
b29ee5b3 | 1024 | if (ramp_time_over(td)) { |
40e1a6f0 | 1025 | unsigned long uninitialized_var(lusec); |
40e1a6f0 JA |
1026 | |
1027 | if (!td->o.disable_clat || !td->o.disable_bw) | |
1028 | lusec = utime_since(&io_u->issue_time, | |
1029 | &icd->time); | |
721938ae | 1030 | |
9520ebb9 | 1031 | if (!td->o.disable_clat) { |
01a1caa5 | 1032 | add_clat_sample(td, idx, lusec, bytes); |
40e1a6f0 | 1033 | io_u_mark_latency(td, lusec); |
9520ebb9 JA |
1034 | } |
1035 | if (!td->o.disable_bw) | |
306ddc97 | 1036 | add_bw_sample(td, idx, bytes, &icd->time); |
b23b6a2f | 1037 | if (__should_check_rate(td, idx)) { |
ba3e4e0c RR |
1038 | td->rate_pending_usleep[idx] = |
1039 | ((td->this_io_bytes[idx] * | |
1040 | td->rate_nsec_cycle[idx]) / 1000 - | |
1041 | utime_since_now(&td->start)); | |
b23b6a2f | 1042 | } |
581e7141 | 1043 | if (__should_check_rate(td, idx ^ 1)) |
ba3e4e0c RR |
1044 | td->rate_pending_usleep[odx] = |
1045 | ((td->this_io_bytes[odx] * | |
1046 | td->rate_nsec_cycle[odx]) / 1000 - | |
1047 | utime_since_now(&td->start)); | |
721938ae | 1048 | } |
10ba535a | 1049 | |
660a1cb5 | 1050 | if (td_write(td) && idx == DDIR_WRITE && |
8670579e | 1051 | td->o.do_verify && |
41128405 | 1052 | td->o.verify != VERIFY_NONE) |
10ba535a JA |
1053 | log_io_piece(td, io_u); |
1054 | ||
b29ee5b3 | 1055 | icd->bytes_done[idx] += bytes; |
3af6ef39 | 1056 | |
d7762cf8 | 1057 | if (io_u->end_io) { |
36690c9b | 1058 | ret = io_u->end_io(td, io_u); |
3af6ef39 JA |
1059 | if (ret && !icd->error) |
1060 | icd->error = ret; | |
1061 | } | |
5451792e | 1062 | } else { |
10ba535a | 1063 | icd->error = io_u->error; |
5451792e JA |
1064 | io_u_log_error(td, io_u); |
1065 | } | |
f2bba182 RR |
1066 | if (td->o.continue_on_error && icd->error && |
1067 | td_non_fatal_error(icd->error)) { | |
1068 | /* | |
1069 | * If there is a non_fatal error, then add to the error count | |
1070 | * and clear all the errors. | |
1071 | */ | |
1072 | update_error_count(td, icd->error); | |
1073 | td_clear_error(td); | |
1074 | icd->error = 0; | |
1075 | io_u->error = 0; | |
1076 | } | |
10ba535a JA |
1077 | } |
1078 | ||
9520ebb9 JA |
1079 | static void init_icd(struct thread_data *td, struct io_completion_data *icd, |
1080 | int nr) | |
10ba535a | 1081 | { |
9520ebb9 JA |
1082 | if (!td->o.disable_clat || !td->o.disable_bw) |
1083 | fio_gettime(&icd->time, NULL); | |
02bcaa8c | 1084 | |
3af6ef39 JA |
1085 | icd->nr = nr; |
1086 | ||
10ba535a JA |
1087 | icd->error = 0; |
1088 | icd->bytes_done[0] = icd->bytes_done[1] = 0; | |
36167d82 JA |
1089 | } |
1090 | ||
97601024 JA |
1091 | static void ios_completed(struct thread_data *td, |
1092 | struct io_completion_data *icd) | |
36167d82 JA |
1093 | { |
1094 | struct io_u *io_u; | |
1095 | int i; | |
1096 | ||
10ba535a JA |
1097 | for (i = 0; i < icd->nr; i++) { |
1098 | io_u = td->io_ops->event(td, i); | |
1099 | ||
1100 | io_completed(td, io_u, icd); | |
e8462bd8 JA |
1101 | |
1102 | if (!(io_u->flags & IO_U_F_FREE_DEF)) | |
1103 | put_io_u(td, io_u); | |
10ba535a JA |
1104 | } |
1105 | } | |
97601024 | 1106 | |
e7e6cfb4 JA |
1107 | /* |
1108 | * Complete a single io_u for the sync engines. | |
1109 | */ | |
581e7141 JA |
1110 | int io_u_sync_complete(struct thread_data *td, struct io_u *io_u, |
1111 | unsigned long *bytes) | |
97601024 JA |
1112 | { |
1113 | struct io_completion_data icd; | |
1114 | ||
9520ebb9 | 1115 | init_icd(td, &icd, 1); |
97601024 | 1116 | io_completed(td, io_u, &icd); |
e8462bd8 JA |
1117 | |
1118 | if (!(io_u->flags & IO_U_F_FREE_DEF)) | |
1119 | put_io_u(td, io_u); | |
97601024 | 1120 | |
581e7141 JA |
1121 | if (icd.error) { |
1122 | td_verror(td, icd.error, "io_u_sync_complete"); | |
1123 | return -1; | |
1124 | } | |
97601024 | 1125 | |
581e7141 JA |
1126 | if (bytes) { |
1127 | bytes[0] += icd.bytes_done[0]; | |
1128 | bytes[1] += icd.bytes_done[1]; | |
1129 | } | |
1130 | ||
1131 | return 0; | |
97601024 JA |
1132 | } |
1133 | ||
e7e6cfb4 JA |
1134 | /* |
1135 | * Called to complete min_events number of io for the async engines. | |
1136 | */ | |
581e7141 JA |
1137 | int io_u_queued_complete(struct thread_data *td, int min_evts, |
1138 | unsigned long *bytes) | |
97601024 | 1139 | { |
97601024 | 1140 | struct io_completion_data icd; |
00de55ef | 1141 | struct timespec *tvp = NULL; |
97601024 | 1142 | int ret; |
4d06a338 | 1143 | struct timespec ts = { .tv_sec = 0, .tv_nsec = 0, }; |
97601024 | 1144 | |
4950421a | 1145 | dprint(FD_IO, "io_u_queued_completed: min=%d\n", min_evts); |
b271fe62 | 1146 | |
4950421a | 1147 | if (!min_evts) |
00de55ef | 1148 | tvp = &ts; |
97601024 | 1149 | |
4950421a | 1150 | ret = td_io_getevents(td, min_evts, td->o.iodepth_batch_complete, tvp); |
97601024 | 1151 | if (ret < 0) { |
e1161c32 | 1152 | td_verror(td, -ret, "td_io_getevents"); |
97601024 JA |
1153 | return ret; |
1154 | } else if (!ret) | |
1155 | return ret; | |
1156 | ||
9520ebb9 | 1157 | init_icd(td, &icd, ret); |
97601024 | 1158 | ios_completed(td, &icd); |
581e7141 JA |
1159 | if (icd.error) { |
1160 | td_verror(td, icd.error, "io_u_queued_complete"); | |
1161 | return -1; | |
1162 | } | |
97601024 | 1163 | |
581e7141 JA |
1164 | if (bytes) { |
1165 | bytes[0] += icd.bytes_done[0]; | |
1166 | bytes[1] += icd.bytes_done[1]; | |
1167 | } | |
1168 | ||
1169 | return 0; | |
97601024 | 1170 | } |
7e77dd02 JA |
1171 | |
1172 | /* | |
1173 | * Call when io_u is really queued, to update the submission latency. | |
1174 | */ | |
1175 | void io_u_queued(struct thread_data *td, struct io_u *io_u) | |
1176 | { | |
9520ebb9 JA |
1177 | if (!td->o.disable_slat) { |
1178 | unsigned long slat_time; | |
7e77dd02 | 1179 | |
9520ebb9 | 1180 | slat_time = utime_since(&io_u->start_time, &io_u->issue_time); |
29a90ddb | 1181 | add_slat_sample(td, io_u->ddir, slat_time, io_u->xfer_buflen); |
9520ebb9 | 1182 | } |
7e77dd02 | 1183 | } |
433afcb4 | 1184 | |
5973cafb JA |
1185 | /* |
1186 | * "randomly" fill the buffer contents | |
1187 | */ | |
1188 | void io_u_fill_buffer(struct thread_data *td, struct io_u *io_u, | |
1189 | unsigned int max_bs) | |
1190 | { | |
1191 | long *ptr = io_u->buf; | |
1192 | ||
1193 | if (!td->o.zero_buffers) { | |
1194 | while ((void *) ptr - io_u->buf < max_bs) { | |
1195 | *ptr = rand() * GOLDEN_RATIO_PRIME; | |
1196 | ptr++; | |
1197 | } | |
1198 | } else | |
1199 | memset(ptr, 0, max_bs); | |
1200 | } |