4 * Copyright (c) 1982, 1986, 1989, 1991, 1993
5 * The Regents of the University of California. All rights reserved.
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 * 3. Neither the name of the University nor the names of its contributors
16 * may be used to endorse or promote products derived from this software
17 * without specific prior written permission.
19 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 * @(#)kern_proc.c 8.7 (Berkeley) 2/14/95
32 * $FreeBSD: src/sys/kern/kern_proc.c,v 1.63.2.9 2003/05/08 07:47:16 kbyanc Exp $
35 #include <sys/param.h>
36 #include <sys/systm.h>
37 #include <sys/kernel.h>
38 #include <sys/sysctl.h>
39 #include <sys/malloc.h>
41 #include <sys/vnode.h>
43 #include <sys/filedesc.h>
45 #include <sys/dsched.h>
46 #include <sys/signalvar.h>
47 #include <sys/spinlock.h>
51 #include <vm/vm_map.h>
53 #include <machine/smp.h>
55 #include <sys/refcount.h>
56 #include <sys/spinlock2.h>
57 #include <sys/mplock2.h>
59 static MALLOC_DEFINE(M_PGRP, "pgrp", "process group header");
60 MALLOC_DEFINE(M_SESSION, "session", "session header");
61 MALLOC_DEFINE(M_PROC, "proc", "Proc structures");
62 MALLOC_DEFINE(M_LWP, "lwp", "lwp structures");
63 MALLOC_DEFINE(M_SUBPROC, "subproc", "Proc sub-structures");
65 int ps_showallprocs = 1;
66 static int ps_showallthreads = 1;
67 SYSCTL_INT(_security, OID_AUTO, ps_showallprocs, CTLFLAG_RW,
69 "Unprivileged processes can see processes with different UID/GID");
70 SYSCTL_INT(_security, OID_AUTO, ps_showallthreads, CTLFLAG_RW,
71 &ps_showallthreads, 0,
72 "Unprivileged processes can see kernel threads");
74 static void pgdelete(struct pgrp *);
75 static void orphanpg(struct pgrp *pg);
76 static pid_t proc_getnewpid_locked(int random_offset);
81 struct pidhashhead *pidhashtbl;
83 struct pgrphashhead *pgrphashtbl;
85 struct proclist allproc;
86 struct proclist zombproc;
89 * Random component to nextpid generation. We mix in a random factor to make
90 * it a little harder to predict. We sanity check the modulus value to avoid
91 * doing it in critical paths. Don't let it be too small or we pointlessly
92 * waste randomness entropy, and don't let it be impossibly large. Using a
93 * modulus that is too big causes a LOT more process table scans and slows
94 * down fork processing as the pidchecked caching is defeated.
96 static int randompid = 0;
102 sysctl_kern_randompid(SYSCTL_HANDLER_ARGS)
107 error = sysctl_handle_int(oidp, &pid, 0, req);
108 if (error || !req->newptr)
110 if (pid < 0 || pid > PID_MAX - 100) /* out of range */
112 else if (pid < 2) /* NOP */
114 else if (pid < 100) /* Make it reasonable */
120 SYSCTL_PROC(_kern, OID_AUTO, randompid, CTLTYPE_INT|CTLFLAG_RW,
121 0, 0, sysctl_kern_randompid, "I", "Random PID modulus");
124 * Initialize global process hashing structures.
126 * Called from the low level boot code only.
132 LIST_INIT(&zombproc);
134 pidhashtbl = hashinit(maxproc / 4, M_PROC, &pidhash);
135 pgrphashtbl = hashinit(maxproc / 4, M_PROC, &pgrphash);
140 * Process hold/release support functions. These functions must be MPSAFE.
141 * Called via the PHOLD(), PRELE(), and PSTALL() macros.
143 * p->p_lock is a simple hold count with a waiting interlock. No wakeup()
144 * is issued unless someone is actually waiting for the process.
146 * Most holds are short-term, allowing a process scan or other similar
147 * operation to access a proc structure without it getting ripped out from
148 * under us. procfs and process-list sysctl ops also use the hold function
149 * interlocked with various p_flags to keep the vmspace intact when reading
150 * or writing a user process's address space.
152 * There are two situations where a hold count can be longer. Exiting lwps
153 * hold the process until the lwp is reaped, and the parent will hold the
154 * child during vfork()/exec() sequences while the child is marked P_PPWAIT.
156 * The kernel waits for the hold count to drop to 0 (or 1 in some cases) at
157 * various critical points in the fork/exec and exit paths before proceeding.
159 #define PLOCK_ZOMB 0x20000000
160 #define PLOCK_WAITING 0x40000000
161 #define PLOCK_MASK 0x1FFFFFFF
164 pstall(struct proc *p, const char *wmesg, int count)
172 if ((o & PLOCK_MASK) <= count)
174 n = o | PLOCK_WAITING;
175 tsleep_interlock(&p->p_lock, 0);
178 * If someone is trying to single-step the process during
179 * an exec or an exit they can deadlock us because procfs
180 * sleeps with the process held.
183 if (p->p_flags & P_INEXEC) {
185 } else if (p->p_flags & P_POSTEXIT) {
186 spin_lock(&p->p_spin);
189 spin_unlock(&p->p_spin);
194 if (atomic_cmpset_int(&p->p_lock, o, n)) {
195 tsleep(&p->p_lock, PINTERLOCKED, wmesg, 0);
201 phold(struct proc *p)
203 atomic_add_int(&p->p_lock, 1);
207 * WARNING! On last release (p) can become instantly invalid due to
211 prele(struct proc *p)
219 if (atomic_cmpset_int(&p->p_lock, 1, 0))
227 KKASSERT((o & PLOCK_MASK) > 0);
229 n = (o - 1) & ~PLOCK_WAITING;
230 if (atomic_cmpset_int(&p->p_lock, o, n)) {
231 if (o & PLOCK_WAITING)
239 * Hold and flag serialized for zombie reaping purposes.
241 * This function will fail if it has to block, returning non-zero with
242 * neither the flag set or the hold count bumped. Note that we must block
243 * without holding a ref, meaning that the caller must ensure that (p)
244 * remains valid through some other interlock (typically on its parent
245 * process's p_token).
247 * Zero is returned on success. The hold count will be incremented and
248 * the serialization flag acquired. Note that serialization is only against
249 * other pholdzomb() calls, not against phold() calls.
252 pholdzomb(struct proc *p)
260 if (atomic_cmpset_int(&p->p_lock, 0, PLOCK_ZOMB | 1))
269 if ((o & PLOCK_ZOMB) == 0) {
270 n = (o + 1) | PLOCK_ZOMB;
271 if (atomic_cmpset_int(&p->p_lock, o, n))
274 KKASSERT((o & PLOCK_MASK) > 0);
275 n = o | PLOCK_WAITING;
276 tsleep_interlock(&p->p_lock, 0);
277 if (atomic_cmpset_int(&p->p_lock, o, n)) {
278 tsleep(&p->p_lock, PINTERLOCKED, "phldz", 0);
279 /* (p) can be ripped out at this point */
287 * Release PLOCK_ZOMB and the hold count, waking up any waiters.
289 * WARNING! On last release (p) can become instantly invalid due to
293 prelezomb(struct proc *p)
301 if (atomic_cmpset_int(&p->p_lock, PLOCK_ZOMB | 1, 0))
307 KKASSERT(p->p_lock & PLOCK_ZOMB);
310 KKASSERT((o & PLOCK_MASK) > 0);
312 n = (o - 1) & ~(PLOCK_ZOMB | PLOCK_WAITING);
313 if (atomic_cmpset_int(&p->p_lock, o, n)) {
314 if (o & PLOCK_WAITING)
322 * Is p an inferior of the current process?
325 * The caller must hold proc_token if the caller wishes a stable result.
328 inferior(struct proc *p)
330 lwkt_gettoken(&proc_token);
331 while (p != curproc) {
333 lwkt_reltoken(&proc_token);
338 lwkt_reltoken(&proc_token);
343 * Locate a process by number. The returned process will be referenced and
344 * must be released with PRELE().
351 struct proc *p = curproc;
354 * Shortcut the current process
356 if (p && p->p_pid == pid) {
362 * Otherwise find it in the hash table.
364 lwkt_gettoken(&proc_token);
365 LIST_FOREACH(p, PIDHASH(pid), p_hash) {
366 if (p->p_pid == pid) {
368 lwkt_reltoken(&proc_token);
372 lwkt_reltoken(&proc_token);
378 * Locate a process by number. The returned process is NOT referenced.
379 * The caller should hold proc_token if the caller wishes a stable result.
386 struct proc *p = curproc;
389 * Shortcut the current process
391 if (p && p->p_pid == pid)
394 lwkt_gettoken(&proc_token);
395 LIST_FOREACH(p, PIDHASH(pid), p_hash) {
396 if (p->p_pid == pid) {
397 lwkt_reltoken(&proc_token);
401 lwkt_reltoken(&proc_token);
406 pgref(struct pgrp *pgrp)
408 refcount_acquire(&pgrp->pg_refs);
412 pgrel(struct pgrp *pgrp)
414 if (refcount_release(&pgrp->pg_refs))
419 * Locate a process group by number. The returned process group will be
420 * referenced w/pgref() and must be released with pgrel() (or assigned
421 * somewhere if you wish to keep the reference).
430 lwkt_gettoken(&proc_token);
431 LIST_FOREACH(pgrp, PGRPHASH(pgid), pg_hash) {
432 if (pgrp->pg_id == pgid) {
433 refcount_acquire(&pgrp->pg_refs);
434 lwkt_reltoken(&proc_token);
438 lwkt_reltoken(&proc_token);
443 * Move p to a new or existing process group (and session)
448 enterpgrp(struct proc *p, pid_t pgid, int mksess)
456 KASSERT(pgrp == NULL || !mksess,
457 ("enterpgrp: setsid into non-empty pgrp"));
458 KASSERT(!SESS_LEADER(p),
459 ("enterpgrp: session leader attempted setpgrp"));
462 pid_t savepid = p->p_pid;
467 KASSERT(p->p_pid == pgid,
468 ("enterpgrp: new pgrp and pid != pgid"));
469 if ((np = pfindn(savepid)) == NULL || np != p) {
473 pgrp = kmalloc(sizeof(struct pgrp), M_PGRP, M_WAITOK);
475 struct session *sess;
480 sess = kmalloc(sizeof(struct session), M_SESSION,
483 sess->s_sid = p->p_pid;
485 sess->s_ttyvp = NULL;
487 bcopy(p->p_session->s_login, sess->s_login,
488 sizeof(sess->s_login));
489 pgrp->pg_session = sess;
490 KASSERT(p == curproc,
491 ("enterpgrp: mksession and p != curproc"));
492 lwkt_gettoken(&p->p_token);
493 p->p_flags &= ~P_CONTROLT;
494 lwkt_reltoken(&p->p_token);
496 pgrp->pg_session = p->p_session;
497 sess_hold(pgrp->pg_session);
500 LIST_INIT(&pgrp->pg_members);
501 LIST_INSERT_HEAD(PGRPHASH(pgid), pgrp, pg_hash);
503 SLIST_INIT(&pgrp->pg_sigiolst);
504 lwkt_token_init(&pgrp->pg_token, "pgrp_token");
505 refcount_init(&pgrp->pg_refs, 1);
506 lockinit(&pgrp->pg_lock, "pgwt", 0, 0);
507 } else if (pgrp == p->p_pgrp) {
510 } /* else pgfind() referenced the pgrp */
513 * Adjust eligibility of affected pgrps to participate in job control.
514 * Increment eligibility counts before decrementing, otherwise we
515 * could reach 0 spuriously during the first call.
517 lwkt_gettoken(&pgrp->pg_token);
518 lwkt_gettoken(&p->p_token);
520 fixjobc(p, p->p_pgrp, 0);
521 while ((opgrp = p->p_pgrp) != NULL) {
523 lwkt_gettoken(&opgrp->pg_token);
524 LIST_REMOVE(p, p_pglist);
526 lwkt_reltoken(&opgrp->pg_token);
530 LIST_INSERT_HEAD(&pgrp->pg_members, p, p_pglist);
531 lwkt_reltoken(&p->p_token);
532 lwkt_reltoken(&pgrp->pg_token);
540 * Remove process from process group
545 leavepgrp(struct proc *p)
547 struct pgrp *pg = p->p_pgrp;
549 lwkt_gettoken(&p->p_token);
553 lwkt_gettoken(&pg->pg_token);
554 if (p->p_pgrp == pg) {
556 LIST_REMOVE(p, p_pglist);
559 lwkt_reltoken(&pg->pg_token);
560 lwkt_reltoken(&p->p_token); /* avoid chaining on rel */
563 lwkt_reltoken(&p->p_token);
569 * Delete a process group. Must be called only after the last ref has been
573 pgdelete(struct pgrp *pgrp)
576 * Reset any sigio structures pointing to us as a result of
577 * F_SETOWN with our pgid.
579 funsetownlst(&pgrp->pg_sigiolst);
581 if (pgrp->pg_session->s_ttyp != NULL &&
582 pgrp->pg_session->s_ttyp->t_pgrp == pgrp)
583 pgrp->pg_session->s_ttyp->t_pgrp = NULL;
584 LIST_REMOVE(pgrp, pg_hash);
585 sess_rele(pgrp->pg_session);
590 * Adjust the ref count on a session structure. When the ref count falls to
591 * zero the tty is disassociated from the session and the session structure
592 * is freed. Note that tty assocation is not itself ref-counted.
597 sess_hold(struct session *sp)
599 lwkt_gettoken(&tty_token);
601 lwkt_reltoken(&tty_token);
608 sess_rele(struct session *sp)
612 KKASSERT(sp->s_count > 0);
613 lwkt_gettoken(&tty_token);
614 if (--sp->s_count == 0) {
615 if (sp->s_ttyp && sp->s_ttyp->t_session) {
616 #ifdef TTY_DO_FULL_CLOSE
617 /* FULL CLOSE, see ttyclearsession() */
618 KKASSERT(sp->s_ttyp->t_session == sp);
619 sp->s_ttyp->t_session = NULL;
621 /* HALF CLOSE, see ttyclearsession() */
622 if (sp->s_ttyp->t_session == sp)
623 sp->s_ttyp->t_session = NULL;
626 if ((tp = sp->s_ttyp) != NULL) {
630 kfree(sp, M_SESSION);
632 lwkt_reltoken(&tty_token);
636 * Adjust pgrp jobc counters when specified process changes process group.
637 * We count the number of processes in each process group that "qualify"
638 * the group for terminal job control (those with a parent in a different
639 * process group of the same session). If that count reaches zero, the
640 * process group becomes orphaned. Check both the specified process'
641 * process group and that of its children.
642 * entering == 0 => p is leaving specified group.
643 * entering == 1 => p is entering specified group.
648 fixjobc(struct proc *p, struct pgrp *pgrp, int entering)
650 struct pgrp *hispgrp;
651 struct session *mysession;
655 * Check p's parent to see whether p qualifies its own process
656 * group; if so, adjust count for p's process group.
658 lwkt_gettoken(&p->p_token); /* p_children scan */
659 lwkt_gettoken(&pgrp->pg_token);
661 mysession = pgrp->pg_session;
662 if ((hispgrp = p->p_pptr->p_pgrp) != pgrp &&
663 hispgrp->pg_session == mysession) {
666 else if (--pgrp->pg_jobc == 0)
671 * Check this process' children to see whether they qualify
672 * their process groups; if so, adjust counts for children's
675 LIST_FOREACH(np, &p->p_children, p_sibling) {
677 lwkt_gettoken(&np->p_token);
678 if ((hispgrp = np->p_pgrp) != pgrp &&
679 hispgrp->pg_session == mysession &&
680 np->p_stat != SZOMB) {
682 lwkt_gettoken(&hispgrp->pg_token);
685 else if (--hispgrp->pg_jobc == 0)
687 lwkt_reltoken(&hispgrp->pg_token);
690 lwkt_reltoken(&np->p_token);
693 KKASSERT(pgrp->pg_refs > 0);
694 lwkt_reltoken(&pgrp->pg_token);
695 lwkt_reltoken(&p->p_token);
699 * A process group has become orphaned;
700 * if there are any stopped processes in the group,
701 * hang-up all process in that group.
703 * The caller must hold pg_token.
706 orphanpg(struct pgrp *pg)
710 LIST_FOREACH(p, &pg->pg_members, p_pglist) {
711 if (p->p_stat == SSTOP) {
712 LIST_FOREACH(p, &pg->pg_members, p_pglist) {
722 * Add a new process to the allproc list and the PID hash. This
723 * also assigns a pid to the new process.
728 proc_add_allproc(struct proc *p)
732 if ((random_offset = randompid) != 0) {
734 random_offset = karc4random() % random_offset;
738 lwkt_gettoken(&proc_token);
739 p->p_pid = proc_getnewpid_locked(random_offset);
740 LIST_INSERT_HEAD(&allproc, p, p_list);
741 LIST_INSERT_HEAD(PIDHASH(p->p_pid), p, p_hash);
742 lwkt_reltoken(&proc_token);
746 * Calculate a new process pid. This function is integrated into
747 * proc_add_allproc() to guarentee that the new pid is not reused before
748 * the new process can be added to the allproc list.
750 * The caller must hold proc_token.
754 proc_getnewpid_locked(int random_offset)
756 static pid_t nextpid;
757 static pid_t pidchecked;
761 * Find an unused process ID. We remember a range of unused IDs
762 * ready to use (from nextpid+1 through pidchecked-1).
764 nextpid = nextpid + 1 + random_offset;
767 * If the process ID prototype has wrapped around,
768 * restart somewhat above 0, as the low-numbered procs
769 * tend to include daemons that don't exit.
771 if (nextpid >= PID_MAX) {
772 nextpid = nextpid % PID_MAX;
777 if (nextpid >= pidchecked) {
780 pidchecked = PID_MAX;
783 * Scan the active and zombie procs to check whether this pid
784 * is in use. Remember the lowest pid that's greater
785 * than nextpid, so we can avoid checking for a while.
787 * NOTE: Processes in the midst of being forked may not
788 * yet have p_pgrp and p_pgrp->pg_session set up
789 * yet, so we have to check for NULL.
791 * Processes being torn down should be interlocked
792 * with proc_token prior to the clearing of their
795 p = LIST_FIRST(&allproc);
797 for (; p != NULL; p = LIST_NEXT(p, p_list)) {
798 while (p->p_pid == nextpid ||
799 (p->p_pgrp && p->p_pgrp->pg_id == nextpid) ||
800 (p->p_pgrp && p->p_session &&
801 p->p_session->s_sid == nextpid)) {
803 if (nextpid >= pidchecked)
806 if (p->p_pid > nextpid && pidchecked > p->p_pid)
807 pidchecked = p->p_pid;
809 p->p_pgrp->pg_id > nextpid &&
810 pidchecked > p->p_pgrp->pg_id) {
811 pidchecked = p->p_pgrp->pg_id;
813 if (p->p_pgrp && p->p_session &&
814 p->p_session->s_sid > nextpid &&
815 pidchecked > p->p_session->s_sid) {
816 pidchecked = p->p_session->s_sid;
821 p = LIST_FIRST(&zombproc);
829 * Called from exit1 to remove a process from the allproc
830 * list and move it to the zombie list.
832 * Caller must hold p->p_token. We are required to wait until p_lock
833 * becomes zero before we can manipulate the list, allowing allproc
834 * scans to guarantee consistency during a list scan.
837 proc_move_allproc_zombie(struct proc *p)
839 lwkt_gettoken(&proc_token);
840 PSTALL(p, "reap1", 0);
841 LIST_REMOVE(p, p_list);
842 LIST_INSERT_HEAD(&zombproc, p, p_list);
843 LIST_REMOVE(p, p_hash);
845 lwkt_reltoken(&proc_token);
850 * This routine is called from kern_wait() and will remove the process
851 * from the zombie list and the sibling list. This routine will block
852 * if someone has a lock on the proces (p_lock).
854 * Caller must hold p->p_token. We are required to wait until p_lock
855 * becomes zero before we can manipulate the list, allowing allproc
856 * scans to guarantee consistency during a list scan.
859 proc_remove_zombie(struct proc *p)
861 lwkt_gettoken(&proc_token);
862 PSTALL(p, "reap2", 0);
863 LIST_REMOVE(p, p_list); /* off zombproc */
864 LIST_REMOVE(p, p_sibling);
866 lwkt_reltoken(&proc_token);
870 * Handle various requirements prior to returning to usermode. Called from
871 * platform trap and system call code.
874 lwpuserret(struct lwp *lp)
876 struct proc *p = lp->lwp_proc;
878 if (lp->lwp_mpflags & LWP_MP_VNLRU) {
879 atomic_clear_int(&lp->lwp_mpflags, LWP_MP_VNLRU);
882 if (lp->lwp_mpflags & LWP_MP_WEXIT) {
883 lwkt_gettoken(&p->p_token);
885 lwkt_reltoken(&p->p_token); /* NOT REACHED */
890 * Kernel threads run from user processes can also accumulate deferred
891 * actions which need to be acted upon. Callers include:
893 * nfsd - Can allocate lots of vnodes
896 lwpkthreaddeferred(void)
898 struct lwp *lp = curthread->td_lwp;
901 if (lp->lwp_mpflags & LWP_MP_VNLRU) {
902 atomic_clear_int(&lp->lwp_mpflags, LWP_MP_VNLRU);
909 * Scan all processes on the allproc list. The process is automatically
910 * held for the callback. A return value of -1 terminates the loop.
912 * The callback is made with the process held and proc_token held.
914 * We limit the scan to the number of processes as-of the start of
915 * the scan so as not to get caught up in an endless loop if new processes
916 * are created more quickly than we can scan the old ones. Add a little
917 * slop to try to catch edge cases since nprocs can race.
922 allproc_scan(int (*callback)(struct proc *, void *), void *data)
926 int limit = nprocs + ncpus;
929 * proc_token protects the allproc list and PHOLD() prevents the
930 * process from being removed from the allproc list or the zombproc
933 lwkt_gettoken(&proc_token);
934 LIST_FOREACH(p, &allproc, p_list) {
936 r = callback(p, data);
943 lwkt_reltoken(&proc_token);
947 * Scan all lwps of processes on the allproc list. The lwp is automatically
948 * held for the callback. A return value of -1 terminates the loop.
950 * The callback is made with the proces and lwp both held, and proc_token held.
955 alllwp_scan(int (*callback)(struct lwp *, void *), void *data)
962 * proc_token protects the allproc list and PHOLD() prevents the
963 * process from being removed from the allproc list or the zombproc
966 lwkt_gettoken(&proc_token);
967 LIST_FOREACH(p, &allproc, p_list) {
969 FOREACH_LWP_IN_PROC(lp, p) {
971 r = callback(lp, data);
978 lwkt_reltoken(&proc_token);
982 * Scan all processes on the zombproc list. The process is automatically
983 * held for the callback. A return value of -1 terminates the loop.
986 * The callback is made with the proces held and proc_token held.
989 zombproc_scan(int (*callback)(struct proc *, void *), void *data)
994 lwkt_gettoken(&proc_token);
995 LIST_FOREACH(p, &zombproc, p_list) {
997 r = callback(p, data);
1002 lwkt_reltoken(&proc_token);
1005 #include "opt_ddb.h"
1007 #include <ddb/ddb.h>
1012 DB_SHOW_COMMAND(pgrpdump, pgrpdump)
1018 for (i = 0; i <= pgrphash; i++) {
1019 if (!LIST_EMPTY(&pgrphashtbl[i])) {
1020 kprintf("\tindx %d\n", i);
1021 LIST_FOREACH(pgrp, &pgrphashtbl[i], pg_hash) {
1023 "\tpgrp %p, pgid %ld, sess %p, sesscnt %d, mem %p\n",
1024 (void *)pgrp, (long)pgrp->pg_id,
1025 (void *)pgrp->pg_session,
1026 pgrp->pg_session->s_count,
1027 (void *)LIST_FIRST(&pgrp->pg_members));
1028 LIST_FOREACH(p, &pgrp->pg_members, p_pglist) {
1029 kprintf("\t\tpid %ld addr %p pgrp %p\n",
1030 (long)p->p_pid, (void *)p,
1040 * Locate a process on the zombie list. Return a process or NULL.
1041 * The returned process will be referenced and the caller must release
1044 * No other requirements.
1051 lwkt_gettoken(&proc_token);
1052 LIST_FOREACH(p, &zombproc, p_list) {
1053 if (p->p_pid == pid) {
1055 lwkt_reltoken(&proc_token);
1059 lwkt_reltoken(&proc_token);
1064 * The caller must hold proc_token.
1067 sysctl_out_proc(struct proc *p, struct sysctl_req *req, int flags)
1069 struct kinfo_proc ki;
1071 int skp = 0, had_output = 0;
1074 bzero(&ki, sizeof(ki));
1075 lwkt_gettoken(&p->p_token);
1076 fill_kinfo_proc(p, &ki);
1077 if ((flags & KERN_PROC_FLAG_LWP) == 0)
1080 FOREACH_LWP_IN_PROC(lp, p) {
1082 fill_kinfo_lwp(lp, &ki.kp_lwp);
1084 error = SYSCTL_OUT(req, &ki, sizeof(ki));
1091 lwkt_reltoken(&p->p_token);
1092 /* We need to output at least the proc, even if there is no lwp. */
1093 if (had_output == 0) {
1094 error = SYSCTL_OUT(req, &ki, sizeof(ki));
1100 * The caller must hold proc_token.
1103 sysctl_out_proc_kthread(struct thread *td, struct sysctl_req *req, int flags)
1105 struct kinfo_proc ki;
1108 fill_kinfo_proc_kthread(td, &ki);
1109 error = SYSCTL_OUT(req, &ki, sizeof(ki));
1119 sysctl_kern_proc(SYSCTL_HANDLER_ARGS)
1121 int *name = (int*) arg1;
1122 int oid = oidp->oid_number;
1123 u_int namelen = arg2;
1125 struct proclist *plist;
1127 struct thread *marker;
1128 int doingzomb, flags = 0;
1132 struct ucred *cr1 = curproc->p_ucred;
1134 flags = oid & KERN_PROC_FLAGMASK;
1135 oid &= ~KERN_PROC_FLAGMASK;
1137 if ((oid == KERN_PROC_ALL && namelen != 0) ||
1138 (oid != KERN_PROC_ALL && namelen != 1)) {
1143 * proc_token protects the allproc list and PHOLD() prevents the
1144 * process from being removed from the allproc list or the zombproc
1147 lwkt_gettoken(&proc_token);
1148 if (oid == KERN_PROC_PID) {
1149 p = pfindn((pid_t)name[0]);
1152 if (!PRISON_CHECK(cr1, p->p_ucred))
1155 error = sysctl_out_proc(p, req, flags);
1161 /* overestimate by 5 procs */
1162 error = SYSCTL_OUT(req, 0, sizeof (struct kinfo_proc) * 5);
1166 for (doingzomb = 0; doingzomb <= 1; doingzomb++) {
1171 LIST_FOREACH(p, plist, p_list) {
1173 * Show a user only their processes.
1175 if ((!ps_showallprocs) && p_trespass(cr1, p->p_ucred))
1178 * Skip embryonic processes.
1180 if (p->p_stat == SIDL)
1183 * TODO - make more efficient (see notes below).
1187 case KERN_PROC_PGRP:
1188 /* could do this by traversing pgrp */
1189 if (p->p_pgrp == NULL ||
1190 p->p_pgrp->pg_id != (pid_t)name[0])
1195 if ((p->p_flags & P_CONTROLT) == 0 ||
1196 p->p_session == NULL ||
1197 p->p_session->s_ttyp == NULL ||
1198 dev2udev(p->p_session->s_ttyp->t_dev) !=
1204 if (p->p_ucred == NULL ||
1205 p->p_ucred->cr_uid != (uid_t)name[0])
1209 case KERN_PROC_RUID:
1210 if (p->p_ucred == NULL ||
1211 p->p_ucred->cr_ruid != (uid_t)name[0])
1216 if (!PRISON_CHECK(cr1, p->p_ucred))
1219 error = sysctl_out_proc(p, req, flags);
1227 * Iterate over all active cpus and scan their thread list. Start
1228 * with the next logical cpu and end with our original cpu. We
1229 * migrate our own thread to each target cpu in order to safely scan
1230 * its thread list. In the last loop we migrate back to our original
1233 origcpu = mycpu->gd_cpuid;
1234 if (!ps_showallthreads || jailed(cr1))
1237 marker = kmalloc(sizeof(struct thread), M_TEMP, M_WAITOK|M_ZERO);
1238 marker->td_flags = TDF_MARKER;
1241 for (n = 1; n <= ncpus; ++n) {
1245 nid = (origcpu + n) % ncpus;
1246 if ((smp_active_mask & CPUMASK(nid)) == 0)
1248 rgd = globaldata_find(nid);
1249 lwkt_setcpu_self(rgd);
1252 TAILQ_INSERT_TAIL(&rgd->gd_tdallq, marker, td_allq);
1254 while ((td = TAILQ_PREV(marker, lwkt_queue, td_allq)) != NULL) {
1255 TAILQ_REMOVE(&rgd->gd_tdallq, marker, td_allq);
1256 TAILQ_INSERT_BEFORE(td, marker, td_allq);
1257 if (td->td_flags & TDF_MARKER)
1266 case KERN_PROC_PGRP:
1269 case KERN_PROC_RUID:
1272 error = sysctl_out_proc_kthread(td, req,
1281 TAILQ_REMOVE(&rgd->gd_tdallq, marker, td_allq);
1287 kfree(marker, M_TEMP);
1290 lwkt_reltoken(&proc_token);
1295 * This sysctl allows a process to retrieve the argument list or process
1296 * title for another process without groping around in the address space
1297 * of the other process. It also allow a process to set its own "process
1298 * title to a string of its own choice.
1303 sysctl_kern_proc_args(SYSCTL_HANDLER_ARGS)
1305 int *name = (int*) arg1;
1306 u_int namelen = arg2;
1311 struct ucred *cr1 = curproc->p_ucred;
1316 p = pfind((pid_t)name[0]);
1319 lwkt_gettoken(&p->p_token);
1321 if ((!ps_argsopen) && p_trespass(cr1, p->p_ucred))
1324 if (req->newptr && curproc != p) {
1328 if (req->oldptr && (pa = p->p_args) != NULL) {
1329 refcount_acquire(&pa->ar_ref);
1330 error = SYSCTL_OUT(req, pa->ar_args, pa->ar_length);
1331 if (refcount_release(&pa->ar_ref))
1334 if (req->newptr == NULL)
1337 if (req->newlen + sizeof(struct pargs) > ps_arg_cache_limit) {
1341 pa = kmalloc(sizeof(struct pargs) + req->newlen, M_PARGS, M_WAITOK);
1342 refcount_init(&pa->ar_ref, 1);
1343 pa->ar_length = req->newlen;
1344 error = SYSCTL_IN(req, pa->ar_args, req->newlen);
1352 * Replace p_args with the new pa. p_args may have previously
1359 KKASSERT(opa->ar_ref > 0);
1360 if (refcount_release(&opa->ar_ref)) {
1361 kfree(opa, M_PARGS);
1367 lwkt_reltoken(&p->p_token);
1374 sysctl_kern_proc_cwd(SYSCTL_HANDLER_ARGS)
1376 int *name = (int*) arg1;
1377 u_int namelen = arg2;
1380 char *fullpath, *freepath;
1381 struct ucred *cr1 = curproc->p_ucred;
1386 p = pfind((pid_t)name[0]);
1389 lwkt_gettoken(&p->p_token);
1392 * If we are not allowed to see other args, we certainly shouldn't
1393 * get the cwd either. Also check the usual trespassing.
1395 if ((!ps_argsopen) && p_trespass(cr1, p->p_ucred))
1398 if (req->oldptr && p->p_fd != NULL && p->p_fd->fd_ncdir.ncp) {
1399 struct nchandle nch;
1401 cache_copy(&p->p_fd->fd_ncdir, &nch);
1402 error = cache_fullpath(p, &nch, NULL,
1403 &fullpath, &freepath, 0);
1407 error = SYSCTL_OUT(req, fullpath, strlen(fullpath) + 1);
1408 kfree(freepath, M_TEMP);
1413 lwkt_reltoken(&p->p_token);
1419 SYSCTL_NODE(_kern, KERN_PROC, proc, CTLFLAG_RD, 0, "Process table");
1421 SYSCTL_PROC(_kern_proc, KERN_PROC_ALL, all, CTLFLAG_RD|CTLTYPE_STRUCT,
1422 0, 0, sysctl_kern_proc, "S,proc", "Return entire process table");
1424 SYSCTL_NODE(_kern_proc, KERN_PROC_PGRP, pgrp, CTLFLAG_RD,
1425 sysctl_kern_proc, "Process table");
1427 SYSCTL_NODE(_kern_proc, KERN_PROC_TTY, tty, CTLFLAG_RD,
1428 sysctl_kern_proc, "Process table");
1430 SYSCTL_NODE(_kern_proc, KERN_PROC_UID, uid, CTLFLAG_RD,
1431 sysctl_kern_proc, "Process table");
1433 SYSCTL_NODE(_kern_proc, KERN_PROC_RUID, ruid, CTLFLAG_RD,
1434 sysctl_kern_proc, "Process table");
1436 SYSCTL_NODE(_kern_proc, KERN_PROC_PID, pid, CTLFLAG_RD,
1437 sysctl_kern_proc, "Process table");
1439 SYSCTL_NODE(_kern_proc, (KERN_PROC_ALL | KERN_PROC_FLAG_LWP), all_lwp, CTLFLAG_RD,
1440 sysctl_kern_proc, "Process table");
1442 SYSCTL_NODE(_kern_proc, (KERN_PROC_PGRP | KERN_PROC_FLAG_LWP), pgrp_lwp, CTLFLAG_RD,
1443 sysctl_kern_proc, "Process table");
1445 SYSCTL_NODE(_kern_proc, (KERN_PROC_TTY | KERN_PROC_FLAG_LWP), tty_lwp, CTLFLAG_RD,
1446 sysctl_kern_proc, "Process table");
1448 SYSCTL_NODE(_kern_proc, (KERN_PROC_UID | KERN_PROC_FLAG_LWP), uid_lwp, CTLFLAG_RD,
1449 sysctl_kern_proc, "Process table");
1451 SYSCTL_NODE(_kern_proc, (KERN_PROC_RUID | KERN_PROC_FLAG_LWP), ruid_lwp, CTLFLAG_RD,
1452 sysctl_kern_proc, "Process table");
1454 SYSCTL_NODE(_kern_proc, (KERN_PROC_PID | KERN_PROC_FLAG_LWP), pid_lwp, CTLFLAG_RD,
1455 sysctl_kern_proc, "Process table");
1457 SYSCTL_NODE(_kern_proc, KERN_PROC_ARGS, args, CTLFLAG_RW | CTLFLAG_ANYBODY,
1458 sysctl_kern_proc_args, "Process argument list");
1460 SYSCTL_NODE(_kern_proc, KERN_PROC_CWD, cwd, CTLFLAG_RD | CTLFLAG_ANYBODY,
1461 sysctl_kern_proc_cwd, "Process argument list");