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 current_rate_check_bytes = td->this_io_bytes[ddir];
140 unsigned long current_rate_check_blocks = td->this_io_blocks[ddir];
141 unsigned long long option_rate_bytes_min = td->o.ratemin[ddir];
142 unsigned int option_rate_iops_min = td->o.rate_iops_min[ddir];
144 assert(ddir_rw(ddir));
146 if (!td->o.ratemin[ddir] && !td->o.rate_iops_min[ddir])
150 * allow a 2 second settle period in the beginning
152 if (mtime_since(&td->start, now) < 2000)
156 * if last_rate_check_blocks or last_rate_check_bytes is set,
157 * we can compute a rate per ratecycle
159 if (td->last_rate_check_bytes[ddir] || td->last_rate_check_blocks[ddir]) {
160 unsigned long spent = mtime_since(&td->last_rate_check_time[ddir], now);
161 if (spent < td->o.ratecycle || spent==0)
164 if (td->o.ratemin[ddir]) {
166 * check bandwidth specified rate
168 unsigned long long current_rate_bytes =
169 ((current_rate_check_bytes - td->last_rate_check_bytes[ddir]) * 1000) / spent;
170 if (current_rate_bytes < option_rate_bytes_min) {
171 log_err("%s: rate_min=%lluB/s not met, got %lluB/s\n",
172 td->o.name, option_rate_bytes_min, current_rate_bytes);
177 * checks iops specified rate
179 unsigned long long current_rate_iops =
180 ((current_rate_check_blocks - td->last_rate_check_blocks[ddir]) * 1000) / spent;
182 if (current_rate_iops < option_rate_iops_min) {
183 log_err("%s: rate_iops_min=%u not met, got %llu IOPS\n",
184 td->o.name, option_rate_iops_min, current_rate_iops);
190 td->last_rate_check_bytes[ddir] = current_rate_check_bytes;
191 td->last_rate_check_blocks[ddir] = current_rate_check_blocks;
192 memcpy(&td->last_rate_check_time[ddir], now, sizeof(*now));
196 static bool check_min_rate(struct thread_data *td, struct timespec *now)
200 for_each_rw_ddir(ddir) {
201 if (td->bytes_done[ddir])
202 ret |= __check_min_rate(td, now, ddir);
209 * When job exits, we can cancel the in-flight IO if we are using async
210 * io. Attempt to do so.
212 static void cleanup_pending_aio(struct thread_data *td)
217 * get immediately available events, if any
219 r = io_u_queued_complete(td, 0);
222 * now cancel remaining active events
224 if (td->io_ops->cancel) {
228 io_u_qiter(&td->io_u_all, io_u, i) {
229 if (io_u->flags & IO_U_F_FLIGHT) {
230 r = td->io_ops->cancel(td, io_u);
238 r = io_u_queued_complete(td, td->cur_depth);
242 * Helper to handle the final sync of a file. Works just like the normal
243 * io path, just does everything sync.
245 static bool fio_io_sync(struct thread_data *td, struct fio_file *f)
247 struct io_u *io_u = __get_io_u(td);
248 enum fio_q_status ret;
253 io_u->ddir = DDIR_SYNC;
255 io_u_set(td, io_u, IO_U_F_NO_FILE_PUT);
257 if (td_io_prep(td, io_u)) {
263 ret = td_io_queue(td, io_u);
267 if (io_u_queued_complete(td, 1) < 0)
270 case FIO_Q_COMPLETED:
272 td_verror(td, io_u->error, "td_io_queue");
276 if (io_u_sync_complete(td, io_u) < 0)
287 static int fio_file_fsync(struct thread_data *td, struct fio_file *f)
291 if (fio_file_open(f))
292 return fio_io_sync(td, f);
294 if (td_io_open_file(td, f))
297 ret = fio_io_sync(td, f);
299 if (fio_file_open(f))
300 ret2 = td_io_close_file(td, f);
301 return (ret || ret2);
304 static inline void __update_ts_cache(struct thread_data *td)
306 fio_gettime(&td->ts_cache, NULL);
309 static inline void update_ts_cache(struct thread_data *td)
311 if ((++td->ts_cache_nr & td->ts_cache_mask) == td->ts_cache_mask)
312 __update_ts_cache(td);
315 static inline bool runtime_exceeded(struct thread_data *td, struct timespec *t)
317 if (in_ramp_time(td))
321 if (utime_since(&td->epoch, t) >= td->o.timeout)
328 * We need to update the runtime consistently in ms, but keep a running
329 * tally of the current elapsed time in microseconds for sub millisecond
332 static inline void update_runtime(struct thread_data *td,
333 unsigned long long *elapsed_us,
334 const enum fio_ddir ddir)
336 if (ddir == DDIR_WRITE && td_write(td) && td->o.verify_only)
339 td->ts.runtime[ddir] -= (elapsed_us[ddir] + 999) / 1000;
340 elapsed_us[ddir] += utime_since_now(&td->start);
341 td->ts.runtime[ddir] += (elapsed_us[ddir] + 999) / 1000;
344 static bool break_on_this_error(struct thread_data *td, enum fio_ddir ddir,
349 if (ret < 0 || td->error) {
351 enum error_type_bit eb;
356 eb = td_error_type(ddir, err);
357 if (!(td->o.continue_on_error & (1 << eb)))
360 if (td_non_fatal_error(td, eb, err)) {
362 * Continue with the I/Os in case of
365 update_error_count(td, err);
369 } else if (td->o.fill_device && (err == ENOSPC || err == EDQUOT)) {
371 * We expect to hit this error if
372 * fill_device option is set.
375 fio_mark_td_terminate(td);
379 * Stop the I/O in case of a fatal
382 update_error_count(td, err);
390 static void check_update_rusage(struct thread_data *td)
392 if (td->update_rusage) {
393 td->update_rusage = 0;
394 update_rusage_stat(td);
395 fio_sem_up(td->rusage_sem);
399 static int wait_for_completions(struct thread_data *td, struct timespec *time)
401 const int full = queue_full(td);
405 if (td->flags & TD_F_REGROW_LOGS)
406 return io_u_quiesce(td);
409 * if the queue is full, we MUST reap at least 1 event
411 min_evts = min(td->o.iodepth_batch_complete_min, td->cur_depth);
412 if ((full && !min_evts) || !td->o.iodepth_batch_complete_min)
415 if (time && should_check_rate(td))
416 fio_gettime(time, NULL);
419 ret = io_u_queued_complete(td, min_evts);
422 } while (full && (td->cur_depth > td->o.iodepth_low));
427 int io_queue_event(struct thread_data *td, struct io_u *io_u, int *ret,
428 enum fio_ddir ddir, uint64_t *bytes_issued, int from_verify,
429 struct timespec *comp_time)
432 case FIO_Q_COMPLETED:
435 clear_io_u(td, io_u);
436 } else if (io_u->resid) {
437 long long bytes = io_u->xfer_buflen - io_u->resid;
438 struct fio_file *f = io_u->file;
441 *bytes_issued += bytes;
451 unlog_io_piece(td, io_u);
452 td_verror(td, EIO, "full resid");
457 io_u->xfer_buflen = io_u->resid;
458 io_u->xfer_buf += bytes;
459 io_u->offset += bytes;
461 if (ddir_rw(io_u->ddir))
462 td->ts.short_io_u[io_u->ddir]++;
464 if (io_u->offset == f->real_file_size)
467 requeue_io_u(td, &io_u);
470 if (comp_time && should_check_rate(td))
471 fio_gettime(comp_time, NULL);
473 *ret = io_u_sync_complete(td, io_u);
478 if (td->flags & TD_F_REGROW_LOGS)
482 * when doing I/O (not when verifying),
483 * check for any errors that are to be ignored
491 * if the engine doesn't have a commit hook,
492 * the io_u is really queued. if it does have such
493 * a hook, it has to call io_u_queued() itself.
495 if (td->io_ops->commit == NULL)
496 io_u_queued(td, io_u);
498 *bytes_issued += io_u->xfer_buflen;
502 unlog_io_piece(td, io_u);
503 requeue_io_u(td, &io_u);
508 td_verror(td, -(*ret), "td_io_queue");
512 if (break_on_this_error(td, ddir, ret))
518 static inline bool io_in_polling(struct thread_data *td)
520 return !td->o.iodepth_batch_complete_min &&
521 !td->o.iodepth_batch_complete_max;
524 * Unlinks files from thread data fio_file structure
526 static int unlink_all_files(struct thread_data *td)
532 for_each_file(td, f, i) {
533 if (f->filetype != FIO_TYPE_FILE)
535 ret = td_io_unlink_file(td, f);
541 td_verror(td, ret, "unlink_all_files");
547 * Check if io_u will overlap an in-flight IO in the queue
549 bool in_flight_overlap(struct io_u_queue *q, struct io_u *io_u)
552 struct io_u *check_io_u;
553 unsigned long long x1, x2, y1, y2;
557 x2 = io_u->offset + io_u->buflen;
559 io_u_qiter(q, check_io_u, i) {
560 if (check_io_u->flags & IO_U_F_FLIGHT) {
561 y1 = check_io_u->offset;
562 y2 = check_io_u->offset + check_io_u->buflen;
564 if (x1 < y2 && y1 < x2) {
566 dprint(FD_IO, "in-flight overlap: %llu/%llu, %llu/%llu\n",
568 y1, check_io_u->buflen);
577 static enum fio_q_status io_u_submit(struct thread_data *td, struct io_u *io_u)
580 * Check for overlap if the user asked us to, and we have
581 * at least one IO in flight besides this one.
583 if (td->o.serialize_overlap && td->cur_depth > 1 &&
584 in_flight_overlap(&td->io_u_all, io_u))
587 return td_io_queue(td, io_u);
591 * The main verify engine. Runs over the writes we previously submitted,
592 * reads the blocks back in, and checks the crc/md5 of the data.
594 static void do_verify(struct thread_data *td, uint64_t verify_bytes)
601 dprint(FD_VERIFY, "starting loop\n");
604 * sync io first and invalidate cache, to make sure we really
607 for_each_file(td, f, i) {
608 if (!fio_file_open(f))
610 if (fio_io_sync(td, f))
612 if (file_invalidate_cache(td, f))
616 check_update_rusage(td);
622 * verify_state needs to be reset before verification
623 * proceeds so that expected random seeds match actual
624 * random seeds in headers. The main loop will reset
625 * all random number generators if randrepeat is set.
627 if (!td->o.rand_repeatable)
628 td_fill_verify_state_seed(td);
630 td_set_runstate(td, TD_VERIFYING);
633 while (!td->terminate) {
638 check_update_rusage(td);
640 if (runtime_exceeded(td, &td->ts_cache)) {
641 __update_ts_cache(td);
642 if (runtime_exceeded(td, &td->ts_cache)) {
643 fio_mark_td_terminate(td);
648 if (flow_threshold_exceeded(td))
651 if (!td->o.experimental_verify) {
652 io_u = __get_io_u(td);
656 if (get_next_verify(td, io_u)) {
661 if (td_io_prep(td, io_u)) {
666 if (ddir_rw_sum(td->bytes_done) + td->o.rw_min_bs > verify_bytes)
669 while ((io_u = get_io_u(td)) != NULL) {
670 if (IS_ERR_OR_NULL(io_u)) {
677 * We are only interested in the places where
678 * we wrote or trimmed IOs. Turn those into
679 * reads for verification purposes.
681 if (io_u->ddir == DDIR_READ) {
683 * Pretend we issued it for rwmix
686 td->io_issues[DDIR_READ]++;
689 } else if (io_u->ddir == DDIR_TRIM) {
690 io_u->ddir = DDIR_READ;
691 io_u_set(td, io_u, IO_U_F_TRIMMED);
693 } else if (io_u->ddir == DDIR_WRITE) {
694 io_u->ddir = DDIR_READ;
695 populate_verify_io_u(td, io_u);
707 if (verify_state_should_stop(td, io_u)) {
712 if (td->o.verify_async)
713 io_u->end_io = verify_io_u_async;
715 io_u->end_io = verify_io_u;
718 if (!td->o.disable_slat)
719 fio_gettime(&io_u->start_time, NULL);
721 ret = io_u_submit(td, io_u);
723 if (io_queue_event(td, io_u, &ret, ddir, NULL, 1, NULL))
727 * if we can queue more, do so. but check if there are
728 * completed io_u's first. Note that we can get BUSY even
729 * without IO queued, if the system is resource starved.
732 full = queue_full(td) || (ret == FIO_Q_BUSY && td->cur_depth);
733 if (full || io_in_polling(td))
734 ret = wait_for_completions(td, NULL);
740 check_update_rusage(td);
743 min_events = td->cur_depth;
746 ret = io_u_queued_complete(td, min_events);
748 cleanup_pending_aio(td);
750 td_set_runstate(td, TD_RUNNING);
752 dprint(FD_VERIFY, "exiting loop\n");
755 static bool exceeds_number_ios(struct thread_data *td)
757 unsigned long long number_ios;
759 if (!td->o.number_ios)
762 number_ios = ddir_rw_sum(td->io_blocks);
763 number_ios += td->io_u_queued + td->io_u_in_flight;
765 return number_ios >= (td->o.number_ios * td->loops);
768 static bool io_bytes_exceeded(struct thread_data *td, uint64_t *this_bytes)
770 unsigned long long bytes, limit;
773 bytes = this_bytes[DDIR_READ] + this_bytes[DDIR_WRITE];
774 else if (td_write(td))
775 bytes = this_bytes[DDIR_WRITE];
776 else if (td_read(td))
777 bytes = this_bytes[DDIR_READ];
779 bytes = this_bytes[DDIR_TRIM];
782 limit = td->o.io_size;
787 return bytes >= limit || exceeds_number_ios(td);
790 static bool io_issue_bytes_exceeded(struct thread_data *td)
792 return io_bytes_exceeded(td, td->io_issue_bytes);
795 static bool io_complete_bytes_exceeded(struct thread_data *td)
797 return io_bytes_exceeded(td, td->this_io_bytes);
801 * used to calculate the next io time for rate control
804 static long long usec_for_io(struct thread_data *td, enum fio_ddir ddir)
806 uint64_t bps = td->rate_bps[ddir];
808 assert(!(td->flags & TD_F_CHILD));
810 if (td->o.rate_process == RATE_PROCESS_POISSON) {
813 iops = bps / td->o.min_bs[ddir];
814 val = (int64_t) (1000000 / iops) *
815 -logf(__rand_0_1(&td->poisson_state[ddir]));
817 dprint(FD_RATE, "poisson rate iops=%llu, ddir=%d\n",
818 (unsigned long long) 1000000 / val,
821 td->last_usec[ddir] += val;
822 return td->last_usec[ddir];
824 uint64_t bytes = td->rate_io_issue_bytes[ddir];
825 uint64_t secs = bytes / bps;
826 uint64_t remainder = bytes % bps;
828 return remainder * 1000000 / bps + secs * 1000000;
834 static void init_thinktime(struct thread_data *td)
836 if (td->o.thinktime_blocks_type == THINKTIME_BLOCKS_TYPE_COMPLETE)
837 td->thinktime_blocks_counter = td->io_blocks;
839 td->thinktime_blocks_counter = td->io_issues;
840 td->last_thinktime = td->epoch;
841 td->last_thinktime_blocks = 0;
844 static void handle_thinktime(struct thread_data *td, enum fio_ddir ddir,
845 struct timespec *time)
847 unsigned long long b;
853 if (td->o.thinktime_iotime) {
854 fio_gettime(&now, NULL);
855 if (utime_since(&td->last_thinktime, &now)
856 >= td->o.thinktime_iotime + td->o.thinktime) {
858 } else if (!fio_option_is_set(&td->o, thinktime_blocks)) {
860 * When thinktime_iotime is set and thinktime_blocks is
861 * not set, skip the thinktime_blocks check, since
862 * thinktime_blocks default value 1 does not work
863 * together with thinktime_iotime.
870 b = ddir_rw_sum(td->thinktime_blocks_counter);
871 if (b >= td->last_thinktime_blocks + td->o.thinktime_blocks)
880 if (td->o.thinktime_spin)
881 total = usec_spin(td->o.thinktime_spin);
883 left = td->o.thinktime - total;
885 total += usec_sleep(td, left);
888 * If we're ignoring thinktime for the rate, add the number of bytes
889 * we would have done while sleeping, minus one block to ensure we
890 * start issuing immediately after the sleep.
892 if (total && td->rate_bps[ddir] && td->o.rate_ign_think) {
893 uint64_t missed = (td->rate_bps[ddir] * total) / 1000000ULL;
894 uint64_t bs = td->o.min_bs[ddir];
895 uint64_t usperop = bs * 1000000ULL / td->rate_bps[ddir];
898 if (usperop <= total)
901 over = (usperop - total) / usperop * -bs;
903 td->rate_io_issue_bytes[ddir] += (missed - over);
904 /* adjust for rate_process=poisson */
905 td->last_usec[ddir] += total;
908 if (time && should_check_rate(td))
909 fio_gettime(time, NULL);
911 td->last_thinktime_blocks = b;
912 if (td->o.thinktime_iotime)
913 td->last_thinktime = now;
917 * Main IO worker function. It retrieves io_u's to process and queues
918 * and reaps them, checking for rate and errors along the way.
920 * Returns number of bytes written and trimmed.
922 static void do_io(struct thread_data *td, uint64_t *bytes_done)
926 uint64_t total_bytes, bytes_issued = 0;
928 for (i = 0; i < DDIR_RWDIR_CNT; i++)
929 bytes_done[i] = td->bytes_done[i];
931 if (in_ramp_time(td))
932 td_set_runstate(td, TD_RAMP);
934 td_set_runstate(td, TD_RUNNING);
938 total_bytes = td->o.size;
940 * Allow random overwrite workloads to write up to io_size
941 * before starting verification phase as 'size' doesn't apply.
943 if (td_write(td) && td_random(td) && td->o.norandommap)
944 total_bytes = max(total_bytes, (uint64_t) td->o.io_size);
946 * If verify_backlog is enabled, we'll run the verify in this
947 * handler as well. For that case, we may need up to twice the
950 if (td->o.verify != VERIFY_NONE &&
951 (td_write(td) && td->o.verify_backlog))
952 total_bytes += td->o.size;
954 /* In trimwrite mode, each byte is trimmed and then written, so
955 * allow total_bytes to be twice as big */
956 if (td_trimwrite(td))
957 total_bytes += td->total_io_size;
959 while ((td->o.read_iolog_file && !flist_empty(&td->io_log_list)) ||
960 (!flist_empty(&td->trim_list)) || !io_issue_bytes_exceeded(td) ||
962 struct timespec comp_time;
967 check_update_rusage(td);
969 if (td->terminate || td->done)
974 if (runtime_exceeded(td, &td->ts_cache)) {
975 __update_ts_cache(td);
976 if (runtime_exceeded(td, &td->ts_cache)) {
977 fio_mark_td_terminate(td);
982 if (flow_threshold_exceeded(td))
986 * Break if we exceeded the bytes. The exception is time
987 * based runs, but we still need to break out of the loop
988 * for those to run verification, if enabled.
989 * Jobs read from iolog do not use this stop condition.
991 if (bytes_issued >= total_bytes &&
992 !td->o.read_iolog_file &&
993 (!td->o.time_based ||
994 (td->o.time_based && td->o.verify != VERIFY_NONE)))
998 if (IS_ERR_OR_NULL(io_u)) {
999 int err = PTR_ERR(io_u);
1003 if (err == -EBUSY) {
1007 if (td->o.latency_target)
1012 if (io_u->ddir == DDIR_WRITE && td->flags & TD_F_DO_VERIFY)
1013 populate_verify_io_u(td, io_u);
1018 * Add verification end_io handler if:
1019 * - Asked to verify (!td_rw(td))
1020 * - Or the io_u is from our verify list (mixed write/ver)
1022 if (td->o.verify != VERIFY_NONE && io_u->ddir == DDIR_READ &&
1023 ((io_u->flags & IO_U_F_VER_LIST) || !td_rw(td))) {
1025 if (verify_state_should_stop(td, io_u)) {
1030 if (td->o.verify_async)
1031 io_u->end_io = verify_io_u_async;
1033 io_u->end_io = verify_io_u;
1034 td_set_runstate(td, TD_VERIFYING);
1035 } else if (in_ramp_time(td))
1036 td_set_runstate(td, TD_RAMP);
1038 td_set_runstate(td, TD_RUNNING);
1041 * Always log IO before it's issued, so we know the specific
1042 * order of it. The logged unit will track when the IO has
1045 if (td_write(td) && io_u->ddir == DDIR_WRITE &&
1047 td->o.verify != VERIFY_NONE &&
1048 !td->o.experimental_verify)
1049 log_io_piece(td, io_u);
1051 if (td->o.io_submit_mode == IO_MODE_OFFLOAD) {
1052 const unsigned long long blen = io_u->xfer_buflen;
1053 const enum fio_ddir __ddir = acct_ddir(io_u);
1058 workqueue_enqueue(&td->io_wq, &io_u->work);
1061 if (ddir_rw(__ddir)) {
1062 td->io_issues[__ddir]++;
1063 td->io_issue_bytes[__ddir] += blen;
1064 td->rate_io_issue_bytes[__ddir] += blen;
1067 if (should_check_rate(td)) {
1068 td->rate_next_io_time[__ddir] = usec_for_io(td, __ddir);
1069 fio_gettime(&comp_time, NULL);
1073 ret = io_u_submit(td, io_u);
1075 if (should_check_rate(td))
1076 td->rate_next_io_time[ddir] = usec_for_io(td, ddir);
1078 if (io_queue_event(td, io_u, &ret, ddir, &bytes_issued, 0, &comp_time))
1082 * See if we need to complete some commands. Note that
1083 * we can get BUSY even without IO queued, if the
1084 * system is resource starved.
1087 full = queue_full(td) ||
1088 (ret == FIO_Q_BUSY && td->cur_depth);
1089 if (full || io_in_polling(td))
1090 ret = wait_for_completions(td, &comp_time);
1095 if (ddir_rw(ddir) && td->o.thinktime)
1096 handle_thinktime(td, ddir, &comp_time);
1098 if (!ddir_rw_sum(td->bytes_done) &&
1099 !td_ioengine_flagged(td, FIO_NOIO))
1102 if (!in_ramp_time(td) && should_check_rate(td)) {
1103 if (check_min_rate(td, &comp_time)) {
1104 if (exitall_on_terminate || td->o.exitall_error)
1105 fio_terminate_threads(td->groupid, td->o.exit_what);
1106 td_verror(td, EIO, "check_min_rate");
1110 if (!in_ramp_time(td) && td->o.latency_target)
1111 lat_target_check(td);
1114 check_update_rusage(td);
1116 if (td->trim_entries)
1117 log_err("fio: %lu trim entries leaked?\n", td->trim_entries);
1119 if (td->o.fill_device && (td->error == ENOSPC || td->error == EDQUOT)) {
1121 fio_mark_td_terminate(td);
1126 if (td->o.io_submit_mode == IO_MODE_OFFLOAD) {
1127 workqueue_flush(&td->io_wq);
1133 ret = io_u_queued_complete(td, i);
1134 if (td->o.fill_device &&
1135 (td->error == ENOSPC || td->error == EDQUOT))
1139 if (should_fsync(td) && (td->o.end_fsync || td->o.fsync_on_close)) {
1140 td_set_runstate(td, TD_FSYNCING);
1142 for_each_file(td, f, i) {
1143 if (!fio_file_fsync(td, f))
1146 log_err("fio: end_fsync failed for file %s\n",
1151 if (td->o.io_submit_mode == IO_MODE_OFFLOAD)
1152 workqueue_flush(&td->io_wq);
1153 cleanup_pending_aio(td);
1157 * stop job if we failed doing any IO
1159 if (!ddir_rw_sum(td->this_io_bytes))
1162 for (i = 0; i < DDIR_RWDIR_CNT; i++)
1163 bytes_done[i] = td->bytes_done[i] - bytes_done[i];
1166 static void free_file_completion_logging(struct thread_data *td)
1171 for_each_file(td, f, i) {
1172 if (!f->last_write_comp)
1174 sfree(f->last_write_comp);
1178 static int init_file_completion_logging(struct thread_data *td,
1184 if (td->o.verify == VERIFY_NONE || !td->o.verify_state_save)
1187 for_each_file(td, f, i) {
1188 f->last_write_comp = scalloc(depth, sizeof(uint64_t));
1189 if (!f->last_write_comp)
1196 free_file_completion_logging(td);
1197 log_err("fio: failed to alloc write comp data\n");
1201 static void cleanup_io_u(struct thread_data *td)
1205 while ((io_u = io_u_qpop(&td->io_u_freelist)) != NULL) {
1207 if (td->io_ops->io_u_free)
1208 td->io_ops->io_u_free(td, io_u);
1210 fio_memfree(io_u, sizeof(*io_u), td_offload_overlap(td));
1215 io_u_rexit(&td->io_u_requeues);
1216 io_u_qexit(&td->io_u_freelist, false);
1217 io_u_qexit(&td->io_u_all, td_offload_overlap(td));
1219 free_file_completion_logging(td);
1222 static int init_io_u(struct thread_data *td)
1225 int cl_align, i, max_units;
1228 max_units = td->o.iodepth;
1231 err += !io_u_rinit(&td->io_u_requeues, td->o.iodepth);
1232 err += !io_u_qinit(&td->io_u_freelist, td->o.iodepth, false);
1233 err += !io_u_qinit(&td->io_u_all, td->o.iodepth, td_offload_overlap(td));
1236 log_err("fio: failed setting up IO queues\n");
1240 cl_align = os_cache_line_size();
1242 for (i = 0; i < max_units; i++) {
1248 ptr = fio_memalign(cl_align, sizeof(*io_u), td_offload_overlap(td));
1250 log_err("fio: unable to allocate aligned memory\n");
1255 memset(io_u, 0, sizeof(*io_u));
1256 INIT_FLIST_HEAD(&io_u->verify_list);
1257 dprint(FD_MEM, "io_u alloc %p, index %u\n", io_u, i);
1260 io_u->flags = IO_U_F_FREE;
1261 io_u_qpush(&td->io_u_freelist, io_u);
1264 * io_u never leaves this stack, used for iteration of all
1267 io_u_qpush(&td->io_u_all, io_u);
1269 if (td->io_ops->io_u_init) {
1270 int ret = td->io_ops->io_u_init(td, io_u);
1273 log_err("fio: failed to init engine data: %d\n", ret);
1279 init_io_u_buffers(td);
1281 if (init_file_completion_logging(td, max_units))
1287 int init_io_u_buffers(struct thread_data *td)
1290 unsigned long long max_bs, min_write;
1295 max_units = td->o.iodepth;
1296 max_bs = td_max_bs(td);
1297 min_write = td->o.min_bs[DDIR_WRITE];
1298 td->orig_buffer_size = (unsigned long long) max_bs
1299 * (unsigned long long) max_units;
1301 if (td_ioengine_flagged(td, FIO_NOIO) || !(td_read(td) || td_write(td)))
1305 * if we may later need to do address alignment, then add any
1306 * possible adjustment here so that we don't cause a buffer
1307 * overflow later. this adjustment may be too much if we get
1308 * lucky and the allocator gives us an aligned address.
1310 if (td->o.odirect || td->o.mem_align || td->o.oatomic ||
1311 td_ioengine_flagged(td, FIO_RAWIO))
1312 td->orig_buffer_size += page_mask + td->o.mem_align;
1314 if (td->o.mem_type == MEM_SHMHUGE || td->o.mem_type == MEM_MMAPHUGE) {
1315 unsigned long long bs;
1317 bs = td->orig_buffer_size + td->o.hugepage_size - 1;
1318 td->orig_buffer_size = bs & ~(td->o.hugepage_size - 1);
1321 if (td->orig_buffer_size != (size_t) td->orig_buffer_size) {
1322 log_err("fio: IO memory too large. Reduce max_bs or iodepth\n");
1326 if (data_xfer && allocate_io_mem(td))
1329 if (td->o.odirect || td->o.mem_align || td->o.oatomic ||
1330 td_ioengine_flagged(td, FIO_RAWIO))
1331 p = PTR_ALIGN(td->orig_buffer, page_mask) + td->o.mem_align;
1333 p = td->orig_buffer;
1335 for (i = 0; i < max_units; i++) {
1336 io_u = td->io_u_all.io_us[i];
1337 dprint(FD_MEM, "io_u alloc %p, index %u\n", io_u, i);
1341 dprint(FD_MEM, "io_u %p, mem %p\n", io_u, io_u->buf);
1344 io_u_fill_buffer(td, io_u, min_write, max_bs);
1345 if (td_write(td) && td->o.verify_pattern_bytes) {
1347 * Fill the buffer with the pattern if we are
1348 * going to be doing writes.
1350 fill_verify_pattern(td, io_u->buf, max_bs, io_u, 0, 0);
1359 #ifdef FIO_HAVE_IOSCHED_SWITCH
1361 * These functions are Linux specific.
1362 * FIO_HAVE_IOSCHED_SWITCH enabled currently means it's Linux.
1364 static int set_ioscheduler(struct thread_data *td, struct fio_file *file)
1366 char tmp[256], tmp2[128], *p;
1370 assert(file->du && file->du->sysfs_root);
1371 sprintf(tmp, "%s/queue/scheduler", file->du->sysfs_root);
1373 f = fopen(tmp, "r+");
1375 if (errno == ENOENT) {
1376 log_err("fio: os or kernel doesn't support IO scheduler"
1380 td_verror(td, errno, "fopen iosched");
1387 ret = fwrite(td->o.ioscheduler, strlen(td->o.ioscheduler), 1, f);
1388 if (ferror(f) || ret != 1) {
1389 td_verror(td, errno, "fwrite");
1397 * Read back and check that the selected scheduler is now the default.
1399 ret = fread(tmp, 1, sizeof(tmp) - 1, f);
1400 if (ferror(f) || ret < 0) {
1401 td_verror(td, errno, "fread");
1407 * either a list of io schedulers or "none\n" is expected. Strip the
1414 * Write to "none" entry doesn't fail, so check the result here.
1416 if (!strcmp(tmp, "none")) {
1417 log_err("fio: io scheduler is not tunable\n");
1422 sprintf(tmp2, "[%s]", td->o.ioscheduler);
1423 if (!strstr(tmp, tmp2)) {
1424 log_err("fio: unable to set io scheduler to %s\n", td->o.ioscheduler);
1425 td_verror(td, EINVAL, "iosched_switch");
1434 static int switch_ioscheduler(struct thread_data *td)
1440 if (td_ioengine_flagged(td, FIO_DISKLESSIO))
1443 assert(td->files && td->files[0]);
1445 for_each_file(td, f, i) {
1447 /* Only consider regular files and block device files */
1448 switch (f->filetype) {
1450 case FIO_TYPE_BLOCK:
1452 * Make sure that the device hosting the file could
1464 ret = set_ioscheduler(td, f);
1474 static int switch_ioscheduler(struct thread_data *td)
1479 #endif /* FIO_HAVE_IOSCHED_SWITCH */
1481 static bool keep_running(struct thread_data *td)
1483 unsigned long long limit;
1489 if (td->o.time_based)
1495 if (exceeds_number_ios(td))
1499 limit = td->o.io_size;
1503 if (limit != -1ULL && ddir_rw_sum(td->io_bytes) < limit) {
1507 * If the difference is less than the maximum IO size, we
1510 diff = limit - ddir_rw_sum(td->io_bytes);
1511 if (diff < td_max_bs(td))
1514 if (fio_files_done(td) && !td->o.io_size)
1523 static int exec_string(struct thread_options *o, const char *string,
1529 if (asprintf(&str, "%s > %s.%s.txt 2>&1", string, o->name, mode) < 0)
1532 log_info("%s : Saving output of %s in %s.%s.txt\n", o->name, mode,
1536 log_err("fio: exec of cmd <%s> failed\n", str);
1543 * Dry run to compute correct state of numberio for verification.
1545 static uint64_t do_dry_run(struct thread_data *td)
1547 td_set_runstate(td, TD_RUNNING);
1549 while ((td->o.read_iolog_file && !flist_empty(&td->io_log_list)) ||
1550 (!flist_empty(&td->trim_list)) || !io_complete_bytes_exceeded(td)) {
1554 if (td->terminate || td->done)
1557 io_u = get_io_u(td);
1558 if (IS_ERR_OR_NULL(io_u))
1561 io_u_set(td, io_u, IO_U_F_FLIGHT);
1564 if (ddir_rw(acct_ddir(io_u)))
1565 td->io_issues[acct_ddir(io_u)]++;
1566 if (ddir_rw(io_u->ddir)) {
1567 io_u_mark_depth(td, 1);
1568 td->ts.total_io_u[io_u->ddir]++;
1571 if (td_write(td) && io_u->ddir == DDIR_WRITE &&
1573 td->o.verify != VERIFY_NONE &&
1574 !td->o.experimental_verify)
1575 log_io_piece(td, io_u);
1577 ret = io_u_sync_complete(td, io_u);
1581 return td->bytes_done[DDIR_WRITE] + td->bytes_done[DDIR_TRIM];
1585 struct thread_data *td;
1586 struct sk_out *sk_out;
1590 * Entry point for the thread based jobs. The process based jobs end up
1591 * here as well, after a little setup.
1593 static void *thread_main(void *data)
1595 struct fork_data *fd = data;
1596 unsigned long long elapsed_us[DDIR_RWDIR_CNT] = { 0, };
1597 struct thread_data *td = fd->td;
1598 struct thread_options *o = &td->o;
1599 struct sk_out *sk_out = fd->sk_out;
1600 uint64_t bytes_done[DDIR_RWDIR_CNT];
1601 int deadlock_loop_cnt;
1605 sk_out_assign(sk_out);
1608 if (!o->use_thread) {
1614 fio_local_clock_init();
1616 dprint(FD_PROCESS, "jobs pid=%d started\n", (int) td->pid);
1619 fio_server_send_start(td);
1621 INIT_FLIST_HEAD(&td->io_log_list);
1622 INIT_FLIST_HEAD(&td->io_hist_list);
1623 INIT_FLIST_HEAD(&td->verify_list);
1624 INIT_FLIST_HEAD(&td->trim_list);
1625 td->io_hist_tree = RB_ROOT;
1627 ret = mutex_cond_init_pshared(&td->io_u_lock, &td->free_cond);
1629 td_verror(td, ret, "mutex_cond_init_pshared");
1632 ret = cond_init_pshared(&td->verify_cond);
1634 td_verror(td, ret, "mutex_cond_pshared");
1638 td_set_runstate(td, TD_INITIALIZED);
1639 dprint(FD_MUTEX, "up startup_sem\n");
1640 fio_sem_up(startup_sem);
1641 dprint(FD_MUTEX, "wait on td->sem\n");
1642 fio_sem_down(td->sem);
1643 dprint(FD_MUTEX, "done waiting on td->sem\n");
1646 * A new gid requires privilege, so we need to do this before setting
1649 if (o->gid != -1U && setgid(o->gid)) {
1650 td_verror(td, errno, "setgid");
1653 if (o->uid != -1U && setuid(o->uid)) {
1654 td_verror(td, errno, "setuid");
1658 td_zone_gen_index(td);
1661 * Do this early, we don't want the compress threads to be limited
1662 * to the same CPUs as the IO workers. So do this before we set
1663 * any potential CPU affinity
1665 if (iolog_compress_init(td, sk_out))
1669 * If we have a gettimeofday() thread, make sure we exclude that
1670 * thread from this job
1673 fio_cpu_clear(&o->cpumask, o->gtod_cpu);
1676 * Set affinity first, in case it has an impact on the memory
1679 if (fio_option_is_set(o, cpumask)) {
1680 if (o->cpus_allowed_policy == FIO_CPUS_SPLIT) {
1681 ret = fio_cpus_split(&o->cpumask, td->thread_number - 1);
1683 log_err("fio: no CPUs set\n");
1684 log_err("fio: Try increasing number of available CPUs\n");
1685 td_verror(td, EINVAL, "cpus_split");
1689 ret = fio_setaffinity(td->pid, o->cpumask);
1691 td_verror(td, errno, "cpu_set_affinity");
1696 #ifdef CONFIG_LIBNUMA
1697 /* numa node setup */
1698 if (fio_option_is_set(o, numa_cpunodes) ||
1699 fio_option_is_set(o, numa_memnodes)) {
1700 struct bitmask *mask;
1702 if (numa_available() < 0) {
1703 td_verror(td, errno, "Does not support NUMA API\n");
1707 if (fio_option_is_set(o, numa_cpunodes)) {
1708 mask = numa_parse_nodestring(o->numa_cpunodes);
1709 ret = numa_run_on_node_mask(mask);
1710 numa_free_nodemask(mask);
1712 td_verror(td, errno, \
1713 "numa_run_on_node_mask failed\n");
1718 if (fio_option_is_set(o, numa_memnodes)) {
1720 if (o->numa_memnodes)
1721 mask = numa_parse_nodestring(o->numa_memnodes);
1723 switch (o->numa_mem_mode) {
1724 case MPOL_INTERLEAVE:
1725 numa_set_interleave_mask(mask);
1728 numa_set_membind(mask);
1731 numa_set_localalloc();
1733 case MPOL_PREFERRED:
1734 numa_set_preferred(o->numa_mem_prefer_node);
1742 numa_free_nodemask(mask);
1748 if (fio_pin_memory(td))
1752 * May alter parameters that init_io_u() will use, so we need to
1755 if (!init_iolog(td))
1758 /* ioprio_set() has to be done before td_io_init() */
1759 if (fio_option_is_set(o, ioprio) ||
1760 fio_option_is_set(o, ioprio_class)) {
1761 ret = ioprio_set(IOPRIO_WHO_PROCESS, 0, o->ioprio_class, o->ioprio);
1763 td_verror(td, errno, "ioprio_set");
1766 td->ioprio = ioprio_value(o->ioprio_class, o->ioprio);
1767 td->ts.ioprio = td->ioprio;
1776 if (td->io_ops->post_init && td->io_ops->post_init(td))
1779 if (o->verify_async && verify_async_init(td))
1782 if (o->cgroup && cgroup_setup(td, cgroup_list, &cgroup_mnt))
1786 if (nice(o->nice) == -1 && errno != 0) {
1787 td_verror(td, errno, "nice");
1791 if (o->ioscheduler && switch_ioscheduler(td))
1794 if (!o->create_serialize && setup_files(td))
1797 if (!init_random_map(td))
1800 if (o->exec_prerun && exec_string(o, o->exec_prerun, "prerun"))
1803 if (o->pre_read && !pre_read_files(td))
1806 fio_verify_init(td);
1808 if (rate_submit_init(td, sk_out))
1811 set_epoch_time(td, o->log_unix_epoch | o->log_alternate_epoch, o->log_alternate_epoch_clock_id);
1812 fio_getrusage(&td->ru_start);
1813 memcpy(&td->bw_sample_time, &td->epoch, sizeof(td->epoch));
1814 memcpy(&td->iops_sample_time, &td->epoch, sizeof(td->epoch));
1815 memcpy(&td->ss.prev_time, &td->epoch, sizeof(td->epoch));
1819 if (o->ratemin[DDIR_READ] || o->ratemin[DDIR_WRITE] ||
1820 o->ratemin[DDIR_TRIM]) {
1821 memcpy(&td->last_rate_check_time[DDIR_READ], &td->bw_sample_time,
1822 sizeof(td->bw_sample_time));
1823 memcpy(&td->last_rate_check_time[DDIR_WRITE], &td->bw_sample_time,
1824 sizeof(td->bw_sample_time));
1825 memcpy(&td->last_rate_check_time[DDIR_TRIM], &td->bw_sample_time,
1826 sizeof(td->bw_sample_time));
1829 memset(bytes_done, 0, sizeof(bytes_done));
1830 clear_state = false;
1832 while (keep_running(td)) {
1833 uint64_t verify_bytes;
1835 fio_gettime(&td->start, NULL);
1836 memcpy(&td->ts_cache, &td->start, sizeof(td->start));
1839 clear_io_state(td, 0);
1841 if (o->unlink_each_loop && unlink_all_files(td))
1845 prune_io_piece_log(td);
1847 if (td->o.verify_only && td_write(td))
1848 verify_bytes = do_dry_run(td);
1850 do_io(td, bytes_done);
1852 if (!ddir_rw_sum(bytes_done)) {
1853 fio_mark_td_terminate(td);
1856 verify_bytes = bytes_done[DDIR_WRITE] +
1857 bytes_done[DDIR_TRIM];
1862 * If we took too long to shut down, the main thread could
1863 * already consider us reaped/exited. If that happens, break
1866 if (td->runstate >= TD_EXITED)
1872 * Make sure we've successfully updated the rusage stats
1873 * before waiting on the stat mutex. Otherwise we could have
1874 * the stat thread holding stat mutex and waiting for
1875 * the rusage_sem, which would never get upped because
1876 * this thread is waiting for the stat mutex.
1878 deadlock_loop_cnt = 0;
1880 check_update_rusage(td);
1881 if (!fio_sem_down_trylock(stat_sem))
1884 if (deadlock_loop_cnt++ > 5000) {
1885 log_err("fio seems to be stuck grabbing stat_sem, forcibly exiting\n");
1886 td->error = EDEADLK;
1891 if (td_read(td) && td->io_bytes[DDIR_READ])
1892 update_runtime(td, elapsed_us, DDIR_READ);
1893 if (td_write(td) && td->io_bytes[DDIR_WRITE])
1894 update_runtime(td, elapsed_us, DDIR_WRITE);
1895 if (td_trim(td) && td->io_bytes[DDIR_TRIM])
1896 update_runtime(td, elapsed_us, DDIR_TRIM);
1897 fio_gettime(&td->start, NULL);
1898 fio_sem_up(stat_sem);
1900 if (td->error || td->terminate)
1903 if (!o->do_verify ||
1904 o->verify == VERIFY_NONE ||
1905 td_ioengine_flagged(td, FIO_UNIDIR))
1908 clear_io_state(td, 0);
1910 fio_gettime(&td->start, NULL);
1912 do_verify(td, verify_bytes);
1915 * See comment further up for why this is done here.
1917 check_update_rusage(td);
1919 fio_sem_down(stat_sem);
1920 update_runtime(td, elapsed_us, DDIR_READ);
1921 fio_gettime(&td->start, NULL);
1922 fio_sem_up(stat_sem);
1924 if (td->error || td->terminate)
1929 * Acquire this lock if we were doing overlap checking in
1930 * offload mode so that we don't clean up this job while
1931 * another thread is checking its io_u's for overlap
1933 if (td_offload_overlap(td)) {
1934 int res = pthread_mutex_lock(&overlap_check);
1937 td_set_runstate(td, TD_FINISHING);
1938 if (td_offload_overlap(td)) {
1939 res = pthread_mutex_unlock(&overlap_check);
1943 update_rusage_stat(td);
1944 td->ts.total_run_time = mtime_since_now(&td->epoch);
1945 for_each_rw_ddir(ddir) {
1946 td->ts.io_bytes[ddir] = td->io_bytes[ddir];
1949 if (td->o.verify_state_save && !(td->flags & TD_F_VSTATE_SAVED) &&
1950 (td->o.verify != VERIFY_NONE && td_write(td)))
1951 verify_save_state(td->thread_number);
1953 fio_unpin_memory(td);
1955 td_writeout_logs(td, true);
1957 iolog_compress_exit(td);
1958 rate_submit_exit(td);
1960 if (o->exec_postrun)
1961 exec_string(o, o->exec_postrun, "postrun");
1963 if (exitall_on_terminate || (o->exitall_error && td->error))
1964 fio_terminate_threads(td->groupid, td->o.exit_what);
1968 log_info("fio: pid=%d, err=%d/%s\n", (int) td->pid, td->error,
1971 if (o->verify_async)
1972 verify_async_exit(td);
1974 close_and_free_files(td);
1977 cgroup_shutdown(td, cgroup_mnt);
1978 verify_free_state(td);
1979 td_zone_free_index(td);
1981 if (fio_option_is_set(o, cpumask)) {
1982 ret = fio_cpuset_exit(&o->cpumask);
1984 td_verror(td, ret, "fio_cpuset_exit");
1988 * do this very late, it will log file closing as well
1990 if (o->write_iolog_file)
1991 write_iolog_close(td);
1992 if (td->io_log_rfile)
1993 fclose(td->io_log_rfile);
1995 td_set_runstate(td, TD_EXITED);
1998 * Do this last after setting our runstate to exited, so we
1999 * know that the stat thread is signaled.
2001 check_update_rusage(td);
2004 return (void *) (uintptr_t) td->error;
2008 * Run over the job map and reap the threads that have exited, if any.
2010 static void reap_threads(unsigned int *nr_running, uint64_t *t_rate,
2013 struct thread_data *td;
2014 unsigned int cputhreads, realthreads, pending;
2018 * reap exited threads (TD_EXITED -> TD_REAPED)
2020 realthreads = pending = cputhreads = 0;
2021 for_each_td(td, i) {
2024 if (!strcmp(td->o.ioengine, "cpuio"))
2033 if (td->runstate == TD_REAPED)
2035 if (td->o.use_thread) {
2036 if (td->runstate == TD_EXITED) {
2037 td_set_runstate(td, TD_REAPED);
2044 if (td->runstate == TD_EXITED)
2048 * check if someone quit or got killed in an unusual way
2050 ret = waitpid(td->pid, &status, flags);
2052 if (errno == ECHILD) {
2053 log_err("fio: pid=%d disappeared %d\n",
2054 (int) td->pid, td->runstate);
2056 td_set_runstate(td, TD_REAPED);
2060 } else if (ret == td->pid) {
2061 if (WIFSIGNALED(status)) {
2062 int sig = WTERMSIG(status);
2064 if (sig != SIGTERM && sig != SIGUSR2)
2065 log_err("fio: pid=%d, got signal=%d\n",
2066 (int) td->pid, sig);
2068 td_set_runstate(td, TD_REAPED);
2071 if (WIFEXITED(status)) {
2072 if (WEXITSTATUS(status) && !td->error)
2073 td->error = WEXITSTATUS(status);
2075 td_set_runstate(td, TD_REAPED);
2081 * If the job is stuck, do a forceful timeout of it and
2084 if (td->terminate &&
2085 td->runstate < TD_FSYNCING &&
2086 time_since_now(&td->terminate_time) >= FIO_REAP_TIMEOUT) {
2087 log_err("fio: job '%s' (state=%d) hasn't exited in "
2088 "%lu seconds, it appears to be stuck. Doing "
2089 "forceful exit of this job.\n",
2090 td->o.name, td->runstate,
2091 (unsigned long) time_since_now(&td->terminate_time));
2092 td_set_runstate(td, TD_REAPED);
2097 * thread is not dead, continue
2103 (*m_rate) -= ddir_rw_sum(td->o.ratemin);
2104 (*t_rate) -= ddir_rw_sum(td->o.rate);
2111 done_secs += mtime_since_now(&td->epoch) / 1000;
2112 profile_td_exit(td);
2116 if (*nr_running == cputhreads && !pending && realthreads)
2117 fio_terminate_threads(TERMINATE_ALL, TERMINATE_ALL);
2120 static bool __check_trigger_file(void)
2127 if (stat(trigger_file, &sb))
2130 if (unlink(trigger_file) < 0)
2131 log_err("fio: failed to unlink %s: %s\n", trigger_file,
2137 static bool trigger_timedout(void)
2139 if (trigger_timeout)
2140 if (time_since_genesis() >= trigger_timeout) {
2141 trigger_timeout = 0;
2148 void exec_trigger(const char *cmd)
2152 if (!cmd || cmd[0] == '\0')
2157 log_err("fio: failed executing %s trigger\n", cmd);
2160 void check_trigger_file(void)
2162 if (__check_trigger_file() || trigger_timedout()) {
2164 fio_clients_send_trigger(trigger_remote_cmd);
2166 verify_save_state(IO_LIST_ALL);
2167 fio_terminate_threads(TERMINATE_ALL, TERMINATE_ALL);
2168 exec_trigger(trigger_cmd);
2173 static int fio_verify_load_state(struct thread_data *td)
2177 if (!td->o.verify_state)
2183 ret = fio_server_get_verify_state(td->o.name,
2184 td->thread_number - 1, &data);
2186 verify_assign_state(td, data);
2188 char prefix[PATH_MAX];
2191 sprintf(prefix, "%s%clocal", aux_path,
2192 FIO_OS_PATH_SEPARATOR);
2194 strcpy(prefix, "local");
2195 ret = verify_load_state(td, prefix);
2201 static void do_usleep(unsigned int usecs)
2203 check_for_running_stats();
2204 check_trigger_file();
2208 static bool check_mount_writes(struct thread_data *td)
2213 if (!td_write(td) || td->o.allow_mounted_write)
2217 * If FIO_HAVE_CHARDEV_SIZE is defined, it's likely that chrdevs
2218 * are mkfs'd and mounted.
2220 for_each_file(td, f, i) {
2221 #ifdef FIO_HAVE_CHARDEV_SIZE
2222 if (f->filetype != FIO_TYPE_BLOCK && f->filetype != FIO_TYPE_CHAR)
2224 if (f->filetype != FIO_TYPE_BLOCK)
2227 if (device_is_mounted(f->file_name))
2233 log_err("fio: %s appears mounted, and 'allow_mounted_write' isn't set. Aborting.\n", f->file_name);
2237 static bool waitee_running(struct thread_data *me)
2239 const char *waitee = me->o.wait_for;
2240 const char *self = me->o.name;
2241 struct thread_data *td;
2247 for_each_td(td, i) {
2248 if (!strcmp(td->o.name, self) || strcmp(td->o.name, waitee))
2251 if (td->runstate < TD_EXITED) {
2252 dprint(FD_PROCESS, "%s fenced by %s(%s)\n",
2254 runstate_to_name(td->runstate));
2259 dprint(FD_PROCESS, "%s: %s completed, can run\n", self, waitee);
2264 * Main function for kicking off and reaping jobs, as needed.
2266 static void run_threads(struct sk_out *sk_out)
2268 struct thread_data *td;
2269 unsigned int i, todo, nr_running, nr_started;
2270 uint64_t m_rate, t_rate;
2273 if (fio_gtod_offload && fio_start_gtod_thread())
2276 fio_idle_prof_init();
2280 nr_thread = nr_process = 0;
2281 for_each_td(td, i) {
2282 if (check_mount_writes(td))
2284 if (td->o.use_thread)
2290 if (output_format & FIO_OUTPUT_NORMAL) {
2291 struct buf_output out;
2293 buf_output_init(&out);
2294 __log_buf(&out, "Starting ");
2296 __log_buf(&out, "%d thread%s", nr_thread,
2297 nr_thread > 1 ? "s" : "");
2300 __log_buf(&out, " and ");
2301 __log_buf(&out, "%d process%s", nr_process,
2302 nr_process > 1 ? "es" : "");
2304 __log_buf(&out, "\n");
2305 log_info_buf(out.buf, out.buflen);
2306 buf_output_free(&out);
2309 todo = thread_number;
2312 m_rate = t_rate = 0;
2314 for_each_td(td, i) {
2315 print_status_init(td->thread_number - 1);
2317 if (!td->o.create_serialize)
2320 if (fio_verify_load_state(td))
2324 * do file setup here so it happens sequentially,
2325 * we don't want X number of threads getting their
2326 * client data interspersed on disk
2328 if (setup_files(td)) {
2332 log_err("fio: pid=%d, err=%d/%s\n",
2333 (int) td->pid, td->error, td->verror);
2334 td_set_runstate(td, TD_REAPED);
2341 * for sharing to work, each job must always open
2342 * its own files. so close them, if we opened them
2345 for_each_file(td, f, j) {
2346 if (fio_file_open(f))
2347 td_io_close_file(td, f);
2352 /* start idle threads before io threads start to run */
2353 fio_idle_prof_start();
2358 struct thread_data *map[REAL_MAX_JOBS];
2359 struct timespec this_start;
2360 int this_jobs = 0, left;
2361 struct fork_data *fd;
2364 * create threads (TD_NOT_CREATED -> TD_CREATED)
2366 for_each_td(td, i) {
2367 if (td->runstate != TD_NOT_CREATED)
2371 * never got a chance to start, killed by other
2372 * thread for some reason
2374 if (td->terminate) {
2379 if (td->o.start_delay) {
2380 spent = utime_since_genesis();
2382 if (td->o.start_delay > spent)
2386 if (td->o.stonewall && (nr_started || nr_running)) {
2387 dprint(FD_PROCESS, "%s: stonewall wait\n",
2392 if (waitee_running(td)) {
2393 dprint(FD_PROCESS, "%s: waiting for %s\n",
2394 td->o.name, td->o.wait_for);
2400 td->rusage_sem = fio_sem_init(FIO_SEM_LOCKED);
2401 td->update_rusage = 0;
2404 * Set state to created. Thread will transition
2405 * to TD_INITIALIZED when it's done setting up.
2407 td_set_runstate(td, TD_CREATED);
2408 map[this_jobs++] = td;
2411 fd = calloc(1, sizeof(*fd));
2413 fd->sk_out = sk_out;
2415 if (td->o.use_thread) {
2418 dprint(FD_PROCESS, "will pthread_create\n");
2419 ret = pthread_create(&td->thread, NULL,
2422 log_err("pthread_create: %s\n",
2429 ret = pthread_detach(td->thread);
2431 log_err("pthread_detach: %s",
2435 struct fio_file **files;
2436 dprint(FD_PROCESS, "will fork\n");
2443 ret = (int)(uintptr_t)thread_main(fd);
2445 } else if (i == fio_debug_jobno)
2446 *fio_debug_jobp = pid;
2447 // freeing previously allocated memory for files
2448 // this memory freed MUST NOT be shared between processes, only the pointer itself may be shared within TD
2453 dprint(FD_MUTEX, "wait on startup_sem\n");
2454 if (fio_sem_down_timeout(startup_sem, 10000)) {
2455 log_err("fio: job startup hung? exiting.\n");
2456 fio_terminate_threads(TERMINATE_ALL, TERMINATE_ALL);
2462 dprint(FD_MUTEX, "done waiting on startup_sem\n");
2466 * Wait for the started threads to transition to
2469 fio_gettime(&this_start, NULL);
2471 while (left && !fio_abort) {
2472 if (mtime_since_now(&this_start) > JOB_START_TIMEOUT)
2477 for (i = 0; i < this_jobs; i++) {
2481 if (td->runstate == TD_INITIALIZED) {
2484 } else if (td->runstate >= TD_EXITED) {
2488 nr_running++; /* work-around... */
2494 log_err("fio: %d job%s failed to start\n", left,
2495 left > 1 ? "s" : "");
2496 for (i = 0; i < this_jobs; i++) {
2500 kill(td->pid, SIGTERM);
2506 * start created threads (TD_INITIALIZED -> TD_RUNNING).
2508 for_each_td(td, i) {
2509 if (td->runstate != TD_INITIALIZED)
2512 if (in_ramp_time(td))
2513 td_set_runstate(td, TD_RAMP);
2515 td_set_runstate(td, TD_RUNNING);
2518 m_rate += ddir_rw_sum(td->o.ratemin);
2519 t_rate += ddir_rw_sum(td->o.rate);
2521 fio_sem_up(td->sem);
2524 reap_threads(&nr_running, &t_rate, &m_rate);
2530 while (nr_running) {
2531 reap_threads(&nr_running, &t_rate, &m_rate);
2535 fio_idle_prof_stop();
2540 static void free_disk_util(void)
2542 disk_util_prune_entries();
2543 helper_thread_destroy();
2546 int fio_backend(struct sk_out *sk_out)
2548 struct thread_data *td;
2552 if (load_profile(exec_profile))
2555 exec_profile = NULL;
2561 struct log_params p = {
2562 .log_type = IO_LOG_TYPE_BW,
2565 setup_log(&agg_io_log[DDIR_READ], &p, "agg-read_bw.log");
2566 setup_log(&agg_io_log[DDIR_WRITE], &p, "agg-write_bw.log");
2567 setup_log(&agg_io_log[DDIR_TRIM], &p, "agg-trim_bw.log");
2570 startup_sem = fio_sem_init(FIO_SEM_LOCKED);
2572 is_local_backend = true;
2573 if (startup_sem == NULL)
2578 if (helper_thread_create(startup_sem, sk_out))
2579 log_err("fio: failed to create helper thread\n");
2581 cgroup_list = smalloc(sizeof(*cgroup_list));
2583 INIT_FLIST_HEAD(cgroup_list);
2585 run_threads(sk_out);
2587 helper_thread_exit();
2592 for (i = 0; i < DDIR_RWDIR_CNT; i++) {
2593 struct io_log *log = agg_io_log[i];
2595 flush_log(log, false);
2601 for_each_td(td, i) {
2602 struct thread_stat *ts = &td->ts;
2604 free_clat_prio_stats(ts);
2605 steadystate_free(td);
2606 fio_options_free(td);
2607 fio_dump_options_free(td);
2608 if (td->rusage_sem) {
2609 fio_sem_remove(td->rusage_sem);
2610 td->rusage_sem = NULL;
2612 fio_sem_remove(td->sem);
2618 cgroup_kill(cgroup_list);
2622 fio_sem_remove(startup_sem);