os-linux: add initial support for IO priority hints
[fio.git] / backend.c
CommitLineData
2e1df07d
JA
1/*
2 * fio - the flexible io tester
3 *
4 * Copyright (C) 2005 Jens Axboe <axboe@suse.de>
5 * Copyright (C) 2006-2012 Jens Axboe <axboe@kernel.dk>
6 *
7 * The license below covers all files distributed with fio unless otherwise
8 * noted in the file itself.
9 *
10 * This program is free software; you can redistribute it and/or modify
11 * it under the terms of the GNU General Public License version 2 as
12 * published by the Free Software Foundation.
13 *
14 * This program is distributed in the hope that it will be useful,
15 * but WITHOUT ANY WARRANTY; without even the implied warranty of
16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 * GNU General Public License for more details.
18 *
19 * You should have received a copy of the GNU General Public License
20 * along with this program; if not, write to the Free Software
fa07eaa6 21 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
2e1df07d
JA
22 *
23 */
24#include <unistd.h>
2e1df07d 25#include <string.h>
2e1df07d 26#include <signal.h>
2e1df07d 27#include <assert.h>
e43606c2 28#include <inttypes.h>
2e1df07d
JA
29#include <sys/stat.h>
30#include <sys/wait.h>
ff6bb260 31#include <math.h>
c06379a6 32#include <pthread.h>
2e1df07d
JA
33
34#include "fio.h"
2e1df07d
JA
35#include "smalloc.h"
36#include "verify.h"
2e1df07d
JA
37#include "diskutil.h"
38#include "cgroup.h"
39#include "profile.h"
40#include "lib/rand.h"
f7690c4a 41#include "lib/memalign.h"
2e1df07d 42#include "server.h"
44404c5a 43#include "lib/getrusage.h"
f2a2ce0e 44#include "idletime.h"
002fe734 45#include "err.h"
a9da8ab2 46#include "workqueue.h"
e81ecca3 47#include "lib/mountcheck.h"
40511301 48#include "rate-submit.h"
a39fb9ea 49#include "helper_thread.h"
ae626d4e 50#include "pshared.h"
07776127 51#include "zone-dist.h"
2e1df07d 52
971caeb1 53static struct fio_sem *startup_sem;
2e1df07d 54static struct flist_head *cgroup_list;
c3dc516a 55static struct cgroup_mnt *cgroup_mnt;
2e1df07d 56static int exit_value;
f1867a7f 57static volatile bool fio_abort;
3a5f6bde
JA
58static unsigned int nr_process = 0;
59static unsigned int nr_thread = 0;
2e1df07d 60
6eaf09d6 61struct io_log *agg_io_log[DDIR_RWDIR_CNT];
2e1df07d 62
a3efc919
JA
63int groupid = 0;
64unsigned int thread_number = 0;
2fbe1e19
JA
65unsigned int nr_segments = 0;
66unsigned int cur_segment = 0;
108fea77 67unsigned int stat_number = 0;
a3efc919
JA
68int temp_stall_ts;
69unsigned long done_secs = 0;
a38c70a8
BVA
70#ifdef PTHREAD_ERRORCHECK_MUTEX_INITIALIZER_NP
71pthread_mutex_t overlap_check = PTHREAD_ERRORCHECK_MUTEX_INITIALIZER_NP;
72#else
c06379a6 73pthread_mutex_t overlap_check = PTHREAD_MUTEX_INITIALIZER;
a38c70a8 74#endif
a47591e4 75
2e1df07d
JA
76#define JOB_START_TIMEOUT (5 * 1000)
77
78static void sig_int(int sig)
79{
2fbe1e19 80 if (nr_segments) {
2e1df07d
JA
81 if (is_backend)
82 fio_server_got_signal(sig);
83 else {
84 log_info("\nfio: terminating on signal %d\n", sig);
e411c301 85 log_info_flush();
2e1df07d
JA
86 exit_value = 128;
87 }
88
64402a8a 89 fio_terminate_threads(TERMINATE_ALL, TERMINATE_ALL);
2e1df07d
JA
90 }
91}
92
0dea1f55
BP
93#ifdef WIN32
94static void sig_break(int sig)
95{
0dea1f55
BP
96 sig_int(sig);
97
98 /**
99 * Windows terminates all job processes on SIGBREAK after the handler
100 * returns, so give them time to wrap-up and give stats
101 */
da8f124f 102 for_each_td(td) {
0dea1f55
BP
103 while (td->runstate < TD_EXITED)
104 sleep(1);
da8f124f 105 } end_for_each();
0dea1f55
BP
106}
107#endif
108
d2235e56 109void sig_show_status(int sig)
4c6d91e8
JA
110{
111 show_running_run_stats();
112}
113
2e1df07d
JA
114static void set_sig_handlers(void)
115{
116 struct sigaction act;
117
118 memset(&act, 0, sizeof(act));
119 act.sa_handler = sig_int;
120 act.sa_flags = SA_RESTART;
121 sigaction(SIGINT, &act, NULL);
122
123 memset(&act, 0, sizeof(act));
124 act.sa_handler = sig_int;
125 act.sa_flags = SA_RESTART;
126 sigaction(SIGTERM, &act, NULL);
127
2f694507
BC
128/* Windows uses SIGBREAK as a quit signal from other applications */
129#ifdef WIN32
130 memset(&act, 0, sizeof(act));
0dea1f55 131 act.sa_handler = sig_break;
2f694507
BC
132 act.sa_flags = SA_RESTART;
133 sigaction(SIGBREAK, &act, NULL);
134#endif
135
4c6d91e8
JA
136 memset(&act, 0, sizeof(act));
137 act.sa_handler = sig_show_status;
138 act.sa_flags = SA_RESTART;
139 sigaction(SIGUSR1, &act, NULL);
140
2e1df07d
JA
141 if (is_backend) {
142 memset(&act, 0, sizeof(act));
143 act.sa_handler = sig_int;
144 act.sa_flags = SA_RESTART;
145 sigaction(SIGPIPE, &act, NULL);
146 }
147}
148
149/*
150 * Check if we are above the minimum rate given.
151 */
8b6a404c 152static bool __check_min_rate(struct thread_data *td, struct timespec *now,
e39c0676 153 enum fio_ddir ddir)
2e1df07d 154{
f5204b8a 155 unsigned long long current_rate_check_bytes = td->this_io_bytes[ddir];
156 unsigned long current_rate_check_blocks = td->this_io_blocks[ddir];
157 unsigned long long option_rate_bytes_min = td->o.ratemin[ddir];
158 unsigned int option_rate_iops_min = td->o.rate_iops_min[ddir];
2e1df07d
JA
159
160 assert(ddir_rw(ddir));
161
162 if (!td->o.ratemin[ddir] && !td->o.rate_iops_min[ddir])
e39c0676 163 return false;
2e1df07d
JA
164
165 /*
166 * allow a 2 second settle period in the beginning
167 */
168 if (mtime_since(&td->start, now) < 2000)
e39c0676 169 return false;
2e1df07d 170
2e1df07d 171 /*
f5204b8a 172 * if last_rate_check_blocks or last_rate_check_bytes is set,
173 * we can compute a rate per ratecycle
2e1df07d 174 */
f5204b8a 175 if (td->last_rate_check_bytes[ddir] || td->last_rate_check_blocks[ddir]) {
176 unsigned long spent = mtime_since(&td->last_rate_check_time[ddir], now);
177 if (spent < td->o.ratecycle || spent==0)
e39c0676 178 return false;
2e1df07d 179
f5204b8a 180 if (td->o.ratemin[ddir]) {
2e1df07d
JA
181 /*
182 * check bandwidth specified rate
183 */
f5204b8a 184 unsigned long long current_rate_bytes =
185 ((current_rate_check_bytes - td->last_rate_check_bytes[ddir]) * 1000) / spent;
186 if (current_rate_bytes < option_rate_bytes_min) {
187 log_err("%s: rate_min=%lluB/s not met, got %lluB/s\n",
188 td->o.name, option_rate_bytes_min, current_rate_bytes);
e39c0676 189 return true;
2e1df07d
JA
190 }
191 } else {
192 /*
193 * checks iops specified rate
194 */
f5204b8a 195 unsigned long long current_rate_iops =
196 ((current_rate_check_blocks - td->last_rate_check_blocks[ddir]) * 1000) / spent;
197
198 if (current_rate_iops < option_rate_iops_min) {
199 log_err("%s: rate_iops_min=%u not met, got %llu IOPS\n",
200 td->o.name, option_rate_iops_min, current_rate_iops);
e39c0676 201 return true;
2e1df07d
JA
202 }
203 }
204 }
205
f5204b8a 206 td->last_rate_check_bytes[ddir] = current_rate_check_bytes;
207 td->last_rate_check_blocks[ddir] = current_rate_check_blocks;
208 memcpy(&td->last_rate_check_time[ddir], now, sizeof(*now));
e39c0676 209 return false;
2e1df07d
JA
210}
211
8b6a404c 212static bool check_min_rate(struct thread_data *td, struct timespec *now)
2e1df07d 213{
e39c0676 214 bool ret = false;
2e1df07d 215
dde39f8c
AD
216 for_each_rw_ddir(ddir) {
217 if (td->bytes_done[ddir])
218 ret |= __check_min_rate(td, now, ddir);
219 }
2e1df07d
JA
220
221 return ret;
222}
223
224/*
225 * When job exits, we can cancel the in-flight IO if we are using async
226 * io. Attempt to do so.
227 */
228static void cleanup_pending_aio(struct thread_data *td)
229{
2e1df07d
JA
230 int r;
231
232 /*
233 * get immediately available events, if any
234 */
55312f9f 235 r = io_u_queued_complete(td, 0);
2e1df07d
JA
236
237 /*
238 * now cancel remaining active events
239 */
240 if (td->io_ops->cancel) {
2ae0b204
JA
241 struct io_u *io_u;
242 int i;
2e1df07d 243
2ae0b204
JA
244 io_u_qiter(&td->io_u_all, io_u, i) {
245 if (io_u->flags & IO_U_F_FLIGHT) {
2e1df07d
JA
246 r = td->io_ops->cancel(td, io_u);
247 if (!r)
248 put_io_u(td, io_u);
249 }
250 }
251 }
252
253 if (td->cur_depth)
55312f9f 254 r = io_u_queued_complete(td, td->cur_depth);
2e1df07d
JA
255}
256
257/*
258 * Helper to handle the final sync of a file. Works just like the normal
259 * io path, just does everything sync.
260 */
e39c0676 261static bool fio_io_sync(struct thread_data *td, struct fio_file *f)
2e1df07d
JA
262{
263 struct io_u *io_u = __get_io_u(td);
d3b07186 264 enum fio_q_status ret;
2e1df07d
JA
265
266 if (!io_u)
e39c0676 267 return true;
2e1df07d
JA
268
269 io_u->ddir = DDIR_SYNC;
270 io_u->file = f;
00615bfb 271 io_u_set(td, io_u, IO_U_F_NO_FILE_PUT);
2e1df07d
JA
272
273 if (td_io_prep(td, io_u)) {
274 put_io_u(td, io_u);
e39c0676 275 return true;
2e1df07d
JA
276 }
277
278requeue:
279 ret = td_io_queue(td, io_u);
18f6165e
BVA
280 switch (ret) {
281 case FIO_Q_QUEUED:
a80cb54b 282 td_io_commit(td);
55312f9f 283 if (io_u_queued_complete(td, 1) < 0)
e39c0676 284 return true;
18f6165e
BVA
285 break;
286 case FIO_Q_COMPLETED:
2e1df07d
JA
287 if (io_u->error) {
288 td_verror(td, io_u->error, "td_io_queue");
e39c0676 289 return true;
2e1df07d
JA
290 }
291
55312f9f 292 if (io_u_sync_complete(td, io_u) < 0)
e39c0676 293 return true;
18f6165e
BVA
294 break;
295 case FIO_Q_BUSY:
a80cb54b 296 td_io_commit(td);
2e1df07d
JA
297 goto requeue;
298 }
299
e39c0676 300 return false;
2e1df07d 301}
a3efc919 302
61ee0f86
JA
303static int fio_file_fsync(struct thread_data *td, struct fio_file *f)
304{
00615bfb 305 int ret, ret2;
61ee0f86
JA
306
307 if (fio_file_open(f))
308 return fio_io_sync(td, f);
309
310 if (td_io_open_file(td, f))
311 return 1;
312
313 ret = fio_io_sync(td, f);
00615bfb
SW
314 ret2 = 0;
315 if (fio_file_open(f))
316 ret2 = td_io_close_file(td, f);
317 return (ret || ret2);
61ee0f86
JA
318}
319
8b6a404c 320static inline void __update_ts_cache(struct thread_data *td)
2e1df07d 321{
8b6a404c 322 fio_gettime(&td->ts_cache, NULL);
2e1df07d
JA
323}
324
8b6a404c 325static inline void update_ts_cache(struct thread_data *td)
2e1df07d 326{
8b6a404c
VF
327 if ((++td->ts_cache_nr & td->ts_cache_mask) == td->ts_cache_mask)
328 __update_ts_cache(td);
2e1df07d
JA
329}
330
8b6a404c 331static inline bool runtime_exceeded(struct thread_data *td, struct timespec *t)
2e1df07d
JA
332{
333 if (in_ramp_time(td))
e39c0676 334 return false;
2e1df07d 335 if (!td->o.timeout)
e39c0676 336 return false;
0de5b26f 337 if (utime_since(&td->epoch, t) >= td->o.timeout)
e39c0676 338 return true;
2e1df07d 339
e39c0676 340 return false;
2e1df07d
JA
341}
342
95603b74
BF
343/*
344 * We need to update the runtime consistently in ms, but keep a running
345 * tally of the current elapsed time in microseconds for sub millisecond
346 * updates.
347 */
348static inline void update_runtime(struct thread_data *td,
349 unsigned long long *elapsed_us,
350 const enum fio_ddir ddir)
351{
d5c8ea29
JA
352 if (ddir == DDIR_WRITE && td_write(td) && td->o.verify_only)
353 return;
354
95603b74
BF
355 td->ts.runtime[ddir] -= (elapsed_us[ddir] + 999) / 1000;
356 elapsed_us[ddir] += utime_since_now(&td->start);
357 td->ts.runtime[ddir] += (elapsed_us[ddir] + 999) / 1000;
358}
359
e39c0676
JA
360static bool break_on_this_error(struct thread_data *td, enum fio_ddir ddir,
361 int *retptr)
2e1df07d
JA
362{
363 int ret = *retptr;
364
365 if (ret < 0 || td->error) {
8b28bd41
DM
366 int err = td->error;
367 enum error_type_bit eb;
2e1df07d
JA
368
369 if (ret < 0)
370 err = -ret;
2e1df07d 371
8b28bd41
DM
372 eb = td_error_type(ddir, err);
373 if (!(td->o.continue_on_error & (1 << eb)))
e39c0676 374 return true;
2e1df07d 375
8b28bd41 376 if (td_non_fatal_error(td, eb, err)) {
2e1df07d
JA
377 /*
378 * Continue with the I/Os in case of
379 * a non fatal error.
380 */
381 update_error_count(td, err);
382 td_clear_error(td);
383 *retptr = 0;
e39c0676 384 return false;
418f5399 385 } else if (td->o.fill_device && (err == ENOSPC || err == EDQUOT)) {
2e1df07d
JA
386 /*
387 * We expect to hit this error if
388 * fill_device option is set.
389 */
390 td_clear_error(td);
ebea2133 391 fio_mark_td_terminate(td);
e39c0676 392 return true;
2e1df07d
JA
393 } else {
394 /*
395 * Stop the I/O in case of a fatal
396 * error.
397 */
398 update_error_count(td, err);
e39c0676 399 return true;
2e1df07d
JA
400 }
401 }
402
e39c0676 403 return false;
2e1df07d
JA
404}
405
c97f1ad6
JA
406static void check_update_rusage(struct thread_data *td)
407{
408 if (td->update_rusage) {
409 td->update_rusage = 0;
410 update_rusage_stat(td);
971caeb1 411 fio_sem_up(td->rusage_sem);
c97f1ad6
JA
412 }
413}
414
8b6a404c 415static int wait_for_completions(struct thread_data *td, struct timespec *time)
69fea81e
JA
416{
417 const int full = queue_full(td);
418 int min_evts = 0;
419 int ret;
420
6be06c46
JA
421 if (td->flags & TD_F_REGROW_LOGS)
422 return io_u_quiesce(td);
1fed2080 423
69fea81e
JA
424 /*
425 * if the queue is full, we MUST reap at least 1 event
426 */
82407585 427 min_evts = min(td->o.iodepth_batch_complete_min, td->cur_depth);
4b157ac6 428 if ((full && !min_evts) || !td->o.iodepth_batch_complete_min)
69fea81e
JA
429 min_evts = 1;
430
90711edc 431 if (time && should_check_rate(td))
69fea81e
JA
432 fio_gettime(time, NULL);
433
434 do {
55312f9f 435 ret = io_u_queued_complete(td, min_evts);
69fea81e
JA
436 if (ret < 0)
437 break;
438 } while (full && (td->cur_depth > td->o.iodepth_low));
439
440 return ret;
441}
442
e9d512d8
JA
443int io_queue_event(struct thread_data *td, struct io_u *io_u, int *ret,
444 enum fio_ddir ddir, uint64_t *bytes_issued, int from_verify,
8b6a404c 445 struct timespec *comp_time)
e9d512d8 446{
e9d512d8
JA
447 switch (*ret) {
448 case FIO_Q_COMPLETED:
449 if (io_u->error) {
450 *ret = -io_u->error;
451 clear_io_u(td, io_u);
452 } else if (io_u->resid) {
5fff9543 453 long long bytes = io_u->xfer_buflen - io_u->resid;
e9d512d8
JA
454 struct fio_file *f = io_u->file;
455
456 if (bytes_issued)
457 *bytes_issued += bytes;
458
459 if (!from_verify)
94a78d52 460 trim_io_piece(io_u);
e9d512d8
JA
461
462 /*
463 * zero read, fail
464 */
465 if (!bytes) {
466 if (!from_verify)
467 unlog_io_piece(td, io_u);
468 td_verror(td, EIO, "full resid");
fc37e3de 469 clear_io_u(td, io_u);
e9d512d8
JA
470 break;
471 }
472
473 io_u->xfer_buflen = io_u->resid;
474 io_u->xfer_buf += bytes;
475 io_u->offset += bytes;
476
477 if (ddir_rw(io_u->ddir))
478 td->ts.short_io_u[io_u->ddir]++;
479
e9d512d8
JA
480 if (io_u->offset == f->real_file_size)
481 goto sync_done;
482
483 requeue_io_u(td, &io_u);
484 } else {
485sync_done:
90711edc 486 if (comp_time && should_check_rate(td))
e9d512d8
JA
487 fio_gettime(comp_time, NULL);
488
489 *ret = io_u_sync_complete(td, io_u);
490 if (*ret < 0)
491 break;
492 }
a0e3e5a6 493
cf2c8d52
JA
494 if (td->flags & TD_F_REGROW_LOGS)
495 regrow_logs(td);
496
a0e3e5a6
EW
497 /*
498 * when doing I/O (not when verifying),
499 * check for any errors that are to be ignored
500 */
501 if (!from_verify)
502 break;
503
e9d512d8
JA
504 return 0;
505 case FIO_Q_QUEUED:
506 /*
507 * if the engine doesn't have a commit hook,
508 * the io_u is really queued. if it does have such
509 * a hook, it has to call io_u_queued() itself.
510 */
511 if (td->io_ops->commit == NULL)
512 io_u_queued(td, io_u);
513 if (bytes_issued)
514 *bytes_issued += io_u->xfer_buflen;
515 break;
516 case FIO_Q_BUSY:
517 if (!from_verify)
518 unlog_io_piece(td, io_u);
519 requeue_io_u(td, &io_u);
a80cb54b 520 td_io_commit(td);
e9d512d8
JA
521 break;
522 default:
b0775325 523 assert(*ret < 0);
e9d512d8
JA
524 td_verror(td, -(*ret), "td_io_queue");
525 break;
526 }
527
528 if (break_on_this_error(td, ddir, ret))
529 return 1;
530
531 return 0;
532}
533
e39c0676 534static inline bool io_in_polling(struct thread_data *td)
82407585
RP
535{
536 return !td->o.iodepth_batch_complete_min &&
537 !td->o.iodepth_batch_complete_max;
538}
39c1c323 539/*
540 * Unlinks files from thread data fio_file structure
541 */
542static int unlink_all_files(struct thread_data *td)
543{
544 struct fio_file *f;
545 unsigned int i;
546 int ret = 0;
547
548 for_each_file(td, f, i) {
549 if (f->filetype != FIO_TYPE_FILE)
550 continue;
551 ret = td_io_unlink_file(td, f);
552 if (ret)
553 break;
554 }
555
556 if (ret)
557 td_verror(td, ret, "unlink_all_files");
558
559 return ret;
560}
82407585 561
997b5680
SW
562/*
563 * Check if io_u will overlap an in-flight IO in the queue
564 */
c06379a6 565bool in_flight_overlap(struct io_u_queue *q, struct io_u *io_u)
997b5680
SW
566{
567 bool overlap;
568 struct io_u *check_io_u;
569 unsigned long long x1, x2, y1, y2;
570 int i;
571
572 x1 = io_u->offset;
573 x2 = io_u->offset + io_u->buflen;
574 overlap = false;
575 io_u_qiter(q, check_io_u, i) {
576 if (check_io_u->flags & IO_U_F_FLIGHT) {
577 y1 = check_io_u->offset;
578 y2 = check_io_u->offset + check_io_u->buflen;
579
580 if (x1 < y2 && y1 < x2) {
581 overlap = true;
5fff9543 582 dprint(FD_IO, "in-flight overlap: %llu/%llu, %llu/%llu\n",
997b5680
SW
583 x1, io_u->buflen,
584 y1, check_io_u->buflen);
585 break;
586 }
587 }
588 }
589
590 return overlap;
591}
592
d3b07186 593static enum fio_q_status io_u_submit(struct thread_data *td, struct io_u *io_u)
08b2b386
JA
594{
595 /*
596 * Check for overlap if the user asked us to, and we have
597 * at least one IO in flight besides this one.
598 */
599 if (td->o.serialize_overlap && td->cur_depth > 1 &&
600 in_flight_overlap(&td->io_u_all, io_u))
601 return FIO_Q_BUSY;
602
603 return td_io_queue(td, io_u);
604}
605
2e1df07d
JA
606/*
607 * The main verify engine. Runs over the writes we previously submitted,
608 * reads the blocks back in, and checks the crc/md5 of the data.
609 */
100f49f1 610static void do_verify(struct thread_data *td, uint64_t verify_bytes)
2e1df07d
JA
611{
612 struct fio_file *f;
613 struct io_u *io_u;
614 int ret, min_events;
615 unsigned int i;
616
617 dprint(FD_VERIFY, "starting loop\n");
618
619 /*
620 * sync io first and invalidate cache, to make sure we really
621 * read from disk.
622 */
623 for_each_file(td, f, i) {
624 if (!fio_file_open(f))
625 continue;
626 if (fio_io_sync(td, f))
627 break;
628 if (file_invalidate_cache(td, f))
629 break;
630 }
631
c97f1ad6
JA
632 check_update_rusage(td);
633
2e1df07d
JA
634 if (td->error)
635 return;
636
637 td_set_runstate(td, TD_VERIFYING);
638
639 io_u = NULL;
640 while (!td->terminate) {
fbccf46c 641 enum fio_ddir ddir;
e9d512d8 642 int full;
2e1df07d 643
8b6a404c 644 update_ts_cache(td);
c97f1ad6 645 check_update_rusage(td);
2e1df07d 646
8b6a404c
VF
647 if (runtime_exceeded(td, &td->ts_cache)) {
648 __update_ts_cache(td);
649 if (runtime_exceeded(td, &td->ts_cache)) {
ebea2133 650 fio_mark_td_terminate(td);
2e1df07d
JA
651 break;
652 }
653 }
654
9e684a49
DE
655 if (flow_threshold_exceeded(td))
656 continue;
657
44cbc6da
JA
658 if (!td->o.experimental_verify) {
659 io_u = __get_io_u(td);
660 if (!io_u)
661 break;
2e1df07d 662
44cbc6da
JA
663 if (get_next_verify(td, io_u)) {
664 put_io_u(td, io_u);
665 break;
666 }
2e1df07d 667
44cbc6da
JA
668 if (td_io_prep(td, io_u)) {
669 put_io_u(td, io_u);
670 break;
671 }
672 } else {
191d6634 673 if (td->bytes_verified + td->o.rw_min_bs > verify_bytes)
100f49f1
JA
674 break;
675
bcd5abfa 676 while ((io_u = get_io_u(td)) != NULL) {
059b61f2 677 if (IS_ERR_OR_NULL(io_u)) {
002fe734
JA
678 io_u = NULL;
679 ret = FIO_Q_BUSY;
680 goto reap;
681 }
682
bcd5abfa
JA
683 /*
684 * We are only interested in the places where
685 * we wrote or trimmed IOs. Turn those into
686 * reads for verification purposes.
687 */
688 if (io_u->ddir == DDIR_READ) {
689 /*
690 * Pretend we issued it for rwmix
691 * accounting
692 */
693 td->io_issues[DDIR_READ]++;
694 put_io_u(td, io_u);
695 continue;
696 } else if (io_u->ddir == DDIR_TRIM) {
697 io_u->ddir = DDIR_READ;
1651e431 698 io_u_set(td, io_u, IO_U_F_TRIMMED);
bcd5abfa
JA
699 break;
700 } else if (io_u->ddir == DDIR_WRITE) {
701 io_u->ddir = DDIR_READ;
28921bc0
SK
702 io_u->numberio = td->verify_read_issues;
703 td->verify_read_issues++;
5c5c33c1 704 populate_verify_io_u(td, io_u);
bcd5abfa
JA
705 break;
706 } else {
707 put_io_u(td, io_u);
708 continue;
709 }
710 }
44cbc6da 711
bcd5abfa 712 if (!io_u)
44cbc6da 713 break;
2e1df07d
JA
714 }
715
ca09be4b
JA
716 if (verify_state_should_stop(td, io_u)) {
717 put_io_u(td, io_u);
718 break;
719 }
720
2e1df07d
JA
721 if (td->o.verify_async)
722 io_u->end_io = verify_io_u_async;
723 else
724 io_u->end_io = verify_io_u;
725
fbccf46c 726 ddir = io_u->ddir;
10adc4a7
GG
727 if (!td->o.disable_slat)
728 fio_gettime(&io_u->start_time, NULL);
fbccf46c 729
08b2b386 730 ret = io_u_submit(td, io_u);
2e1df07d 731
e9d512d8 732 if (io_queue_event(td, io_u, &ret, ddir, NULL, 1, NULL))
2e1df07d
JA
733 break;
734
735 /*
736 * if we can queue more, do so. but check if there are
737 * completed io_u's first. Note that we can get BUSY even
738 * without IO queued, if the system is resource starved.
739 */
002fe734 740reap:
2e1df07d 741 full = queue_full(td) || (ret == FIO_Q_BUSY && td->cur_depth);
82407585 742 if (full || io_in_polling(td))
55312f9f 743 ret = wait_for_completions(td, NULL);
2e1df07d 744
2e1df07d
JA
745 if (ret < 0)
746 break;
747 }
748
c97f1ad6
JA
749 check_update_rusage(td);
750
2e1df07d
JA
751 if (!td->error) {
752 min_events = td->cur_depth;
753
754 if (min_events)
55312f9f 755 ret = io_u_queued_complete(td, min_events);
2e1df07d
JA
756 } else
757 cleanup_pending_aio(td);
758
759 td_set_runstate(td, TD_RUNNING);
760
761 dprint(FD_VERIFY, "exiting loop\n");
762}
763
e39c0676 764static bool exceeds_number_ios(struct thread_data *td)
3939fe85
JA
765{
766 unsigned long long number_ios;
767
768 if (!td->o.number_ios)
e39c0676 769 return false;
3939fe85 770
cf8a46a7 771 number_ios = ddir_rw_sum(td->io_blocks);
3939fe85
JA
772 number_ios += td->io_u_queued + td->io_u_in_flight;
773
cf8a46a7 774 return number_ios >= (td->o.number_ios * td->loops);
3939fe85
JA
775}
776
926098e0 777static bool io_bytes_exceeded(struct thread_data *td, uint64_t *this_bytes)
f7078f7b 778{
77731b29 779 unsigned long long bytes, limit;
f7078f7b
JA
780
781 if (td_rw(td))
926098e0 782 bytes = this_bytes[DDIR_READ] + this_bytes[DDIR_WRITE];
f7078f7b 783 else if (td_write(td))
926098e0 784 bytes = this_bytes[DDIR_WRITE];
6eaf09d6 785 else if (td_read(td))
926098e0 786 bytes = this_bytes[DDIR_READ];
f7078f7b 787 else
926098e0 788 bytes = this_bytes[DDIR_TRIM];
f7078f7b 789
5be9bf09
TK
790 if (td->o.io_size)
791 limit = td->o.io_size;
77731b29
JA
792 else
793 limit = td->o.size;
794
cf8a46a7 795 limit *= td->loops;
77731b29 796 return bytes >= limit || exceeds_number_ios(td);
f7078f7b
JA
797}
798
926098e0 799static bool io_issue_bytes_exceeded(struct thread_data *td)
e28dd2cf 800{
926098e0
JA
801 return io_bytes_exceeded(td, td->io_issue_bytes);
802}
e28dd2cf 803
926098e0
JA
804static bool io_complete_bytes_exceeded(struct thread_data *td)
805{
806 return io_bytes_exceeded(td, td->this_io_bytes);
e28dd2cf
JE
807}
808
50a8ce86
D
809/*
810 * used to calculate the next io time for rate control
811 *
812 */
813static long long usec_for_io(struct thread_data *td, enum fio_ddir ddir)
814{
1a9bf814 815 uint64_t bps = td->rate_bps[ddir];
50a8ce86
D
816
817 assert(!(td->flags & TD_F_CHILD));
ff6bb260 818
6de65959 819 if (td->o.rate_process == RATE_PROCESS_POISSON) {
1a9bf814
JA
820 uint64_t val, iops;
821
d6299558 822 iops = bps / td->o.min_bs[ddir];
a77d139b 823 val = (int64_t) (1000000 / iops) *
6c8611c7 824 -logf(__rand_0_1(&td->poisson_state[ddir]));
a77d139b 825 if (val) {
98e51d7c
JA
826 dprint(FD_RATE, "poisson rate iops=%llu, ddir=%d\n",
827 (unsigned long long) 1000000 / val,
828 ddir);
a77d139b 829 }
6c8611c7
JA
830 td->last_usec[ddir] += val;
831 return td->last_usec[ddir];
ff6bb260 832 } else if (bps) {
1a9bf814
JA
833 uint64_t bytes = td->rate_io_issue_bytes[ddir];
834 uint64_t secs = bytes / bps;
835 uint64_t remainder = bytes % bps;
836
50a8ce86 837 return remainder * 1000000 / bps + secs * 1000000;
e7b24047
JA
838 }
839
840 return 0;
50a8ce86
D
841}
842
f7942acd
SK
843static void init_thinktime(struct thread_data *td)
844{
845 if (td->o.thinktime_blocks_type == THINKTIME_BLOCKS_TYPE_COMPLETE)
846 td->thinktime_blocks_counter = td->io_blocks;
847 else
848 td->thinktime_blocks_counter = td->io_issues;
849 td->last_thinktime = td->epoch;
850 td->last_thinktime_blocks = 0;
851}
852
7216b664
HQ
853static void handle_thinktime(struct thread_data *td, enum fio_ddir ddir,
854 struct timespec *time)
1a9bf814
JA
855{
856 unsigned long long b;
f9fc7a27 857 unsigned long long runtime_left;
1a9bf814
JA
858 uint64_t total;
859 int left;
f7942acd
SK
860 struct timespec now;
861 bool stall = false;
862
863 if (td->o.thinktime_iotime) {
864 fio_gettime(&now, NULL);
865 if (utime_since(&td->last_thinktime, &now)
f9fc7a27 866 >= td->o.thinktime_iotime) {
f7942acd
SK
867 stall = true;
868 } else if (!fio_option_is_set(&td->o, thinktime_blocks)) {
869 /*
870 * When thinktime_iotime is set and thinktime_blocks is
871 * not set, skip the thinktime_blocks check, since
872 * thinktime_blocks default value 1 does not work
873 * together with thinktime_iotime.
874 */
875 return;
876 }
877
878 }
1a9bf814 879
33f42c20 880 b = ddir_rw_sum(td->thinktime_blocks_counter);
f7942acd
SK
881 if (b >= td->last_thinktime_blocks + td->o.thinktime_blocks)
882 stall = true;
883
884 if (!stall)
1a9bf814
JA
885 return;
886
887 io_u_quiesce(td);
888
f9fc7a27
AK
889 left = td->o.thinktime_spin;
890 if (td->o.timeout) {
891 runtime_left = td->o.timeout - utime_since_now(&td->epoch);
892 if (runtime_left < (unsigned long long)left)
893 left = runtime_left;
894 }
895
1a9bf814 896 total = 0;
f9fc7a27
AK
897 if (left)
898 total = usec_spin(left);
1a9bf814 899
14adf6e3
MK
900 /*
901 * usec_spin() might run for slightly longer than intended in a VM
902 * where the vCPU could get descheduled or the hypervisor could steal
903 * CPU time. Ensure "left" doesn't become negative.
904 */
905 if (total < td->o.thinktime)
906 left = td->o.thinktime - total;
907 else
908 left = 0;
909
f9fc7a27
AK
910 if (td->o.timeout) {
911 runtime_left = td->o.timeout - utime_since_now(&td->epoch);
912 if (runtime_left < (unsigned long long)left)
913 left = runtime_left;
914 }
915
1a9bf814
JA
916 if (left)
917 total += usec_sleep(td, left);
918
919 /*
920 * If we're ignoring thinktime for the rate, add the number of bytes
1aa39b0c
JA
921 * we would have done while sleeping, minus one block to ensure we
922 * start issuing immediately after the sleep.
1a9bf814 923 */
1aa39b0c 924 if (total && td->rate_bps[ddir] && td->o.rate_ign_think) {
f2aedb17 925 uint64_t missed = (td->rate_bps[ddir] * total) / 1000000ULL;
62b858f6
JA
926 uint64_t bs = td->o.min_bs[ddir];
927 uint64_t usperop = bs * 1000000ULL / td->rate_bps[ddir];
f2aedb17
JA
928 uint64_t over;
929
62b858f6
JA
930 if (usperop <= total)
931 over = bs;
f2aedb17 932 else
62b858f6 933 over = (usperop - total) / usperop * -bs;
f2aedb17
JA
934
935 td->rate_io_issue_bytes[ddir] += (missed - over);
182cab24
JA
936 /* adjust for rate_process=poisson */
937 td->last_usec[ddir] += total;
1aa39b0c 938 }
7216b664
HQ
939
940 if (time && should_check_rate(td))
941 fio_gettime(time, NULL);
f7942acd
SK
942
943 td->last_thinktime_blocks = b;
f9fc7a27
AK
944 if (td->o.thinktime_iotime) {
945 fio_gettime(&now, NULL);
f7942acd 946 td->last_thinktime = now;
f9fc7a27 947 }
1a9bf814
JA
948}
949
2e1df07d
JA
950/*
951 * Main IO worker function. It retrieves io_u's to process and queues
952 * and reaps them, checking for rate and errors along the way.
100f49f1
JA
953 *
954 * Returns number of bytes written and trimmed.
2e1df07d 955 */
95b03be0 956static void do_io(struct thread_data *td, uint64_t *bytes_done)
2e1df07d
JA
957{
958 unsigned int i;
959 int ret = 0;
c2703bf3 960 uint64_t total_bytes, bytes_issued = 0;
70c68076 961
95b03be0
JA
962 for (i = 0; i < DDIR_RWDIR_CNT; i++)
963 bytes_done[i] = td->bytes_done[i];
2e1df07d
JA
964
965 if (in_ramp_time(td))
966 td_set_runstate(td, TD_RAMP);
967 else
968 td_set_runstate(td, TD_RUNNING);
969
3e260a46
JA
970 lat_target_init(td);
971
1e564979
JE
972 total_bytes = td->o.size;
973 /*
5be9bf09 974 * Allow random overwrite workloads to write up to io_size
1e564979
JE
975 * before starting verification phase as 'size' doesn't apply.
976 */
977 if (td_write(td) && td_random(td) && td->o.norandommap)
5be9bf09 978 total_bytes = max(total_bytes, (uint64_t) td->o.io_size);
78a6469c
JA
979 /*
980 * If verify_backlog is enabled, we'll run the verify in this
981 * handler as well. For that case, we may need up to twice the
982 * amount of bytes.
983 */
78a6469c
JA
984 if (td->o.verify != VERIFY_NONE &&
985 (td_write(td) && td->o.verify_backlog))
c2703bf3
JA
986 total_bytes += td->o.size;
987
82a90686 988 /* In trimwrite mode, each byte is trimmed and then written, so
08996af4
AK
989 * allow total_bytes or number of ios to be twice as big */
990 if (td_trimwrite(td)) {
0e4dd95c 991 total_bytes += td->total_io_size;
08996af4
AK
992 td->o.number_ios *= 2;
993 }
0e4dd95c 994
f7078f7b 995 while ((td->o.read_iolog_file && !flist_empty(&td->io_log_list)) ||
e28dd2cf 996 (!flist_empty(&td->trim_list)) || !io_issue_bytes_exceeded(td) ||
c04e4661 997 td->o.time_based) {
8b6a404c 998 struct timespec comp_time;
2e1df07d 999 struct io_u *io_u;
e9d512d8 1000 int full;
2e1df07d
JA
1001 enum fio_ddir ddir;
1002
c97f1ad6
JA
1003 check_update_rusage(td);
1004
7d7803fa 1005 if (td->terminate || td->done)
2e1df07d
JA
1006 break;
1007
8b6a404c 1008 update_ts_cache(td);
2e1df07d 1009
8b6a404c
VF
1010 if (runtime_exceeded(td, &td->ts_cache)) {
1011 __update_ts_cache(td);
1012 if (runtime_exceeded(td, &td->ts_cache)) {
ebea2133 1013 fio_mark_td_terminate(td);
2e1df07d
JA
1014 break;
1015 }
1016 }
1017
9e684a49
DE
1018 if (flow_threshold_exceeded(td))
1019 continue;
1020
f1a32461
JA
1021 /*
1022 * Break if we exceeded the bytes. The exception is time
1023 * based runs, but we still need to break out of the loop
1024 * for those to run verification, if enabled.
98e7161c 1025 * Jobs read from iolog do not use this stop condition.
f1a32461
JA
1026 */
1027 if (bytes_issued >= total_bytes &&
98e7161c 1028 !td->o.read_iolog_file &&
f1a32461
JA
1029 (!td->o.time_based ||
1030 (td->o.time_based && td->o.verify != VERIFY_NONE)))
20876c53
JC
1031 break;
1032
2e1df07d 1033 io_u = get_io_u(td);
002fe734
JA
1034 if (IS_ERR_OR_NULL(io_u)) {
1035 int err = PTR_ERR(io_u);
1036
1037 io_u = NULL;
1a9bf814 1038 ddir = DDIR_INVAL;
002fe734
JA
1039 if (err == -EBUSY) {
1040 ret = FIO_Q_BUSY;
1041 goto reap;
1042 }
3e260a46
JA
1043 if (td->o.latency_target)
1044 goto reap;
2e1df07d 1045 break;
3e260a46 1046 }
2e1df07d 1047
28921bc0 1048 if (io_u->ddir == DDIR_WRITE && td->flags & TD_F_DO_VERIFY) {
ad21b61d
H
1049 if (!(io_u->flags & IO_U_F_PATTERN_DONE)) {
1050 io_u_set(td, io_u, IO_U_F_PATTERN_DONE);
1051 io_u->numberio = td->io_issues[io_u->ddir];
1052 populate_verify_io_u(td, io_u);
1053 }
28921bc0 1054 }
5c5c33c1 1055
2e1df07d
JA
1056 ddir = io_u->ddir;
1057
1058 /*
82af2a7c
JA
1059 * Add verification end_io handler if:
1060 * - Asked to verify (!td_rw(td))
1061 * - Or the io_u is from our verify list (mixed write/ver)
2e1df07d
JA
1062 */
1063 if (td->o.verify != VERIFY_NONE && io_u->ddir == DDIR_READ &&
82af2a7c 1064 ((io_u->flags & IO_U_F_VER_LIST) || !td_rw(td))) {
c4b6117b 1065
ca09be4b
JA
1066 if (verify_state_should_stop(td, io_u)) {
1067 put_io_u(td, io_u);
1068 break;
1069 }
1070
2e1df07d
JA
1071 if (td->o.verify_async)
1072 io_u->end_io = verify_io_u_async;
1073 else
1074 io_u->end_io = verify_io_u;
1075 td_set_runstate(td, TD_VERIFYING);
1076 } else if (in_ramp_time(td))
1077 td_set_runstate(td, TD_RAMP);
1078 else
1079 td_set_runstate(td, TD_RUNNING);
1080
9a50c5c5 1081 /*
f9401285
JA
1082 * Always log IO before it's issued, so we know the specific
1083 * order of it. The logged unit will track when the IO has
1084 * completed.
9a50c5c5 1085 */
c4b6117b
PV
1086 if (td_write(td) && io_u->ddir == DDIR_WRITE &&
1087 td->o.do_verify &&
1088 td->o.verify != VERIFY_NONE &&
f9401285 1089 !td->o.experimental_verify)
c4b6117b
PV
1090 log_io_piece(td, io_u);
1091
a9da8ab2 1092 if (td->o.io_submit_mode == IO_MODE_OFFLOAD) {
5fff9543 1093 const unsigned long long blen = io_u->xfer_buflen;
a43f4461 1094 const enum fio_ddir __ddir = acct_ddir(io_u);
0c5df5f9 1095
a9da8ab2
JA
1096 if (td->error)
1097 break;
0c5df5f9 1098
26de50cf
JA
1099 workqueue_enqueue(&td->io_wq, &io_u->work);
1100 ret = FIO_Q_QUEUED;
50a8ce86 1101
a43f4461
JA
1102 if (ddir_rw(__ddir)) {
1103 td->io_issues[__ddir]++;
1104 td->io_issue_bytes[__ddir] += blen;
1105 td->rate_io_issue_bytes[__ddir] += blen;
0c5df5f9
JA
1106 }
1107
5b28b75b 1108 if (should_check_rate(td)) {
a43f4461 1109 td->rate_next_io_time[__ddir] = usec_for_io(td, __ddir);
5b28b75b 1110 fio_gettime(&comp_time, NULL);
1111 }
50a8ce86 1112
a9da8ab2 1113 } else {
08b2b386 1114 ret = io_u_submit(td, io_u);
2e1df07d 1115
50a8ce86
D
1116 if (should_check_rate(td))
1117 td->rate_next_io_time[ddir] = usec_for_io(td, ddir);
1118
fd727d9d 1119 if (io_queue_event(td, io_u, &ret, ddir, &bytes_issued, 0, &comp_time))
a9da8ab2 1120 break;
2e1df07d 1121
a9da8ab2
JA
1122 /*
1123 * See if we need to complete some commands. Note that
1124 * we can get BUSY even without IO queued, if the
1125 * system is resource starved.
1126 */
3e260a46 1127reap:
a9da8ab2
JA
1128 full = queue_full(td) ||
1129 (ret == FIO_Q_BUSY && td->cur_depth);
82407585 1130 if (full || io_in_polling(td))
a9da8ab2
JA
1131 ret = wait_for_completions(td, &comp_time);
1132 }
2e1df07d
JA
1133 if (ret < 0)
1134 break;
33f42c20
HQ
1135
1136 if (ddir_rw(ddir) && td->o.thinktime)
7216b664 1137 handle_thinktime(td, ddir, &comp_time);
33f42c20 1138
55312f9f 1139 if (!ddir_rw_sum(td->bytes_done) &&
9b87f09b 1140 !td_ioengine_flagged(td, FIO_NOIO))
2e1df07d
JA
1141 continue;
1142
55312f9f
JA
1143 if (!in_ramp_time(td) && should_check_rate(td)) {
1144 if (check_min_rate(td, &comp_time)) {
f9cafb12 1145 if (exitall_on_terminate || td->o.exitall_error)
64402a8a 1146 fio_terminate_threads(td->groupid, td->o.exit_what);
2e1df07d
JA
1147 td_verror(td, EIO, "check_min_rate");
1148 break;
1149 }
1150 }
3e260a46
JA
1151 if (!in_ramp_time(td) && td->o.latency_target)
1152 lat_target_check(td);
2e1df07d
JA
1153 }
1154
c97f1ad6
JA
1155 check_update_rusage(td);
1156
2e1df07d 1157 if (td->trim_entries)
4e0a8fa2 1158 log_err("fio: %lu trim entries leaked?\n", td->trim_entries);
2e1df07d 1159
418f5399 1160 if (td->o.fill_device && (td->error == ENOSPC || td->error == EDQUOT)) {
2e1df07d 1161 td->error = 0;
ebea2133 1162 fio_mark_td_terminate(td);
2e1df07d
JA
1163 }
1164 if (!td->error) {
1165 struct fio_file *f;
1166
a9da8ab2
JA
1167 if (td->o.io_submit_mode == IO_MODE_OFFLOAD) {
1168 workqueue_flush(&td->io_wq);
1169 i = 0;
1170 } else
1171 i = td->cur_depth;
1172
2e1df07d 1173 if (i) {
55312f9f 1174 ret = io_u_queued_complete(td, i);
418f5399
MB
1175 if (td->o.fill_device &&
1176 (td->error == ENOSPC || td->error == EDQUOT))
2e1df07d
JA
1177 td->error = 0;
1178 }
1179
00615bfb 1180 if (should_fsync(td) && (td->o.end_fsync || td->o.fsync_on_close)) {
2e1df07d
JA
1181 td_set_runstate(td, TD_FSYNCING);
1182
1183 for_each_file(td, f, i) {
61ee0f86 1184 if (!fio_file_fsync(td, f))
2e1df07d 1185 continue;
61ee0f86
JA
1186
1187 log_err("fio: end_fsync failed for file %s\n",
1188 f->file_name);
2e1df07d
JA
1189 }
1190 }
5b28b75b 1191 } else {
1192 if (td->o.io_submit_mode == IO_MODE_OFFLOAD)
1193 workqueue_flush(&td->io_wq);
2e1df07d 1194 cleanup_pending_aio(td);
5b28b75b 1195 }
2e1df07d
JA
1196
1197 /*
1198 * stop job if we failed doing any IO
1199 */
342f4be4 1200 if (!ddir_rw_sum(td->this_io_bytes))
2e1df07d 1201 td->done = 1;
100f49f1 1202
95b03be0
JA
1203 for (i = 0; i < DDIR_RWDIR_CNT; i++)
1204 bytes_done[i] = td->bytes_done[i] - bytes_done[i];
2e1df07d
JA
1205}
1206
94a6e1bb
JA
1207static void free_file_completion_logging(struct thread_data *td)
1208{
1209 struct fio_file *f;
1210 unsigned int i;
1211
1212 for_each_file(td, f, i) {
1213 if (!f->last_write_comp)
1214 break;
1215 sfree(f->last_write_comp);
1216 }
1217}
1218
1219static int init_file_completion_logging(struct thread_data *td,
1220 unsigned int depth)
1221{
1222 struct fio_file *f;
1223 unsigned int i;
1224
1225 if (td->o.verify == VERIFY_NONE || !td->o.verify_state_save)
1226 return 0;
1227
1228 for_each_file(td, f, i) {
1229 f->last_write_comp = scalloc(depth, sizeof(uint64_t));
1230 if (!f->last_write_comp)
1231 goto cleanup;
1232 }
1233
1234 return 0;
1235
1236cleanup:
1237 free_file_completion_logging(td);
1238 log_err("fio: failed to alloc write comp data\n");
1239 return 1;
1240}
1241
2e1df07d
JA
1242static void cleanup_io_u(struct thread_data *td)
1243{
2e1df07d
JA
1244 struct io_u *io_u;
1245
2ae0b204 1246 while ((io_u = io_u_qpop(&td->io_u_freelist)) != NULL) {
c73ed246
JA
1247
1248 if (td->io_ops->io_u_free)
1249 td->io_ops->io_u_free(td, io_u);
1250
3114b675 1251 fio_memfree(io_u, sizeof(*io_u), td_offload_overlap(td));
2e1df07d
JA
1252 }
1253
1254 free_io_mem(td);
2ae0b204
JA
1255
1256 io_u_rexit(&td->io_u_requeues);
3114b675
VF
1257 io_u_qexit(&td->io_u_freelist, false);
1258 io_u_qexit(&td->io_u_all, td_offload_overlap(td));
ca09be4b 1259
94a6e1bb 1260 free_file_completion_logging(td);
2e1df07d
JA
1261}
1262
1263static int init_io_u(struct thread_data *td)
1264{
1265 struct io_u *io_u;
2e1df07d 1266 int cl_align, i, max_units;
71e6e5a2 1267 int err;
2e1df07d
JA
1268
1269 max_units = td->o.iodepth;
59d8d0f5 1270
2ae0b204 1271 err = 0;
34851ad5 1272 err += !io_u_rinit(&td->io_u_requeues, td->o.iodepth);
3114b675
VF
1273 err += !io_u_qinit(&td->io_u_freelist, td->o.iodepth, false);
1274 err += !io_u_qinit(&td->io_u_all, td->o.iodepth, td_offload_overlap(td));
2ae0b204
JA
1275
1276 if (err) {
1277 log_err("fio: failed setting up IO queues\n");
1278 return 1;
1279 }
1280
71e6e5a2
AK
1281 cl_align = os_cache_line_size();
1282
1283 for (i = 0; i < max_units; i++) {
1284 void *ptr;
1285
1286 if (td->terminate)
1287 return 1;
1288
3114b675 1289 ptr = fio_memalign(cl_align, sizeof(*io_u), td_offload_overlap(td));
71e6e5a2
AK
1290 if (!ptr) {
1291 log_err("fio: unable to allocate aligned memory\n");
ab43b8cb 1292 return 1;
71e6e5a2
AK
1293 }
1294
1295 io_u = ptr;
1296 memset(io_u, 0, sizeof(*io_u));
1297 INIT_FLIST_HEAD(&io_u->verify_list);
1298 dprint(FD_MEM, "io_u alloc %p, index %u\n", io_u, i);
1299
1300 io_u->index = i;
1301 io_u->flags = IO_U_F_FREE;
1302 io_u_qpush(&td->io_u_freelist, io_u);
1303
1304 /*
1305 * io_u never leaves this stack, used for iteration of all
1306 * io_u buffers.
1307 */
1308 io_u_qpush(&td->io_u_all, io_u);
1309
1310 if (td->io_ops->io_u_init) {
1311 int ret = td->io_ops->io_u_init(td, io_u);
1312
1313 if (ret) {
1314 log_err("fio: failed to init engine data: %d\n", ret);
1315 return 1;
1316 }
1317 }
1318 }
1319
6d8fe6e8
SK
1320 if (init_io_u_buffers(td))
1321 return 1;
71e6e5a2
AK
1322
1323 if (init_file_completion_logging(td, max_units))
1324 return 1;
1325
1326 return 0;
1327}
1328
1329int init_io_u_buffers(struct thread_data *td)
1330{
1331 struct io_u *io_u;
1332 unsigned long long max_bs, min_write;
1333 int i, max_units;
1334 int data_xfer = 1;
1335 char *p;
1336
1337 max_units = td->o.iodepth;
1338 max_bs = td_max_bs(td);
1339 min_write = td->o.min_bs[DDIR_WRITE];
1340 td->orig_buffer_size = (unsigned long long) max_bs
1341 * (unsigned long long) max_units;
1342
1343 if (td_ioengine_flagged(td, FIO_NOIO) || !(td_read(td) || td_write(td)))
1344 data_xfer = 0;
1345
fd8a09b8 1346 /*
1347 * if we may later need to do address alignment, then add any
1348 * possible adjustment here so that we don't cause a buffer
1349 * overflow later. this adjustment may be too much if we get
1350 * lucky and the allocator gives us an aligned address.
1351 */
a25ba6c6 1352 if (td->o.odirect || td->o.mem_align ||
9b87f09b 1353 td_ioengine_flagged(td, FIO_RAWIO))
fd8a09b8 1354 td->orig_buffer_size += page_mask + td->o.mem_align;
1355
2e1df07d 1356 if (td->o.mem_type == MEM_SHMHUGE || td->o.mem_type == MEM_MMAPHUGE) {
5fff9543 1357 unsigned long long bs;
2e1df07d
JA
1358
1359 bs = td->orig_buffer_size + td->o.hugepage_size - 1;
1360 td->orig_buffer_size = bs & ~(td->o.hugepage_size - 1);
1361 }
1362
1363 if (td->orig_buffer_size != (size_t) td->orig_buffer_size) {
1364 log_err("fio: IO memory too large. Reduce max_bs or iodepth\n");
1365 return 1;
1366 }
1367
59d8d0f5 1368 if (data_xfer && allocate_io_mem(td))
2e1df07d
JA
1369 return 1;
1370
a25ba6c6 1371 if (td->o.odirect || td->o.mem_align ||
9b87f09b 1372 td_ioengine_flagged(td, FIO_RAWIO))
248c9436 1373 p = PTR_ALIGN(td->orig_buffer, page_mask) + td->o.mem_align;
2e1df07d
JA
1374 else
1375 p = td->orig_buffer;
1376
2e1df07d 1377 for (i = 0; i < max_units; i++) {
71e6e5a2 1378 io_u = td->io_u_all.io_us[i];
2e1df07d
JA
1379 dprint(FD_MEM, "io_u alloc %p, index %u\n", io_u, i);
1380
59d8d0f5 1381 if (data_xfer) {
2e1df07d
JA
1382 io_u->buf = p;
1383 dprint(FD_MEM, "io_u %p, mem %p\n", io_u, io_u->buf);
1384
1385 if (td_write(td))
9c42684e 1386 io_u_fill_buffer(td, io_u, min_write, max_bs);
2e1df07d
JA
1387 if (td_write(td) && td->o.verify_pattern_bytes) {
1388 /*
1389 * Fill the buffer with the pattern if we are
1390 * going to be doing writes.
1391 */
ce35b1ec 1392 fill_verify_pattern(td, io_u->buf, max_bs, io_u, 0, 0);
2e1df07d
JA
1393 }
1394 }
2e1df07d
JA
1395 p += max_bs;
1396 }
1397
1398 return 0;
1399}
1400
5592e992 1401#ifdef FIO_HAVE_IOSCHED_SWITCH
bd4d9bdc 1402/*
5592e992 1403 * These functions are Linux specific.
bd4d9bdc
TK
1404 * FIO_HAVE_IOSCHED_SWITCH enabled currently means it's Linux.
1405 */
5592e992 1406static int set_ioscheduler(struct thread_data *td, struct fio_file *file)
2e1df07d 1407{
178ef27a 1408 char tmp[256], tmp2[128], *p;
2e1df07d
JA
1409 FILE *f;
1410 int ret;
1411
5592e992
DLM
1412 assert(file->du && file->du->sysfs_root);
1413 sprintf(tmp, "%s/queue/scheduler", file->du->sysfs_root);
2e1df07d
JA
1414
1415 f = fopen(tmp, "r+");
1416 if (!f) {
1417 if (errno == ENOENT) {
1418 log_err("fio: os or kernel doesn't support IO scheduler"
1419 " switching\n");
1420 return 0;
1421 }
1422 td_verror(td, errno, "fopen iosched");
1423 return 1;
1424 }
1425
1426 /*
1427 * Set io scheduler.
1428 */
1429 ret = fwrite(td->o.ioscheduler, strlen(td->o.ioscheduler), 1, f);
1430 if (ferror(f) || ret != 1) {
1431 td_verror(td, errno, "fwrite");
1432 fclose(f);
1433 return 1;
1434 }
1435
1436 rewind(f);
1437
1438 /*
1439 * Read back and check that the selected scheduler is now the default.
1440 */
0e23d456 1441 ret = fread(tmp, 1, sizeof(tmp) - 1, f);
2e1df07d
JA
1442 if (ferror(f) || ret < 0) {
1443 td_verror(td, errno, "fread");
1444 fclose(f);
1445 return 1;
1446 }
0e23d456 1447 tmp[ret] = '\0';
b44b9e45 1448 /*
178ef27a
BVA
1449 * either a list of io schedulers or "none\n" is expected. Strip the
1450 * trailing newline.
b44b9e45 1451 */
178ef27a
BVA
1452 p = tmp;
1453 strsep(&p, "\n");
49c6f33d 1454
67f28a8c
TK
1455 /*
1456 * Write to "none" entry doesn't fail, so check the result here.
1457 */
1458 if (!strcmp(tmp, "none")) {
1459 log_err("fio: io scheduler is not tunable\n");
1460 fclose(f);
1461 return 0;
1462 }
2e1df07d
JA
1463
1464 sprintf(tmp2, "[%s]", td->o.ioscheduler);
1465 if (!strstr(tmp, tmp2)) {
da44720c 1466 log_err("fio: unable to set io scheduler to %s\n", td->o.ioscheduler);
2e1df07d
JA
1467 td_verror(td, EINVAL, "iosched_switch");
1468 fclose(f);
1469 return 1;
1470 }
1471
1472 fclose(f);
1473 return 0;
5592e992
DLM
1474}
1475
1476static int switch_ioscheduler(struct thread_data *td)
1477{
1478 struct fio_file *f;
1479 unsigned int i;
1480 int ret = 0;
1481
1482 if (td_ioengine_flagged(td, FIO_DISKLESSIO))
1483 return 0;
1484
1485 assert(td->files && td->files[0]);
1486
1487 for_each_file(td, f, i) {
1488
1489 /* Only consider regular files and block device files */
1490 switch (f->filetype) {
1491 case FIO_TYPE_FILE:
1492 case FIO_TYPE_BLOCK:
1493 /*
1494 * Make sure that the device hosting the file could
1495 * be determined.
1496 */
1497 if (!f->du)
1498 continue;
1499 break;
1500 case FIO_TYPE_CHAR:
1501 case FIO_TYPE_PIPE:
1502 default:
1503 continue;
1504 }
1505
1506 ret = set_ioscheduler(td, f);
1507 if (ret)
1508 return ret;
1509 }
1510
1511 return 0;
1512}
1513
db815fb3 1514#else
5592e992
DLM
1515
1516static int switch_ioscheduler(struct thread_data *td)
1517{
db815fb3 1518 return 0;
2e1df07d
JA
1519}
1520
5592e992
DLM
1521#endif /* FIO_HAVE_IOSCHED_SWITCH */
1522
e39c0676 1523static bool keep_running(struct thread_data *td)
2e1df07d 1524{
77731b29
JA
1525 unsigned long long limit;
1526
2e1df07d 1527 if (td->done)
e39c0676 1528 return false;
98413be7
SW
1529 if (td->terminate)
1530 return false;
2e1df07d 1531 if (td->o.time_based)
e39c0676 1532 return true;
2e1df07d
JA
1533 if (td->o.loops) {
1534 td->o.loops--;
e39c0676 1535 return true;
2e1df07d 1536 }
3939fe85 1537 if (exceeds_number_ios(td))
e39c0676 1538 return false;
26251d8d 1539
5be9bf09
TK
1540 if (td->o.io_size)
1541 limit = td->o.io_size;
77731b29
JA
1542 else
1543 limit = td->o.size;
1544
1545 if (limit != -1ULL && ddir_rw_sum(td->io_bytes) < limit) {
5bd5f71a
JA
1546 uint64_t diff;
1547
1548 /*
589d5d4f 1549 * If the difference is less than the maximum IO size, we
5bd5f71a
JA
1550 * are done.
1551 */
77731b29 1552 diff = limit - ddir_rw_sum(td->io_bytes);
74f4b020 1553 if (diff < td_max_bs(td))
e39c0676 1554 return false;
5bd5f71a 1555
5be9bf09 1556 if (fio_files_done(td) && !td->o.io_size)
e39c0676 1557 return false;
002fe734 1558
e39c0676 1559 return true;
5bd5f71a 1560 }
2e1df07d 1561
e39c0676 1562 return false;
2e1df07d
JA
1563}
1564
b7e4a53c
BVA
1565static int exec_string(struct thread_options *o, const char *string,
1566 const char *mode)
2e1df07d 1567{
f491a907 1568 int ret;
2e1df07d
JA
1569 char *str;
1570
b7e4a53c
BVA
1571 if (asprintf(&str, "%s > %s.%s.txt 2>&1", string, o->name, mode) < 0)
1572 return -1;
2e1df07d 1573
b7e4a53c
BVA
1574 log_info("%s : Saving output of %s in %s.%s.txt\n", o->name, mode,
1575 o->name, mode);
2e1df07d
JA
1576 ret = system(str);
1577 if (ret == -1)
1578 log_err("fio: exec of cmd <%s> failed\n", str);
1579
1580 free(str);
1581 return ret;
1582}
1583
62167762
JC
1584/*
1585 * Dry run to compute correct state of numberio for verification.
1586 */
1587static uint64_t do_dry_run(struct thread_data *td)
1588{
62167762
JC
1589 td_set_runstate(td, TD_RUNNING);
1590
1591 while ((td->o.read_iolog_file && !flist_empty(&td->io_log_list)) ||
e28dd2cf 1592 (!flist_empty(&td->trim_list)) || !io_complete_bytes_exceeded(td)) {
62167762
JC
1593 struct io_u *io_u;
1594 int ret;
1595
1596 if (td->terminate || td->done)
1597 break;
1598
1599 io_u = get_io_u(td);
99955d3d 1600 if (IS_ERR_OR_NULL(io_u))
62167762
JC
1601 break;
1602
1651e431 1603 io_u_set(td, io_u, IO_U_F_FLIGHT);
62167762
JC
1604 io_u->error = 0;
1605 io_u->resid = 0;
1606 if (ddir_rw(acct_ddir(io_u)))
1607 td->io_issues[acct_ddir(io_u)]++;
1608 if (ddir_rw(io_u->ddir)) {
1609 io_u_mark_depth(td, 1);
1610 td->ts.total_io_u[io_u->ddir]++;
1611 }
1612
2e63e96b
PV
1613 if (td_write(td) && io_u->ddir == DDIR_WRITE &&
1614 td->o.do_verify &&
1615 td->o.verify != VERIFY_NONE &&
1616 !td->o.experimental_verify)
1617 log_io_piece(td, io_u);
1618
55312f9f 1619 ret = io_u_sync_complete(td, io_u);
62167762
JC
1620 (void) ret;
1621 }
1622
55312f9f 1623 return td->bytes_done[DDIR_WRITE] + td->bytes_done[DDIR_TRIM];
62167762
JC
1624}
1625
24660963
JA
1626struct fork_data {
1627 struct thread_data *td;
1628 struct sk_out *sk_out;
1629};
1630
2e1df07d
JA
1631/*
1632 * Entry point for the thread based jobs. The process based jobs end up
1633 * here as well, after a little setup.
1634 */
1635static void *thread_main(void *data)
1636{
24660963 1637 struct fork_data *fd = data;
95603b74 1638 unsigned long long elapsed_us[DDIR_RWDIR_CNT] = { 0, };
24660963 1639 struct thread_data *td = fd->td;
4896473e 1640 struct thread_options *o = &td->o;
24660963 1641 struct sk_out *sk_out = fd->sk_out;
48366f3a 1642 uint64_t bytes_done[DDIR_RWDIR_CNT];
ca0122d8 1643 int deadlock_loop_cnt;
ff3aa922 1644 bool clear_state;
83276370 1645 int ret;
2e1df07d 1646
24660963
JA
1647 sk_out_assign(sk_out);
1648 free(fd);
1649
4896473e 1650 if (!o->use_thread) {
2e1df07d
JA
1651 setsid();
1652 td->pid = getpid();
1653 } else
1654 td->pid = gettid();
1655
a0eba820 1656 fio_local_clock_init();
5d879392 1657
2e1df07d
JA
1658 dprint(FD_PROCESS, "jobs pid=%d started\n", (int) td->pid);
1659
122c7725
JA
1660 if (is_backend)
1661 fio_server_send_start(td);
1662
2e1df07d
JA
1663 INIT_FLIST_HEAD(&td->io_log_list);
1664 INIT_FLIST_HEAD(&td->io_hist_list);
1665 INIT_FLIST_HEAD(&td->verify_list);
1666 INIT_FLIST_HEAD(&td->trim_list);
2e1df07d
JA
1667 td->io_hist_tree = RB_ROOT;
1668
34febb23 1669 ret = mutex_cond_init_pshared(&td->io_u_lock, &td->free_cond);
f9e5b5ee 1670 if (ret) {
34febb23 1671 td_verror(td, ret, "mutex_cond_init_pshared");
f9e5b5ee
JK
1672 goto err;
1673 }
34febb23 1674 ret = cond_init_pshared(&td->verify_cond);
f9e5b5ee 1675 if (ret) {
34febb23 1676 td_verror(td, ret, "mutex_cond_pshared");
f9e5b5ee
JK
1677 goto err;
1678 }
2e1df07d
JA
1679
1680 td_set_runstate(td, TD_INITIALIZED);
971caeb1
BVA
1681 dprint(FD_MUTEX, "up startup_sem\n");
1682 fio_sem_up(startup_sem);
1683 dprint(FD_MUTEX, "wait on td->sem\n");
1684 fio_sem_down(td->sem);
1685 dprint(FD_MUTEX, "done waiting on td->sem\n");
2e1df07d 1686
2e1df07d
JA
1687 /*
1688 * A new gid requires privilege, so we need to do this before setting
1689 * the uid.
1690 */
4896473e 1691 if (o->gid != -1U && setgid(o->gid)) {
2e1df07d
JA
1692 td_verror(td, errno, "setgid");
1693 goto err;
1694 }
4896473e 1695 if (o->uid != -1U && setuid(o->uid)) {
2e1df07d
JA
1696 td_verror(td, errno, "setuid");
1697 goto err;
1698 }
1699
07776127
JA
1700 td_zone_gen_index(td);
1701
2354d810
JA
1702 /*
1703 * Do this early, we don't want the compress threads to be limited
1704 * to the same CPUs as the IO workers. So do this before we set
1705 * any potential CPU affinity
1706 */
1707 if (iolog_compress_init(td, sk_out))
1708 goto err;
1709
2e1df07d
JA
1710 /*
1711 * If we have a gettimeofday() thread, make sure we exclude that
1712 * thread from this job
1713 */
4896473e
JA
1714 if (o->gtod_cpu)
1715 fio_cpu_clear(&o->cpumask, o->gtod_cpu);
2e1df07d
JA
1716
1717 /*
1718 * Set affinity first, in case it has an impact on the memory
1719 * allocations.
1720 */
b2a9e649 1721 if (fio_option_is_set(o, cpumask)) {
c2acfbac 1722 if (o->cpus_allowed_policy == FIO_CPUS_SPLIT) {
30cb4c65 1723 ret = fio_cpus_split(&o->cpumask, td->thread_number - 1);
c2acfbac
JA
1724 if (!ret) {
1725 log_err("fio: no CPUs set\n");
1726 log_err("fio: Try increasing number of available CPUs\n");
1727 td_verror(td, EINVAL, "cpus_split");
1728 goto err;
1729 }
1730 }
28727df7
JA
1731 ret = fio_setaffinity(td->pid, o->cpumask);
1732 if (ret == -1) {
4896473e
JA
1733 td_verror(td, errno, "cpu_set_affinity");
1734 goto err;
1735 }
2e1df07d
JA
1736 }
1737
67bf9823 1738#ifdef CONFIG_LIBNUMA
d0b937ed 1739 /* numa node setup */
b2a9e649
JA
1740 if (fio_option_is_set(o, numa_cpunodes) ||
1741 fio_option_is_set(o, numa_memnodes)) {
43522848 1742 struct bitmask *mask;
d0b937ed
YR
1743
1744 if (numa_available() < 0) {
1745 td_verror(td, errno, "Does not support NUMA API\n");
1746 goto err;
1747 }
1748
b2a9e649 1749 if (fio_option_is_set(o, numa_cpunodes)) {
43522848
DG
1750 mask = numa_parse_nodestring(o->numa_cpunodes);
1751 ret = numa_run_on_node_mask(mask);
1752 numa_free_nodemask(mask);
d0b937ed
YR
1753 if (ret == -1) {
1754 td_verror(td, errno, \
1755 "numa_run_on_node_mask failed\n");
1756 goto err;
1757 }
1758 }
1759
b2a9e649 1760 if (fio_option_is_set(o, numa_memnodes)) {
43522848
DG
1761 mask = NULL;
1762 if (o->numa_memnodes)
1763 mask = numa_parse_nodestring(o->numa_memnodes);
1764
4896473e 1765 switch (o->numa_mem_mode) {
d0b937ed 1766 case MPOL_INTERLEAVE:
43522848 1767 numa_set_interleave_mask(mask);
d0b937ed
YR
1768 break;
1769 case MPOL_BIND:
43522848 1770 numa_set_membind(mask);
d0b937ed
YR
1771 break;
1772 case MPOL_LOCAL:
1773 numa_set_localalloc();
1774 break;
1775 case MPOL_PREFERRED:
4896473e 1776 numa_set_preferred(o->numa_mem_prefer_node);
d0b937ed
YR
1777 break;
1778 case MPOL_DEFAULT:
1779 default:
1780 break;
1781 }
1782
43522848
DG
1783 if (mask)
1784 numa_free_nodemask(mask);
1785
d0b937ed
YR
1786 }
1787 }
1788#endif
1789
9a3f1100
JA
1790 if (fio_pin_memory(td))
1791 goto err;
1792
2e1df07d
JA
1793 /*
1794 * May alter parameters that init_io_u() will use, so we need to
1795 * do this first.
1796 */
b153f94a 1797 if (!init_iolog(td))
2e1df07d
JA
1798 goto err;
1799
61b20c5c
NC
1800 /* ioprio_set() has to be done before td_io_init() */
1801 if (fio_option_is_set(o, ioprio) ||
1802 fio_option_is_set(o, ioprio_class)) {
b3048c1b
DLM
1803 ret = ioprio_set(IOPRIO_WHO_PROCESS, 0, o->ioprio_class,
1804 o->ioprio, 0);
61b20c5c
NC
1805 if (ret == -1) {
1806 td_verror(td, errno, "ioprio_set");
1807 goto err;
1808 }
b3048c1b 1809 td->ioprio = ioprio_value(o->ioprio_class, o->ioprio, 0);
2df7f081 1810 td->ts.ioprio = td->ioprio;
61b20c5c
NC
1811 }
1812
08dc3bd5
JA
1813 if (td_io_init(td))
1814 goto err;
1815
b8d07a36 1816 if (td_ioengine_flagged(td, FIO_SYNCIO) && td->o.iodepth > 1 && td->o.io_submit_mode != IO_MODE_OFFLOAD) {
349d5f6c
AD
1817 log_info("note: both iodepth >= 1 and synchronous I/O engine "
1818 "are selected, queue depth will be capped at 1\n");
1819 }
1820
2e1df07d
JA
1821 if (init_io_u(td))
1822 goto err;
1823
2041bd34
JA
1824 if (td->io_ops->post_init && td->io_ops->post_init(td))
1825 goto err;
1826
4896473e 1827 if (o->verify_async && verify_async_init(td))
2e1df07d
JA
1828 goto err;
1829
4896473e 1830 if (o->cgroup && cgroup_setup(td, cgroup_list, &cgroup_mnt))
2e1df07d
JA
1831 goto err;
1832
649c10c5 1833 errno = 0;
4896473e 1834 if (nice(o->nice) == -1 && errno != 0) {
2e1df07d
JA
1835 td_verror(td, errno, "nice");
1836 goto err;
1837 }
1838
4896473e 1839 if (o->ioscheduler && switch_ioscheduler(td))
2e1df07d
JA
1840 goto err;
1841
4896473e 1842 if (!o->create_serialize && setup_files(td))
2e1df07d
JA
1843 goto err;
1844
4d832322 1845 if (!init_random_map(td))
2e1df07d
JA
1846 goto err;
1847
0518f09f 1848 if (o->exec_prerun && exec_string(o, o->exec_prerun, "prerun"))
4896473e 1849 goto err;
2e1df07d 1850
c139f3b4
JA
1851 if (o->pre_read && !pre_read_files(td))
1852 goto err;
2e1df07d 1853
dc5bfbb2
JA
1854 fio_verify_init(td);
1855
24660963 1856 if (rate_submit_init(td, sk_out))
a9da8ab2
JA
1857 goto err;
1858
d5b3cfd4 1859 set_epoch_time(td, o->log_unix_epoch | o->log_alternate_epoch, o->log_alternate_epoch_clock_id);
44404c5a 1860 fio_getrusage(&td->ru_start);
ac28d905
JA
1861 memcpy(&td->bw_sample_time, &td->epoch, sizeof(td->epoch));
1862 memcpy(&td->iops_sample_time, &td->epoch, sizeof(td->epoch));
16e56d25 1863 memcpy(&td->ss.prev_time, &td->epoch, sizeof(td->epoch));
ac28d905 1864
f7942acd
SK
1865 init_thinktime(td);
1866
ac28d905
JA
1867 if (o->ratemin[DDIR_READ] || o->ratemin[DDIR_WRITE] ||
1868 o->ratemin[DDIR_TRIM]) {
f5204b8a 1869 memcpy(&td->last_rate_check_time[DDIR_READ], &td->bw_sample_time,
ac28d905 1870 sizeof(td->bw_sample_time));
f5204b8a 1871 memcpy(&td->last_rate_check_time[DDIR_WRITE], &td->bw_sample_time,
ac28d905 1872 sizeof(td->bw_sample_time));
f5204b8a 1873 memcpy(&td->last_rate_check_time[DDIR_TRIM], &td->bw_sample_time,
ac28d905
JA
1874 sizeof(td->bw_sample_time));
1875 }
1876
48366f3a 1877 memset(bytes_done, 0, sizeof(bytes_done));
c16035aa 1878 clear_state = false;
48366f3a 1879
2e1df07d 1880 while (keep_running(td)) {
100f49f1
JA
1881 uint64_t verify_bytes;
1882
2e1df07d 1883 fio_gettime(&td->start, NULL);
8b6a404c 1884 memcpy(&td->ts_cache, &td->start, sizeof(td->start));
2e1df07d 1885
39c1c323 1886 if (clear_state) {
ac28d905 1887 clear_io_state(td, 0);
2e1df07d 1888
39c1c323 1889 if (o->unlink_each_loop && unlink_all_files(td))
1890 break;
1891 }
1892
2e1df07d
JA
1893 prune_io_piece_log(td);
1894
dcf9844e 1895 if (td->o.verify_only && td_write(td))
62167762 1896 verify_bytes = do_dry_run(td);
095196b1 1897 else {
50eaefa5
H
1898 if (!td->o.rand_repeatable)
1899 /* save verify rand state to replay hdr seeds later at verify */
1900 frand_copy(&td->verify_state_last_do_io, &td->verify_state);
95b03be0 1901 do_io(td, bytes_done);
50eaefa5
H
1902 if (!td->o.rand_repeatable)
1903 frand_copy(&td->verify_state, &td->verify_state_last_do_io);
95b03be0 1904 if (!ddir_rw_sum(bytes_done)) {
095196b1 1905 fio_mark_td_terminate(td);
95b03be0
JA
1906 verify_bytes = 0;
1907 } else {
1908 verify_bytes = bytes_done[DDIR_WRITE] +
1909 bytes_done[DDIR_TRIM];
1910 }
095196b1 1911 }
2e1df07d 1912
49f0b8e0
JA
1913 /*
1914 * If we took too long to shut down, the main thread could
1915 * already consider us reaped/exited. If that happens, break
1916 * out and clean up.
1917 */
1918 if (td->runstate >= TD_EXITED)
1919 break;
1920
c16035aa 1921 clear_state = true;
2e1df07d 1922
40c666c8
JA
1923 /*
1924 * Make sure we've successfully updated the rusage stats
1925 * before waiting on the stat mutex. Otherwise we could have
1926 * the stat thread holding stat mutex and waiting for
1927 * the rusage_sem, which would never get upped because
1928 * this thread is waiting for the stat mutex.
1929 */
ca0122d8 1930 deadlock_loop_cnt = 0;
39d13e67
JA
1931 do {
1932 check_update_rusage(td);
971caeb1 1933 if (!fio_sem_down_trylock(stat_sem))
39d13e67
JA
1934 break;
1935 usleep(1000);
ca0122d8 1936 if (deadlock_loop_cnt++ > 5000) {
971caeb1 1937 log_err("fio seems to be stuck grabbing stat_sem, forcibly exiting\n");
43f248c4 1938 td->error = EDEADLK;
ca0122d8
TT
1939 goto err;
1940 }
39d13e67 1941 } while (1);
40c666c8 1942
615c794c
H
1943 if (td->io_bytes[DDIR_READ] && (td_read(td) ||
1944 ((td->flags & TD_F_VER_BACKLOG) && td_write(td))))
95603b74
BF
1945 update_runtime(td, elapsed_us, DDIR_READ);
1946 if (td_write(td) && td->io_bytes[DDIR_WRITE])
1947 update_runtime(td, elapsed_us, DDIR_WRITE);
1948 if (td_trim(td) && td->io_bytes[DDIR_TRIM])
1949 update_runtime(td, elapsed_us, DDIR_TRIM);
e5437a07 1950 fio_gettime(&td->start, NULL);
971caeb1 1951 fio_sem_up(stat_sem);
2e1df07d
JA
1952
1953 if (td->error || td->terminate)
1954 break;
1955
4896473e
JA
1956 if (!o->do_verify ||
1957 o->verify == VERIFY_NONE ||
9b87f09b 1958 td_ioengine_flagged(td, FIO_UNIDIR))
2e1df07d
JA
1959 continue;
1960
2d44f2c6
SK
1961 clear_io_state(td, 0);
1962
2e1df07d
JA
1963 fio_gettime(&td->start, NULL);
1964
100f49f1 1965 do_verify(td, verify_bytes);
2e1df07d 1966
40c666c8
JA
1967 /*
1968 * See comment further up for why this is done here.
1969 */
1970 check_update_rusage(td);
1971
971caeb1 1972 fio_sem_down(stat_sem);
95603b74 1973 update_runtime(td, elapsed_us, DDIR_READ);
e5437a07 1974 fio_gettime(&td->start, NULL);
971caeb1 1975 fio_sem_up(stat_sem);
2e1df07d
JA
1976
1977 if (td->error || td->terminate)
1978 break;
1979 }
1980
817ae977
VF
1981 /*
1982 * Acquire this lock if we were doing overlap checking in
1983 * offload mode so that we don't clean up this job while
1984 * another thread is checking its io_u's for overlap
1985 */
a38c70a8 1986 if (td_offload_overlap(td)) {
83276370
DP
1987 int res;
1988
1989 res = pthread_mutex_lock(&overlap_check);
1990 if (res) {
1991 td->error = errno;
1992 goto err;
1993 }
a38c70a8 1994 }
2cea0b4c 1995 td_set_runstate(td, TD_FINISHING);
a38c70a8 1996 if (td_offload_overlap(td)) {
83276370
DP
1997 int res;
1998
a38c70a8 1999 res = pthread_mutex_unlock(&overlap_check);
83276370
DP
2000 if (res) {
2001 td->error = errno;
2002 goto err;
2003 }
a38c70a8 2004 }
2cea0b4c 2005
2e1df07d 2006 update_rusage_stat(td);
2e1df07d 2007 td->ts.total_run_time = mtime_since_now(&td->epoch);
dde39f8c
AD
2008 for_each_rw_ddir(ddir) {
2009 td->ts.io_bytes[ddir] = td->io_bytes[ddir];
2010 }
2e1df07d 2011
ca09be4b 2012 if (td->o.verify_state_save && !(td->flags & TD_F_VSTATE_SAVED) &&
d264264a
JA
2013 (td->o.verify != VERIFY_NONE && td_write(td)))
2014 verify_save_state(td->thread_number);
ca09be4b 2015
9a3f1100
JA
2016 fio_unpin_memory(td);
2017
a47591e4 2018 td_writeout_logs(td, true);
2e1df07d 2019
155f2f02 2020 iolog_compress_exit(td);
103b174e 2021 rate_submit_exit(td);
aee2ab67 2022
4896473e 2023 if (o->exec_postrun)
0518f09f 2024 exec_string(o, o->exec_postrun, "postrun");
2e1df07d 2025
f9cafb12 2026 if (exitall_on_terminate || (o->exitall_error && td->error))
64402a8a 2027 fio_terminate_threads(td->groupid, td->o.exit_what);
2e1df07d
JA
2028
2029err:
2030 if (td->error)
2031 log_info("fio: pid=%d, err=%d/%s\n", (int) td->pid, td->error,
2032 td->verror);
2033
4896473e 2034 if (o->verify_async)
2e1df07d
JA
2035 verify_async_exit(td);
2036
2037 close_and_free_files(td);
2e1df07d 2038 cleanup_io_u(td);
32dbca2c 2039 close_ioengine(td);
c3dc516a 2040 cgroup_shutdown(td, cgroup_mnt);
ca09be4b 2041 verify_free_state(td);
07776127 2042 td_zone_free_index(td);
7c4d0fb7 2043
b2a9e649 2044 if (fio_option_is_set(o, cpumask)) {
8a1db9a1
JA
2045 ret = fio_cpuset_exit(&o->cpumask);
2046 if (ret)
2047 td_verror(td, ret, "fio_cpuset_exit");
2e1df07d
JA
2048 }
2049
2050 /*
2051 * do this very late, it will log file closing as well
2052 */
4896473e 2053 if (o->write_iolog_file)
2e1df07d 2054 write_iolog_close(td);
98e7161c
AK
2055 if (td->io_log_rfile)
2056 fclose(td->io_log_rfile);
2e1df07d
JA
2057
2058 td_set_runstate(td, TD_EXITED);
fda2cfac
JA
2059
2060 /*
2061 * Do this last after setting our runstate to exited, so we
2062 * know that the stat thread is signaled.
2063 */
2064 check_update_rusage(td);
2065
24660963 2066 sk_out_drop();
e43606c2 2067 return (void *) (uintptr_t) td->error;
2e1df07d
JA
2068}
2069
2e1df07d
JA
2070/*
2071 * Run over the job map and reap the threads that have exited, if any.
2072 */
90eff1c9
SW
2073static void reap_threads(unsigned int *nr_running, uint64_t *t_rate,
2074 uint64_t *m_rate)
2e1df07d 2075{
2e1df07d 2076 unsigned int cputhreads, realthreads, pending;
da8f124f 2077 int status, ret;
2e1df07d
JA
2078
2079 /*
2080 * reap exited threads (TD_EXITED -> TD_REAPED)
2081 */
2082 realthreads = pending = cputhreads = 0;
da8f124f 2083 for_each_td(td) {
2e1df07d
JA
2084 int flags = 0;
2085
74ee1904 2086 if (!strcmp(td->o.ioengine, "cpuio"))
2e1df07d
JA
2087 cputhreads++;
2088 else
2089 realthreads++;
2090
2091 if (!td->pid) {
2092 pending++;
2093 continue;
2094 }
2095 if (td->runstate == TD_REAPED)
2096 continue;
2097 if (td->o.use_thread) {
2098 if (td->runstate == TD_EXITED) {
2099 td_set_runstate(td, TD_REAPED);
2100 goto reaped;
2101 }
2102 continue;
2103 }
2104
2105 flags = WNOHANG;
2106 if (td->runstate == TD_EXITED)
2107 flags = 0;
2108
2109 /*
2110 * check if someone quit or got killed in an unusual way
2111 */
2112 ret = waitpid(td->pid, &status, flags);
2113 if (ret < 0) {
2114 if (errno == ECHILD) {
2115 log_err("fio: pid=%d disappeared %d\n",
2116 (int) td->pid, td->runstate);
a5e371a6 2117 td->sig = ECHILD;
2e1df07d
JA
2118 td_set_runstate(td, TD_REAPED);
2119 goto reaped;
2120 }
2121 perror("waitpid");
2122 } else if (ret == td->pid) {
2123 if (WIFSIGNALED(status)) {
2124 int sig = WTERMSIG(status);
2125
36d80bc7 2126 if (sig != SIGTERM && sig != SIGUSR2)
2e1df07d
JA
2127 log_err("fio: pid=%d, got signal=%d\n",
2128 (int) td->pid, sig);
a5e371a6 2129 td->sig = sig;
2e1df07d
JA
2130 td_set_runstate(td, TD_REAPED);
2131 goto reaped;
2132 }
2133 if (WIFEXITED(status)) {
2134 if (WEXITSTATUS(status) && !td->error)
2135 td->error = WEXITSTATUS(status);
2136
2137 td_set_runstate(td, TD_REAPED);
2138 goto reaped;
2139 }
2140 }
2141
cba5460c
JA
2142 /*
2143 * If the job is stuck, do a forceful timeout of it and
2144 * move on.
2145 */
2146 if (td->terminate &&
2c45a4ac 2147 td->runstate < TD_FSYNCING &&
cba5460c 2148 time_since_now(&td->terminate_time) >= FIO_REAP_TIMEOUT) {
86310a1f
TK
2149 log_err("fio: job '%s' (state=%d) hasn't exited in "
2150 "%lu seconds, it appears to be stuck. Doing "
2151 "forceful exit of this job.\n",
2152 td->o.name, td->runstate,
2153 (unsigned long) time_since_now(&td->terminate_time));
cba5460c
JA
2154 td_set_runstate(td, TD_REAPED);
2155 goto reaped;
2156 }
2157
2e1df07d
JA
2158 /*
2159 * thread is not dead, continue
2160 */
2161 pending++;
2162 continue;
2163reaped:
2164 (*nr_running)--;
342f4be4
JA
2165 (*m_rate) -= ddir_rw_sum(td->o.ratemin);
2166 (*t_rate) -= ddir_rw_sum(td->o.rate);
2e1df07d
JA
2167 if (!td->pid)
2168 pending--;
2169
2170 if (td->error)
2171 exit_value++;
2172
2173 done_secs += mtime_since_now(&td->epoch) / 1000;
4a88752a 2174 profile_td_exit(td);
42e26e94 2175 flow_exit_job(td);
da8f124f 2176 } end_for_each();
2e1df07d
JA
2177
2178 if (*nr_running == cputhreads && !pending && realthreads)
64402a8a 2179 fio_terminate_threads(TERMINATE_ALL, TERMINATE_ALL);
2e1df07d
JA
2180}
2181
e39c0676 2182static bool __check_trigger_file(void)
ca09be4b
JA
2183{
2184 struct stat sb;
2185
2186 if (!trigger_file)
e39c0676 2187 return false;
ca09be4b
JA
2188
2189 if (stat(trigger_file, &sb))
e39c0676 2190 return false;
ca09be4b
JA
2191
2192 if (unlink(trigger_file) < 0)
2193 log_err("fio: failed to unlink %s: %s\n", trigger_file,
2194 strerror(errno));
2195
e39c0676 2196 return true;
ca09be4b
JA
2197}
2198
e39c0676 2199static bool trigger_timedout(void)
ca09be4b
JA
2200{
2201 if (trigger_timeout)
98413be7
SW
2202 if (time_since_genesis() >= trigger_timeout) {
2203 trigger_timeout = 0;
2204 return true;
2205 }
ca09be4b 2206
e39c0676 2207 return false;
ca09be4b
JA
2208}
2209
2210void exec_trigger(const char *cmd)
2211{
2212 int ret;
2213
98413be7 2214 if (!cmd || cmd[0] == '\0')
ca09be4b
JA
2215 return;
2216
2217 ret = system(cmd);
2218 if (ret == -1)
2219 log_err("fio: failed executing %s trigger\n", cmd);
2220}
2221
2222void check_trigger_file(void)
2223{
2224 if (__check_trigger_file() || trigger_timedout()) {
796fb3ce
JA
2225 if (nr_clients)
2226 fio_clients_send_trigger(trigger_remote_cmd);
2227 else {
d264264a 2228 verify_save_state(IO_LIST_ALL);
64402a8a 2229 fio_terminate_threads(TERMINATE_ALL, TERMINATE_ALL);
ca09be4b
JA
2230 exec_trigger(trigger_cmd);
2231 }
2232 }
2233}
2234
2235static int fio_verify_load_state(struct thread_data *td)
2236{
2237 int ret;
2238
2239 if (!td->o.verify_state)
2240 return 0;
2241
2242 if (is_backend) {
2243 void *data;
2244
2245 ret = fio_server_get_verify_state(td->o.name,
94a6e1bb 2246 td->thread_number - 1, &data);
ca09be4b 2247 if (!ret)
94a6e1bb 2248 verify_assign_state(td, data);
67710881
AK
2249 } else {
2250 char prefix[PATH_MAX];
2251
2252 if (aux_path)
2253 sprintf(prefix, "%s%clocal", aux_path,
2254 FIO_OS_PATH_SEPARATOR);
2255 else
2256 strcpy(prefix, "local");
2257 ret = verify_load_state(td, prefix);
2258 }
ca09be4b
JA
2259
2260 return ret;
2261}
2262
06464907
JA
2263static void do_usleep(unsigned int usecs)
2264{
2265 check_for_running_stats();
ca09be4b 2266 check_trigger_file();
06464907
JA
2267 usleep(usecs);
2268}
2269
e39c0676 2270static bool check_mount_writes(struct thread_data *td)
e81ecca3
JA
2271{
2272 struct fio_file *f;
2273 unsigned int i;
2274
2275 if (!td_write(td) || td->o.allow_mounted_write)
e39c0676 2276 return false;
e81ecca3 2277
5e81f9c1
TK
2278 /*
2279 * If FIO_HAVE_CHARDEV_SIZE is defined, it's likely that chrdevs
2280 * are mkfs'd and mounted.
2281 */
e81ecca3 2282 for_each_file(td, f, i) {
5e81f9c1
TK
2283#ifdef FIO_HAVE_CHARDEV_SIZE
2284 if (f->filetype != FIO_TYPE_BLOCK && f->filetype != FIO_TYPE_CHAR)
2285#else
686fbd31 2286 if (f->filetype != FIO_TYPE_BLOCK)
5e81f9c1 2287#endif
e81ecca3
JA
2288 continue;
2289 if (device_is_mounted(f->file_name))
2290 goto mounted;
2291 }
2292
e39c0676 2293 return false;
e81ecca3 2294mounted:
c5839011 2295 log_err("fio: %s appears mounted, and 'allow_mounted_write' isn't set. Aborting.\n", f->file_name);
e39c0676 2296 return true;
e81ecca3
JA
2297}
2298
9cc8cb91
AK
2299static bool waitee_running(struct thread_data *me)
2300{
2301 const char *waitee = me->o.wait_for;
2302 const char *self = me->o.name;
9cc8cb91
AK
2303
2304 if (!waitee)
2305 return false;
2306
da8f124f 2307 for_each_td(td) {
9cc8cb91
AK
2308 if (!strcmp(td->o.name, self) || strcmp(td->o.name, waitee))
2309 continue;
2310
2311 if (td->runstate < TD_EXITED) {
2312 dprint(FD_PROCESS, "%s fenced by %s(%s)\n",
2313 self, td->o.name,
2314 runstate_to_name(td->runstate));
2315 return true;
2316 }
da8f124f 2317 } end_for_each();
9cc8cb91
AK
2318
2319 dprint(FD_PROCESS, "%s: %s completed, can run\n", self, waitee);
2320 return false;
2321}
2322
2e1df07d
JA
2323/*
2324 * Main function for kicking off and reaping jobs, as needed.
2325 */
24660963 2326static void run_threads(struct sk_out *sk_out)
2e1df07d
JA
2327{
2328 struct thread_data *td;
90eff1c9
SW
2329 unsigned int i, todo, nr_running, nr_started;
2330 uint64_t m_rate, t_rate;
0de5b26f 2331 uint64_t spent;
2e1df07d 2332
2e1df07d
JA
2333 if (fio_gtod_offload && fio_start_gtod_thread())
2334 return;
334185e9 2335
f2a2ce0e 2336 fio_idle_prof_init();
2e1df07d
JA
2337
2338 set_sig_handlers();
2339
3a5f6bde 2340 nr_thread = nr_process = 0;
da8f124f 2341 for_each_td(td) {
e81ecca3
JA
2342 if (check_mount_writes(td))
2343 return;
3a5f6bde
JA
2344 if (td->o.use_thread)
2345 nr_thread++;
2346 else
2347 nr_process++;
da8f124f 2348 } end_for_each();
3a5f6bde 2349
01cfefcc 2350 if (output_format & FIO_OUTPUT_NORMAL) {
a41fc529
JA
2351 struct buf_output out;
2352
2353 buf_output_init(&out);
c2fcb6bc 2354 __log_buf(&out, "Starting ");
2e1df07d 2355 if (nr_thread)
c2fcb6bc 2356 __log_buf(&out, "%d thread%s", nr_thread,
2e1df07d
JA
2357 nr_thread > 1 ? "s" : "");
2358 if (nr_process) {
2359 if (nr_thread)
c2fcb6bc
JA
2360 __log_buf(&out, " and ");
2361 __log_buf(&out, "%d process%s", nr_process,
2e1df07d
JA
2362 nr_process > 1 ? "es" : "");
2363 }
c2fcb6bc 2364 __log_buf(&out, "\n");
a41fc529 2365 log_info_buf(out.buf, out.buflen);
d5bb0a89 2366 buf_output_free(&out);
2e1df07d
JA
2367 }
2368
2369 todo = thread_number;
2370 nr_running = 0;
2371 nr_started = 0;
2372 m_rate = t_rate = 0;
2373
da8f124f 2374 for_each_td(td) {
2e1df07d
JA
2375 print_status_init(td->thread_number - 1);
2376
d5e3f7cb 2377 if (!td->o.create_serialize)
2e1df07d
JA
2378 continue;
2379
ca09be4b
JA
2380 if (fio_verify_load_state(td))
2381 goto reap;
2382
2e1df07d
JA
2383 /*
2384 * do file setup here so it happens sequentially,
2385 * we don't want X number of threads getting their
2386 * client data interspersed on disk
2387 */
2388 if (setup_files(td)) {
ca09be4b 2389reap:
2e1df07d
JA
2390 exit_value++;
2391 if (td->error)
2392 log_err("fio: pid=%d, err=%d/%s\n",
2393 (int) td->pid, td->error, td->verror);
2394 td_set_runstate(td, TD_REAPED);
2395 todo--;
2396 } else {
2397 struct fio_file *f;
2398 unsigned int j;
2399
2400 /*
2401 * for sharing to work, each job must always open
2402 * its own files. so close them, if we opened them
2403 * for creation
2404 */
2405 for_each_file(td, f, j) {
2406 if (fio_file_open(f))
2407 td_io_close_file(td, f);
2408 }
2409 }
da8f124f 2410 } end_for_each();
2e1df07d 2411
f2a2ce0e
HL
2412 /* start idle threads before io threads start to run */
2413 fio_idle_prof_start();
2414
2e1df07d
JA
2415 set_genesis_time();
2416
2417 while (todo) {
2418 struct thread_data *map[REAL_MAX_JOBS];
8b6a404c 2419 struct timespec this_start;
2e1df07d 2420 int this_jobs = 0, left;
ce8b6139 2421 struct fork_data *fd;
2e1df07d
JA
2422
2423 /*
2424 * create threads (TD_NOT_CREATED -> TD_CREATED)
2425 */
da8f124f 2426 for_each_td(td) {
2e1df07d
JA
2427 if (td->runstate != TD_NOT_CREATED)
2428 continue;
2429
2430 /*
2431 * never got a chance to start, killed by other
2432 * thread for some reason
2433 */
2434 if (td->terminate) {
2435 todo--;
2436 continue;
2437 }
2438
2439 if (td->o.start_delay) {
0de5b26f 2440 spent = utime_since_genesis();
2e1df07d 2441
74454ce4 2442 if (td->o.start_delay > spent)
2e1df07d
JA
2443 continue;
2444 }
2445
2446 if (td->o.stonewall && (nr_started || nr_running)) {
2447 dprint(FD_PROCESS, "%s: stonewall wait\n",
2448 td->o.name);
2449 break;
2450 }
2451
9cc8cb91
AK
2452 if (waitee_running(td)) {
2453 dprint(FD_PROCESS, "%s: waiting for %s\n",
2454 td->o.name, td->o.wait_for);
5c74fc76 2455 continue;
9cc8cb91
AK
2456 }
2457
2e1df07d
JA
2458 init_disk_util(td);
2459
971caeb1 2460 td->rusage_sem = fio_sem_init(FIO_SEM_LOCKED);
c97f1ad6
JA
2461 td->update_rusage = 0;
2462
2e1df07d
JA
2463 /*
2464 * Set state to created. Thread will transition
2465 * to TD_INITIALIZED when it's done setting up.
2466 */
2467 td_set_runstate(td, TD_CREATED);
2468 map[this_jobs++] = td;
2469 nr_started++;
2470
ce8b6139
JA
2471 fd = calloc(1, sizeof(*fd));
2472 fd->td = td;
2473 fd->sk_out = sk_out;
2474
2e1df07d
JA
2475 if (td->o.use_thread) {
2476 int ret;
2477
2478 dprint(FD_PROCESS, "will pthread_create\n");
2479 ret = pthread_create(&td->thread, NULL,
24660963 2480 thread_main, fd);
2e1df07d
JA
2481 if (ret) {
2482 log_err("pthread_create: %s\n",
2483 strerror(ret));
24660963 2484 free(fd);
2e1df07d
JA
2485 nr_started--;
2486 break;
2487 }
493dd6c1 2488 fd = NULL;
2e1df07d
JA
2489 ret = pthread_detach(td->thread);
2490 if (ret)
2491 log_err("pthread_detach: %s",
2492 strerror(ret));
2493 } else {
2494 pid_t pid;
6203763e 2495 void *eo;
2e1df07d 2496 dprint(FD_PROCESS, "will fork\n");
6203763e 2497 eo = td->eo;
807473c3 2498 read_barrier();
2e1df07d
JA
2499 pid = fork();
2500 if (!pid) {
ce8b6139 2501 int ret;
2e1df07d 2502
ce8b6139 2503 ret = (int)(uintptr_t)thread_main(fd);
2e1df07d 2504 _exit(ret);
da8f124f 2505 } else if (__td_index == fio_debug_jobno)
2e1df07d 2506 *fio_debug_jobp = pid;
6203763e 2507 free(eo);
36aac34e
DP
2508 free(fd);
2509 fd = NULL;
2e1df07d 2510 }
971caeb1
BVA
2511 dprint(FD_MUTEX, "wait on startup_sem\n");
2512 if (fio_sem_down_timeout(startup_sem, 10000)) {
2e1df07d 2513 log_err("fio: job startup hung? exiting.\n");
64402a8a 2514 fio_terminate_threads(TERMINATE_ALL, TERMINATE_ALL);
f1867a7f 2515 fio_abort = true;
2e1df07d 2516 nr_started--;
6541f4e0 2517 free(fd);
2e1df07d
JA
2518 break;
2519 }
971caeb1 2520 dprint(FD_MUTEX, "done waiting on startup_sem\n");
da8f124f 2521 } end_for_each();
2e1df07d
JA
2522
2523 /*
2524 * Wait for the started threads to transition to
2525 * TD_INITIALIZED.
2526 */
2527 fio_gettime(&this_start, NULL);
2528 left = this_jobs;
2529 while (left && !fio_abort) {
2530 if (mtime_since_now(&this_start) > JOB_START_TIMEOUT)
2531 break;
2532
06464907 2533 do_usleep(100000);
2e1df07d
JA
2534
2535 for (i = 0; i < this_jobs; i++) {
2536 td = map[i];
2537 if (!td)
2538 continue;
2539 if (td->runstate == TD_INITIALIZED) {
2540 map[i] = NULL;
2541 left--;
2542 } else if (td->runstate >= TD_EXITED) {
2543 map[i] = NULL;
2544 left--;
2545 todo--;
2546 nr_running++; /* work-around... */
2547 }
2548 }
2549 }
2550
2551 if (left) {
4e87c37a
JA
2552 log_err("fio: %d job%s failed to start\n", left,
2553 left > 1 ? "s" : "");
2e1df07d
JA
2554 for (i = 0; i < this_jobs; i++) {
2555 td = map[i];
2556 if (!td)
2557 continue;
2558 kill(td->pid, SIGTERM);
2559 }
2560 break;
2561 }
2562
2563 /*
2564 * start created threads (TD_INITIALIZED -> TD_RUNNING).
2565 */
da8f124f 2566 for_each_td(td) {
2e1df07d
JA
2567 if (td->runstate != TD_INITIALIZED)
2568 continue;
2569
2570 if (in_ramp_time(td))
2571 td_set_runstate(td, TD_RAMP);
2572 else
2573 td_set_runstate(td, TD_RUNNING);
2574 nr_running++;
2575 nr_started--;
342f4be4
JA
2576 m_rate += ddir_rw_sum(td->o.ratemin);
2577 t_rate += ddir_rw_sum(td->o.rate);
2e1df07d 2578 todo--;
971caeb1 2579 fio_sem_up(td->sem);
da8f124f 2580 } end_for_each();
2e1df07d
JA
2581
2582 reap_threads(&nr_running, &t_rate, &m_rate);
2583
122c7725 2584 if (todo)
06464907 2585 do_usleep(100000);
2e1df07d
JA
2586 }
2587
2588 while (nr_running) {
2589 reap_threads(&nr_running, &t_rate, &m_rate);
06464907 2590 do_usleep(10000);
2e1df07d
JA
2591 }
2592
f2a2ce0e
HL
2593 fio_idle_prof_stop();
2594
2e1df07d 2595 update_io_ticks();
2e1df07d
JA
2596}
2597
27357187
JA
2598static void free_disk_util(void)
2599{
27357187 2600 disk_util_prune_entries();
a39fb9ea 2601 helper_thread_destroy();
2e1df07d
JA
2602}
2603
24660963 2604int fio_backend(struct sk_out *sk_out)
2e1df07d 2605{
2e1df07d 2606 int i;
2e1df07d
JA
2607 if (exec_profile) {
2608 if (load_profile(exec_profile))
2609 return 1;
2610 free(exec_profile);
2611 exec_profile = NULL;
2612 }
2613 if (!thread_number)
2614 return 0;
2615
2616 if (write_bw_log) {
aee2ab67
JA
2617 struct log_params p = {
2618 .log_type = IO_LOG_TYPE_BW,
2619 };
2620
2621 setup_log(&agg_io_log[DDIR_READ], &p, "agg-read_bw.log");
2622 setup_log(&agg_io_log[DDIR_WRITE], &p, "agg-write_bw.log");
2623 setup_log(&agg_io_log[DDIR_TRIM], &p, "agg-trim_bw.log");
2e1df07d
JA
2624 }
2625
c49cfc76
BD
2626 if (init_global_dedupe_working_set_seeds()) {
2627 log_err("fio: failed to initialize global dedupe working set\n");
2628 return 1;
2629 }
2630
971caeb1 2631 startup_sem = fio_sem_init(FIO_SEM_LOCKED);
24a97130
LC
2632 if (!sk_out)
2633 is_local_backend = true;
971caeb1 2634 if (startup_sem == NULL)
2e1df07d 2635 return 1;
2e1df07d
JA
2636
2637 set_genesis_time();
cef9175e 2638 stat_init();
998e9ebb
BVA
2639 if (helper_thread_create(startup_sem, sk_out))
2640 log_err("fio: failed to create helper thread\n");
2e1df07d
JA
2641
2642 cgroup_list = smalloc(sizeof(*cgroup_list));
b2e6494c
JA
2643 if (cgroup_list)
2644 INIT_FLIST_HEAD(cgroup_list);
2e1df07d 2645
24660963 2646 run_threads(sk_out);
2e1df07d 2647
a39fb9ea 2648 helper_thread_exit();
8aab824f 2649
2e1df07d 2650 if (!fio_abort) {
83f7b64e 2651 __show_run_stats();
2e1df07d 2652 if (write_bw_log) {
cb7e0ace
JA
2653 for (i = 0; i < DDIR_RWDIR_CNT; i++) {
2654 struct io_log *log = agg_io_log[i];
2655
60a25727 2656 flush_log(log, false);
518dac09 2657 free_log(log);
cb7e0ace 2658 }
2e1df07d
JA
2659 }
2660 }
2661
da8f124f 2662 for_each_td(td) {
f0547200
NC
2663 struct thread_stat *ts = &td->ts;
2664
2665 free_clat_prio_stats(ts);
c27cc65f 2666 steadystate_free(td);
2e1df07d 2667 fio_options_free(td);
8009f543 2668 fio_dump_options_free(td);
8049adc1 2669 if (td->rusage_sem) {
971caeb1 2670 fio_sem_remove(td->rusage_sem);
8049adc1
JA
2671 td->rusage_sem = NULL;
2672 }
971caeb1
BVA
2673 fio_sem_remove(td->sem);
2674 td->sem = NULL;
da8f124f 2675 } end_for_each();
2e1df07d 2676
a462baef 2677 free_disk_util();
b2e6494c
JA
2678 if (cgroup_list) {
2679 cgroup_kill(cgroup_list);
2680 sfree(cgroup_list);
2681 }
2e1df07d 2682
971caeb1 2683 fio_sem_remove(startup_sem);
cef9175e 2684 stat_exit();
2e1df07d
JA
2685 return exit_value;
2686}