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 if (td->runstate == runstate)
67 dprint(FD_PROCESS, "pid=%d: runstate %d -> %d\n", td->pid, td->runstate,
69 td->runstate = runstate;
72 static void terminate_threads(int group_id)
74 struct thread_data *td;
77 dprint(FD_PROCESS, "terminate group_id=%d\n", group_id);
80 if (group_id == TERMINATE_ALL || groupid == td->groupid) {
81 dprint(FD_PROCESS, "setting terminate on %s/%d\n",
84 td->o.start_delay = 0;
87 * if the thread is running, just let it exit
89 if (td->runstate < TD_RUNNING)
90 kill(td->pid, SIGQUIT);
92 struct ioengine_ops *ops = td->io_ops;
94 if (ops && (ops->flags & FIO_SIGQUIT))
95 kill(td->pid, SIGQUIT);
101 static void sig_handler(int sig)
106 disk_util_timer_arm();
107 print_thread_status();
110 printf("\nfio: terminating on signal %d\n", sig);
112 terminate_threads(TERMINATE_ALL);
118 * Check if we are above the minimum rate given.
120 static int check_min_rate(struct thread_data *td, struct timeval *now)
122 unsigned long long bytes = 0;
123 unsigned long iops = 0;
128 * No minimum rate set, always ok
130 if (!td->o.ratemin && !td->o.rate_iops_min)
134 * allow a 2 second settle period in the beginning
136 if (mtime_since(&td->start, now) < 2000)
140 iops += td->io_blocks[DDIR_READ];
141 bytes += td->this_io_bytes[DDIR_READ];
144 iops += td->io_blocks[DDIR_WRITE];
145 bytes += td->this_io_bytes[DDIR_WRITE];
149 * if rate blocks is set, sample is running
151 if (td->rate_bytes || td->rate_blocks) {
152 spent = mtime_since(&td->lastrate, now);
153 if (spent < td->o.ratecycle)
158 * check bandwidth specified rate
160 if (bytes < td->rate_bytes) {
161 log_err("%s: min rate %u not met\n", td->o.name,
165 rate = (bytes - td->rate_bytes) / spent;
166 if (rate < td->o.ratemin ||
167 bytes < td->rate_bytes) {
168 log_err("%s: min rate %u not met, got"
169 " %luKiB/sec\n", td->o.name,
170 td->o.ratemin, rate);
176 * checks iops specified rate
178 if (iops < td->o.rate_iops) {
179 log_err("%s: min iops rate %u not met\n",
180 td->o.name, td->o.rate_iops);
183 rate = (iops - td->rate_blocks) / spent;
184 if (rate < td->o.rate_iops_min ||
185 iops < td->rate_blocks) {
186 log_err("%s: min iops rate %u not met,"
187 " got %lu\n", td->o.name,
195 td->rate_bytes = bytes;
196 td->rate_blocks = iops;
197 memcpy(&td->lastrate, now, sizeof(*now));
201 static inline int runtime_exceeded(struct thread_data *td, struct timeval *t)
205 if (mtime_since(&td->epoch, t) >= td->o.timeout * 1000)
212 * When job exits, we can cancel the in-flight IO if we are using async
213 * io. Attempt to do so.
215 static void cleanup_pending_aio(struct thread_data *td)
217 struct list_head *entry, *n;
222 * get immediately available events, if any
224 r = io_u_queued_complete(td, 0);
229 * now cancel remaining active events
231 if (td->io_ops->cancel) {
232 list_for_each_safe(entry, n, &td->io_u_busylist) {
233 io_u = list_entry(entry, struct io_u, list);
236 * if the io_u isn't in flight, then that generally
237 * means someone leaked an io_u. complain but fix
238 * it up, so we don't stall here.
240 if ((io_u->flags & IO_U_F_FLIGHT) == 0) {
241 log_err("fio: non-busy IO on busy list\n");
244 r = td->io_ops->cancel(td, io_u);
252 r = io_u_queued_complete(td, td->cur_depth);
256 * Helper to handle the final sync of a file. Works just like the normal
257 * io path, just does everything sync.
259 static int fio_io_sync(struct thread_data *td, struct fio_file *f)
261 struct io_u *io_u = __get_io_u(td);
267 io_u->ddir = DDIR_SYNC;
270 if (td_io_prep(td, io_u)) {
276 ret = td_io_queue(td, io_u);
278 td_verror(td, io_u->error, "td_io_queue");
281 } else if (ret == FIO_Q_QUEUED) {
282 if (io_u_queued_complete(td, 1) < 0)
284 } else if (ret == FIO_Q_COMPLETED) {
286 td_verror(td, io_u->error, "td_io_queue");
290 if (io_u_sync_complete(td, io_u) < 0)
292 } else if (ret == FIO_Q_BUSY) {
293 if (td_io_commit(td))
302 * The main verify engine. Runs over the writes we previously submitted,
303 * reads the blocks back in, and checks the crc/md5 of the data.
305 static void do_verify(struct thread_data *td)
313 * sync io first and invalidate cache, to make sure we really
316 for_each_file(td, f, i) {
317 if (!(f->flags & FIO_FILE_OPEN))
319 if (fio_io_sync(td, f))
321 if (file_invalidate_cache(td, f))
328 td_set_runstate(td, TD_VERIFYING);
331 while (!td->terminate) {
334 io_u = __get_io_u(td);
338 if (runtime_exceeded(td, &io_u->start_time)) {
344 if (get_next_verify(td, io_u)) {
349 if (td_io_prep(td, io_u)) {
354 io_u->end_io = verify_io_u;
356 ret = td_io_queue(td, io_u);
358 case FIO_Q_COMPLETED:
361 else if (io_u->resid) {
362 int bytes = io_u->xfer_buflen - io_u->resid;
363 struct fio_file *f = io_u->file;
369 td_verror(td, ENODATA, "full resid");
374 io_u->xfer_buflen = io_u->resid;
375 io_u->xfer_buf += bytes;
376 io_u->offset += bytes;
378 td->ts.short_io_u[io_u->ddir]++;
380 if (io_u->offset == f->real_file_size)
383 requeue_io_u(td, &io_u);
386 ret = io_u_sync_complete(td, io_u);
394 requeue_io_u(td, &io_u);
395 ret2 = td_io_commit(td);
401 td_verror(td, -ret, "td_io_queue");
405 if (ret < 0 || td->error)
409 * if we can queue more, do so. but check if there are
410 * completed io_u's first.
413 if (queue_full(td) || ret == FIO_Q_BUSY) {
416 if (td->cur_depth > td->o.iodepth_low)
417 min_events = td->cur_depth - td->o.iodepth_low;
421 * Reap required number of io units, if any, and do the
422 * verification on them through the callback handler
424 if (io_u_queued_complete(td, min_events) < 0)
429 min_events = td->cur_depth;
432 ret = io_u_queued_complete(td, min_events);
434 cleanup_pending_aio(td);
436 td_set_runstate(td, TD_RUNNING);
440 * Main IO worker function. It retrieves io_u's to process and queues
441 * and reaps them, checking for rate and errors along the way.
443 static void do_io(struct thread_data *td)
450 td_set_runstate(td, TD_RUNNING);
452 while ((td->this_io_bytes[0] + td->this_io_bytes[1]) < td->o.size) {
453 struct timeval comp_time;
466 memcpy(&s, &io_u->start_time, sizeof(s));
468 if (runtime_exceeded(td, &s)) {
475 * Add verification end_io handler, if asked to verify
476 * a previously written file.
478 if (td->o.verify != VERIFY_NONE && io_u->ddir == DDIR_READ) {
479 io_u->end_io = verify_io_u;
480 td_set_runstate(td, TD_VERIFYING);
482 td_set_runstate(td, TD_RUNNING);
484 ret = td_io_queue(td, io_u);
486 case FIO_Q_COMPLETED:
489 else if (io_u->resid) {
490 int bytes = io_u->xfer_buflen - io_u->resid;
491 struct fio_file *f = io_u->file;
497 td_verror(td, ENODATA, "full resid");
502 io_u->xfer_buflen = io_u->resid;
503 io_u->xfer_buf += bytes;
504 io_u->offset += bytes;
506 td->ts.short_io_u[io_u->ddir]++;
508 if (io_u->offset == f->real_file_size)
511 requeue_io_u(td, &io_u);
514 fio_gettime(&comp_time, NULL);
515 bytes_done = io_u_sync_complete(td, io_u);
522 * if the engine doesn't have a commit hook,
523 * the io_u is really queued. if it does have such
524 * a hook, it has to call io_u_queued() itself.
526 if (td->io_ops->commit == NULL)
527 io_u_queued(td, io_u);
530 requeue_io_u(td, &io_u);
531 ret2 = td_io_commit(td);
541 if (ret < 0 || td->error)
545 * See if we need to complete some commands
547 if (ret == FIO_Q_QUEUED || ret == FIO_Q_BUSY) {
549 if (queue_full(td) || ret == FIO_Q_BUSY) {
552 if (td->cur_depth > td->o.iodepth_low)
553 min_evts = td->cur_depth
557 fio_gettime(&comp_time, NULL);
558 bytes_done = io_u_queued_complete(td, min_evts);
567 * the rate is batched for now, it should work for batches
568 * of completions except the very first one which may look
571 usec = utime_since(&s, &comp_time);
573 rate_throttle(td, usec, bytes_done);
575 if (check_min_rate(td, &comp_time)) {
576 if (exitall_on_terminate)
577 terminate_threads(td->groupid);
578 td_verror(td, ENODATA, "check_min_rate");
582 if (td->o.thinktime) {
583 unsigned long long b;
585 b = td->io_blocks[0] + td->io_blocks[1];
586 if (!(b % td->o.thinktime_blocks)) {
589 if (td->o.thinktime_spin)
590 __usec_sleep(td->o.thinktime_spin);
592 left = td->o.thinktime - td->o.thinktime_spin;
594 usec_sleep(td, left);
599 if (td->o.fill_device && td->error == ENOSPC) {
608 ret = io_u_queued_complete(td, i);
610 if (should_fsync(td) && td->o.end_fsync) {
611 td_set_runstate(td, TD_FSYNCING);
613 for_each_file(td, f, i) {
614 if (!(f->flags & FIO_FILE_OPEN))
620 cleanup_pending_aio(td);
623 * stop job if we failed doing any IO
625 if ((td->this_io_bytes[0] + td->this_io_bytes[1]) == 0)
629 static void cleanup_io_u(struct thread_data *td)
631 struct list_head *entry, *n;
634 list_for_each_safe(entry, n, &td->io_u_freelist) {
635 io_u = list_entry(entry, struct io_u, list);
637 list_del(&io_u->list);
645 * "randomly" fill the buffer contents
647 static void fill_io_buf(struct thread_data *td, struct io_u *io_u, int max_bs)
649 long *ptr = io_u->buf;
651 if (!td->o.zero_buffers) {
652 while ((void *) ptr - io_u->buf < max_bs) {
653 *ptr = rand() * GOLDEN_RATIO_PRIME;
657 memset(ptr, 0, max_bs);
660 static int init_io_u(struct thread_data *td)
667 max_units = td->o.iodepth;
668 max_bs = max(td->o.max_bs[DDIR_READ], td->o.max_bs[DDIR_WRITE]);
669 td->orig_buffer_size = (unsigned long long) max_bs
670 * (unsigned long long) max_units;
672 if (td->o.mem_type == MEM_SHMHUGE || td->o.mem_type == MEM_MMAPHUGE) {
675 bs = td->orig_buffer_size + td->o.hugepage_size - 1;
676 td->orig_buffer_size = bs & ~(td->o.hugepage_size - 1);
679 if (td->orig_buffer_size != (size_t) td->orig_buffer_size) {
680 log_err("fio: IO memory too large. Reduce max_bs or iodepth\n");
684 if (allocate_io_mem(td))
688 p = ALIGN(td->orig_buffer);
692 for (i = 0; i < max_units; i++) {
695 io_u = malloc(sizeof(*io_u));
696 memset(io_u, 0, sizeof(*io_u));
697 INIT_LIST_HEAD(&io_u->list);
699 if (!(td->io_ops->flags & FIO_NOIO)) {
700 io_u->buf = p + max_bs * i;
703 fill_io_buf(td, io_u, max_bs);
707 io_u->flags = IO_U_F_FREE;
708 list_add(&io_u->list, &td->io_u_freelist);
716 static int switch_ioscheduler(struct thread_data *td)
718 char tmp[256], tmp2[128];
722 if (td->io_ops->flags & FIO_DISKLESSIO)
725 sprintf(tmp, "%s/queue/scheduler", td->sysfs_root);
727 f = fopen(tmp, "r+");
729 if (errno == ENOENT) {
730 log_err("fio: os or kernel doesn't support IO scheduler"
734 td_verror(td, errno, "fopen iosched");
741 ret = fwrite(td->o.ioscheduler, strlen(td->o.ioscheduler), 1, f);
742 if (ferror(f) || ret != 1) {
743 td_verror(td, errno, "fwrite");
751 * Read back and check that the selected scheduler is now the default.
753 ret = fread(tmp, 1, sizeof(tmp), f);
754 if (ferror(f) || ret < 0) {
755 td_verror(td, errno, "fread");
760 sprintf(tmp2, "[%s]", td->o.ioscheduler);
761 if (!strstr(tmp, tmp2)) {
762 log_err("fio: io scheduler %s not found\n", td->o.ioscheduler);
763 td_verror(td, EINVAL, "iosched_switch");
772 static int keep_running(struct thread_data *td)
774 unsigned long long io_done;
778 if (td->o.time_based)
785 io_done = td->io_bytes[DDIR_READ] + td->io_bytes[DDIR_WRITE]
787 if (io_done < td->o.size)
793 static int clear_io_state(struct thread_data *td)
799 td->ts.stat_io_bytes[0] = td->ts.stat_io_bytes[1] = 0;
800 td->this_io_bytes[0] = td->this_io_bytes[1] = 0;
804 td->rw_end_set[0] = td->rw_end_set[1] = 0;
806 td->last_was_sync = 0;
809 * reset file done count if we are to start over
811 if (td->o.time_based || td->o.loops)
812 td->nr_done_files = 0;
817 for_each_file(td, f, i) {
818 f->flags &= ~FIO_FILE_DONE;
819 ret = td_io_open_file(td, f);
828 * Entry point for the thread based jobs. The process based jobs end up
829 * here as well, after a little setup.
831 static void *thread_main(void *data)
833 unsigned long long runtime[2], elapsed;
834 struct thread_data *td = data;
837 if (!td->o.use_thread)
842 dprint(FD_PROCESS, "jobs pid=%d started\n", td->pid);
844 INIT_LIST_HEAD(&td->io_u_freelist);
845 INIT_LIST_HEAD(&td->io_u_busylist);
846 INIT_LIST_HEAD(&td->io_u_requeues);
847 INIT_LIST_HEAD(&td->io_log_list);
848 INIT_LIST_HEAD(&td->io_hist_list);
849 td->io_hist_tree = RB_ROOT;
851 td_set_runstate(td, TD_INITIALIZED);
852 fio_mutex_up(startup_mutex);
853 fio_mutex_down(td->mutex);
856 * the ->mutex mutex is now no longer used, close it to avoid
857 * eating a file descriptor
859 fio_mutex_remove(td->mutex);
862 * May alter parameters that init_io_u() will use, so we need to
871 if (td->o.cpumask_set && fio_setaffinity(td) == -1) {
872 td_verror(td, errno, "cpu_set_affinity");
876 if (td->ioprio_set) {
877 if (ioprio_set(IOPRIO_WHO_PROCESS, 0, td->ioprio) == -1) {
878 td_verror(td, errno, "ioprio_set");
883 if (nice(td->o.nice) == -1) {
884 td_verror(td, errno, "nice");
888 if (td->o.ioscheduler && switch_ioscheduler(td))
891 if (!td->o.create_serialize && setup_files(td))
900 if (init_random_map(td))
903 if (td->o.exec_prerun) {
904 if (system(td->o.exec_prerun) < 0)
908 fio_gettime(&td->epoch, NULL);
909 memcpy(&td->timeout_end, &td->epoch, sizeof(td->epoch));
910 getrusage(RUSAGE_SELF, &td->ts.ru_start);
912 runtime[0] = runtime[1] = 0;
914 while (keep_running(td)) {
915 fio_gettime(&td->start, NULL);
916 memcpy(&td->ts.stat_sample_time, &td->start, sizeof(td->start));
919 memcpy(&td->lastrate, &td->ts.stat_sample_time,
920 sizeof(td->lastrate));
922 if (clear_state && clear_io_state(td))
925 prune_io_piece_log(td);
931 if (td_read(td) && td->io_bytes[DDIR_READ]) {
932 if (td->rw_end_set[DDIR_READ])
933 elapsed = utime_since(&td->start,
934 &td->rw_end[DDIR_READ]);
936 elapsed = utime_since_now(&td->start);
938 runtime[DDIR_READ] += elapsed;
940 if (td_write(td) && td->io_bytes[DDIR_WRITE]) {
941 if (td->rw_end_set[DDIR_WRITE])
942 elapsed = utime_since(&td->start,
943 &td->rw_end[DDIR_WRITE]);
945 elapsed = utime_since_now(&td->start);
947 runtime[DDIR_WRITE] += elapsed;
950 if (td->error || td->terminate)
953 if (!td->o.do_verify ||
954 td->o.verify == VERIFY_NONE ||
955 (td->io_ops->flags & FIO_UNIDIR))
958 if (clear_io_state(td))
961 fio_gettime(&td->start, NULL);
965 runtime[DDIR_READ] += utime_since_now(&td->start);
967 if (td->error || td->terminate)
971 update_rusage_stat(td);
972 td->ts.runtime[0] = (runtime[0] + 999) / 1000;
973 td->ts.runtime[1] = (runtime[1] + 999) / 1000;
974 td->ts.total_run_time = mtime_since_now(&td->epoch);
975 td->ts.io_bytes[0] = td->io_bytes[0];
976 td->ts.io_bytes[1] = td->io_bytes[1];
979 finish_log(td, td->ts.bw_log, "bw");
981 finish_log(td, td->ts.slat_log, "slat");
983 finish_log(td, td->ts.clat_log, "clat");
984 if (td->o.exec_postrun) {
985 if (system(td->o.exec_postrun) < 0)
986 log_err("fio: postrun %s failed\n", td->o.exec_postrun);
989 if (exitall_on_terminate)
990 terminate_threads(td->groupid);
994 printf("fio: pid=%d, err=%d/%s\n", td->pid, td->error,
996 close_and_free_files(td);
1001 * do this very late, it will log file closing as well
1003 if (td->o.write_iolog_file)
1004 write_iolog_close(td);
1006 options_mem_free(td);
1007 td_set_runstate(td, TD_EXITED);
1008 return (void *) (unsigned long) td->error;
1012 * We cannot pass the td data into a forked process, so attach the td and
1013 * pass it to the thread worker.
1015 static int fork_main(int shmid, int offset)
1017 struct thread_data *td;
1020 data = shmat(shmid, NULL, 0);
1021 if (data == (void *) -1) {
1028 td = data + offset * sizeof(struct thread_data);
1029 ret = thread_main(td);
1031 return (int) (unsigned long) ret;
1035 * Run over the job map and reap the threads that have exited, if any.
1037 static void reap_threads(int *nr_running, int *t_rate, int *m_rate)
1039 struct thread_data *td;
1040 int i, cputhreads, realthreads, pending, status, ret;
1043 * reap exited threads (TD_EXITED -> TD_REAPED)
1045 realthreads = pending = cputhreads = 0;
1046 for_each_td(td, i) {
1050 * ->io_ops is NULL for a thread that has closed its
1053 if (td->io_ops && !strcmp(td->io_ops->name, "cpuio"))
1062 if (td->runstate == TD_REAPED)
1064 if (td->o.use_thread) {
1065 if (td->runstate == TD_EXITED) {
1066 td_set_runstate(td, TD_REAPED);
1073 if (td->runstate == TD_EXITED)
1077 * check if someone quit or got killed in an unusual way
1079 ret = waitpid(td->pid, &status, flags);
1081 if (errno == ECHILD) {
1082 log_err("fio: pid=%d disappeared %d\n", td->pid,
1084 td_set_runstate(td, TD_REAPED);
1088 } else if (ret == td->pid) {
1089 if (WIFSIGNALED(status)) {
1090 int sig = WTERMSIG(status);
1093 log_err("fio: pid=%d, got signal=%d\n",
1095 td_set_runstate(td, TD_REAPED);
1098 if (WIFEXITED(status)) {
1099 if (WEXITSTATUS(status) && !td->error)
1100 td->error = WEXITSTATUS(status);
1102 td_set_runstate(td, TD_REAPED);
1108 * thread is not dead, continue
1114 (*m_rate) -= td->o.ratemin;
1115 (*t_rate) -= td->o.rate;
1123 if (*nr_running == cputhreads && !pending && realthreads)
1124 terminate_threads(TERMINATE_ALL);
1128 * Main function for kicking off and reaping jobs, as needed.
1130 static void run_threads(void)
1132 struct thread_data *td;
1133 unsigned long spent;
1134 int i, todo, nr_running, m_rate, t_rate, nr_started;
1136 if (fio_pin_memory())
1139 if (!terse_output) {
1140 printf("Starting ");
1142 printf("%d thread%s", nr_thread,
1143 nr_thread > 1 ? "s" : "");
1147 printf("%d process%s", nr_process,
1148 nr_process > 1 ? "es" : "");
1154 signal(SIGINT, sig_handler);
1155 signal(SIGALRM, sig_handler);
1157 todo = thread_number;
1160 m_rate = t_rate = 0;
1162 for_each_td(td, i) {
1163 print_status_init(td->thread_number - 1);
1165 if (!td->o.create_serialize) {
1171 * do file setup here so it happens sequentially,
1172 * we don't want X number of threads getting their
1173 * client data interspersed on disk
1175 if (setup_files(td)) {
1178 log_err("fio: pid=%d, err=%d/%s\n", td->pid,
1179 td->error, td->verror);
1180 td_set_runstate(td, TD_REAPED);
1187 * for sharing to work, each job must always open
1188 * its own files. so close them, if we opened them
1191 for_each_file(td, f, i)
1192 td_io_close_file(td, f);
1201 struct thread_data *map[MAX_JOBS];
1202 struct timeval this_start;
1203 int this_jobs = 0, left;
1206 * create threads (TD_NOT_CREATED -> TD_CREATED)
1208 for_each_td(td, i) {
1209 if (td->runstate != TD_NOT_CREATED)
1213 * never got a chance to start, killed by other
1214 * thread for some reason
1216 if (td->terminate) {
1221 if (td->o.start_delay) {
1222 spent = mtime_since_genesis();
1224 if (td->o.start_delay * 1000 > spent)
1228 if (td->o.stonewall && (nr_started || nr_running)) {
1229 dprint(FD_PROCESS, "%s: stonewall wait\n",
1235 * Set state to created. Thread will transition
1236 * to TD_INITIALIZED when it's done setting up.
1238 td_set_runstate(td, TD_CREATED);
1239 map[this_jobs++] = td;
1242 if (td->o.use_thread) {
1243 dprint(FD_PROCESS, "will pthread_create\n");
1244 if (pthread_create(&td->thread, NULL,
1246 perror("pthread_create");
1250 if (pthread_detach(td->thread) < 0)
1251 perror("pthread_detach");
1253 dprint(FD_PROCESS, "will fork\n");
1255 int ret = fork_main(shm_id, i);
1260 fio_mutex_down(startup_mutex);
1264 * Wait for the started threads to transition to
1267 fio_gettime(&this_start, NULL);
1269 while (left && !fio_abort) {
1270 if (mtime_since_now(&this_start) > JOB_START_TIMEOUT)
1275 for (i = 0; i < this_jobs; i++) {
1279 if (td->runstate == TD_INITIALIZED) {
1282 } else if (td->runstate >= TD_EXITED) {
1286 nr_running++; /* work-around... */
1292 log_err("fio: %d jobs failed to start\n", left);
1293 for (i = 0; i < this_jobs; i++) {
1297 kill(td->pid, SIGTERM);
1303 * start created threads (TD_INITIALIZED -> TD_RUNNING).
1305 for_each_td(td, i) {
1306 if (td->runstate != TD_INITIALIZED)
1309 td_set_runstate(td, TD_RUNNING);
1312 m_rate += td->o.ratemin;
1313 t_rate += td->o.rate;
1315 fio_mutex_up(td->mutex);
1318 reap_threads(&nr_running, &t_rate, &m_rate);
1324 while (nr_running) {
1325 reap_threads(&nr_running, &t_rate, &m_rate);
1333 int main(int argc, char *argv[])
1340 * We need locale for number printing, if it isn't set then just
1341 * go with the US format.
1343 if (!getenv("LC_NUMERIC"))
1344 setlocale(LC_NUMERIC, "en_US");
1346 if (parse_options(argc, argv))
1352 ps = sysconf(_SC_PAGESIZE);
1354 log_err("Failed to get page size\n");
1362 setup_log(&agg_io_log[DDIR_READ]);
1363 setup_log(&agg_io_log[DDIR_WRITE]);
1366 startup_mutex = fio_mutex_init(0);
1370 disk_util_timer_arm();
1377 __finish_log(agg_io_log[DDIR_READ], "agg-read_bw.log");
1378 __finish_log(agg_io_log[DDIR_WRITE],
1379 "agg-write_bw.log");
1383 fio_mutex_remove(startup_mutex);