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