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_exit.c 8.7 (Berkeley) 2/12/94
39 #include <sys/cdefs.h>
40 __FBSDID("$FreeBSD$");
42 #include "opt_ktrace.h"
44 #include <sys/param.h>
45 #include <sys/systm.h>
46 #include <sys/sysproto.h>
47 #include <sys/capsicum.h>
48 #include <sys/eventhandler.h>
49 #include <sys/kernel.h>
51 #include <sys/malloc.h>
53 #include <sys/mutex.h>
55 #include <sys/procdesc.h>
56 #include <sys/pioctl.h>
60 #include <sys/vmmeter.h>
61 #include <sys/vnode.h>
62 #include <sys/racct.h>
63 #include <sys/resourcevar.h>
65 #include <sys/signalvar.h>
66 #include <sys/sched.h>
68 #include <sys/syscallsubr.h>
69 #include <sys/syslog.h>
70 #include <sys/ptrace.h>
71 #include <sys/acct.h> /* for acct_process() function prototype */
72 #include <sys/filedesc.h>
78 #include <sys/ktrace.h>
81 #include <security/audit/audit.h>
82 #include <security/mac/mac_framework.h>
85 #include <vm/vm_extern.h>
86 #include <vm/vm_param.h>
88 #include <vm/vm_map.h>
89 #include <vm/vm_page.h>
93 #include <sys/dtrace_bsd.h>
94 dtrace_execexit_func_t dtrace_fasttrap_exit;
97 SDT_PROVIDER_DECLARE(proc);
98 SDT_PROBE_DEFINE1(proc, , , exit, "int");
100 /* Hook for NFS teardown procedure. */
101 void (*nlminfo_release_p)(struct proc *p);
104 proc_realparent(struct proc *child)
106 struct proc *p, *parent;
108 sx_assert(&proctree_lock, SX_LOCKED);
109 if ((child->p_treeflag & P_TREE_ORPHANED) == 0)
110 return (child->p_pptr->p_pid == child->p_oppid ?
111 child->p_pptr : initproc);
112 for (p = child; (p->p_treeflag & P_TREE_FIRST_ORPHAN) == 0;) {
113 /* Cannot use LIST_PREV(), since the list head is not known. */
114 p = __containerof(p->p_orphan.le_prev, struct proc,
116 KASSERT((p->p_treeflag & P_TREE_ORPHANED) != 0,
117 ("missing P_ORPHAN %p", p));
119 parent = __containerof(p->p_orphan.le_prev, struct proc,
125 reaper_abandon_children(struct proc *p, bool exiting)
127 struct proc *p1, *p2, *ptmp;
129 sx_assert(&proctree_lock, SX_LOCKED);
130 KASSERT(p != initproc, ("reaper_abandon_children for initproc"));
131 if ((p->p_treeflag & P_TREE_REAPER) == 0)
134 LIST_FOREACH_SAFE(p2, &p->p_reaplist, p_reapsibling, ptmp) {
135 LIST_REMOVE(p2, p_reapsibling);
137 p2->p_reapsubtree = p->p_reapsubtree;
138 LIST_INSERT_HEAD(&p1->p_reaplist, p2, p_reapsibling);
139 if (exiting && p2->p_pptr == p) {
141 proc_reparent(p2, p1, true);
145 KASSERT(LIST_EMPTY(&p->p_reaplist), ("p_reaplist not empty"));
146 p->p_treeflag &= ~P_TREE_REAPER;
150 reaper_clear(struct proc *p)
155 sx_assert(&proctree_lock, SX_LOCKED);
156 LIST_REMOVE(p, p_reapsibling);
157 if (p->p_reapsubtree == 1)
160 LIST_FOREACH(p1, &p->p_reaper->p_reaplist, p_reapsibling) {
161 if (p1->p_reapsubtree == p->p_reapsubtree) {
167 proc_id_clear(PROC_ID_REAP, p->p_reapsubtree);
171 proc_clear_orphan(struct proc *p)
175 sx_assert(&proctree_lock, SA_XLOCKED);
176 if ((p->p_treeflag & P_TREE_ORPHANED) == 0)
178 if ((p->p_treeflag & P_TREE_FIRST_ORPHAN) != 0) {
179 p1 = LIST_NEXT(p, p_orphan);
181 p1->p_treeflag |= P_TREE_FIRST_ORPHAN;
182 p->p_treeflag &= ~P_TREE_FIRST_ORPHAN;
184 LIST_REMOVE(p, p_orphan);
185 p->p_treeflag &= ~P_TREE_ORPHANED;
189 * exit -- death of process.
192 sys_sys_exit(struct thread *td, struct sys_exit_args *uap)
195 exit1(td, uap->rval, 0);
200 * Exit: deallocate address space and other resources, change proc state to
201 * zombie, and unlink proc from allproc and parent's lists. Save exit status
202 * and rusage for wait(). Check for child processes and orphan them.
205 exit1(struct thread *td, int rval, int signo)
207 struct proc *p, *nq, *q, *t;
209 ksiginfo_t *ksi, *ksi1;
212 mtx_assert(&Giant, MA_NOTOWNED);
213 KASSERT(rval == 0 || signo == 0, ("exit1 rv %d sig %d", rval, signo));
217 * XXX in case we're rebooting we just let init die in order to
218 * work around an unsolved stack overflow seen very late during
219 * shutdown on sparc64 when the gmirror worker process exists.
221 if (p == initproc && rebooting == 0) {
222 printf("init died (signal %d, exit %d)\n", signo, rval);
223 panic("Going nowhere without my init!");
227 * Deref SU mp, since the thread does not return to userspace.
229 td_softdep_cleanup(td);
232 * MUST abort all other threads before proceeding past here.
236 * First check if some other thread or external request got
237 * here before us. If so, act appropriately: exit or suspend.
238 * We must ensure that stop requests are handled before we set
241 thread_suspend_check(0);
242 while (p->p_flag & P_HADTHREADS) {
244 * Kill off the other threads. This requires
245 * some co-operation from other parts of the kernel
246 * so it may not be instantaneous. With this state set
247 * any thread entering the kernel from userspace will
248 * thread_exit() in trap(). Any thread attempting to
249 * sleep will return immediately with EINTR or EWOULDBLOCK
250 * which will hopefully force them to back out to userland
251 * freeing resources as they go. Any thread attempting
252 * to return to userland will thread_exit() from userret().
253 * thread_exit() will unsuspend us when the last of the
254 * other threads exits.
255 * If there is already a thread singler after resumption,
256 * calling thread_single will fail; in that case, we just
257 * re-check all suspension request, the thread should
258 * either be suspended there or exit.
260 if (!thread_single(p, SINGLE_EXIT))
262 * All other activity in this process is now
263 * stopped. Threading support has been turned
268 * Recheck for new stop or suspend requests which
269 * might appear while process lock was dropped in
272 thread_suspend_check(0);
274 KASSERT(p->p_numthreads == 1,
275 ("exit1: proc %p exiting with %d threads", p, p->p_numthreads));
276 racct_sub(p, RACCT_NTHR, 1);
278 /* Let event handler change exit status */
283 * Wakeup anyone in procfs' PIOCWAIT. They should have a hold
284 * on our vmspace, so we should block below until they have
285 * released their reference to us. Note that if they have
286 * requested S_EXIT stops we will block here until they ack
289 _STOPEVENT(p, S_EXIT, 0);
292 * Ignore any pending request to stop due to a stop signal.
293 * Once P_WEXIT is set, future requests will be ignored as
296 p->p_flag &= ~P_STOPPED_SIG;
297 KASSERT(!P_SHOULDSTOP(p), ("exiting process is stopped"));
300 * Note that we are exiting and do another wakeup of anyone in
301 * PIOCWAIT in case they aren't listening for S_EXIT stops or
302 * decided to wait again after we told them we are exiting.
304 p->p_flag |= P_WEXIT;
308 * Wait for any processes that have a hold on our vmspace to
309 * release their reference.
311 while (p->p_lock > 0)
312 msleep(&p->p_lock, &p->p_mtx, PWAIT, "exithold", 0);
315 /* Drain the limit callout while we don't have the proc locked */
316 callout_drain(&p->p_limco);
320 * The Sun BSM exit token contains two components: an exit status as
321 * passed to exit(), and a return value to indicate what sort of exit
322 * it was. The exit status is WEXITSTATUS(rv), but it's not clear
323 * what the return value is.
325 AUDIT_ARG_EXIT(rval, 0);
326 AUDIT_SYSCALL_EXIT(0, td);
329 /* Are we a task leader with peers? */
330 if (p->p_peers != NULL && p == p->p_leader) {
331 mtx_lock(&ppeers_lock);
335 kern_psignal(q, SIGKILL);
339 while (p->p_peers != NULL)
340 msleep(p, &ppeers_lock, PWAIT, "exit1", 0);
341 mtx_unlock(&ppeers_lock);
345 * Check if any loadable modules need anything done at process exit.
346 * E.g. SYSV IPC stuff.
347 * Event handler could change exit status.
348 * XXX what if one of these generates an error?
350 EVENTHANDLER_DIRECT_INVOKE(process_exit, p);
353 * If parent is waiting for us to exit or exec,
354 * P_PPWAIT is set; we will wakeup the parent below.
361 * Stop the real interval timer. If the handler is currently
362 * executing, prevent it from rearming itself and let it finish.
364 if (timevalisset(&p->p_realtimer.it_value) &&
365 _callout_stop_safe(&p->p_itcallout, CS_EXECUTING, NULL) == 0) {
366 timevalclear(&p->p_realtimer.it_interval);
367 msleep(&p->p_itcallout, &p->p_mtx, PWAIT, "ritwait", 0);
368 KASSERT(!timevalisset(&p->p_realtimer.it_value),
369 ("realtime timer is still armed"));
374 umtx_thread_exit(td);
377 * Reset any sigio structures pointing to us as a result of
378 * F_SETOWN with our pid.
380 funsetownlst(&p->p_sigiolst);
383 * If this process has an nlminfo data area (for lockd), release it
385 if (nlminfo_release_p != NULL && p->p_nlminfo != NULL)
386 (*nlminfo_release_p)(p);
389 * Close open files and release open-file table.
395 * If this thread tickled GEOM, we need to wait for the giggling to
396 * stop before we return to userland
398 if (td->td_pflags & TDP_GEOM)
402 * Remove ourself from our leader's peer list and wake our leader.
404 if (p->p_leader->p_peers != NULL) {
405 mtx_lock(&ppeers_lock);
406 if (p->p_leader->p_peers != NULL) {
408 while (q->p_peers != p)
410 q->p_peers = p->p_peers;
413 mtx_unlock(&ppeers_lock);
418 (void)acct_process(td);
424 * Release reference to text vnode
426 if (p->p_textvp != NULL) {
432 * Release our limits structure.
434 lim_free(p->p_limit);
440 * Call machine-dependent code to release any
441 * machine-dependent resources other than the address space.
442 * The address space is released by "vmspace_exitfree(p)" in
447 WITNESS_WARN(WARN_PANIC, NULL, "process (pid %d) exiting", p->p_pid);
450 * Remove from allproc. It still sits in the hash.
452 sx_xlock(&allproc_lock);
453 LIST_REMOVE(p, p_list);
454 sx_xunlock(&allproc_lock);
456 sx_xlock(&proctree_lock);
458 p->p_flag &= ~(P_TRACED | P_PPWAIT | P_PPTRACE);
462 * Reparent all children processes:
463 * - traced ones to the original parent (or init if we are that parent)
466 q = LIST_FIRST(&p->p_children);
467 if (q != NULL) /* only need this if any child is S_ZOMB */
469 for (; q != NULL; q = nq) {
470 nq = LIST_NEXT(q, p_sibling);
471 ksi = ksiginfo_alloc(TRUE);
473 q->p_sigparent = SIGCHLD;
475 if ((q->p_flag & P_TRACED) == 0) {
476 proc_reparent(q, q->p_reaper, true);
477 if (q->p_state == PRS_ZOMBIE) {
479 * Inform reaper about the reparented
480 * zombie, since wait(2) has something
481 * new to report. Guarantee queueing
482 * of the SIGCHLD signal, similar to
483 * the _exit() behaviour, by providing
484 * our ksiginfo. Ksi is freed by the
487 if (q->p_ksi == NULL) {
490 ksiginfo_copy(q->p_ksi, ksi);
491 ksi->ksi_flags |= KSI_INS;
495 PROC_LOCK(q->p_reaper);
496 pksignal(q->p_reaper, SIGCHLD, ksi1);
497 PROC_UNLOCK(q->p_reaper);
498 } else if (q->p_pdeathsig > 0) {
500 * The child asked to received a signal
503 kern_psignal(q, q->p_pdeathsig);
507 * Traced processes are killed since their existence
508 * means someone is screwing up.
510 t = proc_realparent(q);
512 proc_reparent(q, q->p_reaper, true);
515 proc_reparent(q, t, true);
519 * Since q was found on our children list, the
520 * proc_reparent() call moved q to the orphan
521 * list due to present P_TRACED flag. Clear
522 * orphan link for q now while q is locked.
524 proc_clear_orphan(q);
525 q->p_flag &= ~(P_TRACED | P_STOPPED_TRACE);
526 q->p_flag2 &= ~P2_PTRACE_FSTP;
528 FOREACH_THREAD_IN_PROC(q, tdt) {
529 tdt->td_dbgflags &= ~(TDB_SUSPEND | TDB_XSIG |
532 kern_psignal(q, SIGKILL);
540 * Also get rid of our orphans.
542 while ((q = LIST_FIRST(&p->p_orphans)) != NULL) {
544 KASSERT(q->p_oppid == p->p_pid,
545 ("orphan %p of %p has unexpected oppid %d", q, p,
547 q->p_oppid = q->p_reaper->p_pid;
550 * If we are the real parent of this process
551 * but it has been reparented to a debugger, then
552 * check if it asked for a signal when we exit.
554 if (q->p_pdeathsig > 0)
555 kern_psignal(q, q->p_pdeathsig);
556 CTR2(KTR_PTRACE, "exit: pid %d, clearing orphan %d", p->p_pid,
558 proc_clear_orphan(q);
563 if (SDT_PROBES_ENABLED()) {
564 int reason = CLD_EXITED;
565 if (WCOREDUMP(signo))
567 else if (WIFSIGNALED(signo))
569 SDT_PROBE1(proc, , , exit, reason);
573 /* Save exit status. */
579 * Tell the DTrace fasttrap provider about the exit if it
580 * has declared an interest.
582 if (dtrace_fasttrap_exit)
583 dtrace_fasttrap_exit(p);
587 * Notify interested parties of our demise.
589 KNOTE_LOCKED(p->p_klist, NOTE_EXIT);
592 * If this is a process with a descriptor, we may not need to deliver
593 * a signal to the parent. proctree_lock is held over
594 * procdesc_exit() to serialize concurrent calls to close() and
598 if (p->p_procdesc == NULL || procdesc_exit(p)) {
600 * Notify parent that we're gone. If parent has the
601 * PS_NOCLDWAIT flag set, or if the handler is set to SIG_IGN,
602 * notify process 1 instead (and hope it will handle this
605 PROC_LOCK(p->p_pptr);
606 mtx_lock(&p->p_pptr->p_sigacts->ps_mtx);
607 if (p->p_pptr->p_sigacts->ps_flag &
608 (PS_NOCLDWAIT | PS_CLDSIGIGN)) {
611 mtx_unlock(&p->p_pptr->p_sigacts->ps_mtx);
614 proc_reparent(p, p->p_reaper, true);
615 p->p_sigparent = SIGCHLD;
616 PROC_LOCK(p->p_pptr);
619 * Notify parent, so in case he was wait(2)ing or
620 * executing waitpid(2) with our pid, he will
625 mtx_unlock(&p->p_pptr->p_sigacts->ps_mtx);
627 if (p->p_pptr == p->p_reaper || p->p_pptr == initproc) {
629 } else if (p->p_sigparent != 0) {
630 if (p->p_sigparent == SIGCHLD) {
632 } else { /* LINUX thread */
637 PROC_LOCK(p->p_pptr);
638 sx_xunlock(&proctree_lock);
640 if (signal_parent == 1) {
642 } else if (signal_parent == 2) {
643 kern_psignal(p->p_pptr, p->p_sigparent);
646 /* Tell the prison that we are gone. */
647 prison_proc_free(p->p_ucred->cr_prison);
650 * The state PRS_ZOMBIE prevents other proesses from sending
651 * signal to the process, to avoid memory leak, we free memory
652 * for signal queue at the time when the state is set.
654 sigqueue_flush(&p->p_sigqueue);
655 sigqueue_flush(&td->td_sigqueue);
658 * We have to wait until after acquiring all locks before
659 * changing p_state. We need to avoid all possible context
660 * switches (including ones from blocking on a mutex) while
661 * marked as a zombie. We also have to set the zombie state
662 * before we release the parent process' proc lock to avoid
663 * a lost wakeup. So, we first call wakeup, then we grab the
664 * sched lock, update the state, and release the parent process'
668 cv_broadcast(&p->p_pwait);
669 sched_exit(p->p_pptr, td);
671 p->p_state = PRS_ZOMBIE;
672 PROC_UNLOCK(p->p_pptr);
675 * Save our children's rusage information in our exit rusage.
678 ruadd(&p->p_ru, &p->p_rux, &p->p_stats->p_cru, &p->p_crux);
682 * Make sure the scheduler takes this thread out of its tables etc.
683 * This will also release this thread's reference to the ucred.
684 * Other thread parts to release include pcb bits and such.
690 #ifndef _SYS_SYSPROTO_H_
699 sys_abort2(struct thread *td, struct abort2_args *uap)
701 struct proc *p = td->td_proc;
707 * Do it right now so we can log either proper call of abort2(), or
708 * note, that invalid argument was passed. 512 is big enough to
709 * handle 16 arguments' descriptions with additional comments.
711 sb = sbuf_new(NULL, NULL, 512, SBUF_FIXEDLEN);
713 sbuf_printf(sb, "%s(pid %d uid %d) aborted: ",
714 p->p_comm, p->p_pid, td->td_ucred->cr_uid);
716 * Since we can't return from abort2(), send SIGKILL in cases, where
717 * abort2() was called improperly
720 /* Prevent from DoSes from user-space. */
721 if (uap->nargs < 0 || uap->nargs > 16)
723 if (uap->nargs > 0) {
724 if (uap->args == NULL)
726 error = copyin(uap->args, uargs, uap->nargs * sizeof(void *));
731 * Limit size of 'reason' string to 128. Will fit even when
732 * maximal number of arguments was chosen to be logged.
734 if (uap->why != NULL) {
735 error = sbuf_copyin(sb, uap->why, 128);
739 sbuf_printf(sb, "(null)");
741 if (uap->nargs > 0) {
742 sbuf_printf(sb, "(");
743 for (i = 0;i < uap->nargs; i++)
744 sbuf_printf(sb, "%s%p", i == 0 ? "" : ", ", uargs[i]);
745 sbuf_printf(sb, ")");
748 * Final stage: arguments were proper, string has been
749 * successfully copied from userspace, and copying pointers
750 * from user-space succeed.
754 if (sig == SIGKILL) {
756 sbuf_printf(sb, " (Reason text inaccessible)");
760 log(LOG_INFO, "%s", sbuf_data(sb));
769 * The dirty work is handled by kern_wait().
772 owait(struct thread *td, struct owait_args *uap __unused)
776 error = kern_wait(td, WAIT_ANY, &status, 0, NULL);
778 td->td_retval[1] = status;
781 #endif /* COMPAT_43 */
784 * The dirty work is handled by kern_wait().
787 sys_wait4(struct thread *td, struct wait4_args *uap)
789 struct rusage ru, *rup;
792 if (uap->rusage != NULL)
796 error = kern_wait(td, uap->pid, &status, uap->options, rup);
797 if (uap->status != NULL && error == 0 && td->td_retval[0] != 0)
798 error = copyout(&status, uap->status, sizeof(status));
799 if (uap->rusage != NULL && error == 0 && td->td_retval[0] != 0)
800 error = copyout(&ru, uap->rusage, sizeof(struct rusage));
805 sys_wait6(struct thread *td, struct wait6_args *uap)
807 struct __wrusage wru, *wrup;
813 idtype = uap->idtype;
816 if (uap->wrusage != NULL)
821 if (uap->info != NULL) {
823 bzero(sip, sizeof(*sip));
828 * We expect all callers of wait6() to know about WEXITED and
831 error = kern_wait6(td, idtype, id, &status, uap->options, wrup, sip);
833 if (uap->status != NULL && error == 0 && td->td_retval[0] != 0)
834 error = copyout(&status, uap->status, sizeof(status));
835 if (uap->wrusage != NULL && error == 0 && td->td_retval[0] != 0)
836 error = copyout(&wru, uap->wrusage, sizeof(wru));
837 if (uap->info != NULL && error == 0)
838 error = copyout(&si, uap->info, sizeof(si));
843 * Reap the remains of a zombie process and optionally return status and
844 * rusage. Asserts and will release both the proctree_lock and the process
845 * lock as part of its work.
848 proc_reap(struct thread *td, struct proc *p, int *status, int options)
852 sx_assert(&proctree_lock, SA_XLOCKED);
853 PROC_LOCK_ASSERT(p, MA_OWNED);
854 KASSERT(p->p_state == PRS_ZOMBIE, ("proc_reap: !PRS_ZOMBIE"));
856 mtx_spin_wait_unlocked(&p->p_slock);
861 *status = KW_EXITCODE(p->p_xexit, p->p_xsig);
862 if (options & WNOWAIT) {
864 * Only poll, returning the status. Caller does not wish to
865 * release the proc struct just yet.
868 sx_xunlock(&proctree_lock);
873 sigqueue_take(p->p_ksi);
877 * If we got the child via a ptrace 'attach', we need to give it back
880 if (p->p_oppid != p->p_pptr->p_pid) {
882 t = proc_realparent(p);
886 "wait: traced child %d moved back to parent %d", p->p_pid,
888 proc_reparent(p, t, false);
890 pksignal(t, SIGCHLD, p->p_ksi);
892 cv_broadcast(&p->p_pwait);
894 sx_xunlock(&proctree_lock);
900 * Remove other references to this process to ensure we have an
901 * exclusive reference.
903 sx_xlock(PIDHASHLOCK(p->p_pid));
904 LIST_REMOVE(p, p_hash);
905 sx_xunlock(PIDHASHLOCK(p->p_pid));
906 LIST_REMOVE(p, p_sibling);
907 reaper_abandon_children(p, true);
910 proc_clear_orphan(p);
913 if (p->p_procdesc != NULL)
915 sx_xunlock(&proctree_lock);
917 proc_id_clear(PROC_ID_PID, p->p_pid);
920 knlist_detach(p->p_klist);
925 * Removal from allproc list and process group list paired with
926 * PROC_LOCK which was executed during that time should guarantee
927 * nothing can reach this process anymore. As such further locking
930 p->p_xexit = p->p_xsig = 0; /* XXX: why? */
933 ruadd(&q->p_stats->p_cru, &q->p_crux, &p->p_ru, &p->p_rux);
937 * Decrement the count of procs running with this uid.
939 (void)chgproccnt(p->p_ucred->cr_ruidinfo, -1, 0);
942 * Destroy resource accounting information associated with the process.
947 racct_sub(p, RACCT_NPROC, 1);
954 * Free credentials, arguments, and sigacts.
957 proc_set_cred(p, NULL);
958 pargs_drop(p->p_args);
960 sigacts_free(p->p_sigacts);
964 * Do any thread-system specific cleanups.
969 * Give vm and machine-dependent layer a chance to free anything that
970 * cpu_exit couldn't release while still running in process context.
977 KASSERT(FIRST_THREAD_IN_PROC(p),
978 ("proc_reap: no residual thread!"));
979 uma_zfree(proc_zone, p);
980 atomic_add_int(&nprocs, -1);
984 proc_to_reap(struct thread *td, struct proc *p, idtype_t idtype, id_t id,
985 int *status, int options, struct __wrusage *wrusage, siginfo_t *siginfo,
990 sx_assert(&proctree_lock, SA_XLOCKED);
996 if (p->p_procdesc != NULL) {
1002 if (p->p_pid != (pid_t)id) {
1008 if (p->p_pgid != (pid_t)id) {
1014 if (p->p_session->s_sid != (pid_t)id) {
1020 if (p->p_ucred->cr_uid != (uid_t)id) {
1026 if (p->p_ucred->cr_gid != (gid_t)id) {
1032 if (p->p_ucred->cr_prison->pr_id != (int)id) {
1038 * It seems that the thread structures get zeroed out
1039 * at process exit. This makes it impossible to
1040 * support P_SETID, P_CID or P_CPUID.
1047 if (p_canwait(td, p)) {
1052 if (((options & WEXITED) == 0) && (p->p_state == PRS_ZOMBIE)) {
1058 * This special case handles a kthread spawned by linux_clone
1059 * (see linux_misc.c). The linux_wait4 and linux_waitpid
1060 * functions need to be able to distinguish between waiting
1061 * on a process and waiting on a thread. It is a thread if
1062 * p_sigparent is not SIGCHLD, and the WLINUXCLONE option
1063 * signifies we want to wait for threads and not processes.
1065 if ((p->p_sigparent != SIGCHLD) ^
1066 ((options & WLINUXCLONE) != 0)) {
1071 if (siginfo != NULL) {
1072 bzero(siginfo, sizeof(*siginfo));
1073 siginfo->si_errno = 0;
1076 * SUSv4 requires that the si_signo value is always
1077 * SIGCHLD. Obey it despite the rfork(2) interface
1078 * allows to request other signal for child exit
1081 siginfo->si_signo = SIGCHLD;
1084 * This is still a rough estimate. We will fix the
1085 * cases TRAPPED, STOPPED, and CONTINUED later.
1087 if (WCOREDUMP(p->p_xsig)) {
1088 siginfo->si_code = CLD_DUMPED;
1089 siginfo->si_status = WTERMSIG(p->p_xsig);
1090 } else if (WIFSIGNALED(p->p_xsig)) {
1091 siginfo->si_code = CLD_KILLED;
1092 siginfo->si_status = WTERMSIG(p->p_xsig);
1094 siginfo->si_code = CLD_EXITED;
1095 siginfo->si_status = p->p_xexit;
1098 siginfo->si_pid = p->p_pid;
1099 siginfo->si_uid = p->p_ucred->cr_uid;
1102 * The si_addr field would be useful additional
1103 * detail, but apparently the PC value may be lost
1104 * when we reach this point. bzero() above sets
1105 * siginfo->si_addr to NULL.
1110 * There should be no reason to limit resources usage info to
1111 * exited processes only. A snapshot about any resources used
1112 * by a stopped process may be exactly what is needed.
1114 if (wrusage != NULL) {
1115 rup = &wrusage->wru_self;
1118 calcru(p, &rup->ru_utime, &rup->ru_stime);
1121 rup = &wrusage->wru_children;
1122 *rup = p->p_stats->p_cru;
1123 calccru(p, &rup->ru_utime, &rup->ru_stime);
1126 if (p->p_state == PRS_ZOMBIE && !check_only) {
1127 proc_reap(td, p, status, options);
1134 kern_wait(struct thread *td, pid_t pid, int *status, int options,
1135 struct rusage *rusage)
1137 struct __wrusage wru, *wrup;
1143 * Translate the special pid values into the (idtype, pid)
1144 * pair for kern_wait6. The WAIT_MYPGRP case is handled by
1145 * kern_wait6() on its own.
1147 if (pid == WAIT_ANY) {
1150 } else if (pid < 0) {
1164 * For backward compatibility we implicitly add flags WEXITED
1165 * and WTRAPPED here.
1167 options |= WEXITED | WTRAPPED;
1168 ret = kern_wait6(td, idtype, id, status, options, wrup, NULL);
1170 *rusage = wru.wru_self;
1175 report_alive_proc(struct thread *td, struct proc *p, siginfo_t *siginfo,
1176 int *status, int options, int si_code)
1180 PROC_LOCK_ASSERT(p, MA_OWNED);
1181 sx_assert(&proctree_lock, SA_XLOCKED);
1182 MPASS(si_code == CLD_TRAPPED || si_code == CLD_STOPPED ||
1183 si_code == CLD_CONTINUED);
1185 cont = si_code == CLD_CONTINUED;
1186 if ((options & WNOWAIT) == 0) {
1188 p->p_flag &= ~P_CONTINUED;
1190 p->p_flag |= P_WAITED;
1191 PROC_LOCK(td->td_proc);
1192 sigqueue_take(p->p_ksi);
1193 PROC_UNLOCK(td->td_proc);
1195 sx_xunlock(&proctree_lock);
1196 if (siginfo != NULL) {
1197 siginfo->si_code = si_code;
1198 siginfo->si_status = cont ? SIGCONT : p->p_xsig;
1201 *status = cont ? SIGCONT : W_STOPCODE(p->p_xsig);
1203 td->td_retval[0] = p->p_pid;
1207 kern_wait6(struct thread *td, idtype_t idtype, id_t id, int *status,
1208 int options, struct __wrusage *wrusage, siginfo_t *siginfo)
1212 int error, nfound, ret;
1215 AUDIT_ARG_VALUE((int)idtype); /* XXX - This is likely wrong! */
1216 AUDIT_ARG_PID((pid_t)id); /* XXX - This may be wrong! */
1217 AUDIT_ARG_VALUE(options);
1221 if ((pid_t)id == WAIT_MYPGRP && (idtype == P_PID || idtype == P_PGID)) {
1223 id = (id_t)q->p_pgid;
1228 /* If we don't know the option, just return. */
1229 if ((options & ~(WUNTRACED | WNOHANG | WCONTINUED | WNOWAIT |
1230 WEXITED | WTRAPPED | WLINUXCLONE)) != 0)
1232 if ((options & (WEXITED | WUNTRACED | WCONTINUED | WTRAPPED)) == 0) {
1234 * We will be unable to find any matching processes,
1235 * because there are no known events to look for.
1236 * Prefer to return error instead of blocking
1243 if (q->p_flag & P_STATCHILD) {
1245 q->p_flag &= ~P_STATCHILD;
1248 sx_xlock(&proctree_lock);
1251 LIST_FOREACH(p, &q->p_children, p_sibling) {
1253 ret = proc_to_reap(td, p, idtype, id, status, options,
1254 wrusage, siginfo, 0);
1257 else if (ret != 1) {
1258 td->td_retval[0] = pid;
1263 PROC_LOCK_ASSERT(p, MA_OWNED);
1265 if ((options & WTRAPPED) != 0 &&
1266 (p->p_flag & P_TRACED) != 0) {
1269 ((p->p_flag & (P_STOPPED_TRACE | P_STOPPED_SIG)) &&
1270 p->p_suspcount == p->p_numthreads &&
1271 (p->p_flag & P_WAITED) == 0);
1275 "wait: returning trapped pid %d status %#x "
1276 "(xstat %d) xthread %d",
1277 p->p_pid, W_STOPCODE(p->p_xsig), p->p_xsig,
1278 p->p_xthread != NULL ?
1279 p->p_xthread->td_tid : -1);
1280 report_alive_proc(td, p, siginfo, status,
1281 options, CLD_TRAPPED);
1285 if ((options & WUNTRACED) != 0 &&
1286 (p->p_flag & P_STOPPED_SIG) != 0) {
1288 report = (p->p_suspcount == p->p_numthreads &&
1289 ((p->p_flag & P_WAITED) == 0));
1292 report_alive_proc(td, p, siginfo, status,
1293 options, CLD_STOPPED);
1297 if ((options & WCONTINUED) != 0 &&
1298 (p->p_flag & P_CONTINUED) != 0) {
1299 report_alive_proc(td, p, siginfo, status, options,
1307 * Look in the orphans list too, to allow the parent to
1308 * collect it's child exit status even if child is being
1311 * Debugger detaches from the parent upon successful
1312 * switch-over from parent to child. At this point due to
1313 * re-parenting the parent loses the child to debugger and a
1314 * wait4(2) call would report that it has no children to wait
1315 * for. By maintaining a list of orphans we allow the parent
1316 * to successfully wait until the child becomes a zombie.
1319 LIST_FOREACH(p, &q->p_orphans, p_orphan) {
1320 ret = proc_to_reap(td, p, idtype, id, NULL, options,
1323 KASSERT(ret != -1, ("reaped an orphan (pid %d)",
1324 (int)td->td_retval[0]));
1332 sx_xunlock(&proctree_lock);
1335 if (options & WNOHANG) {
1336 sx_xunlock(&proctree_lock);
1337 td->td_retval[0] = 0;
1341 if (q->p_flag & P_STATCHILD) {
1342 q->p_flag &= ~P_STATCHILD;
1346 sx_xunlock(&proctree_lock);
1347 error = msleep(q, &q->p_mtx, PWAIT | PCATCH | PDROP, "wait", 0);
1354 proc_add_orphan(struct proc *child, struct proc *parent)
1357 sx_assert(&proctree_lock, SX_XLOCKED);
1358 KASSERT((child->p_flag & P_TRACED) != 0,
1359 ("proc_add_orphan: not traced"));
1361 if (LIST_EMPTY(&parent->p_orphans)) {
1362 child->p_treeflag |= P_TREE_FIRST_ORPHAN;
1363 LIST_INSERT_HEAD(&parent->p_orphans, child, p_orphan);
1365 LIST_INSERT_AFTER(LIST_FIRST(&parent->p_orphans),
1368 child->p_treeflag |= P_TREE_ORPHANED;
1372 * Make process 'parent' the new parent of process 'child'.
1373 * Must be called with an exclusive hold of proctree lock.
1376 proc_reparent(struct proc *child, struct proc *parent, bool set_oppid)
1379 sx_assert(&proctree_lock, SX_XLOCKED);
1380 PROC_LOCK_ASSERT(child, MA_OWNED);
1381 if (child->p_pptr == parent)
1384 PROC_LOCK(child->p_pptr);
1385 sigqueue_take(child->p_ksi);
1386 PROC_UNLOCK(child->p_pptr);
1387 LIST_REMOVE(child, p_sibling);
1388 LIST_INSERT_HEAD(&parent->p_children, child, p_sibling);
1390 proc_clear_orphan(child);
1391 if ((child->p_flag & P_TRACED) != 0) {
1392 proc_add_orphan(child, child->p_pptr);
1395 child->p_pptr = parent;
1397 child->p_oppid = parent->p_pid;