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