Compile error with FIO_USE_TIMEOUT defined
[fio.git] / io_u.c
CommitLineData
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"
9#include "os.h"
10
5945b9b4
JA
11/*
12 * Change this define to play with the timeout handling
13 */
14#undef FIO_USE_TIMEOUT
15
97601024
JA
16struct 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 */
28static int random_map_free(struct thread_data *td, struct fio_file *f,
29 unsigned long long block)
30{
31 unsigned int idx = RAND_MAP_IDX(td, f, block);
32 unsigned int bit = RAND_MAP_BIT(td, f, block);
33
34 return (f->file_map[idx] & (1UL << bit)) == 0;
35}
36
df415585
JA
37/*
38 * Mark a given offset as used in the map.
39 */
9bf2061e 40static void mark_random_map(struct thread_data *td, struct io_u *io_u)
df415585 41{
2dc1bbeb 42 unsigned int min_bs = td->o.rw_min_bs;
9bf2061e 43 struct fio_file *f = io_u->file;
a00735e6
JA
44 unsigned long long block;
45 unsigned int blocks;
c685b5b2 46 unsigned int nr_blocks;
df415585 47
a00735e6
JA
48 block = io_u->offset / (unsigned long long) min_bs;
49 blocks = 0;
c685b5b2
JA
50 nr_blocks = (io_u->buflen + min_bs - 1) / min_bs;
51
52 while (blocks < nr_blocks) {
df415585
JA
53 unsigned int idx, bit;
54
55 if (!random_map_free(td, f, block))
56 break;
57
58 idx = RAND_MAP_IDX(td, f, block);
59 bit = RAND_MAP_BIT(td, f, block);
60
0032bf9f 61 fio_assert(td, idx < f->num_maps);
df415585
JA
62
63 f->file_map[idx] |= (1UL << bit);
64 block++;
65 blocks++;
66 }
67
a00735e6
JA
68 if ((blocks * min_bs) < io_u->buflen)
69 io_u->buflen = blocks * min_bs;
df415585
JA
70}
71
10ba535a
JA
72/*
73 * Return the next free block in the map.
74 */
75static int get_next_free_block(struct thread_data *td, struct fio_file *f,
76 unsigned long long *b)
77{
78 int i;
79
c685b5b2
JA
80 i = f->last_free_lookup;
81 *b = (i * BLOCKS_PER_MAP);
2dc1bbeb 82 while ((*b) * td->o.rw_min_bs < f->real_file_size) {
10ba535a
JA
83 if (f->file_map[i] != -1UL) {
84 *b += ffz(f->file_map[i]);
c685b5b2 85 f->last_free_lookup = i;
10ba535a
JA
86 return 0;
87 }
88
89 *b += BLOCKS_PER_MAP;
90 i++;
91 }
92
93 return 1;
94}
95
96/*
97 * For random io, generate a random new block and see if it's used. Repeat
98 * until we find a free one. For sequential io, just return the end of
99 * the last io issued.
100 */
9bf2061e 101static int get_next_offset(struct thread_data *td, struct io_u *io_u)
10ba535a 102{
9bf2061e 103 struct fio_file *f = io_u->file;
c685b5b2 104 const int ddir = io_u->ddir;
10ba535a
JA
105 unsigned long long b, rb;
106 long r;
107
413dd459 108 if (td_random(td)) {
2dc1bbeb 109 unsigned long long max_blocks = f->file_size / td->o.min_bs[ddir];
e6433576 110 int loops = 5;
10ba535a
JA
111
112 do {
113 r = os_random_long(&td->random_state);
2393acba
JA
114 if (!max_blocks)
115 b = 0;
116 else
117 b = ((max_blocks - 1) * r / (unsigned long long) (RAND_MAX+1.0));
2dc1bbeb 118 if (td->o.norandommap)
bb8895e0 119 break;
2dc1bbeb 120 rb = b + (f->file_offset / td->o.min_bs[ddir]);
10ba535a
JA
121 loops--;
122 } while (!random_map_free(td, f, rb) && loops);
123
bca4ed4d
JA
124 /*
125 * if we failed to retrieve a truly random offset within
126 * the loops assigned, see if there are free ones left at all
127 */
128 if (!loops && get_next_free_block(td, f, &b))
129 return 1;
10ba535a 130 } else
2dc1bbeb 131 b = f->last_pos / td->o.min_bs[ddir];
10ba535a 132
2dc1bbeb 133 io_u->offset = (b * td->o.min_bs[ddir]) + f->file_offset;
bca4ed4d 134 if (io_u->offset >= f->real_file_size)
10ba535a
JA
135 return 1;
136
137 return 0;
138}
139
9bf2061e 140static unsigned int get_next_buflen(struct thread_data *td, struct io_u *io_u)
10ba535a 141{
9bf2061e 142 struct fio_file *f = io_u->file;
bca4ed4d 143 const int ddir = io_u->ddir;
10ba535a
JA
144 unsigned int buflen;
145 long r;
146
2dc1bbeb
JA
147 if (td->o.min_bs[ddir] == td->o.max_bs[ddir])
148 buflen = td->o.min_bs[ddir];
10ba535a
JA
149 else {
150 r = os_random_long(&td->bsrange_state);
2dc1bbeb
JA
151 buflen = (unsigned int) (1 + (double) (td->o.max_bs[ddir] - 1) * r / (RAND_MAX + 1.0));
152 if (!td->o.bs_unaligned)
153 buflen = (buflen + td->o.min_bs[ddir] - 1) & ~(td->o.min_bs[ddir] - 1);
10ba535a
JA
154 }
155
bca4ed4d 156 while (buflen + io_u->offset > f->real_file_size) {
2dc1bbeb
JA
157 if (buflen == td->o.min_bs[ddir]) {
158 if (!td->o.odirect) {
2393acba
JA
159 assert(io_u->offset <= f->real_file_size);
160 buflen = f->real_file_size - io_u->offset;
161 return buflen;
162 }
bca4ed4d 163 return 0;
2393acba 164 }
bca4ed4d 165
2dc1bbeb 166 buflen = td->o.min_bs[ddir];
10ba535a
JA
167 }
168
169 return buflen;
170}
171
172/*
173 * Return the data direction for the next io_u. If the job is a
174 * mixed read/write workload, check the rwmix cycle and switch if
175 * necessary.
176 */
1e97cce9 177static enum fio_ddir get_rw_ddir(struct thread_data *td)
10ba535a
JA
178{
179 if (td_rw(td)) {
180 struct timeval now;
181 unsigned long elapsed;
182
02bcaa8c 183 fio_gettime(&now, NULL);
10ba535a
JA
184 elapsed = mtime_since_now(&td->rwmix_switch);
185
186 /*
187 * Check if it's time to seed a new data direction.
188 */
2dc1bbeb 189 if (elapsed >= td->o.rwmixcycle) {
10ba535a
JA
190 unsigned int v;
191 long r;
192
193 r = os_random_long(&td->rwmix_state);
194 v = 1 + (int) (100.0 * (r / (RAND_MAX + 1.0)));
2dc1bbeb 195 if (v < td->o.rwmixread)
10ba535a
JA
196 td->rwmix_ddir = DDIR_READ;
197 else
198 td->rwmix_ddir = DDIR_WRITE;
199 memcpy(&td->rwmix_switch, &now, sizeof(now));
200 }
201 return td->rwmix_ddir;
202 } else if (td_read(td))
203 return DDIR_READ;
204 else
205 return DDIR_WRITE;
206}
207
10ba535a
JA
208void put_io_u(struct thread_data *td, struct io_u *io_u)
209{
0c6e7517
JA
210 assert((io_u->flags & IO_U_F_FREE) == 0);
211 io_u->flags |= IO_U_F_FREE;
212
10ba535a
JA
213 io_u->file = NULL;
214 list_del(&io_u->list);
215 list_add(&io_u->list, &td->io_u_freelist);
216 td->cur_depth--;
217}
218
755200a3
JA
219void requeue_io_u(struct thread_data *td, struct io_u **io_u)
220{
221 struct io_u *__io_u = *io_u;
222
4d2e0f49
JA
223 __io_u->flags |= IO_U_F_FREE;
224 __io_u->flags &= ~IO_U_F_FLIGHT;
225
755200a3
JA
226 list_del(&__io_u->list);
227 list_add_tail(&__io_u->list, &td->io_u_requeues);
228 td->cur_depth--;
229 *io_u = NULL;
230}
231
9bf2061e 232static int fill_io_u(struct thread_data *td, struct io_u *io_u)
10ba535a
JA
233{
234 /*
235 * If using an iolog, grab next piece if any available.
236 */
2dc1bbeb 237 if (td->o.read_iolog)
10ba535a
JA
238 return read_iolog_get(td, io_u);
239
87dc1ab1
JA
240 /*
241 * see if it's time to sync
242 */
2dc1bbeb
JA
243 if (td->o.fsync_blocks &&
244 !(td->io_issues[DDIR_WRITE] % td->o.fsync_blocks) &&
245 td->io_issues[DDIR_WRITE] && should_fsync(td)) {
87dc1ab1 246 io_u->ddir = DDIR_SYNC;
87dc1ab1
JA
247 return 0;
248 }
249
a00735e6
JA
250 io_u->ddir = get_rw_ddir(td);
251
10ba535a 252 /*
c685b5b2
JA
253 * No log, let the seq/rand engine retrieve the next buflen and
254 * position.
10ba535a 255 */
9bf2061e 256 if (get_next_offset(td, io_u))
bca4ed4d 257 return 1;
10ba535a 258
9bf2061e 259 io_u->buflen = get_next_buflen(td, io_u);
bca4ed4d
JA
260 if (!io_u->buflen)
261 return 1;
262
263 /*
264 * mark entry before potentially trimming io_u
265 */
2dc1bbeb 266 if (!td->o.read_iolog && td_random(td) && !td->o.norandommap)
9bf2061e 267 mark_random_map(td, io_u);
bca4ed4d
JA
268
269 /*
270 * If using a write iolog, store this entry.
271 */
2dc1bbeb 272 if (td->o.write_iolog_file)
bca4ed4d
JA
273 write_iolog_put(td, io_u);
274
bca4ed4d 275 return 0;
10ba535a
JA
276}
277
b3605062 278void io_u_mark_depth(struct thread_data *td, struct io_u *io_u)
71619dc2
JA
279{
280 int index = 0;
281
b3605062
JA
282 if (io_u->ddir == DDIR_SYNC)
283 return;
284
71619dc2
JA
285 switch (td->cur_depth) {
286 default:
287 index++;
288 case 32 ... 63:
289 index++;
290 case 16 ... 31:
291 index++;
292 case 8 ... 15:
293 index++;
294 case 4 ... 7:
295 index++;
296 case 2 ... 3:
297 index++;
298 case 1:
299 break;
300 }
301
756867bd 302 td->ts.io_u_map[index]++;
b3605062 303 td->ts.total_io_u[io_u->ddir]++;
71619dc2
JA
304}
305
ec118304
JA
306static void io_u_mark_latency(struct thread_data *td, unsigned long msec)
307{
308 int index = 0;
309
310 switch (msec) {
311 default:
312 index++;
8abdce66 313 case 1000 ... 1999:
ec118304 314 index++;
8abdce66 315 case 750 ... 999:
ec118304 316 index++;
8abdce66 317 case 500 ... 749:
ec118304 318 index++;
8abdce66 319 case 250 ... 499:
ec118304 320 index++;
8abdce66 321 case 100 ... 249:
ec118304 322 index++;
8abdce66 323 case 50 ... 99:
ec118304 324 index++;
8abdce66 325 case 20 ... 49:
ec118304 326 index++;
8abdce66 327 case 10 ... 19:
ec118304 328 index++;
8abdce66 329 case 4 ... 9:
ec118304
JA
330 index++;
331 case 2 ... 3:
332 index++;
333 case 0 ... 1:
334 break;
335 }
336
756867bd 337 td->ts.io_u_lat[index]++;
ec118304
JA
338}
339
0aabe160
JA
340/*
341 * Get next file to service by choosing one at random
342 */
1c178180
JA
343static struct fio_file *get_next_file_rand(struct thread_data *td, int goodf,
344 int badf)
0aabe160 345{
0aabe160 346 struct fio_file *f;
1c178180 347 int fno;
0aabe160
JA
348
349 do {
7c83c089
JA
350 long r = os_random_long(&td->next_file_state);
351
2dc1bbeb 352 fno = (unsigned int) ((double) td->o.nr_files * (r / (RAND_MAX + 1.0)));
1c178180
JA
353 f = &td->files[fno];
354
355 if ((!goodf || (f->flags & goodf)) && !(f->flags & badf))
0aabe160
JA
356 return f;
357 } while (1);
358}
359
360/*
361 * Get next file to service by doing round robin between all available ones
362 */
1c178180
JA
363static struct fio_file *get_next_file_rr(struct thread_data *td, int goodf,
364 int badf)
3d7c391d
JA
365{
366 unsigned int old_next_file = td->next_file;
367 struct fio_file *f;
368
369 do {
370 f = &td->files[td->next_file];
371
372 td->next_file++;
2dc1bbeb 373 if (td->next_file >= td->o.nr_files)
3d7c391d
JA
374 td->next_file = 0;
375
1c178180 376 if ((!goodf || (f->flags & goodf)) && !(f->flags & badf))
3d7c391d
JA
377 break;
378
379 f = NULL;
380 } while (td->next_file != old_next_file);
381
382 return f;
383}
384
bdb4e2e9
JA
385static struct fio_file *get_next_file(struct thread_data *td)
386{
1907dbc6
JA
387 struct fio_file *f;
388
2dc1bbeb 389 assert(td->o.nr_files <= td->files_index);
1c178180 390
bdb4e2e9
JA
391 if (!td->nr_open_files)
392 return NULL;
393
1907dbc6 394 f = td->file_service_file;
f11bd94d 395 if (f && (f->flags & FIO_FILE_OPEN) && td->file_service_left--)
1907dbc6
JA
396 return f;
397
2dc1bbeb 398 if (td->o.file_service_type == FIO_FSERVICE_RR)
1c178180 399 f = get_next_file_rr(td, FIO_FILE_OPEN, FIO_FILE_CLOSING);
bdb4e2e9 400 else
1c178180 401 f = get_next_file_rand(td, FIO_FILE_OPEN, FIO_FILE_CLOSING);
1907dbc6
JA
402
403 td->file_service_file = f;
404 td->file_service_left = td->file_service_nr - 1;
405 return f;
bdb4e2e9
JA
406}
407
1c178180
JA
408static struct fio_file *find_next_new_file(struct thread_data *td)
409{
410 struct fio_file *f;
411
2dc1bbeb 412 if (td->o.file_service_type == FIO_FSERVICE_RR)
1c178180
JA
413 f = get_next_file_rr(td, 0, FIO_FILE_OPEN);
414 else
415 f = get_next_file_rand(td, 0, FIO_FILE_OPEN);
416
417 return f;
418}
419
10ba535a
JA
420struct io_u *__get_io_u(struct thread_data *td)
421{
422 struct io_u *io_u = NULL;
423
755200a3
JA
424 if (!list_empty(&td->io_u_requeues))
425 io_u = list_entry(td->io_u_requeues.next, struct io_u, list);
426 else if (!queue_full(td)) {
10ba535a
JA
427 io_u = list_entry(td->io_u_freelist.next, struct io_u, list);
428
6040dabc 429 io_u->buflen = 0;
10ba535a 430 io_u->resid = 0;
755200a3 431 io_u->file = NULL;
d7762cf8 432 io_u->end_io = NULL;
755200a3
JA
433 }
434
435 if (io_u) {
0c6e7517
JA
436 assert(io_u->flags & IO_U_F_FREE);
437 io_u->flags &= ~IO_U_F_FREE;
438
755200a3 439 io_u->error = 0;
10ba535a
JA
440 list_del(&io_u->list);
441 list_add(&io_u->list, &td->io_u_busylist);
442 td->cur_depth++;
443 }
444
445 return io_u;
446}
447
448/*
449 * Return an io_u to be processed. Gets a buflen and offset, sets direction,
450 * etc. The returned io_u is fully ready to be prepped and submitted.
451 */
3d7c391d 452struct io_u *get_io_u(struct thread_data *td)
10ba535a 453{
3d7c391d 454 struct fio_file *f;
10ba535a 455 struct io_u *io_u;
1c178180 456 int ret;
10ba535a
JA
457
458 io_u = __get_io_u(td);
459 if (!io_u)
460 return NULL;
461
755200a3
JA
462 /*
463 * from a requeue, io_u already setup
464 */
465 if (io_u->file)
77f392bf 466 goto out;
755200a3 467
bdb4e2e9
JA
468 do {
469 f = get_next_file(td);
470 if (!f) {
471 put_io_u(td, io_u);
472 return NULL;
473 }
3d7c391d 474
1c178180 475set_file:
bdb4e2e9 476 io_u->file = f;
3d7c391d 477
bdb4e2e9
JA
478 if (!fill_io_u(td, io_u))
479 break;
10ba535a 480
bdb4e2e9
JA
481 /*
482 * No more to do for this file, close it
483 */
484 io_u->file = NULL;
b5af8293
JA
485 td_io_close_file(td, f);
486
487 /*
488 * probably not the right place to do this, but see
489 * if we need to open a new file
490 */
2dc1bbeb
JA
491 if (td->nr_open_files < td->o.open_files &&
492 td->o.open_files != td->o.nr_files) {
1c178180 493 f = find_next_new_file(td);
a978ba68 494
1c178180 495 if (!f || (ret = td_io_open_file(td, f))) {
a978ba68 496 put_io_u(td, io_u);
e291dc12 497 return NULL;
a978ba68 498 }
1c178180 499 goto set_file;
a978ba68 500 }
bdb4e2e9 501 } while (1);
10ba535a 502
2dc1bbeb 503 if (td->zone_bytes >= td->o.zone_size) {
9bf2061e 504 td->zone_bytes = 0;
2dc1bbeb 505 f->last_pos += td->o.zone_skip;
9bf2061e
JA
506 }
507
ee88470c 508 if (io_u->buflen + io_u->offset > f->real_file_size) {
10ba535a
JA
509 if (td->io_ops->flags & FIO_RAWIO) {
510 put_io_u(td, io_u);
511 return NULL;
512 }
513
ee88470c 514 io_u->buflen = f->real_file_size - io_u->offset;
10ba535a
JA
515 }
516
87dc1ab1
JA
517 if (io_u->ddir != DDIR_SYNC) {
518 if (!io_u->buflen) {
519 put_io_u(td, io_u);
520 return NULL;
521 }
10ba535a 522
36167d82 523 f->last_pos = io_u->offset + io_u->buflen;
10ba535a 524
2dc1bbeb 525 if (td->o.verify != VERIFY_NONE)
87dc1ab1
JA
526 populate_verify_io_u(td, io_u);
527 }
10ba535a 528
165faf16
JA
529 /*
530 * Set io data pointers.
531 */
77f392bf 532out:
cec6b55d
JA
533 io_u->xfer_buf = io_u->buf;
534 io_u->xfer_buflen = io_u->buflen;
165faf16 535
36167d82
JA
536 if (td_io_prep(td, io_u)) {
537 put_io_u(td, io_u);
538 return NULL;
539 }
540
02bcaa8c 541 fio_gettime(&io_u->start_time, NULL);
10ba535a
JA
542 return io_u;
543}
544
5451792e
JA
545void io_u_log_error(struct thread_data *td, struct io_u *io_u)
546{
547 const char *msg[] = { "read", "write", "sync" };
548
549 log_err("fio: io_u error");
550
551 if (io_u->file)
552 log_err(" on file %s", io_u->file->file_name);
553
554 log_err(": %s\n", strerror(io_u->error));
555
556 log_err(" %s offset=%llu, buflen=%lu\n", msg[io_u->ddir], io_u->offset, io_u->xfer_buflen);
557
558 if (!td->error)
559 td_verror(td, io_u->error, "io_u error");
560}
561
97601024
JA
562static void io_completed(struct thread_data *td, struct io_u *io_u,
563 struct io_completion_data *icd)
10ba535a 564{
10ba535a
JA
565 unsigned long msec;
566
0c6e7517
JA
567 assert(io_u->flags & IO_U_F_FLIGHT);
568 io_u->flags &= ~IO_U_F_FLIGHT;
569
0ad920e7
JA
570 put_file(td, io_u->file);
571
87dc1ab1
JA
572 if (io_u->ddir == DDIR_SYNC) {
573 td->last_was_sync = 1;
574 return;
575 }
576
577 td->last_was_sync = 0;
578
10ba535a
JA
579 if (!io_u->error) {
580 unsigned int bytes = io_u->buflen - io_u->resid;
1e97cce9 581 const enum fio_ddir idx = io_u->ddir;
3af6ef39 582 int ret;
10ba535a
JA
583
584 td->io_blocks[idx]++;
585 td->io_bytes[idx] += bytes;
586 td->zone_bytes += bytes;
587 td->this_io_bytes[idx] += bytes;
588
02bcaa8c
JA
589 io_u->file->last_completed_pos = io_u->offset + io_u->buflen;
590
591 msec = mtime_since(&io_u->issue_time, &icd->time);
10ba535a
JA
592
593 add_clat_sample(td, idx, msec);
02bcaa8c 594 add_bw_sample(td, idx, &icd->time);
ec118304 595 io_u_mark_latency(td, msec);
10ba535a
JA
596
597 if ((td_rw(td) || td_write(td)) && idx == DDIR_WRITE)
598 log_io_piece(td, io_u);
599
600 icd->bytes_done[idx] += bytes;
3af6ef39 601
d7762cf8
JA
602 if (io_u->end_io) {
603 ret = io_u->end_io(io_u);
3af6ef39
JA
604 if (ret && !icd->error)
605 icd->error = ret;
606 }
5451792e 607 } else {
10ba535a 608 icd->error = io_u->error;
5451792e
JA
609 io_u_log_error(td, io_u);
610 }
10ba535a
JA
611}
612
d7762cf8 613static void init_icd(struct io_completion_data *icd, int nr)
10ba535a 614{
02bcaa8c
JA
615 fio_gettime(&icd->time, NULL);
616
3af6ef39
JA
617 icd->nr = nr;
618
10ba535a
JA
619 icd->error = 0;
620 icd->bytes_done[0] = icd->bytes_done[1] = 0;
36167d82
JA
621}
622
97601024
JA
623static void ios_completed(struct thread_data *td,
624 struct io_completion_data *icd)
36167d82
JA
625{
626 struct io_u *io_u;
627 int i;
628
10ba535a
JA
629 for (i = 0; i < icd->nr; i++) {
630 io_u = td->io_ops->event(td, i);
631
632 io_completed(td, io_u, icd);
633 put_io_u(td, io_u);
634 }
635}
97601024 636
e7e6cfb4
JA
637/*
638 * Complete a single io_u for the sync engines.
639 */
d7762cf8 640long io_u_sync_complete(struct thread_data *td, struct io_u *io_u)
97601024
JA
641{
642 struct io_completion_data icd;
643
d7762cf8 644 init_icd(&icd, 1);
97601024
JA
645 io_completed(td, io_u, &icd);
646 put_io_u(td, io_u);
647
648 if (!icd.error)
649 return icd.bytes_done[0] + icd.bytes_done[1];
650
37e974a5 651 td_verror(td, icd.error, "io_u_sync_complete");
97601024
JA
652 return -1;
653}
654
e7e6cfb4
JA
655/*
656 * Called to complete min_events number of io for the async engines.
657 */
d7762cf8 658long io_u_queued_complete(struct thread_data *td, int min_events)
97601024 659{
97601024 660 struct io_completion_data icd;
00de55ef 661 struct timespec *tvp = NULL;
97601024
JA
662 int ret;
663
face81b2 664 if (!min_events) {
00de55ef
JA
665 struct timespec ts = { .tv_sec = 0, .tv_nsec = 0, };
666
667 tvp = &ts;
755200a3 668 }
97601024 669
00de55ef 670 ret = td_io_getevents(td, min_events, td->cur_depth, tvp);
97601024 671 if (ret < 0) {
e1161c32 672 td_verror(td, -ret, "td_io_getevents");
97601024
JA
673 return ret;
674 } else if (!ret)
675 return ret;
676
d7762cf8 677 init_icd(&icd, ret);
97601024
JA
678 ios_completed(td, &icd);
679 if (!icd.error)
680 return icd.bytes_done[0] + icd.bytes_done[1];
681
37e974a5 682 td_verror(td, icd.error, "io_u_queued_complete");
97601024
JA
683 return -1;
684}
7e77dd02
JA
685
686/*
687 * Call when io_u is really queued, to update the submission latency.
688 */
689void io_u_queued(struct thread_data *td, struct io_u *io_u)
690{
691 unsigned long slat_time;
692
693 slat_time = mtime_since(&io_u->start_time, &io_u->issue_time);
694 add_slat_sample(td, io_u->ddir, slat_time);
695}
433afcb4 696
55bc9728 697#ifdef FIO_USE_TIMEOUT
433afcb4
JA
698void io_u_set_timeout(struct thread_data *td)
699{
700 assert(td->cur_depth);
701
702 td->timer.it_interval.tv_sec = 0;
703 td->timer.it_interval.tv_usec = 0;
704 td->timer.it_value.tv_sec = IO_U_TIMEOUT + IO_U_TIMEOUT_INC;
705 td->timer.it_value.tv_usec = 0;
706 setitimer(ITIMER_REAL, &td->timer, NULL);
707 fio_gettime(&td->timeout_end, NULL);
708}
5945b9b4
JA
709
710static void io_u_dump(struct io_u *io_u)
711{
712 unsigned long t_start = mtime_since_now(&io_u->start_time);
713 unsigned long t_issue = mtime_since_now(&io_u->issue_time);
714
715 log_err("io_u=%p, t_start=%lu, t_issue=%lu\n", io_u, t_start, t_issue);
716 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);
717 log_err(" ddir=%d, fname=%s\n", io_u->ddir, io_u->file->file_name);
718}
55bc9728
JA
719#else
720void io_u_set_timeout(struct thread_data fio_unused *td)
721{
722}
723#endif
433afcb4 724
55bc9728 725#ifdef FIO_USE_TIMEOUT
433afcb4
JA
726static void io_u_timeout_handler(int fio_unused sig)
727{
728 struct thread_data *td, *__td;
729 pid_t pid = getpid();
5945b9b4
JA
730 struct list_head *entry;
731 struct io_u *io_u;
433afcb4
JA
732 int i;
733
734 log_err("fio: io_u timeout\n");
735
736 /*
737 * TLS would be nice...
738 */
739 td = NULL;
740 for_each_td(__td, i) {
741 if (__td->pid == pid) {
742 td = __td;
743 break;
744 }
745 }
746
747 if (!td) {
748 log_err("fio: io_u timeout, can't find job\n");
749 exit(1);
750 }
751
752 if (!td->cur_depth) {
753 log_err("fio: timeout without pending work?\n");
754 return;
755 }
756
15506d09 757 log_err("fio: io_u timeout: job=%s, pid=%d\n", td->o.name, td->pid);
5945b9b4
JA
758
759 list_for_each(entry, &td->io_u_busylist) {
760 io_u = list_entry(entry, struct io_u, list);
761
762 io_u_dump(io_u);
763 }
764
765 td_verror(td, ETIMEDOUT, "io_u timeout");
433afcb4
JA
766 exit(1);
767}
55bc9728 768#endif
433afcb4
JA
769
770void io_u_init_timeout(void)
771{
55bc9728 772#ifdef FIO_USE_TIMEOUT
433afcb4 773 signal(SIGALRM, io_u_timeout_handler);
55bc9728 774#endif
433afcb4 775}