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_mutex *startup_mutex;
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);
86 struct ioengine_ops *ops = td->io_ops;
88 if (ops && (ops->flags & FIO_SIGQUIT))
89 kill(td->pid, SIGQUIT);
95 static void sig_handler(int sig)
100 disk_util_timer_arm();
101 print_thread_status();
104 printf("\nfio: terminating on signal %d\n", sig);
106 terminate_threads(TERMINATE_ALL);
112 * Check if we are above the minimum rate given.
114 static int check_min_rate(struct thread_data *td, struct timeval *now)
116 unsigned long long bytes = 0;
117 unsigned long iops = 0;
122 * No minimum rate set, always ok
124 if (!td->o.ratemin && !td->o.rate_iops_min)
128 * allow a 2 second settle period in the beginning
130 if (mtime_since(&td->start, now) < 2000)
134 iops += td->io_blocks[DDIR_READ];
135 bytes += td->this_io_bytes[DDIR_READ];
138 iops += td->io_blocks[DDIR_WRITE];
139 bytes += td->this_io_bytes[DDIR_WRITE];
143 * if rate blocks is set, sample is running
145 if (td->rate_bytes || td->rate_blocks) {
146 spent = mtime_since(&td->lastrate, now);
147 if (spent < td->o.ratecycle)
152 * check bandwidth specified rate
154 if (bytes < td->rate_bytes) {
155 log_err("%s: min rate %u not met\n", td->o.name, td->o.ratemin);
158 rate = (bytes - td->rate_bytes) / spent;
159 if (rate < td->o.ratemin || bytes < td->rate_bytes) {
160 log_err("%s: min rate %u not met, got %luKiB/sec\n", td->o.name, td->o.ratemin, rate);
166 * checks iops specified rate
168 if (iops < td->o.rate_iops) {
169 log_err("%s: min iops rate %u not met\n", td->o.name, td->o.rate_iops);
172 rate = (iops - td->rate_blocks) / spent;
173 if (rate < td->o.rate_iops_min || iops < td->rate_blocks) {
174 log_err("%s: min iops rate %u not met, got %lu\n", td->o.name, td->o.rate_iops_min, rate);
180 td->rate_bytes = bytes;
181 td->rate_blocks = iops;
182 memcpy(&td->lastrate, now, sizeof(*now));
186 static inline int runtime_exceeded(struct thread_data *td, struct timeval *t)
190 if (mtime_since(&td->epoch, t) >= td->o.timeout * 1000)
197 * When job exits, we can cancel the in-flight IO if we are using async
198 * io. Attempt to do so.
200 static void cleanup_pending_aio(struct thread_data *td)
202 struct list_head *entry, *n;
207 * get immediately available events, if any
209 r = io_u_queued_complete(td, 0);
214 * now cancel remaining active events
216 if (td->io_ops->cancel) {
217 list_for_each_safe(entry, n, &td->io_u_busylist) {
218 io_u = list_entry(entry, struct io_u, list);
221 * if the io_u isn't in flight, then that generally
222 * means someone leaked an io_u. complain but fix
223 * it up, so we don't stall here.
225 if ((io_u->flags & IO_U_F_FLIGHT) == 0) {
226 log_err("fio: non-busy IO on busy list\n");
229 r = td->io_ops->cancel(td, io_u);
237 r = io_u_queued_complete(td, td->cur_depth);
241 * Helper to handle the final sync of a file. Works just like the normal
242 * io path, just does everything sync.
244 static int fio_io_sync(struct thread_data *td, struct fio_file *f)
246 struct io_u *io_u = __get_io_u(td);
252 io_u->ddir = DDIR_SYNC;
255 if (td_io_prep(td, io_u)) {
261 ret = td_io_queue(td, io_u);
263 td_verror(td, io_u->error, "td_io_queue");
266 } else if (ret == FIO_Q_QUEUED) {
267 if (io_u_queued_complete(td, 1) < 0)
269 } else if (ret == FIO_Q_COMPLETED) {
271 td_verror(td, io_u->error, "td_io_queue");
275 if (io_u_sync_complete(td, io_u) < 0)
277 } else if (ret == FIO_Q_BUSY) {
278 if (td_io_commit(td))
287 * The main verify engine. Runs over the writes we previously submitted,
288 * reads the blocks back in, and checks the crc/md5 of the data.
290 static void do_verify(struct thread_data *td)
298 * sync io first and invalidate cache, to make sure we really
301 for_each_file(td, f, i) {
302 if (!(f->flags & FIO_FILE_OPEN))
304 if (fio_io_sync(td, f))
306 if (file_invalidate_cache(td, f))
313 td_set_runstate(td, TD_VERIFYING);
316 while (!td->terminate) {
319 io_u = __get_io_u(td);
323 if (runtime_exceeded(td, &io_u->start_time)) {
329 if (get_next_verify(td, io_u)) {
334 if (td_io_prep(td, io_u)) {
339 io_u->end_io = verify_io_u;
341 ret = td_io_queue(td, io_u);
343 case FIO_Q_COMPLETED:
346 else if (io_u->resid) {
347 int bytes = io_u->xfer_buflen - io_u->resid;
348 struct fio_file *f = io_u->file;
354 td_verror(td, ENODATA, "full resid");
359 io_u->xfer_buflen = io_u->resid;
360 io_u->xfer_buf += bytes;
361 io_u->offset += bytes;
362 f->last_completed_pos = io_u->offset;
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;
488 f->last_completed_pos = io_u->offset;
490 td->ts.short_io_u[io_u->ddir]++;
492 if (io_u->offset == f->real_file_size)
495 requeue_io_u(td, &io_u);
498 fio_gettime(&comp_time, NULL);
499 bytes_done = io_u_sync_complete(td, io_u);
506 * if the engine doesn't have a commit hook,
507 * the io_u is really queued. if it does have such
508 * a hook, it has to call io_u_queued() itself.
510 if (td->io_ops->commit == NULL)
511 io_u_queued(td, io_u);
514 requeue_io_u(td, &io_u);
515 ret2 = td_io_commit(td);
525 if (ret < 0 || td->error)
529 * See if we need to complete some commands
531 if (ret == FIO_Q_QUEUED || ret == FIO_Q_BUSY) {
533 if (queue_full(td) || ret == FIO_Q_BUSY) {
536 if (td->cur_depth > td->o.iodepth_low)
537 min_evts = td->cur_depth - td->o.iodepth_low;
540 fio_gettime(&comp_time, NULL);
541 bytes_done = io_u_queued_complete(td, min_evts);
550 * the rate is batched for now, it should work for batches
551 * of completions except the very first one which may look
554 usec = utime_since(&s, &comp_time);
556 rate_throttle(td, usec, bytes_done);
558 if (check_min_rate(td, &comp_time)) {
559 if (exitall_on_terminate)
560 terminate_threads(td->groupid);
561 td_verror(td, ENODATA, "check_min_rate");
565 if (td->o.thinktime) {
566 unsigned long long b;
568 b = td->io_blocks[0] + td->io_blocks[1];
569 if (!(b % td->o.thinktime_blocks)) {
572 if (td->o.thinktime_spin)
573 __usec_sleep(td->o.thinktime_spin);
575 left = td->o.thinktime - td->o.thinktime_spin;
577 usec_sleep(td, left);
582 if (td->o.fill_device && td->error == ENOSPC) {
591 ret = io_u_queued_complete(td, i);
593 if (should_fsync(td) && td->o.end_fsync) {
594 td_set_runstate(td, TD_FSYNCING);
596 for_each_file(td, f, i) {
597 if (!(f->flags & FIO_FILE_OPEN))
603 cleanup_pending_aio(td);
606 * stop job if we failed doing any IO
608 if ((td->this_io_bytes[0] + td->this_io_bytes[1]) == 0)
612 static void cleanup_io_u(struct thread_data *td)
614 struct list_head *entry, *n;
617 list_for_each_safe(entry, n, &td->io_u_freelist) {
618 io_u = list_entry(entry, struct io_u, list);
620 list_del(&io_u->list);
628 * "randomly" fill the buffer contents
630 static void fill_io_buf(struct thread_data *td, struct io_u *io_u, int max_bs)
632 long *ptr = io_u->buf;
634 if (!td->o.zero_buffers) {
635 while ((void *) ptr - io_u->buf < max_bs) {
636 *ptr = rand() * GOLDEN_RATIO_PRIME;
640 memset(ptr, 0, max_bs);
643 static int init_io_u(struct thread_data *td)
650 max_units = td->o.iodepth;
651 max_bs = max(td->o.max_bs[DDIR_READ], td->o.max_bs[DDIR_WRITE]);
652 td->orig_buffer_size = (unsigned long long) max_bs * (unsigned long long) max_units;
654 if (td->o.mem_type == MEM_SHMHUGE || td->o.mem_type == MEM_MMAPHUGE)
655 td->orig_buffer_size = (td->orig_buffer_size + td->o.hugepage_size - 1) & ~(td->o.hugepage_size - 1);
657 if (td->orig_buffer_size != (size_t) td->orig_buffer_size) {
658 log_err("fio: IO memory too large. Reduce max_bs or iodepth\n");
662 if (allocate_io_mem(td))
666 p = ALIGN(td->orig_buffer);
670 for (i = 0; i < max_units; i++) {
673 io_u = malloc(sizeof(*io_u));
674 memset(io_u, 0, sizeof(*io_u));
675 INIT_LIST_HEAD(&io_u->list);
677 if (!(td->io_ops->flags & FIO_NOIO)) {
678 io_u->buf = p + max_bs * i;
681 fill_io_buf(td, io_u, max_bs);
685 io_u->flags = IO_U_F_FREE;
686 list_add(&io_u->list, &td->io_u_freelist);
694 static int switch_ioscheduler(struct thread_data *td)
696 char tmp[256], tmp2[128];
700 if (td->io_ops->flags & FIO_DISKLESSIO)
703 sprintf(tmp, "%s/queue/scheduler", td->sysfs_root);
705 f = fopen(tmp, "r+");
707 if (errno == ENOENT) {
708 log_err("fio: os or kernel doesn't support IO scheduler switching\n");
711 td_verror(td, errno, "fopen iosched");
718 ret = fwrite(td->o.ioscheduler, strlen(td->o.ioscheduler), 1, f);
719 if (ferror(f) || ret != 1) {
720 td_verror(td, errno, "fwrite");
728 * Read back and check that the selected scheduler is now the default.
730 ret = fread(tmp, 1, sizeof(tmp), f);
731 if (ferror(f) || ret < 0) {
732 td_verror(td, errno, "fread");
737 sprintf(tmp2, "[%s]", td->o.ioscheduler);
738 if (!strstr(tmp, tmp2)) {
739 log_err("fio: io scheduler %s not found\n", td->o.ioscheduler);
740 td_verror(td, EINVAL, "iosched_switch");
749 static int keep_running(struct thread_data *td)
751 unsigned long long io_done;
755 if (td->o.time_based)
762 io_done = td->io_bytes[DDIR_READ] + td->io_bytes[DDIR_WRITE] + td->io_skip_bytes;
763 if (io_done < td->o.size)
769 static int clear_io_state(struct thread_data *td)
775 td->ts.stat_io_bytes[0] = td->ts.stat_io_bytes[1] = 0;
776 td->this_io_bytes[0] = td->this_io_bytes[1] = 0;
780 td->rw_end_set[0] = td->rw_end_set[1] = 0;
782 td->last_was_sync = 0;
785 * reset file done count if we are to start over
787 if (td->o.time_based || td->o.loops)
788 td->nr_done_files = 0;
793 for_each_file(td, f, i) {
794 f->flags &= ~FIO_FILE_DONE;
795 ret = td_io_open_file(td, f);
804 * Entry point for the thread based jobs. The process based jobs end up
805 * here as well, after a little setup.
807 static void *thread_main(void *data)
809 unsigned long long runtime[2], elapsed;
810 struct thread_data *td = data;
813 if (!td->o.use_thread)
818 dprint(FD_PROCESS, "jobs pid=%d started\n", td->pid);
820 INIT_LIST_HEAD(&td->io_u_freelist);
821 INIT_LIST_HEAD(&td->io_u_busylist);
822 INIT_LIST_HEAD(&td->io_u_requeues);
823 INIT_LIST_HEAD(&td->io_log_list);
824 INIT_LIST_HEAD(&td->io_hist_list);
825 td->io_hist_tree = RB_ROOT;
827 td_set_runstate(td, TD_INITIALIZED);
828 fio_mutex_up(startup_mutex);
829 fio_mutex_down(td->mutex);
832 * the ->mutex mutex is now no longer used, close it to avoid
833 * eating a file descriptor
835 fio_mutex_remove(td->mutex);
838 * May alter parameters that init_io_u() will use, so we need to
847 if (td->o.cpumask_set && fio_setaffinity(td) == -1) {
848 td_verror(td, errno, "cpu_set_affinity");
852 if (td->ioprio_set) {
853 if (ioprio_set(IOPRIO_WHO_PROCESS, 0, td->ioprio) == -1) {
854 td_verror(td, errno, "ioprio_set");
859 if (nice(td->o.nice) == -1) {
860 td_verror(td, errno, "nice");
864 if (td->o.ioscheduler && switch_ioscheduler(td))
867 if (!td->o.create_serialize && setup_files(td))
876 if (init_random_map(td))
879 if (td->o.exec_prerun) {
880 if (system(td->o.exec_prerun) < 0)
884 fio_gettime(&td->epoch, NULL);
885 memcpy(&td->timeout_end, &td->epoch, sizeof(td->epoch));
886 getrusage(RUSAGE_SELF, &td->ts.ru_start);
888 runtime[0] = runtime[1] = 0;
890 while (keep_running(td)) {
891 fio_gettime(&td->start, NULL);
892 memcpy(&td->ts.stat_sample_time, &td->start, sizeof(td->start));
895 memcpy(&td->lastrate, &td->ts.stat_sample_time, sizeof(td->lastrate));
897 if (clear_state && clear_io_state(td))
900 prune_io_piece_log(td);
906 if (td_read(td) && td->io_bytes[DDIR_READ]) {
907 if (td->rw_end_set[DDIR_READ])
908 elapsed = utime_since(&td->start, &td->rw_end[DDIR_READ]);
910 elapsed = utime_since_now(&td->start);
912 runtime[DDIR_READ] += elapsed;
914 if (td_write(td) && td->io_bytes[DDIR_WRITE]) {
915 if (td->rw_end_set[DDIR_WRITE])
916 elapsed = utime_since(&td->start, &td->rw_end[DDIR_WRITE]);
918 elapsed = utime_since_now(&td->start);
920 runtime[DDIR_WRITE] += elapsed;
923 if (td->error || td->terminate)
926 if (!td->o.do_verify ||
927 td->o.verify == VERIFY_NONE ||
928 (td->io_ops->flags & FIO_UNIDIR))
931 if (clear_io_state(td))
934 fio_gettime(&td->start, NULL);
938 runtime[DDIR_READ] += utime_since_now(&td->start);
940 if (td->error || td->terminate)
944 update_rusage_stat(td);
945 td->ts.runtime[0] = (runtime[0] + 999) / 1000;
946 td->ts.runtime[1] = (runtime[1] + 999) / 1000;
947 td->ts.total_run_time = mtime_since_now(&td->epoch);
948 td->ts.io_bytes[0] = td->io_bytes[0];
949 td->ts.io_bytes[1] = td->io_bytes[1];
952 finish_log(td, td->ts.bw_log, "bw");
954 finish_log(td, td->ts.slat_log, "slat");
956 finish_log(td, td->ts.clat_log, "clat");
957 if (td->o.exec_postrun) {
958 if (system(td->o.exec_postrun) < 0)
959 log_err("fio: postrun %s failed\n", td->o.exec_postrun);
962 if (exitall_on_terminate)
963 terminate_threads(td->groupid);
967 printf("fio: pid=%d, err=%d/%s\n", td->pid, td->error, td->verror);
968 close_and_free_files(td);
973 * do this very late, it will log file closing as well
975 if (td->o.write_iolog_file)
976 write_iolog_close(td);
978 options_mem_free(td);
979 td_set_runstate(td, TD_EXITED);
980 return (void *) (unsigned long) td->error;
984 * We cannot pass the td data into a forked process, so attach the td and
985 * pass it to the thread worker.
987 static int fork_main(int shmid, int offset)
989 struct thread_data *td;
992 data = shmat(shmid, NULL, 0);
993 if (data == (void *) -1) {
1000 td = data + offset * sizeof(struct thread_data);
1001 ret = thread_main(td);
1003 return (int) (unsigned long) ret;
1007 * Run over the job map and reap the threads that have exited, if any.
1009 static void reap_threads(int *nr_running, int *t_rate, int *m_rate)
1011 struct thread_data *td;
1012 int i, cputhreads, realthreads, pending, status, ret;
1015 * reap exited threads (TD_EXITED -> TD_REAPED)
1017 realthreads = pending = cputhreads = 0;
1018 for_each_td(td, i) {
1022 * ->io_ops is NULL for a thread that has closed its
1025 if (td->io_ops && !strcmp(td->io_ops->name, "cpuio"))
1034 if (td->runstate == TD_REAPED)
1036 if (td->o.use_thread) {
1037 if (td->runstate == TD_EXITED) {
1038 td_set_runstate(td, TD_REAPED);
1045 if (td->runstate == TD_EXITED)
1049 * check if someone quit or got killed in an unusual way
1051 ret = waitpid(td->pid, &status, flags);
1053 if (errno == ECHILD) {
1054 log_err("fio: pid=%d disappeared %d\n", td->pid, td->runstate);
1055 td_set_runstate(td, TD_REAPED);
1059 } else if (ret == td->pid) {
1060 if (WIFSIGNALED(status)) {
1061 int sig = WTERMSIG(status);
1064 log_err("fio: pid=%d, got signal=%d\n", td->pid, sig);
1065 td_set_runstate(td, TD_REAPED);
1068 if (WIFEXITED(status)) {
1069 if (WEXITSTATUS(status) && !td->error)
1070 td->error = WEXITSTATUS(status);
1072 td_set_runstate(td, TD_REAPED);
1078 * thread is not dead, continue
1083 if (td->o.use_thread) {
1086 dprint(FD_PROCESS, "joining tread %d\n", td->pid);
1087 if (pthread_join(td->thread, (void *) &ret)) {
1088 dprint(FD_PROCESS, "join failed %ld\n", ret);
1089 perror("pthread_join");
1094 (*m_rate) -= td->o.ratemin;
1095 (*t_rate) -= td->o.rate;
1102 if (*nr_running == cputhreads && !pending && realthreads)
1103 terminate_threads(TERMINATE_ALL);
1107 * Main function for kicking off and reaping jobs, as needed.
1109 static void run_threads(void)
1111 struct thread_data *td;
1112 unsigned long spent;
1113 int i, todo, nr_running, m_rate, t_rate, nr_started;
1115 if (fio_pin_memory())
1118 if (!terse_output) {
1119 printf("Starting ");
1121 printf("%d thread%s", nr_thread, nr_thread > 1 ? "s" : "");
1125 printf("%d process%s", nr_process, nr_process > 1 ? "es" : "");
1131 signal(SIGINT, sig_handler);
1132 signal(SIGALRM, sig_handler);
1134 todo = thread_number;
1137 m_rate = t_rate = 0;
1139 for_each_td(td, i) {
1140 print_status_init(td->thread_number - 1);
1142 if (!td->o.create_serialize) {
1148 * do file setup here so it happens sequentially,
1149 * we don't want X number of threads getting their
1150 * client data interspersed on disk
1152 if (setup_files(td)) {
1155 log_err("fio: pid=%d, err=%d/%s\n", td->pid, td->error, td->verror);
1156 td_set_runstate(td, TD_REAPED);
1166 struct thread_data *map[MAX_JOBS];
1167 struct timeval this_start;
1168 int this_jobs = 0, left;
1171 * create threads (TD_NOT_CREATED -> TD_CREATED)
1173 for_each_td(td, i) {
1174 if (td->runstate != TD_NOT_CREATED)
1178 * never got a chance to start, killed by other
1179 * thread for some reason
1181 if (td->terminate) {
1186 if (td->o.start_delay) {
1187 spent = mtime_since_genesis();
1189 if (td->o.start_delay * 1000 > spent)
1193 if (td->o.stonewall && (nr_started || nr_running))
1197 * Set state to created. Thread will transition
1198 * to TD_INITIALIZED when it's done setting up.
1200 td_set_runstate(td, TD_CREATED);
1201 map[this_jobs++] = td;
1204 if (td->o.use_thread) {
1205 dprint(FD_PROCESS, "will pthread_create\n");
1206 if (pthread_create(&td->thread, NULL, thread_main, td)) {
1207 perror("thread_create");
1212 dprint(FD_PROCESS, "will fork\n");
1214 int ret = fork_main(shm_id, i);
1219 fio_mutex_down(startup_mutex);
1223 * Wait for the started threads to transition to
1226 fio_gettime(&this_start, NULL);
1228 while (left && !fio_abort) {
1229 if (mtime_since_now(&this_start) > JOB_START_TIMEOUT)
1234 for (i = 0; i < this_jobs; i++) {
1238 if (td->runstate == TD_INITIALIZED) {
1241 } else if (td->runstate >= TD_EXITED) {
1245 nr_running++; /* work-around... */
1251 log_err("fio: %d jobs failed to start\n", left);
1252 for (i = 0; i < this_jobs; i++) {
1256 kill(td->pid, SIGTERM);
1262 * start created threads (TD_INITIALIZED -> TD_RUNNING).
1264 for_each_td(td, i) {
1265 if (td->runstate != TD_INITIALIZED)
1268 td_set_runstate(td, TD_RUNNING);
1271 m_rate += td->o.ratemin;
1272 t_rate += td->o.rate;
1274 fio_mutex_up(td->mutex);
1277 reap_threads(&nr_running, &t_rate, &m_rate);
1283 while (nr_running) {
1284 reap_threads(&nr_running, &t_rate, &m_rate);
1292 int main(int argc, char *argv[])
1297 * We need locale for number printing, if it isn't set then just
1298 * go with the US format.
1300 if (!getenv("LC_NUMERIC"))
1301 setlocale(LC_NUMERIC, "en_US");
1303 if (parse_options(argc, argv))
1309 ps = sysconf(_SC_PAGESIZE);
1311 log_err("Failed to get page size\n");
1319 setup_log(&agg_io_log[DDIR_READ]);
1320 setup_log(&agg_io_log[DDIR_WRITE]);
1323 startup_mutex = fio_mutex_init(0);
1327 disk_util_timer_arm();
1334 __finish_log(agg_io_log[DDIR_READ],"agg-read_bw.log");
1335 __finish_log(agg_io_log[DDIR_WRITE],"agg-write_bw.log");
1339 fio_mutex_remove(startup_mutex);