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