2 * fio - the flexible io tester
4 * Copyright (C) 2005 Jens Axboe <axboe@suse.de>
5 * Copyright (C) 2006 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 unsigned long page_mask;
42 unsigned long page_size;
44 (char *) (((unsigned long) (buf) + page_mask) & ~page_mask)
47 int thread_number = 0;
53 static struct fio_mutex *startup_mutex;
54 static volatile int fio_abort;
55 static int exit_value;
57 struct io_log *agg_io_log[2];
59 #define TERMINATE_ALL (-1)
60 #define JOB_START_TIMEOUT (5 * 1000)
62 static inline void td_set_runstate(struct thread_data *td, int runstate)
64 dprint(FD_PROCESS, "pid=%d: runstate %d -> %d\n", td->pid, td->runstate,
66 td->runstate = runstate;
69 static void terminate_threads(int group_id)
71 struct thread_data *td;
75 if (group_id == TERMINATE_ALL || groupid == td->groupid) {
76 dprint(FD_PROCESS, "setting terminate on %d\n",td->pid);
79 td->o.start_delay = 0;
82 * if the thread is running, just let it exit
84 if (td->runstate < TD_RUNNING)
85 kill(td->pid, SIGQUIT);
87 struct ioengine_ops *ops = td->io_ops;
89 if (ops && (ops->flags & FIO_SIGQUIT))
90 kill(td->pid, SIGQUIT);
96 static void sig_handler(int sig)
101 disk_util_timer_arm();
102 print_thread_status();
105 printf("\nfio: terminating on signal %d\n", sig);
107 terminate_threads(TERMINATE_ALL);
113 * Check if we are above the minimum rate given.
115 static int check_min_rate(struct thread_data *td, struct timeval *now)
117 unsigned long long bytes = 0;
118 unsigned long iops = 0;
123 * No minimum rate set, always ok
125 if (!td->o.ratemin && !td->o.rate_iops_min)
129 * allow a 2 second settle period in the beginning
131 if (mtime_since(&td->start, now) < 2000)
135 iops += td->io_blocks[DDIR_READ];
136 bytes += td->this_io_bytes[DDIR_READ];
139 iops += td->io_blocks[DDIR_WRITE];
140 bytes += td->this_io_bytes[DDIR_WRITE];
144 * if rate blocks is set, sample is running
146 if (td->rate_bytes || td->rate_blocks) {
147 spent = mtime_since(&td->lastrate, now);
148 if (spent < td->o.ratecycle)
153 * check bandwidth specified rate
155 if (bytes < td->rate_bytes) {
156 log_err("%s: min rate %u not met\n", td->o.name, td->o.ratemin);
159 rate = (bytes - td->rate_bytes) / spent;
160 if (rate < td->o.ratemin || bytes < td->rate_bytes) {
161 log_err("%s: min rate %u not met, got %luKiB/sec\n", td->o.name, td->o.ratemin, rate);
167 * checks iops specified rate
169 if (iops < td->o.rate_iops) {
170 log_err("%s: min iops rate %u not met\n", td->o.name, td->o.rate_iops);
173 rate = (iops - td->rate_blocks) / spent;
174 if (rate < td->o.rate_iops_min || iops < td->rate_blocks) {
175 log_err("%s: min iops rate %u not met, got %lu\n", td->o.name, td->o.rate_iops_min, rate);
181 td->rate_bytes = bytes;
182 td->rate_blocks = iops;
183 memcpy(&td->lastrate, now, sizeof(*now));
187 static inline int runtime_exceeded(struct thread_data *td, struct timeval *t)
191 if (mtime_since(&td->epoch, t) >= td->o.timeout * 1000)
198 * When job exits, we can cancel the in-flight IO if we are using async
199 * io. Attempt to do so.
201 static void cleanup_pending_aio(struct thread_data *td)
203 struct list_head *entry, *n;
208 * get immediately available events, if any
210 r = io_u_queued_complete(td, 0);
215 * now cancel remaining active events
217 if (td->io_ops->cancel) {
218 list_for_each_safe(entry, n, &td->io_u_busylist) {
219 io_u = list_entry(entry, struct io_u, list);
222 * if the io_u isn't in flight, then that generally
223 * means someone leaked an io_u. complain but fix
224 * it up, so we don't stall here.
226 if ((io_u->flags & IO_U_F_FLIGHT) == 0) {
227 log_err("fio: non-busy IO on busy list\n");
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 int fio_io_sync(struct thread_data *td, struct fio_file *f)
247 struct io_u *io_u = __get_io_u(td);
253 io_u->ddir = DDIR_SYNC;
256 if (td_io_prep(td, io_u)) {
262 ret = td_io_queue(td, io_u);
264 td_verror(td, io_u->error, "td_io_queue");
267 } else if (ret == FIO_Q_QUEUED) {
268 if (io_u_queued_complete(td, 1) < 0)
270 } else if (ret == FIO_Q_COMPLETED) {
272 td_verror(td, io_u->error, "td_io_queue");
276 if (io_u_sync_complete(td, io_u) < 0)
278 } else if (ret == FIO_Q_BUSY) {
279 if (td_io_commit(td))
288 * The main verify engine. Runs over the writes we previously submitted,
289 * reads the blocks back in, and checks the crc/md5 of the data.
291 static void do_verify(struct thread_data *td)
299 * sync io first and invalidate cache, to make sure we really
302 for_each_file(td, f, i) {
303 if (!(f->flags & FIO_FILE_OPEN))
305 if (fio_io_sync(td, f))
307 if (file_invalidate_cache(td, f))
314 td_set_runstate(td, TD_VERIFYING);
317 while (!td->terminate) {
320 io_u = __get_io_u(td);
324 if (runtime_exceeded(td, &io_u->start_time)) {
330 if (get_next_verify(td, io_u)) {
335 if (td_io_prep(td, io_u)) {
340 io_u->end_io = verify_io_u;
342 ret = td_io_queue(td, io_u);
344 case FIO_Q_COMPLETED:
347 else if (io_u->resid) {
348 int bytes = io_u->xfer_buflen - io_u->resid;
349 struct fio_file *f = io_u->file;
355 td_verror(td, ENODATA, "full resid");
360 io_u->xfer_buflen = io_u->resid;
361 io_u->xfer_buf += bytes;
362 io_u->offset += bytes;
364 td->ts.short_io_u[io_u->ddir]++;
366 if (io_u->offset == f->real_file_size)
369 requeue_io_u(td, &io_u);
372 ret = io_u_sync_complete(td, io_u);
380 requeue_io_u(td, &io_u);
381 ret2 = td_io_commit(td);
387 td_verror(td, -ret, "td_io_queue");
391 if (ret < 0 || td->error)
395 * if we can queue more, do so. but check if there are
396 * completed io_u's first.
399 if (queue_full(td) || ret == FIO_Q_BUSY) {
402 if (td->cur_depth > td->o.iodepth_low)
403 min_events = td->cur_depth - td->o.iodepth_low;
407 * Reap required number of io units, if any, and do the
408 * verification on them through the callback handler
410 if (io_u_queued_complete(td, min_events) < 0)
415 min_events = td->cur_depth;
418 ret = io_u_queued_complete(td, min_events);
420 cleanup_pending_aio(td);
422 td_set_runstate(td, TD_RUNNING);
426 * Main IO worker function. It retrieves io_u's to process and queues
427 * and reaps them, checking for rate and errors along the way.
429 static void do_io(struct thread_data *td)
436 td_set_runstate(td, TD_RUNNING);
438 while ((td->this_io_bytes[0] + td->this_io_bytes[1]) < td->o.size) {
439 struct timeval comp_time;
452 memcpy(&s, &io_u->start_time, sizeof(s));
454 if (runtime_exceeded(td, &s)) {
461 * Add verification end_io handler, if asked to verify
462 * a previously written file.
464 if (td->o.verify != VERIFY_NONE)
465 io_u->end_io = verify_io_u;
467 ret = td_io_queue(td, io_u);
469 case FIO_Q_COMPLETED:
472 else if (io_u->resid) {
473 int bytes = io_u->xfer_buflen - io_u->resid;
474 struct fio_file *f = io_u->file;
480 td_verror(td, ENODATA, "full resid");
485 io_u->xfer_buflen = io_u->resid;
486 io_u->xfer_buf += bytes;
487 io_u->offset += bytes;
489 td->ts.short_io_u[io_u->ddir]++;
491 if (io_u->offset == f->real_file_size)
494 requeue_io_u(td, &io_u);
497 fio_gettime(&comp_time, NULL);
498 bytes_done = io_u_sync_complete(td, io_u);
505 * if the engine doesn't have a commit hook,
506 * the io_u is really queued. if it does have such
507 * a hook, it has to call io_u_queued() itself.
509 if (td->io_ops->commit == NULL)
510 io_u_queued(td, io_u);
513 requeue_io_u(td, &io_u);
514 ret2 = td_io_commit(td);
524 if (ret < 0 || td->error)
528 * See if we need to complete some commands
530 if (ret == FIO_Q_QUEUED || ret == FIO_Q_BUSY) {
532 if (queue_full(td) || ret == FIO_Q_BUSY) {
535 if (td->cur_depth > td->o.iodepth_low)
536 min_evts = td->cur_depth - td->o.iodepth_low;
539 fio_gettime(&comp_time, NULL);
540 bytes_done = io_u_queued_complete(td, min_evts);
549 * the rate is batched for now, it should work for batches
550 * of completions except the very first one which may look
553 usec = utime_since(&s, &comp_time);
555 rate_throttle(td, usec, bytes_done);
557 if (check_min_rate(td, &comp_time)) {
558 if (exitall_on_terminate)
559 terminate_threads(td->groupid);
560 td_verror(td, ENODATA, "check_min_rate");
564 if (td->o.thinktime) {
565 unsigned long long b;
567 b = td->io_blocks[0] + td->io_blocks[1];
568 if (!(b % td->o.thinktime_blocks)) {
571 if (td->o.thinktime_spin)
572 __usec_sleep(td->o.thinktime_spin);
574 left = td->o.thinktime - td->o.thinktime_spin;
576 usec_sleep(td, left);
581 if (td->o.fill_device && td->error == ENOSPC) {
590 ret = io_u_queued_complete(td, i);
592 if (should_fsync(td) && td->o.end_fsync) {
593 td_set_runstate(td, TD_FSYNCING);
595 for_each_file(td, f, i) {
596 if (!(f->flags & FIO_FILE_OPEN))
602 cleanup_pending_aio(td);
605 * stop job if we failed doing any IO
607 if ((td->this_io_bytes[0] + td->this_io_bytes[1]) == 0)
611 static void cleanup_io_u(struct thread_data *td)
613 struct list_head *entry, *n;
616 list_for_each_safe(entry, n, &td->io_u_freelist) {
617 io_u = list_entry(entry, struct io_u, list);
619 list_del(&io_u->list);
627 * "randomly" fill the buffer contents
629 static void fill_io_buf(struct thread_data *td, struct io_u *io_u, int max_bs)
631 long *ptr = io_u->buf;
633 if (!td->o.zero_buffers) {
634 while ((void *) ptr - io_u->buf < max_bs) {
635 *ptr = rand() * GOLDEN_RATIO_PRIME;
639 memset(ptr, 0, max_bs);
642 static int init_io_u(struct thread_data *td)
649 max_units = td->o.iodepth;
650 max_bs = max(td->o.max_bs[DDIR_READ], td->o.max_bs[DDIR_WRITE]);
651 td->orig_buffer_size = (unsigned long long) max_bs * (unsigned long long) max_units;
653 if (td->o.mem_type == MEM_SHMHUGE || td->o.mem_type == MEM_MMAPHUGE)
654 td->orig_buffer_size = (td->orig_buffer_size + td->o.hugepage_size - 1) & ~(td->o.hugepage_size - 1);
656 if (td->orig_buffer_size != (size_t) td->orig_buffer_size) {
657 log_err("fio: IO memory too large. Reduce max_bs or iodepth\n");
661 if (allocate_io_mem(td))
665 p = ALIGN(td->orig_buffer);
669 for (i = 0; i < max_units; i++) {
672 io_u = malloc(sizeof(*io_u));
673 memset(io_u, 0, sizeof(*io_u));
674 INIT_LIST_HEAD(&io_u->list);
676 if (!(td->io_ops->flags & FIO_NOIO)) {
677 io_u->buf = p + max_bs * i;
680 fill_io_buf(td, io_u, max_bs);
684 io_u->flags = IO_U_F_FREE;
685 list_add(&io_u->list, &td->io_u_freelist);
693 static int switch_ioscheduler(struct thread_data *td)
695 char tmp[256], tmp2[128];
699 if (td->io_ops->flags & FIO_DISKLESSIO)
702 sprintf(tmp, "%s/queue/scheduler", td->sysfs_root);
704 f = fopen(tmp, "r+");
706 if (errno == ENOENT) {
707 log_err("fio: os or kernel doesn't support IO scheduler switching\n");
710 td_verror(td, errno, "fopen iosched");
717 ret = fwrite(td->o.ioscheduler, strlen(td->o.ioscheduler), 1, f);
718 if (ferror(f) || ret != 1) {
719 td_verror(td, errno, "fwrite");
727 * Read back and check that the selected scheduler is now the default.
729 ret = fread(tmp, 1, sizeof(tmp), f);
730 if (ferror(f) || ret < 0) {
731 td_verror(td, errno, "fread");
736 sprintf(tmp2, "[%s]", td->o.ioscheduler);
737 if (!strstr(tmp, tmp2)) {
738 log_err("fio: io scheduler %s not found\n", td->o.ioscheduler);
739 td_verror(td, EINVAL, "iosched_switch");
748 static int keep_running(struct thread_data *td)
750 unsigned long long io_done;
754 if (td->o.time_based)
761 io_done = td->io_bytes[DDIR_READ] + td->io_bytes[DDIR_WRITE] + td->io_skip_bytes;
762 if (io_done < td->o.size)
768 static int clear_io_state(struct thread_data *td)
774 td->ts.stat_io_bytes[0] = td->ts.stat_io_bytes[1] = 0;
775 td->this_io_bytes[0] = td->this_io_bytes[1] = 0;
779 td->rw_end_set[0] = td->rw_end_set[1] = 0;
781 td->last_was_sync = 0;
784 * reset file done count if we are to start over
786 if (td->o.time_based || td->o.loops)
787 td->nr_done_files = 0;
792 for_each_file(td, f, i) {
793 f->flags &= ~FIO_FILE_DONE;
794 ret = td_io_open_file(td, f);
803 * Entry point for the thread based jobs. The process based jobs end up
804 * here as well, after a little setup.
806 static void *thread_main(void *data)
808 unsigned long long runtime[2], elapsed;
809 struct thread_data *td = data;
812 if (!td->o.use_thread)
817 dprint(FD_PROCESS, "jobs pid=%d started\n", td->pid);
819 INIT_LIST_HEAD(&td->io_u_freelist);
820 INIT_LIST_HEAD(&td->io_u_busylist);
821 INIT_LIST_HEAD(&td->io_u_requeues);
822 INIT_LIST_HEAD(&td->io_log_list);
823 INIT_LIST_HEAD(&td->io_hist_list);
824 td->io_hist_tree = RB_ROOT;
826 td_set_runstate(td, TD_INITIALIZED);
827 fio_mutex_up(startup_mutex);
828 fio_mutex_down(td->mutex);
831 * the ->mutex mutex is now no longer used, close it to avoid
832 * eating a file descriptor
834 fio_mutex_remove(td->mutex);
837 * May alter parameters that init_io_u() will use, so we need to
846 if (td->o.cpumask_set && fio_setaffinity(td) == -1) {
847 td_verror(td, errno, "cpu_set_affinity");
851 if (td->ioprio_set) {
852 if (ioprio_set(IOPRIO_WHO_PROCESS, 0, td->ioprio) == -1) {
853 td_verror(td, errno, "ioprio_set");
858 if (nice(td->o.nice) == -1) {
859 td_verror(td, errno, "nice");
863 if (td->o.ioscheduler && switch_ioscheduler(td))
866 if (!td->o.create_serialize && setup_files(td))
875 if (init_random_map(td))
878 if (td->o.exec_prerun) {
879 if (system(td->o.exec_prerun) < 0)
883 fio_gettime(&td->epoch, NULL);
884 memcpy(&td->timeout_end, &td->epoch, sizeof(td->epoch));
885 getrusage(RUSAGE_SELF, &td->ts.ru_start);
887 runtime[0] = runtime[1] = 0;
889 while (keep_running(td)) {
890 fio_gettime(&td->start, NULL);
891 memcpy(&td->ts.stat_sample_time, &td->start, sizeof(td->start));
894 memcpy(&td->lastrate, &td->ts.stat_sample_time, sizeof(td->lastrate));
896 if (clear_state && clear_io_state(td))
899 prune_io_piece_log(td);
905 if (td_read(td) && td->io_bytes[DDIR_READ]) {
906 if (td->rw_end_set[DDIR_READ])
907 elapsed = utime_since(&td->start, &td->rw_end[DDIR_READ]);
909 elapsed = utime_since_now(&td->start);
911 runtime[DDIR_READ] += elapsed;
913 if (td_write(td) && td->io_bytes[DDIR_WRITE]) {
914 if (td->rw_end_set[DDIR_WRITE])
915 elapsed = utime_since(&td->start, &td->rw_end[DDIR_WRITE]);
917 elapsed = utime_since_now(&td->start);
919 runtime[DDIR_WRITE] += elapsed;
922 if (td->error || td->terminate)
925 if (!td->o.do_verify ||
926 td->o.verify == VERIFY_NONE ||
927 (td->io_ops->flags & FIO_UNIDIR))
930 if (clear_io_state(td))
933 fio_gettime(&td->start, NULL);
937 runtime[DDIR_READ] += utime_since_now(&td->start);
939 if (td->error || td->terminate)
943 update_rusage_stat(td);
944 td->ts.runtime[0] = (runtime[0] + 999) / 1000;
945 td->ts.runtime[1] = (runtime[1] + 999) / 1000;
946 td->ts.total_run_time = mtime_since_now(&td->epoch);
947 td->ts.io_bytes[0] = td->io_bytes[0];
948 td->ts.io_bytes[1] = td->io_bytes[1];
951 finish_log(td, td->ts.bw_log, "bw");
953 finish_log(td, td->ts.slat_log, "slat");
955 finish_log(td, td->ts.clat_log, "clat");
956 if (td->o.exec_postrun) {
957 if (system(td->o.exec_postrun) < 0)
958 log_err("fio: postrun %s failed\n", td->o.exec_postrun);
961 if (exitall_on_terminate)
962 terminate_threads(td->groupid);
966 printf("fio: pid=%d, err=%d/%s\n", td->pid, td->error, td->verror);
967 close_and_free_files(td);
972 * do this very late, it will log file closing as well
974 if (td->o.write_iolog_file)
975 write_iolog_close(td);
977 options_mem_free(td);
978 td_set_runstate(td, TD_EXITED);
979 return (void *) (unsigned long) td->error;
983 * We cannot pass the td data into a forked process, so attach the td and
984 * pass it to the thread worker.
986 static int fork_main(int shmid, int offset)
988 struct thread_data *td;
991 data = shmat(shmid, NULL, 0);
992 if (data == (void *) -1) {
999 td = data + offset * sizeof(struct thread_data);
1000 ret = thread_main(td);
1002 return (int) (unsigned long) ret;
1006 * Run over the job map and reap the threads that have exited, if any.
1008 static void reap_threads(int *nr_running, int *t_rate, int *m_rate)
1010 struct thread_data *td;
1011 int i, cputhreads, realthreads, pending, status, ret;
1014 * reap exited threads (TD_EXITED -> TD_REAPED)
1016 realthreads = pending = cputhreads = 0;
1017 for_each_td(td, i) {
1021 * ->io_ops is NULL for a thread that has closed its
1024 if (td->io_ops && !strcmp(td->io_ops->name, "cpuio"))
1033 if (td->runstate == TD_REAPED)
1035 if (td->o.use_thread) {
1036 if (td->runstate == TD_EXITED) {
1037 td_set_runstate(td, TD_REAPED);
1044 if (td->runstate == TD_EXITED)
1048 * check if someone quit or got killed in an unusual way
1050 ret = waitpid(td->pid, &status, flags);
1052 if (errno == ECHILD) {
1053 log_err("fio: pid=%d disappeared %d\n", td->pid, td->runstate);
1054 td_set_runstate(td, TD_REAPED);
1058 } else if (ret == td->pid) {
1059 if (WIFSIGNALED(status)) {
1060 int sig = WTERMSIG(status);
1063 log_err("fio: pid=%d, got signal=%d\n", td->pid, sig);
1064 td_set_runstate(td, TD_REAPED);
1067 if (WIFEXITED(status)) {
1068 if (WEXITSTATUS(status) && !td->error)
1069 td->error = WEXITSTATUS(status);
1071 td_set_runstate(td, TD_REAPED);
1077 * thread is not dead, continue
1082 if (td->o.use_thread) {
1085 dprint(FD_PROCESS, "joining tread %d\n", td->pid);
1086 if (pthread_join(td->thread, (void *) &ret)) {
1087 dprint(FD_PROCESS, "join failed %ld\n", ret);
1088 perror("pthread_join");
1093 (*m_rate) -= td->o.ratemin;
1094 (*t_rate) -= td->o.rate;
1101 if (*nr_running == cputhreads && !pending && realthreads)
1102 terminate_threads(TERMINATE_ALL);
1106 * Main function for kicking off and reaping jobs, as needed.
1108 static void run_threads(void)
1110 struct thread_data *td;
1111 unsigned long spent;
1112 int i, todo, nr_running, m_rate, t_rate, nr_started;
1114 if (fio_pin_memory())
1117 if (!terse_output) {
1118 printf("Starting ");
1120 printf("%d thread%s", nr_thread, nr_thread > 1 ? "s" : "");
1124 printf("%d process%s", nr_process, nr_process > 1 ? "es" : "");
1130 signal(SIGINT, sig_handler);
1131 signal(SIGALRM, sig_handler);
1133 todo = thread_number;
1136 m_rate = t_rate = 0;
1138 for_each_td(td, i) {
1139 print_status_init(td->thread_number - 1);
1141 if (!td->o.create_serialize) {
1147 * do file setup here so it happens sequentially,
1148 * we don't want X number of threads getting their
1149 * client data interspersed on disk
1151 if (setup_files(td)) {
1154 log_err("fio: pid=%d, err=%d/%s\n", td->pid, td->error, td->verror);
1155 td_set_runstate(td, TD_REAPED);
1162 * for sharing to work, each job must always open
1163 * its own files. so close them, if we opened them
1166 for_each_file(td, f, i)
1167 td_io_close_file(td, f);
1176 struct thread_data *map[MAX_JOBS];
1177 struct timeval this_start;
1178 int this_jobs = 0, left;
1181 * create threads (TD_NOT_CREATED -> TD_CREATED)
1183 for_each_td(td, i) {
1184 if (td->runstate != TD_NOT_CREATED)
1188 * never got a chance to start, killed by other
1189 * thread for some reason
1191 if (td->terminate) {
1196 if (td->o.start_delay) {
1197 spent = mtime_since_genesis();
1199 if (td->o.start_delay * 1000 > spent)
1203 if (td->o.stonewall && (nr_started || nr_running))
1207 * Set state to created. Thread will transition
1208 * to TD_INITIALIZED when it's done setting up.
1210 td_set_runstate(td, TD_CREATED);
1211 map[this_jobs++] = td;
1214 if (td->o.use_thread) {
1215 dprint(FD_PROCESS, "will pthread_create\n");
1216 if (pthread_create(&td->thread, NULL, thread_main, td)) {
1217 perror("thread_create");
1222 dprint(FD_PROCESS, "will fork\n");
1224 int ret = fork_main(shm_id, i);
1229 fio_mutex_down(startup_mutex);
1233 * Wait for the started threads to transition to
1236 fio_gettime(&this_start, NULL);
1238 while (left && !fio_abort) {
1239 if (mtime_since_now(&this_start) > JOB_START_TIMEOUT)
1244 for (i = 0; i < this_jobs; i++) {
1248 if (td->runstate == TD_INITIALIZED) {
1251 } else if (td->runstate >= TD_EXITED) {
1255 nr_running++; /* work-around... */
1261 log_err("fio: %d jobs failed to start\n", left);
1262 for (i = 0; i < this_jobs; i++) {
1266 kill(td->pid, SIGTERM);
1272 * start created threads (TD_INITIALIZED -> TD_RUNNING).
1274 for_each_td(td, i) {
1275 if (td->runstate != TD_INITIALIZED)
1278 td_set_runstate(td, TD_RUNNING);
1281 m_rate += td->o.ratemin;
1282 t_rate += td->o.rate;
1284 fio_mutex_up(td->mutex);
1287 reap_threads(&nr_running, &t_rate, &m_rate);
1293 while (nr_running) {
1294 reap_threads(&nr_running, &t_rate, &m_rate);
1302 int main(int argc, char *argv[])
1309 * We need locale for number printing, if it isn't set then just
1310 * go with the US format.
1312 if (!getenv("LC_NUMERIC"))
1313 setlocale(LC_NUMERIC, "en_US");
1315 if (parse_options(argc, argv))
1321 ps = sysconf(_SC_PAGESIZE);
1323 log_err("Failed to get page size\n");
1331 setup_log(&agg_io_log[DDIR_READ]);
1332 setup_log(&agg_io_log[DDIR_WRITE]);
1335 startup_mutex = fio_mutex_init(0);
1339 disk_util_timer_arm();
1346 __finish_log(agg_io_log[DDIR_READ],"agg-read_bw.log");
1347 __finish_log(agg_io_log[DDIR_WRITE],"agg-write_bw.log");
1351 fio_mutex_remove(startup_mutex);