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
40 unsigned long page_mask;
41 unsigned long page_size;
43 (char *) (((unsigned long) (buf) + page_mask) & ~page_mask)
46 int thread_number = 0;
52 static struct fio_sem *startup_sem;
53 static volatile int fio_abort;
54 static int exit_value;
56 struct io_log *agg_io_log[2];
58 #define TERMINATE_ALL (-1)
59 #define JOB_START_TIMEOUT (5 * 1000)
61 static inline void td_set_runstate(struct thread_data *td, int runstate)
63 dprint(FD_PROCESS, "pid=%d: runstate %d -> %d\n", td->pid, td->runstate,
65 td->runstate = runstate;
68 static void terminate_threads(int group_id)
70 struct thread_data *td;
74 if (group_id == TERMINATE_ALL || groupid == td->groupid) {
75 dprint(FD_PROCESS, "setting terminate on %d\n",td->pid);
78 td->o.start_delay = 0;
81 * if the thread is running, just let it exit
83 if (td->runstate < TD_RUNNING)
84 kill(td->pid, SIGQUIT);
85 else if (td->io_ops->flags & FIO_SIGQUIT)
86 kill(td->pid, SIGQUIT);
91 static void sig_handler(int sig)
96 disk_util_timer_arm();
97 print_thread_status();
100 printf("\nfio: terminating on signal %d\n", sig);
102 terminate_threads(TERMINATE_ALL);
108 * Check if we are above the minimum rate given.
110 static int check_min_rate(struct thread_data *td, struct timeval *now)
112 unsigned long long bytes = 0;
113 unsigned long iops = 0;
118 * No minimum rate set, always ok
120 if (!td->o.ratemin && !td->o.rate_iops_min)
124 * allow a 2 second settle period in the beginning
126 if (mtime_since(&td->start, now) < 2000)
130 iops += td->io_blocks[DDIR_READ];
131 bytes += td->this_io_bytes[DDIR_READ];
134 iops += td->io_blocks[DDIR_WRITE];
135 bytes += td->this_io_bytes[DDIR_WRITE];
139 * if rate blocks is set, sample is running
141 if (td->rate_bytes || td->rate_blocks) {
142 spent = mtime_since(&td->lastrate, now);
143 if (spent < td->o.ratecycle)
148 * check bandwidth specified rate
150 if (bytes < td->rate_bytes) {
151 log_err("%s: min rate %u not met\n", td->o.name, td->o.ratemin);
154 rate = (bytes - td->rate_bytes) / spent;
155 if (rate < td->o.ratemin || bytes < td->rate_bytes) {
156 log_err("%s: min rate %u not met, got %luKiB/sec\n", td->o.name, td->o.ratemin, rate);
162 * checks iops specified rate
164 if (iops < td->o.rate_iops) {
165 log_err("%s: min iops rate %u not met\n", td->o.name, td->o.rate_iops);
168 rate = (iops - td->rate_blocks) / spent;
169 if (rate < td->o.rate_iops_min || iops < td->rate_blocks) {
170 log_err("%s: min iops rate %u not met, got %lu\n", td->o.name, td->o.rate_iops_min, rate);
176 td->rate_bytes = bytes;
177 td->rate_blocks = iops;
178 memcpy(&td->lastrate, now, sizeof(*now));
182 static inline int runtime_exceeded(struct thread_data *td, struct timeval *t)
186 if (mtime_since(&td->epoch, t) >= td->o.timeout * 1000)
193 * When job exits, we can cancel the in-flight IO if we are using async
194 * io. Attempt to do so.
196 static void cleanup_pending_aio(struct thread_data *td)
198 struct list_head *entry, *n;
203 * get immediately available events, if any
205 r = io_u_queued_complete(td, 0);
210 * now cancel remaining active events
212 if (td->io_ops->cancel) {
213 list_for_each_safe(entry, n, &td->io_u_busylist) {
214 io_u = list_entry(entry, struct io_u, list);
217 * if the io_u isn't in flight, then that generally
218 * means someone leaked an io_u. complain but fix
219 * it up, so we don't stall here.
221 if ((io_u->flags & IO_U_F_FLIGHT) == 0) {
222 log_err("fio: non-busy IO on busy list\n");
225 r = td->io_ops->cancel(td, io_u);
233 r = io_u_queued_complete(td, td->cur_depth);
237 * Helper to handle the final sync of a file. Works just like the normal
238 * io path, just does everything sync.
240 static int fio_io_sync(struct thread_data *td, struct fio_file *f)
242 struct io_u *io_u = __get_io_u(td);
248 io_u->ddir = DDIR_SYNC;
251 if (td_io_prep(td, io_u)) {
257 ret = td_io_queue(td, io_u);
259 td_verror(td, io_u->error, "td_io_queue");
262 } else if (ret == FIO_Q_QUEUED) {
263 if (io_u_queued_complete(td, 1) < 0)
265 } else if (ret == FIO_Q_COMPLETED) {
267 td_verror(td, io_u->error, "td_io_queue");
271 if (io_u_sync_complete(td, io_u) < 0)
273 } else if (ret == FIO_Q_BUSY) {
274 if (td_io_commit(td))
283 * The main verify engine. Runs over the writes we previously submitted,
284 * reads the blocks back in, and checks the crc/md5 of the data.
286 static void do_verify(struct thread_data *td)
294 * sync io first and invalidate cache, to make sure we really
297 for_each_file(td, f, i) {
298 if (!(f->flags & FIO_FILE_OPEN))
300 if (fio_io_sync(td, f))
302 if (file_invalidate_cache(td, f))
309 td_set_runstate(td, TD_VERIFYING);
312 while (!td->terminate) {
315 io_u = __get_io_u(td);
319 if (runtime_exceeded(td, &io_u->start_time)) {
325 if (get_next_verify(td, io_u)) {
330 if (td_io_prep(td, io_u)) {
335 io_u->end_io = verify_io_u;
337 ret = td_io_queue(td, io_u);
339 case FIO_Q_COMPLETED:
342 else if (io_u->resid) {
343 int bytes = io_u->xfer_buflen - io_u->resid;
344 struct fio_file *f = io_u->file;
350 td_verror(td, ENODATA, "full resid");
355 io_u->xfer_buflen = io_u->resid;
356 io_u->xfer_buf += bytes;
357 io_u->offset += bytes;
358 f->last_completed_pos = io_u->offset;
360 td->ts.short_io_u[io_u->ddir]++;
362 if (io_u->offset == f->real_file_size)
365 requeue_io_u(td, &io_u);
368 ret = io_u_sync_complete(td, io_u);
376 requeue_io_u(td, &io_u);
377 ret2 = td_io_commit(td);
383 td_verror(td, -ret, "td_io_queue");
387 if (ret < 0 || td->error)
391 * if we can queue more, do so. but check if there are
392 * completed io_u's first.
395 if (queue_full(td) || ret == FIO_Q_BUSY) {
398 if (td->cur_depth > td->o.iodepth_low)
399 min_events = td->cur_depth - td->o.iodepth_low;
403 * Reap required number of io units, if any, and do the
404 * verification on them through the callback handler
406 if (io_u_queued_complete(td, min_events) < 0)
411 min_events = td->cur_depth;
414 ret = io_u_queued_complete(td, min_events);
416 cleanup_pending_aio(td);
418 td_set_runstate(td, TD_RUNNING);
422 * Main IO worker function. It retrieves io_u's to process and queues
423 * and reaps them, checking for rate and errors along the way.
425 static void do_io(struct thread_data *td)
432 td_set_runstate(td, TD_RUNNING);
434 while ((td->this_io_bytes[0] + td->this_io_bytes[1]) < td->o.size) {
435 struct timeval comp_time;
448 memcpy(&s, &io_u->start_time, sizeof(s));
450 if (runtime_exceeded(td, &s)) {
457 * Add verification end_io handler, if asked to verify
458 * a previously written file.
460 if (td->o.verify != VERIFY_NONE)
461 io_u->end_io = verify_io_u;
463 ret = td_io_queue(td, io_u);
465 case FIO_Q_COMPLETED:
468 else if (io_u->resid) {
469 int bytes = io_u->xfer_buflen - io_u->resid;
470 struct fio_file *f = io_u->file;
476 td_verror(td, ENODATA, "full resid");
481 io_u->xfer_buflen = io_u->resid;
482 io_u->xfer_buf += bytes;
483 io_u->offset += bytes;
484 f->last_completed_pos = io_u->offset;
486 td->ts.short_io_u[io_u->ddir]++;
488 if (io_u->offset == f->real_file_size)
491 requeue_io_u(td, &io_u);
494 fio_gettime(&comp_time, NULL);
495 bytes_done = io_u_sync_complete(td, io_u);
502 * if the engine doesn't have a commit hook,
503 * the io_u is really queued. if it does have such
504 * a hook, it has to call io_u_queued() itself.
506 if (td->io_ops->commit == NULL)
507 io_u_queued(td, io_u);
510 requeue_io_u(td, &io_u);
511 ret2 = td_io_commit(td);
521 if (ret < 0 || td->error)
525 * See if we need to complete some commands
527 if (ret == FIO_Q_QUEUED || ret == FIO_Q_BUSY) {
529 if (queue_full(td) || ret == FIO_Q_BUSY) {
532 if (td->cur_depth > td->o.iodepth_low)
533 min_evts = td->cur_depth - td->o.iodepth_low;
536 fio_gettime(&comp_time, NULL);
537 bytes_done = io_u_queued_complete(td, min_evts);
546 * the rate is batched for now, it should work for batches
547 * of completions except the very first one which may look
550 usec = utime_since(&s, &comp_time);
552 rate_throttle(td, usec, bytes_done);
554 if (check_min_rate(td, &comp_time)) {
555 if (exitall_on_terminate)
556 terminate_threads(td->groupid);
557 td_verror(td, ENODATA, "check_min_rate");
561 if (td->o.thinktime) {
562 unsigned long long b;
564 b = td->io_blocks[0] + td->io_blocks[1];
565 if (!(b % td->o.thinktime_blocks)) {
568 if (td->o.thinktime_spin)
569 __usec_sleep(td->o.thinktime_spin);
571 left = td->o.thinktime - td->o.thinktime_spin;
573 usec_sleep(td, left);
578 if (td->o.fill_device && td->error == ENOSPC) {
587 ret = io_u_queued_complete(td, i);
589 if (should_fsync(td) && td->o.end_fsync) {
590 td_set_runstate(td, TD_FSYNCING);
592 for_each_file(td, f, i) {
593 if (!(f->flags & FIO_FILE_OPEN))
599 cleanup_pending_aio(td);
602 * stop job if we failed doing any IO
604 if ((td->this_io_bytes[0] + td->this_io_bytes[1]) == 0)
608 static void cleanup_io_u(struct thread_data *td)
610 struct list_head *entry, *n;
613 list_for_each_safe(entry, n, &td->io_u_freelist) {
614 io_u = list_entry(entry, struct io_u, list);
616 list_del(&io_u->list);
624 * "randomly" fill the buffer contents
626 static void fill_io_buf(struct thread_data *td, struct io_u *io_u, int max_bs)
628 long *ptr = io_u->buf;
630 if (!td->o.zero_buffers) {
631 while ((void *) ptr - io_u->buf < max_bs) {
632 *ptr = rand() * GOLDEN_RATIO_PRIME;
636 memset(ptr, 0, max_bs);
639 static int init_io_u(struct thread_data *td)
646 max_units = td->o.iodepth;
647 max_bs = max(td->o.max_bs[DDIR_READ], td->o.max_bs[DDIR_WRITE]);
648 td->orig_buffer_size = (unsigned long long) max_bs * (unsigned long long) max_units;
650 if (td->o.mem_type == MEM_SHMHUGE || td->o.mem_type == MEM_MMAPHUGE)
651 td->orig_buffer_size = (td->orig_buffer_size + td->o.hugepage_size - 1) & ~(td->o.hugepage_size - 1);
653 if (td->orig_buffer_size != (size_t) td->orig_buffer_size) {
654 log_err("fio: IO memory too large. Reduce max_bs or iodepth\n");
658 if (allocate_io_mem(td))
662 p = ALIGN(td->orig_buffer);
666 for (i = 0; i < max_units; i++) {
669 io_u = malloc(sizeof(*io_u));
670 memset(io_u, 0, sizeof(*io_u));
671 INIT_LIST_HEAD(&io_u->list);
673 if (!(td->io_ops->flags & FIO_NOIO)) {
674 io_u->buf = p + max_bs * i;
677 fill_io_buf(td, io_u, max_bs);
681 io_u->flags = IO_U_F_FREE;
682 list_add(&io_u->list, &td->io_u_freelist);
690 static int switch_ioscheduler(struct thread_data *td)
692 char tmp[256], tmp2[128];
696 if (td->io_ops->flags & FIO_DISKLESSIO)
699 sprintf(tmp, "%s/queue/scheduler", td->sysfs_root);
701 f = fopen(tmp, "r+");
703 if (errno == ENOENT) {
704 log_err("fio: os or kernel doesn't support IO scheduler switching\n");
707 td_verror(td, errno, "fopen iosched");
714 ret = fwrite(td->o.ioscheduler, strlen(td->o.ioscheduler), 1, f);
715 if (ferror(f) || ret != 1) {
716 td_verror(td, errno, "fwrite");
724 * Read back and check that the selected scheduler is now the default.
726 ret = fread(tmp, 1, sizeof(tmp), f);
727 if (ferror(f) || ret < 0) {
728 td_verror(td, errno, "fread");
733 sprintf(tmp2, "[%s]", td->o.ioscheduler);
734 if (!strstr(tmp, tmp2)) {
735 log_err("fio: io scheduler %s not found\n", td->o.ioscheduler);
736 td_verror(td, EINVAL, "iosched_switch");
745 static int keep_running(struct thread_data *td)
747 unsigned long long io_done;
751 if (td->o.time_based)
758 io_done = td->io_bytes[DDIR_READ] + td->io_bytes[DDIR_WRITE] + td->io_skip_bytes;
759 if (io_done < td->o.size)
765 static int clear_io_state(struct thread_data *td)
771 td->ts.stat_io_bytes[0] = td->ts.stat_io_bytes[1] = 0;
772 td->this_io_bytes[0] = td->this_io_bytes[1] = 0;
776 td->rw_end_set[0] = td->rw_end_set[1] = 0;
778 td->last_was_sync = 0;
781 * reset file done count if we are to start over
783 if (td->o.time_based || td->o.loops)
784 td->nr_done_files = 0;
786 for_each_file(td, f, i)
787 td_io_close_file(td, f);
790 for_each_file(td, f, i) {
791 f->flags &= ~FIO_FILE_DONE;
792 ret = td_io_open_file(td, f);
801 * Entry point for the thread based jobs. The process based jobs end up
802 * here as well, after a little setup.
804 static void *thread_main(void *data)
806 unsigned long long runtime[2], elapsed;
807 struct thread_data *td = data;
810 if (!td->o.use_thread)
815 dprint(FD_PROCESS, "jobs pid=%d started\n", td->pid);
817 INIT_LIST_HEAD(&td->io_u_freelist);
818 INIT_LIST_HEAD(&td->io_u_busylist);
819 INIT_LIST_HEAD(&td->io_u_requeues);
820 INIT_LIST_HEAD(&td->io_log_list);
821 INIT_LIST_HEAD(&td->io_hist_list);
822 td->io_hist_tree = RB_ROOT;
824 td_set_runstate(td, TD_INITIALIZED);
825 fio_sem_up(startup_sem);
826 fio_sem_down(td->mutex);
829 * the ->mutex semaphore is now no longer used, close it to avoid
830 * eating a file descriptor
832 fio_sem_remove(td->mutex);
835 * May alter parameters that init_io_u() will use, so we need to
844 if (td->o.cpumask_set && fio_setaffinity(td) == -1) {
845 td_verror(td, errno, "cpu_set_affinity");
849 if (td->ioprio_set) {
850 if (ioprio_set(IOPRIO_WHO_PROCESS, 0, td->ioprio) == -1) {
851 td_verror(td, errno, "ioprio_set");
856 if (nice(td->o.nice) == -1) {
857 td_verror(td, errno, "nice");
861 if (td->o.ioscheduler && switch_ioscheduler(td))
864 if (!td->o.create_serialize && setup_files(td))
873 if (init_random_map(td))
876 if (td->o.exec_prerun) {
877 if (system(td->o.exec_prerun) < 0)
881 fio_gettime(&td->epoch, NULL);
882 memcpy(&td->timeout_end, &td->epoch, sizeof(td->epoch));
883 getrusage(RUSAGE_SELF, &td->ts.ru_start);
885 runtime[0] = runtime[1] = 0;
887 while (keep_running(td)) {
888 fio_gettime(&td->start, NULL);
889 memcpy(&td->ts.stat_sample_time, &td->start, sizeof(td->start));
892 memcpy(&td->lastrate, &td->ts.stat_sample_time, sizeof(td->lastrate));
894 if (clear_state && clear_io_state(td))
897 prune_io_piece_log(td);
903 if (td_read(td) && td->io_bytes[DDIR_READ]) {
904 if (td->rw_end_set[DDIR_READ])
905 elapsed = utime_since(&td->start, &td->rw_end[DDIR_READ]);
907 elapsed = utime_since_now(&td->start);
909 runtime[DDIR_READ] += elapsed;
911 if (td_write(td) && td->io_bytes[DDIR_WRITE]) {
912 if (td->rw_end_set[DDIR_WRITE])
913 elapsed = utime_since(&td->start, &td->rw_end[DDIR_WRITE]);
915 elapsed = utime_since_now(&td->start);
917 runtime[DDIR_WRITE] += elapsed;
920 if (td->error || td->terminate)
923 if (!td->o.do_verify ||
924 td->o.verify == VERIFY_NONE ||
925 (td->io_ops->flags & FIO_UNIDIR))
928 if (clear_io_state(td))
931 fio_gettime(&td->start, NULL);
935 runtime[DDIR_READ] += utime_since_now(&td->start);
937 if (td->error || td->terminate)
941 update_rusage_stat(td);
942 td->ts.runtime[0] = (runtime[0] + 999) / 1000;
943 td->ts.runtime[1] = (runtime[1] + 999) / 1000;
944 td->ts.total_run_time = mtime_since_now(&td->epoch);
945 td->ts.io_bytes[0] = td->io_bytes[0];
946 td->ts.io_bytes[1] = td->io_bytes[1];
949 finish_log(td, td->ts.bw_log, "bw");
951 finish_log(td, td->ts.slat_log, "slat");
953 finish_log(td, td->ts.clat_log, "clat");
954 if (td->o.exec_postrun) {
955 if (system(td->o.exec_postrun) < 0)
956 log_err("fio: postrun %s failed\n", td->o.exec_postrun);
959 if (exitall_on_terminate)
960 terminate_threads(td->groupid);
964 printf("fio: pid=%d, err=%d/%s\n", td->pid, td->error, td->verror);
970 * do this very late, it will log file closing as well
972 if (td->o.write_iolog_file)
973 write_iolog_close(td);
975 options_mem_free(td);
976 td_set_runstate(td, TD_EXITED);
977 return (void *) (unsigned long) td->error;
981 * We cannot pass the td data into a forked process, so attach the td and
982 * pass it to the thread worker.
984 static int fork_main(int shmid, int offset)
986 struct thread_data *td;
989 data = shmat(shmid, NULL, 0);
990 if (data == (void *) -1) {
997 td = data + offset * sizeof(struct thread_data);
998 ret = thread_main(td);
1000 return (int) (unsigned long) ret;
1004 * Run over the job map and reap the threads that have exited, if any.
1006 static void reap_threads(int *nr_running, int *t_rate, int *m_rate)
1008 struct thread_data *td;
1009 int i, cputhreads, realthreads, pending, status, ret;
1012 * reap exited threads (TD_EXITED -> TD_REAPED)
1014 realthreads = pending = cputhreads = 0;
1015 for_each_td(td, i) {
1019 * ->io_ops is NULL for a thread that has closed its
1022 if (td->io_ops && !strcmp(td->io_ops->name, "cpuio"))
1031 if (td->runstate == TD_REAPED)
1033 if (td->o.use_thread) {
1034 if (td->runstate == TD_EXITED) {
1035 td_set_runstate(td, TD_REAPED);
1042 if (td->runstate == TD_EXITED)
1046 * check if someone quit or got killed in an unusual way
1048 ret = waitpid(td->pid, &status, flags);
1050 if (errno == ECHILD) {
1051 log_err("fio: pid=%d disappeared %d\n", td->pid, td->runstate);
1052 td_set_runstate(td, TD_REAPED);
1056 } else if (ret == td->pid) {
1057 if (WIFSIGNALED(status)) {
1058 int sig = WTERMSIG(status);
1061 log_err("fio: pid=%d, got signal=%d\n", td->pid, sig);
1062 td_set_runstate(td, TD_REAPED);
1065 if (WIFEXITED(status)) {
1066 if (WEXITSTATUS(status) && !td->error)
1067 td->error = WEXITSTATUS(status);
1069 td_set_runstate(td, TD_REAPED);
1075 * thread is not dead, continue
1080 if (td->o.use_thread) {
1083 dprint(FD_PROCESS, "joining tread %d\n", td->pid);
1084 if (pthread_join(td->thread, (void *) &ret)) {
1085 dprint(FD_PROCESS, "join failed %ld\n", ret);
1086 perror("pthread_join");
1091 (*m_rate) -= td->o.ratemin;
1092 (*t_rate) -= td->o.rate;
1099 if (*nr_running == cputhreads && !pending && realthreads)
1100 terminate_threads(TERMINATE_ALL);
1104 * Main function for kicking off and reaping jobs, as needed.
1106 static void run_threads(void)
1108 struct thread_data *td;
1109 unsigned long spent;
1110 int i, todo, nr_running, m_rate, t_rate, nr_started;
1112 if (fio_pin_memory())
1115 if (!terse_output) {
1116 printf("Starting ");
1118 printf("%d thread%s", nr_thread, nr_thread > 1 ? "s" : "");
1122 printf("%d process%s", nr_process, nr_process > 1 ? "es" : "");
1128 signal(SIGINT, sig_handler);
1129 signal(SIGALRM, sig_handler);
1131 todo = thread_number;
1134 m_rate = t_rate = 0;
1136 for_each_td(td, i) {
1137 print_status_init(td->thread_number - 1);
1139 if (!td->o.create_serialize) {
1145 * do file setup here so it happens sequentially,
1146 * we don't want X number of threads getting their
1147 * client data interspersed on disk
1149 if (setup_files(td)) {
1152 log_err("fio: pid=%d, err=%d/%s\n", td->pid, td->error, td->verror);
1153 td_set_runstate(td, TD_REAPED);
1163 struct thread_data *map[MAX_JOBS];
1164 struct timeval this_start;
1165 int this_jobs = 0, left;
1168 * create threads (TD_NOT_CREATED -> TD_CREATED)
1170 for_each_td(td, i) {
1171 if (td->runstate != TD_NOT_CREATED)
1175 * never got a chance to start, killed by other
1176 * thread for some reason
1178 if (td->terminate) {
1183 if (td->o.start_delay) {
1184 spent = mtime_since_genesis();
1186 if (td->o.start_delay * 1000 > spent)
1190 if (td->o.stonewall && (nr_started || nr_running))
1194 * Set state to created. Thread will transition
1195 * to TD_INITIALIZED when it's done setting up.
1197 td_set_runstate(td, TD_CREATED);
1198 map[this_jobs++] = td;
1201 if (td->o.use_thread) {
1202 dprint(FD_PROCESS, "will pthread_create\n");
1203 if (pthread_create(&td->thread, NULL, thread_main, td)) {
1204 perror("thread_create");
1209 dprint(FD_PROCESS, "will fork\n");
1211 int ret = fork_main(shm_id, i);
1216 fio_sem_down(startup_sem);
1220 * Wait for the started threads to transition to
1223 fio_gettime(&this_start, NULL);
1225 while (left && !fio_abort) {
1226 if (mtime_since_now(&this_start) > JOB_START_TIMEOUT)
1231 for (i = 0; i < this_jobs; i++) {
1235 if (td->runstate == TD_INITIALIZED) {
1238 } else if (td->runstate >= TD_EXITED) {
1242 nr_running++; /* work-around... */
1248 log_err("fio: %d jobs failed to start\n", left);
1249 for (i = 0; i < this_jobs; i++) {
1253 kill(td->pid, SIGTERM);
1259 * start created threads (TD_INITIALIZED -> TD_RUNNING).
1261 for_each_td(td, i) {
1262 if (td->runstate != TD_INITIALIZED)
1265 td_set_runstate(td, TD_RUNNING);
1268 m_rate += td->o.ratemin;
1269 t_rate += td->o.rate;
1271 fio_sem_up(td->mutex);
1274 reap_threads(&nr_running, &t_rate, &m_rate);
1280 while (nr_running) {
1281 reap_threads(&nr_running, &t_rate, &m_rate);
1289 int main(int argc, char *argv[])
1294 * We need locale for number printing, if it isn't set then just
1295 * go with the US format.
1297 if (!getenv("LC_NUMERIC"))
1298 setlocale(LC_NUMERIC, "en_US");
1300 if (parse_options(argc, argv))
1306 ps = sysconf(_SC_PAGESIZE);
1308 log_err("Failed to get page size\n");
1316 setup_log(&agg_io_log[DDIR_READ]);
1317 setup_log(&agg_io_log[DDIR_WRITE]);
1320 startup_sem = fio_sem_init(0);
1324 disk_util_timer_arm();
1331 __finish_log(agg_io_log[DDIR_READ],"agg-read_bw.log");
1332 __finish_log(agg_io_log[DDIR_WRITE],"agg-write_bw.log");
1336 fio_sem_remove(startup_sem);