Resync patch with contrib.
[dragonfly.git] / sys / kern / kern_exit.c
blobfaf5c97095b5c3319c593cf5cf69f58faee7364f
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.
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. All advertising materials mentioning features or use of this software
19 * must display the following acknowledgement:
20 * This product includes software developed by the University of
21 * California, Berkeley and its contributors.
22 * 4. Neither the name of the University nor the names of its contributors
23 * may be used to endorse or promote products derived from this software
24 * without specific prior written permission.
26 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 * SUCH DAMAGE.
38 * @(#)kern_exit.c 8.7 (Berkeley) 2/12/94
39 * $FreeBSD: src/sys/kern/kern_exit.c,v 1.92.2.11 2003/01/13 22:51:16 dillon Exp $
40 * $DragonFly: src/sys/kern/kern_exit.c,v 1.86 2007/08/30 20:41:00 pavalos Exp $
43 #include "opt_compat.h"
44 #include "opt_ktrace.h"
46 #include <sys/param.h>
47 #include <sys/systm.h>
48 #include <sys/sysproto.h>
49 #include <sys/kernel.h>
50 #include <sys/malloc.h>
51 #include <sys/proc.h>
52 #include <sys/ktrace.h>
53 #include <sys/pioctl.h>
54 #include <sys/tty.h>
55 #include <sys/wait.h>
56 #include <sys/vnode.h>
57 #include <sys/resourcevar.h>
58 #include <sys/signalvar.h>
59 #include <sys/taskqueue.h>
60 #include <sys/ptrace.h>
61 #include <sys/acct.h> /* for acct_process() function prototype */
62 #include <sys/filedesc.h>
63 #include <sys/shm.h>
64 #include <sys/sem.h>
65 #include <sys/aio.h>
66 #include <sys/jail.h>
67 #include <sys/kern_syscall.h>
68 #include <sys/upcall.h>
69 #include <sys/caps.h>
70 #include <sys/unistd.h>
72 #include <vm/vm.h>
73 #include <vm/vm_param.h>
74 #include <sys/lock.h>
75 #include <vm/pmap.h>
76 #include <vm/vm_map.h>
77 #include <vm/vm_zone.h>
78 #include <vm/vm_extern.h>
79 #include <sys/user.h>
81 #include <sys/thread2.h>
82 #include <sys/sysref2.h>
84 static void reaplwps(void *context, int dummy);
85 static void reaplwp(struct lwp *lp);
86 static void killlwps(struct lwp *lp);
88 static MALLOC_DEFINE(M_ATEXIT, "atexit", "atexit callback");
89 static MALLOC_DEFINE(M_ZOMBIE, "zombie", "zombie proc status");
92 * callout list for things to do at exit time
94 struct exitlist {
95 exitlist_fn function;
96 TAILQ_ENTRY(exitlist) next;
99 TAILQ_HEAD(exit_list_head, exitlist);
100 static struct exit_list_head exit_list = TAILQ_HEAD_INITIALIZER(exit_list);
103 * LWP reaper data
105 struct task *deadlwp_task[MAXCPU];
106 struct lwplist deadlwp_list[MAXCPU];
109 * exit --
110 * Death of process.
112 * SYS_EXIT_ARGS(int rval)
115 sys_exit(struct exit_args *uap)
117 exit1(W_EXITCODE(uap->rval, 0));
118 /* NOTREACHED */
122 * Extended exit --
123 * Death of a lwp or process with optional bells and whistles.
126 sys_extexit(struct extexit_args *uap)
128 int action, who;
129 int error;
131 action = EXTEXIT_ACTION(uap->how);
132 who = EXTEXIT_WHO(uap->how);
134 /* Check parameters before we might perform some action */
135 switch (who) {
136 case EXTEXIT_PROC:
137 case EXTEXIT_LWP:
138 break;
140 default:
141 return (EINVAL);
144 switch (action) {
145 case EXTEXIT_SIMPLE:
146 break;
148 case EXTEXIT_SETINT:
149 error = copyout(&uap->status, uap->addr, sizeof(uap->status));
150 if (error)
151 return (error);
152 break;
154 default:
155 return (EINVAL);
158 switch (who) {
159 case EXTEXIT_LWP:
161 * Be sure only to perform a simple lwp exit if there is at
162 * least one more lwp in the proc, which will call exit1()
163 * later, otherwise the proc will be an UNDEAD and not even a
164 * SZOMB!
166 if (curproc->p_nthreads > 1) {
167 lwp_exit(0);
168 /* NOT REACHED */
170 /* else last lwp in proc: do the real thing */
171 /* FALLTHROUGH */
173 default: /* to help gcc */
174 case EXTEXIT_PROC:
175 exit1(W_EXITCODE(uap->status, 0));
176 /* NOTREACHED */
179 /* NOTREACHED */
183 * Kill all lwps associated with the current process except the
184 * current lwp. Return an error if we race another thread trying to
185 * do the same thing and lose the race.
187 * If forexec is non-zero the current thread and process flags are
188 * cleaned up so they can be reused.
191 killalllwps(int forexec)
193 struct lwp *lp = curthread->td_lwp;
194 struct proc *p = lp->lwp_proc;
197 * Interlock against P_WEXIT. Only one of the process's thread
198 * is allowed to do the master exit.
200 if (p->p_flag & P_WEXIT)
201 return (EALREADY);
202 p->p_flag |= P_WEXIT;
205 * Interlock with LWP_WEXIT and kill any remaining LWPs
207 lp->lwp_flag |= LWP_WEXIT;
208 if (p->p_nthreads > 1)
209 killlwps(lp);
212 * If doing this for an exec, clean up the remaining thread
213 * (us) for continuing operation after all the other threads
214 * have been killed.
216 if (forexec) {
217 lp->lwp_flag &= ~LWP_WEXIT;
218 p->p_flag &= ~P_WEXIT;
220 return(0);
224 * Kill all LWPs except the current one. Do not try to signal
225 * LWPs which have exited on their own or have already been
226 * signaled.
228 static void
229 killlwps(struct lwp *lp)
231 struct proc *p = lp->lwp_proc;
232 struct lwp *tlp;
235 * Kill the remaining LWPs, interlock with LWP_WEXIT.
237 FOREACH_LWP_IN_PROC(tlp, p) {
238 if ((tlp->lwp_flag & LWP_WEXIT) == 0) {
239 lwpsignal(p, tlp, SIGKILL);
240 tlp->lwp_flag |= LWP_WEXIT;
245 * Wait for everything to clear out.
247 while (p->p_nthreads > 1) {
248 if (bootverbose)
249 kprintf("killlwps: waiting for %d lwps of pid "
250 "%d to die\n",
251 p->p_nthreads - 1, p->p_pid);
252 tsleep(&p->p_nthreads, 0, "killlwps", hz);
257 * Exit: deallocate address space and other resources, change proc state
258 * to zombie, and unlink proc from allproc and parent's lists. Save exit
259 * status and rusage for wait(). Check for child processes and orphan them.
261 void
262 exit1(int rv)
264 struct thread *td = curthread;
265 struct proc *p = td->td_proc;
266 struct lwp *lp = td->td_lwp;
267 struct proc *q, *nq;
268 struct vmspace *vm;
269 struct vnode *vtmp;
270 struct exitlist *ep;
271 int error;
273 if (p->p_pid == 1) {
274 kprintf("init died (signal %d, exit %d)\n",
275 WTERMSIG(rv), WEXITSTATUS(rv));
276 panic("Going nowhere without my init!");
280 * Kill all lwps associated with the current process, return an
281 * error if we race another thread trying to do the same thing
282 * and lose the race.
284 error = killalllwps(0);
285 if (error) {
286 lwp_exit(0);
287 /* NOT REACHED */
290 caps_exit(lp->lwp_thread);
291 aio_proc_rundown(p);
293 /* are we a task leader? */
294 if (p == p->p_leader) {
295 struct kill_args killArgs;
296 killArgs.signum = SIGKILL;
297 q = p->p_peers;
298 while(q) {
299 killArgs.pid = q->p_pid;
301 * The interface for kill is better
302 * than the internal signal
304 sys_kill(&killArgs);
305 nq = q;
306 q = q->p_peers;
308 while (p->p_peers)
309 tsleep((caddr_t)p, 0, "exit1", 0);
312 #ifdef PGINPROF
313 vmsizmon();
314 #endif
315 STOPEVENT(p, S_EXIT, rv);
316 wakeup(&p->p_stype); /* Wakeup anyone in procfs' PIOCWAIT */
319 * Check if any loadable modules need anything done at process exit.
320 * e.g. SYSV IPC stuff
321 * XXX what if one of these generates an error?
323 TAILQ_FOREACH(ep, &exit_list, next)
324 (*ep->function)(td);
326 if (p->p_flag & P_PROFIL)
327 stopprofclock(p);
329 * If parent is waiting for us to exit or exec,
330 * P_PPWAIT is set; we will wakeup the parent below.
332 p->p_flag &= ~(P_TRACED | P_PPWAIT);
333 SIGEMPTYSET(p->p_siglist);
334 SIGEMPTYSET(lp->lwp_siglist);
335 if (timevalisset(&p->p_realtimer.it_value))
336 callout_stop(&p->p_ithandle);
339 * Reset any sigio structures pointing to us as a result of
340 * F_SETOWN with our pid.
342 funsetownlst(&p->p_sigiolst);
345 * Close open files and release open-file table.
346 * This may block!
348 fdfree(p);
349 p->p_fd = NULL;
351 if(p->p_leader->p_peers) {
352 q = p->p_leader;
353 while(q->p_peers != p)
354 q = q->p_peers;
355 q->p_peers = p->p_peers;
356 wakeup((caddr_t)p->p_leader);
360 * XXX Shutdown SYSV semaphores
362 semexit(p);
364 KKASSERT(p->p_numposixlocks == 0);
366 /* The next two chunks should probably be moved to vmspace_exit. */
367 vm = p->p_vmspace;
370 * Release upcalls associated with this process
372 if (vm->vm_upcalls)
373 upc_release(vm, lp);
376 * Clean up data related to virtual kernel operation. Clean up
377 * any vkernel context related to the current lwp now so we can
378 * destroy p_vkernel.
380 if (p->p_vkernel) {
381 vkernel_lwp_exit(lp);
382 vkernel_exit(p);
386 * Release user portion of address space.
387 * This releases references to vnodes,
388 * which could cause I/O if the file has been unlinked.
389 * Need to do this early enough that we can still sleep.
390 * Can't free the entire vmspace as the kernel stack
391 * may be mapped within that space also.
393 * Processes sharing the same vmspace may exit in one order, and
394 * get cleaned up by vmspace_exit() in a different order. The
395 * last exiting process to reach this point releases as much of
396 * the environment as it can, and the last process cleaned up
397 * by vmspace_exit() (which decrements exitingcnt) cleans up the
398 * remainder.
400 ++vm->vm_exitingcnt;
401 sysref_put(&vm->vm_sysref);
403 if (SESS_LEADER(p)) {
404 struct session *sp = p->p_session;
406 if (sp->s_ttyvp) {
408 * We are the controlling process. Signal the
409 * foreground process group, drain the controlling
410 * terminal, and revoke access to the controlling
411 * terminal.
413 * NOTE: while waiting for the process group to exit
414 * it is possible that one of the processes in the
415 * group will revoke the tty, so the ttyclosesession()
416 * function will re-check sp->s_ttyvp.
418 if (sp->s_ttyp && (sp->s_ttyp->t_session == sp)) {
419 if (sp->s_ttyp->t_pgrp)
420 pgsignal(sp->s_ttyp->t_pgrp, SIGHUP, 1);
421 ttywait(sp->s_ttyp);
422 ttyclosesession(sp, 1); /* also revoke */
425 * Release the tty. If someone has it open via
426 * /dev/tty then close it (since they no longer can
427 * once we've NULL'd it out).
429 ttyclosesession(sp, 0);
432 * s_ttyp is not zero'd; we use this to indicate
433 * that the session once had a controlling terminal.
434 * (for logging and informational purposes)
437 sp->s_leader = NULL;
439 fixjobc(p, p->p_pgrp, 0);
440 (void)acct_process(p);
441 #ifdef KTRACE
443 * release trace file
445 if (p->p_tracenode)
446 ktrdestroy(&p->p_tracenode);
447 p->p_traceflag = 0;
448 #endif
450 * Release reference to text vnode
452 if ((vtmp = p->p_textvp) != NULL) {
453 p->p_textvp = NULL;
454 vrele(vtmp);
458 * Move the process to the zombie list. This will block
459 * until the process p_lock count reaches 0. The process will
460 * not be reaped until TDF_EXITING is set by cpu_thread_exit(),
461 * which is called from cpu_proc_exit().
463 proc_move_allproc_zombie(p);
465 q = LIST_FIRST(&p->p_children);
466 if (q) /* only need this if any child is S_ZOMB */
467 wakeup((caddr_t) initproc);
468 for (; q != 0; q = nq) {
469 nq = LIST_NEXT(q, p_sibling);
470 LIST_REMOVE(q, p_sibling);
471 LIST_INSERT_HEAD(&initproc->p_children, q, p_sibling);
472 q->p_pptr = initproc;
473 q->p_sigparent = SIGCHLD;
475 * Traced processes are killed
476 * since their existence means someone is screwing up.
478 if (q->p_flag & P_TRACED) {
479 q->p_flag &= ~P_TRACED;
480 ksignal(q, SIGKILL);
485 * Save exit status and final rusage info, adding in child rusage
486 * info and self times.
488 p->p_xstat = rv;
489 calcru_proc(p, &p->p_ru);
490 ruadd(&p->p_ru, &p->p_cru);
493 * notify interested parties of our demise.
495 KNOTE(&p->p_klist, NOTE_EXIT);
498 * Notify parent that we're gone. If parent has the PS_NOCLDWAIT
499 * flag set, notify process 1 instead (and hope it will handle
500 * this situation).
502 if (p->p_pptr->p_sigacts->ps_flag & PS_NOCLDWAIT) {
503 struct proc *pp = p->p_pptr;
504 proc_reparent(p, initproc);
506 * If this was the last child of our parent, notify
507 * parent, so in case he was wait(2)ing, he will
508 * continue.
510 if (LIST_EMPTY(&pp->p_children))
511 wakeup((caddr_t)pp);
514 if (p->p_sigparent && p->p_pptr != initproc) {
515 ksignal(p->p_pptr, p->p_sigparent);
516 } else {
517 ksignal(p->p_pptr, SIGCHLD);
520 wakeup((caddr_t)p->p_pptr);
522 * cpu_exit is responsible for clearing curproc, since
523 * it is heavily integrated with the thread/switching sequence.
525 * Other substructures are freed from wait().
527 plimit_free(&p->p_limit);
530 * Release the current user process designation on the process so
531 * the userland scheduler can work in someone else.
533 p->p_usched->release_curproc(lp);
536 * Finally, call machine-dependent code to release as many of the
537 * lwp's resources as we can and halt execution of this thread.
539 lwp_exit(1);
542 void
543 lwp_exit(int masterexit)
545 struct lwp *lp = curthread->td_lwp;
546 struct proc *p = lp->lwp_proc;
549 * lwp_exit() may be called without setting LWP_WEXIT, so
550 * make sure it is set here.
552 lp->lwp_flag |= LWP_WEXIT;
555 * Clean up any virtualization
557 if (lp->lwp_vkernel)
558 vkernel_lwp_exit(lp);
561 * Nobody actually wakes us when the lock
562 * count reaches zero, so just wait one tick.
564 while (lp->lwp_lock > 0)
565 tsleep(lp, 0, "lwpexit", 1);
567 /* Hand down resource usage to our proc */
568 ruadd(&p->p_ru, &lp->lwp_ru);
571 * If we don't hold the process until the LWP is reaped wait*()
572 * may try to dispose of its vmspace before all the LWPs have
573 * actually terminated.
575 PHOLD(p);
578 * We have to use the reaper for all the LWPs except the one doing
579 * the master exit. The LWP doing the master exit can just be
580 * left on p_lwps and the process reaper will deal with it
581 * synchronously, which is much faster.
583 if (masterexit == 0) {
584 lwp_rb_tree_RB_REMOVE(&p->p_lwp_tree, lp);
585 --p->p_nthreads;
586 wakeup(&p->p_nthreads);
587 LIST_INSERT_HEAD(&deadlwp_list[mycpuid], lp, u.lwp_reap_entry);
588 taskqueue_enqueue(taskqueue_thread[mycpuid], deadlwp_task[mycpuid]);
589 } else {
590 --p->p_nthreads;
592 cpu_lwp_exit();
596 * Wait until a lwp is completely dead.
598 * If the thread is still executing, which can't be waited upon,
599 * return failure. The caller is responsible of waiting a little
600 * bit and checking again.
602 * Suggested use:
603 * while (!lwp_wait(lp))
604 * tsleep(lp, 0, "lwpwait", 1);
606 static int
607 lwp_wait(struct lwp *lp)
609 struct thread *td = lp->lwp_thread;;
611 KKASSERT(lwkt_preempted_proc() != lp);
613 while (lp->lwp_lock > 0)
614 tsleep(lp, 0, "lwpwait1", 1);
616 lwkt_wait_free(td);
619 * The lwp's thread may still be in the middle
620 * of switching away, we can't rip its stack out from
621 * under it until TDF_EXITING is set and both
622 * TDF_RUNNING and TDF_PREEMPT_LOCK are clear.
623 * TDF_PREEMPT_LOCK must be checked because TDF_RUNNING
624 * will be cleared temporarily if a thread gets
625 * preempted.
627 * YYY no wakeup occurs, so we simply return failure
628 * and let the caller deal with sleeping and calling
629 * us again.
631 if ((td->td_flags & (TDF_RUNNING|TDF_PREEMPT_LOCK|TDF_EXITING)) !=
632 TDF_EXITING)
633 return (0);
635 return (1);
639 * Release the resources associated with a lwp.
640 * The lwp must be completely dead.
642 void
643 lwp_dispose(struct lwp *lp)
645 struct thread *td = lp->lwp_thread;;
647 KKASSERT(lwkt_preempted_proc() != lp);
648 KKASSERT(td->td_refs == 0);
649 KKASSERT((td->td_flags & (TDF_RUNNING|TDF_PREEMPT_LOCK|TDF_EXITING)) ==
650 TDF_EXITING);
652 PRELE(lp->lwp_proc);
653 lp->lwp_proc = NULL;
654 if (td != NULL) {
655 td->td_proc = NULL;
656 td->td_lwp = NULL;
657 lp->lwp_thread = NULL;
658 lwkt_free_thread(td);
660 zfree(lwp_zone, lp);
664 sys_wait4(struct wait_args *uap)
666 struct rusage rusage;
667 int error, status;
669 error = kern_wait(uap->pid, uap->status ? &status : NULL,
670 uap->options, uap->rusage ? &rusage : NULL, &uap->sysmsg_fds[0]);
672 if (error == 0 && uap->status)
673 error = copyout(&status, uap->status, sizeof(*uap->status));
674 if (error == 0 && uap->rusage)
675 error = copyout(&rusage, uap->rusage, sizeof(*uap->rusage));
676 return (error);
680 * wait1()
682 * wait_args(int pid, int *status, int options, struct rusage *rusage)
685 kern_wait(pid_t pid, int *status, int options, struct rusage *rusage, int *res)
687 struct thread *td = curthread;
688 struct lwp *lp;
689 struct proc *q = td->td_proc;
690 struct proc *p, *t;
691 int nfound, error;
693 if (pid == 0)
694 pid = -q->p_pgid;
695 if (options &~ (WUNTRACED|WNOHANG|WCONTINUED|WLINUXCLONE))
696 return (EINVAL);
697 loop:
699 * Hack for backwards compatibility with badly written user code.
700 * Or perhaps we have to do this anyway, it is unclear. XXX
702 * The problem is that if a process group is stopped and the parent
703 * is doing a wait*(..., WUNTRACED, ...), it will see the STOP
704 * of the child and then stop itself when it tries to return from the
705 * system call. When the process group is resumed the parent will
706 * then get the STOP status even though the child has now resumed
707 * (a followup wait*() will get the CONT status).
709 * Previously the CONT would overwrite the STOP because the tstop
710 * was handled within tsleep(), and the parent would only see
711 * the CONT when both are stopped and continued together. This litte
712 * two-line hack restores this effect.
714 while (q->p_stat == SSTOP)
715 tstop();
717 nfound = 0;
718 LIST_FOREACH(p, &q->p_children, p_sibling) {
719 if (pid != WAIT_ANY &&
720 p->p_pid != pid && p->p_pgid != -pid)
721 continue;
723 /* This special case handles a kthread spawned by linux_clone
724 * (see linux_misc.c). The linux_wait4 and linux_waitpid
725 * functions need to be able to distinguish between waiting
726 * on a process and waiting on a thread. It is a thread if
727 * p_sigparent is not SIGCHLD, and the WLINUXCLONE option
728 * signifies we want to wait for threads and not processes.
730 if ((p->p_sigparent != SIGCHLD) ^
731 ((options & WLINUXCLONE) != 0)) {
732 continue;
735 nfound++;
736 if (p->p_stat == SZOMB) {
738 * Reap any LWPs left in p->p_lwps. This is usually
739 * just the last LWP. This must be done before
740 * we loop on p_lock since the lwps hold a ref on
741 * it as a vmspace interlock.
743 * Once that is accomplished p_nthreads had better
744 * be zero.
746 while ((lp = RB_ROOT(&p->p_lwp_tree)) != NULL) {
747 lwp_rb_tree_RB_REMOVE(&p->p_lwp_tree, lp);
748 reaplwp(lp);
750 KKASSERT(p->p_nthreads == 0);
753 * Don't do anything really bad until all references
754 * to the process go away. This may include other
755 * LWPs which are still in the process of being
756 * reaped. We can't just pull the rug out from under
757 * them because they may still be using the VM space.
759 * Certain kernel facilities such as /proc will also
760 * put a hold on the process for short periods of
761 * time.
763 while (p->p_lock)
764 tsleep(p, 0, "reap3", hz);
766 /* scheduling hook for heuristic */
767 /* XXX no lwp available, we need a different heuristic */
769 p->p_usched->heuristic_exiting(td->td_lwp, deadlp);
772 /* Take care of our return values. */
773 *res = p->p_pid;
774 if (status)
775 *status = p->p_xstat;
776 if (rusage)
777 *rusage = p->p_ru;
779 * If we got the child via a ptrace 'attach',
780 * we need to give it back to the old parent.
782 if (p->p_oppid && (t = pfind(p->p_oppid))) {
783 p->p_oppid = 0;
784 proc_reparent(p, t);
785 ksignal(t, SIGCHLD);
786 wakeup((caddr_t)t);
787 return (0);
789 p->p_xstat = 0;
790 ruadd(&q->p_cru, &p->p_ru);
793 * Decrement the count of procs running with this uid.
795 chgproccnt(p->p_ucred->cr_ruidinfo, -1, 0);
798 * Free up credentials.
800 crfree(p->p_ucred);
801 p->p_ucred = NULL;
804 * Remove unused arguments
806 if (p->p_args && --p->p_args->ar_ref == 0)
807 FREE(p->p_args, M_PARGS);
810 * Finally finished with old proc entry.
811 * Unlink it from its process group and free it.
813 proc_remove_zombie(p);
814 leavepgrp(p);
816 if (--p->p_sigacts->ps_refcnt == 0) {
817 kfree(p->p_sigacts, M_SUBPROC);
818 p->p_sigacts = NULL;
821 vm_waitproc(p);
822 zfree(proc_zone, p);
823 nprocs--;
824 return (0);
826 if (p->p_stat == SSTOP && (p->p_flag & P_WAITED) == 0 &&
827 (p->p_flag & P_TRACED || options & WUNTRACED)) {
828 p->p_flag |= P_WAITED;
830 *res = p->p_pid;
831 if (status)
832 *status = W_STOPCODE(p->p_xstat);
833 /* Zero rusage so we get something consistent. */
834 if (rusage)
835 bzero(rusage, sizeof(rusage));
836 return (0);
838 if (options & WCONTINUED && (p->p_flag & P_CONTINUED)) {
839 *res = p->p_pid;
840 p->p_flag &= ~P_CONTINUED;
842 if (status)
843 *status = SIGCONT;
844 return (0);
847 if (nfound == 0)
848 return (ECHILD);
849 if (options & WNOHANG) {
850 *res = 0;
851 return (0);
853 error = tsleep((caddr_t)q, PCATCH, "wait", 0);
854 if (error)
855 return (error);
856 goto loop;
860 * make process 'parent' the new parent of process 'child'.
862 void
863 proc_reparent(struct proc *child, struct proc *parent)
866 if (child->p_pptr == parent)
867 return;
869 LIST_REMOVE(child, p_sibling);
870 LIST_INSERT_HEAD(&parent->p_children, child, p_sibling);
871 child->p_pptr = parent;
875 * The next two functions are to handle adding/deleting items on the
876 * exit callout list
878 * at_exit():
879 * Take the arguments given and put them onto the exit callout list,
880 * However first make sure that it's not already there.
881 * returns 0 on success.
885 at_exit(exitlist_fn function)
887 struct exitlist *ep;
889 #ifdef INVARIANTS
890 /* Be noisy if the programmer has lost track of things */
891 if (rm_at_exit(function))
892 kprintf("WARNING: exit callout entry (%p) already present\n",
893 function);
894 #endif
895 ep = kmalloc(sizeof(*ep), M_ATEXIT, M_NOWAIT);
896 if (ep == NULL)
897 return (ENOMEM);
898 ep->function = function;
899 TAILQ_INSERT_TAIL(&exit_list, ep, next);
900 return (0);
904 * Scan the exit callout list for the given item and remove it.
905 * Returns the number of items removed (0 or 1)
908 rm_at_exit(exitlist_fn function)
910 struct exitlist *ep;
912 TAILQ_FOREACH(ep, &exit_list, next) {
913 if (ep->function == function) {
914 TAILQ_REMOVE(&exit_list, ep, next);
915 kfree(ep, M_ATEXIT);
916 return(1);
919 return (0);
923 * LWP reaper related code.
925 static void
926 reaplwps(void *context, int dummy)
928 struct lwplist *lwplist = context;
929 struct lwp *lp;
931 while ((lp = LIST_FIRST(lwplist))) {
932 LIST_REMOVE(lp, u.lwp_reap_entry);
933 reaplwp(lp);
937 static void
938 reaplwp(struct lwp *lp)
940 while (lwp_wait(lp) == 0)
941 tsleep(lp, 0, "lwpreap", 1);
942 lwp_dispose(lp);
945 static void
946 deadlwp_init(void)
948 int cpu;
950 for (cpu = 0; cpu < ncpus; cpu++) {
951 LIST_INIT(&deadlwp_list[cpu]);
952 deadlwp_task[cpu] = kmalloc(sizeof(*deadlwp_task[cpu]), M_DEVBUF, M_WAITOK);
953 TASK_INIT(deadlwp_task[cpu], 0, reaplwps, &deadlwp_list[cpu]);
957 SYSINIT(deadlwpinit, SI_SUB_CONFIGURE, SI_ORDER_ANY, deadlwp_init, NULL);