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;
52 unsigned long done_secs = 0;
54 static struct fio_mutex *startup_mutex;
55 static volatile int fio_abort;
56 static int exit_value;
58 struct io_log *agg_io_log[2];
60 #define TERMINATE_ALL (-1)
61 #define JOB_START_TIMEOUT (5 * 1000)
63 static inline void td_set_runstate(struct thread_data *td, int runstate)
65 if (td->runstate == runstate)
68 dprint(FD_PROCESS, "pid=%d: runstate %d -> %d\n", td->pid, td->runstate,
70 td->runstate = runstate;
73 static void terminate_threads(int group_id)
75 struct thread_data *td;
78 dprint(FD_PROCESS, "terminate group_id=%d\n", group_id);
81 if (group_id == TERMINATE_ALL || groupid == td->groupid) {
82 dprint(FD_PROCESS, "setting terminate on %s/%d\n",
85 td->o.start_delay = 0;
88 * if the thread is running, just let it exit
90 if (td->runstate < TD_RUNNING)
91 kill(td->pid, SIGQUIT);
93 struct ioengine_ops *ops = td->io_ops;
95 if (ops && (ops->flags & FIO_SIGQUIT))
96 kill(td->pid, SIGQUIT);
102 static void sig_handler(int sig)
107 disk_util_timer_arm();
108 print_thread_status();
111 printf("\nfio: terminating on signal %d\n", sig);
113 terminate_threads(TERMINATE_ALL);
119 * Check if we are above the minimum rate given.
121 static int check_min_rate(struct thread_data *td, struct timeval *now)
123 unsigned long long bytes = 0;
124 unsigned long iops = 0;
129 * No minimum rate set, always ok
131 if (!td->o.ratemin && !td->o.rate_iops_min)
135 * allow a 2 second settle period in the beginning
137 if (mtime_since(&td->start, now) < 2000)
141 iops += td->io_blocks[DDIR_READ];
142 bytes += td->this_io_bytes[DDIR_READ];
145 iops += td->io_blocks[DDIR_WRITE];
146 bytes += td->this_io_bytes[DDIR_WRITE];
150 * if rate blocks is set, sample is running
152 if (td->rate_bytes || td->rate_blocks) {
153 spent = mtime_since(&td->lastrate, now);
154 if (spent < td->o.ratecycle)
159 * check bandwidth specified rate
161 if (bytes < td->rate_bytes) {
162 log_err("%s: min rate %u not met\n", td->o.name,
166 rate = (bytes - td->rate_bytes) / spent;
167 if (rate < td->o.ratemin ||
168 bytes < td->rate_bytes) {
169 log_err("%s: min rate %u not met, got"
170 " %luKiB/sec\n", td->o.name,
171 td->o.ratemin, rate);
177 * checks iops specified rate
179 if (iops < td->o.rate_iops) {
180 log_err("%s: min iops rate %u not met\n",
181 td->o.name, td->o.rate_iops);
184 rate = (iops - td->rate_blocks) / spent;
185 if (rate < td->o.rate_iops_min ||
186 iops < td->rate_blocks) {
187 log_err("%s: min iops rate %u not met,"
188 " got %lu\n", td->o.name,
196 td->rate_bytes = bytes;
197 td->rate_blocks = iops;
198 memcpy(&td->lastrate, now, sizeof(*now));
202 static inline int runtime_exceeded(struct thread_data *td, struct timeval *t)
206 if (mtime_since(&td->epoch, t) >= td->o.timeout * 1000)
213 * When job exits, we can cancel the in-flight IO if we are using async
214 * io. Attempt to do so.
216 static void cleanup_pending_aio(struct thread_data *td)
218 struct list_head *entry, *n;
223 * get immediately available events, if any
225 r = io_u_queued_complete(td, 0);
230 * now cancel remaining active events
232 if (td->io_ops->cancel) {
233 list_for_each_safe(entry, n, &td->io_u_busylist) {
234 io_u = list_entry(entry, struct io_u, list);
237 * if the io_u isn't in flight, then that generally
238 * means someone leaked an io_u. complain but fix
239 * it up, so we don't stall here.
241 if ((io_u->flags & IO_U_F_FLIGHT) == 0) {
242 log_err("fio: non-busy IO on busy list\n");
245 r = td->io_ops->cancel(td, io_u);
253 r = io_u_queued_complete(td, td->cur_depth);
257 * Helper to handle the final sync of a file. Works just like the normal
258 * io path, just does everything sync.
260 static int fio_io_sync(struct thread_data *td, struct fio_file *f)
262 struct io_u *io_u = __get_io_u(td);
268 io_u->ddir = DDIR_SYNC;
271 if (td_io_prep(td, io_u)) {
277 ret = td_io_queue(td, io_u);
279 td_verror(td, io_u->error, "td_io_queue");
282 } else if (ret == FIO_Q_QUEUED) {
283 if (io_u_queued_complete(td, 1) < 0)
285 } else if (ret == FIO_Q_COMPLETED) {
287 td_verror(td, io_u->error, "td_io_queue");
291 if (io_u_sync_complete(td, io_u) < 0)
293 } else if (ret == FIO_Q_BUSY) {
294 if (td_io_commit(td))
303 * The main verify engine. Runs over the writes we previously submitted,
304 * reads the blocks back in, and checks the crc/md5 of the data.
306 static void do_verify(struct thread_data *td)
314 * sync io first and invalidate cache, to make sure we really
317 for_each_file(td, f, i) {
318 if (!(f->flags & FIO_FILE_OPEN))
320 if (fio_io_sync(td, f))
322 if (file_invalidate_cache(td, f))
329 td_set_runstate(td, TD_VERIFYING);
332 while (!td->terminate) {
335 io_u = __get_io_u(td);
339 if (runtime_exceeded(td, &io_u->start_time)) {
345 if (get_next_verify(td, io_u)) {
350 if (td_io_prep(td, io_u)) {
355 io_u->end_io = verify_io_u;
357 ret = td_io_queue(td, io_u);
359 case FIO_Q_COMPLETED:
362 else if (io_u->resid) {
363 int bytes = io_u->xfer_buflen - io_u->resid;
364 struct fio_file *f = io_u->file;
370 td_verror(td, ENODATA, "full resid");
375 io_u->xfer_buflen = io_u->resid;
376 io_u->xfer_buf += bytes;
377 io_u->offset += bytes;
379 td->ts.short_io_u[io_u->ddir]++;
381 if (io_u->offset == f->real_file_size)
384 requeue_io_u(td, &io_u);
387 ret = io_u_sync_complete(td, io_u);
395 requeue_io_u(td, &io_u);
396 ret2 = td_io_commit(td);
402 td_verror(td, -ret, "td_io_queue");
406 if (ret < 0 || td->error)
410 * if we can queue more, do so. but check if there are
411 * completed io_u's first.
414 if (queue_full(td) || ret == FIO_Q_BUSY) {
417 if (td->cur_depth > td->o.iodepth_low)
418 min_events = td->cur_depth - td->o.iodepth_low;
422 * Reap required number of io units, if any, and do the
423 * verification on them through the callback handler
425 if (io_u_queued_complete(td, min_events) < 0)
430 min_events = td->cur_depth;
433 ret = io_u_queued_complete(td, min_events);
435 cleanup_pending_aio(td);
437 td_set_runstate(td, TD_RUNNING);
441 * Main IO worker function. It retrieves io_u's to process and queues
442 * and reaps them, checking for rate and errors along the way.
444 static void do_io(struct thread_data *td)
451 td_set_runstate(td, TD_RUNNING);
453 while ((td->this_io_bytes[0] + td->this_io_bytes[1]) < td->o.size) {
454 struct timeval comp_time;
467 memcpy(&s, &io_u->start_time, sizeof(s));
469 if (runtime_exceeded(td, &s)) {
476 * Add verification end_io handler, if asked to verify
477 * a previously written file.
479 if (td->o.verify != VERIFY_NONE && io_u->ddir == DDIR_READ) {
480 io_u->end_io = verify_io_u;
481 td_set_runstate(td, TD_VERIFYING);
483 td_set_runstate(td, TD_RUNNING);
485 ret = td_io_queue(td, io_u);
487 case FIO_Q_COMPLETED:
490 else if (io_u->resid) {
491 int bytes = io_u->xfer_buflen - io_u->resid;
492 struct fio_file *f = io_u->file;
498 td_verror(td, ENODATA, "full resid");
503 io_u->xfer_buflen = io_u->resid;
504 io_u->xfer_buf += bytes;
505 io_u->offset += bytes;
507 td->ts.short_io_u[io_u->ddir]++;
509 if (io_u->offset == f->real_file_size)
512 requeue_io_u(td, &io_u);
515 fio_gettime(&comp_time, NULL);
516 bytes_done = io_u_sync_complete(td, io_u);
523 * if the engine doesn't have a commit hook,
524 * the io_u is really queued. if it does have such
525 * a hook, it has to call io_u_queued() itself.
527 if (td->io_ops->commit == NULL)
528 io_u_queued(td, io_u);
531 requeue_io_u(td, &io_u);
532 ret2 = td_io_commit(td);
542 if (ret < 0 || td->error)
546 * See if we need to complete some commands
548 if (ret == FIO_Q_QUEUED || ret == FIO_Q_BUSY) {
550 if (queue_full(td) || ret == FIO_Q_BUSY) {
553 if (td->cur_depth > td->o.iodepth_low)
554 min_evts = td->cur_depth
558 fio_gettime(&comp_time, NULL);
559 bytes_done = io_u_queued_complete(td, min_evts);
568 * the rate is batched for now, it should work for batches
569 * of completions except the very first one which may look
572 usec = utime_since(&s, &comp_time);
574 rate_throttle(td, usec, bytes_done);
576 if (check_min_rate(td, &comp_time)) {
577 if (exitall_on_terminate)
578 terminate_threads(td->groupid);
579 td_verror(td, ENODATA, "check_min_rate");
583 if (td->o.thinktime) {
584 unsigned long long b;
586 b = td->io_blocks[0] + td->io_blocks[1];
587 if (!(b % td->o.thinktime_blocks)) {
590 if (td->o.thinktime_spin)
591 __usec_sleep(td->o.thinktime_spin);
593 left = td->o.thinktime - td->o.thinktime_spin;
595 usec_sleep(td, left);
600 if (td->o.fill_device && td->error == ENOSPC) {
609 ret = io_u_queued_complete(td, i);
611 if (should_fsync(td) && td->o.end_fsync) {
612 td_set_runstate(td, TD_FSYNCING);
614 for_each_file(td, f, i) {
615 if (!(f->flags & FIO_FILE_OPEN))
621 cleanup_pending_aio(td);
624 * stop job if we failed doing any IO
626 if ((td->this_io_bytes[0] + td->this_io_bytes[1]) == 0)
630 static void cleanup_io_u(struct thread_data *td)
632 struct list_head *entry, *n;
635 list_for_each_safe(entry, n, &td->io_u_freelist) {
636 io_u = list_entry(entry, struct io_u, list);
638 list_del(&io_u->list);
645 static int init_io_u(struct thread_data *td)
652 max_units = td->o.iodepth;
653 max_bs = max(td->o.max_bs[DDIR_READ], td->o.max_bs[DDIR_WRITE]);
654 td->orig_buffer_size = (unsigned long long) max_bs
655 * (unsigned long long) max_units;
657 if (td->o.mem_type == MEM_SHMHUGE || td->o.mem_type == MEM_MMAPHUGE) {
660 bs = td->orig_buffer_size + td->o.hugepage_size - 1;
661 td->orig_buffer_size = bs & ~(td->o.hugepage_size - 1);
664 if (td->orig_buffer_size != (size_t) td->orig_buffer_size) {
665 log_err("fio: IO memory too large. Reduce max_bs or iodepth\n");
669 if (allocate_io_mem(td))
673 p = ALIGN(td->orig_buffer);
677 for (i = 0; i < max_units; i++) {
680 io_u = malloc(sizeof(*io_u));
681 memset(io_u, 0, sizeof(*io_u));
682 INIT_LIST_HEAD(&io_u->list);
684 if (!(td->io_ops->flags & FIO_NOIO)) {
685 io_u->buf = p + max_bs * i;
687 if (td_write(td) && !td->o.refill_buffers)
688 io_u_fill_buffer(td, io_u, max_bs);
692 io_u->flags = IO_U_F_FREE;
693 list_add(&io_u->list, &td->io_u_freelist);
701 static int switch_ioscheduler(struct thread_data *td)
703 char tmp[256], tmp2[128];
707 if (td->io_ops->flags & FIO_DISKLESSIO)
710 sprintf(tmp, "%s/queue/scheduler", td->sysfs_root);
712 f = fopen(tmp, "r+");
714 if (errno == ENOENT) {
715 log_err("fio: os or kernel doesn't support IO scheduler"
719 td_verror(td, errno, "fopen iosched");
726 ret = fwrite(td->o.ioscheduler, strlen(td->o.ioscheduler), 1, f);
727 if (ferror(f) || ret != 1) {
728 td_verror(td, errno, "fwrite");
736 * Read back and check that the selected scheduler is now the default.
738 ret = fread(tmp, 1, sizeof(tmp), f);
739 if (ferror(f) || ret < 0) {
740 td_verror(td, errno, "fread");
745 sprintf(tmp2, "[%s]", td->o.ioscheduler);
746 if (!strstr(tmp, tmp2)) {
747 log_err("fio: io scheduler %s not found\n", td->o.ioscheduler);
748 td_verror(td, EINVAL, "iosched_switch");
757 static int keep_running(struct thread_data *td)
759 unsigned long long io_done;
763 if (td->o.time_based)
770 io_done = td->io_bytes[DDIR_READ] + td->io_bytes[DDIR_WRITE]
772 if (io_done < td->o.size)
778 static int clear_io_state(struct thread_data *td)
784 td->ts.stat_io_bytes[0] = td->ts.stat_io_bytes[1] = 0;
785 td->this_io_bytes[0] = td->this_io_bytes[1] = 0;
789 td->rw_end_set[0] = td->rw_end_set[1] = 0;
791 td->last_was_sync = 0;
794 * reset file done count if we are to start over
796 if (td->o.time_based || td->o.loops)
797 td->nr_done_files = 0;
802 for_each_file(td, f, i) {
803 f->flags &= ~FIO_FILE_DONE;
804 ret = td_io_open_file(td, f);
813 * Entry point for the thread based jobs. The process based jobs end up
814 * here as well, after a little setup.
816 static void *thread_main(void *data)
818 unsigned long long runtime[2], elapsed;
819 struct thread_data *td = data;
822 if (!td->o.use_thread)
827 dprint(FD_PROCESS, "jobs pid=%d started\n", td->pid);
829 INIT_LIST_HEAD(&td->io_u_freelist);
830 INIT_LIST_HEAD(&td->io_u_busylist);
831 INIT_LIST_HEAD(&td->io_u_requeues);
832 INIT_LIST_HEAD(&td->io_log_list);
833 INIT_LIST_HEAD(&td->io_hist_list);
834 td->io_hist_tree = RB_ROOT;
836 td_set_runstate(td, TD_INITIALIZED);
837 fio_mutex_up(startup_mutex);
838 fio_mutex_down(td->mutex);
841 * the ->mutex mutex is now no longer used, close it to avoid
842 * eating a file descriptor
844 fio_mutex_remove(td->mutex);
847 * May alter parameters that init_io_u() will use, so we need to
856 if (td->o.cpumask_set && fio_setaffinity(td) == -1) {
857 td_verror(td, errno, "cpu_set_affinity");
861 if (td->ioprio_set) {
862 if (ioprio_set(IOPRIO_WHO_PROCESS, 0, td->ioprio) == -1) {
863 td_verror(td, errno, "ioprio_set");
868 if (nice(td->o.nice) == -1) {
869 td_verror(td, errno, "nice");
873 if (td->o.ioscheduler && switch_ioscheduler(td))
876 if (!td->o.create_serialize && setup_files(td))
885 if (init_random_map(td))
888 if (td->o.exec_prerun) {
889 if (system(td->o.exec_prerun) < 0)
893 fio_gettime(&td->epoch, NULL);
894 memcpy(&td->timeout_end, &td->epoch, sizeof(td->epoch));
895 getrusage(RUSAGE_SELF, &td->ts.ru_start);
897 runtime[0] = runtime[1] = 0;
899 while (keep_running(td)) {
900 fio_gettime(&td->start, NULL);
901 memcpy(&td->ts.stat_sample_time, &td->start, sizeof(td->start));
904 memcpy(&td->lastrate, &td->ts.stat_sample_time,
905 sizeof(td->lastrate));
907 if (clear_state && clear_io_state(td))
910 prune_io_piece_log(td);
916 if (td_read(td) && td->io_bytes[DDIR_READ]) {
917 if (td->rw_end_set[DDIR_READ])
918 elapsed = utime_since(&td->start,
919 &td->rw_end[DDIR_READ]);
921 elapsed = utime_since_now(&td->start);
923 runtime[DDIR_READ] += elapsed;
925 if (td_write(td) && td->io_bytes[DDIR_WRITE]) {
926 if (td->rw_end_set[DDIR_WRITE])
927 elapsed = utime_since(&td->start,
928 &td->rw_end[DDIR_WRITE]);
930 elapsed = utime_since_now(&td->start);
932 runtime[DDIR_WRITE] += elapsed;
935 if (td->error || td->terminate)
938 if (!td->o.do_verify ||
939 td->o.verify == VERIFY_NONE ||
940 (td->io_ops->flags & FIO_UNIDIR))
943 if (clear_io_state(td))
946 fio_gettime(&td->start, NULL);
950 runtime[DDIR_READ] += utime_since_now(&td->start);
952 if (td->error || td->terminate)
956 update_rusage_stat(td);
957 td->ts.runtime[0] = (runtime[0] + 999) / 1000;
958 td->ts.runtime[1] = (runtime[1] + 999) / 1000;
959 td->ts.total_run_time = mtime_since_now(&td->epoch);
960 td->ts.io_bytes[0] = td->io_bytes[0];
961 td->ts.io_bytes[1] = td->io_bytes[1];
964 finish_log(td, td->ts.bw_log, "bw");
966 finish_log(td, td->ts.slat_log, "slat");
968 finish_log(td, td->ts.clat_log, "clat");
969 if (td->o.exec_postrun) {
970 if (system(td->o.exec_postrun) < 0)
971 log_err("fio: postrun %s failed\n", td->o.exec_postrun);
974 if (exitall_on_terminate)
975 terminate_threads(td->groupid);
979 printf("fio: pid=%d, err=%d/%s\n", td->pid, td->error,
981 close_and_free_files(td);
986 * do this very late, it will log file closing as well
988 if (td->o.write_iolog_file)
989 write_iolog_close(td);
991 options_mem_free(td);
992 td_set_runstate(td, TD_EXITED);
993 return (void *) (unsigned long) td->error;
997 * We cannot pass the td data into a forked process, so attach the td and
998 * pass it to the thread worker.
1000 static int fork_main(int shmid, int offset)
1002 struct thread_data *td;
1005 data = shmat(shmid, NULL, 0);
1006 if (data == (void *) -1) {
1013 td = data + offset * sizeof(struct thread_data);
1014 ret = thread_main(td);
1016 return (int) (unsigned long) ret;
1020 * Run over the job map and reap the threads that have exited, if any.
1022 static void reap_threads(int *nr_running, int *t_rate, int *m_rate)
1024 struct thread_data *td;
1025 int i, cputhreads, realthreads, pending, status, ret;
1028 * reap exited threads (TD_EXITED -> TD_REAPED)
1030 realthreads = pending = cputhreads = 0;
1031 for_each_td(td, i) {
1035 * ->io_ops is NULL for a thread that has closed its
1038 if (td->io_ops && !strcmp(td->io_ops->name, "cpuio"))
1047 if (td->runstate == TD_REAPED)
1049 if (td->o.use_thread) {
1050 if (td->runstate == TD_EXITED) {
1051 td_set_runstate(td, TD_REAPED);
1058 if (td->runstate == TD_EXITED)
1062 * check if someone quit or got killed in an unusual way
1064 ret = waitpid(td->pid, &status, flags);
1066 if (errno == ECHILD) {
1067 log_err("fio: pid=%d disappeared %d\n", td->pid,
1069 td_set_runstate(td, TD_REAPED);
1073 } else if (ret == td->pid) {
1074 if (WIFSIGNALED(status)) {
1075 int sig = WTERMSIG(status);
1078 log_err("fio: pid=%d, got signal=%d\n",
1080 td_set_runstate(td, TD_REAPED);
1083 if (WIFEXITED(status)) {
1084 if (WEXITSTATUS(status) && !td->error)
1085 td->error = WEXITSTATUS(status);
1087 td_set_runstate(td, TD_REAPED);
1093 * thread is not dead, continue
1099 (*m_rate) -= td->o.ratemin;
1100 (*t_rate) -= td->o.rate;
1107 done_secs += mtime_since_now(&td->epoch) / 1000;
1110 if (*nr_running == cputhreads && !pending && realthreads)
1111 terminate_threads(TERMINATE_ALL);
1115 * Main function for kicking off and reaping jobs, as needed.
1117 static void run_threads(void)
1119 struct thread_data *td;
1120 unsigned long spent;
1121 int i, todo, nr_running, m_rate, t_rate, nr_started;
1123 if (fio_pin_memory())
1126 if (!terse_output) {
1127 printf("Starting ");
1129 printf("%d thread%s", nr_thread,
1130 nr_thread > 1 ? "s" : "");
1134 printf("%d process%s", nr_process,
1135 nr_process > 1 ? "es" : "");
1141 signal(SIGINT, sig_handler);
1142 signal(SIGALRM, sig_handler);
1144 todo = thread_number;
1147 m_rate = t_rate = 0;
1149 for_each_td(td, i) {
1150 print_status_init(td->thread_number - 1);
1152 if (!td->o.create_serialize) {
1158 * do file setup here so it happens sequentially,
1159 * we don't want X number of threads getting their
1160 * client data interspersed on disk
1162 if (setup_files(td)) {
1165 log_err("fio: pid=%d, err=%d/%s\n", td->pid,
1166 td->error, td->verror);
1167 td_set_runstate(td, TD_REAPED);
1174 * for sharing to work, each job must always open
1175 * its own files. so close them, if we opened them
1178 for_each_file(td, f, i)
1179 td_io_close_file(td, f);
1188 struct thread_data *map[MAX_JOBS];
1189 struct timeval this_start;
1190 int this_jobs = 0, left;
1193 * create threads (TD_NOT_CREATED -> TD_CREATED)
1195 for_each_td(td, i) {
1196 if (td->runstate != TD_NOT_CREATED)
1200 * never got a chance to start, killed by other
1201 * thread for some reason
1203 if (td->terminate) {
1208 if (td->o.start_delay) {
1209 spent = mtime_since_genesis();
1211 if (td->o.start_delay * 1000 > spent)
1215 if (td->o.stonewall && (nr_started || nr_running)) {
1216 dprint(FD_PROCESS, "%s: stonewall wait\n",
1222 * Set state to created. Thread will transition
1223 * to TD_INITIALIZED when it's done setting up.
1225 td_set_runstate(td, TD_CREATED);
1226 map[this_jobs++] = td;
1229 if (td->o.use_thread) {
1230 dprint(FD_PROCESS, "will pthread_create\n");
1231 if (pthread_create(&td->thread, NULL,
1233 perror("pthread_create");
1237 if (pthread_detach(td->thread) < 0)
1238 perror("pthread_detach");
1240 dprint(FD_PROCESS, "will fork\n");
1242 int ret = fork_main(shm_id, i);
1247 fio_mutex_down(startup_mutex);
1251 * Wait for the started threads to transition to
1254 fio_gettime(&this_start, NULL);
1256 while (left && !fio_abort) {
1257 if (mtime_since_now(&this_start) > JOB_START_TIMEOUT)
1262 for (i = 0; i < this_jobs; i++) {
1266 if (td->runstate == TD_INITIALIZED) {
1269 } else if (td->runstate >= TD_EXITED) {
1273 nr_running++; /* work-around... */
1279 log_err("fio: %d jobs failed to start\n", left);
1280 for (i = 0; i < this_jobs; i++) {
1284 kill(td->pid, SIGTERM);
1290 * start created threads (TD_INITIALIZED -> TD_RUNNING).
1292 for_each_td(td, i) {
1293 if (td->runstate != TD_INITIALIZED)
1296 td_set_runstate(td, TD_RUNNING);
1299 m_rate += td->o.ratemin;
1300 t_rate += td->o.rate;
1302 fio_mutex_up(td->mutex);
1305 reap_threads(&nr_running, &t_rate, &m_rate);
1311 while (nr_running) {
1312 reap_threads(&nr_running, &t_rate, &m_rate);
1320 int main(int argc, char *argv[])
1327 * We need locale for number printing, if it isn't set then just
1328 * go with the US format.
1330 if (!getenv("LC_NUMERIC"))
1331 setlocale(LC_NUMERIC, "en_US");
1333 if (parse_options(argc, argv))
1339 ps = sysconf(_SC_PAGESIZE);
1341 log_err("Failed to get page size\n");
1349 setup_log(&agg_io_log[DDIR_READ]);
1350 setup_log(&agg_io_log[DDIR_WRITE]);
1353 startup_mutex = fio_mutex_init(0);
1357 disk_util_timer_arm();
1364 __finish_log(agg_io_log[DDIR_READ], "agg-read_bw.log");
1365 __finish_log(agg_io_log[DDIR_WRITE],
1366 "agg-write_bw.log");
1370 fio_mutex_remove(startup_mutex);