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)
104 * allow a 2 second settle period in the beginning
106 if (mtime_since(&td->start, now) < 2000)
110 * if rate blocks is set, sample is running
112 if (td->rate_bytes) {
113 spent = mtime_since(&td->lastrate, now);
114 if (spent < td->ratecycle)
117 rate = (td->this_io_bytes[ddir] - td->rate_bytes) / spent;
118 if (rate < td->ratemin) {
119 fprintf(f_out, "%s: min rate %u not met, got %luKiB/sec\n", td->name, td->ratemin, rate);
124 td->rate_bytes = td->this_io_bytes[ddir];
125 memcpy(&td->lastrate, now, sizeof(*now));
129 static inline int runtime_exceeded(struct thread_data *td, struct timeval *t)
133 if (mtime_since(&td->epoch, t) >= td->timeout * 1000)
140 * When job exits, we can cancel the in-flight IO if we are using async
141 * io. Attempt to do so.
143 static void cleanup_pending_aio(struct thread_data *td)
145 struct list_head *entry, *n;
150 * get immediately available events, if any
152 io_u_queued_complete(td, 0, NULL);
155 * now cancel remaining active events
157 if (td->io_ops->cancel) {
158 list_for_each_safe(entry, n, &td->io_u_busylist) {
159 io_u = list_entry(entry, struct io_u, list);
161 r = td->io_ops->cancel(td, io_u);
168 io_u_queued_complete(td, td->cur_depth, NULL);
172 * Helper to handle the final sync of a file. Works just like the normal
173 * io path, just does everything sync.
175 static int fio_io_sync(struct thread_data *td, struct fio_file *f)
177 struct io_u *io_u = __get_io_u(td);
183 io_u->ddir = DDIR_SYNC;
186 if (td_io_prep(td, io_u)) {
192 ret = td_io_queue(td, io_u);
194 td_verror(td, io_u->error);
197 } else if (ret == FIO_Q_QUEUED) {
198 if (io_u_queued_complete(td, 1, NULL))
200 } else if (ret == FIO_Q_COMPLETED) {
202 td_verror(td, io_u->error);
206 io_u_sync_complete(td, io_u, NULL);
207 } else if (ret == FIO_Q_BUSY) {
208 if (td_io_commit(td))
217 * The main verify engine. Runs over the writes we previusly submitted,
218 * reads the blocks back in, and checks the crc/md5 of the data.
220 static void do_verify(struct thread_data *td)
224 int ret, i, min_events;
227 * sync io first and invalidate cache, to make sure we really
230 for_each_file(td, f, i) {
232 file_invalidate_cache(td, f);
235 td_set_runstate(td, TD_VERIFYING);
238 while (!td->terminate) {
239 io_u = __get_io_u(td);
243 if (runtime_exceeded(td, &io_u->start_time))
246 if (get_next_verify(td, io_u))
249 if (td_io_prep(td, io_u))
253 ret = td_io_queue(td, io_u);
256 case FIO_Q_COMPLETED:
259 if (io_u->xfer_buflen != io_u->resid && io_u->resid) {
260 int bytes = io_u->xfer_buflen - io_u->resid;
262 io_u->xfer_buflen = io_u->resid;
263 io_u->xfer_buf += bytes;
266 ret = io_u_sync_complete(td, io_u, verify_io_u);
273 requeue_io_u(td, &io_u);
274 ret = td_io_commit(td);
282 if (ret < 0 || td->error)
286 * if we can queue more, do so. but check if there are
287 * completed io_u's first.
290 if (queue_full(td) || ret == FIO_Q_BUSY)
294 * Reap required number of io units, if any, and do the
295 * verification on them through the callback handler
297 if (io_u_queued_complete(td, min_events, verify_io_u))
305 cleanup_pending_aio(td);
307 td_set_runstate(td, TD_RUNNING);
311 * Not really an io thread, all it does is burn CPU cycles in the specified
314 static void do_cpuio(struct thread_data *td)
317 int split = 100 / td->cpuload;
320 while (!td->terminate) {
321 fio_gettime(&e, NULL);
323 if (runtime_exceeded(td, &e))
329 usec_sleep(td, 10000);
336 * Main IO worker function. It retrieves io_u's to process and queues
337 * and reaps them, checking for rate and errors along the way.
339 static void do_io(struct thread_data *td)
345 td_set_runstate(td, TD_RUNNING);
347 while ((td->this_io_bytes[0] + td->this_io_bytes[1]) < td->io_size) {
348 struct timeval comp_time;
360 memcpy(&s, &io_u->start_time, sizeof(s));
362 if (runtime_exceeded(td, &s)) {
367 ret = td_io_queue(td, io_u);
370 case FIO_Q_COMPLETED:
375 if (io_u->xfer_buflen != io_u->resid && io_u->resid) {
376 int bytes = io_u->xfer_buflen - io_u->resid;
378 io_u->xfer_buflen = io_u->resid;
379 io_u->xfer_buf += bytes;
382 fio_gettime(&comp_time, NULL);
383 bytes_done = io_u_sync_complete(td, io_u, NULL);
390 requeue_io_u(td, &io_u);
391 ret = td_io_commit(td);
399 if (ret < 0 || td->error)
403 add_slat_sample(td, io_u->ddir, mtime_since(&io_u->start_time, &io_u->issue_time));
406 * See if we need to complete some commands
408 if (ret == FIO_Q_QUEUED || ret == FIO_Q_BUSY) {
410 if (queue_full(td) || ret == FIO_Q_BUSY)
413 fio_gettime(&comp_time, NULL);
414 bytes_done = io_u_queued_complete(td, min_evts, NULL);
423 * the rate is batched for now, it should work for batches
424 * of completions except the very first one which may look
427 usec = utime_since(&s, &comp_time);
429 rate_throttle(td, usec, bytes_done, td->ddir);
431 if (check_min_rate(td, &comp_time)) {
432 if (exitall_on_terminate)
433 terminate_threads(td->groupid, 0);
434 td_verror(td, ENODATA);
439 unsigned long long b;
441 b = td->io_blocks[0] + td->io_blocks[1];
442 if (!(b % td->thinktime_blocks)) {
445 if (td->thinktime_spin)
446 __usec_sleep(td->thinktime_spin);
448 left = td->thinktime - td->thinktime_spin;
450 usec_sleep(td, left);
459 cleanup_pending_aio(td);
461 if (should_fsync(td) && td->end_fsync) {
462 td_set_runstate(td, TD_FSYNCING);
463 for_each_file(td, f, i)
469 static void cleanup_io_u(struct thread_data *td)
471 struct list_head *entry, *n;
474 list_for_each_safe(entry, n, &td->io_u_freelist) {
475 io_u = list_entry(entry, struct io_u, list);
477 list_del(&io_u->list);
485 * "randomly" fill the buffer contents
487 static void fill_rand_buf(struct io_u *io_u, int max_bs)
489 int *ptr = io_u->buf;
491 while ((void *) ptr - io_u->buf < max_bs) {
492 *ptr = rand() * 0x9e370001;
497 static int init_io_u(struct thread_data *td)
504 if (td->io_ops->flags & FIO_CPUIO)
507 if (td->io_ops->flags & FIO_SYNCIO)
510 max_units = td->iodepth;
512 max_bs = max(td->max_bs[DDIR_READ], td->max_bs[DDIR_WRITE]);
513 td->orig_buffer_size = max_bs * max_units;
515 if (td->mem_type == MEM_SHMHUGE || td->mem_type == MEM_MMAPHUGE)
516 td->orig_buffer_size = (td->orig_buffer_size + td->hugepage_size - 1) & ~(td->hugepage_size - 1);
518 td->orig_buffer_size += page_mask;
520 if (allocate_io_mem(td))
523 p = ALIGN(td->orig_buffer);
524 for (i = 0; i < max_units; i++) {
525 io_u = malloc(sizeof(*io_u));
526 memset(io_u, 0, sizeof(*io_u));
527 INIT_LIST_HEAD(&io_u->list);
529 io_u->buf = p + max_bs * i;
530 if (td_write(td) || td_rw(td))
531 fill_rand_buf(io_u, max_bs);
534 list_add(&io_u->list, &td->io_u_freelist);
540 static int switch_ioscheduler(struct thread_data *td)
542 char tmp[256], tmp2[128];
546 if (td->io_ops->flags & FIO_CPUIO)
549 sprintf(tmp, "%s/queue/scheduler", td->sysfs_root);
551 f = fopen(tmp, "r+");
553 td_verror(td, errno);
560 ret = fwrite(td->ioscheduler, strlen(td->ioscheduler), 1, f);
561 if (ferror(f) || ret != 1) {
562 td_verror(td, errno);
570 * Read back and check that the selected scheduler is now the default.
572 ret = fread(tmp, 1, sizeof(tmp), f);
573 if (ferror(f) || ret < 0) {
574 td_verror(td, errno);
579 sprintf(tmp2, "[%s]", td->ioscheduler);
580 if (!strstr(tmp, tmp2)) {
581 log_err("fio: io scheduler %s not found\n", td->ioscheduler);
582 td_verror(td, EINVAL);
591 static void clear_io_state(struct thread_data *td)
596 td->stat_io_bytes[0] = td->stat_io_bytes[1] = 0;
597 td->this_io_bytes[0] = td->this_io_bytes[1] = 0;
600 td->last_was_sync = 0;
602 for_each_file(td, f, i) {
603 f->last_completed_pos = 0;
606 if (td->io_ops->flags & FIO_SYNCIO)
607 lseek(f->fd, SEEK_SET, 0);
610 memset(f->file_map, 0, f->num_maps * sizeof(long));
615 * Entry point for the thread based jobs. The process based jobs end up
616 * here as well, after a little setup.
618 static void *thread_main(void *data)
620 unsigned long long runtime[2];
621 struct thread_data *td = data;
628 INIT_LIST_HEAD(&td->io_u_freelist);
629 INIT_LIST_HEAD(&td->io_u_busylist);
630 INIT_LIST_HEAD(&td->io_u_requeues);
631 INIT_LIST_HEAD(&td->io_hist_list);
632 INIT_LIST_HEAD(&td->io_log_list);
637 if (fio_setaffinity(td) == -1) {
638 td_verror(td, errno);
646 if (ioprio_set(IOPRIO_WHO_PROCESS, 0, td->ioprio) == -1) {
647 td_verror(td, errno);
652 if (nice(td->nice) == -1) {
653 td_verror(td, errno);
657 if (init_random_state(td))
660 if (td->ioscheduler && switch_ioscheduler(td))
663 td_set_runstate(td, TD_INITIALIZED);
664 fio_sem_up(&startup_sem);
665 fio_sem_down(&td->mutex);
667 if (!td->create_serialize && setup_files(td))
673 * Do this late, as some IO engines would like to have the
674 * files setup prior to initializing structures.
679 if (td->exec_prerun) {
680 if (system(td->exec_prerun) < 0)
684 fio_gettime(&td->epoch, NULL);
685 getrusage(RUSAGE_SELF, &td->ru_start);
687 runtime[0] = runtime[1] = 0;
688 while (td->loops--) {
689 fio_gettime(&td->start, NULL);
690 memcpy(&td->stat_sample_time, &td->start, sizeof(td->start));
693 memcpy(&td->lastrate, &td->stat_sample_time, sizeof(td->lastrate));
696 prune_io_piece_log(td);
698 if (td->io_ops->flags & FIO_CPUIO)
703 runtime[td->ddir] += utime_since_now(&td->start);
704 if (td_rw(td) && td->io_bytes[td->ddir ^ 1])
705 runtime[td->ddir ^ 1] = runtime[td->ddir];
707 if (td->error || td->terminate)
710 if (td->verify == VERIFY_NONE)
714 fio_gettime(&td->start, NULL);
718 runtime[DDIR_READ] += utime_since_now(&td->start);
720 if (td->error || td->terminate)
724 update_rusage_stat(td);
725 fio_gettime(&td->end_time, NULL);
726 td->runtime[0] = runtime[0] / 1000;
727 td->runtime[1] = runtime[1] / 1000;
730 finish_log(td, td->bw_log, "bw");
732 finish_log(td, td->slat_log, "slat");
734 finish_log(td, td->clat_log, "clat");
735 if (td->write_iolog_file)
736 write_iolog_close(td);
737 if (td->exec_postrun) {
738 if (system(td->exec_postrun) < 0)
739 log_err("fio: postrun %s failed\n", td->exec_postrun);
742 if (exitall_on_terminate)
743 terminate_threads(td->groupid, 0);
747 printf("fio: pid=%d, err=%d/%s\n", td->pid, td->error, td->verror);
751 td_set_runstate(td, TD_EXITED);
752 return (void *) td->error;
756 * We cannot pass the td data into a forked process, so attach the td and
757 * pass it to the thread worker.
759 static int fork_main(int shmid, int offset)
761 struct thread_data *td;
764 data = shmat(shmid, NULL, 0);
765 if (data == (void *) -1) {
772 td = data + offset * sizeof(struct thread_data);
773 ret = thread_main(td);
779 * Run over the job map and reap the threads that have exited, if any.
781 static void reap_threads(int *nr_running, int *t_rate, int *m_rate)
783 struct thread_data *td;
784 int i, cputhreads, pending, status, ret;
787 * reap exited threads (TD_EXITED -> TD_REAPED)
789 pending = cputhreads = 0;
792 * ->io_ops is NULL for a thread that has closed its
795 if (td->io_ops && td->io_ops->flags & FIO_CPUIO)
798 if (td->runstate < TD_EXITED) {
800 * check if someone quit or got killed in an unusual way
802 ret = waitpid(td->pid, &status, WNOHANG);
805 else if ((ret == td->pid) && WIFSIGNALED(status)) {
806 int sig = WTERMSIG(status);
808 log_err("fio: pid=%d, got signal=%d\n", td->pid, sig);
809 td_set_runstate(td, TD_REAPED);
814 if (td->runstate != TD_EXITED) {
815 if (td->runstate < TD_RUNNING)
824 td_set_runstate(td, TD_REAPED);
826 if (td->use_thread) {
829 if (pthread_join(td->thread, (void *) &ret))
830 perror("thread_join");
834 ret = waitpid(td->pid, &status, 0);
837 else if (WIFEXITED(status) && WEXITSTATUS(status)) {
845 (*m_rate) -= td->ratemin;
846 (*t_rate) -= td->rate;
849 if (*nr_running == cputhreads && !pending)
850 terminate_threads(TERMINATE_ALL, 0);
854 * Main function for kicking off and reaping jobs, as needed.
856 static void run_threads(void)
858 struct thread_data *td;
860 int i, todo, nr_running, m_rate, t_rate, nr_started;
862 if (fio_pin_memory())
866 printf("Starting %d thread%s\n", thread_number, thread_number > 1 ? "s" : "");
870 signal(SIGINT, sig_handler);
871 signal(SIGALRM, sig_handler);
873 todo = thread_number;
879 print_status_init(td->thread_number - 1);
881 if (!td->create_serialize) {
887 * do file setup here so it happens sequentially,
888 * we don't want X number of threads getting their
889 * client data interspersed on disk
891 if (setup_files(td)) {
894 log_err("fio: pid=%d, err=%d/%s\n", td->pid, td->error, td->verror);
895 td_set_runstate(td, TD_REAPED);
903 struct thread_data *map[MAX_JOBS];
904 struct timeval this_start;
905 int this_jobs = 0, left;
908 * create threads (TD_NOT_CREATED -> TD_CREATED)
911 if (td->runstate != TD_NOT_CREATED)
915 * never got a chance to start, killed by other
916 * thread for some reason
923 if (td->start_delay) {
924 spent = mtime_since_genesis();
926 if (td->start_delay * 1000 > spent)
930 if (td->stonewall && (nr_started || nr_running))
934 * Set state to created. Thread will transition
935 * to TD_INITIALIZED when it's done setting up.
937 td_set_runstate(td, TD_CREATED);
938 map[this_jobs++] = td;
939 fio_sem_init(&startup_sem, 1);
942 if (td->use_thread) {
943 if (pthread_create(&td->thread, NULL, thread_main, td)) {
944 perror("thread_create");
949 fio_sem_down(&startup_sem);
951 int ret = fork_main(shm_id, i);
959 * Wait for the started threads to transition to
962 fio_gettime(&this_start, NULL);
964 while (left && !fio_abort) {
965 if (mtime_since_now(&this_start) > JOB_START_TIMEOUT)
970 for (i = 0; i < this_jobs; i++) {
974 if (td->runstate == TD_INITIALIZED) {
977 } else if (td->runstate >= TD_EXITED) {
981 nr_running++; /* work-around... */
987 log_err("fio: %d jobs failed to start\n", left);
988 for (i = 0; i < this_jobs; i++) {
992 kill(td->pid, SIGTERM);
998 * start created threads (TD_INITIALIZED -> TD_RUNNING).
1000 for_each_td(td, i) {
1001 if (td->runstate != TD_INITIALIZED)
1004 td_set_runstate(td, TD_RUNNING);
1007 m_rate += td->ratemin;
1010 fio_sem_up(&td->mutex);
1013 reap_threads(&nr_running, &t_rate, &m_rate);
1019 while (nr_running) {
1020 reap_threads(&nr_running, &t_rate, &m_rate);
1028 int main(int argc, char *argv[])
1033 * We need locale for number printing, if it isn't set then just
1034 * go with the US format.
1036 if (!getenv("LC_NUMERIC"))
1037 setlocale(LC_NUMERIC, "en_US");
1039 if (parse_options(argc, argv))
1042 if (!thread_number) {
1043 log_err("Nothing to do\n");
1047 ps = sysconf(_SC_PAGESIZE);
1049 log_err("Failed to get page size\n");
1056 setup_log(&agg_io_log[DDIR_READ]);
1057 setup_log(&agg_io_log[DDIR_WRITE]);
1060 disk_util_timer_arm();
1067 __finish_log(agg_io_log[DDIR_READ],"agg-read_bw.log");
1068 __finish_log(agg_io_log[DDIR_WRITE],"agg-write_bw.log");