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>
48 #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 (PID_MAX * PIDDOM_SCALE / PIDDOM_COUNT / \
78 ALLPROC_HSIZE * ALLPROC_HSIZE)
81 int allproc_hsize
= ALLPROC_HSIZE
;
83 LIST_HEAD(pidhashhead
, proc
);
85 static MALLOC_DEFINE(M_PGRP
, "pgrp", "process group header");
86 MALLOC_DEFINE(M_SESSION
, "session", "session header");
87 MALLOC_DEFINE(M_PROC
, "proc", "Proc structures");
88 MALLOC_DEFINE(M_LWP
, "lwp", "lwp structures");
89 MALLOC_DEFINE(M_SUBPROC
, "subproc", "Proc sub-structures");
91 int ps_showallprocs
= 1;
92 static int ps_showallthreads
= 1;
93 SYSCTL_INT(_security
, OID_AUTO
, ps_showallprocs
, CTLFLAG_RW
,
95 "Unprivileged processes can see processes with different UID/GID");
96 SYSCTL_INT(_security
, OID_AUTO
, ps_showallthreads
, CTLFLAG_RW
,
97 &ps_showallthreads
, 0,
98 "Unprivileged processes can see kernel threads");
99 static u_int pid_domain_skips
;
100 SYSCTL_UINT(_kern
, OID_AUTO
, pid_domain_skips
, CTLFLAG_RW
,
101 &pid_domain_skips
, 0,
102 "Number of pid_doms[] skipped");
103 static u_int pid_inner_skips
;
104 SYSCTL_UINT(_kern
, OID_AUTO
, pid_inner_skips
, CTLFLAG_RW
,
106 "Number of pid_doms[] skipped");
108 static void orphanpg(struct pgrp
*pg
);
109 static void proc_makepid(struct proc
*p
, int random_offset
);
112 * Process related lists (for proc_token, allproc, allpgrp, and allsess)
114 typedef struct procglob procglob_t
;
116 static procglob_t procglob
[ALLPROC_HSIZE
];
119 * We try our best to avoid recycling a PID too quickly. We do this by
120 * storing (uint8_t)time_second in the related pid domain on-reap and then
121 * using that to skip-over the domain on-allocate.
123 * This array has to be fairly large to support a high fork/exec rate.
124 * A ~100,000 entry array will support a 10-second reuse latency at
125 * 10,000 execs/second, worst case. Best-case multiply by PIDDOM_COUNT
126 * (approximately 100,000 execs/second).
128 * Currently we allocate around a megabyte, making the worst-case fork
129 * rate around 100,000/second.
131 static uint8_t *pid_doms
;
134 * Random component to nextpid generation. We mix in a random factor to make
135 * it a little harder to predict. We sanity check the modulus value to avoid
136 * doing it in critical paths. Don't let it be too small or we pointlessly
137 * waste randomness entropy, and don't let it be impossibly large. Using a
138 * modulus that is too big causes a LOT more process table scans and slows
139 * down fork processing as the pidchecked caching is defeated.
141 static int randompid
= 0;
145 pcredcache(struct ucred
*cr
, struct proc
*p
)
147 if (cr
!= p
->p_ucred
) {
150 spin_lock(&p
->p_spin
);
151 if ((cr
= p
->p_ucred
) != NULL
)
153 spin_unlock(&p
->p_spin
);
162 sysctl_kern_randompid(SYSCTL_HANDLER_ARGS
)
167 error
= sysctl_handle_int(oidp
, &pid
, 0, req
);
168 if (error
|| !req
->newptr
)
170 if (pid
< 0 || pid
> PID_MAX
- 100) /* out of range */
172 else if (pid
< 2) /* NOP */
174 else if (pid
< 100) /* Make it reasonable */
180 SYSCTL_PROC(_kern
, OID_AUTO
, randompid
, CTLTYPE_INT
|CTLFLAG_RW
,
181 0, 0, sysctl_kern_randompid
, "I", "Random PID modulus");
184 * Initialize global process hashing structures.
186 * These functions are ONLY called from the low level boot code and do
187 * not lock their operations.
195 * Allocate dynamically. This array can be large (~1MB) so don't
196 * waste boot loader space.
198 pid_doms
= kmalloc(sizeof(pid_doms
[0]) * PIDSEL_DOMAINS
,
199 M_PROC
, M_WAITOK
| M_ZERO
);
202 * Avoid unnecessary stalls due to pid_doms[] values all being
203 * the same. Make sure that the allocation of pid 1 and pid 2
206 for (i
= 0; i
< PIDSEL_DOMAINS
; ++i
)
207 pid_doms
[i
] = (int8_t)i
- (int8_t)(PIDDOM_DELAY
+ 1);
212 for (i
= 0; i
< ALLPROC_HSIZE
; ++i
) {
213 procglob_t
*prg
= &procglob
[i
];
214 LIST_INIT(&prg
->allproc
);
215 LIST_INIT(&prg
->allsess
);
216 LIST_INIT(&prg
->allpgrp
);
217 lwkt_token_init(&prg
->proc_token
, "allproc");
223 procinsertinit(struct proc
*p
)
225 LIST_INSERT_HEAD(&procglob
[ALLPROC_HASH(p
->p_pid
)].allproc
,
230 pgrpinsertinit(struct pgrp
*pg
)
232 LIST_INSERT_HEAD(&procglob
[ALLPROC_HASH(pg
->pg_id
)].allpgrp
,
237 sessinsertinit(struct session
*sess
)
239 LIST_INSERT_HEAD(&procglob
[ALLPROC_HASH(sess
->s_sid
)].allsess
,
244 * Process hold/release support functions. Called via the PHOLD(),
245 * PRELE(), and PSTALL() macros.
247 * p->p_lock is a simple hold count with a waiting interlock. No wakeup()
248 * is issued unless someone is actually waiting for the process.
250 * Most holds are short-term, allowing a process scan or other similar
251 * operation to access a proc structure without it getting ripped out from
252 * under us. procfs and process-list sysctl ops also use the hold function
253 * interlocked with various p_flags to keep the vmspace intact when reading
254 * or writing a user process's address space.
256 * There are two situations where a hold count can be longer. Exiting lwps
257 * hold the process until the lwp is reaped, and the parent will hold the
258 * child during vfork()/exec() sequences while the child is marked P_PPWAIT.
260 * The kernel waits for the hold count to drop to 0 (or 1 in some cases) at
261 * various critical points in the fork/exec and exit paths before proceeding.
263 #define PLOCK_ZOMB 0x20000000
264 #define PLOCK_WAITING 0x40000000
265 #define PLOCK_MASK 0x1FFFFFFF
268 pstall(struct proc
*p
, const char *wmesg
, int count
)
276 if ((o
& PLOCK_MASK
) <= count
)
278 n
= o
| PLOCK_WAITING
;
279 tsleep_interlock(&p
->p_lock
, 0);
282 * If someone is trying to single-step the process during
283 * an exec or an exit they can deadlock us because procfs
284 * sleeps with the process held.
287 if (p
->p_flags
& P_INEXEC
) {
289 } else if (p
->p_flags
& P_POSTEXIT
) {
290 spin_lock(&p
->p_spin
);
293 spin_unlock(&p
->p_spin
);
298 if (atomic_cmpset_int(&p
->p_lock
, o
, n
)) {
299 tsleep(&p
->p_lock
, PINTERLOCKED
, wmesg
, 0);
305 phold(struct proc
*p
)
307 atomic_add_int(&p
->p_lock
, 1);
311 * WARNING! On last release (p) can become instantly invalid due to
315 prele(struct proc
*p
)
323 if (atomic_cmpset_int(&p
->p_lock
, 1, 0))
331 KKASSERT((o
& PLOCK_MASK
) > 0);
333 n
= (o
- 1) & ~PLOCK_WAITING
;
334 if (atomic_cmpset_int(&p
->p_lock
, o
, n
)) {
335 if (o
& PLOCK_WAITING
)
343 * Hold and flag serialized for zombie reaping purposes.
345 * This function will fail if it has to block, returning non-zero with
346 * neither the flag set or the hold count bumped. Note that (p) may
347 * not be valid in this case if the caller does not have some other
350 * This function does not block on other PHOLD()s, only on other
353 * Zero is returned on success. The hold count will be incremented and
354 * the serialization flag acquired. Note that serialization is only against
355 * other pholdzomb() calls, not against phold() calls.
358 pholdzomb(struct proc
*p
)
366 if (atomic_cmpset_int(&p
->p_lock
, 0, PLOCK_ZOMB
| 1))
375 if ((o
& PLOCK_ZOMB
) == 0) {
376 n
= (o
+ 1) | PLOCK_ZOMB
;
377 if (atomic_cmpset_int(&p
->p_lock
, o
, n
))
380 KKASSERT((o
& PLOCK_MASK
) > 0);
381 n
= o
| PLOCK_WAITING
;
382 tsleep_interlock(&p
->p_lock
, 0);
383 if (atomic_cmpset_int(&p
->p_lock
, o
, n
)) {
384 tsleep(&p
->p_lock
, PINTERLOCKED
, "phldz", 0);
385 /* (p) can be ripped out at this point */
393 * Release PLOCK_ZOMB and the hold count, waking up any waiters.
395 * WARNING! On last release (p) can become instantly invalid due to
399 prelezomb(struct proc
*p
)
407 if (atomic_cmpset_int(&p
->p_lock
, PLOCK_ZOMB
| 1, 0))
413 KKASSERT(p
->p_lock
& PLOCK_ZOMB
);
416 KKASSERT((o
& PLOCK_MASK
) > 0);
418 n
= (o
- 1) & ~(PLOCK_ZOMB
| PLOCK_WAITING
);
419 if (atomic_cmpset_int(&p
->p_lock
, o
, n
)) {
420 if (o
& PLOCK_WAITING
)
428 * Is p an inferior of the current process?
433 inferior(struct proc
*p
)
438 lwkt_gettoken_shared(&p
->p_token
);
439 while (p
!= curproc
) {
441 lwkt_reltoken(&p
->p_token
);
446 lwkt_reltoken(&p
->p_token
);
448 lwkt_gettoken_shared(&p2
->p_token
);
451 lwkt_reltoken(&p
->p_token
);
458 * Locate a process by number. The returned process will be referenced and
459 * must be released with PRELE().
466 struct proc
*p
= curproc
;
471 * Shortcut the current process
473 if (p
&& p
->p_pid
== pid
) {
479 * Otherwise find it in the hash table.
481 n
= ALLPROC_HASH(pid
);
484 lwkt_gettoken_shared(&prg
->proc_token
);
485 LIST_FOREACH(p
, &prg
->allproc
, p_list
) {
486 if (p
->p_stat
== SZOMB
)
488 if (p
->p_pid
== pid
) {
490 lwkt_reltoken(&prg
->proc_token
);
494 lwkt_reltoken(&prg
->proc_token
);
500 * Locate a process by number. The returned process is NOT referenced.
501 * The result will not be stable and is typically only used to validate
502 * against a process that the caller has in-hand.
509 struct proc
*p
= curproc
;
514 * Shortcut the current process
516 if (p
&& p
->p_pid
== pid
)
520 * Otherwise find it in the hash table.
522 n
= ALLPROC_HASH(pid
);
525 lwkt_gettoken_shared(&prg
->proc_token
);
526 LIST_FOREACH(p
, &prg
->allproc
, p_list
) {
527 if (p
->p_stat
== SZOMB
)
529 if (p
->p_pid
== pid
) {
530 lwkt_reltoken(&prg
->proc_token
);
534 lwkt_reltoken(&prg
->proc_token
);
540 * Locate a process on the zombie list. Return a process or NULL.
541 * The returned process will be referenced and the caller must release
544 * No other requirements.
549 struct proc
*p
= curproc
;
554 * Shortcut the current process
556 if (p
&& p
->p_pid
== pid
) {
562 * Otherwise find it in the hash table.
564 n
= ALLPROC_HASH(pid
);
567 lwkt_gettoken_shared(&prg
->proc_token
);
568 LIST_FOREACH(p
, &prg
->allproc
, p_list
) {
569 if (p
->p_stat
!= SZOMB
)
571 if (p
->p_pid
== pid
) {
573 lwkt_reltoken(&prg
->proc_token
);
577 lwkt_reltoken(&prg
->proc_token
);
584 pgref(struct pgrp
*pgrp
)
586 refcount_acquire(&pgrp
->pg_refs
);
590 pgrel(struct pgrp
*pgrp
)
596 n
= PGRP_HASH(pgrp
->pg_id
);
600 count
= pgrp
->pg_refs
;
604 lwkt_gettoken(&prg
->proc_token
);
605 if (atomic_cmpset_int(&pgrp
->pg_refs
, 1, 0))
607 lwkt_reltoken(&prg
->proc_token
);
610 if (atomic_cmpset_int(&pgrp
->pg_refs
, count
, count
- 1))
617 * Successful 1->0 transition, pghash_spin is held.
619 LIST_REMOVE(pgrp
, pg_list
);
620 if (pid_doms
[pgrp
->pg_id
% PIDSEL_DOMAINS
] != (uint8_t)time_second
)
621 pid_doms
[pgrp
->pg_id
% PIDSEL_DOMAINS
] = (uint8_t)time_second
;
624 * Reset any sigio structures pointing to us as a result of
625 * F_SETOWN with our pgid.
627 funsetownlst(&pgrp
->pg_sigiolst
);
629 if (pgrp
->pg_session
->s_ttyp
!= NULL
&&
630 pgrp
->pg_session
->s_ttyp
->t_pgrp
== pgrp
) {
631 pgrp
->pg_session
->s_ttyp
->t_pgrp
= NULL
;
633 lwkt_reltoken(&prg
->proc_token
);
635 sess_rele(pgrp
->pg_session
);
640 * Locate a process group by number. The returned process group will be
641 * referenced w/pgref() and must be released with pgrel() (or assigned
642 * somewhere if you wish to keep the reference).
655 lwkt_gettoken_shared(&prg
->proc_token
);
657 LIST_FOREACH(pgrp
, &prg
->allpgrp
, pg_list
) {
658 if (pgrp
->pg_id
== pgid
) {
659 refcount_acquire(&pgrp
->pg_refs
);
660 lwkt_reltoken(&prg
->proc_token
);
664 lwkt_reltoken(&prg
->proc_token
);
669 * Move p to a new or existing process group (and session)
674 enterpgrp(struct proc
*p
, pid_t pgid
, int mksess
)
682 KASSERT(pgrp
== NULL
|| !mksess
,
683 ("enterpgrp: setsid into non-empty pgrp"));
684 KASSERT(!SESS_LEADER(p
),
685 ("enterpgrp: session leader attempted setpgrp"));
688 pid_t savepid
= p
->p_pid
;
696 KASSERT(p
->p_pid
== pgid
,
697 ("enterpgrp: new pgrp and pid != pgid"));
698 pgrp
= kmalloc(sizeof(struct pgrp
), M_PGRP
, M_WAITOK
| M_ZERO
);
700 LIST_INIT(&pgrp
->pg_members
);
702 SLIST_INIT(&pgrp
->pg_sigiolst
);
703 lwkt_token_init(&pgrp
->pg_token
, "pgrp_token");
704 refcount_init(&pgrp
->pg_refs
, 1);
705 lockinit(&pgrp
->pg_lock
, "pgwt", 0, 0);
710 if ((np
= pfindn(savepid
)) == NULL
|| np
!= p
) {
711 lwkt_reltoken(&prg
->proc_token
);
717 lwkt_gettoken(&prg
->proc_token
);
719 struct session
*sess
;
724 sess
= kmalloc(sizeof(struct session
), M_SESSION
,
726 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(&prg
->proc_token
);
859 if (atomic_cmpset_int(&sess
->s_count
, 1, 0))
861 lwkt_reltoken(&prg
->proc_token
);
864 if (atomic_cmpset_int(&sess
->s_count
, count
, count
- 1))
871 * Successful 1->0 transition and prg->proc_token is held.
873 LIST_REMOVE(sess
, s_list
);
874 if (pid_doms
[sess
->s_sid
% PIDSEL_DOMAINS
] != (uint8_t)time_second
)
875 pid_doms
[sess
->s_sid
% PIDSEL_DOMAINS
] = (uint8_t)time_second
;
877 if (sess
->s_ttyp
&& sess
->s_ttyp
->t_session
) {
878 #ifdef TTY_DO_FULL_CLOSE
879 /* FULL CLOSE, see ttyclearsession() */
880 KKASSERT(sess
->s_ttyp
->t_session
== sess
);
881 sess
->s_ttyp
->t_session
= NULL
;
883 /* HALF CLOSE, see ttyclearsession() */
884 if (sess
->s_ttyp
->t_session
== sess
)
885 sess
->s_ttyp
->t_session
= NULL
;
888 if ((tp
= sess
->s_ttyp
) != NULL
) {
892 lwkt_reltoken(&prg
->proc_token
);
894 kfree(sess
, M_SESSION
);
898 * Adjust pgrp jobc counters when specified process changes process group.
899 * We count the number of processes in each process group that "qualify"
900 * the group for terminal job control (those with a parent in a different
901 * process group of the same session). If that count reaches zero, the
902 * process group becomes orphaned. Check both the specified process'
903 * process group and that of its children.
904 * entering == 0 => p is leaving specified group.
905 * entering == 1 => p is entering specified group.
910 fixjobc(struct proc
*p
, struct pgrp
*pgrp
, int entering
)
912 struct pgrp
*hispgrp
;
913 struct session
*mysession
;
917 * Check p's parent to see whether p qualifies its own process
918 * group; if so, adjust count for p's process group.
920 lwkt_gettoken(&p
->p_token
); /* p_children scan */
921 lwkt_gettoken(&pgrp
->pg_token
);
923 mysession
= pgrp
->pg_session
;
924 if ((hispgrp
= p
->p_pptr
->p_pgrp
) != pgrp
&&
925 hispgrp
->pg_session
== mysession
) {
928 else if (--pgrp
->pg_jobc
== 0)
933 * Check this process' children to see whether they qualify
934 * their process groups; if so, adjust counts for children's
937 LIST_FOREACH(np
, &p
->p_children
, p_sibling
) {
939 lwkt_gettoken(&np
->p_token
);
940 if ((hispgrp
= np
->p_pgrp
) != pgrp
&&
941 hispgrp
->pg_session
== mysession
&&
942 np
->p_stat
!= SZOMB
) {
944 lwkt_gettoken(&hispgrp
->pg_token
);
947 else if (--hispgrp
->pg_jobc
== 0)
949 lwkt_reltoken(&hispgrp
->pg_token
);
952 lwkt_reltoken(&np
->p_token
);
955 KKASSERT(pgrp
->pg_refs
> 0);
956 lwkt_reltoken(&pgrp
->pg_token
);
957 lwkt_reltoken(&p
->p_token
);
961 * A process group has become orphaned;
962 * if there are any stopped processes in the group,
963 * hang-up all process in that group.
965 * The caller must hold pg_token.
968 orphanpg(struct pgrp
*pg
)
972 LIST_FOREACH(p
, &pg
->pg_members
, p_pglist
) {
973 if (p
->p_stat
== SSTOP
) {
974 LIST_FOREACH(p
, &pg
->pg_members
, p_pglist
) {
984 * Add a new process to the allproc list and the PID hash. This
985 * also assigns a pid to the new process.
990 proc_add_allproc(struct proc
*p
)
994 if ((random_offset
= randompid
) != 0) {
995 read_random(&random_offset
, sizeof(random_offset
));
996 random_offset
= (random_offset
& 0x7FFFFFFF) % randompid
;
998 proc_makepid(p
, random_offset
);
1002 * Calculate a new process pid. This function is integrated into
1003 * proc_add_allproc() to guarentee that the new pid is not reused before
1004 * the new process can be added to the allproc list.
1006 * p_pid is assigned and the process is added to the allproc hash table
1008 * WARNING! We need to allocate PIDs sequentially during early boot.
1009 * In particular, init needs to have a pid of 1.
1013 proc_makepid(struct proc
*p
, int random_offset
)
1015 static pid_t nextpid
= 1; /* heuristic, allowed to race */
1019 struct session
*sess
;
1026 * Select the next pid base candidate.
1028 * Check cyclement, do not allow a pid < 100.
1032 base
= atomic_fetchadd_int(&nextpid
, 1) + random_offset
;
1033 if (base
<= 0 || base
>= PID_MAX
) {
1034 base
= base
% PID_MAX
;
1039 nextpid
= base
; /* reset (SMP race ok) */
1043 * Do not allow a base pid to be selected from a domain that has
1044 * recently seen a pid/pgid/sessid reap. Sleep a little if we looped
1045 * through all available domains.
1047 * WARNING: We want the early pids to be allocated linearly,
1048 * particularly pid 1 and pid 2.
1050 if (++retries
>= PIDSEL_DOMAINS
)
1051 tsleep(&nextpid
, 0, "makepid", 1);
1053 delta8
= (int8_t)time_second
-
1054 (int8_t)pid_doms
[base
% PIDSEL_DOMAINS
];
1055 if (delta8
>= 0 && delta8
<= PIDDOM_DELAY
) {
1062 * Calculate a hash index and find an unused process id within
1063 * the table, looping if we cannot find one.
1065 * The inner loop increments by ALLPROC_HSIZE which keeps the
1066 * PID at the same pid_doms[] index as well as the same hash index.
1068 n
= ALLPROC_HASH(base
);
1070 lwkt_gettoken(&prg
->proc_token
);
1073 LIST_FOREACH(ps
, &prg
->allproc
, p_list
) {
1074 if (ps
->p_pid
== base
) {
1075 base
+= ALLPROC_HSIZE
;
1076 if (base
>= PID_MAX
) {
1077 lwkt_reltoken(&prg
->proc_token
);
1084 LIST_FOREACH(pg
, &prg
->allpgrp
, pg_list
) {
1085 if (pg
->pg_id
== base
) {
1086 base
+= ALLPROC_HSIZE
;
1087 if (base
>= PID_MAX
) {
1088 lwkt_reltoken(&prg
->proc_token
);
1095 LIST_FOREACH(sess
, &prg
->allsess
, s_list
) {
1096 if (sess
->s_sid
== base
) {
1097 base
+= ALLPROC_HSIZE
;
1098 if (base
>= PID_MAX
) {
1099 lwkt_reltoken(&prg
->proc_token
);
1108 * Assign the pid and insert the process.
1111 LIST_INSERT_HEAD(&prg
->allproc
, p
, p_list
);
1112 lwkt_reltoken(&prg
->proc_token
);
1116 * Called from exit1 to place the process into a zombie state.
1117 * The process is removed from the pid hash and p_stat is set
1118 * to SZOMB. Normal pfind[n]() calls will not find it any more.
1120 * Caller must hold p->p_token. We are required to wait until p_lock
1121 * becomes zero before we can manipulate the list, allowing allproc
1122 * scans to guarantee consistency during a list scan.
1125 proc_move_allproc_zombie(struct proc
*p
)
1130 n
= ALLPROC_HASH(p
->p_pid
);
1132 PSTALL(p
, "reap1", 0);
1133 lwkt_gettoken(&prg
->proc_token
);
1135 PSTALL(p
, "reap1a", 0);
1138 lwkt_reltoken(&prg
->proc_token
);
1139 dsched_exit_proc(p
);
1143 * This routine is called from kern_wait() and will remove the process
1144 * from the zombie list and the sibling list. This routine will block
1145 * if someone has a lock on the proces (p_lock).
1147 * Caller must hold p->p_token. We are required to wait until p_lock
1148 * becomes one before we can manipulate the list, allowing allproc
1149 * scans to guarantee consistency during a list scan.
1151 * Assumes caller has one ref.
1154 proc_remove_zombie(struct proc
*p
)
1159 n
= ALLPROC_HASH(p
->p_pid
);
1162 PSTALL(p
, "reap2", 1);
1163 lwkt_gettoken(&prg
->proc_token
);
1164 PSTALL(p
, "reap2a", 1);
1165 LIST_REMOVE(p
, p_list
); /* from remove master list */
1166 LIST_REMOVE(p
, p_sibling
); /* and from sibling list */
1169 if (pid_doms
[p
->p_pid
% PIDSEL_DOMAINS
] != (uint8_t)time_second
)
1170 pid_doms
[p
->p_pid
% PIDSEL_DOMAINS
] = (uint8_t)time_second
;
1171 lwkt_reltoken(&prg
->proc_token
);
1175 * Handle various requirements prior to returning to usermode. Called from
1176 * platform trap and system call code.
1179 lwpuserret(struct lwp
*lp
)
1181 struct proc
*p
= lp
->lwp_proc
;
1183 if (lp
->lwp_mpflags
& LWP_MP_VNLRU
) {
1184 atomic_clear_int(&lp
->lwp_mpflags
, LWP_MP_VNLRU
);
1187 if (lp
->lwp_mpflags
& LWP_MP_WEXIT
) {
1188 lwkt_gettoken(&p
->p_token
);
1190 lwkt_reltoken(&p
->p_token
); /* NOT REACHED */
1195 * Kernel threads run from user processes can also accumulate deferred
1196 * actions which need to be acted upon. Callers include:
1198 * nfsd - Can allocate lots of vnodes
1201 lwpkthreaddeferred(void)
1203 struct lwp
*lp
= curthread
->td_lwp
;
1206 if (lp
->lwp_mpflags
& LWP_MP_VNLRU
) {
1207 atomic_clear_int(&lp
->lwp_mpflags
, LWP_MP_VNLRU
);
1214 proc_usermap(struct proc
*p
, int invfork
)
1216 struct sys_upmap
*upmap
;
1218 lwkt_gettoken(&p
->p_token
);
1219 upmap
= kmalloc(roundup2(sizeof(*upmap
), PAGE_SIZE
), M_PROC
,
1221 if (p
->p_upmap
== NULL
) {
1222 upmap
->header
[0].type
= UKPTYPE_VERSION
;
1223 upmap
->header
[0].offset
= offsetof(struct sys_upmap
, version
);
1224 upmap
->header
[1].type
= UPTYPE_RUNTICKS
;
1225 upmap
->header
[1].offset
= offsetof(struct sys_upmap
, runticks
);
1226 upmap
->header
[2].type
= UPTYPE_FORKID
;
1227 upmap
->header
[2].offset
= offsetof(struct sys_upmap
, forkid
);
1228 upmap
->header
[3].type
= UPTYPE_PID
;
1229 upmap
->header
[3].offset
= offsetof(struct sys_upmap
, pid
);
1230 upmap
->header
[4].type
= UPTYPE_PROC_TITLE
;
1231 upmap
->header
[4].offset
= offsetof(struct sys_upmap
,proc_title
);
1232 upmap
->header
[5].type
= UPTYPE_INVFORK
;
1233 upmap
->header
[5].offset
= offsetof(struct sys_upmap
, invfork
);
1235 upmap
->version
= UPMAP_VERSION
;
1236 upmap
->pid
= p
->p_pid
;
1237 upmap
->forkid
= p
->p_forkid
;
1238 upmap
->invfork
= invfork
;
1241 kfree(upmap
, M_PROC
);
1243 lwkt_reltoken(&p
->p_token
);
1247 proc_userunmap(struct proc
*p
)
1249 struct sys_upmap
*upmap
;
1251 lwkt_gettoken(&p
->p_token
);
1252 if ((upmap
= p
->p_upmap
) != NULL
) {
1254 kfree(upmap
, M_PROC
);
1256 lwkt_reltoken(&p
->p_token
);
1260 * Scan all processes on the allproc list. The process is automatically
1261 * held for the callback. A return value of -1 terminates the loop.
1262 * Zombie procs are skipped.
1264 * The callback is made with the process held and proc_token held.
1266 * We limit the scan to the number of processes as-of the start of
1267 * the scan so as not to get caught up in an endless loop if new processes
1268 * are created more quickly than we can scan the old ones. Add a little
1269 * slop to try to catch edge cases since nprocs can race.
1274 allproc_scan(int (*callback
)(struct proc
*, void *), void *data
, int segmented
)
1276 int limit
= nprocs
+ ncpus
;
1284 int id
= mycpu
->gd_cpuid
;
1285 ns
= id
* ALLPROC_HSIZE
/ ncpus
;
1286 ne
= (id
+ 1) * ALLPROC_HSIZE
/ ncpus
;
1293 * prg->proc_token protects the allproc list and PHOLD() prevents the
1294 * process from being removed from the allproc list or the zombproc
1297 for (n
= ns
; n
< ne
; ++n
) {
1298 procglob_t
*prg
= &procglob
[n
];
1299 if (LIST_FIRST(&prg
->allproc
) == NULL
)
1301 lwkt_gettoken(&prg
->proc_token
);
1302 LIST_FOREACH(p
, &prg
->allproc
, p_list
) {
1303 if (p
->p_stat
== SZOMB
)
1306 r
= callback(p
, data
);
1313 lwkt_reltoken(&prg
->proc_token
);
1316 * Check if asked to stop early
1324 * Scan all lwps of processes on the allproc list. The lwp is automatically
1325 * held for the callback. A return value of -1 terminates the loop.
1327 * The callback is made with the proces and lwp both held, and proc_token held.
1332 alllwp_scan(int (*callback
)(struct lwp
*, void *), void *data
, int segmented
)
1342 int id
= mycpu
->gd_cpuid
;
1343 ns
= id
* ALLPROC_HSIZE
/ ncpus
;
1344 ne
= (id
+ 1) * ALLPROC_HSIZE
/ ncpus
;
1350 for (n
= ns
; n
< ne
; ++n
) {
1351 procglob_t
*prg
= &procglob
[n
];
1353 if (LIST_FIRST(&prg
->allproc
) == NULL
)
1355 lwkt_gettoken(&prg
->proc_token
);
1356 LIST_FOREACH(p
, &prg
->allproc
, p_list
) {
1357 if (p
->p_stat
== SZOMB
)
1360 lwkt_gettoken(&p
->p_token
);
1361 FOREACH_LWP_IN_PROC(lp
, p
) {
1363 r
= callback(lp
, data
);
1366 lwkt_reltoken(&p
->p_token
);
1371 lwkt_reltoken(&prg
->proc_token
);
1374 * Asked to exit early
1382 * Scan all processes on the zombproc list. The process is automatically
1383 * held for the callback. A return value of -1 terminates the loop.
1386 * The callback is made with the proces held and proc_token held.
1389 zombproc_scan(int (*callback
)(struct proc
*, void *), void *data
)
1396 * prg->proc_token protects the allproc list and PHOLD() prevents the
1397 * process from being removed from the allproc list or the zombproc
1400 for (n
= 0; n
< ALLPROC_HSIZE
; ++n
) {
1401 procglob_t
*prg
= &procglob
[n
];
1403 if (LIST_FIRST(&prg
->allproc
) == NULL
)
1405 lwkt_gettoken(&prg
->proc_token
);
1406 LIST_FOREACH(p
, &prg
->allproc
, p_list
) {
1407 if (p
->p_stat
!= SZOMB
)
1410 r
= callback(p
, data
);
1415 lwkt_reltoken(&prg
->proc_token
);
1418 * Check if asked to stop early
1425 #include "opt_ddb.h"
1427 #include <ddb/ddb.h>
1432 DB_SHOW_COMMAND(pgrpdump
, pgrpdump
)
1439 for (i
= 0; i
< ALLPROC_HSIZE
; ++i
) {
1442 if (LIST_EMPTY(&prg
->allpgrp
))
1444 kprintf("\tindx %d\n", i
);
1445 LIST_FOREACH(pgrp
, &prg
->allpgrp
, pg_list
) {
1446 kprintf("\tpgrp %p, pgid %ld, sess %p, "
1447 "sesscnt %d, mem %p\n",
1448 (void *)pgrp
, (long)pgrp
->pg_id
,
1449 (void *)pgrp
->pg_session
,
1450 pgrp
->pg_session
->s_count
,
1451 (void *)LIST_FIRST(&pgrp
->pg_members
));
1452 LIST_FOREACH(p
, &pgrp
->pg_members
, p_pglist
) {
1453 kprintf("\t\tpid %ld addr %p pgrp %p\n",
1454 (long)p
->p_pid
, (void *)p
,
1463 * The caller must hold proc_token.
1466 sysctl_out_proc(struct proc
*p
, struct sysctl_req
*req
, int flags
)
1468 struct kinfo_proc ki
;
1470 int skp
= 0, had_output
= 0;
1473 bzero(&ki
, sizeof(ki
));
1474 lwkt_gettoken_shared(&p
->p_token
);
1475 fill_kinfo_proc(p
, &ki
);
1476 if ((flags
& KERN_PROC_FLAG_LWP
) == 0)
1479 FOREACH_LWP_IN_PROC(lp
, p
) {
1481 fill_kinfo_lwp(lp
, &ki
.kp_lwp
);
1483 error
= SYSCTL_OUT(req
, &ki
, sizeof(ki
));
1490 lwkt_reltoken(&p
->p_token
);
1491 /* We need to output at least the proc, even if there is no lwp. */
1492 if (had_output
== 0) {
1493 error
= SYSCTL_OUT(req
, &ki
, sizeof(ki
));
1499 * The caller must hold proc_token.
1502 sysctl_out_proc_kthread(struct thread
*td
, struct sysctl_req
*req
)
1504 struct kinfo_proc ki
;
1507 fill_kinfo_proc_kthread(td
, &ki
);
1508 error
= SYSCTL_OUT(req
, &ki
, sizeof(ki
));
1518 sysctl_kern_proc(SYSCTL_HANDLER_ARGS
)
1520 int *name
= (int *)arg1
;
1521 int oid
= oidp
->oid_number
;
1522 u_int namelen
= arg2
;
1525 struct thread
*marker
;
1530 struct ucred
*cr1
= curproc
->p_ucred
;
1531 struct ucred
*crcache
= NULL
;
1533 flags
= oid
& KERN_PROC_FLAGMASK
;
1534 oid
&= ~KERN_PROC_FLAGMASK
;
1536 if ((oid
== KERN_PROC_ALL
&& namelen
!= 0) ||
1537 (oid
!= KERN_PROC_ALL
&& namelen
!= 1)) {
1542 * proc_token protects the allproc list and PHOLD() prevents the
1543 * process from being removed from the allproc list or the zombproc
1546 if (oid
== KERN_PROC_PID
) {
1547 p
= pfind((pid_t
)name
[0]);
1549 crcache
= pcredcache(crcache
, p
);
1550 if (PRISON_CHECK(cr1
, crcache
))
1551 error
= sysctl_out_proc(p
, req
, flags
);
1559 /* overestimate by 5 procs */
1560 error
= SYSCTL_OUT(req
, 0, sizeof (struct kinfo_proc
) * 5);
1565 for (n
= 0; n
< ALLPROC_HSIZE
; ++n
) {
1566 procglob_t
*prg
= &procglob
[n
];
1568 if (LIST_EMPTY(&prg
->allproc
))
1570 lwkt_gettoken_shared(&prg
->proc_token
);
1571 LIST_FOREACH(p
, &prg
->allproc
, p_list
) {
1573 * Show a user only their processes.
1575 if (ps_showallprocs
== 0) {
1576 crcache
= pcredcache(crcache
, p
);
1577 if (crcache
== NULL
||
1578 p_trespass(cr1
, crcache
)) {
1584 * Skip embryonic processes.
1586 if (p
->p_stat
== SIDL
)
1589 * TODO - make more efficient (see notes below).
1593 case KERN_PROC_PGRP
:
1594 /* could do this by traversing pgrp */
1595 if (p
->p_pgrp
== NULL
||
1596 p
->p_pgrp
->pg_id
!= (pid_t
)name
[0])
1601 if ((p
->p_flags
& P_CONTROLT
) == 0 ||
1602 p
->p_session
== NULL
||
1603 p
->p_session
->s_ttyp
== NULL
||
1604 dev2udev(p
->p_session
->s_ttyp
->t_dev
) !=
1610 crcache
= pcredcache(crcache
, p
);
1611 if (crcache
== NULL
||
1612 crcache
->cr_uid
!= (uid_t
)name
[0]) {
1617 case KERN_PROC_RUID
:
1618 crcache
= pcredcache(crcache
, p
);
1619 if (crcache
== NULL
||
1620 crcache
->cr_ruid
!= (uid_t
)name
[0]) {
1626 crcache
= pcredcache(crcache
, p
);
1627 if (!PRISON_CHECK(cr1
, crcache
))
1630 error
= sysctl_out_proc(p
, req
, flags
);
1633 lwkt_reltoken(&prg
->proc_token
);
1637 lwkt_reltoken(&prg
->proc_token
);
1641 * Iterate over all active cpus and scan their thread list. Start
1642 * with the next logical cpu and end with our original cpu. We
1643 * migrate our own thread to each target cpu in order to safely scan
1644 * its thread list. In the last loop we migrate back to our original
1647 origcpu
= mycpu
->gd_cpuid
;
1648 if (!ps_showallthreads
|| jailed(cr1
))
1651 marker
= kmalloc(sizeof(struct thread
), M_TEMP
, M_WAITOK
|M_ZERO
);
1652 marker
->td_flags
= TDF_MARKER
;
1655 for (n
= 1; n
<= ncpus
; ++n
) {
1659 nid
= (origcpu
+ n
) % ncpus
;
1660 if (CPUMASK_TESTBIT(smp_active_mask
, nid
) == 0)
1662 rgd
= globaldata_find(nid
);
1663 lwkt_setcpu_self(rgd
);
1666 TAILQ_INSERT_TAIL(&rgd
->gd_tdallq
, marker
, td_allq
);
1668 while ((td
= TAILQ_PREV(marker
, lwkt_queue
, td_allq
)) != NULL
) {
1669 TAILQ_REMOVE(&rgd
->gd_tdallq
, marker
, td_allq
);
1670 TAILQ_INSERT_BEFORE(td
, marker
, td_allq
);
1671 if (td
->td_flags
& TDF_MARKER
)
1680 case KERN_PROC_PGRP
:
1683 case KERN_PROC_RUID
:
1686 error
= sysctl_out_proc_kthread(td
, req
);
1694 TAILQ_REMOVE(&rgd
->gd_tdallq
, marker
, td_allq
);
1702 * Userland scheduler expects us to return on the same cpu we
1705 if (mycpu
->gd_cpuid
!= origcpu
)
1706 lwkt_setcpu_self(globaldata_find(origcpu
));
1708 kfree(marker
, M_TEMP
);
1717 * This sysctl allows a process to retrieve the argument list or process
1718 * title for another process without groping around in the address space
1719 * of the other process. It also allow a process to set its own "process
1720 * title to a string of its own choice.
1725 sysctl_kern_proc_args(SYSCTL_HANDLER_ARGS
)
1727 int *name
= (int*) arg1
;
1728 u_int namelen
= arg2
;
1733 struct ucred
*cr1
= curproc
->p_ucred
;
1738 p
= pfind((pid_t
)name
[0]);
1741 lwkt_gettoken(&p
->p_token
);
1743 if ((!ps_argsopen
) && p_trespass(cr1
, p
->p_ucred
))
1746 if (req
->newptr
&& curproc
!= p
) {
1751 if (p
->p_upmap
!= NULL
&& p
->p_upmap
->proc_title
[0]) {
1753 * Args set via writable user process mmap.
1754 * We must calculate the string length manually
1755 * because the user data can change at any time.
1760 base
= p
->p_upmap
->proc_title
;
1761 for (n
= 0; n
< UPMAP_MAXPROCTITLE
- 1; ++n
) {
1765 error
= SYSCTL_OUT(req
, base
, n
);
1767 error
= SYSCTL_OUT(req
, "", 1);
1768 } else if ((pa
= p
->p_args
) != NULL
) {
1770 * Args set by setproctitle() sysctl.
1772 refcount_acquire(&pa
->ar_ref
);
1773 error
= SYSCTL_OUT(req
, pa
->ar_args
, pa
->ar_length
);
1774 if (refcount_release(&pa
->ar_ref
))
1778 if (req
->newptr
== NULL
)
1781 if (req
->newlen
+ sizeof(struct pargs
) > ps_arg_cache_limit
) {
1785 pa
= kmalloc(sizeof(struct pargs
) + req
->newlen
, M_PARGS
, M_WAITOK
);
1786 refcount_init(&pa
->ar_ref
, 1);
1787 pa
->ar_length
= req
->newlen
;
1788 error
= SYSCTL_IN(req
, pa
->ar_args
, req
->newlen
);
1796 * Replace p_args with the new pa. p_args may have previously
1803 KKASSERT(opa
->ar_ref
> 0);
1804 if (refcount_release(&opa
->ar_ref
)) {
1805 kfree(opa
, M_PARGS
);
1811 lwkt_reltoken(&p
->p_token
);
1818 sysctl_kern_proc_cwd(SYSCTL_HANDLER_ARGS
)
1820 int *name
= (int*) arg1
;
1821 u_int namelen
= arg2
;
1824 char *fullpath
, *freepath
;
1825 struct ucred
*cr1
= curproc
->p_ucred
;
1830 p
= pfind((pid_t
)name
[0]);
1833 lwkt_gettoken_shared(&p
->p_token
);
1836 * If we are not allowed to see other args, we certainly shouldn't
1837 * get the cwd either. Also check the usual trespassing.
1839 if ((!ps_argsopen
) && p_trespass(cr1
, p
->p_ucred
))
1842 if (req
->oldptr
&& p
->p_fd
!= NULL
&& p
->p_fd
->fd_ncdir
.ncp
) {
1843 struct nchandle nch
;
1845 cache_copy(&p
->p_fd
->fd_ncdir
, &nch
);
1846 error
= cache_fullpath(p
, &nch
, NULL
,
1847 &fullpath
, &freepath
, 0);
1851 error
= SYSCTL_OUT(req
, fullpath
, strlen(fullpath
) + 1);
1852 kfree(freepath
, M_TEMP
);
1857 lwkt_reltoken(&p
->p_token
);
1864 * This sysctl allows a process to retrieve the path of the executable for
1865 * itself or another process.
1868 sysctl_kern_proc_pathname(SYSCTL_HANDLER_ARGS
)
1870 pid_t
*pidp
= (pid_t
*)arg1
;
1871 unsigned int arglen
= arg2
;
1873 char *retbuf
, *freebuf
;
1875 struct nchandle nch
;
1879 if (*pidp
== -1) { /* -1 means this process */
1887 cache_copy(&p
->p_textnch
, &nch
);
1888 error
= cache_fullpath(p
, &nch
, NULL
, &retbuf
, &freebuf
, 0);
1892 error
= SYSCTL_OUT(req
, retbuf
, strlen(retbuf
) + 1);
1893 kfree(freebuf
, M_TEMP
);
1902 sysctl_kern_proc_sigtramp(SYSCTL_HANDLER_ARGS
)
1904 /*int *name = (int *)arg1;*/
1905 u_int namelen
= arg2
;
1906 struct kinfo_sigtramp kst
;
1907 const struct sysentvec
*sv
;
1912 /* ignore pid if passed in (freebsd compatibility) */
1914 sv
= curproc
->p_sysent
;
1915 bzero(&kst
, sizeof(kst
));
1916 if (sv
->sv_szsigcode
) {
1919 sigbase
= trunc_page64((intptr_t)PS_STRINGS
-
1921 sigbase
-= SZSIGCODE_EXTRA_BYTES
;
1923 kst
.ksigtramp_start
= (void *)sigbase
;
1924 kst
.ksigtramp_end
= (void *)(sigbase
+ *sv
->sv_szsigcode
);
1926 error
= SYSCTL_OUT(req
, &kst
, sizeof(kst
));
1931 SYSCTL_NODE(_kern
, KERN_PROC
, proc
, CTLFLAG_RD
, 0, "Process table");
1933 SYSCTL_PROC(_kern_proc
, KERN_PROC_ALL
, all
,
1934 CTLFLAG_RD
| CTLTYPE_STRUCT
| CTLFLAG_NOLOCK
,
1935 0, 0, sysctl_kern_proc
, "S,proc", "Return entire process table");
1937 SYSCTL_NODE(_kern_proc
, KERN_PROC_PGRP
, pgrp
,
1938 CTLFLAG_RD
| CTLFLAG_NOLOCK
,
1939 sysctl_kern_proc
, "Process table");
1941 SYSCTL_NODE(_kern_proc
, KERN_PROC_TTY
, tty
,
1942 CTLFLAG_RD
| CTLFLAG_NOLOCK
,
1943 sysctl_kern_proc
, "Process table");
1945 SYSCTL_NODE(_kern_proc
, KERN_PROC_UID
, uid
,
1946 CTLFLAG_RD
| CTLFLAG_NOLOCK
,
1947 sysctl_kern_proc
, "Process table");
1949 SYSCTL_NODE(_kern_proc
, KERN_PROC_RUID
, ruid
,
1950 CTLFLAG_RD
| CTLFLAG_NOLOCK
,
1951 sysctl_kern_proc
, "Process table");
1953 SYSCTL_NODE(_kern_proc
, KERN_PROC_PID
, pid
,
1954 CTLFLAG_RD
| CTLFLAG_NOLOCK
,
1955 sysctl_kern_proc
, "Process table");
1957 SYSCTL_NODE(_kern_proc
, (KERN_PROC_ALL
| KERN_PROC_FLAG_LWP
), all_lwp
,
1958 CTLFLAG_RD
| CTLFLAG_NOLOCK
,
1959 sysctl_kern_proc
, "Process table");
1961 SYSCTL_NODE(_kern_proc
, (KERN_PROC_PGRP
| KERN_PROC_FLAG_LWP
), pgrp_lwp
,
1962 CTLFLAG_RD
| CTLFLAG_NOLOCK
,
1963 sysctl_kern_proc
, "Process table");
1965 SYSCTL_NODE(_kern_proc
, (KERN_PROC_TTY
| KERN_PROC_FLAG_LWP
), tty_lwp
,
1966 CTLFLAG_RD
| CTLFLAG_NOLOCK
,
1967 sysctl_kern_proc
, "Process table");
1969 SYSCTL_NODE(_kern_proc
, (KERN_PROC_UID
| KERN_PROC_FLAG_LWP
), uid_lwp
,
1970 CTLFLAG_RD
| CTLFLAG_NOLOCK
,
1971 sysctl_kern_proc
, "Process table");
1973 SYSCTL_NODE(_kern_proc
, (KERN_PROC_RUID
| KERN_PROC_FLAG_LWP
), ruid_lwp
,
1974 CTLFLAG_RD
| CTLFLAG_NOLOCK
,
1975 sysctl_kern_proc
, "Process table");
1977 SYSCTL_NODE(_kern_proc
, (KERN_PROC_PID
| KERN_PROC_FLAG_LWP
), pid_lwp
,
1978 CTLFLAG_RD
| CTLFLAG_NOLOCK
,
1979 sysctl_kern_proc
, "Process table");
1981 SYSCTL_NODE(_kern_proc
, KERN_PROC_ARGS
, args
,
1982 CTLFLAG_RW
| CTLFLAG_ANYBODY
| CTLFLAG_NOLOCK
,
1983 sysctl_kern_proc_args
, "Process argument list");
1985 SYSCTL_NODE(_kern_proc
, KERN_PROC_CWD
, cwd
,
1986 CTLFLAG_RD
| CTLFLAG_ANYBODY
| CTLFLAG_NOLOCK
,
1987 sysctl_kern_proc_cwd
, "Process argument list");
1989 static SYSCTL_NODE(_kern_proc
, KERN_PROC_PATHNAME
, pathname
,
1990 CTLFLAG_RD
| CTLFLAG_NOLOCK
,
1991 sysctl_kern_proc_pathname
, "Process executable path");
1993 SYSCTL_PROC(_kern_proc
, KERN_PROC_SIGTRAMP
, sigtramp
,
1994 CTLFLAG_RD
| CTLTYPE_STRUCT
| CTLFLAG_NOLOCK
,
1995 0, 0, sysctl_kern_proc_sigtramp
, "S,sigtramp",
1996 "Return sigtramp address range");