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 *
proc_realparent(struct proc * child)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
reaper_abandon_children(struct proc * p,bool exiting)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 void
proc_clear_orphan(struct proc * p)151 proc_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
sys_sys_exit(struct thread * td,struct sys_exit_args * uap)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
exit1(struct thread * td,int rval,int signo)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_ptevents = 0;
339
340 /*
341 * Stop the real interval timer. If the handler is currently
342 * executing, prevent it from rearming itself and let it finish.
343 */
344 if (timevalisset(&p->p_realtimer.it_value) &&
345 _callout_stop_safe(&p->p_itcallout, CS_EXECUTING, NULL) == 0) {
346 timevalclear(&p->p_realtimer.it_interval);
347 msleep(&p->p_itcallout, &p->p_mtx, PWAIT, "ritwait", 0);
348 KASSERT(!timevalisset(&p->p_realtimer.it_value),
349 ("realtime timer is still armed"));
350 }
351
352 PROC_UNLOCK(p);
353
354 umtx_thread_exit(td);
355
356 /*
357 * Reset any sigio structures pointing to us as a result of
358 * F_SETOWN with our pid.
359 */
360 funsetownlst(&p->p_sigiolst);
361
362 /*
363 * If this process has an nlminfo data area (for lockd), release it
364 */
365 if (nlminfo_release_p != NULL && p->p_nlminfo != NULL)
366 (*nlminfo_release_p)(p);
367
368 /*
369 * Close open files and release open-file table.
370 * This may block!
371 */
372 fdescfree(td);
373
374 /*
375 * If this thread tickled GEOM, we need to wait for the giggling to
376 * stop before we return to userland
377 */
378 if (td->td_pflags & TDP_GEOM)
379 g_waitidle();
380
381 /*
382 * Remove ourself from our leader's peer list and wake our leader.
383 */
384 if (p->p_leader->p_peers != NULL) {
385 mtx_lock(&ppeers_lock);
386 if (p->p_leader->p_peers != NULL) {
387 q = p->p_leader;
388 while (q->p_peers != p)
389 q = q->p_peers;
390 q->p_peers = p->p_peers;
391 wakeup(p->p_leader);
392 }
393 mtx_unlock(&ppeers_lock);
394 }
395
396 vmspace_exit(td);
397 killjobc();
398 (void)acct_process(td);
399
400 #ifdef KTRACE
401 ktrprocexit(td);
402 #endif
403 /*
404 * Release reference to text vnode
405 */
406 if (p->p_textvp != NULL) {
407 vrele(p->p_textvp);
408 p->p_textvp = NULL;
409 }
410
411 /*
412 * Release our limits structure.
413 */
414 lim_free(p->p_limit);
415 p->p_limit = NULL;
416
417 tidhash_remove(td);
418
419 /*
420 * Call machine-dependent code to release any
421 * machine-dependent resources other than the address space.
422 * The address space is released by "vmspace_exitfree(p)" in
423 * vm_waitproc().
424 */
425 cpu_exit(td);
426
427 WITNESS_WARN(WARN_PANIC, NULL, "process (pid %d) exiting", p->p_pid);
428
429 sx_xlock(&proctree_lock);
430 /*
431 * Remove proc from allproc queue and pidhash chain.
432 * Place onto zombproc. Unlink from parent's child list.
433 */
434 sx_xlock(&allproc_lock);
435 LIST_REMOVE(p, p_list);
436 LIST_INSERT_HEAD(&zombproc, p, p_list);
437 LIST_REMOVE(p, p_hash);
438 sx_xunlock(&allproc_lock);
439
440 PROC_LOCK(p);
441 p->p_flag &= ~(P_TRACED | P_PPWAIT | P_PPTRACE);
442 PROC_UNLOCK(p);
443
444 /*
445 * Reparent all children processes:
446 * - traced ones to the original parent (or init if we are that parent)
447 * - the rest to init
448 */
449 q = LIST_FIRST(&p->p_children);
450 if (q != NULL) /* only need this if any child is S_ZOMB */
451 wakeup(q->p_reaper);
452 for (; q != NULL; q = nq) {
453 nq = LIST_NEXT(q, p_sibling);
454 ksi = ksiginfo_alloc(TRUE);
455 PROC_LOCK(q);
456 q->p_sigparent = SIGCHLD;
457
458 if ((q->p_flag & P_TRACED) == 0) {
459 proc_reparent(q, q->p_reaper, true);
460 if (q->p_state == PRS_ZOMBIE) {
461 /*
462 * Inform reaper about the reparented
463 * zombie, since wait(2) has something
464 * new to report. Guarantee queueing
465 * of the SIGCHLD signal, similar to
466 * the _exit() behaviour, by providing
467 * our ksiginfo. Ksi is freed by the
468 * signal delivery.
469 */
470 if (q->p_ksi == NULL) {
471 ksi1 = NULL;
472 } else {
473 ksiginfo_copy(q->p_ksi, ksi);
474 ksi->ksi_flags |= KSI_INS;
475 ksi1 = ksi;
476 ksi = NULL;
477 }
478 PROC_LOCK(q->p_reaper);
479 pksignal(q->p_reaper, SIGCHLD, ksi1);
480 PROC_UNLOCK(q->p_reaper);
481 } else if (q->p_pdeathsig > 0) {
482 /*
483 * The child asked to received a signal
484 * when we exit.
485 */
486 kern_psignal(q, q->p_pdeathsig);
487 }
488 } else {
489 /*
490 * Traced processes are killed since their existence
491 * means someone is screwing up.
492 */
493 t = proc_realparent(q);
494 if (t == p) {
495 proc_reparent(q, q->p_reaper, true);
496 } else {
497 PROC_LOCK(t);
498 proc_reparent(q, t, true);
499 PROC_UNLOCK(t);
500 }
501 /*
502 * Since q was found on our children list, the
503 * proc_reparent() call moved q to the orphan
504 * list due to present P_TRACED flag. Clear
505 * orphan link for q now while q is locked.
506 */
507 proc_clear_orphan(q);
508 q->p_flag &= ~(P_TRACED | P_STOPPED_TRACE);
509 q->p_flag2 &= ~P2_PTRACE_FSTP;
510 q->p_ptevents = 0;
511 FOREACH_THREAD_IN_PROC(q, tdt) {
512 tdt->td_dbgflags &= ~(TDB_SUSPEND | TDB_XSIG |
513 TDB_FSTP);
514 }
515 kern_psignal(q, SIGKILL);
516 }
517 PROC_UNLOCK(q);
518 if (ksi != NULL)
519 ksiginfo_free(ksi);
520 }
521
522 /*
523 * Also get rid of our orphans.
524 */
525 while ((q = LIST_FIRST(&p->p_orphans)) != NULL) {
526 PROC_LOCK(q);
527 KASSERT(q->p_oppid == p->p_pid,
528 ("orphan %p of %p has unexpected oppid %d", q, p,
529 q->p_oppid));
530 q->p_oppid = q->p_reaper->p_pid;
531
532 /*
533 * If we are the real parent of this process
534 * but it has been reparented to a debugger, then
535 * check if it asked for a signal when we exit.
536 */
537 if (q->p_pdeathsig > 0)
538 kern_psignal(q, q->p_pdeathsig);
539 CTR2(KTR_PTRACE, "exit: pid %d, clearing orphan %d", p->p_pid,
540 q->p_pid);
541 proc_clear_orphan(q);
542 PROC_UNLOCK(q);
543 }
544
545 /* Save exit status. */
546 PROC_LOCK(p);
547 p->p_xthread = td;
548
549 #ifdef KDTRACE_HOOKS
550 /*
551 * Tell the DTrace fasttrap provider about the exit if it
552 * has declared an interest.
553 */
554 if (dtrace_fasttrap_exit)
555 dtrace_fasttrap_exit(p);
556 #endif
557
558 /*
559 * Notify interested parties of our demise.
560 */
561 KNOTE_LOCKED(p->p_klist, NOTE_EXIT);
562
563 #ifdef KDTRACE_HOOKS
564 int reason = CLD_EXITED;
565 if (WCOREDUMP(signo))
566 reason = CLD_DUMPED;
567 else if (WIFSIGNALED(signo))
568 reason = CLD_KILLED;
569 SDT_PROBE1(proc, , , exit, reason);
570 #endif
571
572 /*
573 * If this is a process with a descriptor, we may not need to deliver
574 * a signal to the parent. proctree_lock is held over
575 * procdesc_exit() to serialize concurrent calls to close() and
576 * exit().
577 */
578 signal_parent = 0;
579 if (p->p_procdesc == NULL || procdesc_exit(p)) {
580 /*
581 * Notify parent that we're gone. If parent has the
582 * PS_NOCLDWAIT flag set, or if the handler is set to SIG_IGN,
583 * notify process 1 instead (and hope it will handle this
584 * situation).
585 */
586 PROC_LOCK(p->p_pptr);
587 mtx_lock(&p->p_pptr->p_sigacts->ps_mtx);
588 if (p->p_pptr->p_sigacts->ps_flag &
589 (PS_NOCLDWAIT | PS_CLDSIGIGN)) {
590 struct proc *pp;
591
592 mtx_unlock(&p->p_pptr->p_sigacts->ps_mtx);
593 pp = p->p_pptr;
594 PROC_UNLOCK(pp);
595 proc_reparent(p, p->p_reaper, true);
596 p->p_sigparent = SIGCHLD;
597 PROC_LOCK(p->p_pptr);
598
599 /*
600 * Notify parent, so in case he was wait(2)ing or
601 * executing waitpid(2) with our pid, he will
602 * continue.
603 */
604 wakeup(pp);
605 } else
606 mtx_unlock(&p->p_pptr->p_sigacts->ps_mtx);
607
608 if (p->p_pptr == p->p_reaper || p->p_pptr == initproc) {
609 signal_parent = 1;
610 } else if (p->p_sigparent != 0) {
611 if (p->p_sigparent == SIGCHLD) {
612 signal_parent = 1;
613 } else { /* LINUX thread */
614 signal_parent = 2;
615 }
616 }
617 } else
618 PROC_LOCK(p->p_pptr);
619 sx_xunlock(&proctree_lock);
620
621 if (signal_parent == 1) {
622 childproc_exited(p);
623 } else if (signal_parent == 2) {
624 kern_psignal(p->p_pptr, p->p_sigparent);
625 }
626
627 /* Tell the prison that we are gone. */
628 prison_proc_free(p->p_ucred->cr_prison);
629
630 /*
631 * The state PRS_ZOMBIE prevents other proesses from sending
632 * signal to the process, to avoid memory leak, we free memory
633 * for signal queue at the time when the state is set.
634 */
635 sigqueue_flush(&p->p_sigqueue);
636 sigqueue_flush(&td->td_sigqueue);
637
638 /*
639 * We have to wait until after acquiring all locks before
640 * changing p_state. We need to avoid all possible context
641 * switches (including ones from blocking on a mutex) while
642 * marked as a zombie. We also have to set the zombie state
643 * before we release the parent process' proc lock to avoid
644 * a lost wakeup. So, we first call wakeup, then we grab the
645 * sched lock, update the state, and release the parent process'
646 * proc lock.
647 */
648 wakeup(p->p_pptr);
649 cv_broadcast(&p->p_pwait);
650 sched_exit(p->p_pptr, td);
651 PROC_SLOCK(p);
652 p->p_state = PRS_ZOMBIE;
653 PROC_UNLOCK(p->p_pptr);
654
655 /*
656 * Save our children's rusage information in our exit rusage.
657 */
658 PROC_STATLOCK(p);
659 ruadd(&p->p_ru, &p->p_rux, &p->p_stats->p_cru, &p->p_crux);
660 PROC_STATUNLOCK(p);
661
662 /*
663 * Make sure the scheduler takes this thread out of its tables etc.
664 * This will also release this thread's reference to the ucred.
665 * Other thread parts to release include pcb bits and such.
666 */
667 thread_exit();
668 }
669
670
671 #ifndef _SYS_SYSPROTO_H_
672 struct abort2_args {
673 char *why;
674 int nargs;
675 void **args;
676 };
677 #endif
678
679 int
sys_abort2(struct thread * td,struct abort2_args * uap)680 sys_abort2(struct thread *td, struct abort2_args *uap)
681 {
682 struct proc *p = td->td_proc;
683 struct sbuf *sb;
684 void *uargs[16];
685 int error, i, sig;
686
687 /*
688 * Do it right now so we can log either proper call of abort2(), or
689 * note, that invalid argument was passed. 512 is big enough to
690 * handle 16 arguments' descriptions with additional comments.
691 */
692 sb = sbuf_new(NULL, NULL, 512, SBUF_FIXEDLEN);
693 sbuf_clear(sb);
694 sbuf_printf(sb, "%s(pid %d uid %d) aborted: ",
695 p->p_comm, p->p_pid, td->td_ucred->cr_uid);
696 /*
697 * Since we can't return from abort2(), send SIGKILL in cases, where
698 * abort2() was called improperly
699 */
700 sig = SIGKILL;
701 /* Prevent from DoSes from user-space. */
702 if (uap->nargs < 0 || uap->nargs > 16)
703 goto out;
704 if (uap->nargs > 0) {
705 if (uap->args == NULL)
706 goto out;
707 error = copyin(uap->args, uargs, uap->nargs * sizeof(void *));
708 if (error != 0)
709 goto out;
710 }
711 /*
712 * Limit size of 'reason' string to 128. Will fit even when
713 * maximal number of arguments was chosen to be logged.
714 */
715 if (uap->why != NULL) {
716 error = sbuf_copyin(sb, uap->why, 128);
717 if (error < 0)
718 goto out;
719 } else {
720 sbuf_printf(sb, "(null)");
721 }
722 if (uap->nargs > 0) {
723 sbuf_printf(sb, "(");
724 for (i = 0;i < uap->nargs; i++)
725 sbuf_printf(sb, "%s%p", i == 0 ? "" : ", ", uargs[i]);
726 sbuf_printf(sb, ")");
727 }
728 /*
729 * Final stage: arguments were proper, string has been
730 * successfully copied from userspace, and copying pointers
731 * from user-space succeed.
732 */
733 sig = SIGABRT;
734 out:
735 if (sig == SIGKILL) {
736 sbuf_trim(sb);
737 sbuf_printf(sb, " (Reason text inaccessible)");
738 }
739 sbuf_cat(sb, "\n");
740 sbuf_finish(sb);
741 log(LOG_INFO, "%s", sbuf_data(sb));
742 sbuf_delete(sb);
743 exit1(td, 0, sig);
744 return (0);
745 }
746
747
748 #ifdef COMPAT_43
749 /*
750 * The dirty work is handled by kern_wait().
751 */
752 int
owait(struct thread * td,struct owait_args * uap __unused)753 owait(struct thread *td, struct owait_args *uap __unused)
754 {
755 int error, status;
756
757 error = kern_wait(td, WAIT_ANY, &status, 0, NULL);
758 if (error == 0)
759 td->td_retval[1] = status;
760 return (error);
761 }
762 #endif /* COMPAT_43 */
763
764 /*
765 * The dirty work is handled by kern_wait().
766 */
767 int
sys_wait4(struct thread * td,struct wait4_args * uap)768 sys_wait4(struct thread *td, struct wait4_args *uap)
769 {
770 struct rusage ru, *rup;
771 int error, status;
772
773 if (uap->rusage != NULL)
774 rup = &ru;
775 else
776 rup = NULL;
777 error = kern_wait(td, uap->pid, &status, uap->options, rup);
778 if (uap->status != NULL && error == 0 && td->td_retval[0] != 0)
779 error = copyout(&status, uap->status, sizeof(status));
780 if (uap->rusage != NULL && error == 0 && td->td_retval[0] != 0)
781 error = copyout(&ru, uap->rusage, sizeof(struct rusage));
782 return (error);
783 }
784
785 int
sys_wait6(struct thread * td,struct wait6_args * uap)786 sys_wait6(struct thread *td, struct wait6_args *uap)
787 {
788 struct __wrusage wru, *wrup;
789 siginfo_t si, *sip;
790 idtype_t idtype;
791 id_t id;
792 int error, status;
793
794 idtype = uap->idtype;
795 id = uap->id;
796
797 if (uap->wrusage != NULL)
798 wrup = &wru;
799 else
800 wrup = NULL;
801
802 if (uap->info != NULL) {
803 sip = &si;
804 bzero(sip, sizeof(*sip));
805 } else
806 sip = NULL;
807
808 /*
809 * We expect all callers of wait6() to know about WEXITED and
810 * WTRAPPED.
811 */
812 error = kern_wait6(td, idtype, id, &status, uap->options, wrup, sip);
813
814 if (uap->status != NULL && error == 0 && td->td_retval[0] != 0)
815 error = copyout(&status, uap->status, sizeof(status));
816 if (uap->wrusage != NULL && error == 0 && td->td_retval[0] != 0)
817 error = copyout(&wru, uap->wrusage, sizeof(wru));
818 if (uap->info != NULL && error == 0)
819 error = copyout(&si, uap->info, sizeof(si));
820 return (error);
821 }
822
823 /*
824 * Reap the remains of a zombie process and optionally return status and
825 * rusage. Asserts and will release both the proctree_lock and the process
826 * lock as part of its work.
827 */
828 void
proc_reap(struct thread * td,struct proc * p,int * status,int options)829 proc_reap(struct thread *td, struct proc *p, int *status, int options)
830 {
831 struct proc *q, *t;
832
833 sx_assert(&proctree_lock, SA_XLOCKED);
834 PROC_LOCK_ASSERT(p, MA_OWNED);
835 KASSERT(p->p_state == PRS_ZOMBIE, ("proc_reap: !PRS_ZOMBIE"));
836
837 mtx_spin_wait_unlocked(&p->p_slock);
838
839 q = td->td_proc;
840
841 if (status)
842 *status = KW_EXITCODE(p->p_xexit, p->p_xsig);
843 if (options & WNOWAIT) {
844 /*
845 * Only poll, returning the status. Caller does not wish to
846 * release the proc struct just yet.
847 */
848 PROC_UNLOCK(p);
849 sx_xunlock(&proctree_lock);
850 return;
851 }
852
853 PROC_LOCK(q);
854 sigqueue_take(p->p_ksi);
855 PROC_UNLOCK(q);
856
857 /*
858 * If we got the child via a ptrace 'attach', we need to give it back
859 * to the old parent.
860 */
861 if (p->p_oppid != p->p_pptr->p_pid) {
862 PROC_UNLOCK(p);
863 t = proc_realparent(p);
864 PROC_LOCK(t);
865 PROC_LOCK(p);
866 CTR2(KTR_PTRACE,
867 "wait: traced child %d moved back to parent %d", p->p_pid,
868 t->p_pid);
869 proc_reparent(p, t, false);
870 PROC_UNLOCK(p);
871 pksignal(t, SIGCHLD, p->p_ksi);
872 wakeup(t);
873 cv_broadcast(&p->p_pwait);
874 PROC_UNLOCK(t);
875 sx_xunlock(&proctree_lock);
876 return;
877 }
878 PROC_UNLOCK(p);
879
880 /*
881 * Remove other references to this process to ensure we have an
882 * exclusive reference.
883 */
884 sx_xlock(&allproc_lock);
885 LIST_REMOVE(p, p_list); /* off zombproc */
886 sx_xunlock(&allproc_lock);
887 LIST_REMOVE(p, p_sibling);
888 reaper_abandon_children(p, true);
889 LIST_REMOVE(p, p_reapsibling);
890 PROC_LOCK(p);
891 proc_clear_orphan(p);
892 PROC_UNLOCK(p);
893 leavepgrp(p);
894 if (p->p_procdesc != NULL)
895 procdesc_reap(p);
896 sx_xunlock(&proctree_lock);
897
898 PROC_LOCK(p);
899 knlist_detach(p->p_klist);
900 p->p_klist = NULL;
901 PROC_UNLOCK(p);
902
903 /*
904 * Removal from allproc list and process group list paired with
905 * PROC_LOCK which was executed during that time should guarantee
906 * nothing can reach this process anymore. As such further locking
907 * is unnecessary.
908 */
909 p->p_xexit = p->p_xsig = 0; /* XXX: why? */
910
911 PROC_LOCK(q);
912 ruadd(&q->p_stats->p_cru, &q->p_crux, &p->p_ru, &p->p_rux);
913 PROC_UNLOCK(q);
914
915 /*
916 * Decrement the count of procs running with this uid.
917 */
918 (void)chgproccnt(p->p_ucred->cr_ruidinfo, -1, 0);
919
920 /*
921 * Destroy resource accounting information associated with the process.
922 */
923 #ifdef RACCT
924 if (racct_enable) {
925 PROC_LOCK(p);
926 racct_sub(p, RACCT_NPROC, 1);
927 PROC_UNLOCK(p);
928 }
929 #endif
930 racct_proc_exit(p);
931
932 /*
933 * Free credentials, arguments, and sigacts.
934 */
935 crfree(p->p_ucred);
936 proc_set_cred(p, NULL);
937 pargs_drop(p->p_args);
938 p->p_args = NULL;
939 sigacts_free(p->p_sigacts);
940 p->p_sigacts = NULL;
941
942 /*
943 * Do any thread-system specific cleanups.
944 */
945 thread_wait(p);
946
947 /*
948 * Give vm and machine-dependent layer a chance to free anything that
949 * cpu_exit couldn't release while still running in process context.
950 */
951 vm_waitproc(p);
952 #ifdef MAC
953 mac_proc_destroy(p);
954 #endif
955
956 KASSERT(FIRST_THREAD_IN_PROC(p),
957 ("proc_reap: no residual thread!"));
958 uma_zfree(proc_zone, p);
959 atomic_add_int(&nprocs, -1);
960 }
961
962 static int
proc_to_reap(struct thread * td,struct proc * p,idtype_t idtype,id_t id,int * status,int options,struct __wrusage * wrusage,siginfo_t * siginfo,int check_only)963 proc_to_reap(struct thread *td, struct proc *p, idtype_t idtype, id_t id,
964 int *status, int options, struct __wrusage *wrusage, siginfo_t *siginfo,
965 int check_only)
966 {
967 struct rusage *rup;
968
969 sx_assert(&proctree_lock, SA_XLOCKED);
970
971 PROC_LOCK(p);
972
973 switch (idtype) {
974 case P_ALL:
975 if (p->p_procdesc != NULL) {
976 PROC_UNLOCK(p);
977 return (0);
978 }
979 break;
980 case P_PID:
981 if (p->p_pid != (pid_t)id) {
982 PROC_UNLOCK(p);
983 return (0);
984 }
985 break;
986 case P_PGID:
987 if (p->p_pgid != (pid_t)id) {
988 PROC_UNLOCK(p);
989 return (0);
990 }
991 break;
992 case P_SID:
993 if (p->p_session->s_sid != (pid_t)id) {
994 PROC_UNLOCK(p);
995 return (0);
996 }
997 break;
998 case P_UID:
999 if (p->p_ucred->cr_uid != (uid_t)id) {
1000 PROC_UNLOCK(p);
1001 return (0);
1002 }
1003 break;
1004 case P_GID:
1005 if (p->p_ucred->cr_gid != (gid_t)id) {
1006 PROC_UNLOCK(p);
1007 return (0);
1008 }
1009 break;
1010 case P_JAILID:
1011 if (p->p_ucred->cr_prison->pr_id != (int)id) {
1012 PROC_UNLOCK(p);
1013 return (0);
1014 }
1015 break;
1016 /*
1017 * It seems that the thread structures get zeroed out
1018 * at process exit. This makes it impossible to
1019 * support P_SETID, P_CID or P_CPUID.
1020 */
1021 default:
1022 PROC_UNLOCK(p);
1023 return (0);
1024 }
1025
1026 if (p_canwait(td, p)) {
1027 PROC_UNLOCK(p);
1028 return (0);
1029 }
1030
1031 if (((options & WEXITED) == 0) && (p->p_state == PRS_ZOMBIE)) {
1032 PROC_UNLOCK(p);
1033 return (0);
1034 }
1035
1036 /*
1037 * This special case handles a kthread spawned by linux_clone
1038 * (see linux_misc.c). The linux_wait4 and linux_waitpid
1039 * functions need to be able to distinguish between waiting
1040 * on a process and waiting on a thread. It is a thread if
1041 * p_sigparent is not SIGCHLD, and the WLINUXCLONE option
1042 * signifies we want to wait for threads and not processes.
1043 */
1044 if ((p->p_sigparent != SIGCHLD) ^
1045 ((options & WLINUXCLONE) != 0)) {
1046 PROC_UNLOCK(p);
1047 return (0);
1048 }
1049
1050 if (siginfo != NULL) {
1051 bzero(siginfo, sizeof(*siginfo));
1052 siginfo->si_errno = 0;
1053
1054 /*
1055 * SUSv4 requires that the si_signo value is always
1056 * SIGCHLD. Obey it despite the rfork(2) interface
1057 * allows to request other signal for child exit
1058 * notification.
1059 */
1060 siginfo->si_signo = SIGCHLD;
1061
1062 /*
1063 * This is still a rough estimate. We will fix the
1064 * cases TRAPPED, STOPPED, and CONTINUED later.
1065 */
1066 if (WCOREDUMP(p->p_xsig)) {
1067 siginfo->si_code = CLD_DUMPED;
1068 siginfo->si_status = WTERMSIG(p->p_xsig);
1069 } else if (WIFSIGNALED(p->p_xsig)) {
1070 siginfo->si_code = CLD_KILLED;
1071 siginfo->si_status = WTERMSIG(p->p_xsig);
1072 } else {
1073 siginfo->si_code = CLD_EXITED;
1074 siginfo->si_status = p->p_xexit;
1075 }
1076
1077 siginfo->si_pid = p->p_pid;
1078 siginfo->si_uid = p->p_ucred->cr_uid;
1079
1080 /*
1081 * The si_addr field would be useful additional
1082 * detail, but apparently the PC value may be lost
1083 * when we reach this point. bzero() above sets
1084 * siginfo->si_addr to NULL.
1085 */
1086 }
1087
1088 /*
1089 * There should be no reason to limit resources usage info to
1090 * exited processes only. A snapshot about any resources used
1091 * by a stopped process may be exactly what is needed.
1092 */
1093 if (wrusage != NULL) {
1094 rup = &wrusage->wru_self;
1095 *rup = p->p_ru;
1096 PROC_STATLOCK(p);
1097 calcru(p, &rup->ru_utime, &rup->ru_stime);
1098 PROC_STATUNLOCK(p);
1099
1100 rup = &wrusage->wru_children;
1101 *rup = p->p_stats->p_cru;
1102 calccru(p, &rup->ru_utime, &rup->ru_stime);
1103 }
1104
1105 if (p->p_state == PRS_ZOMBIE && !check_only) {
1106 proc_reap(td, p, status, options);
1107 return (-1);
1108 }
1109 return (1);
1110 }
1111
1112 int
kern_wait(struct thread * td,pid_t pid,int * status,int options,struct rusage * rusage)1113 kern_wait(struct thread *td, pid_t pid, int *status, int options,
1114 struct rusage *rusage)
1115 {
1116 struct __wrusage wru, *wrup;
1117 idtype_t idtype;
1118 id_t id;
1119 int ret;
1120
1121 /*
1122 * Translate the special pid values into the (idtype, pid)
1123 * pair for kern_wait6. The WAIT_MYPGRP case is handled by
1124 * kern_wait6() on its own.
1125 */
1126 if (pid == WAIT_ANY) {
1127 idtype = P_ALL;
1128 id = 0;
1129 } else if (pid < 0) {
1130 idtype = P_PGID;
1131 id = (id_t)-pid;
1132 } else {
1133 idtype = P_PID;
1134 id = (id_t)pid;
1135 }
1136
1137 if (rusage != NULL)
1138 wrup = &wru;
1139 else
1140 wrup = NULL;
1141
1142 /*
1143 * For backward compatibility we implicitly add flags WEXITED
1144 * and WTRAPPED here.
1145 */
1146 options |= WEXITED | WTRAPPED;
1147 ret = kern_wait6(td, idtype, id, status, options, wrup, NULL);
1148 if (rusage != NULL)
1149 *rusage = wru.wru_self;
1150 return (ret);
1151 }
1152
1153 static void
report_alive_proc(struct thread * td,struct proc * p,siginfo_t * siginfo,int * status,int options,int si_code)1154 report_alive_proc(struct thread *td, struct proc *p, siginfo_t *siginfo,
1155 int *status, int options, int si_code)
1156 {
1157 bool cont;
1158
1159 PROC_LOCK_ASSERT(p, MA_OWNED);
1160 sx_assert(&proctree_lock, SA_XLOCKED);
1161 MPASS(si_code == CLD_TRAPPED || si_code == CLD_STOPPED ||
1162 si_code == CLD_CONTINUED);
1163
1164 cont = si_code == CLD_CONTINUED;
1165 if ((options & WNOWAIT) == 0) {
1166 if (cont)
1167 p->p_flag &= ~P_CONTINUED;
1168 else
1169 p->p_flag |= P_WAITED;
1170 PROC_LOCK(td->td_proc);
1171 sigqueue_take(p->p_ksi);
1172 PROC_UNLOCK(td->td_proc);
1173 }
1174 sx_xunlock(&proctree_lock);
1175 if (siginfo != NULL) {
1176 siginfo->si_code = si_code;
1177 siginfo->si_status = cont ? SIGCONT : p->p_xsig;
1178 }
1179 if (status != NULL)
1180 *status = cont ? SIGCONT : W_STOPCODE(p->p_xsig);
1181 PROC_UNLOCK(p);
1182 td->td_retval[0] = p->p_pid;
1183 }
1184
1185 int
kern_wait6(struct thread * td,idtype_t idtype,id_t id,int * status,int options,struct __wrusage * wrusage,siginfo_t * siginfo)1186 kern_wait6(struct thread *td, idtype_t idtype, id_t id, int *status,
1187 int options, struct __wrusage *wrusage, siginfo_t *siginfo)
1188 {
1189 struct proc *p, *q;
1190 pid_t pid;
1191 int error, nfound, ret;
1192 bool report;
1193
1194 AUDIT_ARG_VALUE((int)idtype); /* XXX - This is likely wrong! */
1195 AUDIT_ARG_PID((pid_t)id); /* XXX - This may be wrong! */
1196 AUDIT_ARG_VALUE(options);
1197
1198 q = td->td_proc;
1199
1200 if ((pid_t)id == WAIT_MYPGRP && (idtype == P_PID || idtype == P_PGID)) {
1201 PROC_LOCK(q);
1202 id = (id_t)q->p_pgid;
1203 PROC_UNLOCK(q);
1204 idtype = P_PGID;
1205 }
1206
1207 /* If we don't know the option, just return. */
1208 if ((options & ~(WUNTRACED | WNOHANG | WCONTINUED | WNOWAIT |
1209 WEXITED | WTRAPPED | WLINUXCLONE)) != 0)
1210 return (EINVAL);
1211 if ((options & (WEXITED | WUNTRACED | WCONTINUED | WTRAPPED)) == 0) {
1212 /*
1213 * We will be unable to find any matching processes,
1214 * because there are no known events to look for.
1215 * Prefer to return error instead of blocking
1216 * indefinitely.
1217 */
1218 return (EINVAL);
1219 }
1220
1221 loop:
1222 if (q->p_flag & P_STATCHILD) {
1223 PROC_LOCK(q);
1224 q->p_flag &= ~P_STATCHILD;
1225 PROC_UNLOCK(q);
1226 }
1227 sx_xlock(&proctree_lock);
1228 loop_locked:
1229 nfound = 0;
1230 LIST_FOREACH(p, &q->p_children, p_sibling) {
1231 pid = p->p_pid;
1232 ret = proc_to_reap(td, p, idtype, id, status, options,
1233 wrusage, siginfo, 0);
1234 if (ret == 0)
1235 continue;
1236 else if (ret != 1) {
1237 td->td_retval[0] = pid;
1238 return (0);
1239 }
1240
1241 nfound++;
1242 PROC_LOCK_ASSERT(p, MA_OWNED);
1243
1244 if ((options & WTRAPPED) != 0 &&
1245 (p->p_flag & P_TRACED) != 0) {
1246 PROC_SLOCK(p);
1247 report =
1248 ((p->p_flag & (P_STOPPED_TRACE | P_STOPPED_SIG)) &&
1249 p->p_suspcount == p->p_numthreads &&
1250 (p->p_flag & P_WAITED) == 0);
1251 PROC_SUNLOCK(p);
1252 if (report) {
1253 CTR4(KTR_PTRACE,
1254 "wait: returning trapped pid %d status %#x "
1255 "(xstat %d) xthread %d",
1256 p->p_pid, W_STOPCODE(p->p_xsig), p->p_xsig,
1257 p->p_xthread != NULL ?
1258 p->p_xthread->td_tid : -1);
1259 report_alive_proc(td, p, siginfo, status,
1260 options, CLD_TRAPPED);
1261 return (0);
1262 }
1263 }
1264 if ((options & WUNTRACED) != 0 &&
1265 (p->p_flag & P_STOPPED_SIG) != 0) {
1266 PROC_SLOCK(p);
1267 report = (p->p_suspcount == p->p_numthreads &&
1268 ((p->p_flag & P_WAITED) == 0));
1269 PROC_SUNLOCK(p);
1270 if (report) {
1271 report_alive_proc(td, p, siginfo, status,
1272 options, CLD_STOPPED);
1273 return (0);
1274 }
1275 }
1276 if ((options & WCONTINUED) != 0 &&
1277 (p->p_flag & P_CONTINUED) != 0) {
1278 report_alive_proc(td, p, siginfo, status, options,
1279 CLD_CONTINUED);
1280 return (0);
1281 }
1282 PROC_UNLOCK(p);
1283 }
1284
1285 /*
1286 * Look in the orphans list too, to allow the parent to
1287 * collect it's child exit status even if child is being
1288 * debugged.
1289 *
1290 * Debugger detaches from the parent upon successful
1291 * switch-over from parent to child. At this point due to
1292 * re-parenting the parent loses the child to debugger and a
1293 * wait4(2) call would report that it has no children to wait
1294 * for. By maintaining a list of orphans we allow the parent
1295 * to successfully wait until the child becomes a zombie.
1296 */
1297 if (nfound == 0) {
1298 LIST_FOREACH(p, &q->p_orphans, p_orphan) {
1299 ret = proc_to_reap(td, p, idtype, id, NULL, options,
1300 NULL, NULL, 1);
1301 if (ret != 0) {
1302 KASSERT(ret != -1, ("reaped an orphan (pid %d)",
1303 (int)td->td_retval[0]));
1304 PROC_UNLOCK(p);
1305 nfound++;
1306 break;
1307 }
1308 }
1309 }
1310 if (nfound == 0) {
1311 sx_xunlock(&proctree_lock);
1312 return (ECHILD);
1313 }
1314 if (options & WNOHANG) {
1315 sx_xunlock(&proctree_lock);
1316 td->td_retval[0] = 0;
1317 return (0);
1318 }
1319 PROC_LOCK(q);
1320 if (q->p_flag & P_STATCHILD) {
1321 q->p_flag &= ~P_STATCHILD;
1322 PROC_UNLOCK(q);
1323 goto loop_locked;
1324 }
1325 sx_xunlock(&proctree_lock);
1326 error = msleep(q, &q->p_mtx, PWAIT | PCATCH | PDROP, "wait", 0);
1327 if (error)
1328 return (error);
1329 goto loop;
1330 }
1331
1332 void
proc_add_orphan(struct proc * child,struct proc * parent)1333 proc_add_orphan(struct proc *child, struct proc *parent)
1334 {
1335
1336 sx_assert(&proctree_lock, SX_XLOCKED);
1337 KASSERT((child->p_flag & P_TRACED) != 0,
1338 ("proc_add_orphan: not traced"));
1339
1340 if (LIST_EMPTY(&parent->p_orphans)) {
1341 child->p_treeflag |= P_TREE_FIRST_ORPHAN;
1342 LIST_INSERT_HEAD(&parent->p_orphans, child, p_orphan);
1343 } else {
1344 LIST_INSERT_AFTER(LIST_FIRST(&parent->p_orphans),
1345 child, p_orphan);
1346 }
1347 child->p_treeflag |= P_TREE_ORPHANED;
1348 }
1349
1350 /*
1351 * Make process 'parent' the new parent of process 'child'.
1352 * Must be called with an exclusive hold of proctree lock.
1353 */
1354 void
proc_reparent(struct proc * child,struct proc * parent,bool set_oppid)1355 proc_reparent(struct proc *child, struct proc *parent, bool set_oppid)
1356 {
1357
1358 sx_assert(&proctree_lock, SX_XLOCKED);
1359 PROC_LOCK_ASSERT(child, MA_OWNED);
1360 if (child->p_pptr == parent)
1361 return;
1362
1363 PROC_LOCK(child->p_pptr);
1364 sigqueue_take(child->p_ksi);
1365 PROC_UNLOCK(child->p_pptr);
1366 LIST_REMOVE(child, p_sibling);
1367 LIST_INSERT_HEAD(&parent->p_children, child, p_sibling);
1368
1369 proc_clear_orphan(child);
1370 if ((child->p_flag & P_TRACED) != 0) {
1371 proc_add_orphan(child, child->p_pptr);
1372 }
1373
1374 child->p_pptr = parent;
1375 if (set_oppid)
1376 child->p_oppid = parent->p_pid;
1377 }
1378