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" | |
10ba535a | 9 | |
5945b9b4 JA |
10 | /* |
11 | * Change this define to play with the timeout handling | |
12 | */ | |
13 | #undef FIO_USE_TIMEOUT | |
14 | ||
97601024 JA |
15 | struct io_completion_data { |
16 | int nr; /* input */ | |
97601024 JA |
17 | |
18 | int error; /* output */ | |
19 | unsigned long bytes_done[2]; /* output */ | |
20 | struct timeval time; /* output */ | |
21 | }; | |
22 | ||
10ba535a JA |
23 | /* |
24 | * The ->file_map[] contains a map of blocks we have or have not done io | |
25 | * to yet. Used to make sure we cover the entire range in a fair fashion. | |
26 | */ | |
27 | static int random_map_free(struct thread_data *td, struct fio_file *f, | |
28 | unsigned long long block) | |
29 | { | |
30 | unsigned int idx = RAND_MAP_IDX(td, f, block); | |
31 | unsigned int bit = RAND_MAP_BIT(td, f, block); | |
32 | ||
33 | return (f->file_map[idx] & (1UL << bit)) == 0; | |
34 | } | |
35 | ||
df415585 JA |
36 | /* |
37 | * Mark a given offset as used in the map. | |
38 | */ | |
9bf2061e | 39 | static void mark_random_map(struct thread_data *td, struct io_u *io_u) |
df415585 | 40 | { |
2dc1bbeb | 41 | unsigned int min_bs = td->o.rw_min_bs; |
9bf2061e | 42 | struct fio_file *f = io_u->file; |
a00735e6 JA |
43 | unsigned long long block; |
44 | unsigned int blocks; | |
c685b5b2 | 45 | unsigned int nr_blocks; |
df415585 | 46 | |
a00735e6 JA |
47 | block = io_u->offset / (unsigned long long) min_bs; |
48 | blocks = 0; | |
c685b5b2 JA |
49 | nr_blocks = (io_u->buflen + min_bs - 1) / min_bs; |
50 | ||
51 | while (blocks < nr_blocks) { | |
df415585 JA |
52 | unsigned int idx, bit; |
53 | ||
1e3d53ac JA |
54 | /* |
55 | * If we have a mixed random workload, we may | |
56 | * encounter blocks we already did IO to. | |
57 | */ | |
211097b2 | 58 | if (!td->o.ddir_nr && !random_map_free(td, f, block)) |
df415585 JA |
59 | break; |
60 | ||
61 | idx = RAND_MAP_IDX(td, f, block); | |
62 | bit = RAND_MAP_BIT(td, f, block); | |
63 | ||
0032bf9f | 64 | fio_assert(td, idx < f->num_maps); |
df415585 JA |
65 | |
66 | f->file_map[idx] |= (1UL << bit); | |
67 | block++; | |
68 | blocks++; | |
69 | } | |
70 | ||
a00735e6 JA |
71 | if ((blocks * min_bs) < io_u->buflen) |
72 | io_u->buflen = blocks * min_bs; | |
df415585 JA |
73 | } |
74 | ||
10ba535a JA |
75 | /* |
76 | * Return the next free block in the map. | |
77 | */ | |
78 | static int get_next_free_block(struct thread_data *td, struct fio_file *f, | |
79 | unsigned long long *b) | |
80 | { | |
81 | int i; | |
82 | ||
c685b5b2 JA |
83 | i = f->last_free_lookup; |
84 | *b = (i * BLOCKS_PER_MAP); | |
2dc1bbeb | 85 | while ((*b) * td->o.rw_min_bs < f->real_file_size) { |
10ba535a | 86 | if (f->file_map[i] != -1UL) { |
b12ebc65 | 87 | *b += fio_ffz(f->file_map[i]); |
c685b5b2 | 88 | f->last_free_lookup = i; |
10ba535a JA |
89 | return 0; |
90 | } | |
91 | ||
92 | *b += BLOCKS_PER_MAP; | |
93 | i++; | |
94 | } | |
95 | ||
96 | return 1; | |
97 | } | |
98 | ||
ec4015da JA |
99 | static int get_next_rand_offset(struct thread_data *td, struct fio_file *f, |
100 | int ddir, unsigned long long *b) | |
101 | { | |
7bb48f84 | 102 | unsigned long long max_blocks = f->io_size / td->o.min_bs[ddir]; |
ec4015da JA |
103 | unsigned long long r, rb; |
104 | int loops = 5; | |
105 | ||
106 | do { | |
107 | r = os_random_long(&td->random_state); | |
108 | if (!max_blocks) | |
109 | *b = 0; | |
110 | else | |
111 | *b = ((max_blocks - 1) * r / (unsigned long long) (RAND_MAX+1.0)); | |
43c63a78 JA |
112 | /* |
113 | * if we are not maintaining a random map, we are done. | |
114 | */ | |
ec4015da | 115 | if (td->o.norandommap) |
43c63a78 JA |
116 | return 0; |
117 | ||
118 | /* | |
119 | * calculate map offset and chec if it's free | |
120 | */ | |
ec4015da | 121 | rb = *b + (f->file_offset / td->o.min_bs[ddir]); |
43c63a78 JA |
122 | if (random_map_free(td, f, rb)) |
123 | return 0; | |
124 | ||
125 | } while (--loops); | |
ec4015da JA |
126 | |
127 | /* | |
43c63a78 JA |
128 | * we get here, if we didn't suceed in looking up a block. generate |
129 | * a random start offset into the filemap, and find the first free | |
130 | * block from there. | |
ec4015da | 131 | */ |
43c63a78 JA |
132 | loops = 10; |
133 | do { | |
134 | f->last_free_lookup = (f->num_maps - 1) * (r / (RAND_MAX+1.0)); | |
135 | if (!get_next_free_block(td, f, b)) | |
136 | return 0; | |
ec4015da | 137 | |
43c63a78 JA |
138 | r = os_random_long(&td->random_state); |
139 | } while (--loops); | |
140 | ||
141 | /* | |
142 | * that didn't work either, try exhaustive search from the start | |
143 | */ | |
144 | f->last_free_lookup = 0; | |
145 | return get_next_free_block(td, f, b); | |
ec4015da JA |
146 | } |
147 | ||
10ba535a JA |
148 | /* |
149 | * For random io, generate a random new block and see if it's used. Repeat | |
150 | * until we find a free one. For sequential io, just return the end of | |
151 | * the last io issued. | |
152 | */ | |
9bf2061e | 153 | static int get_next_offset(struct thread_data *td, struct io_u *io_u) |
10ba535a | 154 | { |
9bf2061e | 155 | struct fio_file *f = io_u->file; |
c685b5b2 | 156 | const int ddir = io_u->ddir; |
ec4015da | 157 | unsigned long long b; |
10ba535a | 158 | |
ec4015da JA |
159 | if (td_random(td) && (td->o.ddir_nr && !--td->ddir_nr)) { |
160 | td->ddir_nr = td->o.ddir_nr; | |
211097b2 | 161 | |
ec4015da | 162 | if (get_next_rand_offset(td, f, ddir, &b)) |
bca4ed4d | 163 | return 1; |
43063a1c JA |
164 | } else { |
165 | if (f->last_pos >= f->real_file_size) | |
166 | return 1; | |
167 | ||
2dc1bbeb | 168 | b = f->last_pos / td->o.min_bs[ddir]; |
43063a1c | 169 | } |
10ba535a | 170 | |
2dc1bbeb | 171 | io_u->offset = (b * td->o.min_bs[ddir]) + f->file_offset; |
bca4ed4d | 172 | if (io_u->offset >= f->real_file_size) |
10ba535a JA |
173 | return 1; |
174 | ||
175 | return 0; | |
176 | } | |
177 | ||
9bf2061e | 178 | static unsigned int get_next_buflen(struct thread_data *td, struct io_u *io_u) |
10ba535a | 179 | { |
bca4ed4d | 180 | const int ddir = io_u->ddir; |
10ba535a JA |
181 | unsigned int buflen; |
182 | long r; | |
183 | ||
2dc1bbeb JA |
184 | if (td->o.min_bs[ddir] == td->o.max_bs[ddir]) |
185 | buflen = td->o.min_bs[ddir]; | |
10ba535a JA |
186 | else { |
187 | r = os_random_long(&td->bsrange_state); | |
2dc1bbeb JA |
188 | buflen = (unsigned int) (1 + (double) (td->o.max_bs[ddir] - 1) * r / (RAND_MAX + 1.0)); |
189 | if (!td->o.bs_unaligned) | |
190 | buflen = (buflen + td->o.min_bs[ddir] - 1) & ~(td->o.min_bs[ddir] - 1); | |
10ba535a JA |
191 | } |
192 | ||
10ba535a JA |
193 | return buflen; |
194 | } | |
195 | ||
afe24a5a JA |
196 | static void set_rwmix_bytes(struct thread_data *td) |
197 | { | |
198 | unsigned long long rbytes; | |
199 | unsigned int diff; | |
200 | ||
201 | /* | |
202 | * we do time or byte based switch. this is needed because | |
203 | * buffered writes may issue a lot quicker than they complete, | |
204 | * whereas reads do not. | |
205 | */ | |
206 | rbytes = td->io_bytes[td->rwmix_ddir] - td->rwmix_bytes; | |
e47f799f | 207 | diff = td->o.rwmix[td->rwmix_ddir ^ 1]; |
afe24a5a | 208 | |
e47f799f JA |
209 | td->rwmix_bytes = td->io_bytes[td->rwmix_ddir] + (rbytes * ((100 - diff)) / diff); |
210 | } | |
211 | ||
212 | static inline enum fio_ddir get_rand_ddir(struct thread_data *td) | |
213 | { | |
214 | unsigned int v; | |
215 | long r; | |
216 | ||
217 | r = os_random_long(&td->rwmix_state); | |
218 | v = 1 + (int) (100.0 * (r / (RAND_MAX + 1.0))); | |
219 | if (v < td->o.rwmix[DDIR_READ]) | |
220 | return DDIR_READ; | |
221 | ||
222 | return DDIR_WRITE; | |
afe24a5a JA |
223 | } |
224 | ||
10ba535a JA |
225 | /* |
226 | * Return the data direction for the next io_u. If the job is a | |
227 | * mixed read/write workload, check the rwmix cycle and switch if | |
228 | * necessary. | |
229 | */ | |
1e97cce9 | 230 | static enum fio_ddir get_rw_ddir(struct thread_data *td) |
10ba535a JA |
231 | { |
232 | if (td_rw(td)) { | |
233 | struct timeval now; | |
234 | unsigned long elapsed; | |
afe24a5a | 235 | unsigned int cycle; |
10ba535a | 236 | |
02bcaa8c | 237 | fio_gettime(&now, NULL); |
10ba535a JA |
238 | elapsed = mtime_since_now(&td->rwmix_switch); |
239 | ||
e47f799f JA |
240 | /* |
241 | * if this is the first cycle, make it shorter | |
242 | */ | |
afe24a5a JA |
243 | cycle = td->o.rwmixcycle; |
244 | if (!td->rwmix_bytes) | |
245 | cycle /= 10; | |
246 | ||
10ba535a JA |
247 | /* |
248 | * Check if it's time to seed a new data direction. | |
249 | */ | |
e47f799f | 250 | if (elapsed >= cycle || |
afe24a5a | 251 | td->io_bytes[td->rwmix_ddir] >= td->rwmix_bytes) { |
e47f799f JA |
252 | unsigned long long max_bytes; |
253 | enum fio_ddir ddir; | |
254 | ||
255 | /* | |
256 | * Put a top limit on how many bytes we do for | |
257 | * one data direction, to avoid overflowing the | |
258 | * ranges too much | |
259 | */ | |
260 | ddir = get_rand_ddir(td); | |
261 | max_bytes = td->this_io_bytes[ddir]; | |
7bb48f84 | 262 | if (max_bytes >= (td->o.size * td->o.rwmix[ddir] / 100)) { |
38d77cae JA |
263 | if (!td->rw_end_set[ddir]) { |
264 | td->rw_end_set[ddir] = 1; | |
265 | memcpy(&td->rw_end[ddir], &now, sizeof(now)); | |
266 | } | |
e47f799f | 267 | ddir ^= 1; |
38d77cae | 268 | } |
e47f799f JA |
269 | |
270 | if (ddir != td->rwmix_ddir) | |
271 | set_rwmix_bytes(td); | |
272 | ||
273 | td->rwmix_ddir = ddir; | |
10ba535a JA |
274 | memcpy(&td->rwmix_switch, &now, sizeof(now)); |
275 | } | |
276 | return td->rwmix_ddir; | |
277 | } else if (td_read(td)) | |
278 | return DDIR_READ; | |
279 | else | |
280 | return DDIR_WRITE; | |
281 | } | |
282 | ||
10ba535a JA |
283 | void put_io_u(struct thread_data *td, struct io_u *io_u) |
284 | { | |
0c6e7517 JA |
285 | assert((io_u->flags & IO_U_F_FREE) == 0); |
286 | io_u->flags |= IO_U_F_FREE; | |
287 | ||
2dbdab7e JA |
288 | if (io_u->file) |
289 | put_file(td, io_u->file); | |
290 | ||
10ba535a JA |
291 | io_u->file = NULL; |
292 | list_del(&io_u->list); | |
293 | list_add(&io_u->list, &td->io_u_freelist); | |
294 | td->cur_depth--; | |
295 | } | |
296 | ||
755200a3 JA |
297 | void requeue_io_u(struct thread_data *td, struct io_u **io_u) |
298 | { | |
299 | struct io_u *__io_u = *io_u; | |
300 | ||
4d2e0f49 JA |
301 | __io_u->flags |= IO_U_F_FREE; |
302 | __io_u->flags &= ~IO_U_F_FLIGHT; | |
303 | ||
755200a3 JA |
304 | list_del(&__io_u->list); |
305 | list_add_tail(&__io_u->list, &td->io_u_requeues); | |
306 | td->cur_depth--; | |
307 | *io_u = NULL; | |
308 | } | |
309 | ||
9bf2061e | 310 | static int fill_io_u(struct thread_data *td, struct io_u *io_u) |
10ba535a | 311 | { |
87dc1ab1 JA |
312 | /* |
313 | * see if it's time to sync | |
314 | */ | |
2dc1bbeb JA |
315 | if (td->o.fsync_blocks && |
316 | !(td->io_issues[DDIR_WRITE] % td->o.fsync_blocks) && | |
317 | td->io_issues[DDIR_WRITE] && should_fsync(td)) { | |
87dc1ab1 | 318 | io_u->ddir = DDIR_SYNC; |
c38e9468 | 319 | goto out; |
87dc1ab1 JA |
320 | } |
321 | ||
a00735e6 JA |
322 | io_u->ddir = get_rw_ddir(td); |
323 | ||
48f5abd3 JA |
324 | /* |
325 | * See if it's time to switch to a new zone | |
326 | */ | |
327 | if (td->zone_bytes >= td->o.zone_size) { | |
328 | td->zone_bytes = 0; | |
329 | io_u->file->last_pos += td->o.zone_skip; | |
330 | td->io_skip_bytes += td->o.zone_skip; | |
331 | } | |
332 | ||
10ba535a | 333 | /* |
c685b5b2 JA |
334 | * No log, let the seq/rand engine retrieve the next buflen and |
335 | * position. | |
10ba535a | 336 | */ |
9bf2061e | 337 | if (get_next_offset(td, io_u)) |
bca4ed4d | 338 | return 1; |
10ba535a | 339 | |
9bf2061e | 340 | io_u->buflen = get_next_buflen(td, io_u); |
bca4ed4d JA |
341 | if (!io_u->buflen) |
342 | return 1; | |
343 | ||
344 | /* | |
345 | * mark entry before potentially trimming io_u | |
346 | */ | |
8fd15a9a | 347 | if (td_random(td) && !td->o.norandommap) |
9bf2061e | 348 | mark_random_map(td, io_u); |
bca4ed4d JA |
349 | |
350 | /* | |
351 | * If using a write iolog, store this entry. | |
352 | */ | |
c38e9468 | 353 | out: |
f29b25a3 | 354 | log_io_u(td, io_u); |
bca4ed4d | 355 | return 0; |
10ba535a JA |
356 | } |
357 | ||
b3605062 | 358 | void io_u_mark_depth(struct thread_data *td, struct io_u *io_u) |
71619dc2 JA |
359 | { |
360 | int index = 0; | |
361 | ||
b3605062 JA |
362 | if (io_u->ddir == DDIR_SYNC) |
363 | return; | |
364 | ||
71619dc2 JA |
365 | switch (td->cur_depth) { |
366 | default: | |
a783e61a JA |
367 | index = 6; |
368 | break; | |
71619dc2 | 369 | case 32 ... 63: |
a783e61a JA |
370 | index = 5; |
371 | break; | |
71619dc2 | 372 | case 16 ... 31: |
a783e61a JA |
373 | index = 4; |
374 | break; | |
71619dc2 | 375 | case 8 ... 15: |
a783e61a JA |
376 | index = 3; |
377 | break; | |
71619dc2 | 378 | case 4 ... 7: |
a783e61a JA |
379 | index = 2; |
380 | break; | |
71619dc2 | 381 | case 2 ... 3: |
a783e61a | 382 | index = 1; |
71619dc2 JA |
383 | case 1: |
384 | break; | |
385 | } | |
386 | ||
756867bd | 387 | td->ts.io_u_map[index]++; |
b3605062 | 388 | td->ts.total_io_u[io_u->ddir]++; |
71619dc2 JA |
389 | } |
390 | ||
04a0feae JA |
391 | static void io_u_mark_lat_usec(struct thread_data *td, unsigned long usec) |
392 | { | |
393 | int index = 0; | |
394 | ||
395 | assert(usec < 1000); | |
396 | ||
397 | switch (usec) { | |
398 | case 750 ... 999: | |
399 | index = 9; | |
400 | break; | |
401 | case 500 ... 749: | |
402 | index = 8; | |
403 | break; | |
404 | case 250 ... 499: | |
405 | index = 7; | |
406 | break; | |
407 | case 100 ... 249: | |
408 | index = 6; | |
409 | break; | |
410 | case 50 ... 99: | |
411 | index = 5; | |
412 | break; | |
413 | case 20 ... 49: | |
414 | index = 4; | |
415 | break; | |
416 | case 10 ... 19: | |
417 | index = 3; | |
418 | break; | |
419 | case 4 ... 9: | |
420 | index = 2; | |
421 | break; | |
422 | case 2 ... 3: | |
423 | index = 1; | |
424 | case 0 ... 1: | |
425 | break; | |
426 | } | |
427 | ||
428 | assert(index < FIO_IO_U_LAT_U_NR); | |
429 | td->ts.io_u_lat_u[index]++; | |
430 | } | |
431 | ||
432 | static void io_u_mark_lat_msec(struct thread_data *td, unsigned long msec) | |
ec118304 JA |
433 | { |
434 | int index = 0; | |
435 | ||
436 | switch (msec) { | |
437 | default: | |
04a0feae JA |
438 | index = 11; |
439 | break; | |
8abdce66 | 440 | case 1000 ... 1999: |
04a0feae JA |
441 | index = 10; |
442 | break; | |
8abdce66 | 443 | case 750 ... 999: |
04a0feae JA |
444 | index = 9; |
445 | break; | |
8abdce66 | 446 | case 500 ... 749: |
04a0feae JA |
447 | index = 8; |
448 | break; | |
8abdce66 | 449 | case 250 ... 499: |
04a0feae JA |
450 | index = 7; |
451 | break; | |
8abdce66 | 452 | case 100 ... 249: |
04a0feae JA |
453 | index = 6; |
454 | break; | |
8abdce66 | 455 | case 50 ... 99: |
04a0feae JA |
456 | index = 5; |
457 | break; | |
8abdce66 | 458 | case 20 ... 49: |
04a0feae JA |
459 | index = 4; |
460 | break; | |
8abdce66 | 461 | case 10 ... 19: |
04a0feae JA |
462 | index = 3; |
463 | break; | |
8abdce66 | 464 | case 4 ... 9: |
04a0feae JA |
465 | index = 2; |
466 | break; | |
ec118304 | 467 | case 2 ... 3: |
04a0feae | 468 | index = 1; |
ec118304 JA |
469 | case 0 ... 1: |
470 | break; | |
471 | } | |
472 | ||
04a0feae JA |
473 | assert(index < FIO_IO_U_LAT_M_NR); |
474 | td->ts.io_u_lat_m[index]++; | |
475 | } | |
476 | ||
477 | static void io_u_mark_latency(struct thread_data *td, unsigned long usec) | |
478 | { | |
479 | if (usec < 1000) | |
480 | io_u_mark_lat_usec(td, usec); | |
481 | else | |
482 | io_u_mark_lat_msec(td, usec / 1000); | |
ec118304 JA |
483 | } |
484 | ||
0aabe160 JA |
485 | /* |
486 | * Get next file to service by choosing one at random | |
487 | */ | |
1c178180 JA |
488 | static struct fio_file *get_next_file_rand(struct thread_data *td, int goodf, |
489 | int badf) | |
0aabe160 | 490 | { |
0aabe160 | 491 | struct fio_file *f; |
1c178180 | 492 | int fno; |
0aabe160 JA |
493 | |
494 | do { | |
7c83c089 JA |
495 | long r = os_random_long(&td->next_file_state); |
496 | ||
2dc1bbeb | 497 | fno = (unsigned int) ((double) td->o.nr_files * (r / (RAND_MAX + 1.0))); |
1c178180 | 498 | f = &td->files[fno]; |
059e63c0 JA |
499 | if (f->flags & FIO_FILE_DONE) |
500 | continue; | |
1c178180 JA |
501 | |
502 | if ((!goodf || (f->flags & goodf)) && !(f->flags & badf)) | |
0aabe160 JA |
503 | return f; |
504 | } while (1); | |
505 | } | |
506 | ||
507 | /* | |
508 | * Get next file to service by doing round robin between all available ones | |
509 | */ | |
1c178180 JA |
510 | static struct fio_file *get_next_file_rr(struct thread_data *td, int goodf, |
511 | int badf) | |
3d7c391d JA |
512 | { |
513 | unsigned int old_next_file = td->next_file; | |
514 | struct fio_file *f; | |
515 | ||
516 | do { | |
517 | f = &td->files[td->next_file]; | |
518 | ||
519 | td->next_file++; | |
2dc1bbeb | 520 | if (td->next_file >= td->o.nr_files) |
3d7c391d JA |
521 | td->next_file = 0; |
522 | ||
d5ed68ea JA |
523 | if (f->flags & FIO_FILE_DONE) { |
524 | f = NULL; | |
059e63c0 | 525 | continue; |
d5ed68ea | 526 | } |
059e63c0 | 527 | |
1c178180 | 528 | if ((!goodf || (f->flags & goodf)) && !(f->flags & badf)) |
3d7c391d JA |
529 | break; |
530 | ||
531 | f = NULL; | |
532 | } while (td->next_file != old_next_file); | |
533 | ||
534 | return f; | |
535 | } | |
536 | ||
bdb4e2e9 JA |
537 | static struct fio_file *get_next_file(struct thread_data *td) |
538 | { | |
1907dbc6 JA |
539 | struct fio_file *f; |
540 | ||
2dc1bbeb | 541 | assert(td->o.nr_files <= td->files_index); |
1c178180 | 542 | |
1020a139 | 543 | if (!td->nr_open_files || td->nr_done_files >= td->o.nr_files) |
bdb4e2e9 JA |
544 | return NULL; |
545 | ||
1907dbc6 | 546 | f = td->file_service_file; |
f11bd94d | 547 | if (f && (f->flags & FIO_FILE_OPEN) && td->file_service_left--) |
1907dbc6 JA |
548 | return f; |
549 | ||
2dc1bbeb | 550 | if (td->o.file_service_type == FIO_FSERVICE_RR) |
1c178180 | 551 | f = get_next_file_rr(td, FIO_FILE_OPEN, FIO_FILE_CLOSING); |
bdb4e2e9 | 552 | else |
1c178180 | 553 | f = get_next_file_rand(td, FIO_FILE_OPEN, FIO_FILE_CLOSING); |
1907dbc6 JA |
554 | |
555 | td->file_service_file = f; | |
556 | td->file_service_left = td->file_service_nr - 1; | |
557 | return f; | |
bdb4e2e9 JA |
558 | } |
559 | ||
1c178180 JA |
560 | static struct fio_file *find_next_new_file(struct thread_data *td) |
561 | { | |
562 | struct fio_file *f; | |
563 | ||
1020a139 JA |
564 | if (!td->nr_open_files || td->nr_done_files >= td->o.nr_files) |
565 | return NULL; | |
566 | ||
2dc1bbeb | 567 | if (td->o.file_service_type == FIO_FSERVICE_RR) |
1c178180 JA |
568 | f = get_next_file_rr(td, 0, FIO_FILE_OPEN); |
569 | else | |
570 | f = get_next_file_rand(td, 0, FIO_FILE_OPEN); | |
571 | ||
572 | return f; | |
573 | } | |
574 | ||
429f6675 JA |
575 | static int set_io_u_file(struct thread_data *td, struct io_u *io_u) |
576 | { | |
577 | struct fio_file *f; | |
578 | ||
579 | do { | |
580 | f = get_next_file(td); | |
581 | if (!f) | |
582 | return 1; | |
583 | ||
584 | set_file: | |
585 | io_u->file = f; | |
586 | get_file(f); | |
587 | ||
588 | if (!fill_io_u(td, io_u)) | |
589 | break; | |
590 | ||
591 | /* | |
592 | * td_io_close() does a put_file() as well, so no need to | |
593 | * do that here. | |
594 | */ | |
595 | io_u->file = NULL; | |
596 | td_io_close_file(td, f); | |
597 | f->flags |= FIO_FILE_DONE; | |
598 | td->nr_done_files++; | |
599 | ||
600 | /* | |
601 | * probably not the right place to do this, but see | |
602 | * if we need to open a new file | |
603 | */ | |
604 | if (td->nr_open_files < td->o.open_files && | |
605 | td->o.open_files != td->o.nr_files) { | |
606 | f = find_next_new_file(td); | |
607 | ||
608 | if (!f || td_io_open_file(td, f)) | |
609 | return 1; | |
610 | ||
611 | goto set_file; | |
612 | } | |
613 | } while (1); | |
614 | ||
615 | return 0; | |
616 | } | |
617 | ||
618 | ||
10ba535a JA |
619 | struct io_u *__get_io_u(struct thread_data *td) |
620 | { | |
621 | struct io_u *io_u = NULL; | |
622 | ||
755200a3 JA |
623 | if (!list_empty(&td->io_u_requeues)) |
624 | io_u = list_entry(td->io_u_requeues.next, struct io_u, list); | |
625 | else if (!queue_full(td)) { | |
10ba535a JA |
626 | io_u = list_entry(td->io_u_freelist.next, struct io_u, list); |
627 | ||
6040dabc | 628 | io_u->buflen = 0; |
10ba535a | 629 | io_u->resid = 0; |
755200a3 | 630 | io_u->file = NULL; |
d7762cf8 | 631 | io_u->end_io = NULL; |
755200a3 JA |
632 | } |
633 | ||
634 | if (io_u) { | |
0c6e7517 JA |
635 | assert(io_u->flags & IO_U_F_FREE); |
636 | io_u->flags &= ~IO_U_F_FREE; | |
637 | ||
755200a3 | 638 | io_u->error = 0; |
10ba535a JA |
639 | list_del(&io_u->list); |
640 | list_add(&io_u->list, &td->io_u_busylist); | |
641 | td->cur_depth++; | |
642 | } | |
643 | ||
644 | return io_u; | |
645 | } | |
646 | ||
647 | /* | |
648 | * Return an io_u to be processed. Gets a buflen and offset, sets direction, | |
649 | * etc. The returned io_u is fully ready to be prepped and submitted. | |
650 | */ | |
3d7c391d | 651 | struct io_u *get_io_u(struct thread_data *td) |
10ba535a | 652 | { |
3d7c391d | 653 | struct fio_file *f; |
10ba535a JA |
654 | struct io_u *io_u; |
655 | ||
656 | io_u = __get_io_u(td); | |
657 | if (!io_u) | |
658 | return NULL; | |
659 | ||
755200a3 JA |
660 | /* |
661 | * from a requeue, io_u already setup | |
662 | */ | |
663 | if (io_u->file) | |
77f392bf | 664 | goto out; |
755200a3 | 665 | |
429f6675 JA |
666 | /* |
667 | * If using an iolog, grab next piece if any available. | |
668 | */ | |
669 | if (td->o.read_iolog_file) { | |
670 | if (read_iolog_get(td, io_u)) | |
671 | goto err_put; | |
672 | } else if (set_io_u_file(td, io_u)) | |
673 | goto err_put; | |
674 | ||
675 | f = io_u->file; | |
676 | assert(f->flags & FIO_FILE_OPEN); | |
97af62ce | 677 | |
87dc1ab1 | 678 | if (io_u->ddir != DDIR_SYNC) { |
429f6675 JA |
679 | if (!io_u->buflen) |
680 | goto err_put; | |
10ba535a | 681 | |
36167d82 | 682 | f->last_pos = io_u->offset + io_u->buflen; |
10ba535a | 683 | |
2dc1bbeb | 684 | if (td->o.verify != VERIFY_NONE) |
87dc1ab1 JA |
685 | populate_verify_io_u(td, io_u); |
686 | } | |
10ba535a | 687 | |
165faf16 JA |
688 | /* |
689 | * Set io data pointers. | |
690 | */ | |
d460eb31 | 691 | io_u->endpos = io_u->offset + io_u->buflen; |
77f392bf | 692 | out: |
cec6b55d JA |
693 | io_u->xfer_buf = io_u->buf; |
694 | io_u->xfer_buflen = io_u->buflen; | |
165faf16 | 695 | |
429f6675 JA |
696 | if (!td_io_prep(td, io_u)) { |
697 | fio_gettime(&io_u->start_time, NULL); | |
698 | return io_u; | |
36167d82 | 699 | } |
429f6675 JA |
700 | err_put: |
701 | put_io_u(td, io_u); | |
702 | return NULL; | |
10ba535a JA |
703 | } |
704 | ||
5451792e JA |
705 | void io_u_log_error(struct thread_data *td, struct io_u *io_u) |
706 | { | |
707 | const char *msg[] = { "read", "write", "sync" }; | |
708 | ||
709 | log_err("fio: io_u error"); | |
710 | ||
711 | if (io_u->file) | |
712 | log_err(" on file %s", io_u->file->file_name); | |
713 | ||
714 | log_err(": %s\n", strerror(io_u->error)); | |
715 | ||
716 | log_err(" %s offset=%llu, buflen=%lu\n", msg[io_u->ddir], io_u->offset, io_u->xfer_buflen); | |
717 | ||
718 | if (!td->error) | |
719 | td_verror(td, io_u->error, "io_u error"); | |
720 | } | |
721 | ||
97601024 JA |
722 | static void io_completed(struct thread_data *td, struct io_u *io_u, |
723 | struct io_completion_data *icd) | |
10ba535a | 724 | { |
d85f5118 | 725 | unsigned long usec; |
10ba535a | 726 | |
0c6e7517 JA |
727 | assert(io_u->flags & IO_U_F_FLIGHT); |
728 | io_u->flags &= ~IO_U_F_FLIGHT; | |
729 | ||
87dc1ab1 JA |
730 | if (io_u->ddir == DDIR_SYNC) { |
731 | td->last_was_sync = 1; | |
732 | return; | |
733 | } | |
734 | ||
735 | td->last_was_sync = 0; | |
736 | ||
10ba535a JA |
737 | if (!io_u->error) { |
738 | unsigned int bytes = io_u->buflen - io_u->resid; | |
1e97cce9 | 739 | const enum fio_ddir idx = io_u->ddir; |
3af6ef39 | 740 | int ret; |
10ba535a JA |
741 | |
742 | td->io_blocks[idx]++; | |
743 | td->io_bytes[idx] += bytes; | |
744 | td->zone_bytes += bytes; | |
745 | td->this_io_bytes[idx] += bytes; | |
746 | ||
d460eb31 | 747 | io_u->file->last_completed_pos = io_u->endpos; |
02bcaa8c | 748 | |
d85f5118 | 749 | usec = utime_since(&io_u->issue_time, &icd->time); |
10ba535a | 750 | |
d85f5118 | 751 | add_clat_sample(td, idx, usec); |
02bcaa8c | 752 | add_bw_sample(td, idx, &icd->time); |
04a0feae | 753 | io_u_mark_latency(td, usec); |
10ba535a | 754 | |
660a1cb5 | 755 | if (td_write(td) && idx == DDIR_WRITE && |
41128405 | 756 | td->o.verify != VERIFY_NONE) |
10ba535a JA |
757 | log_io_piece(td, io_u); |
758 | ||
759 | icd->bytes_done[idx] += bytes; | |
3af6ef39 | 760 | |
d7762cf8 | 761 | if (io_u->end_io) { |
36690c9b | 762 | ret = io_u->end_io(td, io_u); |
3af6ef39 JA |
763 | if (ret && !icd->error) |
764 | icd->error = ret; | |
765 | } | |
5451792e | 766 | } else { |
10ba535a | 767 | icd->error = io_u->error; |
5451792e JA |
768 | io_u_log_error(td, io_u); |
769 | } | |
10ba535a JA |
770 | } |
771 | ||
d7762cf8 | 772 | static void init_icd(struct io_completion_data *icd, int nr) |
10ba535a | 773 | { |
02bcaa8c JA |
774 | fio_gettime(&icd->time, NULL); |
775 | ||
3af6ef39 JA |
776 | icd->nr = nr; |
777 | ||
10ba535a JA |
778 | icd->error = 0; |
779 | icd->bytes_done[0] = icd->bytes_done[1] = 0; | |
36167d82 JA |
780 | } |
781 | ||
97601024 JA |
782 | static void ios_completed(struct thread_data *td, |
783 | struct io_completion_data *icd) | |
36167d82 JA |
784 | { |
785 | struct io_u *io_u; | |
786 | int i; | |
787 | ||
10ba535a JA |
788 | for (i = 0; i < icd->nr; i++) { |
789 | io_u = td->io_ops->event(td, i); | |
790 | ||
791 | io_completed(td, io_u, icd); | |
792 | put_io_u(td, io_u); | |
793 | } | |
794 | } | |
97601024 | 795 | |
e7e6cfb4 JA |
796 | /* |
797 | * Complete a single io_u for the sync engines. | |
798 | */ | |
d7762cf8 | 799 | long io_u_sync_complete(struct thread_data *td, struct io_u *io_u) |
97601024 JA |
800 | { |
801 | struct io_completion_data icd; | |
802 | ||
d7762cf8 | 803 | init_icd(&icd, 1); |
97601024 JA |
804 | io_completed(td, io_u, &icd); |
805 | put_io_u(td, io_u); | |
806 | ||
807 | if (!icd.error) | |
808 | return icd.bytes_done[0] + icd.bytes_done[1]; | |
809 | ||
37e974a5 | 810 | td_verror(td, icd.error, "io_u_sync_complete"); |
97601024 JA |
811 | return -1; |
812 | } | |
813 | ||
e7e6cfb4 JA |
814 | /* |
815 | * Called to complete min_events number of io for the async engines. | |
816 | */ | |
d7762cf8 | 817 | long io_u_queued_complete(struct thread_data *td, int min_events) |
97601024 | 818 | { |
97601024 | 819 | struct io_completion_data icd; |
00de55ef | 820 | struct timespec *tvp = NULL; |
97601024 | 821 | int ret; |
4d06a338 | 822 | struct timespec ts = { .tv_sec = 0, .tv_nsec = 0, }; |
97601024 | 823 | |
4d06a338 | 824 | if (!min_events) |
00de55ef | 825 | tvp = &ts; |
97601024 | 826 | |
00de55ef | 827 | ret = td_io_getevents(td, min_events, td->cur_depth, tvp); |
97601024 | 828 | if (ret < 0) { |
e1161c32 | 829 | td_verror(td, -ret, "td_io_getevents"); |
97601024 JA |
830 | return ret; |
831 | } else if (!ret) | |
832 | return ret; | |
833 | ||
d7762cf8 | 834 | init_icd(&icd, ret); |
97601024 JA |
835 | ios_completed(td, &icd); |
836 | if (!icd.error) | |
837 | return icd.bytes_done[0] + icd.bytes_done[1]; | |
838 | ||
37e974a5 | 839 | td_verror(td, icd.error, "io_u_queued_complete"); |
97601024 JA |
840 | return -1; |
841 | } | |
7e77dd02 JA |
842 | |
843 | /* | |
844 | * Call when io_u is really queued, to update the submission latency. | |
845 | */ | |
846 | void io_u_queued(struct thread_data *td, struct io_u *io_u) | |
847 | { | |
848 | unsigned long slat_time; | |
849 | ||
d85f5118 | 850 | slat_time = utime_since(&io_u->start_time, &io_u->issue_time); |
7e77dd02 JA |
851 | add_slat_sample(td, io_u->ddir, slat_time); |
852 | } | |
433afcb4 | 853 | |
55bc9728 | 854 | #ifdef FIO_USE_TIMEOUT |
433afcb4 JA |
855 | void io_u_set_timeout(struct thread_data *td) |
856 | { | |
857 | assert(td->cur_depth); | |
858 | ||
859 | td->timer.it_interval.tv_sec = 0; | |
860 | td->timer.it_interval.tv_usec = 0; | |
861 | td->timer.it_value.tv_sec = IO_U_TIMEOUT + IO_U_TIMEOUT_INC; | |
862 | td->timer.it_value.tv_usec = 0; | |
863 | setitimer(ITIMER_REAL, &td->timer, NULL); | |
864 | fio_gettime(&td->timeout_end, NULL); | |
865 | } | |
5945b9b4 JA |
866 | |
867 | static void io_u_dump(struct io_u *io_u) | |
868 | { | |
869 | unsigned long t_start = mtime_since_now(&io_u->start_time); | |
870 | unsigned long t_issue = mtime_since_now(&io_u->issue_time); | |
871 | ||
872 | log_err("io_u=%p, t_start=%lu, t_issue=%lu\n", io_u, t_start, t_issue); | |
873 | log_err(" buf=%p/%p, len=%lu/%lu, offset=%llu\n", io_u->buf, io_u->xfer_buf, io_u->buflen, io_u->xfer_buflen, io_u->offset); | |
874 | log_err(" ddir=%d, fname=%s\n", io_u->ddir, io_u->file->file_name); | |
875 | } | |
55bc9728 JA |
876 | #else |
877 | void io_u_set_timeout(struct thread_data fio_unused *td) | |
878 | { | |
879 | } | |
880 | #endif | |
433afcb4 | 881 | |
55bc9728 | 882 | #ifdef FIO_USE_TIMEOUT |
433afcb4 JA |
883 | static void io_u_timeout_handler(int fio_unused sig) |
884 | { | |
885 | struct thread_data *td, *__td; | |
886 | pid_t pid = getpid(); | |
5945b9b4 JA |
887 | struct list_head *entry; |
888 | struct io_u *io_u; | |
433afcb4 JA |
889 | int i; |
890 | ||
891 | log_err("fio: io_u timeout\n"); | |
892 | ||
893 | /* | |
894 | * TLS would be nice... | |
895 | */ | |
896 | td = NULL; | |
897 | for_each_td(__td, i) { | |
898 | if (__td->pid == pid) { | |
899 | td = __td; | |
900 | break; | |
901 | } | |
902 | } | |
903 | ||
904 | if (!td) { | |
905 | log_err("fio: io_u timeout, can't find job\n"); | |
906 | exit(1); | |
907 | } | |
908 | ||
909 | if (!td->cur_depth) { | |
910 | log_err("fio: timeout without pending work?\n"); | |
911 | return; | |
912 | } | |
913 | ||
15506d09 | 914 | log_err("fio: io_u timeout: job=%s, pid=%d\n", td->o.name, td->pid); |
5945b9b4 JA |
915 | |
916 | list_for_each(entry, &td->io_u_busylist) { | |
917 | io_u = list_entry(entry, struct io_u, list); | |
918 | ||
919 | io_u_dump(io_u); | |
920 | } | |
921 | ||
922 | td_verror(td, ETIMEDOUT, "io_u timeout"); | |
433afcb4 JA |
923 | exit(1); |
924 | } | |
55bc9728 | 925 | #endif |
433afcb4 JA |
926 | |
927 | void io_u_init_timeout(void) | |
928 | { | |
55bc9728 | 929 | #ifdef FIO_USE_TIMEOUT |
433afcb4 | 930 | signal(SIGALRM, io_u_timeout_handler); |
55bc9728 | 931 | #endif |
433afcb4 | 932 | } |