kern_proc.c revision 116328
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 * 3. All advertising materials mentioning features or use of this software 14 * must display the following acknowledgement: 15 * This product includes software developed by the University of 16 * California, Berkeley and its contributors. 17 * 4. Neither the name of the University nor the names of its contributors 18 * may be used to endorse or promote products derived from this software 19 * without specific prior written permission. 20 * 21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31 * SUCH DAMAGE. 32 * 33 * @(#)kern_proc.c 8.7 (Berkeley) 2/14/95 34 * $FreeBSD: head/sys/kern/kern_proc.c 116328 2003-06-14 06:20:25Z alc $ 35 */ 36 37#include <sys/cdefs.h> 38__FBSDID("$FreeBSD: head/sys/kern/kern_proc.c 116328 2003-06-14 06:20:25Z alc $"); 39 40#include "opt_ktrace.h" 41#include "opt_kstack_pages.h" 42 43#include <sys/param.h> 44#include <sys/systm.h> 45#include <sys/kernel.h> 46#include <sys/lock.h> 47#include <sys/malloc.h> 48#include <sys/mutex.h> 49#include <sys/proc.h> 50#include <sys/kse.h> 51#include <sys/sched.h> 52#include <sys/smp.h> 53#include <sys/sysctl.h> 54#include <sys/filedesc.h> 55#include <sys/tty.h> 56#include <sys/signalvar.h> 57#include <sys/sx.h> 58#include <sys/user.h> 59#include <sys/jail.h> 60#ifdef KTRACE 61#include <sys/uio.h> 62#include <sys/ktrace.h> 63#endif 64 65#include <vm/vm.h> 66#include <vm/vm_extern.h> 67#include <vm/pmap.h> 68#include <vm/vm_map.h> 69#include <vm/uma.h> 70#include <machine/critical.h> 71 72MALLOC_DEFINE(M_PGRP, "pgrp", "process group header"); 73MALLOC_DEFINE(M_SESSION, "session", "session header"); 74static MALLOC_DEFINE(M_PROC, "proc", "Proc structures"); 75MALLOC_DEFINE(M_SUBPROC, "subproc", "Proc sub-structures"); 76 77static void doenterpgrp(struct proc *, struct pgrp *); 78static void orphanpg(struct pgrp *pg); 79static void pgadjustjobc(struct pgrp *pgrp, int entering); 80static void pgdelete(struct pgrp *); 81static void proc_ctor(void *mem, int size, void *arg); 82static void proc_dtor(void *mem, int size, void *arg); 83static void proc_init(void *mem, int size); 84static void proc_fini(void *mem, int size); 85 86/* 87 * Other process lists 88 */ 89struct pidhashhead *pidhashtbl; 90u_long pidhash; 91struct pgrphashhead *pgrphashtbl; 92u_long pgrphash; 93struct proclist allproc; 94struct proclist zombproc; 95struct sx allproc_lock; 96struct sx proctree_lock; 97struct mtx pargs_ref_lock; 98struct mtx ppeers_lock; 99uma_zone_t proc_zone; 100uma_zone_t ithread_zone; 101 102int kstack_pages = KSTACK_PAGES; 103int uarea_pages = UAREA_PAGES; 104SYSCTL_INT(_kern, OID_AUTO, kstack_pages, CTLFLAG_RD, &kstack_pages, 0, ""); 105SYSCTL_INT(_kern, OID_AUTO, uarea_pages, CTLFLAG_RD, &uarea_pages, 0, ""); 106 107#define RANGEOF(type, start, end) (offsetof(type, end) - offsetof(type, start)) 108 109CTASSERT(sizeof(struct kinfo_proc) == KINFO_PROC_SIZE); 110 111/* 112 * Initialize global process hashing structures. 113 */ 114void 115procinit() 116{ 117 118 sx_init(&allproc_lock, "allproc"); 119 sx_init(&proctree_lock, "proctree"); 120 mtx_init(&pargs_ref_lock, "struct pargs.ref", NULL, MTX_DEF); 121 mtx_init(&ppeers_lock, "p_peers", NULL, MTX_DEF); 122 LIST_INIT(&allproc); 123 LIST_INIT(&zombproc); 124 pidhashtbl = hashinit(maxproc / 4, M_PROC, &pidhash); 125 pgrphashtbl = hashinit(maxproc / 4, M_PROC, &pgrphash); 126 proc_zone = uma_zcreate("PROC", sched_sizeof_proc(), 127 proc_ctor, proc_dtor, proc_init, proc_fini, 128 UMA_ALIGN_PTR, UMA_ZONE_NOFREE); 129 uihashinit(); 130} 131 132/* 133 * Prepare a proc for use. 134 */ 135static void 136proc_ctor(void *mem, int size, void *arg) 137{ 138 struct proc *p; 139 140 p = (struct proc *)mem; 141} 142 143/* 144 * Reclaim a proc after use. 145 */ 146static void 147proc_dtor(void *mem, int size, void *arg) 148{ 149 struct proc *p; 150 struct thread *td; 151 struct ksegrp *kg; 152 struct kse *ke; 153 154 /* INVARIANTS checks go here */ 155 p = (struct proc *)mem; 156 KASSERT((p->p_numthreads == 1), 157 ("bad number of threads in exiting process")); 158 td = FIRST_THREAD_IN_PROC(p); 159 KASSERT((td != NULL), ("proc_dtor: bad thread pointer")); 160 kg = FIRST_KSEGRP_IN_PROC(p); 161 KASSERT((kg != NULL), ("proc_dtor: bad kg pointer")); 162 ke = FIRST_KSE_IN_KSEGRP(kg); 163 KASSERT((ke != NULL), ("proc_dtor: bad ke pointer")); 164 165 /* Dispose of an alternate kstack, if it exists. 166 * XXX What if there are more than one thread in the proc? 167 * The first thread in the proc is special and not 168 * freed, so you gotta do this here. 169 */ 170 if (((p->p_flag & P_KTHREAD) != 0) && (td->td_altkstack != 0)) 171 vm_thread_dispose_altkstack(td); 172 173 /* 174 * We want to make sure we know the initial linkages. 175 * so for now tear them down and remake them. 176 * This is probably un-needed as we can probably rely 177 * on the state coming in here from wait4(). 178 */ 179 proc_linkup(p, kg, ke, td); 180} 181 182/* 183 * Initialize type-stable parts of a proc (when newly created). 184 */ 185static void 186proc_init(void *mem, int size) 187{ 188 struct proc *p; 189 struct thread *td; 190 struct ksegrp *kg; 191 struct kse *ke; 192 193 p = (struct proc *)mem; 194 p->p_sched = (struct p_sched *)&p[1]; 195 vm_proc_new(p); 196 td = thread_alloc(); 197 ke = kse_alloc(); 198 kg = ksegrp_alloc(); 199 proc_linkup(p, kg, ke, td); 200 bzero(&p->p_mtx, sizeof(struct mtx)); 201 mtx_init(&p->p_mtx, "process lock", NULL, MTX_DEF | MTX_DUPOK); 202} 203 204/* 205 * Tear down type-stable parts of a proc (just before being discarded) 206 */ 207static void 208proc_fini(void *mem, int size) 209{ 210 struct proc *p; 211 struct thread *td; 212 struct ksegrp *kg; 213 struct kse *ke; 214 215 p = (struct proc *)mem; 216 KASSERT((p->p_numthreads == 1), 217 ("bad number of threads in freeing process")); 218 td = FIRST_THREAD_IN_PROC(p); 219 KASSERT((td != NULL), ("proc_dtor: bad thread pointer")); 220 kg = FIRST_KSEGRP_IN_PROC(p); 221 KASSERT((kg != NULL), ("proc_dtor: bad kg pointer")); 222 ke = FIRST_KSE_IN_KSEGRP(kg); 223 KASSERT((ke != NULL), ("proc_dtor: bad ke pointer")); 224 vm_proc_dispose(p); 225 thread_free(td); 226 ksegrp_free(kg); 227 kse_free(ke); 228 mtx_destroy(&p->p_mtx); 229} 230 231/* 232 * Is p an inferior of the current process? 233 */ 234int 235inferior(p) 236 register struct proc *p; 237{ 238 239 sx_assert(&proctree_lock, SX_LOCKED); 240 for (; p != curproc; p = p->p_pptr) 241 if (p->p_pid == 0) 242 return (0); 243 return (1); 244} 245 246/* 247 * Locate a process by number 248 */ 249struct proc * 250pfind(pid) 251 register pid_t pid; 252{ 253 register struct proc *p; 254 255 sx_slock(&allproc_lock); 256 LIST_FOREACH(p, PIDHASH(pid), p_hash) 257 if (p->p_pid == pid) { 258 PROC_LOCK(p); 259 break; 260 } 261 sx_sunlock(&allproc_lock); 262 return (p); 263} 264 265/* 266 * Locate a process group by number. 267 * The caller must hold proctree_lock. 268 */ 269struct pgrp * 270pgfind(pgid) 271 register pid_t pgid; 272{ 273 register struct pgrp *pgrp; 274 275 sx_assert(&proctree_lock, SX_LOCKED); 276 277 LIST_FOREACH(pgrp, PGRPHASH(pgid), pg_hash) { 278 if (pgrp->pg_id == pgid) { 279 PGRP_LOCK(pgrp); 280 return (pgrp); 281 } 282 } 283 return (NULL); 284} 285 286/* 287 * Create a new process group. 288 * pgid must be equal to the pid of p. 289 * Begin a new session if required. 290 */ 291int 292enterpgrp(p, pgid, pgrp, sess) 293 register struct proc *p; 294 pid_t pgid; 295 struct pgrp *pgrp; 296 struct session *sess; 297{ 298 struct pgrp *pgrp2; 299 300 sx_assert(&proctree_lock, SX_XLOCKED); 301 302 KASSERT(pgrp != NULL, ("enterpgrp: pgrp == NULL")); 303 KASSERT(p->p_pid == pgid, 304 ("enterpgrp: new pgrp and pid != pgid")); 305 306 pgrp2 = pgfind(pgid); 307 308 KASSERT(pgrp2 == NULL, 309 ("enterpgrp: pgrp with pgid exists")); 310 KASSERT(!SESS_LEADER(p), 311 ("enterpgrp: session leader attempted setpgrp")); 312 313 mtx_init(&pgrp->pg_mtx, "process group", NULL, MTX_DEF | MTX_DUPOK); 314 315 if (sess != NULL) { 316 /* 317 * new session 318 */ 319 mtx_init(&sess->s_mtx, "session", NULL, MTX_DEF); 320 PROC_LOCK(p); 321 p->p_flag &= ~P_CONTROLT; 322 PROC_UNLOCK(p); 323 PGRP_LOCK(pgrp); 324 sess->s_leader = p; 325 sess->s_sid = p->p_pid; 326 sess->s_count = 1; 327 sess->s_ttyvp = NULL; 328 sess->s_ttyp = NULL; 329 bcopy(p->p_session->s_login, sess->s_login, 330 sizeof(sess->s_login)); 331 pgrp->pg_session = sess; 332 KASSERT(p == curproc, 333 ("enterpgrp: mksession and p != curproc")); 334 } else { 335 pgrp->pg_session = p->p_session; 336 SESS_LOCK(pgrp->pg_session); 337 pgrp->pg_session->s_count++; 338 SESS_UNLOCK(pgrp->pg_session); 339 PGRP_LOCK(pgrp); 340 } 341 pgrp->pg_id = pgid; 342 LIST_INIT(&pgrp->pg_members); 343 344 /* 345 * As we have an exclusive lock of proctree_lock, 346 * this should not deadlock. 347 */ 348 LIST_INSERT_HEAD(PGRPHASH(pgid), pgrp, pg_hash); 349 pgrp->pg_jobc = 0; 350 SLIST_INIT(&pgrp->pg_sigiolst); 351 PGRP_UNLOCK(pgrp); 352 353 doenterpgrp(p, pgrp); 354 355 return (0); 356} 357 358/* 359 * Move p to an existing process group 360 */ 361int 362enterthispgrp(p, pgrp) 363 register struct proc *p; 364 struct pgrp *pgrp; 365{ 366 367 sx_assert(&proctree_lock, SX_XLOCKED); 368 PROC_LOCK_ASSERT(p, MA_NOTOWNED); 369 PGRP_LOCK_ASSERT(pgrp, MA_NOTOWNED); 370 PGRP_LOCK_ASSERT(p->p_pgrp, MA_NOTOWNED); 371 SESS_LOCK_ASSERT(p->p_session, MA_NOTOWNED); 372 KASSERT(pgrp->pg_session == p->p_session, 373 ("%s: pgrp's session %p, p->p_session %p.\n", 374 __func__, 375 pgrp->pg_session, 376 p->p_session)); 377 KASSERT(pgrp != p->p_pgrp, 378 ("%s: p belongs to pgrp.", __func__)); 379 380 doenterpgrp(p, pgrp); 381 382 return (0); 383} 384 385/* 386 * Move p to a process group 387 */ 388static void 389doenterpgrp(p, pgrp) 390 struct proc *p; 391 struct pgrp *pgrp; 392{ 393 struct pgrp *savepgrp; 394 395 sx_assert(&proctree_lock, SX_XLOCKED); 396 PROC_LOCK_ASSERT(p, MA_NOTOWNED); 397 PGRP_LOCK_ASSERT(pgrp, MA_NOTOWNED); 398 PGRP_LOCK_ASSERT(p->p_pgrp, MA_NOTOWNED); 399 SESS_LOCK_ASSERT(p->p_session, MA_NOTOWNED); 400 401 savepgrp = p->p_pgrp; 402 403 /* 404 * Adjust eligibility of affected pgrps to participate in job control. 405 * Increment eligibility counts before decrementing, otherwise we 406 * could reach 0 spuriously during the first call. 407 */ 408 fixjobc(p, pgrp, 1); 409 fixjobc(p, p->p_pgrp, 0); 410 411 PGRP_LOCK(pgrp); 412 PGRP_LOCK(savepgrp); 413 PROC_LOCK(p); 414 LIST_REMOVE(p, p_pglist); 415 p->p_pgrp = pgrp; 416 PROC_UNLOCK(p); 417 LIST_INSERT_HEAD(&pgrp->pg_members, p, p_pglist); 418 PGRP_UNLOCK(savepgrp); 419 PGRP_UNLOCK(pgrp); 420 if (LIST_EMPTY(&savepgrp->pg_members)) 421 pgdelete(savepgrp); 422} 423 424/* 425 * remove process from process group 426 */ 427int 428leavepgrp(p) 429 register struct proc *p; 430{ 431 struct pgrp *savepgrp; 432 433 sx_assert(&proctree_lock, SX_XLOCKED); 434 savepgrp = p->p_pgrp; 435 PGRP_LOCK(savepgrp); 436 PROC_LOCK(p); 437 LIST_REMOVE(p, p_pglist); 438 p->p_pgrp = NULL; 439 PROC_UNLOCK(p); 440 PGRP_UNLOCK(savepgrp); 441 if (LIST_EMPTY(&savepgrp->pg_members)) 442 pgdelete(savepgrp); 443 return (0); 444} 445 446/* 447 * delete a process group 448 */ 449static void 450pgdelete(pgrp) 451 register struct pgrp *pgrp; 452{ 453 struct session *savesess; 454 455 sx_assert(&proctree_lock, SX_XLOCKED); 456 PGRP_LOCK_ASSERT(pgrp, MA_NOTOWNED); 457 SESS_LOCK_ASSERT(pgrp->pg_session, MA_NOTOWNED); 458 459 /* 460 * Reset any sigio structures pointing to us as a result of 461 * F_SETOWN with our pgid. 462 */ 463 funsetownlst(&pgrp->pg_sigiolst); 464 465 PGRP_LOCK(pgrp); 466 if (pgrp->pg_session->s_ttyp != NULL && 467 pgrp->pg_session->s_ttyp->t_pgrp == pgrp) 468 pgrp->pg_session->s_ttyp->t_pgrp = NULL; 469 LIST_REMOVE(pgrp, pg_hash); 470 savesess = pgrp->pg_session; 471 SESS_LOCK(savesess); 472 savesess->s_count--; 473 SESS_UNLOCK(savesess); 474 PGRP_UNLOCK(pgrp); 475 if (savesess->s_count == 0) { 476 mtx_destroy(&savesess->s_mtx); 477 FREE(pgrp->pg_session, M_SESSION); 478 } 479 mtx_destroy(&pgrp->pg_mtx); 480 FREE(pgrp, M_PGRP); 481} 482 483static void 484pgadjustjobc(pgrp, entering) 485 struct pgrp *pgrp; 486 int entering; 487{ 488 489 PGRP_LOCK(pgrp); 490 if (entering) 491 pgrp->pg_jobc++; 492 else { 493 --pgrp->pg_jobc; 494 if (pgrp->pg_jobc == 0) 495 orphanpg(pgrp); 496 } 497 PGRP_UNLOCK(pgrp); 498} 499 500/* 501 * Adjust pgrp jobc counters when specified process changes process group. 502 * We count the number of processes in each process group that "qualify" 503 * the group for terminal job control (those with a parent in a different 504 * process group of the same session). If that count reaches zero, the 505 * process group becomes orphaned. Check both the specified process' 506 * process group and that of its children. 507 * entering == 0 => p is leaving specified group. 508 * entering == 1 => p is entering specified group. 509 */ 510void 511fixjobc(p, pgrp, entering) 512 register struct proc *p; 513 register struct pgrp *pgrp; 514 int entering; 515{ 516 register struct pgrp *hispgrp; 517 register struct session *mysession; 518 519 sx_assert(&proctree_lock, SX_LOCKED); 520 PROC_LOCK_ASSERT(p, MA_NOTOWNED); 521 PGRP_LOCK_ASSERT(pgrp, MA_NOTOWNED); 522 SESS_LOCK_ASSERT(pgrp->pg_session, MA_NOTOWNED); 523 524 /* 525 * Check p's parent to see whether p qualifies its own process 526 * group; if so, adjust count for p's process group. 527 */ 528 mysession = pgrp->pg_session; 529 if ((hispgrp = p->p_pptr->p_pgrp) != pgrp && 530 hispgrp->pg_session == mysession) 531 pgadjustjobc(pgrp, entering); 532 533 /* 534 * Check this process' children to see whether they qualify 535 * their process groups; if so, adjust counts for children's 536 * process groups. 537 */ 538 LIST_FOREACH(p, &p->p_children, p_sibling) { 539 hispgrp = p->p_pgrp; 540 if (hispgrp == pgrp || 541 hispgrp->pg_session != mysession) 542 continue; 543 PROC_LOCK(p); 544 if (p->p_state == PRS_ZOMBIE) { 545 PROC_UNLOCK(p); 546 continue; 547 } 548 PROC_UNLOCK(p); 549 pgadjustjobc(hispgrp, entering); 550 } 551} 552 553/* 554 * A process group has become orphaned; 555 * if there are any stopped processes in the group, 556 * hang-up all process in that group. 557 */ 558static void 559orphanpg(pg) 560 struct pgrp *pg; 561{ 562 register struct proc *p; 563 564 PGRP_LOCK_ASSERT(pg, MA_OWNED); 565 566 LIST_FOREACH(p, &pg->pg_members, p_pglist) { 567 PROC_LOCK(p); 568 if (P_SHOULDSTOP(p)) { 569 PROC_UNLOCK(p); 570 LIST_FOREACH(p, &pg->pg_members, p_pglist) { 571 PROC_LOCK(p); 572 psignal(p, SIGHUP); 573 psignal(p, SIGCONT); 574 PROC_UNLOCK(p); 575 } 576 return; 577 } 578 PROC_UNLOCK(p); 579 } 580} 581 582#include "opt_ddb.h" 583#ifdef DDB 584#include <ddb/ddb.h> 585 586DB_SHOW_COMMAND(pgrpdump, pgrpdump) 587{ 588 register struct pgrp *pgrp; 589 register struct proc *p; 590 register int i; 591 592 for (i = 0; i <= pgrphash; i++) { 593 if (!LIST_EMPTY(&pgrphashtbl[i])) { 594 printf("\tindx %d\n", i); 595 LIST_FOREACH(pgrp, &pgrphashtbl[i], pg_hash) { 596 printf( 597 "\tpgrp %p, pgid %ld, sess %p, sesscnt %d, mem %p\n", 598 (void *)pgrp, (long)pgrp->pg_id, 599 (void *)pgrp->pg_session, 600 pgrp->pg_session->s_count, 601 (void *)LIST_FIRST(&pgrp->pg_members)); 602 LIST_FOREACH(p, &pgrp->pg_members, p_pglist) { 603 printf("\t\tpid %ld addr %p pgrp %p\n", 604 (long)p->p_pid, (void *)p, 605 (void *)p->p_pgrp); 606 } 607 } 608 } 609 } 610} 611#endif /* DDB */ 612void 613fill_kinfo_thread(struct thread *td, struct kinfo_proc *kp); 614 615/* 616 * Fill in a kinfo_proc structure for the specified process. 617 * Must be called with the target process locked. 618 */ 619void 620fill_kinfo_proc(struct proc *p, struct kinfo_proc *kp) 621{ 622 fill_kinfo_thread(FIRST_THREAD_IN_PROC(p), kp); 623} 624 625void 626fill_kinfo_thread(struct thread *td, struct kinfo_proc *kp) 627{ 628 struct proc *p; 629 struct thread *td0; 630 struct kse *ke; 631 struct ksegrp *kg; 632 struct tty *tp; 633 struct session *sp; 634 struct timeval tv; 635 struct sigacts *ps; 636 637 p = td->td_proc; 638 639 bzero(kp, sizeof(*kp)); 640 641 kp->ki_structsize = sizeof(*kp); 642 kp->ki_paddr = p; 643 PROC_LOCK_ASSERT(p, MA_OWNED); 644 kp->ki_addr =/* p->p_addr; */0; /* XXXKSE */ 645 kp->ki_args = p->p_args; 646 kp->ki_textvp = p->p_textvp; 647#ifdef KTRACE 648 kp->ki_tracep = p->p_tracevp; 649 mtx_lock(&ktrace_mtx); 650 kp->ki_traceflag = p->p_traceflag; 651 mtx_unlock(&ktrace_mtx); 652#endif 653 kp->ki_fd = p->p_fd; 654 kp->ki_vmspace = p->p_vmspace; 655 if (p->p_ucred) { 656 kp->ki_uid = p->p_ucred->cr_uid; 657 kp->ki_ruid = p->p_ucred->cr_ruid; 658 kp->ki_svuid = p->p_ucred->cr_svuid; 659 /* XXX bde doesn't like KI_NGROUPS */ 660 kp->ki_ngroups = min(p->p_ucred->cr_ngroups, KI_NGROUPS); 661 bcopy(p->p_ucred->cr_groups, kp->ki_groups, 662 kp->ki_ngroups * sizeof(gid_t)); 663 kp->ki_rgid = p->p_ucred->cr_rgid; 664 kp->ki_svgid = p->p_ucred->cr_svgid; 665 } 666 if (p->p_sigacts) { 667 ps = p->p_sigacts; 668 mtx_lock(&ps->ps_mtx); 669 kp->ki_sigignore = ps->ps_sigignore; 670 kp->ki_sigcatch = ps->ps_sigcatch; 671 mtx_unlock(&ps->ps_mtx); 672 } 673 mtx_lock_spin(&sched_lock); 674 if (p->p_state != PRS_NEW && 675 p->p_state != PRS_ZOMBIE && 676 p->p_vmspace != NULL) { 677 struct vmspace *vm = p->p_vmspace; 678 679 kp->ki_size = vm->vm_map.size; 680 kp->ki_rssize = vmspace_resident_count(vm); /*XXX*/ 681 if (p->p_sflag & PS_INMEM) 682 kp->ki_rssize += UAREA_PAGES; 683 FOREACH_THREAD_IN_PROC(p, td0) { 684 if (!TD_IS_SWAPPED(td0)) 685 kp->ki_rssize += td0->td_kstack_pages; 686 if (td0->td_altkstack_obj != NULL) 687 kp->ki_rssize += td0->td_altkstack_pages; 688 } 689 kp->ki_swrss = vm->vm_swrss; 690 kp->ki_tsize = vm->vm_tsize; 691 kp->ki_dsize = vm->vm_dsize; 692 kp->ki_ssize = vm->vm_ssize; 693 } 694 if ((p->p_sflag & PS_INMEM) && p->p_stats) { 695 kp->ki_start = p->p_stats->p_start; 696 timevaladd(&kp->ki_start, &boottime); 697 kp->ki_rusage = p->p_stats->p_ru; 698 kp->ki_childtime.tv_sec = p->p_stats->p_cru.ru_utime.tv_sec + 699 p->p_stats->p_cru.ru_stime.tv_sec; 700 kp->ki_childtime.tv_usec = p->p_stats->p_cru.ru_utime.tv_usec + 701 p->p_stats->p_cru.ru_stime.tv_usec; 702 } 703 if (p->p_state != PRS_ZOMBIE) { 704#if 0 705 if (td == NULL) { 706 /* XXXKSE: This should never happen. */ 707 printf("fill_kinfo_proc(): pid %d has no threads!\n", 708 p->p_pid); 709 mtx_unlock_spin(&sched_lock); 710 return; 711 } 712#endif 713 if (td->td_wmesg != NULL) { 714 strlcpy(kp->ki_wmesg, td->td_wmesg, 715 sizeof(kp->ki_wmesg)); 716 } 717 if (TD_ON_LOCK(td)) { 718 kp->ki_kiflag |= KI_LOCKBLOCK; 719 strlcpy(kp->ki_lockname, td->td_lockname, 720 sizeof(kp->ki_lockname)); 721 } 722 723 if (p->p_state == PRS_NORMAL) { /* XXXKSE very approximate */ 724 if (TD_ON_RUNQ(td) || 725 TD_CAN_RUN(td) || 726 TD_IS_RUNNING(td)) { 727 kp->ki_stat = SRUN; 728 } else if (P_SHOULDSTOP(p)) { 729 kp->ki_stat = SSTOP; 730 } else if (TD_IS_SLEEPING(td)) { 731 kp->ki_stat = SSLEEP; 732 } else if (TD_ON_LOCK(td)) { 733 kp->ki_stat = SLOCK; 734 } else { 735 kp->ki_stat = SWAIT; 736 } 737 } else { 738 kp->ki_stat = SIDL; 739 } 740 741 kp->ki_sflag = p->p_sflag; 742 kp->ki_swtime = p->p_swtime; 743 kp->ki_pid = p->p_pid; 744 kg = td->td_ksegrp; 745 ke = td->td_kse; 746 bintime2timeval(&p->p_runtime, &tv); 747 kp->ki_runtime = 748 tv.tv_sec * (u_int64_t)1000000 + tv.tv_usec; 749 750 /* things in the KSE GROUP */ 751 kp->ki_estcpu = kg->kg_estcpu; 752 kp->ki_slptime = kg->kg_slptime; 753 kp->ki_pri.pri_user = kg->kg_user_pri; 754 kp->ki_pri.pri_class = kg->kg_pri_class; 755 kp->ki_nice = kg->kg_nice; 756 757 /* Things in the thread */ 758 kp->ki_wchan = td->td_wchan; 759 kp->ki_pri.pri_level = td->td_priority; 760 kp->ki_pri.pri_native = td->td_base_pri; 761 kp->ki_lastcpu = td->td_lastcpu; 762 kp->ki_oncpu = td->td_oncpu; 763 kp->ki_tdflags = td->td_flags; 764 kp->ki_pcb = td->td_pcb; 765 kp->ki_kstack = (void *)td->td_kstack; 766 767 /* Things in the kse */ 768 769 if (ke) { 770 kp->ki_rqindex = ke->ke_rqindex; 771 kp->ki_pctcpu = sched_pctcpu(ke); 772 } else { 773 kp->ki_rqindex = 0; 774 kp->ki_pctcpu = 0; 775 } 776 777 } else { 778 kp->ki_stat = SZOMB; 779 } 780 mtx_unlock_spin(&sched_lock); 781 sp = NULL; 782 tp = NULL; 783 if (p->p_pgrp) { 784 kp->ki_pgid = p->p_pgrp->pg_id; 785 kp->ki_jobc = p->p_pgrp->pg_jobc; 786 sp = p->p_pgrp->pg_session; 787 788 if (sp != NULL) { 789 kp->ki_sid = sp->s_sid; 790 SESS_LOCK(sp); 791 strlcpy(kp->ki_login, sp->s_login, 792 sizeof(kp->ki_login)); 793 if (sp->s_ttyvp) 794 kp->ki_kiflag |= KI_CTTY; 795 if (SESS_LEADER(p)) 796 kp->ki_kiflag |= KI_SLEADER; 797 tp = sp->s_ttyp; 798 SESS_UNLOCK(sp); 799 } 800 } 801 if ((p->p_flag & P_CONTROLT) && tp != NULL) { 802 kp->ki_tdev = dev2udev(tp->t_dev); 803 kp->ki_tpgid = tp->t_pgrp ? tp->t_pgrp->pg_id : NO_PID; 804 if (tp->t_session) 805 kp->ki_tsid = tp->t_session->s_sid; 806 } else 807 kp->ki_tdev = NOUDEV; 808 if (p->p_comm[0] != '\0') { 809 strlcpy(kp->ki_comm, p->p_comm, sizeof(kp->ki_comm)); 810 strlcpy(kp->ki_ocomm, p->p_comm, sizeof(kp->ki_ocomm)); 811 } 812 kp->ki_siglist = p->p_siglist; 813 SIGSETOR(kp->ki_siglist, td->td_siglist); 814 kp->ki_sigmask = td->td_sigmask; 815 kp->ki_xstat = p->p_xstat; 816 kp->ki_acflag = p->p_acflag; 817 kp->ki_flag = p->p_flag; 818 /* If jailed(p->p_ucred), emulate the old P_JAILED flag. */ 819 if (jailed(p->p_ucred)) 820 kp->ki_flag |= P_JAILED; 821 kp->ki_lock = p->p_lock; 822 if (p->p_pptr) 823 kp->ki_ppid = p->p_pptr->p_pid; 824} 825 826/* 827 * Locate a zombie process by number 828 */ 829struct proc * 830zpfind(pid_t pid) 831{ 832 struct proc *p; 833 834 sx_slock(&allproc_lock); 835 LIST_FOREACH(p, &zombproc, p_list) 836 if (p->p_pid == pid) { 837 PROC_LOCK(p); 838 break; 839 } 840 sx_sunlock(&allproc_lock); 841 return (p); 842} 843 844#define KERN_PROC_ZOMBMASK 0x3 845#define KERN_PROC_NOTHREADS 0x4 846 847/* 848 * Must be called with the process locked and will return with it unlocked. 849 */ 850static int 851sysctl_out_proc(struct proc *p, struct sysctl_req *req, int flags) 852{ 853 struct thread *td; 854 struct kinfo_proc kinfo_proc; 855 int error = 0; 856 struct proc *np; 857 pid_t pid = p->p_pid; 858 859 PROC_LOCK_ASSERT(p, MA_OWNED); 860 861 if (flags & KERN_PROC_NOTHREADS) { 862 fill_kinfo_proc(p, &kinfo_proc); 863 error = SYSCTL_OUT(req, (caddr_t)&kinfo_proc, 864 sizeof(kinfo_proc)); 865 } else { 866 _PHOLD(p); 867 FOREACH_THREAD_IN_PROC(p, td) { 868 fill_kinfo_thread(td, &kinfo_proc); 869 PROC_UNLOCK(p); 870 error = SYSCTL_OUT(req, (caddr_t)&kinfo_proc, 871 sizeof(kinfo_proc)); 872 PROC_LOCK(p); 873 if (error) 874 break; 875 } 876 _PRELE(p); 877 } 878 PROC_UNLOCK(p); 879 if (error) 880 return (error); 881 if (flags & KERN_PROC_ZOMBMASK) 882 np = zpfind(pid); 883 else { 884 if (pid == 0) 885 return (0); 886 np = pfind(pid); 887 } 888 if (np == NULL) 889 return EAGAIN; 890 if (np != p) { 891 PROC_UNLOCK(np); 892 return EAGAIN; 893 } 894 PROC_UNLOCK(np); 895 return (0); 896} 897 898static int 899sysctl_kern_proc(SYSCTL_HANDLER_ARGS) 900{ 901 int *name = (int*) arg1; 902 u_int namelen = arg2; 903 struct proc *p; 904 int flags, doingzomb; 905 int error = 0; 906 907 if (oidp->oid_number == KERN_PROC_PID) { 908 if (namelen != 1) 909 return (EINVAL); 910 p = pfind((pid_t)name[0]); 911 if (!p) 912 return (0); 913 if (p_cansee(curthread, p)) { 914 PROC_UNLOCK(p); 915 return (0); 916 } 917 error = sysctl_out_proc(p, req, KERN_PROC_NOTHREADS); 918 return (error); 919 } 920 if (oidp->oid_number == KERN_PROC_ALL && !namelen) 921 ; 922 else if (oidp->oid_number != KERN_PROC_ALL && namelen == 1) 923 ; 924 else 925 return (EINVAL); 926 927 if (!req->oldptr) { 928 /* overestimate by 5 procs */ 929 error = SYSCTL_OUT(req, 0, sizeof (struct kinfo_proc) * 5); 930 if (error) 931 return (error); 932 } 933 sysctl_wire_old_buffer(req, 0); 934 sx_slock(&allproc_lock); 935 for (doingzomb=0 ; doingzomb < 2 ; doingzomb++) { 936 if (!doingzomb) 937 p = LIST_FIRST(&allproc); 938 else 939 p = LIST_FIRST(&zombproc); 940 for (; p != 0; p = LIST_NEXT(p, p_list)) { 941 /* 942 * Skip embryonic processes. 943 */ 944 mtx_lock_spin(&sched_lock); 945 if (p->p_state == PRS_NEW) { 946 mtx_unlock_spin(&sched_lock); 947 continue; 948 } 949 mtx_unlock_spin(&sched_lock); 950 PROC_LOCK(p); 951 /* 952 * Show a user only appropriate processes. 953 */ 954 if (p_cansee(curthread, p)) { 955 PROC_UNLOCK(p); 956 continue; 957 } 958 flags = 0; 959 /* 960 * TODO - make more efficient (see notes below). 961 * do by session. 962 */ 963 switch (oidp->oid_number) { 964 965 case KERN_PROC_PGRP: 966 /* could do this by traversing pgrp */ 967 if (p->p_pgrp == NULL || 968 p->p_pgrp->pg_id != (pid_t)name[0]) { 969 PROC_UNLOCK(p); 970 continue; 971 } 972 break; 973 974 case KERN_PROC_TTY: 975 if ((p->p_flag & P_CONTROLT) == 0 || 976 p->p_session == NULL) { 977 PROC_UNLOCK(p); 978 continue; 979 } 980 SESS_LOCK(p->p_session); 981 if (p->p_session->s_ttyp == NULL || 982 dev2udev(p->p_session->s_ttyp->t_dev) != 983 (udev_t)name[0]) { 984 SESS_UNLOCK(p->p_session); 985 PROC_UNLOCK(p); 986 continue; 987 } 988 SESS_UNLOCK(p->p_session); 989 break; 990 991 case KERN_PROC_UID: 992 if (p->p_ucred == NULL || 993 p->p_ucred->cr_uid != (uid_t)name[0]) { 994 PROC_UNLOCK(p); 995 continue; 996 } 997 break; 998 999 case KERN_PROC_RUID: 1000 if (p->p_ucred == NULL || 1001 p->p_ucred->cr_ruid != (uid_t)name[0]) { 1002 PROC_UNLOCK(p); 1003 continue; 1004 } 1005 break; 1006 1007 case KERN_PROC_PROC: 1008 flags |= KERN_PROC_NOTHREADS; 1009 break; 1010 1011 default: 1012 break; 1013 1014 } 1015 1016 error = sysctl_out_proc(p, req, flags | doingzomb); 1017 if (error) { 1018 sx_sunlock(&allproc_lock); 1019 return (error); 1020 } 1021 } 1022 } 1023 sx_sunlock(&allproc_lock); 1024 return (0); 1025} 1026 1027struct pargs * 1028pargs_alloc(int len) 1029{ 1030 struct pargs *pa; 1031 1032 MALLOC(pa, struct pargs *, sizeof(struct pargs) + len, M_PARGS, 1033 M_WAITOK); 1034 pa->ar_ref = 1; 1035 pa->ar_length = len; 1036 return (pa); 1037} 1038 1039void 1040pargs_free(struct pargs *pa) 1041{ 1042 1043 FREE(pa, M_PARGS); 1044} 1045 1046void 1047pargs_hold(struct pargs *pa) 1048{ 1049 1050 if (pa == NULL) 1051 return; 1052 PARGS_LOCK(pa); 1053 pa->ar_ref++; 1054 PARGS_UNLOCK(pa); 1055} 1056 1057void 1058pargs_drop(struct pargs *pa) 1059{ 1060 1061 if (pa == NULL) 1062 return; 1063 PARGS_LOCK(pa); 1064 if (--pa->ar_ref == 0) { 1065 PARGS_UNLOCK(pa); 1066 pargs_free(pa); 1067 } else 1068 PARGS_UNLOCK(pa); 1069} 1070 1071/* 1072 * This sysctl allows a process to retrieve the argument list or process 1073 * title for another process without groping around in the address space 1074 * of the other process. It also allow a process to set its own "process 1075 * title to a string of its own choice. 1076 */ 1077static int 1078sysctl_kern_proc_args(SYSCTL_HANDLER_ARGS) 1079{ 1080 int *name = (int*) arg1; 1081 u_int namelen = arg2; 1082 struct pargs *newpa, *pa; 1083 struct proc *p; 1084 int error = 0; 1085 1086 if (namelen != 1) 1087 return (EINVAL); 1088 1089 p = pfind((pid_t)name[0]); 1090 if (!p) 1091 return (0); 1092 1093 if ((!ps_argsopen) && p_cansee(curthread, p)) { 1094 PROC_UNLOCK(p); 1095 return (0); 1096 } 1097 1098 if (req->newptr && curproc != p) { 1099 PROC_UNLOCK(p); 1100 return (EPERM); 1101 } 1102 1103 pa = p->p_args; 1104 pargs_hold(pa); 1105 PROC_UNLOCK(p); 1106 if (req->oldptr != NULL && pa != NULL) 1107 error = SYSCTL_OUT(req, pa->ar_args, pa->ar_length); 1108 pargs_drop(pa); 1109 if (error != 0 || req->newptr == NULL) 1110 return (error); 1111 1112 if (req->newlen + sizeof(struct pargs) > ps_arg_cache_limit) 1113 return (ENOMEM); 1114 newpa = pargs_alloc(req->newlen); 1115 error = SYSCTL_IN(req, newpa->ar_args, req->newlen); 1116 if (error != 0) { 1117 pargs_free(newpa); 1118 return (error); 1119 } 1120 PROC_LOCK(p); 1121 pa = p->p_args; 1122 p->p_args = newpa; 1123 PROC_UNLOCK(p); 1124 pargs_drop(pa); 1125 return (0); 1126} 1127 1128SYSCTL_NODE(_kern, KERN_PROC, proc, CTLFLAG_RD, 0, "Process table"); 1129 1130SYSCTL_PROC(_kern_proc, KERN_PROC_ALL, all, CTLFLAG_RD|CTLTYPE_STRUCT, 1131 0, 0, sysctl_kern_proc, "S,proc", "Return entire process table"); 1132 1133SYSCTL_NODE(_kern_proc, KERN_PROC_PGRP, pgrp, CTLFLAG_RD, 1134 sysctl_kern_proc, "Process table"); 1135 1136SYSCTL_NODE(_kern_proc, KERN_PROC_TTY, tty, CTLFLAG_RD, 1137 sysctl_kern_proc, "Process table"); 1138 1139SYSCTL_NODE(_kern_proc, KERN_PROC_UID, uid, CTLFLAG_RD, 1140 sysctl_kern_proc, "Process table"); 1141 1142SYSCTL_NODE(_kern_proc, KERN_PROC_RUID, ruid, CTLFLAG_RD, 1143 sysctl_kern_proc, "Process table"); 1144 1145SYSCTL_NODE(_kern_proc, KERN_PROC_PID, pid, CTLFLAG_RD, 1146 sysctl_kern_proc, "Process table"); 1147 1148SYSCTL_NODE(_kern_proc, KERN_PROC_PROC, proc, CTLFLAG_RD, 1149 sysctl_kern_proc, "Return process table, no threads"); 1150 1151SYSCTL_NODE(_kern_proc, KERN_PROC_ARGS, args, CTLFLAG_RW | CTLFLAG_ANYBODY, 1152 sysctl_kern_proc_args, "Process argument list"); 1153