2 * Copyright (c) 2005 David Xu <davidxu@freebsd.org>
3 * Copyright (c) 2003 Daniel Eischen <deischen@freebsd.org>
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
9 * 1. Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 * 2. Neither the name of the author nor the names of any co-contributors
12 * may be used to endorse or promote products derived from this software
13 * without specific prior written permission.
15 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
16 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
17 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
18 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
19 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
20 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
21 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
22 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
23 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
24 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 * Copyright (c) 1995-1998 John Birrell <jb@cimlogic.com.au>
32 * All rights reserved.
34 * Redistribution and use in source and binary forms, with or without
35 * modification, are permitted provided that the following conditions
37 * 1. Redistributions of source code must retain the above copyright
38 * notice, this list of conditions and the following disclaimer.
39 * 2. Redistributions in binary form must reproduce the above copyright
40 * notice, this list of conditions and the following disclaimer in the
41 * documentation and/or other materials provided with the distribution.
42 * 3. Neither the name of the author nor the names of any co-contributors
43 * may be used to endorse or promote products derived from this software
44 * without specific prior written permission.
46 * THIS SOFTWARE IS PROVIDED BY JOHN BIRRELL AND CONTRIBUTORS ``AS IS'' AND
47 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
48 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
49 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
50 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
51 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
52 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
53 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
54 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
55 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
60 #include "namespace.h"
68 #include "un-namespace.h"
70 #include "libc_private.h"
71 #include "rtld_lock.h"
72 #include "thr_private.h"
74 __weak_reference(_pthread_atfork, pthread_atfork);
77 _pthread_atfork(void (*prepare)(void), void (*parent)(void),
80 struct pthread *curthread;
81 struct pthread_atfork *af;
85 if ((af = malloc(sizeof(struct pthread_atfork))) == NULL)
88 curthread = _get_curthread();
89 af->prepare = prepare;
92 THR_UMUTEX_LOCK(curthread, &_thr_atfork_lock);
93 TAILQ_INSERT_TAIL(&_thr_atfork_list, af, qe);
94 THR_UMUTEX_UNLOCK(curthread, &_thr_atfork_lock);
99 __pthread_cxa_finalize(struct dl_phdr_info *phdr_info)
101 struct pthread *curthread;
102 struct pthread_atfork *af, *af1;
106 curthread = _get_curthread();
107 THR_UMUTEX_LOCK(curthread, &_thr_atfork_lock);
108 TAILQ_FOREACH_SAFE(af, &_thr_atfork_list, qe, af1) {
109 if (__elf_phdr_match_addr(phdr_info, af->prepare) ||
110 __elf_phdr_match_addr(phdr_info, af->parent) ||
111 __elf_phdr_match_addr(phdr_info, af->child)) {
112 TAILQ_REMOVE(&_thr_atfork_list, af, qe);
116 THR_UMUTEX_UNLOCK(curthread, &_thr_atfork_lock);
119 __weak_reference(_fork, fork);
126 struct pthread *curthread;
127 struct pthread_atfork *af;
131 int rtld_locks[MAX_RTLD_LOCKS];
133 if (!_thr_is_inited())
134 return (__sys_fork());
136 curthread = _get_curthread();
138 THR_UMUTEX_LOCK(curthread, &_thr_atfork_lock);
140 /* Run down atfork prepare handlers. */
141 TAILQ_FOREACH_REVERSE(af, &_thr_atfork_list, atfork_head, qe) {
142 if (af->prepare != NULL)
147 * All bets are off as to what should happen soon if the parent
148 * process was not so kindly as to set up pthread fork hooks to
149 * relinquish all running threads.
151 if (_thr_isthreaded() != 0) {
154 _rtld_atfork_pre(rtld_locks);
160 * Block all signals until we reach a safe point.
162 _thr_signal_block(curthread);
164 /* Fork a new process: */
165 if ((ret = __sys_fork()) == 0) {
168 curthread->cancel_pending = 0;
169 curthread->flags &= ~THR_FLAGS_NEED_SUSPEND;
172 * Thread list will be reinitialized, and later we call
173 * _libpthread_init(), it will add us back to list.
175 curthread->tlflags &= ~(TLFLAGS_IN_TDLIST | TLFLAGS_DETACHED);
177 /* child is a new kernel thread. */
178 thr_self(&curthread->tid);
180 /* clear other threads locked us. */
181 _thr_umutex_init(&curthread->lock);
182 _thr_umutex_init(&_thr_atfork_lock);
185 _rtld_atfork_post(rtld_locks);
188 /* reinitialize libc spinlocks. */
189 _thr_spinlock_init();
190 _mutex_fork(curthread);
192 /* reinitalize library. */
193 _libpthread_init(curthread);
195 /* Ready to continue, unblock signals. */
196 _thr_signal_unblock(curthread);
204 /* Run down atfork child handlers. */
205 TAILQ_FOREACH(af, &_thr_atfork_list, qe) {
206 if (af->child != NULL)
213 /* Ready to continue, unblock signals. */
214 _thr_signal_unblock(curthread);
217 _rtld_atfork_post(rtld_locks);
221 /* Run down atfork parent handlers. */
222 TAILQ_FOREACH(af, &_thr_atfork_list, qe) {
223 if (af->parent != NULL)
227 THR_UMUTEX_UNLOCK(curthread, &_thr_atfork_lock);
231 /* Return the process ID: */