Introduce pthread_timedjoin_np.
[dragonfly.git] / sys / kern / kern_fork.c
CommitLineData
984263bc
MD
1/*
2 * Copyright (c) 1982, 1986, 1989, 1991, 1993
3 * The Regents of the University of California. All rights reserved.
4 * (c) UNIX System Laboratories, Inc.
5 * All or some portions of this file are derived from material licensed
6 * to the University of California by American Telephone and Telegraph
7 * Co. or Unix System Laboratories, Inc. and are reproduced herein with
8 * the permission of UNIX System Laboratories, Inc.
9 *
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
12 * are met:
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
18 * 3. All advertising materials mentioning features or use of this software
19 * must display the following acknowledgement:
20 * This product includes software developed by the University of
21 * California, Berkeley and its contributors.
22 * 4. Neither the name of the University nor the names of its contributors
23 * may be used to endorse or promote products derived from this software
24 * without specific prior written permission.
25 *
26 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 * SUCH DAMAGE.
37 *
38 * @(#)kern_fork.c 8.6 (Berkeley) 4/8/94
5bc7cd8d 39 * $FreeBSD: src/sys/kern/kern_fork.c,v 1.72.2.14 2003/06/26 04:15:10 silby Exp $
81eea9f4 40 * $DragonFly: src/sys/kern/kern_fork.c,v 1.42 2005/10/09 21:38:04 corecode Exp $
984263bc
MD
41 */
42
43#include "opt_ktrace.h"
44
45#include <sys/param.h>
46#include <sys/systm.h>
47#include <sys/sysproto.h>
48#include <sys/filedesc.h>
49#include <sys/kernel.h>
50#include <sys/sysctl.h>
51#include <sys/malloc.h>
52#include <sys/proc.h>
53#include <sys/resourcevar.h>
54#include <sys/vnode.h>
55#include <sys/acct.h>
56#include <sys/ktrace.h>
dfc1fc13
EN
57#include <sys/unistd.h>
58#include <sys/jail.h>
59#include <sys/caps.h>
984263bc
MD
60
61#include <vm/vm.h>
62#include <sys/lock.h>
63#include <vm/pmap.h>
64#include <vm/vm_map.h>
65#include <vm/vm_extern.h>
66#include <vm/vm_zone.h>
67
68#include <sys/vmmeter.h>
69#include <sys/user.h>
e43a034f 70#include <sys/thread2.h>
984263bc
MD
71
72static MALLOC_DEFINE(M_ATFORK, "atfork", "atfork callback");
73
74/*
75 * These are the stuctures used to create a callout list for things to do
76 * when forking a process
77 */
78struct forklist {
79 forklist_fn function;
80 TAILQ_ENTRY(forklist) next;
81};
82
83TAILQ_HEAD(forklist_head, forklist);
84static struct forklist_head fork_list = TAILQ_HEAD_INITIALIZER(fork_list);
85
984263bc
MD
86int forksleep; /* Place for fork1() to sleep on. */
87
88/* ARGSUSED */
89int
41c20dac 90fork(struct fork_args *uap)
984263bc 91{
41c20dac 92 struct proc *p = curproc;
984263bc 93 struct proc *p2;
41c20dac 94 int error;
984263bc
MD
95
96 error = fork1(p, RFFDG | RFPROC, &p2);
97 if (error == 0) {
7d0bac62 98 start_forked_proc(p, p2);
c7114eea
MD
99 uap->sysmsg_fds[0] = p2->p_pid;
100 uap->sysmsg_fds[1] = 0;
984263bc
MD
101 }
102 return error;
103}
104
105/* ARGSUSED */
106int
41c20dac 107vfork(struct vfork_args *uap)
984263bc 108{
41c20dac 109 struct proc *p = curproc;
984263bc 110 struct proc *p2;
41c20dac 111 int error;
984263bc
MD
112
113 error = fork1(p, RFFDG | RFPROC | RFPPWAIT | RFMEM, &p2);
114 if (error == 0) {
7d0bac62 115 start_forked_proc(p, p2);
c7114eea
MD
116 uap->sysmsg_fds[0] = p2->p_pid;
117 uap->sysmsg_fds[1] = 0;
984263bc
MD
118 }
119 return error;
120}
121
f61c1ff1
MD
122/*
123 * Handle rforks. An rfork may (1) operate on the current process without
124 * creating a new, (2) create a new process that shared the current process's
125 * vmspace, signals, and/or descriptors, or (3) create a new process that does
126 * not share these things (normal fork).
127 *
128 * Note that we only call start_forked_proc() if a new process is actually
129 * created.
130 *
131 * rfork { int flags }
132 */
984263bc 133int
41c20dac 134rfork(struct rfork_args *uap)
984263bc 135{
41c20dac 136 struct proc *p = curproc;
984263bc 137 struct proc *p2;
41c20dac 138 int error;
984263bc 139
6654fbcb
MD
140 if ((uap->flags & RFKERNELONLY) != 0)
141 return (EINVAL);
142
984263bc
MD
143 error = fork1(p, uap->flags, &p2);
144 if (error == 0) {
f61c1ff1
MD
145 if (p2)
146 start_forked_proc(p, p2);
c7114eea
MD
147 uap->sysmsg_fds[0] = p2 ? p2->p_pid : 0;
148 uap->sysmsg_fds[1] = 0;
984263bc
MD
149 }
150 return error;
151}
152
153
154int nprocs = 1; /* process 0 */
155static int nextpid = 0;
156
157/*
158 * Random component to nextpid generation. We mix in a random factor to make
159 * it a little harder to predict. We sanity check the modulus value to avoid
160 * doing it in critical paths. Don't let it be too small or we pointlessly
161 * waste randomness entropy, and don't let it be impossibly large. Using a
162 * modulus that is too big causes a LOT more process table scans and slows
163 * down fork processing as the pidchecked caching is defeated.
164 */
165static int randompid = 0;
166
167static int
168sysctl_kern_randompid(SYSCTL_HANDLER_ARGS)
169{
170 int error, pid;
171
172 pid = randompid;
173 error = sysctl_handle_int(oidp, &pid, 0, req);
174 if (error || !req->newptr)
175 return (error);
176 if (pid < 0 || pid > PID_MAX - 100) /* out of range */
177 pid = PID_MAX - 100;
178 else if (pid < 2) /* NOP */
179 pid = 0;
180 else if (pid < 100) /* Make it reasonable */
181 pid = 100;
182 randompid = pid;
183 return (error);
184}
185
186SYSCTL_PROC(_kern, OID_AUTO, randompid, CTLTYPE_INT|CTLFLAG_RW,
187 0, 0, sysctl_kern_randompid, "I", "Random PID modulus");
188
189int
303c76d5 190fork1(struct proc *p1, int flags, struct proc **procp)
984263bc
MD
191{
192 struct proc *p2, *pptr;
193 uid_t uid;
194 struct proc *newproc;
195 int ok;
5bc7cd8d
HP
196 static int curfail = 0, pidchecked = 0;
197 static struct timeval lastfail;
984263bc
MD
198 struct forklist *ep;
199 struct filedesc_to_leader *fdtol;
200
201 if ((flags & (RFFDG|RFCFDG)) == (RFFDG|RFCFDG))
202 return (EINVAL);
203
204 /*
205 * Here we don't create a new process, but we divorce
206 * certain parts of a process from itself.
207 */
208 if ((flags & RFPROC) == 0) {
209
210 vm_fork(p1, 0, flags);
211
212 /*
213 * Close all file descriptors.
214 */
215 if (flags & RFCFDG) {
216 struct filedesc *fdtmp;
217 fdtmp = fdinit(p1);
218 fdfree(p1);
219 p1->p_fd = fdtmp;
220 }
221
222 /*
223 * Unshare file descriptors (from parent.)
224 */
225 if (flags & RFFDG) {
226 if (p1->p_fd->fd_refcnt > 1) {
227 struct filedesc *newfd;
228 newfd = fdcopy(p1);
229 fdfree(p1);
230 p1->p_fd = newfd;
231 }
232 }
233 *procp = NULL;
234 return (0);
235 }
236
237 /*
238 * Although process entries are dynamically created, we still keep
239 * a global limit on the maximum number we will create. Don't allow
240 * a nonprivileged user to use the last ten processes; don't let root
241 * exceed the limit. The variable nprocs is the current number of
242 * processes, maxproc is the limit.
243 */
41c20dac 244 uid = p1->p_ucred->cr_ruid;
984263bc 245 if ((nprocs >= maxproc - 10 && uid != 0) || nprocs >= maxproc) {
5bc7cd8d
HP
246 if (ppsratecheck(&lastfail, &curfail, 1))
247 printf("maxproc limit exceeded by uid %d, please "
248 "see tuning(7) and login.conf(5).\n", uid);
377d4740 249 tsleep(&forksleep, 0, "fork", hz / 2);
984263bc
MD
250 return (EAGAIN);
251 }
252 /*
253 * Increment the nprocs resource before blocking can occur. There
254 * are hard-limits as to the number of processes that can run.
255 */
256 nprocs++;
257
258 /*
259 * Increment the count of procs running with this uid. Don't allow
260 * a nonprivileged user to exceed their current limit.
261 */
41c20dac 262 ok = chgproccnt(p1->p_ucred->cr_ruidinfo, 1,
984263bc
MD
263 (uid != 0) ? p1->p_rlimit[RLIMIT_NPROC].rlim_cur : 0);
264 if (!ok) {
265 /*
266 * Back out the process count
267 */
268 nprocs--;
5bc7cd8d
HP
269 if (ppsratecheck(&lastfail, &curfail, 1))
270 printf("maxproc limit exceeded by uid %d, please "
271 "see tuning(7) and login.conf(5).\n", uid);
377d4740 272 tsleep(&forksleep, 0, "fork", hz / 2);
984263bc
MD
273 return (EAGAIN);
274 }
275
276 /* Allocate new proc. */
277 newproc = zalloc(proc_zone);
278
279 /*
ef09c3ed 280 * Setup linkage for kernel based threading XXX lwp
984263bc 281 */
303c76d5 282 if ((flags & RFTHREAD) != 0) {
984263bc
MD
283 newproc->p_peers = p1->p_peers;
284 p1->p_peers = newproc;
285 newproc->p_leader = p1->p_leader;
286 } else {
287 newproc->p_peers = 0;
288 newproc->p_leader = newproc;
289 }
290
291 newproc->p_wakeup = 0;
984263bc 292 newproc->p_vmspace = NULL;
81eea9f4 293 TAILQ_INIT(&newproc->p_lwp.lwp_sysmsgq);
ef09c3ed
SS
294 LIST_INIT(&newproc->p_lwps);
295
296 /* XXX lwp */
297 LIST_INSERT_HEAD(&newproc->p_lwps, &newproc->p_lwp, lwp_list);
f5329d64 298 newproc->p_lwp.lwp_proc = newproc;
ef09c3ed 299 newproc->p_lwp.lwp_tid = 0;
ac33e87f 300 newproc->p_nthreads = 1;
984263bc
MD
301
302 /*
303 * Find an unused process ID. We remember a range of unused IDs
304 * ready to use (from nextpid+1 through pidchecked-1).
305 */
306 nextpid++;
307 if (randompid)
308 nextpid += arc4random() % randompid;
309retry:
310 /*
311 * If the process ID prototype has wrapped around,
312 * restart somewhat above 0, as the low-numbered procs
313 * tend to include daemons that don't exit.
314 */
315 if (nextpid >= PID_MAX) {
316 nextpid = nextpid % PID_MAX;
317 if (nextpid < 100)
318 nextpid += 100;
319 pidchecked = 0;
320 }
321 if (nextpid >= pidchecked) {
322 int doingzomb = 0;
323
324 pidchecked = PID_MAX;
325 /*
326 * Scan the active and zombie procs to check whether this pid
327 * is in use. Remember the lowest pid that's greater
328 * than nextpid, so we can avoid checking for a while.
329 */
330 p2 = LIST_FIRST(&allproc);
331again:
332 for (; p2 != 0; p2 = LIST_NEXT(p2, p_list)) {
333 while (p2->p_pid == nextpid ||
334 p2->p_pgrp->pg_id == nextpid ||
335 p2->p_session->s_sid == nextpid) {
336 nextpid++;
337 if (nextpid >= pidchecked)
338 goto retry;
339 }
340 if (p2->p_pid > nextpid && pidchecked > p2->p_pid)
341 pidchecked = p2->p_pid;
342 if (p2->p_pgrp->pg_id > nextpid &&
343 pidchecked > p2->p_pgrp->pg_id)
344 pidchecked = p2->p_pgrp->pg_id;
345 if (p2->p_session->s_sid > nextpid &&
346 pidchecked > p2->p_session->s_sid)
347 pidchecked = p2->p_session->s_sid;
348 }
349 if (!doingzomb) {
350 doingzomb = 1;
351 p2 = LIST_FIRST(&zombproc);
352 goto again;
353 }
354 }
355
356 p2 = newproc;
357 p2->p_stat = SIDL; /* protect against others */
358 p2->p_pid = nextpid;
359 LIST_INSERT_HEAD(&allproc, p2, p_list);
360 LIST_INSERT_HEAD(PIDHASH(p2->p_pid), p2, p_hash);
361
362 /*
363 * Make a proc table entry for the new process.
364 * Start by zeroing the section of proc that is zero-initialized,
365 * then copy the section that is copied directly from the parent.
366 */
367 bzero(&p2->p_startzero,
368 (unsigned) ((caddr_t)&p2->p_endzero - (caddr_t)&p2->p_startzero));
ef09c3ed
SS
369 bzero(&p2->p_lwp.lwp_startzero,
370 (unsigned) ((caddr_t)&p2->p_lwp.lwp_endzero -
371 (caddr_t)&p2->p_lwp.lwp_startzero));
984263bc
MD
372 bcopy(&p1->p_startcopy, &p2->p_startcopy,
373 (unsigned) ((caddr_t)&p2->p_endcopy - (caddr_t)&p2->p_startcopy));
ef09c3ed
SS
374 bcopy(&p1->p_lwp.lwp_startcopy, &p2->p_lwp.lwp_startcopy,
375 (unsigned) ((caddr_t)&p2->p_lwp.lwp_endcopy -
376 (caddr_t)&p2->p_lwp.lwp_startcopy));
984263bc
MD
377
378 p2->p_aioinfo = NULL;
379
380 /*
381 * Duplicate sub-structures as needed.
382 * Increase reference counts on shared objects.
383 * The p_stats and p_sigacts substructs are set in vm_fork.
384 */
8ec60c3f 385 p2->p_flag = P_INMEM;
984263bc
MD
386 if (p1->p_flag & P_PROFIL)
387 startprofclock(p2);
dadab5e9 388 p2->p_ucred = crhold(p1->p_ucred);
984263bc 389
b40e316c 390 if (jailed(p2->p_ucred))
984263bc 391 p2->p_flag |= P_JAILED;
984263bc
MD
392
393 if (p2->p_args)
394 p2->p_args->ar_ref++;
395
396 if (flags & RFSIGSHARE) {
397 p2->p_procsig = p1->p_procsig;
398 p2->p_procsig->ps_refcnt++;
399 if (p1->p_sigacts == &p1->p_addr->u_sigacts) {
400 struct sigacts *newsigacts;
984263bc
MD
401
402 /* Create the shared sigacts structure */
403 MALLOC(newsigacts, struct sigacts *,
404 sizeof(struct sigacts), M_SUBPROC, M_WAITOK);
e43a034f 405 crit_enter();
984263bc
MD
406 /*
407 * Set p_sigacts to the new shared structure.
408 * Note that this is updating p1->p_sigacts at the
409 * same time, since p_sigacts is just a pointer to
410 * the shared p_procsig->ps_sigacts.
411 */
412 p2->p_sigacts = newsigacts;
413 bcopy(&p1->p_addr->u_sigacts, p2->p_sigacts,
414 sizeof(*p2->p_sigacts));
415 *p2->p_sigacts = p1->p_addr->u_sigacts;
e43a034f 416 crit_exit();
984263bc
MD
417 }
418 } else {
419 MALLOC(p2->p_procsig, struct procsig *, sizeof(struct procsig),
420 M_SUBPROC, M_WAITOK);
421 bcopy(p1->p_procsig, p2->p_procsig, sizeof(*p2->p_procsig));
422 p2->p_procsig->ps_refcnt = 1;
423 p2->p_sigacts = NULL; /* finished in vm_fork() */
424 }
425 if (flags & RFLINUXTHPN)
426 p2->p_sigparent = SIGUSR1;
427 else
428 p2->p_sigparent = SIGCHLD;
429
430 /* bump references to the text vnode (for procfs) */
431 p2->p_textvp = p1->p_textvp;
432 if (p2->p_textvp)
597aea93 433 vref(p2->p_textvp);
984263bc
MD
434
435 if (flags & RFCFDG) {
436 p2->p_fd = fdinit(p1);
437 fdtol = NULL;
438 } else if (flags & RFFDG) {
439 p2->p_fd = fdcopy(p1);
440 fdtol = NULL;
441 } else {
442 p2->p_fd = fdshare(p1);
443 if (p1->p_fdtol == NULL)
444 p1->p_fdtol =
445 filedesc_to_leader_alloc(NULL,
446 p1->p_leader);
447 if ((flags & RFTHREAD) != 0) {
448 /*
449 * Shared file descriptor table and
450 * shared process leaders.
451 */
452 fdtol = p1->p_fdtol;
453 fdtol->fdl_refcount++;
454 } else {
455 /*
456 * Shared file descriptor table, and
457 * different process leaders
458 */
98a7f915 459 fdtol = filedesc_to_leader_alloc(p1->p_fdtol, p2);
984263bc
MD
460 }
461 }
462 p2->p_fdtol = fdtol;
463
464 /*
465 * If p_limit is still copy-on-write, bump refcnt,
466 * otherwise get a copy that won't be modified.
467 * (If PL_SHAREMOD is clear, the structure is shared
468 * copy-on-write.)
469 */
303c76d5 470 if (p1->p_limit->p_lflags & PL_SHAREMOD) {
984263bc 471 p2->p_limit = limcopy(p1->p_limit);
303c76d5 472 } else {
984263bc
MD
473 p2->p_limit = p1->p_limit;
474 p2->p_limit->p_refcnt++;
475 }
476
477 /*
478 * Preserve some more flags in subprocess. P_PROFIL has already
479 * been preserved.
480 */
481 p2->p_flag |= p1->p_flag & (P_SUGID | P_ALTSTACK);
482 if (p1->p_session->s_ttyvp != NULL && p1->p_flag & P_CONTROLT)
483 p2->p_flag |= P_CONTROLT;
484 if (flags & RFPPWAIT)
485 p2->p_flag |= P_PPWAIT;
486
5fd012e0
MD
487 /*
488 * Once we are on a pglist we may receive signals. XXX we might
489 * race a ^C being sent to the process group by not receiving it
490 * at all prior to this line.
491 */
984263bc
MD
492 LIST_INSERT_AFTER(p1, p2, p_pglist);
493
494 /*
495 * Attach the new process to its parent.
496 *
497 * If RFNOWAIT is set, the newly created process becomes a child
498 * of init. This effectively disassociates the child from the
499 * parent.
500 */
501 if (flags & RFNOWAIT)
502 pptr = initproc;
503 else
504 pptr = p1;
505 p2->p_pptr = pptr;
506 LIST_INSERT_HEAD(&pptr->p_children, p2, p_sibling);
507 LIST_INIT(&p2->p_children);
98a7f915 508 varsymset_init(&p2->p_varsymset, &p1->p_varsymset);
8fbf9130 509 callout_init(&p2->p_ithandle);
984263bc
MD
510
511#ifdef KTRACE
512 /*
513 * Copy traceflag and tracefile if enabled. If not inherited,
514 * these were zeroed above but we still could have a trace race
515 * so make sure p2's p_tracep is NULL.
516 */
517 if ((p1->p_traceflag & KTRFAC_INHERIT) && p2->p_tracep == NULL) {
518 p2->p_traceflag = p1->p_traceflag;
519 if ((p2->p_tracep = p1->p_tracep) != NULL)
597aea93 520 vref(p2->p_tracep);
984263bc
MD
521 }
522#endif
523
524 /*
352f5709 525 * Inherit the scheduler and initialize scheduler-related fields.
dcc99b62
MD
526 * Set cpbase to the last timeout that occured (not the upcoming
527 * timeout).
a77ac49d
MD
528 */
529 p2->p_usched = p1->p_usched;
dcc99b62
MD
530 p2->p_cpbase = mycpu->gd_schedclock.time -
531 mycpu->gd_schedclock.periodic;
352f5709 532 p2->p_usched->heuristic_forking(p1, p2);
a77ac49d 533
984263bc
MD
534 /*
535 * This begins the section where we must prevent the parent
536 * from being swapped.
537 */
538 PHOLD(p1);
539
540 /*
541 * Finish creating the child process. It will return via a different
542 * execution path later. (ie: directly into user mode)
543 */
544 vm_fork(p1, p2, flags);
e30f9e2c 545 caps_fork(p1, p2, flags);
984263bc
MD
546
547 if (flags == (RFFDG | RFPROC)) {
12e4aaff
MD
548 mycpu->gd_cnt.v_forks++;
549 mycpu->gd_cnt.v_forkpages += p2->p_vmspace->vm_dsize + p2->p_vmspace->vm_ssize;
984263bc 550 } else if (flags == (RFFDG | RFPROC | RFPPWAIT | RFMEM)) {
12e4aaff
MD
551 mycpu->gd_cnt.v_vforks++;
552 mycpu->gd_cnt.v_vforkpages += p2->p_vmspace->vm_dsize + p2->p_vmspace->vm_ssize;
984263bc 553 } else if (p1 == &proc0) {
12e4aaff
MD
554 mycpu->gd_cnt.v_kthreads++;
555 mycpu->gd_cnt.v_kthreadpages += p2->p_vmspace->vm_dsize + p2->p_vmspace->vm_ssize;
984263bc 556 } else {
12e4aaff
MD
557 mycpu->gd_cnt.v_rforks++;
558 mycpu->gd_cnt.v_rforkpages += p2->p_vmspace->vm_dsize + p2->p_vmspace->vm_ssize;
984263bc
MD
559 }
560
561 /*
562 * Both processes are set up, now check if any loadable modules want
563 * to adjust anything.
564 * What if they have an error? XXX
565 */
566 TAILQ_FOREACH(ep, &fork_list, next) {
567 (*ep->function)(p1, p2, flags);
568 }
569
570 /*
a77ac49d
MD
571 * Set the start time. Note that the process is not runnable. The
572 * caller is responsible for making it runnable.
984263bc 573 */
d9fa5f67 574 microtime(&p2->p_start);
984263bc 575 p2->p_acflag = AFORK;
984263bc
MD
576
577 /*
578 * tell any interested parties about the new process
579 */
580 KNOTE(&p1->p_klist, NOTE_FORK | p2->p_pid);
581
984263bc
MD
582 /*
583 * Return child proc pointer to parent.
584 */
585 *procp = p2;
586 return (0);
587}
588
589/*
590 * The next two functionms are general routines to handle adding/deleting
591 * items on the fork callout list.
592 *
593 * at_fork():
594 * Take the arguments given and put them onto the fork callout list,
595 * However first make sure that it's not already there.
596 * Returns 0 on success or a standard error number.
597 */
984263bc 598int
303c76d5 599at_fork(forklist_fn function)
984263bc
MD
600{
601 struct forklist *ep;
602
603#ifdef INVARIANTS
604 /* let the programmer know if he's been stupid */
303c76d5 605 if (rm_at_fork(function)) {
984263bc
MD
606 printf("WARNING: fork callout entry (%p) already present\n",
607 function);
303c76d5 608 }
984263bc 609#endif
679246c3 610 ep = malloc(sizeof(*ep), M_ATFORK, M_WAITOK|M_ZERO);
984263bc
MD
611 ep->function = function;
612 TAILQ_INSERT_TAIL(&fork_list, ep, next);
613 return (0);
614}
615
616/*
617 * Scan the exit callout list for the given item and remove it..
618 * Returns the number of items removed (0 or 1)
619 */
984263bc 620int
303c76d5 621rm_at_fork(forklist_fn function)
984263bc
MD
622{
623 struct forklist *ep;
624
625 TAILQ_FOREACH(ep, &fork_list, next) {
626 if (ep->function == function) {
627 TAILQ_REMOVE(&fork_list, ep, next);
628 free(ep, M_ATFORK);
629 return(1);
630 }
631 }
632 return (0);
633}
7d0bac62
MD
634
635/*
636 * Add a forked process to the run queue after any remaining setup, such
637 * as setting the fork handler, has been completed.
638 */
7d0bac62
MD
639void
640start_forked_proc(struct proc *p1, struct proc *p2)
641{
642 /*
26a0694b
MD
643 * Move from SIDL to RUN queue, and activate the process's thread.
644 * Activation of the thread effectively makes the process "a"
645 * current process, so we do not setrunqueue().
8ec60c3f
MD
646 *
647 * YYY setrunqueue works here but we should clean up the trampoline
648 * code so we just schedule the LWKT thread and let the trampoline
649 * deal with the userland scheduler on return to userland.
7d0bac62 650 */
f61c1ff1 651 KASSERT(p2 && p2->p_stat == SIDL,
7d0bac62 652 ("cannot start forked process, bad status: %p", p2));
a77ac49d 653 p2->p_usched->resetpriority(p2);
e43a034f 654 crit_enter();
7d0bac62 655 p2->p_stat = SRUN;
a77ac49d 656 p2->p_usched->setrunqueue(p2);
e43a034f 657 crit_exit();
7d0bac62
MD
658
659 /*
660 * Now can be swapped.
661 */
662 PRELE(p1);
663
664 /*
665 * Preserve synchronization semantics of vfork. If waiting for
666 * child to exec or exit, set P_PPWAIT on child, and sleep on our
667 * proc (in case of exit).
668 */
669 while (p2->p_flag & P_PPWAIT)
377d4740 670 tsleep(p1, 0, "ppwait", 0);
7d0bac62
MD
671}
672