xref: /freebsd/sys/kern/kern_exit.c (revision 63cbe8d1d95f97e93929ec66f1138693d08dd9f6)
1 /*-
2  * SPDX-License-Identifier: BSD-3-Clause
3  *
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.
11  *
12  * Redistribution and use in source and binary forms, with or without
13  * modification, are permitted provided that the following conditions
14  * are met:
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.
23  *
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
34  * SUCH DAMAGE.
35  *
36  *	@(#)kern_exit.c	8.7 (Berkeley) 2/12/94
37  */
38 
39 #include <sys/cdefs.h>
40 __FBSDID("$FreeBSD$");
41 
42 #include "opt_ktrace.h"
43 
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>
50 #include <sys/malloc.h>
51 #include <sys/lock.h>
52 #include <sys/mutex.h>
53 #include <sys/proc.h>
54 #include <sys/procdesc.h>
55 #include <sys/pioctl.h>
56 #include <sys/jail.h>
57 #include <sys/tty.h>
58 #include <sys/wait.h>
59 #include <sys/vmmeter.h>
60 #include <sys/vnode.h>
61 #include <sys/racct.h>
62 #include <sys/resourcevar.h>
63 #include <sys/sbuf.h>
64 #include <sys/signalvar.h>
65 #include <sys/sched.h>
66 #include <sys/sx.h>
67 #include <sys/syscallsubr.h>
68 #include <sys/syslog.h>
69 #include <sys/ptrace.h>
70 #include <sys/acct.h>		/* for acct_process() function prototype */
71 #include <sys/filedesc.h>
72 #include <sys/sdt.h>
73 #include <sys/shm.h>
74 #include <sys/sem.h>
75 #include <sys/umtx.h>
76 #ifdef KTRACE
77 #include <sys/ktrace.h>
78 #endif
79 
80 #include <security/audit/audit.h>
81 #include <security/mac/mac_framework.h>
82 
83 #include <vm/vm.h>
84 #include <vm/vm_extern.h>
85 #include <vm/vm_param.h>
86 #include <vm/pmap.h>
87 #include <vm/vm_map.h>
88 #include <vm/vm_page.h>
89 #include <vm/uma.h>
90 
91 #ifdef KDTRACE_HOOKS
92 #include <sys/dtrace_bsd.h>
93 dtrace_execexit_func_t	dtrace_fasttrap_exit;
94 #endif
95 
96 SDT_PROVIDER_DECLARE(proc);
97 SDT_PROBE_DEFINE1(proc, , , exit, "int");
98 
99 /* Hook for NFS teardown procedure. */
100 void (*nlminfo_release_p)(struct proc *p);
101 
102 EVENTHANDLER_LIST_DECLARE(process_exit);
103 
104 struct proc *
105 proc_realparent(struct proc *child)
106 {
107 	struct proc *p, *parent;
108 
109 	sx_assert(&proctree_lock, SX_LOCKED);
110 	if ((child->p_treeflag & P_TREE_ORPHANED) == 0)
111 		return (child->p_pptr->p_pid == child->p_oppid ?
112 			    child->p_pptr : initproc);
113 	for (p = child; (p->p_treeflag & P_TREE_FIRST_ORPHAN) == 0;) {
114 		/* Cannot use LIST_PREV(), since the list head is not known. */
115 		p = __containerof(p->p_orphan.le_prev, struct proc,
116 		    p_orphan.le_next);
117 		KASSERT((p->p_treeflag & P_TREE_ORPHANED) != 0,
118 		    ("missing P_ORPHAN %p", p));
119 	}
120 	parent = __containerof(p->p_orphan.le_prev, struct proc,
121 	    p_orphans.lh_first);
122 	return (parent);
123 }
124 
125 void
126 reaper_abandon_children(struct proc *p, bool exiting)
127 {
128 	struct proc *p1, *p2, *ptmp;
129 
130 	sx_assert(&proctree_lock, SX_LOCKED);
131 	KASSERT(p != initproc, ("reaper_abandon_children for initproc"));
132 	if ((p->p_treeflag & P_TREE_REAPER) == 0)
133 		return;
134 	p1 = p->p_reaper;
135 	LIST_FOREACH_SAFE(p2, &p->p_reaplist, p_reapsibling, ptmp) {
136 		LIST_REMOVE(p2, p_reapsibling);
137 		p2->p_reaper = p1;
138 		p2->p_reapsubtree = p->p_reapsubtree;
139 		LIST_INSERT_HEAD(&p1->p_reaplist, p2, p_reapsibling);
140 		if (exiting && p2->p_pptr == p) {
141 			PROC_LOCK(p2);
142 			proc_reparent(p2, p1, true);
143 			PROC_UNLOCK(p2);
144 		}
145 	}
146 	KASSERT(LIST_EMPTY(&p->p_reaplist), ("p_reaplist not empty"));
147 	p->p_treeflag &= ~P_TREE_REAPER;
148 }
149 
150 static void
151 clear_orphan(struct proc *p)
152 {
153 	struct proc *p1;
154 
155 	sx_assert(&proctree_lock, SA_XLOCKED);
156 	if ((p->p_treeflag & P_TREE_ORPHANED) == 0)
157 		return;
158 	if ((p->p_treeflag & P_TREE_FIRST_ORPHAN) != 0) {
159 		p1 = LIST_NEXT(p, p_orphan);
160 		if (p1 != NULL)
161 			p1->p_treeflag |= P_TREE_FIRST_ORPHAN;
162 		p->p_treeflag &= ~P_TREE_FIRST_ORPHAN;
163 	}
164 	LIST_REMOVE(p, p_orphan);
165 	p->p_treeflag &= ~P_TREE_ORPHANED;
166 }
167 
168 /*
169  * exit -- death of process.
170  */
171 void
172 sys_sys_exit(struct thread *td, struct sys_exit_args *uap)
173 {
174 
175 	exit1(td, uap->rval, 0);
176 	/* NOTREACHED */
177 }
178 
179 /*
180  * Exit: deallocate address space and other resources, change proc state to
181  * zombie, and unlink proc from allproc and parent's lists.  Save exit status
182  * and rusage for wait().  Check for child processes and orphan them.
183  */
184 void
185 exit1(struct thread *td, int rval, int signo)
186 {
187 	struct proc *p, *nq, *q, *t;
188 	struct thread *tdt;
189 	ksiginfo_t *ksi, *ksi1;
190 	int signal_parent;
191 
192 	mtx_assert(&Giant, MA_NOTOWNED);
193 	KASSERT(rval == 0 || signo == 0, ("exit1 rv %d sig %d", rval, signo));
194 
195 	p = td->td_proc;
196 	/*
197 	 * XXX in case we're rebooting we just let init die in order to
198 	 * work around an unsolved stack overflow seen very late during
199 	 * shutdown on sparc64 when the gmirror worker process exists.
200 	 */
201 	if (p == initproc && rebooting == 0) {
202 		printf("init died (signal %d, exit %d)\n", signo, rval);
203 		panic("Going nowhere without my init!");
204 	}
205 
206 	/*
207 	 * Deref SU mp, since the thread does not return to userspace.
208 	 */
209 	td_softdep_cleanup(td);
210 
211 	/*
212 	 * MUST abort all other threads before proceeding past here.
213 	 */
214 	PROC_LOCK(p);
215 	/*
216 	 * First check if some other thread or external request got
217 	 * here before us.  If so, act appropriately: exit or suspend.
218 	 * We must ensure that stop requests are handled before we set
219 	 * P_WEXIT.
220 	 */
221 	thread_suspend_check(0);
222 	while (p->p_flag & P_HADTHREADS) {
223 		/*
224 		 * Kill off the other threads. This requires
225 		 * some co-operation from other parts of the kernel
226 		 * so it may not be instantaneous.  With this state set
227 		 * any thread entering the kernel from userspace will
228 		 * thread_exit() in trap().  Any thread attempting to
229 		 * sleep will return immediately with EINTR or EWOULDBLOCK
230 		 * which will hopefully force them to back out to userland
231 		 * freeing resources as they go.  Any thread attempting
232 		 * to return to userland will thread_exit() from userret().
233 		 * thread_exit() will unsuspend us when the last of the
234 		 * other threads exits.
235 		 * If there is already a thread singler after resumption,
236 		 * calling thread_single will fail; in that case, we just
237 		 * re-check all suspension request, the thread should
238 		 * either be suspended there or exit.
239 		 */
240 		if (!thread_single(p, SINGLE_EXIT))
241 			/*
242 			 * All other activity in this process is now
243 			 * stopped.  Threading support has been turned
244 			 * off.
245 			 */
246 			break;
247 		/*
248 		 * Recheck for new stop or suspend requests which
249 		 * might appear while process lock was dropped in
250 		 * thread_single().
251 		 */
252 		thread_suspend_check(0);
253 	}
254 	KASSERT(p->p_numthreads == 1,
255 	    ("exit1: proc %p exiting with %d threads", p, p->p_numthreads));
256 	racct_sub(p, RACCT_NTHR, 1);
257 
258 	/* Let event handler change exit status */
259 	p->p_xexit = rval;
260 	p->p_xsig = signo;
261 
262 	/*
263 	 * Wakeup anyone in procfs' PIOCWAIT.  They should have a hold
264 	 * on our vmspace, so we should block below until they have
265 	 * released their reference to us.  Note that if they have
266 	 * requested S_EXIT stops we will block here until they ack
267 	 * via PIOCCONT.
268 	 */
269 	_STOPEVENT(p, S_EXIT, 0);
270 
271 	/*
272 	 * Ignore any pending request to stop due to a stop signal.
273 	 * Once P_WEXIT is set, future requests will be ignored as
274 	 * well.
275 	 */
276 	p->p_flag &= ~P_STOPPED_SIG;
277 	KASSERT(!P_SHOULDSTOP(p), ("exiting process is stopped"));
278 
279 	/*
280 	 * Note that we are exiting and do another wakeup of anyone in
281 	 * PIOCWAIT in case they aren't listening for S_EXIT stops or
282 	 * decided to wait again after we told them we are exiting.
283 	 */
284 	p->p_flag |= P_WEXIT;
285 	wakeup(&p->p_stype);
286 
287 	/*
288 	 * Wait for any processes that have a hold on our vmspace to
289 	 * release their reference.
290 	 */
291 	while (p->p_lock > 0)
292 		msleep(&p->p_lock, &p->p_mtx, PWAIT, "exithold", 0);
293 
294 	PROC_UNLOCK(p);
295 	/* Drain the limit callout while we don't have the proc locked */
296 	callout_drain(&p->p_limco);
297 
298 #ifdef AUDIT
299 	/*
300 	 * The Sun BSM exit token contains two components: an exit status as
301 	 * passed to exit(), and a return value to indicate what sort of exit
302 	 * it was.  The exit status is WEXITSTATUS(rv), but it's not clear
303 	 * what the return value is.
304 	 */
305 	AUDIT_ARG_EXIT(rval, 0);
306 	AUDIT_SYSCALL_EXIT(0, td);
307 #endif
308 
309 	/* Are we a task leader with peers? */
310 	if (p->p_peers != NULL && p == p->p_leader) {
311 		mtx_lock(&ppeers_lock);
312 		q = p->p_peers;
313 		while (q != NULL) {
314 			PROC_LOCK(q);
315 			kern_psignal(q, SIGKILL);
316 			PROC_UNLOCK(q);
317 			q = q->p_peers;
318 		}
319 		while (p->p_peers != NULL)
320 			msleep(p, &ppeers_lock, PWAIT, "exit1", 0);
321 		mtx_unlock(&ppeers_lock);
322 	}
323 
324 	/*
325 	 * Check if any loadable modules need anything done at process exit.
326 	 * E.g. SYSV IPC stuff.
327 	 * Event handler could change exit status.
328 	 * XXX what if one of these generates an error?
329 	 */
330 	EVENTHANDLER_DIRECT_INVOKE(process_exit, p);
331 
332 	/*
333 	 * If parent is waiting for us to exit or exec,
334 	 * P_PPWAIT is set; we will wakeup the parent below.
335 	 */
336 	PROC_LOCK(p);
337 	stopprofclock(p);
338 	p->p_flag &= ~(P_TRACED | P_PPWAIT | P_PPTRACE);
339 	p->p_ptevents = 0;
340 
341 	/*
342 	 * Stop the real interval timer.  If the handler is currently
343 	 * executing, prevent it from rearming itself and let it finish.
344 	 */
345 	if (timevalisset(&p->p_realtimer.it_value) &&
346 	    _callout_stop_safe(&p->p_itcallout, CS_EXECUTING, NULL) == 0) {
347 		timevalclear(&p->p_realtimer.it_interval);
348 		msleep(&p->p_itcallout, &p->p_mtx, PWAIT, "ritwait", 0);
349 		KASSERT(!timevalisset(&p->p_realtimer.it_value),
350 		    ("realtime timer is still armed"));
351 	}
352 
353 	PROC_UNLOCK(p);
354 
355 	umtx_thread_exit(td);
356 
357 	/*
358 	 * Reset any sigio structures pointing to us as a result of
359 	 * F_SETOWN with our pid.
360 	 */
361 	funsetownlst(&p->p_sigiolst);
362 
363 	/*
364 	 * If this process has an nlminfo data area (for lockd), release it
365 	 */
366 	if (nlminfo_release_p != NULL && p->p_nlminfo != NULL)
367 		(*nlminfo_release_p)(p);
368 
369 	/*
370 	 * Close open files and release open-file table.
371 	 * This may block!
372 	 */
373 	fdescfree(td);
374 
375 	/*
376 	 * If this thread tickled GEOM, we need to wait for the giggling to
377 	 * stop before we return to userland
378 	 */
379 	if (td->td_pflags & TDP_GEOM)
380 		g_waitidle();
381 
382 	/*
383 	 * Remove ourself from our leader's peer list and wake our leader.
384 	 */
385 	if (p->p_leader->p_peers != NULL) {
386 		mtx_lock(&ppeers_lock);
387 		if (p->p_leader->p_peers != NULL) {
388 			q = p->p_leader;
389 			while (q->p_peers != p)
390 				q = q->p_peers;
391 			q->p_peers = p->p_peers;
392 			wakeup(p->p_leader);
393 		}
394 		mtx_unlock(&ppeers_lock);
395 	}
396 
397 	vmspace_exit(td);
398 	killjobc();
399 	(void)acct_process(td);
400 
401 #ifdef KTRACE
402 	ktrprocexit(td);
403 #endif
404 	/*
405 	 * Release reference to text vnode
406 	 */
407 	if (p->p_textvp != NULL) {
408 		vrele(p->p_textvp);
409 		p->p_textvp = NULL;
410 	}
411 
412 	/*
413 	 * Release our limits structure.
414 	 */
415 	lim_free(p->p_limit);
416 	p->p_limit = NULL;
417 
418 	tidhash_remove(td);
419 
420 	/*
421 	 * Call machine-dependent code to release any
422 	 * machine-dependent resources other than the address space.
423 	 * The address space is released by "vmspace_exitfree(p)" in
424 	 * vm_waitproc().
425 	 */
426 	cpu_exit(td);
427 
428 	WITNESS_WARN(WARN_PANIC, NULL, "process (pid %d) exiting", p->p_pid);
429 
430 	sx_xlock(&proctree_lock);
431 	/*
432 	 * Move proc from allproc queue to zombproc.
433 	 */
434 	sx_xlock(&allproc_lock);
435 	LIST_REMOVE(p, p_list);
436 	LIST_INSERT_HEAD(&zombproc, p, p_list);
437 	sx_xunlock(&allproc_lock);
438 
439 	/*
440 	 * Reparent all children processes:
441 	 * - traced ones to the original parent (or init if we are that parent)
442 	 * - the rest to init
443 	 */
444 	q = LIST_FIRST(&p->p_children);
445 	if (q != NULL)		/* only need this if any child is S_ZOMB */
446 		wakeup(q->p_reaper);
447 	for (; q != NULL; q = nq) {
448 		nq = LIST_NEXT(q, p_sibling);
449 		ksi = ksiginfo_alloc(TRUE);
450 		PROC_LOCK(q);
451 		q->p_sigparent = SIGCHLD;
452 
453 		if (!(q->p_flag & P_TRACED)) {
454 			proc_reparent(q, q->p_reaper, true);
455 			if (q->p_state == PRS_ZOMBIE) {
456 				/*
457 				 * Inform reaper about the reparented
458 				 * zombie, since wait(2) has something
459 				 * new to report.  Guarantee queueing
460 				 * of the SIGCHLD signal, similar to
461 				 * the _exit() behaviour, by providing
462 				 * our ksiginfo.  Ksi is freed by the
463 				 * signal delivery.
464 				 */
465 				if (q->p_ksi == NULL) {
466 					ksi1 = NULL;
467 				} else {
468 					ksiginfo_copy(q->p_ksi, ksi);
469 					ksi->ksi_flags |= KSI_INS;
470 					ksi1 = ksi;
471 					ksi = NULL;
472 				}
473 				PROC_LOCK(q->p_reaper);
474 				pksignal(q->p_reaper, SIGCHLD, ksi1);
475 				PROC_UNLOCK(q->p_reaper);
476 			} else if (q->p_pdeathsig > 0) {
477 				/*
478 				 * The child asked to received a signal
479 				 * when we exit.
480 				 */
481 				kern_psignal(q, q->p_pdeathsig);
482 			}
483 		} else {
484 			/*
485 			 * Traced processes are killed since their existence
486 			 * means someone is screwing up.
487 			 */
488 			t = proc_realparent(q);
489 			if (t == p) {
490 				proc_reparent(q, q->p_reaper, true);
491 			} else {
492 				PROC_LOCK(t);
493 				proc_reparent(q, t, true);
494 				PROC_UNLOCK(t);
495 			}
496 			/*
497 			 * Since q was found on our children list, the
498 			 * proc_reparent() call moved q to the orphan
499 			 * list due to present P_TRACED flag. Clear
500 			 * orphan link for q now while q is locked.
501 			 */
502 			clear_orphan(q);
503 			q->p_flag &= ~(P_TRACED | P_STOPPED_TRACE);
504 			q->p_flag2 &= ~P2_PTRACE_FSTP;
505 			q->p_ptevents = 0;
506 			FOREACH_THREAD_IN_PROC(q, tdt) {
507 				tdt->td_dbgflags &= ~(TDB_SUSPEND | TDB_XSIG |
508 				    TDB_FSTP);
509 			}
510 			kern_psignal(q, SIGKILL);
511 		}
512 		PROC_UNLOCK(q);
513 		if (ksi != NULL)
514 			ksiginfo_free(ksi);
515 	}
516 
517 	/*
518 	 * Also get rid of our orphans.
519 	 */
520 	while ((q = LIST_FIRST(&p->p_orphans)) != NULL) {
521 		PROC_LOCK(q);
522 		/*
523 		 * If we are the real parent of this process
524 		 * but it has been reparented to a debugger, then
525 		 * check if it asked for a signal when we exit.
526 		 */
527 		if (q->p_pdeathsig > 0)
528 			kern_psignal(q, q->p_pdeathsig);
529 		CTR2(KTR_PTRACE, "exit: pid %d, clearing orphan %d", p->p_pid,
530 		    q->p_pid);
531 		clear_orphan(q);
532 		PROC_UNLOCK(q);
533 	}
534 
535 	/* Save exit status. */
536 	PROC_LOCK(p);
537 	p->p_xthread = td;
538 
539 #ifdef KDTRACE_HOOKS
540 	/*
541 	 * Tell the DTrace fasttrap provider about the exit if it
542 	 * has declared an interest.
543 	 */
544 	if (dtrace_fasttrap_exit)
545 		dtrace_fasttrap_exit(p);
546 #endif
547 
548 	/*
549 	 * Notify interested parties of our demise.
550 	 */
551 	KNOTE_LOCKED(p->p_klist, NOTE_EXIT);
552 
553 #ifdef KDTRACE_HOOKS
554 	int reason = CLD_EXITED;
555 	if (WCOREDUMP(signo))
556 		reason = CLD_DUMPED;
557 	else if (WIFSIGNALED(signo))
558 		reason = CLD_KILLED;
559 	SDT_PROBE1(proc, , , exit, reason);
560 #endif
561 
562 	/*
563 	 * If this is a process with a descriptor, we may not need to deliver
564 	 * a signal to the parent.  proctree_lock is held over
565 	 * procdesc_exit() to serialize concurrent calls to close() and
566 	 * exit().
567 	 */
568 	signal_parent = 0;
569 	if (p->p_procdesc == NULL || procdesc_exit(p)) {
570 		/*
571 		 * Notify parent that we're gone.  If parent has the
572 		 * PS_NOCLDWAIT flag set, or if the handler is set to SIG_IGN,
573 		 * notify process 1 instead (and hope it will handle this
574 		 * situation).
575 		 */
576 		PROC_LOCK(p->p_pptr);
577 		mtx_lock(&p->p_pptr->p_sigacts->ps_mtx);
578 		if (p->p_pptr->p_sigacts->ps_flag &
579 		    (PS_NOCLDWAIT | PS_CLDSIGIGN)) {
580 			struct proc *pp;
581 
582 			mtx_unlock(&p->p_pptr->p_sigacts->ps_mtx);
583 			pp = p->p_pptr;
584 			PROC_UNLOCK(pp);
585 			proc_reparent(p, p->p_reaper, true);
586 			p->p_sigparent = SIGCHLD;
587 			PROC_LOCK(p->p_pptr);
588 
589 			/*
590 			 * Notify parent, so in case he was wait(2)ing or
591 			 * executing waitpid(2) with our pid, he will
592 			 * continue.
593 			 */
594 			wakeup(pp);
595 		} else
596 			mtx_unlock(&p->p_pptr->p_sigacts->ps_mtx);
597 
598 		if (p->p_pptr == p->p_reaper || p->p_pptr == initproc) {
599 			signal_parent = 1;
600 		} else if (p->p_sigparent != 0) {
601 			if (p->p_sigparent == SIGCHLD) {
602 				signal_parent = 1;
603 			} else { /* LINUX thread */
604 				signal_parent = 2;
605 			}
606 		}
607 	} else
608 		PROC_LOCK(p->p_pptr);
609 	sx_xunlock(&proctree_lock);
610 
611 	if (signal_parent == 1) {
612 		childproc_exited(p);
613 	} else if (signal_parent == 2) {
614 		kern_psignal(p->p_pptr, p->p_sigparent);
615 	}
616 
617 	/* Tell the prison that we are gone. */
618 	prison_proc_free(p->p_ucred->cr_prison);
619 
620 	/*
621 	 * The state PRS_ZOMBIE prevents other proesses from sending
622 	 * signal to the process, to avoid memory leak, we free memory
623 	 * for signal queue at the time when the state is set.
624 	 */
625 	sigqueue_flush(&p->p_sigqueue);
626 	sigqueue_flush(&td->td_sigqueue);
627 
628 	/*
629 	 * We have to wait until after acquiring all locks before
630 	 * changing p_state.  We need to avoid all possible context
631 	 * switches (including ones from blocking on a mutex) while
632 	 * marked as a zombie.  We also have to set the zombie state
633 	 * before we release the parent process' proc lock to avoid
634 	 * a lost wakeup.  So, we first call wakeup, then we grab the
635 	 * sched lock, update the state, and release the parent process'
636 	 * proc lock.
637 	 */
638 	wakeup(p->p_pptr);
639 	cv_broadcast(&p->p_pwait);
640 	sched_exit(p->p_pptr, td);
641 	PROC_SLOCK(p);
642 	p->p_state = PRS_ZOMBIE;
643 	PROC_UNLOCK(p->p_pptr);
644 
645 	/*
646 	 * Save our children's rusage information in our exit rusage.
647 	 */
648 	PROC_STATLOCK(p);
649 	ruadd(&p->p_ru, &p->p_rux, &p->p_stats->p_cru, &p->p_crux);
650 	PROC_STATUNLOCK(p);
651 
652 	/*
653 	 * Make sure the scheduler takes this thread out of its tables etc.
654 	 * This will also release this thread's reference to the ucred.
655 	 * Other thread parts to release include pcb bits and such.
656 	 */
657 	thread_exit();
658 }
659 
660 
661 #ifndef _SYS_SYSPROTO_H_
662 struct abort2_args {
663 	char *why;
664 	int nargs;
665 	void **args;
666 };
667 #endif
668 
669 int
670 sys_abort2(struct thread *td, struct abort2_args *uap)
671 {
672 	struct proc *p = td->td_proc;
673 	struct sbuf *sb;
674 	void *uargs[16];
675 	int error, i, sig;
676 
677 	/*
678 	 * Do it right now so we can log either proper call of abort2(), or
679 	 * note, that invalid argument was passed. 512 is big enough to
680 	 * handle 16 arguments' descriptions with additional comments.
681 	 */
682 	sb = sbuf_new(NULL, NULL, 512, SBUF_FIXEDLEN);
683 	sbuf_clear(sb);
684 	sbuf_printf(sb, "%s(pid %d uid %d) aborted: ",
685 	    p->p_comm, p->p_pid, td->td_ucred->cr_uid);
686 	/*
687 	 * Since we can't return from abort2(), send SIGKILL in cases, where
688 	 * abort2() was called improperly
689 	 */
690 	sig = SIGKILL;
691 	/* Prevent from DoSes from user-space. */
692 	if (uap->nargs < 0 || uap->nargs > 16)
693 		goto out;
694 	if (uap->nargs > 0) {
695 		if (uap->args == NULL)
696 			goto out;
697 		error = copyin(uap->args, uargs, uap->nargs * sizeof(void *));
698 		if (error != 0)
699 			goto out;
700 	}
701 	/*
702 	 * Limit size of 'reason' string to 128. Will fit even when
703 	 * maximal number of arguments was chosen to be logged.
704 	 */
705 	if (uap->why != NULL) {
706 		error = sbuf_copyin(sb, uap->why, 128);
707 		if (error < 0)
708 			goto out;
709 	} else {
710 		sbuf_printf(sb, "(null)");
711 	}
712 	if (uap->nargs > 0) {
713 		sbuf_printf(sb, "(");
714 		for (i = 0;i < uap->nargs; i++)
715 			sbuf_printf(sb, "%s%p", i == 0 ? "" : ", ", uargs[i]);
716 		sbuf_printf(sb, ")");
717 	}
718 	/*
719 	 * Final stage: arguments were proper, string has been
720 	 * successfully copied from userspace, and copying pointers
721 	 * from user-space succeed.
722 	 */
723 	sig = SIGABRT;
724 out:
725 	if (sig == SIGKILL) {
726 		sbuf_trim(sb);
727 		sbuf_printf(sb, " (Reason text inaccessible)");
728 	}
729 	sbuf_cat(sb, "\n");
730 	sbuf_finish(sb);
731 	log(LOG_INFO, "%s", sbuf_data(sb));
732 	sbuf_delete(sb);
733 	exit1(td, 0, sig);
734 	return (0);
735 }
736 
737 
738 #ifdef COMPAT_43
739 /*
740  * The dirty work is handled by kern_wait().
741  */
742 int
743 owait(struct thread *td, struct owait_args *uap __unused)
744 {
745 	int error, status;
746 
747 	error = kern_wait(td, WAIT_ANY, &status, 0, NULL);
748 	if (error == 0)
749 		td->td_retval[1] = status;
750 	return (error);
751 }
752 #endif /* COMPAT_43 */
753 
754 /*
755  * The dirty work is handled by kern_wait().
756  */
757 int
758 sys_wait4(struct thread *td, struct wait4_args *uap)
759 {
760 	struct rusage ru, *rup;
761 	int error, status;
762 
763 	if (uap->rusage != NULL)
764 		rup = &ru;
765 	else
766 		rup = NULL;
767 	error = kern_wait(td, uap->pid, &status, uap->options, rup);
768 	if (uap->status != NULL && error == 0 && td->td_retval[0] != 0)
769 		error = copyout(&status, uap->status, sizeof(status));
770 	if (uap->rusage != NULL && error == 0 && td->td_retval[0] != 0)
771 		error = copyout(&ru, uap->rusage, sizeof(struct rusage));
772 	return (error);
773 }
774 
775 int
776 sys_wait6(struct thread *td, struct wait6_args *uap)
777 {
778 	struct __wrusage wru, *wrup;
779 	siginfo_t si, *sip;
780 	idtype_t idtype;
781 	id_t id;
782 	int error, status;
783 
784 	idtype = uap->idtype;
785 	id = uap->id;
786 
787 	if (uap->wrusage != NULL)
788 		wrup = &wru;
789 	else
790 		wrup = NULL;
791 
792 	if (uap->info != NULL) {
793 		sip = &si;
794 		bzero(sip, sizeof(*sip));
795 	} else
796 		sip = NULL;
797 
798 	/*
799 	 *  We expect all callers of wait6() to know about WEXITED and
800 	 *  WTRAPPED.
801 	 */
802 	error = kern_wait6(td, idtype, id, &status, uap->options, wrup, sip);
803 
804 	if (uap->status != NULL && error == 0 && td->td_retval[0] != 0)
805 		error = copyout(&status, uap->status, sizeof(status));
806 	if (uap->wrusage != NULL && error == 0 && td->td_retval[0] != 0)
807 		error = copyout(&wru, uap->wrusage, sizeof(wru));
808 	if (uap->info != NULL && error == 0)
809 		error = copyout(&si, uap->info, sizeof(si));
810 	return (error);
811 }
812 
813 /*
814  * Reap the remains of a zombie process and optionally return status and
815  * rusage.  Asserts and will release both the proctree_lock and the process
816  * lock as part of its work.
817  */
818 void
819 proc_reap(struct thread *td, struct proc *p, int *status, int options)
820 {
821 	struct proc *q, *t;
822 
823 	sx_assert(&proctree_lock, SA_XLOCKED);
824 	PROC_LOCK_ASSERT(p, MA_OWNED);
825 	KASSERT(p->p_state == PRS_ZOMBIE, ("proc_reap: !PRS_ZOMBIE"));
826 
827 	mtx_spin_wait_unlocked(&p->p_slock);
828 
829 	q = td->td_proc;
830 
831 	if (status)
832 		*status = KW_EXITCODE(p->p_xexit, p->p_xsig);
833 	if (options & WNOWAIT) {
834 		/*
835 		 *  Only poll, returning the status.  Caller does not wish to
836 		 * release the proc struct just yet.
837 		 */
838 		PROC_UNLOCK(p);
839 		sx_xunlock(&proctree_lock);
840 		return;
841 	}
842 
843 	PROC_LOCK(q);
844 	sigqueue_take(p->p_ksi);
845 	PROC_UNLOCK(q);
846 
847 	/*
848 	 * If we got the child via a ptrace 'attach', we need to give it back
849 	 * to the old parent.
850 	 */
851 	if (p->p_oppid != p->p_pptr->p_pid) {
852 		PROC_UNLOCK(p);
853 		t = proc_realparent(p);
854 		PROC_LOCK(t);
855 		PROC_LOCK(p);
856 		CTR2(KTR_PTRACE,
857 		    "wait: traced child %d moved back to parent %d", p->p_pid,
858 		    t->p_pid);
859 		proc_reparent(p, t, false);
860 		PROC_UNLOCK(p);
861 		pksignal(t, SIGCHLD, p->p_ksi);
862 		wakeup(t);
863 		cv_broadcast(&p->p_pwait);
864 		PROC_UNLOCK(t);
865 		sx_xunlock(&proctree_lock);
866 		return;
867 	}
868 	PROC_UNLOCK(p);
869 
870 	/*
871 	 * Remove other references to this process to ensure we have an
872 	 * exclusive reference.
873 	 */
874 	sx_xlock(&allproc_lock);
875 	LIST_REMOVE(p, p_list);	/* off zombproc */
876 	sx_xunlock(&allproc_lock);
877 	sx_xlock(PIDHASHLOCK(p->p_pid));
878 	LIST_REMOVE(p, p_hash);
879 	sx_xunlock(PIDHASHLOCK(p->p_pid));
880 	LIST_REMOVE(p, p_sibling);
881 	reaper_abandon_children(p, true);
882 	LIST_REMOVE(p, p_reapsibling);
883 	PROC_LOCK(p);
884 	clear_orphan(p);
885 	PROC_UNLOCK(p);
886 	leavepgrp(p);
887 	if (p->p_procdesc != NULL)
888 		procdesc_reap(p);
889 	sx_xunlock(&proctree_lock);
890 
891 	PROC_LOCK(p);
892 	knlist_detach(p->p_klist);
893 	p->p_klist = NULL;
894 	PROC_UNLOCK(p);
895 
896 	/*
897 	 * Removal from allproc list and process group list paired with
898 	 * PROC_LOCK which was executed during that time should guarantee
899 	 * nothing can reach this process anymore. As such further locking
900 	 * is unnecessary.
901 	 */
902 	p->p_xexit = p->p_xsig = 0;		/* XXX: why? */
903 
904 	PROC_LOCK(q);
905 	ruadd(&q->p_stats->p_cru, &q->p_crux, &p->p_ru, &p->p_rux);
906 	PROC_UNLOCK(q);
907 
908 	/*
909 	 * Decrement the count of procs running with this uid.
910 	 */
911 	(void)chgproccnt(p->p_ucred->cr_ruidinfo, -1, 0);
912 
913 	/*
914 	 * Destroy resource accounting information associated with the process.
915 	 */
916 #ifdef RACCT
917 	if (racct_enable) {
918 		PROC_LOCK(p);
919 		racct_sub(p, RACCT_NPROC, 1);
920 		PROC_UNLOCK(p);
921 	}
922 #endif
923 	racct_proc_exit(p);
924 
925 	/*
926 	 * Free credentials, arguments, and sigacts.
927 	 */
928 	crfree(p->p_ucred);
929 	proc_set_cred(p, NULL);
930 	pargs_drop(p->p_args);
931 	p->p_args = NULL;
932 	sigacts_free(p->p_sigacts);
933 	p->p_sigacts = NULL;
934 
935 	/*
936 	 * Do any thread-system specific cleanups.
937 	 */
938 	thread_wait(p);
939 
940 	/*
941 	 * Give vm and machine-dependent layer a chance to free anything that
942 	 * cpu_exit couldn't release while still running in process context.
943 	 */
944 	vm_waitproc(p);
945 #ifdef MAC
946 	mac_proc_destroy(p);
947 #endif
948 
949 	KASSERT(FIRST_THREAD_IN_PROC(p),
950 	    ("proc_reap: no residual thread!"));
951 	uma_zfree(proc_zone, p);
952 	atomic_add_int(&nprocs, -1);
953 }
954 
955 static int
956 proc_to_reap(struct thread *td, struct proc *p, idtype_t idtype, id_t id,
957     int *status, int options, struct __wrusage *wrusage, siginfo_t *siginfo,
958     int check_only)
959 {
960 	struct rusage *rup;
961 
962 	sx_assert(&proctree_lock, SA_XLOCKED);
963 
964 	PROC_LOCK(p);
965 
966 	switch (idtype) {
967 	case P_ALL:
968 		if (p->p_procdesc != NULL) {
969 			PROC_UNLOCK(p);
970 			return (0);
971 		}
972 		break;
973 	case P_PID:
974 		if (p->p_pid != (pid_t)id) {
975 			PROC_UNLOCK(p);
976 			return (0);
977 		}
978 		break;
979 	case P_PGID:
980 		if (p->p_pgid != (pid_t)id) {
981 			PROC_UNLOCK(p);
982 			return (0);
983 		}
984 		break;
985 	case P_SID:
986 		if (p->p_session->s_sid != (pid_t)id) {
987 			PROC_UNLOCK(p);
988 			return (0);
989 		}
990 		break;
991 	case P_UID:
992 		if (p->p_ucred->cr_uid != (uid_t)id) {
993 			PROC_UNLOCK(p);
994 			return (0);
995 		}
996 		break;
997 	case P_GID:
998 		if (p->p_ucred->cr_gid != (gid_t)id) {
999 			PROC_UNLOCK(p);
1000 			return (0);
1001 		}
1002 		break;
1003 	case P_JAILID:
1004 		if (p->p_ucred->cr_prison->pr_id != (int)id) {
1005 			PROC_UNLOCK(p);
1006 			return (0);
1007 		}
1008 		break;
1009 	/*
1010 	 * It seems that the thread structures get zeroed out
1011 	 * at process exit.  This makes it impossible to
1012 	 * support P_SETID, P_CID or P_CPUID.
1013 	 */
1014 	default:
1015 		PROC_UNLOCK(p);
1016 		return (0);
1017 	}
1018 
1019 	if (p_canwait(td, p)) {
1020 		PROC_UNLOCK(p);
1021 		return (0);
1022 	}
1023 
1024 	if (((options & WEXITED) == 0) && (p->p_state == PRS_ZOMBIE)) {
1025 		PROC_UNLOCK(p);
1026 		return (0);
1027 	}
1028 
1029 	/*
1030 	 * This special case handles a kthread spawned by linux_clone
1031 	 * (see linux_misc.c).  The linux_wait4 and linux_waitpid
1032 	 * functions need to be able to distinguish between waiting
1033 	 * on a process and waiting on a thread.  It is a thread if
1034 	 * p_sigparent is not SIGCHLD, and the WLINUXCLONE option
1035 	 * signifies we want to wait for threads and not processes.
1036 	 */
1037 	if ((p->p_sigparent != SIGCHLD) ^
1038 	    ((options & WLINUXCLONE) != 0)) {
1039 		PROC_UNLOCK(p);
1040 		return (0);
1041 	}
1042 
1043 	if (siginfo != NULL) {
1044 		bzero(siginfo, sizeof(*siginfo));
1045 		siginfo->si_errno = 0;
1046 
1047 		/*
1048 		 * SUSv4 requires that the si_signo value is always
1049 		 * SIGCHLD. Obey it despite the rfork(2) interface
1050 		 * allows to request other signal for child exit
1051 		 * notification.
1052 		 */
1053 		siginfo->si_signo = SIGCHLD;
1054 
1055 		/*
1056 		 *  This is still a rough estimate.  We will fix the
1057 		 *  cases TRAPPED, STOPPED, and CONTINUED later.
1058 		 */
1059 		if (WCOREDUMP(p->p_xsig)) {
1060 			siginfo->si_code = CLD_DUMPED;
1061 			siginfo->si_status = WTERMSIG(p->p_xsig);
1062 		} else if (WIFSIGNALED(p->p_xsig)) {
1063 			siginfo->si_code = CLD_KILLED;
1064 			siginfo->si_status = WTERMSIG(p->p_xsig);
1065 		} else {
1066 			siginfo->si_code = CLD_EXITED;
1067 			siginfo->si_status = p->p_xexit;
1068 		}
1069 
1070 		siginfo->si_pid = p->p_pid;
1071 		siginfo->si_uid = p->p_ucred->cr_uid;
1072 
1073 		/*
1074 		 * The si_addr field would be useful additional
1075 		 * detail, but apparently the PC value may be lost
1076 		 * when we reach this point.  bzero() above sets
1077 		 * siginfo->si_addr to NULL.
1078 		 */
1079 	}
1080 
1081 	/*
1082 	 * There should be no reason to limit resources usage info to
1083 	 * exited processes only.  A snapshot about any resources used
1084 	 * by a stopped process may be exactly what is needed.
1085 	 */
1086 	if (wrusage != NULL) {
1087 		rup = &wrusage->wru_self;
1088 		*rup = p->p_ru;
1089 		PROC_STATLOCK(p);
1090 		calcru(p, &rup->ru_utime, &rup->ru_stime);
1091 		PROC_STATUNLOCK(p);
1092 
1093 		rup = &wrusage->wru_children;
1094 		*rup = p->p_stats->p_cru;
1095 		calccru(p, &rup->ru_utime, &rup->ru_stime);
1096 	}
1097 
1098 	if (p->p_state == PRS_ZOMBIE && !check_only) {
1099 		proc_reap(td, p, status, options);
1100 		return (-1);
1101 	}
1102 	return (1);
1103 }
1104 
1105 int
1106 kern_wait(struct thread *td, pid_t pid, int *status, int options,
1107     struct rusage *rusage)
1108 {
1109 	struct __wrusage wru, *wrup;
1110 	idtype_t idtype;
1111 	id_t id;
1112 	int ret;
1113 
1114 	/*
1115 	 * Translate the special pid values into the (idtype, pid)
1116 	 * pair for kern_wait6.  The WAIT_MYPGRP case is handled by
1117 	 * kern_wait6() on its own.
1118 	 */
1119 	if (pid == WAIT_ANY) {
1120 		idtype = P_ALL;
1121 		id = 0;
1122 	} else if (pid < 0) {
1123 		idtype = P_PGID;
1124 		id = (id_t)-pid;
1125 	} else {
1126 		idtype = P_PID;
1127 		id = (id_t)pid;
1128 	}
1129 
1130 	if (rusage != NULL)
1131 		wrup = &wru;
1132 	else
1133 		wrup = NULL;
1134 
1135 	/*
1136 	 * For backward compatibility we implicitly add flags WEXITED
1137 	 * and WTRAPPED here.
1138 	 */
1139 	options |= WEXITED | WTRAPPED;
1140 	ret = kern_wait6(td, idtype, id, status, options, wrup, NULL);
1141 	if (rusage != NULL)
1142 		*rusage = wru.wru_self;
1143 	return (ret);
1144 }
1145 
1146 static void
1147 report_alive_proc(struct thread *td, struct proc *p, siginfo_t *siginfo,
1148     int *status, int options, int si_code)
1149 {
1150 	bool cont;
1151 
1152 	PROC_LOCK_ASSERT(p, MA_OWNED);
1153 	sx_assert(&proctree_lock, SA_XLOCKED);
1154 	MPASS(si_code == CLD_TRAPPED || si_code == CLD_STOPPED ||
1155 	    si_code == CLD_CONTINUED);
1156 
1157 	cont = si_code == CLD_CONTINUED;
1158 	if ((options & WNOWAIT) == 0) {
1159 		if (cont)
1160 			p->p_flag &= ~P_CONTINUED;
1161 		else
1162 			p->p_flag |= P_WAITED;
1163 		PROC_LOCK(td->td_proc);
1164 		sigqueue_take(p->p_ksi);
1165 		PROC_UNLOCK(td->td_proc);
1166 	}
1167 	sx_xunlock(&proctree_lock);
1168 	if (siginfo != NULL) {
1169 		siginfo->si_code = si_code;
1170 		siginfo->si_status = cont ? SIGCONT : p->p_xsig;
1171 	}
1172 	if (status != NULL)
1173 		*status = cont ? SIGCONT : W_STOPCODE(p->p_xsig);
1174 	PROC_UNLOCK(p);
1175 	td->td_retval[0] = p->p_pid;
1176 }
1177 
1178 int
1179 kern_wait6(struct thread *td, idtype_t idtype, id_t id, int *status,
1180     int options, struct __wrusage *wrusage, siginfo_t *siginfo)
1181 {
1182 	struct proc *p, *q;
1183 	pid_t pid;
1184 	int error, nfound, ret;
1185 	bool report;
1186 
1187 	AUDIT_ARG_VALUE((int)idtype);	/* XXX - This is likely wrong! */
1188 	AUDIT_ARG_PID((pid_t)id);	/* XXX - This may be wrong! */
1189 	AUDIT_ARG_VALUE(options);
1190 
1191 	q = td->td_proc;
1192 
1193 	if ((pid_t)id == WAIT_MYPGRP && (idtype == P_PID || idtype == P_PGID)) {
1194 		PROC_LOCK(q);
1195 		id = (id_t)q->p_pgid;
1196 		PROC_UNLOCK(q);
1197 		idtype = P_PGID;
1198 	}
1199 
1200 	/* If we don't know the option, just return. */
1201 	if ((options & ~(WUNTRACED | WNOHANG | WCONTINUED | WNOWAIT |
1202 	    WEXITED | WTRAPPED | WLINUXCLONE)) != 0)
1203 		return (EINVAL);
1204 	if ((options & (WEXITED | WUNTRACED | WCONTINUED | WTRAPPED)) == 0) {
1205 		/*
1206 		 * We will be unable to find any matching processes,
1207 		 * because there are no known events to look for.
1208 		 * Prefer to return error instead of blocking
1209 		 * indefinitely.
1210 		 */
1211 		return (EINVAL);
1212 	}
1213 
1214 loop:
1215 	if (q->p_flag & P_STATCHILD) {
1216 		PROC_LOCK(q);
1217 		q->p_flag &= ~P_STATCHILD;
1218 		PROC_UNLOCK(q);
1219 	}
1220 	sx_xlock(&proctree_lock);
1221 loop_locked:
1222 	nfound = 0;
1223 	LIST_FOREACH(p, &q->p_children, p_sibling) {
1224 		pid = p->p_pid;
1225 		ret = proc_to_reap(td, p, idtype, id, status, options,
1226 		    wrusage, siginfo, 0);
1227 		if (ret == 0)
1228 			continue;
1229 		else if (ret != 1) {
1230 			td->td_retval[0] = pid;
1231 			return (0);
1232 		}
1233 
1234 		nfound++;
1235 		PROC_LOCK_ASSERT(p, MA_OWNED);
1236 
1237 		if ((options & WTRAPPED) != 0 &&
1238 		    (p->p_flag & P_TRACED) != 0) {
1239 			PROC_SLOCK(p);
1240 			report =
1241 			    ((p->p_flag & (P_STOPPED_TRACE | P_STOPPED_SIG)) &&
1242 			    p->p_suspcount == p->p_numthreads &&
1243 			    (p->p_flag & P_WAITED) == 0);
1244 			PROC_SUNLOCK(p);
1245 			if (report) {
1246 			CTR4(KTR_PTRACE,
1247 			    "wait: returning trapped pid %d status %#x "
1248 			    "(xstat %d) xthread %d",
1249 			    p->p_pid, W_STOPCODE(p->p_xsig), p->p_xsig,
1250 			    p->p_xthread != NULL ?
1251 			    p->p_xthread->td_tid : -1);
1252 				report_alive_proc(td, p, siginfo, status,
1253 				    options, CLD_TRAPPED);
1254 				return (0);
1255 			}
1256 		}
1257 		if ((options & WUNTRACED) != 0 &&
1258 		    (p->p_flag & P_STOPPED_SIG) != 0) {
1259 			PROC_SLOCK(p);
1260 			report = (p->p_suspcount == p->p_numthreads &&
1261 			    ((p->p_flag & P_WAITED) == 0));
1262 			PROC_SUNLOCK(p);
1263 			if (report) {
1264 				report_alive_proc(td, p, siginfo, status,
1265 				    options, CLD_STOPPED);
1266 				return (0);
1267 			}
1268 		}
1269 		if ((options & WCONTINUED) != 0 &&
1270 		    (p->p_flag & P_CONTINUED) != 0) {
1271 			report_alive_proc(td, p, siginfo, status, options,
1272 			    CLD_CONTINUED);
1273 			return (0);
1274 		}
1275 		PROC_UNLOCK(p);
1276 	}
1277 
1278 	/*
1279 	 * Look in the orphans list too, to allow the parent to
1280 	 * collect it's child exit status even if child is being
1281 	 * debugged.
1282 	 *
1283 	 * Debugger detaches from the parent upon successful
1284 	 * switch-over from parent to child.  At this point due to
1285 	 * re-parenting the parent loses the child to debugger and a
1286 	 * wait4(2) call would report that it has no children to wait
1287 	 * for.  By maintaining a list of orphans we allow the parent
1288 	 * to successfully wait until the child becomes a zombie.
1289 	 */
1290 	if (nfound == 0) {
1291 		LIST_FOREACH(p, &q->p_orphans, p_orphan) {
1292 			ret = proc_to_reap(td, p, idtype, id, NULL, options,
1293 			    NULL, NULL, 1);
1294 			if (ret != 0) {
1295 				KASSERT(ret != -1, ("reaped an orphan (pid %d)",
1296 				    (int)td->td_retval[0]));
1297 				PROC_UNLOCK(p);
1298 				nfound++;
1299 				break;
1300 			}
1301 		}
1302 	}
1303 	if (nfound == 0) {
1304 		sx_xunlock(&proctree_lock);
1305 		return (ECHILD);
1306 	}
1307 	if (options & WNOHANG) {
1308 		sx_xunlock(&proctree_lock);
1309 		td->td_retval[0] = 0;
1310 		return (0);
1311 	}
1312 	PROC_LOCK(q);
1313 	if (q->p_flag & P_STATCHILD) {
1314 		q->p_flag &= ~P_STATCHILD;
1315 		PROC_UNLOCK(q);
1316 		goto loop_locked;
1317 	}
1318 	sx_xunlock(&proctree_lock);
1319 	error = msleep(q, &q->p_mtx, PWAIT | PCATCH | PDROP, "wait", 0);
1320 	if (error)
1321 		return (error);
1322 	goto loop;
1323 }
1324 
1325 /*
1326  * Make process 'parent' the new parent of process 'child'.
1327  * Must be called with an exclusive hold of proctree lock.
1328  */
1329 void
1330 proc_reparent(struct proc *child, struct proc *parent, bool set_oppid)
1331 {
1332 
1333 	sx_assert(&proctree_lock, SX_XLOCKED);
1334 	PROC_LOCK_ASSERT(child, MA_OWNED);
1335 	if (child->p_pptr == parent)
1336 		return;
1337 
1338 	PROC_LOCK(child->p_pptr);
1339 	sigqueue_take(child->p_ksi);
1340 	PROC_UNLOCK(child->p_pptr);
1341 	LIST_REMOVE(child, p_sibling);
1342 	LIST_INSERT_HEAD(&parent->p_children, child, p_sibling);
1343 
1344 	clear_orphan(child);
1345 	if (child->p_flag & P_TRACED) {
1346 		if (LIST_EMPTY(&child->p_pptr->p_orphans)) {
1347 			child->p_treeflag |= P_TREE_FIRST_ORPHAN;
1348 			LIST_INSERT_HEAD(&child->p_pptr->p_orphans, child,
1349 			    p_orphan);
1350 		} else {
1351 			LIST_INSERT_AFTER(LIST_FIRST(&child->p_pptr->p_orphans),
1352 			    child, p_orphan);
1353 		}
1354 		child->p_treeflag |= P_TREE_ORPHANED;
1355 	}
1356 
1357 	child->p_pptr = parent;
1358 	if (set_oppid)
1359 		child->p_oppid = parent->p_pid;
1360 }
1361