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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
41 #ifndef FIO_NO_HAVE_SHM_H
52 #include "lib/memalign.h"
54 #include "lib/getrusage.h"
57 #include "workqueue.h"
58 #include "lib/mountcheck.h"
59 #include "rate-submit.h"
60 #include "helper_thread.h"
62 static struct fio_mutex *startup_mutex;
63 static struct flist_head *cgroup_list;
64 static char *cgroup_mnt;
65 static int exit_value;
66 static volatile int fio_abort;
67 static unsigned int nr_process = 0;
68 static unsigned int nr_thread = 0;
70 struct io_log *agg_io_log[DDIR_RWDIR_CNT];
73 unsigned int thread_number = 0;
74 unsigned int stat_number = 0;
77 unsigned long done_secs = 0;
79 #define PAGE_ALIGN(buf) \
80 (char *) (((uintptr_t) (buf) + page_mask) & ~page_mask)
82 #define JOB_START_TIMEOUT (5 * 1000)
84 static void sig_int(int sig)
88 fio_server_got_signal(sig);
90 log_info("\nfio: terminating on signal %d\n", sig);
95 fio_terminate_threads(TERMINATE_ALL);
99 void sig_show_status(int sig)
101 show_running_run_stats();
104 static void set_sig_handlers(void)
106 struct sigaction act;
108 memset(&act, 0, sizeof(act));
109 act.sa_handler = sig_int;
110 act.sa_flags = SA_RESTART;
111 sigaction(SIGINT, &act, NULL);
113 memset(&act, 0, sizeof(act));
114 act.sa_handler = sig_int;
115 act.sa_flags = SA_RESTART;
116 sigaction(SIGTERM, &act, NULL);
118 /* Windows uses SIGBREAK as a quit signal from other applications */
120 memset(&act, 0, sizeof(act));
121 act.sa_handler = sig_int;
122 act.sa_flags = SA_RESTART;
123 sigaction(SIGBREAK, &act, NULL);
126 memset(&act, 0, sizeof(act));
127 act.sa_handler = sig_show_status;
128 act.sa_flags = SA_RESTART;
129 sigaction(SIGUSR1, &act, NULL);
132 memset(&act, 0, sizeof(act));
133 act.sa_handler = sig_int;
134 act.sa_flags = SA_RESTART;
135 sigaction(SIGPIPE, &act, NULL);
140 * Check if we are above the minimum rate given.
142 static bool __check_min_rate(struct thread_data *td, struct timeval *now,
145 unsigned long long bytes = 0;
146 unsigned long iops = 0;
149 unsigned int ratemin = 0;
150 unsigned int rate_iops = 0;
151 unsigned int rate_iops_min = 0;
153 assert(ddir_rw(ddir));
155 if (!td->o.ratemin[ddir] && !td->o.rate_iops_min[ddir])
159 * allow a 2 second settle period in the beginning
161 if (mtime_since(&td->start, now) < 2000)
164 iops += td->this_io_blocks[ddir];
165 bytes += td->this_io_bytes[ddir];
166 ratemin += td->o.ratemin[ddir];
167 rate_iops += td->o.rate_iops[ddir];
168 rate_iops_min += td->o.rate_iops_min[ddir];
171 * if rate blocks is set, sample is running
173 if (td->rate_bytes[ddir] || td->rate_blocks[ddir]) {
174 spent = mtime_since(&td->lastrate[ddir], now);
175 if (spent < td->o.ratecycle)
178 if (td->o.rate[ddir] || td->o.ratemin[ddir]) {
180 * check bandwidth specified rate
182 if (bytes < td->rate_bytes[ddir]) {
183 log_err("%s: min rate %u not met\n", td->o.name,
188 rate = ((bytes - td->rate_bytes[ddir]) * 1000) / spent;
192 if (rate < ratemin ||
193 bytes < td->rate_bytes[ddir]) {
194 log_err("%s: min rate %u not met, got"
195 " %luKB/sec\n", td->o.name,
202 * checks iops specified rate
204 if (iops < rate_iops) {
205 log_err("%s: min iops rate %u not met\n",
206 td->o.name, rate_iops);
210 rate = ((iops - td->rate_blocks[ddir]) * 1000) / spent;
214 if (rate < rate_iops_min ||
215 iops < td->rate_blocks[ddir]) {
216 log_err("%s: min iops rate %u not met,"
217 " got %lu\n", td->o.name,
218 rate_iops_min, rate);
225 td->rate_bytes[ddir] = bytes;
226 td->rate_blocks[ddir] = iops;
227 memcpy(&td->lastrate[ddir], now, sizeof(*now));
231 static bool check_min_rate(struct thread_data *td, struct timeval *now)
235 if (td->bytes_done[DDIR_READ])
236 ret |= __check_min_rate(td, now, DDIR_READ);
237 if (td->bytes_done[DDIR_WRITE])
238 ret |= __check_min_rate(td, now, DDIR_WRITE);
239 if (td->bytes_done[DDIR_TRIM])
240 ret |= __check_min_rate(td, now, DDIR_TRIM);
246 * When job exits, we can cancel the in-flight IO if we are using async
247 * io. Attempt to do so.
249 static void cleanup_pending_aio(struct thread_data *td)
254 * get immediately available events, if any
256 r = io_u_queued_complete(td, 0);
261 * now cancel remaining active events
263 if (td->io_ops->cancel) {
267 io_u_qiter(&td->io_u_all, io_u, i) {
268 if (io_u->flags & IO_U_F_FLIGHT) {
269 r = td->io_ops->cancel(td, io_u);
277 r = io_u_queued_complete(td, td->cur_depth);
281 * Helper to handle the final sync of a file. Works just like the normal
282 * io path, just does everything sync.
284 static bool fio_io_sync(struct thread_data *td, struct fio_file *f)
286 struct io_u *io_u = __get_io_u(td);
292 io_u->ddir = DDIR_SYNC;
295 if (td_io_prep(td, io_u)) {
301 ret = td_io_queue(td, io_u);
303 td_verror(td, io_u->error, "td_io_queue");
306 } else if (ret == FIO_Q_QUEUED) {
307 if (td_io_commit(td))
309 if (io_u_queued_complete(td, 1) < 0)
311 } else if (ret == FIO_Q_COMPLETED) {
313 td_verror(td, io_u->error, "td_io_queue");
317 if (io_u_sync_complete(td, io_u) < 0)
319 } else if (ret == FIO_Q_BUSY) {
320 if (td_io_commit(td))
328 static int fio_file_fsync(struct thread_data *td, struct fio_file *f)
332 if (fio_file_open(f))
333 return fio_io_sync(td, f);
335 if (td_io_open_file(td, f))
338 ret = fio_io_sync(td, f);
339 td_io_close_file(td, f);
343 static inline void __update_tv_cache(struct thread_data *td)
345 fio_gettime(&td->tv_cache, NULL);
348 static inline void update_tv_cache(struct thread_data *td)
350 if ((++td->tv_cache_nr & td->tv_cache_mask) == td->tv_cache_mask)
351 __update_tv_cache(td);
354 static inline bool runtime_exceeded(struct thread_data *td, struct timeval *t)
356 if (in_ramp_time(td))
360 if (utime_since(&td->epoch, t) >= td->o.timeout)
367 * We need to update the runtime consistently in ms, but keep a running
368 * tally of the current elapsed time in microseconds for sub millisecond
371 static inline void update_runtime(struct thread_data *td,
372 unsigned long long *elapsed_us,
373 const enum fio_ddir ddir)
375 if (ddir == DDIR_WRITE && td_write(td) && td->o.verify_only)
378 td->ts.runtime[ddir] -= (elapsed_us[ddir] + 999) / 1000;
379 elapsed_us[ddir] += utime_since_now(&td->start);
380 td->ts.runtime[ddir] += (elapsed_us[ddir] + 999) / 1000;
383 static bool break_on_this_error(struct thread_data *td, enum fio_ddir ddir,
388 if (ret < 0 || td->error) {
390 enum error_type_bit eb;
395 eb = td_error_type(ddir, err);
396 if (!(td->o.continue_on_error & (1 << eb)))
399 if (td_non_fatal_error(td, eb, err)) {
401 * Continue with the I/Os in case of
404 update_error_count(td, err);
408 } else if (td->o.fill_device && err == ENOSPC) {
410 * We expect to hit this error if
411 * fill_device option is set.
414 fio_mark_td_terminate(td);
418 * Stop the I/O in case of a fatal
421 update_error_count(td, err);
429 static void check_update_rusage(struct thread_data *td)
431 if (td->update_rusage) {
432 td->update_rusage = 0;
433 update_rusage_stat(td);
434 fio_mutex_up(td->rusage_sem);
438 static int wait_for_completions(struct thread_data *td, struct timeval *time)
440 const int full = queue_full(td);
444 if (td->flags & TD_F_REGROW_LOGS) {
445 ret = io_u_quiesce(td);
451 * if the queue is full, we MUST reap at least 1 event
453 min_evts = min(td->o.iodepth_batch_complete_min, td->cur_depth);
454 if ((full && !min_evts) || !td->o.iodepth_batch_complete_min)
457 if (time && (__should_check_rate(td, DDIR_READ) ||
458 __should_check_rate(td, DDIR_WRITE) ||
459 __should_check_rate(td, DDIR_TRIM)))
460 fio_gettime(time, NULL);
463 ret = io_u_queued_complete(td, min_evts);
466 } while (full && (td->cur_depth > td->o.iodepth_low));
471 int io_queue_event(struct thread_data *td, struct io_u *io_u, int *ret,
472 enum fio_ddir ddir, uint64_t *bytes_issued, int from_verify,
473 struct timeval *comp_time)
478 case FIO_Q_COMPLETED:
481 clear_io_u(td, io_u);
482 } else if (io_u->resid) {
483 int bytes = io_u->xfer_buflen - io_u->resid;
484 struct fio_file *f = io_u->file;
487 *bytes_issued += bytes;
490 trim_io_piece(td, io_u);
497 unlog_io_piece(td, io_u);
498 td_verror(td, EIO, "full resid");
503 io_u->xfer_buflen = io_u->resid;
504 io_u->xfer_buf += bytes;
505 io_u->offset += bytes;
507 if (ddir_rw(io_u->ddir))
508 td->ts.short_io_u[io_u->ddir]++;
511 if (io_u->offset == f->real_file_size)
514 requeue_io_u(td, &io_u);
517 if (comp_time && (__should_check_rate(td, DDIR_READ) ||
518 __should_check_rate(td, DDIR_WRITE) ||
519 __should_check_rate(td, DDIR_TRIM)))
520 fio_gettime(comp_time, NULL);
522 *ret = io_u_sync_complete(td, io_u);
527 if (td->flags & TD_F_REGROW_LOGS)
531 * when doing I/O (not when verifying),
532 * check for any errors that are to be ignored
540 * if the engine doesn't have a commit hook,
541 * the io_u is really queued. if it does have such
542 * a hook, it has to call io_u_queued() itself.
544 if (td->io_ops->commit == NULL)
545 io_u_queued(td, io_u);
547 *bytes_issued += io_u->xfer_buflen;
551 unlog_io_piece(td, io_u);
552 requeue_io_u(td, &io_u);
553 ret2 = td_io_commit(td);
559 td_verror(td, -(*ret), "td_io_queue");
563 if (break_on_this_error(td, ddir, ret))
569 static inline bool io_in_polling(struct thread_data *td)
571 return !td->o.iodepth_batch_complete_min &&
572 !td->o.iodepth_batch_complete_max;
576 * The main verify engine. Runs over the writes we previously submitted,
577 * reads the blocks back in, and checks the crc/md5 of the data.
579 static void do_verify(struct thread_data *td, uint64_t verify_bytes)
586 dprint(FD_VERIFY, "starting loop\n");
589 * sync io first and invalidate cache, to make sure we really
592 for_each_file(td, f, i) {
593 if (!fio_file_open(f))
595 if (fio_io_sync(td, f))
597 if (file_invalidate_cache(td, f))
601 check_update_rusage(td);
606 td_set_runstate(td, TD_VERIFYING);
609 while (!td->terminate) {
614 check_update_rusage(td);
616 if (runtime_exceeded(td, &td->tv_cache)) {
617 __update_tv_cache(td);
618 if (runtime_exceeded(td, &td->tv_cache)) {
619 fio_mark_td_terminate(td);
624 if (flow_threshold_exceeded(td))
627 if (!td->o.experimental_verify) {
628 io_u = __get_io_u(td);
632 if (get_next_verify(td, io_u)) {
637 if (td_io_prep(td, io_u)) {
642 if (ddir_rw_sum(td->bytes_done) + td->o.rw_min_bs > verify_bytes)
645 while ((io_u = get_io_u(td)) != NULL) {
653 * We are only interested in the places where
654 * we wrote or trimmed IOs. Turn those into
655 * reads for verification purposes.
657 if (io_u->ddir == DDIR_READ) {
659 * Pretend we issued it for rwmix
662 td->io_issues[DDIR_READ]++;
665 } else if (io_u->ddir == DDIR_TRIM) {
666 io_u->ddir = DDIR_READ;
667 io_u_set(io_u, IO_U_F_TRIMMED);
669 } else if (io_u->ddir == DDIR_WRITE) {
670 io_u->ddir = DDIR_READ;
682 if (verify_state_should_stop(td, io_u)) {
687 if (td->o.verify_async)
688 io_u->end_io = verify_io_u_async;
690 io_u->end_io = verify_io_u;
693 if (!td->o.disable_slat)
694 fio_gettime(&io_u->start_time, NULL);
696 ret = td_io_queue(td, io_u);
698 if (io_queue_event(td, io_u, &ret, ddir, NULL, 1, NULL))
702 * if we can queue more, do so. but check if there are
703 * completed io_u's first. Note that we can get BUSY even
704 * without IO queued, if the system is resource starved.
707 full = queue_full(td) || (ret == FIO_Q_BUSY && td->cur_depth);
708 if (full || io_in_polling(td))
709 ret = wait_for_completions(td, NULL);
715 check_update_rusage(td);
718 min_events = td->cur_depth;
721 ret = io_u_queued_complete(td, min_events);
723 cleanup_pending_aio(td);
725 td_set_runstate(td, TD_RUNNING);
727 dprint(FD_VERIFY, "exiting loop\n");
730 static bool exceeds_number_ios(struct thread_data *td)
732 unsigned long long number_ios;
734 if (!td->o.number_ios)
737 number_ios = ddir_rw_sum(td->io_blocks);
738 number_ios += td->io_u_queued + td->io_u_in_flight;
740 return number_ios >= (td->o.number_ios * td->loops);
743 static bool io_issue_bytes_exceeded(struct thread_data *td)
745 unsigned long long bytes, limit;
748 bytes = td->io_issue_bytes[DDIR_READ] + td->io_issue_bytes[DDIR_WRITE];
749 else if (td_write(td))
750 bytes = td->io_issue_bytes[DDIR_WRITE];
751 else if (td_read(td))
752 bytes = td->io_issue_bytes[DDIR_READ];
754 bytes = td->io_issue_bytes[DDIR_TRIM];
757 limit = td->o.io_limit;
762 return bytes >= limit || exceeds_number_ios(td);
765 static bool io_complete_bytes_exceeded(struct thread_data *td)
767 unsigned long long bytes, limit;
770 bytes = td->this_io_bytes[DDIR_READ] + td->this_io_bytes[DDIR_WRITE];
771 else if (td_write(td))
772 bytes = td->this_io_bytes[DDIR_WRITE];
773 else if (td_read(td))
774 bytes = td->this_io_bytes[DDIR_READ];
776 bytes = td->this_io_bytes[DDIR_TRIM];
779 limit = td->o.io_limit;
784 return bytes >= limit || exceeds_number_ios(td);
788 * used to calculate the next io time for rate control
791 static long long usec_for_io(struct thread_data *td, enum fio_ddir ddir)
793 uint64_t secs, remainder, bps, bytes, iops;
795 assert(!(td->flags & TD_F_CHILD));
796 bytes = td->rate_io_issue_bytes[ddir];
797 bps = td->rate_bps[ddir];
799 if (td->o.rate_process == RATE_PROCESS_POISSON) {
801 iops = bps / td->o.bs[ddir];
802 val = (int64_t) (1000000 / iops) *
803 -logf(__rand_0_1(&td->poisson_state));
805 dprint(FD_RATE, "poisson rate iops=%llu\n",
806 (unsigned long long) 1000000 / val);
808 td->last_usec += val;
809 return td->last_usec;
812 remainder = bytes % bps;
813 return remainder * 1000000 / bps + secs * 1000000;
820 * Main IO worker function. It retrieves io_u's to process and queues
821 * and reaps them, checking for rate and errors along the way.
823 * Returns number of bytes written and trimmed.
825 static void do_io(struct thread_data *td, uint64_t *bytes_done)
829 uint64_t total_bytes, bytes_issued = 0;
831 for (i = 0; i < DDIR_RWDIR_CNT; i++)
832 bytes_done[i] = td->bytes_done[i];
834 if (in_ramp_time(td))
835 td_set_runstate(td, TD_RAMP);
837 td_set_runstate(td, TD_RUNNING);
841 total_bytes = td->o.size;
843 * Allow random overwrite workloads to write up to io_limit
844 * before starting verification phase as 'size' doesn't apply.
846 if (td_write(td) && td_random(td) && td->o.norandommap)
847 total_bytes = max(total_bytes, (uint64_t) td->o.io_limit);
849 * If verify_backlog is enabled, we'll run the verify in this
850 * handler as well. For that case, we may need up to twice the
853 if (td->o.verify != VERIFY_NONE &&
854 (td_write(td) && td->o.verify_backlog))
855 total_bytes += td->o.size;
857 /* In trimwrite mode, each byte is trimmed and then written, so
858 * allow total_bytes to be twice as big */
859 if (td_trimwrite(td))
860 total_bytes += td->total_io_size;
862 while ((td->o.read_iolog_file && !flist_empty(&td->io_log_list)) ||
863 (!flist_empty(&td->trim_list)) || !io_issue_bytes_exceeded(td) ||
865 struct timeval comp_time;
870 check_update_rusage(td);
872 if (td->terminate || td->done)
877 if (runtime_exceeded(td, &td->tv_cache)) {
878 __update_tv_cache(td);
879 if (runtime_exceeded(td, &td->tv_cache)) {
880 fio_mark_td_terminate(td);
885 if (flow_threshold_exceeded(td))
889 * Break if we exceeded the bytes. The exception is time
890 * based runs, but we still need to break out of the loop
891 * for those to run verification, if enabled.
893 if (bytes_issued >= total_bytes &&
894 (!td->o.time_based ||
895 (td->o.time_based && td->o.verify != VERIFY_NONE)))
899 if (IS_ERR_OR_NULL(io_u)) {
900 int err = PTR_ERR(io_u);
907 if (td->o.latency_target)
915 * Add verification end_io handler if:
916 * - Asked to verify (!td_rw(td))
917 * - Or the io_u is from our verify list (mixed write/ver)
919 if (td->o.verify != VERIFY_NONE && io_u->ddir == DDIR_READ &&
920 ((io_u->flags & IO_U_F_VER_LIST) || !td_rw(td))) {
922 if (!td->o.verify_pattern_bytes) {
923 io_u->rand_seed = __rand(&td->verify_state);
924 if (sizeof(int) != sizeof(long *))
925 io_u->rand_seed *= __rand(&td->verify_state);
928 if (verify_state_should_stop(td, io_u)) {
933 if (td->o.verify_async)
934 io_u->end_io = verify_io_u_async;
936 io_u->end_io = verify_io_u;
937 td_set_runstate(td, TD_VERIFYING);
938 } else if (in_ramp_time(td))
939 td_set_runstate(td, TD_RAMP);
941 td_set_runstate(td, TD_RUNNING);
944 * Always log IO before it's issued, so we know the specific
945 * order of it. The logged unit will track when the IO has
948 if (td_write(td) && io_u->ddir == DDIR_WRITE &&
950 td->o.verify != VERIFY_NONE &&
951 !td->o.experimental_verify)
952 log_io_piece(td, io_u);
954 if (td->o.io_submit_mode == IO_MODE_OFFLOAD) {
955 const unsigned long blen = io_u->xfer_buflen;
956 const enum fio_ddir ddir = acct_ddir(io_u);
961 workqueue_enqueue(&td->io_wq, &io_u->work);
965 td->io_issues[ddir]++;
966 td->io_issue_bytes[ddir] += blen;
967 td->rate_io_issue_bytes[ddir] += blen;
970 if (should_check_rate(td))
971 td->rate_next_io_time[ddir] = usec_for_io(td, ddir);
974 ret = td_io_queue(td, io_u);
976 if (should_check_rate(td))
977 td->rate_next_io_time[ddir] = usec_for_io(td, ddir);
979 if (io_queue_event(td, io_u, &ret, ddir, &bytes_issued, 0, &comp_time))
983 * See if we need to complete some commands. Note that
984 * we can get BUSY even without IO queued, if the
985 * system is resource starved.
988 full = queue_full(td) ||
989 (ret == FIO_Q_BUSY && td->cur_depth);
990 if (full || io_in_polling(td))
991 ret = wait_for_completions(td, &comp_time);
995 if (!ddir_rw_sum(td->bytes_done) &&
996 !(td->io_ops->flags & FIO_NOIO))
999 if (!in_ramp_time(td) && should_check_rate(td)) {
1000 if (check_min_rate(td, &comp_time)) {
1001 if (exitall_on_terminate || td->o.exitall_error)
1002 fio_terminate_threads(td->groupid);
1003 td_verror(td, EIO, "check_min_rate");
1007 if (!in_ramp_time(td) && td->o.latency_target)
1008 lat_target_check(td);
1010 if (td->o.thinktime) {
1011 unsigned long long b;
1013 b = ddir_rw_sum(td->io_blocks);
1014 if (!(b % td->o.thinktime_blocks)) {
1019 if (td->o.thinktime_spin)
1020 usec_spin(td->o.thinktime_spin);
1022 left = td->o.thinktime - td->o.thinktime_spin;
1024 usec_sleep(td, left);
1029 check_update_rusage(td);
1031 if (td->trim_entries)
1032 log_err("fio: %lu trim entries leaked?\n", td->trim_entries);
1034 if (td->o.fill_device && td->error == ENOSPC) {
1036 fio_mark_td_terminate(td);
1041 if (td->o.io_submit_mode == IO_MODE_OFFLOAD) {
1042 workqueue_flush(&td->io_wq);
1048 ret = io_u_queued_complete(td, i);
1049 if (td->o.fill_device && td->error == ENOSPC)
1053 if (should_fsync(td) && td->o.end_fsync) {
1054 td_set_runstate(td, TD_FSYNCING);
1056 for_each_file(td, f, i) {
1057 if (!fio_file_fsync(td, f))
1060 log_err("fio: end_fsync failed for file %s\n",
1065 cleanup_pending_aio(td);
1068 * stop job if we failed doing any IO
1070 if (!ddir_rw_sum(td->this_io_bytes))
1073 for (i = 0; i < DDIR_RWDIR_CNT; i++)
1074 bytes_done[i] = td->bytes_done[i] - bytes_done[i];
1077 static void free_file_completion_logging(struct thread_data *td)
1082 for_each_file(td, f, i) {
1083 if (!f->last_write_comp)
1085 sfree(f->last_write_comp);
1089 static int init_file_completion_logging(struct thread_data *td,
1095 if (td->o.verify == VERIFY_NONE || !td->o.verify_state_save)
1098 for_each_file(td, f, i) {
1099 f->last_write_comp = scalloc(depth, sizeof(uint64_t));
1100 if (!f->last_write_comp)
1107 free_file_completion_logging(td);
1108 log_err("fio: failed to alloc write comp data\n");
1112 static void cleanup_io_u(struct thread_data *td)
1116 while ((io_u = io_u_qpop(&td->io_u_freelist)) != NULL) {
1118 if (td->io_ops->io_u_free)
1119 td->io_ops->io_u_free(td, io_u);
1121 fio_memfree(io_u, sizeof(*io_u));
1126 io_u_rexit(&td->io_u_requeues);
1127 io_u_qexit(&td->io_u_freelist);
1128 io_u_qexit(&td->io_u_all);
1130 free_file_completion_logging(td);
1133 static int init_io_u(struct thread_data *td)
1136 unsigned int max_bs, min_write;
1137 int cl_align, i, max_units;
1138 int data_xfer = 1, err;
1141 max_units = td->o.iodepth;
1142 max_bs = td_max_bs(td);
1143 min_write = td->o.min_bs[DDIR_WRITE];
1144 td->orig_buffer_size = (unsigned long long) max_bs
1145 * (unsigned long long) max_units;
1147 if ((td->io_ops->flags & FIO_NOIO) || !(td_read(td) || td_write(td)))
1151 err += io_u_rinit(&td->io_u_requeues, td->o.iodepth);
1152 err += io_u_qinit(&td->io_u_freelist, td->o.iodepth);
1153 err += io_u_qinit(&td->io_u_all, td->o.iodepth);
1156 log_err("fio: failed setting up IO queues\n");
1161 * if we may later need to do address alignment, then add any
1162 * possible adjustment here so that we don't cause a buffer
1163 * overflow later. this adjustment may be too much if we get
1164 * lucky and the allocator gives us an aligned address.
1166 if (td->o.odirect || td->o.mem_align || td->o.oatomic ||
1167 (td->io_ops->flags & FIO_RAWIO))
1168 td->orig_buffer_size += page_mask + td->o.mem_align;
1170 if (td->o.mem_type == MEM_SHMHUGE || td->o.mem_type == MEM_MMAPHUGE) {
1173 bs = td->orig_buffer_size + td->o.hugepage_size - 1;
1174 td->orig_buffer_size = bs & ~(td->o.hugepage_size - 1);
1177 if (td->orig_buffer_size != (size_t) td->orig_buffer_size) {
1178 log_err("fio: IO memory too large. Reduce max_bs or iodepth\n");
1182 if (data_xfer && allocate_io_mem(td))
1185 if (td->o.odirect || td->o.mem_align || td->o.oatomic ||
1186 (td->io_ops->flags & FIO_RAWIO))
1187 p = PAGE_ALIGN(td->orig_buffer) + td->o.mem_align;
1189 p = td->orig_buffer;
1191 cl_align = os_cache_line_size();
1193 for (i = 0; i < max_units; i++) {
1199 ptr = fio_memalign(cl_align, sizeof(*io_u));
1201 log_err("fio: unable to allocate aligned memory\n");
1206 memset(io_u, 0, sizeof(*io_u));
1207 INIT_FLIST_HEAD(&io_u->verify_list);
1208 dprint(FD_MEM, "io_u alloc %p, index %u\n", io_u, i);
1212 dprint(FD_MEM, "io_u %p, mem %p\n", io_u, io_u->buf);
1215 io_u_fill_buffer(td, io_u, min_write, max_bs);
1216 if (td_write(td) && td->o.verify_pattern_bytes) {
1218 * Fill the buffer with the pattern if we are
1219 * going to be doing writes.
1221 fill_verify_pattern(td, io_u->buf, max_bs, io_u, 0, 0);
1226 io_u->flags = IO_U_F_FREE;
1227 io_u_qpush(&td->io_u_freelist, io_u);
1230 * io_u never leaves this stack, used for iteration of all
1233 io_u_qpush(&td->io_u_all, io_u);
1235 if (td->io_ops->io_u_init) {
1236 int ret = td->io_ops->io_u_init(td, io_u);
1239 log_err("fio: failed to init engine data: %d\n", ret);
1247 if (init_file_completion_logging(td, max_units))
1253 static int switch_ioscheduler(struct thread_data *td)
1255 char tmp[256], tmp2[128];
1259 if (td->io_ops->flags & FIO_DISKLESSIO)
1262 sprintf(tmp, "%s/queue/scheduler", td->sysfs_root);
1264 f = fopen(tmp, "r+");
1266 if (errno == ENOENT) {
1267 log_err("fio: os or kernel doesn't support IO scheduler"
1271 td_verror(td, errno, "fopen iosched");
1278 ret = fwrite(td->o.ioscheduler, strlen(td->o.ioscheduler), 1, f);
1279 if (ferror(f) || ret != 1) {
1280 td_verror(td, errno, "fwrite");
1288 * Read back and check that the selected scheduler is now the default.
1290 memset(tmp, 0, sizeof(tmp));
1291 ret = fread(tmp, sizeof(tmp), 1, f);
1292 if (ferror(f) || ret < 0) {
1293 td_verror(td, errno, "fread");
1298 * either a list of io schedulers or "none\n" is expected.
1300 tmp[strlen(tmp) - 1] = '\0';
1303 sprintf(tmp2, "[%s]", td->o.ioscheduler);
1304 if (!strstr(tmp, tmp2)) {
1305 log_err("fio: io scheduler %s not found\n", td->o.ioscheduler);
1306 td_verror(td, EINVAL, "iosched_switch");
1315 static bool keep_running(struct thread_data *td)
1317 unsigned long long limit;
1321 if (td->o.time_based)
1327 if (exceeds_number_ios(td))
1331 limit = td->o.io_limit;
1335 if (limit != -1ULL && ddir_rw_sum(td->io_bytes) < limit) {
1339 * If the difference is less than the minimum IO size, we
1342 diff = limit - ddir_rw_sum(td->io_bytes);
1343 if (diff < td_max_bs(td))
1346 if (fio_files_done(td) && !td->o.io_limit)
1355 static int exec_string(struct thread_options *o, const char *string, const char *mode)
1357 size_t newlen = strlen(string) + strlen(o->name) + strlen(mode) + 9 + 1;
1361 str = malloc(newlen);
1362 sprintf(str, "%s &> %s.%s.txt", string, o->name, mode);
1364 log_info("%s : Saving output of %s in %s.%s.txt\n",o->name, mode, o->name, mode);
1367 log_err("fio: exec of cmd <%s> failed\n", str);
1374 * Dry run to compute correct state of numberio for verification.
1376 static uint64_t do_dry_run(struct thread_data *td)
1378 td_set_runstate(td, TD_RUNNING);
1380 while ((td->o.read_iolog_file && !flist_empty(&td->io_log_list)) ||
1381 (!flist_empty(&td->trim_list)) || !io_complete_bytes_exceeded(td)) {
1385 if (td->terminate || td->done)
1388 io_u = get_io_u(td);
1392 io_u_set(io_u, IO_U_F_FLIGHT);
1395 if (ddir_rw(acct_ddir(io_u)))
1396 td->io_issues[acct_ddir(io_u)]++;
1397 if (ddir_rw(io_u->ddir)) {
1398 io_u_mark_depth(td, 1);
1399 td->ts.total_io_u[io_u->ddir]++;
1402 if (td_write(td) && io_u->ddir == DDIR_WRITE &&
1404 td->o.verify != VERIFY_NONE &&
1405 !td->o.experimental_verify)
1406 log_io_piece(td, io_u);
1408 ret = io_u_sync_complete(td, io_u);
1412 return td->bytes_done[DDIR_WRITE] + td->bytes_done[DDIR_TRIM];
1416 struct thread_data *td;
1417 struct sk_out *sk_out;
1421 * Entry point for the thread based jobs. The process based jobs end up
1422 * here as well, after a little setup.
1424 static void *thread_main(void *data)
1426 struct fork_data *fd = data;
1427 unsigned long long elapsed_us[DDIR_RWDIR_CNT] = { 0, };
1428 struct thread_data *td = fd->td;
1429 struct thread_options *o = &td->o;
1430 struct sk_out *sk_out = fd->sk_out;
1434 sk_out_assign(sk_out);
1437 if (!o->use_thread) {
1443 fio_local_clock_init(o->use_thread);
1445 dprint(FD_PROCESS, "jobs pid=%d started\n", (int) td->pid);
1448 fio_server_send_start(td);
1450 INIT_FLIST_HEAD(&td->io_log_list);
1451 INIT_FLIST_HEAD(&td->io_hist_list);
1452 INIT_FLIST_HEAD(&td->verify_list);
1453 INIT_FLIST_HEAD(&td->trim_list);
1454 INIT_FLIST_HEAD(&td->next_rand_list);
1455 td->io_hist_tree = RB_ROOT;
1457 ret = mutex_cond_init_pshared(&td->io_u_lock, &td->free_cond);
1459 td_verror(td, ret, "mutex_cond_init_pshared");
1462 ret = cond_init_pshared(&td->verify_cond);
1464 td_verror(td, ret, "mutex_cond_pshared");
1468 td_set_runstate(td, TD_INITIALIZED);
1469 dprint(FD_MUTEX, "up startup_mutex\n");
1470 fio_mutex_up(startup_mutex);
1471 dprint(FD_MUTEX, "wait on td->mutex\n");
1472 fio_mutex_down(td->mutex);
1473 dprint(FD_MUTEX, "done waiting on td->mutex\n");
1476 * A new gid requires privilege, so we need to do this before setting
1479 if (o->gid != -1U && setgid(o->gid)) {
1480 td_verror(td, errno, "setgid");
1483 if (o->uid != -1U && setuid(o->uid)) {
1484 td_verror(td, errno, "setuid");
1489 * Do this early, we don't want the compress threads to be limited
1490 * to the same CPUs as the IO workers. So do this before we set
1491 * any potential CPU affinity
1493 if (iolog_compress_init(td, sk_out))
1497 * If we have a gettimeofday() thread, make sure we exclude that
1498 * thread from this job
1501 fio_cpu_clear(&o->cpumask, o->gtod_cpu);
1504 * Set affinity first, in case it has an impact on the memory
1507 if (fio_option_is_set(o, cpumask)) {
1508 if (o->cpus_allowed_policy == FIO_CPUS_SPLIT) {
1509 ret = fio_cpus_split(&o->cpumask, td->thread_number - 1);
1511 log_err("fio: no CPUs set\n");
1512 log_err("fio: Try increasing number of available CPUs\n");
1513 td_verror(td, EINVAL, "cpus_split");
1517 ret = fio_setaffinity(td->pid, o->cpumask);
1519 td_verror(td, errno, "cpu_set_affinity");
1524 #ifdef CONFIG_LIBNUMA
1525 /* numa node setup */
1526 if (fio_option_is_set(o, numa_cpunodes) ||
1527 fio_option_is_set(o, numa_memnodes)) {
1528 struct bitmask *mask;
1530 if (numa_available() < 0) {
1531 td_verror(td, errno, "Does not support NUMA API\n");
1535 if (fio_option_is_set(o, numa_cpunodes)) {
1536 mask = numa_parse_nodestring(o->numa_cpunodes);
1537 ret = numa_run_on_node_mask(mask);
1538 numa_free_nodemask(mask);
1540 td_verror(td, errno, \
1541 "numa_run_on_node_mask failed\n");
1546 if (fio_option_is_set(o, numa_memnodes)) {
1548 if (o->numa_memnodes)
1549 mask = numa_parse_nodestring(o->numa_memnodes);
1551 switch (o->numa_mem_mode) {
1552 case MPOL_INTERLEAVE:
1553 numa_set_interleave_mask(mask);
1556 numa_set_membind(mask);
1559 numa_set_localalloc();
1561 case MPOL_PREFERRED:
1562 numa_set_preferred(o->numa_mem_prefer_node);
1570 numa_free_nodemask(mask);
1576 if (fio_pin_memory(td))
1580 * May alter parameters that init_io_u() will use, so we need to
1589 if (o->verify_async && verify_async_init(td))
1592 if (fio_option_is_set(o, ioprio) ||
1593 fio_option_is_set(o, ioprio_class)) {
1594 ret = ioprio_set(IOPRIO_WHO_PROCESS, 0, o->ioprio_class, o->ioprio);
1596 td_verror(td, errno, "ioprio_set");
1601 if (o->cgroup && cgroup_setup(td, cgroup_list, &cgroup_mnt))
1605 if (nice(o->nice) == -1 && errno != 0) {
1606 td_verror(td, errno, "nice");
1610 if (o->ioscheduler && switch_ioscheduler(td))
1613 if (!o->create_serialize && setup_files(td))
1619 if (init_random_map(td))
1622 if (o->exec_prerun && exec_string(o, o->exec_prerun, (const char *)"prerun"))
1626 if (pre_read_files(td) < 0)
1630 fio_verify_init(td);
1632 if (rate_submit_init(td, sk_out))
1635 fio_gettime(&td->epoch, NULL);
1636 fio_getrusage(&td->ru_start);
1637 memcpy(&td->bw_sample_time, &td->epoch, sizeof(td->epoch));
1638 memcpy(&td->iops_sample_time, &td->epoch, sizeof(td->epoch));
1640 if (o->ratemin[DDIR_READ] || o->ratemin[DDIR_WRITE] ||
1641 o->ratemin[DDIR_TRIM]) {
1642 memcpy(&td->lastrate[DDIR_READ], &td->bw_sample_time,
1643 sizeof(td->bw_sample_time));
1644 memcpy(&td->lastrate[DDIR_WRITE], &td->bw_sample_time,
1645 sizeof(td->bw_sample_time));
1646 memcpy(&td->lastrate[DDIR_TRIM], &td->bw_sample_time,
1647 sizeof(td->bw_sample_time));
1651 while (keep_running(td)) {
1652 uint64_t verify_bytes;
1654 fio_gettime(&td->start, NULL);
1655 memcpy(&td->tv_cache, &td->start, sizeof(td->start));
1658 clear_io_state(td, 0);
1660 prune_io_piece_log(td);
1662 if (td->o.verify_only && (td_write(td) || td_rw(td)))
1663 verify_bytes = do_dry_run(td);
1665 uint64_t bytes_done[DDIR_RWDIR_CNT];
1667 do_io(td, bytes_done);
1669 if (!ddir_rw_sum(bytes_done)) {
1670 fio_mark_td_terminate(td);
1673 verify_bytes = bytes_done[DDIR_WRITE] +
1674 bytes_done[DDIR_TRIM];
1681 * Make sure we've successfully updated the rusage stats
1682 * before waiting on the stat mutex. Otherwise we could have
1683 * the stat thread holding stat mutex and waiting for
1684 * the rusage_sem, which would never get upped because
1685 * this thread is waiting for the stat mutex.
1687 check_update_rusage(td);
1689 fio_mutex_down(stat_mutex);
1690 if (td_read(td) && td->io_bytes[DDIR_READ])
1691 update_runtime(td, elapsed_us, DDIR_READ);
1692 if (td_write(td) && td->io_bytes[DDIR_WRITE])
1693 update_runtime(td, elapsed_us, DDIR_WRITE);
1694 if (td_trim(td) && td->io_bytes[DDIR_TRIM])
1695 update_runtime(td, elapsed_us, DDIR_TRIM);
1696 fio_gettime(&td->start, NULL);
1697 fio_mutex_up(stat_mutex);
1699 if (td->error || td->terminate)
1702 if (!o->do_verify ||
1703 o->verify == VERIFY_NONE ||
1704 (td->io_ops->flags & FIO_UNIDIR))
1707 clear_io_state(td, 0);
1709 fio_gettime(&td->start, NULL);
1711 do_verify(td, verify_bytes);
1714 * See comment further up for why this is done here.
1716 check_update_rusage(td);
1718 fio_mutex_down(stat_mutex);
1719 update_runtime(td, elapsed_us, DDIR_READ);
1720 fio_gettime(&td->start, NULL);
1721 fio_mutex_up(stat_mutex);
1723 if (td->error || td->terminate)
1727 td_set_runstate(td, TD_FINISHING);
1729 update_rusage_stat(td);
1730 td->ts.total_run_time = mtime_since_now(&td->epoch);
1731 td->ts.io_bytes[DDIR_READ] = td->io_bytes[DDIR_READ];
1732 td->ts.io_bytes[DDIR_WRITE] = td->io_bytes[DDIR_WRITE];
1733 td->ts.io_bytes[DDIR_TRIM] = td->io_bytes[DDIR_TRIM];
1735 if (td->o.verify_state_save && !(td->flags & TD_F_VSTATE_SAVED) &&
1736 (td->o.verify != VERIFY_NONE && td_write(td)))
1737 verify_save_state(td->thread_number);
1739 fio_unpin_memory(td);
1741 td_writeout_logs(td, true);
1743 iolog_compress_exit(td);
1744 rate_submit_exit(td);
1746 if (o->exec_postrun)
1747 exec_string(o, o->exec_postrun, (const char *)"postrun");
1749 if (exitall_on_terminate || (o->exitall_error && td->error))
1750 fio_terminate_threads(td->groupid);
1754 log_info("fio: pid=%d, err=%d/%s\n", (int) td->pid, td->error,
1757 if (o->verify_async)
1758 verify_async_exit(td);
1760 close_and_free_files(td);
1763 cgroup_shutdown(td, &cgroup_mnt);
1764 verify_free_state(td);
1766 if (td->zone_state_index) {
1769 for (i = 0; i < DDIR_RWDIR_CNT; i++)
1770 free(td->zone_state_index[i]);
1771 free(td->zone_state_index);
1772 td->zone_state_index = NULL;
1775 if (fio_option_is_set(o, cpumask)) {
1776 ret = fio_cpuset_exit(&o->cpumask);
1778 td_verror(td, ret, "fio_cpuset_exit");
1782 * do this very late, it will log file closing as well
1784 if (o->write_iolog_file)
1785 write_iolog_close(td);
1787 fio_mutex_remove(td->mutex);
1790 td_set_runstate(td, TD_EXITED);
1793 * Do this last after setting our runstate to exited, so we
1794 * know that the stat thread is signaled.
1796 check_update_rusage(td);
1799 return (void *) (uintptr_t) td->error;
1802 static void dump_td_info(struct thread_data *td)
1804 log_err("fio: job '%s' (state=%d) hasn't exited in %lu seconds, it "
1805 "appears to be stuck. Doing forceful exit of this job.\n",
1806 td->o.name, td->runstate,
1807 (unsigned long) time_since_now(&td->terminate_time));
1811 * Run over the job map and reap the threads that have exited, if any.
1813 static void reap_threads(unsigned int *nr_running, unsigned int *t_rate,
1814 unsigned int *m_rate)
1816 struct thread_data *td;
1817 unsigned int cputhreads, realthreads, pending;
1821 * reap exited threads (TD_EXITED -> TD_REAPED)
1823 realthreads = pending = cputhreads = 0;
1824 for_each_td(td, i) {
1828 * ->io_ops is NULL for a thread that has closed its
1831 if (td->io_ops && !strcmp(td->io_ops->name, "cpuio"))
1840 if (td->runstate == TD_REAPED)
1842 if (td->o.use_thread) {
1843 if (td->runstate == TD_EXITED) {
1844 td_set_runstate(td, TD_REAPED);
1851 if (td->runstate == TD_EXITED)
1855 * check if someone quit or got killed in an unusual way
1857 ret = waitpid(td->pid, &status, flags);
1859 if (errno == ECHILD) {
1860 log_err("fio: pid=%d disappeared %d\n",
1861 (int) td->pid, td->runstate);
1863 td_set_runstate(td, TD_REAPED);
1867 } else if (ret == td->pid) {
1868 if (WIFSIGNALED(status)) {
1869 int sig = WTERMSIG(status);
1871 if (sig != SIGTERM && sig != SIGUSR2)
1872 log_err("fio: pid=%d, got signal=%d\n",
1873 (int) td->pid, sig);
1875 td_set_runstate(td, TD_REAPED);
1878 if (WIFEXITED(status)) {
1879 if (WEXITSTATUS(status) && !td->error)
1880 td->error = WEXITSTATUS(status);
1882 td_set_runstate(td, TD_REAPED);
1888 * If the job is stuck, do a forceful timeout of it and
1891 if (td->terminate &&
1892 td->runstate < TD_FSYNCING &&
1893 time_since_now(&td->terminate_time) >= FIO_REAP_TIMEOUT) {
1895 td_set_runstate(td, TD_REAPED);
1900 * thread is not dead, continue
1906 (*m_rate) -= ddir_rw_sum(td->o.ratemin);
1907 (*t_rate) -= ddir_rw_sum(td->o.rate);
1914 done_secs += mtime_since_now(&td->epoch) / 1000;
1915 profile_td_exit(td);
1918 if (*nr_running == cputhreads && !pending && realthreads)
1919 fio_terminate_threads(TERMINATE_ALL);
1922 static bool __check_trigger_file(void)
1929 if (stat(trigger_file, &sb))
1932 if (unlink(trigger_file) < 0)
1933 log_err("fio: failed to unlink %s: %s\n", trigger_file,
1939 static bool trigger_timedout(void)
1941 if (trigger_timeout)
1942 return time_since_genesis() >= trigger_timeout;
1947 void exec_trigger(const char *cmd)
1956 log_err("fio: failed executing %s trigger\n", cmd);
1959 void check_trigger_file(void)
1961 if (__check_trigger_file() || trigger_timedout()) {
1963 fio_clients_send_trigger(trigger_remote_cmd);
1965 verify_save_state(IO_LIST_ALL);
1966 fio_terminate_threads(TERMINATE_ALL);
1967 exec_trigger(trigger_cmd);
1972 static int fio_verify_load_state(struct thread_data *td)
1976 if (!td->o.verify_state)
1982 ret = fio_server_get_verify_state(td->o.name,
1983 td->thread_number - 1, &data);
1985 verify_assign_state(td, data);
1987 ret = verify_load_state(td, "local");
1992 static void do_usleep(unsigned int usecs)
1994 check_for_running_stats();
1995 check_trigger_file();
1999 static bool check_mount_writes(struct thread_data *td)
2004 if (!td_write(td) || td->o.allow_mounted_write)
2007 for_each_file(td, f, i) {
2008 if (f->filetype != FIO_TYPE_BD)
2010 if (device_is_mounted(f->file_name))
2016 log_err("fio: %s appears mounted, and 'allow_mounted_write' isn't set. Aborting.", f->file_name);
2020 static bool waitee_running(struct thread_data *me)
2022 const char *waitee = me->o.wait_for;
2023 const char *self = me->o.name;
2024 struct thread_data *td;
2030 for_each_td(td, i) {
2031 if (!strcmp(td->o.name, self) || strcmp(td->o.name, waitee))
2034 if (td->runstate < TD_EXITED) {
2035 dprint(FD_PROCESS, "%s fenced by %s(%s)\n",
2037 runstate_to_name(td->runstate));
2042 dprint(FD_PROCESS, "%s: %s completed, can run\n", self, waitee);
2047 * Main function for kicking off and reaping jobs, as needed.
2049 static void run_threads(struct sk_out *sk_out)
2051 struct thread_data *td;
2052 unsigned int i, todo, nr_running, m_rate, t_rate, nr_started;
2055 if (fio_gtod_offload && fio_start_gtod_thread())
2058 fio_idle_prof_init();
2062 nr_thread = nr_process = 0;
2063 for_each_td(td, i) {
2064 if (check_mount_writes(td))
2066 if (td->o.use_thread)
2072 if (output_format & FIO_OUTPUT_NORMAL) {
2073 log_info("Starting ");
2075 log_info("%d thread%s", nr_thread,
2076 nr_thread > 1 ? "s" : "");
2080 log_info("%d process%s", nr_process,
2081 nr_process > 1 ? "es" : "");
2087 todo = thread_number;
2090 m_rate = t_rate = 0;
2092 for_each_td(td, i) {
2093 print_status_init(td->thread_number - 1);
2095 if (!td->o.create_serialize)
2098 if (fio_verify_load_state(td))
2102 * do file setup here so it happens sequentially,
2103 * we don't want X number of threads getting their
2104 * client data interspersed on disk
2106 if (setup_files(td)) {
2110 log_err("fio: pid=%d, err=%d/%s\n",
2111 (int) td->pid, td->error, td->verror);
2112 td_set_runstate(td, TD_REAPED);
2119 * for sharing to work, each job must always open
2120 * its own files. so close them, if we opened them
2123 for_each_file(td, f, j) {
2124 if (fio_file_open(f))
2125 td_io_close_file(td, f);
2130 /* start idle threads before io threads start to run */
2131 fio_idle_prof_start();
2136 struct thread_data *map[REAL_MAX_JOBS];
2137 struct timeval this_start;
2138 int this_jobs = 0, left;
2139 struct fork_data *fd;
2142 * create threads (TD_NOT_CREATED -> TD_CREATED)
2144 for_each_td(td, i) {
2145 if (td->runstate != TD_NOT_CREATED)
2149 * never got a chance to start, killed by other
2150 * thread for some reason
2152 if (td->terminate) {
2157 if (td->o.start_delay) {
2158 spent = utime_since_genesis();
2160 if (td->o.start_delay > spent)
2164 if (td->o.stonewall && (nr_started || nr_running)) {
2165 dprint(FD_PROCESS, "%s: stonewall wait\n",
2170 if (waitee_running(td)) {
2171 dprint(FD_PROCESS, "%s: waiting for %s\n",
2172 td->o.name, td->o.wait_for);
2178 td->rusage_sem = fio_mutex_init(FIO_MUTEX_LOCKED);
2179 td->update_rusage = 0;
2182 * Set state to created. Thread will transition
2183 * to TD_INITIALIZED when it's done setting up.
2185 td_set_runstate(td, TD_CREATED);
2186 map[this_jobs++] = td;
2189 fd = calloc(1, sizeof(*fd));
2191 fd->sk_out = sk_out;
2193 if (td->o.use_thread) {
2196 dprint(FD_PROCESS, "will pthread_create\n");
2197 ret = pthread_create(&td->thread, NULL,
2200 log_err("pthread_create: %s\n",
2206 ret = pthread_detach(td->thread);
2208 log_err("pthread_detach: %s",
2212 dprint(FD_PROCESS, "will fork\n");
2217 ret = (int)(uintptr_t)thread_main(fd);
2219 } else if (i == fio_debug_jobno)
2220 *fio_debug_jobp = pid;
2222 dprint(FD_MUTEX, "wait on startup_mutex\n");
2223 if (fio_mutex_down_timeout(startup_mutex, 10000)) {
2224 log_err("fio: job startup hung? exiting.\n");
2225 fio_terminate_threads(TERMINATE_ALL);
2230 dprint(FD_MUTEX, "done waiting on startup_mutex\n");
2234 * Wait for the started threads to transition to
2237 fio_gettime(&this_start, NULL);
2239 while (left && !fio_abort) {
2240 if (mtime_since_now(&this_start) > JOB_START_TIMEOUT)
2245 for (i = 0; i < this_jobs; i++) {
2249 if (td->runstate == TD_INITIALIZED) {
2252 } else if (td->runstate >= TD_EXITED) {
2256 nr_running++; /* work-around... */
2262 log_err("fio: %d job%s failed to start\n", left,
2263 left > 1 ? "s" : "");
2264 for (i = 0; i < this_jobs; i++) {
2268 kill(td->pid, SIGTERM);
2274 * start created threads (TD_INITIALIZED -> TD_RUNNING).
2276 for_each_td(td, i) {
2277 if (td->runstate != TD_INITIALIZED)
2280 if (in_ramp_time(td))
2281 td_set_runstate(td, TD_RAMP);
2283 td_set_runstate(td, TD_RUNNING);
2286 m_rate += ddir_rw_sum(td->o.ratemin);
2287 t_rate += ddir_rw_sum(td->o.rate);
2289 fio_mutex_up(td->mutex);
2292 reap_threads(&nr_running, &t_rate, &m_rate);
2298 while (nr_running) {
2299 reap_threads(&nr_running, &t_rate, &m_rate);
2303 fio_idle_prof_stop();
2308 static void free_disk_util(void)
2310 disk_util_prune_entries();
2311 helper_thread_destroy();
2314 int fio_backend(struct sk_out *sk_out)
2316 struct thread_data *td;
2320 if (load_profile(exec_profile))
2323 exec_profile = NULL;
2329 struct log_params p = {
2330 .log_type = IO_LOG_TYPE_BW,
2333 setup_log(&agg_io_log[DDIR_READ], &p, "agg-read_bw.log");
2334 setup_log(&agg_io_log[DDIR_WRITE], &p, "agg-write_bw.log");
2335 setup_log(&agg_io_log[DDIR_TRIM], &p, "agg-trim_bw.log");
2338 startup_mutex = fio_mutex_init(FIO_MUTEX_LOCKED);
2339 if (startup_mutex == NULL)
2344 helper_thread_create(startup_mutex, sk_out);
2346 cgroup_list = smalloc(sizeof(*cgroup_list));
2347 INIT_FLIST_HEAD(cgroup_list);
2349 run_threads(sk_out);
2351 helper_thread_exit();
2356 for (i = 0; i < DDIR_RWDIR_CNT; i++) {
2357 struct io_log *log = agg_io_log[i];
2365 for_each_td(td, i) {
2366 fio_options_free(td);
2367 if (td->rusage_sem) {
2368 fio_mutex_remove(td->rusage_sem);
2369 td->rusage_sem = NULL;
2374 cgroup_kill(cgroup_list);
2378 fio_mutex_remove(startup_mutex);