kern_exit.c revision 1.137 1 /* $NetBSD: kern_exit.c,v 1.137 2004/03/02 09:15:26 yamt Exp $ */
2
3 /*-
4 * Copyright (c) 1998, 1999 The NetBSD Foundation, Inc.
5 * All rights reserved.
6 *
7 * This code is derived from software contributed to The NetBSD Foundation
8 * by Jason R. Thorpe of the Numerical Aerospace Simulation Facility,
9 * NASA Ames Research Center.
10 *
11 * Redistribution and use in source and binary forms, with or without
12 * modification, are permitted provided that the following conditions
13 * are met:
14 * 1. Redistributions of source code must retain the above copyright
15 * notice, this list of conditions and the following disclaimer.
16 * 2. Redistributions in binary form must reproduce the above copyright
17 * notice, this list of conditions and the following disclaimer in the
18 * documentation and/or other materials provided with the distribution.
19 * 3. All advertising materials mentioning features or use of this software
20 * must display the following acknowledgement:
21 * This product includes software developed by the NetBSD
22 * Foundation, Inc. and its contributors.
23 * 4. Neither the name of The NetBSD Foundation nor the names of its
24 * contributors may be used to endorse or promote products derived
25 * from this software without specific prior written permission.
26 *
27 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
28 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
29 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
30 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
31 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
32 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
33 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
34 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
35 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
36 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
37 * POSSIBILITY OF SUCH DAMAGE.
38 */
39
40 /*
41 * Copyright (c) 1982, 1986, 1989, 1991, 1993
42 * The Regents of the University of California. All rights reserved.
43 * (c) UNIX System Laboratories, Inc.
44 * All or some portions of this file are derived from material licensed
45 * to the University of California by American Telephone and Telegraph
46 * Co. or Unix System Laboratories, Inc. and are reproduced herein with
47 * the permission of UNIX System Laboratories, Inc.
48 *
49 * Redistribution and use in source and binary forms, with or without
50 * modification, are permitted provided that the following conditions
51 * are met:
52 * 1. Redistributions of source code must retain the above copyright
53 * notice, this list of conditions and the following disclaimer.
54 * 2. Redistributions in binary form must reproduce the above copyright
55 * notice, this list of conditions and the following disclaimer in the
56 * documentation and/or other materials provided with the distribution.
57 * 3. Neither the name of the University nor the names of its contributors
58 * may be used to endorse or promote products derived from this software
59 * without specific prior written permission.
60 *
61 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
62 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
63 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
64 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
65 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
66 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
67 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
68 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
69 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
70 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
71 * SUCH DAMAGE.
72 *
73 * @(#)kern_exit.c 8.10 (Berkeley) 2/23/95
74 */
75
76 #include <sys/cdefs.h>
77 __KERNEL_RCSID(0, "$NetBSD: kern_exit.c,v 1.137 2004/03/02 09:15:26 yamt Exp $");
78
79 #include "opt_ktrace.h"
80 #include "opt_perfctrs.h"
81 #include "opt_systrace.h"
82 #include "opt_sysv.h"
83
84 #include <sys/param.h>
85 #include <sys/systm.h>
86 #include <sys/ioctl.h>
87 #include <sys/proc.h>
88 #include <sys/tty.h>
89 #include <sys/time.h>
90 #include <sys/resource.h>
91 #include <sys/kernel.h>
92 #include <sys/ktrace.h>
93 #include <sys/proc.h>
94 #include <sys/buf.h>
95 #include <sys/wait.h>
96 #include <sys/file.h>
97 #include <sys/vnode.h>
98 #include <sys/syslog.h>
99 #include <sys/malloc.h>
100 #include <sys/pool.h>
101 #include <sys/resourcevar.h>
102 #if defined(PERFCTRS)
103 #include <sys/pmc.h>
104 #endif
105 #include <sys/ptrace.h>
106 #include <sys/acct.h>
107 #include <sys/filedesc.h>
108 #include <sys/ras.h>
109 #include <sys/signalvar.h>
110 #include <sys/sched.h>
111 #include <sys/sa.h>
112 #include <sys/savar.h>
113 #include <sys/mount.h>
114 #include <sys/syscallargs.h>
115 #include <sys/systrace.h>
116
117 #include <machine/cpu.h>
118
119 #include <uvm/uvm_extern.h>
120
121 #define DEBUG_EXIT
122
123 #ifdef DEBUG_EXIT
124 int debug_exit = 0;
125 #define DPRINTF(x) if (debug_exit) printf x
126 #else
127 #define DPRINTF(x)
128 #endif
129
130 static void lwp_exit_hook(struct lwp *, void *);
131 static void exit_psignal(struct proc *, struct proc *);
132
133 /*
134 * Fill in the appropriate signal information, and signal the parent.
135 */
136 static void
137 exit_psignal(struct proc *p, struct proc *pp)
138 {
139 ksiginfo_t ksi;
140
141 (void)memset(&ksi, 0, sizeof(ksi));
142 if ((ksi.ksi_signo = P_EXITSIG(p)) == SIGCHLD) {
143 if (WIFSIGNALED(p->p_xstat)) {
144 if (WCOREDUMP(p->p_xstat))
145 ksi.ksi_code = CLD_DUMPED;
146 else
147 ksi.ksi_code = CLD_KILLED;
148 } else {
149 ksi.ksi_code = CLD_EXITED;
150 }
151 }
152 /*
153 * we fill those in, even for non-SIGCHLD.
154 */
155 ksi.ksi_pid = p->p_pid;
156 ksi.ksi_uid = p->p_ucred->cr_uid;
157 ksi.ksi_status = p->p_xstat;
158 /* XXX: is this still valid? */
159 ksi.ksi_utime = p->p_ru->ru_utime.tv_sec;
160 ksi.ksi_stime = p->p_ru->ru_stime.tv_sec;
161 kpsignal(pp, &ksi, NULL);
162 }
163
164 /*
165 * exit --
166 * Death of process.
167 */
168 int
169 sys_exit(struct lwp *l, void *v, register_t *retval)
170 {
171 struct sys_exit_args /* {
172 syscallarg(int) rval;
173 } */ *uap = v;
174
175 /* Don't call exit1() multiple times in the same process.*/
176 if (l->l_proc->p_flag & P_WEXIT)
177 lwp_exit(l);
178
179 exit1(l, W_EXITCODE(SCARG(uap, rval), 0));
180 /* NOTREACHED */
181 return (0);
182 }
183
184 /*
185 * Exit: deallocate address space and other resources, change proc state
186 * to zombie, and unlink proc from allproc and parent's lists. Save exit
187 * status and rusage for wait(). Check for child processes and orphan them.
188 */
189 void
190 exit1(struct lwp *l, int rv)
191 {
192 struct proc *p, *q, *nq;
193 int s, sa;
194
195 p = l->l_proc;
196
197 if (__predict_false(p == initproc))
198 panic("init died (signal %d, exit %d)",
199 WTERMSIG(rv), WEXITSTATUS(rv));
200
201 p->p_flag |= P_WEXIT;
202 if (p->p_flag & P_STOPEXIT) {
203 int s;
204
205 sigminusset(&contsigmask, &p->p_sigctx.ps_siglist);
206 SCHED_LOCK(s);
207 p->p_stat = SSTOP;
208 l->l_stat = LSSTOP;
209 p->p_nrlwps--;
210 mi_switch(l, NULL);
211 SCHED_ASSERT_UNLOCKED();
212 splx(s);
213 }
214
215 DPRINTF(("exit1: %d.%d exiting.\n", p->p_pid, l->l_lid));
216 /*
217 * Disable scheduler activation upcalls.
218 * We're trying to get out of here.
219 */
220 sa = 0;
221 if (p->p_sa != NULL) {
222 l->l_flag &= ~L_SA;
223 #if 0
224 p->p_flag &= ~P_SA;
225 #endif
226 sa = 1;
227 }
228
229 #ifdef PGINPROF
230 vmsizmon();
231 #endif
232 if (p->p_flag & P_PROFIL)
233 stopprofclock(p);
234 p->p_ru = pool_get(&rusage_pool, PR_WAITOK);
235 /*
236 * If parent is waiting for us to exit or exec, P_PPWAIT is set; we
237 * wake up the parent early to avoid deadlock.
238 */
239 if (p->p_flag & P_PPWAIT) {
240 p->p_flag &= ~P_PPWAIT;
241 wakeup(p->p_pptr);
242 }
243 sigfillset(&p->p_sigctx.ps_sigignore);
244 sigemptyset(&p->p_sigctx.ps_siglist);
245 p->p_sigctx.ps_sigcheck = 0;
246 timers_free(p, TIMERS_ALL);
247
248 if (sa || (p->p_nlwps > 1)) {
249 exit_lwps(l);
250
251 /*
252 * Collect thread u-areas.
253 */
254 uvm_uarea_drain(FALSE);
255 }
256
257 #if defined(__HAVE_RAS)
258 ras_purgeall(p);
259 #endif
260
261 /*
262 * Close open files and release open-file table.
263 * This may block!
264 */
265 fdfree(p);
266 cwdfree(p);
267
268 doexithooks(p);
269
270 if (SESS_LEADER(p)) {
271 struct session *sp = p->p_session;
272 struct tty *tp;
273
274 if (sp->s_ttyvp) {
275 /*
276 * Controlling process.
277 * Signal foreground pgrp,
278 * drain controlling terminal
279 * and revoke access to controlling terminal.
280 */
281 tp = sp->s_ttyp;
282 TTY_LOCK(tp);
283 if (tp->t_session == sp) {
284 if (tp->t_pgrp)
285 pgsignal(tp->t_pgrp, SIGHUP, 1);
286 /* we can't guarantee the revoke will do this */
287 tp->t_pgrp = NULL;
288 tp->t_session = NULL;
289 TTY_UNLOCK(tp);
290 SESSRELE(sp);
291 (void) ttywait(tp);
292 /*
293 * The tty could have been revoked
294 * if we blocked.
295 */
296 if (sp->s_ttyvp)
297 VOP_REVOKE(sp->s_ttyvp, REVOKEALL);
298 } else
299 TTY_UNLOCK(tp);
300 if (sp->s_ttyvp)
301 vrele(sp->s_ttyvp);
302 sp->s_ttyvp = NULL;
303 /*
304 * s_ttyp is not zero'd; we use this to indicate
305 * that the session once had a controlling terminal.
306 * (for logging and informational purposes)
307 */
308 }
309 sp->s_leader = NULL;
310 }
311 fixjobc(p, p->p_pgrp, 0);
312 (void)acct_process(p);
313 #ifdef KTRACE
314 /*
315 * release trace file
316 */
317 ktrderef(p);
318 #endif
319 #ifdef SYSTRACE
320 systrace_sys_exit(p);
321 #endif
322 /*
323 * If emulation has process exit hook, call it now.
324 */
325 if (p->p_emul->e_proc_exit)
326 (*p->p_emul->e_proc_exit)(p);
327
328 /*
329 * Reset p_opptr pointer of all former children which got
330 * traced by another process and were reparented. We reset
331 * it to NULL here; the trace detach code then reparents
332 * the child to initproc. We only check allproc list, since
333 * eventual former children on zombproc list won't reference
334 * p_opptr anymore.
335 */
336 s = proclist_lock_write();
337 if (p->p_flag & P_CHTRACED) {
338 LIST_FOREACH(q, &allproc, p_list) {
339 if (q->p_opptr == p)
340 q->p_opptr = NULL;
341 }
342 }
343
344 /*
345 * Give orphaned children to init(8).
346 */
347 q = LIST_FIRST(&p->p_children);
348 if (q) /* only need this if any child is SZOMB */
349 wakeup(initproc);
350 for (; q != NULL; q = nq) {
351 nq = LIST_NEXT(q, p_sibling);
352
353 /*
354 * Traced processes are killed since their existence
355 * means someone is screwing up. Since we reset the
356 * trace flags, the logic in sys_wait4() would not be
357 * triggered to reparent the process to its
358 * original parent, so we must do this here.
359 */
360 if (q->p_flag & P_TRACED) {
361 if (q->p_opptr != q->p_pptr) {
362 struct proc *t = q->p_opptr;
363 proc_reparent(q, t ? t : initproc);
364 q->p_opptr = NULL;
365 } else
366 proc_reparent(q, initproc);
367 q->p_flag &= ~(P_TRACED|P_WAITED|P_FSTRACE);
368 psignal(q, SIGKILL);
369 } else {
370 proc_reparent(q, initproc);
371 }
372 }
373 proclist_unlock_write(s);
374
375 /*
376 * Free the VM resources we're still holding on to.
377 * We must do this from a valid thread because doing
378 * so may block. This frees vmspace, which we don't
379 * need anymore. The only remaining lwp is the one
380 * we run at this moment, nothing runs in userland
381 * anymore.
382 */
383 uvm_proc_exit(p);
384
385 /*
386 * Give machine-dependent code a chance to free any
387 * MD LWP resources while we can still block. This must be done
388 * before uvm_lwp_exit(), in case these resources are in the
389 * PCB.
390 * THIS IS LAST BLOCKING OPERATION.
391 */
392 #ifndef __NO_CPU_LWP_FREE
393 cpu_lwp_free(l, 1);
394 #endif
395
396 pmap_deactivate(l);
397
398 /*
399 * NOTE: WE ARE NO LONGER ALLOWED TO SLEEP!
400 */
401
402 /*
403 * Save exit status and final rusage info, adding in child rusage
404 * info and self times.
405 * In order to pick up the time for the current execution, we must
406 * do this before unlinking the lwp from l_list.
407 */
408 p->p_xstat = rv;
409 *p->p_ru = p->p_stats->p_ru;
410 calcru(p, &p->p_ru->ru_utime, &p->p_ru->ru_stime, NULL);
411 ruadd(p->p_ru, &p->p_stats->p_cru);
412
413 /*
414 * Move proc from allproc to zombproc, it's now ready
415 * to be collected by parent. Remaining lwp resources
416 * will be freed in lwp_exit2() once we'd switch to idle
417 * context.
418 * Changing the state to SZOMB stops it being found by pfind().
419 */
420 s = proclist_lock_write();
421 LIST_REMOVE(p, p_list);
422 LIST_INSERT_HEAD(&zombproc, p, p_list);
423 p->p_stat = SZOMB;
424
425 LIST_REMOVE(l, l_list);
426 LIST_REMOVE(l, l_sibling);
427 l->l_flag |= L_DETACHED|L_PROCEXIT; /* detached from proc too */
428 l->l_stat = LSDEAD;
429
430 p->p_nrlwps--;
431 p->p_nlwps--;
432
433 /* Put in front of parent's sibling list for parent to collect it */
434 q = p->p_pptr;
435 q->p_nstopchild++;
436 if (LIST_FIRST(&q->p_children) != p) {
437 /* Put child where it can be found quickly */
438 LIST_REMOVE(p, p_sibling);
439 LIST_INSERT_HEAD(&q->p_children, p, p_sibling);
440 }
441
442 proclist_unlock_write(s);
443
444 /*
445 * Notify interested parties of our demise.
446 */
447 KNOTE(&p->p_klist, NOTE_EXIT);
448
449 #if PERFCTRS
450 /*
451 * Save final PMC information in parent process & clean up.
452 */
453 if (PMC_ENABLED(p)) {
454 pmc_save_context(p);
455 pmc_accumulate(p->p_pptr, p);
456 pmc_process_exit(p);
457 }
458 #endif
459
460 /*
461 * Notify parent that we're gone. If parent has the P_NOCLDWAIT
462 * flag set, notify init instead (and hope it will handle
463 * this situation).
464 */
465 if (p->p_pptr->p_flag & P_NOCLDWAIT) {
466 struct proc *pp = p->p_pptr;
467 proc_reparent(p, initproc);
468
469 /*
470 * If this was the last child of our parent, notify
471 * parent, so in case he was wait(2)ing, he will
472 * continue.
473 */
474 if (LIST_FIRST(&pp->p_children) == NULL)
475 wakeup(pp);
476 }
477
478 /* Wake up the parent so it can get exit status. */
479 if ((p->p_flag & P_FSTRACE) == 0 && p->p_exitsig != 0)
480 exit_psignal(p, p->p_pptr);
481 wakeup(p->p_pptr);
482
483 /*
484 * Release the process's signal state.
485 */
486 sigactsfree(p);
487
488 /*
489 * Clear curlwp after we've done all operations
490 * that could block, and before tearing down the rest
491 * of the process state that might be used from clock, etc.
492 * Also, can't clear curlwp while we're still runnable,
493 * as we're not on a run queue (we are current, just not
494 * a proper proc any longer!).
495 *
496 * Other substructures are freed from wait().
497 */
498 curlwp = NULL;
499 limfree(p->p_limit);
500 pstatsfree(p->p_stats);
501 p->p_limit = NULL;
502
503 /* This process no longer needs to hold the kernel lock. */
504 KERNEL_PROC_UNLOCK(l);
505
506 #ifdef DEBUG
507 /* Nothing should use the process link anymore */
508 l->l_proc = NULL;
509 #endif
510
511 /*
512 * Finally, call machine-dependent code to switch to a new
513 * context (possibly the idle context). Once we are no longer
514 * using the dead lwp's stack, lwp_exit2() will be called
515 * to arrange for the resources to be released.
516 *
517 * Note that cpu_exit() will end with a call equivalent to
518 * cpu_switch(), finishing our execution (pun intended).
519 */
520
521 uvmexp.swtch++;
522 cpu_exit(l);
523 }
524
525 void
526 exit_lwps(struct lwp *l)
527 {
528 struct proc *p;
529 struct lwp *l2;
530 int s, error;
531 lwpid_t waited;
532
533 p = l->l_proc;
534
535 /* XXX SMP
536 * This would be the right place to IPI any LWPs running on
537 * other processors so that they can notice the userret exit hook.
538 */
539 p->p_userret = lwp_exit_hook;
540 p->p_userret_arg = NULL;
541
542 if (p->p_sa) {
543 /*
544 * Make SA-cached LWPs normal process runnable LWPs so
545 * that they'll also self-destruct.
546 */
547 DPRINTF(("exit_lwps: Making cached LWPs of %d runnable: ",
548 p->p_pid));
549 SCHED_LOCK(s);
550 while ((l2 = sa_getcachelwp(p)) != 0) {
551 l2->l_priority = l2->l_usrpri;
552 setrunnable(l2);
553 DPRINTF(("%d ", l2->l_lid));
554 }
555 DPRINTF(("\n"));
556 SCHED_UNLOCK(s);
557
558 /* Clear wokenq, the LWPs on the queue will run below */
559 p->p_sa->sa_wokenq_head = NULL;
560 }
561
562 /*
563 * Interrupt LWPs in interruptable sleep, unsuspend suspended
564 * LWPs, make detached LWPs undetached (so we can wait for
565 * them) and then wait for everyone else to finish.
566 */
567 LIST_FOREACH(l2, &p->p_lwps, l_sibling) {
568 l2->l_flag &= ~(L_DETACHED|L_SA);
569
570 if (p->p_sa && l2->l_wchan == p->p_sa)
571 l2->l_flag |= L_SINTR;
572
573 if ((l2->l_stat == LSSLEEP && (l2->l_flag & L_SINTR)) ||
574 l2->l_stat == LSSUSPENDED || l2->l_stat == LSSTOP) {
575 SCHED_LOCK(s);
576 setrunnable(l2);
577 SCHED_UNLOCK(s);
578 DPRINTF(("exit_lwps: Made %d.%d runnable\n",
579 p->p_pid, l2->l_lid));
580 }
581 }
582
583
584 while (p->p_nlwps > 1) {
585 DPRINTF(("exit_lwps: waiting for %d LWPs (%d runnable, %d zombies)\n",
586 p->p_nlwps, p->p_nrlwps, p->p_nzlwps));
587 error = lwp_wait1(l, 0, &waited, LWPWAIT_EXITCONTROL);
588 if (error)
589 panic("exit_lwps: lwp_wait1 failed with error %d\n",
590 error);
591 DPRINTF(("exit_lwps: Got LWP %d from lwp_wait1()\n", waited));
592 }
593
594 p->p_userret = NULL;
595 }
596
597 /* Wrapper function for use in p_userret */
598 static void
599 lwp_exit_hook(struct lwp *l, void *arg)
600 {
601 KERNEL_PROC_LOCK(l);
602 lwp_exit(l);
603 }
604
605 int
606 sys_wait4(struct lwp *l, void *v, register_t *retval)
607 {
608 struct sys_wait4_args /* {
609 syscallarg(int) pid;
610 syscallarg(int *) status;
611 syscallarg(int) options;
612 syscallarg(struct rusage *) rusage;
613 } */ *uap = v;
614 struct proc *child, *parent;
615 int status, error;
616
617 parent = l->l_proc;
618
619 if (SCARG(uap, pid) == 0)
620 SCARG(uap, pid) = -parent->p_pgid;
621 if (SCARG(uap, options) & ~(WUNTRACED|WNOHANG|WALTSIG|WALLSIG))
622 return (EINVAL);
623
624 error = find_stopped_child(parent, SCARG(uap,pid), SCARG(uap,options),
625 &child);
626 if (error != 0)
627 return error;
628 if (child == NULL) {
629 *retval = 0;
630 return 0;
631 }
632
633 /*
634 * Collect child u-areas.
635 */
636 uvm_uarea_drain(FALSE);
637
638 retval[0] = child->p_pid;
639
640 if (child->p_stat == SZOMB) {
641 if (SCARG(uap, status)) {
642 status = child->p_xstat; /* convert to int */
643 error = copyout(&status, SCARG(uap, status),
644 sizeof(status));
645 if (error)
646 return (error);
647 }
648 if (SCARG(uap, rusage)) {
649 error = copyout(child->p_ru, SCARG(uap, rusage),
650 sizeof(struct rusage));
651 if (error)
652 return (error);
653 }
654
655 proc_free(child);
656 return 0;
657 }
658
659 /* child state must be SSTOP */
660 if (SCARG(uap, status)) {
661 status = W_STOPCODE(child->p_xstat);
662 return copyout(&status, SCARG(uap, status), sizeof(status));
663 }
664 return 0;
665 }
666
667 /*
668 * Scan list of child processes for a child process that has stopped or
669 * exited. Used by sys_wait4 and 'compat' equivalents.
670 */
671 int
672 find_stopped_child(struct proc *parent, pid_t pid, int options,
673 struct proc **child_p)
674 {
675 struct proc *child;
676 int error;
677
678 for (;;) {
679 proclist_lock_read();
680 error = ECHILD;
681 LIST_FOREACH(child, &parent->p_children, p_sibling) {
682 if (pid >= 0) {
683 if (child->p_pid != pid) {
684 child = p_find(pid, PFIND_ZOMBIE |
685 PFIND_LOCKED);
686 if (child == NULL
687 || child->p_pptr != parent) {
688 child = NULL;
689 break;
690 }
691 }
692 } else
693 if (pid != WAIT_ANY && child->p_pgid != -pid)
694 /* child not in correct pgrp */
695 continue;
696 /*
697 * Wait for processes with p_exitsig != SIGCHLD
698 * processes only if WALTSIG is set; wait for
699 * processes with p_exitsig == SIGCHLD only
700 * if WALTSIG is clear.
701 */
702 if (((options & WALLSIG) == 0) &&
703 (options & WALTSIG ? child->p_exitsig == SIGCHLD
704 : P_EXITSIG(child) != SIGCHLD)){
705 if (child->p_pid == pid) {
706 child = NULL;
707 break;
708 }
709 continue;
710 }
711
712 error = 0;
713 if (child->p_stat == SZOMB && !(options & WNOZOMBIE))
714 break;
715
716 if (child->p_stat == SSTOP &&
717 (child->p_flag & P_WAITED) == 0 &&
718 (child->p_flag & P_TRACED || options & WUNTRACED)) {
719 if ((options & WNOWAIT) == 0) {
720 child->p_flag |= P_WAITED;
721 parent->p_nstopchild--;
722 }
723 break;
724 }
725 if (parent->p_nstopchild == 0 || child->p_pid == pid) {
726 child = NULL;
727 break;
728 }
729 }
730 proclist_unlock_read();
731 if (child != NULL || error != 0 || options & WNOHANG) {
732 *child_p = child;
733 return error;
734 }
735 error = tsleep(parent, PWAIT | PCATCH, "wait", 0);
736 if (error != 0)
737 return error;
738 }
739 }
740
741 /*
742 * Free a process after parent has taken all the state info.
743 */
744 void
745 proc_free(struct proc *p)
746 {
747 struct proc *parent = p->p_pptr;
748 int s;
749
750 KASSERT(p->p_nlwps == 0);
751 KASSERT(p->p_nzlwps == 0);
752 KASSERT(p->p_nrlwps == 0);
753 KASSERT(LIST_EMPTY(&p->p_lwps));
754
755 /*
756 * If we got the child via ptrace(2) or procfs, and
757 * the parent is different (meaning the process was
758 * attached, rather than run as a child), then we need
759 * to give it back to the old parent, and send the
760 * parent the exit signal. The rest of the cleanup
761 * will be done when the old parent waits on the child.
762 */
763 if ((p->p_flag & P_TRACED) && p->p_opptr != parent){
764 parent = p->p_opptr;
765 if (parent == NULL)
766 parent = initproc;
767 proc_reparent(p, parent);
768 p->p_opptr = NULL;
769 p->p_flag &= ~(P_TRACED|P_WAITED|P_FSTRACE);
770 if (p->p_exitsig != 0)
771 exit_psignal(p, parent);
772 wakeup(parent);
773 return;
774 }
775
776 scheduler_wait_hook(parent, p);
777 p->p_xstat = 0;
778
779 ruadd(&parent->p_stats->p_cru, p->p_ru);
780
781 /*
782 * At this point we are going to start freeing the final resources.
783 * If anyone tries to access the proc structure after here they
784 * will get a shock - bits are missing.
785 * Attempt to make it hard!
786 */
787
788 p->p_stat = SIDL; /* not even a zombie any more */
789
790 pool_put(&rusage_pool, p->p_ru);
791
792 /*
793 * Finally finished with old proc entry.
794 * Unlink it from its process group and free it.
795 */
796 leavepgrp(p);
797
798 s = proclist_lock_write();
799 LIST_REMOVE(p, p_list); /* off zombproc */
800 p->p_pptr->p_nstopchild--;
801 LIST_REMOVE(p, p_sibling);
802 proclist_unlock_write(s);
803
804 /*
805 * Decrement the count of procs running with this uid.
806 */
807 (void)chgproccnt(p->p_cred->p_ruid, -1);
808
809 /*
810 * Free up credentials.
811 */
812 if (--p->p_cred->p_refcnt == 0) {
813 crfree(p->p_cred->pc_ucred);
814 pool_put(&pcred_pool, p->p_cred);
815 }
816
817 /*
818 * Release reference to text vnode
819 */
820 if (p->p_textvp)
821 vrele(p->p_textvp);
822
823 /* Release any SA state. */
824 if (p->p_sa)
825 sa_release(p);
826
827 /* Free proc structure and let pid be reallocated */
828 proc_free_mem(p);
829 }
830
831 /*
832 * make process 'parent' the new parent of process 'child'.
833 *
834 * Must be called with proclist_lock_write() held.
835 */
836 void
837 proc_reparent(struct proc *child, struct proc *parent)
838 {
839
840 if (child->p_pptr == parent)
841 return;
842
843 if (child->p_stat == SZOMB
844 || (child->p_stat == SSTOP && !(child->p_flag & P_WAITED))) {
845 child->p_pptr->p_nstopchild--;
846 parent->p_nstopchild++;
847 }
848 if (parent == initproc)
849 child->p_exitsig = SIGCHLD;
850
851 LIST_REMOVE(child, p_sibling);
852 LIST_INSERT_HEAD(&parent->p_children, child, p_sibling);
853 child->p_pptr = parent;
854 }
855