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 #include "lib/memalign.h"
43 #include "lib/getrusage.h"
46 #include "workqueue.h"
47 #include "lib/mountcheck.h"
48 #include "rate-submit.h"
49 #include "helper_thread.h"
51 #include "zone-dist.h"
53 static struct fio_sem *startup_sem;
54 static struct flist_head *cgroup_list;
55 static struct cgroup_mnt *cgroup_mnt;
56 static int exit_value;
57 static volatile bool fio_abort;
58 static unsigned int nr_process = 0;
59 static unsigned int nr_thread = 0;
61 struct io_log *agg_io_log[DDIR_RWDIR_CNT];
64 unsigned int thread_number = 0;
65 unsigned int nr_segments = 0;
66 unsigned int cur_segment = 0;
67 unsigned int stat_number = 0;
69 unsigned long done_secs = 0;
70 #ifdef PTHREAD_ERRORCHECK_MUTEX_INITIALIZER_NP
71 pthread_mutex_t overlap_check = PTHREAD_ERRORCHECK_MUTEX_INITIALIZER_NP;
73 pthread_mutex_t overlap_check = PTHREAD_MUTEX_INITIALIZER;
76 #define JOB_START_TIMEOUT (5 * 1000)
78 static void sig_int(int sig)
82 fio_server_got_signal(sig);
84 log_info("\nfio: terminating on signal %d\n", sig);
89 fio_terminate_threads(TERMINATE_ALL, TERMINATE_ALL);
93 void sig_show_status(int sig)
95 show_running_run_stats();
98 static void set_sig_handlers(void)
100 struct sigaction act;
102 memset(&act, 0, sizeof(act));
103 act.sa_handler = sig_int;
104 act.sa_flags = SA_RESTART;
105 sigaction(SIGINT, &act, NULL);
107 memset(&act, 0, sizeof(act));
108 act.sa_handler = sig_int;
109 act.sa_flags = SA_RESTART;
110 sigaction(SIGTERM, &act, NULL);
112 /* Windows uses SIGBREAK as a quit signal from other applications */
114 memset(&act, 0, sizeof(act));
115 act.sa_handler = sig_int;
116 act.sa_flags = SA_RESTART;
117 sigaction(SIGBREAK, &act, NULL);
120 memset(&act, 0, sizeof(act));
121 act.sa_handler = sig_show_status;
122 act.sa_flags = SA_RESTART;
123 sigaction(SIGUSR1, &act, NULL);
126 memset(&act, 0, sizeof(act));
127 act.sa_handler = sig_int;
128 act.sa_flags = SA_RESTART;
129 sigaction(SIGPIPE, &act, NULL);
134 * Check if we are above the minimum rate given.
136 static bool __check_min_rate(struct thread_data *td, struct timespec *now,
139 unsigned long long bytes = 0;
140 unsigned long iops = 0;
142 unsigned long long rate;
143 unsigned long long ratemin = 0;
144 unsigned int rate_iops = 0;
145 unsigned int rate_iops_min = 0;
147 assert(ddir_rw(ddir));
149 if (!td->o.ratemin[ddir] && !td->o.rate_iops_min[ddir])
153 * allow a 2 second settle period in the beginning
155 if (mtime_since(&td->start, now) < 2000)
158 iops += td->this_io_blocks[ddir];
159 bytes += td->this_io_bytes[ddir];
160 ratemin += td->o.ratemin[ddir];
161 rate_iops += td->o.rate_iops[ddir];
162 rate_iops_min += td->o.rate_iops_min[ddir];
165 * if rate blocks is set, sample is running
167 if (td->rate_bytes[ddir] || td->rate_blocks[ddir]) {
168 spent = mtime_since(&td->lastrate[ddir], now);
169 if (spent < td->o.ratecycle)
172 if (td->o.rate[ddir] || td->o.ratemin[ddir]) {
174 * check bandwidth specified rate
176 if (bytes < td->rate_bytes[ddir]) {
177 log_err("%s: rate_min=%lluB/s not met, only transferred %lluB\n",
178 td->o.name, ratemin, bytes);
182 rate = ((bytes - td->rate_bytes[ddir]) * 1000) / spent;
186 if (rate < ratemin ||
187 bytes < td->rate_bytes[ddir]) {
188 log_err("%s: rate_min=%lluB/s not met, got %lluB/s\n",
189 td->o.name, ratemin, rate);
195 * checks iops specified rate
197 if (iops < rate_iops) {
198 log_err("%s: rate_iops_min=%u not met, only performed %lu IOs\n",
199 td->o.name, rate_iops, iops);
203 rate = ((iops - td->rate_blocks[ddir]) * 1000) / spent;
207 if (rate < rate_iops_min ||
208 iops < td->rate_blocks[ddir]) {
209 log_err("%s: rate_iops_min=%u not met, got %llu IOPS\n",
210 td->o.name, rate_iops_min, rate);
217 td->rate_bytes[ddir] = bytes;
218 td->rate_blocks[ddir] = iops;
219 memcpy(&td->lastrate[ddir], now, sizeof(*now));
223 static bool check_min_rate(struct thread_data *td, struct timespec *now)
227 for_each_rw_ddir(ddir) {
228 if (td->bytes_done[ddir])
229 ret |= __check_min_rate(td, now, ddir);
236 * When job exits, we can cancel the in-flight IO if we are using async
237 * io. Attempt to do so.
239 static void cleanup_pending_aio(struct thread_data *td)
244 * get immediately available events, if any
246 r = io_u_queued_complete(td, 0);
249 * now cancel remaining active events
251 if (td->io_ops->cancel) {
255 io_u_qiter(&td->io_u_all, io_u, i) {
256 if (io_u->flags & IO_U_F_FLIGHT) {
257 r = td->io_ops->cancel(td, io_u);
265 r = io_u_queued_complete(td, td->cur_depth);
269 * Helper to handle the final sync of a file. Works just like the normal
270 * io path, just does everything sync.
272 static bool fio_io_sync(struct thread_data *td, struct fio_file *f)
274 struct io_u *io_u = __get_io_u(td);
275 enum fio_q_status ret;
280 io_u->ddir = DDIR_SYNC;
282 io_u_set(td, io_u, IO_U_F_NO_FILE_PUT);
284 if (td_io_prep(td, io_u)) {
290 ret = td_io_queue(td, io_u);
294 if (io_u_queued_complete(td, 1) < 0)
297 case FIO_Q_COMPLETED:
299 td_verror(td, io_u->error, "td_io_queue");
303 if (io_u_sync_complete(td, io_u) < 0)
314 static int fio_file_fsync(struct thread_data *td, struct fio_file *f)
318 if (fio_file_open(f))
319 return fio_io_sync(td, f);
321 if (td_io_open_file(td, f))
324 ret = fio_io_sync(td, f);
326 if (fio_file_open(f))
327 ret2 = td_io_close_file(td, f);
328 return (ret || ret2);
331 static inline void __update_ts_cache(struct thread_data *td)
333 fio_gettime(&td->ts_cache, NULL);
336 static inline void update_ts_cache(struct thread_data *td)
338 if ((++td->ts_cache_nr & td->ts_cache_mask) == td->ts_cache_mask)
339 __update_ts_cache(td);
342 static inline bool runtime_exceeded(struct thread_data *td, struct timespec *t)
344 if (in_ramp_time(td))
348 if (utime_since(&td->epoch, t) >= td->o.timeout)
355 * We need to update the runtime consistently in ms, but keep a running
356 * tally of the current elapsed time in microseconds for sub millisecond
359 static inline void update_runtime(struct thread_data *td,
360 unsigned long long *elapsed_us,
361 const enum fio_ddir ddir)
363 if (ddir == DDIR_WRITE && td_write(td) && td->o.verify_only)
366 td->ts.runtime[ddir] -= (elapsed_us[ddir] + 999) / 1000;
367 elapsed_us[ddir] += utime_since_now(&td->start);
368 td->ts.runtime[ddir] += (elapsed_us[ddir] + 999) / 1000;
371 static bool break_on_this_error(struct thread_data *td, enum fio_ddir ddir,
376 if (ret < 0 || td->error) {
378 enum error_type_bit eb;
383 eb = td_error_type(ddir, err);
384 if (!(td->o.continue_on_error & (1 << eb)))
387 if (td_non_fatal_error(td, eb, err)) {
389 * Continue with the I/Os in case of
392 update_error_count(td, err);
396 } else if (td->o.fill_device && err == ENOSPC) {
398 * We expect to hit this error if
399 * fill_device option is set.
402 fio_mark_td_terminate(td);
406 * Stop the I/O in case of a fatal
409 update_error_count(td, err);
417 static void check_update_rusage(struct thread_data *td)
419 if (td->update_rusage) {
420 td->update_rusage = 0;
421 update_rusage_stat(td);
422 fio_sem_up(td->rusage_sem);
426 static int wait_for_completions(struct thread_data *td, struct timespec *time)
428 const int full = queue_full(td);
432 if (td->flags & TD_F_REGROW_LOGS)
433 return io_u_quiesce(td);
436 * if the queue is full, we MUST reap at least 1 event
438 min_evts = min(td->o.iodepth_batch_complete_min, td->cur_depth);
439 if ((full && !min_evts) || !td->o.iodepth_batch_complete_min)
442 if (time && __should_check_rate(td))
443 fio_gettime(time, NULL);
446 ret = io_u_queued_complete(td, min_evts);
449 } while (full && (td->cur_depth > td->o.iodepth_low));
454 int io_queue_event(struct thread_data *td, struct io_u *io_u, int *ret,
455 enum fio_ddir ddir, uint64_t *bytes_issued, int from_verify,
456 struct timespec *comp_time)
459 case FIO_Q_COMPLETED:
462 clear_io_u(td, io_u);
463 } else if (io_u->resid) {
464 long long bytes = io_u->xfer_buflen - io_u->resid;
465 struct fio_file *f = io_u->file;
468 *bytes_issued += bytes;
478 unlog_io_piece(td, io_u);
479 td_verror(td, EIO, "full resid");
484 io_u->xfer_buflen = io_u->resid;
485 io_u->xfer_buf += bytes;
486 io_u->offset += bytes;
488 if (ddir_rw(io_u->ddir))
489 td->ts.short_io_u[io_u->ddir]++;
491 if (io_u->offset == f->real_file_size)
494 requeue_io_u(td, &io_u);
497 if (comp_time && __should_check_rate(td))
498 fio_gettime(comp_time, NULL);
500 *ret = io_u_sync_complete(td, io_u);
505 if (td->flags & TD_F_REGROW_LOGS)
509 * when doing I/O (not when verifying),
510 * check for any errors that are to be ignored
518 * if the engine doesn't have a commit hook,
519 * the io_u is really queued. if it does have such
520 * a hook, it has to call io_u_queued() itself.
522 if (td->io_ops->commit == NULL)
523 io_u_queued(td, io_u);
525 *bytes_issued += io_u->xfer_buflen;
529 unlog_io_piece(td, io_u);
530 requeue_io_u(td, &io_u);
535 td_verror(td, -(*ret), "td_io_queue");
539 if (break_on_this_error(td, ddir, ret))
545 static inline bool io_in_polling(struct thread_data *td)
547 return !td->o.iodepth_batch_complete_min &&
548 !td->o.iodepth_batch_complete_max;
551 * Unlinks files from thread data fio_file structure
553 static int unlink_all_files(struct thread_data *td)
559 for_each_file(td, f, i) {
560 if (f->filetype != FIO_TYPE_FILE)
562 ret = td_io_unlink_file(td, f);
568 td_verror(td, ret, "unlink_all_files");
574 * Check if io_u will overlap an in-flight IO in the queue
576 bool in_flight_overlap(struct io_u_queue *q, struct io_u *io_u)
579 struct io_u *check_io_u;
580 unsigned long long x1, x2, y1, y2;
584 x2 = io_u->offset + io_u->buflen;
586 io_u_qiter(q, check_io_u, i) {
587 if (check_io_u->flags & IO_U_F_FLIGHT) {
588 y1 = check_io_u->offset;
589 y2 = check_io_u->offset + check_io_u->buflen;
591 if (x1 < y2 && y1 < x2) {
593 dprint(FD_IO, "in-flight overlap: %llu/%llu, %llu/%llu\n",
595 y1, check_io_u->buflen);
604 static enum fio_q_status io_u_submit(struct thread_data *td, struct io_u *io_u)
607 * Check for overlap if the user asked us to, and we have
608 * at least one IO in flight besides this one.
610 if (td->o.serialize_overlap && td->cur_depth > 1 &&
611 in_flight_overlap(&td->io_u_all, io_u))
614 return td_io_queue(td, io_u);
618 * The main verify engine. Runs over the writes we previously submitted,
619 * reads the blocks back in, and checks the crc/md5 of the data.
621 static void do_verify(struct thread_data *td, uint64_t verify_bytes)
628 dprint(FD_VERIFY, "starting loop\n");
631 * sync io first and invalidate cache, to make sure we really
634 for_each_file(td, f, i) {
635 if (!fio_file_open(f))
637 if (fio_io_sync(td, f))
639 if (file_invalidate_cache(td, f))
643 check_update_rusage(td);
649 * verify_state needs to be reset before verification
650 * proceeds so that expected random seeds match actual
651 * random seeds in headers. The main loop will reset
652 * all random number generators if randrepeat is set.
654 if (!td->o.rand_repeatable)
655 td_fill_verify_state_seed(td);
657 td_set_runstate(td, TD_VERIFYING);
660 while (!td->terminate) {
665 check_update_rusage(td);
667 if (runtime_exceeded(td, &td->ts_cache)) {
668 __update_ts_cache(td);
669 if (runtime_exceeded(td, &td->ts_cache)) {
670 fio_mark_td_terminate(td);
675 if (flow_threshold_exceeded(td))
678 if (!td->o.experimental_verify) {
679 io_u = __get_io_u(td);
683 if (get_next_verify(td, io_u)) {
688 if (td_io_prep(td, io_u)) {
693 if (ddir_rw_sum(td->bytes_done) + td->o.rw_min_bs > verify_bytes)
696 while ((io_u = get_io_u(td)) != NULL) {
697 if (IS_ERR_OR_NULL(io_u)) {
704 * We are only interested in the places where
705 * we wrote or trimmed IOs. Turn those into
706 * reads for verification purposes.
708 if (io_u->ddir == DDIR_READ) {
710 * Pretend we issued it for rwmix
713 td->io_issues[DDIR_READ]++;
716 } else if (io_u->ddir == DDIR_TRIM) {
717 io_u->ddir = DDIR_READ;
718 io_u_set(td, io_u, IO_U_F_TRIMMED);
720 } else if (io_u->ddir == DDIR_WRITE) {
721 io_u->ddir = DDIR_READ;
722 populate_verify_io_u(td, io_u);
734 if (verify_state_should_stop(td, io_u)) {
739 if (td->o.verify_async)
740 io_u->end_io = verify_io_u_async;
742 io_u->end_io = verify_io_u;
745 if (!td->o.disable_slat)
746 fio_gettime(&io_u->start_time, NULL);
748 ret = io_u_submit(td, io_u);
750 if (io_queue_event(td, io_u, &ret, ddir, NULL, 1, NULL))
754 * if we can queue more, do so. but check if there are
755 * completed io_u's first. Note that we can get BUSY even
756 * without IO queued, if the system is resource starved.
759 full = queue_full(td) || (ret == FIO_Q_BUSY && td->cur_depth);
760 if (full || io_in_polling(td))
761 ret = wait_for_completions(td, NULL);
767 check_update_rusage(td);
770 min_events = td->cur_depth;
773 ret = io_u_queued_complete(td, min_events);
775 cleanup_pending_aio(td);
777 td_set_runstate(td, TD_RUNNING);
779 dprint(FD_VERIFY, "exiting loop\n");
782 static bool exceeds_number_ios(struct thread_data *td)
784 unsigned long long number_ios;
786 if (!td->o.number_ios)
789 number_ios = ddir_rw_sum(td->io_blocks);
790 number_ios += td->io_u_queued + td->io_u_in_flight;
792 return number_ios >= (td->o.number_ios * td->loops);
795 static bool io_bytes_exceeded(struct thread_data *td, uint64_t *this_bytes)
797 unsigned long long bytes, limit;
800 bytes = this_bytes[DDIR_READ] + this_bytes[DDIR_WRITE];
801 else if (td_write(td))
802 bytes = this_bytes[DDIR_WRITE];
803 else if (td_read(td))
804 bytes = this_bytes[DDIR_READ];
806 bytes = this_bytes[DDIR_TRIM];
809 limit = td->o.io_size;
814 return bytes >= limit || exceeds_number_ios(td);
817 static bool io_issue_bytes_exceeded(struct thread_data *td)
819 return io_bytes_exceeded(td, td->io_issue_bytes);
822 static bool io_complete_bytes_exceeded(struct thread_data *td)
824 return io_bytes_exceeded(td, td->this_io_bytes);
828 * used to calculate the next io time for rate control
831 static long long usec_for_io(struct thread_data *td, enum fio_ddir ddir)
833 uint64_t bps = td->rate_bps[ddir];
835 assert(!(td->flags & TD_F_CHILD));
837 if (td->o.rate_process == RATE_PROCESS_POISSON) {
840 iops = bps / td->o.bs[ddir];
841 val = (int64_t) (1000000 / iops) *
842 -logf(__rand_0_1(&td->poisson_state[ddir]));
844 dprint(FD_RATE, "poisson rate iops=%llu, ddir=%d\n",
845 (unsigned long long) 1000000 / val,
848 td->last_usec[ddir] += val;
849 return td->last_usec[ddir];
851 uint64_t bytes = td->rate_io_issue_bytes[ddir];
852 uint64_t secs = bytes / bps;
853 uint64_t remainder = bytes % bps;
855 return remainder * 1000000 / bps + secs * 1000000;
861 static void handle_thinktime(struct thread_data *td, enum fio_ddir ddir)
863 unsigned long long b;
867 b = ddir_rw_sum(td->io_blocks);
868 if (b % td->o.thinktime_blocks)
874 if (td->o.thinktime_spin)
875 total = usec_spin(td->o.thinktime_spin);
877 left = td->o.thinktime - total;
879 total += usec_sleep(td, left);
882 * If we're ignoring thinktime for the rate, add the number of bytes
883 * we would have done while sleeping, minus one block to ensure we
884 * start issuing immediately after the sleep.
886 if (total && td->rate_bps[ddir] && td->o.rate_ign_think) {
887 uint64_t missed = (td->rate_bps[ddir] * total) / 1000000ULL;
888 uint64_t bs = td->o.min_bs[ddir];
889 uint64_t usperop = bs * 1000000ULL / td->rate_bps[ddir];
892 if (usperop <= total)
895 over = (usperop - total) / usperop * -bs;
897 td->rate_io_issue_bytes[ddir] += (missed - over);
898 /* adjust for rate_process=poisson */
899 td->last_usec[ddir] += total;
904 * Main IO worker function. It retrieves io_u's to process and queues
905 * and reaps them, checking for rate and errors along the way.
907 * Returns number of bytes written and trimmed.
909 static void do_io(struct thread_data *td, uint64_t *bytes_done)
913 uint64_t total_bytes, bytes_issued = 0;
915 for (i = 0; i < DDIR_RWDIR_CNT; i++)
916 bytes_done[i] = td->bytes_done[i];
918 if (in_ramp_time(td))
919 td_set_runstate(td, TD_RAMP);
921 td_set_runstate(td, TD_RUNNING);
925 total_bytes = td->o.size;
927 * Allow random overwrite workloads to write up to io_size
928 * before starting verification phase as 'size' doesn't apply.
930 if (td_write(td) && td_random(td) && td->o.norandommap)
931 total_bytes = max(total_bytes, (uint64_t) td->o.io_size);
933 * If verify_backlog is enabled, we'll run the verify in this
934 * handler as well. For that case, we may need up to twice the
937 if (td->o.verify != VERIFY_NONE &&
938 (td_write(td) && td->o.verify_backlog))
939 total_bytes += td->o.size;
941 /* In trimwrite mode, each byte is trimmed and then written, so
942 * allow total_bytes to be twice as big */
943 if (td_trimwrite(td))
944 total_bytes += td->total_io_size;
946 while ((td->o.read_iolog_file && !flist_empty(&td->io_log_list)) ||
947 (!flist_empty(&td->trim_list)) || !io_issue_bytes_exceeded(td) ||
949 struct timespec comp_time;
954 check_update_rusage(td);
956 if (td->terminate || td->done)
961 if (runtime_exceeded(td, &td->ts_cache)) {
962 __update_ts_cache(td);
963 if (runtime_exceeded(td, &td->ts_cache)) {
964 fio_mark_td_terminate(td);
969 if (flow_threshold_exceeded(td))
973 * Break if we exceeded the bytes. The exception is time
974 * based runs, but we still need to break out of the loop
975 * for those to run verification, if enabled.
976 * Jobs read from iolog do not use this stop condition.
978 if (bytes_issued >= total_bytes &&
979 !td->o.read_iolog_file &&
980 (!td->o.time_based ||
981 (td->o.time_based && td->o.verify != VERIFY_NONE)))
985 if (IS_ERR_OR_NULL(io_u)) {
986 int err = PTR_ERR(io_u);
994 if (td->o.latency_target)
999 if (io_u->ddir == DDIR_WRITE && td->flags & TD_F_DO_VERIFY)
1000 populate_verify_io_u(td, io_u);
1005 * Add verification end_io handler if:
1006 * - Asked to verify (!td_rw(td))
1007 * - Or the io_u is from our verify list (mixed write/ver)
1009 if (td->o.verify != VERIFY_NONE && io_u->ddir == DDIR_READ &&
1010 ((io_u->flags & IO_U_F_VER_LIST) || !td_rw(td))) {
1012 if (verify_state_should_stop(td, io_u)) {
1017 if (td->o.verify_async)
1018 io_u->end_io = verify_io_u_async;
1020 io_u->end_io = verify_io_u;
1021 td_set_runstate(td, TD_VERIFYING);
1022 } else if (in_ramp_time(td))
1023 td_set_runstate(td, TD_RAMP);
1025 td_set_runstate(td, TD_RUNNING);
1028 * Always log IO before it's issued, so we know the specific
1029 * order of it. The logged unit will track when the IO has
1032 if (td_write(td) && io_u->ddir == DDIR_WRITE &&
1034 td->o.verify != VERIFY_NONE &&
1035 !td->o.experimental_verify)
1036 log_io_piece(td, io_u);
1038 if (td->o.io_submit_mode == IO_MODE_OFFLOAD) {
1039 const unsigned long long blen = io_u->xfer_buflen;
1040 const enum fio_ddir __ddir = acct_ddir(io_u);
1045 workqueue_enqueue(&td->io_wq, &io_u->work);
1048 if (ddir_rw(__ddir)) {
1049 td->io_issues[__ddir]++;
1050 td->io_issue_bytes[__ddir] += blen;
1051 td->rate_io_issue_bytes[__ddir] += blen;
1054 if (should_check_rate(td))
1055 td->rate_next_io_time[__ddir] = usec_for_io(td, __ddir);
1058 ret = io_u_submit(td, io_u);
1060 if (should_check_rate(td))
1061 td->rate_next_io_time[ddir] = usec_for_io(td, ddir);
1063 if (io_queue_event(td, io_u, &ret, ddir, &bytes_issued, 0, &comp_time))
1067 * See if we need to complete some commands. Note that
1068 * we can get BUSY even without IO queued, if the
1069 * system is resource starved.
1072 full = queue_full(td) ||
1073 (ret == FIO_Q_BUSY && td->cur_depth);
1074 if (full || io_in_polling(td))
1075 ret = wait_for_completions(td, &comp_time);
1079 if (!ddir_rw_sum(td->bytes_done) &&
1080 !td_ioengine_flagged(td, FIO_NOIO))
1083 if (!in_ramp_time(td) && should_check_rate(td)) {
1084 if (check_min_rate(td, &comp_time)) {
1085 if (exitall_on_terminate || td->o.exitall_error)
1086 fio_terminate_threads(td->groupid, td->o.exit_what);
1087 td_verror(td, EIO, "check_min_rate");
1091 if (!in_ramp_time(td) && td->o.latency_target)
1092 lat_target_check(td);
1094 if (ddir_rw(ddir) && td->o.thinktime)
1095 handle_thinktime(td, ddir);
1098 check_update_rusage(td);
1100 if (td->trim_entries)
1101 log_err("fio: %lu trim entries leaked?\n", td->trim_entries);
1103 if (td->o.fill_device && td->error == ENOSPC) {
1105 fio_mark_td_terminate(td);
1110 if (td->o.io_submit_mode == IO_MODE_OFFLOAD) {
1111 workqueue_flush(&td->io_wq);
1117 ret = io_u_queued_complete(td, i);
1118 if (td->o.fill_device && td->error == ENOSPC)
1122 if (should_fsync(td) && (td->o.end_fsync || td->o.fsync_on_close)) {
1123 td_set_runstate(td, TD_FSYNCING);
1125 for_each_file(td, f, i) {
1126 if (!fio_file_fsync(td, f))
1129 log_err("fio: end_fsync failed for file %s\n",
1134 cleanup_pending_aio(td);
1137 * stop job if we failed doing any IO
1139 if (!ddir_rw_sum(td->this_io_bytes))
1142 for (i = 0; i < DDIR_RWDIR_CNT; i++)
1143 bytes_done[i] = td->bytes_done[i] - bytes_done[i];
1146 static void free_file_completion_logging(struct thread_data *td)
1151 for_each_file(td, f, i) {
1152 if (!f->last_write_comp)
1154 sfree(f->last_write_comp);
1158 static int init_file_completion_logging(struct thread_data *td,
1164 if (td->o.verify == VERIFY_NONE || !td->o.verify_state_save)
1167 for_each_file(td, f, i) {
1168 f->last_write_comp = scalloc(depth, sizeof(uint64_t));
1169 if (!f->last_write_comp)
1176 free_file_completion_logging(td);
1177 log_err("fio: failed to alloc write comp data\n");
1181 static void cleanup_io_u(struct thread_data *td)
1185 while ((io_u = io_u_qpop(&td->io_u_freelist)) != NULL) {
1187 if (td->io_ops->io_u_free)
1188 td->io_ops->io_u_free(td, io_u);
1190 fio_memfree(io_u, sizeof(*io_u), td_offload_overlap(td));
1195 io_u_rexit(&td->io_u_requeues);
1196 io_u_qexit(&td->io_u_freelist, false);
1197 io_u_qexit(&td->io_u_all, td_offload_overlap(td));
1199 free_file_completion_logging(td);
1202 static int init_io_u(struct thread_data *td)
1205 int cl_align, i, max_units;
1208 max_units = td->o.iodepth;
1211 err += !io_u_rinit(&td->io_u_requeues, td->o.iodepth);
1212 err += !io_u_qinit(&td->io_u_freelist, td->o.iodepth, false);
1213 err += !io_u_qinit(&td->io_u_all, td->o.iodepth, td_offload_overlap(td));
1216 log_err("fio: failed setting up IO queues\n");
1220 cl_align = os_cache_line_size();
1222 for (i = 0; i < max_units; i++) {
1228 ptr = fio_memalign(cl_align, sizeof(*io_u), td_offload_overlap(td));
1230 log_err("fio: unable to allocate aligned memory\n");
1235 memset(io_u, 0, sizeof(*io_u));
1236 INIT_FLIST_HEAD(&io_u->verify_list);
1237 dprint(FD_MEM, "io_u alloc %p, index %u\n", io_u, i);
1240 io_u->flags = IO_U_F_FREE;
1241 io_u_qpush(&td->io_u_freelist, io_u);
1244 * io_u never leaves this stack, used for iteration of all
1247 io_u_qpush(&td->io_u_all, io_u);
1249 if (td->io_ops->io_u_init) {
1250 int ret = td->io_ops->io_u_init(td, io_u);
1253 log_err("fio: failed to init engine data: %d\n", ret);
1259 init_io_u_buffers(td);
1261 if (init_file_completion_logging(td, max_units))
1267 int init_io_u_buffers(struct thread_data *td)
1270 unsigned long long max_bs, min_write;
1275 max_units = td->o.iodepth;
1276 max_bs = td_max_bs(td);
1277 min_write = td->o.min_bs[DDIR_WRITE];
1278 td->orig_buffer_size = (unsigned long long) max_bs
1279 * (unsigned long long) max_units;
1281 if (td_ioengine_flagged(td, FIO_NOIO) || !(td_read(td) || td_write(td)))
1285 * if we may later need to do address alignment, then add any
1286 * possible adjustment here so that we don't cause a buffer
1287 * overflow later. this adjustment may be too much if we get
1288 * lucky and the allocator gives us an aligned address.
1290 if (td->o.odirect || td->o.mem_align || td->o.oatomic ||
1291 td_ioengine_flagged(td, FIO_RAWIO))
1292 td->orig_buffer_size += page_mask + td->o.mem_align;
1294 if (td->o.mem_type == MEM_SHMHUGE || td->o.mem_type == MEM_MMAPHUGE) {
1295 unsigned long long bs;
1297 bs = td->orig_buffer_size + td->o.hugepage_size - 1;
1298 td->orig_buffer_size = bs & ~(td->o.hugepage_size - 1);
1301 if (td->orig_buffer_size != (size_t) td->orig_buffer_size) {
1302 log_err("fio: IO memory too large. Reduce max_bs or iodepth\n");
1306 if (data_xfer && allocate_io_mem(td))
1309 if (td->o.odirect || td->o.mem_align || td->o.oatomic ||
1310 td_ioengine_flagged(td, FIO_RAWIO))
1311 p = PTR_ALIGN(td->orig_buffer, page_mask) + td->o.mem_align;
1313 p = td->orig_buffer;
1315 for (i = 0; i < max_units; i++) {
1316 io_u = td->io_u_all.io_us[i];
1317 dprint(FD_MEM, "io_u alloc %p, index %u\n", io_u, i);
1321 dprint(FD_MEM, "io_u %p, mem %p\n", io_u, io_u->buf);
1324 io_u_fill_buffer(td, io_u, min_write, max_bs);
1325 if (td_write(td) && td->o.verify_pattern_bytes) {
1327 * Fill the buffer with the pattern if we are
1328 * going to be doing writes.
1330 fill_verify_pattern(td, io_u->buf, max_bs, io_u, 0, 0);
1340 * This function is Linux specific.
1341 * FIO_HAVE_IOSCHED_SWITCH enabled currently means it's Linux.
1343 static int switch_ioscheduler(struct thread_data *td)
1345 #ifdef FIO_HAVE_IOSCHED_SWITCH
1346 char tmp[256], tmp2[128], *p;
1350 if (td_ioengine_flagged(td, FIO_DISKLESSIO))
1353 assert(td->files && td->files[0]);
1354 sprintf(tmp, "%s/queue/scheduler", td->files[0]->du->sysfs_root);
1356 f = fopen(tmp, "r+");
1358 if (errno == ENOENT) {
1359 log_err("fio: os or kernel doesn't support IO scheduler"
1363 td_verror(td, errno, "fopen iosched");
1370 ret = fwrite(td->o.ioscheduler, strlen(td->o.ioscheduler), 1, f);
1371 if (ferror(f) || ret != 1) {
1372 td_verror(td, errno, "fwrite");
1380 * Read back and check that the selected scheduler is now the default.
1382 ret = fread(tmp, 1, sizeof(tmp) - 1, f);
1383 if (ferror(f) || ret < 0) {
1384 td_verror(td, errno, "fread");
1390 * either a list of io schedulers or "none\n" is expected. Strip the
1397 * Write to "none" entry doesn't fail, so check the result here.
1399 if (!strcmp(tmp, "none")) {
1400 log_err("fio: io scheduler is not tunable\n");
1405 sprintf(tmp2, "[%s]", td->o.ioscheduler);
1406 if (!strstr(tmp, tmp2)) {
1407 log_err("fio: io scheduler %s not found\n", td->o.ioscheduler);
1408 td_verror(td, EINVAL, "iosched_switch");
1420 static bool keep_running(struct thread_data *td)
1422 unsigned long long limit;
1428 if (td->o.time_based)
1434 if (exceeds_number_ios(td))
1438 limit = td->o.io_size;
1442 if (limit != -1ULL && ddir_rw_sum(td->io_bytes) < limit) {
1446 * If the difference is less than the maximum IO size, we
1449 diff = limit - ddir_rw_sum(td->io_bytes);
1450 if (diff < td_max_bs(td))
1453 if (fio_files_done(td) && !td->o.io_size)
1462 static int exec_string(struct thread_options *o, const char *string,
1468 if (asprintf(&str, "%s > %s.%s.txt 2>&1", string, o->name, mode) < 0)
1471 log_info("%s : Saving output of %s in %s.%s.txt\n", o->name, mode,
1475 log_err("fio: exec of cmd <%s> failed\n", str);
1482 * Dry run to compute correct state of numberio for verification.
1484 static uint64_t do_dry_run(struct thread_data *td)
1486 td_set_runstate(td, TD_RUNNING);
1488 while ((td->o.read_iolog_file && !flist_empty(&td->io_log_list)) ||
1489 (!flist_empty(&td->trim_list)) || !io_complete_bytes_exceeded(td)) {
1493 if (td->terminate || td->done)
1496 io_u = get_io_u(td);
1497 if (IS_ERR_OR_NULL(io_u))
1500 io_u_set(td, io_u, IO_U_F_FLIGHT);
1503 if (ddir_rw(acct_ddir(io_u)))
1504 td->io_issues[acct_ddir(io_u)]++;
1505 if (ddir_rw(io_u->ddir)) {
1506 io_u_mark_depth(td, 1);
1507 td->ts.total_io_u[io_u->ddir]++;
1510 if (td_write(td) && io_u->ddir == DDIR_WRITE &&
1512 td->o.verify != VERIFY_NONE &&
1513 !td->o.experimental_verify)
1514 log_io_piece(td, io_u);
1516 ret = io_u_sync_complete(td, io_u);
1520 return td->bytes_done[DDIR_WRITE] + td->bytes_done[DDIR_TRIM];
1524 struct thread_data *td;
1525 struct sk_out *sk_out;
1529 * Entry point for the thread based jobs. The process based jobs end up
1530 * here as well, after a little setup.
1532 static void *thread_main(void *data)
1534 struct fork_data *fd = data;
1535 unsigned long long elapsed_us[DDIR_RWDIR_CNT] = { 0, };
1536 struct thread_data *td = fd->td;
1537 struct thread_options *o = &td->o;
1538 struct sk_out *sk_out = fd->sk_out;
1539 uint64_t bytes_done[DDIR_RWDIR_CNT];
1540 int deadlock_loop_cnt;
1544 sk_out_assign(sk_out);
1547 if (!o->use_thread) {
1553 fio_local_clock_init();
1555 dprint(FD_PROCESS, "jobs pid=%d started\n", (int) td->pid);
1558 fio_server_send_start(td);
1560 INIT_FLIST_HEAD(&td->io_log_list);
1561 INIT_FLIST_HEAD(&td->io_hist_list);
1562 INIT_FLIST_HEAD(&td->verify_list);
1563 INIT_FLIST_HEAD(&td->trim_list);
1564 td->io_hist_tree = RB_ROOT;
1566 ret = mutex_cond_init_pshared(&td->io_u_lock, &td->free_cond);
1568 td_verror(td, ret, "mutex_cond_init_pshared");
1571 ret = cond_init_pshared(&td->verify_cond);
1573 td_verror(td, ret, "mutex_cond_pshared");
1577 td_set_runstate(td, TD_INITIALIZED);
1578 dprint(FD_MUTEX, "up startup_sem\n");
1579 fio_sem_up(startup_sem);
1580 dprint(FD_MUTEX, "wait on td->sem\n");
1581 fio_sem_down(td->sem);
1582 dprint(FD_MUTEX, "done waiting on td->sem\n");
1585 * A new gid requires privilege, so we need to do this before setting
1588 if (o->gid != -1U && setgid(o->gid)) {
1589 td_verror(td, errno, "setgid");
1592 if (o->uid != -1U && setuid(o->uid)) {
1593 td_verror(td, errno, "setuid");
1597 td_zone_gen_index(td);
1600 * Do this early, we don't want the compress threads to be limited
1601 * to the same CPUs as the IO workers. So do this before we set
1602 * any potential CPU affinity
1604 if (iolog_compress_init(td, sk_out))
1608 * If we have a gettimeofday() thread, make sure we exclude that
1609 * thread from this job
1612 fio_cpu_clear(&o->cpumask, o->gtod_cpu);
1615 * Set affinity first, in case it has an impact on the memory
1618 if (fio_option_is_set(o, cpumask)) {
1619 if (o->cpus_allowed_policy == FIO_CPUS_SPLIT) {
1620 ret = fio_cpus_split(&o->cpumask, td->thread_number - 1);
1622 log_err("fio: no CPUs set\n");
1623 log_err("fio: Try increasing number of available CPUs\n");
1624 td_verror(td, EINVAL, "cpus_split");
1628 ret = fio_setaffinity(td->pid, o->cpumask);
1630 td_verror(td, errno, "cpu_set_affinity");
1635 #ifdef CONFIG_LIBNUMA
1636 /* numa node setup */
1637 if (fio_option_is_set(o, numa_cpunodes) ||
1638 fio_option_is_set(o, numa_memnodes)) {
1639 struct bitmask *mask;
1641 if (numa_available() < 0) {
1642 td_verror(td, errno, "Does not support NUMA API\n");
1646 if (fio_option_is_set(o, numa_cpunodes)) {
1647 mask = numa_parse_nodestring(o->numa_cpunodes);
1648 ret = numa_run_on_node_mask(mask);
1649 numa_free_nodemask(mask);
1651 td_verror(td, errno, \
1652 "numa_run_on_node_mask failed\n");
1657 if (fio_option_is_set(o, numa_memnodes)) {
1659 if (o->numa_memnodes)
1660 mask = numa_parse_nodestring(o->numa_memnodes);
1662 switch (o->numa_mem_mode) {
1663 case MPOL_INTERLEAVE:
1664 numa_set_interleave_mask(mask);
1667 numa_set_membind(mask);
1670 numa_set_localalloc();
1672 case MPOL_PREFERRED:
1673 numa_set_preferred(o->numa_mem_prefer_node);
1681 numa_free_nodemask(mask);
1687 if (fio_pin_memory(td))
1691 * May alter parameters that init_io_u() will use, so we need to
1694 if (!init_iolog(td))
1703 if (td->io_ops->post_init && td->io_ops->post_init(td))
1706 if (o->verify_async && verify_async_init(td))
1709 if (fio_option_is_set(o, ioprio) ||
1710 fio_option_is_set(o, ioprio_class)) {
1711 ret = ioprio_set(IOPRIO_WHO_PROCESS, 0, o->ioprio_class, o->ioprio);
1713 td_verror(td, errno, "ioprio_set");
1718 if (o->cgroup && cgroup_setup(td, cgroup_list, &cgroup_mnt))
1722 if (nice(o->nice) == -1 && errno != 0) {
1723 td_verror(td, errno, "nice");
1727 if (o->ioscheduler && switch_ioscheduler(td))
1730 if (!o->create_serialize && setup_files(td))
1733 if (!init_random_map(td))
1736 if (o->exec_prerun && exec_string(o, o->exec_prerun, "prerun"))
1739 if (o->pre_read && !pre_read_files(td))
1742 fio_verify_init(td);
1744 if (rate_submit_init(td, sk_out))
1747 set_epoch_time(td, o->log_unix_epoch);
1748 fio_getrusage(&td->ru_start);
1749 memcpy(&td->bw_sample_time, &td->epoch, sizeof(td->epoch));
1750 memcpy(&td->iops_sample_time, &td->epoch, sizeof(td->epoch));
1751 memcpy(&td->ss.prev_time, &td->epoch, sizeof(td->epoch));
1753 if (o->ratemin[DDIR_READ] || o->ratemin[DDIR_WRITE] ||
1754 o->ratemin[DDIR_TRIM]) {
1755 memcpy(&td->lastrate[DDIR_READ], &td->bw_sample_time,
1756 sizeof(td->bw_sample_time));
1757 memcpy(&td->lastrate[DDIR_WRITE], &td->bw_sample_time,
1758 sizeof(td->bw_sample_time));
1759 memcpy(&td->lastrate[DDIR_TRIM], &td->bw_sample_time,
1760 sizeof(td->bw_sample_time));
1763 memset(bytes_done, 0, sizeof(bytes_done));
1764 clear_state = false;
1766 while (keep_running(td)) {
1767 uint64_t verify_bytes;
1769 fio_gettime(&td->start, NULL);
1770 memcpy(&td->ts_cache, &td->start, sizeof(td->start));
1773 clear_io_state(td, 0);
1775 if (o->unlink_each_loop && unlink_all_files(td))
1779 prune_io_piece_log(td);
1781 if (td->o.verify_only && td_write(td))
1782 verify_bytes = do_dry_run(td);
1784 do_io(td, bytes_done);
1786 if (!ddir_rw_sum(bytes_done)) {
1787 fio_mark_td_terminate(td);
1790 verify_bytes = bytes_done[DDIR_WRITE] +
1791 bytes_done[DDIR_TRIM];
1796 * If we took too long to shut down, the main thread could
1797 * already consider us reaped/exited. If that happens, break
1800 if (td->runstate >= TD_EXITED)
1806 * Make sure we've successfully updated the rusage stats
1807 * before waiting on the stat mutex. Otherwise we could have
1808 * the stat thread holding stat mutex and waiting for
1809 * the rusage_sem, which would never get upped because
1810 * this thread is waiting for the stat mutex.
1812 deadlock_loop_cnt = 0;
1814 check_update_rusage(td);
1815 if (!fio_sem_down_trylock(stat_sem))
1818 if (deadlock_loop_cnt++ > 5000) {
1819 log_err("fio seems to be stuck grabbing stat_sem, forcibly exiting\n");
1820 td->error = EDEADLK;
1825 if (td_read(td) && td->io_bytes[DDIR_READ])
1826 update_runtime(td, elapsed_us, DDIR_READ);
1827 if (td_write(td) && td->io_bytes[DDIR_WRITE])
1828 update_runtime(td, elapsed_us, DDIR_WRITE);
1829 if (td_trim(td) && td->io_bytes[DDIR_TRIM])
1830 update_runtime(td, elapsed_us, DDIR_TRIM);
1831 fio_gettime(&td->start, NULL);
1832 fio_sem_up(stat_sem);
1834 if (td->error || td->terminate)
1837 if (!o->do_verify ||
1838 o->verify == VERIFY_NONE ||
1839 td_ioengine_flagged(td, FIO_UNIDIR))
1842 clear_io_state(td, 0);
1844 fio_gettime(&td->start, NULL);
1846 do_verify(td, verify_bytes);
1849 * See comment further up for why this is done here.
1851 check_update_rusage(td);
1853 fio_sem_down(stat_sem);
1854 update_runtime(td, elapsed_us, DDIR_READ);
1855 fio_gettime(&td->start, NULL);
1856 fio_sem_up(stat_sem);
1858 if (td->error || td->terminate)
1863 * Acquire this lock if we were doing overlap checking in
1864 * offload mode so that we don't clean up this job while
1865 * another thread is checking its io_u's for overlap
1867 if (td_offload_overlap(td)) {
1868 int res = pthread_mutex_lock(&overlap_check);
1871 td_set_runstate(td, TD_FINISHING);
1872 if (td_offload_overlap(td)) {
1873 res = pthread_mutex_unlock(&overlap_check);
1877 update_rusage_stat(td);
1878 td->ts.total_run_time = mtime_since_now(&td->epoch);
1879 for_each_rw_ddir(ddir) {
1880 td->ts.io_bytes[ddir] = td->io_bytes[ddir];
1883 if (td->o.verify_state_save && !(td->flags & TD_F_VSTATE_SAVED) &&
1884 (td->o.verify != VERIFY_NONE && td_write(td)))
1885 verify_save_state(td->thread_number);
1887 fio_unpin_memory(td);
1889 td_writeout_logs(td, true);
1891 iolog_compress_exit(td);
1892 rate_submit_exit(td);
1894 if (o->exec_postrun)
1895 exec_string(o, o->exec_postrun, "postrun");
1897 if (exitall_on_terminate || (o->exitall_error && td->error))
1898 fio_terminate_threads(td->groupid, td->o.exit_what);
1902 log_info("fio: pid=%d, err=%d/%s\n", (int) td->pid, td->error,
1905 if (o->verify_async)
1906 verify_async_exit(td);
1908 close_and_free_files(td);
1911 cgroup_shutdown(td, cgroup_mnt);
1912 verify_free_state(td);
1913 td_zone_free_index(td);
1915 if (fio_option_is_set(o, cpumask)) {
1916 ret = fio_cpuset_exit(&o->cpumask);
1918 td_verror(td, ret, "fio_cpuset_exit");
1922 * do this very late, it will log file closing as well
1924 if (o->write_iolog_file)
1925 write_iolog_close(td);
1926 if (td->io_log_rfile)
1927 fclose(td->io_log_rfile);
1929 td_set_runstate(td, TD_EXITED);
1932 * Do this last after setting our runstate to exited, so we
1933 * know that the stat thread is signaled.
1935 check_update_rusage(td);
1938 return (void *) (uintptr_t) td->error;
1942 * Run over the job map and reap the threads that have exited, if any.
1944 static void reap_threads(unsigned int *nr_running, uint64_t *t_rate,
1947 struct thread_data *td;
1948 unsigned int cputhreads, realthreads, pending;
1952 * reap exited threads (TD_EXITED -> TD_REAPED)
1954 realthreads = pending = cputhreads = 0;
1955 for_each_td(td, i) {
1958 if (!strcmp(td->o.ioengine, "cpuio"))
1967 if (td->runstate == TD_REAPED)
1969 if (td->o.use_thread) {
1970 if (td->runstate == TD_EXITED) {
1971 td_set_runstate(td, TD_REAPED);
1978 if (td->runstate == TD_EXITED)
1982 * check if someone quit or got killed in an unusual way
1984 ret = waitpid(td->pid, &status, flags);
1986 if (errno == ECHILD) {
1987 log_err("fio: pid=%d disappeared %d\n",
1988 (int) td->pid, td->runstate);
1990 td_set_runstate(td, TD_REAPED);
1994 } else if (ret == td->pid) {
1995 if (WIFSIGNALED(status)) {
1996 int sig = WTERMSIG(status);
1998 if (sig != SIGTERM && sig != SIGUSR2)
1999 log_err("fio: pid=%d, got signal=%d\n",
2000 (int) td->pid, sig);
2002 td_set_runstate(td, TD_REAPED);
2005 if (WIFEXITED(status)) {
2006 if (WEXITSTATUS(status) && !td->error)
2007 td->error = WEXITSTATUS(status);
2009 td_set_runstate(td, TD_REAPED);
2015 * If the job is stuck, do a forceful timeout of it and
2018 if (td->terminate &&
2019 td->runstate < TD_FSYNCING &&
2020 time_since_now(&td->terminate_time) >= FIO_REAP_TIMEOUT) {
2021 log_err("fio: job '%s' (state=%d) hasn't exited in "
2022 "%lu seconds, it appears to be stuck. Doing "
2023 "forceful exit of this job.\n",
2024 td->o.name, td->runstate,
2025 (unsigned long) time_since_now(&td->terminate_time));
2026 td_set_runstate(td, TD_REAPED);
2031 * thread is not dead, continue
2037 (*m_rate) -= ddir_rw_sum(td->o.ratemin);
2038 (*t_rate) -= ddir_rw_sum(td->o.rate);
2045 done_secs += mtime_since_now(&td->epoch) / 1000;
2046 profile_td_exit(td);
2050 if (*nr_running == cputhreads && !pending && realthreads)
2051 fio_terminate_threads(TERMINATE_ALL, TERMINATE_ALL);
2054 static bool __check_trigger_file(void)
2061 if (stat(trigger_file, &sb))
2064 if (unlink(trigger_file) < 0)
2065 log_err("fio: failed to unlink %s: %s\n", trigger_file,
2071 static bool trigger_timedout(void)
2073 if (trigger_timeout)
2074 if (time_since_genesis() >= trigger_timeout) {
2075 trigger_timeout = 0;
2082 void exec_trigger(const char *cmd)
2086 if (!cmd || cmd[0] == '\0')
2091 log_err("fio: failed executing %s trigger\n", cmd);
2094 void check_trigger_file(void)
2096 if (__check_trigger_file() || trigger_timedout()) {
2098 fio_clients_send_trigger(trigger_remote_cmd);
2100 verify_save_state(IO_LIST_ALL);
2101 fio_terminate_threads(TERMINATE_ALL, TERMINATE_ALL);
2102 exec_trigger(trigger_cmd);
2107 static int fio_verify_load_state(struct thread_data *td)
2111 if (!td->o.verify_state)
2117 ret = fio_server_get_verify_state(td->o.name,
2118 td->thread_number - 1, &data);
2120 verify_assign_state(td, data);
2122 char prefix[PATH_MAX];
2125 sprintf(prefix, "%s%clocal", aux_path,
2126 FIO_OS_PATH_SEPARATOR);
2128 strcpy(prefix, "local");
2129 ret = verify_load_state(td, prefix);
2135 static void do_usleep(unsigned int usecs)
2137 check_for_running_stats();
2138 check_trigger_file();
2142 static bool check_mount_writes(struct thread_data *td)
2147 if (!td_write(td) || td->o.allow_mounted_write)
2151 * If FIO_HAVE_CHARDEV_SIZE is defined, it's likely that chrdevs
2152 * are mkfs'd and mounted.
2154 for_each_file(td, f, i) {
2155 #ifdef FIO_HAVE_CHARDEV_SIZE
2156 if (f->filetype != FIO_TYPE_BLOCK && f->filetype != FIO_TYPE_CHAR)
2158 if (f->filetype != FIO_TYPE_BLOCK)
2161 if (device_is_mounted(f->file_name))
2167 log_err("fio: %s appears mounted, and 'allow_mounted_write' isn't set. Aborting.\n", f->file_name);
2171 static bool waitee_running(struct thread_data *me)
2173 const char *waitee = me->o.wait_for;
2174 const char *self = me->o.name;
2175 struct thread_data *td;
2181 for_each_td(td, i) {
2182 if (!strcmp(td->o.name, self) || strcmp(td->o.name, waitee))
2185 if (td->runstate < TD_EXITED) {
2186 dprint(FD_PROCESS, "%s fenced by %s(%s)\n",
2188 runstate_to_name(td->runstate));
2193 dprint(FD_PROCESS, "%s: %s completed, can run\n", self, waitee);
2198 * Main function for kicking off and reaping jobs, as needed.
2200 static void run_threads(struct sk_out *sk_out)
2202 struct thread_data *td;
2203 unsigned int i, todo, nr_running, nr_started;
2204 uint64_t m_rate, t_rate;
2207 if (fio_gtod_offload && fio_start_gtod_thread())
2210 fio_idle_prof_init();
2214 nr_thread = nr_process = 0;
2215 for_each_td(td, i) {
2216 if (check_mount_writes(td))
2218 if (td->o.use_thread)
2224 if (output_format & FIO_OUTPUT_NORMAL) {
2225 struct buf_output out;
2227 buf_output_init(&out);
2228 __log_buf(&out, "Starting ");
2230 __log_buf(&out, "%d thread%s", nr_thread,
2231 nr_thread > 1 ? "s" : "");
2234 __log_buf(&out, " and ");
2235 __log_buf(&out, "%d process%s", nr_process,
2236 nr_process > 1 ? "es" : "");
2238 __log_buf(&out, "\n");
2239 log_info_buf(out.buf, out.buflen);
2240 buf_output_free(&out);
2243 todo = thread_number;
2246 m_rate = t_rate = 0;
2248 for_each_td(td, i) {
2249 print_status_init(td->thread_number - 1);
2251 if (!td->o.create_serialize)
2254 if (fio_verify_load_state(td))
2258 * do file setup here so it happens sequentially,
2259 * we don't want X number of threads getting their
2260 * client data interspersed on disk
2262 if (setup_files(td)) {
2266 log_err("fio: pid=%d, err=%d/%s\n",
2267 (int) td->pid, td->error, td->verror);
2268 td_set_runstate(td, TD_REAPED);
2275 * for sharing to work, each job must always open
2276 * its own files. so close them, if we opened them
2279 for_each_file(td, f, j) {
2280 if (fio_file_open(f))
2281 td_io_close_file(td, f);
2286 /* start idle threads before io threads start to run */
2287 fio_idle_prof_start();
2292 struct thread_data *map[REAL_MAX_JOBS];
2293 struct timespec this_start;
2294 int this_jobs = 0, left;
2295 struct fork_data *fd;
2298 * create threads (TD_NOT_CREATED -> TD_CREATED)
2300 for_each_td(td, i) {
2301 if (td->runstate != TD_NOT_CREATED)
2305 * never got a chance to start, killed by other
2306 * thread for some reason
2308 if (td->terminate) {
2313 if (td->o.start_delay) {
2314 spent = utime_since_genesis();
2316 if (td->o.start_delay > spent)
2320 if (td->o.stonewall && (nr_started || nr_running)) {
2321 dprint(FD_PROCESS, "%s: stonewall wait\n",
2326 if (waitee_running(td)) {
2327 dprint(FD_PROCESS, "%s: waiting for %s\n",
2328 td->o.name, td->o.wait_for);
2334 td->rusage_sem = fio_sem_init(FIO_SEM_LOCKED);
2335 td->update_rusage = 0;
2338 * Set state to created. Thread will transition
2339 * to TD_INITIALIZED when it's done setting up.
2341 td_set_runstate(td, TD_CREATED);
2342 map[this_jobs++] = td;
2345 fd = calloc(1, sizeof(*fd));
2347 fd->sk_out = sk_out;
2349 if (td->o.use_thread) {
2352 dprint(FD_PROCESS, "will pthread_create\n");
2353 ret = pthread_create(&td->thread, NULL,
2356 log_err("pthread_create: %s\n",
2363 ret = pthread_detach(td->thread);
2365 log_err("pthread_detach: %s",
2369 dprint(FD_PROCESS, "will fork\n");
2374 ret = (int)(uintptr_t)thread_main(fd);
2376 } else if (i == fio_debug_jobno)
2377 *fio_debug_jobp = pid;
2379 dprint(FD_MUTEX, "wait on startup_sem\n");
2380 if (fio_sem_down_timeout(startup_sem, 10000)) {
2381 log_err("fio: job startup hung? exiting.\n");
2382 fio_terminate_threads(TERMINATE_ALL, TERMINATE_ALL);
2388 dprint(FD_MUTEX, "done waiting on startup_sem\n");
2392 * Wait for the started threads to transition to
2395 fio_gettime(&this_start, NULL);
2397 while (left && !fio_abort) {
2398 if (mtime_since_now(&this_start) > JOB_START_TIMEOUT)
2403 for (i = 0; i < this_jobs; i++) {
2407 if (td->runstate == TD_INITIALIZED) {
2410 } else if (td->runstate >= TD_EXITED) {
2414 nr_running++; /* work-around... */
2420 log_err("fio: %d job%s failed to start\n", left,
2421 left > 1 ? "s" : "");
2422 for (i = 0; i < this_jobs; i++) {
2426 kill(td->pid, SIGTERM);
2432 * start created threads (TD_INITIALIZED -> TD_RUNNING).
2434 for_each_td(td, i) {
2435 if (td->runstate != TD_INITIALIZED)
2438 if (in_ramp_time(td))
2439 td_set_runstate(td, TD_RAMP);
2441 td_set_runstate(td, TD_RUNNING);
2444 m_rate += ddir_rw_sum(td->o.ratemin);
2445 t_rate += ddir_rw_sum(td->o.rate);
2447 fio_sem_up(td->sem);
2450 reap_threads(&nr_running, &t_rate, &m_rate);
2456 while (nr_running) {
2457 reap_threads(&nr_running, &t_rate, &m_rate);
2461 fio_idle_prof_stop();
2466 static void free_disk_util(void)
2468 disk_util_prune_entries();
2469 helper_thread_destroy();
2472 int fio_backend(struct sk_out *sk_out)
2474 struct thread_data *td;
2478 if (load_profile(exec_profile))
2481 exec_profile = NULL;
2487 struct log_params p = {
2488 .log_type = IO_LOG_TYPE_BW,
2491 setup_log(&agg_io_log[DDIR_READ], &p, "agg-read_bw.log");
2492 setup_log(&agg_io_log[DDIR_WRITE], &p, "agg-write_bw.log");
2493 setup_log(&agg_io_log[DDIR_TRIM], &p, "agg-trim_bw.log");
2496 startup_sem = fio_sem_init(FIO_SEM_LOCKED);
2498 is_local_backend = true;
2499 if (startup_sem == NULL)
2504 if (helper_thread_create(startup_sem, sk_out))
2505 log_err("fio: failed to create helper thread\n");
2507 cgroup_list = smalloc(sizeof(*cgroup_list));
2509 INIT_FLIST_HEAD(cgroup_list);
2511 run_threads(sk_out);
2513 helper_thread_exit();
2518 for (i = 0; i < DDIR_RWDIR_CNT; i++) {
2519 struct io_log *log = agg_io_log[i];
2521 flush_log(log, false);
2527 for_each_td(td, i) {
2528 steadystate_free(td);
2529 fio_options_free(td);
2530 if (td->rusage_sem) {
2531 fio_sem_remove(td->rusage_sem);
2532 td->rusage_sem = NULL;
2534 fio_sem_remove(td->sem);
2540 cgroup_kill(cgroup_list);
2544 fio_sem_remove(startup_sem);