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 * 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. 25 * 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. 37 * 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.91 2008/05/18 20:02:02 nth Exp $ 41 */ 42 43 #include "opt_compat.h" 44 #include "opt_ktrace.h" 45 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> 71 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_extern.h> 78 #include <sys/user.h> 79 80 #include <sys/thread2.h> 81 #include <sys/sysref2.h> 82 83 static void reaplwps(void *context, int dummy); 84 static void reaplwp(struct lwp *lp); 85 static void killlwps(struct lwp *lp); 86 87 static MALLOC_DEFINE(M_ATEXIT, "atexit", "atexit callback"); 88 static MALLOC_DEFINE(M_ZOMBIE, "zombie", "zombie proc status"); 89 90 /* 91 * callout list for things to do at exit time 92 */ 93 struct exitlist { 94 exitlist_fn function; 95 TAILQ_ENTRY(exitlist) next; 96 }; 97 98 TAILQ_HEAD(exit_list_head, exitlist); 99 static struct exit_list_head exit_list = TAILQ_HEAD_INITIALIZER(exit_list); 100 101 /* 102 * LWP reaper data 103 */ 104 struct task *deadlwp_task[MAXCPU]; 105 struct lwplist deadlwp_list[MAXCPU]; 106 107 /* 108 * exit -- 109 * Death of process. 110 * 111 * SYS_EXIT_ARGS(int rval) 112 */ 113 int 114 sys_exit(struct exit_args *uap) 115 { 116 exit1(W_EXITCODE(uap->rval, 0)); 117 /* NOTREACHED */ 118 } 119 120 /* 121 * Extended exit -- 122 * Death of a lwp or process with optional bells and whistles. 123 */ 124 int 125 sys_extexit(struct extexit_args *uap) 126 { 127 int action, who; 128 int error; 129 130 action = EXTEXIT_ACTION(uap->how); 131 who = EXTEXIT_WHO(uap->how); 132 133 /* Check parameters before we might perform some action */ 134 switch (who) { 135 case EXTEXIT_PROC: 136 case EXTEXIT_LWP: 137 break; 138 139 default: 140 return (EINVAL); 141 } 142 143 switch (action) { 144 case EXTEXIT_SIMPLE: 145 break; 146 147 case EXTEXIT_SETINT: 148 error = copyout(&uap->status, uap->addr, sizeof(uap->status)); 149 if (error) 150 return (error); 151 break; 152 153 default: 154 return (EINVAL); 155 } 156 157 switch (who) { 158 case EXTEXIT_LWP: 159 /* 160 * Be sure only to perform a simple lwp exit if there is at 161 * least one more lwp in the proc, which will call exit1() 162 * later, otherwise the proc will be an UNDEAD and not even a 163 * SZOMB! 164 */ 165 if (curproc->p_nthreads > 1) { 166 lwp_exit(0); 167 /* NOT REACHED */ 168 } 169 /* else last lwp in proc: do the real thing */ 170 /* FALLTHROUGH */ 171 172 default: /* to help gcc */ 173 case EXTEXIT_PROC: 174 exit1(W_EXITCODE(uap->status, 0)); 175 /* NOTREACHED */ 176 } 177 178 /* NOTREACHED */ 179 } 180 181 /* 182 * Kill all lwps associated with the current process except the 183 * current lwp. Return an error if we race another thread trying to 184 * do the same thing and lose the race. 185 * 186 * If forexec is non-zero the current thread and process flags are 187 * cleaned up so they can be reused. 188 */ 189 int 190 killalllwps(int forexec) 191 { 192 struct lwp *lp = curthread->td_lwp; 193 struct proc *p = lp->lwp_proc; 194 195 /* 196 * Interlock against P_WEXIT. Only one of the process's thread 197 * is allowed to do the master exit. 198 */ 199 if (p->p_flag & P_WEXIT) 200 return (EALREADY); 201 p->p_flag |= P_WEXIT; 202 203 /* 204 * Interlock with LWP_WEXIT and kill any remaining LWPs 205 */ 206 lp->lwp_flag |= LWP_WEXIT; 207 if (p->p_nthreads > 1) 208 killlwps(lp); 209 210 /* 211 * If doing this for an exec, clean up the remaining thread 212 * (us) for continuing operation after all the other threads 213 * have been killed. 214 */ 215 if (forexec) { 216 lp->lwp_flag &= ~LWP_WEXIT; 217 p->p_flag &= ~P_WEXIT; 218 } 219 return(0); 220 } 221 222 /* 223 * Kill all LWPs except the current one. Do not try to signal 224 * LWPs which have exited on their own or have already been 225 * signaled. 226 */ 227 static void 228 killlwps(struct lwp *lp) 229 { 230 struct proc *p = lp->lwp_proc; 231 struct lwp *tlp; 232 233 /* 234 * Kill the remaining LWPs. We must send the signal before setting 235 * LWP_WEXIT. The setting of WEXIT is optional but helps reduce 236 * races. tlp must be held across the call as it might block and 237 * allow the target lwp to rip itself out from under our loop. 238 */ 239 FOREACH_LWP_IN_PROC(tlp, p) { 240 LWPHOLD(tlp); 241 if ((tlp->lwp_flag & LWP_WEXIT) == 0) { 242 lwpsignal(p, tlp, SIGKILL); 243 tlp->lwp_flag |= LWP_WEXIT; 244 } 245 LWPRELE(tlp); 246 } 247 248 /* 249 * Wait for everything to clear out. 250 */ 251 while (p->p_nthreads > 1) { 252 tsleep(&p->p_nthreads, 0, "killlwps", 0); 253 } 254 } 255 256 /* 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. 260 */ 261 void 262 exit1(int rv) 263 { 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; 272 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!"); 277 } 278 279 /* 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. 283 */ 284 error = killalllwps(0); 285 if (error) { 286 lwp_exit(0); 287 /* NOT REACHED */ 288 } 289 290 caps_exit(lp->lwp_thread); 291 aio_proc_rundown(p); 292 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; 300 /* 301 * The interface for kill is better 302 * than the internal signal 303 */ 304 sys_kill(&killArgs); 305 nq = q; 306 q = q->p_peers; 307 } 308 while (p->p_peers) 309 tsleep((caddr_t)p, 0, "exit1", 0); 310 } 311 312 #ifdef PGINPROF 313 vmsizmon(); 314 #endif 315 STOPEVENT(p, S_EXIT, rv); 316 wakeup(&p->p_stype); /* Wakeup anyone in procfs' PIOCWAIT */ 317 318 /* 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? 322 */ 323 TAILQ_FOREACH(ep, &exit_list, next) 324 (*ep->function)(td); 325 326 if (p->p_flag & P_PROFIL) 327 stopprofclock(p); 328 /* 329 * If parent is waiting for us to exit or exec, 330 * P_PPWAIT is set; we will wakeup the parent below. 331 */ 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); 337 338 /* 339 * Reset any sigio structures pointing to us as a result of 340 * F_SETOWN with our pid. 341 */ 342 funsetownlst(&p->p_sigiolst); 343 344 /* 345 * Close open files and release open-file table. 346 * This may block! 347 */ 348 fdfree(p); 349 p->p_fd = NULL; 350 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); 357 } 358 359 /* 360 * XXX Shutdown SYSV semaphores 361 */ 362 semexit(p); 363 364 KKASSERT(p->p_numposixlocks == 0); 365 366 /* The next two chunks should probably be moved to vmspace_exit. */ 367 vm = p->p_vmspace; 368 369 /* 370 * Release upcalls associated with this process 371 */ 372 if (vm->vm_upcalls) 373 upc_release(vm, lp); 374 375 /* 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. 379 */ 380 if (p->p_vkernel) { 381 vkernel_lwp_exit(lp); 382 vkernel_exit(p); 383 } 384 385 /* 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. 392 * 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. 399 */ 400 ++vm->vm_exitingcnt; 401 sysref_put(&vm->vm_sysref); 402 403 if (SESS_LEADER(p)) { 404 struct session *sp = p->p_session; 405 406 if (sp->s_ttyvp) { 407 /* 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. 412 * 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. 417 */ 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 */ 423 } 424 /* 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). 428 */ 429 ttyclosesession(sp, 0); 430 431 /* 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) 435 */ 436 } 437 sp->s_leader = NULL; 438 } 439 fixjobc(p, p->p_pgrp, 0); 440 (void)acct_process(p); 441 #ifdef KTRACE 442 /* 443 * release trace file 444 */ 445 if (p->p_tracenode) 446 ktrdestroy(&p->p_tracenode); 447 p->p_traceflag = 0; 448 #endif 449 /* 450 * Release reference to text vnode 451 */ 452 if ((vtmp = p->p_textvp) != NULL) { 453 p->p_textvp = NULL; 454 vrele(vtmp); 455 } 456 457 /* 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(). 462 */ 463 proc_move_allproc_zombie(p); 464 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; 474 /* 475 * Traced processes are killed 476 * since their existence means someone is screwing up. 477 */ 478 if (q->p_flag & P_TRACED) { 479 q->p_flag &= ~P_TRACED; 480 ksignal(q, SIGKILL); 481 } 482 } 483 484 /* 485 * Save exit status and final rusage info, adding in child rusage 486 * info and self times. 487 */ 488 p->p_xstat = rv; 489 calcru_proc(p, &p->p_ru); 490 ruadd(&p->p_ru, &p->p_cru); 491 492 /* 493 * notify interested parties of our demise. 494 */ 495 KNOTE(&p->p_klist, NOTE_EXIT); 496 497 /* 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). 501 */ 502 if (p->p_pptr->p_sigacts->ps_flag & PS_NOCLDWAIT) { 503 struct proc *pp = p->p_pptr; 504 proc_reparent(p, initproc); 505 /* 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. 509 */ 510 if (LIST_EMPTY(&pp->p_children)) 511 wakeup((caddr_t)pp); 512 } 513 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); 518 } 519 520 wakeup((caddr_t)p->p_pptr); 521 /* 522 * cpu_exit is responsible for clearing curproc, since 523 * it is heavily integrated with the thread/switching sequence. 524 * 525 * Other substructures are freed from wait(). 526 */ 527 plimit_free(p); 528 529 /* 530 * Release the current user process designation on the process so 531 * the userland scheduler can work in someone else. 532 */ 533 p->p_usched->release_curproc(lp); 534 535 /* 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. 538 */ 539 lwp_exit(1); 540 } 541 542 void 543 lwp_exit(int masterexit) 544 { 545 struct lwp *lp = curthread->td_lwp; 546 struct proc *p = lp->lwp_proc; 547 548 /* 549 * lwp_exit() may be called without setting LWP_WEXIT, so 550 * make sure it is set here. 551 */ 552 lp->lwp_flag |= LWP_WEXIT; 553 554 /* 555 * Clean up any virtualization 556 */ 557 if (lp->lwp_vkernel) 558 vkernel_lwp_exit(lp); 559 560 /* 561 * Nobody actually wakes us when the lock 562 * count reaches zero, so just wait one tick. 563 */ 564 while (lp->lwp_lock > 0) 565 tsleep(lp, 0, "lwpexit", 1); 566 567 /* Hand down resource usage to our proc */ 568 ruadd(&p->p_ru, &lp->lwp_ru); 569 570 /* 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. 574 */ 575 PHOLD(p); 576 577 /* 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. 582 */ 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; 591 } 592 cpu_lwp_exit(); 593 } 594 595 /* 596 * Wait until a lwp is completely dead. 597 * 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. 601 * 602 * Suggested use: 603 * while (!lwp_wait(lp)) 604 * tsleep(lp, 0, "lwpwait", 1); 605 */ 606 static int 607 lwp_wait(struct lwp *lp) 608 { 609 struct thread *td = lp->lwp_thread;; 610 611 KKASSERT(lwkt_preempted_proc() != lp); 612 613 while (lp->lwp_lock > 0) 614 tsleep(lp, 0, "lwpwait1", 1); 615 616 lwkt_wait_free(td); 617 618 /* 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. 626 * 627 * YYY no wakeup occurs, so we simply return failure 628 * and let the caller deal with sleeping and calling 629 * us again. 630 */ 631 if ((td->td_flags & (TDF_RUNNING|TDF_PREEMPT_LOCK|TDF_EXITING)) != 632 TDF_EXITING) 633 return (0); 634 635 return (1); 636 } 637 638 /* 639 * Release the resources associated with a lwp. 640 * The lwp must be completely dead. 641 */ 642 void 643 lwp_dispose(struct lwp *lp) 644 { 645 struct thread *td = lp->lwp_thread;; 646 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); 651 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); 659 } 660 kfree(lp, M_LWP); 661 } 662 663 int 664 sys_wait4(struct wait_args *uap) 665 { 666 struct rusage rusage; 667 int error, status; 668 669 error = kern_wait(uap->pid, uap->status ? &status : NULL, 670 uap->options, uap->rusage ? &rusage : NULL, &uap->sysmsg_result); 671 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); 677 } 678 679 /* 680 * wait1() 681 * 682 * wait_args(int pid, int *status, int options, struct rusage *rusage) 683 */ 684 int 685 kern_wait(pid_t pid, int *status, int options, struct rusage *rusage, int *res) 686 { 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; 692 693 if (pid == 0) 694 pid = -q->p_pgid; 695 if (options &~ (WUNTRACED|WNOHANG|WCONTINUED|WLINUXCLONE)) 696 return (EINVAL); 697 loop: 698 /* 699 * Hack for backwards compatibility with badly written user code. 700 * Or perhaps we have to do this anyway, it is unclear. XXX 701 * 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). 708 * 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. 713 */ 714 while (q->p_stat == SSTOP) 715 tstop(); 716 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; 722 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. 729 */ 730 if ((p->p_sigparent != SIGCHLD) ^ 731 ((options & WLINUXCLONE) != 0)) { 732 continue; 733 } 734 735 nfound++; 736 if (p->p_stat == SZOMB) { 737 /* 738 * We may go into SZOMB with threads still present. 739 * We must wait for them to exit before we can reap 740 * the master thread, otherwise we may race reaping 741 * non-master threads. 742 */ 743 while (p->p_nthreads > 0) { 744 tsleep(&p->p_nthreads, 0, "lwpzomb", hz); 745 } 746 747 /* 748 * Reap any LWPs left in p->p_lwps. This is usually 749 * just the last LWP. This must be done before 750 * we loop on p_lock since the lwps hold a ref on 751 * it as a vmspace interlock. 752 * 753 * Once that is accomplished p_nthreads had better 754 * be zero. 755 */ 756 while ((lp = RB_ROOT(&p->p_lwp_tree)) != NULL) { 757 lwp_rb_tree_RB_REMOVE(&p->p_lwp_tree, lp); 758 reaplwp(lp); 759 } 760 KKASSERT(p->p_nthreads == 0); 761 762 /* 763 * Don't do anything really bad until all references 764 * to the process go away. This may include other 765 * LWPs which are still in the process of being 766 * reaped. We can't just pull the rug out from under 767 * them because they may still be using the VM space. 768 * 769 * Certain kernel facilities such as /proc will also 770 * put a hold on the process for short periods of 771 * time. 772 */ 773 while (p->p_lock) 774 tsleep(p, 0, "reap3", hz); 775 776 /* scheduling hook for heuristic */ 777 /* XXX no lwp available, we need a different heuristic */ 778 /* 779 p->p_usched->heuristic_exiting(td->td_lwp, deadlp); 780 */ 781 782 /* Take care of our return values. */ 783 *res = p->p_pid; 784 if (status) 785 *status = p->p_xstat; 786 if (rusage) 787 *rusage = p->p_ru; 788 /* 789 * If we got the child via a ptrace 'attach', 790 * we need to give it back to the old parent. 791 */ 792 if (p->p_oppid && (t = pfind(p->p_oppid))) { 793 p->p_oppid = 0; 794 proc_reparent(p, t); 795 ksignal(t, SIGCHLD); 796 wakeup((caddr_t)t); 797 return (0); 798 } 799 800 /* 801 * Unlink the proc from its process group so that 802 * the following operations won't lead to an 803 * inconsistent state for processes running down 804 * the zombie list. 805 */ 806 KKASSERT(p->p_lock == 0); 807 proc_remove_zombie(p); 808 leavepgrp(p); 809 810 p->p_xstat = 0; 811 ruadd(&q->p_cru, &p->p_ru); 812 813 /* 814 * Decrement the count of procs running with this uid. 815 */ 816 chgproccnt(p->p_ucred->cr_ruidinfo, -1, 0); 817 818 /* 819 * Free up credentials. 820 */ 821 crfree(p->p_ucred); 822 p->p_ucred = NULL; 823 824 /* 825 * Remove unused arguments 826 */ 827 if (p->p_args && --p->p_args->ar_ref == 0) 828 FREE(p->p_args, M_PARGS); 829 830 if (--p->p_sigacts->ps_refcnt == 0) { 831 kfree(p->p_sigacts, M_SUBPROC); 832 p->p_sigacts = NULL; 833 } 834 835 vm_waitproc(p); 836 kfree(p, M_PROC); 837 nprocs--; 838 return (0); 839 } 840 if (p->p_stat == SSTOP && (p->p_flag & P_WAITED) == 0 && 841 (p->p_flag & P_TRACED || options & WUNTRACED)) { 842 p->p_flag |= P_WAITED; 843 844 *res = p->p_pid; 845 if (status) 846 *status = W_STOPCODE(p->p_xstat); 847 /* Zero rusage so we get something consistent. */ 848 if (rusage) 849 bzero(rusage, sizeof(rusage)); 850 return (0); 851 } 852 if (options & WCONTINUED && (p->p_flag & P_CONTINUED)) { 853 *res = p->p_pid; 854 p->p_flag &= ~P_CONTINUED; 855 856 if (status) 857 *status = SIGCONT; 858 return (0); 859 } 860 } 861 if (nfound == 0) 862 return (ECHILD); 863 if (options & WNOHANG) { 864 *res = 0; 865 return (0); 866 } 867 error = tsleep((caddr_t)q, PCATCH, "wait", 0); 868 if (error) 869 return (error); 870 goto loop; 871 } 872 873 /* 874 * make process 'parent' the new parent of process 'child'. 875 */ 876 void 877 proc_reparent(struct proc *child, struct proc *parent) 878 { 879 880 if (child->p_pptr == parent) 881 return; 882 883 LIST_REMOVE(child, p_sibling); 884 LIST_INSERT_HEAD(&parent->p_children, child, p_sibling); 885 child->p_pptr = parent; 886 } 887 888 /* 889 * The next two functions are to handle adding/deleting items on the 890 * exit callout list 891 * 892 * at_exit(): 893 * Take the arguments given and put them onto the exit callout list, 894 * However first make sure that it's not already there. 895 * returns 0 on success. 896 */ 897 898 int 899 at_exit(exitlist_fn function) 900 { 901 struct exitlist *ep; 902 903 #ifdef INVARIANTS 904 /* Be noisy if the programmer has lost track of things */ 905 if (rm_at_exit(function)) 906 kprintf("WARNING: exit callout entry (%p) already present\n", 907 function); 908 #endif 909 ep = kmalloc(sizeof(*ep), M_ATEXIT, M_NOWAIT); 910 if (ep == NULL) 911 return (ENOMEM); 912 ep->function = function; 913 TAILQ_INSERT_TAIL(&exit_list, ep, next); 914 return (0); 915 } 916 917 /* 918 * Scan the exit callout list for the given item and remove it. 919 * Returns the number of items removed (0 or 1) 920 */ 921 int 922 rm_at_exit(exitlist_fn function) 923 { 924 struct exitlist *ep; 925 926 TAILQ_FOREACH(ep, &exit_list, next) { 927 if (ep->function == function) { 928 TAILQ_REMOVE(&exit_list, ep, next); 929 kfree(ep, M_ATEXIT); 930 return(1); 931 } 932 } 933 return (0); 934 } 935 936 /* 937 * LWP reaper related code. 938 */ 939 static void 940 reaplwps(void *context, int dummy) 941 { 942 struct lwplist *lwplist = context; 943 struct lwp *lp; 944 945 while ((lp = LIST_FIRST(lwplist))) { 946 LIST_REMOVE(lp, u.lwp_reap_entry); 947 reaplwp(lp); 948 } 949 } 950 951 static void 952 reaplwp(struct lwp *lp) 953 { 954 while (lwp_wait(lp) == 0) 955 tsleep(lp, 0, "lwpreap", 1); 956 lwp_dispose(lp); 957 } 958 959 static void 960 deadlwp_init(void) 961 { 962 int cpu; 963 964 for (cpu = 0; cpu < ncpus; cpu++) { 965 LIST_INIT(&deadlwp_list[cpu]); 966 deadlwp_task[cpu] = kmalloc(sizeof(*deadlwp_task[cpu]), M_DEVBUF, M_WAITOK); 967 TASK_INIT(deadlwp_task[cpu], 0, reaplwps, &deadlwp_list[cpu]); 968 } 969 } 970 971 SYSINIT(deadlwpinit, SI_SUB_CONFIGURE, SI_ORDER_ANY, deadlwp_init, NULL); 972