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_ktrace.h" 42 43 #include <sys/param.h> 44 #include <sys/systm.h> 45 #include <sys/sysproto.h> 46 #include <sys/capsicum.h> 47 #include <sys/eventhandler.h> 48 #include <sys/kernel.h> 49 #include <sys/malloc.h> 50 #include <sys/lock.h> 51 #include <sys/mutex.h> 52 #include <sys/proc.h> 53 #include <sys/procdesc.h> 54 #include <sys/pioctl.h> 55 #include <sys/jail.h> 56 #include <sys/tty.h> 57 #include <sys/wait.h> 58 #include <sys/vmmeter.h> 59 #include <sys/vnode.h> 60 #include <sys/racct.h> 61 #include <sys/resourcevar.h> 62 #include <sys/sbuf.h> 63 #include <sys/signalvar.h> 64 #include <sys/sched.h> 65 #include <sys/sx.h> 66 #include <sys/syscallsubr.h> 67 #include <sys/syslog.h> 68 #include <sys/ptrace.h> 69 #include <sys/acct.h> /* for acct_process() function prototype */ 70 #include <sys/filedesc.h> 71 #include <sys/sdt.h> 72 #include <sys/shm.h> 73 #include <sys/sem.h> 74 #include <sys/umtx.h> 75 #ifdef KTRACE 76 #include <sys/ktrace.h> 77 #endif 78 79 #include <security/audit/audit.h> 80 #include <security/mac/mac_framework.h> 81 82 #include <vm/vm.h> 83 #include <vm/vm_extern.h> 84 #include <vm/vm_param.h> 85 #include <vm/pmap.h> 86 #include <vm/vm_map.h> 87 #include <vm/vm_page.h> 88 #include <vm/uma.h> 89 90 #ifdef KDTRACE_HOOKS 91 #include <sys/dtrace_bsd.h> 92 dtrace_execexit_func_t dtrace_fasttrap_exit; 93 #endif 94 95 SDT_PROVIDER_DECLARE(proc); 96 SDT_PROBE_DEFINE1(proc, kernel, , exit, "int"); 97 98 /* Hook for NFS teardown procedure. */ 99 void (*nlminfo_release_p)(struct proc *p); 100 101 struct proc * 102 proc_realparent(struct proc *child) 103 { 104 struct proc *p, *parent; 105 106 sx_assert(&proctree_lock, SX_LOCKED); 107 if ((child->p_treeflag & P_TREE_ORPHANED) == 0) { 108 if (child->p_oppid == 0 || 109 child->p_pptr->p_pid == child->p_oppid) 110 parent = child->p_pptr; 111 else 112 parent = initproc; 113 return (parent); 114 } 115 for (p = child; (p->p_treeflag & P_TREE_FIRST_ORPHAN) == 0;) { 116 /* Cannot use LIST_PREV(), since the list head is not known. */ 117 p = __containerof(p->p_orphan.le_prev, struct proc, 118 p_orphan.le_next); 119 KASSERT((p->p_treeflag & P_TREE_ORPHANED) != 0, 120 ("missing P_ORPHAN %p", p)); 121 } 122 parent = __containerof(p->p_orphan.le_prev, struct proc, 123 p_orphans.lh_first); 124 return (parent); 125 } 126 127 void 128 reaper_abandon_children(struct proc *p, bool exiting) 129 { 130 struct proc *p1, *p2, *ptmp; 131 132 sx_assert(&proctree_lock, SX_LOCKED); 133 KASSERT(p != initproc, ("reaper_abandon_children for initproc")); 134 if ((p->p_treeflag & P_TREE_REAPER) == 0) 135 return; 136 p1 = p->p_reaper; 137 LIST_FOREACH_SAFE(p2, &p->p_reaplist, p_reapsibling, ptmp) { 138 LIST_REMOVE(p2, p_reapsibling); 139 p2->p_reaper = p1; 140 p2->p_reapsubtree = p->p_reapsubtree; 141 LIST_INSERT_HEAD(&p1->p_reaplist, p2, p_reapsibling); 142 if (exiting && p2->p_pptr == p) { 143 PROC_LOCK(p2); 144 proc_reparent(p2, p1); 145 PROC_UNLOCK(p2); 146 } 147 } 148 KASSERT(LIST_EMPTY(&p->p_reaplist), ("p_reaplist not empty")); 149 p->p_treeflag &= ~P_TREE_REAPER; 150 } 151 152 static void 153 clear_orphan(struct proc *p) 154 { 155 struct proc *p1; 156 157 sx_assert(&proctree_lock, SA_XLOCKED); 158 if ((p->p_treeflag & P_TREE_ORPHANED) == 0) 159 return; 160 if ((p->p_treeflag & P_TREE_FIRST_ORPHAN) != 0) { 161 p1 = LIST_NEXT(p, p_orphan); 162 if (p1 != NULL) 163 p1->p_treeflag |= P_TREE_FIRST_ORPHAN; 164 p->p_treeflag &= ~P_TREE_FIRST_ORPHAN; 165 } 166 LIST_REMOVE(p, p_orphan); 167 p->p_treeflag &= ~P_TREE_ORPHANED; 168 } 169 170 /* 171 * exit -- death of process. 172 */ 173 void 174 sys_sys_exit(struct thread *td, struct sys_exit_args *uap) 175 { 176 177 exit1(td, W_EXITCODE(uap->rval, 0)); 178 /* NOTREACHED */ 179 } 180 181 /* 182 * Exit: deallocate address space and other resources, change proc state to 183 * zombie, and unlink proc from allproc and parent's lists. Save exit status 184 * and rusage for wait(). Check for child processes and orphan them. 185 */ 186 void 187 exit1(struct thread *td, int rv) 188 { 189 struct proc *p, *nq, *q, *t; 190 struct thread *tdt; 191 struct vnode *ttyvp = NULL; 192 193 mtx_assert(&Giant, MA_NOTOWNED); 194 195 p = td->td_proc; 196 /* 197 * XXX in case we're rebooting we just let init die in order to 198 * work around an unsolved stack overflow seen very late during 199 * shutdown on sparc64 when the gmirror worker process exists. 200 */ 201 if (p == initproc && rebooting == 0) { 202 printf("init died (signal %d, exit %d)\n", 203 WTERMSIG(rv), WEXITSTATUS(rv)); 204 panic("Going nowhere without my init!"); 205 } 206 207 /* 208 * MUST abort all other threads before proceeding past here. 209 */ 210 PROC_LOCK(p); 211 /* 212 * First check if some other thread or external request got 213 * here before us. If so, act appropriately: exit or suspend. 214 * We must ensure that stop requests are handled before we set 215 * P_WEXIT. 216 */ 217 thread_suspend_check(0); 218 while (p->p_flag & P_HADTHREADS) { 219 /* 220 * Kill off the other threads. This requires 221 * some co-operation from other parts of the kernel 222 * so it may not be instantaneous. With this state set 223 * any thread entering the kernel from userspace will 224 * thread_exit() in trap(). Any thread attempting to 225 * sleep will return immediately with EINTR or EWOULDBLOCK 226 * which will hopefully force them to back out to userland 227 * freeing resources as they go. Any thread attempting 228 * to return to userland will thread_exit() from userret(). 229 * thread_exit() will unsuspend us when the last of the 230 * other threads exits. 231 * If there is already a thread singler after resumption, 232 * calling thread_single will fail; in that case, we just 233 * re-check all suspension request, the thread should 234 * either be suspended there or exit. 235 */ 236 if (!thread_single(p, SINGLE_EXIT)) 237 /* 238 * All other activity in this process is now 239 * stopped. Threading support has been turned 240 * off. 241 */ 242 break; 243 /* 244 * Recheck for new stop or suspend requests which 245 * might appear while process lock was dropped in 246 * thread_single(). 247 */ 248 thread_suspend_check(0); 249 } 250 KASSERT(p->p_numthreads == 1, 251 ("exit1: proc %p exiting with %d threads", p, p->p_numthreads)); 252 racct_sub(p, RACCT_NTHR, 1); 253 /* 254 * Wakeup anyone in procfs' PIOCWAIT. They should have a hold 255 * on our vmspace, so we should block below until they have 256 * released their reference to us. Note that if they have 257 * requested S_EXIT stops we will block here until they ack 258 * via PIOCCONT. 259 */ 260 _STOPEVENT(p, S_EXIT, rv); 261 262 /* 263 * Ignore any pending request to stop due to a stop signal. 264 * Once P_WEXIT is set, future requests will be ignored as 265 * well. 266 */ 267 p->p_flag &= ~P_STOPPED_SIG; 268 KASSERT(!P_SHOULDSTOP(p), ("exiting process is stopped")); 269 270 /* 271 * Note that we are exiting and do another wakeup of anyone in 272 * PIOCWAIT in case they aren't listening for S_EXIT stops or 273 * decided to wait again after we told them we are exiting. 274 */ 275 p->p_flag |= P_WEXIT; 276 wakeup(&p->p_stype); 277 278 /* 279 * Wait for any processes that have a hold on our vmspace to 280 * release their reference. 281 */ 282 while (p->p_lock > 0) 283 msleep(&p->p_lock, &p->p_mtx, PWAIT, "exithold", 0); 284 285 p->p_xstat = rv; /* Let event handler change exit status */ 286 PROC_UNLOCK(p); 287 /* Drain the limit callout while we don't have the proc locked */ 288 callout_drain(&p->p_limco); 289 290 #ifdef AUDIT 291 /* 292 * The Sun BSM exit token contains two components: an exit status as 293 * passed to exit(), and a return value to indicate what sort of exit 294 * it was. The exit status is WEXITSTATUS(rv), but it's not clear 295 * what the return value is. 296 */ 297 AUDIT_ARG_EXIT(WEXITSTATUS(rv), 0); 298 AUDIT_SYSCALL_EXIT(0, td); 299 #endif 300 301 /* Are we a task leader with peers? */ 302 if (p->p_peers != NULL && p == p->p_leader) { 303 mtx_lock(&ppeers_lock); 304 q = p->p_peers; 305 while (q != NULL) { 306 PROC_LOCK(q); 307 kern_psignal(q, SIGKILL); 308 PROC_UNLOCK(q); 309 q = q->p_peers; 310 } 311 while (p->p_peers != NULL) 312 msleep(p, &ppeers_lock, PWAIT, "exit1", 0); 313 mtx_unlock(&ppeers_lock); 314 } 315 316 /* 317 * Check if any loadable modules need anything done at process exit. 318 * E.g. SYSV IPC stuff 319 * XXX what if one of these generates an error? 320 */ 321 EVENTHANDLER_INVOKE(process_exit, p); 322 323 /* 324 * If parent is waiting for us to exit or exec, 325 * P_PPWAIT is set; we will wakeup the parent below. 326 */ 327 PROC_LOCK(p); 328 rv = p->p_xstat; /* Event handler could change exit status */ 329 stopprofclock(p); 330 p->p_flag &= ~(P_TRACED | P_PPWAIT | P_PPTRACE); 331 332 /* 333 * Stop the real interval timer. If the handler is currently 334 * executing, prevent it from rearming itself and let it finish. 335 */ 336 if (timevalisset(&p->p_realtimer.it_value) && 337 callout_stop(&p->p_itcallout) == 0) { 338 timevalclear(&p->p_realtimer.it_interval); 339 msleep(&p->p_itcallout, &p->p_mtx, PWAIT, "ritwait", 0); 340 KASSERT(!timevalisset(&p->p_realtimer.it_value), 341 ("realtime timer is still armed")); 342 } 343 PROC_UNLOCK(p); 344 345 /* 346 * Reset any sigio structures pointing to us as a result of 347 * F_SETOWN with our pid. 348 */ 349 funsetownlst(&p->p_sigiolst); 350 351 /* 352 * If this process has an nlminfo data area (for lockd), release it 353 */ 354 if (nlminfo_release_p != NULL && p->p_nlminfo != NULL) 355 (*nlminfo_release_p)(p); 356 357 /* 358 * Close open files and release open-file table. 359 * This may block! 360 */ 361 fdescfree(td); 362 363 /* 364 * If this thread tickled GEOM, we need to wait for the giggling to 365 * stop before we return to userland 366 */ 367 if (td->td_pflags & TDP_GEOM) 368 g_waitidle(); 369 370 /* 371 * Remove ourself from our leader's peer list and wake our leader. 372 */ 373 if (p->p_leader->p_peers != NULL) { 374 mtx_lock(&ppeers_lock); 375 if (p->p_leader->p_peers != NULL) { 376 q = p->p_leader; 377 while (q->p_peers != p) 378 q = q->p_peers; 379 q->p_peers = p->p_peers; 380 wakeup(p->p_leader); 381 } 382 mtx_unlock(&ppeers_lock); 383 } 384 385 vmspace_exit(td); 386 387 sx_xlock(&proctree_lock); 388 if (SESS_LEADER(p)) { 389 struct session *sp = p->p_session; 390 struct tty *tp; 391 392 /* 393 * s_ttyp is not zero'd; we use this to indicate that 394 * the session once had a controlling terminal. (for 395 * logging and informational purposes) 396 */ 397 SESS_LOCK(sp); 398 ttyvp = sp->s_ttyvp; 399 tp = sp->s_ttyp; 400 sp->s_ttyvp = NULL; 401 sp->s_ttydp = NULL; 402 sp->s_leader = NULL; 403 SESS_UNLOCK(sp); 404 405 /* 406 * Signal foreground pgrp and revoke access to 407 * controlling terminal if it has not been revoked 408 * already. 409 * 410 * Because the TTY may have been revoked in the mean 411 * time and could already have a new session associated 412 * with it, make sure we don't send a SIGHUP to a 413 * foreground process group that does not belong to this 414 * session. 415 */ 416 417 if (tp != NULL) { 418 tty_lock(tp); 419 if (tp->t_session == sp) 420 tty_signal_pgrp(tp, SIGHUP); 421 tty_unlock(tp); 422 } 423 424 if (ttyvp != NULL) { 425 sx_xunlock(&proctree_lock); 426 if (vn_lock(ttyvp, LK_EXCLUSIVE) == 0) { 427 VOP_REVOKE(ttyvp, REVOKEALL); 428 VOP_UNLOCK(ttyvp, 0); 429 } 430 sx_xlock(&proctree_lock); 431 } 432 } 433 fixjobc(p, p->p_pgrp, 0); 434 sx_xunlock(&proctree_lock); 435 (void)acct_process(td); 436 437 /* Release the TTY now we've unlocked everything. */ 438 if (ttyvp != NULL) 439 vrele(ttyvp); 440 #ifdef KTRACE 441 ktrprocexit(td); 442 #endif 443 /* 444 * Release reference to text vnode 445 */ 446 if (p->p_textvp != NULL) { 447 vrele(p->p_textvp); 448 p->p_textvp = NULL; 449 } 450 451 /* 452 * Release our limits structure. 453 */ 454 lim_free(p->p_limit); 455 p->p_limit = NULL; 456 457 tidhash_remove(td); 458 459 /* 460 * Remove proc from allproc queue and pidhash chain. 461 * Place onto zombproc. Unlink from parent's child list. 462 */ 463 sx_xlock(&allproc_lock); 464 LIST_REMOVE(p, p_list); 465 LIST_INSERT_HEAD(&zombproc, p, p_list); 466 LIST_REMOVE(p, p_hash); 467 sx_xunlock(&allproc_lock); 468 469 /* 470 * Call machine-dependent code to release any 471 * machine-dependent resources other than the address space. 472 * The address space is released by "vmspace_exitfree(p)" in 473 * vm_waitproc(). 474 */ 475 cpu_exit(td); 476 477 WITNESS_WARN(WARN_PANIC, NULL, "process (pid %d) exiting", p->p_pid); 478 479 /* 480 * Reparent all children processes: 481 * - traced ones to the original parent (or init if we are that parent) 482 * - the rest to init 483 */ 484 sx_xlock(&proctree_lock); 485 q = LIST_FIRST(&p->p_children); 486 if (q != NULL) /* only need this if any child is S_ZOMB */ 487 wakeup(q->p_reaper); 488 for (; q != NULL; q = nq) { 489 nq = LIST_NEXT(q, p_sibling); 490 PROC_LOCK(q); 491 q->p_sigparent = SIGCHLD; 492 493 if (!(q->p_flag & P_TRACED)) { 494 proc_reparent(q, q->p_reaper); 495 } else { 496 /* 497 * Traced processes are killed since their existence 498 * means someone is screwing up. 499 */ 500 t = proc_realparent(q); 501 if (t == p) { 502 proc_reparent(q, q->p_reaper); 503 } else { 504 PROC_LOCK(t); 505 proc_reparent(q, t); 506 PROC_UNLOCK(t); 507 } 508 /* 509 * Since q was found on our children list, the 510 * proc_reparent() call moved q to the orphan 511 * list due to present P_TRACED flag. Clear 512 * orphan link for q now while q is locked. 513 */ 514 clear_orphan(q); 515 q->p_flag &= ~(P_TRACED | P_STOPPED_TRACE); 516 FOREACH_THREAD_IN_PROC(q, tdt) 517 tdt->td_dbgflags &= ~TDB_SUSPEND; 518 kern_psignal(q, SIGKILL); 519 } 520 PROC_UNLOCK(q); 521 } 522 523 /* 524 * Also get rid of our orphans. 525 */ 526 while ((q = LIST_FIRST(&p->p_orphans)) != NULL) { 527 PROC_LOCK(q); 528 clear_orphan(q); 529 PROC_UNLOCK(q); 530 } 531 532 /* Save exit status. */ 533 PROC_LOCK(p); 534 p->p_xthread = td; 535 536 /* Tell the prison that we are gone. */ 537 prison_proc_free(p->p_ucred->cr_prison); 538 539 #ifdef KDTRACE_HOOKS 540 /* 541 * Tell the DTrace fasttrap provider about the exit if it 542 * has declared an interest. 543 */ 544 if (dtrace_fasttrap_exit) 545 dtrace_fasttrap_exit(p); 546 #endif 547 548 /* 549 * Notify interested parties of our demise. 550 */ 551 KNOTE_LOCKED(&p->p_klist, NOTE_EXIT); 552 553 #ifdef KDTRACE_HOOKS 554 int reason = CLD_EXITED; 555 if (WCOREDUMP(rv)) 556 reason = CLD_DUMPED; 557 else if (WIFSIGNALED(rv)) 558 reason = CLD_KILLED; 559 SDT_PROBE(proc, kernel, , exit, reason, 0, 0, 0, 0); 560 #endif 561 562 /* 563 * Just delete all entries in the p_klist. At this point we won't 564 * report any more events, and there are nasty race conditions that 565 * can beat us if we don't. 566 */ 567 knlist_clear(&p->p_klist, 1); 568 569 /* 570 * If this is a process with a descriptor, we may not need to deliver 571 * a signal to the parent. proctree_lock is held over 572 * procdesc_exit() to serialize concurrent calls to close() and 573 * exit(). 574 */ 575 if (p->p_procdesc == NULL || procdesc_exit(p)) { 576 /* 577 * Notify parent that we're gone. If parent has the 578 * PS_NOCLDWAIT flag set, or if the handler is set to SIG_IGN, 579 * notify process 1 instead (and hope it will handle this 580 * situation). 581 */ 582 PROC_LOCK(p->p_pptr); 583 mtx_lock(&p->p_pptr->p_sigacts->ps_mtx); 584 if (p->p_pptr->p_sigacts->ps_flag & 585 (PS_NOCLDWAIT | PS_CLDSIGIGN)) { 586 struct proc *pp; 587 588 mtx_unlock(&p->p_pptr->p_sigacts->ps_mtx); 589 pp = p->p_pptr; 590 PROC_UNLOCK(pp); 591 proc_reparent(p, p->p_reaper); 592 p->p_sigparent = SIGCHLD; 593 PROC_LOCK(p->p_pptr); 594 595 /* 596 * Notify parent, so in case he was wait(2)ing or 597 * executing waitpid(2) with our pid, he will 598 * continue. 599 */ 600 wakeup(pp); 601 } else 602 mtx_unlock(&p->p_pptr->p_sigacts->ps_mtx); 603 604 if (p->p_pptr == p->p_reaper || p->p_pptr == initproc) 605 childproc_exited(p); 606 else if (p->p_sigparent != 0) { 607 if (p->p_sigparent == SIGCHLD) 608 childproc_exited(p); 609 else /* LINUX thread */ 610 kern_psignal(p->p_pptr, p->p_sigparent); 611 } 612 } else 613 PROC_LOCK(p->p_pptr); 614 sx_xunlock(&proctree_lock); 615 616 /* 617 * The state PRS_ZOMBIE prevents other proesses from sending 618 * signal to the process, to avoid memory leak, we free memory 619 * for signal queue at the time when the state is set. 620 */ 621 sigqueue_flush(&p->p_sigqueue); 622 sigqueue_flush(&td->td_sigqueue); 623 624 /* 625 * We have to wait until after acquiring all locks before 626 * changing p_state. We need to avoid all possible context 627 * switches (including ones from blocking on a mutex) while 628 * marked as a zombie. We also have to set the zombie state 629 * before we release the parent process' proc lock to avoid 630 * a lost wakeup. So, we first call wakeup, then we grab the 631 * sched lock, update the state, and release the parent process' 632 * proc lock. 633 */ 634 wakeup(p->p_pptr); 635 cv_broadcast(&p->p_pwait); 636 sched_exit(p->p_pptr, td); 637 umtx_thread_exit(td); 638 PROC_SLOCK(p); 639 p->p_state = PRS_ZOMBIE; 640 PROC_UNLOCK(p->p_pptr); 641 642 /* 643 * Hopefully no one will try to deliver a signal to the process this 644 * late in the game. 645 */ 646 knlist_destroy(&p->p_klist); 647 648 /* 649 * Save our children's rusage information in our exit rusage. 650 */ 651 PROC_STATLOCK(p); 652 ruadd(&p->p_ru, &p->p_rux, &p->p_stats->p_cru, &p->p_crux); 653 PROC_STATUNLOCK(p); 654 655 /* 656 * Make sure the scheduler takes this thread out of its tables etc. 657 * This will also release this thread's reference to the ucred. 658 * Other thread parts to release include pcb bits and such. 659 */ 660 thread_exit(); 661 } 662 663 664 #ifndef _SYS_SYSPROTO_H_ 665 struct abort2_args { 666 char *why; 667 int nargs; 668 void **args; 669 }; 670 #endif 671 672 int 673 sys_abort2(struct thread *td, struct abort2_args *uap) 674 { 675 struct proc *p = td->td_proc; 676 struct sbuf *sb; 677 void *uargs[16]; 678 int error, i, sig; 679 680 /* 681 * Do it right now so we can log either proper call of abort2(), or 682 * note, that invalid argument was passed. 512 is big enough to 683 * handle 16 arguments' descriptions with additional comments. 684 */ 685 sb = sbuf_new(NULL, NULL, 512, SBUF_FIXEDLEN); 686 sbuf_clear(sb); 687 sbuf_printf(sb, "%s(pid %d uid %d) aborted: ", 688 p->p_comm, p->p_pid, td->td_ucred->cr_uid); 689 /* 690 * Since we can't return from abort2(), send SIGKILL in cases, where 691 * abort2() was called improperly 692 */ 693 sig = SIGKILL; 694 /* Prevent from DoSes from user-space. */ 695 if (uap->nargs < 0 || uap->nargs > 16) 696 goto out; 697 if (uap->nargs > 0) { 698 if (uap->args == NULL) 699 goto out; 700 error = copyin(uap->args, uargs, uap->nargs * sizeof(void *)); 701 if (error != 0) 702 goto out; 703 } 704 /* 705 * Limit size of 'reason' string to 128. Will fit even when 706 * maximal number of arguments was chosen to be logged. 707 */ 708 if (uap->why != NULL) { 709 error = sbuf_copyin(sb, uap->why, 128); 710 if (error < 0) 711 goto out; 712 } else { 713 sbuf_printf(sb, "(null)"); 714 } 715 if (uap->nargs > 0) { 716 sbuf_printf(sb, "("); 717 for (i = 0;i < uap->nargs; i++) 718 sbuf_printf(sb, "%s%p", i == 0 ? "" : ", ", uargs[i]); 719 sbuf_printf(sb, ")"); 720 } 721 /* 722 * Final stage: arguments were proper, string has been 723 * successfully copied from userspace, and copying pointers 724 * from user-space succeed. 725 */ 726 sig = SIGABRT; 727 out: 728 if (sig == SIGKILL) { 729 sbuf_trim(sb); 730 sbuf_printf(sb, " (Reason text inaccessible)"); 731 } 732 sbuf_cat(sb, "\n"); 733 sbuf_finish(sb); 734 log(LOG_INFO, "%s", sbuf_data(sb)); 735 sbuf_delete(sb); 736 exit1(td, W_EXITCODE(0, sig)); 737 return (0); 738 } 739 740 741 #ifdef COMPAT_43 742 /* 743 * The dirty work is handled by kern_wait(). 744 */ 745 int 746 owait(struct thread *td, struct owait_args *uap __unused) 747 { 748 int error, status; 749 750 error = kern_wait(td, WAIT_ANY, &status, 0, NULL); 751 if (error == 0) 752 td->td_retval[1] = status; 753 return (error); 754 } 755 #endif /* COMPAT_43 */ 756 757 /* 758 * The dirty work is handled by kern_wait(). 759 */ 760 int 761 sys_wait4(struct thread *td, struct wait4_args *uap) 762 { 763 struct rusage ru, *rup; 764 int error, status; 765 766 if (uap->rusage != NULL) 767 rup = &ru; 768 else 769 rup = NULL; 770 error = kern_wait(td, uap->pid, &status, uap->options, rup); 771 if (uap->status != NULL && error == 0) 772 error = copyout(&status, uap->status, sizeof(status)); 773 if (uap->rusage != NULL && error == 0) 774 error = copyout(&ru, uap->rusage, sizeof(struct rusage)); 775 return (error); 776 } 777 778 int 779 sys_wait6(struct thread *td, struct wait6_args *uap) 780 { 781 struct __wrusage wru, *wrup; 782 siginfo_t si, *sip; 783 idtype_t idtype; 784 id_t id; 785 int error, status; 786 787 idtype = uap->idtype; 788 id = uap->id; 789 790 if (uap->wrusage != NULL) 791 wrup = &wru; 792 else 793 wrup = NULL; 794 795 if (uap->info != NULL) { 796 sip = &si; 797 bzero(sip, sizeof(*sip)); 798 } else 799 sip = NULL; 800 801 /* 802 * We expect all callers of wait6() to know about WEXITED and 803 * WTRAPPED. 804 */ 805 error = kern_wait6(td, idtype, id, &status, uap->options, wrup, sip); 806 807 if (uap->status != NULL && error == 0) 808 error = copyout(&status, uap->status, sizeof(status)); 809 if (uap->wrusage != NULL && error == 0) 810 error = copyout(&wru, uap->wrusage, sizeof(wru)); 811 if (uap->info != NULL && error == 0) 812 error = copyout(&si, uap->info, sizeof(si)); 813 return (error); 814 } 815 816 /* 817 * Reap the remains of a zombie process and optionally return status and 818 * rusage. Asserts and will release both the proctree_lock and the process 819 * lock as part of its work. 820 */ 821 void 822 proc_reap(struct thread *td, struct proc *p, int *status, int options) 823 { 824 struct proc *q, *t; 825 826 sx_assert(&proctree_lock, SA_XLOCKED); 827 PROC_LOCK_ASSERT(p, MA_OWNED); 828 PROC_SLOCK_ASSERT(p, MA_OWNED); 829 KASSERT(p->p_state == PRS_ZOMBIE, ("proc_reap: !PRS_ZOMBIE")); 830 831 q = td->td_proc; 832 833 PROC_SUNLOCK(p); 834 td->td_retval[0] = p->p_pid; 835 if (status) 836 *status = p->p_xstat; /* convert to int */ 837 if (options & WNOWAIT) { 838 /* 839 * Only poll, returning the status. Caller does not wish to 840 * release the proc struct just yet. 841 */ 842 PROC_UNLOCK(p); 843 sx_xunlock(&proctree_lock); 844 return; 845 } 846 847 PROC_LOCK(q); 848 sigqueue_take(p->p_ksi); 849 PROC_UNLOCK(q); 850 PROC_UNLOCK(p); 851 852 /* 853 * If we got the child via a ptrace 'attach', we need to give it back 854 * to the old parent. 855 */ 856 if (p->p_oppid != 0) { 857 t = proc_realparent(p); 858 PROC_LOCK(t); 859 PROC_LOCK(p); 860 proc_reparent(p, t); 861 p->p_oppid = 0; 862 PROC_UNLOCK(p); 863 pksignal(t, SIGCHLD, p->p_ksi); 864 wakeup(t); 865 cv_broadcast(&p->p_pwait); 866 PROC_UNLOCK(t); 867 sx_xunlock(&proctree_lock); 868 return; 869 } 870 871 /* 872 * Remove other references to this process to ensure we have an 873 * exclusive reference. 874 */ 875 sx_xlock(&allproc_lock); 876 LIST_REMOVE(p, p_list); /* off zombproc */ 877 sx_xunlock(&allproc_lock); 878 LIST_REMOVE(p, p_sibling); 879 reaper_abandon_children(p, true); 880 LIST_REMOVE(p, p_reapsibling); 881 PROC_LOCK(p); 882 clear_orphan(p); 883 PROC_UNLOCK(p); 884 leavepgrp(p); 885 if (p->p_procdesc != NULL) 886 procdesc_reap(p); 887 sx_xunlock(&proctree_lock); 888 889 /* 890 * Removal from allproc list and process group list paired with 891 * PROC_LOCK which was executed during that time should guarantee 892 * nothing can reach this process anymore. As such further locking 893 * is unnecessary. 894 */ 895 p->p_xstat = 0; /* XXX: why? */ 896 897 PROC_LOCK(q); 898 ruadd(&q->p_stats->p_cru, &q->p_crux, &p->p_ru, &p->p_rux); 899 PROC_UNLOCK(q); 900 901 /* 902 * Decrement the count of procs running with this uid. 903 */ 904 (void)chgproccnt(p->p_ucred->cr_ruidinfo, -1, 0); 905 906 /* 907 * Destroy resource accounting information associated with the process. 908 */ 909 #ifdef RACCT 910 PROC_LOCK(p); 911 racct_sub(p, RACCT_NPROC, 1); 912 PROC_UNLOCK(p); 913 #endif 914 racct_proc_exit(p); 915 916 /* 917 * Free credentials, arguments, and sigacts. 918 */ 919 crfree(p->p_ucred); 920 proc_set_cred(p, NULL); 921 pargs_drop(p->p_args); 922 p->p_args = NULL; 923 sigacts_free(p->p_sigacts); 924 p->p_sigacts = NULL; 925 926 /* 927 * Do any thread-system specific cleanups. 928 */ 929 thread_wait(p); 930 931 /* 932 * Give vm and machine-dependent layer a chance to free anything that 933 * cpu_exit couldn't release while still running in process context. 934 */ 935 vm_waitproc(p); 936 #ifdef MAC 937 mac_proc_destroy(p); 938 #endif 939 KASSERT(FIRST_THREAD_IN_PROC(p), 940 ("proc_reap: no residual thread!")); 941 uma_zfree(proc_zone, p); 942 sx_xlock(&allproc_lock); 943 nprocs--; 944 sx_xunlock(&allproc_lock); 945 } 946 947 static int 948 proc_to_reap(struct thread *td, struct proc *p, idtype_t idtype, id_t id, 949 int *status, int options, struct __wrusage *wrusage, siginfo_t *siginfo) 950 { 951 struct proc *q; 952 struct rusage *rup; 953 954 sx_assert(&proctree_lock, SA_XLOCKED); 955 956 q = td->td_proc; 957 PROC_LOCK(p); 958 959 switch (idtype) { 960 case P_ALL: 961 break; 962 case P_PID: 963 if (p->p_pid != (pid_t)id) { 964 PROC_UNLOCK(p); 965 return (0); 966 } 967 break; 968 case P_PGID: 969 if (p->p_pgid != (pid_t)id) { 970 PROC_UNLOCK(p); 971 return (0); 972 } 973 break; 974 case P_SID: 975 if (p->p_session->s_sid != (pid_t)id) { 976 PROC_UNLOCK(p); 977 return (0); 978 } 979 break; 980 case P_UID: 981 if (p->p_ucred->cr_uid != (uid_t)id) { 982 PROC_UNLOCK(p); 983 return (0); 984 } 985 break; 986 case P_GID: 987 if (p->p_ucred->cr_gid != (gid_t)id) { 988 PROC_UNLOCK(p); 989 return (0); 990 } 991 break; 992 case P_JAILID: 993 if (p->p_ucred->cr_prison->pr_id != (int)id) { 994 PROC_UNLOCK(p); 995 return (0); 996 } 997 break; 998 /* 999 * It seems that the thread structures get zeroed out 1000 * at process exit. This makes it impossible to 1001 * support P_SETID, P_CID or P_CPUID. 1002 */ 1003 default: 1004 PROC_UNLOCK(p); 1005 return (0); 1006 } 1007 1008 if (p_canwait(td, p)) { 1009 PROC_UNLOCK(p); 1010 return (0); 1011 } 1012 1013 if (((options & WEXITED) == 0) && (p->p_state == PRS_ZOMBIE)) { 1014 PROC_UNLOCK(p); 1015 return (0); 1016 } 1017 1018 /* 1019 * This special case handles a kthread spawned by linux_clone 1020 * (see linux_misc.c). The linux_wait4 and linux_waitpid 1021 * functions need to be able to distinguish between waiting 1022 * on a process and waiting on a thread. It is a thread if 1023 * p_sigparent is not SIGCHLD, and the WLINUXCLONE option 1024 * signifies we want to wait for threads and not processes. 1025 */ 1026 if ((p->p_sigparent != SIGCHLD) ^ 1027 ((options & WLINUXCLONE) != 0)) { 1028 PROC_UNLOCK(p); 1029 return (0); 1030 } 1031 1032 if (siginfo != NULL) { 1033 bzero(siginfo, sizeof(*siginfo)); 1034 siginfo->si_errno = 0; 1035 1036 /* 1037 * SUSv4 requires that the si_signo value is always 1038 * SIGCHLD. Obey it despite the rfork(2) interface 1039 * allows to request other signal for child exit 1040 * notification. 1041 */ 1042 siginfo->si_signo = SIGCHLD; 1043 1044 /* 1045 * This is still a rough estimate. We will fix the 1046 * cases TRAPPED, STOPPED, and CONTINUED later. 1047 */ 1048 if (WCOREDUMP(p->p_xstat)) { 1049 siginfo->si_code = CLD_DUMPED; 1050 siginfo->si_status = WTERMSIG(p->p_xstat); 1051 } else if (WIFSIGNALED(p->p_xstat)) { 1052 siginfo->si_code = CLD_KILLED; 1053 siginfo->si_status = WTERMSIG(p->p_xstat); 1054 } else { 1055 siginfo->si_code = CLD_EXITED; 1056 siginfo->si_status = WEXITSTATUS(p->p_xstat); 1057 } 1058 1059 siginfo->si_pid = p->p_pid; 1060 siginfo->si_uid = p->p_ucred->cr_uid; 1061 1062 /* 1063 * The si_addr field would be useful additional 1064 * detail, but apparently the PC value may be lost 1065 * when we reach this point. bzero() above sets 1066 * siginfo->si_addr to NULL. 1067 */ 1068 } 1069 1070 /* 1071 * There should be no reason to limit resources usage info to 1072 * exited processes only. A snapshot about any resources used 1073 * by a stopped process may be exactly what is needed. 1074 */ 1075 if (wrusage != NULL) { 1076 rup = &wrusage->wru_self; 1077 *rup = p->p_ru; 1078 PROC_STATLOCK(p); 1079 calcru(p, &rup->ru_utime, &rup->ru_stime); 1080 PROC_STATUNLOCK(p); 1081 1082 rup = &wrusage->wru_children; 1083 *rup = p->p_stats->p_cru; 1084 calccru(p, &rup->ru_utime, &rup->ru_stime); 1085 } 1086 1087 if (p->p_state == PRS_ZOMBIE) { 1088 PROC_SLOCK(p); 1089 proc_reap(td, p, status, options); 1090 return (-1); 1091 } 1092 PROC_UNLOCK(p); 1093 return (1); 1094 } 1095 1096 int 1097 kern_wait(struct thread *td, pid_t pid, int *status, int options, 1098 struct rusage *rusage) 1099 { 1100 struct __wrusage wru, *wrup; 1101 idtype_t idtype; 1102 id_t id; 1103 int ret; 1104 1105 /* 1106 * Translate the special pid values into the (idtype, pid) 1107 * pair for kern_wait6. The WAIT_MYPGRP case is handled by 1108 * kern_wait6() on its own. 1109 */ 1110 if (pid == WAIT_ANY) { 1111 idtype = P_ALL; 1112 id = 0; 1113 } else if (pid < 0) { 1114 idtype = P_PGID; 1115 id = (id_t)-pid; 1116 } else { 1117 idtype = P_PID; 1118 id = (id_t)pid; 1119 } 1120 1121 if (rusage != NULL) 1122 wrup = &wru; 1123 else 1124 wrup = NULL; 1125 1126 /* 1127 * For backward compatibility we implicitly add flags WEXITED 1128 * and WTRAPPED here. 1129 */ 1130 options |= WEXITED | WTRAPPED; 1131 ret = kern_wait6(td, idtype, id, status, options, wrup, NULL); 1132 if (rusage != NULL) 1133 *rusage = wru.wru_self; 1134 return (ret); 1135 } 1136 1137 int 1138 kern_wait6(struct thread *td, idtype_t idtype, id_t id, int *status, 1139 int options, struct __wrusage *wrusage, siginfo_t *siginfo) 1140 { 1141 struct proc *p, *q; 1142 int error, nfound, ret; 1143 1144 AUDIT_ARG_VALUE((int)idtype); /* XXX - This is likely wrong! */ 1145 AUDIT_ARG_PID((pid_t)id); /* XXX - This may be wrong! */ 1146 AUDIT_ARG_VALUE(options); 1147 1148 q = td->td_proc; 1149 1150 if ((pid_t)id == WAIT_MYPGRP && (idtype == P_PID || idtype == P_PGID)) { 1151 PROC_LOCK(q); 1152 id = (id_t)q->p_pgid; 1153 PROC_UNLOCK(q); 1154 idtype = P_PGID; 1155 } 1156 1157 /* If we don't know the option, just return. */ 1158 if ((options & ~(WUNTRACED | WNOHANG | WCONTINUED | WNOWAIT | 1159 WEXITED | WTRAPPED | WLINUXCLONE)) != 0) 1160 return (EINVAL); 1161 if ((options & (WEXITED | WUNTRACED | WCONTINUED | WTRAPPED)) == 0) { 1162 /* 1163 * We will be unable to find any matching processes, 1164 * because there are no known events to look for. 1165 * Prefer to return error instead of blocking 1166 * indefinitely. 1167 */ 1168 return (EINVAL); 1169 } 1170 1171 loop: 1172 if (q->p_flag & P_STATCHILD) { 1173 PROC_LOCK(q); 1174 q->p_flag &= ~P_STATCHILD; 1175 PROC_UNLOCK(q); 1176 } 1177 nfound = 0; 1178 sx_xlock(&proctree_lock); 1179 LIST_FOREACH(p, &q->p_children, p_sibling) { 1180 ret = proc_to_reap(td, p, idtype, id, status, options, 1181 wrusage, siginfo); 1182 if (ret == 0) 1183 continue; 1184 else if (ret == 1) 1185 nfound++; 1186 else 1187 return (0); 1188 1189 PROC_LOCK(p); 1190 PROC_SLOCK(p); 1191 1192 if ((options & WTRAPPED) != 0 && 1193 (p->p_flag & P_TRACED) != 0 && 1194 (p->p_flag & (P_STOPPED_TRACE | P_STOPPED_SIG)) != 0 && 1195 (p->p_suspcount == p->p_numthreads) && 1196 ((p->p_flag & P_WAITED) == 0)) { 1197 PROC_SUNLOCK(p); 1198 if ((options & WNOWAIT) == 0) 1199 p->p_flag |= P_WAITED; 1200 sx_xunlock(&proctree_lock); 1201 td->td_retval[0] = p->p_pid; 1202 1203 if (status != NULL) 1204 *status = W_STOPCODE(p->p_xstat); 1205 if (siginfo != NULL) { 1206 siginfo->si_status = p->p_xstat; 1207 siginfo->si_code = CLD_TRAPPED; 1208 } 1209 if ((options & WNOWAIT) == 0) { 1210 PROC_LOCK(q); 1211 sigqueue_take(p->p_ksi); 1212 PROC_UNLOCK(q); 1213 } 1214 1215 PROC_UNLOCK(p); 1216 return (0); 1217 } 1218 if ((options & WUNTRACED) != 0 && 1219 (p->p_flag & P_STOPPED_SIG) != 0 && 1220 (p->p_suspcount == p->p_numthreads) && 1221 ((p->p_flag & P_WAITED) == 0)) { 1222 PROC_SUNLOCK(p); 1223 if ((options & WNOWAIT) == 0) 1224 p->p_flag |= P_WAITED; 1225 sx_xunlock(&proctree_lock); 1226 td->td_retval[0] = p->p_pid; 1227 1228 if (status != NULL) 1229 *status = W_STOPCODE(p->p_xstat); 1230 if (siginfo != NULL) { 1231 siginfo->si_status = p->p_xstat; 1232 siginfo->si_code = CLD_STOPPED; 1233 } 1234 if ((options & WNOWAIT) == 0) { 1235 PROC_LOCK(q); 1236 sigqueue_take(p->p_ksi); 1237 PROC_UNLOCK(q); 1238 } 1239 1240 PROC_UNLOCK(p); 1241 return (0); 1242 } 1243 PROC_SUNLOCK(p); 1244 if ((options & WCONTINUED) != 0 && 1245 (p->p_flag & P_CONTINUED) != 0) { 1246 sx_xunlock(&proctree_lock); 1247 td->td_retval[0] = p->p_pid; 1248 if ((options & WNOWAIT) == 0) { 1249 p->p_flag &= ~P_CONTINUED; 1250 PROC_LOCK(q); 1251 sigqueue_take(p->p_ksi); 1252 PROC_UNLOCK(q); 1253 } 1254 PROC_UNLOCK(p); 1255 1256 if (status != NULL) 1257 *status = SIGCONT; 1258 if (siginfo != NULL) { 1259 siginfo->si_status = SIGCONT; 1260 siginfo->si_code = CLD_CONTINUED; 1261 } 1262 return (0); 1263 } 1264 PROC_UNLOCK(p); 1265 } 1266 1267 /* 1268 * Look in the orphans list too, to allow the parent to 1269 * collect it's child exit status even if child is being 1270 * debugged. 1271 * 1272 * Debugger detaches from the parent upon successful 1273 * switch-over from parent to child. At this point due to 1274 * re-parenting the parent loses the child to debugger and a 1275 * wait4(2) call would report that it has no children to wait 1276 * for. By maintaining a list of orphans we allow the parent 1277 * to successfully wait until the child becomes a zombie. 1278 */ 1279 LIST_FOREACH(p, &q->p_orphans, p_orphan) { 1280 ret = proc_to_reap(td, p, idtype, id, status, options, 1281 wrusage, siginfo); 1282 if (ret == 0) 1283 continue; 1284 else if (ret == 1) 1285 nfound++; 1286 else 1287 return (0); 1288 } 1289 if (nfound == 0) { 1290 sx_xunlock(&proctree_lock); 1291 return (ECHILD); 1292 } 1293 if (options & WNOHANG) { 1294 sx_xunlock(&proctree_lock); 1295 td->td_retval[0] = 0; 1296 return (0); 1297 } 1298 PROC_LOCK(q); 1299 sx_xunlock(&proctree_lock); 1300 if (q->p_flag & P_STATCHILD) { 1301 q->p_flag &= ~P_STATCHILD; 1302 error = 0; 1303 } else 1304 error = msleep(q, &q->p_mtx, PWAIT | PCATCH, "wait", 0); 1305 PROC_UNLOCK(q); 1306 if (error) 1307 return (error); 1308 goto loop; 1309 } 1310 1311 /* 1312 * Make process 'parent' the new parent of process 'child'. 1313 * Must be called with an exclusive hold of proctree lock. 1314 */ 1315 void 1316 proc_reparent(struct proc *child, struct proc *parent) 1317 { 1318 1319 sx_assert(&proctree_lock, SX_XLOCKED); 1320 PROC_LOCK_ASSERT(child, MA_OWNED); 1321 if (child->p_pptr == parent) 1322 return; 1323 1324 PROC_LOCK(child->p_pptr); 1325 sigqueue_take(child->p_ksi); 1326 PROC_UNLOCK(child->p_pptr); 1327 LIST_REMOVE(child, p_sibling); 1328 LIST_INSERT_HEAD(&parent->p_children, child, p_sibling); 1329 1330 clear_orphan(child); 1331 if (child->p_flag & P_TRACED) { 1332 if (LIST_EMPTY(&child->p_pptr->p_orphans)) { 1333 child->p_treeflag |= P_TREE_FIRST_ORPHAN; 1334 LIST_INSERT_HEAD(&child->p_pptr->p_orphans, child, 1335 p_orphan); 1336 } else { 1337 LIST_INSERT_AFTER(LIST_FIRST(&child->p_pptr->p_orphans), 1338 child, p_orphan); 1339 } 1340 child->p_treeflag |= P_TREE_ORPHANED; 1341 } 1342 1343 child->p_pptr = parent; 1344 } 1345