2 * fio - the flexible io tester
4 * Copyright (C) 2005 Jens Axboe <axboe@suse.de>
5 * Copyright (C) 2006-2012 Jens Axboe <axboe@kernel.dk>
7 * The license below covers all files distributed with fio unless otherwise
8 * noted in the file itself.
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.
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.
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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
41 #ifndef FIO_NO_HAVE_SHM_H
52 #include "lib/memalign.h"
54 #include "lib/getrusage.h"
57 #include "workqueue.h"
58 #include "lib/mountcheck.h"
59 #include "rate-submit.h"
60 #include "helper_thread.h"
62 static struct fio_mutex *startup_mutex;
63 static struct flist_head *cgroup_list;
64 static char *cgroup_mnt;
65 static int exit_value;
66 static volatile int fio_abort;
67 static unsigned int nr_process = 0;
68 static unsigned int nr_thread = 0;
70 struct io_log *agg_io_log[DDIR_RWDIR_CNT];
73 unsigned int thread_number = 0;
74 unsigned int stat_number = 0;
77 unsigned long done_secs = 0;
79 #define JOB_START_TIMEOUT (5 * 1000)
81 static void sig_int(int sig)
85 fio_server_got_signal(sig);
87 log_info("\nfio: terminating on signal %d\n", sig);
92 fio_terminate_threads(TERMINATE_ALL);
96 void sig_show_status(int sig)
98 show_running_run_stats();
101 static void set_sig_handlers(void)
103 struct sigaction act;
105 memset(&act, 0, sizeof(act));
106 act.sa_handler = sig_int;
107 act.sa_flags = SA_RESTART;
108 sigaction(SIGINT, &act, NULL);
110 memset(&act, 0, sizeof(act));
111 act.sa_handler = sig_int;
112 act.sa_flags = SA_RESTART;
113 sigaction(SIGTERM, &act, NULL);
115 /* Windows uses SIGBREAK as a quit signal from other applications */
117 memset(&act, 0, sizeof(act));
118 act.sa_handler = sig_int;
119 act.sa_flags = SA_RESTART;
120 sigaction(SIGBREAK, &act, NULL);
123 memset(&act, 0, sizeof(act));
124 act.sa_handler = sig_show_status;
125 act.sa_flags = SA_RESTART;
126 sigaction(SIGUSR1, &act, NULL);
129 memset(&act, 0, sizeof(act));
130 act.sa_handler = sig_int;
131 act.sa_flags = SA_RESTART;
132 sigaction(SIGPIPE, &act, NULL);
137 * Check if we are above the minimum rate given.
139 static bool __check_min_rate(struct thread_data *td, struct timespec *now,
142 unsigned long long bytes = 0;
143 unsigned long iops = 0;
146 unsigned int ratemin = 0;
147 unsigned int rate_iops = 0;
148 unsigned int rate_iops_min = 0;
150 assert(ddir_rw(ddir));
152 if (!td->o.ratemin[ddir] && !td->o.rate_iops_min[ddir])
156 * allow a 2 second settle period in the beginning
158 if (mtime_since(&td->start, now) < 2000)
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];
168 * if rate blocks is set, sample is running
170 if (td->rate_bytes[ddir] || td->rate_blocks[ddir]) {
171 spent = mtime_since(&td->lastrate[ddir], now);
172 if (spent < td->o.ratecycle)
175 if (td->o.rate[ddir] || td->o.ratemin[ddir]) {
177 * check bandwidth specified rate
179 if (bytes < td->rate_bytes[ddir]) {
180 log_err("%s: rate_min=%uB/s not met, only transferred %lluB\n",
181 td->o.name, ratemin, bytes);
185 rate = ((bytes - td->rate_bytes[ddir]) * 1000) / spent;
189 if (rate < ratemin ||
190 bytes < td->rate_bytes[ddir]) {
191 log_err("%s: rate_min=%uB/s not met, got %luB/s\n",
192 td->o.name, ratemin, rate);
198 * checks iops specified rate
200 if (iops < rate_iops) {
201 log_err("%s: rate_iops_min=%u not met, only performed %lu IOs\n",
202 td->o.name, rate_iops, iops);
206 rate = ((iops - td->rate_blocks[ddir]) * 1000) / spent;
210 if (rate < rate_iops_min ||
211 iops < td->rate_blocks[ddir]) {
212 log_err("%s: rate_iops_min=%u not met, got %lu IOPS\n",
213 td->o.name, rate_iops_min, rate);
220 td->rate_bytes[ddir] = bytes;
221 td->rate_blocks[ddir] = iops;
222 memcpy(&td->lastrate[ddir], now, sizeof(*now));
226 static bool check_min_rate(struct thread_data *td, struct timespec *now)
230 if (td->bytes_done[DDIR_READ])
231 ret |= __check_min_rate(td, now, DDIR_READ);
232 if (td->bytes_done[DDIR_WRITE])
233 ret |= __check_min_rate(td, now, DDIR_WRITE);
234 if (td->bytes_done[DDIR_TRIM])
235 ret |= __check_min_rate(td, now, DDIR_TRIM);
241 * When job exits, we can cancel the in-flight IO if we are using async
242 * io. Attempt to do so.
244 static void cleanup_pending_aio(struct thread_data *td)
249 * get immediately available events, if any
251 r = io_u_queued_complete(td, 0);
256 * now cancel remaining active events
258 if (td->io_ops->cancel) {
262 io_u_qiter(&td->io_u_all, io_u, i) {
263 if (io_u->flags & IO_U_F_FLIGHT) {
264 r = td->io_ops->cancel(td, io_u);
272 r = io_u_queued_complete(td, td->cur_depth);
276 * Helper to handle the final sync of a file. Works just like the normal
277 * io path, just does everything sync.
279 static bool fio_io_sync(struct thread_data *td, struct fio_file *f)
281 struct io_u *io_u = __get_io_u(td);
287 io_u->ddir = DDIR_SYNC;
290 if (td_io_prep(td, io_u)) {
296 ret = td_io_queue(td, io_u);
298 td_verror(td, io_u->error, "td_io_queue");
301 } else if (ret == FIO_Q_QUEUED) {
302 if (td_io_commit(td))
304 if (io_u_queued_complete(td, 1) < 0)
306 } else if (ret == FIO_Q_COMPLETED) {
308 td_verror(td, io_u->error, "td_io_queue");
312 if (io_u_sync_complete(td, io_u) < 0)
314 } else if (ret == FIO_Q_BUSY) {
315 if (td_io_commit(td))
323 static int fio_file_fsync(struct thread_data *td, struct fio_file *f)
327 if (fio_file_open(f))
328 return fio_io_sync(td, f);
330 if (td_io_open_file(td, f))
333 ret = fio_io_sync(td, f);
334 td_io_close_file(td, f);
338 static inline void __update_ts_cache(struct thread_data *td)
340 fio_gettime(&td->ts_cache, NULL);
343 static inline void update_ts_cache(struct thread_data *td)
345 if ((++td->ts_cache_nr & td->ts_cache_mask) == td->ts_cache_mask)
346 __update_ts_cache(td);
349 static inline bool runtime_exceeded(struct thread_data *td, struct timespec *t)
351 if (in_ramp_time(td))
355 if (utime_since(&td->epoch, t) >= td->o.timeout)
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
366 static inline void update_runtime(struct thread_data *td,
367 unsigned long long *elapsed_us,
368 const enum fio_ddir ddir)
370 if (ddir == DDIR_WRITE && td_write(td) && td->o.verify_only)
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;
378 static bool break_on_this_error(struct thread_data *td, enum fio_ddir ddir,
383 if (ret < 0 || td->error) {
385 enum error_type_bit eb;
390 eb = td_error_type(ddir, err);
391 if (!(td->o.continue_on_error & (1 << eb)))
394 if (td_non_fatal_error(td, eb, err)) {
396 * Continue with the I/Os in case of
399 update_error_count(td, err);
403 } else if (td->o.fill_device && err == ENOSPC) {
405 * We expect to hit this error if
406 * fill_device option is set.
409 fio_mark_td_terminate(td);
413 * Stop the I/O in case of a fatal
416 update_error_count(td, err);
424 static void check_update_rusage(struct thread_data *td)
426 if (td->update_rusage) {
427 td->update_rusage = 0;
428 update_rusage_stat(td);
429 fio_mutex_up(td->rusage_sem);
433 static int wait_for_completions(struct thread_data *td, struct timespec *time)
435 const int full = queue_full(td);
439 if (td->flags & TD_F_REGROW_LOGS)
440 return io_u_quiesce(td);
443 * if the queue is full, we MUST reap at least 1 event
445 min_evts = min(td->o.iodepth_batch_complete_min, td->cur_depth);
446 if ((full && !min_evts) || !td->o.iodepth_batch_complete_min)
449 if (time && (__should_check_rate(td, DDIR_READ) ||
450 __should_check_rate(td, DDIR_WRITE) ||
451 __should_check_rate(td, DDIR_TRIM)))
452 fio_gettime(time, NULL);
455 ret = io_u_queued_complete(td, min_evts);
458 } while (full && (td->cur_depth > td->o.iodepth_low));
463 int 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,
465 struct timespec *comp_time)
470 case FIO_Q_COMPLETED:
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;
479 *bytes_issued += bytes;
482 trim_io_piece(td, io_u);
489 unlog_io_piece(td, io_u);
490 td_verror(td, EIO, "full resid");
495 io_u->xfer_buflen = io_u->resid;
496 io_u->xfer_buf += bytes;
497 io_u->offset += bytes;
499 if (ddir_rw(io_u->ddir))
500 td->ts.short_io_u[io_u->ddir]++;
502 if (io_u->offset == f->real_file_size)
505 requeue_io_u(td, &io_u);
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);
513 *ret = io_u_sync_complete(td, io_u);
518 if (td->flags & TD_F_REGROW_LOGS)
522 * when doing I/O (not when verifying),
523 * check for any errors that are to be ignored
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.
535 if (td->io_ops->commit == NULL)
536 io_u_queued(td, io_u);
538 *bytes_issued += io_u->xfer_buflen;
542 unlog_io_piece(td, io_u);
543 requeue_io_u(td, &io_u);
544 ret2 = td_io_commit(td);
550 td_verror(td, -(*ret), "td_io_queue");
554 if (break_on_this_error(td, ddir, ret))
560 static inline bool io_in_polling(struct thread_data *td)
562 return !td->o.iodepth_batch_complete_min &&
563 !td->o.iodepth_batch_complete_max;
566 * Unlinks files from thread data fio_file structure
568 static int unlink_all_files(struct thread_data *td)
574 for_each_file(td, f, i) {
575 if (f->filetype != FIO_TYPE_FILE)
577 ret = td_io_unlink_file(td, f);
583 td_verror(td, ret, "unlink_all_files");
589 * Check if io_u will overlap an in-flight IO in the queue
591 static bool in_flight_overlap(struct io_u_queue *q, struct io_u *io_u)
594 struct io_u *check_io_u;
595 unsigned long long x1, x2, y1, y2;
599 x2 = io_u->offset + io_u->buflen;
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;
606 if (x1 < y2 && y1 < x2) {
608 dprint(FD_IO, "in-flight overlap: %llu/%lu, %llu/%lu\n",
610 y1, check_io_u->buflen);
619 static int io_u_submit(struct thread_data *td, struct io_u *io_u)
622 * Check for overlap if the user asked us to, and we have
623 * at least one IO in flight besides this one.
625 if (td->o.serialize_overlap && td->cur_depth > 1 &&
626 in_flight_overlap(&td->io_u_all, io_u))
629 return td_io_queue(td, io_u);
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.
636 static void do_verify(struct thread_data *td, uint64_t verify_bytes)
643 dprint(FD_VERIFY, "starting loop\n");
646 * sync io first and invalidate cache, to make sure we really
649 for_each_file(td, f, i) {
650 if (!fio_file_open(f))
652 if (fio_io_sync(td, f))
654 if (file_invalidate_cache(td, f))
658 check_update_rusage(td);
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.
669 if (!td->o.rand_repeatable)
670 td_fill_verify_state_seed(td);
672 td_set_runstate(td, TD_VERIFYING);
675 while (!td->terminate) {
680 check_update_rusage(td);
682 if (runtime_exceeded(td, &td->ts_cache)) {
683 __update_ts_cache(td);
684 if (runtime_exceeded(td, &td->ts_cache)) {
685 fio_mark_td_terminate(td);
690 if (flow_threshold_exceeded(td))
693 if (!td->o.experimental_verify) {
694 io_u = __get_io_u(td);
698 if (get_next_verify(td, io_u)) {
703 if (td_io_prep(td, io_u)) {
708 if (ddir_rw_sum(td->bytes_done) + td->o.rw_min_bs > verify_bytes)
711 while ((io_u = get_io_u(td)) != NULL) {
712 if (IS_ERR_OR_NULL(io_u)) {
719 * We are only interested in the places where
720 * we wrote or trimmed IOs. Turn those into
721 * reads for verification purposes.
723 if (io_u->ddir == DDIR_READ) {
725 * Pretend we issued it for rwmix
728 td->io_issues[DDIR_READ]++;
731 } else if (io_u->ddir == DDIR_TRIM) {
732 io_u->ddir = DDIR_READ;
733 io_u_set(td, io_u, IO_U_F_TRIMMED);
735 } else if (io_u->ddir == DDIR_WRITE) {
736 io_u->ddir = DDIR_READ;
748 if (verify_state_should_stop(td, io_u)) {
753 if (td->o.verify_async)
754 io_u->end_io = verify_io_u_async;
756 io_u->end_io = verify_io_u;
759 if (!td->o.disable_slat)
760 fio_gettime(&io_u->start_time, NULL);
762 ret = io_u_submit(td, io_u);
764 if (io_queue_event(td, io_u, &ret, ddir, NULL, 1, NULL))
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.
773 full = queue_full(td) || (ret == FIO_Q_BUSY && td->cur_depth);
774 if (full || io_in_polling(td))
775 ret = wait_for_completions(td, NULL);
781 check_update_rusage(td);
784 min_events = td->cur_depth;
787 ret = io_u_queued_complete(td, min_events);
789 cleanup_pending_aio(td);
791 td_set_runstate(td, TD_RUNNING);
793 dprint(FD_VERIFY, "exiting loop\n");
796 static bool exceeds_number_ios(struct thread_data *td)
798 unsigned long long number_ios;
800 if (!td->o.number_ios)
803 number_ios = ddir_rw_sum(td->io_blocks);
804 number_ios += td->io_u_queued + td->io_u_in_flight;
806 return number_ios >= (td->o.number_ios * td->loops);
809 static bool io_bytes_exceeded(struct thread_data *td, uint64_t *this_bytes)
811 unsigned long long bytes, limit;
814 bytes = this_bytes[DDIR_READ] + this_bytes[DDIR_WRITE];
815 else if (td_write(td))
816 bytes = this_bytes[DDIR_WRITE];
817 else if (td_read(td))
818 bytes = this_bytes[DDIR_READ];
820 bytes = this_bytes[DDIR_TRIM];
823 limit = td->o.io_size;
828 return bytes >= limit || exceeds_number_ios(td);
831 static bool io_issue_bytes_exceeded(struct thread_data *td)
833 return io_bytes_exceeded(td, td->io_issue_bytes);
836 static bool io_complete_bytes_exceeded(struct thread_data *td)
838 return io_bytes_exceeded(td, td->this_io_bytes);
842 * used to calculate the next io time for rate control
845 static long long usec_for_io(struct thread_data *td, enum fio_ddir ddir)
847 uint64_t bps = td->rate_bps[ddir];
849 assert(!(td->flags & TD_F_CHILD));
851 if (td->o.rate_process == RATE_PROCESS_POISSON) {
854 iops = bps / td->o.bs[ddir];
855 val = (int64_t) (1000000 / iops) *
856 -logf(__rand_0_1(&td->poisson_state[ddir]));
858 dprint(FD_RATE, "poisson rate iops=%llu, ddir=%d\n",
859 (unsigned long long) 1000000 / val,
862 td->last_usec[ddir] += val;
863 return td->last_usec[ddir];
865 uint64_t bytes = td->rate_io_issue_bytes[ddir];
866 uint64_t secs = bytes / bps;
867 uint64_t remainder = bytes % bps;
869 return remainder * 1000000 / bps + secs * 1000000;
875 static void handle_thinktime(struct thread_data *td, enum fio_ddir ddir)
877 unsigned long long b;
881 b = ddir_rw_sum(td->io_blocks);
882 if (b % td->o.thinktime_blocks)
888 if (td->o.thinktime_spin)
889 total = usec_spin(td->o.thinktime_spin);
891 left = td->o.thinktime - total;
893 total += usec_sleep(td, left);
896 * If we're ignoring thinktime for the rate, add the number of bytes
897 * we would have done while sleeping, minus one block to ensure we
898 * start issuing immediately after the sleep.
900 if (total && td->rate_bps[ddir] && td->o.rate_ign_think) {
901 uint64_t missed = (td->rate_bps[ddir] * total) / 1000000ULL;
902 uint64_t bs = td->o.min_bs[ddir];
903 uint64_t usperop = bs * 1000000ULL / td->rate_bps[ddir];
906 if (usperop <= total)
909 over = (usperop - total) / usperop * -bs;
911 td->rate_io_issue_bytes[ddir] += (missed - over);
916 * Main IO worker function. It retrieves io_u's to process and queues
917 * and reaps them, checking for rate and errors along the way.
919 * Returns number of bytes written and trimmed.
921 static void do_io(struct thread_data *td, uint64_t *bytes_done)
925 uint64_t total_bytes, bytes_issued = 0;
927 for (i = 0; i < DDIR_RWDIR_CNT; i++)
928 bytes_done[i] = td->bytes_done[i];
930 if (in_ramp_time(td))
931 td_set_runstate(td, TD_RAMP);
933 td_set_runstate(td, TD_RUNNING);
937 total_bytes = td->o.size;
939 * Allow random overwrite workloads to write up to io_size
940 * before starting verification phase as 'size' doesn't apply.
942 if (td_write(td) && td_random(td) && td->o.norandommap)
943 total_bytes = max(total_bytes, (uint64_t) td->o.io_size);
945 * If verify_backlog is enabled, we'll run the verify in this
946 * handler as well. For that case, we may need up to twice the
949 if (td->o.verify != VERIFY_NONE &&
950 (td_write(td) && td->o.verify_backlog))
951 total_bytes += td->o.size;
953 /* In trimwrite mode, each byte is trimmed and then written, so
954 * allow total_bytes to be twice as big */
955 if (td_trimwrite(td))
956 total_bytes += td->total_io_size;
958 while ((td->o.read_iolog_file && !flist_empty(&td->io_log_list)) ||
959 (!flist_empty(&td->trim_list)) || !io_issue_bytes_exceeded(td) ||
961 struct timespec comp_time;
966 check_update_rusage(td);
968 if (td->terminate || td->done)
973 if (runtime_exceeded(td, &td->ts_cache)) {
974 __update_ts_cache(td);
975 if (runtime_exceeded(td, &td->ts_cache)) {
976 fio_mark_td_terminate(td);
981 if (flow_threshold_exceeded(td))
985 * Break if we exceeded the bytes. The exception is time
986 * based runs, but we still need to break out of the loop
987 * for those to run verification, if enabled.
989 if (bytes_issued >= total_bytes &&
990 (!td->o.time_based ||
991 (td->o.time_based && td->o.verify != VERIFY_NONE)))
995 if (IS_ERR_OR_NULL(io_u)) {
996 int err = PTR_ERR(io_u);
1000 if (err == -EBUSY) {
1004 if (td->o.latency_target)
1012 * Add verification end_io handler if:
1013 * - Asked to verify (!td_rw(td))
1014 * - Or the io_u is from our verify list (mixed write/ver)
1016 if (td->o.verify != VERIFY_NONE && io_u->ddir == DDIR_READ &&
1017 ((io_u->flags & IO_U_F_VER_LIST) || !td_rw(td))) {
1019 if (!td->o.verify_pattern_bytes) {
1020 io_u->rand_seed = __rand(&td->verify_state);
1021 if (sizeof(int) != sizeof(long *))
1022 io_u->rand_seed *= __rand(&td->verify_state);
1025 if (verify_state_should_stop(td, io_u)) {
1030 if (td->o.verify_async)
1031 io_u->end_io = verify_io_u_async;
1033 io_u->end_io = verify_io_u;
1034 td_set_runstate(td, TD_VERIFYING);
1035 } else if (in_ramp_time(td))
1036 td_set_runstate(td, TD_RAMP);
1038 td_set_runstate(td, TD_RUNNING);
1041 * Always log IO before it's issued, so we know the specific
1042 * order of it. The logged unit will track when the IO has
1045 if (td_write(td) && io_u->ddir == DDIR_WRITE &&
1047 td->o.verify != VERIFY_NONE &&
1048 !td->o.experimental_verify)
1049 log_io_piece(td, io_u);
1051 if (td->o.io_submit_mode == IO_MODE_OFFLOAD) {
1052 const unsigned long blen = io_u->xfer_buflen;
1053 const enum fio_ddir ddir = acct_ddir(io_u);
1058 workqueue_enqueue(&td->io_wq, &io_u->work);
1061 if (ddir_rw(ddir)) {
1062 td->io_issues[ddir]++;
1063 td->io_issue_bytes[ddir] += blen;
1064 td->rate_io_issue_bytes[ddir] += blen;
1067 if (should_check_rate(td))
1068 td->rate_next_io_time[ddir] = usec_for_io(td, ddir);
1071 ret = io_u_submit(td, io_u);
1073 if (should_check_rate(td))
1074 td->rate_next_io_time[ddir] = usec_for_io(td, ddir);
1076 if (io_queue_event(td, io_u, &ret, ddir, &bytes_issued, 0, &comp_time))
1080 * See if we need to complete some commands. Note that
1081 * we can get BUSY even without IO queued, if the
1082 * system is resource starved.
1085 full = queue_full(td) ||
1086 (ret == FIO_Q_BUSY && td->cur_depth);
1087 if (full || io_in_polling(td))
1088 ret = wait_for_completions(td, &comp_time);
1092 if (!ddir_rw_sum(td->bytes_done) &&
1093 !td_ioengine_flagged(td, FIO_NOIO))
1096 if (!in_ramp_time(td) && should_check_rate(td)) {
1097 if (check_min_rate(td, &comp_time)) {
1098 if (exitall_on_terminate || td->o.exitall_error)
1099 fio_terminate_threads(td->groupid);
1100 td_verror(td, EIO, "check_min_rate");
1104 if (!in_ramp_time(td) && td->o.latency_target)
1105 lat_target_check(td);
1107 if (ddir_rw(ddir) && td->o.thinktime)
1108 handle_thinktime(td, ddir);
1111 check_update_rusage(td);
1113 if (td->trim_entries)
1114 log_err("fio: %lu trim entries leaked?\n", td->trim_entries);
1116 if (td->o.fill_device && td->error == ENOSPC) {
1118 fio_mark_td_terminate(td);
1123 if (td->o.io_submit_mode == IO_MODE_OFFLOAD) {
1124 workqueue_flush(&td->io_wq);
1130 ret = io_u_queued_complete(td, i);
1131 if (td->o.fill_device && td->error == ENOSPC)
1135 if (should_fsync(td) && td->o.end_fsync) {
1136 td_set_runstate(td, TD_FSYNCING);
1138 for_each_file(td, f, i) {
1139 if (!fio_file_fsync(td, f))
1142 log_err("fio: end_fsync failed for file %s\n",
1147 cleanup_pending_aio(td);
1150 * stop job if we failed doing any IO
1152 if (!ddir_rw_sum(td->this_io_bytes))
1155 for (i = 0; i < DDIR_RWDIR_CNT; i++)
1156 bytes_done[i] = td->bytes_done[i] - bytes_done[i];
1159 static void free_file_completion_logging(struct thread_data *td)
1164 for_each_file(td, f, i) {
1165 if (!f->last_write_comp)
1167 sfree(f->last_write_comp);
1171 static int init_file_completion_logging(struct thread_data *td,
1177 if (td->o.verify == VERIFY_NONE || !td->o.verify_state_save)
1180 for_each_file(td, f, i) {
1181 f->last_write_comp = scalloc(depth, sizeof(uint64_t));
1182 if (!f->last_write_comp)
1189 free_file_completion_logging(td);
1190 log_err("fio: failed to alloc write comp data\n");
1194 static void cleanup_io_u(struct thread_data *td)
1198 while ((io_u = io_u_qpop(&td->io_u_freelist)) != NULL) {
1200 if (td->io_ops->io_u_free)
1201 td->io_ops->io_u_free(td, io_u);
1203 fio_memfree(io_u, sizeof(*io_u));
1208 io_u_rexit(&td->io_u_requeues);
1209 io_u_qexit(&td->io_u_freelist);
1210 io_u_qexit(&td->io_u_all);
1212 free_file_completion_logging(td);
1215 static int init_io_u(struct thread_data *td)
1218 unsigned int max_bs, min_write;
1219 int cl_align, i, max_units;
1220 int data_xfer = 1, err;
1223 max_units = td->o.iodepth;
1224 max_bs = td_max_bs(td);
1225 min_write = td->o.min_bs[DDIR_WRITE];
1226 td->orig_buffer_size = (unsigned long long) max_bs
1227 * (unsigned long long) max_units;
1229 if (td_ioengine_flagged(td, FIO_NOIO) || !(td_read(td) || td_write(td)))
1233 err += !io_u_rinit(&td->io_u_requeues, td->o.iodepth);
1234 err += !io_u_qinit(&td->io_u_freelist, td->o.iodepth);
1235 err += !io_u_qinit(&td->io_u_all, td->o.iodepth);
1238 log_err("fio: failed setting up IO queues\n");
1243 * if we may later need to do address alignment, then add any
1244 * possible adjustment here so that we don't cause a buffer
1245 * overflow later. this adjustment may be too much if we get
1246 * lucky and the allocator gives us an aligned address.
1248 if (td->o.odirect || td->o.mem_align || td->o.oatomic ||
1249 td_ioengine_flagged(td, FIO_RAWIO))
1250 td->orig_buffer_size += page_mask + td->o.mem_align;
1252 if (td->o.mem_type == MEM_SHMHUGE || td->o.mem_type == MEM_MMAPHUGE) {
1255 bs = td->orig_buffer_size + td->o.hugepage_size - 1;
1256 td->orig_buffer_size = bs & ~(td->o.hugepage_size - 1);
1259 if (td->orig_buffer_size != (size_t) td->orig_buffer_size) {
1260 log_err("fio: IO memory too large. Reduce max_bs or iodepth\n");
1264 if (data_xfer && allocate_io_mem(td))
1267 if (td->o.odirect || td->o.mem_align || td->o.oatomic ||
1268 td_ioengine_flagged(td, FIO_RAWIO))
1269 p = PTR_ALIGN(td->orig_buffer, page_mask) + td->o.mem_align;
1271 p = td->orig_buffer;
1273 cl_align = os_cache_line_size();
1275 for (i = 0; i < max_units; i++) {
1281 ptr = fio_memalign(cl_align, sizeof(*io_u));
1283 log_err("fio: unable to allocate aligned memory\n");
1288 memset(io_u, 0, sizeof(*io_u));
1289 INIT_FLIST_HEAD(&io_u->verify_list);
1290 dprint(FD_MEM, "io_u alloc %p, index %u\n", io_u, i);
1294 dprint(FD_MEM, "io_u %p, mem %p\n", io_u, io_u->buf);
1297 io_u_fill_buffer(td, io_u, min_write, max_bs);
1298 if (td_write(td) && td->o.verify_pattern_bytes) {
1300 * Fill the buffer with the pattern if we are
1301 * going to be doing writes.
1303 fill_verify_pattern(td, io_u->buf, max_bs, io_u, 0, 0);
1308 io_u->flags = IO_U_F_FREE;
1309 io_u_qpush(&td->io_u_freelist, io_u);
1312 * io_u never leaves this stack, used for iteration of all
1315 io_u_qpush(&td->io_u_all, io_u);
1317 if (td->io_ops->io_u_init) {
1318 int ret = td->io_ops->io_u_init(td, io_u);
1321 log_err("fio: failed to init engine data: %d\n", ret);
1329 if (init_file_completion_logging(td, max_units))
1336 * This function is Linux specific.
1337 * FIO_HAVE_IOSCHED_SWITCH enabled currently means it's Linux.
1339 static int switch_ioscheduler(struct thread_data *td)
1341 #ifdef FIO_HAVE_IOSCHED_SWITCH
1342 char tmp[256], tmp2[128];
1346 if (td_ioengine_flagged(td, FIO_DISKLESSIO))
1349 assert(td->files && td->files[0]);
1350 sprintf(tmp, "%s/queue/scheduler", td->files[0]->du->sysfs_root);
1352 f = fopen(tmp, "r+");
1354 if (errno == ENOENT) {
1355 log_err("fio: os or kernel doesn't support IO scheduler"
1359 td_verror(td, errno, "fopen iosched");
1366 ret = fwrite(td->o.ioscheduler, strlen(td->o.ioscheduler), 1, f);
1367 if (ferror(f) || ret != 1) {
1368 td_verror(td, errno, "fwrite");
1376 * Read back and check that the selected scheduler is now the default.
1378 memset(tmp, 0, sizeof(tmp));
1379 ret = fread(tmp, sizeof(tmp), 1, f);
1380 if (ferror(f) || ret < 0) {
1381 td_verror(td, errno, "fread");
1386 * either a list of io schedulers or "none\n" is expected.
1388 tmp[strlen(tmp) - 1] = '\0';
1391 * Write to "none" entry doesn't fail, so check the result here.
1393 if (!strcmp(tmp, "none")) {
1394 log_err("fio: io scheduler is not tunable\n");
1399 sprintf(tmp2, "[%s]", td->o.ioscheduler);
1400 if (!strstr(tmp, tmp2)) {
1401 log_err("fio: io scheduler %s not found\n", td->o.ioscheduler);
1402 td_verror(td, EINVAL, "iosched_switch");
1414 static bool keep_running(struct thread_data *td)
1416 unsigned long long limit;
1422 if (td->o.time_based)
1428 if (exceeds_number_ios(td))
1432 limit = td->o.io_size;
1436 if (limit != -1ULL && ddir_rw_sum(td->io_bytes) < limit) {
1440 * If the difference is less than the maximum IO size, we
1443 diff = limit - ddir_rw_sum(td->io_bytes);
1444 if (diff < td_max_bs(td))
1447 if (fio_files_done(td) && !td->o.io_size)
1456 static int exec_string(struct thread_options *o, const char *string, const char *mode)
1458 size_t newlen = strlen(string) + strlen(o->name) + strlen(mode) + 9 + 1;
1462 str = malloc(newlen);
1463 sprintf(str, "%s &> %s.%s.txt", string, o->name, mode);
1465 log_info("%s : Saving output of %s in %s.%s.txt\n",o->name, mode, o->name, mode);
1468 log_err("fio: exec of cmd <%s> failed\n", str);
1475 * Dry run to compute correct state of numberio for verification.
1477 static uint64_t do_dry_run(struct thread_data *td)
1479 td_set_runstate(td, TD_RUNNING);
1481 while ((td->o.read_iolog_file && !flist_empty(&td->io_log_list)) ||
1482 (!flist_empty(&td->trim_list)) || !io_complete_bytes_exceeded(td)) {
1486 if (td->terminate || td->done)
1489 io_u = get_io_u(td);
1490 if (IS_ERR_OR_NULL(io_u))
1493 io_u_set(td, io_u, IO_U_F_FLIGHT);
1496 if (ddir_rw(acct_ddir(io_u)))
1497 td->io_issues[acct_ddir(io_u)]++;
1498 if (ddir_rw(io_u->ddir)) {
1499 io_u_mark_depth(td, 1);
1500 td->ts.total_io_u[io_u->ddir]++;
1503 if (td_write(td) && io_u->ddir == DDIR_WRITE &&
1505 td->o.verify != VERIFY_NONE &&
1506 !td->o.experimental_verify)
1507 log_io_piece(td, io_u);
1509 ret = io_u_sync_complete(td, io_u);
1513 return td->bytes_done[DDIR_WRITE] + td->bytes_done[DDIR_TRIM];
1517 struct thread_data *td;
1518 struct sk_out *sk_out;
1522 * Entry point for the thread based jobs. The process based jobs end up
1523 * here as well, after a little setup.
1525 static void *thread_main(void *data)
1527 struct fork_data *fd = data;
1528 unsigned long long elapsed_us[DDIR_RWDIR_CNT] = { 0, };
1529 struct thread_data *td = fd->td;
1530 struct thread_options *o = &td->o;
1531 struct sk_out *sk_out = fd->sk_out;
1532 uint64_t bytes_done[DDIR_RWDIR_CNT];
1533 int deadlock_loop_cnt;
1534 bool clear_state, did_some_io;
1537 sk_out_assign(sk_out);
1540 if (!o->use_thread) {
1546 fio_local_clock_init(o->use_thread);
1548 dprint(FD_PROCESS, "jobs pid=%d started\n", (int) td->pid);
1551 fio_server_send_start(td);
1553 INIT_FLIST_HEAD(&td->io_log_list);
1554 INIT_FLIST_HEAD(&td->io_hist_list);
1555 INIT_FLIST_HEAD(&td->verify_list);
1556 INIT_FLIST_HEAD(&td->trim_list);
1557 INIT_FLIST_HEAD(&td->next_rand_list);
1558 td->io_hist_tree = RB_ROOT;
1560 ret = mutex_cond_init_pshared(&td->io_u_lock, &td->free_cond);
1562 td_verror(td, ret, "mutex_cond_init_pshared");
1565 ret = cond_init_pshared(&td->verify_cond);
1567 td_verror(td, ret, "mutex_cond_pshared");
1571 td_set_runstate(td, TD_INITIALIZED);
1572 dprint(FD_MUTEX, "up startup_mutex\n");
1573 fio_mutex_up(startup_mutex);
1574 dprint(FD_MUTEX, "wait on td->mutex\n");
1575 fio_mutex_down(td->mutex);
1576 dprint(FD_MUTEX, "done waiting on td->mutex\n");
1579 * A new gid requires privilege, so we need to do this before setting
1582 if (o->gid != -1U && setgid(o->gid)) {
1583 td_verror(td, errno, "setgid");
1586 if (o->uid != -1U && setuid(o->uid)) {
1587 td_verror(td, errno, "setuid");
1592 * Do this early, we don't want the compress threads to be limited
1593 * to the same CPUs as the IO workers. So do this before we set
1594 * any potential CPU affinity
1596 if (iolog_compress_init(td, sk_out))
1600 * If we have a gettimeofday() thread, make sure we exclude that
1601 * thread from this job
1604 fio_cpu_clear(&o->cpumask, o->gtod_cpu);
1607 * Set affinity first, in case it has an impact on the memory
1610 if (fio_option_is_set(o, cpumask)) {
1611 if (o->cpus_allowed_policy == FIO_CPUS_SPLIT) {
1612 ret = fio_cpus_split(&o->cpumask, td->thread_number - 1);
1614 log_err("fio: no CPUs set\n");
1615 log_err("fio: Try increasing number of available CPUs\n");
1616 td_verror(td, EINVAL, "cpus_split");
1620 ret = fio_setaffinity(td->pid, o->cpumask);
1622 td_verror(td, errno, "cpu_set_affinity");
1627 #ifdef CONFIG_LIBNUMA
1628 /* numa node setup */
1629 if (fio_option_is_set(o, numa_cpunodes) ||
1630 fio_option_is_set(o, numa_memnodes)) {
1631 struct bitmask *mask;
1633 if (numa_available() < 0) {
1634 td_verror(td, errno, "Does not support NUMA API\n");
1638 if (fio_option_is_set(o, numa_cpunodes)) {
1639 mask = numa_parse_nodestring(o->numa_cpunodes);
1640 ret = numa_run_on_node_mask(mask);
1641 numa_free_nodemask(mask);
1643 td_verror(td, errno, \
1644 "numa_run_on_node_mask failed\n");
1649 if (fio_option_is_set(o, numa_memnodes)) {
1651 if (o->numa_memnodes)
1652 mask = numa_parse_nodestring(o->numa_memnodes);
1654 switch (o->numa_mem_mode) {
1655 case MPOL_INTERLEAVE:
1656 numa_set_interleave_mask(mask);
1659 numa_set_membind(mask);
1662 numa_set_localalloc();
1664 case MPOL_PREFERRED:
1665 numa_set_preferred(o->numa_mem_prefer_node);
1673 numa_free_nodemask(mask);
1679 if (fio_pin_memory(td))
1683 * May alter parameters that init_io_u() will use, so we need to
1692 if (o->verify_async && verify_async_init(td))
1695 if (fio_option_is_set(o, ioprio) ||
1696 fio_option_is_set(o, ioprio_class)) {
1697 ret = ioprio_set(IOPRIO_WHO_PROCESS, 0, o->ioprio_class, o->ioprio);
1699 td_verror(td, errno, "ioprio_set");
1704 if (o->cgroup && cgroup_setup(td, cgroup_list, &cgroup_mnt))
1708 if (nice(o->nice) == -1 && errno != 0) {
1709 td_verror(td, errno, "nice");
1713 if (o->ioscheduler && switch_ioscheduler(td))
1716 if (!o->create_serialize && setup_files(td))
1722 if (!init_random_map(td))
1725 if (o->exec_prerun && exec_string(o, o->exec_prerun, (const char *)"prerun"))
1728 if (o->pre_read && !pre_read_files(td))
1731 fio_verify_init(td);
1733 if (rate_submit_init(td, sk_out))
1736 set_epoch_time(td, o->log_unix_epoch);
1737 fio_getrusage(&td->ru_start);
1738 memcpy(&td->bw_sample_time, &td->epoch, sizeof(td->epoch));
1739 memcpy(&td->iops_sample_time, &td->epoch, sizeof(td->epoch));
1740 memcpy(&td->ss.prev_time, &td->epoch, sizeof(td->epoch));
1742 if (o->ratemin[DDIR_READ] || o->ratemin[DDIR_WRITE] ||
1743 o->ratemin[DDIR_TRIM]) {
1744 memcpy(&td->lastrate[DDIR_READ], &td->bw_sample_time,
1745 sizeof(td->bw_sample_time));
1746 memcpy(&td->lastrate[DDIR_WRITE], &td->bw_sample_time,
1747 sizeof(td->bw_sample_time));
1748 memcpy(&td->lastrate[DDIR_TRIM], &td->bw_sample_time,
1749 sizeof(td->bw_sample_time));
1752 memset(bytes_done, 0, sizeof(bytes_done));
1753 clear_state = false;
1754 did_some_io = false;
1756 while (keep_running(td)) {
1757 uint64_t verify_bytes;
1759 fio_gettime(&td->start, NULL);
1760 memcpy(&td->ts_cache, &td->start, sizeof(td->start));
1763 clear_io_state(td, 0);
1765 if (o->unlink_each_loop && unlink_all_files(td))
1769 prune_io_piece_log(td);
1771 if (td->o.verify_only && td_write(td))
1772 verify_bytes = do_dry_run(td);
1774 do_io(td, bytes_done);
1776 if (!ddir_rw_sum(bytes_done)) {
1777 fio_mark_td_terminate(td);
1780 verify_bytes = bytes_done[DDIR_WRITE] +
1781 bytes_done[DDIR_TRIM];
1786 * If we took too long to shut down, the main thread could
1787 * already consider us reaped/exited. If that happens, break
1790 if (td->runstate >= TD_EXITED)
1796 * Make sure we've successfully updated the rusage stats
1797 * before waiting on the stat mutex. Otherwise we could have
1798 * the stat thread holding stat mutex and waiting for
1799 * the rusage_sem, which would never get upped because
1800 * this thread is waiting for the stat mutex.
1802 deadlock_loop_cnt = 0;
1804 check_update_rusage(td);
1805 if (!fio_mutex_down_trylock(stat_mutex))
1808 if (deadlock_loop_cnt++ > 5000) {
1809 log_err("fio seems to be stuck grabbing stat_mutex, forcibly exiting\n");
1810 td->error = EDEADLK;
1815 if (td_read(td) && td->io_bytes[DDIR_READ])
1816 update_runtime(td, elapsed_us, DDIR_READ);
1817 if (td_write(td) && td->io_bytes[DDIR_WRITE])
1818 update_runtime(td, elapsed_us, DDIR_WRITE);
1819 if (td_trim(td) && td->io_bytes[DDIR_TRIM])
1820 update_runtime(td, elapsed_us, DDIR_TRIM);
1821 fio_gettime(&td->start, NULL);
1822 fio_mutex_up(stat_mutex);
1824 if (td->error || td->terminate)
1827 if (!o->do_verify ||
1828 o->verify == VERIFY_NONE ||
1829 td_ioengine_flagged(td, FIO_UNIDIR))
1832 if (ddir_rw_sum(bytes_done))
1835 clear_io_state(td, 0);
1837 fio_gettime(&td->start, NULL);
1839 do_verify(td, verify_bytes);
1842 * See comment further up for why this is done here.
1844 check_update_rusage(td);
1846 fio_mutex_down(stat_mutex);
1847 update_runtime(td, elapsed_us, DDIR_READ);
1848 fio_gettime(&td->start, NULL);
1849 fio_mutex_up(stat_mutex);
1851 if (td->error || td->terminate)
1856 * If td ended up with no I/O when it should have had,
1857 * then something went wrong unless FIO_NOIO or FIO_DISKLESSIO.
1858 * (Are we not missing other flags that can be ignored ?)
1860 if ((td->o.size || td->o.io_size) && !ddir_rw_sum(bytes_done) &&
1861 !did_some_io && !td->o.create_only &&
1862 !(td_ioengine_flagged(td, FIO_NOIO) ||
1863 td_ioengine_flagged(td, FIO_DISKLESSIO)))
1864 log_err("%s: No I/O performed by %s, "
1865 "perhaps try --debug=io option for details?\n",
1866 td->o.name, td->io_ops->name);
1868 td_set_runstate(td, TD_FINISHING);
1870 update_rusage_stat(td);
1871 td->ts.total_run_time = mtime_since_now(&td->epoch);
1872 td->ts.io_bytes[DDIR_READ] = td->io_bytes[DDIR_READ];
1873 td->ts.io_bytes[DDIR_WRITE] = td->io_bytes[DDIR_WRITE];
1874 td->ts.io_bytes[DDIR_TRIM] = td->io_bytes[DDIR_TRIM];
1876 if (td->o.verify_state_save && !(td->flags & TD_F_VSTATE_SAVED) &&
1877 (td->o.verify != VERIFY_NONE && td_write(td)))
1878 verify_save_state(td->thread_number);
1880 fio_unpin_memory(td);
1882 td_writeout_logs(td, true);
1884 iolog_compress_exit(td);
1885 rate_submit_exit(td);
1887 if (o->exec_postrun)
1888 exec_string(o, o->exec_postrun, (const char *)"postrun");
1890 if (exitall_on_terminate || (o->exitall_error && td->error))
1891 fio_terminate_threads(td->groupid);
1895 log_info("fio: pid=%d, err=%d/%s\n", (int) td->pid, td->error,
1898 if (o->verify_async)
1899 verify_async_exit(td);
1901 close_and_free_files(td);
1904 cgroup_shutdown(td, &cgroup_mnt);
1905 verify_free_state(td);
1907 if (td->zone_state_index) {
1910 for (i = 0; i < DDIR_RWDIR_CNT; i++)
1911 free(td->zone_state_index[i]);
1912 free(td->zone_state_index);
1913 td->zone_state_index = NULL;
1916 if (fio_option_is_set(o, cpumask)) {
1917 ret = fio_cpuset_exit(&o->cpumask);
1919 td_verror(td, ret, "fio_cpuset_exit");
1923 * do this very late, it will log file closing as well
1925 if (o->write_iolog_file)
1926 write_iolog_close(td);
1928 td_set_runstate(td, TD_EXITED);
1931 * Do this last after setting our runstate to exited, so we
1932 * know that the stat thread is signaled.
1934 check_update_rusage(td);
1937 return (void *) (uintptr_t) td->error;
1941 * Run over the job map and reap the threads that have exited, if any.
1943 static void reap_threads(unsigned int *nr_running, uint64_t *t_rate,
1946 struct thread_data *td;
1947 unsigned int cputhreads, realthreads, pending;
1951 * reap exited threads (TD_EXITED -> TD_REAPED)
1953 realthreads = pending = cputhreads = 0;
1954 for_each_td(td, i) {
1957 if (!strcmp(td->o.ioengine, "cpuio"))
1966 if (td->runstate == TD_REAPED)
1968 if (td->o.use_thread) {
1969 if (td->runstate == TD_EXITED) {
1970 td_set_runstate(td, TD_REAPED);
1977 if (td->runstate == TD_EXITED)
1981 * check if someone quit or got killed in an unusual way
1983 ret = waitpid(td->pid, &status, flags);
1985 if (errno == ECHILD) {
1986 log_err("fio: pid=%d disappeared %d\n",
1987 (int) td->pid, td->runstate);
1989 td_set_runstate(td, TD_REAPED);
1993 } else if (ret == td->pid) {
1994 if (WIFSIGNALED(status)) {
1995 int sig = WTERMSIG(status);
1997 if (sig != SIGTERM && sig != SIGUSR2)
1998 log_err("fio: pid=%d, got signal=%d\n",
1999 (int) td->pid, sig);
2001 td_set_runstate(td, TD_REAPED);
2004 if (WIFEXITED(status)) {
2005 if (WEXITSTATUS(status) && !td->error)
2006 td->error = WEXITSTATUS(status);
2008 td_set_runstate(td, TD_REAPED);
2014 * If the job is stuck, do a forceful timeout of it and
2017 if (td->terminate &&
2018 td->runstate < TD_FSYNCING &&
2019 time_since_now(&td->terminate_time) >= FIO_REAP_TIMEOUT) {
2020 log_err("fio: job '%s' (state=%d) hasn't exited in "
2021 "%lu seconds, it appears to be stuck. Doing "
2022 "forceful exit of this job.\n",
2023 td->o.name, td->runstate,
2024 (unsigned long) time_since_now(&td->terminate_time));
2025 td_set_runstate(td, TD_REAPED);
2030 * thread is not dead, continue
2036 (*m_rate) -= ddir_rw_sum(td->o.ratemin);
2037 (*t_rate) -= ddir_rw_sum(td->o.rate);
2044 done_secs += mtime_since_now(&td->epoch) / 1000;
2045 profile_td_exit(td);
2048 if (*nr_running == cputhreads && !pending && realthreads)
2049 fio_terminate_threads(TERMINATE_ALL);
2052 static bool __check_trigger_file(void)
2059 if (stat(trigger_file, &sb))
2062 if (unlink(trigger_file) < 0)
2063 log_err("fio: failed to unlink %s: %s\n", trigger_file,
2069 static bool trigger_timedout(void)
2071 if (trigger_timeout)
2072 if (time_since_genesis() >= trigger_timeout) {
2073 trigger_timeout = 0;
2080 void exec_trigger(const char *cmd)
2084 if (!cmd || cmd[0] == '\0')
2089 log_err("fio: failed executing %s trigger\n", cmd);
2092 void check_trigger_file(void)
2094 if (__check_trigger_file() || trigger_timedout()) {
2096 fio_clients_send_trigger(trigger_remote_cmd);
2098 verify_save_state(IO_LIST_ALL);
2099 fio_terminate_threads(TERMINATE_ALL);
2100 exec_trigger(trigger_cmd);
2105 static int fio_verify_load_state(struct thread_data *td)
2109 if (!td->o.verify_state)
2115 ret = fio_server_get_verify_state(td->o.name,
2116 td->thread_number - 1, &data);
2118 verify_assign_state(td, data);
2120 ret = verify_load_state(td, "local");
2125 static void do_usleep(unsigned int usecs)
2127 check_for_running_stats();
2128 check_trigger_file();
2132 static bool check_mount_writes(struct thread_data *td)
2137 if (!td_write(td) || td->o.allow_mounted_write)
2141 * If FIO_HAVE_CHARDEV_SIZE is defined, it's likely that chrdevs
2142 * are mkfs'd and mounted.
2144 for_each_file(td, f, i) {
2145 #ifdef FIO_HAVE_CHARDEV_SIZE
2146 if (f->filetype != FIO_TYPE_BLOCK && f->filetype != FIO_TYPE_CHAR)
2148 if (f->filetype != FIO_TYPE_BLOCK)
2151 if (device_is_mounted(f->file_name))
2157 log_err("fio: %s appears mounted, and 'allow_mounted_write' isn't set. Aborting.\n", f->file_name);
2161 static bool waitee_running(struct thread_data *me)
2163 const char *waitee = me->o.wait_for;
2164 const char *self = me->o.name;
2165 struct thread_data *td;
2171 for_each_td(td, i) {
2172 if (!strcmp(td->o.name, self) || strcmp(td->o.name, waitee))
2175 if (td->runstate < TD_EXITED) {
2176 dprint(FD_PROCESS, "%s fenced by %s(%s)\n",
2178 runstate_to_name(td->runstate));
2183 dprint(FD_PROCESS, "%s: %s completed, can run\n", self, waitee);
2188 * Main function for kicking off and reaping jobs, as needed.
2190 static void run_threads(struct sk_out *sk_out)
2192 struct thread_data *td;
2193 unsigned int i, todo, nr_running, nr_started;
2194 uint64_t m_rate, t_rate;
2197 if (fio_gtod_offload && fio_start_gtod_thread())
2200 fio_idle_prof_init();
2204 nr_thread = nr_process = 0;
2205 for_each_td(td, i) {
2206 if (check_mount_writes(td))
2208 if (td->o.use_thread)
2214 if (output_format & FIO_OUTPUT_NORMAL) {
2215 log_info("Starting ");
2217 log_info("%d thread%s", nr_thread,
2218 nr_thread > 1 ? "s" : "");
2222 log_info("%d process%s", nr_process,
2223 nr_process > 1 ? "es" : "");
2229 todo = thread_number;
2232 m_rate = t_rate = 0;
2234 for_each_td(td, i) {
2235 print_status_init(td->thread_number - 1);
2237 if (!td->o.create_serialize)
2240 if (fio_verify_load_state(td))
2244 * do file setup here so it happens sequentially,
2245 * we don't want X number of threads getting their
2246 * client data interspersed on disk
2248 if (setup_files(td)) {
2252 log_err("fio: pid=%d, err=%d/%s\n",
2253 (int) td->pid, td->error, td->verror);
2254 td_set_runstate(td, TD_REAPED);
2261 * for sharing to work, each job must always open
2262 * its own files. so close them, if we opened them
2265 for_each_file(td, f, j) {
2266 if (fio_file_open(f))
2267 td_io_close_file(td, f);
2272 /* start idle threads before io threads start to run */
2273 fio_idle_prof_start();
2278 struct thread_data *map[REAL_MAX_JOBS];
2279 struct timespec this_start;
2280 int this_jobs = 0, left;
2281 struct fork_data *fd;
2284 * create threads (TD_NOT_CREATED -> TD_CREATED)
2286 for_each_td(td, i) {
2287 if (td->runstate != TD_NOT_CREATED)
2291 * never got a chance to start, killed by other
2292 * thread for some reason
2294 if (td->terminate) {
2299 if (td->o.start_delay) {
2300 spent = utime_since_genesis();
2302 if (td->o.start_delay > spent)
2306 if (td->o.stonewall && (nr_started || nr_running)) {
2307 dprint(FD_PROCESS, "%s: stonewall wait\n",
2312 if (waitee_running(td)) {
2313 dprint(FD_PROCESS, "%s: waiting for %s\n",
2314 td->o.name, td->o.wait_for);
2320 td->rusage_sem = fio_mutex_init(FIO_MUTEX_LOCKED);
2321 td->update_rusage = 0;
2324 * Set state to created. Thread will transition
2325 * to TD_INITIALIZED when it's done setting up.
2327 td_set_runstate(td, TD_CREATED);
2328 map[this_jobs++] = td;
2331 fd = calloc(1, sizeof(*fd));
2333 fd->sk_out = sk_out;
2335 if (td->o.use_thread) {
2338 dprint(FD_PROCESS, "will pthread_create\n");
2339 ret = pthread_create(&td->thread, NULL,
2342 log_err("pthread_create: %s\n",
2349 ret = pthread_detach(td->thread);
2351 log_err("pthread_detach: %s",
2355 dprint(FD_PROCESS, "will fork\n");
2360 ret = (int)(uintptr_t)thread_main(fd);
2362 } else if (i == fio_debug_jobno)
2363 *fio_debug_jobp = pid;
2365 dprint(FD_MUTEX, "wait on startup_mutex\n");
2366 if (fio_mutex_down_timeout(startup_mutex, 10000)) {
2367 log_err("fio: job startup hung? exiting.\n");
2368 fio_terminate_threads(TERMINATE_ALL);
2374 dprint(FD_MUTEX, "done waiting on startup_mutex\n");
2378 * Wait for the started threads to transition to
2381 fio_gettime(&this_start, NULL);
2383 while (left && !fio_abort) {
2384 if (mtime_since_now(&this_start) > JOB_START_TIMEOUT)
2389 for (i = 0; i < this_jobs; i++) {
2393 if (td->runstate == TD_INITIALIZED) {
2396 } else if (td->runstate >= TD_EXITED) {
2400 nr_running++; /* work-around... */
2406 log_err("fio: %d job%s failed to start\n", left,
2407 left > 1 ? "s" : "");
2408 for (i = 0; i < this_jobs; i++) {
2412 kill(td->pid, SIGTERM);
2418 * start created threads (TD_INITIALIZED -> TD_RUNNING).
2420 for_each_td(td, i) {
2421 if (td->runstate != TD_INITIALIZED)
2424 if (in_ramp_time(td))
2425 td_set_runstate(td, TD_RAMP);
2427 td_set_runstate(td, TD_RUNNING);
2430 m_rate += ddir_rw_sum(td->o.ratemin);
2431 t_rate += ddir_rw_sum(td->o.rate);
2433 fio_mutex_up(td->mutex);
2436 reap_threads(&nr_running, &t_rate, &m_rate);
2442 while (nr_running) {
2443 reap_threads(&nr_running, &t_rate, &m_rate);
2447 fio_idle_prof_stop();
2452 static void free_disk_util(void)
2454 disk_util_prune_entries();
2455 helper_thread_destroy();
2458 int fio_backend(struct sk_out *sk_out)
2460 struct thread_data *td;
2464 if (load_profile(exec_profile))
2467 exec_profile = NULL;
2473 struct log_params p = {
2474 .log_type = IO_LOG_TYPE_BW,
2477 setup_log(&agg_io_log[DDIR_READ], &p, "agg-read_bw.log");
2478 setup_log(&agg_io_log[DDIR_WRITE], &p, "agg-write_bw.log");
2479 setup_log(&agg_io_log[DDIR_TRIM], &p, "agg-trim_bw.log");
2482 startup_mutex = fio_mutex_init(FIO_MUTEX_LOCKED);
2483 if (startup_mutex == NULL)
2488 helper_thread_create(startup_mutex, sk_out);
2490 cgroup_list = smalloc(sizeof(*cgroup_list));
2491 INIT_FLIST_HEAD(cgroup_list);
2493 run_threads(sk_out);
2495 helper_thread_exit();
2500 for (i = 0; i < DDIR_RWDIR_CNT; i++) {
2501 struct io_log *log = agg_io_log[i];
2503 flush_log(log, false);
2509 for_each_td(td, i) {
2510 steadystate_free(td);
2511 fio_options_free(td);
2512 if (td->rusage_sem) {
2513 fio_mutex_remove(td->rusage_sem);
2514 td->rusage_sem = NULL;
2516 fio_mutex_remove(td->mutex);
2521 cgroup_kill(cgroup_list);
2525 fio_mutex_remove(startup_mutex);