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>
47 #include <sys/kinfo.h>
49 #include <vm/vm_map.h>
50 #include <machine/smp.h>
52 #include <sys/refcount.h>
53 #include <sys/spinlock2.h>
56 * Hash table size must be a power of two and is not currently dynamically
57 * sized. There is a trade-off between the linear scans which must iterate
58 * all HSIZE elements and the number of elements which might accumulate
59 * within each hash chain.
61 #define ALLPROC_HSIZE 256
62 #define ALLPROC_HMASK (ALLPROC_HSIZE - 1)
63 #define ALLPROC_HASH(pid) (pid & ALLPROC_HMASK)
64 #define PGRP_HASH(pid) (pid & ALLPROC_HMASK)
65 #define SESS_HASH(pid) (pid & ALLPROC_HMASK)
68 * pid_doms[] management, used to control how quickly a PID can be recycled.
69 * Must be a multiple of ALLPROC_HSIZE for the proc_makepid() inner loops.
71 * WARNING! PIDDOM_DELAY should not be defined > 20 or so unless you change
72 * the array from int8_t's to int16_t's.
74 #define PIDDOM_COUNT 10 /* 10 pids per domain - reduce array size */
75 #define PIDDOM_DELAY 10 /* min 10 seconds after exit before reuse */
76 #define PIDDOM_SCALE 10 /* (10,000*SCALE)/sec performance guarantee */
77 #define PIDSEL_DOMAINS rounddown(PID_MAX * PIDDOM_SCALE / PIDDOM_COUNT, ALLPROC_HSIZE)
80 int allproc_hsize = ALLPROC_HSIZE;
82 LIST_HEAD(pidhashhead, proc);
84 static MALLOC_DEFINE(M_PGRP, "pgrp", "process group header");
85 MALLOC_DEFINE(M_SESSION, "session", "session header");
86 MALLOC_DEFINE(M_PROC, "proc", "Proc structures");
87 MALLOC_DEFINE(M_LWP, "lwp", "lwp structures");
88 MALLOC_DEFINE(M_SUBPROC, "subproc", "Proc sub-structures");
90 int ps_showallprocs = 1;
91 static int ps_showallthreads = 1;
92 SYSCTL_INT(_security, OID_AUTO, ps_showallprocs, CTLFLAG_RW,
94 "Unprivileged processes can see processes with different UID/GID");
95 SYSCTL_INT(_security, OID_AUTO, ps_showallthreads, CTLFLAG_RW,
96 &ps_showallthreads, 0,
97 "Unprivileged processes can see kernel threads");
98 static u_int pid_domain_skips;
99 SYSCTL_UINT(_kern, OID_AUTO, pid_domain_skips, CTLFLAG_RW,
100 &pid_domain_skips, 0,
101 "Number of pid_doms[] skipped");
102 static u_int pid_inner_skips;
103 SYSCTL_UINT(_kern, OID_AUTO, pid_inner_skips, CTLFLAG_RW,
105 "Number of pid_doms[] skipped");
107 static void orphanpg(struct pgrp *pg);
108 static void proc_makepid(struct proc *p, int random_offset);
111 * Process related lists (for proc_token, allproc, allpgrp, and allsess)
113 typedef struct procglob procglob_t;
115 static procglob_t procglob[ALLPROC_HSIZE];
118 * We try our best to avoid recycling a PID too quickly. We do this by
119 * storing (uint8_t)time_second in the related pid domain on-reap and then
120 * using that to skip-over the domain on-allocate.
122 * This array has to be fairly large to support a high fork/exec rate.
123 * A ~100,000 entry array will support a 10-second reuse latency at
124 * 10,000 execs/second, worst case. Best-case multiply by PIDDOM_COUNT
125 * (approximately 100,000 execs/second).
127 * Currently we allocate around a megabyte, making the worst-case fork
128 * rate around 100,000/second.
130 static uint8_t *pid_doms;
133 * Random component to nextpid generation. We mix in a random factor to make
134 * it a little harder to predict. We sanity check the modulus value to avoid
135 * doing it in critical paths. Don't let it be too small or we pointlessly
136 * waste randomness entropy, and don't let it be impossibly large. Using a
137 * modulus that is too big causes a LOT more process table scans and slows
138 * down fork processing as the pidchecked caching is defeated.
140 static int randompid = 0;
144 pcredcache(struct ucred *cr, struct proc *p)
146 if (cr != p->p_ucred) {
149 spin_lock(&p->p_spin);
150 if ((cr = p->p_ucred) != NULL)
152 spin_unlock(&p->p_spin);
161 sysctl_kern_randompid(SYSCTL_HANDLER_ARGS)
166 error = sysctl_handle_int(oidp, &pid, 0, req);
167 if (error || !req->newptr)
169 if (pid < 0 || pid > PID_MAX - 100) /* out of range */
171 else if (pid < 2) /* NOP */
173 else if (pid < 100) /* Make it reasonable */
179 SYSCTL_PROC(_kern, OID_AUTO, randompid, CTLTYPE_INT|CTLFLAG_RW,
180 0, 0, sysctl_kern_randompid, "I", "Random PID modulus");
183 * Initialize global process hashing structures.
185 * These functions are ONLY called from the low level boot code and do
186 * not lock their operations.
194 * Allocate dynamically. This array can be large (~1MB) so don't
195 * waste boot loader space.
197 pid_doms = kmalloc(sizeof(pid_doms[0]) * PIDSEL_DOMAINS,
198 M_PROC, M_WAITOK | M_ZERO);
201 * Avoid unnecessary stalls due to pid_doms[] values all being
202 * the same. Make sure that the allocation of pid 1 and pid 2
205 for (i = 0; i < PIDSEL_DOMAINS; ++i)
206 pid_doms[i] = (int8_t)i - (int8_t)(PIDDOM_DELAY + 1);
211 for (i = 0; i < ALLPROC_HSIZE; ++i) {
212 procglob_t *prg = &procglob[i];
213 LIST_INIT(&prg->allproc);
214 LIST_INIT(&prg->allsess);
215 LIST_INIT(&prg->allpgrp);
216 lwkt_token_init(&prg->proc_token, "allproc");
222 procinsertinit(struct proc *p)
224 LIST_INSERT_HEAD(&procglob[ALLPROC_HASH(p->p_pid)].allproc,
229 pgrpinsertinit(struct pgrp *pg)
231 LIST_INSERT_HEAD(&procglob[ALLPROC_HASH(pg->pg_id)].allpgrp,
236 sessinsertinit(struct session *sess)
238 LIST_INSERT_HEAD(&procglob[ALLPROC_HASH(sess->s_sid)].allsess,
243 * Process hold/release support functions. Called via the PHOLD(),
244 * PRELE(), and PSTALL() macros.
246 * p->p_lock is a simple hold count with a waiting interlock. No wakeup()
247 * is issued unless someone is actually waiting for the process.
249 * Most holds are short-term, allowing a process scan or other similar
250 * operation to access a proc structure without it getting ripped out from
251 * under us. procfs and process-list sysctl ops also use the hold function
252 * interlocked with various p_flags to keep the vmspace intact when reading
253 * or writing a user process's address space.
255 * There are two situations where a hold count can be longer. Exiting lwps
256 * hold the process until the lwp is reaped, and the parent will hold the
257 * child during vfork()/exec() sequences while the child is marked P_PPWAIT.
259 * The kernel waits for the hold count to drop to 0 (or 1 in some cases) at
260 * various critical points in the fork/exec and exit paths before proceeding.
262 #define PLOCK_ZOMB 0x20000000
263 #define PLOCK_WAITING 0x40000000
264 #define PLOCK_MASK 0x1FFFFFFF
267 pstall(struct proc *p, const char *wmesg, int count)
275 if ((o & PLOCK_MASK) <= count)
277 n = o | PLOCK_WAITING;
278 tsleep_interlock(&p->p_lock, 0);
281 * If someone is trying to single-step the process during
282 * an exec or an exit they can deadlock us because procfs
283 * sleeps with the process held.
286 if (p->p_flags & P_INEXEC) {
288 } else if (p->p_flags & P_POSTEXIT) {
289 spin_lock(&p->p_spin);
292 spin_unlock(&p->p_spin);
297 if (atomic_cmpset_int(&p->p_lock, o, n)) {
298 tsleep(&p->p_lock, PINTERLOCKED, wmesg, 0);
304 phold(struct proc *p)
306 atomic_add_int(&p->p_lock, 1);
310 * WARNING! On last release (p) can become instantly invalid due to
314 prele(struct proc *p)
322 if (atomic_cmpset_int(&p->p_lock, 1, 0))
330 KKASSERT((o & PLOCK_MASK) > 0);
332 n = (o - 1) & ~PLOCK_WAITING;
333 if (atomic_cmpset_int(&p->p_lock, o, n)) {
334 if (o & PLOCK_WAITING)
342 * Hold and flag serialized for zombie reaping purposes.
344 * This function will fail if it has to block, returning non-zero with
345 * neither the flag set or the hold count bumped. Note that (p) may
346 * not be valid in this case if the caller does not have some other
349 * This function does not block on other PHOLD()s, only on other
352 * Zero is returned on success. The hold count will be incremented and
353 * the serialization flag acquired. Note that serialization is only against
354 * other pholdzomb() calls, not against phold() calls.
357 pholdzomb(struct proc *p)
365 if (atomic_cmpset_int(&p->p_lock, 0, PLOCK_ZOMB | 1))
374 if ((o & PLOCK_ZOMB) == 0) {
375 n = (o + 1) | PLOCK_ZOMB;
376 if (atomic_cmpset_int(&p->p_lock, o, n))
379 KKASSERT((o & PLOCK_MASK) > 0);
380 n = o | PLOCK_WAITING;
381 tsleep_interlock(&p->p_lock, 0);
382 if (atomic_cmpset_int(&p->p_lock, o, n)) {
383 tsleep(&p->p_lock, PINTERLOCKED, "phldz", 0);
384 /* (p) can be ripped out at this point */
392 * Release PLOCK_ZOMB and the hold count, waking up any waiters.
394 * WARNING! On last release (p) can become instantly invalid due to
398 prelezomb(struct proc *p)
406 if (atomic_cmpset_int(&p->p_lock, PLOCK_ZOMB | 1, 0))
412 KKASSERT(p->p_lock & PLOCK_ZOMB);
415 KKASSERT((o & PLOCK_MASK) > 0);
417 n = (o - 1) & ~(PLOCK_ZOMB | PLOCK_WAITING);
418 if (atomic_cmpset_int(&p->p_lock, o, n)) {
419 if (o & PLOCK_WAITING)
427 * Is p an inferior of the current process?
432 inferior(struct proc *p)
437 lwkt_gettoken_shared(&p->p_token);
438 while (p != curproc) {
440 lwkt_reltoken(&p->p_token);
445 lwkt_reltoken(&p->p_token);
447 lwkt_gettoken_shared(&p2->p_token);
450 lwkt_reltoken(&p->p_token);
457 * Locate a process by number. The returned process will be referenced and
458 * must be released with PRELE().
465 struct proc *p = curproc;
470 * Shortcut the current process
472 if (p && p->p_pid == pid) {
478 * Otherwise find it in the hash table.
480 n = ALLPROC_HASH(pid);
483 lwkt_gettoken_shared(&prg->proc_token);
484 LIST_FOREACH(p, &prg->allproc, p_list) {
485 if (p->p_stat == SZOMB)
487 if (p->p_pid == pid) {
489 lwkt_reltoken(&prg->proc_token);
493 lwkt_reltoken(&prg->proc_token);
499 * Locate a process by number. The returned process is NOT referenced.
500 * The result will not be stable and is typically only used to validate
501 * against a process that the caller has in-hand.
508 struct proc *p = curproc;
513 * Shortcut the current process
515 if (p && p->p_pid == pid)
519 * Otherwise find it in the hash table.
521 n = ALLPROC_HASH(pid);
524 lwkt_gettoken_shared(&prg->proc_token);
525 LIST_FOREACH(p, &prg->allproc, p_list) {
526 if (p->p_stat == SZOMB)
528 if (p->p_pid == pid) {
529 lwkt_reltoken(&prg->proc_token);
533 lwkt_reltoken(&prg->proc_token);
539 * Locate a process on the zombie list. Return a process or NULL.
540 * The returned process will be referenced and the caller must release
543 * No other requirements.
548 struct proc *p = curproc;
553 * Shortcut the current process
555 if (p && p->p_pid == pid) {
561 * Otherwise find it in the hash table.
563 n = ALLPROC_HASH(pid);
566 lwkt_gettoken_shared(&prg->proc_token);
567 LIST_FOREACH(p, &prg->allproc, p_list) {
568 if (p->p_stat != SZOMB)
570 if (p->p_pid == pid) {
572 lwkt_reltoken(&prg->proc_token);
576 lwkt_reltoken(&prg->proc_token);
583 pgref(struct pgrp *pgrp)
585 refcount_acquire(&pgrp->pg_refs);
589 pgrel(struct pgrp *pgrp)
595 n = PGRP_HASH(pgrp->pg_id);
599 count = pgrp->pg_refs;
603 lwkt_gettoken(&prg->proc_token);
604 if (atomic_cmpset_int(&pgrp->pg_refs, 1, 0))
606 lwkt_reltoken(&prg->proc_token);
609 if (atomic_cmpset_int(&pgrp->pg_refs, count, count - 1))
616 * Successful 1->0 transition, pghash_spin is held.
618 LIST_REMOVE(pgrp, pg_list);
619 if (pid_doms[pgrp->pg_id % PIDSEL_DOMAINS] != (uint8_t)time_second)
620 pid_doms[pgrp->pg_id % PIDSEL_DOMAINS] = (uint8_t)time_second;
623 * Reset any sigio structures pointing to us as a result of
624 * F_SETOWN with our pgid.
626 funsetownlst(&pgrp->pg_sigiolst);
628 if (pgrp->pg_session->s_ttyp != NULL &&
629 pgrp->pg_session->s_ttyp->t_pgrp == pgrp) {
630 pgrp->pg_session->s_ttyp->t_pgrp = NULL;
632 lwkt_reltoken(&prg->proc_token);
634 sess_rele(pgrp->pg_session);
639 * Locate a process group by number. The returned process group will be
640 * referenced w/pgref() and must be released with pgrel() (or assigned
641 * somewhere if you wish to keep the reference).
654 lwkt_gettoken_shared(&prg->proc_token);
656 LIST_FOREACH(pgrp, &prg->allpgrp, pg_list) {
657 if (pgrp->pg_id == pgid) {
658 refcount_acquire(&pgrp->pg_refs);
659 lwkt_reltoken(&prg->proc_token);
663 lwkt_reltoken(&prg->proc_token);
668 * Move p to a new or existing process group (and session)
673 enterpgrp(struct proc *p, pid_t pgid, int mksess)
681 KASSERT(pgrp == NULL || !mksess,
682 ("enterpgrp: setsid into non-empty pgrp"));
683 KASSERT(!SESS_LEADER(p),
684 ("enterpgrp: session leader attempted setpgrp"));
687 pid_t savepid = p->p_pid;
695 KASSERT(p->p_pid == pgid,
696 ("enterpgrp: new pgrp and pid != pgid"));
697 pgrp = kmalloc(sizeof(struct pgrp), M_PGRP, M_WAITOK | M_ZERO);
699 LIST_INIT(&pgrp->pg_members);
701 SLIST_INIT(&pgrp->pg_sigiolst);
702 lwkt_token_init(&pgrp->pg_token, "pgrp_token");
703 refcount_init(&pgrp->pg_refs, 1);
704 lockinit(&pgrp->pg_lock, "pgwt", 0, 0);
709 if ((np = pfindn(savepid)) == NULL || np != p) {
710 lwkt_reltoken(&prg->proc_token);
716 lwkt_gettoken(&prg->proc_token);
718 struct session *sess;
723 sess = kmalloc(sizeof(struct session), M_SESSION,
725 lwkt_gettoken(&p->p_token);
728 sess->s_sid = p->p_pid;
730 sess->s_ttyvp = NULL;
732 bcopy(p->p_session->s_login, sess->s_login,
733 sizeof(sess->s_login));
734 pgrp->pg_session = sess;
735 KASSERT(p == curproc,
736 ("enterpgrp: mksession and p != curproc"));
737 p->p_flags &= ~P_CONTROLT;
738 LIST_INSERT_HEAD(&prg->allsess, sess, s_list);
739 lwkt_reltoken(&p->p_token);
741 lwkt_gettoken(&p->p_token);
742 pgrp->pg_session = p->p_session;
743 sess_hold(pgrp->pg_session);
744 lwkt_reltoken(&p->p_token);
746 LIST_INSERT_HEAD(&prg->allpgrp, pgrp, pg_list);
748 lwkt_reltoken(&prg->proc_token);
749 } else if (pgrp == p->p_pgrp) {
752 } /* else pgfind() referenced the pgrp */
754 lwkt_gettoken(&pgrp->pg_token);
755 lwkt_gettoken(&p->p_token);
758 * Replace p->p_pgrp, handling any races that occur.
760 while ((opgrp = p->p_pgrp) != NULL) {
762 lwkt_gettoken(&opgrp->pg_token);
763 if (opgrp != p->p_pgrp) {
764 lwkt_reltoken(&opgrp->pg_token);
768 LIST_REMOVE(p, p_pglist);
772 LIST_INSERT_HEAD(&pgrp->pg_members, p, p_pglist);
775 * Adjust eligibility of affected pgrps to participate in job control.
776 * Increment eligibility counts before decrementing, otherwise we
777 * could reach 0 spuriously during the first call.
781 fixjobc(p, opgrp, 0);
782 lwkt_reltoken(&opgrp->pg_token);
783 pgrel(opgrp); /* manual pgref */
784 pgrel(opgrp); /* p->p_pgrp ref */
786 lwkt_reltoken(&p->p_token);
787 lwkt_reltoken(&pgrp->pg_token);
795 * Remove process from process group
800 leavepgrp(struct proc *p)
802 struct pgrp *pg = p->p_pgrp;
804 lwkt_gettoken(&p->p_token);
805 while ((pg = p->p_pgrp) != NULL) {
807 lwkt_gettoken(&pg->pg_token);
808 if (p->p_pgrp != pg) {
809 lwkt_reltoken(&pg->pg_token);
814 LIST_REMOVE(p, p_pglist);
815 lwkt_reltoken(&pg->pg_token);
816 pgrel(pg); /* manual pgref */
817 pgrel(pg); /* p->p_pgrp ref */
820 lwkt_reltoken(&p->p_token);
826 * Adjust the ref count on a session structure. When the ref count falls to
827 * zero the tty is disassociated from the session and the session structure
828 * is freed. Note that tty assocation is not itself ref-counted.
833 sess_hold(struct session *sp)
835 atomic_add_int(&sp->s_count, 1);
842 sess_rele(struct session *sess)
849 n = SESS_HASH(sess->s_sid);
853 count = sess->s_count;
857 lwkt_gettoken(&prg->proc_token);
858 if (atomic_cmpset_int(&sess->s_count, 1, 0))
860 lwkt_reltoken(&prg->proc_token);
863 if (atomic_cmpset_int(&sess->s_count, count, count - 1))
870 * Successful 1->0 transition and prg->proc_token is held.
872 LIST_REMOVE(sess, s_list);
873 if (pid_doms[sess->s_sid % PIDSEL_DOMAINS] != (uint8_t)time_second)
874 pid_doms[sess->s_sid % PIDSEL_DOMAINS] = (uint8_t)time_second;
876 if (sess->s_ttyp && sess->s_ttyp->t_session) {
877 #ifdef TTY_DO_FULL_CLOSE
878 /* FULL CLOSE, see ttyclearsession() */
879 KKASSERT(sess->s_ttyp->t_session == sess);
880 sess->s_ttyp->t_session = NULL;
882 /* HALF CLOSE, see ttyclearsession() */
883 if (sess->s_ttyp->t_session == sess)
884 sess->s_ttyp->t_session = NULL;
887 if ((tp = sess->s_ttyp) != NULL) {
891 lwkt_reltoken(&prg->proc_token);
893 kfree(sess, M_SESSION);
897 * Adjust pgrp jobc counters when specified process changes process group.
898 * We count the number of processes in each process group that "qualify"
899 * the group for terminal job control (those with a parent in a different
900 * process group of the same session). If that count reaches zero, the
901 * process group becomes orphaned. Check both the specified process'
902 * process group and that of its children.
903 * entering == 0 => p is leaving specified group.
904 * entering == 1 => p is entering specified group.
909 fixjobc(struct proc *p, struct pgrp *pgrp, int entering)
911 struct pgrp *hispgrp;
912 struct session *mysession;
916 * Check p's parent to see whether p qualifies its own process
917 * group; if so, adjust count for p's process group.
919 lwkt_gettoken(&p->p_token); /* p_children scan */
920 lwkt_gettoken(&pgrp->pg_token);
922 mysession = pgrp->pg_session;
923 if ((hispgrp = p->p_pptr->p_pgrp) != pgrp &&
924 hispgrp->pg_session == mysession) {
927 else if (--pgrp->pg_jobc == 0)
932 * Check this process' children to see whether they qualify
933 * their process groups; if so, adjust counts for children's
936 LIST_FOREACH(np, &p->p_children, p_sibling) {
938 lwkt_gettoken(&np->p_token);
939 if ((hispgrp = np->p_pgrp) != pgrp &&
940 hispgrp->pg_session == mysession &&
941 np->p_stat != SZOMB) {
943 lwkt_gettoken(&hispgrp->pg_token);
946 else if (--hispgrp->pg_jobc == 0)
948 lwkt_reltoken(&hispgrp->pg_token);
951 lwkt_reltoken(&np->p_token);
954 KKASSERT(pgrp->pg_refs > 0);
955 lwkt_reltoken(&pgrp->pg_token);
956 lwkt_reltoken(&p->p_token);
960 * A process group has become orphaned;
961 * if there are any stopped processes in the group,
962 * hang-up all process in that group.
964 * The caller must hold pg_token.
967 orphanpg(struct pgrp *pg)
971 LIST_FOREACH(p, &pg->pg_members, p_pglist) {
972 if (p->p_stat == SSTOP) {
973 LIST_FOREACH(p, &pg->pg_members, p_pglist) {
983 * Add a new process to the allproc list and the PID hash. This
984 * also assigns a pid to the new process.
989 proc_add_allproc(struct proc *p)
993 if ((random_offset = randompid) != 0) {
994 read_random(&random_offset, sizeof(random_offset));
995 random_offset = (random_offset & 0x7FFFFFFF) % randompid;
997 proc_makepid(p, random_offset);
1001 * Calculate a new process pid. This function is integrated into
1002 * proc_add_allproc() to guarentee that the new pid is not reused before
1003 * the new process can be added to the allproc list.
1005 * p_pid is assigned and the process is added to the allproc hash table
1007 * WARNING! We need to allocate PIDs sequentially during early boot.
1008 * In particular, init needs to have a pid of 1.
1012 proc_makepid(struct proc *p, int random_offset)
1014 static pid_t nextpid = 1; /* heuristic, allowed to race */
1018 struct session *sess;
1025 * Select the next pid base candidate.
1027 * Check cyclement, do not allow a pid < 100.
1031 base = atomic_fetchadd_int(&nextpid, 1) + random_offset;
1032 if (base <= 0 || base >= PID_MAX) {
1033 base = base % PID_MAX;
1038 nextpid = base; /* reset (SMP race ok) */
1042 * Do not allow a base pid to be selected from a domain that has
1043 * recently seen a pid/pgid/sessid reap. Sleep a little if we looped
1044 * through all available domains.
1046 * WARNING: We want the early pids to be allocated linearly,
1047 * particularly pid 1 and pid 2.
1049 if (++retries >= PIDSEL_DOMAINS)
1050 tsleep(&nextpid, 0, "makepid", 1);
1052 delta8 = (int8_t)time_second -
1053 (int8_t)pid_doms[base % PIDSEL_DOMAINS];
1054 if (delta8 >= 0 && delta8 <= PIDDOM_DELAY) {
1061 * Calculate a hash index and find an unused process id within
1062 * the table, looping if we cannot find one.
1064 * The inner loop increments by ALLPROC_HSIZE which keeps the
1065 * PID at the same pid_doms[] index as well as the same hash index.
1067 n = ALLPROC_HASH(base);
1069 lwkt_gettoken(&prg->proc_token);
1072 LIST_FOREACH(ps, &prg->allproc, p_list) {
1073 if (ps->p_pid == base) {
1074 base += ALLPROC_HSIZE;
1075 if (base >= PID_MAX) {
1076 lwkt_reltoken(&prg->proc_token);
1083 LIST_FOREACH(pg, &prg->allpgrp, pg_list) {
1084 if (pg->pg_id == base) {
1085 base += ALLPROC_HSIZE;
1086 if (base >= PID_MAX) {
1087 lwkt_reltoken(&prg->proc_token);
1094 LIST_FOREACH(sess, &prg->allsess, s_list) {
1095 if (sess->s_sid == base) {
1096 base += ALLPROC_HSIZE;
1097 if (base >= PID_MAX) {
1098 lwkt_reltoken(&prg->proc_token);
1107 * Assign the pid and insert the process.
1110 LIST_INSERT_HEAD(&prg->allproc, p, p_list);
1111 lwkt_reltoken(&prg->proc_token);
1115 * Called from exit1 to place the process into a zombie state.
1116 * The process is removed from the pid hash and p_stat is set
1117 * to SZOMB. Normal pfind[n]() calls will not find it any more.
1119 * Caller must hold p->p_token. We are required to wait until p_lock
1120 * becomes zero before we can manipulate the list, allowing allproc
1121 * scans to guarantee consistency during a list scan.
1124 proc_move_allproc_zombie(struct proc *p)
1129 n = ALLPROC_HASH(p->p_pid);
1131 PSTALL(p, "reap1", 0);
1132 lwkt_gettoken(&prg->proc_token);
1134 PSTALL(p, "reap1a", 0);
1137 lwkt_reltoken(&prg->proc_token);
1138 dsched_exit_proc(p);
1142 * This routine is called from kern_wait() and will remove the process
1143 * from the zombie list and the sibling list. This routine will block
1144 * if someone has a lock on the proces (p_lock).
1146 * Caller must hold p->p_token. We are required to wait until p_lock
1147 * becomes one before we can manipulate the list, allowing allproc
1148 * scans to guarantee consistency during a list scan.
1150 * Assumes caller has one ref.
1153 proc_remove_zombie(struct proc *p)
1158 n = ALLPROC_HASH(p->p_pid);
1161 PSTALL(p, "reap2", 1);
1162 lwkt_gettoken(&prg->proc_token);
1163 PSTALL(p, "reap2a", 1);
1164 LIST_REMOVE(p, p_list); /* from remove master list */
1165 LIST_REMOVE(p, p_sibling); /* and from sibling list */
1168 if (pid_doms[p->p_pid % PIDSEL_DOMAINS] != (uint8_t)time_second)
1169 pid_doms[p->p_pid % PIDSEL_DOMAINS] = (uint8_t)time_second;
1170 lwkt_reltoken(&prg->proc_token);
1174 * Handle various requirements prior to returning to usermode. Called from
1175 * platform trap and system call code.
1178 lwpuserret(struct lwp *lp)
1180 struct proc *p = lp->lwp_proc;
1182 if (lp->lwp_mpflags & LWP_MP_VNLRU) {
1183 atomic_clear_int(&lp->lwp_mpflags, LWP_MP_VNLRU);
1186 if (lp->lwp_mpflags & LWP_MP_WEXIT) {
1187 lwkt_gettoken(&p->p_token);
1189 lwkt_reltoken(&p->p_token); /* NOT REACHED */
1194 * Kernel threads run from user processes can also accumulate deferred
1195 * actions which need to be acted upon. Callers include:
1197 * nfsd - Can allocate lots of vnodes
1200 lwpkthreaddeferred(void)
1202 struct lwp *lp = curthread->td_lwp;
1205 if (lp->lwp_mpflags & LWP_MP_VNLRU) {
1206 atomic_clear_int(&lp->lwp_mpflags, LWP_MP_VNLRU);
1213 proc_usermap(struct proc *p, int invfork)
1215 struct sys_upmap *upmap;
1217 lwkt_gettoken(&p->p_token);
1218 upmap = kmalloc(roundup2(sizeof(*upmap), PAGE_SIZE), M_PROC,
1220 if (p->p_upmap == NULL) {
1221 upmap->header[0].type = UKPTYPE_VERSION;
1222 upmap->header[0].offset = offsetof(struct sys_upmap, version);
1223 upmap->header[1].type = UPTYPE_RUNTICKS;
1224 upmap->header[1].offset = offsetof(struct sys_upmap, runticks);
1225 upmap->header[2].type = UPTYPE_FORKID;
1226 upmap->header[2].offset = offsetof(struct sys_upmap, forkid);
1227 upmap->header[3].type = UPTYPE_PID;
1228 upmap->header[3].offset = offsetof(struct sys_upmap, pid);
1229 upmap->header[4].type = UPTYPE_PROC_TITLE;
1230 upmap->header[4].offset = offsetof(struct sys_upmap,proc_title);
1231 upmap->header[5].type = UPTYPE_INVFORK;
1232 upmap->header[5].offset = offsetof(struct sys_upmap, invfork);
1234 upmap->version = UPMAP_VERSION;
1235 upmap->pid = p->p_pid;
1236 upmap->forkid = p->p_forkid;
1237 upmap->invfork = invfork;
1240 kfree(upmap, M_PROC);
1242 lwkt_reltoken(&p->p_token);
1246 proc_userunmap(struct proc *p)
1248 struct sys_upmap *upmap;
1250 lwkt_gettoken(&p->p_token);
1251 if ((upmap = p->p_upmap) != NULL) {
1253 kfree(upmap, M_PROC);
1255 lwkt_reltoken(&p->p_token);
1259 * Scan all processes on the allproc list. The process is automatically
1260 * held for the callback. A return value of -1 terminates the loop.
1261 * Zombie procs are skipped.
1263 * The callback is made with the process held and proc_token held.
1265 * We limit the scan to the number of processes as-of the start of
1266 * the scan so as not to get caught up in an endless loop if new processes
1267 * are created more quickly than we can scan the old ones. Add a little
1268 * slop to try to catch edge cases since nprocs can race.
1273 allproc_scan(int (*callback)(struct proc *, void *), void *data, int segmented)
1275 int limit = nprocs + ncpus;
1283 int id = mycpu->gd_cpuid;
1284 ns = id * ALLPROC_HSIZE / ncpus;
1285 ne = (id + 1) * ALLPROC_HSIZE / ncpus;
1292 * prg->proc_token protects the allproc list and PHOLD() prevents the
1293 * process from being removed from the allproc list or the zombproc
1296 for (n = ns; n < ne; ++n) {
1297 procglob_t *prg = &procglob[n];
1298 if (LIST_FIRST(&prg->allproc) == NULL)
1300 lwkt_gettoken(&prg->proc_token);
1301 LIST_FOREACH(p, &prg->allproc, p_list) {
1302 if (p->p_stat == SZOMB)
1305 r = callback(p, data);
1312 lwkt_reltoken(&prg->proc_token);
1315 * Check if asked to stop early
1323 * Scan all lwps of processes on the allproc list. The lwp is automatically
1324 * held for the callback. A return value of -1 terminates the loop.
1326 * The callback is made with the proces and lwp both held, and proc_token held.
1331 alllwp_scan(int (*callback)(struct lwp *, void *), void *data, int segmented)
1341 int id = mycpu->gd_cpuid;
1342 ns = id * ALLPROC_HSIZE / ncpus;
1343 ne = (id + 1) * ALLPROC_HSIZE / ncpus;
1349 for (n = ns; n < ne; ++n) {
1350 procglob_t *prg = &procglob[n];
1352 if (LIST_FIRST(&prg->allproc) == NULL)
1354 lwkt_gettoken(&prg->proc_token);
1355 LIST_FOREACH(p, &prg->allproc, p_list) {
1356 if (p->p_stat == SZOMB)
1359 lwkt_gettoken(&p->p_token);
1360 FOREACH_LWP_IN_PROC(lp, p) {
1362 r = callback(lp, data);
1365 lwkt_reltoken(&p->p_token);
1370 lwkt_reltoken(&prg->proc_token);
1373 * Asked to exit early
1381 * Scan all processes on the zombproc list. The process is automatically
1382 * held for the callback. A return value of -1 terminates the loop.
1385 * The callback is made with the proces held and proc_token held.
1388 zombproc_scan(int (*callback)(struct proc *, void *), void *data)
1395 * prg->proc_token protects the allproc list and PHOLD() prevents the
1396 * process from being removed from the allproc list or the zombproc
1399 for (n = 0; n < ALLPROC_HSIZE; ++n) {
1400 procglob_t *prg = &procglob[n];
1402 if (LIST_FIRST(&prg->allproc) == NULL)
1404 lwkt_gettoken(&prg->proc_token);
1405 LIST_FOREACH(p, &prg->allproc, p_list) {
1406 if (p->p_stat != SZOMB)
1409 r = callback(p, data);
1414 lwkt_reltoken(&prg->proc_token);
1417 * Check if asked to stop early
1424 #include "opt_ddb.h"
1426 #include <ddb/ddb.h>
1431 DB_SHOW_COMMAND(pgrpdump, pgrpdump)
1438 for (i = 0; i < ALLPROC_HSIZE; ++i) {
1441 if (LIST_EMPTY(&prg->allpgrp))
1443 kprintf("\tindx %d\n", i);
1444 LIST_FOREACH(pgrp, &prg->allpgrp, pg_list) {
1445 kprintf("\tpgrp %p, pgid %ld, sess %p, "
1446 "sesscnt %d, mem %p\n",
1447 (void *)pgrp, (long)pgrp->pg_id,
1448 (void *)pgrp->pg_session,
1449 pgrp->pg_session->s_count,
1450 (void *)LIST_FIRST(&pgrp->pg_members));
1451 LIST_FOREACH(p, &pgrp->pg_members, p_pglist) {
1452 kprintf("\t\tpid %ld addr %p pgrp %p\n",
1453 (long)p->p_pid, (void *)p,
1462 * The caller must hold proc_token.
1465 sysctl_out_proc(struct proc *p, struct sysctl_req *req, int flags)
1467 struct kinfo_proc ki;
1469 int skp = 0, had_output = 0;
1472 bzero(&ki, sizeof(ki));
1473 lwkt_gettoken_shared(&p->p_token);
1474 fill_kinfo_proc(p, &ki);
1475 if ((flags & KERN_PROC_FLAG_LWP) == 0)
1478 FOREACH_LWP_IN_PROC(lp, p) {
1480 fill_kinfo_lwp(lp, &ki.kp_lwp);
1483 error = SYSCTL_OUT(req, &ki, sizeof(ki));
1484 bzero(&ki.kp_lwp, sizeof(ki.kp_lwp));
1490 lwkt_reltoken(&p->p_token);
1493 * If aggregating threads, set the tid field to -1.
1496 ki.kp_lwp.kl_tid = -1;
1499 * We need to output at least the proc, even if there is no lwp.
1500 * If skp is non-zero we aggregated the lwps and need to output
1503 if (had_output == 0 || skp) {
1504 error = SYSCTL_OUT(req, &ki, sizeof(ki));
1510 * The caller must hold proc_token.
1513 sysctl_out_proc_kthread(struct thread *td, struct sysctl_req *req)
1515 struct kinfo_proc ki;
1518 fill_kinfo_proc_kthread(td, &ki);
1519 error = SYSCTL_OUT(req, &ki, sizeof(ki));
1529 sysctl_kern_proc(SYSCTL_HANDLER_ARGS)
1531 int *name = (int *)arg1;
1532 int oid = oidp->oid_number;
1533 u_int namelen = arg2;
1536 struct thread *marker;
1541 struct ucred *cr1 = curproc->p_ucred;
1542 struct ucred *crcache = NULL;
1544 flags = oid & KERN_PROC_FLAGMASK;
1545 oid &= ~KERN_PROC_FLAGMASK;
1547 if ((oid == KERN_PROC_ALL && namelen != 0) ||
1548 (oid != KERN_PROC_ALL && namelen != 1)) {
1553 * proc_token protects the allproc list and PHOLD() prevents the
1554 * process from being removed from the allproc list or the zombproc
1557 if (oid == KERN_PROC_PID) {
1558 p = pfind((pid_t)name[0]);
1560 crcache = pcredcache(crcache, p);
1561 if (PRISON_CHECK(cr1, crcache))
1562 error = sysctl_out_proc(p, req, flags);
1570 /* overestimate by 5 procs */
1571 error = SYSCTL_OUT(req, 0, sizeof (struct kinfo_proc) * 5);
1576 for (n = 0; n < ALLPROC_HSIZE; ++n) {
1577 procglob_t *prg = &procglob[n];
1579 if (LIST_EMPTY(&prg->allproc))
1581 lwkt_gettoken_shared(&prg->proc_token);
1582 LIST_FOREACH(p, &prg->allproc, p_list) {
1584 * Show a user only their processes.
1586 if (ps_showallprocs == 0) {
1587 crcache = pcredcache(crcache, p);
1588 if (crcache == NULL ||
1589 p_trespass(cr1, crcache)) {
1595 * Skip embryonic processes.
1597 if (p->p_stat == SIDL)
1600 * TODO - make more efficient (see notes below).
1604 case KERN_PROC_PGRP:
1605 /* could do this by traversing pgrp */
1606 if (p->p_pgrp == NULL ||
1607 p->p_pgrp->pg_id != (pid_t)name[0])
1612 if ((p->p_flags & P_CONTROLT) == 0 ||
1613 p->p_session == NULL ||
1614 p->p_session->s_ttyp == NULL ||
1615 dev2udev(p->p_session->s_ttyp->t_dev) !=
1621 crcache = pcredcache(crcache, p);
1622 if (crcache == NULL ||
1623 crcache->cr_uid != (uid_t)name[0]) {
1628 case KERN_PROC_RUID:
1629 crcache = pcredcache(crcache, p);
1630 if (crcache == NULL ||
1631 crcache->cr_ruid != (uid_t)name[0]) {
1637 crcache = pcredcache(crcache, p);
1638 if (!PRISON_CHECK(cr1, crcache))
1641 error = sysctl_out_proc(p, req, flags);
1644 lwkt_reltoken(&prg->proc_token);
1648 lwkt_reltoken(&prg->proc_token);
1652 * Iterate over all active cpus and scan their thread list. Start
1653 * with the next logical cpu and end with our original cpu. We
1654 * migrate our own thread to each target cpu in order to safely scan
1655 * its thread list. In the last loop we migrate back to our original
1658 origcpu = mycpu->gd_cpuid;
1659 if (!ps_showallthreads || jailed(cr1))
1662 marker = kmalloc(sizeof(struct thread), M_TEMP, M_WAITOK|M_ZERO);
1663 marker->td_flags = TDF_MARKER;
1666 for (n = 1; n <= ncpus; ++n) {
1670 nid = (origcpu + n) % ncpus;
1671 if (CPUMASK_TESTBIT(smp_active_mask, nid) == 0)
1673 rgd = globaldata_find(nid);
1674 lwkt_setcpu_self(rgd);
1677 TAILQ_INSERT_TAIL(&rgd->gd_tdallq, marker, td_allq);
1679 while ((td = TAILQ_PREV(marker, lwkt_queue, td_allq)) != NULL) {
1680 TAILQ_REMOVE(&rgd->gd_tdallq, marker, td_allq);
1681 TAILQ_INSERT_BEFORE(td, marker, td_allq);
1682 if (td->td_flags & TDF_MARKER)
1691 case KERN_PROC_PGRP:
1694 case KERN_PROC_RUID:
1697 error = sysctl_out_proc_kthread(td, req);
1705 TAILQ_REMOVE(&rgd->gd_tdallq, marker, td_allq);
1713 * Userland scheduler expects us to return on the same cpu we
1716 if (mycpu->gd_cpuid != origcpu)
1717 lwkt_setcpu_self(globaldata_find(origcpu));
1719 kfree(marker, M_TEMP);
1728 * This sysctl allows a process to retrieve the argument list or process
1729 * title for another process without groping around in the address space
1730 * of the other process. It also allow a process to set its own "process
1731 * title to a string of its own choice.
1736 sysctl_kern_proc_args(SYSCTL_HANDLER_ARGS)
1738 int *name = (int*) arg1;
1739 u_int namelen = arg2;
1744 struct ucred *cr1 = curproc->p_ucred;
1749 p = pfind((pid_t)name[0]);
1752 lwkt_gettoken(&p->p_token);
1754 if ((!ps_argsopen) && p_trespass(cr1, p->p_ucred))
1757 if (req->newptr && curproc != p) {
1762 if (p->p_upmap != NULL && p->p_upmap->proc_title[0]) {
1764 * Args set via writable user process mmap.
1765 * We must calculate the string length manually
1766 * because the user data can change at any time.
1771 base = p->p_upmap->proc_title;
1772 for (n = 0; n < UPMAP_MAXPROCTITLE - 1; ++n) {
1776 error = SYSCTL_OUT(req, base, n);
1778 error = SYSCTL_OUT(req, "", 1);
1779 } else if ((pa = p->p_args) != NULL) {
1781 * Args set by setproctitle() sysctl.
1783 refcount_acquire(&pa->ar_ref);
1784 error = SYSCTL_OUT(req, pa->ar_args, pa->ar_length);
1785 if (refcount_release(&pa->ar_ref))
1789 if (req->newptr == NULL)
1792 if (req->newlen + sizeof(struct pargs) > ps_arg_cache_limit) {
1796 pa = kmalloc(sizeof(struct pargs) + req->newlen, M_PARGS, M_WAITOK);
1797 refcount_init(&pa->ar_ref, 1);
1798 pa->ar_length = req->newlen;
1799 error = SYSCTL_IN(req, pa->ar_args, req->newlen);
1807 * Replace p_args with the new pa. p_args may have previously
1814 KKASSERT(opa->ar_ref > 0);
1815 if (refcount_release(&opa->ar_ref)) {
1816 kfree(opa, M_PARGS);
1822 lwkt_reltoken(&p->p_token);
1829 sysctl_kern_proc_cwd(SYSCTL_HANDLER_ARGS)
1831 int *name = (int*) arg1;
1832 u_int namelen = arg2;
1835 char *fullpath, *freepath;
1836 struct ucred *cr1 = curproc->p_ucred;
1841 p = pfind((pid_t)name[0]);
1844 lwkt_gettoken_shared(&p->p_token);
1847 * If we are not allowed to see other args, we certainly shouldn't
1848 * get the cwd either. Also check the usual trespassing.
1850 if ((!ps_argsopen) && p_trespass(cr1, p->p_ucred))
1853 if (req->oldptr && p->p_fd != NULL && p->p_fd->fd_ncdir.ncp) {
1854 struct nchandle nch;
1856 cache_copy(&p->p_fd->fd_ncdir, &nch);
1857 error = cache_fullpath(p, &nch, NULL,
1858 &fullpath, &freepath, 0);
1862 error = SYSCTL_OUT(req, fullpath, strlen(fullpath) + 1);
1863 kfree(freepath, M_TEMP);
1868 lwkt_reltoken(&p->p_token);
1875 * This sysctl allows a process to retrieve the path of the executable for
1876 * itself or another process.
1879 sysctl_kern_proc_pathname(SYSCTL_HANDLER_ARGS)
1881 pid_t *pidp = (pid_t *)arg1;
1882 unsigned int arglen = arg2;
1884 char *retbuf, *freebuf;
1886 struct nchandle nch;
1890 if (*pidp == -1) { /* -1 means this process */
1898 cache_copy(&p->p_textnch, &nch);
1899 error = cache_fullpath(p, &nch, NULL, &retbuf, &freebuf, 0);
1903 error = SYSCTL_OUT(req, retbuf, strlen(retbuf) + 1);
1904 kfree(freebuf, M_TEMP);
1913 sysctl_kern_proc_sigtramp(SYSCTL_HANDLER_ARGS)
1915 /*int *name = (int *)arg1;*/
1916 u_int namelen = arg2;
1917 struct kinfo_sigtramp kst;
1918 const struct sysentvec *sv;
1923 /* ignore pid if passed in (freebsd compatibility) */
1925 sv = curproc->p_sysent;
1926 bzero(&kst, sizeof(kst));
1927 if (sv->sv_szsigcode) {
1930 sigbase = trunc_page64((intptr_t)PS_STRINGS -
1932 sigbase -= SZSIGCODE_EXTRA_BYTES;
1934 kst.ksigtramp_start = (void *)sigbase;
1935 kst.ksigtramp_end = (void *)(sigbase + *sv->sv_szsigcode);
1937 error = SYSCTL_OUT(req, &kst, sizeof(kst));
1942 SYSCTL_NODE(_kern, KERN_PROC, proc, CTLFLAG_RD, 0, "Process table");
1944 SYSCTL_PROC(_kern_proc, KERN_PROC_ALL, all,
1945 CTLFLAG_RD | CTLTYPE_STRUCT | CTLFLAG_NOLOCK,
1946 0, 0, sysctl_kern_proc, "S,proc", "Return entire process table");
1948 SYSCTL_NODE(_kern_proc, KERN_PROC_PGRP, pgrp,
1949 CTLFLAG_RD | CTLFLAG_NOLOCK,
1950 sysctl_kern_proc, "Process table");
1952 SYSCTL_NODE(_kern_proc, KERN_PROC_TTY, tty,
1953 CTLFLAG_RD | CTLFLAG_NOLOCK,
1954 sysctl_kern_proc, "Process table");
1956 SYSCTL_NODE(_kern_proc, KERN_PROC_UID, uid,
1957 CTLFLAG_RD | CTLFLAG_NOLOCK,
1958 sysctl_kern_proc, "Process table");
1960 SYSCTL_NODE(_kern_proc, KERN_PROC_RUID, ruid,
1961 CTLFLAG_RD | CTLFLAG_NOLOCK,
1962 sysctl_kern_proc, "Process table");
1964 SYSCTL_NODE(_kern_proc, KERN_PROC_PID, pid,
1965 CTLFLAG_RD | CTLFLAG_NOLOCK,
1966 sysctl_kern_proc, "Process table");
1968 SYSCTL_NODE(_kern_proc, (KERN_PROC_ALL | KERN_PROC_FLAG_LWP), all_lwp,
1969 CTLFLAG_RD | CTLFLAG_NOLOCK,
1970 sysctl_kern_proc, "Process table");
1972 SYSCTL_NODE(_kern_proc, (KERN_PROC_PGRP | KERN_PROC_FLAG_LWP), pgrp_lwp,
1973 CTLFLAG_RD | CTLFLAG_NOLOCK,
1974 sysctl_kern_proc, "Process table");
1976 SYSCTL_NODE(_kern_proc, (KERN_PROC_TTY | KERN_PROC_FLAG_LWP), tty_lwp,
1977 CTLFLAG_RD | CTLFLAG_NOLOCK,
1978 sysctl_kern_proc, "Process table");
1980 SYSCTL_NODE(_kern_proc, (KERN_PROC_UID | KERN_PROC_FLAG_LWP), uid_lwp,
1981 CTLFLAG_RD | CTLFLAG_NOLOCK,
1982 sysctl_kern_proc, "Process table");
1984 SYSCTL_NODE(_kern_proc, (KERN_PROC_RUID | KERN_PROC_FLAG_LWP), ruid_lwp,
1985 CTLFLAG_RD | CTLFLAG_NOLOCK,
1986 sysctl_kern_proc, "Process table");
1988 SYSCTL_NODE(_kern_proc, (KERN_PROC_PID | KERN_PROC_FLAG_LWP), pid_lwp,
1989 CTLFLAG_RD | CTLFLAG_NOLOCK,
1990 sysctl_kern_proc, "Process table");
1992 SYSCTL_NODE(_kern_proc, KERN_PROC_ARGS, args,
1993 CTLFLAG_RW | CTLFLAG_ANYBODY | CTLFLAG_NOLOCK,
1994 sysctl_kern_proc_args, "Process argument list");
1996 SYSCTL_NODE(_kern_proc, KERN_PROC_CWD, cwd,
1997 CTLFLAG_RD | CTLFLAG_ANYBODY | CTLFLAG_NOLOCK,
1998 sysctl_kern_proc_cwd, "Process argument list");
2000 static SYSCTL_NODE(_kern_proc, KERN_PROC_PATHNAME, pathname,
2001 CTLFLAG_RD | CTLFLAG_NOLOCK,
2002 sysctl_kern_proc_pathname, "Process executable path");
2004 SYSCTL_PROC(_kern_proc, KERN_PROC_SIGTRAMP, sigtramp,
2005 CTLFLAG_RD | CTLTYPE_STRUCT | CTLFLAG_NOLOCK,
2006 0, 0, sysctl_kern_proc_sigtramp, "S,sigtramp",
2007 "Return sigtramp address range");