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 * $FreeBSD$ 31 */ 32 33 #include <sys/cdefs.h> 34 __FBSDID("$FreeBSD$"); 35 36 #include "opt_ktrace.h" 37 #include "opt_kstack_pages.h" 38 39 #include <sys/param.h> 40 #include <sys/systm.h> 41 #include <sys/kernel.h> 42 #include <sys/lock.h> 43 #include <sys/malloc.h> 44 #include <sys/mutex.h> 45 #include <sys/proc.h> 46 #include <sys/refcount.h> 47 #include <sys/sysent.h> 48 #include <sys/sched.h> 49 #include <sys/smp.h> 50 #include <sys/sysctl.h> 51 #include <sys/filedesc.h> 52 #include <sys/tty.h> 53 #include <sys/signalvar.h> 54 #include <sys/sx.h> 55 #include <sys/user.h> 56 #include <sys/jail.h> 57 #include <sys/vnode.h> 58 #ifdef KTRACE 59 #include <sys/uio.h> 60 #include <sys/ktrace.h> 61 #endif 62 63 #include <vm/vm.h> 64 #include <vm/vm_extern.h> 65 #include <vm/pmap.h> 66 #include <vm/vm_map.h> 67 #include <vm/uma.h> 68 69 MALLOC_DEFINE(M_PGRP, "pgrp", "process group header"); 70 MALLOC_DEFINE(M_SESSION, "session", "session header"); 71 static MALLOC_DEFINE(M_PROC, "proc", "Proc structures"); 72 MALLOC_DEFINE(M_SUBPROC, "subproc", "Proc sub-structures"); 73 74 static void doenterpgrp(struct proc *, struct pgrp *); 75 static void orphanpg(struct pgrp *pg); 76 static void fill_kinfo_proc_only(struct proc *p, struct kinfo_proc *kp); 77 static void fill_kinfo_thread(struct thread *td, struct kinfo_proc *kp); 78 static void pgadjustjobc(struct pgrp *pgrp, int entering); 79 static void pgdelete(struct pgrp *); 80 static int proc_ctor(void *mem, int size, void *arg, int flags); 81 static void proc_dtor(void *mem, int size, void *arg); 82 static int proc_init(void *mem, int size, int flags); 83 static void proc_fini(void *mem, int size); 84 85 /* 86 * Other process lists 87 */ 88 struct pidhashhead *pidhashtbl; 89 u_long pidhash; 90 struct pgrphashhead *pgrphashtbl; 91 u_long pgrphash; 92 struct proclist allproc; 93 struct proclist zombproc; 94 struct sx allproc_lock; 95 struct sx proctree_lock; 96 struct mtx ppeers_lock; 97 uma_zone_t proc_zone; 98 uma_zone_t ithread_zone; 99 100 int kstack_pages = KSTACK_PAGES; 101 SYSCTL_INT(_kern, OID_AUTO, kstack_pages, CTLFLAG_RD, &kstack_pages, 0, ""); 102 103 CTASSERT(sizeof(struct kinfo_proc) == KINFO_PROC_SIZE); 104 105 /* 106 * Initialize global process hashing structures. 107 */ 108 void 109 procinit() 110 { 111 112 sx_init(&allproc_lock, "allproc"); 113 sx_init(&proctree_lock, "proctree"); 114 mtx_init(&ppeers_lock, "p_peers", NULL, MTX_DEF); 115 LIST_INIT(&allproc); 116 LIST_INIT(&zombproc); 117 pidhashtbl = hashinit(maxproc / 4, M_PROC, &pidhash); 118 pgrphashtbl = hashinit(maxproc / 4, M_PROC, &pgrphash); 119 proc_zone = uma_zcreate("PROC", sched_sizeof_proc(), 120 proc_ctor, proc_dtor, proc_init, proc_fini, 121 UMA_ALIGN_PTR, UMA_ZONE_NOFREE); 122 uihashinit(); 123 } 124 125 /* 126 * Prepare a proc for use. 127 */ 128 static int 129 proc_ctor(void *mem, int size, void *arg, int flags) 130 { 131 struct proc *p; 132 133 p = (struct proc *)mem; 134 return (0); 135 } 136 137 /* 138 * Reclaim a proc after use. 139 */ 140 static void 141 proc_dtor(void *mem, int size, void *arg) 142 { 143 struct proc *p; 144 struct thread *td; 145 #ifdef INVARIANTS 146 struct ksegrp *kg; 147 #endif 148 149 /* INVARIANTS checks go here */ 150 p = (struct proc *)mem; 151 td = FIRST_THREAD_IN_PROC(p); 152 #ifdef INVARIANTS 153 KASSERT((p->p_numthreads == 1), 154 ("bad number of threads in exiting process")); 155 KASSERT((p->p_numksegrps == 1), ("free proc with > 1 ksegrp")); 156 KASSERT((td != NULL), ("proc_dtor: bad thread pointer")); 157 kg = FIRST_KSEGRP_IN_PROC(p); 158 KASSERT((kg != NULL), ("proc_dtor: bad kg pointer")); 159 KASSERT(STAILQ_EMPTY(&p->p_ktr), ("proc_dtor: non-empty p_ktr")); 160 #endif 161 162 /* Dispose of an alternate kstack, if it exists. 163 * XXX What if there are more than one thread in the proc? 164 * The first thread in the proc is special and not 165 * freed, so you gotta do this here. 166 */ 167 if (((p->p_flag & P_KTHREAD) != 0) && (td->td_altkstack != 0)) 168 vm_thread_dispose_altkstack(td); 169 if (p->p_ksi != NULL) 170 KASSERT(! KSI_ONQ(p->p_ksi), ("SIGCHLD queue")); 171 } 172 173 /* 174 * Initialize type-stable parts of a proc (when newly created). 175 */ 176 static int 177 proc_init(void *mem, int size, int flags) 178 { 179 struct proc *p; 180 struct thread *td; 181 struct ksegrp *kg; 182 183 p = (struct proc *)mem; 184 p->p_sched = (struct p_sched *)&p[1]; 185 td = thread_alloc(); 186 kg = ksegrp_alloc(); 187 bzero(&p->p_mtx, sizeof(struct mtx)); 188 mtx_init(&p->p_mtx, "process lock", NULL, MTX_DEF | MTX_DUPOK); 189 p->p_stats = pstats_alloc(); 190 proc_linkup(p, kg, td); 191 sched_newproc(p, kg, td); 192 return (0); 193 } 194 195 /* 196 * UMA should ensure that this function is never called. 197 * Freeing a proc structure would violate type stability. 198 */ 199 static void 200 proc_fini(void *mem, int size) 201 { 202 #ifdef notnow 203 struct proc *p; 204 205 p = (struct proc *)mem; 206 pstats_free(p->p_stats); 207 ksegrp_free(FIRST_KSEGRP_IN_PROC(p)); 208 thread_free(FIRST_THREAD_IN_PROC(p)); 209 mtx_destroy(&p->p_mtx); 210 if (p->p_ksi != NULL) 211 ksiginfo_free(p->p_ksi); 212 #else 213 panic("proc reclaimed"); 214 #endif 215 } 216 217 /* 218 * Is p an inferior of the current process? 219 */ 220 int 221 inferior(p) 222 register struct proc *p; 223 { 224 225 sx_assert(&proctree_lock, SX_LOCKED); 226 for (; p != curproc; p = p->p_pptr) 227 if (p->p_pid == 0) 228 return (0); 229 return (1); 230 } 231 232 /* 233 * Locate a process by number; return only "live" processes -- i.e., neither 234 * zombies nor newly born but incompletely initialized processes. By not 235 * returning processes in the PRS_NEW state, we allow callers to avoid 236 * testing for that condition to avoid dereferencing p_ucred, et al. 237 */ 238 struct proc * 239 pfind(pid) 240 register pid_t pid; 241 { 242 register struct proc *p; 243 244 sx_slock(&allproc_lock); 245 LIST_FOREACH(p, PIDHASH(pid), p_hash) 246 if (p->p_pid == pid) { 247 if (p->p_state == PRS_NEW) { 248 p = NULL; 249 break; 250 } 251 PROC_LOCK(p); 252 break; 253 } 254 sx_sunlock(&allproc_lock); 255 return (p); 256 } 257 258 /* 259 * Locate a process group by number. 260 * The caller must hold proctree_lock. 261 */ 262 struct pgrp * 263 pgfind(pgid) 264 register pid_t pgid; 265 { 266 register struct pgrp *pgrp; 267 268 sx_assert(&proctree_lock, SX_LOCKED); 269 270 LIST_FOREACH(pgrp, PGRPHASH(pgid), pg_hash) { 271 if (pgrp->pg_id == pgid) { 272 PGRP_LOCK(pgrp); 273 return (pgrp); 274 } 275 } 276 return (NULL); 277 } 278 279 /* 280 * Create a new process group. 281 * pgid must be equal to the pid of p. 282 * Begin a new session if required. 283 */ 284 int 285 enterpgrp(p, pgid, pgrp, sess) 286 register struct proc *p; 287 pid_t pgid; 288 struct pgrp *pgrp; 289 struct session *sess; 290 { 291 struct pgrp *pgrp2; 292 293 sx_assert(&proctree_lock, SX_XLOCKED); 294 295 KASSERT(pgrp != NULL, ("enterpgrp: pgrp == NULL")); 296 KASSERT(p->p_pid == pgid, 297 ("enterpgrp: new pgrp and pid != pgid")); 298 299 pgrp2 = pgfind(pgid); 300 301 KASSERT(pgrp2 == NULL, 302 ("enterpgrp: pgrp with pgid exists")); 303 KASSERT(!SESS_LEADER(p), 304 ("enterpgrp: session leader attempted setpgrp")); 305 306 mtx_init(&pgrp->pg_mtx, "process group", NULL, MTX_DEF | MTX_DUPOK); 307 308 if (sess != NULL) { 309 /* 310 * new session 311 */ 312 mtx_init(&sess->s_mtx, "session", NULL, MTX_DEF); 313 PROC_LOCK(p); 314 p->p_flag &= ~P_CONTROLT; 315 PROC_UNLOCK(p); 316 PGRP_LOCK(pgrp); 317 sess->s_leader = p; 318 sess->s_sid = p->p_pid; 319 sess->s_count = 1; 320 sess->s_ttyvp = NULL; 321 sess->s_ttyp = NULL; 322 bcopy(p->p_session->s_login, sess->s_login, 323 sizeof(sess->s_login)); 324 pgrp->pg_session = sess; 325 KASSERT(p == curproc, 326 ("enterpgrp: mksession and p != curproc")); 327 } else { 328 pgrp->pg_session = p->p_session; 329 SESS_LOCK(pgrp->pg_session); 330 pgrp->pg_session->s_count++; 331 SESS_UNLOCK(pgrp->pg_session); 332 PGRP_LOCK(pgrp); 333 } 334 pgrp->pg_id = pgid; 335 LIST_INIT(&pgrp->pg_members); 336 337 /* 338 * As we have an exclusive lock of proctree_lock, 339 * this should not deadlock. 340 */ 341 LIST_INSERT_HEAD(PGRPHASH(pgid), pgrp, pg_hash); 342 pgrp->pg_jobc = 0; 343 SLIST_INIT(&pgrp->pg_sigiolst); 344 PGRP_UNLOCK(pgrp); 345 346 doenterpgrp(p, pgrp); 347 348 return (0); 349 } 350 351 /* 352 * Move p to an existing process group 353 */ 354 int 355 enterthispgrp(p, pgrp) 356 register struct proc *p; 357 struct pgrp *pgrp; 358 { 359 360 sx_assert(&proctree_lock, SX_XLOCKED); 361 PROC_LOCK_ASSERT(p, MA_NOTOWNED); 362 PGRP_LOCK_ASSERT(pgrp, MA_NOTOWNED); 363 PGRP_LOCK_ASSERT(p->p_pgrp, MA_NOTOWNED); 364 SESS_LOCK_ASSERT(p->p_session, MA_NOTOWNED); 365 KASSERT(pgrp->pg_session == p->p_session, 366 ("%s: pgrp's session %p, p->p_session %p.\n", 367 __func__, 368 pgrp->pg_session, 369 p->p_session)); 370 KASSERT(pgrp != p->p_pgrp, 371 ("%s: p belongs to pgrp.", __func__)); 372 373 doenterpgrp(p, pgrp); 374 375 return (0); 376 } 377 378 /* 379 * Move p to a process group 380 */ 381 static void 382 doenterpgrp(p, pgrp) 383 struct proc *p; 384 struct pgrp *pgrp; 385 { 386 struct pgrp *savepgrp; 387 388 sx_assert(&proctree_lock, SX_XLOCKED); 389 PROC_LOCK_ASSERT(p, MA_NOTOWNED); 390 PGRP_LOCK_ASSERT(pgrp, MA_NOTOWNED); 391 PGRP_LOCK_ASSERT(p->p_pgrp, MA_NOTOWNED); 392 SESS_LOCK_ASSERT(p->p_session, MA_NOTOWNED); 393 394 savepgrp = p->p_pgrp; 395 396 /* 397 * Adjust eligibility of affected pgrps to participate in job control. 398 * Increment eligibility counts before decrementing, otherwise we 399 * could reach 0 spuriously during the first call. 400 */ 401 fixjobc(p, pgrp, 1); 402 fixjobc(p, p->p_pgrp, 0); 403 404 PGRP_LOCK(pgrp); 405 PGRP_LOCK(savepgrp); 406 PROC_LOCK(p); 407 LIST_REMOVE(p, p_pglist); 408 p->p_pgrp = pgrp; 409 PROC_UNLOCK(p); 410 LIST_INSERT_HEAD(&pgrp->pg_members, p, p_pglist); 411 PGRP_UNLOCK(savepgrp); 412 PGRP_UNLOCK(pgrp); 413 if (LIST_EMPTY(&savepgrp->pg_members)) 414 pgdelete(savepgrp); 415 } 416 417 /* 418 * remove process from process group 419 */ 420 int 421 leavepgrp(p) 422 register struct proc *p; 423 { 424 struct pgrp *savepgrp; 425 426 sx_assert(&proctree_lock, SX_XLOCKED); 427 savepgrp = p->p_pgrp; 428 PGRP_LOCK(savepgrp); 429 PROC_LOCK(p); 430 LIST_REMOVE(p, p_pglist); 431 p->p_pgrp = NULL; 432 PROC_UNLOCK(p); 433 PGRP_UNLOCK(savepgrp); 434 if (LIST_EMPTY(&savepgrp->pg_members)) 435 pgdelete(savepgrp); 436 return (0); 437 } 438 439 /* 440 * delete a process group 441 */ 442 static void 443 pgdelete(pgrp) 444 register struct pgrp *pgrp; 445 { 446 struct session *savesess; 447 448 sx_assert(&proctree_lock, SX_XLOCKED); 449 PGRP_LOCK_ASSERT(pgrp, MA_NOTOWNED); 450 SESS_LOCK_ASSERT(pgrp->pg_session, MA_NOTOWNED); 451 452 /* 453 * Reset any sigio structures pointing to us as a result of 454 * F_SETOWN with our pgid. 455 */ 456 funsetownlst(&pgrp->pg_sigiolst); 457 458 PGRP_LOCK(pgrp); 459 if (pgrp->pg_session->s_ttyp != NULL && 460 pgrp->pg_session->s_ttyp->t_pgrp == pgrp) 461 pgrp->pg_session->s_ttyp->t_pgrp = NULL; 462 LIST_REMOVE(pgrp, pg_hash); 463 savesess = pgrp->pg_session; 464 SESSRELE(savesess); 465 PGRP_UNLOCK(pgrp); 466 mtx_destroy(&pgrp->pg_mtx); 467 FREE(pgrp, M_PGRP); 468 } 469 470 static void 471 pgadjustjobc(pgrp, entering) 472 struct pgrp *pgrp; 473 int entering; 474 { 475 476 PGRP_LOCK(pgrp); 477 if (entering) 478 pgrp->pg_jobc++; 479 else { 480 --pgrp->pg_jobc; 481 if (pgrp->pg_jobc == 0) 482 orphanpg(pgrp); 483 } 484 PGRP_UNLOCK(pgrp); 485 } 486 487 /* 488 * Adjust pgrp jobc counters when specified process changes process group. 489 * We count the number of processes in each process group that "qualify" 490 * the group for terminal job control (those with a parent in a different 491 * process group of the same session). If that count reaches zero, the 492 * process group becomes orphaned. Check both the specified process' 493 * process group and that of its children. 494 * entering == 0 => p is leaving specified group. 495 * entering == 1 => p is entering specified group. 496 */ 497 void 498 fixjobc(p, pgrp, entering) 499 register struct proc *p; 500 register struct pgrp *pgrp; 501 int entering; 502 { 503 register struct pgrp *hispgrp; 504 register struct session *mysession; 505 506 sx_assert(&proctree_lock, SX_LOCKED); 507 PROC_LOCK_ASSERT(p, MA_NOTOWNED); 508 PGRP_LOCK_ASSERT(pgrp, MA_NOTOWNED); 509 SESS_LOCK_ASSERT(pgrp->pg_session, MA_NOTOWNED); 510 511 /* 512 * Check p's parent to see whether p qualifies its own process 513 * group; if so, adjust count for p's process group. 514 */ 515 mysession = pgrp->pg_session; 516 if ((hispgrp = p->p_pptr->p_pgrp) != pgrp && 517 hispgrp->pg_session == mysession) 518 pgadjustjobc(pgrp, entering); 519 520 /* 521 * Check this process' children to see whether they qualify 522 * their process groups; if so, adjust counts for children's 523 * process groups. 524 */ 525 LIST_FOREACH(p, &p->p_children, p_sibling) { 526 hispgrp = p->p_pgrp; 527 if (hispgrp == pgrp || 528 hispgrp->pg_session != mysession) 529 continue; 530 PROC_LOCK(p); 531 if (p->p_state == PRS_ZOMBIE) { 532 PROC_UNLOCK(p); 533 continue; 534 } 535 PROC_UNLOCK(p); 536 pgadjustjobc(hispgrp, entering); 537 } 538 } 539 540 /* 541 * A process group has become orphaned; 542 * if there are any stopped processes in the group, 543 * hang-up all process in that group. 544 */ 545 static void 546 orphanpg(pg) 547 struct pgrp *pg; 548 { 549 register struct proc *p; 550 551 PGRP_LOCK_ASSERT(pg, MA_OWNED); 552 553 LIST_FOREACH(p, &pg->pg_members, p_pglist) { 554 PROC_LOCK(p); 555 if (P_SHOULDSTOP(p)) { 556 PROC_UNLOCK(p); 557 LIST_FOREACH(p, &pg->pg_members, p_pglist) { 558 PROC_LOCK(p); 559 psignal(p, SIGHUP); 560 psignal(p, SIGCONT); 561 PROC_UNLOCK(p); 562 } 563 return; 564 } 565 PROC_UNLOCK(p); 566 } 567 } 568 569 void 570 sessrele(struct session *s) 571 { 572 int i; 573 574 SESS_LOCK(s); 575 i = --s->s_count; 576 SESS_UNLOCK(s); 577 if (i == 0) { 578 if (s->s_ttyp != NULL) 579 ttyrel(s->s_ttyp); 580 mtx_destroy(&s->s_mtx); 581 FREE(s, M_SESSION); 582 } 583 } 584 585 #include "opt_ddb.h" 586 #ifdef DDB 587 #include <ddb/ddb.h> 588 589 DB_SHOW_COMMAND(pgrpdump, pgrpdump) 590 { 591 register struct pgrp *pgrp; 592 register struct proc *p; 593 register int i; 594 595 for (i = 0; i <= pgrphash; i++) { 596 if (!LIST_EMPTY(&pgrphashtbl[i])) { 597 printf("\tindx %d\n", i); 598 LIST_FOREACH(pgrp, &pgrphashtbl[i], pg_hash) { 599 printf( 600 "\tpgrp %p, pgid %ld, sess %p, sesscnt %d, mem %p\n", 601 (void *)pgrp, (long)pgrp->pg_id, 602 (void *)pgrp->pg_session, 603 pgrp->pg_session->s_count, 604 (void *)LIST_FIRST(&pgrp->pg_members)); 605 LIST_FOREACH(p, &pgrp->pg_members, p_pglist) { 606 printf("\t\tpid %ld addr %p pgrp %p\n", 607 (long)p->p_pid, (void *)p, 608 (void *)p->p_pgrp); 609 } 610 } 611 } 612 } 613 } 614 #endif /* DDB */ 615 616 /* 617 * Clear kinfo_proc and fill in any information that is common 618 * to all threads in the process. 619 * Must be called with the target process locked. 620 */ 621 static void 622 fill_kinfo_proc_only(struct proc *p, struct kinfo_proc *kp) 623 { 624 struct thread *td0; 625 struct tty *tp; 626 struct session *sp; 627 struct timeval tv; 628 struct ucred *cred; 629 struct sigacts *ps; 630 631 bzero(kp, sizeof(*kp)); 632 633 kp->ki_structsize = sizeof(*kp); 634 kp->ki_paddr = p; 635 PROC_LOCK_ASSERT(p, MA_OWNED); 636 kp->ki_addr =/* p->p_addr; */0; /* XXXKSE */ 637 kp->ki_args = p->p_args; 638 kp->ki_textvp = p->p_textvp; 639 #ifdef KTRACE 640 kp->ki_tracep = p->p_tracevp; 641 mtx_lock(&ktrace_mtx); 642 kp->ki_traceflag = p->p_traceflag; 643 mtx_unlock(&ktrace_mtx); 644 #endif 645 kp->ki_fd = p->p_fd; 646 kp->ki_vmspace = p->p_vmspace; 647 kp->ki_flag = p->p_flag; 648 cred = p->p_ucred; 649 if (cred) { 650 kp->ki_uid = cred->cr_uid; 651 kp->ki_ruid = cred->cr_ruid; 652 kp->ki_svuid = cred->cr_svuid; 653 /* XXX bde doesn't like KI_NGROUPS */ 654 kp->ki_ngroups = min(cred->cr_ngroups, KI_NGROUPS); 655 bcopy(cred->cr_groups, kp->ki_groups, 656 kp->ki_ngroups * sizeof(gid_t)); 657 kp->ki_rgid = cred->cr_rgid; 658 kp->ki_svgid = cred->cr_svgid; 659 /* If jailed(cred), emulate the old P_JAILED flag. */ 660 if (jailed(cred)) { 661 kp->ki_flag |= P_JAILED; 662 /* If inside a jail, use 0 as a jail ID. */ 663 if (!jailed(curthread->td_ucred)) 664 kp->ki_jid = cred->cr_prison->pr_id; 665 } 666 } 667 ps = p->p_sigacts; 668 if (ps) { 669 mtx_lock(&ps->ps_mtx); 670 kp->ki_sigignore = ps->ps_sigignore; 671 kp->ki_sigcatch = ps->ps_sigcatch; 672 mtx_unlock(&ps->ps_mtx); 673 } 674 mtx_lock_spin(&sched_lock); 675 if (p->p_state != PRS_NEW && 676 p->p_state != PRS_ZOMBIE && 677 p->p_vmspace != NULL) { 678 struct vmspace *vm = p->p_vmspace; 679 680 kp->ki_size = vm->vm_map.size; 681 kp->ki_rssize = vmspace_resident_count(vm); /*XXX*/ 682 FOREACH_THREAD_IN_PROC(p, td0) { 683 if (!TD_IS_SWAPPED(td0)) 684 kp->ki_rssize += td0->td_kstack_pages; 685 if (td0->td_altkstack_obj != NULL) 686 kp->ki_rssize += td0->td_altkstack_pages; 687 } 688 kp->ki_swrss = vm->vm_swrss; 689 kp->ki_tsize = vm->vm_tsize; 690 kp->ki_dsize = vm->vm_dsize; 691 kp->ki_ssize = vm->vm_ssize; 692 } else if (p->p_state == PRS_ZOMBIE) 693 kp->ki_stat = SZOMB; 694 kp->ki_sflag = p->p_sflag; 695 kp->ki_swtime = p->p_swtime; 696 kp->ki_pid = p->p_pid; 697 kp->ki_nice = p->p_nice; 698 bintime2timeval(&p->p_rux.rux_runtime, &tv); 699 kp->ki_runtime = tv.tv_sec * (u_int64_t)1000000 + tv.tv_usec; 700 mtx_unlock_spin(&sched_lock); 701 if ((p->p_sflag & PS_INMEM) && p->p_stats != NULL) { 702 kp->ki_start = p->p_stats->p_start; 703 timevaladd(&kp->ki_start, &boottime); 704 kp->ki_rusage = p->p_stats->p_ru; 705 calcru(p, &kp->ki_rusage.ru_utime, &kp->ki_rusage.ru_stime); 706 calccru(p, &kp->ki_childutime, &kp->ki_childstime); 707 708 /* Some callers want child-times in a single value */ 709 kp->ki_childtime = kp->ki_childstime; 710 timevaladd(&kp->ki_childtime, &kp->ki_childutime); 711 } 712 tp = NULL; 713 if (p->p_pgrp) { 714 kp->ki_pgid = p->p_pgrp->pg_id; 715 kp->ki_jobc = p->p_pgrp->pg_jobc; 716 sp = p->p_pgrp->pg_session; 717 718 if (sp != NULL) { 719 kp->ki_sid = sp->s_sid; 720 SESS_LOCK(sp); 721 strlcpy(kp->ki_login, sp->s_login, 722 sizeof(kp->ki_login)); 723 if (sp->s_ttyvp) 724 kp->ki_kiflag |= KI_CTTY; 725 if (SESS_LEADER(p)) 726 kp->ki_kiflag |= KI_SLEADER; 727 tp = sp->s_ttyp; 728 SESS_UNLOCK(sp); 729 } 730 } 731 if ((p->p_flag & P_CONTROLT) && tp != NULL) { 732 kp->ki_tdev = dev2udev(tp->t_dev); 733 kp->ki_tpgid = tp->t_pgrp ? tp->t_pgrp->pg_id : NO_PID; 734 if (tp->t_session) 735 kp->ki_tsid = tp->t_session->s_sid; 736 } else 737 kp->ki_tdev = NODEV; 738 if (p->p_comm[0] != '\0') { 739 strlcpy(kp->ki_comm, p->p_comm, sizeof(kp->ki_comm)); 740 strlcpy(kp->ki_ocomm, p->p_comm, sizeof(kp->ki_ocomm)); 741 } 742 if (p->p_sysent && p->p_sysent->sv_name != NULL && 743 p->p_sysent->sv_name[0] != '\0') 744 strlcpy(kp->ki_emul, p->p_sysent->sv_name, sizeof(kp->ki_emul)); 745 kp->ki_siglist = p->p_siglist; 746 kp->ki_xstat = p->p_xstat; 747 kp->ki_acflag = p->p_acflag; 748 kp->ki_lock = p->p_lock; 749 if (p->p_pptr) 750 kp->ki_ppid = p->p_pptr->p_pid; 751 } 752 753 /* 754 * Fill in information that is thread specific. 755 * Must be called with sched_lock locked. 756 */ 757 static void 758 fill_kinfo_thread(struct thread *td, struct kinfo_proc *kp) 759 { 760 struct ksegrp *kg; 761 struct proc *p; 762 763 p = td->td_proc; 764 765 if (td->td_wmesg != NULL) 766 strlcpy(kp->ki_wmesg, td->td_wmesg, sizeof(kp->ki_wmesg)); 767 else 768 bzero(kp->ki_wmesg, sizeof(kp->ki_wmesg)); 769 if (TD_ON_LOCK(td)) { 770 kp->ki_kiflag |= KI_LOCKBLOCK; 771 strlcpy(kp->ki_lockname, td->td_lockname, 772 sizeof(kp->ki_lockname)); 773 } else { 774 kp->ki_kiflag &= ~KI_LOCKBLOCK; 775 bzero(kp->ki_lockname, sizeof(kp->ki_lockname)); 776 } 777 778 if (p->p_state == PRS_NORMAL) { /* XXXKSE very approximate */ 779 if (TD_ON_RUNQ(td) || 780 TD_CAN_RUN(td) || 781 TD_IS_RUNNING(td)) { 782 kp->ki_stat = SRUN; 783 } else if (P_SHOULDSTOP(p)) { 784 kp->ki_stat = SSTOP; 785 } else if (TD_IS_SLEEPING(td)) { 786 kp->ki_stat = SSLEEP; 787 } else if (TD_ON_LOCK(td)) { 788 kp->ki_stat = SLOCK; 789 } else { 790 kp->ki_stat = SWAIT; 791 } 792 } else if (p->p_state == PRS_ZOMBIE) { 793 kp->ki_stat = SZOMB; 794 } else { 795 kp->ki_stat = SIDL; 796 } 797 798 kg = td->td_ksegrp; 799 800 /* things in the KSE GROUP */ 801 kp->ki_estcpu = kg->kg_estcpu; 802 kp->ki_slptime = kg->kg_slptime; 803 kp->ki_pri.pri_user = kg->kg_user_pri; 804 kp->ki_pri.pri_class = kg->kg_pri_class; 805 806 /* Things in the thread */ 807 kp->ki_wchan = td->td_wchan; 808 kp->ki_pri.pri_level = td->td_priority; 809 kp->ki_pri.pri_native = td->td_base_pri; 810 kp->ki_lastcpu = td->td_lastcpu; 811 kp->ki_oncpu = td->td_oncpu; 812 kp->ki_tdflags = td->td_flags; 813 kp->ki_tid = td->td_tid; 814 kp->ki_numthreads = p->p_numthreads; 815 kp->ki_pcb = td->td_pcb; 816 kp->ki_kstack = (void *)td->td_kstack; 817 kp->ki_pctcpu = sched_pctcpu(td); 818 819 /* We can't get this anymore but ps etc never used it anyway. */ 820 kp->ki_rqindex = 0; 821 822 SIGSETOR(kp->ki_siglist, td->td_siglist); 823 kp->ki_sigmask = td->td_sigmask; 824 } 825 826 /* 827 * Fill in a kinfo_proc structure for the specified process. 828 * Must be called with the target process locked. 829 */ 830 void 831 fill_kinfo_proc(struct proc *p, struct kinfo_proc *kp) 832 { 833 834 fill_kinfo_proc_only(p, kp); 835 mtx_lock_spin(&sched_lock); 836 if (FIRST_THREAD_IN_PROC(p) != NULL) 837 fill_kinfo_thread(FIRST_THREAD_IN_PROC(p), kp); 838 mtx_unlock_spin(&sched_lock); 839 } 840 841 struct pstats * 842 pstats_alloc(void) 843 { 844 845 return (malloc(sizeof(struct pstats), M_SUBPROC, M_ZERO|M_WAITOK)); 846 } 847 848 /* 849 * Copy parts of p_stats; zero the rest of p_stats (statistics). 850 */ 851 void 852 pstats_fork(struct pstats *src, struct pstats *dst) 853 { 854 855 bzero(&dst->pstat_startzero, 856 __rangeof(struct pstats, pstat_startzero, pstat_endzero)); 857 bcopy(&src->pstat_startcopy, &dst->pstat_startcopy, 858 __rangeof(struct pstats, pstat_startcopy, pstat_endcopy)); 859 } 860 861 void 862 pstats_free(struct pstats *ps) 863 { 864 865 free(ps, M_SUBPROC); 866 } 867 868 /* 869 * Locate a zombie process by number 870 */ 871 struct proc * 872 zpfind(pid_t pid) 873 { 874 struct proc *p; 875 876 sx_slock(&allproc_lock); 877 LIST_FOREACH(p, &zombproc, p_list) 878 if (p->p_pid == pid) { 879 PROC_LOCK(p); 880 break; 881 } 882 sx_sunlock(&allproc_lock); 883 return (p); 884 } 885 886 #define KERN_PROC_ZOMBMASK 0x3 887 #define KERN_PROC_NOTHREADS 0x4 888 889 /* 890 * Must be called with the process locked and will return with it unlocked. 891 */ 892 static int 893 sysctl_out_proc(struct proc *p, struct sysctl_req *req, int flags) 894 { 895 struct thread *td; 896 struct kinfo_proc kinfo_proc; 897 int error = 0; 898 struct proc *np; 899 pid_t pid = p->p_pid; 900 901 PROC_LOCK_ASSERT(p, MA_OWNED); 902 903 fill_kinfo_proc_only(p, &kinfo_proc); 904 if (flags & KERN_PROC_NOTHREADS) { 905 mtx_lock_spin(&sched_lock); 906 if (FIRST_THREAD_IN_PROC(p) != NULL) 907 fill_kinfo_thread(FIRST_THREAD_IN_PROC(p), &kinfo_proc); 908 mtx_unlock_spin(&sched_lock); 909 error = SYSCTL_OUT(req, (caddr_t)&kinfo_proc, 910 sizeof(kinfo_proc)); 911 } else { 912 mtx_lock_spin(&sched_lock); 913 if (FIRST_THREAD_IN_PROC(p) != NULL) 914 FOREACH_THREAD_IN_PROC(p, td) { 915 fill_kinfo_thread(td, &kinfo_proc); 916 error = SYSCTL_OUT(req, (caddr_t)&kinfo_proc, 917 sizeof(kinfo_proc)); 918 if (error) 919 break; 920 } 921 else 922 error = SYSCTL_OUT(req, (caddr_t)&kinfo_proc, 923 sizeof(kinfo_proc)); 924 mtx_unlock_spin(&sched_lock); 925 } 926 PROC_UNLOCK(p); 927 if (error) 928 return (error); 929 if (flags & KERN_PROC_ZOMBMASK) 930 np = zpfind(pid); 931 else { 932 if (pid == 0) 933 return (0); 934 np = pfind(pid); 935 } 936 if (np == NULL) 937 return EAGAIN; 938 if (np != p) { 939 PROC_UNLOCK(np); 940 return EAGAIN; 941 } 942 PROC_UNLOCK(np); 943 return (0); 944 } 945 946 static int 947 sysctl_kern_proc(SYSCTL_HANDLER_ARGS) 948 { 949 int *name = (int*) arg1; 950 u_int namelen = arg2; 951 struct proc *p; 952 int flags, doingzomb, oid_number; 953 int error = 0; 954 955 oid_number = oidp->oid_number; 956 if (oid_number != KERN_PROC_ALL && 957 (oid_number & KERN_PROC_INC_THREAD) == 0) 958 flags = KERN_PROC_NOTHREADS; 959 else { 960 flags = 0; 961 oid_number &= ~KERN_PROC_INC_THREAD; 962 } 963 if (oid_number == KERN_PROC_PID) { 964 if (namelen != 1) 965 return (EINVAL); 966 error = sysctl_wire_old_buffer(req, 0); 967 if (error) 968 return (error); 969 p = pfind((pid_t)name[0]); 970 if (!p) 971 return (ESRCH); 972 if ((error = p_cansee(curthread, p))) { 973 PROC_UNLOCK(p); 974 return (error); 975 } 976 error = sysctl_out_proc(p, req, flags); 977 return (error); 978 } 979 980 switch (oid_number) { 981 case KERN_PROC_ALL: 982 if (namelen != 0) 983 return (EINVAL); 984 break; 985 case KERN_PROC_PROC: 986 if (namelen != 0 && namelen != 1) 987 return (EINVAL); 988 break; 989 default: 990 if (namelen != 1) 991 return (EINVAL); 992 break; 993 } 994 995 if (!req->oldptr) { 996 /* overestimate by 5 procs */ 997 error = SYSCTL_OUT(req, 0, sizeof (struct kinfo_proc) * 5); 998 if (error) 999 return (error); 1000 } 1001 error = sysctl_wire_old_buffer(req, 0); 1002 if (error != 0) 1003 return (error); 1004 sx_slock(&allproc_lock); 1005 for (doingzomb=0 ; doingzomb < 2 ; doingzomb++) { 1006 if (!doingzomb) 1007 p = LIST_FIRST(&allproc); 1008 else 1009 p = LIST_FIRST(&zombproc); 1010 for (; p != 0; p = LIST_NEXT(p, p_list)) { 1011 /* 1012 * Skip embryonic processes. 1013 */ 1014 mtx_lock_spin(&sched_lock); 1015 if (p->p_state == PRS_NEW) { 1016 mtx_unlock_spin(&sched_lock); 1017 continue; 1018 } 1019 mtx_unlock_spin(&sched_lock); 1020 PROC_LOCK(p); 1021 /* 1022 * Show a user only appropriate processes. 1023 */ 1024 if (p_cansee(curthread, p)) { 1025 PROC_UNLOCK(p); 1026 continue; 1027 } 1028 /* 1029 * TODO - make more efficient (see notes below). 1030 * do by session. 1031 */ 1032 switch (oid_number) { 1033 1034 case KERN_PROC_GID: 1035 if (p->p_ucred == NULL || 1036 p->p_ucred->cr_gid != (gid_t)name[0]) { 1037 PROC_UNLOCK(p); 1038 continue; 1039 } 1040 break; 1041 1042 case KERN_PROC_PGRP: 1043 /* could do this by traversing pgrp */ 1044 if (p->p_pgrp == NULL || 1045 p->p_pgrp->pg_id != (pid_t)name[0]) { 1046 PROC_UNLOCK(p); 1047 continue; 1048 } 1049 break; 1050 1051 case KERN_PROC_RGID: 1052 if (p->p_ucred == NULL || 1053 p->p_ucred->cr_rgid != (gid_t)name[0]) { 1054 PROC_UNLOCK(p); 1055 continue; 1056 } 1057 break; 1058 1059 case KERN_PROC_SESSION: 1060 if (p->p_session == NULL || 1061 p->p_session->s_sid != (pid_t)name[0]) { 1062 PROC_UNLOCK(p); 1063 continue; 1064 } 1065 break; 1066 1067 case KERN_PROC_TTY: 1068 if ((p->p_flag & P_CONTROLT) == 0 || 1069 p->p_session == NULL) { 1070 PROC_UNLOCK(p); 1071 continue; 1072 } 1073 SESS_LOCK(p->p_session); 1074 if (p->p_session->s_ttyp == NULL || 1075 dev2udev(p->p_session->s_ttyp->t_dev) != 1076 (dev_t)name[0]) { 1077 SESS_UNLOCK(p->p_session); 1078 PROC_UNLOCK(p); 1079 continue; 1080 } 1081 SESS_UNLOCK(p->p_session); 1082 break; 1083 1084 case KERN_PROC_UID: 1085 if (p->p_ucred == NULL || 1086 p->p_ucred->cr_uid != (uid_t)name[0]) { 1087 PROC_UNLOCK(p); 1088 continue; 1089 } 1090 break; 1091 1092 case KERN_PROC_RUID: 1093 if (p->p_ucred == NULL || 1094 p->p_ucred->cr_ruid != (uid_t)name[0]) { 1095 PROC_UNLOCK(p); 1096 continue; 1097 } 1098 break; 1099 1100 case KERN_PROC_PROC: 1101 break; 1102 1103 default: 1104 break; 1105 1106 } 1107 1108 error = sysctl_out_proc(p, req, flags | doingzomb); 1109 if (error) { 1110 sx_sunlock(&allproc_lock); 1111 return (error); 1112 } 1113 } 1114 } 1115 sx_sunlock(&allproc_lock); 1116 return (0); 1117 } 1118 1119 struct pargs * 1120 pargs_alloc(int len) 1121 { 1122 struct pargs *pa; 1123 1124 MALLOC(pa, struct pargs *, sizeof(struct pargs) + len, M_PARGS, 1125 M_WAITOK); 1126 refcount_init(&pa->ar_ref, 1); 1127 pa->ar_length = len; 1128 return (pa); 1129 } 1130 1131 void 1132 pargs_free(struct pargs *pa) 1133 { 1134 1135 FREE(pa, M_PARGS); 1136 } 1137 1138 void 1139 pargs_hold(struct pargs *pa) 1140 { 1141 1142 if (pa == NULL) 1143 return; 1144 refcount_acquire(&pa->ar_ref); 1145 } 1146 1147 void 1148 pargs_drop(struct pargs *pa) 1149 { 1150 1151 if (pa == NULL) 1152 return; 1153 if (refcount_release(&pa->ar_ref)) 1154 pargs_free(pa); 1155 } 1156 1157 /* 1158 * This sysctl allows a process to retrieve the argument list or process 1159 * title for another process without groping around in the address space 1160 * of the other process. It also allow a process to set its own "process 1161 * title to a string of its own choice. 1162 */ 1163 static int 1164 sysctl_kern_proc_args(SYSCTL_HANDLER_ARGS) 1165 { 1166 int *name = (int*) arg1; 1167 u_int namelen = arg2; 1168 struct pargs *newpa, *pa; 1169 struct proc *p; 1170 int error = 0; 1171 1172 if (namelen != 1) 1173 return (EINVAL); 1174 1175 p = pfind((pid_t)name[0]); 1176 if (!p) 1177 return (ESRCH); 1178 1179 if ((error = p_cansee(curthread, p)) != 0) { 1180 PROC_UNLOCK(p); 1181 return (error); 1182 } 1183 1184 if (req->newptr && curproc != p) { 1185 PROC_UNLOCK(p); 1186 return (EPERM); 1187 } 1188 1189 pa = p->p_args; 1190 pargs_hold(pa); 1191 PROC_UNLOCK(p); 1192 if (req->oldptr != NULL && pa != NULL) 1193 error = SYSCTL_OUT(req, pa->ar_args, pa->ar_length); 1194 pargs_drop(pa); 1195 if (error != 0 || req->newptr == NULL) 1196 return (error); 1197 1198 if (req->newlen + sizeof(struct pargs) > ps_arg_cache_limit) 1199 return (ENOMEM); 1200 newpa = pargs_alloc(req->newlen); 1201 error = SYSCTL_IN(req, newpa->ar_args, req->newlen); 1202 if (error != 0) { 1203 pargs_free(newpa); 1204 return (error); 1205 } 1206 PROC_LOCK(p); 1207 pa = p->p_args; 1208 p->p_args = newpa; 1209 PROC_UNLOCK(p); 1210 pargs_drop(pa); 1211 return (0); 1212 } 1213 1214 /* 1215 * This sysctl allows a process to retrieve the path of the executable for 1216 * itself or another process. 1217 */ 1218 static int 1219 sysctl_kern_proc_pathname(SYSCTL_HANDLER_ARGS) 1220 { 1221 pid_t *pidp = (pid_t *)arg1; 1222 unsigned int arglen = arg2; 1223 struct proc *p; 1224 struct vnode *vp; 1225 char *retbuf, *freebuf; 1226 int error; 1227 1228 if (arglen != 1) 1229 return (EINVAL); 1230 if (*pidp == -1) { /* -1 means this process */ 1231 p = req->td->td_proc; 1232 } else { 1233 p = pfind(*pidp); 1234 if (p == NULL) 1235 return (ESRCH); 1236 if ((error = p_cansee(curthread, p)) != 0) { 1237 PROC_UNLOCK(p); 1238 return (error); 1239 } 1240 } 1241 1242 vp = p->p_textvp; 1243 vref(vp); 1244 if (*pidp != -1) 1245 PROC_UNLOCK(p); 1246 error = vn_fullpath(req->td, vp, &retbuf, &freebuf); 1247 vrele(vp); 1248 if (error) 1249 return (error); 1250 error = SYSCTL_OUT(req, retbuf, strlen(retbuf) + 1); 1251 free(freebuf, M_TEMP); 1252 return (error); 1253 } 1254 1255 static int 1256 sysctl_kern_proc_sv_name(SYSCTL_HANDLER_ARGS) 1257 { 1258 struct proc *p; 1259 char *sv_name; 1260 int *name; 1261 int namelen; 1262 int error; 1263 1264 namelen = arg2; 1265 if (namelen != 1) 1266 return (EINVAL); 1267 1268 name = (int *)arg1; 1269 if ((p = pfind((pid_t)name[0])) == NULL) 1270 return (ESRCH); 1271 if ((error = p_cansee(curthread, p))) { 1272 PROC_UNLOCK(p); 1273 return (error); 1274 } 1275 sv_name = p->p_sysent->sv_name; 1276 PROC_UNLOCK(p); 1277 return (sysctl_handle_string(oidp, sv_name, 0, req)); 1278 } 1279 1280 1281 static SYSCTL_NODE(_kern, KERN_PROC, proc, CTLFLAG_RD, 0, "Process table"); 1282 1283 SYSCTL_PROC(_kern_proc, KERN_PROC_ALL, all, CTLFLAG_RD|CTLTYPE_STRUCT, 1284 0, 0, sysctl_kern_proc, "S,proc", "Return entire process table"); 1285 1286 static SYSCTL_NODE(_kern_proc, KERN_PROC_GID, gid, CTLFLAG_RD, 1287 sysctl_kern_proc, "Process table"); 1288 1289 static SYSCTL_NODE(_kern_proc, KERN_PROC_PGRP, pgrp, CTLFLAG_RD, 1290 sysctl_kern_proc, "Process table"); 1291 1292 static SYSCTL_NODE(_kern_proc, KERN_PROC_RGID, rgid, CTLFLAG_RD, 1293 sysctl_kern_proc, "Process table"); 1294 1295 static SYSCTL_NODE(_kern_proc, KERN_PROC_SESSION, sid, CTLFLAG_RD, 1296 sysctl_kern_proc, "Process table"); 1297 1298 static SYSCTL_NODE(_kern_proc, KERN_PROC_TTY, tty, CTLFLAG_RD, 1299 sysctl_kern_proc, "Process table"); 1300 1301 static SYSCTL_NODE(_kern_proc, KERN_PROC_UID, uid, CTLFLAG_RD, 1302 sysctl_kern_proc, "Process table"); 1303 1304 static SYSCTL_NODE(_kern_proc, KERN_PROC_RUID, ruid, CTLFLAG_RD, 1305 sysctl_kern_proc, "Process table"); 1306 1307 static SYSCTL_NODE(_kern_proc, KERN_PROC_PID, pid, CTLFLAG_RD, 1308 sysctl_kern_proc, "Process table"); 1309 1310 static SYSCTL_NODE(_kern_proc, KERN_PROC_PROC, proc, CTLFLAG_RD, 1311 sysctl_kern_proc, "Return process table, no threads"); 1312 1313 static SYSCTL_NODE(_kern_proc, KERN_PROC_ARGS, args, 1314 CTLFLAG_RW | CTLFLAG_ANYBODY, 1315 sysctl_kern_proc_args, "Process argument list"); 1316 1317 static SYSCTL_NODE(_kern_proc, KERN_PROC_PATHNAME, pathname, CTLFLAG_RD, 1318 sysctl_kern_proc_pathname, "Process executable path"); 1319 1320 static SYSCTL_NODE(_kern_proc, KERN_PROC_SV_NAME, sv_name, CTLFLAG_RD, 1321 sysctl_kern_proc_sv_name, "Process syscall vector name (ABI type)"); 1322 1323 static SYSCTL_NODE(_kern_proc, (KERN_PROC_GID | KERN_PROC_INC_THREAD), gid_td, 1324 CTLFLAG_RD, sysctl_kern_proc, "Process table"); 1325 1326 static SYSCTL_NODE(_kern_proc, (KERN_PROC_PGRP | KERN_PROC_INC_THREAD), pgrp_td, 1327 CTLFLAG_RD, sysctl_kern_proc, "Process table"); 1328 1329 static SYSCTL_NODE(_kern_proc, (KERN_PROC_RGID | KERN_PROC_INC_THREAD), rgid_td, 1330 CTLFLAG_RD, sysctl_kern_proc, "Process table"); 1331 1332 static SYSCTL_NODE(_kern_proc, (KERN_PROC_SESSION | KERN_PROC_INC_THREAD), 1333 sid_td, CTLFLAG_RD, sysctl_kern_proc, "Process table"); 1334 1335 static SYSCTL_NODE(_kern_proc, (KERN_PROC_TTY | KERN_PROC_INC_THREAD), tty_td, 1336 CTLFLAG_RD, sysctl_kern_proc, "Process table"); 1337 1338 static SYSCTL_NODE(_kern_proc, (KERN_PROC_UID | KERN_PROC_INC_THREAD), uid_td, 1339 CTLFLAG_RD, sysctl_kern_proc, "Process table"); 1340 1341 static SYSCTL_NODE(_kern_proc, (KERN_PROC_RUID | KERN_PROC_INC_THREAD), ruid_td, 1342 CTLFLAG_RD, sysctl_kern_proc, "Process table"); 1343 1344 static SYSCTL_NODE(_kern_proc, (KERN_PROC_PID | KERN_PROC_INC_THREAD), pid_td, 1345 CTLFLAG_RD, sysctl_kern_proc, "Process table"); 1346 1347 static SYSCTL_NODE(_kern_proc, (KERN_PROC_PROC | KERN_PROC_INC_THREAD), proc_td, 1348 CTLFLAG_RD, sysctl_kern_proc, "Return process table, no threads"); 1349