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");
89 MALLOC_DEFINE(M_UPMAP, "upmap", "upmap/kpmap/lpmap 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_WAITING 0x40000000 /* tsleep() on p_lock */
264 #define PLOCK_ZOMB 0x20000000 /* zombie interlock held */
265 #define PLOCK_WAITRES 0x10000000 /* wait reservation held */
266 #define PLOCK_MASK 0x0FFFFFFF
269 * Returns non-zero if the WAITRES flag has been set
272 pwaitres_pending(struct proc *p)
274 if (p->p_lock & PLOCK_WAITRES)
280 * Caller holds PLOCK_ZOMB. Sets PLOCK_WAITRES and wakes up anyone in
281 * pholdzomb() (which will fail).
284 pwaitres_set(struct proc *p)
288 KKASSERT((p->p_lock & (PLOCK_ZOMB | PLOCK_WAITRES)) == PLOCK_ZOMB);
292 if (atomic_fcmpset_int(&p->p_lock, &o,
293 (o | PLOCK_WAITRES) & ~PLOCK_WAITING)) {
294 if (o & PLOCK_WAITING)
302 pstall(struct proc *p, const char *wmesg, int count)
310 if ((o & PLOCK_MASK) <= count)
312 n = o | PLOCK_WAITING;
313 tsleep_interlock(&p->p_lock, 0);
316 * If someone is trying to single-step the process during
317 * an exec or an exit they can deadlock us because procfs
318 * sleeps with the process held.
321 if (p->p_flags & P_INEXEC) {
323 } else if (p->p_flags & P_POSTEXIT) {
324 spin_lock(&p->p_spin);
327 spin_unlock(&p->p_spin);
332 if (atomic_cmpset_int(&p->p_lock, o, n)) {
333 tsleep(&p->p_lock, PINTERLOCKED, wmesg, 0);
339 phold(struct proc *p)
341 atomic_add_int(&p->p_lock, 1);
345 * WARNING! On last release (p) can become instantly invalid due to
349 prele(struct proc *p)
357 if (atomic_cmpset_int(&p->p_lock, 1, 0))
365 KKASSERT((o & PLOCK_MASK) > 0);
367 n = (o - 1) & ~PLOCK_WAITING;
368 if (atomic_cmpset_int(&p->p_lock, o, n)) {
369 if (o & PLOCK_WAITING)
377 * Hold and flag serialized for zombie reaping purposes. Fail if we had
378 * to sleep or if another thread has reserved the reap (WAITRES).
380 * This function will fail if it has to block, returning non-zero with
381 * neither the flag set or the hold count bumped. Note that (p) may
382 * not be valid in this case if the caller does not have some other
385 * This function does not block on other PHOLD()s, only on other
388 * Zero is returned on success. The hold count will be incremented and
389 * the serialization flag acquired. Note that serialization is only against
390 * other pholdzomb() calls, not against phold() calls.
393 pholdzomb(struct proc *p)
401 if (atomic_cmpset_int(&p->p_lock, 0, PLOCK_ZOMB | 1))
410 if ((o & (PLOCK_ZOMB | PLOCK_WAITRES)) == 0) {
411 n = (o + 1) | PLOCK_ZOMB;
412 if (atomic_cmpset_int(&p->p_lock, o, n))
414 } else if (o & PLOCK_WAITRES) {
417 KKASSERT((o & PLOCK_MASK) > 0);
418 n = o | PLOCK_WAITING;
419 tsleep_interlock(&p->p_lock, 0);
420 if (atomic_cmpset_int(&p->p_lock, o, n)) {
421 tsleep(&p->p_lock, PINTERLOCKED, "phldz", 0);
422 /* (p) can be ripped out at this point */
430 * Release PLOCK_ZOMB, PLOCK_WAITRES, and the hold count, waking up any
433 * WARNING! On last release (p) can become instantly invalid due to
437 prelezomb(struct proc *p)
445 if (atomic_cmpset_int(&p->p_lock, PLOCK_ZOMB | 1, 0))
451 KKASSERT(p->p_lock & PLOCK_ZOMB);
454 KKASSERT((o & PLOCK_MASK) > 0);
456 n = (o - 1) & ~(PLOCK_ZOMB | PLOCK_WAITING | PLOCK_WAITRES);
457 if (atomic_cmpset_int(&p->p_lock, o, n)) {
458 if (o & PLOCK_WAITING)
466 * Is p an inferior of the current process?
471 inferior(struct proc *p)
476 lwkt_gettoken_shared(&p->p_token);
477 while (p != curproc) {
479 lwkt_reltoken(&p->p_token);
484 lwkt_reltoken(&p->p_token);
486 lwkt_gettoken_shared(&p2->p_token);
489 lwkt_reltoken(&p->p_token);
496 * Locate a process by number. The returned process will be referenced and
497 * must be released with PRELE().
504 struct proc *p = curproc;
509 * Shortcut the current process
511 if (p && p->p_pid == pid) {
517 * Otherwise find it in the hash table.
519 n = ALLPROC_HASH(pid);
522 lwkt_gettoken_shared(&prg->proc_token);
523 LIST_FOREACH(p, &prg->allproc, p_list) {
524 if (p->p_stat == SZOMB)
526 if (p->p_pid == pid) {
528 lwkt_reltoken(&prg->proc_token);
532 lwkt_reltoken(&prg->proc_token);
538 * Locate a process by number. The returned process is NOT referenced.
539 * The result will not be stable and is typically only used to validate
540 * against a process that the caller has in-hand.
547 struct proc *p = curproc;
552 * Shortcut the current process
554 if (p && p->p_pid == pid)
558 * Otherwise find it in the hash table.
560 n = ALLPROC_HASH(pid);
563 lwkt_gettoken_shared(&prg->proc_token);
564 LIST_FOREACH(p, &prg->allproc, p_list) {
565 if (p->p_stat == SZOMB)
567 if (p->p_pid == pid) {
568 lwkt_reltoken(&prg->proc_token);
572 lwkt_reltoken(&prg->proc_token);
578 * Locate a process on the zombie list. Return a process or NULL.
579 * The returned process will be referenced and the caller must release
582 * No other requirements.
587 struct proc *p = curproc;
592 * Shortcut the current process
594 if (p && p->p_pid == pid) {
600 * Otherwise find it in the hash table.
602 n = ALLPROC_HASH(pid);
605 lwkt_gettoken_shared(&prg->proc_token);
606 LIST_FOREACH(p, &prg->allproc, p_list) {
607 if (p->p_stat != SZOMB)
609 if (p->p_pid == pid) {
611 lwkt_reltoken(&prg->proc_token);
615 lwkt_reltoken(&prg->proc_token);
621 * Caller must hold the process token shared or exclusive.
622 * The returned lwp, if not NULL, will be held. Caller must
623 * LWPRELE() it when done.
626 lwpfind(struct proc *p, lwpid_t tid)
630 lp = lwp_rb_tree_RB_LOOKUP(&p->p_lwp_tree, tid);
637 pgref(struct pgrp *pgrp)
639 refcount_acquire(&pgrp->pg_refs);
643 pgrel(struct pgrp *pgrp)
649 n = PGRP_HASH(pgrp->pg_id);
653 count = pgrp->pg_refs;
657 lwkt_gettoken(&prg->proc_token);
658 if (atomic_cmpset_int(&pgrp->pg_refs, 1, 0))
660 lwkt_reltoken(&prg->proc_token);
663 if (atomic_cmpset_int(&pgrp->pg_refs, count, count - 1))
670 * Successful 1->0 transition, pghash_spin is held.
672 LIST_REMOVE(pgrp, pg_list);
673 if (pid_doms[pgrp->pg_id % PIDSEL_DOMAINS] != (uint8_t)time_second)
674 pid_doms[pgrp->pg_id % PIDSEL_DOMAINS] = (uint8_t)time_second;
677 * Reset any sigio structures pointing to us as a result of
678 * F_SETOWN with our pgid.
680 funsetownlst(&pgrp->pg_sigiolst);
682 if (pgrp->pg_session->s_ttyp != NULL &&
683 pgrp->pg_session->s_ttyp->t_pgrp == pgrp) {
684 pgrp->pg_session->s_ttyp->t_pgrp = NULL;
686 lwkt_reltoken(&prg->proc_token);
688 sess_rele(pgrp->pg_session);
693 * Locate a process group by number. The returned process group will be
694 * referenced w/pgref() and must be released with pgrel() (or assigned
695 * somewhere if you wish to keep the reference).
708 lwkt_gettoken_shared(&prg->proc_token);
710 LIST_FOREACH(pgrp, &prg->allpgrp, pg_list) {
711 if (pgrp->pg_id == pgid) {
712 refcount_acquire(&pgrp->pg_refs);
713 lwkt_reltoken(&prg->proc_token);
717 lwkt_reltoken(&prg->proc_token);
722 * Move p to a new or existing process group (and session)
727 enterpgrp(struct proc *p, pid_t pgid, int mksess)
735 KASSERT(pgrp == NULL || !mksess,
736 ("enterpgrp: setsid into non-empty pgrp"));
737 KASSERT(!SESS_LEADER(p),
738 ("enterpgrp: session leader attempted setpgrp"));
741 pid_t savepid = p->p_pid;
749 KASSERT(p->p_pid == pgid,
750 ("enterpgrp: new pgrp and pid != pgid"));
751 pgrp = kmalloc(sizeof(struct pgrp), M_PGRP, M_WAITOK | M_ZERO);
753 LIST_INIT(&pgrp->pg_members);
755 SLIST_INIT(&pgrp->pg_sigiolst);
756 lwkt_token_init(&pgrp->pg_token, "pgrp_token");
757 refcount_init(&pgrp->pg_refs, 1);
758 lockinit(&pgrp->pg_lock, "pgwt", 0, 0);
763 if ((np = pfindn(savepid)) == NULL || np != p) {
764 lwkt_reltoken(&prg->proc_token);
770 lwkt_gettoken(&prg->proc_token);
772 struct session *sess;
777 sess = kmalloc(sizeof(struct session), M_SESSION,
779 lwkt_gettoken(&p->p_token);
782 sess->s_sid = p->p_pid;
784 sess->s_ttyvp = NULL;
786 bcopy(p->p_session->s_login, sess->s_login,
787 sizeof(sess->s_login));
788 pgrp->pg_session = sess;
789 KASSERT(p == curproc,
790 ("enterpgrp: mksession and p != curproc"));
791 p->p_flags &= ~P_CONTROLT;
792 LIST_INSERT_HEAD(&prg->allsess, sess, s_list);
793 lwkt_reltoken(&p->p_token);
795 lwkt_gettoken(&p->p_token);
796 pgrp->pg_session = p->p_session;
797 sess_hold(pgrp->pg_session);
798 lwkt_reltoken(&p->p_token);
800 LIST_INSERT_HEAD(&prg->allpgrp, pgrp, pg_list);
802 lwkt_reltoken(&prg->proc_token);
803 } else if (pgrp == p->p_pgrp) {
806 } /* else pgfind() referenced the pgrp */
808 lwkt_gettoken(&pgrp->pg_token);
809 lwkt_gettoken(&p->p_token);
812 * Replace p->p_pgrp, handling any races that occur.
814 while ((opgrp = p->p_pgrp) != NULL) {
816 lwkt_gettoken(&opgrp->pg_token);
817 if (opgrp != p->p_pgrp) {
818 lwkt_reltoken(&opgrp->pg_token);
822 LIST_REMOVE(p, p_pglist);
826 LIST_INSERT_HEAD(&pgrp->pg_members, p, p_pglist);
829 * Adjust eligibility of affected pgrps to participate in job control.
830 * Increment eligibility counts before decrementing, otherwise we
831 * could reach 0 spuriously during the first call.
835 fixjobc(p, opgrp, 0);
836 lwkt_reltoken(&opgrp->pg_token);
837 pgrel(opgrp); /* manual pgref */
838 pgrel(opgrp); /* p->p_pgrp ref */
840 lwkt_reltoken(&p->p_token);
841 lwkt_reltoken(&pgrp->pg_token);
849 * Remove process from process group
854 leavepgrp(struct proc *p)
856 struct pgrp *pg = p->p_pgrp;
858 lwkt_gettoken(&p->p_token);
859 while ((pg = p->p_pgrp) != NULL) {
861 lwkt_gettoken(&pg->pg_token);
862 if (p->p_pgrp != pg) {
863 lwkt_reltoken(&pg->pg_token);
868 LIST_REMOVE(p, p_pglist);
869 lwkt_reltoken(&pg->pg_token);
870 pgrel(pg); /* manual pgref */
871 pgrel(pg); /* p->p_pgrp ref */
874 lwkt_reltoken(&p->p_token);
880 * Adjust the ref count on a session structure. When the ref count falls to
881 * zero the tty is disassociated from the session and the session structure
882 * is freed. Note that tty assocation is not itself ref-counted.
887 sess_hold(struct session *sp)
889 atomic_add_int(&sp->s_count, 1);
896 sess_rele(struct session *sess)
903 n = SESS_HASH(sess->s_sid);
907 count = sess->s_count;
911 lwkt_gettoken(&prg->proc_token);
912 if (atomic_cmpset_int(&sess->s_count, 1, 0))
914 lwkt_reltoken(&prg->proc_token);
917 if (atomic_cmpset_int(&sess->s_count, count, count - 1))
924 * Successful 1->0 transition and prg->proc_token is held.
926 LIST_REMOVE(sess, s_list);
927 if (pid_doms[sess->s_sid % PIDSEL_DOMAINS] != (uint8_t)time_second)
928 pid_doms[sess->s_sid % PIDSEL_DOMAINS] = (uint8_t)time_second;
930 if (sess->s_ttyp && sess->s_ttyp->t_session) {
931 #ifdef TTY_DO_FULL_CLOSE
932 /* FULL CLOSE, see ttyclearsession() */
933 KKASSERT(sess->s_ttyp->t_session == sess);
934 sess->s_ttyp->t_session = NULL;
936 /* HALF CLOSE, see ttyclearsession() */
937 if (sess->s_ttyp->t_session == sess)
938 sess->s_ttyp->t_session = NULL;
941 if ((tp = sess->s_ttyp) != NULL) {
945 lwkt_reltoken(&prg->proc_token);
947 kfree(sess, M_SESSION);
951 * Adjust pgrp jobc counters when specified process changes process group.
952 * We count the number of processes in each process group that "qualify"
953 * the group for terminal job control (those with a parent in a different
954 * process group of the same session). If that count reaches zero, the
955 * process group becomes orphaned. Check both the specified process'
956 * process group and that of its children.
957 * entering == 0 => p is leaving specified group.
958 * entering == 1 => p is entering specified group.
963 fixjobc(struct proc *p, struct pgrp *pgrp, int entering)
965 struct pgrp *hispgrp;
966 struct session *mysession;
970 * Check p's parent to see whether p qualifies its own process
971 * group; if so, adjust count for p's process group.
973 lwkt_gettoken(&p->p_token); /* p_children scan */
974 lwkt_gettoken(&pgrp->pg_token);
976 mysession = pgrp->pg_session;
977 if ((hispgrp = p->p_pptr->p_pgrp) != pgrp &&
978 hispgrp->pg_session == mysession) {
981 else if (--pgrp->pg_jobc == 0)
986 * Check this process' children to see whether they qualify
987 * their process groups; if so, adjust counts for children's
990 LIST_FOREACH(np, &p->p_children, p_sibling) {
992 lwkt_gettoken(&np->p_token);
993 if ((hispgrp = np->p_pgrp) != pgrp &&
994 hispgrp->pg_session == mysession &&
995 np->p_stat != SZOMB) {
997 lwkt_gettoken(&hispgrp->pg_token);
1000 else if (--hispgrp->pg_jobc == 0)
1002 lwkt_reltoken(&hispgrp->pg_token);
1005 lwkt_reltoken(&np->p_token);
1008 KKASSERT(pgrp->pg_refs > 0);
1009 lwkt_reltoken(&pgrp->pg_token);
1010 lwkt_reltoken(&p->p_token);
1014 * A process group has become orphaned;
1015 * if there are any stopped processes in the group,
1016 * hang-up all process in that group.
1018 * The caller must hold pg_token.
1021 orphanpg(struct pgrp *pg)
1025 LIST_FOREACH(p, &pg->pg_members, p_pglist) {
1026 if (p->p_stat == SSTOP) {
1027 LIST_FOREACH(p, &pg->pg_members, p_pglist) {
1029 ksignal(p, SIGCONT);
1037 * Add a new process to the allproc list and the PID hash. This
1038 * also assigns a pid to the new process.
1043 proc_add_allproc(struct proc *p)
1047 if ((random_offset = randompid) != 0) {
1048 read_random(&random_offset, sizeof(random_offset), 1);
1049 random_offset = (random_offset & 0x7FFFFFFF) % randompid;
1051 proc_makepid(p, random_offset);
1055 * Calculate a new process pid. This function is integrated into
1056 * proc_add_allproc() to guarentee that the new pid is not reused before
1057 * the new process can be added to the allproc list.
1059 * p_pid is assigned and the process is added to the allproc hash table
1061 * WARNING! We need to allocate PIDs sequentially during early boot.
1062 * In particular, init needs to have a pid of 1.
1066 proc_makepid(struct proc *p, int random_offset)
1068 static pid_t nextpid = 1; /* heuristic, allowed to race */
1072 struct session *sess;
1079 * Select the next pid base candidate.
1081 * Check cyclement, do not allow a pid < 100.
1085 base = atomic_fetchadd_int(&nextpid, 1) + random_offset;
1086 if (base <= 0 || base >= PID_MAX) {
1087 base = base % PID_MAX;
1092 nextpid = base; /* reset (SMP race ok) */
1096 * Do not allow a base pid to be selected from a domain that has
1097 * recently seen a pid/pgid/sessid reap. Sleep a little if we looped
1098 * through all available domains.
1100 * WARNING: We want the early pids to be allocated linearly,
1101 * particularly pid 1 and pid 2.
1103 if (++retries >= PIDSEL_DOMAINS)
1104 tsleep(&nextpid, 0, "makepid", 1);
1106 delta8 = (int8_t)time_second -
1107 (int8_t)pid_doms[base % PIDSEL_DOMAINS];
1108 if (delta8 >= 0 && delta8 <= PIDDOM_DELAY) {
1115 * Calculate a hash index and find an unused process id within
1116 * the table, looping if we cannot find one.
1118 * The inner loop increments by ALLPROC_HSIZE which keeps the
1119 * PID at the same pid_doms[] index as well as the same hash index.
1121 n = ALLPROC_HASH(base);
1123 lwkt_gettoken(&prg->proc_token);
1126 LIST_FOREACH(ps, &prg->allproc, p_list) {
1127 if (ps->p_pid == base) {
1128 base += ALLPROC_HSIZE;
1129 if (base >= PID_MAX) {
1130 lwkt_reltoken(&prg->proc_token);
1137 LIST_FOREACH(pg, &prg->allpgrp, pg_list) {
1138 if (pg->pg_id == base) {
1139 base += ALLPROC_HSIZE;
1140 if (base >= PID_MAX) {
1141 lwkt_reltoken(&prg->proc_token);
1148 LIST_FOREACH(sess, &prg->allsess, s_list) {
1149 if (sess->s_sid == base) {
1150 base += ALLPROC_HSIZE;
1151 if (base >= PID_MAX) {
1152 lwkt_reltoken(&prg->proc_token);
1161 * Assign the pid and insert the process.
1164 LIST_INSERT_HEAD(&prg->allproc, p, p_list);
1165 lwkt_reltoken(&prg->proc_token);
1169 * Called from exit1 to place the process into a zombie state.
1170 * The process is removed from the pid hash and p_stat is set
1171 * to SZOMB. Normal pfind[n]() calls will not find it any more.
1173 * Caller must hold p->p_token. We are required to wait until p_lock
1174 * becomes zero before we can manipulate the list, allowing allproc
1175 * scans to guarantee consistency during a list scan.
1178 proc_move_allproc_zombie(struct proc *p)
1183 n = ALLPROC_HASH(p->p_pid);
1185 PSTALL(p, "reap1", 0);
1186 lwkt_gettoken(&prg->proc_token);
1188 PSTALL(p, "reap1a", 0);
1191 lwkt_reltoken(&prg->proc_token);
1192 dsched_exit_proc(p);
1196 * This routine is called from kern_wait() and will remove the process
1197 * from the zombie list and the sibling list. This routine will block
1198 * if someone has a lock on the proces (p_lock).
1200 * Caller must hold p->p_token. We are required to wait until p_lock
1201 * becomes one before we can manipulate the list, allowing allproc
1202 * scans to guarantee consistency during a list scan.
1204 * Assumes caller has one ref.
1207 proc_remove_zombie(struct proc *p)
1212 n = ALLPROC_HASH(p->p_pid);
1215 PSTALL(p, "reap2", 1);
1216 lwkt_gettoken(&prg->proc_token);
1217 PSTALL(p, "reap2a", 1);
1218 LIST_REMOVE(p, p_list); /* from remove master list */
1219 LIST_REMOVE(p, p_sibling); /* and from sibling list */
1222 if (pid_doms[p->p_pid % PIDSEL_DOMAINS] != (uint8_t)time_second)
1223 pid_doms[p->p_pid % PIDSEL_DOMAINS] = (uint8_t)time_second;
1224 lwkt_reltoken(&prg->proc_token);
1228 * Handle various requirements prior to returning to usermode. Called from
1229 * platform trap and system call code.
1232 lwpuserret(struct lwp *lp)
1234 struct proc *p = lp->lwp_proc;
1236 if (lp->lwp_mpflags & LWP_MP_VNLRU) {
1237 atomic_clear_int(&lp->lwp_mpflags, LWP_MP_VNLRU);
1240 if (lp->lwp_mpflags & LWP_MP_WEXIT) {
1241 lwkt_gettoken(&p->p_token);
1243 lwkt_reltoken(&p->p_token); /* NOT REACHED */
1248 * Kernel threads run from user processes can also accumulate deferred
1249 * actions which need to be acted upon. Callers include:
1251 * nfsd - Can allocate lots of vnodes
1254 lwpkthreaddeferred(void)
1256 struct lwp *lp = curthread->td_lwp;
1259 if (lp->lwp_mpflags & LWP_MP_VNLRU) {
1260 atomic_clear_int(&lp->lwp_mpflags, LWP_MP_VNLRU);
1267 proc_usermap(struct proc *p, int invfork)
1269 struct sys_upmap *upmap;
1271 lwkt_gettoken(&p->p_token);
1272 upmap = kmalloc(roundup2(sizeof(*upmap), PAGE_SIZE), M_UPMAP,
1274 if (p->p_upmap == NULL && (p->p_flags & P_POSTEXIT) == 0) {
1275 upmap->header[0].type = UKPTYPE_VERSION;
1276 upmap->header[0].offset = offsetof(struct sys_upmap, version);
1277 upmap->header[1].type = UPTYPE_RUNTICKS;
1278 upmap->header[1].offset = offsetof(struct sys_upmap, runticks);
1279 upmap->header[2].type = UPTYPE_FORKID;
1280 upmap->header[2].offset = offsetof(struct sys_upmap, forkid);
1281 upmap->header[3].type = UPTYPE_PID;
1282 upmap->header[3].offset = offsetof(struct sys_upmap, pid);
1283 upmap->header[4].type = UPTYPE_PROC_TITLE;
1284 upmap->header[4].offset = offsetof(struct sys_upmap,proc_title);
1285 upmap->header[5].type = UPTYPE_INVFORK;
1286 upmap->header[5].offset = offsetof(struct sys_upmap, invfork);
1288 upmap->version = UPMAP_VERSION;
1289 upmap->pid = p->p_pid;
1290 upmap->forkid = p->p_forkid;
1291 upmap->invfork = invfork;
1294 kfree(upmap, M_UPMAP);
1296 lwkt_reltoken(&p->p_token);
1300 proc_userunmap(struct proc *p)
1302 struct sys_upmap *upmap;
1304 lwkt_gettoken(&p->p_token);
1305 if ((upmap = p->p_upmap) != NULL) {
1307 kfree(upmap, M_UPMAP);
1309 lwkt_reltoken(&p->p_token);
1313 * Called when the per-thread user/kernel shared page needs to be
1314 * allocated. The function refuses to allocate the page if the
1315 * thread is exiting to avoid races against lwp_userunmap().
1318 lwp_usermap(struct lwp *lp, int invfork)
1320 struct sys_lpmap *lpmap;
1322 lwkt_gettoken(&lp->lwp_token);
1324 lpmap = kmalloc(roundup2(sizeof(*lpmap), PAGE_SIZE), M_UPMAP,
1326 if (lp->lwp_lpmap == NULL && (lp->lwp_mpflags & LWP_MP_WEXIT) == 0) {
1327 lpmap->header[0].type = UKPTYPE_VERSION;
1328 lpmap->header[0].offset = offsetof(struct sys_lpmap, version);
1329 lpmap->header[1].type = LPTYPE_BLOCKALLSIGS;
1330 lpmap->header[1].offset = offsetof(struct sys_lpmap,
1332 lpmap->header[2].type = LPTYPE_THREAD_TITLE;
1333 lpmap->header[2].offset = offsetof(struct sys_lpmap,
1335 lpmap->header[3].type = LPTYPE_THREAD_TID;
1336 lpmap->header[3].offset = offsetof(struct sys_lpmap, tid);
1338 lpmap->version = LPMAP_VERSION;
1339 lpmap->tid = lp->lwp_tid;
1340 lp->lwp_lpmap = lpmap;
1342 kfree(lpmap, M_UPMAP);
1344 lwkt_reltoken(&lp->lwp_token);
1348 * Called when a LWP (but not necessarily the whole process) exits.
1349 * Called when a process execs (after all other threads have been killed).
1351 * lwp-specific mappings must be removed. If userland didn't do it, then
1352 * we have to. Otherwise we could end-up disclosing kernel memory due to
1353 * the ad-hoc pmap mapping.
1356 lwp_userunmap(struct lwp *lp)
1358 struct sys_lpmap *lpmap;
1360 struct vm_map_backing *ba;
1361 struct vm_map_backing copy;
1363 lwkt_gettoken(&lp->lwp_token);
1364 map = &lp->lwp_proc->p_vmspace->vm_map;
1365 lpmap = lp->lwp_lpmap;
1366 lp->lwp_lpmap = NULL;
1368 spin_lock(&lp->lwp_spin);
1369 while ((ba = TAILQ_FIRST(&lp->lwp_lpmap_backing_list)) != NULL) {
1371 spin_unlock(&lp->lwp_spin);
1373 lwkt_gettoken(&map->token);
1374 vm_map_remove(map, copy.start, copy.end);
1375 lwkt_reltoken(&map->token);
1377 spin_lock(&lp->lwp_spin);
1379 spin_unlock(&lp->lwp_spin);
1382 kfree(lpmap, M_UPMAP);
1383 lwkt_reltoken(&lp->lwp_token);
1387 * Scan all processes on the allproc list. The process is automatically
1388 * held for the callback. A return value of -1 terminates the loop.
1389 * Zombie procs are skipped.
1391 * The callback is made with the process held and proc_token held.
1393 * We limit the scan to the number of processes as-of the start of
1394 * the scan so as not to get caught up in an endless loop if new processes
1395 * are created more quickly than we can scan the old ones. Add a little
1396 * slop to try to catch edge cases since nprocs can race.
1401 allproc_scan(int (*callback)(struct proc *, void *), void *data, int segmented)
1403 int limit = nprocs + ncpus;
1411 int id = mycpu->gd_cpuid;
1412 ns = id * ALLPROC_HSIZE / ncpus;
1413 ne = (id + 1) * ALLPROC_HSIZE / ncpus;
1420 * prg->proc_token protects the allproc list and PHOLD() prevents the
1421 * process from being removed from the allproc list or the zombproc
1424 for (n = ns; n < ne; ++n) {
1425 procglob_t *prg = &procglob[n];
1426 if (LIST_FIRST(&prg->allproc) == NULL)
1428 lwkt_gettoken(&prg->proc_token);
1429 LIST_FOREACH(p, &prg->allproc, p_list) {
1430 if (p->p_stat == SZOMB)
1433 r = callback(p, data);
1440 lwkt_reltoken(&prg->proc_token);
1443 * Check if asked to stop early
1451 * Scan all lwps of processes on the allproc list. The lwp is automatically
1452 * held for the callback. A return value of -1 terminates the loop.
1454 * The callback is made with the proces and lwp both held, and proc_token held.
1459 alllwp_scan(int (*callback)(struct lwp *, void *), void *data, int segmented)
1469 int id = mycpu->gd_cpuid;
1470 ns = id * ALLPROC_HSIZE / ncpus;
1471 ne = (id + 1) * ALLPROC_HSIZE / ncpus;
1477 for (n = ns; n < ne; ++n) {
1478 procglob_t *prg = &procglob[n];
1480 if (LIST_FIRST(&prg->allproc) == NULL)
1482 lwkt_gettoken(&prg->proc_token);
1483 LIST_FOREACH(p, &prg->allproc, p_list) {
1484 if (p->p_stat == SZOMB)
1487 lwkt_gettoken(&p->p_token);
1488 FOREACH_LWP_IN_PROC(lp, p) {
1490 r = callback(lp, data);
1493 lwkt_reltoken(&p->p_token);
1498 lwkt_reltoken(&prg->proc_token);
1501 * Asked to exit early
1509 * Scan all processes on the zombproc list. The process is automatically
1510 * held for the callback. A return value of -1 terminates the loop.
1513 * The callback is made with the proces held and proc_token held.
1516 zombproc_scan(int (*callback)(struct proc *, void *), void *data)
1523 * prg->proc_token protects the allproc list and PHOLD() prevents the
1524 * process from being removed from the allproc list or the zombproc
1527 for (n = 0; n < ALLPROC_HSIZE; ++n) {
1528 procglob_t *prg = &procglob[n];
1530 if (LIST_FIRST(&prg->allproc) == NULL)
1532 lwkt_gettoken(&prg->proc_token);
1533 LIST_FOREACH(p, &prg->allproc, p_list) {
1534 if (p->p_stat != SZOMB)
1537 r = callback(p, data);
1542 lwkt_reltoken(&prg->proc_token);
1545 * Check if asked to stop early
1552 #include "opt_ddb.h"
1554 #include <ddb/ddb.h>
1559 DB_SHOW_COMMAND(pgrpdump, pgrpdump)
1566 for (i = 0; i < ALLPROC_HSIZE; ++i) {
1569 if (LIST_EMPTY(&prg->allpgrp))
1571 kprintf("\tindx %d\n", i);
1572 LIST_FOREACH(pgrp, &prg->allpgrp, pg_list) {
1573 kprintf("\tpgrp %p, pgid %ld, sess %p, "
1574 "sesscnt %d, mem %p\n",
1575 (void *)pgrp, (long)pgrp->pg_id,
1576 (void *)pgrp->pg_session,
1577 pgrp->pg_session->s_count,
1578 (void *)LIST_FIRST(&pgrp->pg_members));
1579 LIST_FOREACH(p, &pgrp->pg_members, p_pglist) {
1580 kprintf("\t\tpid %ld addr %p pgrp %p\n",
1581 (long)p->p_pid, (void *)p,
1590 * The caller must hold proc_token.
1593 sysctl_out_proc(struct proc *p, struct sysctl_req *req, int flags)
1595 struct kinfo_proc ki;
1597 int skp = 0, had_output = 0;
1600 bzero(&ki, sizeof(ki));
1601 lwkt_gettoken_shared(&p->p_token);
1602 fill_kinfo_proc(p, &ki);
1603 if ((flags & KERN_PROC_FLAG_LWP) == 0)
1606 FOREACH_LWP_IN_PROC(lp, p) {
1608 fill_kinfo_lwp(lp, &ki.kp_lwp);
1611 error = SYSCTL_OUT(req, &ki, sizeof(ki));
1612 bzero(&ki.kp_lwp, sizeof(ki.kp_lwp));
1618 lwkt_reltoken(&p->p_token);
1621 * If aggregating threads, set the tid field to -1.
1624 ki.kp_lwp.kl_tid = -1;
1627 * We need to output at least the proc, even if there is no lwp.
1628 * If skp is non-zero we aggregated the lwps and need to output
1631 if (had_output == 0 || skp) {
1632 error = SYSCTL_OUT(req, &ki, sizeof(ki));
1638 * The caller must hold proc_token.
1641 sysctl_out_proc_kthread(struct thread *td, struct sysctl_req *req)
1643 struct kinfo_proc ki;
1646 fill_kinfo_proc_kthread(td, &ki);
1647 error = SYSCTL_OUT(req, &ki, sizeof(ki));
1657 sysctl_kern_proc(SYSCTL_HANDLER_ARGS)
1659 int *name = (int *)arg1;
1660 int oid = oidp->oid_number;
1661 u_int namelen = arg2;
1664 struct thread *marker;
1669 struct ucred *cr1 = curproc->p_ucred;
1670 struct ucred *crcache = NULL;
1672 flags = oid & KERN_PROC_FLAGMASK;
1673 oid &= ~KERN_PROC_FLAGMASK;
1675 if ((oid == KERN_PROC_ALL && namelen != 0) ||
1676 (oid != KERN_PROC_ALL && namelen != 1)) {
1681 * proc_token protects the allproc list and PHOLD() prevents the
1682 * process from being removed from the allproc list or the zombproc
1685 if (oid == KERN_PROC_PID) {
1686 p = pfind((pid_t)name[0]);
1688 crcache = pcredcache(crcache, p);
1689 if (PRISON_CHECK(cr1, crcache))
1690 error = sysctl_out_proc(p, req, flags);
1698 /* overestimate by 5 procs */
1699 error = SYSCTL_OUT(req, 0, sizeof (struct kinfo_proc) * 5);
1704 for (n = 0; n < ALLPROC_HSIZE; ++n) {
1705 procglob_t *prg = &procglob[n];
1707 if (LIST_EMPTY(&prg->allproc))
1709 lwkt_gettoken_shared(&prg->proc_token);
1710 LIST_FOREACH(p, &prg->allproc, p_list) {
1712 * Show a user only their processes.
1714 if (ps_showallprocs == 0) {
1715 crcache = pcredcache(crcache, p);
1716 if (crcache == NULL ||
1717 p_trespass(cr1, crcache)) {
1723 * Skip embryonic processes.
1725 if (p->p_stat == SIDL)
1728 * TODO - make more efficient (see notes below).
1732 case KERN_PROC_PGRP:
1733 /* could do this by traversing pgrp */
1734 if (p->p_pgrp == NULL ||
1735 p->p_pgrp->pg_id != (pid_t)name[0])
1740 if ((p->p_flags & P_CONTROLT) == 0 ||
1741 p->p_session == NULL ||
1742 p->p_session->s_ttyp == NULL ||
1743 devid_from_dev(p->p_session->s_ttyp->t_dev) !=
1749 crcache = pcredcache(crcache, p);
1750 if (crcache == NULL ||
1751 crcache->cr_uid != (uid_t)name[0]) {
1756 case KERN_PROC_RUID:
1757 crcache = pcredcache(crcache, p);
1758 if (crcache == NULL ||
1759 crcache->cr_ruid != (uid_t)name[0]) {
1765 crcache = pcredcache(crcache, p);
1766 if (!PRISON_CHECK(cr1, crcache))
1769 error = sysctl_out_proc(p, req, flags);
1772 lwkt_reltoken(&prg->proc_token);
1776 lwkt_reltoken(&prg->proc_token);
1780 * Iterate over all active cpus and scan their thread list. Start
1781 * with the next logical cpu and end with our original cpu. We
1782 * migrate our own thread to each target cpu in order to safely scan
1783 * its thread list. In the last loop we migrate back to our original
1786 origcpu = mycpu->gd_cpuid;
1787 if (!ps_showallthreads || jailed(cr1))
1790 marker = kmalloc(sizeof(struct thread), M_TEMP, M_WAITOK|M_ZERO);
1791 marker->td_flags = TDF_MARKER;
1794 for (n = 1; n <= ncpus; ++n) {
1798 nid = (origcpu + n) % ncpus;
1799 if (CPUMASK_TESTBIT(smp_active_mask, nid) == 0)
1801 rgd = globaldata_find(nid);
1802 lwkt_setcpu_self(rgd);
1805 TAILQ_INSERT_TAIL(&rgd->gd_tdallq, marker, td_allq);
1807 while ((td = TAILQ_PREV(marker, lwkt_queue, td_allq)) != NULL) {
1808 TAILQ_REMOVE(&rgd->gd_tdallq, marker, td_allq);
1809 TAILQ_INSERT_BEFORE(td, marker, td_allq);
1810 if (td->td_flags & TDF_MARKER)
1819 case KERN_PROC_PGRP:
1822 case KERN_PROC_RUID:
1825 error = sysctl_out_proc_kthread(td, req);
1833 TAILQ_REMOVE(&rgd->gd_tdallq, marker, td_allq);
1841 * Userland scheduler expects us to return on the same cpu we
1844 if (mycpu->gd_cpuid != origcpu)
1845 lwkt_setcpu_self(globaldata_find(origcpu));
1847 kfree(marker, M_TEMP);
1856 * This sysctl allows a process to retrieve the argument list or process
1857 * title for another process without groping around in the address space
1858 * of the other process. It also allow a process to set its own "process
1859 * title to a string of its own choice.
1864 sysctl_kern_proc_args(SYSCTL_HANDLER_ARGS)
1866 int *name = (int*) arg1;
1867 u_int namelen = arg2;
1876 struct ucred *cr1 = curproc->p_ucred;
1878 if (namelen != 1 && namelen != 2)
1882 p = pfind((pid_t)name[0]);
1885 lwkt_gettoken(&p->p_token);
1888 lp = lwpfind(p, (lwpid_t)name[1]);
1890 lwkt_gettoken(&lp->lwp_token);
1895 if ((!ps_argsopen) && p_trespass(cr1, p->p_ucred))
1898 if (req->newptr && curproc != p) {
1903 if (lp && lp->lwp_lpmap != NULL &&
1904 lp->lwp_lpmap->thread_title[0]) {
1906 * Args set via writable user thread mmap or
1909 * We must calculate the string length manually
1910 * because the user data can change at any time.
1915 base = lp->lwp_lpmap->thread_title;
1916 for (n = 0; n < LPMAP_MAXTHREADTITLE - 1; ++n) {
1920 error = SYSCTL_OUT(req, base, n);
1922 error = SYSCTL_OUT(req, "", 1);
1923 } else if (p->p_upmap != NULL && p->p_upmap->proc_title[0]) {
1925 * Args set via writable user process mmap or
1928 * We must calculate the string length manually
1929 * because the user data can change at any time.
1934 base = p->p_upmap->proc_title;
1935 for (n = 0; n < UPMAP_MAXPROCTITLE - 1; ++n) {
1939 error = SYSCTL_OUT(req, base, n);
1941 error = SYSCTL_OUT(req, "", 1);
1942 } else if ((pa = p->p_args) != NULL) {
1944 * Default/original arguments.
1946 refcount_acquire(&pa->ar_ref);
1947 error = SYSCTL_OUT(req, pa->ar_args, pa->ar_length);
1948 if (refcount_release(&pa->ar_ref))
1952 if (req->newptr == NULL)
1955 if (req->newlen + sizeof(struct pargs) > ps_arg_cache_limit) {
1960 * Get the new process or thread title from userland
1962 pa = kmalloc(sizeof(struct pargs) + req->newlen,
1964 refcount_init(&pa->ar_ref, 1);
1965 pa->ar_length = req->newlen;
1966 error = SYSCTL_IN(req, pa->ar_args, req->newlen);
1974 * Update thread title
1976 if (lp->lwp_lpmap == NULL)
1977 lwp_usermap(lp, -1);
1978 if (lp->lwp_lpmap) {
1980 if (n >= sizeof(lp->lwp_lpmap->thread_title))
1981 n = sizeof(lp->lwp_lpmap->thread_title) - 1;
1982 lp->lwp_lpmap->thread_title[n] = 0;
1983 bcopy(pa->ar_args, lp->lwp_lpmap->thread_title, n);
1987 * Update process title
1989 if (p->p_upmap == NULL)
1990 proc_usermap(p, -1);
1993 if (n >= sizeof(lp->lwp_lpmap->thread_title))
1994 n = sizeof(lp->lwp_lpmap->thread_title) - 1;
1995 p->p_upmap->proc_title[n] = 0;
1996 bcopy(pa->ar_args, p->p_upmap->proc_title, n);
2001 * XXX delete this code, keep original args intact for
2002 * the setproctitle("") case.
2003 * Scrap p->p_args, p->p_upmap->proc_title[] overrides it.
2008 KKASSERT(opa->ar_ref > 0);
2009 if (refcount_release(&opa->ar_ref)) {
2010 kfree(opa, M_PARGS);
2020 lwkt_reltoken(&lp->lwp_token);
2024 lwkt_reltoken(&p->p_token);
2031 sysctl_kern_proc_cwd(SYSCTL_HANDLER_ARGS)
2033 int *name = (int*) arg1;
2034 u_int namelen = arg2;
2037 char *fullpath, *freepath;
2038 struct ucred *cr1 = curproc->p_ucred;
2043 p = pfind((pid_t)name[0]);
2046 lwkt_gettoken_shared(&p->p_token);
2049 * If we are not allowed to see other args, we certainly shouldn't
2050 * get the cwd either. Also check the usual trespassing.
2052 if ((!ps_argsopen) && p_trespass(cr1, p->p_ucred))
2055 if (req->oldptr && p->p_fd != NULL && p->p_fd->fd_ncdir.ncp) {
2056 struct nchandle nch;
2058 cache_copy(&p->p_fd->fd_ncdir, &nch);
2059 error = cache_fullpath(p, &nch, NULL,
2060 &fullpath, &freepath, 0);
2064 error = SYSCTL_OUT(req, fullpath, strlen(fullpath) + 1);
2065 kfree(freepath, M_TEMP);
2070 lwkt_reltoken(&p->p_token);
2077 * This sysctl allows a process to retrieve the path of the executable for
2078 * itself or another process.
2081 sysctl_kern_proc_pathname(SYSCTL_HANDLER_ARGS)
2083 pid_t *pidp = (pid_t *)arg1;
2084 unsigned int arglen = arg2;
2086 char *retbuf, *freebuf;
2088 struct nchandle nch;
2092 if (*pidp == -1) { /* -1 means this process */
2100 cache_copy(&p->p_textnch, &nch);
2101 error = cache_fullpath(p, &nch, NULL, &retbuf, &freebuf, 0);
2105 error = SYSCTL_OUT(req, retbuf, strlen(retbuf) + 1);
2106 kfree(freebuf, M_TEMP);
2115 sysctl_kern_proc_sigtramp(SYSCTL_HANDLER_ARGS)
2117 /*int *name = (int *)arg1;*/
2118 u_int namelen = arg2;
2119 struct kinfo_sigtramp kst;
2120 const struct sysentvec *sv;
2125 /* ignore pid if passed in (freebsd compatibility) */
2127 sv = curproc->p_sysent;
2128 bzero(&kst, sizeof(kst));
2129 if (sv->sv_szsigcode) {
2132 sigbase = trunc_page64((intptr_t)PS_STRINGS -
2134 sigbase -= SZSIGCODE_EXTRA_BYTES;
2136 kst.ksigtramp_start = (void *)sigbase;
2137 kst.ksigtramp_end = (void *)(sigbase + *sv->sv_szsigcode);
2139 error = SYSCTL_OUT(req, &kst, sizeof(kst));
2144 SYSCTL_NODE(_kern, KERN_PROC, proc, CTLFLAG_RD, 0, "Process table");
2146 SYSCTL_PROC(_kern_proc, KERN_PROC_ALL, all,
2147 CTLFLAG_RD | CTLTYPE_STRUCT | CTLFLAG_NOLOCK,
2148 0, 0, sysctl_kern_proc, "S,proc", "Return entire process table");
2150 SYSCTL_NODE(_kern_proc, KERN_PROC_PGRP, pgrp,
2151 CTLFLAG_RD | CTLFLAG_NOLOCK,
2152 sysctl_kern_proc, "Process table");
2154 SYSCTL_NODE(_kern_proc, KERN_PROC_TTY, tty,
2155 CTLFLAG_RD | CTLFLAG_NOLOCK,
2156 sysctl_kern_proc, "Process table");
2158 SYSCTL_NODE(_kern_proc, KERN_PROC_UID, uid,
2159 CTLFLAG_RD | CTLFLAG_NOLOCK,
2160 sysctl_kern_proc, "Process table");
2162 SYSCTL_NODE(_kern_proc, KERN_PROC_RUID, ruid,
2163 CTLFLAG_RD | CTLFLAG_NOLOCK,
2164 sysctl_kern_proc, "Process table");
2166 SYSCTL_NODE(_kern_proc, KERN_PROC_PID, pid,
2167 CTLFLAG_RD | CTLFLAG_NOLOCK,
2168 sysctl_kern_proc, "Process table");
2170 SYSCTL_NODE(_kern_proc, (KERN_PROC_ALL | KERN_PROC_FLAG_LWP), all_lwp,
2171 CTLFLAG_RD | CTLFLAG_NOLOCK,
2172 sysctl_kern_proc, "Process table");
2174 SYSCTL_NODE(_kern_proc, (KERN_PROC_PGRP | KERN_PROC_FLAG_LWP), pgrp_lwp,
2175 CTLFLAG_RD | CTLFLAG_NOLOCK,
2176 sysctl_kern_proc, "Process table");
2178 SYSCTL_NODE(_kern_proc, (KERN_PROC_TTY | KERN_PROC_FLAG_LWP), tty_lwp,
2179 CTLFLAG_RD | CTLFLAG_NOLOCK,
2180 sysctl_kern_proc, "Process table");
2182 SYSCTL_NODE(_kern_proc, (KERN_PROC_UID | KERN_PROC_FLAG_LWP), uid_lwp,
2183 CTLFLAG_RD | CTLFLAG_NOLOCK,
2184 sysctl_kern_proc, "Process table");
2186 SYSCTL_NODE(_kern_proc, (KERN_PROC_RUID | KERN_PROC_FLAG_LWP), ruid_lwp,
2187 CTLFLAG_RD | CTLFLAG_NOLOCK,
2188 sysctl_kern_proc, "Process table");
2190 SYSCTL_NODE(_kern_proc, (KERN_PROC_PID | KERN_PROC_FLAG_LWP), pid_lwp,
2191 CTLFLAG_RD | CTLFLAG_NOLOCK,
2192 sysctl_kern_proc, "Process table");
2194 SYSCTL_NODE(_kern_proc, KERN_PROC_ARGS, args,
2195 CTLFLAG_RW | CTLFLAG_ANYBODY | CTLFLAG_NOLOCK,
2196 sysctl_kern_proc_args, "Process argument list");
2198 SYSCTL_NODE(_kern_proc, KERN_PROC_CWD, cwd,
2199 CTLFLAG_RD | CTLFLAG_ANYBODY | CTLFLAG_NOLOCK,
2200 sysctl_kern_proc_cwd, "Process argument list");
2202 static SYSCTL_NODE(_kern_proc, KERN_PROC_PATHNAME, pathname,
2203 CTLFLAG_RD | CTLFLAG_NOLOCK,
2204 sysctl_kern_proc_pathname, "Process executable path");
2206 SYSCTL_PROC(_kern_proc, KERN_PROC_SIGTRAMP, sigtramp,
2207 CTLFLAG_RD | CTLTYPE_STRUCT | CTLFLAG_NOLOCK,
2208 0, 0, sysctl_kern_proc_sigtramp, "S,sigtramp",
2209 "Return sigtramp address range");