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_sem *startup_sem;
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 td->runstate = runstate;
66 static void terminate_threads(int group_id)
68 struct thread_data *td;
72 if (group_id == TERMINATE_ALL || groupid == td->groupid) {
74 * if the thread is running, just let it exit
76 if (td->runstate < TD_RUNNING)
77 kill(td->pid, SIGQUIT);
79 td->o.start_delay = 0;
84 static void sig_handler(int sig)
89 disk_util_timer_arm();
90 print_thread_status();
93 printf("\nfio: terminating on signal %d\n", sig);
95 terminate_threads(TERMINATE_ALL);
101 * Check if we are above the minimum rate given.
103 static int check_min_rate(struct thread_data *td, struct timeval *now)
105 unsigned long long bytes = 0;
106 unsigned long iops = 0;
111 * No minimum rate set, always ok
113 if (!td->o.ratemin && !td->o.rate_iops_min)
117 * allow a 2 second settle period in the beginning
119 if (mtime_since(&td->start, now) < 2000)
123 iops += td->io_blocks[DDIR_READ];
124 bytes += td->this_io_bytes[DDIR_READ];
127 iops += td->io_blocks[DDIR_WRITE];
128 bytes += td->this_io_bytes[DDIR_WRITE];
132 * if rate blocks is set, sample is running
134 if (td->rate_bytes || td->rate_blocks) {
135 spent = mtime_since(&td->lastrate, now);
136 if (spent < td->o.ratecycle)
141 * check bandwidth specified rate
143 if (bytes < td->rate_bytes) {
144 log_err("%s: min rate %u not met\n", td->o.name, td->o.ratemin);
147 rate = (bytes - td->rate_bytes) / spent;
148 if (rate < td->o.ratemin || bytes < td->rate_bytes) {
149 log_err("%s: min rate %u not met, got %luKiB/sec\n", td->o.name, td->o.ratemin, rate);
155 * checks iops specified rate
157 if (iops < td->o.rate_iops) {
158 log_err("%s: min iops rate %u not met\n", td->o.name, td->o.rate_iops);
161 rate = (iops - td->rate_blocks) / spent;
162 if (rate < td->o.rate_iops_min || iops < td->rate_blocks) {
163 log_err("%s: min iops rate %u not met, got %lu\n", td->o.name, td->o.rate_iops_min, rate);
169 td->rate_bytes = bytes;
170 td->rate_blocks = iops;
171 memcpy(&td->lastrate, now, sizeof(*now));
175 static inline int runtime_exceeded(struct thread_data *td, struct timeval *t)
179 if (mtime_since(&td->epoch, t) >= td->o.timeout * 1000)
186 * When job exits, we can cancel the in-flight IO if we are using async
187 * io. Attempt to do so.
189 static void cleanup_pending_aio(struct thread_data *td)
191 struct list_head *entry, *n;
196 * get immediately available events, if any
198 r = io_u_queued_complete(td, 0);
203 * now cancel remaining active events
205 if (td->io_ops->cancel) {
206 list_for_each_safe(entry, n, &td->io_u_busylist) {
207 io_u = list_entry(entry, struct io_u, list);
210 * if the io_u isn't in flight, then that generally
211 * means someone leaked an io_u. complain but fix
212 * it up, so we don't stall here.
214 if ((io_u->flags & IO_U_F_FLIGHT) == 0) {
215 log_err("fio: non-busy IO on busy list\n");
218 r = td->io_ops->cancel(td, io_u);
226 r = io_u_queued_complete(td, td->cur_depth);
230 * Helper to handle the final sync of a file. Works just like the normal
231 * io path, just does everything sync.
233 static int fio_io_sync(struct thread_data *td, struct fio_file *f)
235 struct io_u *io_u = __get_io_u(td);
241 io_u->ddir = DDIR_SYNC;
244 if (td_io_prep(td, io_u)) {
250 ret = td_io_queue(td, io_u);
252 td_verror(td, io_u->error, "td_io_queue");
255 } else if (ret == FIO_Q_QUEUED) {
256 if (io_u_queued_complete(td, 1) < 0)
258 } else if (ret == FIO_Q_COMPLETED) {
260 td_verror(td, io_u->error, "td_io_queue");
264 if (io_u_sync_complete(td, io_u) < 0)
266 } else if (ret == FIO_Q_BUSY) {
267 if (td_io_commit(td))
276 * The main verify engine. Runs over the writes we previously submitted,
277 * reads the blocks back in, and checks the crc/md5 of the data.
279 static void do_verify(struct thread_data *td)
287 * sync io first and invalidate cache, to make sure we really
290 for_each_file(td, f, i) {
291 if (!(f->flags & FIO_FILE_OPEN))
293 if (fio_io_sync(td, f))
295 if (file_invalidate_cache(td, f))
302 td_set_runstate(td, TD_VERIFYING);
305 while (!td->terminate) {
308 io_u = __get_io_u(td);
312 if (runtime_exceeded(td, &io_u->start_time)) {
318 if (get_next_verify(td, io_u)) {
323 if (td_io_prep(td, io_u)) {
328 io_u->end_io = verify_io_u;
330 ret = td_io_queue(td, io_u);
332 case FIO_Q_COMPLETED:
335 else if (io_u->resid) {
336 int bytes = io_u->xfer_buflen - io_u->resid;
337 struct fio_file *f = io_u->file;
343 td_verror(td, ENODATA, "full resid");
348 io_u->xfer_buflen = io_u->resid;
349 io_u->xfer_buf += bytes;
350 io_u->offset += bytes;
351 f->last_completed_pos = io_u->offset;
353 td->ts.short_io_u[io_u->ddir]++;
355 if (io_u->offset == f->real_file_size)
358 requeue_io_u(td, &io_u);
361 ret = io_u_sync_complete(td, io_u);
369 requeue_io_u(td, &io_u);
370 ret2 = td_io_commit(td);
376 td_verror(td, -ret, "td_io_queue");
380 if (ret < 0 || td->error)
384 * if we can queue more, do so. but check if there are
385 * completed io_u's first.
388 if (queue_full(td) || ret == FIO_Q_BUSY) {
391 if (td->cur_depth > td->o.iodepth_low)
392 min_events = td->cur_depth - td->o.iodepth_low;
396 * Reap required number of io units, if any, and do the
397 * verification on them through the callback handler
399 if (io_u_queued_complete(td, min_events) < 0)
404 min_events = td->cur_depth;
407 ret = io_u_queued_complete(td, min_events);
409 cleanup_pending_aio(td);
411 td_set_runstate(td, TD_RUNNING);
415 * Main IO worker function. It retrieves io_u's to process and queues
416 * and reaps them, checking for rate and errors along the way.
418 static void do_io(struct thread_data *td)
425 td_set_runstate(td, TD_RUNNING);
427 while ((td->this_io_bytes[0] + td->this_io_bytes[1]) < td->o.size) {
428 struct timeval comp_time;
441 memcpy(&s, &io_u->start_time, sizeof(s));
443 if (runtime_exceeded(td, &s)) {
449 ret = td_io_queue(td, io_u);
451 case FIO_Q_COMPLETED:
454 else if (io_u->resid) {
455 int bytes = io_u->xfer_buflen - io_u->resid;
456 struct fio_file *f = io_u->file;
462 td_verror(td, ENODATA, "full resid");
467 io_u->xfer_buflen = io_u->resid;
468 io_u->xfer_buf += bytes;
469 io_u->offset += bytes;
470 f->last_completed_pos = io_u->offset;
472 td->ts.short_io_u[io_u->ddir]++;
474 if (io_u->offset == f->real_file_size)
477 requeue_io_u(td, &io_u);
480 fio_gettime(&comp_time, NULL);
481 bytes_done = io_u_sync_complete(td, io_u);
488 * if the engine doesn't have a commit hook,
489 * the io_u is really queued. if it does have such
490 * a hook, it has to call io_u_queued() itself.
492 if (td->io_ops->commit == NULL)
493 io_u_queued(td, io_u);
496 requeue_io_u(td, &io_u);
497 ret2 = td_io_commit(td);
507 if (ret < 0 || td->error)
511 * See if we need to complete some commands
513 if (ret == FIO_Q_QUEUED || ret == FIO_Q_BUSY) {
515 if (queue_full(td) || ret == FIO_Q_BUSY) {
518 if (td->cur_depth > td->o.iodepth_low)
519 min_evts = td->cur_depth - td->o.iodepth_low;
522 fio_gettime(&comp_time, NULL);
523 bytes_done = io_u_queued_complete(td, min_evts);
532 * the rate is batched for now, it should work for batches
533 * of completions except the very first one which may look
536 usec = utime_since(&s, &comp_time);
538 rate_throttle(td, usec, bytes_done);
540 if (check_min_rate(td, &comp_time)) {
541 if (exitall_on_terminate)
542 terminate_threads(td->groupid);
543 td_verror(td, ENODATA, "check_min_rate");
547 if (td->o.thinktime) {
548 unsigned long long b;
550 b = td->io_blocks[0] + td->io_blocks[1];
551 if (!(b % td->o.thinktime_blocks)) {
554 if (td->o.thinktime_spin)
555 __usec_sleep(td->o.thinktime_spin);
557 left = td->o.thinktime - td->o.thinktime_spin;
559 usec_sleep(td, left);
569 ret = io_u_queued_complete(td, i);
571 if (should_fsync(td) && td->o.end_fsync) {
572 td_set_runstate(td, TD_FSYNCING);
574 for_each_file(td, f, i) {
575 if (!(f->flags & FIO_FILE_OPEN))
581 cleanup_pending_aio(td);
584 static void cleanup_io_u(struct thread_data *td)
586 struct list_head *entry, *n;
589 list_for_each_safe(entry, n, &td->io_u_freelist) {
590 io_u = list_entry(entry, struct io_u, list);
592 list_del(&io_u->list);
600 * "randomly" fill the buffer contents
602 static void fill_io_buf(struct thread_data *td, struct io_u *io_u, int max_bs)
604 long *ptr = io_u->buf;
606 if (!td->o.zero_buffers) {
607 while ((void *) ptr - io_u->buf < max_bs) {
608 *ptr = rand() * GOLDEN_RATIO_PRIME;
612 memset(ptr, 0, max_bs);
615 static int init_io_u(struct thread_data *td)
617 unsigned long long buf_size;
623 if (td->io_ops->flags & FIO_SYNCIO)
626 max_units = td->o.iodepth;
628 max_bs = max(td->o.max_bs[DDIR_READ], td->o.max_bs[DDIR_WRITE]);
629 buf_size = (unsigned long long) max_bs * (unsigned long long) max_units;
630 buf_size += page_mask;
631 if (buf_size != (size_t) buf_size) {
632 log_err("fio: IO memory too large. Reduce max_bs or iodepth\n");
636 td->orig_buffer_size = buf_size;
638 if (td->o.mem_type == MEM_SHMHUGE || td->o.mem_type == MEM_MMAPHUGE)
639 td->orig_buffer_size = (td->orig_buffer_size + td->o.hugepage_size - 1) & ~(td->o.hugepage_size - 1);
640 else if (td->orig_buffer_size & page_mask)
641 td->orig_buffer_size = (td->orig_buffer_size + page_mask) & ~page_mask;
643 if (allocate_io_mem(td))
646 p = ALIGN(td->orig_buffer);
647 for (i = 0; i < max_units; i++) {
650 io_u = malloc(sizeof(*io_u));
651 memset(io_u, 0, sizeof(*io_u));
652 INIT_LIST_HEAD(&io_u->list);
654 io_u->buf = p + max_bs * i;
657 fill_io_buf(td, io_u, max_bs);
660 io_u->flags = IO_U_F_FREE;
661 list_add(&io_u->list, &td->io_u_freelist);
669 static int switch_ioscheduler(struct thread_data *td)
671 char tmp[256], tmp2[128];
675 if (td->io_ops->flags & FIO_DISKLESSIO)
678 sprintf(tmp, "%s/queue/scheduler", td->sysfs_root);
680 f = fopen(tmp, "r+");
682 if (errno == ENOENT) {
683 log_err("fio: os or kernel doesn't support IO scheduler switching\n");
686 td_verror(td, errno, "fopen iosched");
693 ret = fwrite(td->o.ioscheduler, strlen(td->o.ioscheduler), 1, f);
694 if (ferror(f) || ret != 1) {
695 td_verror(td, errno, "fwrite");
703 * Read back and check that the selected scheduler is now the default.
705 ret = fread(tmp, 1, sizeof(tmp), f);
706 if (ferror(f) || ret < 0) {
707 td_verror(td, errno, "fread");
712 sprintf(tmp2, "[%s]", td->o.ioscheduler);
713 if (!strstr(tmp, tmp2)) {
714 log_err("fio: io scheduler %s not found\n", td->o.ioscheduler);
715 td_verror(td, EINVAL, "iosched_switch");
724 static int clear_io_state(struct thread_data *td)
730 td->ts.stat_io_bytes[0] = td->ts.stat_io_bytes[1] = 0;
731 td->this_io_bytes[0] = td->this_io_bytes[1] = 0;
735 td->rw_end_set[0] = td->rw_end_set[1] = 0;
737 td->last_was_sync = 0;
739 for_each_file(td, f, i)
740 td_io_close_file(td, f);
743 for_each_file(td, f, i) {
744 ret = td_io_open_file(td, f);
753 * Entry point for the thread based jobs. The process based jobs end up
754 * here as well, after a little setup.
756 static void *thread_main(void *data)
758 unsigned long long runtime[2];
759 struct thread_data *td = data;
760 unsigned long elapsed;
763 if (!td->o.use_thread)
768 INIT_LIST_HEAD(&td->io_u_freelist);
769 INIT_LIST_HEAD(&td->io_u_busylist);
770 INIT_LIST_HEAD(&td->io_u_requeues);
771 INIT_LIST_HEAD(&td->io_log_list);
772 INIT_LIST_HEAD(&td->io_hist_list);
773 td->io_hist_tree = RB_ROOT;
775 td_set_runstate(td, TD_INITIALIZED);
776 fio_sem_up(startup_sem);
777 fio_sem_down(td->mutex);
780 * the ->mutex semaphore is now no longer used, close it to avoid
781 * eating a file descriptor
783 fio_sem_remove(td->mutex);
786 * May alter parameters that init_io_u() will use, so we need to
795 if (fio_setaffinity(td) == -1) {
796 td_verror(td, errno, "cpu_set_affinity");
801 if (ioprio_set(IOPRIO_WHO_PROCESS, 0, td->ioprio) == -1) {
802 td_verror(td, errno, "ioprio_set");
807 if (nice(td->o.nice) == -1) {
808 td_verror(td, errno, "nice");
812 if (td->o.ioscheduler && switch_ioscheduler(td))
815 if (!td->o.create_serialize && setup_files(td))
824 if (init_random_map(td))
827 if (td->o.exec_prerun) {
828 if (system(td->o.exec_prerun) < 0)
832 fio_gettime(&td->epoch, NULL);
833 memcpy(&td->timeout_end, &td->epoch, sizeof(td->epoch));
834 getrusage(RUSAGE_SELF, &td->ts.ru_start);
836 runtime[0] = runtime[1] = 0;
838 while (td->o.time_based || td->o.loops--) {
839 fio_gettime(&td->start, NULL);
840 memcpy(&td->ts.stat_sample_time, &td->start, sizeof(td->start));
843 memcpy(&td->lastrate, &td->ts.stat_sample_time, sizeof(td->lastrate));
845 if (clear_state && clear_io_state(td))
848 prune_io_piece_log(td);
854 if (td_read(td) && td->io_bytes[DDIR_READ]) {
855 if (td->rw_end_set[DDIR_READ])
856 elapsed = utime_since(&td->start, &td->rw_end[DDIR_READ]);
858 elapsed = utime_since_now(&td->start);
860 runtime[DDIR_READ] += elapsed;
862 if (td_write(td) && td->io_bytes[DDIR_WRITE]) {
863 if (td->rw_end_set[DDIR_WRITE])
864 elapsed = utime_since(&td->start, &td->rw_end[DDIR_WRITE]);
866 elapsed = utime_since_now(&td->start);
868 runtime[DDIR_WRITE] += elapsed;
871 if (td->error || td->terminate)
874 if (td->o.verify == VERIFY_NONE)
877 if (clear_io_state(td))
880 fio_gettime(&td->start, NULL);
884 runtime[DDIR_READ] += utime_since_now(&td->start);
886 if (td->error || td->terminate)
890 update_rusage_stat(td);
891 td->ts.runtime[0] = runtime[0] / 1000;
892 td->ts.runtime[1] = runtime[1] / 1000;
893 td->ts.total_run_time = mtime_since_now(&td->epoch);
894 td->ts.io_bytes[0] = td->io_bytes[0];
895 td->ts.io_bytes[1] = td->io_bytes[1];
898 finish_log(td, td->ts.bw_log, "bw");
900 finish_log(td, td->ts.slat_log, "slat");
902 finish_log(td, td->ts.clat_log, "clat");
903 if (td->o.write_iolog_file)
904 write_iolog_close(td);
905 if (td->o.exec_postrun) {
906 if (system(td->o.exec_postrun) < 0)
907 log_err("fio: postrun %s failed\n", td->o.exec_postrun);
910 if (exitall_on_terminate)
911 terminate_threads(td->groupid);
915 printf("fio: pid=%d, err=%d/%s\n", td->pid, td->error, td->verror);
919 options_mem_free(td);
920 td_set_runstate(td, TD_EXITED);
921 return (void *) (unsigned long) td->error;
925 * We cannot pass the td data into a forked process, so attach the td and
926 * pass it to the thread worker.
928 static int fork_main(int shmid, int offset)
930 struct thread_data *td;
933 data = shmat(shmid, NULL, 0);
934 if (data == (void *) -1) {
941 td = data + offset * sizeof(struct thread_data);
942 ret = thread_main(td);
944 return (int) (unsigned long) ret;
948 * Run over the job map and reap the threads that have exited, if any.
950 static void reap_threads(int *nr_running, int *t_rate, int *m_rate)
952 struct thread_data *td;
953 int i, cputhreads, pending, status, ret;
956 * reap exited threads (TD_EXITED -> TD_REAPED)
958 pending = cputhreads = 0;
963 * ->io_ops is NULL for a thread that has closed its
966 if (td->io_ops && !strcmp(td->io_ops->name, "cpuio"))
969 if (!td->pid || td->runstate == TD_REAPED)
971 if (td->o.use_thread) {
972 if (td->runstate == TD_EXITED) {
973 td_set_runstate(td, TD_REAPED);
980 if (td->runstate == TD_EXITED)
984 * check if someone quit or got killed in an unusual way
986 ret = waitpid(td->pid, &status, flags);
988 if (errno == ECHILD) {
989 log_err("fio: pid=%d disappeared %d\n", td->pid, td->runstate);
990 td_set_runstate(td, TD_REAPED);
994 } else if (ret == td->pid) {
995 if (WIFSIGNALED(status)) {
996 int sig = WTERMSIG(status);
999 log_err("fio: pid=%d, got signal=%d\n", td->pid, sig);
1000 td_set_runstate(td, TD_REAPED);
1003 if (WIFEXITED(status)) {
1004 if (WEXITSTATUS(status) && !td->error)
1005 td->error = WEXITSTATUS(status);
1007 td_set_runstate(td, TD_REAPED);
1013 * thread is not dead, continue
1018 if (td->o.use_thread) {
1021 if (pthread_join(td->thread, (void *) &ret))
1022 perror("pthread_join");
1026 (*m_rate) -= td->o.ratemin;
1027 (*t_rate) -= td->o.rate;
1034 if (*nr_running == cputhreads && !pending)
1035 terminate_threads(TERMINATE_ALL);
1039 * Main function for kicking off and reaping jobs, as needed.
1041 static void run_threads(void)
1043 struct thread_data *td;
1044 unsigned long spent;
1045 int i, todo, nr_running, m_rate, t_rate, nr_started;
1047 if (fio_pin_memory())
1050 if (!terse_output) {
1051 printf("Starting ");
1053 printf("%d thread%s", nr_thread, nr_thread > 1 ? "s" : "");
1057 printf("%d process%s", nr_process, nr_process > 1 ? "es" : "");
1063 signal(SIGINT, sig_handler);
1064 signal(SIGALRM, sig_handler);
1066 todo = thread_number;
1069 m_rate = t_rate = 0;
1071 for_each_td(td, i) {
1072 print_status_init(td->thread_number - 1);
1074 if (!td->o.create_serialize) {
1080 * do file setup here so it happens sequentially,
1081 * we don't want X number of threads getting their
1082 * client data interspersed on disk
1084 if (setup_files(td)) {
1087 log_err("fio: pid=%d, err=%d/%s\n", td->pid, td->error, td->verror);
1088 td_set_runstate(td, TD_REAPED);
1098 struct thread_data *map[MAX_JOBS];
1099 struct timeval this_start;
1100 int this_jobs = 0, left;
1103 * create threads (TD_NOT_CREATED -> TD_CREATED)
1105 for_each_td(td, i) {
1106 if (td->runstate != TD_NOT_CREATED)
1110 * never got a chance to start, killed by other
1111 * thread for some reason
1113 if (td->terminate) {
1118 if (td->o.start_delay) {
1119 spent = mtime_since_genesis();
1121 if (td->o.start_delay * 1000 > spent)
1125 if (td->o.stonewall && (nr_started || nr_running))
1129 * Set state to created. Thread will transition
1130 * to TD_INITIALIZED when it's done setting up.
1132 td_set_runstate(td, TD_CREATED);
1133 map[this_jobs++] = td;
1136 if (td->o.use_thread) {
1137 if (pthread_create(&td->thread, NULL, thread_main, td)) {
1138 perror("thread_create");
1144 int ret = fork_main(shm_id, i);
1149 fio_sem_down(startup_sem);
1153 * Wait for the started threads to transition to
1156 fio_gettime(&this_start, NULL);
1158 while (left && !fio_abort) {
1159 if (mtime_since_now(&this_start) > JOB_START_TIMEOUT)
1164 for (i = 0; i < this_jobs; i++) {
1168 if (td->runstate == TD_INITIALIZED) {
1171 } else if (td->runstate >= TD_EXITED) {
1175 nr_running++; /* work-around... */
1181 log_err("fio: %d jobs failed to start\n", left);
1182 for (i = 0; i < this_jobs; i++) {
1186 kill(td->pid, SIGTERM);
1192 * start created threads (TD_INITIALIZED -> TD_RUNNING).
1194 for_each_td(td, i) {
1195 if (td->runstate != TD_INITIALIZED)
1198 td_set_runstate(td, TD_RUNNING);
1201 m_rate += td->o.ratemin;
1202 t_rate += td->o.rate;
1204 fio_sem_up(td->mutex);
1207 reap_threads(&nr_running, &t_rate, &m_rate);
1213 while (nr_running) {
1214 reap_threads(&nr_running, &t_rate, &m_rate);
1222 int main(int argc, char *argv[])
1227 * We need locale for number printing, if it isn't set then just
1228 * go with the US format.
1230 if (!getenv("LC_NUMERIC"))
1231 setlocale(LC_NUMERIC, "en_US");
1233 if (parse_options(argc, argv))
1239 ps = sysconf(_SC_PAGESIZE);
1241 log_err("Failed to get page size\n");
1249 setup_log(&agg_io_log[DDIR_READ]);
1250 setup_log(&agg_io_log[DDIR_WRITE]);
1253 startup_sem = fio_sem_init(0);
1257 disk_util_timer_arm();
1264 __finish_log(agg_io_log[DDIR_READ],"agg-read_bw.log");
1265 __finish_log(agg_io_log[DDIR_WRITE],"agg-write_bw.log");
1269 fio_sem_remove(startup_sem);