1 /*- 2 * Copyright (c) 1982, 1986, 1989, 1991, 1993 3 * The Regents of the University of California. All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright 9 * notice, this list of conditions and the following disclaimer. 10 * 2. Redistributions in binary form must reproduce the above copyright 11 * notice, this list of conditions and the following disclaimer in the 12 * documentation and/or other materials provided with the distribution. 13 * 4. Neither the name of the University nor the names of its contributors 14 * may be used to endorse or promote products derived from this software 15 * without specific prior written permission. 16 * 17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 20 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 27 * SUCH DAMAGE. 28 * 29 * @(#)kern_proc.c 8.7 (Berkeley) 2/14/95 30 */ 31 32 #include <sys/cdefs.h> 33 __FBSDID("$FreeBSD$"); 34 35 #include "opt_compat.h" 36 #include "opt_ddb.h" 37 #include "opt_kdtrace.h" 38 #include "opt_ktrace.h" 39 #include "opt_kstack_pages.h" 40 #include "opt_stack.h" 41 42 #include <sys/param.h> 43 #include <sys/systm.h> 44 #include <sys/kernel.h> 45 #include <sys/lock.h> 46 #include <sys/malloc.h> 47 #include <sys/mount.h> 48 #include <sys/mutex.h> 49 #include <sys/proc.h> 50 #include <sys/refcount.h> 51 #include <sys/sbuf.h> 52 #include <sys/sysent.h> 53 #include <sys/sched.h> 54 #include <sys/smp.h> 55 #include <sys/stack.h> 56 #include <sys/sysctl.h> 57 #include <sys/filedesc.h> 58 #include <sys/tty.h> 59 #include <sys/signalvar.h> 60 #include <sys/sdt.h> 61 #include <sys/sx.h> 62 #include <sys/user.h> 63 #include <sys/jail.h> 64 #include <sys/vnode.h> 65 #include <sys/eventhandler.h> 66 #ifdef KTRACE 67 #include <sys/uio.h> 68 #include <sys/ktrace.h> 69 #endif 70 71 #ifdef DDB 72 #include <ddb/ddb.h> 73 #endif 74 75 #include <vm/vm.h> 76 #include <vm/vm_extern.h> 77 #include <vm/pmap.h> 78 #include <vm/vm_map.h> 79 #include <vm/vm_object.h> 80 #include <vm/uma.h> 81 82 SDT_PROVIDER_DEFINE(proc); 83 SDT_PROBE_DEFINE(proc, kernel, ctor, entry); 84 SDT_PROBE_ARGTYPE(proc, kernel, ctor, entry, 0, "struct proc *"); 85 SDT_PROBE_ARGTYPE(proc, kernel, ctor, entry, 1, "int"); 86 SDT_PROBE_ARGTYPE(proc, kernel, ctor, entry, 2, "void *"); 87 SDT_PROBE_ARGTYPE(proc, kernel, ctor, entry, 3, "int"); 88 SDT_PROBE_DEFINE(proc, kernel, ctor, return); 89 SDT_PROBE_ARGTYPE(proc, kernel, ctor, return, 0, "struct proc *"); 90 SDT_PROBE_ARGTYPE(proc, kernel, ctor, return, 1, "int"); 91 SDT_PROBE_ARGTYPE(proc, kernel, ctor, return, 2, "void *"); 92 SDT_PROBE_ARGTYPE(proc, kernel, ctor, return, 3, "int"); 93 SDT_PROBE_DEFINE(proc, kernel, dtor, entry); 94 SDT_PROBE_ARGTYPE(proc, kernel, dtor, entry, 0, "struct proc *"); 95 SDT_PROBE_ARGTYPE(proc, kernel, dtor, entry, 1, "int"); 96 SDT_PROBE_ARGTYPE(proc, kernel, dtor, entry, 2, "void *"); 97 SDT_PROBE_ARGTYPE(proc, kernel, dtor, entry, 3, "struct thread *"); 98 SDT_PROBE_DEFINE(proc, kernel, dtor, return); 99 SDT_PROBE_ARGTYPE(proc, kernel, dtor, return, 0, "struct proc *"); 100 SDT_PROBE_ARGTYPE(proc, kernel, dtor, return, 1, "int"); 101 SDT_PROBE_ARGTYPE(proc, kernel, dtor, return, 2, "void *"); 102 SDT_PROBE_DEFINE(proc, kernel, init, entry); 103 SDT_PROBE_ARGTYPE(proc, kernel, init, entry, 0, "struct proc *"); 104 SDT_PROBE_ARGTYPE(proc, kernel, init, entry, 1, "int"); 105 SDT_PROBE_ARGTYPE(proc, kernel, init, entry, 2, "int"); 106 SDT_PROBE_DEFINE(proc, kernel, init, return); 107 SDT_PROBE_ARGTYPE(proc, kernel, init, return, 0, "struct proc *"); 108 SDT_PROBE_ARGTYPE(proc, kernel, init, return, 1, "int"); 109 SDT_PROBE_ARGTYPE(proc, kernel, init, return, 2, "int"); 110 111 MALLOC_DEFINE(M_PGRP, "pgrp", "process group header"); 112 MALLOC_DEFINE(M_SESSION, "session", "session header"); 113 static MALLOC_DEFINE(M_PROC, "proc", "Proc structures"); 114 MALLOC_DEFINE(M_SUBPROC, "subproc", "Proc sub-structures"); 115 116 static void doenterpgrp(struct proc *, struct pgrp *); 117 static void orphanpg(struct pgrp *pg); 118 static void fill_kinfo_proc_only(struct proc *p, struct kinfo_proc *kp); 119 static void fill_kinfo_thread(struct thread *td, struct kinfo_proc *kp, 120 int preferthread); 121 static void pgadjustjobc(struct pgrp *pgrp, int entering); 122 static void pgdelete(struct pgrp *); 123 static int proc_ctor(void *mem, int size, void *arg, int flags); 124 static void proc_dtor(void *mem, int size, void *arg); 125 static int proc_init(void *mem, int size, int flags); 126 static void proc_fini(void *mem, int size); 127 static void pargs_free(struct pargs *pa); 128 129 /* 130 * Other process lists 131 */ 132 struct pidhashhead *pidhashtbl; 133 u_long pidhash; 134 struct pgrphashhead *pgrphashtbl; 135 u_long pgrphash; 136 struct proclist allproc; 137 struct proclist zombproc; 138 struct sx allproc_lock; 139 struct sx proctree_lock; 140 struct mtx ppeers_lock; 141 uma_zone_t proc_zone; 142 uma_zone_t ithread_zone; 143 144 int kstack_pages = KSTACK_PAGES; 145 SYSCTL_INT(_kern, OID_AUTO, kstack_pages, CTLFLAG_RD, &kstack_pages, 0, ""); 146 147 CTASSERT(sizeof(struct kinfo_proc) == KINFO_PROC_SIZE); 148 149 /* 150 * Initialize global process hashing structures. 151 */ 152 void 153 procinit() 154 { 155 156 sx_init(&allproc_lock, "allproc"); 157 sx_init(&proctree_lock, "proctree"); 158 mtx_init(&ppeers_lock, "p_peers", NULL, MTX_DEF); 159 LIST_INIT(&allproc); 160 LIST_INIT(&zombproc); 161 pidhashtbl = hashinit(maxproc / 4, M_PROC, &pidhash); 162 pgrphashtbl = hashinit(maxproc / 4, M_PROC, &pgrphash); 163 proc_zone = uma_zcreate("PROC", sched_sizeof_proc(), 164 proc_ctor, proc_dtor, proc_init, proc_fini, 165 UMA_ALIGN_PTR, UMA_ZONE_NOFREE); 166 uihashinit(); 167 } 168 169 /* 170 * Prepare a proc for use. 171 */ 172 static int 173 proc_ctor(void *mem, int size, void *arg, int flags) 174 { 175 struct proc *p; 176 177 p = (struct proc *)mem; 178 SDT_PROBE(proc, kernel, ctor , entry, p, size, arg, flags, 0); 179 EVENTHANDLER_INVOKE(process_ctor, p); 180 SDT_PROBE(proc, kernel, ctor , return, p, size, arg, flags, 0); 181 return (0); 182 } 183 184 /* 185 * Reclaim a proc after use. 186 */ 187 static void 188 proc_dtor(void *mem, int size, void *arg) 189 { 190 struct proc *p; 191 struct thread *td; 192 193 /* INVARIANTS checks go here */ 194 p = (struct proc *)mem; 195 td = FIRST_THREAD_IN_PROC(p); 196 SDT_PROBE(proc, kernel, dtor, entry, p, size, arg, td, 0); 197 if (td != NULL) { 198 #ifdef INVARIANTS 199 KASSERT((p->p_numthreads == 1), 200 ("bad number of threads in exiting process")); 201 KASSERT(STAILQ_EMPTY(&p->p_ktr), ("proc_dtor: non-empty p_ktr")); 202 #endif 203 /* Free all OSD associated to this thread. */ 204 osd_thread_exit(td); 205 206 /* Dispose of an alternate kstack, if it exists. 207 * XXX What if there are more than one thread in the proc? 208 * The first thread in the proc is special and not 209 * freed, so you gotta do this here. 210 */ 211 if (((p->p_flag & P_KTHREAD) != 0) && (td->td_altkstack != 0)) 212 vm_thread_dispose_altkstack(td); 213 } 214 EVENTHANDLER_INVOKE(process_dtor, p); 215 if (p->p_ksi != NULL) 216 KASSERT(! KSI_ONQ(p->p_ksi), ("SIGCHLD queue")); 217 SDT_PROBE(proc, kernel, dtor, return, p, size, arg, 0, 0); 218 } 219 220 /* 221 * Initialize type-stable parts of a proc (when newly created). 222 */ 223 static int 224 proc_init(void *mem, int size, int flags) 225 { 226 struct proc *p; 227 228 p = (struct proc *)mem; 229 SDT_PROBE(proc, kernel, init, entry, p, size, flags, 0, 0); 230 p->p_sched = (struct p_sched *)&p[1]; 231 bzero(&p->p_mtx, sizeof(struct mtx)); 232 mtx_init(&p->p_mtx, "process lock", NULL, MTX_DEF | MTX_DUPOK); 233 mtx_init(&p->p_slock, "process slock", NULL, MTX_SPIN | MTX_RECURSE); 234 TAILQ_INIT(&p->p_threads); /* all threads in proc */ 235 EVENTHANDLER_INVOKE(process_init, p); 236 p->p_stats = pstats_alloc(); 237 SDT_PROBE(proc, kernel, init, return, p, size, flags, 0, 0); 238 return (0); 239 } 240 241 /* 242 * UMA should ensure that this function is never called. 243 * Freeing a proc structure would violate type stability. 244 */ 245 static void 246 proc_fini(void *mem, int size) 247 { 248 #ifdef notnow 249 struct proc *p; 250 251 p = (struct proc *)mem; 252 EVENTHANDLER_INVOKE(process_fini, p); 253 pstats_free(p->p_stats); 254 thread_free(FIRST_THREAD_IN_PROC(p)); 255 mtx_destroy(&p->p_mtx); 256 if (p->p_ksi != NULL) 257 ksiginfo_free(p->p_ksi); 258 #else 259 panic("proc reclaimed"); 260 #endif 261 } 262 263 /* 264 * Is p an inferior of the current process? 265 */ 266 int 267 inferior(p) 268 register struct proc *p; 269 { 270 271 sx_assert(&proctree_lock, SX_LOCKED); 272 for (; p != curproc; p = p->p_pptr) 273 if (p->p_pid == 0) 274 return (0); 275 return (1); 276 } 277 278 /* 279 * Locate a process by number; return only "live" processes -- i.e., neither 280 * zombies nor newly born but incompletely initialized processes. By not 281 * returning processes in the PRS_NEW state, we allow callers to avoid 282 * testing for that condition to avoid dereferencing p_ucred, et al. 283 */ 284 struct proc * 285 pfind(pid) 286 register pid_t pid; 287 { 288 register struct proc *p; 289 290 sx_slock(&allproc_lock); 291 LIST_FOREACH(p, PIDHASH(pid), p_hash) 292 if (p->p_pid == pid) { 293 if (p->p_state == PRS_NEW) { 294 p = NULL; 295 break; 296 } 297 PROC_LOCK(p); 298 break; 299 } 300 sx_sunlock(&allproc_lock); 301 return (p); 302 } 303 304 /* 305 * Locate a process group by number. 306 * The caller must hold proctree_lock. 307 */ 308 struct pgrp * 309 pgfind(pgid) 310 register pid_t pgid; 311 { 312 register struct pgrp *pgrp; 313 314 sx_assert(&proctree_lock, SX_LOCKED); 315 316 LIST_FOREACH(pgrp, PGRPHASH(pgid), pg_hash) { 317 if (pgrp->pg_id == pgid) { 318 PGRP_LOCK(pgrp); 319 return (pgrp); 320 } 321 } 322 return (NULL); 323 } 324 325 /* 326 * Create a new process group. 327 * pgid must be equal to the pid of p. 328 * Begin a new session if required. 329 */ 330 int 331 enterpgrp(p, pgid, pgrp, sess) 332 register struct proc *p; 333 pid_t pgid; 334 struct pgrp *pgrp; 335 struct session *sess; 336 { 337 struct pgrp *pgrp2; 338 339 sx_assert(&proctree_lock, SX_XLOCKED); 340 341 KASSERT(pgrp != NULL, ("enterpgrp: pgrp == NULL")); 342 KASSERT(p->p_pid == pgid, 343 ("enterpgrp: new pgrp and pid != pgid")); 344 345 pgrp2 = pgfind(pgid); 346 347 KASSERT(pgrp2 == NULL, 348 ("enterpgrp: pgrp with pgid exists")); 349 KASSERT(!SESS_LEADER(p), 350 ("enterpgrp: session leader attempted setpgrp")); 351 352 mtx_init(&pgrp->pg_mtx, "process group", NULL, MTX_DEF | MTX_DUPOK); 353 354 if (sess != NULL) { 355 /* 356 * new session 357 */ 358 mtx_init(&sess->s_mtx, "session", NULL, MTX_DEF); 359 PROC_LOCK(p); 360 p->p_flag &= ~P_CONTROLT; 361 PROC_UNLOCK(p); 362 PGRP_LOCK(pgrp); 363 sess->s_leader = p; 364 sess->s_sid = p->p_pid; 365 refcount_init(&sess->s_count, 1); 366 sess->s_ttyvp = NULL; 367 sess->s_ttyp = NULL; 368 bcopy(p->p_session->s_login, sess->s_login, 369 sizeof(sess->s_login)); 370 pgrp->pg_session = sess; 371 KASSERT(p == curproc, 372 ("enterpgrp: mksession and p != curproc")); 373 } else { 374 pgrp->pg_session = p->p_session; 375 sess_hold(pgrp->pg_session); 376 PGRP_LOCK(pgrp); 377 } 378 pgrp->pg_id = pgid; 379 LIST_INIT(&pgrp->pg_members); 380 381 /* 382 * As we have an exclusive lock of proctree_lock, 383 * this should not deadlock. 384 */ 385 LIST_INSERT_HEAD(PGRPHASH(pgid), pgrp, pg_hash); 386 pgrp->pg_jobc = 0; 387 SLIST_INIT(&pgrp->pg_sigiolst); 388 PGRP_UNLOCK(pgrp); 389 390 doenterpgrp(p, pgrp); 391 392 return (0); 393 } 394 395 /* 396 * Move p to an existing process group 397 */ 398 int 399 enterthispgrp(p, pgrp) 400 register struct proc *p; 401 struct pgrp *pgrp; 402 { 403 404 sx_assert(&proctree_lock, SX_XLOCKED); 405 PROC_LOCK_ASSERT(p, MA_NOTOWNED); 406 PGRP_LOCK_ASSERT(pgrp, MA_NOTOWNED); 407 PGRP_LOCK_ASSERT(p->p_pgrp, MA_NOTOWNED); 408 SESS_LOCK_ASSERT(p->p_session, MA_NOTOWNED); 409 KASSERT(pgrp->pg_session == p->p_session, 410 ("%s: pgrp's session %p, p->p_session %p.\n", 411 __func__, 412 pgrp->pg_session, 413 p->p_session)); 414 KASSERT(pgrp != p->p_pgrp, 415 ("%s: p belongs to pgrp.", __func__)); 416 417 doenterpgrp(p, pgrp); 418 419 return (0); 420 } 421 422 /* 423 * Move p to a process group 424 */ 425 static void 426 doenterpgrp(p, pgrp) 427 struct proc *p; 428 struct pgrp *pgrp; 429 { 430 struct pgrp *savepgrp; 431 432 sx_assert(&proctree_lock, SX_XLOCKED); 433 PROC_LOCK_ASSERT(p, MA_NOTOWNED); 434 PGRP_LOCK_ASSERT(pgrp, MA_NOTOWNED); 435 PGRP_LOCK_ASSERT(p->p_pgrp, MA_NOTOWNED); 436 SESS_LOCK_ASSERT(p->p_session, MA_NOTOWNED); 437 438 savepgrp = p->p_pgrp; 439 440 /* 441 * Adjust eligibility of affected pgrps to participate in job control. 442 * Increment eligibility counts before decrementing, otherwise we 443 * could reach 0 spuriously during the first call. 444 */ 445 fixjobc(p, pgrp, 1); 446 fixjobc(p, p->p_pgrp, 0); 447 448 PGRP_LOCK(pgrp); 449 PGRP_LOCK(savepgrp); 450 PROC_LOCK(p); 451 LIST_REMOVE(p, p_pglist); 452 p->p_pgrp = pgrp; 453 PROC_UNLOCK(p); 454 LIST_INSERT_HEAD(&pgrp->pg_members, p, p_pglist); 455 PGRP_UNLOCK(savepgrp); 456 PGRP_UNLOCK(pgrp); 457 if (LIST_EMPTY(&savepgrp->pg_members)) 458 pgdelete(savepgrp); 459 } 460 461 /* 462 * remove process from process group 463 */ 464 int 465 leavepgrp(p) 466 register struct proc *p; 467 { 468 struct pgrp *savepgrp; 469 470 sx_assert(&proctree_lock, SX_XLOCKED); 471 savepgrp = p->p_pgrp; 472 PGRP_LOCK(savepgrp); 473 PROC_LOCK(p); 474 LIST_REMOVE(p, p_pglist); 475 p->p_pgrp = NULL; 476 PROC_UNLOCK(p); 477 PGRP_UNLOCK(savepgrp); 478 if (LIST_EMPTY(&savepgrp->pg_members)) 479 pgdelete(savepgrp); 480 return (0); 481 } 482 483 /* 484 * delete a process group 485 */ 486 static void 487 pgdelete(pgrp) 488 register struct pgrp *pgrp; 489 { 490 struct session *savesess; 491 struct tty *tp; 492 493 sx_assert(&proctree_lock, SX_XLOCKED); 494 PGRP_LOCK_ASSERT(pgrp, MA_NOTOWNED); 495 SESS_LOCK_ASSERT(pgrp->pg_session, MA_NOTOWNED); 496 497 /* 498 * Reset any sigio structures pointing to us as a result of 499 * F_SETOWN with our pgid. 500 */ 501 funsetownlst(&pgrp->pg_sigiolst); 502 503 PGRP_LOCK(pgrp); 504 tp = pgrp->pg_session->s_ttyp; 505 LIST_REMOVE(pgrp, pg_hash); 506 savesess = pgrp->pg_session; 507 PGRP_UNLOCK(pgrp); 508 509 /* Remove the reference to the pgrp before deallocating it. */ 510 if (tp != NULL) { 511 tty_lock(tp); 512 tty_rel_pgrp(tp, pgrp); 513 } 514 515 mtx_destroy(&pgrp->pg_mtx); 516 free(pgrp, M_PGRP); 517 sess_release(savesess); 518 } 519 520 static void 521 pgadjustjobc(pgrp, entering) 522 struct pgrp *pgrp; 523 int entering; 524 { 525 526 PGRP_LOCK(pgrp); 527 if (entering) 528 pgrp->pg_jobc++; 529 else { 530 --pgrp->pg_jobc; 531 if (pgrp->pg_jobc == 0) 532 orphanpg(pgrp); 533 } 534 PGRP_UNLOCK(pgrp); 535 } 536 537 /* 538 * Adjust pgrp jobc counters when specified process changes process group. 539 * We count the number of processes in each process group that "qualify" 540 * the group for terminal job control (those with a parent in a different 541 * process group of the same session). If that count reaches zero, the 542 * process group becomes orphaned. Check both the specified process' 543 * process group and that of its children. 544 * entering == 0 => p is leaving specified group. 545 * entering == 1 => p is entering specified group. 546 */ 547 void 548 fixjobc(p, pgrp, entering) 549 register struct proc *p; 550 register struct pgrp *pgrp; 551 int entering; 552 { 553 register struct pgrp *hispgrp; 554 register struct session *mysession; 555 556 sx_assert(&proctree_lock, SX_LOCKED); 557 PROC_LOCK_ASSERT(p, MA_NOTOWNED); 558 PGRP_LOCK_ASSERT(pgrp, MA_NOTOWNED); 559 SESS_LOCK_ASSERT(pgrp->pg_session, MA_NOTOWNED); 560 561 /* 562 * Check p's parent to see whether p qualifies its own process 563 * group; if so, adjust count for p's process group. 564 */ 565 mysession = pgrp->pg_session; 566 if ((hispgrp = p->p_pptr->p_pgrp) != pgrp && 567 hispgrp->pg_session == mysession) 568 pgadjustjobc(pgrp, entering); 569 570 /* 571 * Check this process' children to see whether they qualify 572 * their process groups; if so, adjust counts for children's 573 * process groups. 574 */ 575 LIST_FOREACH(p, &p->p_children, p_sibling) { 576 hispgrp = p->p_pgrp; 577 if (hispgrp == pgrp || 578 hispgrp->pg_session != mysession) 579 continue; 580 PROC_LOCK(p); 581 if (p->p_state == PRS_ZOMBIE) { 582 PROC_UNLOCK(p); 583 continue; 584 } 585 PROC_UNLOCK(p); 586 pgadjustjobc(hispgrp, entering); 587 } 588 } 589 590 /* 591 * A process group has become orphaned; 592 * if there are any stopped processes in the group, 593 * hang-up all process in that group. 594 */ 595 static void 596 orphanpg(pg) 597 struct pgrp *pg; 598 { 599 register struct proc *p; 600 601 PGRP_LOCK_ASSERT(pg, MA_OWNED); 602 603 LIST_FOREACH(p, &pg->pg_members, p_pglist) { 604 PROC_LOCK(p); 605 if (P_SHOULDSTOP(p)) { 606 PROC_UNLOCK(p); 607 LIST_FOREACH(p, &pg->pg_members, p_pglist) { 608 PROC_LOCK(p); 609 psignal(p, SIGHUP); 610 psignal(p, SIGCONT); 611 PROC_UNLOCK(p); 612 } 613 return; 614 } 615 PROC_UNLOCK(p); 616 } 617 } 618 619 void 620 sess_hold(struct session *s) 621 { 622 623 refcount_acquire(&s->s_count); 624 } 625 626 void 627 sess_release(struct session *s) 628 { 629 630 if (refcount_release(&s->s_count)) { 631 if (s->s_ttyp != NULL) { 632 tty_lock(s->s_ttyp); 633 tty_rel_sess(s->s_ttyp, s); 634 } 635 mtx_destroy(&s->s_mtx); 636 free(s, M_SESSION); 637 } 638 } 639 640 #include "opt_ddb.h" 641 #ifdef DDB 642 #include <ddb/ddb.h> 643 644 DB_SHOW_COMMAND(pgrpdump, pgrpdump) 645 { 646 register struct pgrp *pgrp; 647 register struct proc *p; 648 register int i; 649 650 for (i = 0; i <= pgrphash; i++) { 651 if (!LIST_EMPTY(&pgrphashtbl[i])) { 652 printf("\tindx %d\n", i); 653 LIST_FOREACH(pgrp, &pgrphashtbl[i], pg_hash) { 654 printf( 655 "\tpgrp %p, pgid %ld, sess %p, sesscnt %d, mem %p\n", 656 (void *)pgrp, (long)pgrp->pg_id, 657 (void *)pgrp->pg_session, 658 pgrp->pg_session->s_count, 659 (void *)LIST_FIRST(&pgrp->pg_members)); 660 LIST_FOREACH(p, &pgrp->pg_members, p_pglist) { 661 printf("\t\tpid %ld addr %p pgrp %p\n", 662 (long)p->p_pid, (void *)p, 663 (void *)p->p_pgrp); 664 } 665 } 666 } 667 } 668 } 669 #endif /* DDB */ 670 671 /* 672 * Clear kinfo_proc and fill in any information that is common 673 * to all threads in the process. 674 * Must be called with the target process locked. 675 */ 676 static void 677 fill_kinfo_proc_only(struct proc *p, struct kinfo_proc *kp) 678 { 679 struct thread *td0; 680 struct tty *tp; 681 struct session *sp; 682 struct ucred *cred; 683 struct sigacts *ps; 684 685 PROC_LOCK_ASSERT(p, MA_OWNED); 686 bzero(kp, sizeof(*kp)); 687 688 kp->ki_structsize = sizeof(*kp); 689 kp->ki_paddr = p; 690 kp->ki_addr =/* p->p_addr; */0; /* XXX */ 691 kp->ki_args = p->p_args; 692 kp->ki_textvp = p->p_textvp; 693 #ifdef KTRACE 694 kp->ki_tracep = p->p_tracevp; 695 mtx_lock(&ktrace_mtx); 696 kp->ki_traceflag = p->p_traceflag; 697 mtx_unlock(&ktrace_mtx); 698 #endif 699 kp->ki_fd = p->p_fd; 700 kp->ki_vmspace = p->p_vmspace; 701 kp->ki_flag = p->p_flag; 702 cred = p->p_ucred; 703 if (cred) { 704 kp->ki_uid = cred->cr_uid; 705 kp->ki_ruid = cred->cr_ruid; 706 kp->ki_svuid = cred->cr_svuid; 707 /* XXX bde doesn't like KI_NGROUPS */ 708 kp->ki_ngroups = min(cred->cr_ngroups, KI_NGROUPS); 709 bcopy(cred->cr_groups, kp->ki_groups, 710 kp->ki_ngroups * sizeof(gid_t)); 711 kp->ki_rgid = cred->cr_rgid; 712 kp->ki_svgid = cred->cr_svgid; 713 /* If jailed(cred), emulate the old P_JAILED flag. */ 714 if (jailed(cred)) { 715 kp->ki_flag |= P_JAILED; 716 /* If inside a jail, use 0 as a jail ID. */ 717 if (!jailed(curthread->td_ucred)) 718 kp->ki_jid = cred->cr_prison->pr_id; 719 } 720 } 721 ps = p->p_sigacts; 722 if (ps) { 723 mtx_lock(&ps->ps_mtx); 724 kp->ki_sigignore = ps->ps_sigignore; 725 kp->ki_sigcatch = ps->ps_sigcatch; 726 mtx_unlock(&ps->ps_mtx); 727 } 728 PROC_SLOCK(p); 729 if (p->p_state != PRS_NEW && 730 p->p_state != PRS_ZOMBIE && 731 p->p_vmspace != NULL) { 732 struct vmspace *vm = p->p_vmspace; 733 734 kp->ki_size = vm->vm_map.size; 735 kp->ki_rssize = vmspace_resident_count(vm); /*XXX*/ 736 FOREACH_THREAD_IN_PROC(p, td0) { 737 if (!TD_IS_SWAPPED(td0)) 738 kp->ki_rssize += td0->td_kstack_pages; 739 if (td0->td_altkstack_obj != NULL) 740 kp->ki_rssize += td0->td_altkstack_pages; 741 } 742 kp->ki_swrss = vm->vm_swrss; 743 kp->ki_tsize = vm->vm_tsize; 744 kp->ki_dsize = vm->vm_dsize; 745 kp->ki_ssize = vm->vm_ssize; 746 } else if (p->p_state == PRS_ZOMBIE) 747 kp->ki_stat = SZOMB; 748 if (kp->ki_flag & P_INMEM) 749 kp->ki_sflag = PS_INMEM; 750 else 751 kp->ki_sflag = 0; 752 /* Calculate legacy swtime as seconds since 'swtick'. */ 753 kp->ki_swtime = (ticks - p->p_swtick) / hz; 754 kp->ki_pid = p->p_pid; 755 kp->ki_nice = p->p_nice; 756 rufetch(p, &kp->ki_rusage); 757 kp->ki_runtime = cputick2usec(p->p_rux.rux_runtime); 758 PROC_SUNLOCK(p); 759 if ((p->p_flag & P_INMEM) && p->p_stats != NULL) { 760 kp->ki_start = p->p_stats->p_start; 761 timevaladd(&kp->ki_start, &boottime); 762 PROC_SLOCK(p); 763 calcru(p, &kp->ki_rusage.ru_utime, &kp->ki_rusage.ru_stime); 764 PROC_SUNLOCK(p); 765 calccru(p, &kp->ki_childutime, &kp->ki_childstime); 766 767 /* Some callers want child-times in a single value */ 768 kp->ki_childtime = kp->ki_childstime; 769 timevaladd(&kp->ki_childtime, &kp->ki_childutime); 770 } 771 tp = NULL; 772 if (p->p_pgrp) { 773 kp->ki_pgid = p->p_pgrp->pg_id; 774 kp->ki_jobc = p->p_pgrp->pg_jobc; 775 sp = p->p_pgrp->pg_session; 776 777 if (sp != NULL) { 778 kp->ki_sid = sp->s_sid; 779 SESS_LOCK(sp); 780 strlcpy(kp->ki_login, sp->s_login, 781 sizeof(kp->ki_login)); 782 if (sp->s_ttyvp) 783 kp->ki_kiflag |= KI_CTTY; 784 if (SESS_LEADER(p)) 785 kp->ki_kiflag |= KI_SLEADER; 786 /* XXX proctree_lock */ 787 tp = sp->s_ttyp; 788 SESS_UNLOCK(sp); 789 } 790 } 791 if ((p->p_flag & P_CONTROLT) && tp != NULL) { 792 kp->ki_tdev = tty_udev(tp); 793 kp->ki_tpgid = tp->t_pgrp ? tp->t_pgrp->pg_id : NO_PID; 794 if (tp->t_session) 795 kp->ki_tsid = tp->t_session->s_sid; 796 } else 797 kp->ki_tdev = NODEV; 798 if (p->p_comm[0] != '\0') 799 strlcpy(kp->ki_comm, p->p_comm, sizeof(kp->ki_comm)); 800 if (p->p_sysent && p->p_sysent->sv_name != NULL && 801 p->p_sysent->sv_name[0] != '\0') 802 strlcpy(kp->ki_emul, p->p_sysent->sv_name, sizeof(kp->ki_emul)); 803 kp->ki_siglist = p->p_siglist; 804 kp->ki_xstat = p->p_xstat; 805 kp->ki_acflag = p->p_acflag; 806 kp->ki_lock = p->p_lock; 807 if (p->p_pptr) 808 kp->ki_ppid = p->p_pptr->p_pid; 809 } 810 811 /* 812 * Fill in information that is thread specific. Must be called with p_slock 813 * locked. If 'preferthread' is set, overwrite certain process-related 814 * fields that are maintained for both threads and processes. 815 */ 816 static void 817 fill_kinfo_thread(struct thread *td, struct kinfo_proc *kp, int preferthread) 818 { 819 struct proc *p; 820 821 p = td->td_proc; 822 PROC_LOCK_ASSERT(p, MA_OWNED); 823 824 thread_lock(td); 825 if (td->td_wmesg != NULL) 826 strlcpy(kp->ki_wmesg, td->td_wmesg, sizeof(kp->ki_wmesg)); 827 else 828 bzero(kp->ki_wmesg, sizeof(kp->ki_wmesg)); 829 if (td->td_name[0] != '\0') 830 strlcpy(kp->ki_ocomm, td->td_name, sizeof(kp->ki_ocomm)); 831 if (TD_ON_LOCK(td)) { 832 kp->ki_kiflag |= KI_LOCKBLOCK; 833 strlcpy(kp->ki_lockname, td->td_lockname, 834 sizeof(kp->ki_lockname)); 835 } else { 836 kp->ki_kiflag &= ~KI_LOCKBLOCK; 837 bzero(kp->ki_lockname, sizeof(kp->ki_lockname)); 838 } 839 840 if (p->p_state == PRS_NORMAL) { /* approximate. */ 841 if (TD_ON_RUNQ(td) || 842 TD_CAN_RUN(td) || 843 TD_IS_RUNNING(td)) { 844 kp->ki_stat = SRUN; 845 } else if (P_SHOULDSTOP(p)) { 846 kp->ki_stat = SSTOP; 847 } else if (TD_IS_SLEEPING(td)) { 848 kp->ki_stat = SSLEEP; 849 } else if (TD_ON_LOCK(td)) { 850 kp->ki_stat = SLOCK; 851 } else { 852 kp->ki_stat = SWAIT; 853 } 854 } else if (p->p_state == PRS_ZOMBIE) { 855 kp->ki_stat = SZOMB; 856 } else { 857 kp->ki_stat = SIDL; 858 } 859 860 /* Things in the thread */ 861 kp->ki_wchan = td->td_wchan; 862 kp->ki_pri.pri_level = td->td_priority; 863 kp->ki_pri.pri_native = td->td_base_pri; 864 kp->ki_lastcpu = td->td_lastcpu; 865 kp->ki_oncpu = td->td_oncpu; 866 kp->ki_tdflags = td->td_flags; 867 kp->ki_tid = td->td_tid; 868 kp->ki_numthreads = p->p_numthreads; 869 kp->ki_pcb = td->td_pcb; 870 kp->ki_kstack = (void *)td->td_kstack; 871 kp->ki_pctcpu = sched_pctcpu(td); 872 kp->ki_estcpu = td->td_estcpu; 873 kp->ki_slptime = (ticks - td->td_slptick) / hz; 874 kp->ki_pri.pri_class = td->td_pri_class; 875 kp->ki_pri.pri_user = td->td_user_pri; 876 877 if (preferthread) 878 kp->ki_runtime = cputick2usec(td->td_runtime); 879 880 /* We can't get this anymore but ps etc never used it anyway. */ 881 kp->ki_rqindex = 0; 882 883 SIGSETOR(kp->ki_siglist, td->td_siglist); 884 kp->ki_sigmask = td->td_sigmask; 885 thread_unlock(td); 886 } 887 888 /* 889 * Fill in a kinfo_proc structure for the specified process. 890 * Must be called with the target process locked. 891 */ 892 void 893 fill_kinfo_proc(struct proc *p, struct kinfo_proc *kp) 894 { 895 896 fill_kinfo_proc_only(p, kp); 897 if (FIRST_THREAD_IN_PROC(p) != NULL) 898 fill_kinfo_thread(FIRST_THREAD_IN_PROC(p), kp, 0); 899 } 900 901 struct pstats * 902 pstats_alloc(void) 903 { 904 905 return (malloc(sizeof(struct pstats), M_SUBPROC, M_ZERO|M_WAITOK)); 906 } 907 908 /* 909 * Copy parts of p_stats; zero the rest of p_stats (statistics). 910 */ 911 void 912 pstats_fork(struct pstats *src, struct pstats *dst) 913 { 914 915 bzero(&dst->pstat_startzero, 916 __rangeof(struct pstats, pstat_startzero, pstat_endzero)); 917 bcopy(&src->pstat_startcopy, &dst->pstat_startcopy, 918 __rangeof(struct pstats, pstat_startcopy, pstat_endcopy)); 919 } 920 921 void 922 pstats_free(struct pstats *ps) 923 { 924 925 free(ps, M_SUBPROC); 926 } 927 928 /* 929 * Locate a zombie process by number 930 */ 931 struct proc * 932 zpfind(pid_t pid) 933 { 934 struct proc *p; 935 936 sx_slock(&allproc_lock); 937 LIST_FOREACH(p, &zombproc, p_list) 938 if (p->p_pid == pid) { 939 PROC_LOCK(p); 940 break; 941 } 942 sx_sunlock(&allproc_lock); 943 return (p); 944 } 945 946 #define KERN_PROC_ZOMBMASK 0x3 947 #define KERN_PROC_NOTHREADS 0x4 948 949 /* 950 * Must be called with the process locked and will return with it unlocked. 951 */ 952 static int 953 sysctl_out_proc(struct proc *p, struct sysctl_req *req, int flags) 954 { 955 struct thread *td; 956 struct kinfo_proc kinfo_proc; 957 int error = 0; 958 struct proc *np; 959 pid_t pid = p->p_pid; 960 961 PROC_LOCK_ASSERT(p, MA_OWNED); 962 963 fill_kinfo_proc_only(p, &kinfo_proc); 964 if (flags & KERN_PROC_NOTHREADS) { 965 if (FIRST_THREAD_IN_PROC(p) != NULL) 966 fill_kinfo_thread(FIRST_THREAD_IN_PROC(p), 967 &kinfo_proc, 0); 968 error = SYSCTL_OUT(req, (caddr_t)&kinfo_proc, 969 sizeof(kinfo_proc)); 970 } else { 971 if (FIRST_THREAD_IN_PROC(p) != NULL) 972 FOREACH_THREAD_IN_PROC(p, td) { 973 fill_kinfo_thread(td, &kinfo_proc, 1); 974 error = SYSCTL_OUT(req, (caddr_t)&kinfo_proc, 975 sizeof(kinfo_proc)); 976 if (error) 977 break; 978 } 979 else 980 error = SYSCTL_OUT(req, (caddr_t)&kinfo_proc, 981 sizeof(kinfo_proc)); 982 } 983 PROC_UNLOCK(p); 984 if (error) 985 return (error); 986 if (flags & KERN_PROC_ZOMBMASK) 987 np = zpfind(pid); 988 else { 989 if (pid == 0) 990 return (0); 991 np = pfind(pid); 992 } 993 if (np == NULL) 994 return (ESRCH); 995 if (np != p) { 996 PROC_UNLOCK(np); 997 return (ESRCH); 998 } 999 PROC_UNLOCK(np); 1000 return (0); 1001 } 1002 1003 static int 1004 sysctl_kern_proc(SYSCTL_HANDLER_ARGS) 1005 { 1006 int *name = (int*) arg1; 1007 u_int namelen = arg2; 1008 struct proc *p; 1009 int flags, doingzomb, oid_number; 1010 int error = 0; 1011 1012 oid_number = oidp->oid_number; 1013 if (oid_number != KERN_PROC_ALL && 1014 (oid_number & KERN_PROC_INC_THREAD) == 0) 1015 flags = KERN_PROC_NOTHREADS; 1016 else { 1017 flags = 0; 1018 oid_number &= ~KERN_PROC_INC_THREAD; 1019 } 1020 if (oid_number == KERN_PROC_PID) { 1021 if (namelen != 1) 1022 return (EINVAL); 1023 error = sysctl_wire_old_buffer(req, 0); 1024 if (error) 1025 return (error); 1026 p = pfind((pid_t)name[0]); 1027 if (!p) 1028 return (ESRCH); 1029 if ((error = p_cansee(curthread, p))) { 1030 PROC_UNLOCK(p); 1031 return (error); 1032 } 1033 error = sysctl_out_proc(p, req, flags); 1034 return (error); 1035 } 1036 1037 switch (oid_number) { 1038 case KERN_PROC_ALL: 1039 if (namelen != 0) 1040 return (EINVAL); 1041 break; 1042 case KERN_PROC_PROC: 1043 if (namelen != 0 && namelen != 1) 1044 return (EINVAL); 1045 break; 1046 default: 1047 if (namelen != 1) 1048 return (EINVAL); 1049 break; 1050 } 1051 1052 if (!req->oldptr) { 1053 /* overestimate by 5 procs */ 1054 error = SYSCTL_OUT(req, 0, sizeof (struct kinfo_proc) * 5); 1055 if (error) 1056 return (error); 1057 } 1058 error = sysctl_wire_old_buffer(req, 0); 1059 if (error != 0) 1060 return (error); 1061 sx_slock(&allproc_lock); 1062 for (doingzomb=0 ; doingzomb < 2 ; doingzomb++) { 1063 if (!doingzomb) 1064 p = LIST_FIRST(&allproc); 1065 else 1066 p = LIST_FIRST(&zombproc); 1067 for (; p != 0; p = LIST_NEXT(p, p_list)) { 1068 /* 1069 * Skip embryonic processes. 1070 */ 1071 PROC_SLOCK(p); 1072 if (p->p_state == PRS_NEW) { 1073 PROC_SUNLOCK(p); 1074 continue; 1075 } 1076 PROC_SUNLOCK(p); 1077 PROC_LOCK(p); 1078 KASSERT(p->p_ucred != NULL, 1079 ("process credential is NULL for non-NEW proc")); 1080 /* 1081 * Show a user only appropriate processes. 1082 */ 1083 if (p_cansee(curthread, p)) { 1084 PROC_UNLOCK(p); 1085 continue; 1086 } 1087 /* 1088 * TODO - make more efficient (see notes below). 1089 * do by session. 1090 */ 1091 switch (oid_number) { 1092 1093 case KERN_PROC_GID: 1094 if (p->p_ucred->cr_gid != (gid_t)name[0]) { 1095 PROC_UNLOCK(p); 1096 continue; 1097 } 1098 break; 1099 1100 case KERN_PROC_PGRP: 1101 /* could do this by traversing pgrp */ 1102 if (p->p_pgrp == NULL || 1103 p->p_pgrp->pg_id != (pid_t)name[0]) { 1104 PROC_UNLOCK(p); 1105 continue; 1106 } 1107 break; 1108 1109 case KERN_PROC_RGID: 1110 if (p->p_ucred->cr_rgid != (gid_t)name[0]) { 1111 PROC_UNLOCK(p); 1112 continue; 1113 } 1114 break; 1115 1116 case KERN_PROC_SESSION: 1117 if (p->p_session == NULL || 1118 p->p_session->s_sid != (pid_t)name[0]) { 1119 PROC_UNLOCK(p); 1120 continue; 1121 } 1122 break; 1123 1124 case KERN_PROC_TTY: 1125 if ((p->p_flag & P_CONTROLT) == 0 || 1126 p->p_session == NULL) { 1127 PROC_UNLOCK(p); 1128 continue; 1129 } 1130 /* XXX proctree_lock */ 1131 SESS_LOCK(p->p_session); 1132 if (p->p_session->s_ttyp == NULL || 1133 tty_udev(p->p_session->s_ttyp) != 1134 (dev_t)name[0]) { 1135 SESS_UNLOCK(p->p_session); 1136 PROC_UNLOCK(p); 1137 continue; 1138 } 1139 SESS_UNLOCK(p->p_session); 1140 break; 1141 1142 case KERN_PROC_UID: 1143 if (p->p_ucred->cr_uid != (uid_t)name[0]) { 1144 PROC_UNLOCK(p); 1145 continue; 1146 } 1147 break; 1148 1149 case KERN_PROC_RUID: 1150 if (p->p_ucred->cr_ruid != (uid_t)name[0]) { 1151 PROC_UNLOCK(p); 1152 continue; 1153 } 1154 break; 1155 1156 case KERN_PROC_PROC: 1157 break; 1158 1159 default: 1160 break; 1161 1162 } 1163 1164 error = sysctl_out_proc(p, req, flags | doingzomb); 1165 if (error) { 1166 sx_sunlock(&allproc_lock); 1167 return (error); 1168 } 1169 } 1170 } 1171 sx_sunlock(&allproc_lock); 1172 return (0); 1173 } 1174 1175 struct pargs * 1176 pargs_alloc(int len) 1177 { 1178 struct pargs *pa; 1179 1180 pa = malloc(sizeof(struct pargs) + len, M_PARGS, 1181 M_WAITOK); 1182 refcount_init(&pa->ar_ref, 1); 1183 pa->ar_length = len; 1184 return (pa); 1185 } 1186 1187 static void 1188 pargs_free(struct pargs *pa) 1189 { 1190 1191 free(pa, M_PARGS); 1192 } 1193 1194 void 1195 pargs_hold(struct pargs *pa) 1196 { 1197 1198 if (pa == NULL) 1199 return; 1200 refcount_acquire(&pa->ar_ref); 1201 } 1202 1203 void 1204 pargs_drop(struct pargs *pa) 1205 { 1206 1207 if (pa == NULL) 1208 return; 1209 if (refcount_release(&pa->ar_ref)) 1210 pargs_free(pa); 1211 } 1212 1213 /* 1214 * This sysctl allows a process to retrieve the argument list or process 1215 * title for another process without groping around in the address space 1216 * of the other process. It also allow a process to set its own "process 1217 * title to a string of its own choice. 1218 */ 1219 static int 1220 sysctl_kern_proc_args(SYSCTL_HANDLER_ARGS) 1221 { 1222 int *name = (int*) arg1; 1223 u_int namelen = arg2; 1224 struct pargs *newpa, *pa; 1225 struct proc *p; 1226 int error = 0; 1227 1228 if (namelen != 1) 1229 return (EINVAL); 1230 1231 p = pfind((pid_t)name[0]); 1232 if (!p) 1233 return (ESRCH); 1234 1235 if ((error = p_cansee(curthread, p)) != 0) { 1236 PROC_UNLOCK(p); 1237 return (error); 1238 } 1239 1240 if (req->newptr && curproc != p) { 1241 PROC_UNLOCK(p); 1242 return (EPERM); 1243 } 1244 1245 pa = p->p_args; 1246 pargs_hold(pa); 1247 PROC_UNLOCK(p); 1248 if (req->oldptr != NULL && pa != NULL) 1249 error = SYSCTL_OUT(req, pa->ar_args, pa->ar_length); 1250 pargs_drop(pa); 1251 if (error != 0 || req->newptr == NULL) 1252 return (error); 1253 1254 if (req->newlen + sizeof(struct pargs) > ps_arg_cache_limit) 1255 return (ENOMEM); 1256 newpa = pargs_alloc(req->newlen); 1257 error = SYSCTL_IN(req, newpa->ar_args, req->newlen); 1258 if (error != 0) { 1259 pargs_free(newpa); 1260 return (error); 1261 } 1262 PROC_LOCK(p); 1263 pa = p->p_args; 1264 p->p_args = newpa; 1265 PROC_UNLOCK(p); 1266 pargs_drop(pa); 1267 return (0); 1268 } 1269 1270 /* 1271 * This sysctl allows a process to retrieve the path of the executable for 1272 * itself or another process. 1273 */ 1274 static int 1275 sysctl_kern_proc_pathname(SYSCTL_HANDLER_ARGS) 1276 { 1277 pid_t *pidp = (pid_t *)arg1; 1278 unsigned int arglen = arg2; 1279 struct proc *p; 1280 struct vnode *vp; 1281 char *retbuf, *freebuf; 1282 int error; 1283 1284 if (arglen != 1) 1285 return (EINVAL); 1286 if (*pidp == -1) { /* -1 means this process */ 1287 p = req->td->td_proc; 1288 } else { 1289 p = pfind(*pidp); 1290 if (p == NULL) 1291 return (ESRCH); 1292 if ((error = p_cansee(curthread, p)) != 0) { 1293 PROC_UNLOCK(p); 1294 return (error); 1295 } 1296 } 1297 1298 vp = p->p_textvp; 1299 if (vp == NULL) { 1300 if (*pidp != -1) 1301 PROC_UNLOCK(p); 1302 return (0); 1303 } 1304 vref(vp); 1305 if (*pidp != -1) 1306 PROC_UNLOCK(p); 1307 error = vn_fullpath(req->td, vp, &retbuf, &freebuf); 1308 vrele(vp); 1309 if (error) 1310 return (error); 1311 error = SYSCTL_OUT(req, retbuf, strlen(retbuf) + 1); 1312 free(freebuf, M_TEMP); 1313 return (error); 1314 } 1315 1316 static int 1317 sysctl_kern_proc_sv_name(SYSCTL_HANDLER_ARGS) 1318 { 1319 struct proc *p; 1320 char *sv_name; 1321 int *name; 1322 int namelen; 1323 int error; 1324 1325 namelen = arg2; 1326 if (namelen != 1) 1327 return (EINVAL); 1328 1329 name = (int *)arg1; 1330 if ((p = pfind((pid_t)name[0])) == NULL) 1331 return (ESRCH); 1332 if ((error = p_cansee(curthread, p))) { 1333 PROC_UNLOCK(p); 1334 return (error); 1335 } 1336 sv_name = p->p_sysent->sv_name; 1337 PROC_UNLOCK(p); 1338 return (sysctl_handle_string(oidp, sv_name, 0, req)); 1339 } 1340 1341 #ifdef KINFO_OVMENTRY_SIZE 1342 CTASSERT(sizeof(struct kinfo_ovmentry) == KINFO_OVMENTRY_SIZE); 1343 #endif 1344 1345 #ifdef COMPAT_FREEBSD7 1346 static int 1347 sysctl_kern_proc_ovmmap(SYSCTL_HANDLER_ARGS) 1348 { 1349 vm_map_entry_t entry, tmp_entry; 1350 unsigned int last_timestamp; 1351 char *fullpath, *freepath; 1352 struct kinfo_ovmentry *kve; 1353 struct vattr va; 1354 struct ucred *cred; 1355 int error, *name; 1356 struct vnode *vp; 1357 struct proc *p; 1358 vm_map_t map; 1359 1360 name = (int *)arg1; 1361 if ((p = pfind((pid_t)name[0])) == NULL) 1362 return (ESRCH); 1363 if (p->p_flag & P_WEXIT) { 1364 PROC_UNLOCK(p); 1365 return (ESRCH); 1366 } 1367 if ((error = p_candebug(curthread, p))) { 1368 PROC_UNLOCK(p); 1369 return (error); 1370 } 1371 _PHOLD(p); 1372 PROC_UNLOCK(p); 1373 1374 kve = malloc(sizeof(*kve), M_TEMP, M_WAITOK); 1375 1376 map = &p->p_vmspace->vm_map; /* XXXRW: More locking required? */ 1377 vm_map_lock_read(map); 1378 for (entry = map->header.next; entry != &map->header; 1379 entry = entry->next) { 1380 vm_object_t obj, tobj, lobj; 1381 vm_offset_t addr; 1382 int vfslocked; 1383 1384 if (entry->eflags & MAP_ENTRY_IS_SUB_MAP) 1385 continue; 1386 1387 bzero(kve, sizeof(*kve)); 1388 kve->kve_structsize = sizeof(*kve); 1389 1390 kve->kve_private_resident = 0; 1391 obj = entry->object.vm_object; 1392 if (obj != NULL) { 1393 VM_OBJECT_LOCK(obj); 1394 if (obj->shadow_count == 1) 1395 kve->kve_private_resident = 1396 obj->resident_page_count; 1397 } 1398 kve->kve_resident = 0; 1399 addr = entry->start; 1400 while (addr < entry->end) { 1401 if (pmap_extract(map->pmap, addr)) 1402 kve->kve_resident++; 1403 addr += PAGE_SIZE; 1404 } 1405 1406 for (lobj = tobj = obj; tobj; tobj = tobj->backing_object) { 1407 if (tobj != obj) 1408 VM_OBJECT_LOCK(tobj); 1409 if (lobj != obj) 1410 VM_OBJECT_UNLOCK(lobj); 1411 lobj = tobj; 1412 } 1413 1414 kve->kve_fileid = 0; 1415 kve->kve_fsid = 0; 1416 freepath = NULL; 1417 fullpath = ""; 1418 if (lobj) { 1419 vp = NULL; 1420 switch(lobj->type) { 1421 case OBJT_DEFAULT: 1422 kve->kve_type = KVME_TYPE_DEFAULT; 1423 break; 1424 case OBJT_VNODE: 1425 kve->kve_type = KVME_TYPE_VNODE; 1426 vp = lobj->handle; 1427 vref(vp); 1428 break; 1429 case OBJT_SWAP: 1430 kve->kve_type = KVME_TYPE_SWAP; 1431 break; 1432 case OBJT_DEVICE: 1433 kve->kve_type = KVME_TYPE_DEVICE; 1434 break; 1435 case OBJT_PHYS: 1436 kve->kve_type = KVME_TYPE_PHYS; 1437 break; 1438 case OBJT_DEAD: 1439 kve->kve_type = KVME_TYPE_DEAD; 1440 break; 1441 default: 1442 kve->kve_type = KVME_TYPE_UNKNOWN; 1443 break; 1444 } 1445 if (lobj != obj) 1446 VM_OBJECT_UNLOCK(lobj); 1447 1448 kve->kve_ref_count = obj->ref_count; 1449 kve->kve_shadow_count = obj->shadow_count; 1450 VM_OBJECT_UNLOCK(obj); 1451 if (vp != NULL) { 1452 vn_fullpath(curthread, vp, &fullpath, 1453 &freepath); 1454 cred = curthread->td_ucred; 1455 vfslocked = VFS_LOCK_GIANT(vp->v_mount); 1456 vn_lock(vp, LK_SHARED | LK_RETRY); 1457 if (VOP_GETATTR(vp, &va, cred) == 0) { 1458 kve->kve_fileid = va.va_fileid; 1459 kve->kve_fsid = va.va_fsid; 1460 } 1461 vput(vp); 1462 VFS_UNLOCK_GIANT(vfslocked); 1463 } 1464 } else { 1465 kve->kve_type = KVME_TYPE_NONE; 1466 kve->kve_ref_count = 0; 1467 kve->kve_shadow_count = 0; 1468 } 1469 1470 kve->kve_start = (void*)entry->start; 1471 kve->kve_end = (void*)entry->end; 1472 kve->kve_offset = (off_t)entry->offset; 1473 1474 if (entry->protection & VM_PROT_READ) 1475 kve->kve_protection |= KVME_PROT_READ; 1476 if (entry->protection & VM_PROT_WRITE) 1477 kve->kve_protection |= KVME_PROT_WRITE; 1478 if (entry->protection & VM_PROT_EXECUTE) 1479 kve->kve_protection |= KVME_PROT_EXEC; 1480 1481 if (entry->eflags & MAP_ENTRY_COW) 1482 kve->kve_flags |= KVME_FLAG_COW; 1483 if (entry->eflags & MAP_ENTRY_NEEDS_COPY) 1484 kve->kve_flags |= KVME_FLAG_NEEDS_COPY; 1485 1486 strlcpy(kve->kve_path, fullpath, sizeof(kve->kve_path)); 1487 if (freepath != NULL) 1488 free(freepath, M_TEMP); 1489 1490 last_timestamp = map->timestamp; 1491 vm_map_unlock_read(map); 1492 error = SYSCTL_OUT(req, kve, sizeof(*kve)); 1493 vm_map_lock_read(map); 1494 if (error) 1495 break; 1496 if (last_timestamp + 1 != map->timestamp) { 1497 vm_map_lookup_entry(map, addr - 1, &tmp_entry); 1498 entry = tmp_entry; 1499 } 1500 } 1501 vm_map_unlock_read(map); 1502 PRELE(p); 1503 free(kve, M_TEMP); 1504 return (error); 1505 } 1506 #endif /* COMPAT_FREEBSD7 */ 1507 1508 #ifdef KINFO_VMENTRY_SIZE 1509 CTASSERT(sizeof(struct kinfo_vmentry) == KINFO_VMENTRY_SIZE); 1510 #endif 1511 1512 static int 1513 sysctl_kern_proc_vmmap(SYSCTL_HANDLER_ARGS) 1514 { 1515 vm_map_entry_t entry, tmp_entry; 1516 unsigned int last_timestamp; 1517 char *fullpath, *freepath; 1518 struct kinfo_vmentry *kve; 1519 struct vattr va; 1520 struct ucred *cred; 1521 int error, *name; 1522 struct vnode *vp; 1523 struct proc *p; 1524 vm_map_t map; 1525 1526 name = (int *)arg1; 1527 if ((p = pfind((pid_t)name[0])) == NULL) 1528 return (ESRCH); 1529 if (p->p_flag & P_WEXIT) { 1530 PROC_UNLOCK(p); 1531 return (ESRCH); 1532 } 1533 if ((error = p_candebug(curthread, p))) { 1534 PROC_UNLOCK(p); 1535 return (error); 1536 } 1537 _PHOLD(p); 1538 PROC_UNLOCK(p); 1539 1540 kve = malloc(sizeof(*kve), M_TEMP, M_WAITOK); 1541 1542 map = &p->p_vmspace->vm_map; /* XXXRW: More locking required? */ 1543 vm_map_lock_read(map); 1544 for (entry = map->header.next; entry != &map->header; 1545 entry = entry->next) { 1546 vm_object_t obj, tobj, lobj; 1547 vm_offset_t addr; 1548 int vfslocked; 1549 1550 if (entry->eflags & MAP_ENTRY_IS_SUB_MAP) 1551 continue; 1552 1553 bzero(kve, sizeof(*kve)); 1554 1555 kve->kve_private_resident = 0; 1556 obj = entry->object.vm_object; 1557 if (obj != NULL) { 1558 VM_OBJECT_LOCK(obj); 1559 if (obj->shadow_count == 1) 1560 kve->kve_private_resident = 1561 obj->resident_page_count; 1562 } 1563 kve->kve_resident = 0; 1564 addr = entry->start; 1565 while (addr < entry->end) { 1566 if (pmap_extract(map->pmap, addr)) 1567 kve->kve_resident++; 1568 addr += PAGE_SIZE; 1569 } 1570 1571 for (lobj = tobj = obj; tobj; tobj = tobj->backing_object) { 1572 if (tobj != obj) 1573 VM_OBJECT_LOCK(tobj); 1574 if (lobj != obj) 1575 VM_OBJECT_UNLOCK(lobj); 1576 lobj = tobj; 1577 } 1578 1579 kve->kve_fileid = 0; 1580 kve->kve_fsid = 0; 1581 freepath = NULL; 1582 fullpath = ""; 1583 if (lobj) { 1584 vp = NULL; 1585 switch(lobj->type) { 1586 case OBJT_DEFAULT: 1587 kve->kve_type = KVME_TYPE_DEFAULT; 1588 break; 1589 case OBJT_VNODE: 1590 kve->kve_type = KVME_TYPE_VNODE; 1591 vp = lobj->handle; 1592 vref(vp); 1593 break; 1594 case OBJT_SWAP: 1595 kve->kve_type = KVME_TYPE_SWAP; 1596 break; 1597 case OBJT_DEVICE: 1598 kve->kve_type = KVME_TYPE_DEVICE; 1599 break; 1600 case OBJT_PHYS: 1601 kve->kve_type = KVME_TYPE_PHYS; 1602 break; 1603 case OBJT_DEAD: 1604 kve->kve_type = KVME_TYPE_DEAD; 1605 break; 1606 default: 1607 kve->kve_type = KVME_TYPE_UNKNOWN; 1608 break; 1609 } 1610 if (lobj != obj) 1611 VM_OBJECT_UNLOCK(lobj); 1612 1613 kve->kve_ref_count = obj->ref_count; 1614 kve->kve_shadow_count = obj->shadow_count; 1615 VM_OBJECT_UNLOCK(obj); 1616 if (vp != NULL) { 1617 vn_fullpath(curthread, vp, &fullpath, 1618 &freepath); 1619 cred = curthread->td_ucred; 1620 vfslocked = VFS_LOCK_GIANT(vp->v_mount); 1621 vn_lock(vp, LK_SHARED | LK_RETRY); 1622 if (VOP_GETATTR(vp, &va, cred) == 0) { 1623 kve->kve_fileid = va.va_fileid; 1624 kve->kve_fsid = va.va_fsid; 1625 } 1626 vput(vp); 1627 VFS_UNLOCK_GIANT(vfslocked); 1628 } 1629 } else { 1630 kve->kve_type = KVME_TYPE_NONE; 1631 kve->kve_ref_count = 0; 1632 kve->kve_shadow_count = 0; 1633 } 1634 1635 kve->kve_start = entry->start; 1636 kve->kve_end = entry->end; 1637 kve->kve_offset = entry->offset; 1638 1639 if (entry->protection & VM_PROT_READ) 1640 kve->kve_protection |= KVME_PROT_READ; 1641 if (entry->protection & VM_PROT_WRITE) 1642 kve->kve_protection |= KVME_PROT_WRITE; 1643 if (entry->protection & VM_PROT_EXECUTE) 1644 kve->kve_protection |= KVME_PROT_EXEC; 1645 1646 if (entry->eflags & MAP_ENTRY_COW) 1647 kve->kve_flags |= KVME_FLAG_COW; 1648 if (entry->eflags & MAP_ENTRY_NEEDS_COPY) 1649 kve->kve_flags |= KVME_FLAG_NEEDS_COPY; 1650 1651 strlcpy(kve->kve_path, fullpath, sizeof(kve->kve_path)); 1652 if (freepath != NULL) 1653 free(freepath, M_TEMP); 1654 1655 last_timestamp = map->timestamp; 1656 vm_map_unlock_read(map); 1657 /* Pack record size down */ 1658 kve->kve_structsize = offsetof(struct kinfo_vmentry, kve_path) + 1659 strlen(kve->kve_path) + 1; 1660 kve->kve_structsize = roundup(kve->kve_structsize, 1661 sizeof(uint64_t)); 1662 error = SYSCTL_OUT(req, kve, kve->kve_structsize); 1663 vm_map_lock_read(map); 1664 if (error) 1665 break; 1666 if (last_timestamp + 1 != map->timestamp) { 1667 vm_map_lookup_entry(map, addr - 1, &tmp_entry); 1668 entry = tmp_entry; 1669 } 1670 } 1671 vm_map_unlock_read(map); 1672 PRELE(p); 1673 free(kve, M_TEMP); 1674 return (error); 1675 } 1676 1677 #if defined(STACK) || defined(DDB) 1678 static int 1679 sysctl_kern_proc_kstack(SYSCTL_HANDLER_ARGS) 1680 { 1681 struct kinfo_kstack *kkstp; 1682 int error, i, *name, numthreads; 1683 lwpid_t *lwpidarray; 1684 struct thread *td; 1685 struct stack *st; 1686 struct sbuf sb; 1687 struct proc *p; 1688 1689 name = (int *)arg1; 1690 if ((p = pfind((pid_t)name[0])) == NULL) 1691 return (ESRCH); 1692 /* XXXRW: Not clear ESRCH is the right error during proc execve(). */ 1693 if (p->p_flag & P_WEXIT || p->p_flag & P_INEXEC) { 1694 PROC_UNLOCK(p); 1695 return (ESRCH); 1696 } 1697 if ((error = p_candebug(curthread, p))) { 1698 PROC_UNLOCK(p); 1699 return (error); 1700 } 1701 _PHOLD(p); 1702 PROC_UNLOCK(p); 1703 1704 kkstp = malloc(sizeof(*kkstp), M_TEMP, M_WAITOK); 1705 st = stack_create(); 1706 1707 lwpidarray = NULL; 1708 numthreads = 0; 1709 PROC_LOCK(p); 1710 repeat: 1711 if (numthreads < p->p_numthreads) { 1712 if (lwpidarray != NULL) { 1713 free(lwpidarray, M_TEMP); 1714 lwpidarray = NULL; 1715 } 1716 numthreads = p->p_numthreads; 1717 PROC_UNLOCK(p); 1718 lwpidarray = malloc(sizeof(*lwpidarray) * numthreads, M_TEMP, 1719 M_WAITOK | M_ZERO); 1720 PROC_LOCK(p); 1721 goto repeat; 1722 } 1723 i = 0; 1724 1725 /* 1726 * XXXRW: During the below loop, execve(2) and countless other sorts 1727 * of changes could have taken place. Should we check to see if the 1728 * vmspace has been replaced, or the like, in order to prevent 1729 * giving a snapshot that spans, say, execve(2), with some threads 1730 * before and some after? Among other things, the credentials could 1731 * have changed, in which case the right to extract debug info might 1732 * no longer be assured. 1733 */ 1734 FOREACH_THREAD_IN_PROC(p, td) { 1735 KASSERT(i < numthreads, 1736 ("sysctl_kern_proc_kstack: numthreads")); 1737 lwpidarray[i] = td->td_tid; 1738 i++; 1739 } 1740 numthreads = i; 1741 for (i = 0; i < numthreads; i++) { 1742 td = thread_find(p, lwpidarray[i]); 1743 if (td == NULL) { 1744 continue; 1745 } 1746 bzero(kkstp, sizeof(*kkstp)); 1747 (void)sbuf_new(&sb, kkstp->kkst_trace, 1748 sizeof(kkstp->kkst_trace), SBUF_FIXEDLEN); 1749 thread_lock(td); 1750 kkstp->kkst_tid = td->td_tid; 1751 if (TD_IS_SWAPPED(td)) 1752 kkstp->kkst_state = KKST_STATE_SWAPPED; 1753 else if (TD_IS_RUNNING(td)) 1754 kkstp->kkst_state = KKST_STATE_RUNNING; 1755 else { 1756 kkstp->kkst_state = KKST_STATE_STACKOK; 1757 stack_save_td(st, td); 1758 } 1759 thread_unlock(td); 1760 PROC_UNLOCK(p); 1761 stack_sbuf_print(&sb, st); 1762 sbuf_finish(&sb); 1763 sbuf_delete(&sb); 1764 error = SYSCTL_OUT(req, kkstp, sizeof(*kkstp)); 1765 PROC_LOCK(p); 1766 if (error) 1767 break; 1768 } 1769 _PRELE(p); 1770 PROC_UNLOCK(p); 1771 if (lwpidarray != NULL) 1772 free(lwpidarray, M_TEMP); 1773 stack_destroy(st); 1774 free(kkstp, M_TEMP); 1775 return (error); 1776 } 1777 #endif 1778 1779 SYSCTL_NODE(_kern, KERN_PROC, proc, CTLFLAG_RD, 0, "Process table"); 1780 1781 SYSCTL_PROC(_kern_proc, KERN_PROC_ALL, all, CTLFLAG_RD|CTLTYPE_STRUCT, 1782 0, 0, sysctl_kern_proc, "S,proc", "Return entire process table"); 1783 1784 static SYSCTL_NODE(_kern_proc, KERN_PROC_GID, gid, CTLFLAG_RD, 1785 sysctl_kern_proc, "Process table"); 1786 1787 static SYSCTL_NODE(_kern_proc, KERN_PROC_PGRP, pgrp, CTLFLAG_RD, 1788 sysctl_kern_proc, "Process table"); 1789 1790 static SYSCTL_NODE(_kern_proc, KERN_PROC_RGID, rgid, CTLFLAG_RD, 1791 sysctl_kern_proc, "Process table"); 1792 1793 static SYSCTL_NODE(_kern_proc, KERN_PROC_SESSION, sid, CTLFLAG_RD, 1794 sysctl_kern_proc, "Process table"); 1795 1796 static SYSCTL_NODE(_kern_proc, KERN_PROC_TTY, tty, CTLFLAG_RD, 1797 sysctl_kern_proc, "Process table"); 1798 1799 static SYSCTL_NODE(_kern_proc, KERN_PROC_UID, uid, CTLFLAG_RD, 1800 sysctl_kern_proc, "Process table"); 1801 1802 static SYSCTL_NODE(_kern_proc, KERN_PROC_RUID, ruid, CTLFLAG_RD, 1803 sysctl_kern_proc, "Process table"); 1804 1805 static SYSCTL_NODE(_kern_proc, KERN_PROC_PID, pid, CTLFLAG_RD, 1806 sysctl_kern_proc, "Process table"); 1807 1808 static SYSCTL_NODE(_kern_proc, KERN_PROC_PROC, proc, CTLFLAG_RD, 1809 sysctl_kern_proc, "Return process table, no threads"); 1810 1811 static SYSCTL_NODE(_kern_proc, KERN_PROC_ARGS, args, 1812 CTLFLAG_RW | CTLFLAG_ANYBODY, 1813 sysctl_kern_proc_args, "Process argument list"); 1814 1815 static SYSCTL_NODE(_kern_proc, KERN_PROC_PATHNAME, pathname, CTLFLAG_RD, 1816 sysctl_kern_proc_pathname, "Process executable path"); 1817 1818 static SYSCTL_NODE(_kern_proc, KERN_PROC_SV_NAME, sv_name, CTLFLAG_RD, 1819 sysctl_kern_proc_sv_name, "Process syscall vector name (ABI type)"); 1820 1821 static SYSCTL_NODE(_kern_proc, (KERN_PROC_GID | KERN_PROC_INC_THREAD), gid_td, 1822 CTLFLAG_RD, sysctl_kern_proc, "Process table"); 1823 1824 static SYSCTL_NODE(_kern_proc, (KERN_PROC_PGRP | KERN_PROC_INC_THREAD), pgrp_td, 1825 CTLFLAG_RD, sysctl_kern_proc, "Process table"); 1826 1827 static SYSCTL_NODE(_kern_proc, (KERN_PROC_RGID | KERN_PROC_INC_THREAD), rgid_td, 1828 CTLFLAG_RD, sysctl_kern_proc, "Process table"); 1829 1830 static SYSCTL_NODE(_kern_proc, (KERN_PROC_SESSION | KERN_PROC_INC_THREAD), 1831 sid_td, CTLFLAG_RD, sysctl_kern_proc, "Process table"); 1832 1833 static SYSCTL_NODE(_kern_proc, (KERN_PROC_TTY | KERN_PROC_INC_THREAD), tty_td, 1834 CTLFLAG_RD, sysctl_kern_proc, "Process table"); 1835 1836 static SYSCTL_NODE(_kern_proc, (KERN_PROC_UID | KERN_PROC_INC_THREAD), uid_td, 1837 CTLFLAG_RD, sysctl_kern_proc, "Process table"); 1838 1839 static SYSCTL_NODE(_kern_proc, (KERN_PROC_RUID | KERN_PROC_INC_THREAD), ruid_td, 1840 CTLFLAG_RD, sysctl_kern_proc, "Process table"); 1841 1842 static SYSCTL_NODE(_kern_proc, (KERN_PROC_PID | KERN_PROC_INC_THREAD), pid_td, 1843 CTLFLAG_RD, sysctl_kern_proc, "Process table"); 1844 1845 static SYSCTL_NODE(_kern_proc, (KERN_PROC_PROC | KERN_PROC_INC_THREAD), proc_td, 1846 CTLFLAG_RD, sysctl_kern_proc, "Return process table, no threads"); 1847 1848 #ifdef COMPAT_FREEBSD7 1849 static SYSCTL_NODE(_kern_proc, KERN_PROC_OVMMAP, ovmmap, CTLFLAG_RD, 1850 sysctl_kern_proc_ovmmap, "Old Process vm map entries"); 1851 #endif 1852 1853 static SYSCTL_NODE(_kern_proc, KERN_PROC_VMMAP, vmmap, CTLFLAG_RD, 1854 sysctl_kern_proc_vmmap, "Process vm map entries"); 1855 1856 #if defined(STACK) || defined(DDB) 1857 static SYSCTL_NODE(_kern_proc, KERN_PROC_KSTACK, kstack, CTLFLAG_RD, 1858 sysctl_kern_proc_kstack, "Process kernel stacks"); 1859 #endif 1860