2 * Copyright (c) 1982, 1986, 1989, 1991, 1993
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
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. 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.
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
30 #include <sys/param.h>
31 #include <sys/systm.h>
32 #include <sys/kernel.h>
33 #include <sys/sysctl.h>
34 #include <sys/malloc.h>
36 #include <sys/vnode.h>
38 #include <sys/filedesc.h>
40 #include <sys/dsched.h>
41 #include <sys/signalvar.h>
42 #include <sys/spinlock.h>
43 #include <sys/random.h>
44 #include <sys/vnode.h>
49 #include <vm/vm_map.h>
51 #include <machine/smp.h>
53 #include <sys/refcount.h>
54 #include <sys/spinlock2.h>
57 * Hash table size must be a power of two and is not currently dynamically
58 * sized. There is a trade-off between the linear scans which must iterate
59 * all HSIZE elements and the number of elements which might accumulate
60 * within each hash chain.
62 #define ALLPROC_HSIZE 256
63 #define ALLPROC_HMASK (ALLPROC_HSIZE - 1)
64 #define ALLPROC_HASH(pid) (pid & ALLPROC_HMASK)
65 #define PGRP_HASH(pid) (pid & ALLPROC_HMASK)
66 #define SESS_HASH(pid) (pid & ALLPROC_HMASK)
69 * pid_doms[] management, used to control how quickly a PID can be recycled.
70 * Must be a multiple of ALLPROC_HSIZE for the proc_makepid() inner loops.
72 * WARNING! PIDDOM_DELAY should not be defined > 20 or so unless you change
73 * the array from int8_t's to int16_t's.
75 #define PIDDOM_COUNT 10 /* 10 pids per domain - reduce array size */
76 #define PIDDOM_DELAY 10 /* min 10 seconds after exit before reuse */
77 #define PIDDOM_SCALE 10 /* (10,000*SCALE)/sec performance guarantee */
78 #define PIDSEL_DOMAINS (PID_MAX * PIDDOM_SCALE / PIDDOM_COUNT / \
79 ALLPROC_HSIZE * ALLPROC_HSIZE)
82 int allproc_hsize = ALLPROC_HSIZE;
84 LIST_HEAD(pidhashhead, proc);
86 static MALLOC_DEFINE(M_PGRP, "pgrp", "process group header");
87 MALLOC_DEFINE(M_SESSION, "session", "session header");
88 MALLOC_DEFINE(M_PROC, "proc", "Proc structures");
89 MALLOC_DEFINE(M_LWP, "lwp", "lwp structures");
90 MALLOC_DEFINE(M_SUBPROC, "subproc", "Proc sub-structures");
92 int ps_showallprocs = 1;
93 static int ps_showallthreads = 1;
94 SYSCTL_INT(_security, OID_AUTO, ps_showallprocs, CTLFLAG_RW,
96 "Unprivileged processes can see processes with different UID/GID");
97 SYSCTL_INT(_security, OID_AUTO, ps_showallthreads, CTLFLAG_RW,
98 &ps_showallthreads, 0,
99 "Unprivileged processes can see kernel threads");
100 static u_int pid_domain_skips;
101 SYSCTL_UINT(_kern, OID_AUTO, pid_domain_skips, CTLFLAG_RW,
102 &pid_domain_skips, 0,
103 "Number of pid_doms[] skipped");
104 static u_int pid_inner_skips;
105 SYSCTL_UINT(_kern, OID_AUTO, pid_inner_skips, CTLFLAG_RW,
107 "Number of pid_doms[] skipped");
109 static void orphanpg(struct pgrp *pg);
110 static void proc_makepid(struct proc *p, int random_offset);
113 * Process related lists (for proc_token, allproc, allpgrp, and allsess)
115 typedef struct procglob procglob_t;
117 static procglob_t procglob[ALLPROC_HSIZE];
120 * We try our best to avoid recycling a PID too quickly. We do this by
121 * storing (uint8_t)time_second in the related pid domain on-reap and then
122 * using that to skip-over the domain on-allocate.
124 * This array has to be fairly large to support a high fork/exec rate.
125 * A ~100,000 entry array will support a 10-second reuse latency at
126 * 10,000 execs/second, worst case. Best-case multiply by PIDDOM_COUNT
127 * (approximately 100,000 execs/second).
129 * Currently we allocate around a megabyte, making the worst-case fork
130 * rate around 100,000/second.
132 static uint8_t *pid_doms;
135 * Random component to nextpid generation. We mix in a random factor to make
136 * it a little harder to predict. We sanity check the modulus value to avoid
137 * doing it in critical paths. Don't let it be too small or we pointlessly
138 * waste randomness entropy, and don't let it be impossibly large. Using a
139 * modulus that is too big causes a LOT more process table scans and slows
140 * down fork processing as the pidchecked caching is defeated.
142 static int randompid = 0;
146 pcredcache(struct ucred *cr, struct proc *p)
148 if (cr != p->p_ucred) {
151 spin_lock(&p->p_spin);
152 if ((cr = p->p_ucred) != NULL)
154 spin_unlock(&p->p_spin);
163 sysctl_kern_randompid(SYSCTL_HANDLER_ARGS)
168 error = sysctl_handle_int(oidp, &pid, 0, req);
169 if (error || !req->newptr)
171 if (pid < 0 || pid > PID_MAX - 100) /* out of range */
173 else if (pid < 2) /* NOP */
175 else if (pid < 100) /* Make it reasonable */
181 SYSCTL_PROC(_kern, OID_AUTO, randompid, CTLTYPE_INT|CTLFLAG_RW,
182 0, 0, sysctl_kern_randompid, "I", "Random PID modulus");
185 * Initialize global process hashing structures.
187 * These functions are ONLY called from the low level boot code and do
188 * not lock their operations.
196 * Allocate dynamically. This array can be large (~1MB) so don't
197 * waste boot loader space.
199 pid_doms = kmalloc(sizeof(pid_doms[0]) * PIDSEL_DOMAINS,
200 M_PROC, M_WAITOK | M_ZERO);
203 * Avoid unnecessary stalls due to pid_doms[] values all being
204 * the same. Make sure that the allocation of pid 1 and pid 2
207 for (i = 0; i < PIDSEL_DOMAINS; ++i)
208 pid_doms[i] = (int8_t)i - (int8_t)(PIDDOM_DELAY + 1);
213 for (i = 0; i < ALLPROC_HSIZE; ++i) {
214 procglob_t *prg = &procglob[i];
215 LIST_INIT(&prg->allproc);
216 LIST_INIT(&prg->allsess);
217 LIST_INIT(&prg->allpgrp);
218 lwkt_token_init(&prg->proc_token, "allproc");
224 procinsertinit(struct proc *p)
226 LIST_INSERT_HEAD(&procglob[ALLPROC_HASH(p->p_pid)].allproc,
231 pgrpinsertinit(struct pgrp *pg)
233 LIST_INSERT_HEAD(&procglob[ALLPROC_HASH(pg->pg_id)].allpgrp,
238 sessinsertinit(struct session *sess)
240 LIST_INSERT_HEAD(&procglob[ALLPROC_HASH(sess->s_sid)].allsess,
245 * Process hold/release support functions. Called via the PHOLD(),
246 * PRELE(), and PSTALL() macros.
248 * p->p_lock is a simple hold count with a waiting interlock. No wakeup()
249 * is issued unless someone is actually waiting for the process.
251 * Most holds are short-term, allowing a process scan or other similar
252 * operation to access a proc structure without it getting ripped out from
253 * under us. procfs and process-list sysctl ops also use the hold function
254 * interlocked with various p_flags to keep the vmspace intact when reading
255 * or writing a user process's address space.
257 * There are two situations where a hold count can be longer. Exiting lwps
258 * hold the process until the lwp is reaped, and the parent will hold the
259 * child during vfork()/exec() sequences while the child is marked P_PPWAIT.
261 * The kernel waits for the hold count to drop to 0 (or 1 in some cases) at
262 * various critical points in the fork/exec and exit paths before proceeding.
264 #define PLOCK_ZOMB 0x20000000
265 #define PLOCK_WAITING 0x40000000
266 #define PLOCK_MASK 0x1FFFFFFF
269 pstall(struct proc *p, const char *wmesg, int count)
277 if ((o & PLOCK_MASK) <= count)
279 n = o | PLOCK_WAITING;
280 tsleep_interlock(&p->p_lock, 0);
283 * If someone is trying to single-step the process during
284 * an exec or an exit they can deadlock us because procfs
285 * sleeps with the process held.
288 if (p->p_flags & P_INEXEC) {
290 } else if (p->p_flags & P_POSTEXIT) {
291 spin_lock(&p->p_spin);
294 spin_unlock(&p->p_spin);
299 if (atomic_cmpset_int(&p->p_lock, o, n)) {
300 tsleep(&p->p_lock, PINTERLOCKED, wmesg, 0);
306 phold(struct proc *p)
308 atomic_add_int(&p->p_lock, 1);
312 * WARNING! On last release (p) can become instantly invalid due to
316 prele(struct proc *p)
324 if (atomic_cmpset_int(&p->p_lock, 1, 0))
332 KKASSERT((o & PLOCK_MASK) > 0);
334 n = (o - 1) & ~PLOCK_WAITING;
335 if (atomic_cmpset_int(&p->p_lock, o, n)) {
336 if (o & PLOCK_WAITING)
344 * Hold and flag serialized for zombie reaping purposes.
346 * This function will fail if it has to block, returning non-zero with
347 * neither the flag set or the hold count bumped. Note that (p) may
348 * not be valid in this case if the caller does not have some other
351 * This function does not block on other PHOLD()s, only on other
354 * Zero is returned on success. The hold count will be incremented and
355 * the serialization flag acquired. Note that serialization is only against
356 * other pholdzomb() calls, not against phold() calls.
359 pholdzomb(struct proc *p)
367 if (atomic_cmpset_int(&p->p_lock, 0, PLOCK_ZOMB | 1))
376 if ((o & PLOCK_ZOMB) == 0) {
377 n = (o + 1) | PLOCK_ZOMB;
378 if (atomic_cmpset_int(&p->p_lock, o, n))
381 KKASSERT((o & PLOCK_MASK) > 0);
382 n = o | PLOCK_WAITING;
383 tsleep_interlock(&p->p_lock, 0);
384 if (atomic_cmpset_int(&p->p_lock, o, n)) {
385 tsleep(&p->p_lock, PINTERLOCKED, "phldz", 0);
386 /* (p) can be ripped out at this point */
394 * Release PLOCK_ZOMB and the hold count, waking up any waiters.
396 * WARNING! On last release (p) can become instantly invalid due to
400 prelezomb(struct proc *p)
408 if (atomic_cmpset_int(&p->p_lock, PLOCK_ZOMB | 1, 0))
414 KKASSERT(p->p_lock & PLOCK_ZOMB);
417 KKASSERT((o & PLOCK_MASK) > 0);
419 n = (o - 1) & ~(PLOCK_ZOMB | PLOCK_WAITING);
420 if (atomic_cmpset_int(&p->p_lock, o, n)) {
421 if (o & PLOCK_WAITING)
429 * Is p an inferior of the current process?
434 inferior(struct proc *p)
439 lwkt_gettoken_shared(&p->p_token);
440 while (p != curproc) {
442 lwkt_reltoken(&p->p_token);
447 lwkt_reltoken(&p->p_token);
449 lwkt_gettoken_shared(&p2->p_token);
452 lwkt_reltoken(&p->p_token);
459 * Locate a process by number. The returned process will be referenced and
460 * must be released with PRELE().
467 struct proc *p = curproc;
472 * Shortcut the current process
474 if (p && p->p_pid == pid) {
480 * Otherwise find it in the hash table.
482 n = ALLPROC_HASH(pid);
485 lwkt_gettoken_shared(&prg->proc_token);
486 LIST_FOREACH(p, &prg->allproc, p_list) {
487 if (p->p_stat == SZOMB)
489 if (p->p_pid == pid) {
491 lwkt_reltoken(&prg->proc_token);
495 lwkt_reltoken(&prg->proc_token);
501 * Locate a process by number. The returned process is NOT referenced.
502 * The result will not be stable and is typically only used to validate
503 * against a process that the caller has in-hand.
510 struct proc *p = curproc;
515 * Shortcut the current process
517 if (p && p->p_pid == pid)
521 * Otherwise find it in the hash table.
523 n = ALLPROC_HASH(pid);
526 lwkt_gettoken_shared(&prg->proc_token);
527 LIST_FOREACH(p, &prg->allproc, p_list) {
528 if (p->p_stat == SZOMB)
530 if (p->p_pid == pid) {
531 lwkt_reltoken(&prg->proc_token);
535 lwkt_reltoken(&prg->proc_token);
541 * Locate a process on the zombie list. Return a process or NULL.
542 * The returned process will be referenced and the caller must release
545 * No other requirements.
550 struct proc *p = curproc;
555 * Shortcut the current process
557 if (p && p->p_pid == pid) {
563 * Otherwise find it in the hash table.
565 n = ALLPROC_HASH(pid);
568 lwkt_gettoken_shared(&prg->proc_token);
569 LIST_FOREACH(p, &prg->allproc, p_list) {
570 if (p->p_stat != SZOMB)
572 if (p->p_pid == pid) {
574 lwkt_reltoken(&prg->proc_token);
578 lwkt_reltoken(&prg->proc_token);
585 pgref(struct pgrp *pgrp)
587 refcount_acquire(&pgrp->pg_refs);
591 pgrel(struct pgrp *pgrp)
597 n = PGRP_HASH(pgrp->pg_id);
601 count = pgrp->pg_refs;
605 lwkt_gettoken(&prg->proc_token);
606 if (atomic_cmpset_int(&pgrp->pg_refs, 1, 0))
608 lwkt_reltoken(&prg->proc_token);
611 if (atomic_cmpset_int(&pgrp->pg_refs, count, count - 1))
618 * Successful 1->0 transition, pghash_spin is held.
620 LIST_REMOVE(pgrp, pg_list);
621 if (pid_doms[pgrp->pg_id % PIDSEL_DOMAINS] != (uint8_t)time_second)
622 pid_doms[pgrp->pg_id % PIDSEL_DOMAINS] = (uint8_t)time_second;
625 * Reset any sigio structures pointing to us as a result of
626 * F_SETOWN with our pgid.
628 funsetownlst(&pgrp->pg_sigiolst);
630 if (pgrp->pg_session->s_ttyp != NULL &&
631 pgrp->pg_session->s_ttyp->t_pgrp == pgrp) {
632 pgrp->pg_session->s_ttyp->t_pgrp = NULL;
634 lwkt_reltoken(&prg->proc_token);
636 sess_rele(pgrp->pg_session);
641 * Locate a process group by number. The returned process group will be
642 * referenced w/pgref() and must be released with pgrel() (or assigned
643 * somewhere if you wish to keep the reference).
656 lwkt_gettoken_shared(&prg->proc_token);
658 LIST_FOREACH(pgrp, &prg->allpgrp, pg_list) {
659 if (pgrp->pg_id == pgid) {
660 refcount_acquire(&pgrp->pg_refs);
661 lwkt_reltoken(&prg->proc_token);
665 lwkt_reltoken(&prg->proc_token);
670 * Move p to a new or existing process group (and session)
675 enterpgrp(struct proc *p, pid_t pgid, int mksess)
683 KASSERT(pgrp == NULL || !mksess,
684 ("enterpgrp: setsid into non-empty pgrp"));
685 KASSERT(!SESS_LEADER(p),
686 ("enterpgrp: session leader attempted setpgrp"));
689 pid_t savepid = p->p_pid;
697 KASSERT(p->p_pid == pgid,
698 ("enterpgrp: new pgrp and pid != pgid"));
699 pgrp = kmalloc(sizeof(struct pgrp), M_PGRP, M_WAITOK | M_ZERO);
701 LIST_INIT(&pgrp->pg_members);
703 SLIST_INIT(&pgrp->pg_sigiolst);
704 lwkt_token_init(&pgrp->pg_token, "pgrp_token");
705 refcount_init(&pgrp->pg_refs, 1);
706 lockinit(&pgrp->pg_lock, "pgwt", 0, 0);
711 if ((np = pfindn(savepid)) == NULL || np != p) {
712 lwkt_reltoken(&prg->proc_token);
718 lwkt_gettoken(&prg->proc_token);
720 struct session *sess;
725 sess = kmalloc(sizeof(struct session), M_SESSION,
727 lwkt_gettoken(&p->p_token);
729 sess->s_sid = p->p_pid;
731 sess->s_ttyvp = NULL;
733 bcopy(p->p_session->s_login, sess->s_login,
734 sizeof(sess->s_login));
735 pgrp->pg_session = sess;
736 KASSERT(p == curproc,
737 ("enterpgrp: mksession and p != curproc"));
738 p->p_flags &= ~P_CONTROLT;
739 LIST_INSERT_HEAD(&prg->allsess, sess, s_list);
740 lwkt_reltoken(&p->p_token);
742 lwkt_gettoken(&p->p_token);
743 pgrp->pg_session = p->p_session;
744 sess_hold(pgrp->pg_session);
745 lwkt_reltoken(&p->p_token);
747 LIST_INSERT_HEAD(&prg->allpgrp, pgrp, pg_list);
749 lwkt_reltoken(&prg->proc_token);
750 } else if (pgrp == p->p_pgrp) {
753 } /* else pgfind() referenced the pgrp */
755 lwkt_gettoken(&pgrp->pg_token);
756 lwkt_gettoken(&p->p_token);
759 * Replace p->p_pgrp, handling any races that occur.
761 while ((opgrp = p->p_pgrp) != NULL) {
763 lwkt_gettoken(&opgrp->pg_token);
764 if (opgrp != p->p_pgrp) {
765 lwkt_reltoken(&opgrp->pg_token);
769 LIST_REMOVE(p, p_pglist);
773 LIST_INSERT_HEAD(&pgrp->pg_members, p, p_pglist);
776 * Adjust eligibility of affected pgrps to participate in job control.
777 * Increment eligibility counts before decrementing, otherwise we
778 * could reach 0 spuriously during the first call.
782 fixjobc(p, opgrp, 0);
783 lwkt_reltoken(&opgrp->pg_token);
784 pgrel(opgrp); /* manual pgref */
785 pgrel(opgrp); /* p->p_pgrp ref */
787 lwkt_reltoken(&p->p_token);
788 lwkt_reltoken(&pgrp->pg_token);
796 * Remove process from process group
801 leavepgrp(struct proc *p)
803 struct pgrp *pg = p->p_pgrp;
805 lwkt_gettoken(&p->p_token);
806 while ((pg = p->p_pgrp) != NULL) {
808 lwkt_gettoken(&pg->pg_token);
809 if (p->p_pgrp != pg) {
810 lwkt_reltoken(&pg->pg_token);
815 LIST_REMOVE(p, p_pglist);
816 lwkt_reltoken(&pg->pg_token);
817 pgrel(pg); /* manual pgref */
818 pgrel(pg); /* p->p_pgrp ref */
821 lwkt_reltoken(&p->p_token);
827 * Adjust the ref count on a session structure. When the ref count falls to
828 * zero the tty is disassociated from the session and the session structure
829 * is freed. Note that tty assocation is not itself ref-counted.
834 sess_hold(struct session *sp)
836 atomic_add_int(&sp->s_count, 1);
843 sess_rele(struct session *sess)
850 n = SESS_HASH(sess->s_sid);
854 count = sess->s_count;
858 lwkt_gettoken(&tty_token);
859 lwkt_gettoken(&prg->proc_token);
860 if (atomic_cmpset_int(&sess->s_count, 1, 0))
862 lwkt_reltoken(&prg->proc_token);
863 lwkt_reltoken(&tty_token);
866 if (atomic_cmpset_int(&sess->s_count, count, count - 1))
873 * Successful 1->0 transition and tty_token is held.
875 LIST_REMOVE(sess, s_list);
876 if (pid_doms[sess->s_sid % PIDSEL_DOMAINS] != (uint8_t)time_second)
877 pid_doms[sess->s_sid % PIDSEL_DOMAINS] = (uint8_t)time_second;
879 if (sess->s_ttyp && sess->s_ttyp->t_session) {
880 #ifdef TTY_DO_FULL_CLOSE
881 /* FULL CLOSE, see ttyclearsession() */
882 KKASSERT(sess->s_ttyp->t_session == sess);
883 sess->s_ttyp->t_session = NULL;
885 /* HALF CLOSE, see ttyclearsession() */
886 if (sess->s_ttyp->t_session == sess)
887 sess->s_ttyp->t_session = NULL;
890 if ((tp = sess->s_ttyp) != NULL) {
894 lwkt_reltoken(&prg->proc_token);
895 lwkt_reltoken(&tty_token);
897 kfree(sess, M_SESSION);
901 * Adjust pgrp jobc counters when specified process changes process group.
902 * We count the number of processes in each process group that "qualify"
903 * the group for terminal job control (those with a parent in a different
904 * process group of the same session). If that count reaches zero, the
905 * process group becomes orphaned. Check both the specified process'
906 * process group and that of its children.
907 * entering == 0 => p is leaving specified group.
908 * entering == 1 => p is entering specified group.
913 fixjobc(struct proc *p, struct pgrp *pgrp, int entering)
915 struct pgrp *hispgrp;
916 struct session *mysession;
920 * Check p's parent to see whether p qualifies its own process
921 * group; if so, adjust count for p's process group.
923 lwkt_gettoken(&p->p_token); /* p_children scan */
924 lwkt_gettoken(&pgrp->pg_token);
926 mysession = pgrp->pg_session;
927 if ((hispgrp = p->p_pptr->p_pgrp) != pgrp &&
928 hispgrp->pg_session == mysession) {
931 else if (--pgrp->pg_jobc == 0)
936 * Check this process' children to see whether they qualify
937 * their process groups; if so, adjust counts for children's
940 LIST_FOREACH(np, &p->p_children, p_sibling) {
942 lwkt_gettoken(&np->p_token);
943 if ((hispgrp = np->p_pgrp) != pgrp &&
944 hispgrp->pg_session == mysession &&
945 np->p_stat != SZOMB) {
947 lwkt_gettoken(&hispgrp->pg_token);
950 else if (--hispgrp->pg_jobc == 0)
952 lwkt_reltoken(&hispgrp->pg_token);
955 lwkt_reltoken(&np->p_token);
958 KKASSERT(pgrp->pg_refs > 0);
959 lwkt_reltoken(&pgrp->pg_token);
960 lwkt_reltoken(&p->p_token);
964 * A process group has become orphaned;
965 * if there are any stopped processes in the group,
966 * hang-up all process in that group.
968 * The caller must hold pg_token.
971 orphanpg(struct pgrp *pg)
975 LIST_FOREACH(p, &pg->pg_members, p_pglist) {
976 if (p->p_stat == SSTOP) {
977 LIST_FOREACH(p, &pg->pg_members, p_pglist) {
987 * Add a new process to the allproc list and the PID hash. This
988 * also assigns a pid to the new process.
993 proc_add_allproc(struct proc *p)
997 if ((random_offset = randompid) != 0) {
998 read_random(&random_offset, sizeof(random_offset));
999 random_offset = (random_offset & 0x7FFFFFFF) % randompid;
1001 proc_makepid(p, random_offset);
1005 * Calculate a new process pid. This function is integrated into
1006 * proc_add_allproc() to guarentee that the new pid is not reused before
1007 * the new process can be added to the allproc list.
1009 * p_pid is assigned and the process is added to the allproc hash table
1011 * WARNING! We need to allocate PIDs sequentially during early boot.
1012 * In particular, init needs to have a pid of 1.
1016 proc_makepid(struct proc *p, int random_offset)
1018 static pid_t nextpid = 1; /* heuristic, allowed to race */
1022 struct session *sess;
1029 * Select the next pid base candidate.
1031 * Check cyclement, do not allow a pid < 100.
1035 base = atomic_fetchadd_int(&nextpid, 1) + random_offset;
1036 if (base <= 0 || base >= PID_MAX) {
1037 base = base % PID_MAX;
1042 nextpid = base; /* reset (SMP race ok) */
1046 * Do not allow a base pid to be selected from a domain that has
1047 * recently seen a pid/pgid/sessid reap. Sleep a little if we looped
1048 * through all available domains.
1050 * WARNING: We want the early pids to be allocated linearly,
1051 * particularly pid 1 and pid 2.
1053 if (++retries >= PIDSEL_DOMAINS)
1054 tsleep(&nextpid, 0, "makepid", 1);
1056 delta8 = (int8_t)time_second -
1057 (int8_t)pid_doms[base % PIDSEL_DOMAINS];
1058 if (delta8 >= 0 && delta8 <= PIDDOM_DELAY) {
1065 * Calculate a hash index and find an unused process id within
1066 * the table, looping if we cannot find one.
1068 * The inner loop increments by ALLPROC_HSIZE which keeps the
1069 * PID at the same pid_doms[] index as well as the same hash index.
1071 n = ALLPROC_HASH(base);
1073 lwkt_gettoken(&prg->proc_token);
1076 LIST_FOREACH(ps, &prg->allproc, p_list) {
1077 if (ps->p_pid == base) {
1078 base += ALLPROC_HSIZE;
1079 if (base >= PID_MAX) {
1080 lwkt_reltoken(&prg->proc_token);
1087 LIST_FOREACH(pg, &prg->allpgrp, pg_list) {
1088 if (pg->pg_id == base) {
1089 base += ALLPROC_HSIZE;
1090 if (base >= PID_MAX) {
1091 lwkt_reltoken(&prg->proc_token);
1098 LIST_FOREACH(sess, &prg->allsess, s_list) {
1099 if (sess->s_sid == base) {
1100 base += ALLPROC_HSIZE;
1101 if (base >= PID_MAX) {
1102 lwkt_reltoken(&prg->proc_token);
1111 * Assign the pid and insert the process.
1114 LIST_INSERT_HEAD(&prg->allproc, p, p_list);
1115 lwkt_reltoken(&prg->proc_token);
1119 * Called from exit1 to place the process into a zombie state.
1120 * The process is removed from the pid hash and p_stat is set
1121 * to SZOMB. Normal pfind[n]() calls will not find it any more.
1123 * Caller must hold p->p_token. We are required to wait until p_lock
1124 * becomes zero before we can manipulate the list, allowing allproc
1125 * scans to guarantee consistency during a list scan.
1128 proc_move_allproc_zombie(struct proc *p)
1133 n = ALLPROC_HASH(p->p_pid);
1135 PSTALL(p, "reap1", 0);
1136 lwkt_gettoken(&prg->proc_token);
1138 PSTALL(p, "reap1a", 0);
1141 lwkt_reltoken(&prg->proc_token);
1142 dsched_exit_proc(p);
1146 * This routine is called from kern_wait() and will remove the process
1147 * from the zombie list and the sibling list. This routine will block
1148 * if someone has a lock on the proces (p_lock).
1150 * Caller must hold p->p_token. We are required to wait until p_lock
1151 * becomes one before we can manipulate the list, allowing allproc
1152 * scans to guarantee consistency during a list scan.
1154 * Assumes caller has one ref.
1157 proc_remove_zombie(struct proc *p)
1162 n = ALLPROC_HASH(p->p_pid);
1165 PSTALL(p, "reap2", 1);
1166 lwkt_gettoken(&prg->proc_token);
1167 PSTALL(p, "reap2a", 1);
1168 LIST_REMOVE(p, p_list); /* from remove master list */
1169 LIST_REMOVE(p, p_sibling); /* and from sibling list */
1172 if (pid_doms[p->p_pid % PIDSEL_DOMAINS] != (uint8_t)time_second)
1173 pid_doms[p->p_pid % PIDSEL_DOMAINS] = (uint8_t)time_second;
1174 lwkt_reltoken(&prg->proc_token);
1178 * Handle various requirements prior to returning to usermode. Called from
1179 * platform trap and system call code.
1182 lwpuserret(struct lwp *lp)
1184 struct proc *p = lp->lwp_proc;
1186 if (lp->lwp_mpflags & LWP_MP_VNLRU) {
1187 atomic_clear_int(&lp->lwp_mpflags, LWP_MP_VNLRU);
1190 if (lp->lwp_mpflags & LWP_MP_WEXIT) {
1191 lwkt_gettoken(&p->p_token);
1193 lwkt_reltoken(&p->p_token); /* NOT REACHED */
1198 * Kernel threads run from user processes can also accumulate deferred
1199 * actions which need to be acted upon. Callers include:
1201 * nfsd - Can allocate lots of vnodes
1204 lwpkthreaddeferred(void)
1206 struct lwp *lp = curthread->td_lwp;
1209 if (lp->lwp_mpflags & LWP_MP_VNLRU) {
1210 atomic_clear_int(&lp->lwp_mpflags, LWP_MP_VNLRU);
1217 proc_usermap(struct proc *p, int invfork)
1219 struct sys_upmap *upmap;
1221 lwkt_gettoken(&p->p_token);
1222 upmap = kmalloc(roundup2(sizeof(*upmap), PAGE_SIZE), M_PROC,
1224 if (p->p_upmap == NULL) {
1225 upmap->header[0].type = UKPTYPE_VERSION;
1226 upmap->header[0].offset = offsetof(struct sys_upmap, version);
1227 upmap->header[1].type = UPTYPE_RUNTICKS;
1228 upmap->header[1].offset = offsetof(struct sys_upmap, runticks);
1229 upmap->header[2].type = UPTYPE_FORKID;
1230 upmap->header[2].offset = offsetof(struct sys_upmap, forkid);
1231 upmap->header[3].type = UPTYPE_PID;
1232 upmap->header[3].offset = offsetof(struct sys_upmap, pid);
1233 upmap->header[4].type = UPTYPE_PROC_TITLE;
1234 upmap->header[4].offset = offsetof(struct sys_upmap,proc_title);
1235 upmap->header[5].type = UPTYPE_INVFORK;
1236 upmap->header[5].offset = offsetof(struct sys_upmap, invfork);
1238 upmap->version = UPMAP_VERSION;
1239 upmap->pid = p->p_pid;
1240 upmap->forkid = p->p_forkid;
1241 upmap->invfork = invfork;
1244 kfree(upmap, M_PROC);
1246 lwkt_reltoken(&p->p_token);
1250 proc_userunmap(struct proc *p)
1252 struct sys_upmap *upmap;
1254 lwkt_gettoken(&p->p_token);
1255 if ((upmap = p->p_upmap) != NULL) {
1257 kfree(upmap, M_PROC);
1259 lwkt_reltoken(&p->p_token);
1263 * Scan all processes on the allproc list. The process is automatically
1264 * held for the callback. A return value of -1 terminates the loop.
1265 * Zombie procs are skipped.
1267 * The callback is made with the process held and proc_token held.
1269 * We limit the scan to the number of processes as-of the start of
1270 * the scan so as not to get caught up in an endless loop if new processes
1271 * are created more quickly than we can scan the old ones. Add a little
1272 * slop to try to catch edge cases since nprocs can race.
1277 allproc_scan(int (*callback)(struct proc *, void *), void *data, int segmented)
1279 int limit = nprocs + ncpus;
1287 int id = mycpu->gd_cpuid;
1288 ns = id * ALLPROC_HSIZE / ncpus;
1289 ne = (id + 1) * ALLPROC_HSIZE / ncpus;
1296 * prg->proc_token protects the allproc list and PHOLD() prevents the
1297 * process from being removed from the allproc list or the zombproc
1300 for (n = ns; n < ne; ++n) {
1301 procglob_t *prg = &procglob[n];
1302 if (LIST_FIRST(&prg->allproc) == NULL)
1304 lwkt_gettoken(&prg->proc_token);
1305 LIST_FOREACH(p, &prg->allproc, p_list) {
1306 if (p->p_stat == SZOMB)
1309 r = callback(p, data);
1316 lwkt_reltoken(&prg->proc_token);
1319 * Check if asked to stop early
1327 * Scan all lwps of processes on the allproc list. The lwp is automatically
1328 * held for the callback. A return value of -1 terminates the loop.
1330 * The callback is made with the proces and lwp both held, and proc_token held.
1335 alllwp_scan(int (*callback)(struct lwp *, void *), void *data, int segmented)
1345 int id = mycpu->gd_cpuid;
1346 ns = id * ALLPROC_HSIZE / ncpus;
1347 ne = (id + 1) * ALLPROC_HSIZE / ncpus;
1353 for (n = ns; n < ne; ++n) {
1354 procglob_t *prg = &procglob[n];
1356 if (LIST_FIRST(&prg->allproc) == NULL)
1358 lwkt_gettoken(&prg->proc_token);
1359 LIST_FOREACH(p, &prg->allproc, p_list) {
1360 if (p->p_stat == SZOMB)
1363 lwkt_gettoken(&p->p_token);
1364 FOREACH_LWP_IN_PROC(lp, p) {
1366 r = callback(lp, data);
1369 lwkt_reltoken(&p->p_token);
1374 lwkt_reltoken(&prg->proc_token);
1377 * Asked to exit early
1385 * Scan all processes on the zombproc list. The process is automatically
1386 * held for the callback. A return value of -1 terminates the loop.
1389 * The callback is made with the proces held and proc_token held.
1392 zombproc_scan(int (*callback)(struct proc *, void *), void *data)
1399 * prg->proc_token protects the allproc list and PHOLD() prevents the
1400 * process from being removed from the allproc list or the zombproc
1403 for (n = 0; n < ALLPROC_HSIZE; ++n) {
1404 procglob_t *prg = &procglob[n];
1406 if (LIST_FIRST(&prg->allproc) == NULL)
1408 lwkt_gettoken(&prg->proc_token);
1409 LIST_FOREACH(p, &prg->allproc, p_list) {
1410 if (p->p_stat != SZOMB)
1413 r = callback(p, data);
1418 lwkt_reltoken(&prg->proc_token);
1421 * Check if asked to stop early
1428 #include "opt_ddb.h"
1430 #include <ddb/ddb.h>
1435 DB_SHOW_COMMAND(pgrpdump, pgrpdump)
1442 for (i = 0; i < ALLPROC_HSIZE; ++i) {
1445 if (LIST_EMPTY(&prg->allpgrp))
1447 kprintf("\tindx %d\n", i);
1448 LIST_FOREACH(pgrp, &prg->allpgrp, pg_list) {
1449 kprintf("\tpgrp %p, pgid %ld, sess %p, "
1450 "sesscnt %d, mem %p\n",
1451 (void *)pgrp, (long)pgrp->pg_id,
1452 (void *)pgrp->pg_session,
1453 pgrp->pg_session->s_count,
1454 (void *)LIST_FIRST(&pgrp->pg_members));
1455 LIST_FOREACH(p, &pgrp->pg_members, p_pglist) {
1456 kprintf("\t\tpid %ld addr %p pgrp %p\n",
1457 (long)p->p_pid, (void *)p,
1466 * The caller must hold proc_token.
1469 sysctl_out_proc(struct proc *p, struct sysctl_req *req, int flags)
1471 struct kinfo_proc ki;
1473 int skp = 0, had_output = 0;
1476 bzero(&ki, sizeof(ki));
1477 lwkt_gettoken_shared(&p->p_token);
1478 fill_kinfo_proc(p, &ki);
1479 if ((flags & KERN_PROC_FLAG_LWP) == 0)
1482 FOREACH_LWP_IN_PROC(lp, p) {
1484 fill_kinfo_lwp(lp, &ki.kp_lwp);
1486 error = SYSCTL_OUT(req, &ki, sizeof(ki));
1493 lwkt_reltoken(&p->p_token);
1494 /* We need to output at least the proc, even if there is no lwp. */
1495 if (had_output == 0) {
1496 error = SYSCTL_OUT(req, &ki, sizeof(ki));
1502 * The caller must hold proc_token.
1505 sysctl_out_proc_kthread(struct thread *td, struct sysctl_req *req)
1507 struct kinfo_proc ki;
1510 fill_kinfo_proc_kthread(td, &ki);
1511 error = SYSCTL_OUT(req, &ki, sizeof(ki));
1521 sysctl_kern_proc(SYSCTL_HANDLER_ARGS)
1523 int *name = (int *)arg1;
1524 int oid = oidp->oid_number;
1525 u_int namelen = arg2;
1528 struct thread *marker;
1533 struct ucred *cr1 = curproc->p_ucred;
1534 struct ucred *crcache = NULL;
1536 flags = oid & KERN_PROC_FLAGMASK;
1537 oid &= ~KERN_PROC_FLAGMASK;
1539 if ((oid == KERN_PROC_ALL && namelen != 0) ||
1540 (oid != KERN_PROC_ALL && namelen != 1)) {
1545 * proc_token protects the allproc list and PHOLD() prevents the
1546 * process from being removed from the allproc list or the zombproc
1549 if (oid == KERN_PROC_PID) {
1550 p = pfind((pid_t)name[0]);
1552 crcache = pcredcache(crcache, p);
1553 if (PRISON_CHECK(cr1, crcache))
1554 error = sysctl_out_proc(p, req, flags);
1562 /* overestimate by 5 procs */
1563 error = SYSCTL_OUT(req, 0, sizeof (struct kinfo_proc) * 5);
1568 for (n = 0; n < ALLPROC_HSIZE; ++n) {
1569 procglob_t *prg = &procglob[n];
1571 if (LIST_EMPTY(&prg->allproc))
1573 lwkt_gettoken_shared(&prg->proc_token);
1574 LIST_FOREACH(p, &prg->allproc, p_list) {
1576 * Show a user only their processes.
1578 if (ps_showallprocs == 0) {
1579 crcache = pcredcache(crcache, p);
1580 if (crcache == NULL ||
1581 p_trespass(cr1, crcache)) {
1587 * Skip embryonic processes.
1589 if (p->p_stat == SIDL)
1592 * TODO - make more efficient (see notes below).
1596 case KERN_PROC_PGRP:
1597 /* could do this by traversing pgrp */
1598 if (p->p_pgrp == NULL ||
1599 p->p_pgrp->pg_id != (pid_t)name[0])
1604 if ((p->p_flags & P_CONTROLT) == 0 ||
1605 p->p_session == NULL ||
1606 p->p_session->s_ttyp == NULL ||
1607 dev2udev(p->p_session->s_ttyp->t_dev) !=
1613 crcache = pcredcache(crcache, p);
1614 if (crcache == NULL ||
1615 crcache->cr_uid != (uid_t)name[0]) {
1620 case KERN_PROC_RUID:
1621 crcache = pcredcache(crcache, p);
1622 if (crcache == NULL ||
1623 crcache->cr_ruid != (uid_t)name[0]) {
1629 crcache = pcredcache(crcache, p);
1630 if (!PRISON_CHECK(cr1, crcache))
1633 error = sysctl_out_proc(p, req, flags);
1636 lwkt_reltoken(&prg->proc_token);
1640 lwkt_reltoken(&prg->proc_token);
1644 * Iterate over all active cpus and scan their thread list. Start
1645 * with the next logical cpu and end with our original cpu. We
1646 * migrate our own thread to each target cpu in order to safely scan
1647 * its thread list. In the last loop we migrate back to our original
1650 origcpu = mycpu->gd_cpuid;
1651 if (!ps_showallthreads || jailed(cr1))
1654 marker = kmalloc(sizeof(struct thread), M_TEMP, M_WAITOK|M_ZERO);
1655 marker->td_flags = TDF_MARKER;
1658 for (n = 1; n <= ncpus; ++n) {
1662 nid = (origcpu + n) % ncpus;
1663 if (CPUMASK_TESTBIT(smp_active_mask, nid) == 0)
1665 rgd = globaldata_find(nid);
1666 lwkt_setcpu_self(rgd);
1669 TAILQ_INSERT_TAIL(&rgd->gd_tdallq, marker, td_allq);
1671 while ((td = TAILQ_PREV(marker, lwkt_queue, td_allq)) != NULL) {
1672 TAILQ_REMOVE(&rgd->gd_tdallq, marker, td_allq);
1673 TAILQ_INSERT_BEFORE(td, marker, td_allq);
1674 if (td->td_flags & TDF_MARKER)
1683 case KERN_PROC_PGRP:
1686 case KERN_PROC_RUID:
1689 error = sysctl_out_proc_kthread(td, req);
1697 TAILQ_REMOVE(&rgd->gd_tdallq, marker, td_allq);
1705 * Userland scheduler expects us to return on the same cpu we
1708 if (mycpu->gd_cpuid != origcpu)
1709 lwkt_setcpu_self(globaldata_find(origcpu));
1711 kfree(marker, M_TEMP);
1720 * This sysctl allows a process to retrieve the argument list or process
1721 * title for another process without groping around in the address space
1722 * of the other process. It also allow a process to set its own "process
1723 * title to a string of its own choice.
1728 sysctl_kern_proc_args(SYSCTL_HANDLER_ARGS)
1730 int *name = (int*) arg1;
1731 u_int namelen = arg2;
1736 struct ucred *cr1 = curproc->p_ucred;
1741 p = pfind((pid_t)name[0]);
1744 lwkt_gettoken(&p->p_token);
1746 if ((!ps_argsopen) && p_trespass(cr1, p->p_ucred))
1749 if (req->newptr && curproc != p) {
1754 if (p->p_upmap != NULL && p->p_upmap->proc_title[0]) {
1756 * Args set via writable user process mmap.
1757 * We must calculate the string length manually
1758 * because the user data can change at any time.
1763 base = p->p_upmap->proc_title;
1764 for (n = 0; n < UPMAP_MAXPROCTITLE - 1; ++n) {
1768 error = SYSCTL_OUT(req, base, n);
1770 error = SYSCTL_OUT(req, "", 1);
1771 } else if ((pa = p->p_args) != NULL) {
1773 * Args set by setproctitle() sysctl.
1775 refcount_acquire(&pa->ar_ref);
1776 error = SYSCTL_OUT(req, pa->ar_args, pa->ar_length);
1777 if (refcount_release(&pa->ar_ref))
1781 if (req->newptr == NULL)
1784 if (req->newlen + sizeof(struct pargs) > ps_arg_cache_limit) {
1788 pa = kmalloc(sizeof(struct pargs) + req->newlen, M_PARGS, M_WAITOK);
1789 refcount_init(&pa->ar_ref, 1);
1790 pa->ar_length = req->newlen;
1791 error = SYSCTL_IN(req, pa->ar_args, req->newlen);
1799 * Replace p_args with the new pa. p_args may have previously
1806 KKASSERT(opa->ar_ref > 0);
1807 if (refcount_release(&opa->ar_ref)) {
1808 kfree(opa, M_PARGS);
1814 lwkt_reltoken(&p->p_token);
1821 sysctl_kern_proc_cwd(SYSCTL_HANDLER_ARGS)
1823 int *name = (int*) arg1;
1824 u_int namelen = arg2;
1827 char *fullpath, *freepath;
1828 struct ucred *cr1 = curproc->p_ucred;
1833 p = pfind((pid_t)name[0]);
1836 lwkt_gettoken_shared(&p->p_token);
1839 * If we are not allowed to see other args, we certainly shouldn't
1840 * get the cwd either. Also check the usual trespassing.
1842 if ((!ps_argsopen) && p_trespass(cr1, p->p_ucred))
1845 if (req->oldptr && p->p_fd != NULL && p->p_fd->fd_ncdir.ncp) {
1846 struct nchandle nch;
1848 cache_copy(&p->p_fd->fd_ncdir, &nch);
1849 error = cache_fullpath(p, &nch, NULL,
1850 &fullpath, &freepath, 0);
1854 error = SYSCTL_OUT(req, fullpath, strlen(fullpath) + 1);
1855 kfree(freepath, M_TEMP);
1860 lwkt_reltoken(&p->p_token);
1867 * This sysctl allows a process to retrieve the path of the executable for
1868 * itself or another process.
1871 sysctl_kern_proc_pathname(SYSCTL_HANDLER_ARGS)
1873 pid_t *pidp = (pid_t *)arg1;
1874 unsigned int arglen = arg2;
1876 char *retbuf, *freebuf;
1878 struct nchandle nch;
1882 if (*pidp == -1) { /* -1 means this process */
1890 cache_copy(&p->p_textnch, &nch);
1891 error = cache_fullpath(p, &nch, NULL, &retbuf, &freebuf, 0);
1895 error = SYSCTL_OUT(req, retbuf, strlen(retbuf) + 1);
1896 kfree(freebuf, M_TEMP);
1905 sysctl_kern_proc_sigtramp(SYSCTL_HANDLER_ARGS)
1907 /*int *name = (int *)arg1;*/
1908 u_int namelen = arg2;
1909 struct kinfo_sigtramp kst;
1910 const struct sysentvec *sv;
1915 /* ignore pid if passed in (freebsd compatibility) */
1917 sv = curproc->p_sysent;
1918 bzero(&kst, sizeof(kst));
1919 if (sv->sv_szsigcode) {
1922 sigbase = trunc_page64((intptr_t)PS_STRINGS -
1924 sigbase -= SZSIGCODE_EXTRA_BYTES;
1926 kst.ksigtramp_start = (void *)sigbase;
1927 kst.ksigtramp_end = (void *)(sigbase + *sv->sv_szsigcode);
1929 error = SYSCTL_OUT(req, &kst, sizeof(kst));
1934 SYSCTL_NODE(_kern, KERN_PROC, proc, CTLFLAG_RD, 0, "Process table");
1936 SYSCTL_PROC(_kern_proc, KERN_PROC_ALL, all,
1937 CTLFLAG_RD | CTLTYPE_STRUCT | CTLFLAG_NOLOCK,
1938 0, 0, sysctl_kern_proc, "S,proc", "Return entire process table");
1940 SYSCTL_NODE(_kern_proc, KERN_PROC_PGRP, pgrp,
1941 CTLFLAG_RD | CTLFLAG_NOLOCK,
1942 sysctl_kern_proc, "Process table");
1944 SYSCTL_NODE(_kern_proc, KERN_PROC_TTY, tty,
1945 CTLFLAG_RD | CTLFLAG_NOLOCK,
1946 sysctl_kern_proc, "Process table");
1948 SYSCTL_NODE(_kern_proc, KERN_PROC_UID, uid,
1949 CTLFLAG_RD | CTLFLAG_NOLOCK,
1950 sysctl_kern_proc, "Process table");
1952 SYSCTL_NODE(_kern_proc, KERN_PROC_RUID, ruid,
1953 CTLFLAG_RD | CTLFLAG_NOLOCK,
1954 sysctl_kern_proc, "Process table");
1956 SYSCTL_NODE(_kern_proc, KERN_PROC_PID, pid,
1957 CTLFLAG_RD | CTLFLAG_NOLOCK,
1958 sysctl_kern_proc, "Process table");
1960 SYSCTL_NODE(_kern_proc, (KERN_PROC_ALL | KERN_PROC_FLAG_LWP), all_lwp,
1961 CTLFLAG_RD | CTLFLAG_NOLOCK,
1962 sysctl_kern_proc, "Process table");
1964 SYSCTL_NODE(_kern_proc, (KERN_PROC_PGRP | KERN_PROC_FLAG_LWP), pgrp_lwp,
1965 CTLFLAG_RD | CTLFLAG_NOLOCK,
1966 sysctl_kern_proc, "Process table");
1968 SYSCTL_NODE(_kern_proc, (KERN_PROC_TTY | KERN_PROC_FLAG_LWP), tty_lwp,
1969 CTLFLAG_RD | CTLFLAG_NOLOCK,
1970 sysctl_kern_proc, "Process table");
1972 SYSCTL_NODE(_kern_proc, (KERN_PROC_UID | KERN_PROC_FLAG_LWP), uid_lwp,
1973 CTLFLAG_RD | CTLFLAG_NOLOCK,
1974 sysctl_kern_proc, "Process table");
1976 SYSCTL_NODE(_kern_proc, (KERN_PROC_RUID | KERN_PROC_FLAG_LWP), ruid_lwp,
1977 CTLFLAG_RD | CTLFLAG_NOLOCK,
1978 sysctl_kern_proc, "Process table");
1980 SYSCTL_NODE(_kern_proc, (KERN_PROC_PID | KERN_PROC_FLAG_LWP), pid_lwp,
1981 CTLFLAG_RD | CTLFLAG_NOLOCK,
1982 sysctl_kern_proc, "Process table");
1984 SYSCTL_NODE(_kern_proc, KERN_PROC_ARGS, args,
1985 CTLFLAG_RW | CTLFLAG_ANYBODY | CTLFLAG_NOLOCK,
1986 sysctl_kern_proc_args, "Process argument list");
1988 SYSCTL_NODE(_kern_proc, KERN_PROC_CWD, cwd,
1989 CTLFLAG_RD | CTLFLAG_ANYBODY | CTLFLAG_NOLOCK,
1990 sysctl_kern_proc_cwd, "Process argument list");
1992 static SYSCTL_NODE(_kern_proc, KERN_PROC_PATHNAME, pathname,
1993 CTLFLAG_RD | CTLFLAG_NOLOCK,
1994 sysctl_kern_proc_pathname, "Process executable path");
1996 SYSCTL_PROC(_kern_proc, KERN_PROC_SIGTRAMP, sigtramp,
1997 CTLFLAG_RD | CTLTYPE_STRUCT | CTLFLAG_NOLOCK,
1998 0, 0, sysctl_kern_proc_sigtramp, "S,sigtramp",
1999 "Return sigtramp address range");