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
29 * SPDX-License-Identifier: BSD-3-Clause
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 <sys/cdefs.h>
61 __FBSDID("$FreeBSD$");
63 #include <sys/syscall.h>
64 #include "namespace.h"
72 #include "un-namespace.h"
74 #include "libc_private.h"
75 #include "rtld_lock.h"
76 #include "thr_private.h"
78 __weak_reference(_thr_atfork, _pthread_atfork);
79 __weak_reference(_thr_atfork, pthread_atfork);
81 bool _thr_after_fork = false;
84 _thr_atfork(void (*prepare)(void), void (*parent)(void),
87 struct pthread *curthread;
88 struct pthread_atfork *af;
92 if ((af = malloc(sizeof(struct pthread_atfork))) == NULL)
95 curthread = _get_curthread();
96 af->prepare = prepare;
99 THR_CRITICAL_ENTER(curthread);
100 _thr_rwl_wrlock(&_thr_atfork_lock);
101 TAILQ_INSERT_TAIL(&_thr_atfork_list, af, qe);
102 _thr_rwl_unlock(&_thr_atfork_lock);
103 THR_CRITICAL_LEAVE(curthread);
108 __pthread_cxa_finalize(struct dl_phdr_info *phdr_info)
110 atfork_head temp_list = TAILQ_HEAD_INITIALIZER(temp_list);
111 struct pthread *curthread;
112 struct pthread_atfork *af, *af1;
116 curthread = _get_curthread();
117 THR_CRITICAL_ENTER(curthread);
118 _thr_rwl_wrlock(&_thr_atfork_lock);
119 TAILQ_FOREACH_SAFE(af, &_thr_atfork_list, qe, af1) {
120 if (__elf_phdr_match_addr(phdr_info, af->prepare) ||
121 __elf_phdr_match_addr(phdr_info, af->parent) ||
122 __elf_phdr_match_addr(phdr_info, af->child)) {
123 TAILQ_REMOVE(&_thr_atfork_list, af, qe);
124 TAILQ_INSERT_TAIL(&temp_list, af, qe);
127 _thr_rwl_unlock(&_thr_atfork_lock);
128 THR_CRITICAL_LEAVE(curthread);
129 while ((af = TAILQ_FIRST(&temp_list)) != NULL) {
130 TAILQ_REMOVE(&temp_list, af, qe);
133 _thr_tsd_unload(phdr_info);
134 _thr_sigact_unload(phdr_info);
142 struct thr_fork_args {
143 enum thr_fork_mode mode;
149 thr_fork_impl(const struct thr_fork_args *a)
151 struct pthread *curthread;
152 struct pthread_atfork *af;
154 int errsave, cancelsave;
156 int rtld_locks[MAX_RTLD_LOCKS];
158 if (!_thr_is_inited()) {
161 return (__sys_fork());
163 return (__sys_pdfork(a->fdp, a->flags));
170 curthread = _get_curthread();
171 cancelsave = curthread->no_cancel;
172 curthread->no_cancel = 1;
173 _thr_rwl_rdlock(&_thr_atfork_lock);
175 /* Run down atfork prepare handlers. */
176 TAILQ_FOREACH_REVERSE(af, &_thr_atfork_list, atfork_head, qe) {
177 if (af->prepare != NULL)
182 * Block all signals until we reach a safe point.
184 _thr_signal_block(curthread);
185 _thr_signal_prefork();
188 * All bets are off as to what should happen soon if the parent
189 * process was not so kindly as to set up pthread fork hooks to
190 * relinquish all running threads.
192 if (_thr_isthreaded() != 0) {
194 __thr_malloc_prefork(curthread);
196 __thr_pshared_atfork_pre();
197 _rtld_atfork_pre(rtld_locks);
203 * Fork a new process.
204 * There is no easy way to pre-resolve the __sys_fork symbol
205 * without performing the fork. Use the syscall(2)
206 * indirection, the syscall symbol is resolved in
207 * _thr_rtld_init() with side-effect free call.
211 ret = syscall(SYS_fork);
214 ret = syscall(SYS_pdfork, a->fdp, a->flags);
225 curthread->cancel_pending = 0;
226 curthread->flags &= ~(THR_FLAGS_NEED_SUSPEND|THR_FLAGS_DETACHED);
229 * Thread list will be reinitialized, and later we call
230 * _libpthread_init(), it will add us back to list.
232 curthread->tlflags &= ~TLFLAGS_IN_TDLIST;
234 /* before thr_self() */
236 __thr_malloc_postfork(curthread);
238 /* child is a new kernel thread. */
239 thr_self(&curthread->tid);
241 /* clear other threads locked us. */
242 _thr_umutex_init(&curthread->lock);
243 _mutex_fork(curthread);
245 _thr_signal_postfork_child();
248 _thr_after_fork = true;
249 _rtld_atfork_post(rtld_locks);
250 _thr_after_fork = false;
251 __thr_pshared_atfork_post();
255 /* reinitalize library. */
256 _libpthread_init(curthread);
258 /* atfork is reinitialized by _libpthread_init()! */
259 _thr_rwl_rdlock(&_thr_atfork_lock);
267 /* Ready to continue, unblock signals. */
268 _thr_signal_unblock(curthread);
270 /* Run down atfork child handlers. */
271 TAILQ_FOREACH(af, &_thr_atfork_list, qe) {
272 if (af->child != NULL)
275 _thr_rwlock_unlock(&_thr_atfork_lock);
276 curthread->no_cancel = cancelsave;
281 _thr_signal_postfork();
284 __thr_malloc_postfork(curthread);
285 _rtld_atfork_post(rtld_locks);
286 __thr_pshared_atfork_post();
290 /* Ready to continue, unblock signals. */
291 _thr_signal_unblock(curthread);
293 /* Run down atfork parent handlers. */
294 TAILQ_FOREACH(af, &_thr_atfork_list, qe) {
295 if (af->parent != NULL)
299 _thr_rwlock_unlock(&_thr_atfork_lock);
300 curthread->no_cancel = cancelsave;
301 /* test async cancel */
302 if (curthread->cancel_async)
303 _thr_testcancel(curthread);
310 __weak_reference(__thr_fork, _fork);
315 struct thr_fork_args a;
318 return (thr_fork_impl(&a));
322 __thr_pdfork(int *fdp, int flags)
324 struct thr_fork_args a;
326 a.mode = MODE_PDFORK;
329 return (thr_fork_impl(&a));