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