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