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