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 static unsigned long page_mask;
42 (char *) (((unsigned long) (buf) + page_mask) & ~page_mask)
45 int thread_number = 0;
49 static volatile int startup_sem;
50 static volatile int fio_abort;
51 static int exit_value;
53 struct io_log *agg_io_log[2];
55 #define TERMINATE_ALL (-1)
56 #define JOB_START_TIMEOUT (5 * 1000)
58 static inline void td_set_runstate(struct thread_data *td, int runstate)
60 td->runstate = runstate;
63 static void terminate_threads(int group_id, int forced_kill)
65 struct thread_data *td;
69 if (group_id == TERMINATE_ALL || groupid == td->groupid) {
73 td_set_runstate(td, TD_EXITED);
78 static void sig_handler(int sig)
83 disk_util_timer_arm();
84 print_thread_status();
87 printf("\nfio: terminating on signal %d\n", sig);
89 terminate_threads(TERMINATE_ALL, 0);
95 * Check if we are above the minimum rate given.
97 static int check_min_rate(struct thread_data *td, struct timeval *now)
99 unsigned long long bytes = 0;
104 * No minimum rate set, always ok
110 * allow a 2 second settle period in the beginning
112 if (mtime_since(&td->start, now) < 2000)
116 bytes += td->this_io_bytes[DDIR_READ];
118 bytes += td->this_io_bytes[DDIR_WRITE];
121 * if rate blocks is set, sample is running
123 if (td->rate_bytes) {
124 spent = mtime_since(&td->lastrate, now);
125 if (spent < td->ratecycle)
128 if (bytes < td->rate_bytes) {
129 fprintf(f_out, "%s: min rate %u not met\n", td->name, td->ratemin);
132 rate = (bytes - td->rate_bytes) / spent;
133 if (rate < td->ratemin || bytes < td->rate_bytes) {
134 fprintf(f_out, "%s: min rate %u not met, got %luKiB/sec\n", td->name, td->ratemin, rate);
140 td->rate_bytes = bytes;
141 memcpy(&td->lastrate, now, sizeof(*now));
145 static inline int runtime_exceeded(struct thread_data *td, struct timeval *t)
149 if (mtime_since(&td->epoch, t) >= td->timeout * 1000)
156 * When job exits, we can cancel the in-flight IO if we are using async
157 * io. Attempt to do so.
159 static void cleanup_pending_aio(struct thread_data *td)
161 struct list_head *entry, *n;
166 * get immediately available events, if any
168 r = io_u_queued_complete(td, 0);
173 * now cancel remaining active events
175 if (td->io_ops->cancel) {
176 list_for_each_safe(entry, n, &td->io_u_busylist) {
177 io_u = list_entry(entry, struct io_u, list);
180 * if the io_u isn't in flight, then that generally
181 * means someone leaked an io_u. complain but fix
182 * it up, so we don't stall here.
184 if ((io_u->flags & IO_U_F_FLIGHT) == 0) {
185 log_err("fio: non-busy IO on busy list\n");
188 r = td->io_ops->cancel(td, io_u);
196 r = io_u_queued_complete(td, td->cur_depth);
200 * Helper to handle the final sync of a file. Works just like the normal
201 * io path, just does everything sync.
203 static int fio_io_sync(struct thread_data *td, struct fio_file *f)
205 struct io_u *io_u = __get_io_u(td);
211 io_u->ddir = DDIR_SYNC;
214 if (td_io_prep(td, io_u)) {
220 ret = td_io_queue(td, io_u);
222 td_verror(td, io_u->error, "td_io_queue");
225 } else if (ret == FIO_Q_QUEUED) {
226 if (io_u_queued_complete(td, 1) < 0)
228 } else if (ret == FIO_Q_COMPLETED) {
230 td_verror(td, io_u->error, "td_io_queue");
234 if (io_u_sync_complete(td, io_u) < 0)
236 } else if (ret == FIO_Q_BUSY) {
237 if (td_io_commit(td))
246 * The main verify engine. Runs over the writes we previously submitted,
247 * reads the blocks back in, and checks the crc/md5 of the data.
249 static void do_verify(struct thread_data *td)
253 int ret, i, min_events;
256 * sync io first and invalidate cache, to make sure we really
259 for_each_file(td, f, i) {
260 if (fio_io_sync(td, f))
262 if (file_invalidate_cache(td, f))
269 td_set_runstate(td, TD_VERIFYING);
272 while (!td->terminate) {
273 io_u = __get_io_u(td);
277 if (runtime_exceeded(td, &io_u->start_time)) {
282 if (get_next_verify(td, io_u)) {
287 if (td_io_prep(td, io_u)) {
292 io_u->end_io = verify_io_u;
294 ret = td_io_queue(td, io_u);
297 case FIO_Q_COMPLETED:
300 if (io_u->xfer_buflen != io_u->resid && io_u->resid) {
301 int bytes = io_u->xfer_buflen - io_u->resid;
303 io_u->xfer_buflen = io_u->resid;
304 io_u->xfer_buf += bytes;
307 ret = io_u_sync_complete(td, io_u);
314 requeue_io_u(td, &io_u);
315 ret = td_io_commit(td);
319 td_verror(td, -ret, "td_io_queue");
323 if (ret < 0 || td->error)
327 * if we can queue more, do so. but check if there are
328 * completed io_u's first.
331 if (queue_full(td) || ret == FIO_Q_BUSY) {
334 if (td->cur_depth > td->iodepth_low)
335 min_events = td->cur_depth - td->iodepth_low;
339 * Reap required number of io units, if any, and do the
340 * verification on them through the callback handler
342 if (io_u_queued_complete(td, min_events) < 0)
347 min_events = td->cur_depth;
350 ret = io_u_queued_complete(td, min_events);
352 cleanup_pending_aio(td);
354 td_set_runstate(td, TD_RUNNING);
358 * Not really an io thread, all it does is burn CPU cycles in the specified
361 static void do_cpuio(struct thread_data *td)
364 int split = 100 / td->cpuload;
367 while (!td->terminate) {
368 fio_gettime(&e, NULL);
370 if (runtime_exceeded(td, &e))
376 usec_sleep(td, 10000);
383 * Main IO worker function. It retrieves io_u's to process and queues
384 * and reaps them, checking for rate and errors along the way.
386 static void do_io(struct thread_data *td)
392 td_set_runstate(td, TD_RUNNING);
394 while ((td->this_io_bytes[0] + td->this_io_bytes[1]) < td->io_size) {
395 struct timeval comp_time;
407 memcpy(&s, &io_u->start_time, sizeof(s));
409 if (runtime_exceeded(td, &s)) {
414 ret = td_io_queue(td, io_u);
417 case FIO_Q_COMPLETED:
422 if (io_u->xfer_buflen != io_u->resid && io_u->resid) {
423 int bytes = io_u->xfer_buflen - io_u->resid;
425 io_u->xfer_buflen = io_u->resid;
426 io_u->xfer_buf += bytes;
429 fio_gettime(&comp_time, NULL);
430 bytes_done = io_u_sync_complete(td, io_u);
436 * if the engine doesn't have a commit hook,
437 * the io_u is really queued. if it does have such
438 * a hook, it has to call io_u_queued() itself.
440 if (td->io_ops->commit == NULL)
441 io_u_queued(td, io_u);
444 requeue_io_u(td, &io_u);
445 ret = td_io_commit(td);
453 if (ret < 0 || td->error)
457 * See if we need to complete some commands
459 if (ret == FIO_Q_QUEUED || ret == FIO_Q_BUSY) {
461 if (queue_full(td) || ret == FIO_Q_BUSY) {
464 if (td->cur_depth > td->iodepth_low)
465 min_evts = td->cur_depth - td->iodepth_low;
468 fio_gettime(&comp_time, NULL);
469 bytes_done = io_u_queued_complete(td, min_evts);
478 * the rate is batched for now, it should work for batches
479 * of completions except the very first one which may look
482 usec = utime_since(&s, &comp_time);
484 rate_throttle(td, usec, bytes_done);
486 if (check_min_rate(td, &comp_time)) {
487 if (exitall_on_terminate)
488 terminate_threads(td->groupid, 0);
489 td_verror(td, ENODATA, "check_min_rate");
494 unsigned long long b;
496 b = td->io_blocks[0] + td->io_blocks[1];
497 if (!(b % td->thinktime_blocks)) {
500 if (td->thinktime_spin)
501 __usec_sleep(td->thinktime_spin);
503 left = td->thinktime - td->thinktime_spin;
505 usec_sleep(td, left);
515 ret = io_u_queued_complete(td, i);
517 if (should_fsync(td) && td->end_fsync) {
518 td_set_runstate(td, TD_FSYNCING);
519 for_each_file(td, f, i)
523 cleanup_pending_aio(td);
526 static void cleanup_io_u(struct thread_data *td)
528 struct list_head *entry, *n;
531 list_for_each_safe(entry, n, &td->io_u_freelist) {
532 io_u = list_entry(entry, struct io_u, list);
534 list_del(&io_u->list);
542 * "randomly" fill the buffer contents
544 static void fill_rand_buf(struct io_u *io_u, int max_bs)
546 int *ptr = io_u->buf;
548 while ((void *) ptr - io_u->buf < max_bs) {
549 *ptr = rand() * 0x9e370001;
554 static int init_io_u(struct thread_data *td)
561 if (td->io_ops->flags & FIO_CPUIO)
564 if (td->io_ops->flags & FIO_SYNCIO)
567 max_units = td->iodepth;
569 max_bs = max(td->max_bs[DDIR_READ], td->max_bs[DDIR_WRITE]);
570 td->orig_buffer_size = max_bs * max_units;
572 if (td->mem_type == MEM_SHMHUGE || td->mem_type == MEM_MMAPHUGE)
573 td->orig_buffer_size = (td->orig_buffer_size + td->hugepage_size - 1) & ~(td->hugepage_size - 1);
575 td->orig_buffer_size += page_mask;
577 if (allocate_io_mem(td))
580 p = ALIGN(td->orig_buffer);
581 for (i = 0; i < max_units; i++) {
582 io_u = malloc(sizeof(*io_u));
583 memset(io_u, 0, sizeof(*io_u));
584 INIT_LIST_HEAD(&io_u->list);
586 io_u->buf = p + max_bs * i;
587 if (td_write(td) || td_rw(td))
588 fill_rand_buf(io_u, max_bs);
591 io_u->flags = IO_U_F_FREE;
592 list_add(&io_u->list, &td->io_u_freelist);
600 static int switch_ioscheduler(struct thread_data *td)
602 char tmp[256], tmp2[128];
606 if (td->io_ops->flags & FIO_CPUIO)
609 sprintf(tmp, "%s/queue/scheduler", td->sysfs_root);
611 f = fopen(tmp, "r+");
613 td_verror(td, errno, "fopen");
620 ret = fwrite(td->ioscheduler, strlen(td->ioscheduler), 1, f);
621 if (ferror(f) || ret != 1) {
622 td_verror(td, errno, "fwrite");
630 * Read back and check that the selected scheduler is now the default.
632 ret = fread(tmp, 1, sizeof(tmp), f);
633 if (ferror(f) || ret < 0) {
634 td_verror(td, errno, "fread");
639 sprintf(tmp2, "[%s]", td->ioscheduler);
640 if (!strstr(tmp, tmp2)) {
641 log_err("fio: io scheduler %s not found\n", td->ioscheduler);
642 td_verror(td, EINVAL, "iosched_switch");
651 static void clear_io_state(struct thread_data *td)
656 td->ts.stat_io_bytes[0] = td->ts.stat_io_bytes[1] = 0;
657 td->this_io_bytes[0] = td->this_io_bytes[1] = 0;
660 td->last_was_sync = 0;
662 for_each_file(td, f, i) {
663 f->last_completed_pos = 0;
666 if (td->io_ops->flags & FIO_SYNCIO)
667 lseek(f->fd, SEEK_SET, 0);
670 memset(f->file_map, 0, f->num_maps * sizeof(long));
675 * Entry point for the thread based jobs. The process based jobs end up
676 * here as well, after a little setup.
678 static void *thread_main(void *data)
680 unsigned long long runtime[2];
681 struct thread_data *td = data;
688 INIT_LIST_HEAD(&td->io_u_freelist);
689 INIT_LIST_HEAD(&td->io_u_busylist);
690 INIT_LIST_HEAD(&td->io_u_requeues);
691 INIT_LIST_HEAD(&td->io_hist_list);
692 INIT_LIST_HEAD(&td->io_log_list);
697 if (fio_setaffinity(td) == -1) {
698 td_verror(td, errno, "cpu_set_affinity");
706 if (ioprio_set(IOPRIO_WHO_PROCESS, 0, td->ioprio) == -1) {
707 td_verror(td, errno, "ioprio_set");
712 if (nice(td->nice) == -1) {
713 td_verror(td, errno, "nice");
717 if (init_random_state(td))
720 if (td->ioscheduler && switch_ioscheduler(td))
723 td_set_runstate(td, TD_INITIALIZED);
724 fio_sem_up(&startup_sem);
725 fio_sem_down(&td->mutex);
727 if (!td->create_serialize && setup_files(td))
733 * Do this late, as some IO engines would like to have the
734 * files setup prior to initializing structures.
739 if (td->exec_prerun) {
740 if (system(td->exec_prerun) < 0)
744 fio_gettime(&td->epoch, NULL);
745 memcpy(&td->timeout_end, &td->epoch, sizeof(td->epoch));
746 getrusage(RUSAGE_SELF, &td->ts.ru_start);
748 runtime[0] = runtime[1] = 0;
749 while (td->loops--) {
750 fio_gettime(&td->start, NULL);
751 memcpy(&td->ts.stat_sample_time, &td->start, sizeof(td->start));
754 memcpy(&td->lastrate, &td->ts.stat_sample_time, sizeof(td->lastrate));
757 prune_io_piece_log(td);
759 if (td->io_ops->flags & FIO_CPUIO)
764 if (td_read(td) && td->io_bytes[DDIR_READ])
765 runtime[DDIR_READ] += utime_since_now(&td->start);
766 if (td_write(td) && td->io_bytes[DDIR_WRITE])
767 runtime[DDIR_WRITE] += utime_since_now(&td->start);
769 if (td->error || td->terminate)
772 if (td->verify == VERIFY_NONE)
776 fio_gettime(&td->start, NULL);
780 runtime[DDIR_READ] += utime_since_now(&td->start);
782 if (td->error || td->terminate)
786 update_rusage_stat(td);
787 fio_gettime(&td->end_time, NULL);
788 td->runtime[0] = runtime[0] / 1000;
789 td->runtime[1] = runtime[1] / 1000;
792 finish_log(td, td->ts.bw_log, "bw");
794 finish_log(td, td->ts.slat_log, "slat");
796 finish_log(td, td->ts.clat_log, "clat");
797 if (td->write_iolog_file)
798 write_iolog_close(td);
799 if (td->exec_postrun) {
800 if (system(td->exec_postrun) < 0)
801 log_err("fio: postrun %s failed\n", td->exec_postrun);
804 if (exitall_on_terminate)
805 terminate_threads(td->groupid, 0);
809 printf("fio: pid=%d, err=%d/%s\n", td->pid, td->error, td->verror);
813 td_set_runstate(td, TD_EXITED);
814 return (void *) (unsigned long) td->error;
818 * We cannot pass the td data into a forked process, so attach the td and
819 * pass it to the thread worker.
821 static int fork_main(int shmid, int offset)
823 struct thread_data *td;
826 data = shmat(shmid, NULL, 0);
827 if (data == (void *) -1) {
834 td = data + offset * sizeof(struct thread_data);
835 ret = thread_main(td);
837 return (int) (unsigned long) ret;
841 * Run over the job map and reap the threads that have exited, if any.
843 static void reap_threads(int *nr_running, int *t_rate, int *m_rate)
845 struct thread_data *td;
846 int i, cputhreads, pending, status, ret;
849 * reap exited threads (TD_EXITED -> TD_REAPED)
851 pending = cputhreads = 0;
856 * ->io_ops is NULL for a thread that has closed its
859 if (td->io_ops && td->io_ops->flags & FIO_CPUIO)
862 if (!td->pid || td->runstate == TD_REAPED)
864 if (td->use_thread) {
865 if (td->runstate == TD_EXITED) {
866 td_set_runstate(td, TD_REAPED);
873 if (td->runstate == TD_EXITED)
877 * check if someone quit or got killed in an unusual way
879 ret = waitpid(td->pid, &status, flags);
881 if (errno == ECHILD) {
882 log_err("fio: pid=%d disappeared %d\n", td->pid, td->runstate);
883 td_set_runstate(td, TD_REAPED);
887 } else if (ret == td->pid) {
888 if (WIFSIGNALED(status)) {
889 int sig = WTERMSIG(status);
891 log_err("fio: pid=%d, got signal=%d\n", td->pid, sig);
892 td_set_runstate(td, TD_REAPED);
895 if (WIFEXITED(status)) {
896 if (WEXITSTATUS(status) && !td->error)
897 td->error = WEXITSTATUS(status);
899 td_set_runstate(td, TD_REAPED);
905 * thread is not dead, continue
909 if (td->use_thread) {
912 if (pthread_join(td->thread, (void *) &ret))
913 perror("pthread_join");
917 (*m_rate) -= td->ratemin;
918 (*t_rate) -= td->rate;
924 if (*nr_running == cputhreads && !pending)
925 terminate_threads(TERMINATE_ALL, 0);
929 * Main function for kicking off and reaping jobs, as needed.
931 static void run_threads(void)
933 struct thread_data *td;
935 int i, todo, nr_running, m_rate, t_rate, nr_started;
937 if (fio_pin_memory())
941 printf("Starting %d thread%s\n", thread_number, thread_number > 1 ? "s" : "");
945 signal(SIGINT, sig_handler);
946 signal(SIGALRM, sig_handler);
948 todo = thread_number;
954 print_status_init(td->thread_number - 1);
956 if (!td->create_serialize) {
962 * do file setup here so it happens sequentially,
963 * we don't want X number of threads getting their
964 * client data interspersed on disk
966 if (setup_files(td)) {
969 log_err("fio: pid=%d, err=%d/%s\n", td->pid, td->error, td->verror);
970 td_set_runstate(td, TD_REAPED);
980 struct thread_data *map[MAX_JOBS];
981 struct timeval this_start;
982 int this_jobs = 0, left;
985 * create threads (TD_NOT_CREATED -> TD_CREATED)
988 if (td->runstate != TD_NOT_CREATED)
992 * never got a chance to start, killed by other
993 * thread for some reason
1000 if (td->start_delay) {
1001 spent = mtime_since_genesis();
1003 if (td->start_delay * 1000 > spent)
1007 if (td->stonewall && (nr_started || nr_running))
1011 * Set state to created. Thread will transition
1012 * to TD_INITIALIZED when it's done setting up.
1014 td_set_runstate(td, TD_CREATED);
1015 map[this_jobs++] = td;
1016 fio_sem_init(&startup_sem, 1);
1019 if (td->use_thread) {
1020 if (pthread_create(&td->thread, NULL, thread_main, td)) {
1021 perror("thread_create");
1026 fio_sem_down(&startup_sem);
1028 int ret = fork_main(shm_id, i);
1036 * Wait for the started threads to transition to
1039 fio_gettime(&this_start, NULL);
1041 while (left && !fio_abort) {
1042 if (mtime_since_now(&this_start) > JOB_START_TIMEOUT)
1047 for (i = 0; i < this_jobs; i++) {
1051 if (td->runstate == TD_INITIALIZED) {
1054 } else if (td->runstate >= TD_EXITED) {
1058 nr_running++; /* work-around... */
1064 log_err("fio: %d jobs failed to start\n", left);
1065 for (i = 0; i < this_jobs; i++) {
1069 kill(td->pid, SIGTERM);
1075 * start created threads (TD_INITIALIZED -> TD_RUNNING).
1077 for_each_td(td, i) {
1078 if (td->runstate != TD_INITIALIZED)
1081 td_set_runstate(td, TD_RUNNING);
1084 m_rate += td->ratemin;
1087 fio_sem_up(&td->mutex);
1090 reap_threads(&nr_running, &t_rate, &m_rate);
1096 while (nr_running) {
1097 reap_threads(&nr_running, &t_rate, &m_rate);
1105 int main(int argc, char *argv[])
1110 * We need locale for number printing, if it isn't set then just
1111 * go with the US format.
1113 if (!getenv("LC_NUMERIC"))
1114 setlocale(LC_NUMERIC, "en_US");
1116 if (parse_options(argc, argv))
1119 if (!thread_number) {
1120 log_err("Nothing to do\n");
1124 ps = sysconf(_SC_PAGESIZE);
1126 log_err("Failed to get page size\n");
1133 setup_log(&agg_io_log[DDIR_READ]);
1134 setup_log(&agg_io_log[DDIR_WRITE]);
1139 disk_util_timer_arm();
1146 __finish_log(agg_io_log[DDIR_READ],"agg-read_bw.log");
1147 __finish_log(agg_io_log[DDIR_WRITE],"agg-write_bw.log");