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 * This program is free software; you can redistribute it and/or modify
8 * it under the terms of the GNU General Public License as published by
9 * the Free Software Foundation; either version 2 of the License, or
10 * (at your option) any later version.
12 * This program is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 * GNU General Public License for more details.
17 * You should have received a copy of the GNU General Public License
18 * along with this program; if not, write to the Free Software
19 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
32 #include <sys/ioctl.h>
40 #define ALIGN(buf) (char *) (((unsigned long) (buf) + MASK) & ~(MASK))
43 int thread_number = 0;
46 char *fio_inst_prefix = _INST_PREFIX;
48 extern unsigned long long mlock_size;
50 #define should_fsync(td) ((td_write(td) || td_rw(td)) && (!(td)->odirect || (td)->override_sync))
52 static volatile int startup_sem;
54 #define TERMINATE_ALL (-1)
55 #define JOB_START_TIMEOUT (5 * 1000)
57 static void terminate_threads(int group_id)
61 for (i = 0; i < thread_number; i++) {
62 struct thread_data *td = &threads[i];
64 if (group_id == TERMINATE_ALL || groupid == td->groupid) {
71 static void sig_handler(int sig)
76 disk_util_timer_arm();
77 print_thread_status();
80 printf("\nfio: terminating on signal\n");
82 terminate_threads(TERMINATE_ALL);
88 * The ->file_map[] contains a map of blocks we have or have not done io
89 * to yet. Used to make sure we cover the entire range in a fair fashion.
91 static int random_map_free(struct thread_data *td, struct fio_file *f,
92 unsigned long long block)
94 unsigned int idx = RAND_MAP_IDX(td, f, block);
95 unsigned int bit = RAND_MAP_BIT(td, f, block);
97 return (f->file_map[idx] & (1UL << bit)) == 0;
101 * Return the next free block in the map.
103 static int get_next_free_block(struct thread_data *td, struct fio_file *f,
104 unsigned long long *b)
110 while ((*b) * td->min_bs < f->file_size) {
111 if (f->file_map[i] != -1UL) {
112 *b += ffz(f->file_map[i]);
116 *b += BLOCKS_PER_MAP;
124 * Mark a given offset as used in the map.
126 static void mark_random_map(struct thread_data *td, struct fio_file *f,
129 unsigned long long block = io_u->offset / (unsigned long long) td->min_bs;
130 unsigned int blocks = 0;
132 while (blocks < (io_u->buflen / td->min_bs)) {
133 unsigned int idx, bit;
135 if (!random_map_free(td, f, block))
138 idx = RAND_MAP_IDX(td, f, block);
139 bit = RAND_MAP_BIT(td, f, block);
141 assert(idx < f->num_maps);
143 f->file_map[idx] |= (1UL << bit);
148 if ((blocks * td->min_bs) < io_u->buflen)
149 io_u->buflen = blocks * td->min_bs;
153 * For random io, generate a random new block and see if it's used. Repeat
154 * until we find a free one. For sequential io, just return the end of
155 * the last io issued.
157 static int get_next_offset(struct thread_data *td, struct fio_file *f,
158 unsigned long long *offset)
160 unsigned long long b, rb;
163 if (!td->sequential) {
164 unsigned long long max_blocks = td->io_size / td->min_bs;
168 r = os_random_long(&td->random_state);
169 b = ((max_blocks - 1) * r / (unsigned long long) (RAND_MAX+1.0));
170 rb = b + (f->file_offset / td->min_bs);
172 } while (!random_map_free(td, f, rb) && loops);
175 if (get_next_free_block(td, f, &b))
179 b = f->last_pos / td->min_bs;
181 *offset = (b * td->min_bs) + f->file_offset;
182 if (*offset > f->file_size)
188 static unsigned int get_next_buflen(struct thread_data *td)
193 if (td->min_bs == td->max_bs)
196 r = os_random_long(&td->bsrange_state);
197 buflen = (1 + (double) (td->max_bs - 1) * r / (RAND_MAX + 1.0));
198 buflen = (buflen + td->min_bs - 1) & ~(td->min_bs - 1);
201 if (buflen > td->io_size - td->this_io_bytes[td->ddir]) {
203 * if using direct/raw io, we may not be able to
204 * shrink the size. so just fail it.
206 if (td->io_ops->flags & FIO_RAWIO)
209 buflen = td->io_size - td->this_io_bytes[td->ddir];
216 * Check if we are above the minimum rate given.
218 static int check_min_rate(struct thread_data *td, struct timeval *now)
225 * allow a 2 second settle period in the beginning
227 if (mtime_since(&td->start, now) < 2000)
231 * if rate blocks is set, sample is running
233 if (td->rate_bytes) {
234 spent = mtime_since(&td->lastrate, now);
235 if (spent < td->ratecycle)
238 rate = (td->this_io_bytes[ddir] - td->rate_bytes) / spent;
239 if (rate < td->ratemin) {
240 fprintf(f_out, "%s: min rate %d not met, got %ldKiB/sec\n", td->name, td->ratemin, rate);
242 terminate_threads(td->groupid);
247 td->rate_bytes = td->this_io_bytes[ddir];
248 memcpy(&td->lastrate, now, sizeof(*now));
252 static inline int runtime_exceeded(struct thread_data *td, struct timeval *t)
256 if (mtime_since(&td->epoch, t) >= td->timeout * 1000)
263 * Return the data direction for the next io_u. If the job is a
264 * mixed read/write workload, check the rwmix cycle and switch if
267 static int get_rw_ddir(struct thread_data *td)
271 unsigned long elapsed;
273 gettimeofday(&now, NULL);
274 elapsed = mtime_since_now(&td->rwmix_switch);
277 * Check if it's time to seed a new data direction.
279 if (elapsed >= td->rwmixcycle) {
283 r = os_random_long(&td->rwmix_state);
284 v = 1 + (int) (100.0 * (r / (RAND_MAX + 1.0)));
285 if (v < td->rwmixread)
286 td->rwmix_ddir = DDIR_READ;
288 td->rwmix_ddir = DDIR_WRITE;
289 memcpy(&td->rwmix_switch, &now, sizeof(now));
291 return td->rwmix_ddir;
292 } else if (td_read(td))
298 static int td_io_prep(struct thread_data *td, struct io_u *io_u)
300 if (td->io_ops->prep && td->io_ops->prep(td, io_u))
306 void put_io_u(struct thread_data *td, struct io_u *io_u)
309 list_del(&io_u->list);
310 list_add(&io_u->list, &td->io_u_freelist);
314 static int fill_io_u(struct thread_data *td, struct fio_file *f,
318 * If using an iolog, grab next piece if any available.
321 return read_iolog_get(td, io_u);
324 * No log, let the seq/rand engine retrieve the next position.
326 if (!get_next_offset(td, f, &io_u->offset)) {
327 io_u->buflen = get_next_buflen(td);
330 io_u->ddir = get_rw_ddir(td);
333 * If using a write iolog, store this entry.
336 write_iolog_put(td, io_u);
346 #define queue_full(td) list_empty(&(td)->io_u_freelist)
348 struct io_u *__get_io_u(struct thread_data *td)
350 struct io_u *io_u = NULL;
352 if (!queue_full(td)) {
353 io_u = list_entry(td->io_u_freelist.next, struct io_u, list);
357 list_del(&io_u->list);
358 list_add(&io_u->list, &td->io_u_busylist);
366 * Return an io_u to be processed. Gets a buflen and offset, sets direction,
367 * etc. The returned io_u is fully ready to be prepped and submitted.
369 static struct io_u *get_io_u(struct thread_data *td, struct fio_file *f)
373 io_u = __get_io_u(td);
377 if (td->zone_bytes >= td->zone_size) {
379 f->last_pos += td->zone_skip;
382 if (fill_io_u(td, f, io_u)) {
387 if (io_u->buflen + io_u->offset > f->file_size) {
388 if (td->io_ops->flags & FIO_RAWIO) {
393 io_u->buflen = f->file_size - io_u->offset;
401 if (!td->read_iolog && !td->sequential)
402 mark_random_map(td, f, io_u);
404 f->last_pos += io_u->buflen;
406 if (td->verify != VERIFY_NONE)
407 populate_verify_io_u(td, io_u);
409 if (td_io_prep(td, io_u)) {
414 gettimeofday(&io_u->start_time, NULL);
418 static inline void td_set_runstate(struct thread_data *td, int runstate)
420 td->runstate = runstate;
423 static struct fio_file *get_next_file(struct thread_data *td)
425 unsigned int old_next_file = td->next_file;
429 f = &td->files[td->next_file];
432 if (td->next_file >= td->nr_files)
439 } while (td->next_file != old_next_file);
444 static int td_io_sync(struct thread_data *td, struct fio_file *f)
446 if (td->io_ops->sync)
447 return td->io_ops->sync(td, f);
452 static int td_io_getevents(struct thread_data *td, int min, int max,
455 return td->io_ops->getevents(td, min, max, t);
458 static int td_io_queue(struct thread_data *td, struct io_u *io_u)
460 gettimeofday(&io_u->issue_time, NULL);
462 return td->io_ops->queue(td, io_u);
465 #define iocb_time(iocb) ((unsigned long) (iocb)->data)
467 static void io_completed(struct thread_data *td, struct io_u *io_u,
468 struct io_completion_data *icd)
473 gettimeofday(&e, NULL);
476 unsigned int bytes = io_u->buflen - io_u->resid;
477 const int idx = io_u->ddir;
479 td->io_blocks[idx]++;
480 td->io_bytes[idx] += bytes;
481 td->zone_bytes += bytes;
482 td->this_io_bytes[idx] += bytes;
484 msec = mtime_since(&io_u->issue_time, &e);
486 add_clat_sample(td, idx, msec);
487 add_bw_sample(td, idx);
489 if ((td_rw(td) || td_write(td)) && idx == DDIR_WRITE)
490 log_io_piece(td, io_u);
492 icd->bytes_done[idx] += bytes;
494 icd->error = io_u->error;
497 static void ios_completed(struct thread_data *td,struct io_completion_data *icd)
503 icd->bytes_done[0] = icd->bytes_done[1] = 0;
505 for (i = 0; i < icd->nr; i++) {
506 io_u = td->io_ops->event(td, i);
508 io_completed(td, io_u, icd);
514 * When job exits, we can cancel the in-flight IO if we are using async
515 * io. Attempt to do so.
517 static void cleanup_pending_aio(struct thread_data *td)
519 struct timespec ts = { .tv_sec = 0, .tv_nsec = 0};
520 struct list_head *entry, *n;
521 struct io_completion_data icd;
526 * get immediately available events, if any
528 r = td_io_getevents(td, 0, td->cur_depth, &ts);
531 ios_completed(td, &icd);
535 * now cancel remaining active events
537 if (td->io_ops->cancel) {
538 list_for_each_safe(entry, n, &td->io_u_busylist) {
539 io_u = list_entry(entry, struct io_u, list);
541 r = td->io_ops->cancel(td, io_u);
548 r = td_io_getevents(td, td->cur_depth, td->cur_depth, NULL);
551 ios_completed(td, &icd);
557 * The main verify engine. Runs over the writes we previusly submitted,
558 * reads the blocks back in, and checks the crc/md5 of the data.
560 void do_verify(struct thread_data *td)
563 struct io_u *io_u, *v_io_u = NULL;
564 struct io_completion_data icd;
569 * sync io first and invalidate cache, to make sure we really
572 for_each_file(td, f, i) {
574 file_invalidate_cache(td, f);
577 td_set_runstate(td, TD_VERIFYING);
583 gettimeofday(&t, NULL);
584 if (runtime_exceeded(td, &t))
587 io_u = __get_io_u(td);
591 if (get_next_verify(td, io_u)) {
596 f = get_next_file(td);
602 if (td_io_prep(td, io_u)) {
607 ret = td_io_queue(td, io_u);
615 * we have one pending to verify, do that while
616 * we are doing io on the next one
618 if (do_io_u_verify(td, &v_io_u))
621 ret = td_io_getevents(td, 1, 1, NULL);
628 v_io_u = td->io_ops->event(td, 0);
631 io_completed(td, v_io_u, &icd);
634 td_verror(td, icd.error);
635 put_io_u(td, v_io_u);
641 * if we can't submit more io, we need to verify now
643 if (queue_full(td) && do_io_u_verify(td, &v_io_u))
648 do_io_u_verify(td, &v_io_u);
651 cleanup_pending_aio(td);
653 td_set_runstate(td, TD_RUNNING);
657 * Not really an io thread, all it does is burn CPU cycles in the specified
660 static void do_cpuio(struct thread_data *td)
663 int split = 100 / td->cpuload;
666 while (!td->terminate) {
667 gettimeofday(&e, NULL);
669 if (runtime_exceeded(td, &e))
675 usec_sleep(td, 10000);
682 * Main IO worker function. It retrieves io_u's to process and queues
683 * and reaps them, checking for rate and errors along the way.
685 static void do_io(struct thread_data *td)
687 struct io_completion_data icd;
693 td_set_runstate(td, TD_RUNNING);
695 while (td->this_io_bytes[td->ddir] < td->io_size) {
696 struct timespec ts = { .tv_sec = 0, .tv_nsec = 0};
697 struct timespec *timeout;
704 f = get_next_file(td);
708 io_u = get_io_u(td, f);
712 memcpy(&s, &io_u->start_time, sizeof(s));
714 ret = td_io_queue(td, io_u);
721 add_slat_sample(td, io_u->ddir, mtime_since(&io_u->start_time, &io_u->issue_time));
723 if (td->cur_depth < td->iodepth) {
732 ret = td_io_getevents(td, min_evts, td->cur_depth, timeout);
740 ios_completed(td, &icd);
742 td_verror(td, icd.error);
747 * the rate is batched for now, it should work for batches
748 * of completions except the very first one which may look
751 gettimeofday(&e, NULL);
752 usec = utime_since(&s, &e);
754 rate_throttle(td, usec, icd.bytes_done[td->ddir]);
756 if (check_min_rate(td, &e)) {
757 td_verror(td, ENOMEM);
761 if (runtime_exceeded(td, &e))
765 usec_sleep(td, td->thinktime);
767 if (should_fsync(td) && td->fsync_blocks &&
768 (td->io_blocks[DDIR_WRITE] % td->fsync_blocks) == 0)
774 cleanup_pending_aio(td);
776 if (should_fsync(td) && td->end_fsync) {
777 td_set_runstate(td, TD_FSYNCING);
778 for_each_file(td, f, i)
784 static int td_io_init(struct thread_data *td)
786 if (td->io_ops->init)
787 return td->io_ops->init(td);
792 static void cleanup_io_u(struct thread_data *td)
794 struct list_head *entry, *n;
797 list_for_each_safe(entry, n, &td->io_u_freelist) {
798 io_u = list_entry(entry, struct io_u, list);
800 list_del(&io_u->list);
804 if (td->mem_type == MEM_MALLOC)
805 free(td->orig_buffer);
806 else if (td->mem_type == MEM_SHM) {
807 struct shmid_ds sbuf;
809 shmdt(td->orig_buffer);
810 shmctl(td->shm_id, IPC_RMID, &sbuf);
811 } else if (td->mem_type == MEM_MMAP)
812 munmap(td->orig_buffer, td->orig_buffer_size);
814 log_err("Bad memory type %d\n", td->mem_type);
816 td->orig_buffer = NULL;
819 static int init_io_u(struct thread_data *td)
825 if (td->io_ops->flags & FIO_CPUIO)
828 if (td->io_ops->flags & FIO_SYNCIO)
831 max_units = td->iodepth;
833 td->orig_buffer_size = td->max_bs * max_units + MASK;
835 if (td->mem_type == MEM_MALLOC)
836 td->orig_buffer = malloc(td->orig_buffer_size);
837 else if (td->mem_type == MEM_SHM) {
838 td->shm_id = shmget(IPC_PRIVATE, td->orig_buffer_size, IPC_CREAT | 0600);
839 if (td->shm_id < 0) {
840 td_verror(td, errno);
845 td->orig_buffer = shmat(td->shm_id, NULL, 0);
846 if (td->orig_buffer == (void *) -1) {
847 td_verror(td, errno);
849 td->orig_buffer = NULL;
852 } else if (td->mem_type == MEM_MMAP) {
853 td->orig_buffer = mmap(NULL, td->orig_buffer_size, PROT_READ | PROT_WRITE, MAP_PRIVATE | OS_MAP_ANON, 0, 0);
854 if (td->orig_buffer == MAP_FAILED) {
855 td_verror(td, errno);
857 td->orig_buffer = NULL;
862 p = ALIGN(td->orig_buffer);
863 for (i = 0; i < max_units; i++) {
864 io_u = malloc(sizeof(*io_u));
865 memset(io_u, 0, sizeof(*io_u));
866 INIT_LIST_HEAD(&io_u->list);
868 io_u->buf = p + td->max_bs * i;
870 list_add(&io_u->list, &td->io_u_freelist);
876 static int switch_ioscheduler(struct thread_data *td)
878 char tmp[256], tmp2[128];
882 sprintf(tmp, "%s/queue/scheduler", td->sysfs_root);
884 f = fopen(tmp, "r+");
886 td_verror(td, errno);
893 ret = fwrite(td->ioscheduler, strlen(td->ioscheduler), 1, f);
894 if (ferror(f) || ret != 1) {
895 td_verror(td, errno);
903 * Read back and check that the selected scheduler is now the default.
905 ret = fread(tmp, 1, sizeof(tmp), f);
906 if (ferror(f) || ret < 0) {
907 td_verror(td, errno);
912 sprintf(tmp2, "[%s]", td->ioscheduler);
913 if (!strstr(tmp, tmp2)) {
914 log_err("fio: io scheduler %s not found\n", td->ioscheduler);
915 td_verror(td, EINVAL);
924 static void clear_io_state(struct thread_data *td)
929 td->stat_io_bytes[0] = td->stat_io_bytes[1] = 0;
930 td->this_io_bytes[0] = td->this_io_bytes[1] = 0;
933 for_each_file(td, f, i) {
935 if (td->io_ops->flags & FIO_SYNCIO)
936 lseek(f->fd, SEEK_SET, 0);
939 memset(f->file_map, 0, f->num_maps * sizeof(long));
944 * Entry point for the thread based jobs. The process based jobs end up
945 * here as well, after a little setup.
947 static void *thread_main(void *data)
949 struct thread_data *td = data;
956 INIT_LIST_HEAD(&td->io_u_freelist);
957 INIT_LIST_HEAD(&td->io_u_busylist);
958 INIT_LIST_HEAD(&td->io_hist_list);
959 INIT_LIST_HEAD(&td->io_log_list);
964 if (fio_setaffinity(td) == -1) {
965 td_verror(td, errno);
976 if (ioprio_set(IOPRIO_WHO_PROCESS, 0, td->ioprio) == -1) {
977 td_verror(td, errno);
982 if (nice(td->nice) == -1) {
983 td_verror(td, errno);
987 if (init_random_state(td))
990 if (td->ioscheduler && switch_ioscheduler(td))
993 td_set_runstate(td, TD_INITIALIZED);
994 fio_sem_up(&startup_sem);
995 fio_sem_down(&td->mutex);
997 if (!td->create_serialize && setup_files(td))
1000 gettimeofday(&td->epoch, NULL);
1002 if (td->exec_prerun)
1003 system(td->exec_prerun);
1005 while (td->loops--) {
1006 getrusage(RUSAGE_SELF, &td->ru_start);
1007 gettimeofday(&td->start, NULL);
1008 memcpy(&td->stat_sample_time, &td->start, sizeof(td->start));
1011 memcpy(&td->lastrate, &td->stat_sample_time, sizeof(td->lastrate));
1014 prune_io_piece_log(td);
1016 if (td->io_ops->flags & FIO_CPUIO)
1021 td->runtime[td->ddir] += mtime_since_now(&td->start);
1022 if (td_rw(td) && td->io_bytes[td->ddir ^ 1])
1023 td->runtime[td->ddir ^ 1] = td->runtime[td->ddir];
1025 update_rusage_stat(td);
1027 if (td->error || td->terminate)
1030 if (td->verify == VERIFY_NONE)
1034 gettimeofday(&td->start, NULL);
1038 td->runtime[DDIR_READ] += mtime_since_now(&td->start);
1040 if (td->error || td->terminate)
1045 finish_log(td, td->bw_log, "bw");
1047 finish_log(td, td->slat_log, "slat");
1049 finish_log(td, td->clat_log, "clat");
1050 if (td->write_iolog)
1051 write_iolog_close(td);
1052 if (td->exec_postrun)
1053 system(td->exec_postrun);
1055 if (exitall_on_terminate)
1056 terminate_threads(td->groupid);
1062 td_set_runstate(td, TD_EXITED);
1068 * We cannot pass the td data into a forked process, so attach the td and
1069 * pass it to the thread worker.
1071 static void *fork_main(int shmid, int offset)
1073 struct thread_data *td;
1076 data = shmat(shmid, NULL, 0);
1077 if (data == (void *) -1) {
1082 td = data + offset * sizeof(struct thread_data);
1089 * Run over the job map and reap the threads that have exited, if any.
1091 static void reap_threads(int *nr_running, int *t_rate, int *m_rate)
1096 * reap exited threads (TD_EXITED -> TD_REAPED)
1098 for (i = 0, cputhreads = 0; i < thread_number; i++) {
1099 struct thread_data *td = &threads[i];
1102 * ->io_ops is NULL for a thread that has closed its
1105 if (td->io_ops && td->io_ops->flags & FIO_CPUIO)
1108 if (td->runstate != TD_EXITED)
1111 td_set_runstate(td, TD_REAPED);
1113 if (td->use_thread) {
1116 if (pthread_join(td->thread, (void *) &ret))
1117 perror("thread_join");
1119 waitpid(td->pid, NULL, 0);
1122 (*m_rate) -= td->ratemin;
1123 (*t_rate) -= td->rate;
1126 if (*nr_running == cputhreads)
1127 terminate_threads(TERMINATE_ALL);
1130 static void fio_unpin_memory(void *pinned)
1133 if (munlock(pinned, mlock_size) < 0)
1135 munmap(pinned, mlock_size);
1139 static void *fio_pin_memory(void)
1141 unsigned long long phys_mem;
1148 * Don't allow mlock of more than real_mem-128MB
1150 phys_mem = os_phys_mem();
1152 if ((mlock_size + 128 * 1024 * 1024) > phys_mem) {
1153 mlock_size = phys_mem - 128 * 1024 * 1024;
1154 fprintf(f_out, "fio: limiting mlocked memory to %lluMiB\n", mlock_size >> 20);
1158 ptr = mmap(NULL, mlock_size, PROT_READ | PROT_WRITE, MAP_PRIVATE | OS_MAP_ANON, 0, 0);
1160 perror("malloc locked mem");
1163 if (mlock(ptr, mlock_size) < 0) {
1164 munmap(ptr, mlock_size);
1173 * Main function for kicking off and reaping jobs, as needed.
1175 static void run_threads(void)
1177 struct thread_data *td;
1178 unsigned long spent;
1179 int i, todo, nr_running, m_rate, t_rate, nr_started;
1182 mlocked_mem = fio_pin_memory();
1184 if (!terse_output) {
1185 printf("Starting %d thread%s\n", thread_number, thread_number > 1 ? "s" : "");
1189 signal(SIGINT, sig_handler);
1190 signal(SIGALRM, sig_handler);
1192 todo = thread_number;
1195 m_rate = t_rate = 0;
1197 for (i = 0; i < thread_number; i++) {
1200 print_status_init(td->thread_number - 1);
1204 if (!td->create_serialize)
1208 * do file setup here so it happens sequentially,
1209 * we don't want X number of threads getting their
1210 * client data interspersed on disk
1212 if (setup_files(td)) {
1213 td_set_runstate(td, TD_REAPED);
1221 struct thread_data *map[MAX_JOBS];
1222 struct timeval this_start;
1223 int this_jobs = 0, left;
1226 * create threads (TD_NOT_CREATED -> TD_CREATED)
1228 for (i = 0; i < thread_number; i++) {
1231 if (td->runstate != TD_NOT_CREATED)
1235 * never got a chance to start, killed by other
1236 * thread for some reason
1238 if (td->terminate) {
1243 if (td->start_delay) {
1244 spent = mtime_since_genesis();
1246 if (td->start_delay * 1000 > spent)
1250 if (td->stonewall && (nr_started || nr_running))
1254 * Set state to created. Thread will transition
1255 * to TD_INITIALIZED when it's done setting up.
1257 td_set_runstate(td, TD_CREATED);
1258 map[this_jobs++] = td;
1259 fio_sem_init(&startup_sem, 1);
1262 if (td->use_thread) {
1263 if (pthread_create(&td->thread, NULL, thread_main, td)) {
1264 perror("thread_create");
1269 fio_sem_down(&startup_sem);
1271 fork_main(shm_id, i);
1278 * Wait for the started threads to transition to
1281 gettimeofday(&this_start, NULL);
1284 if (mtime_since_now(&this_start) > JOB_START_TIMEOUT)
1289 for (i = 0; i < this_jobs; i++) {
1293 if (td->runstate == TD_INITIALIZED) {
1296 } else if (td->runstate >= TD_EXITED) {
1300 nr_running++; /* work-around... */
1306 log_err("fio: %d jobs failed to start\n", left);
1307 for (i = 0; i < this_jobs; i++) {
1311 kill(td->pid, SIGTERM);
1317 * start created threads (TD_INITIALIZED -> TD_RUNNING).
1319 for (i = 0; i < thread_number; i++) {
1322 if (td->runstate != TD_INITIALIZED)
1325 td_set_runstate(td, TD_RUNNING);
1328 m_rate += td->ratemin;
1331 fio_sem_up(&td->mutex);
1334 reap_threads(&nr_running, &t_rate, &m_rate);
1340 while (nr_running) {
1341 reap_threads(&nr_running, &t_rate, &m_rate);
1346 fio_unpin_memory(mlocked_mem);
1349 int main(int argc, char *argv[])
1351 if (parse_options(argc, argv))
1354 if (!thread_number) {
1355 log_err("Nothing to do\n");
1359 disk_util_timer_arm();