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
34 #include <sys/ioctl.h>
42 #define ALIGN(buf) (char *) (((unsigned long) (buf) + MASK) & ~(MASK))
45 int thread_number = 0;
49 static volatile int startup_sem;
51 #define TERMINATE_ALL (-1)
52 #define JOB_START_TIMEOUT (5 * 1000)
54 static void terminate_threads(int group_id)
56 struct thread_data *td;
60 if (group_id == TERMINATE_ALL || groupid == td->groupid) {
67 static void sig_handler(int sig)
72 disk_util_timer_arm();
73 print_thread_status();
76 printf("\nfio: terminating on signal\n");
78 terminate_threads(TERMINATE_ALL);
84 * Check if we are above the minimum rate given.
86 static int check_min_rate(struct thread_data *td, struct timeval *now)
93 * allow a 2 second settle period in the beginning
95 if (mtime_since(&td->start, now) < 2000)
99 * if rate blocks is set, sample is running
101 if (td->rate_bytes) {
102 spent = mtime_since(&td->lastrate, now);
103 if (spent < td->ratecycle)
106 rate = (td->this_io_bytes[ddir] - td->rate_bytes) / spent;
107 if (rate < td->ratemin) {
108 fprintf(f_out, "%s: min rate %d not met, got %ldKiB/sec\n", td->name, td->ratemin, rate);
113 td->rate_bytes = td->this_io_bytes[ddir];
114 memcpy(&td->lastrate, now, sizeof(*now));
118 static inline int runtime_exceeded(struct thread_data *td, struct timeval *t)
122 if (mtime_since(&td->epoch, t) >= td->timeout * 1000)
128 static inline void td_set_runstate(struct thread_data *td, int runstate)
130 td->runstate = runstate;
133 static struct fio_file *get_next_file(struct thread_data *td)
135 unsigned int old_next_file = td->next_file;
139 f = &td->files[td->next_file];
142 if (td->next_file >= td->nr_files)
149 } while (td->next_file != old_next_file);
155 * When job exits, we can cancel the in-flight IO if we are using async
156 * io. Attempt to do so.
158 static void cleanup_pending_aio(struct thread_data *td)
160 struct timespec ts = { .tv_sec = 0, .tv_nsec = 0};
161 struct list_head *entry, *n;
162 struct io_completion_data icd;
167 * get immediately available events, if any
169 r = td_io_getevents(td, 0, td->cur_depth, &ts);
172 ios_completed(td, &icd);
176 * now cancel remaining active events
178 if (td->io_ops->cancel) {
179 list_for_each_safe(entry, n, &td->io_u_busylist) {
180 io_u = list_entry(entry, struct io_u, list);
182 r = td->io_ops->cancel(td, io_u);
189 r = td_io_getevents(td, td->cur_depth, td->cur_depth, NULL);
192 ios_completed(td, &icd);
198 * Helper to handle the final sync of a file. Works just like the normal
199 * io path, just does everything sync.
201 static int fio_io_sync(struct thread_data *td, struct fio_file *f)
203 struct io_u *io_u = __get_io_u(td);
204 struct io_completion_data icd;
210 io_u->ddir = DDIR_SYNC;
213 if (td_io_prep(td, io_u)) {
218 ret = td_io_queue(td, io_u);
220 td_verror(td, io_u->error);
225 ret = td_io_getevents(td, 1, td->cur_depth, NULL);
232 ios_completed(td, &icd);
234 td_verror(td, icd.error);
242 * The main verify engine. Runs over the writes we previusly submitted,
243 * reads the blocks back in, and checks the crc/md5 of the data.
245 void do_verify(struct thread_data *td)
247 struct io_u *io_u, *v_io_u = NULL;
248 struct io_completion_data icd;
253 * sync io first and invalidate cache, to make sure we really
256 for_each_file(td, f, i) {
258 file_invalidate_cache(td, f);
261 td_set_runstate(td, TD_VERIFYING);
267 io_u = __get_io_u(td);
271 if (runtime_exceeded(td, &io_u->start_time)) {
276 if (get_next_verify(td, io_u)) {
281 f = get_next_file(td);
287 if (td_io_prep(td, io_u)) {
292 ret = td_io_queue(td, io_u);
294 td_verror(td, io_u->error);
300 * we have one pending to verify, do that while
301 * we are doing io on the next one
303 if (do_io_u_verify(td, &v_io_u))
306 ret = td_io_getevents(td, 1, 1, NULL);
313 v_io_u = td->io_ops->event(td, 0);
316 fio_gettime(&icd.time, NULL);
317 io_completed(td, v_io_u, &icd);
320 td_verror(td, icd.error);
321 put_io_u(td, v_io_u);
327 * if we can't submit more io, we need to verify now
329 if (queue_full(td) && do_io_u_verify(td, &v_io_u))
334 do_io_u_verify(td, &v_io_u);
337 cleanup_pending_aio(td);
339 td_set_runstate(td, TD_RUNNING);
343 * Not really an io thread, all it does is burn CPU cycles in the specified
346 static void do_cpuio(struct thread_data *td)
349 int split = 100 / td->cpuload;
352 while (!td->terminate) {
353 fio_gettime(&e, NULL);
355 if (runtime_exceeded(td, &e))
361 usec_sleep(td, 10000);
368 * Main IO worker function. It retrieves io_u's to process and queues
369 * and reaps them, checking for rate and errors along the way.
371 static void do_io(struct thread_data *td)
373 struct io_completion_data icd;
379 td_set_runstate(td, TD_RUNNING);
381 while (td->this_io_bytes[td->ddir] < td->io_size) {
382 struct timespec ts = { .tv_sec = 0, .tv_nsec = 0};
383 struct timespec *timeout;
390 f = get_next_file(td);
394 io_u = get_io_u(td, f);
398 memcpy(&s, &io_u->start_time, sizeof(s));
400 ret = td_io_queue(td, io_u);
402 td_verror(td, io_u->error);
407 add_slat_sample(td, io_u->ddir, mtime_since(&io_u->start_time, &io_u->issue_time));
409 if (td->cur_depth < td->iodepth) {
417 ret = td_io_getevents(td, min_evts, td->cur_depth, timeout);
425 ios_completed(td, &icd);
427 td_verror(td, icd.error);
432 * the rate is batched for now, it should work for batches
433 * of completions except the very first one which may look
436 usec = utime_since(&s, &icd.time);
438 rate_throttle(td, usec, icd.bytes_done[td->ddir], td->ddir);
440 if (check_min_rate(td, &icd.time)) {
441 if (exitall_on_terminate)
442 terminate_threads(td->groupid);
443 td_verror(td, ENOMEM);
447 if (runtime_exceeded(td, &icd.time))
451 usec_sleep(td, td->thinktime);
456 cleanup_pending_aio(td);
458 if (should_fsync(td) && td->end_fsync) {
459 td_set_runstate(td, TD_FSYNCING);
460 for_each_file(td, f, i)
466 static void cleanup_io_u(struct thread_data *td)
468 struct list_head *entry, *n;
471 list_for_each_safe(entry, n, &td->io_u_freelist) {
472 io_u = list_entry(entry, struct io_u, list);
474 list_del(&io_u->list);
482 * "randomly" fill the buffer contents
484 static void fill_rand_buf(struct io_u *io_u, int max_bs)
486 int *ptr = io_u->buf;
488 while ((void *) ptr - io_u->buf < max_bs) {
489 *ptr = rand() * 0x9e370001;
494 static int init_io_u(struct thread_data *td)
501 if (td->io_ops->flags & FIO_CPUIO)
504 if (td->io_ops->flags & FIO_SYNCIO)
507 max_units = td->iodepth;
509 max_bs = max(td->max_bs[DDIR_READ], td->max_bs[DDIR_WRITE]);
510 td->orig_buffer_size = max_bs * max_units + MASK;
512 if (allocate_io_mem(td))
515 p = ALIGN(td->orig_buffer);
516 for (i = 0; i < max_units; i++) {
517 io_u = malloc(sizeof(*io_u));
518 memset(io_u, 0, sizeof(*io_u));
519 INIT_LIST_HEAD(&io_u->list);
521 io_u->buf = p + max_bs * i;
522 if (td_write(td) || td_rw(td))
523 fill_rand_buf(io_u, max_bs);
526 list_add(&io_u->list, &td->io_u_freelist);
532 static int switch_ioscheduler(struct thread_data *td)
534 char tmp[256], tmp2[128];
538 if (td->io_ops->flags & FIO_CPUIO)
541 sprintf(tmp, "%s/queue/scheduler", td->sysfs_root);
543 f = fopen(tmp, "r+");
545 td_verror(td, errno);
552 ret = fwrite(td->ioscheduler, strlen(td->ioscheduler), 1, f);
553 if (ferror(f) || ret != 1) {
554 td_verror(td, errno);
562 * Read back and check that the selected scheduler is now the default.
564 ret = fread(tmp, 1, sizeof(tmp), f);
565 if (ferror(f) || ret < 0) {
566 td_verror(td, errno);
571 sprintf(tmp2, "[%s]", td->ioscheduler);
572 if (!strstr(tmp, tmp2)) {
573 log_err("fio: io scheduler %s not found\n", td->ioscheduler);
574 td_verror(td, EINVAL);
583 static void clear_io_state(struct thread_data *td)
588 td->stat_io_bytes[0] = td->stat_io_bytes[1] = 0;
589 td->this_io_bytes[0] = td->this_io_bytes[1] = 0;
592 for_each_file(td, f, i) {
594 if (td->io_ops->flags & FIO_SYNCIO)
595 lseek(f->fd, SEEK_SET, 0);
598 memset(f->file_map, 0, f->num_maps * sizeof(long));
603 * Entry point for the thread based jobs. The process based jobs end up
604 * here as well, after a little setup.
606 static void *thread_main(void *data)
608 struct thread_data *td = data;
615 INIT_LIST_HEAD(&td->io_u_freelist);
616 INIT_LIST_HEAD(&td->io_u_busylist);
617 INIT_LIST_HEAD(&td->io_hist_list);
618 INIT_LIST_HEAD(&td->io_log_list);
623 if (fio_setaffinity(td) == -1) {
624 td_verror(td, errno);
635 if (ioprio_set(IOPRIO_WHO_PROCESS, 0, td->ioprio) == -1) {
636 td_verror(td, errno);
641 if (nice(td->nice) == -1) {
642 td_verror(td, errno);
646 if (init_random_state(td))
649 if (td->ioscheduler && switch_ioscheduler(td))
652 td_set_runstate(td, TD_INITIALIZED);
653 fio_sem_up(&startup_sem);
654 fio_sem_down(&td->mutex);
656 if (!td->create_serialize && setup_files(td))
661 fio_gettime(&td->epoch, NULL);
664 system(td->exec_prerun);
666 while (td->loops--) {
667 getrusage(RUSAGE_SELF, &td->ru_start);
668 fio_gettime(&td->start, NULL);
669 memcpy(&td->stat_sample_time, &td->start, sizeof(td->start));
672 memcpy(&td->lastrate, &td->stat_sample_time, sizeof(td->lastrate));
675 prune_io_piece_log(td);
677 if (td->io_ops->flags & FIO_CPUIO)
682 td->runtime[td->ddir] += mtime_since_now(&td->start);
683 if (td_rw(td) && td->io_bytes[td->ddir ^ 1])
684 td->runtime[td->ddir ^ 1] = td->runtime[td->ddir];
686 update_rusage_stat(td);
688 if (td->error || td->terminate)
691 if (td->verify == VERIFY_NONE)
695 fio_gettime(&td->start, NULL);
699 td->runtime[DDIR_READ] += mtime_since_now(&td->start);
701 if (td->error || td->terminate)
706 finish_log(td, td->bw_log, "bw");
708 finish_log(td, td->slat_log, "slat");
710 finish_log(td, td->clat_log, "clat");
711 if (td->write_iolog_file)
712 write_iolog_close(td);
713 if (td->exec_postrun)
714 system(td->exec_postrun);
716 if (exitall_on_terminate)
717 terminate_threads(td->groupid);
723 td_set_runstate(td, TD_EXITED);
729 * We cannot pass the td data into a forked process, so attach the td and
730 * pass it to the thread worker.
732 static void *fork_main(int shmid, int offset)
734 struct thread_data *td;
737 data = shmat(shmid, NULL, 0);
738 if (data == (void *) -1) {
743 td = data + offset * sizeof(struct thread_data);
750 * Run over the job map and reap the threads that have exited, if any.
752 static void reap_threads(int *nr_running, int *t_rate, int *m_rate)
754 struct thread_data *td;
755 int i, cputhreads, pending;
758 * reap exited threads (TD_EXITED -> TD_REAPED)
760 pending = cputhreads = 0;
763 * ->io_ops is NULL for a thread that has closed its
766 if (td->io_ops && td->io_ops->flags & FIO_CPUIO)
769 if (td->runstate != TD_EXITED) {
770 if (td->runstate < TD_RUNNING)
776 td_set_runstate(td, TD_REAPED);
778 if (td->use_thread) {
781 if (pthread_join(td->thread, (void *) &ret))
782 perror("thread_join");
784 waitpid(td->pid, NULL, 0);
787 (*m_rate) -= td->ratemin;
788 (*t_rate) -= td->rate;
791 if (*nr_running == cputhreads && !pending)
792 terminate_threads(TERMINATE_ALL);
796 * Main function for kicking off and reaping jobs, as needed.
798 static void run_threads(void)
800 struct thread_data *td;
802 int i, todo, nr_running, m_rate, t_rate, nr_started;
804 if (fio_pin_memory())
808 printf("Starting %d thread%s\n", thread_number, thread_number > 1 ? "s" : "");
812 signal(SIGINT, sig_handler);
813 signal(SIGALRM, sig_handler);
815 todo = thread_number;
821 print_status_init(td->thread_number - 1);
825 if (!td->create_serialize)
829 * do file setup here so it happens sequentially,
830 * we don't want X number of threads getting their
831 * client data interspersed on disk
833 if (setup_files(td)) {
834 td_set_runstate(td, TD_REAPED);
840 struct thread_data *map[MAX_JOBS];
841 struct timeval this_start;
842 int this_jobs = 0, left;
845 * create threads (TD_NOT_CREATED -> TD_CREATED)
848 if (td->runstate != TD_NOT_CREATED)
852 * never got a chance to start, killed by other
853 * thread for some reason
860 if (td->start_delay) {
861 spent = mtime_since_genesis();
863 if (td->start_delay * 1000 > spent)
867 if (td->stonewall && (nr_started || nr_running))
871 * Set state to created. Thread will transition
872 * to TD_INITIALIZED when it's done setting up.
874 td_set_runstate(td, TD_CREATED);
875 map[this_jobs++] = td;
876 fio_sem_init(&startup_sem, 1);
879 if (td->use_thread) {
880 if (pthread_create(&td->thread, NULL, thread_main, td)) {
881 perror("thread_create");
886 fio_sem_down(&startup_sem);
888 fork_main(shm_id, i);
895 * Wait for the started threads to transition to
898 fio_gettime(&this_start, NULL);
901 if (mtime_since_now(&this_start) > JOB_START_TIMEOUT)
906 for (i = 0; i < this_jobs; i++) {
910 if (td->runstate == TD_INITIALIZED) {
913 } else if (td->runstate >= TD_EXITED) {
917 nr_running++; /* work-around... */
923 log_err("fio: %d jobs failed to start\n", left);
924 for (i = 0; i < this_jobs; i++) {
928 kill(td->pid, SIGTERM);
934 * start created threads (TD_INITIALIZED -> TD_RUNNING).
937 if (td->runstate != TD_INITIALIZED)
940 td_set_runstate(td, TD_RUNNING);
943 m_rate += td->ratemin;
946 fio_sem_up(&td->mutex);
949 reap_threads(&nr_running, &t_rate, &m_rate);
956 reap_threads(&nr_running, &t_rate, &m_rate);
964 int main(int argc, char *argv[])
966 if (parse_options(argc, argv))
969 if (!thread_number) {
970 log_err("Nothing to do\n");
974 disk_util_timer_arm();