2 * SPDX-License-Identifier: BSD-3-Clause
4 * Copyright (c) 1982, 1986, 1989, 1991, 1993
5 * The Regents of the University of California. All rights reserved.
6 * (c) UNIX System Laboratories, Inc.
7 * All or some portions of this file are derived from material licensed
8 * to the University of California by American Telephone and Telegraph
9 * Co. or Unix System Laboratories, Inc. and are reproduced herein with
10 * the permission of UNIX System Laboratories, Inc.
12 * Redistribution and use in source and binary forms, with or without
13 * modification, are permitted provided that the following conditions
15 * 1. Redistributions of source code must retain the above copyright
16 * notice, this list of conditions and the following disclaimer.
17 * 2. Redistributions in binary form must reproduce the above copyright
18 * notice, this list of conditions and the following disclaimer in the
19 * documentation and/or other materials provided with the distribution.
20 * 3. Neither the name of the University nor the names of its contributors
21 * may be used to endorse or promote products derived from this software
22 * without specific prior written permission.
24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 * @(#)kern_fork.c 8.6 (Berkeley) 4/8/94
39 #include <sys/cdefs.h>
40 __FBSDID("$FreeBSD$");
42 #include "opt_ktrace.h"
43 #include "opt_kstack_pages.h"
45 #include <sys/param.h>
46 #include <sys/systm.h>
47 #include <sys/bitstring.h>
48 #include <sys/sysproto.h>
49 #include <sys/eventhandler.h>
50 #include <sys/fcntl.h>
51 #include <sys/filedesc.h>
53 #include <sys/kernel.h>
54 #include <sys/kthread.h>
55 #include <sys/sysctl.h>
57 #include <sys/malloc.h>
58 #include <sys/mutex.h>
61 #include <sys/procdesc.h>
62 #include <sys/ptrace.h>
63 #include <sys/racct.h>
64 #include <sys/resourcevar.h>
65 #include <sys/sched.h>
66 #include <sys/syscall.h>
67 #include <sys/vmmeter.h>
68 #include <sys/vnode.h>
71 #include <sys/ktrace.h>
72 #include <sys/unistd.h>
75 #include <sys/sysent.h>
76 #include <sys/signalvar.h>
78 #include <security/audit/audit.h>
79 #include <security/mac/mac_framework.h>
83 #include <vm/vm_map.h>
84 #include <vm/vm_extern.h>
88 #include <sys/dtrace_bsd.h>
89 dtrace_fork_func_t dtrace_fasttrap_fork;
92 SDT_PROVIDER_DECLARE(proc);
93 SDT_PROBE_DEFINE3(proc, , , create, "struct proc *", "struct proc *", "int");
95 #ifndef _SYS_SYSPROTO_H_
103 sys_fork(struct thread *td, struct fork_args *uap)
108 bzero(&fr, sizeof(fr));
109 fr.fr_flags = RFFDG | RFPROC;
111 error = fork1(td, &fr);
113 td->td_retval[0] = pid;
114 td->td_retval[1] = 0;
121 sys_pdfork(struct thread *td, struct pdfork_args *uap)
126 bzero(&fr, sizeof(fr));
127 fr.fr_flags = RFFDG | RFPROC | RFPROCDESC;
130 fr.fr_pd_flags = uap->flags;
132 * It is necessary to return fd by reference because 0 is a valid file
133 * descriptor number, and the child needs to be able to distinguish
134 * itself from the parent using the return value.
136 error = fork1(td, &fr);
138 td->td_retval[0] = pid;
139 td->td_retval[1] = 0;
140 error = copyout(&fd, uap->fdp, sizeof(fd));
147 sys_vfork(struct thread *td, struct vfork_args *uap)
152 bzero(&fr, sizeof(fr));
153 fr.fr_flags = RFFDG | RFPROC | RFPPWAIT | RFMEM;
155 error = fork1(td, &fr);
157 td->td_retval[0] = pid;
158 td->td_retval[1] = 0;
164 sys_rfork(struct thread *td, struct rfork_args *uap)
169 /* Don't allow kernel-only flags. */
170 if ((uap->flags & RFKERNELONLY) != 0)
172 /* RFSPAWN must not appear with others */
173 if ((uap->flags & RFSPAWN) != 0 && uap->flags != RFSPAWN)
176 AUDIT_ARG_FFLAGS(uap->flags);
177 bzero(&fr, sizeof(fr));
178 if ((uap->flags & RFSPAWN) != 0) {
179 fr.fr_flags = RFFDG | RFPROC | RFPPWAIT | RFMEM;
180 fr.fr_flags2 = FR2_DROPSIG_CAUGHT;
182 fr.fr_flags = uap->flags;
185 error = fork1(td, &fr);
187 td->td_retval[0] = pid;
188 td->td_retval[1] = 0;
193 int __exclusive_cache_line nprocs = 1; /* process 0 */
195 SYSCTL_INT(_kern, OID_AUTO, lastpid, CTLFLAG_RD, &lastpid, 0,
199 * Random component to lastpid generation. We mix in a random factor to make
200 * it a little harder to predict. We sanity check the modulus value to avoid
201 * doing it in critical paths. Don't let it be too small or we pointlessly
202 * waste randomness entropy, and don't let it be impossibly large. Using a
203 * modulus that is too big causes a LOT more process table scans and slows
204 * down fork processing as the pidchecked caching is defeated.
206 static int randompid = 0;
209 sysctl_kern_randompid(SYSCTL_HANDLER_ARGS)
213 error = sysctl_wire_old_buffer(req, sizeof(int));
216 sx_xlock(&allproc_lock);
218 error = sysctl_handle_int(oidp, &pid, 0, req);
219 if (error == 0 && req->newptr != NULL) {
223 /* generate a random PID modulus between 100 and 1123 */
224 randompid = 100 + arc4random() % 1024;
225 else if (pid < 0 || pid > pid_max - 100)
227 randompid = pid_max - 100;
229 /* Make it reasonable */
234 sx_xunlock(&allproc_lock);
238 SYSCTL_PROC(_kern, OID_AUTO, randompid,
239 CTLTYPE_INT | CTLFLAG_RW | CTLFLAG_MPSAFE, 0, 0,
240 sysctl_kern_randompid, "I",
241 "Random PID modulus. Special values: 0: disable, 1: choose random value");
243 extern bitstr_t proc_id_pidmap;
244 extern bitstr_t proc_id_grpidmap;
245 extern bitstr_t proc_id_sessidmap;
246 extern bitstr_t proc_id_reapmap;
249 * Find an unused process ID
251 * If RFHIGHPID is set (used during system boot), do not allocate
255 fork_findpid(int flags)
261 * Avoid calling arc4random with procid_lock held.
264 if (__predict_false(randompid))
265 random = arc4random() % randompid;
267 mtx_lock(&procid_lock);
269 trypid = lastpid + 1;
270 if (flags & RFHIGHPID) {
277 if (trypid >= pid_max)
280 bit_ffc_at(&proc_id_pidmap, trypid, pid_max, &result);
282 KASSERT(trypid != 2, ("unexpectedly ran out of IDs"));
286 if (bit_test(&proc_id_grpidmap, result) ||
287 bit_test(&proc_id_sessidmap, result) ||
288 bit_test(&proc_id_reapmap, result)) {
294 * RFHIGHPID does not mess with the lastpid counter during boot.
296 if ((flags & RFHIGHPID) == 0)
299 bit_set(&proc_id_pidmap, result);
300 mtx_unlock(&procid_lock);
306 fork_norfproc(struct thread *td, int flags)
311 KASSERT((flags & RFPROC) == 0,
312 ("fork_norfproc called with RFPROC set"));
315 if (((p1->p_flag & (P_HADTHREADS|P_SYSTEM)) == P_HADTHREADS) &&
316 (flags & (RFCFDG | RFFDG))) {
318 if (thread_single(p1, SINGLE_BOUNDARY)) {
325 error = vm_forkproc(td, NULL, NULL, NULL, flags);
330 * Close all file descriptors.
332 if (flags & RFCFDG) {
333 struct filedesc *fdtmp;
334 fdtmp = fdinit(td->td_proc->p_fd, false);
340 * Unshare file descriptors (from parent).
346 if (((p1->p_flag & (P_HADTHREADS|P_SYSTEM)) == P_HADTHREADS) &&
347 (flags & (RFCFDG | RFFDG))) {
349 thread_single_end(p1, SINGLE_BOUNDARY);
356 do_fork(struct thread *td, struct fork_req *fr, struct proc *p2, struct thread *td2,
357 struct vmspace *vm2, struct file *fp_procdesc)
359 struct proc *p1, *pptr;
361 struct filedesc_to_leader *fdtol;
362 struct sigacts *newsigacts;
367 bcopy(&p1->p_startcopy, &p2->p_startcopy,
368 __rangeof(struct proc, p_startcopy, p_endcopy));
369 pargs_hold(p2->p_args);
372 bzero(&p2->p_startzero,
373 __rangeof(struct proc, p_startzero, p_endzero));
375 /* Tell the prison that we exist. */
376 prison_proc_hold(p2->p_ucred->cr_prison);
378 p2->p_state = PRS_NEW; /* protect against others */
379 p2->p_pid = fork_findpid(fr->fr_flags);
380 AUDIT_ARG_PID(p2->p_pid);
382 sx_xlock(&allproc_lock);
383 LIST_INSERT_HEAD(&allproc, p2, p_list);
385 sx_xunlock(&allproc_lock);
387 sx_xlock(PIDHASHLOCK(p2->p_pid));
388 LIST_INSERT_HEAD(PIDHASH(p2->p_pid), p2, p_hash);
389 sx_xunlock(PIDHASHLOCK(p2->p_pid));
394 * Malloc things while we don't hold any locks.
396 if (fr->fr_flags & RFSIGSHARE)
399 newsigacts = sigacts_alloc();
404 if (fr->fr_flags & RFCFDG) {
405 fd = fdinit(p1->p_fd, false);
407 } else if (fr->fr_flags & RFFDG) {
408 fd = fdcopy(p1->p_fd);
411 fd = fdshare(p1->p_fd);
412 if (p1->p_fdtol == NULL)
413 p1->p_fdtol = filedesc_to_leader_alloc(NULL, NULL,
415 if ((fr->fr_flags & RFTHREAD) != 0) {
417 * Shared file descriptor table, and shared
421 FILEDESC_XLOCK(p1->p_fd);
422 fdtol->fdl_refcount++;
423 FILEDESC_XUNLOCK(p1->p_fd);
426 * Shared file descriptor table, and different
429 fdtol = filedesc_to_leader_alloc(p1->p_fdtol,
434 * Make a proc table entry for the new process.
435 * Start by zeroing the section of proc that is zero-initialized,
436 * then copy the section that is copied directly from the parent.
442 bzero(&td2->td_startzero,
443 __rangeof(struct thread, td_startzero, td_endzero));
445 bcopy(&td->td_startcopy, &td2->td_startcopy,
446 __rangeof(struct thread, td_startcopy, td_endcopy));
448 bcopy(&p2->p_comm, &td2->td_name, sizeof(td2->td_name));
449 td2->td_sigstk = td->td_sigstk;
450 td2->td_flags = TDF_INMEM;
451 td2->td_lend_user_pri = PRI_MAX;
455 td2->td_vnet_lpush = NULL;
459 * Allow the scheduler to initialize the child.
466 * Duplicate sub-structures as needed.
467 * Increase reference counts on shared objects.
469 p2->p_flag = P_INMEM;
470 p2->p_flag2 = p1->p_flag2 & (P2_ASLR_DISABLE | P2_ASLR_ENABLE |
471 P2_ASLR_IGNSTART | P2_NOTRACE | P2_NOTRACE_EXEC |
472 P2_PROTMAX_ENABLE | P2_PROTMAX_DISABLE | P2_TRAPCAP |
473 P2_STKGAP_DISABLE | P2_STKGAP_DISABLE_EXEC);
474 p2->p_swtick = ticks;
475 if (p1->p_flag & P_PROFIL)
478 if (fr->fr_flags & RFSIGSHARE) {
479 p2->p_sigacts = sigacts_hold(p1->p_sigacts);
481 sigacts_copy(newsigacts, p1->p_sigacts);
482 p2->p_sigacts = newsigacts;
483 if ((fr->fr_flags2 & FR2_DROPSIG_CAUGHT) != 0) {
484 mtx_lock(&p2->p_sigacts->ps_mtx);
486 mtx_unlock(&p2->p_sigacts->ps_mtx);
490 if (fr->fr_flags & RFTSIGZMB)
491 p2->p_sigparent = RFTSIGNUM(fr->fr_flags);
492 else if (fr->fr_flags & RFLINUXTHPN)
493 p2->p_sigparent = SIGUSR1;
495 p2->p_sigparent = SIGCHLD;
497 p2->p_textvp = p1->p_textvp;
501 if (p1->p_flag2 & P2_INHERIT_PROTECTED) {
502 p2->p_flag |= P_PROTECTED;
503 p2->p_flag2 |= P2_INHERIT_PROTECTED;
507 * p_limit is copy-on-write. Bump its refcount.
511 thread_cow_get_proc(td2, p2);
513 pstats_fork(p1->p_stats, p2->p_stats);
518 /* Bump references to the text vnode (for procfs). */
520 vrefact(p2->p_textvp);
523 * Set up linkage for kernel based threading.
525 if ((fr->fr_flags & RFTHREAD) != 0) {
526 mtx_lock(&ppeers_lock);
527 p2->p_peers = p1->p_peers;
529 p2->p_leader = p1->p_leader;
530 mtx_unlock(&ppeers_lock);
531 PROC_LOCK(p1->p_leader);
532 if ((p1->p_leader->p_flag & P_WEXIT) != 0) {
533 PROC_UNLOCK(p1->p_leader);
535 * The task leader is exiting, so process p1 is
536 * going to be killed shortly. Since p1 obviously
537 * isn't dead yet, we know that the leader is either
538 * sending SIGKILL's to all the processes in this
539 * task or is sleeping waiting for all the peers to
540 * exit. We let p1 complete the fork, but we need
541 * to go ahead and kill the new process p2 since
542 * the task leader may not get a chance to send
543 * SIGKILL to it. We leave it on the list so that
544 * the task leader will wait for this new process
548 kern_psignal(p2, SIGKILL);
551 PROC_UNLOCK(p1->p_leader);
557 sx_xlock(&proctree_lock);
558 PGRP_LOCK(p1->p_pgrp);
563 * Preserve some more flags in subprocess. P_PROFIL has already
566 p2->p_flag |= p1->p_flag & P_SUGID;
567 td2->td_pflags |= (td->td_pflags & (TDP_ALTSTACK |
568 TDP_SIGFASTBLOCK)) | TDP_FORKING;
569 SESS_LOCK(p1->p_session);
570 if (p1->p_session->s_ttyvp != NULL && p1->p_flag & P_CONTROLT)
571 p2->p_flag |= P_CONTROLT;
572 SESS_UNLOCK(p1->p_session);
573 if (fr->fr_flags & RFPPWAIT)
574 p2->p_flag |= P_PPWAIT;
576 p2->p_pgrp = p1->p_pgrp;
577 LIST_INSERT_AFTER(p1, p2, p_pglist);
578 PGRP_UNLOCK(p1->p_pgrp);
579 LIST_INIT(&p2->p_children);
580 LIST_INIT(&p2->p_orphans);
582 callout_init_mtx(&p2->p_itcallout, &p2->p_mtx, 0);
585 * This begins the section where we must prevent the parent
586 * from being swapped.
592 * Attach the new process to its parent.
594 * If RFNOWAIT is set, the newly created process becomes a child
595 * of init. This effectively disassociates the child from the
598 if ((fr->fr_flags & RFNOWAIT) != 0) {
602 p2->p_reaper = (p1->p_treeflag & P_TREE_REAPER) != 0 ?
607 p2->p_oppid = pptr->p_pid;
608 LIST_INSERT_HEAD(&pptr->p_children, p2, p_sibling);
609 LIST_INIT(&p2->p_reaplist);
610 LIST_INSERT_HEAD(&p2->p_reaper->p_reaplist, p2, p_reapsibling);
611 if (p2->p_reaper == p1 && p1 != initproc) {
612 p2->p_reapsubtree = p2->p_pid;
613 proc_id_set_cond(PROC_ID_REAP, p2->p_pid);
615 sx_xunlock(&proctree_lock);
617 /* Inform accounting that we have forked. */
618 p2->p_acflag = AFORK;
626 * Finish creating the child process. It will return via a different
627 * execution path later. (ie: directly into user mode)
629 vm_forkproc(td, p2, td2, vm2, fr->fr_flags);
631 if (fr->fr_flags == (RFFDG | RFPROC)) {
633 VM_CNT_ADD(v_forkpages, p2->p_vmspace->vm_dsize +
634 p2->p_vmspace->vm_ssize);
635 } else if (fr->fr_flags == (RFFDG | RFPROC | RFPPWAIT | RFMEM)) {
636 VM_CNT_INC(v_vforks);
637 VM_CNT_ADD(v_vforkpages, p2->p_vmspace->vm_dsize +
638 p2->p_vmspace->vm_ssize);
639 } else if (p1 == &proc0) {
640 VM_CNT_INC(v_kthreads);
641 VM_CNT_ADD(v_kthreadpages, p2->p_vmspace->vm_dsize +
642 p2->p_vmspace->vm_ssize);
644 VM_CNT_INC(v_rforks);
645 VM_CNT_ADD(v_rforkpages, p2->p_vmspace->vm_dsize +
646 p2->p_vmspace->vm_ssize);
650 * Associate the process descriptor with the process before anything
651 * can happen that might cause that process to need the descriptor.
652 * However, don't do this until after fork(2) can no longer fail.
654 if (fr->fr_flags & RFPROCDESC)
655 procdesc_new(p2, fr->fr_pd_flags);
658 * Both processes are set up, now check if any loadable modules want
659 * to adjust anything.
661 EVENTHANDLER_DIRECT_INVOKE(process_fork, p1, p2, fr->fr_flags);
664 * Set the child start time and mark the process as being complete.
668 microuptime(&p2->p_stats->p_start);
670 p2->p_state = PRS_NORMAL;
675 * Tell the DTrace fasttrap provider about the new process so that any
676 * tracepoints inherited from the parent can be removed. We have to do
677 * this only after p_state is PRS_NORMAL since the fasttrap module will
678 * use pfind() later on.
680 if ((fr->fr_flags & RFMEM) == 0 && dtrace_fasttrap_fork)
681 dtrace_fasttrap_fork(p1, p2);
683 if (fr->fr_flags & RFPPWAIT) {
684 td->td_pflags |= TDP_RFPPWAIT;
685 td->td_rfppwait_p = p2;
686 td->td_dbgflags |= TDB_VFORK;
691 * Tell any interested parties about the new process.
693 knote_fork(p1->p_klist, p2->p_pid);
696 * Now can be swapped.
700 SDT_PROBE3(proc, , , create, p2, p1, fr->fr_flags);
702 if (fr->fr_flags & RFPROCDESC) {
703 procdesc_finit(p2->p_procdesc, fp_procdesc);
704 fdrop(fp_procdesc, td);
708 * Speculative check for PTRACE_FORK. PTRACE_FORK is not
709 * synced with forks in progress so it is OK if we miss it
712 if ((p1->p_ptevents & PTRACE_FORK) != 0) {
713 sx_xlock(&proctree_lock);
717 * p1->p_ptevents & p1->p_pptr are protected by both
718 * process and proctree locks for modifications,
719 * so owning proctree_lock allows the race-free read.
721 if ((p1->p_ptevents & PTRACE_FORK) != 0) {
723 * Arrange for debugger to receive the fork event.
725 * We can report PL_FLAG_FORKED regardless of
726 * P_FOLLOWFORK settings, but it does not make a sense
729 td->td_dbgflags |= TDB_FORK;
730 td->td_dbg_forked = p2->p_pid;
731 td2->td_dbgflags |= TDB_STOPATFORK;
732 proc_set_traced(p2, true);
734 "do_fork: attaching to new child pid %d: oppid %d",
735 p2->p_pid, p2->p_oppid);
736 proc_reparent(p2, p1->p_pptr, false);
739 sx_xunlock(&proctree_lock);
742 racct_proc_fork_done(p2);
744 if ((fr->fr_flags & RFSTOPPED) == 0) {
745 if (fr->fr_pidp != NULL)
746 *fr->fr_pidp = p2->p_pid;
748 * If RFSTOPPED not requested, make child runnable and
753 sched_add(td2, SRQ_BORING);
760 fork_rfppwait(struct thread *td)
764 MPASS(td->td_pflags & TDP_RFPPWAIT);
768 * Preserve synchronization semantics of vfork. If
769 * waiting for child to exec or exit, fork set
770 * P_PPWAIT on child, and there we sleep on our proc
773 * Do it after the ptracestop() above is finished, to
774 * not block our debugger until child execs or exits
775 * to finish vfork wait.
777 td->td_pflags &= ~TDP_RFPPWAIT;
778 p2 = td->td_rfppwait_p;
781 while (p2->p_flag & P_PPWAIT) {
783 if (thread_suspend_check_needed()) {
785 thread_suspend_check(0);
791 cv_timedwait(&p2->p_pwait, &p2->p_mtx, hz);
795 if (td->td_dbgflags & TDB_VFORK) {
797 if (p->p_ptevents & PTRACE_VFORK)
798 ptracestop(td, SIGTRAP, NULL);
799 td->td_dbgflags &= ~TDB_VFORK;
805 fork1(struct thread *td, struct fork_req *fr)
807 struct proc *p1, *newproc;
811 struct file *fp_procdesc;
812 vm_ooffset_t mem_charged;
813 int error, nprocs_new;
815 static struct timeval lastfail;
818 flags = fr->fr_flags;
819 pages = fr->fr_pages;
821 if ((flags & RFSTOPPED) != 0)
822 MPASS(fr->fr_procp != NULL && fr->fr_pidp == NULL);
824 MPASS(fr->fr_procp == NULL);
826 /* Check for the undefined or unimplemented flags. */
827 if ((flags & ~(RFFLAGS | RFTSIGFLAGS(RFTSIGMASK))) != 0)
830 /* Signal value requires RFTSIGZMB. */
831 if ((flags & RFTSIGFLAGS(RFTSIGMASK)) != 0 && (flags & RFTSIGZMB) == 0)
834 /* Can't copy and clear. */
835 if ((flags & (RFFDG|RFCFDG)) == (RFFDG|RFCFDG))
838 /* Check the validity of the signal number. */
839 if ((flags & RFTSIGZMB) != 0 && (u_int)RFTSIGNUM(flags) > _SIG_MAXSIG)
842 if ((flags & RFPROCDESC) != 0) {
843 /* Can't not create a process yet get a process descriptor. */
844 if ((flags & RFPROC) == 0)
847 /* Must provide a place to put a procdesc if creating one. */
848 if (fr->fr_pd_fd == NULL)
851 /* Check if we are using supported flags. */
852 if ((fr->fr_pd_flags & ~PD_ALLOWED_AT_FORK) != 0)
859 * Here we don't create a new process, but we divorce
860 * certain parts of a process from itself.
862 if ((flags & RFPROC) == 0) {
863 if (fr->fr_procp != NULL)
864 *fr->fr_procp = NULL;
865 else if (fr->fr_pidp != NULL)
867 return (fork_norfproc(td, flags));
875 * Increment the nprocs resource before allocations occur.
876 * Although process entries are dynamically created, we still
877 * keep a global limit on the maximum number we will
878 * create. There are hard-limits as to the number of processes
879 * that can run, established by the KVA and memory usage for
882 * Don't allow a nonprivileged user to use the last ten
883 * processes; don't let root exceed the limit.
885 nprocs_new = atomic_fetchadd_int(&nprocs, 1) + 1;
886 if (nprocs_new >= maxproc - 10) {
887 if (priv_check_cred(td->td_ucred, PRIV_MAXPROC) != 0 ||
888 nprocs_new >= maxproc) {
890 sx_xlock(&allproc_lock);
891 if (ppsratecheck(&lastfail, &curfail, 1)) {
892 printf("maxproc limit exceeded by uid %u "
893 "(pid %d); see tuning(7) and "
895 td->td_ucred->cr_ruid, p1->p_pid);
897 sx_xunlock(&allproc_lock);
903 * If required, create a process descriptor in the parent first; we
904 * will abandon it if something goes wrong. We don't finit() until
907 if (flags & RFPROCDESC) {
908 error = procdesc_falloc(td, &fp_procdesc, fr->fr_pd_fd,
909 fr->fr_pd_flags, fr->fr_pd_fcaps);
916 pages = kstack_pages;
917 /* Allocate new proc. */
918 newproc = uma_zalloc(proc_zone, M_WAITOK);
919 td2 = FIRST_THREAD_IN_PROC(newproc);
921 td2 = thread_alloc(pages);
926 proc_linkup(newproc, td2);
928 if (td2->td_kstack == 0 || td2->td_kstack_pages != pages) {
929 if (td2->td_kstack != 0)
930 vm_thread_dispose(td2);
931 if (!thread_alloc_stack(td2, pages)) {
938 if ((flags & RFMEM) == 0) {
939 vm2 = vmspace_fork(p1->p_vmspace, &mem_charged);
944 if (!swap_reserve(mem_charged)) {
946 * The swap reservation failed. The accounting
947 * from the entries of the copied vm2 will be
948 * subtracted in vmspace_free(), so force the
951 swap_reserve_force(mem_charged);
959 * XXX: This is ugly; when we copy resource usage, we need to bump
960 * per-cred resource counters.
962 proc_set_cred_init(newproc, crhold(td->td_ucred));
965 * Initialize resource accounting for the child process.
967 error = racct_proc_fork(p1, newproc);
974 mac_proc_init(newproc);
976 newproc->p_klist = knlist_alloc(&newproc->p_mtx);
977 STAILQ_INIT(&newproc->p_ktr);
980 * Increment the count of procs running with this uid. Don't allow
981 * a nonprivileged user to exceed their current limit.
984 if (!chgproccnt(cred->cr_ruidinfo, 1, lim_cur(td, RLIMIT_NPROC))) {
985 if (priv_check_cred(cred, PRIV_PROC_LIMIT) != 0)
987 chgproccnt(cred->cr_ruidinfo, 1, 0);
990 do_fork(td, fr, newproc, td2, vm2, fp_procdesc);
995 mac_proc_destroy(newproc);
997 racct_proc_exit(newproc);
999 crfree(newproc->p_ucred);
1000 newproc->p_ucred = NULL;
1004 uma_zfree(proc_zone, newproc);
1005 if ((flags & RFPROCDESC) != 0 && fp_procdesc != NULL) {
1006 fdclose(td, fp_procdesc, *fr->fr_pd_fd);
1007 fdrop(fp_procdesc, td);
1009 atomic_add_int(&nprocs, -1);
1010 pause("fork", hz / 2);
1015 * Handle the return of a child process from fork1(). This function
1016 * is called from the MD fork_trampoline() entry point.
1019 fork_exit(void (*callout)(void *, struct trapframe *), void *arg,
1020 struct trapframe *frame)
1028 KASSERT(p->p_state == PRS_NORMAL, ("executing process is still new"));
1030 CTR4(KTR_PROC, "fork_exit: new thread %p (td_sched %p, pid %d, %s)",
1031 td, td_get_sched(td), p->p_pid, td->td_name);
1033 sched_fork_exit(td);
1035 * Processes normally resume in mi_switch() after being
1036 * cpu_switch()'ed to, but when children start up they arrive here
1037 * instead, so we must do much the same things as mi_switch() would.
1039 if ((dtd = PCPU_GET(deadthread))) {
1040 PCPU_SET(deadthread, NULL);
1046 * cpu_fork_kthread_handler intercepts this function call to
1047 * have this call a non-return function to stay in kernel mode.
1048 * initproc has its own fork handler, but it does return.
1050 KASSERT(callout != NULL, ("NULL callout in fork_exit"));
1051 callout(arg, frame);
1054 * Check if a kernel thread misbehaved and returned from its main
1057 if (p->p_flag & P_KPROC) {
1058 printf("Kernel thread \"%s\" (pid %d) exited prematurely.\n",
1059 td->td_name, p->p_pid);
1062 mtx_assert(&Giant, MA_NOTOWNED);
1064 if (p->p_sysent->sv_schedtail != NULL)
1065 (p->p_sysent->sv_schedtail)(td);
1066 td->td_pflags &= ~TDP_FORKING;
1070 * Simplified back end of syscall(), used when returning from fork()
1071 * directly into user mode. This function is passed in to fork_exit()
1072 * as the first parameter and is called when returning to a new
1076 fork_return(struct thread *td, struct trapframe *frame)
1081 if (td->td_dbgflags & TDB_STOPATFORK) {
1083 if ((p->p_flag & P_TRACED) != 0) {
1085 * Inform the debugger if one is still present.
1087 td->td_dbgflags |= TDB_CHILD | TDB_SCX | TDB_FSTP;
1088 ptracestop(td, SIGSTOP, NULL);
1089 td->td_dbgflags &= ~(TDB_CHILD | TDB_SCX);
1092 * ... otherwise clear the request.
1094 td->td_dbgflags &= ~TDB_STOPATFORK;
1097 } else if (p->p_flag & P_TRACED || td->td_dbgflags & TDB_BORN) {
1099 * This is the start of a new thread in a traced
1100 * process. Report a system call exit event.
1103 td->td_dbgflags |= TDB_SCX;
1104 if ((p->p_ptevents & PTRACE_SCX) != 0 ||
1105 (td->td_dbgflags & TDB_BORN) != 0)
1106 ptracestop(td, SIGTRAP, NULL);
1107 td->td_dbgflags &= ~(TDB_SCX | TDB_BORN);
1114 if (KTRPOINT(td, KTR_SYSRET))
1115 ktrsysret(SYS_fork, 0, 0);