1 /* $NetBSD: kern_exit.c,v 1.232 2011/02/21 20:23:28 pooka Exp $ */ 2 3 /*- 4 * Copyright (c) 1998, 1999, 2006, 2007, 2008 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, and by Andrew Doran. 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 * 20 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS 21 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED 22 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 23 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS 24 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 25 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 26 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 27 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 28 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 29 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 30 * POSSIBILITY OF SUCH DAMAGE. 31 */ 32 33 /* 34 * Copyright (c) 1982, 1986, 1989, 1991, 1993 35 * The Regents of the University of California. All rights reserved. 36 * (c) UNIX System Laboratories, Inc. 37 * All or some portions of this file are derived from material licensed 38 * to the University of California by American Telephone and Telegraph 39 * Co. or Unix System Laboratories, Inc. and are reproduced herein with 40 * the permission of UNIX System Laboratories, Inc. 41 * 42 * Redistribution and use in source and binary forms, with or without 43 * modification, are permitted provided that the following conditions 44 * are met: 45 * 1. Redistributions of source code must retain the above copyright 46 * notice, this list of conditions and the following disclaimer. 47 * 2. Redistributions in binary form must reproduce the above copyright 48 * notice, this list of conditions and the following disclaimer in the 49 * documentation and/or other materials provided with the distribution. 50 * 3. Neither the name of the University nor the names of its contributors 51 * may be used to endorse or promote products derived from this software 52 * without specific prior written permission. 53 * 54 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 55 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 56 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 57 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 58 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 59 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 60 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 61 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 62 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 63 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 64 * SUCH DAMAGE. 65 * 66 * @(#)kern_exit.c 8.10 (Berkeley) 2/23/95 67 */ 68 69 #include <sys/cdefs.h> 70 __KERNEL_RCSID(0, "$NetBSD: kern_exit.c,v 1.232 2011/02/21 20:23:28 pooka Exp $"); 71 72 #include "opt_ktrace.h" 73 #include "opt_perfctrs.h" 74 #include "opt_sa.h" 75 #include "opt_sysv.h" 76 77 #include <sys/param.h> 78 #include <sys/systm.h> 79 #include <sys/ioctl.h> 80 #include <sys/tty.h> 81 #include <sys/time.h> 82 #include <sys/resource.h> 83 #include <sys/kernel.h> 84 #include <sys/proc.h> 85 #include <sys/buf.h> 86 #include <sys/wait.h> 87 #include <sys/file.h> 88 #include <sys/vnode.h> 89 #include <sys/syslog.h> 90 #include <sys/pool.h> 91 #include <sys/uidinfo.h> 92 #if defined(PERFCTRS) 93 #include <sys/pmc.h> 94 #endif 95 #include <sys/ptrace.h> 96 #include <sys/acct.h> 97 #include <sys/filedesc.h> 98 #include <sys/ras.h> 99 #include <sys/signalvar.h> 100 #include <sys/sched.h> 101 #include <sys/sa.h> 102 #include <sys/savar.h> 103 #include <sys/mount.h> 104 #include <sys/syscallargs.h> 105 #include <sys/kauth.h> 106 #include <sys/sleepq.h> 107 #include <sys/lockdebug.h> 108 #include <sys/ktrace.h> 109 #include <sys/cpu.h> 110 #include <sys/lwpctl.h> 111 #include <sys/atomic.h> 112 #include <sys/sdt.h> 113 114 #include <uvm/uvm_extern.h> 115 116 #ifdef DEBUG_EXIT 117 int debug_exit = 0; 118 #define DPRINTF(x) if (debug_exit) printf x 119 #else 120 #define DPRINTF(x) 121 #endif 122 123 static int find_stopped_child(struct proc *, pid_t, int, struct proc **, int *); 124 static void proc_free(struct proc *, struct rusage *); 125 126 /* 127 * DTrace SDT provider definitions 128 */ 129 SDT_PROBE_DEFINE(proc,,,exit, 130 "int", NULL, /* reason */ 131 NULL, NULL, NULL, NULL, 132 NULL, NULL, NULL, NULL); 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, ksiginfo_t *ksi) 138 { 139 140 KSI_INIT(ksi); 141 if ((ksi->ksi_signo = P_EXITSIG(p)) == SIGCHLD) { 142 if (WIFSIGNALED(p->p_xstat)) { 143 if (WCOREDUMP(p->p_xstat)) 144 ksi->ksi_code = CLD_DUMPED; 145 else 146 ksi->ksi_code = CLD_KILLED; 147 } else { 148 ksi->ksi_code = CLD_EXITED; 149 } 150 } 151 /* 152 * We fill those in, even for non-SIGCHLD. 153 * It's safe to access p->p_cred unlocked here. 154 */ 155 ksi->ksi_pid = p->p_pid; 156 ksi->ksi_uid = kauth_cred_geteuid(p->p_cred); 157 ksi->ksi_status = p->p_xstat; 158 /* XXX: is this still valid? */ 159 ksi->ksi_utime = p->p_stats->p_ru.ru_utime.tv_sec; 160 ksi->ksi_stime = p->p_stats->p_ru.ru_stime.tv_sec; 161 } 162 163 /* 164 * exit -- 165 * Death of process. 166 */ 167 int 168 sys_exit(struct lwp *l, const struct sys_exit_args *uap, register_t *retval) 169 { 170 /* { 171 syscallarg(int) rval; 172 } */ 173 struct proc *p = l->l_proc; 174 175 /* Don't call exit1() multiple times in the same process. */ 176 mutex_enter(p->p_lock); 177 if (p->p_sflag & PS_WEXIT) { 178 mutex_exit(p->p_lock); 179 lwp_exit(l); 180 } 181 182 /* exit1() will release the mutex. */ 183 exit1(l, W_EXITCODE(SCARG(uap, rval), 0)); 184 /* NOTREACHED */ 185 return (0); 186 } 187 188 /* 189 * Exit: deallocate address space and other resources, change proc state 190 * to zombie, and unlink proc from allproc and parent's lists. Save exit 191 * status and rusage for wait(). Check for child processes and orphan them. 192 * 193 * Must be called with p->p_lock held. Does not return. 194 */ 195 void 196 exit1(struct lwp *l, int rv) 197 { 198 struct proc *p, *q, *nq; 199 struct pgrp *pgrp; 200 ksiginfo_t ksi; 201 ksiginfoq_t kq; 202 int wakeinit, sa; 203 204 p = l->l_proc; 205 206 KASSERT(mutex_owned(p->p_lock)); 207 208 if (__predict_false(p == initproc)) 209 panic("init died (signal %d, exit %d)", 210 WTERMSIG(rv), WEXITSTATUS(rv)); 211 212 /* 213 * Disable scheduler activation upcalls. We're trying to get out of 214 * here. 215 */ 216 sa = 0; 217 #ifdef KERN_SA 218 if ((p->p_sa != NULL)) { 219 l->l_pflag |= LP_SA_NOBLOCK; 220 sa = 1; 221 } 222 #endif 223 224 p->p_sflag |= PS_WEXIT; 225 226 /* 227 * Force all other LWPs to exit before we do. Only then can we 228 * begin to tear down the rest of the process state. 229 */ 230 if (sa || p->p_nlwps > 1) 231 exit_lwps(l); 232 233 ksiginfo_queue_init(&kq); 234 235 /* 236 * If we have been asked to stop on exit, do so now. 237 */ 238 if (__predict_false(p->p_sflag & PS_STOPEXIT)) { 239 KERNEL_UNLOCK_ALL(l, &l->l_biglocks); 240 sigclearall(p, &contsigmask, &kq); 241 p->p_waited = 0; 242 membar_producer(); 243 p->p_stat = SSTOP; 244 lwp_lock(l); 245 p->p_nrlwps--; 246 l->l_stat = LSSTOP; 247 lwp_unlock(l); 248 mutex_exit(p->p_lock); 249 lwp_lock(l); 250 mi_switch(l); 251 KERNEL_LOCK(l->l_biglocks, l); 252 mutex_enter(p->p_lock); 253 } 254 255 /* 256 * Bin any remaining signals and mark the process as dying so it will 257 * not be found for, e.g. signals. 258 */ 259 sigfillset(&p->p_sigctx.ps_sigignore); 260 sigclearall(p, NULL, &kq); 261 p->p_stat = SDYING; 262 mutex_exit(p->p_lock); 263 ksiginfo_queue_drain(&kq); 264 265 /* Destroy any lwpctl info. */ 266 if (p->p_lwpctl != NULL) 267 lwp_ctl_exit(); 268 269 /* 270 * Drain all remaining references that procfs, ptrace and others may 271 * have on the process. 272 */ 273 rw_enter(&p->p_reflock, RW_WRITER); 274 275 DPRINTF(("exit1: %d.%d exiting.\n", p->p_pid, l->l_lid)); 276 277 timers_free(p, TIMERS_ALL); 278 #if defined(__HAVE_RAS) 279 ras_purgeall(); 280 #endif 281 282 /* 283 * Close open files, release open-file table and free signal 284 * actions. This may block! 285 */ 286 fd_free(); 287 cwdfree(p->p_cwdi); 288 p->p_cwdi = NULL; 289 doexithooks(p); 290 sigactsfree(p->p_sigacts); 291 292 /* 293 * Write out accounting data. 294 */ 295 (void)acct_process(l); 296 297 #ifdef KTRACE 298 /* 299 * Release trace file. 300 */ 301 if (p->p_tracep != NULL) { 302 mutex_enter(&ktrace_lock); 303 ktrderef(p); 304 mutex_exit(&ktrace_lock); 305 } 306 #endif 307 308 /* 309 * If emulation has process exit hook, call it now. 310 * Set the exit status now so that the exit hook has 311 * an opportunity to tweak it (COMPAT_LINUX requires 312 * this for thread group emulation) 313 */ 314 p->p_xstat = rv; 315 if (p->p_emul->e_proc_exit) 316 (*p->p_emul->e_proc_exit)(p); 317 318 /* 319 * Free the VM resources we're still holding on to. 320 * We must do this from a valid thread because doing 321 * so may block. This frees vmspace, which we don't 322 * need anymore. The only remaining lwp is the one 323 * we run at this moment, nothing runs in userland 324 * anymore. 325 */ 326 uvm_proc_exit(p); 327 328 /* 329 * Stop profiling. 330 */ 331 if (__predict_false((p->p_stflag & PST_PROFIL) != 0)) { 332 mutex_spin_enter(&p->p_stmutex); 333 stopprofclock(p); 334 mutex_spin_exit(&p->p_stmutex); 335 } 336 337 /* 338 * If parent is waiting for us to exit or exec, PL_PPWAIT is set; we 339 * wake up the parent early to avoid deadlock. We can do this once 340 * the VM resources are released. 341 */ 342 mutex_enter(proc_lock); 343 if (p->p_lflag & PL_PPWAIT) { 344 l->l_lwpctl = NULL; /* was on loan from blocked parent */ 345 p->p_lflag &= ~PL_PPWAIT; 346 cv_broadcast(&p->p_pptr->p_waitcv); 347 } 348 349 if (SESS_LEADER(p)) { 350 struct vnode *vprele = NULL, *vprevoke = NULL; 351 struct session *sp = p->p_session; 352 struct tty *tp; 353 354 if (sp->s_ttyvp) { 355 /* 356 * Controlling process. 357 * Signal foreground pgrp, 358 * drain controlling terminal 359 * and revoke access to controlling terminal. 360 */ 361 tp = sp->s_ttyp; 362 mutex_spin_enter(&tty_lock); 363 if (tp->t_session == sp) { 364 /* we can't guarantee the revoke will do this */ 365 pgrp = tp->t_pgrp; 366 tp->t_pgrp = NULL; 367 tp->t_session = NULL; 368 mutex_spin_exit(&tty_lock); 369 if (pgrp != NULL) { 370 pgsignal(pgrp, SIGHUP, 1); 371 } 372 mutex_exit(proc_lock); 373 (void) ttywait(tp); 374 mutex_enter(proc_lock); 375 376 /* The tty could have been revoked. */ 377 vprevoke = sp->s_ttyvp; 378 } else 379 mutex_spin_exit(&tty_lock); 380 vprele = sp->s_ttyvp; 381 sp->s_ttyvp = NULL; 382 /* 383 * s_ttyp is not zero'd; we use this to indicate 384 * that the session once had a controlling terminal. 385 * (for logging and informational purposes) 386 */ 387 } 388 sp->s_leader = NULL; 389 390 if (vprevoke != NULL || vprele != NULL) { 391 if (vprevoke != NULL) { 392 /* Releases proc_lock. */ 393 proc_sessrele(sp); 394 VOP_REVOKE(vprevoke, REVOKEALL); 395 } else 396 mutex_exit(proc_lock); 397 if (vprele != NULL) 398 vrele(vprele); 399 mutex_enter(proc_lock); 400 } 401 } 402 fixjobc(p, p->p_pgrp, 0); 403 404 /* 405 * Finalize the last LWP's specificdata, as well as the 406 * specificdata for the proc itself. 407 */ 408 lwp_finispecific(l); 409 proc_finispecific(p); 410 411 /* 412 * Notify interested parties of our demise. 413 */ 414 KNOTE(&p->p_klist, NOTE_EXIT); 415 416 SDT_PROBE(proc,,,exit, 417 (WCOREDUMP(rv) ? CLD_DUMPED : 418 (WIFSIGNALED(rv) ? CLD_KILLED : CLD_EXITED)), 419 0,0,0,0); 420 421 #if PERFCTRS 422 /* 423 * Save final PMC information in parent process & clean up. 424 */ 425 if (PMC_ENABLED(p)) { 426 pmc_save_context(p); 427 pmc_accumulate(p->p_pptr, p); 428 pmc_process_exit(p); 429 } 430 #endif 431 432 /* 433 * Reset p_opptr pointer of all former children which got 434 * traced by another process and were reparented. We reset 435 * it to NULL here; the trace detach code then reparents 436 * the child to initproc. We only check allproc list, since 437 * eventual former children on zombproc list won't reference 438 * p_opptr anymore. 439 */ 440 if (__predict_false(p->p_slflag & PSL_CHTRACED)) { 441 PROCLIST_FOREACH(q, &allproc) { 442 if (q->p_opptr == p) 443 q->p_opptr = NULL; 444 } 445 } 446 447 /* 448 * Give orphaned children to init(8). 449 */ 450 q = LIST_FIRST(&p->p_children); 451 wakeinit = (q != NULL); 452 for (; q != NULL; q = nq) { 453 nq = LIST_NEXT(q, p_sibling); 454 455 /* 456 * Traced processes are killed since their existence 457 * means someone is screwing up. Since we reset the 458 * trace flags, the logic in sys_wait4() would not be 459 * triggered to reparent the process to its 460 * original parent, so we must do this here. 461 */ 462 if (__predict_false(q->p_slflag & PSL_TRACED)) { 463 mutex_enter(p->p_lock); 464 q->p_slflag &= ~(PSL_TRACED|PSL_FSTRACE|PSL_SYSCALL); 465 mutex_exit(p->p_lock); 466 if (q->p_opptr != q->p_pptr) { 467 struct proc *t = q->p_opptr; 468 proc_reparent(q, t ? t : initproc); 469 q->p_opptr = NULL; 470 } else 471 proc_reparent(q, initproc); 472 killproc(q, "orphaned traced process"); 473 } else 474 proc_reparent(q, initproc); 475 } 476 477 /* 478 * Move proc from allproc to zombproc, it's now nearly ready to be 479 * collected by parent. 480 */ 481 LIST_REMOVE(l, l_list); 482 LIST_REMOVE(p, p_list); 483 LIST_INSERT_HEAD(&zombproc, p, p_list); 484 485 /* 486 * Mark the process as dead. We must do this before we signal 487 * the parent. 488 */ 489 p->p_stat = SDEAD; 490 491 /* Put in front of parent's sibling list for parent to collect it */ 492 q = p->p_pptr; 493 q->p_nstopchild++; 494 if (LIST_FIRST(&q->p_children) != p) { 495 /* Put child where it can be found quickly */ 496 LIST_REMOVE(p, p_sibling); 497 LIST_INSERT_HEAD(&q->p_children, p, p_sibling); 498 } 499 500 /* 501 * Notify parent that we're gone. If parent has the P_NOCLDWAIT 502 * flag set, notify init instead (and hope it will handle 503 * this situation). 504 */ 505 if (q->p_flag & (PK_NOCLDWAIT|PK_CLDSIGIGN)) { 506 proc_reparent(p, initproc); 507 wakeinit = 1; 508 509 /* 510 * If this was the last child of our parent, notify 511 * parent, so in case he was wait(2)ing, he will 512 * continue. 513 */ 514 if (LIST_FIRST(&q->p_children) == NULL) 515 cv_broadcast(&q->p_waitcv); 516 } 517 518 /* Reload parent pointer, since p may have been reparented above */ 519 q = p->p_pptr; 520 521 if (__predict_false((p->p_slflag & PSL_FSTRACE) == 0 && 522 p->p_exitsig != 0)) { 523 exit_psignal(p, q, &ksi); 524 kpsignal(q, &ksi, NULL); 525 } 526 527 /* Calculate the final rusage info. */ 528 calcru(p, &p->p_stats->p_ru.ru_utime, &p->p_stats->p_ru.ru_stime, 529 NULL, NULL); 530 531 if (wakeinit) 532 cv_broadcast(&initproc->p_waitcv); 533 534 callout_destroy(&l->l_timeout_ch); 535 536 /* 537 * Remaining lwp resources will be freed in lwp_exit2() once we've 538 * switch to idle context; at that point, we will be marked as a 539 * full blown zombie. 540 */ 541 mutex_enter(p->p_lock); 542 lwp_drainrefs(l); 543 lwp_lock(l); 544 l->l_prflag &= ~LPR_DETACHED; 545 l->l_stat = LSZOMB; 546 lwp_unlock(l); 547 KASSERT(curlwp == l); 548 KASSERT(p->p_nrlwps == 1); 549 KASSERT(p->p_nlwps == 1); 550 p->p_stat = SZOMB; 551 p->p_nrlwps--; 552 p->p_nzlwps++; 553 p->p_ndlwps = 0; 554 mutex_exit(p->p_lock); 555 556 /* 557 * Signal the parent to collect us, and drop the proclist lock. 558 * Drop debugger/procfs lock; no new references can be gained. 559 */ 560 cv_broadcast(&p->p_pptr->p_waitcv); 561 rw_exit(&p->p_reflock); 562 mutex_exit(proc_lock); 563 564 /* Verify that we hold no locks other than the kernel lock. */ 565 LOCKDEBUG_BARRIER(&kernel_lock, 0); 566 567 /* 568 * NOTE: WE ARE NO LONGER ALLOWED TO SLEEP! 569 */ 570 571 /* 572 * Give machine-dependent code a chance to free any MD LWP 573 * resources. This must be done before uvm_lwp_exit(), in 574 * case these resources are in the PCB. 575 */ 576 cpu_lwp_free(l, 1); 577 pmap_deactivate(l); 578 579 /* This process no longer needs to hold the kernel lock. */ 580 #ifdef notyet 581 /* XXXSMP hold in lwp_userret() */ 582 KERNEL_UNLOCK_LAST(l); 583 #else 584 KERNEL_UNLOCK_ALL(l, NULL); 585 #endif 586 587 lwp_exit_switchaway(l); 588 } 589 590 void 591 exit_lwps(struct lwp *l) 592 { 593 struct proc *p; 594 struct lwp *l2; 595 int error; 596 lwpid_t waited; 597 int nlocks; 598 599 KERNEL_UNLOCK_ALL(l, &nlocks); 600 601 p = l->l_proc; 602 KASSERT(mutex_owned(p->p_lock)); 603 604 #ifdef KERN_SA 605 if (p->p_sa != NULL) { 606 struct sadata_vp *vp; 607 SLIST_FOREACH(vp, &p->p_sa->sa_vps, savp_next) { 608 /* 609 * Make SA-cached LWPs normal process interruptable 610 * so that the exit code can wake them. Locking 611 * savp_mutex locks all the lwps on this vp that 612 * we need to adjust. 613 */ 614 mutex_enter(&vp->savp_mutex); 615 DPRINTF(("exit_lwps: Making cached LWPs of %d on " 616 "VP %d interruptable: ", p->p_pid, vp->savp_id)); 617 TAILQ_FOREACH(l2, &vp->savp_lwpcache, l_sleepchain) { 618 l2->l_flag |= LW_SINTR; 619 DPRINTF(("%d ", l2->l_lid)); 620 } 621 DPRINTF(("\n")); 622 623 DPRINTF(("exit_lwps: Making unblocking LWPs of %d on " 624 "VP %d interruptable: ", p->p_pid, vp->savp_id)); 625 TAILQ_FOREACH(l2, &vp->savp_woken, l_sleepchain) { 626 vp->savp_woken_count--; 627 l2->l_flag |= LW_SINTR; 628 DPRINTF(("%d ", l2->l_lid)); 629 } 630 DPRINTF(("\n")); 631 mutex_exit(&vp->savp_mutex); 632 } 633 } 634 #endif 635 636 retry: 637 /* 638 * Interrupt LWPs in interruptable sleep, unsuspend suspended 639 * LWPs and then wait for everyone else to finish. 640 */ 641 LIST_FOREACH(l2, &p->p_lwps, l_sibling) { 642 if (l2 == l) 643 continue; 644 lwp_lock(l2); 645 l2->l_flag &= ~LW_SA; 646 l2->l_flag |= LW_WEXIT; 647 if ((l2->l_stat == LSSLEEP && (l2->l_flag & LW_SINTR)) || 648 l2->l_stat == LSSUSPENDED || l2->l_stat == LSSTOP) { 649 /* setrunnable() will release the lock. */ 650 setrunnable(l2); 651 DPRINTF(("exit_lwps: Made %d.%d runnable\n", 652 p->p_pid, l2->l_lid)); 653 continue; 654 } 655 lwp_unlock(l2); 656 } 657 while (p->p_nlwps > 1) { 658 DPRINTF(("exit_lwps: waiting for %d LWPs (%d zombies)\n", 659 p->p_nlwps, p->p_nzlwps)); 660 error = lwp_wait1(l, 0, &waited, LWPWAIT_EXITCONTROL); 661 if (p->p_nlwps == 1) 662 break; 663 if (error == EDEADLK) { 664 /* 665 * LWPs can get suspended/slept behind us. 666 * (eg. sa_setwoken) 667 * kick them again and retry. 668 */ 669 goto retry; 670 } 671 if (error) 672 panic("exit_lwps: lwp_wait1 failed with error %d", 673 error); 674 DPRINTF(("exit_lwps: Got LWP %d from lwp_wait1()\n", waited)); 675 } 676 677 KERNEL_LOCK(nlocks, l); 678 KASSERT(p->p_nlwps == 1); 679 } 680 681 int 682 do_sys_wait(int *pid, int *status, int options, struct rusage *ru) 683 { 684 proc_t *child; 685 int error; 686 687 if (ru != NULL) { 688 memset(ru, 0, sizeof(*ru)); 689 } 690 mutex_enter(proc_lock); 691 error = find_stopped_child(curproc, *pid, options, &child, status); 692 if (child == NULL) { 693 mutex_exit(proc_lock); 694 *pid = 0; 695 return error; 696 } 697 *pid = child->p_pid; 698 699 if (child->p_stat == SZOMB) { 700 /* proc_free() will release the proc_lock. */ 701 if (options & WNOWAIT) { 702 mutex_exit(proc_lock); 703 } else { 704 proc_free(child, ru); 705 } 706 } else { 707 /* Child state must have been SSTOP. */ 708 mutex_exit(proc_lock); 709 *status = W_STOPCODE(*status); 710 } 711 return 0; 712 } 713 714 int 715 sys___wait450(struct lwp *l, const struct sys___wait450_args *uap, 716 register_t *retval) 717 { 718 /* { 719 syscallarg(int) pid; 720 syscallarg(int *) status; 721 syscallarg(int) options; 722 syscallarg(struct rusage *) rusage; 723 } */ 724 int error, status, pid = SCARG(uap, pid); 725 struct rusage ru; 726 727 error = do_sys_wait(&pid, &status, SCARG(uap, options), 728 SCARG(uap, rusage) != NULL ? &ru : NULL); 729 730 retval[0] = pid; 731 if (pid == 0) { 732 return error; 733 } 734 if (SCARG(uap, status)) { 735 error = copyout(&status, SCARG(uap, status), sizeof(status)); 736 } 737 if (SCARG(uap, rusage) && error == 0) { 738 error = copyout(&ru, SCARG(uap, rusage), sizeof(ru)); 739 } 740 return error; 741 } 742 743 /* 744 * Scan list of child processes for a child process that has stopped or 745 * exited. Used by sys_wait4 and 'compat' equivalents. 746 * 747 * Must be called with the proc_lock held, and may release while waiting. 748 */ 749 static int 750 find_stopped_child(struct proc *parent, pid_t pid, int options, 751 struct proc **child_p, int *status_p) 752 { 753 struct proc *child, *dead; 754 int error; 755 756 KASSERT(mutex_owned(proc_lock)); 757 758 if (options & ~(WUNTRACED|WNOHANG|WALTSIG|WALLSIG) 759 && !(options & WOPTSCHECKED)) { 760 *child_p = NULL; 761 return EINVAL; 762 } 763 764 if (pid == 0 && !(options & WOPTSCHECKED)) 765 pid = -parent->p_pgid; 766 767 for (;;) { 768 error = ECHILD; 769 dead = NULL; 770 771 LIST_FOREACH(child, &parent->p_children, p_sibling) { 772 if (pid >= 0) { 773 if (child->p_pid != pid) { 774 child = proc_find_raw(pid); 775 if (child == NULL || 776 child->p_stat == SIDL || 777 child->p_pptr != parent) { 778 child = NULL; 779 break; 780 } 781 } 782 } else if (pid != WAIT_ANY && child->p_pgid != -pid) { 783 /* Child not in correct pgrp */ 784 continue; 785 } 786 787 /* 788 * Wait for processes with p_exitsig != SIGCHLD 789 * processes only if WALTSIG is set; wait for 790 * processes with p_exitsig == SIGCHLD only 791 * if WALTSIG is clear. 792 */ 793 if (((options & WALLSIG) == 0) && 794 (options & WALTSIG ? child->p_exitsig == SIGCHLD 795 : P_EXITSIG(child) != SIGCHLD)){ 796 if (child->p_pid == pid) { 797 child = NULL; 798 break; 799 } 800 continue; 801 } 802 803 error = 0; 804 if ((options & WNOZOMBIE) == 0) { 805 if (child->p_stat == SZOMB) 806 break; 807 if (child->p_stat == SDEAD) { 808 /* 809 * We may occasionally arrive here 810 * after receiving a signal, but 811 * immediately before the child 812 * process is zombified. The wait 813 * will be short, so avoid returning 814 * to userspace. 815 */ 816 dead = child; 817 } 818 } 819 820 if (child->p_stat == SSTOP && 821 child->p_waited == 0 && 822 (child->p_slflag & PSL_TRACED || 823 options & WUNTRACED)) { 824 if ((options & WNOWAIT) == 0) { 825 child->p_waited = 1; 826 parent->p_nstopchild--; 827 } 828 break; 829 } 830 if (parent->p_nstopchild == 0 || child->p_pid == pid) { 831 child = NULL; 832 break; 833 } 834 } 835 836 if (child != NULL || error != 0 || 837 ((options & WNOHANG) != 0 && dead == NULL)) { 838 if (child != NULL) { 839 *status_p = child->p_xstat; 840 } 841 *child_p = child; 842 return error; 843 } 844 845 /* 846 * Wait for another child process to stop. 847 */ 848 error = cv_wait_sig(&parent->p_waitcv, proc_lock); 849 850 if (error != 0) { 851 *child_p = NULL; 852 return error; 853 } 854 } 855 } 856 857 /* 858 * Free a process after parent has taken all the state info. Must be called 859 * with the proclist lock held, and will release before returning. 860 * 861 * *ru is returned to the caller, and must be freed by the caller. 862 */ 863 static void 864 proc_free(struct proc *p, struct rusage *ru) 865 { 866 struct proc *parent = p->p_pptr; 867 struct lwp *l; 868 ksiginfo_t ksi; 869 kauth_cred_t cred1, cred2; 870 uid_t uid; 871 872 KASSERT(mutex_owned(proc_lock)); 873 KASSERT(p->p_nlwps == 1); 874 KASSERT(p->p_nzlwps == 1); 875 KASSERT(p->p_nrlwps == 0); 876 KASSERT(p->p_stat == SZOMB); 877 878 /* 879 * If we got the child via ptrace(2) or procfs, and 880 * the parent is different (meaning the process was 881 * attached, rather than run as a child), then we need 882 * to give it back to the old parent, and send the 883 * parent the exit signal. The rest of the cleanup 884 * will be done when the old parent waits on the child. 885 */ 886 if ((p->p_slflag & PSL_TRACED) != 0 && p->p_opptr != parent) { 887 mutex_enter(p->p_lock); 888 p->p_slflag &= ~(PSL_TRACED|PSL_FSTRACE|PSL_SYSCALL); 889 mutex_exit(p->p_lock); 890 parent = (p->p_opptr == NULL) ? initproc : p->p_opptr; 891 proc_reparent(p, parent); 892 p->p_opptr = NULL; 893 if (p->p_exitsig != 0) { 894 exit_psignal(p, parent, &ksi); 895 kpsignal(parent, &ksi, NULL); 896 } 897 cv_broadcast(&parent->p_waitcv); 898 mutex_exit(proc_lock); 899 return; 900 } 901 902 sched_proc_exit(parent, p); 903 904 /* 905 * Add child times of exiting process onto its own times. 906 * This cannot be done any earlier else it might get done twice. 907 */ 908 l = LIST_FIRST(&p->p_lwps); 909 p->p_stats->p_ru.ru_nvcsw += (l->l_ncsw - l->l_nivcsw); 910 p->p_stats->p_ru.ru_nivcsw += l->l_nivcsw; 911 ruadd(&p->p_stats->p_ru, &l->l_ru); 912 ruadd(&p->p_stats->p_ru, &p->p_stats->p_cru); 913 ruadd(&parent->p_stats->p_cru, &p->p_stats->p_ru); 914 if (ru != NULL) 915 *ru = p->p_stats->p_ru; 916 p->p_xstat = 0; 917 918 /* Release any SA state. */ 919 #ifdef KERN_SA 920 if (p->p_sa) 921 sa_release(p); 922 #endif 923 924 /* 925 * At this point we are going to start freeing the final resources. 926 * If anyone tries to access the proc structure after here they will 927 * get a shock - bits are missing. Attempt to make it hard! We 928 * don't bother with any further locking past this point. 929 */ 930 p->p_stat = SIDL; /* not even a zombie any more */ 931 LIST_REMOVE(p, p_list); /* off zombproc */ 932 parent->p_nstopchild--; 933 LIST_REMOVE(p, p_sibling); 934 935 /* 936 * Let pid be reallocated. 937 */ 938 proc_free_pid(p->p_pid); 939 940 /* 941 * Unlink process from its process group. 942 * Releases the proc_lock. 943 */ 944 proc_leavepgrp(p); 945 946 /* 947 * Delay release until after lwp_free. 948 */ 949 cred2 = l->l_cred; 950 951 /* 952 * Free the last LWP's resources. 953 * 954 * lwp_free ensures the LWP is no longer running on another CPU. 955 */ 956 lwp_free(l, false, true); 957 958 /* 959 * Now no one except us can reach the process p. 960 */ 961 962 /* 963 * Decrement the count of procs running with this uid. 964 */ 965 cred1 = p->p_cred; 966 uid = kauth_cred_getuid(cred1); 967 (void)chgproccnt(uid, -1); 968 969 /* 970 * Release substructures. 971 */ 972 973 limfree(p->p_limit); 974 pstatsfree(p->p_stats); 975 kauth_cred_free(cred1); 976 kauth_cred_free(cred2); 977 978 /* 979 * Release reference to text vnode 980 */ 981 if (p->p_textvp) 982 vrele(p->p_textvp); 983 984 mutex_destroy(&p->p_auxlock); 985 mutex_obj_free(p->p_lock); 986 mutex_destroy(&p->p_stmutex); 987 cv_destroy(&p->p_waitcv); 988 cv_destroy(&p->p_lwpcv); 989 rw_destroy(&p->p_reflock); 990 991 proc_free_mem(p); 992 } 993 994 /* 995 * make process 'parent' the new parent of process 'child'. 996 * 997 * Must be called with proc_lock held. 998 */ 999 void 1000 proc_reparent(struct proc *child, struct proc *parent) 1001 { 1002 1003 KASSERT(mutex_owned(proc_lock)); 1004 1005 if (child->p_pptr == parent) 1006 return; 1007 1008 if (child->p_stat == SZOMB || 1009 (child->p_stat == SSTOP && !child->p_waited)) { 1010 child->p_pptr->p_nstopchild--; 1011 parent->p_nstopchild++; 1012 } 1013 if (parent == initproc) 1014 child->p_exitsig = SIGCHLD; 1015 1016 LIST_REMOVE(child, p_sibling); 1017 LIST_INSERT_HEAD(&parent->p_children, child, p_sibling); 1018 child->p_pptr = parent; 1019 child->p_ppid = parent->p_pid; 1020 } 1021