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