1 /*- 2 * Copyright (c) 1982, 1986, 1989, 1991, 1993 3 * The Regents of the University of California. All rights reserved. 4 * (c) UNIX System Laboratories, Inc. 5 * All or some portions of this file are derived from material licensed 6 * to the University of California by American Telephone and Telegraph 7 * Co. or Unix System Laboratories, Inc. and are reproduced herein with 8 * the permission of UNIX System Laboratories, Inc. 9 * 10 * Redistribution and use in source and binary forms, with or without 11 * modification, are permitted provided that the following conditions 12 * are met: 13 * 1. Redistributions of source code must retain the above copyright 14 * notice, this list of conditions and the following disclaimer. 15 * 2. Redistributions in binary form must reproduce the above copyright 16 * notice, this list of conditions and the following disclaimer in the 17 * documentation and/or other materials provided with the distribution. 18 * 4. Neither the name of the University nor the names of its contributors 19 * may be used to endorse or promote products derived from this software 20 * without specific prior written permission. 21 * 22 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 25 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 32 * SUCH DAMAGE. 33 * 34 * @(#)kern_exit.c 8.7 (Berkeley) 2/12/94 35 */ 36 37 #include <sys/cdefs.h> 38 __FBSDID("$FreeBSD$"); 39 40 #include "opt_compat.h" 41 #include "opt_kdtrace.h" 42 #include "opt_ktrace.h" 43 #include "opt_procdesc.h" 44 45 #include <sys/param.h> 46 #include <sys/systm.h> 47 #include <sys/sysproto.h> 48 #include <sys/capability.h> 49 #include <sys/eventhandler.h> 50 #include <sys/kernel.h> 51 #include <sys/malloc.h> 52 #include <sys/lock.h> 53 #include <sys/mutex.h> 54 #include <sys/proc.h> 55 #include <sys/procdesc.h> 56 #include <sys/pioctl.h> 57 #include <sys/jail.h> 58 #include <sys/tty.h> 59 #include <sys/wait.h> 60 #include <sys/vmmeter.h> 61 #include <sys/vnode.h> 62 #include <sys/racct.h> 63 #include <sys/resourcevar.h> 64 #include <sys/sbuf.h> 65 #include <sys/signalvar.h> 66 #include <sys/sched.h> 67 #include <sys/sx.h> 68 #include <sys/syscallsubr.h> 69 #include <sys/syslog.h> 70 #include <sys/ptrace.h> 71 #include <sys/acct.h> /* for acct_process() function prototype */ 72 #include <sys/filedesc.h> 73 #include <sys/sdt.h> 74 #include <sys/shm.h> 75 #include <sys/sem.h> 76 #ifdef KTRACE 77 #include <sys/ktrace.h> 78 #endif 79 80 #include <security/audit/audit.h> 81 #include <security/mac/mac_framework.h> 82 83 #include <vm/vm.h> 84 #include <vm/vm_extern.h> 85 #include <vm/vm_param.h> 86 #include <vm/pmap.h> 87 #include <vm/vm_map.h> 88 #include <vm/vm_page.h> 89 #include <vm/uma.h> 90 91 #ifdef KDTRACE_HOOKS 92 #include <sys/dtrace_bsd.h> 93 dtrace_execexit_func_t dtrace_fasttrap_exit; 94 #endif 95 96 SDT_PROVIDER_DECLARE(proc); 97 SDT_PROBE_DEFINE(proc, kernel, , exit, exit); 98 SDT_PROBE_ARGTYPE(proc, kernel, , exit, 0, "int"); 99 100 /* Hook for NFS teardown procedure. */ 101 void (*nlminfo_release_p)(struct proc *p); 102 103 static void 104 clear_orphan(struct proc *p) 105 { 106 107 PROC_LOCK_ASSERT(p, MA_OWNED); 108 109 if (p->p_flag & P_ORPHAN) { 110 LIST_REMOVE(p, p_orphan); 111 p->p_flag &= ~P_ORPHAN; 112 } 113 } 114 115 /* 116 * exit -- death of process. 117 */ 118 void 119 sys_sys_exit(struct thread *td, struct sys_exit_args *uap) 120 { 121 122 exit1(td, W_EXITCODE(uap->rval, 0)); 123 /* NOTREACHED */ 124 } 125 126 /* 127 * Exit: deallocate address space and other resources, change proc state to 128 * zombie, and unlink proc from allproc and parent's lists. Save exit status 129 * and rusage for wait(). Check for child processes and orphan them. 130 */ 131 void 132 exit1(struct thread *td, int rv) 133 { 134 struct proc *p, *nq, *q; 135 struct vnode *vtmp; 136 struct vnode *ttyvp = NULL; 137 struct plimit *plim; 138 int locked; 139 140 mtx_assert(&Giant, MA_NOTOWNED); 141 142 p = td->td_proc; 143 /* 144 * XXX in case we're rebooting we just let init die in order to 145 * work around an unsolved stack overflow seen very late during 146 * shutdown on sparc64 when the gmirror worker process exists. 147 */ 148 if (p == initproc && rebooting == 0) { 149 printf("init died (signal %d, exit %d)\n", 150 WTERMSIG(rv), WEXITSTATUS(rv)); 151 panic("Going nowhere without my init!"); 152 } 153 154 /* 155 * MUST abort all other threads before proceeding past here. 156 */ 157 PROC_LOCK(p); 158 while (p->p_flag & P_HADTHREADS) { 159 /* 160 * First check if some other thread got here before us.. 161 * if so, act apropriatly, (exit or suspend); 162 */ 163 thread_suspend_check(0); 164 165 /* 166 * Kill off the other threads. This requires 167 * some co-operation from other parts of the kernel 168 * so it may not be instantaneous. With this state set 169 * any thread entering the kernel from userspace will 170 * thread_exit() in trap(). Any thread attempting to 171 * sleep will return immediately with EINTR or EWOULDBLOCK 172 * which will hopefully force them to back out to userland 173 * freeing resources as they go. Any thread attempting 174 * to return to userland will thread_exit() from userret(). 175 * thread_exit() will unsuspend us when the last of the 176 * other threads exits. 177 * If there is already a thread singler after resumption, 178 * calling thread_single will fail; in that case, we just 179 * re-check all suspension request, the thread should 180 * either be suspended there or exit. 181 */ 182 if (! thread_single(SINGLE_EXIT)) 183 break; 184 185 /* 186 * All other activity in this process is now stopped. 187 * Threading support has been turned off. 188 */ 189 } 190 KASSERT(p->p_numthreads == 1, 191 ("exit1: proc %p exiting with %d threads", p, p->p_numthreads)); 192 racct_sub(p, RACCT_NTHR, 1); 193 /* 194 * Wakeup anyone in procfs' PIOCWAIT. They should have a hold 195 * on our vmspace, so we should block below until they have 196 * released their reference to us. Note that if they have 197 * requested S_EXIT stops we will block here until they ack 198 * via PIOCCONT. 199 */ 200 _STOPEVENT(p, S_EXIT, rv); 201 202 /* 203 * Note that we are exiting and do another wakeup of anyone in 204 * PIOCWAIT in case they aren't listening for S_EXIT stops or 205 * decided to wait again after we told them we are exiting. 206 */ 207 p->p_flag |= P_WEXIT; 208 wakeup(&p->p_stype); 209 210 /* 211 * Wait for any processes that have a hold on our vmspace to 212 * release their reference. 213 */ 214 while (p->p_lock > 0) 215 msleep(&p->p_lock, &p->p_mtx, PWAIT, "exithold", 0); 216 217 p->p_xstat = rv; /* Let event handler change exit status */ 218 PROC_UNLOCK(p); 219 /* Drain the limit callout while we don't have the proc locked */ 220 callout_drain(&p->p_limco); 221 222 #ifdef AUDIT 223 /* 224 * The Sun BSM exit token contains two components: an exit status as 225 * passed to exit(), and a return value to indicate what sort of exit 226 * it was. The exit status is WEXITSTATUS(rv), but it's not clear 227 * what the return value is. 228 */ 229 AUDIT_ARG_EXIT(WEXITSTATUS(rv), 0); 230 AUDIT_SYSCALL_EXIT(0, td); 231 #endif 232 233 /* Are we a task leader? */ 234 if (p == p->p_leader) { 235 mtx_lock(&ppeers_lock); 236 q = p->p_peers; 237 while (q != NULL) { 238 PROC_LOCK(q); 239 kern_psignal(q, SIGKILL); 240 PROC_UNLOCK(q); 241 q = q->p_peers; 242 } 243 while (p->p_peers != NULL) 244 msleep(p, &ppeers_lock, PWAIT, "exit1", 0); 245 mtx_unlock(&ppeers_lock); 246 } 247 248 /* 249 * Check if any loadable modules need anything done at process exit. 250 * E.g. SYSV IPC stuff 251 * XXX what if one of these generates an error? 252 */ 253 EVENTHANDLER_INVOKE(process_exit, p); 254 255 /* 256 * If parent is waiting for us to exit or exec, 257 * P_PPWAIT is set; we will wakeup the parent below. 258 */ 259 PROC_LOCK(p); 260 rv = p->p_xstat; /* Event handler could change exit status */ 261 stopprofclock(p); 262 p->p_flag &= ~(P_TRACED | P_PPWAIT); 263 264 /* 265 * Stop the real interval timer. If the handler is currently 266 * executing, prevent it from rearming itself and let it finish. 267 */ 268 if (timevalisset(&p->p_realtimer.it_value) && 269 callout_stop(&p->p_itcallout) == 0) { 270 timevalclear(&p->p_realtimer.it_interval); 271 msleep(&p->p_itcallout, &p->p_mtx, PWAIT, "ritwait", 0); 272 KASSERT(!timevalisset(&p->p_realtimer.it_value), 273 ("realtime timer is still armed")); 274 } 275 PROC_UNLOCK(p); 276 277 /* 278 * Reset any sigio structures pointing to us as a result of 279 * F_SETOWN with our pid. 280 */ 281 funsetownlst(&p->p_sigiolst); 282 283 /* 284 * If this process has an nlminfo data area (for lockd), release it 285 */ 286 if (nlminfo_release_p != NULL && p->p_nlminfo != NULL) 287 (*nlminfo_release_p)(p); 288 289 /* 290 * Close open files and release open-file table. 291 * This may block! 292 */ 293 fdfree(td); 294 295 /* 296 * If this thread tickled GEOM, we need to wait for the giggling to 297 * stop before we return to userland 298 */ 299 if (td->td_pflags & TDP_GEOM) 300 g_waitidle(); 301 302 /* 303 * Remove ourself from our leader's peer list and wake our leader. 304 */ 305 mtx_lock(&ppeers_lock); 306 if (p->p_leader->p_peers) { 307 q = p->p_leader; 308 while (q->p_peers != p) 309 q = q->p_peers; 310 q->p_peers = p->p_peers; 311 wakeup(p->p_leader); 312 } 313 mtx_unlock(&ppeers_lock); 314 315 vmspace_exit(td); 316 317 sx_xlock(&proctree_lock); 318 if (SESS_LEADER(p)) { 319 struct session *sp = p->p_session; 320 struct tty *tp; 321 322 /* 323 * s_ttyp is not zero'd; we use this to indicate that 324 * the session once had a controlling terminal. (for 325 * logging and informational purposes) 326 */ 327 SESS_LOCK(sp); 328 ttyvp = sp->s_ttyvp; 329 tp = sp->s_ttyp; 330 sp->s_ttyvp = NULL; 331 sp->s_ttydp = NULL; 332 sp->s_leader = NULL; 333 SESS_UNLOCK(sp); 334 335 /* 336 * Signal foreground pgrp and revoke access to 337 * controlling terminal if it has not been revoked 338 * already. 339 * 340 * Because the TTY may have been revoked in the mean 341 * time and could already have a new session associated 342 * with it, make sure we don't send a SIGHUP to a 343 * foreground process group that does not belong to this 344 * session. 345 */ 346 347 if (tp != NULL) { 348 tty_lock(tp); 349 if (tp->t_session == sp) 350 tty_signal_pgrp(tp, SIGHUP); 351 tty_unlock(tp); 352 } 353 354 if (ttyvp != NULL) { 355 sx_xunlock(&proctree_lock); 356 if (vn_lock(ttyvp, LK_EXCLUSIVE) == 0) { 357 VOP_REVOKE(ttyvp, REVOKEALL); 358 VOP_UNLOCK(ttyvp, 0); 359 } 360 sx_xlock(&proctree_lock); 361 } 362 } 363 fixjobc(p, p->p_pgrp, 0); 364 sx_xunlock(&proctree_lock); 365 (void)acct_process(td); 366 367 /* Release the TTY now we've unlocked everything. */ 368 if (ttyvp != NULL) 369 vrele(ttyvp); 370 #ifdef KTRACE 371 ktrprocexit(td); 372 #endif 373 /* 374 * Release reference to text vnode 375 */ 376 if ((vtmp = p->p_textvp) != NULL) { 377 p->p_textvp = NULL; 378 locked = VFS_LOCK_GIANT(vtmp->v_mount); 379 vrele(vtmp); 380 VFS_UNLOCK_GIANT(locked); 381 } 382 383 /* 384 * Release our limits structure. 385 */ 386 PROC_LOCK(p); 387 plim = p->p_limit; 388 p->p_limit = NULL; 389 PROC_UNLOCK(p); 390 lim_free(plim); 391 392 tidhash_remove(td); 393 394 /* 395 * Remove proc from allproc queue and pidhash chain. 396 * Place onto zombproc. Unlink from parent's child list. 397 */ 398 sx_xlock(&allproc_lock); 399 LIST_REMOVE(p, p_list); 400 LIST_INSERT_HEAD(&zombproc, p, p_list); 401 LIST_REMOVE(p, p_hash); 402 sx_xunlock(&allproc_lock); 403 404 /* 405 * Call machine-dependent code to release any 406 * machine-dependent resources other than the address space. 407 * The address space is released by "vmspace_exitfree(p)" in 408 * vm_waitproc(). 409 */ 410 cpu_exit(td); 411 412 WITNESS_WARN(WARN_PANIC, NULL, "process (pid %d) exiting", p->p_pid); 413 414 /* 415 * Reparent all of our children to init. 416 */ 417 sx_xlock(&proctree_lock); 418 q = LIST_FIRST(&p->p_children); 419 if (q != NULL) /* only need this if any child is S_ZOMB */ 420 wakeup(initproc); 421 for (; q != NULL; q = nq) { 422 nq = LIST_NEXT(q, p_sibling); 423 PROC_LOCK(q); 424 proc_reparent(q, initproc); 425 q->p_sigparent = SIGCHLD; 426 /* 427 * Traced processes are killed 428 * since their existence means someone is screwing up. 429 */ 430 if (q->p_flag & P_TRACED) { 431 struct thread *temp; 432 433 /* 434 * Since q was found on our children list, the 435 * proc_reparent() call moved q to the orphan 436 * list due to present P_TRACED flag. Clear 437 * orphan link for q now while q is locked. 438 */ 439 clear_orphan(q); 440 q->p_flag &= ~(P_TRACED | P_STOPPED_TRACE); 441 FOREACH_THREAD_IN_PROC(q, temp) 442 temp->td_dbgflags &= ~TDB_SUSPEND; 443 kern_psignal(q, SIGKILL); 444 } 445 PROC_UNLOCK(q); 446 } 447 448 /* 449 * Also get rid of our orphans. 450 */ 451 while ((q = LIST_FIRST(&p->p_orphans)) != NULL) { 452 PROC_LOCK(q); 453 clear_orphan(q); 454 PROC_UNLOCK(q); 455 } 456 457 /* Save exit status. */ 458 PROC_LOCK(p); 459 p->p_xthread = td; 460 461 /* Tell the prison that we are gone. */ 462 prison_proc_free(p->p_ucred->cr_prison); 463 464 #ifdef KDTRACE_HOOKS 465 /* 466 * Tell the DTrace fasttrap provider about the exit if it 467 * has declared an interest. 468 */ 469 if (dtrace_fasttrap_exit) 470 dtrace_fasttrap_exit(p); 471 #endif 472 473 /* 474 * Notify interested parties of our demise. 475 */ 476 KNOTE_LOCKED(&p->p_klist, NOTE_EXIT); 477 478 #ifdef KDTRACE_HOOKS 479 int reason = CLD_EXITED; 480 if (WCOREDUMP(rv)) 481 reason = CLD_DUMPED; 482 else if (WIFSIGNALED(rv)) 483 reason = CLD_KILLED; 484 SDT_PROBE(proc, kernel, , exit, reason, 0, 0, 0, 0); 485 #endif 486 487 /* 488 * Just delete all entries in the p_klist. At this point we won't 489 * report any more events, and there are nasty race conditions that 490 * can beat us if we don't. 491 */ 492 knlist_clear(&p->p_klist, 1); 493 494 /* 495 * If this is a process with a descriptor, we may not need to deliver 496 * a signal to the parent. proctree_lock is held over 497 * procdesc_exit() to serialize concurrent calls to close() and 498 * exit(). 499 */ 500 #ifdef PROCDESC 501 if (p->p_procdesc == NULL || procdesc_exit(p)) { 502 #endif 503 /* 504 * Notify parent that we're gone. If parent has the 505 * PS_NOCLDWAIT flag set, or if the handler is set to SIG_IGN, 506 * notify process 1 instead (and hope it will handle this 507 * situation). 508 */ 509 PROC_LOCK(p->p_pptr); 510 mtx_lock(&p->p_pptr->p_sigacts->ps_mtx); 511 if (p->p_pptr->p_sigacts->ps_flag & 512 (PS_NOCLDWAIT | PS_CLDSIGIGN)) { 513 struct proc *pp; 514 515 mtx_unlock(&p->p_pptr->p_sigacts->ps_mtx); 516 pp = p->p_pptr; 517 PROC_UNLOCK(pp); 518 proc_reparent(p, initproc); 519 p->p_sigparent = SIGCHLD; 520 PROC_LOCK(p->p_pptr); 521 522 /* 523 * Notify parent, so in case he was wait(2)ing or 524 * executing waitpid(2) with our pid, he will 525 * continue. 526 */ 527 wakeup(pp); 528 } else 529 mtx_unlock(&p->p_pptr->p_sigacts->ps_mtx); 530 531 if (p->p_pptr == initproc) 532 kern_psignal(p->p_pptr, SIGCHLD); 533 else if (p->p_sigparent != 0) { 534 if (p->p_sigparent == SIGCHLD) 535 childproc_exited(p); 536 else /* LINUX thread */ 537 kern_psignal(p->p_pptr, p->p_sigparent); 538 } 539 #ifdef PROCDESC 540 } else 541 PROC_LOCK(p->p_pptr); 542 #endif 543 sx_xunlock(&proctree_lock); 544 545 /* 546 * The state PRS_ZOMBIE prevents other proesses from sending 547 * signal to the process, to avoid memory leak, we free memory 548 * for signal queue at the time when the state is set. 549 */ 550 sigqueue_flush(&p->p_sigqueue); 551 sigqueue_flush(&td->td_sigqueue); 552 553 /* 554 * We have to wait until after acquiring all locks before 555 * changing p_state. We need to avoid all possible context 556 * switches (including ones from blocking on a mutex) while 557 * marked as a zombie. We also have to set the zombie state 558 * before we release the parent process' proc lock to avoid 559 * a lost wakeup. So, we first call wakeup, then we grab the 560 * sched lock, update the state, and release the parent process' 561 * proc lock. 562 */ 563 wakeup(p->p_pptr); 564 cv_broadcast(&p->p_pwait); 565 sched_exit(p->p_pptr, td); 566 PROC_SLOCK(p); 567 p->p_state = PRS_ZOMBIE; 568 PROC_UNLOCK(p->p_pptr); 569 570 /* 571 * Hopefully no one will try to deliver a signal to the process this 572 * late in the game. 573 */ 574 knlist_destroy(&p->p_klist); 575 576 /* 577 * Save our children's rusage information in our exit rusage. 578 */ 579 ruadd(&p->p_ru, &p->p_rux, &p->p_stats->p_cru, &p->p_crux); 580 581 /* 582 * Make sure the scheduler takes this thread out of its tables etc. 583 * This will also release this thread's reference to the ucred. 584 * Other thread parts to release include pcb bits and such. 585 */ 586 thread_exit(); 587 } 588 589 590 #ifndef _SYS_SYSPROTO_H_ 591 struct abort2_args { 592 char *why; 593 int nargs; 594 void **args; 595 }; 596 #endif 597 598 int 599 sys_abort2(struct thread *td, struct abort2_args *uap) 600 { 601 struct proc *p = td->td_proc; 602 struct sbuf *sb; 603 void *uargs[16]; 604 int error, i, sig; 605 606 /* 607 * Do it right now so we can log either proper call of abort2(), or 608 * note, that invalid argument was passed. 512 is big enough to 609 * handle 16 arguments' descriptions with additional comments. 610 */ 611 sb = sbuf_new(NULL, NULL, 512, SBUF_FIXEDLEN); 612 sbuf_clear(sb); 613 sbuf_printf(sb, "%s(pid %d uid %d) aborted: ", 614 p->p_comm, p->p_pid, td->td_ucred->cr_uid); 615 /* 616 * Since we can't return from abort2(), send SIGKILL in cases, where 617 * abort2() was called improperly 618 */ 619 sig = SIGKILL; 620 /* Prevent from DoSes from user-space. */ 621 if (uap->nargs < 0 || uap->nargs > 16) 622 goto out; 623 if (uap->nargs > 0) { 624 if (uap->args == NULL) 625 goto out; 626 error = copyin(uap->args, uargs, uap->nargs * sizeof(void *)); 627 if (error != 0) 628 goto out; 629 } 630 /* 631 * Limit size of 'reason' string to 128. Will fit even when 632 * maximal number of arguments was chosen to be logged. 633 */ 634 if (uap->why != NULL) { 635 error = sbuf_copyin(sb, uap->why, 128); 636 if (error < 0) 637 goto out; 638 } else { 639 sbuf_printf(sb, "(null)"); 640 } 641 if (uap->nargs > 0) { 642 sbuf_printf(sb, "("); 643 for (i = 0;i < uap->nargs; i++) 644 sbuf_printf(sb, "%s%p", i == 0 ? "" : ", ", uargs[i]); 645 sbuf_printf(sb, ")"); 646 } 647 /* 648 * Final stage: arguments were proper, string has been 649 * successfully copied from userspace, and copying pointers 650 * from user-space succeed. 651 */ 652 sig = SIGABRT; 653 out: 654 if (sig == SIGKILL) { 655 sbuf_trim(sb); 656 sbuf_printf(sb, " (Reason text inaccessible)"); 657 } 658 sbuf_cat(sb, "\n"); 659 sbuf_finish(sb); 660 log(LOG_INFO, "%s", sbuf_data(sb)); 661 sbuf_delete(sb); 662 exit1(td, W_EXITCODE(0, sig)); 663 return (0); 664 } 665 666 667 #ifdef COMPAT_43 668 /* 669 * The dirty work is handled by kern_wait(). 670 */ 671 int 672 owait(struct thread *td, struct owait_args *uap __unused) 673 { 674 int error, status; 675 676 error = kern_wait(td, WAIT_ANY, &status, 0, NULL); 677 if (error == 0) 678 td->td_retval[1] = status; 679 return (error); 680 } 681 #endif /* COMPAT_43 */ 682 683 /* 684 * The dirty work is handled by kern_wait(). 685 */ 686 int 687 sys_wait4(struct thread *td, struct wait_args *uap) 688 { 689 struct rusage ru, *rup; 690 int error, status; 691 692 if (uap->rusage != NULL) 693 rup = &ru; 694 else 695 rup = NULL; 696 error = kern_wait(td, uap->pid, &status, uap->options, rup); 697 if (uap->status != NULL && error == 0) 698 error = copyout(&status, uap->status, sizeof(status)); 699 if (uap->rusage != NULL && error == 0) 700 error = copyout(&ru, uap->rusage, sizeof(struct rusage)); 701 return (error); 702 } 703 704 /* 705 * Reap the remains of a zombie process and optionally return status and 706 * rusage. Asserts and will release both the proctree_lock and the process 707 * lock as part of its work. 708 */ 709 void 710 proc_reap(struct thread *td, struct proc *p, int *status, int options, 711 struct rusage *rusage) 712 { 713 struct proc *q, *t; 714 715 sx_assert(&proctree_lock, SA_XLOCKED); 716 PROC_LOCK_ASSERT(p, MA_OWNED); 717 PROC_SLOCK_ASSERT(p, MA_OWNED); 718 KASSERT(p->p_state == PRS_ZOMBIE, ("proc_reap: !PRS_ZOMBIE")); 719 720 q = td->td_proc; 721 if (rusage) { 722 *rusage = p->p_ru; 723 calcru(p, &rusage->ru_utime, &rusage->ru_stime); 724 } 725 PROC_SUNLOCK(p); 726 td->td_retval[0] = p->p_pid; 727 if (status) 728 *status = p->p_xstat; /* convert to int */ 729 if (options & WNOWAIT) { 730 /* 731 * Only poll, returning the status. Caller does not wish to 732 * release the proc struct just yet. 733 */ 734 PROC_UNLOCK(p); 735 sx_xunlock(&proctree_lock); 736 return; 737 } 738 739 PROC_LOCK(q); 740 sigqueue_take(p->p_ksi); 741 PROC_UNLOCK(q); 742 PROC_UNLOCK(p); 743 744 /* 745 * If we got the child via a ptrace 'attach', we need to give it back 746 * to the old parent. 747 */ 748 if (p->p_oppid && (t = pfind(p->p_oppid)) != NULL) { 749 PROC_LOCK(p); 750 proc_reparent(p, t); 751 p->p_oppid = 0; 752 PROC_UNLOCK(p); 753 pksignal(t, SIGCHLD, p->p_ksi); 754 wakeup(t); 755 cv_broadcast(&p->p_pwait); 756 PROC_UNLOCK(t); 757 sx_xunlock(&proctree_lock); 758 return; 759 } 760 761 /* 762 * Remove other references to this process to ensure we have an 763 * exclusive reference. 764 */ 765 sx_xlock(&allproc_lock); 766 LIST_REMOVE(p, p_list); /* off zombproc */ 767 sx_xunlock(&allproc_lock); 768 LIST_REMOVE(p, p_sibling); 769 PROC_LOCK(p); 770 clear_orphan(p); 771 PROC_UNLOCK(p); 772 leavepgrp(p); 773 #ifdef PROCDESC 774 if (p->p_procdesc != NULL) 775 procdesc_reap(p); 776 #endif 777 sx_xunlock(&proctree_lock); 778 779 /* 780 * As a side effect of this lock, we know that all other writes to 781 * this proc are visible now, so no more locking is needed for p. 782 */ 783 PROC_LOCK(p); 784 p->p_xstat = 0; /* XXX: why? */ 785 PROC_UNLOCK(p); 786 PROC_LOCK(q); 787 ruadd(&q->p_stats->p_cru, &q->p_crux, &p->p_ru, &p->p_rux); 788 PROC_UNLOCK(q); 789 790 /* 791 * Decrement the count of procs running with this uid. 792 */ 793 (void)chgproccnt(p->p_ucred->cr_ruidinfo, -1, 0); 794 795 /* 796 * Destroy resource accounting information associated with the process. 797 */ 798 #ifdef RACCT 799 PROC_LOCK(p); 800 racct_sub(p, RACCT_NPROC, 1); 801 PROC_UNLOCK(p); 802 #endif 803 racct_proc_exit(p); 804 805 /* 806 * Free credentials, arguments, and sigacts. 807 */ 808 crfree(p->p_ucred); 809 p->p_ucred = NULL; 810 pargs_drop(p->p_args); 811 p->p_args = NULL; 812 sigacts_free(p->p_sigacts); 813 p->p_sigacts = NULL; 814 815 /* 816 * Do any thread-system specific cleanups. 817 */ 818 thread_wait(p); 819 820 /* 821 * Give vm and machine-dependent layer a chance to free anything that 822 * cpu_exit couldn't release while still running in process context. 823 */ 824 vm_waitproc(p); 825 #ifdef MAC 826 mac_proc_destroy(p); 827 #endif 828 KASSERT(FIRST_THREAD_IN_PROC(p), 829 ("proc_reap: no residual thread!")); 830 uma_zfree(proc_zone, p); 831 sx_xlock(&allproc_lock); 832 nprocs--; 833 sx_xunlock(&allproc_lock); 834 } 835 836 static int 837 proc_to_reap(struct thread *td, struct proc *p, pid_t pid, int *status, 838 int options, struct rusage *rusage) 839 { 840 struct proc *q; 841 842 sx_assert(&proctree_lock, SA_XLOCKED); 843 844 q = td->td_proc; 845 PROC_LOCK(p); 846 if (pid != WAIT_ANY && p->p_pid != pid && p->p_pgid != -pid) { 847 PROC_UNLOCK(p); 848 return (0); 849 } 850 if (p_canwait(td, p)) { 851 PROC_UNLOCK(p); 852 return (0); 853 } 854 855 /* 856 * This special case handles a kthread spawned by linux_clone 857 * (see linux_misc.c). The linux_wait4 and linux_waitpid 858 * functions need to be able to distinguish between waiting 859 * on a process and waiting on a thread. It is a thread if 860 * p_sigparent is not SIGCHLD, and the WLINUXCLONE option 861 * signifies we want to wait for threads and not processes. 862 */ 863 if ((p->p_sigparent != SIGCHLD) ^ 864 ((options & WLINUXCLONE) != 0)) { 865 PROC_UNLOCK(p); 866 return (0); 867 } 868 869 PROC_SLOCK(p); 870 if (p->p_state == PRS_ZOMBIE) { 871 proc_reap(td, p, status, options, rusage); 872 return (-1); 873 } 874 PROC_SUNLOCK(p); 875 PROC_UNLOCK(p); 876 return (1); 877 } 878 879 int 880 kern_wait(struct thread *td, pid_t pid, int *status, int options, 881 struct rusage *rusage) 882 { 883 struct proc *p, *q; 884 int error, nfound, ret; 885 886 AUDIT_ARG_PID(pid); 887 AUDIT_ARG_VALUE(options); 888 889 q = td->td_proc; 890 if (pid == 0) { 891 PROC_LOCK(q); 892 pid = -q->p_pgid; 893 PROC_UNLOCK(q); 894 } 895 /* If we don't know the option, just return. */ 896 if (options & ~(WUNTRACED|WNOHANG|WCONTINUED|WNOWAIT|WLINUXCLONE)) 897 return (EINVAL); 898 loop: 899 if (q->p_flag & P_STATCHILD) { 900 PROC_LOCK(q); 901 q->p_flag &= ~P_STATCHILD; 902 PROC_UNLOCK(q); 903 } 904 nfound = 0; 905 sx_xlock(&proctree_lock); 906 LIST_FOREACH(p, &q->p_children, p_sibling) { 907 ret = proc_to_reap(td, p, pid, status, options, rusage); 908 if (ret == 0) 909 continue; 910 else if (ret == 1) 911 nfound++; 912 else 913 return (0); 914 915 PROC_LOCK(p); 916 PROC_SLOCK(p); 917 if ((p->p_flag & P_STOPPED_SIG) && 918 (p->p_suspcount == p->p_numthreads) && 919 (p->p_flag & P_WAITED) == 0 && 920 (p->p_flag & P_TRACED || options & WUNTRACED)) { 921 PROC_SUNLOCK(p); 922 p->p_flag |= P_WAITED; 923 sx_xunlock(&proctree_lock); 924 td->td_retval[0] = p->p_pid; 925 if (status) 926 *status = W_STOPCODE(p->p_xstat); 927 928 PROC_LOCK(q); 929 sigqueue_take(p->p_ksi); 930 PROC_UNLOCK(q); 931 PROC_UNLOCK(p); 932 933 return (0); 934 } 935 PROC_SUNLOCK(p); 936 if (options & WCONTINUED && (p->p_flag & P_CONTINUED)) { 937 sx_xunlock(&proctree_lock); 938 td->td_retval[0] = p->p_pid; 939 p->p_flag &= ~P_CONTINUED; 940 941 PROC_LOCK(q); 942 sigqueue_take(p->p_ksi); 943 PROC_UNLOCK(q); 944 PROC_UNLOCK(p); 945 946 if (status) 947 *status = SIGCONT; 948 return (0); 949 } 950 PROC_UNLOCK(p); 951 } 952 953 /* 954 * Look in the orphans list too, to allow the parent to 955 * collect it's child exit status even if child is being 956 * debugged. 957 * 958 * Debugger detaches from the parent upon successful 959 * switch-over from parent to child. At this point due to 960 * re-parenting the parent loses the child to debugger and a 961 * wait4(2) call would report that it has no children to wait 962 * for. By maintaining a list of orphans we allow the parent 963 * to successfully wait until the child becomes a zombie. 964 */ 965 LIST_FOREACH(p, &q->p_orphans, p_orphan) { 966 ret = proc_to_reap(td, p, pid, status, options, rusage); 967 if (ret == 0) 968 continue; 969 else if (ret == 1) 970 nfound++; 971 else 972 return (0); 973 } 974 if (nfound == 0) { 975 sx_xunlock(&proctree_lock); 976 return (ECHILD); 977 } 978 if (options & WNOHANG) { 979 sx_xunlock(&proctree_lock); 980 td->td_retval[0] = 0; 981 return (0); 982 } 983 PROC_LOCK(q); 984 sx_xunlock(&proctree_lock); 985 if (q->p_flag & P_STATCHILD) { 986 q->p_flag &= ~P_STATCHILD; 987 error = 0; 988 } else 989 error = msleep(q, &q->p_mtx, PWAIT | PCATCH, "wait", 0); 990 PROC_UNLOCK(q); 991 if (error) 992 return (error); 993 goto loop; 994 } 995 996 /* 997 * Make process 'parent' the new parent of process 'child'. 998 * Must be called with an exclusive hold of proctree lock. 999 */ 1000 void 1001 proc_reparent(struct proc *child, struct proc *parent) 1002 { 1003 1004 sx_assert(&proctree_lock, SX_XLOCKED); 1005 PROC_LOCK_ASSERT(child, MA_OWNED); 1006 if (child->p_pptr == parent) 1007 return; 1008 1009 PROC_LOCK(child->p_pptr); 1010 sigqueue_take(child->p_ksi); 1011 PROC_UNLOCK(child->p_pptr); 1012 LIST_REMOVE(child, p_sibling); 1013 LIST_INSERT_HEAD(&parent->p_children, child, p_sibling); 1014 1015 clear_orphan(child); 1016 if (child->p_flag & P_TRACED) { 1017 LIST_INSERT_HEAD(&child->p_pptr->p_orphans, child, p_orphan); 1018 child->p_flag |= P_ORPHAN; 1019 } 1020 1021 child->p_pptr = parent; 1022 } 1023