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) {
73 if (td->runstate <= TD_RUNNING)
74 kill(td->pid, SIGQUIT);
76 td->o.start_delay = 0;
81 static void sig_handler(int sig)
86 disk_util_timer_arm();
87 print_thread_status();
90 printf("\nfio: terminating on signal %d\n", sig);
92 terminate_threads(TERMINATE_ALL);
98 * Check if we are above the minimum rate given.
100 static int check_min_rate(struct thread_data *td, struct timeval *now)
102 unsigned long long bytes = 0;
103 unsigned long iops = 0;
108 * No minimum rate set, always ok
110 if (!td->o.ratemin && !td->o.rate_iops_min)
114 * allow a 2 second settle period in the beginning
116 if (mtime_since(&td->start, now) < 2000)
120 iops += td->io_blocks[DDIR_READ];
121 bytes += td->this_io_bytes[DDIR_READ];
124 iops += td->io_blocks[DDIR_WRITE];
125 bytes += td->this_io_bytes[DDIR_WRITE];
129 * if rate blocks is set, sample is running
131 if (td->rate_bytes || td->rate_blocks) {
132 spent = mtime_since(&td->lastrate, now);
133 if (spent < td->o.ratecycle)
138 * check bandwidth specified rate
140 if (bytes < td->rate_bytes) {
141 log_err("%s: min rate %u not met\n", td->o.name, td->o.ratemin);
144 rate = (bytes - td->rate_bytes) / spent;
145 if (rate < td->o.ratemin || bytes < td->rate_bytes) {
146 log_err("%s: min rate %u not met, got %luKiB/sec\n", td->o.name, td->o.ratemin, rate);
152 * checks iops specified rate
154 if (iops < td->o.rate_iops) {
155 log_err("%s: min iops rate %u not met\n", td->o.name, td->o.rate_iops);
158 rate = (iops - td->rate_blocks) / spent;
159 if (rate < td->o.rate_iops_min || iops < td->rate_blocks) {
160 log_err("%s: min iops rate %u not met, got %lu\n", td->o.name, td->o.rate_iops_min, rate);
166 td->rate_bytes = bytes;
167 td->rate_blocks = iops;
168 memcpy(&td->lastrate, now, sizeof(*now));
172 static inline int runtime_exceeded(struct thread_data *td, struct timeval *t)
176 if (mtime_since(&td->epoch, t) >= td->o.timeout * 1000)
183 * When job exits, we can cancel the in-flight IO if we are using async
184 * io. Attempt to do so.
186 static void cleanup_pending_aio(struct thread_data *td)
188 struct list_head *entry, *n;
193 * get immediately available events, if any
195 r = io_u_queued_complete(td, 0);
200 * now cancel remaining active events
202 if (td->io_ops->cancel) {
203 list_for_each_safe(entry, n, &td->io_u_busylist) {
204 io_u = list_entry(entry, struct io_u, list);
207 * if the io_u isn't in flight, then that generally
208 * means someone leaked an io_u. complain but fix
209 * it up, so we don't stall here.
211 if ((io_u->flags & IO_U_F_FLIGHT) == 0) {
212 log_err("fio: non-busy IO on busy list\n");
215 r = td->io_ops->cancel(td, io_u);
223 r = io_u_queued_complete(td, td->cur_depth);
227 * Helper to handle the final sync of a file. Works just like the normal
228 * io path, just does everything sync.
230 static int fio_io_sync(struct thread_data *td, struct fio_file *f)
232 struct io_u *io_u = __get_io_u(td);
238 io_u->ddir = DDIR_SYNC;
241 if (td_io_prep(td, io_u)) {
247 ret = td_io_queue(td, io_u);
249 td_verror(td, io_u->error, "td_io_queue");
252 } else if (ret == FIO_Q_QUEUED) {
253 if (io_u_queued_complete(td, 1) < 0)
255 } else if (ret == FIO_Q_COMPLETED) {
257 td_verror(td, io_u->error, "td_io_queue");
261 if (io_u_sync_complete(td, io_u) < 0)
263 } else if (ret == FIO_Q_BUSY) {
264 if (td_io_commit(td))
273 * The main verify engine. Runs over the writes we previously submitted,
274 * reads the blocks back in, and checks the crc/md5 of the data.
276 static void do_verify(struct thread_data *td)
284 * sync io first and invalidate cache, to make sure we really
287 for_each_file(td, f, i) {
288 if (!(f->flags & FIO_FILE_OPEN))
290 if (fio_io_sync(td, f))
292 if (file_invalidate_cache(td, f))
299 td_set_runstate(td, TD_VERIFYING);
302 while (!td->terminate) {
305 io_u = __get_io_u(td);
309 if (runtime_exceeded(td, &io_u->start_time)) {
315 if (get_next_verify(td, io_u)) {
320 if (td_io_prep(td, io_u)) {
325 io_u->end_io = verify_io_u;
327 ret = td_io_queue(td, io_u);
329 case FIO_Q_COMPLETED:
332 else if (io_u->resid) {
333 int bytes = io_u->xfer_buflen - io_u->resid;
334 struct fio_file *f = io_u->file;
340 td_verror(td, ENODATA, "full resid");
345 io_u->xfer_buflen = io_u->resid;
346 io_u->xfer_buf += bytes;
347 io_u->offset += bytes;
348 f->last_completed_pos = io_u->offset;
350 td->ts.short_io_u[io_u->ddir]++;
352 if (io_u->offset == f->real_file_size)
355 requeue_io_u(td, &io_u);
358 ret = io_u_sync_complete(td, io_u);
366 requeue_io_u(td, &io_u);
367 ret2 = td_io_commit(td);
373 td_verror(td, -ret, "td_io_queue");
377 if (ret < 0 || td->error)
381 * if we can queue more, do so. but check if there are
382 * completed io_u's first.
385 if (queue_full(td) || ret == FIO_Q_BUSY) {
388 if (td->cur_depth > td->o.iodepth_low)
389 min_events = td->cur_depth - td->o.iodepth_low;
393 * Reap required number of io units, if any, and do the
394 * verification on them through the callback handler
396 if (io_u_queued_complete(td, min_events) < 0)
401 min_events = td->cur_depth;
404 ret = io_u_queued_complete(td, min_events);
406 cleanup_pending_aio(td);
408 td_set_runstate(td, TD_RUNNING);
412 * Main IO worker function. It retrieves io_u's to process and queues
413 * and reaps them, checking for rate and errors along the way.
415 static void do_io(struct thread_data *td)
422 td_set_runstate(td, TD_RUNNING);
424 while ((td->this_io_bytes[0] + td->this_io_bytes[1]) < td->o.size) {
425 struct timeval comp_time;
438 memcpy(&s, &io_u->start_time, sizeof(s));
440 if (runtime_exceeded(td, &s)) {
446 ret = td_io_queue(td, io_u);
448 case FIO_Q_COMPLETED:
451 else if (io_u->resid) {
452 int bytes = io_u->xfer_buflen - io_u->resid;
453 struct fio_file *f = io_u->file;
459 td_verror(td, ENODATA, "full resid");
464 io_u->xfer_buflen = io_u->resid;
465 io_u->xfer_buf += bytes;
466 io_u->offset += bytes;
467 f->last_completed_pos = io_u->offset;
469 td->ts.short_io_u[io_u->ddir]++;
471 if (io_u->offset == f->real_file_size)
474 requeue_io_u(td, &io_u);
477 fio_gettime(&comp_time, NULL);
478 bytes_done = io_u_sync_complete(td, io_u);
485 * if the engine doesn't have a commit hook,
486 * the io_u is really queued. if it does have such
487 * a hook, it has to call io_u_queued() itself.
489 if (td->io_ops->commit == NULL)
490 io_u_queued(td, io_u);
493 requeue_io_u(td, &io_u);
494 ret2 = td_io_commit(td);
504 if (ret < 0 || td->error)
508 * See if we need to complete some commands
510 if (ret == FIO_Q_QUEUED || ret == FIO_Q_BUSY) {
512 if (queue_full(td) || ret == FIO_Q_BUSY) {
515 if (td->cur_depth > td->o.iodepth_low)
516 min_evts = td->cur_depth - td->o.iodepth_low;
519 fio_gettime(&comp_time, NULL);
520 bytes_done = io_u_queued_complete(td, min_evts);
529 * the rate is batched for now, it should work for batches
530 * of completions except the very first one which may look
533 usec = utime_since(&s, &comp_time);
535 rate_throttle(td, usec, bytes_done);
537 if (check_min_rate(td, &comp_time)) {
538 if (exitall_on_terminate)
539 terminate_threads(td->groupid);
540 td_verror(td, ENODATA, "check_min_rate");
544 if (td->o.thinktime) {
545 unsigned long long b;
547 b = td->io_blocks[0] + td->io_blocks[1];
548 if (!(b % td->o.thinktime_blocks)) {
551 if (td->o.thinktime_spin)
552 __usec_sleep(td->o.thinktime_spin);
554 left = td->o.thinktime - td->o.thinktime_spin;
556 usec_sleep(td, left);
566 ret = io_u_queued_complete(td, i);
568 if (should_fsync(td) && td->o.end_fsync) {
569 td_set_runstate(td, TD_FSYNCING);
571 for_each_file(td, f, i) {
572 if (!(f->flags & FIO_FILE_OPEN))
578 cleanup_pending_aio(td);
581 static void cleanup_io_u(struct thread_data *td)
583 struct list_head *entry, *n;
586 list_for_each_safe(entry, n, &td->io_u_freelist) {
587 io_u = list_entry(entry, struct io_u, list);
589 list_del(&io_u->list);
597 * "randomly" fill the buffer contents
599 static void fill_io_buf(struct thread_data *td, struct io_u *io_u, int max_bs)
601 long *ptr = io_u->buf;
603 if (!td->o.zero_buffers) {
604 while ((void *) ptr - io_u->buf < max_bs) {
605 *ptr = rand() * GOLDEN_RATIO_PRIME;
609 memset(ptr, 0, max_bs);
612 static int init_io_u(struct thread_data *td)
614 unsigned long long buf_size;
620 if (td->io_ops->flags & FIO_SYNCIO)
623 max_units = td->o.iodepth;
625 max_bs = max(td->o.max_bs[DDIR_READ], td->o.max_bs[DDIR_WRITE]);
626 buf_size = (unsigned long long) max_bs * (unsigned long long) max_units;
627 buf_size += page_mask;
628 if (buf_size != (size_t) buf_size) {
629 log_err("fio: IO memory too large. Reduce max_bs or iodepth\n");
633 td->orig_buffer_size = buf_size;
635 if (td->o.mem_type == MEM_SHMHUGE || td->o.mem_type == MEM_MMAPHUGE)
636 td->orig_buffer_size = (td->orig_buffer_size + td->o.hugepage_size - 1) & ~(td->o.hugepage_size - 1);
637 else if (td->orig_buffer_size & page_mask)
638 td->orig_buffer_size = (td->orig_buffer_size + page_mask) & ~page_mask;
640 if (allocate_io_mem(td))
643 p = ALIGN(td->orig_buffer);
644 for (i = 0; i < max_units; i++) {
645 io_u = malloc(sizeof(*io_u));
646 memset(io_u, 0, sizeof(*io_u));
647 INIT_LIST_HEAD(&io_u->list);
649 io_u->buf = p + max_bs * i;
652 fill_io_buf(td, io_u, max_bs);
655 io_u->flags = IO_U_F_FREE;
656 list_add(&io_u->list, &td->io_u_freelist);
664 static int switch_ioscheduler(struct thread_data *td)
666 char tmp[256], tmp2[128];
670 if (td->io_ops->flags & FIO_DISKLESSIO)
673 sprintf(tmp, "%s/queue/scheduler", td->sysfs_root);
675 f = fopen(tmp, "r+");
677 if (errno == ENOENT) {
678 log_err("fio: os or kernel doesn't support IO scheduler switching\n");
681 td_verror(td, errno, "fopen iosched");
688 ret = fwrite(td->o.ioscheduler, strlen(td->o.ioscheduler), 1, f);
689 if (ferror(f) || ret != 1) {
690 td_verror(td, errno, "fwrite");
698 * Read back and check that the selected scheduler is now the default.
700 ret = fread(tmp, 1, sizeof(tmp), f);
701 if (ferror(f) || ret < 0) {
702 td_verror(td, errno, "fread");
707 sprintf(tmp2, "[%s]", td->o.ioscheduler);
708 if (!strstr(tmp, tmp2)) {
709 log_err("fio: io scheduler %s not found\n", td->o.ioscheduler);
710 td_verror(td, EINVAL, "iosched_switch");
719 static int clear_io_state(struct thread_data *td)
725 td->ts.stat_io_bytes[0] = td->ts.stat_io_bytes[1] = 0;
726 td->this_io_bytes[0] = td->this_io_bytes[1] = 0;
730 td->rw_end_set[0] = td->rw_end_set[1] = 0;
732 td->last_was_sync = 0;
734 for_each_file(td, f, i)
735 td_io_close_file(td, f);
738 for_each_file(td, f, i) {
739 ret = td_io_open_file(td, f);
748 * Entry point for the thread based jobs. The process based jobs end up
749 * here as well, after a little setup.
751 static void *thread_main(void *data)
753 unsigned long long runtime[2];
754 struct thread_data *td = data;
755 unsigned long elapsed;
758 if (!td->o.use_thread)
763 INIT_LIST_HEAD(&td->io_u_freelist);
764 INIT_LIST_HEAD(&td->io_u_busylist);
765 INIT_LIST_HEAD(&td->io_u_requeues);
766 INIT_LIST_HEAD(&td->io_log_list);
767 INIT_LIST_HEAD(&td->io_hist_list);
768 td->io_hist_tree = RB_ROOT;
773 if (fio_setaffinity(td) == -1) {
774 td_verror(td, errno, "cpu_set_affinity");
782 if (ioprio_set(IOPRIO_WHO_PROCESS, 0, td->ioprio) == -1) {
783 td_verror(td, errno, "ioprio_set");
788 if (nice(td->o.nice) == -1) {
789 td_verror(td, errno, "nice");
793 if (td->o.ioscheduler && switch_ioscheduler(td))
796 td_set_runstate(td, TD_INITIALIZED);
797 fio_sem_up(startup_sem);
798 fio_sem_down(td->mutex);
801 * the ->mutex semaphore is now no longer used, close it to avoid
802 * eating a file descriptor
804 fio_sem_remove(td->mutex);
806 if (!td->o.create_serialize && setup_files(td))
815 if (init_random_map(td))
818 if (td->o.exec_prerun) {
819 if (system(td->o.exec_prerun) < 0)
823 fio_gettime(&td->epoch, NULL);
824 memcpy(&td->timeout_end, &td->epoch, sizeof(td->epoch));
825 getrusage(RUSAGE_SELF, &td->ts.ru_start);
827 runtime[0] = runtime[1] = 0;
829 while (td->o.time_based || td->o.loops--) {
830 fio_gettime(&td->start, NULL);
831 memcpy(&td->ts.stat_sample_time, &td->start, sizeof(td->start));
834 memcpy(&td->lastrate, &td->ts.stat_sample_time, sizeof(td->lastrate));
836 if (clear_state && clear_io_state(td))
839 prune_io_piece_log(td);
845 if (td_read(td) && td->io_bytes[DDIR_READ]) {
846 if (td->rw_end_set[DDIR_READ])
847 elapsed = utime_since(&td->start, &td->rw_end[DDIR_READ]);
849 elapsed = utime_since_now(&td->start);
851 runtime[DDIR_READ] += elapsed;
853 if (td_write(td) && td->io_bytes[DDIR_WRITE]) {
854 if (td->rw_end_set[DDIR_WRITE])
855 elapsed = utime_since(&td->start, &td->rw_end[DDIR_WRITE]);
857 elapsed = utime_since_now(&td->start);
859 runtime[DDIR_WRITE] += elapsed;
862 if (td->error || td->terminate)
865 if (td->o.verify == VERIFY_NONE)
868 if (clear_io_state(td))
871 fio_gettime(&td->start, NULL);
875 runtime[DDIR_READ] += utime_since_now(&td->start);
877 if (td->error || td->terminate)
881 update_rusage_stat(td);
882 td->ts.runtime[0] = runtime[0] / 1000;
883 td->ts.runtime[1] = runtime[1] / 1000;
884 td->ts.total_run_time = mtime_since_now(&td->epoch);
885 td->ts.io_bytes[0] = td->io_bytes[0];
886 td->ts.io_bytes[1] = td->io_bytes[1];
889 finish_log(td, td->ts.bw_log, "bw");
891 finish_log(td, td->ts.slat_log, "slat");
893 finish_log(td, td->ts.clat_log, "clat");
894 if (td->o.write_iolog_file)
895 write_iolog_close(td);
896 if (td->o.exec_postrun) {
897 if (system(td->o.exec_postrun) < 0)
898 log_err("fio: postrun %s failed\n", td->o.exec_postrun);
901 if (exitall_on_terminate)
902 terminate_threads(td->groupid);
906 printf("fio: pid=%d, err=%d/%s\n", td->pid, td->error, td->verror);
910 options_mem_free(td);
911 td_set_runstate(td, TD_EXITED);
912 return (void *) (unsigned long) td->error;
914 fio_sem_up(startup_sem);
919 * We cannot pass the td data into a forked process, so attach the td and
920 * pass it to the thread worker.
922 static int fork_main(int shmid, int offset)
924 struct thread_data *td;
927 data = shmat(shmid, NULL, 0);
928 if (data == (void *) -1) {
935 td = data + offset * sizeof(struct thread_data);
936 ret = thread_main(td);
938 return (int) (unsigned long) ret;
942 * Run over the job map and reap the threads that have exited, if any.
944 static void reap_threads(int *nr_running, int *t_rate, int *m_rate)
946 struct thread_data *td;
947 int i, cputhreads, pending, status, ret;
950 * reap exited threads (TD_EXITED -> TD_REAPED)
952 pending = cputhreads = 0;
957 * ->io_ops is NULL for a thread that has closed its
960 if (td->io_ops && !strcmp(td->io_ops->name, "cpuio"))
963 if (!td->pid || td->runstate == TD_REAPED)
965 if (td->o.use_thread) {
966 if (td->runstate == TD_EXITED) {
967 td_set_runstate(td, TD_REAPED);
974 if (td->runstate == TD_EXITED)
978 * check if someone quit or got killed in an unusual way
980 ret = waitpid(td->pid, &status, flags);
982 if (errno == ECHILD) {
983 log_err("fio: pid=%d disappeared %d\n", td->pid, td->runstate);
984 td_set_runstate(td, TD_REAPED);
988 } else if (ret == td->pid) {
989 if (WIFSIGNALED(status)) {
990 int sig = WTERMSIG(status);
993 log_err("fio: pid=%d, got signal=%d\n", td->pid, sig);
994 td_set_runstate(td, TD_REAPED);
997 if (WIFEXITED(status)) {
998 if (WEXITSTATUS(status) && !td->error)
999 td->error = WEXITSTATUS(status);
1001 td_set_runstate(td, TD_REAPED);
1007 * thread is not dead, continue
1012 if (td->o.use_thread) {
1015 if (pthread_join(td->thread, (void *) &ret))
1016 perror("pthread_join");
1020 (*m_rate) -= td->o.ratemin;
1021 (*t_rate) -= td->o.rate;
1028 if (*nr_running == cputhreads && !pending)
1029 terminate_threads(TERMINATE_ALL);
1033 * Main function for kicking off and reaping jobs, as needed.
1035 static void run_threads(void)
1037 struct thread_data *td;
1038 unsigned long spent;
1039 int i, todo, nr_running, m_rate, t_rate, nr_started;
1041 if (fio_pin_memory())
1044 if (!terse_output) {
1045 printf("Starting ");
1047 printf("%d thread%s", nr_thread, nr_thread > 1 ? "s" : "");
1051 printf("%d process%s", nr_process, nr_process > 1 ? "es" : "");
1057 signal(SIGINT, sig_handler);
1058 signal(SIGALRM, sig_handler);
1060 todo = thread_number;
1063 m_rate = t_rate = 0;
1065 for_each_td(td, i) {
1066 print_status_init(td->thread_number - 1);
1068 if (!td->o.create_serialize) {
1074 * do file setup here so it happens sequentially,
1075 * we don't want X number of threads getting their
1076 * client data interspersed on disk
1078 if (setup_files(td)) {
1081 log_err("fio: pid=%d, err=%d/%s\n", td->pid, td->error, td->verror);
1082 td_set_runstate(td, TD_REAPED);
1092 struct thread_data *map[MAX_JOBS];
1093 struct timeval this_start;
1094 int this_jobs = 0, left;
1097 * create threads (TD_NOT_CREATED -> TD_CREATED)
1099 for_each_td(td, i) {
1100 if (td->runstate != TD_NOT_CREATED)
1104 * never got a chance to start, killed by other
1105 * thread for some reason
1107 if (td->terminate) {
1112 if (td->o.start_delay) {
1113 spent = mtime_since_genesis();
1115 if (td->o.start_delay * 1000 > spent)
1119 if (td->o.stonewall && (nr_started || nr_running))
1123 * Set state to created. Thread will transition
1124 * to TD_INITIALIZED when it's done setting up.
1126 td_set_runstate(td, TD_CREATED);
1127 map[this_jobs++] = td;
1130 if (td->o.use_thread) {
1131 if (pthread_create(&td->thread, NULL, thread_main, td)) {
1132 perror("thread_create");
1138 int ret = fork_main(shm_id, i);
1143 fio_sem_down(startup_sem);
1147 * Wait for the started threads to transition to
1150 fio_gettime(&this_start, NULL);
1152 while (left && !fio_abort) {
1153 if (mtime_since_now(&this_start) > JOB_START_TIMEOUT)
1158 for (i = 0; i < this_jobs; i++) {
1162 if (td->runstate == TD_INITIALIZED) {
1165 } else if (td->runstate >= TD_EXITED) {
1169 nr_running++; /* work-around... */
1175 log_err("fio: %d jobs failed to start\n", left);
1176 for (i = 0; i < this_jobs; i++) {
1180 kill(td->pid, SIGTERM);
1186 * start created threads (TD_INITIALIZED -> TD_RUNNING).
1188 for_each_td(td, i) {
1189 if (td->runstate != TD_INITIALIZED)
1192 td_set_runstate(td, TD_RUNNING);
1195 m_rate += td->o.ratemin;
1196 t_rate += td->o.rate;
1198 fio_sem_up(td->mutex);
1201 reap_threads(&nr_running, &t_rate, &m_rate);
1207 while (nr_running) {
1208 reap_threads(&nr_running, &t_rate, &m_rate);
1216 int main(int argc, char *argv[])
1221 * We need locale for number printing, if it isn't set then just
1222 * go with the US format.
1224 if (!getenv("LC_NUMERIC"))
1225 setlocale(LC_NUMERIC, "en_US");
1227 if (parse_options(argc, argv))
1233 ps = sysconf(_SC_PAGESIZE);
1235 log_err("Failed to get page size\n");
1243 setup_log(&agg_io_log[DDIR_READ]);
1244 setup_log(&agg_io_log[DDIR_WRITE]);
1247 startup_sem = fio_sem_init(0);
1251 disk_util_timer_arm();
1258 __finish_log(agg_io_log[DDIR_READ],"agg-read_bw.log");
1259 __finish_log(agg_io_log[DDIR_WRITE],"agg-write_bw.log");
1263 fio_sem_remove(startup_sem);