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);
94 static void sig_break(int sig)
96 struct thread_data *td;
102 * Windows terminates all job processes on SIGBREAK after the handler
103 * returns, so give them time to wrap-up and give stats
106 while (td->runstate < TD_EXITED)
112 void sig_show_status(int sig)
114 show_running_run_stats();
117 static void set_sig_handlers(void)
119 struct sigaction act;
121 memset(&act, 0, sizeof(act));
122 act.sa_handler = sig_int;
123 act.sa_flags = SA_RESTART;
124 sigaction(SIGINT, &act, NULL);
126 memset(&act, 0, sizeof(act));
127 act.sa_handler = sig_int;
128 act.sa_flags = SA_RESTART;
129 sigaction(SIGTERM, &act, NULL);
131 /* Windows uses SIGBREAK as a quit signal from other applications */
133 memset(&act, 0, sizeof(act));
134 act.sa_handler = sig_break;
135 act.sa_flags = SA_RESTART;
136 sigaction(SIGBREAK, &act, NULL);
139 memset(&act, 0, sizeof(act));
140 act.sa_handler = sig_show_status;
141 act.sa_flags = SA_RESTART;
142 sigaction(SIGUSR1, &act, NULL);
145 memset(&act, 0, sizeof(act));
146 act.sa_handler = sig_int;
147 act.sa_flags = SA_RESTART;
148 sigaction(SIGPIPE, &act, NULL);
153 * Check if we are above the minimum rate given.
155 static bool __check_min_rate(struct thread_data *td, struct timespec *now,
158 unsigned long long current_rate_check_bytes = td->this_io_bytes[ddir];
159 unsigned long current_rate_check_blocks = td->this_io_blocks[ddir];
160 unsigned long long option_rate_bytes_min = td->o.ratemin[ddir];
161 unsigned int option_rate_iops_min = td->o.rate_iops_min[ddir];
163 assert(ddir_rw(ddir));
165 if (!td->o.ratemin[ddir] && !td->o.rate_iops_min[ddir])
169 * allow a 2 second settle period in the beginning
171 if (mtime_since(&td->start, now) < 2000)
175 * if last_rate_check_blocks or last_rate_check_bytes is set,
176 * we can compute a rate per ratecycle
178 if (td->last_rate_check_bytes[ddir] || td->last_rate_check_blocks[ddir]) {
179 unsigned long spent = mtime_since(&td->last_rate_check_time[ddir], now);
180 if (spent < td->o.ratecycle || spent==0)
183 if (td->o.ratemin[ddir]) {
185 * check bandwidth specified rate
187 unsigned long long current_rate_bytes =
188 ((current_rate_check_bytes - td->last_rate_check_bytes[ddir]) * 1000) / spent;
189 if (current_rate_bytes < option_rate_bytes_min) {
190 log_err("%s: rate_min=%lluB/s not met, got %lluB/s\n",
191 td->o.name, option_rate_bytes_min, current_rate_bytes);
196 * checks iops specified rate
198 unsigned long long current_rate_iops =
199 ((current_rate_check_blocks - td->last_rate_check_blocks[ddir]) * 1000) / spent;
201 if (current_rate_iops < option_rate_iops_min) {
202 log_err("%s: rate_iops_min=%u not met, got %llu IOPS\n",
203 td->o.name, option_rate_iops_min, current_rate_iops);
209 td->last_rate_check_bytes[ddir] = current_rate_check_bytes;
210 td->last_rate_check_blocks[ddir] = current_rate_check_blocks;
211 memcpy(&td->last_rate_check_time[ddir], now, sizeof(*now));
215 static bool check_min_rate(struct thread_data *td, struct timespec *now)
219 for_each_rw_ddir(ddir) {
220 if (td->bytes_done[ddir])
221 ret |= __check_min_rate(td, now, ddir);
228 * When job exits, we can cancel the in-flight IO if we are using async
229 * io. Attempt to do so.
231 static void cleanup_pending_aio(struct thread_data *td)
236 * get immediately available events, if any
238 r = io_u_queued_complete(td, 0);
241 * now cancel remaining active events
243 if (td->io_ops->cancel) {
247 io_u_qiter(&td->io_u_all, io_u, i) {
248 if (io_u->flags & IO_U_F_FLIGHT) {
249 r = td->io_ops->cancel(td, io_u);
257 r = io_u_queued_complete(td, td->cur_depth);
261 * Helper to handle the final sync of a file. Works just like the normal
262 * io path, just does everything sync.
264 static bool fio_io_sync(struct thread_data *td, struct fio_file *f)
266 struct io_u *io_u = __get_io_u(td);
267 enum fio_q_status ret;
272 io_u->ddir = DDIR_SYNC;
274 io_u_set(td, io_u, IO_U_F_NO_FILE_PUT);
276 if (td_io_prep(td, io_u)) {
282 ret = td_io_queue(td, io_u);
286 if (io_u_queued_complete(td, 1) < 0)
289 case FIO_Q_COMPLETED:
291 td_verror(td, io_u->error, "td_io_queue");
295 if (io_u_sync_complete(td, io_u) < 0)
306 static int fio_file_fsync(struct thread_data *td, struct fio_file *f)
310 if (fio_file_open(f))
311 return fio_io_sync(td, f);
313 if (td_io_open_file(td, f))
316 ret = fio_io_sync(td, f);
318 if (fio_file_open(f))
319 ret2 = td_io_close_file(td, f);
320 return (ret || ret2);
323 static inline void __update_ts_cache(struct thread_data *td)
325 fio_gettime(&td->ts_cache, NULL);
328 static inline void update_ts_cache(struct thread_data *td)
330 if ((++td->ts_cache_nr & td->ts_cache_mask) == td->ts_cache_mask)
331 __update_ts_cache(td);
334 static inline bool runtime_exceeded(struct thread_data *td, struct timespec *t)
336 if (in_ramp_time(td))
340 if (utime_since(&td->epoch, t) >= td->o.timeout)
347 * We need to update the runtime consistently in ms, but keep a running
348 * tally of the current elapsed time in microseconds for sub millisecond
351 static inline void update_runtime(struct thread_data *td,
352 unsigned long long *elapsed_us,
353 const enum fio_ddir ddir)
355 if (ddir == DDIR_WRITE && td_write(td) && td->o.verify_only)
358 td->ts.runtime[ddir] -= (elapsed_us[ddir] + 999) / 1000;
359 elapsed_us[ddir] += utime_since_now(&td->start);
360 td->ts.runtime[ddir] += (elapsed_us[ddir] + 999) / 1000;
363 static bool break_on_this_error(struct thread_data *td, enum fio_ddir ddir,
368 if (ret < 0 || td->error) {
370 enum error_type_bit eb;
375 eb = td_error_type(ddir, err);
376 if (!(td->o.continue_on_error & (1 << eb)))
379 if (td_non_fatal_error(td, eb, err)) {
381 * Continue with the I/Os in case of
384 update_error_count(td, err);
388 } else if (td->o.fill_device && (err == ENOSPC || err == EDQUOT)) {
390 * We expect to hit this error if
391 * fill_device option is set.
394 fio_mark_td_terminate(td);
398 * Stop the I/O in case of a fatal
401 update_error_count(td, err);
409 static void check_update_rusage(struct thread_data *td)
411 if (td->update_rusage) {
412 td->update_rusage = 0;
413 update_rusage_stat(td);
414 fio_sem_up(td->rusage_sem);
418 static int wait_for_completions(struct thread_data *td, struct timespec *time)
420 const int full = queue_full(td);
424 if (td->flags & TD_F_REGROW_LOGS)
425 return io_u_quiesce(td);
428 * if the queue is full, we MUST reap at least 1 event
430 min_evts = min(td->o.iodepth_batch_complete_min, td->cur_depth);
431 if ((full && !min_evts) || !td->o.iodepth_batch_complete_min)
434 if (time && should_check_rate(td))
435 fio_gettime(time, NULL);
438 ret = io_u_queued_complete(td, min_evts);
441 } while (full && (td->cur_depth > td->o.iodepth_low));
446 int io_queue_event(struct thread_data *td, struct io_u *io_u, int *ret,
447 enum fio_ddir ddir, uint64_t *bytes_issued, int from_verify,
448 struct timespec *comp_time)
451 case FIO_Q_COMPLETED:
454 clear_io_u(td, io_u);
455 } else if (io_u->resid) {
456 long long bytes = io_u->xfer_buflen - io_u->resid;
457 struct fio_file *f = io_u->file;
460 *bytes_issued += bytes;
470 unlog_io_piece(td, io_u);
471 td_verror(td, EIO, "full resid");
476 io_u->xfer_buflen = io_u->resid;
477 io_u->xfer_buf += bytes;
478 io_u->offset += bytes;
480 if (ddir_rw(io_u->ddir))
481 td->ts.short_io_u[io_u->ddir]++;
483 if (io_u->offset == f->real_file_size)
486 requeue_io_u(td, &io_u);
489 if (comp_time && should_check_rate(td))
490 fio_gettime(comp_time, NULL);
492 *ret = io_u_sync_complete(td, io_u);
497 if (td->flags & TD_F_REGROW_LOGS)
501 * when doing I/O (not when verifying),
502 * check for any errors that are to be ignored
510 * if the engine doesn't have a commit hook,
511 * the io_u is really queued. if it does have such
512 * a hook, it has to call io_u_queued() itself.
514 if (td->io_ops->commit == NULL)
515 io_u_queued(td, io_u);
517 *bytes_issued += io_u->xfer_buflen;
521 unlog_io_piece(td, io_u);
522 requeue_io_u(td, &io_u);
527 td_verror(td, -(*ret), "td_io_queue");
531 if (break_on_this_error(td, ddir, ret))
537 static inline bool io_in_polling(struct thread_data *td)
539 return !td->o.iodepth_batch_complete_min &&
540 !td->o.iodepth_batch_complete_max;
543 * Unlinks files from thread data fio_file structure
545 static int unlink_all_files(struct thread_data *td)
551 for_each_file(td, f, i) {
552 if (f->filetype != FIO_TYPE_FILE)
554 ret = td_io_unlink_file(td, f);
560 td_verror(td, ret, "unlink_all_files");
566 * Check if io_u will overlap an in-flight IO in the queue
568 bool in_flight_overlap(struct io_u_queue *q, struct io_u *io_u)
571 struct io_u *check_io_u;
572 unsigned long long x1, x2, y1, y2;
576 x2 = io_u->offset + io_u->buflen;
578 io_u_qiter(q, check_io_u, i) {
579 if (check_io_u->flags & IO_U_F_FLIGHT) {
580 y1 = check_io_u->offset;
581 y2 = check_io_u->offset + check_io_u->buflen;
583 if (x1 < y2 && y1 < x2) {
585 dprint(FD_IO, "in-flight overlap: %llu/%llu, %llu/%llu\n",
587 y1, check_io_u->buflen);
596 static enum fio_q_status io_u_submit(struct thread_data *td, struct io_u *io_u)
599 * Check for overlap if the user asked us to, and we have
600 * at least one IO in flight besides this one.
602 if (td->o.serialize_overlap && td->cur_depth > 1 &&
603 in_flight_overlap(&td->io_u_all, io_u))
606 return td_io_queue(td, io_u);
610 * The main verify engine. Runs over the writes we previously submitted,
611 * reads the blocks back in, and checks the crc/md5 of the data.
613 static void do_verify(struct thread_data *td, uint64_t verify_bytes)
620 dprint(FD_VERIFY, "starting loop\n");
623 * sync io first and invalidate cache, to make sure we really
626 for_each_file(td, f, i) {
627 if (!fio_file_open(f))
629 if (fio_io_sync(td, f))
631 if (file_invalidate_cache(td, f))
635 check_update_rusage(td);
641 * verify_state needs to be reset before verification
642 * proceeds so that expected random seeds match actual
643 * random seeds in headers. The main loop will reset
644 * all random number generators if randrepeat is set.
646 if (!td->o.rand_repeatable)
647 td_fill_verify_state_seed(td);
649 td_set_runstate(td, TD_VERIFYING);
652 while (!td->terminate) {
657 check_update_rusage(td);
659 if (runtime_exceeded(td, &td->ts_cache)) {
660 __update_ts_cache(td);
661 if (runtime_exceeded(td, &td->ts_cache)) {
662 fio_mark_td_terminate(td);
667 if (flow_threshold_exceeded(td))
670 if (!td->o.experimental_verify) {
671 io_u = __get_io_u(td);
675 if (get_next_verify(td, io_u)) {
680 if (td_io_prep(td, io_u)) {
685 if (td->bytes_verified + td->o.rw_min_bs > verify_bytes)
688 while ((io_u = get_io_u(td)) != NULL) {
689 if (IS_ERR_OR_NULL(io_u)) {
696 * We are only interested in the places where
697 * we wrote or trimmed IOs. Turn those into
698 * reads for verification purposes.
700 if (io_u->ddir == DDIR_READ) {
702 * Pretend we issued it for rwmix
705 td->io_issues[DDIR_READ]++;
708 } else if (io_u->ddir == DDIR_TRIM) {
709 io_u->ddir = DDIR_READ;
710 io_u_set(td, io_u, IO_U_F_TRIMMED);
712 } else if (io_u->ddir == DDIR_WRITE) {
713 io_u->ddir = DDIR_READ;
714 io_u->numberio = td->verify_read_issues;
715 td->verify_read_issues++;
716 populate_verify_io_u(td, io_u);
728 if (verify_state_should_stop(td, io_u)) {
733 if (td->o.verify_async)
734 io_u->end_io = verify_io_u_async;
736 io_u->end_io = verify_io_u;
739 if (!td->o.disable_slat)
740 fio_gettime(&io_u->start_time, NULL);
742 ret = io_u_submit(td, io_u);
744 if (io_queue_event(td, io_u, &ret, ddir, NULL, 1, NULL))
748 * if we can queue more, do so. but check if there are
749 * completed io_u's first. Note that we can get BUSY even
750 * without IO queued, if the system is resource starved.
753 full = queue_full(td) || (ret == FIO_Q_BUSY && td->cur_depth);
754 if (full || io_in_polling(td))
755 ret = wait_for_completions(td, NULL);
761 check_update_rusage(td);
764 min_events = td->cur_depth;
767 ret = io_u_queued_complete(td, min_events);
769 cleanup_pending_aio(td);
771 td_set_runstate(td, TD_RUNNING);
773 dprint(FD_VERIFY, "exiting loop\n");
776 static bool exceeds_number_ios(struct thread_data *td)
778 unsigned long long number_ios;
780 if (!td->o.number_ios)
783 number_ios = ddir_rw_sum(td->io_blocks);
784 number_ios += td->io_u_queued + td->io_u_in_flight;
786 return number_ios >= (td->o.number_ios * td->loops);
789 static bool io_bytes_exceeded(struct thread_data *td, uint64_t *this_bytes)
791 unsigned long long bytes, limit;
794 bytes = this_bytes[DDIR_READ] + this_bytes[DDIR_WRITE];
795 else if (td_write(td))
796 bytes = this_bytes[DDIR_WRITE];
797 else if (td_read(td))
798 bytes = this_bytes[DDIR_READ];
800 bytes = this_bytes[DDIR_TRIM];
803 limit = td->o.io_size;
808 return bytes >= limit || exceeds_number_ios(td);
811 static bool io_issue_bytes_exceeded(struct thread_data *td)
813 return io_bytes_exceeded(td, td->io_issue_bytes);
816 static bool io_complete_bytes_exceeded(struct thread_data *td)
818 return io_bytes_exceeded(td, td->this_io_bytes);
822 * used to calculate the next io time for rate control
825 static long long usec_for_io(struct thread_data *td, enum fio_ddir ddir)
827 uint64_t bps = td->rate_bps[ddir];
829 assert(!(td->flags & TD_F_CHILD));
831 if (td->o.rate_process == RATE_PROCESS_POISSON) {
834 iops = bps / td->o.min_bs[ddir];
835 val = (int64_t) (1000000 / iops) *
836 -logf(__rand_0_1(&td->poisson_state[ddir]));
838 dprint(FD_RATE, "poisson rate iops=%llu, ddir=%d\n",
839 (unsigned long long) 1000000 / val,
842 td->last_usec[ddir] += val;
843 return td->last_usec[ddir];
845 uint64_t bytes = td->rate_io_issue_bytes[ddir];
846 uint64_t secs = bytes / bps;
847 uint64_t remainder = bytes % bps;
849 return remainder * 1000000 / bps + secs * 1000000;
855 static void init_thinktime(struct thread_data *td)
857 if (td->o.thinktime_blocks_type == THINKTIME_BLOCKS_TYPE_COMPLETE)
858 td->thinktime_blocks_counter = td->io_blocks;
860 td->thinktime_blocks_counter = td->io_issues;
861 td->last_thinktime = td->epoch;
862 td->last_thinktime_blocks = 0;
865 static void handle_thinktime(struct thread_data *td, enum fio_ddir ddir,
866 struct timespec *time)
868 unsigned long long b;
874 if (td->o.thinktime_iotime) {
875 fio_gettime(&now, NULL);
876 if (utime_since(&td->last_thinktime, &now)
877 >= td->o.thinktime_iotime + td->o.thinktime) {
879 } else if (!fio_option_is_set(&td->o, thinktime_blocks)) {
881 * When thinktime_iotime is set and thinktime_blocks is
882 * not set, skip the thinktime_blocks check, since
883 * thinktime_blocks default value 1 does not work
884 * together with thinktime_iotime.
891 b = ddir_rw_sum(td->thinktime_blocks_counter);
892 if (b >= td->last_thinktime_blocks + td->o.thinktime_blocks)
901 if (td->o.thinktime_spin)
902 total = usec_spin(td->o.thinktime_spin);
904 left = td->o.thinktime - total;
906 total += usec_sleep(td, left);
909 * If we're ignoring thinktime for the rate, add the number of bytes
910 * we would have done while sleeping, minus one block to ensure we
911 * start issuing immediately after the sleep.
913 if (total && td->rate_bps[ddir] && td->o.rate_ign_think) {
914 uint64_t missed = (td->rate_bps[ddir] * total) / 1000000ULL;
915 uint64_t bs = td->o.min_bs[ddir];
916 uint64_t usperop = bs * 1000000ULL / td->rate_bps[ddir];
919 if (usperop <= total)
922 over = (usperop - total) / usperop * -bs;
924 td->rate_io_issue_bytes[ddir] += (missed - over);
925 /* adjust for rate_process=poisson */
926 td->last_usec[ddir] += total;
929 if (time && should_check_rate(td))
930 fio_gettime(time, NULL);
932 td->last_thinktime_blocks = b;
933 if (td->o.thinktime_iotime)
934 td->last_thinktime = now;
938 * Main IO worker function. It retrieves io_u's to process and queues
939 * and reaps them, checking for rate and errors along the way.
941 * Returns number of bytes written and trimmed.
943 static void do_io(struct thread_data *td, uint64_t *bytes_done)
947 uint64_t total_bytes, bytes_issued = 0;
949 for (i = 0; i < DDIR_RWDIR_CNT; i++)
950 bytes_done[i] = td->bytes_done[i];
952 if (in_ramp_time(td))
953 td_set_runstate(td, TD_RAMP);
955 td_set_runstate(td, TD_RUNNING);
959 total_bytes = td->o.size;
961 * Allow random overwrite workloads to write up to io_size
962 * before starting verification phase as 'size' doesn't apply.
964 if (td_write(td) && td_random(td) && td->o.norandommap)
965 total_bytes = max(total_bytes, (uint64_t) td->o.io_size);
967 * If verify_backlog is enabled, we'll run the verify in this
968 * handler as well. For that case, we may need up to twice the
971 if (td->o.verify != VERIFY_NONE &&
972 (td_write(td) && td->o.verify_backlog))
973 total_bytes += td->o.size;
975 /* In trimwrite mode, each byte is trimmed and then written, so
976 * allow total_bytes or number of ios to be twice as big */
977 if (td_trimwrite(td)) {
978 total_bytes += td->total_io_size;
979 td->o.number_ios *= 2;
982 while ((td->o.read_iolog_file && !flist_empty(&td->io_log_list)) ||
983 (!flist_empty(&td->trim_list)) || !io_issue_bytes_exceeded(td) ||
985 struct timespec comp_time;
990 check_update_rusage(td);
992 if (td->terminate || td->done)
997 if (runtime_exceeded(td, &td->ts_cache)) {
998 __update_ts_cache(td);
999 if (runtime_exceeded(td, &td->ts_cache)) {
1000 fio_mark_td_terminate(td);
1005 if (flow_threshold_exceeded(td))
1009 * Break if we exceeded the bytes. The exception is time
1010 * based runs, but we still need to break out of the loop
1011 * for those to run verification, if enabled.
1012 * Jobs read from iolog do not use this stop condition.
1014 if (bytes_issued >= total_bytes &&
1015 !td->o.read_iolog_file &&
1016 (!td->o.time_based ||
1017 (td->o.time_based && td->o.verify != VERIFY_NONE)))
1020 io_u = get_io_u(td);
1021 if (IS_ERR_OR_NULL(io_u)) {
1022 int err = PTR_ERR(io_u);
1026 if (err == -EBUSY) {
1030 if (td->o.latency_target)
1035 if (io_u->ddir == DDIR_WRITE && td->flags & TD_F_DO_VERIFY) {
1036 io_u->numberio = td->io_issues[io_u->ddir];
1037 populate_verify_io_u(td, io_u);
1043 * Add verification end_io handler if:
1044 * - Asked to verify (!td_rw(td))
1045 * - Or the io_u is from our verify list (mixed write/ver)
1047 if (td->o.verify != VERIFY_NONE && io_u->ddir == DDIR_READ &&
1048 ((io_u->flags & IO_U_F_VER_LIST) || !td_rw(td))) {
1050 if (verify_state_should_stop(td, io_u)) {
1055 if (td->o.verify_async)
1056 io_u->end_io = verify_io_u_async;
1058 io_u->end_io = verify_io_u;
1059 td_set_runstate(td, TD_VERIFYING);
1060 } else if (in_ramp_time(td))
1061 td_set_runstate(td, TD_RAMP);
1063 td_set_runstate(td, TD_RUNNING);
1066 * Always log IO before it's issued, so we know the specific
1067 * order of it. The logged unit will track when the IO has
1070 if (td_write(td) && io_u->ddir == DDIR_WRITE &&
1072 td->o.verify != VERIFY_NONE &&
1073 !td->o.experimental_verify)
1074 log_io_piece(td, io_u);
1076 if (td->o.io_submit_mode == IO_MODE_OFFLOAD) {
1077 const unsigned long long blen = io_u->xfer_buflen;
1078 const enum fio_ddir __ddir = acct_ddir(io_u);
1083 workqueue_enqueue(&td->io_wq, &io_u->work);
1086 if (ddir_rw(__ddir)) {
1087 td->io_issues[__ddir]++;
1088 td->io_issue_bytes[__ddir] += blen;
1089 td->rate_io_issue_bytes[__ddir] += blen;
1092 if (should_check_rate(td)) {
1093 td->rate_next_io_time[__ddir] = usec_for_io(td, __ddir);
1094 fio_gettime(&comp_time, NULL);
1098 ret = io_u_submit(td, io_u);
1100 if (should_check_rate(td))
1101 td->rate_next_io_time[ddir] = usec_for_io(td, ddir);
1103 if (io_queue_event(td, io_u, &ret, ddir, &bytes_issued, 0, &comp_time))
1107 * See if we need to complete some commands. Note that
1108 * we can get BUSY even without IO queued, if the
1109 * system is resource starved.
1112 full = queue_full(td) ||
1113 (ret == FIO_Q_BUSY && td->cur_depth);
1114 if (full || io_in_polling(td))
1115 ret = wait_for_completions(td, &comp_time);
1120 if (ddir_rw(ddir) && td->o.thinktime)
1121 handle_thinktime(td, ddir, &comp_time);
1123 if (!ddir_rw_sum(td->bytes_done) &&
1124 !td_ioengine_flagged(td, FIO_NOIO))
1127 if (!in_ramp_time(td) && should_check_rate(td)) {
1128 if (check_min_rate(td, &comp_time)) {
1129 if (exitall_on_terminate || td->o.exitall_error)
1130 fio_terminate_threads(td->groupid, td->o.exit_what);
1131 td_verror(td, EIO, "check_min_rate");
1135 if (!in_ramp_time(td) && td->o.latency_target)
1136 lat_target_check(td);
1139 check_update_rusage(td);
1141 if (td->trim_entries)
1142 log_err("fio: %lu trim entries leaked?\n", td->trim_entries);
1144 if (td->o.fill_device && (td->error == ENOSPC || td->error == EDQUOT)) {
1146 fio_mark_td_terminate(td);
1151 if (td->o.io_submit_mode == IO_MODE_OFFLOAD) {
1152 workqueue_flush(&td->io_wq);
1158 ret = io_u_queued_complete(td, i);
1159 if (td->o.fill_device &&
1160 (td->error == ENOSPC || td->error == EDQUOT))
1164 if (should_fsync(td) && (td->o.end_fsync || td->o.fsync_on_close)) {
1165 td_set_runstate(td, TD_FSYNCING);
1167 for_each_file(td, f, i) {
1168 if (!fio_file_fsync(td, f))
1171 log_err("fio: end_fsync failed for file %s\n",
1176 if (td->o.io_submit_mode == IO_MODE_OFFLOAD)
1177 workqueue_flush(&td->io_wq);
1178 cleanup_pending_aio(td);
1182 * stop job if we failed doing any IO
1184 if (!ddir_rw_sum(td->this_io_bytes))
1187 for (i = 0; i < DDIR_RWDIR_CNT; i++)
1188 bytes_done[i] = td->bytes_done[i] - bytes_done[i];
1191 static void free_file_completion_logging(struct thread_data *td)
1196 for_each_file(td, f, i) {
1197 if (!f->last_write_comp)
1199 sfree(f->last_write_comp);
1203 static int init_file_completion_logging(struct thread_data *td,
1209 if (td->o.verify == VERIFY_NONE || !td->o.verify_state_save)
1212 for_each_file(td, f, i) {
1213 f->last_write_comp = scalloc(depth, sizeof(uint64_t));
1214 if (!f->last_write_comp)
1221 free_file_completion_logging(td);
1222 log_err("fio: failed to alloc write comp data\n");
1226 static void cleanup_io_u(struct thread_data *td)
1230 while ((io_u = io_u_qpop(&td->io_u_freelist)) != NULL) {
1232 if (td->io_ops->io_u_free)
1233 td->io_ops->io_u_free(td, io_u);
1235 fio_memfree(io_u, sizeof(*io_u), td_offload_overlap(td));
1240 io_u_rexit(&td->io_u_requeues);
1241 io_u_qexit(&td->io_u_freelist, false);
1242 io_u_qexit(&td->io_u_all, td_offload_overlap(td));
1244 free_file_completion_logging(td);
1247 static int init_io_u(struct thread_data *td)
1250 int cl_align, i, max_units;
1253 max_units = td->o.iodepth;
1256 err += !io_u_rinit(&td->io_u_requeues, td->o.iodepth);
1257 err += !io_u_qinit(&td->io_u_freelist, td->o.iodepth, false);
1258 err += !io_u_qinit(&td->io_u_all, td->o.iodepth, td_offload_overlap(td));
1261 log_err("fio: failed setting up IO queues\n");
1265 cl_align = os_cache_line_size();
1267 for (i = 0; i < max_units; i++) {
1273 ptr = fio_memalign(cl_align, sizeof(*io_u), td_offload_overlap(td));
1275 log_err("fio: unable to allocate aligned memory\n");
1280 memset(io_u, 0, sizeof(*io_u));
1281 INIT_FLIST_HEAD(&io_u->verify_list);
1282 dprint(FD_MEM, "io_u alloc %p, index %u\n", io_u, i);
1285 io_u->flags = IO_U_F_FREE;
1286 io_u_qpush(&td->io_u_freelist, io_u);
1289 * io_u never leaves this stack, used for iteration of all
1292 io_u_qpush(&td->io_u_all, io_u);
1294 if (td->io_ops->io_u_init) {
1295 int ret = td->io_ops->io_u_init(td, io_u);
1298 log_err("fio: failed to init engine data: %d\n", ret);
1304 init_io_u_buffers(td);
1306 if (init_file_completion_logging(td, max_units))
1312 int init_io_u_buffers(struct thread_data *td)
1315 unsigned long long max_bs, min_write;
1320 max_units = td->o.iodepth;
1321 max_bs = td_max_bs(td);
1322 min_write = td->o.min_bs[DDIR_WRITE];
1323 td->orig_buffer_size = (unsigned long long) max_bs
1324 * (unsigned long long) max_units;
1326 if (td_ioengine_flagged(td, FIO_NOIO) || !(td_read(td) || td_write(td)))
1330 * if we may later need to do address alignment, then add any
1331 * possible adjustment here so that we don't cause a buffer
1332 * overflow later. this adjustment may be too much if we get
1333 * lucky and the allocator gives us an aligned address.
1335 if (td->o.odirect || td->o.mem_align || td->o.oatomic ||
1336 td_ioengine_flagged(td, FIO_RAWIO))
1337 td->orig_buffer_size += page_mask + td->o.mem_align;
1339 if (td->o.mem_type == MEM_SHMHUGE || td->o.mem_type == MEM_MMAPHUGE) {
1340 unsigned long long bs;
1342 bs = td->orig_buffer_size + td->o.hugepage_size - 1;
1343 td->orig_buffer_size = bs & ~(td->o.hugepage_size - 1);
1346 if (td->orig_buffer_size != (size_t) td->orig_buffer_size) {
1347 log_err("fio: IO memory too large. Reduce max_bs or iodepth\n");
1351 if (data_xfer && allocate_io_mem(td))
1354 if (td->o.odirect || td->o.mem_align || td->o.oatomic ||
1355 td_ioengine_flagged(td, FIO_RAWIO))
1356 p = PTR_ALIGN(td->orig_buffer, page_mask) + td->o.mem_align;
1358 p = td->orig_buffer;
1360 for (i = 0; i < max_units; i++) {
1361 io_u = td->io_u_all.io_us[i];
1362 dprint(FD_MEM, "io_u alloc %p, index %u\n", io_u, i);
1366 dprint(FD_MEM, "io_u %p, mem %p\n", io_u, io_u->buf);
1369 io_u_fill_buffer(td, io_u, min_write, max_bs);
1370 if (td_write(td) && td->o.verify_pattern_bytes) {
1372 * Fill the buffer with the pattern if we are
1373 * going to be doing writes.
1375 fill_verify_pattern(td, io_u->buf, max_bs, io_u, 0, 0);
1384 #ifdef FIO_HAVE_IOSCHED_SWITCH
1386 * These functions are Linux specific.
1387 * FIO_HAVE_IOSCHED_SWITCH enabled currently means it's Linux.
1389 static int set_ioscheduler(struct thread_data *td, struct fio_file *file)
1391 char tmp[256], tmp2[128], *p;
1395 assert(file->du && file->du->sysfs_root);
1396 sprintf(tmp, "%s/queue/scheduler", file->du->sysfs_root);
1398 f = fopen(tmp, "r+");
1400 if (errno == ENOENT) {
1401 log_err("fio: os or kernel doesn't support IO scheduler"
1405 td_verror(td, errno, "fopen iosched");
1412 ret = fwrite(td->o.ioscheduler, strlen(td->o.ioscheduler), 1, f);
1413 if (ferror(f) || ret != 1) {
1414 td_verror(td, errno, "fwrite");
1422 * Read back and check that the selected scheduler is now the default.
1424 ret = fread(tmp, 1, sizeof(tmp) - 1, f);
1425 if (ferror(f) || ret < 0) {
1426 td_verror(td, errno, "fread");
1432 * either a list of io schedulers or "none\n" is expected. Strip the
1439 * Write to "none" entry doesn't fail, so check the result here.
1441 if (!strcmp(tmp, "none")) {
1442 log_err("fio: io scheduler is not tunable\n");
1447 sprintf(tmp2, "[%s]", td->o.ioscheduler);
1448 if (!strstr(tmp, tmp2)) {
1449 log_err("fio: unable to set io scheduler to %s\n", td->o.ioscheduler);
1450 td_verror(td, EINVAL, "iosched_switch");
1459 static int switch_ioscheduler(struct thread_data *td)
1465 if (td_ioengine_flagged(td, FIO_DISKLESSIO))
1468 assert(td->files && td->files[0]);
1470 for_each_file(td, f, i) {
1472 /* Only consider regular files and block device files */
1473 switch (f->filetype) {
1475 case FIO_TYPE_BLOCK:
1477 * Make sure that the device hosting the file could
1489 ret = set_ioscheduler(td, f);
1499 static int switch_ioscheduler(struct thread_data *td)
1504 #endif /* FIO_HAVE_IOSCHED_SWITCH */
1506 static bool keep_running(struct thread_data *td)
1508 unsigned long long limit;
1514 if (td->o.time_based)
1520 if (exceeds_number_ios(td))
1524 limit = td->o.io_size;
1528 if (limit != -1ULL && ddir_rw_sum(td->io_bytes) < limit) {
1532 * If the difference is less than the maximum IO size, we
1535 diff = limit - ddir_rw_sum(td->io_bytes);
1536 if (diff < td_max_bs(td))
1539 if (fio_files_done(td) && !td->o.io_size)
1548 static int exec_string(struct thread_options *o, const char *string,
1554 if (asprintf(&str, "%s > %s.%s.txt 2>&1", string, o->name, mode) < 0)
1557 log_info("%s : Saving output of %s in %s.%s.txt\n", o->name, mode,
1561 log_err("fio: exec of cmd <%s> failed\n", str);
1568 * Dry run to compute correct state of numberio for verification.
1570 static uint64_t do_dry_run(struct thread_data *td)
1572 td_set_runstate(td, TD_RUNNING);
1574 while ((td->o.read_iolog_file && !flist_empty(&td->io_log_list)) ||
1575 (!flist_empty(&td->trim_list)) || !io_complete_bytes_exceeded(td)) {
1579 if (td->terminate || td->done)
1582 io_u = get_io_u(td);
1583 if (IS_ERR_OR_NULL(io_u))
1586 io_u_set(td, io_u, IO_U_F_FLIGHT);
1589 if (ddir_rw(acct_ddir(io_u)))
1590 td->io_issues[acct_ddir(io_u)]++;
1591 if (ddir_rw(io_u->ddir)) {
1592 io_u_mark_depth(td, 1);
1593 td->ts.total_io_u[io_u->ddir]++;
1596 if (td_write(td) && io_u->ddir == DDIR_WRITE &&
1598 td->o.verify != VERIFY_NONE &&
1599 !td->o.experimental_verify)
1600 log_io_piece(td, io_u);
1602 ret = io_u_sync_complete(td, io_u);
1606 return td->bytes_done[DDIR_WRITE] + td->bytes_done[DDIR_TRIM];
1610 struct thread_data *td;
1611 struct sk_out *sk_out;
1615 * Entry point for the thread based jobs. The process based jobs end up
1616 * here as well, after a little setup.
1618 static void *thread_main(void *data)
1620 struct fork_data *fd = data;
1621 unsigned long long elapsed_us[DDIR_RWDIR_CNT] = { 0, };
1622 struct thread_data *td = fd->td;
1623 struct thread_options *o = &td->o;
1624 struct sk_out *sk_out = fd->sk_out;
1625 uint64_t bytes_done[DDIR_RWDIR_CNT];
1626 int deadlock_loop_cnt;
1630 sk_out_assign(sk_out);
1633 if (!o->use_thread) {
1639 fio_local_clock_init();
1641 dprint(FD_PROCESS, "jobs pid=%d started\n", (int) td->pid);
1644 fio_server_send_start(td);
1646 INIT_FLIST_HEAD(&td->io_log_list);
1647 INIT_FLIST_HEAD(&td->io_hist_list);
1648 INIT_FLIST_HEAD(&td->verify_list);
1649 INIT_FLIST_HEAD(&td->trim_list);
1650 td->io_hist_tree = RB_ROOT;
1652 ret = mutex_cond_init_pshared(&td->io_u_lock, &td->free_cond);
1654 td_verror(td, ret, "mutex_cond_init_pshared");
1657 ret = cond_init_pshared(&td->verify_cond);
1659 td_verror(td, ret, "mutex_cond_pshared");
1663 td_set_runstate(td, TD_INITIALIZED);
1664 dprint(FD_MUTEX, "up startup_sem\n");
1665 fio_sem_up(startup_sem);
1666 dprint(FD_MUTEX, "wait on td->sem\n");
1667 fio_sem_down(td->sem);
1668 dprint(FD_MUTEX, "done waiting on td->sem\n");
1671 * A new gid requires privilege, so we need to do this before setting
1674 if (o->gid != -1U && setgid(o->gid)) {
1675 td_verror(td, errno, "setgid");
1678 if (o->uid != -1U && setuid(o->uid)) {
1679 td_verror(td, errno, "setuid");
1683 td_zone_gen_index(td);
1686 * Do this early, we don't want the compress threads to be limited
1687 * to the same CPUs as the IO workers. So do this before we set
1688 * any potential CPU affinity
1690 if (iolog_compress_init(td, sk_out))
1694 * If we have a gettimeofday() thread, make sure we exclude that
1695 * thread from this job
1698 fio_cpu_clear(&o->cpumask, o->gtod_cpu);
1701 * Set affinity first, in case it has an impact on the memory
1704 if (fio_option_is_set(o, cpumask)) {
1705 if (o->cpus_allowed_policy == FIO_CPUS_SPLIT) {
1706 ret = fio_cpus_split(&o->cpumask, td->thread_number - 1);
1708 log_err("fio: no CPUs set\n");
1709 log_err("fio: Try increasing number of available CPUs\n");
1710 td_verror(td, EINVAL, "cpus_split");
1714 ret = fio_setaffinity(td->pid, o->cpumask);
1716 td_verror(td, errno, "cpu_set_affinity");
1721 #ifdef CONFIG_LIBNUMA
1722 /* numa node setup */
1723 if (fio_option_is_set(o, numa_cpunodes) ||
1724 fio_option_is_set(o, numa_memnodes)) {
1725 struct bitmask *mask;
1727 if (numa_available() < 0) {
1728 td_verror(td, errno, "Does not support NUMA API\n");
1732 if (fio_option_is_set(o, numa_cpunodes)) {
1733 mask = numa_parse_nodestring(o->numa_cpunodes);
1734 ret = numa_run_on_node_mask(mask);
1735 numa_free_nodemask(mask);
1737 td_verror(td, errno, \
1738 "numa_run_on_node_mask failed\n");
1743 if (fio_option_is_set(o, numa_memnodes)) {
1745 if (o->numa_memnodes)
1746 mask = numa_parse_nodestring(o->numa_memnodes);
1748 switch (o->numa_mem_mode) {
1749 case MPOL_INTERLEAVE:
1750 numa_set_interleave_mask(mask);
1753 numa_set_membind(mask);
1756 numa_set_localalloc();
1758 case MPOL_PREFERRED:
1759 numa_set_preferred(o->numa_mem_prefer_node);
1767 numa_free_nodemask(mask);
1773 if (fio_pin_memory(td))
1777 * May alter parameters that init_io_u() will use, so we need to
1780 if (!init_iolog(td))
1783 /* ioprio_set() has to be done before td_io_init() */
1784 if (fio_option_is_set(o, ioprio) ||
1785 fio_option_is_set(o, ioprio_class)) {
1786 ret = ioprio_set(IOPRIO_WHO_PROCESS, 0, o->ioprio_class, o->ioprio);
1788 td_verror(td, errno, "ioprio_set");
1791 td->ioprio = ioprio_value(o->ioprio_class, o->ioprio);
1792 td->ts.ioprio = td->ioprio;
1798 if (td_ioengine_flagged(td, FIO_SYNCIO) && td->o.iodepth > 1) {
1799 log_info("note: both iodepth >= 1 and synchronous I/O engine "
1800 "are selected, queue depth will be capped at 1\n");
1806 if (td->io_ops->post_init && td->io_ops->post_init(td))
1809 if (o->verify_async && verify_async_init(td))
1812 if (o->cgroup && cgroup_setup(td, cgroup_list, &cgroup_mnt))
1816 if (nice(o->nice) == -1 && errno != 0) {
1817 td_verror(td, errno, "nice");
1821 if (o->ioscheduler && switch_ioscheduler(td))
1824 if (!o->create_serialize && setup_files(td))
1827 if (!init_random_map(td))
1830 if (o->exec_prerun && exec_string(o, o->exec_prerun, "prerun"))
1833 if (o->pre_read && !pre_read_files(td))
1836 fio_verify_init(td);
1838 if (rate_submit_init(td, sk_out))
1841 set_epoch_time(td, o->log_unix_epoch | o->log_alternate_epoch, o->log_alternate_epoch_clock_id);
1842 fio_getrusage(&td->ru_start);
1843 memcpy(&td->bw_sample_time, &td->epoch, sizeof(td->epoch));
1844 memcpy(&td->iops_sample_time, &td->epoch, sizeof(td->epoch));
1845 memcpy(&td->ss.prev_time, &td->epoch, sizeof(td->epoch));
1849 if (o->ratemin[DDIR_READ] || o->ratemin[DDIR_WRITE] ||
1850 o->ratemin[DDIR_TRIM]) {
1851 memcpy(&td->last_rate_check_time[DDIR_READ], &td->bw_sample_time,
1852 sizeof(td->bw_sample_time));
1853 memcpy(&td->last_rate_check_time[DDIR_WRITE], &td->bw_sample_time,
1854 sizeof(td->bw_sample_time));
1855 memcpy(&td->last_rate_check_time[DDIR_TRIM], &td->bw_sample_time,
1856 sizeof(td->bw_sample_time));
1859 memset(bytes_done, 0, sizeof(bytes_done));
1860 clear_state = false;
1862 while (keep_running(td)) {
1863 uint64_t verify_bytes;
1865 fio_gettime(&td->start, NULL);
1866 memcpy(&td->ts_cache, &td->start, sizeof(td->start));
1869 clear_io_state(td, 0);
1871 if (o->unlink_each_loop && unlink_all_files(td))
1875 prune_io_piece_log(td);
1877 if (td->o.verify_only && td_write(td))
1878 verify_bytes = do_dry_run(td);
1880 do_io(td, bytes_done);
1882 if (!ddir_rw_sum(bytes_done)) {
1883 fio_mark_td_terminate(td);
1886 verify_bytes = bytes_done[DDIR_WRITE] +
1887 bytes_done[DDIR_TRIM];
1892 * If we took too long to shut down, the main thread could
1893 * already consider us reaped/exited. If that happens, break
1896 if (td->runstate >= TD_EXITED)
1902 * Make sure we've successfully updated the rusage stats
1903 * before waiting on the stat mutex. Otherwise we could have
1904 * the stat thread holding stat mutex and waiting for
1905 * the rusage_sem, which would never get upped because
1906 * this thread is waiting for the stat mutex.
1908 deadlock_loop_cnt = 0;
1910 check_update_rusage(td);
1911 if (!fio_sem_down_trylock(stat_sem))
1914 if (deadlock_loop_cnt++ > 5000) {
1915 log_err("fio seems to be stuck grabbing stat_sem, forcibly exiting\n");
1916 td->error = EDEADLK;
1921 if (td_read(td) && td->io_bytes[DDIR_READ])
1922 update_runtime(td, elapsed_us, DDIR_READ);
1923 if (td_write(td) && td->io_bytes[DDIR_WRITE])
1924 update_runtime(td, elapsed_us, DDIR_WRITE);
1925 if (td_trim(td) && td->io_bytes[DDIR_TRIM])
1926 update_runtime(td, elapsed_us, DDIR_TRIM);
1927 fio_gettime(&td->start, NULL);
1928 fio_sem_up(stat_sem);
1930 if (td->error || td->terminate)
1933 if (!o->do_verify ||
1934 o->verify == VERIFY_NONE ||
1935 td_ioengine_flagged(td, FIO_UNIDIR))
1938 clear_io_state(td, 0);
1940 fio_gettime(&td->start, NULL);
1942 do_verify(td, verify_bytes);
1945 * See comment further up for why this is done here.
1947 check_update_rusage(td);
1949 fio_sem_down(stat_sem);
1950 update_runtime(td, elapsed_us, DDIR_READ);
1951 fio_gettime(&td->start, NULL);
1952 fio_sem_up(stat_sem);
1954 if (td->error || td->terminate)
1959 * Acquire this lock if we were doing overlap checking in
1960 * offload mode so that we don't clean up this job while
1961 * another thread is checking its io_u's for overlap
1963 if (td_offload_overlap(td)) {
1964 int res = pthread_mutex_lock(&overlap_check);
1967 td_set_runstate(td, TD_FINISHING);
1968 if (td_offload_overlap(td)) {
1969 res = pthread_mutex_unlock(&overlap_check);
1973 update_rusage_stat(td);
1974 td->ts.total_run_time = mtime_since_now(&td->epoch);
1975 for_each_rw_ddir(ddir) {
1976 td->ts.io_bytes[ddir] = td->io_bytes[ddir];
1979 if (td->o.verify_state_save && !(td->flags & TD_F_VSTATE_SAVED) &&
1980 (td->o.verify != VERIFY_NONE && td_write(td)))
1981 verify_save_state(td->thread_number);
1983 fio_unpin_memory(td);
1985 td_writeout_logs(td, true);
1987 iolog_compress_exit(td);
1988 rate_submit_exit(td);
1990 if (o->exec_postrun)
1991 exec_string(o, o->exec_postrun, "postrun");
1993 if (exitall_on_terminate || (o->exitall_error && td->error))
1994 fio_terminate_threads(td->groupid, td->o.exit_what);
1998 log_info("fio: pid=%d, err=%d/%s\n", (int) td->pid, td->error,
2001 if (o->verify_async)
2002 verify_async_exit(td);
2004 close_and_free_files(td);
2007 cgroup_shutdown(td, cgroup_mnt);
2008 verify_free_state(td);
2009 td_zone_free_index(td);
2011 if (fio_option_is_set(o, cpumask)) {
2012 ret = fio_cpuset_exit(&o->cpumask);
2014 td_verror(td, ret, "fio_cpuset_exit");
2018 * do this very late, it will log file closing as well
2020 if (o->write_iolog_file)
2021 write_iolog_close(td);
2022 if (td->io_log_rfile)
2023 fclose(td->io_log_rfile);
2025 td_set_runstate(td, TD_EXITED);
2028 * Do this last after setting our runstate to exited, so we
2029 * know that the stat thread is signaled.
2031 check_update_rusage(td);
2034 return (void *) (uintptr_t) td->error;
2038 * Run over the job map and reap the threads that have exited, if any.
2040 static void reap_threads(unsigned int *nr_running, uint64_t *t_rate,
2043 struct thread_data *td;
2044 unsigned int cputhreads, realthreads, pending;
2048 * reap exited threads (TD_EXITED -> TD_REAPED)
2050 realthreads = pending = cputhreads = 0;
2051 for_each_td(td, i) {
2054 if (!strcmp(td->o.ioengine, "cpuio"))
2063 if (td->runstate == TD_REAPED)
2065 if (td->o.use_thread) {
2066 if (td->runstate == TD_EXITED) {
2067 td_set_runstate(td, TD_REAPED);
2074 if (td->runstate == TD_EXITED)
2078 * check if someone quit or got killed in an unusual way
2080 ret = waitpid(td->pid, &status, flags);
2082 if (errno == ECHILD) {
2083 log_err("fio: pid=%d disappeared %d\n",
2084 (int) td->pid, td->runstate);
2086 td_set_runstate(td, TD_REAPED);
2090 } else if (ret == td->pid) {
2091 if (WIFSIGNALED(status)) {
2092 int sig = WTERMSIG(status);
2094 if (sig != SIGTERM && sig != SIGUSR2)
2095 log_err("fio: pid=%d, got signal=%d\n",
2096 (int) td->pid, sig);
2098 td_set_runstate(td, TD_REAPED);
2101 if (WIFEXITED(status)) {
2102 if (WEXITSTATUS(status) && !td->error)
2103 td->error = WEXITSTATUS(status);
2105 td_set_runstate(td, TD_REAPED);
2111 * If the job is stuck, do a forceful timeout of it and
2114 if (td->terminate &&
2115 td->runstate < TD_FSYNCING &&
2116 time_since_now(&td->terminate_time) >= FIO_REAP_TIMEOUT) {
2117 log_err("fio: job '%s' (state=%d) hasn't exited in "
2118 "%lu seconds, it appears to be stuck. Doing "
2119 "forceful exit of this job.\n",
2120 td->o.name, td->runstate,
2121 (unsigned long) time_since_now(&td->terminate_time));
2122 td_set_runstate(td, TD_REAPED);
2127 * thread is not dead, continue
2133 (*m_rate) -= ddir_rw_sum(td->o.ratemin);
2134 (*t_rate) -= ddir_rw_sum(td->o.rate);
2141 done_secs += mtime_since_now(&td->epoch) / 1000;
2142 profile_td_exit(td);
2146 if (*nr_running == cputhreads && !pending && realthreads)
2147 fio_terminate_threads(TERMINATE_ALL, TERMINATE_ALL);
2150 static bool __check_trigger_file(void)
2157 if (stat(trigger_file, &sb))
2160 if (unlink(trigger_file) < 0)
2161 log_err("fio: failed to unlink %s: %s\n", trigger_file,
2167 static bool trigger_timedout(void)
2169 if (trigger_timeout)
2170 if (time_since_genesis() >= trigger_timeout) {
2171 trigger_timeout = 0;
2178 void exec_trigger(const char *cmd)
2182 if (!cmd || cmd[0] == '\0')
2187 log_err("fio: failed executing %s trigger\n", cmd);
2190 void check_trigger_file(void)
2192 if (__check_trigger_file() || trigger_timedout()) {
2194 fio_clients_send_trigger(trigger_remote_cmd);
2196 verify_save_state(IO_LIST_ALL);
2197 fio_terminate_threads(TERMINATE_ALL, TERMINATE_ALL);
2198 exec_trigger(trigger_cmd);
2203 static int fio_verify_load_state(struct thread_data *td)
2207 if (!td->o.verify_state)
2213 ret = fio_server_get_verify_state(td->o.name,
2214 td->thread_number - 1, &data);
2216 verify_assign_state(td, data);
2218 char prefix[PATH_MAX];
2221 sprintf(prefix, "%s%clocal", aux_path,
2222 FIO_OS_PATH_SEPARATOR);
2224 strcpy(prefix, "local");
2225 ret = verify_load_state(td, prefix);
2231 static void do_usleep(unsigned int usecs)
2233 check_for_running_stats();
2234 check_trigger_file();
2238 static bool check_mount_writes(struct thread_data *td)
2243 if (!td_write(td) || td->o.allow_mounted_write)
2247 * If FIO_HAVE_CHARDEV_SIZE is defined, it's likely that chrdevs
2248 * are mkfs'd and mounted.
2250 for_each_file(td, f, i) {
2251 #ifdef FIO_HAVE_CHARDEV_SIZE
2252 if (f->filetype != FIO_TYPE_BLOCK && f->filetype != FIO_TYPE_CHAR)
2254 if (f->filetype != FIO_TYPE_BLOCK)
2257 if (device_is_mounted(f->file_name))
2263 log_err("fio: %s appears mounted, and 'allow_mounted_write' isn't set. Aborting.\n", f->file_name);
2267 static bool waitee_running(struct thread_data *me)
2269 const char *waitee = me->o.wait_for;
2270 const char *self = me->o.name;
2271 struct thread_data *td;
2277 for_each_td(td, i) {
2278 if (!strcmp(td->o.name, self) || strcmp(td->o.name, waitee))
2281 if (td->runstate < TD_EXITED) {
2282 dprint(FD_PROCESS, "%s fenced by %s(%s)\n",
2284 runstate_to_name(td->runstate));
2289 dprint(FD_PROCESS, "%s: %s completed, can run\n", self, waitee);
2294 * Main function for kicking off and reaping jobs, as needed.
2296 static void run_threads(struct sk_out *sk_out)
2298 struct thread_data *td;
2299 unsigned int i, todo, nr_running, nr_started;
2300 uint64_t m_rate, t_rate;
2303 if (fio_gtod_offload && fio_start_gtod_thread())
2306 fio_idle_prof_init();
2310 nr_thread = nr_process = 0;
2311 for_each_td(td, i) {
2312 if (check_mount_writes(td))
2314 if (td->o.use_thread)
2320 if (output_format & FIO_OUTPUT_NORMAL) {
2321 struct buf_output out;
2323 buf_output_init(&out);
2324 __log_buf(&out, "Starting ");
2326 __log_buf(&out, "%d thread%s", nr_thread,
2327 nr_thread > 1 ? "s" : "");
2330 __log_buf(&out, " and ");
2331 __log_buf(&out, "%d process%s", nr_process,
2332 nr_process > 1 ? "es" : "");
2334 __log_buf(&out, "\n");
2335 log_info_buf(out.buf, out.buflen);
2336 buf_output_free(&out);
2339 todo = thread_number;
2342 m_rate = t_rate = 0;
2344 for_each_td(td, i) {
2345 print_status_init(td->thread_number - 1);
2347 if (!td->o.create_serialize)
2350 if (fio_verify_load_state(td))
2354 * do file setup here so it happens sequentially,
2355 * we don't want X number of threads getting their
2356 * client data interspersed on disk
2358 if (setup_files(td)) {
2362 log_err("fio: pid=%d, err=%d/%s\n",
2363 (int) td->pid, td->error, td->verror);
2364 td_set_runstate(td, TD_REAPED);
2371 * for sharing to work, each job must always open
2372 * its own files. so close them, if we opened them
2375 for_each_file(td, f, j) {
2376 if (fio_file_open(f))
2377 td_io_close_file(td, f);
2382 /* start idle threads before io threads start to run */
2383 fio_idle_prof_start();
2388 struct thread_data *map[REAL_MAX_JOBS];
2389 struct timespec this_start;
2390 int this_jobs = 0, left;
2391 struct fork_data *fd;
2394 * create threads (TD_NOT_CREATED -> TD_CREATED)
2396 for_each_td(td, i) {
2397 if (td->runstate != TD_NOT_CREATED)
2401 * never got a chance to start, killed by other
2402 * thread for some reason
2404 if (td->terminate) {
2409 if (td->o.start_delay) {
2410 spent = utime_since_genesis();
2412 if (td->o.start_delay > spent)
2416 if (td->o.stonewall && (nr_started || nr_running)) {
2417 dprint(FD_PROCESS, "%s: stonewall wait\n",
2422 if (waitee_running(td)) {
2423 dprint(FD_PROCESS, "%s: waiting for %s\n",
2424 td->o.name, td->o.wait_for);
2430 td->rusage_sem = fio_sem_init(FIO_SEM_LOCKED);
2431 td->update_rusage = 0;
2434 * Set state to created. Thread will transition
2435 * to TD_INITIALIZED when it's done setting up.
2437 td_set_runstate(td, TD_CREATED);
2438 map[this_jobs++] = td;
2441 fd = calloc(1, sizeof(*fd));
2443 fd->sk_out = sk_out;
2445 if (td->o.use_thread) {
2448 dprint(FD_PROCESS, "will pthread_create\n");
2449 ret = pthread_create(&td->thread, NULL,
2452 log_err("pthread_create: %s\n",
2459 ret = pthread_detach(td->thread);
2461 log_err("pthread_detach: %s",
2466 dprint(FD_PROCESS, "will fork\n");
2473 ret = (int)(uintptr_t)thread_main(fd);
2475 } else if (i == fio_debug_jobno)
2476 *fio_debug_jobp = pid;
2481 dprint(FD_MUTEX, "wait on startup_sem\n");
2482 if (fio_sem_down_timeout(startup_sem, 10000)) {
2483 log_err("fio: job startup hung? exiting.\n");
2484 fio_terminate_threads(TERMINATE_ALL, TERMINATE_ALL);
2490 dprint(FD_MUTEX, "done waiting on startup_sem\n");
2494 * Wait for the started threads to transition to
2497 fio_gettime(&this_start, NULL);
2499 while (left && !fio_abort) {
2500 if (mtime_since_now(&this_start) > JOB_START_TIMEOUT)
2505 for (i = 0; i < this_jobs; i++) {
2509 if (td->runstate == TD_INITIALIZED) {
2512 } else if (td->runstate >= TD_EXITED) {
2516 nr_running++; /* work-around... */
2522 log_err("fio: %d job%s failed to start\n", left,
2523 left > 1 ? "s" : "");
2524 for (i = 0; i < this_jobs; i++) {
2528 kill(td->pid, SIGTERM);
2534 * start created threads (TD_INITIALIZED -> TD_RUNNING).
2536 for_each_td(td, i) {
2537 if (td->runstate != TD_INITIALIZED)
2540 if (in_ramp_time(td))
2541 td_set_runstate(td, TD_RAMP);
2543 td_set_runstate(td, TD_RUNNING);
2546 m_rate += ddir_rw_sum(td->o.ratemin);
2547 t_rate += ddir_rw_sum(td->o.rate);
2549 fio_sem_up(td->sem);
2552 reap_threads(&nr_running, &t_rate, &m_rate);
2558 while (nr_running) {
2559 reap_threads(&nr_running, &t_rate, &m_rate);
2563 fio_idle_prof_stop();
2568 static void free_disk_util(void)
2570 disk_util_prune_entries();
2571 helper_thread_destroy();
2574 int fio_backend(struct sk_out *sk_out)
2576 struct thread_data *td;
2580 if (load_profile(exec_profile))
2583 exec_profile = NULL;
2589 struct log_params p = {
2590 .log_type = IO_LOG_TYPE_BW,
2593 setup_log(&agg_io_log[DDIR_READ], &p, "agg-read_bw.log");
2594 setup_log(&agg_io_log[DDIR_WRITE], &p, "agg-write_bw.log");
2595 setup_log(&agg_io_log[DDIR_TRIM], &p, "agg-trim_bw.log");
2598 if (init_global_dedupe_working_set_seeds()) {
2599 log_err("fio: failed to initialize global dedupe working set\n");
2603 startup_sem = fio_sem_init(FIO_SEM_LOCKED);
2605 is_local_backend = true;
2606 if (startup_sem == NULL)
2611 if (helper_thread_create(startup_sem, sk_out))
2612 log_err("fio: failed to create helper thread\n");
2614 cgroup_list = smalloc(sizeof(*cgroup_list));
2616 INIT_FLIST_HEAD(cgroup_list);
2618 run_threads(sk_out);
2620 helper_thread_exit();
2625 for (i = 0; i < DDIR_RWDIR_CNT; i++) {
2626 struct io_log *log = agg_io_log[i];
2628 flush_log(log, false);
2634 for_each_td(td, i) {
2635 struct thread_stat *ts = &td->ts;
2637 free_clat_prio_stats(ts);
2638 steadystate_free(td);
2639 fio_options_free(td);
2640 fio_dump_options_free(td);
2641 if (td->rusage_sem) {
2642 fio_sem_remove(td->rusage_sem);
2643 td->rusage_sem = NULL;
2645 fio_sem_remove(td->sem);
2651 cgroup_kill(cgroup_list);
2655 fio_sem_remove(startup_sem);