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 * 4. 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
29 * @(#)kern_proc.c 8.7 (Berkeley) 2/14/95
32 #include <sys/cdefs.h>
33 __FBSDID("$FreeBSD$");
35 #include "opt_compat.h"
37 #include "opt_kdtrace.h"
38 #include "opt_ktrace.h"
39 #include "opt_kstack_pages.h"
40 #include "opt_stack.h"
42 #include <sys/param.h>
43 #include <sys/systm.h>
46 #include <sys/kernel.h>
47 #include <sys/limits.h>
49 #include <sys/loginclass.h>
50 #include <sys/malloc.h>
52 #include <sys/mount.h>
53 #include <sys/mutex.h>
55 #include <sys/ptrace.h>
56 #include <sys/refcount.h>
57 #include <sys/resourcevar.h>
58 #include <sys/rwlock.h>
60 #include <sys/sysent.h>
61 #include <sys/sched.h>
63 #include <sys/stack.h>
65 #include <sys/sysctl.h>
66 #include <sys/filedesc.h>
68 #include <sys/signalvar.h>
73 #include <sys/vnode.h>
74 #include <sys/eventhandler.h>
81 #include <vm/vm_param.h>
82 #include <vm/vm_extern.h>
84 #include <vm/vm_map.h>
85 #include <vm/vm_object.h>
86 #include <vm/vm_page.h>
89 #ifdef COMPAT_FREEBSD32
90 #include <compat/freebsd32/freebsd32.h>
91 #include <compat/freebsd32/freebsd32_util.h>
94 SDT_PROVIDER_DEFINE(proc);
95 SDT_PROBE_DEFINE4(proc, kernel, ctor, entry, entry, "struct proc *", "int",
97 SDT_PROBE_DEFINE4(proc, kernel, ctor, return, return, "struct proc *", "int",
99 SDT_PROBE_DEFINE4(proc, kernel, dtor, entry, entry, "struct proc *", "int",
100 "void *", "struct thread *");
101 SDT_PROBE_DEFINE3(proc, kernel, dtor, return, return, "struct proc *", "int",
103 SDT_PROBE_DEFINE3(proc, kernel, init, entry, entry, "struct proc *", "int",
105 SDT_PROBE_DEFINE3(proc, kernel, init, return, return, "struct proc *", "int",
108 MALLOC_DEFINE(M_PGRP, "pgrp", "process group header");
109 MALLOC_DEFINE(M_SESSION, "session", "session header");
110 static MALLOC_DEFINE(M_PROC, "proc", "Proc structures");
111 MALLOC_DEFINE(M_SUBPROC, "subproc", "Proc sub-structures");
113 static void doenterpgrp(struct proc *, struct pgrp *);
114 static void orphanpg(struct pgrp *pg);
115 static void fill_kinfo_aggregate(struct proc *p, struct kinfo_proc *kp);
116 static void fill_kinfo_proc_only(struct proc *p, struct kinfo_proc *kp);
117 static void fill_kinfo_thread(struct thread *td, struct kinfo_proc *kp,
119 static void pgadjustjobc(struct pgrp *pgrp, int entering);
120 static void pgdelete(struct pgrp *);
121 static int proc_ctor(void *mem, int size, void *arg, int flags);
122 static void proc_dtor(void *mem, int size, void *arg);
123 static int proc_init(void *mem, int size, int flags);
124 static void proc_fini(void *mem, int size);
125 static void pargs_free(struct pargs *pa);
126 static struct proc *zpfind_locked(pid_t pid);
129 * Other process lists
131 struct pidhashhead *pidhashtbl;
133 struct pgrphashhead *pgrphashtbl;
135 struct proclist allproc;
136 struct proclist zombproc;
137 struct sx allproc_lock;
138 struct sx proctree_lock;
139 struct mtx ppeers_lock;
140 uma_zone_t proc_zone;
142 int kstack_pages = KSTACK_PAGES;
143 SYSCTL_INT(_kern, OID_AUTO, kstack_pages, CTLFLAG_RD, &kstack_pages, 0,
144 "Kernel stack size in pages");
146 CTASSERT(sizeof(struct kinfo_proc) == KINFO_PROC_SIZE);
147 #ifdef COMPAT_FREEBSD32
148 CTASSERT(sizeof(struct kinfo_proc32) == KINFO_PROC32_SIZE);
152 * Initialize global process hashing structures.
158 sx_init(&allproc_lock, "allproc");
159 sx_init(&proctree_lock, "proctree");
160 mtx_init(&ppeers_lock, "p_peers", NULL, MTX_DEF);
162 LIST_INIT(&zombproc);
163 pidhashtbl = hashinit(maxproc / 4, M_PROC, &pidhash);
164 pgrphashtbl = hashinit(maxproc / 4, M_PROC, &pgrphash);
165 proc_zone = uma_zcreate("PROC", sched_sizeof_proc(),
166 proc_ctor, proc_dtor, proc_init, proc_fini,
167 UMA_ALIGN_PTR, UMA_ZONE_NOFREE);
172 * Prepare a proc for use.
175 proc_ctor(void *mem, int size, void *arg, int flags)
179 p = (struct proc *)mem;
180 SDT_PROBE(proc, kernel, ctor , entry, p, size, arg, flags, 0);
181 EVENTHANDLER_INVOKE(process_ctor, p);
182 SDT_PROBE(proc, kernel, ctor , return, p, size, arg, flags, 0);
187 * Reclaim a proc after use.
190 proc_dtor(void *mem, int size, void *arg)
195 /* INVARIANTS checks go here */
196 p = (struct proc *)mem;
197 td = FIRST_THREAD_IN_PROC(p);
198 SDT_PROBE(proc, kernel, dtor, entry, p, size, arg, td, 0);
201 KASSERT((p->p_numthreads == 1),
202 ("bad number of threads in exiting process"));
203 KASSERT(STAILQ_EMPTY(&p->p_ktr), ("proc_dtor: non-empty p_ktr"));
205 /* Free all OSD associated to this thread. */
208 EVENTHANDLER_INVOKE(process_dtor, p);
209 if (p->p_ksi != NULL)
210 KASSERT(! KSI_ONQ(p->p_ksi), ("SIGCHLD queue"));
211 SDT_PROBE(proc, kernel, dtor, return, p, size, arg, 0, 0);
215 * Initialize type-stable parts of a proc (when newly created).
218 proc_init(void *mem, int size, int flags)
222 p = (struct proc *)mem;
223 SDT_PROBE(proc, kernel, init, entry, p, size, flags, 0, 0);
224 p->p_sched = (struct p_sched *)&p[1];
225 bzero(&p->p_mtx, sizeof(struct mtx));
226 mtx_init(&p->p_mtx, "process lock", NULL, MTX_DEF | MTX_DUPOK);
227 mtx_init(&p->p_slock, "process slock", NULL, MTX_SPIN | MTX_RECURSE);
228 cv_init(&p->p_pwait, "ppwait");
229 cv_init(&p->p_dbgwait, "dbgwait");
230 TAILQ_INIT(&p->p_threads); /* all threads in proc */
231 EVENTHANDLER_INVOKE(process_init, p);
232 p->p_stats = pstats_alloc();
233 SDT_PROBE(proc, kernel, init, return, p, size, flags, 0, 0);
238 * UMA should ensure that this function is never called.
239 * Freeing a proc structure would violate type stability.
242 proc_fini(void *mem, int size)
247 p = (struct proc *)mem;
248 EVENTHANDLER_INVOKE(process_fini, p);
249 pstats_free(p->p_stats);
250 thread_free(FIRST_THREAD_IN_PROC(p));
251 mtx_destroy(&p->p_mtx);
252 if (p->p_ksi != NULL)
253 ksiginfo_free(p->p_ksi);
255 panic("proc reclaimed");
260 * Is p an inferior of the current process?
264 register struct proc *p;
267 sx_assert(&proctree_lock, SX_LOCKED);
268 for (; p != curproc; p = p->p_pptr)
275 pfind_locked(pid_t pid)
279 sx_assert(&allproc_lock, SX_LOCKED);
280 LIST_FOREACH(p, PIDHASH(pid), p_hash) {
281 if (p->p_pid == pid) {
283 if (p->p_state == PRS_NEW) {
294 * Locate a process by number; return only "live" processes -- i.e., neither
295 * zombies nor newly born but incompletely initialized processes. By not
296 * returning processes in the PRS_NEW state, we allow callers to avoid
297 * testing for that condition to avoid dereferencing p_ucred, et al.
304 sx_slock(&allproc_lock);
305 p = pfind_locked(pid);
306 sx_sunlock(&allproc_lock);
311 pfind_tid_locked(pid_t tid)
316 sx_assert(&allproc_lock, SX_LOCKED);
317 FOREACH_PROC_IN_SYSTEM(p) {
319 if (p->p_state == PRS_NEW) {
323 FOREACH_THREAD_IN_PROC(p, td) {
324 if (td->td_tid == tid)
334 * Locate a process group by number.
335 * The caller must hold proctree_lock.
341 register struct pgrp *pgrp;
343 sx_assert(&proctree_lock, SX_LOCKED);
345 LIST_FOREACH(pgrp, PGRPHASH(pgid), pg_hash) {
346 if (pgrp->pg_id == pgid) {
355 * Locate process and do additional manipulations, depending on flags.
358 pget(pid_t pid, int flags, struct proc **pp)
363 sx_slock(&allproc_lock);
364 if (pid <= PID_MAX) {
365 p = pfind_locked(pid);
366 if (p == NULL && (flags & PGET_NOTWEXIT) == 0)
367 p = zpfind_locked(pid);
368 } else if ((flags & PGET_NOTID) == 0) {
369 p = pfind_tid_locked(pid);
373 sx_sunlock(&allproc_lock);
376 if ((flags & PGET_CANSEE) != 0) {
377 error = p_cansee(curthread, p);
381 if ((flags & PGET_CANDEBUG) != 0) {
382 error = p_candebug(curthread, p);
386 if ((flags & PGET_ISCURRENT) != 0 && curproc != p) {
390 if ((flags & PGET_NOTWEXIT) != 0 && (p->p_flag & P_WEXIT) != 0) {
394 if ((flags & PGET_NOTINEXEC) != 0 && (p->p_flag & P_INEXEC) != 0) {
396 * XXXRW: Not clear ESRCH is the right error during proc
402 if ((flags & PGET_HOLD) != 0) {
414 * Create a new process group.
415 * pgid must be equal to the pid of p.
416 * Begin a new session if required.
419 enterpgrp(p, pgid, pgrp, sess)
420 register struct proc *p;
423 struct session *sess;
426 sx_assert(&proctree_lock, SX_XLOCKED);
428 KASSERT(pgrp != NULL, ("enterpgrp: pgrp == NULL"));
429 KASSERT(p->p_pid == pgid,
430 ("enterpgrp: new pgrp and pid != pgid"));
431 KASSERT(pgfind(pgid) == NULL,
432 ("enterpgrp: pgrp with pgid exists"));
433 KASSERT(!SESS_LEADER(p),
434 ("enterpgrp: session leader attempted setpgrp"));
436 mtx_init(&pgrp->pg_mtx, "process group", NULL, MTX_DEF | MTX_DUPOK);
442 mtx_init(&sess->s_mtx, "session", NULL, MTX_DEF);
444 p->p_flag &= ~P_CONTROLT;
448 sess->s_sid = p->p_pid;
449 refcount_init(&sess->s_count, 1);
450 sess->s_ttyvp = NULL;
451 sess->s_ttydp = NULL;
453 bcopy(p->p_session->s_login, sess->s_login,
454 sizeof(sess->s_login));
455 pgrp->pg_session = sess;
456 KASSERT(p == curproc,
457 ("enterpgrp: mksession and p != curproc"));
459 pgrp->pg_session = p->p_session;
460 sess_hold(pgrp->pg_session);
464 LIST_INIT(&pgrp->pg_members);
467 * As we have an exclusive lock of proctree_lock,
468 * this should not deadlock.
470 LIST_INSERT_HEAD(PGRPHASH(pgid), pgrp, pg_hash);
472 SLIST_INIT(&pgrp->pg_sigiolst);
475 doenterpgrp(p, pgrp);
481 * Move p to an existing process group
484 enterthispgrp(p, pgrp)
485 register struct proc *p;
489 sx_assert(&proctree_lock, SX_XLOCKED);
490 PROC_LOCK_ASSERT(p, MA_NOTOWNED);
491 PGRP_LOCK_ASSERT(pgrp, MA_NOTOWNED);
492 PGRP_LOCK_ASSERT(p->p_pgrp, MA_NOTOWNED);
493 SESS_LOCK_ASSERT(p->p_session, MA_NOTOWNED);
494 KASSERT(pgrp->pg_session == p->p_session,
495 ("%s: pgrp's session %p, p->p_session %p.\n",
499 KASSERT(pgrp != p->p_pgrp,
500 ("%s: p belongs to pgrp.", __func__));
502 doenterpgrp(p, pgrp);
508 * Move p to a process group
515 struct pgrp *savepgrp;
517 sx_assert(&proctree_lock, SX_XLOCKED);
518 PROC_LOCK_ASSERT(p, MA_NOTOWNED);
519 PGRP_LOCK_ASSERT(pgrp, MA_NOTOWNED);
520 PGRP_LOCK_ASSERT(p->p_pgrp, MA_NOTOWNED);
521 SESS_LOCK_ASSERT(p->p_session, MA_NOTOWNED);
523 savepgrp = p->p_pgrp;
526 * Adjust eligibility of affected pgrps to participate in job control.
527 * Increment eligibility counts before decrementing, otherwise we
528 * could reach 0 spuriously during the first call.
531 fixjobc(p, p->p_pgrp, 0);
536 LIST_REMOVE(p, p_pglist);
539 LIST_INSERT_HEAD(&pgrp->pg_members, p, p_pglist);
540 PGRP_UNLOCK(savepgrp);
542 if (LIST_EMPTY(&savepgrp->pg_members))
547 * remove process from process group
551 register struct proc *p;
553 struct pgrp *savepgrp;
555 sx_assert(&proctree_lock, SX_XLOCKED);
556 savepgrp = p->p_pgrp;
559 LIST_REMOVE(p, p_pglist);
562 PGRP_UNLOCK(savepgrp);
563 if (LIST_EMPTY(&savepgrp->pg_members))
569 * delete a process group
573 register struct pgrp *pgrp;
575 struct session *savesess;
578 sx_assert(&proctree_lock, SX_XLOCKED);
579 PGRP_LOCK_ASSERT(pgrp, MA_NOTOWNED);
580 SESS_LOCK_ASSERT(pgrp->pg_session, MA_NOTOWNED);
583 * Reset any sigio structures pointing to us as a result of
584 * F_SETOWN with our pgid.
586 funsetownlst(&pgrp->pg_sigiolst);
589 tp = pgrp->pg_session->s_ttyp;
590 LIST_REMOVE(pgrp, pg_hash);
591 savesess = pgrp->pg_session;
594 /* Remove the reference to the pgrp before deallocating it. */
597 tty_rel_pgrp(tp, pgrp);
600 mtx_destroy(&pgrp->pg_mtx);
602 sess_release(savesess);
606 pgadjustjobc(pgrp, entering)
616 if (pgrp->pg_jobc == 0)
623 * Adjust pgrp jobc counters when specified process changes process group.
624 * We count the number of processes in each process group that "qualify"
625 * the group for terminal job control (those with a parent in a different
626 * process group of the same session). If that count reaches zero, the
627 * process group becomes orphaned. Check both the specified process'
628 * process group and that of its children.
629 * entering == 0 => p is leaving specified group.
630 * entering == 1 => p is entering specified group.
633 fixjobc(p, pgrp, entering)
634 register struct proc *p;
635 register struct pgrp *pgrp;
638 register struct pgrp *hispgrp;
639 register struct session *mysession;
641 sx_assert(&proctree_lock, SX_LOCKED);
642 PROC_LOCK_ASSERT(p, MA_NOTOWNED);
643 PGRP_LOCK_ASSERT(pgrp, MA_NOTOWNED);
644 SESS_LOCK_ASSERT(pgrp->pg_session, MA_NOTOWNED);
647 * Check p's parent to see whether p qualifies its own process
648 * group; if so, adjust count for p's process group.
650 mysession = pgrp->pg_session;
651 if ((hispgrp = p->p_pptr->p_pgrp) != pgrp &&
652 hispgrp->pg_session == mysession)
653 pgadjustjobc(pgrp, entering);
656 * Check this process' children to see whether they qualify
657 * their process groups; if so, adjust counts for children's
660 LIST_FOREACH(p, &p->p_children, p_sibling) {
662 if (hispgrp == pgrp ||
663 hispgrp->pg_session != mysession)
666 if (p->p_state == PRS_ZOMBIE) {
671 pgadjustjobc(hispgrp, entering);
676 * A process group has become orphaned;
677 * if there are any stopped processes in the group,
678 * hang-up all process in that group.
684 register struct proc *p;
686 PGRP_LOCK_ASSERT(pg, MA_OWNED);
688 LIST_FOREACH(p, &pg->pg_members, p_pglist) {
690 if (P_SHOULDSTOP(p)) {
692 LIST_FOREACH(p, &pg->pg_members, p_pglist) {
694 kern_psignal(p, SIGHUP);
695 kern_psignal(p, SIGCONT);
705 sess_hold(struct session *s)
708 refcount_acquire(&s->s_count);
712 sess_release(struct session *s)
715 if (refcount_release(&s->s_count)) {
716 if (s->s_ttyp != NULL) {
718 tty_rel_sess(s->s_ttyp, s);
720 mtx_destroy(&s->s_mtx);
727 DB_SHOW_COMMAND(pgrpdump, pgrpdump)
729 register struct pgrp *pgrp;
730 register struct proc *p;
733 for (i = 0; i <= pgrphash; i++) {
734 if (!LIST_EMPTY(&pgrphashtbl[i])) {
735 printf("\tindx %d\n", i);
736 LIST_FOREACH(pgrp, &pgrphashtbl[i], pg_hash) {
738 "\tpgrp %p, pgid %ld, sess %p, sesscnt %d, mem %p\n",
739 (void *)pgrp, (long)pgrp->pg_id,
740 (void *)pgrp->pg_session,
741 pgrp->pg_session->s_count,
742 (void *)LIST_FIRST(&pgrp->pg_members));
743 LIST_FOREACH(p, &pgrp->pg_members, p_pglist) {
744 printf("\t\tpid %ld addr %p pgrp %p\n",
745 (long)p->p_pid, (void *)p,
755 * Calculate the kinfo_proc members which contain process-wide
757 * Must be called with the target process locked.
760 fill_kinfo_aggregate(struct proc *p, struct kinfo_proc *kp)
764 PROC_LOCK_ASSERT(p, MA_OWNED);
768 FOREACH_THREAD_IN_PROC(p, td) {
770 kp->ki_pctcpu += sched_pctcpu(td);
771 kp->ki_estcpu += td->td_estcpu;
777 * Clear kinfo_proc and fill in any information that is common
778 * to all threads in the process.
779 * Must be called with the target process locked.
782 fill_kinfo_proc_only(struct proc *p, struct kinfo_proc *kp)
790 PROC_LOCK_ASSERT(p, MA_OWNED);
791 bzero(kp, sizeof(*kp));
793 kp->ki_structsize = sizeof(*kp);
795 kp->ki_addr =/* p->p_addr; */0; /* XXX */
796 kp->ki_args = p->p_args;
797 kp->ki_textvp = p->p_textvp;
799 kp->ki_tracep = p->p_tracevp;
800 kp->ki_traceflag = p->p_traceflag;
803 kp->ki_vmspace = p->p_vmspace;
804 kp->ki_flag = p->p_flag;
807 kp->ki_uid = cred->cr_uid;
808 kp->ki_ruid = cred->cr_ruid;
809 kp->ki_svuid = cred->cr_svuid;
811 if (cred->cr_flags & CRED_FLAG_CAPMODE)
812 kp->ki_cr_flags |= KI_CRF_CAPABILITY_MODE;
813 /* XXX bde doesn't like KI_NGROUPS */
814 if (cred->cr_ngroups > KI_NGROUPS) {
815 kp->ki_ngroups = KI_NGROUPS;
816 kp->ki_cr_flags |= KI_CRF_GRP_OVERFLOW;
818 kp->ki_ngroups = cred->cr_ngroups;
819 bcopy(cred->cr_groups, kp->ki_groups,
820 kp->ki_ngroups * sizeof(gid_t));
821 kp->ki_rgid = cred->cr_rgid;
822 kp->ki_svgid = cred->cr_svgid;
823 /* If jailed(cred), emulate the old P_JAILED flag. */
825 kp->ki_flag |= P_JAILED;
826 /* If inside the jail, use 0 as a jail ID. */
827 if (cred->cr_prison != curthread->td_ucred->cr_prison)
828 kp->ki_jid = cred->cr_prison->pr_id;
830 strlcpy(kp->ki_loginclass, cred->cr_loginclass->lc_name,
831 sizeof(kp->ki_loginclass));
835 mtx_lock(&ps->ps_mtx);
836 kp->ki_sigignore = ps->ps_sigignore;
837 kp->ki_sigcatch = ps->ps_sigcatch;
838 mtx_unlock(&ps->ps_mtx);
840 if (p->p_state != PRS_NEW &&
841 p->p_state != PRS_ZOMBIE &&
842 p->p_vmspace != NULL) {
843 struct vmspace *vm = p->p_vmspace;
845 kp->ki_size = vm->vm_map.size;
846 kp->ki_rssize = vmspace_resident_count(vm); /*XXX*/
847 FOREACH_THREAD_IN_PROC(p, td0) {
848 if (!TD_IS_SWAPPED(td0))
849 kp->ki_rssize += td0->td_kstack_pages;
851 kp->ki_swrss = vm->vm_swrss;
852 kp->ki_tsize = vm->vm_tsize;
853 kp->ki_dsize = vm->vm_dsize;
854 kp->ki_ssize = vm->vm_ssize;
855 } else if (p->p_state == PRS_ZOMBIE)
857 if (kp->ki_flag & P_INMEM)
858 kp->ki_sflag = PS_INMEM;
861 /* Calculate legacy swtime as seconds since 'swtick'. */
862 kp->ki_swtime = (ticks - p->p_swtick) / hz;
863 kp->ki_pid = p->p_pid;
864 kp->ki_nice = p->p_nice;
865 kp->ki_start = p->p_stats->p_start;
866 timevaladd(&kp->ki_start, &boottime);
868 rufetch(p, &kp->ki_rusage);
869 kp->ki_runtime = cputick2usec(p->p_rux.rux_runtime);
870 calcru(p, &kp->ki_rusage.ru_utime, &kp->ki_rusage.ru_stime);
872 calccru(p, &kp->ki_childutime, &kp->ki_childstime);
873 /* Some callers want child times in a single value. */
874 kp->ki_childtime = kp->ki_childstime;
875 timevaladd(&kp->ki_childtime, &kp->ki_childutime);
877 FOREACH_THREAD_IN_PROC(p, td0)
878 kp->ki_cow += td0->td_cow;
882 kp->ki_pgid = p->p_pgrp->pg_id;
883 kp->ki_jobc = p->p_pgrp->pg_jobc;
884 sp = p->p_pgrp->pg_session;
887 kp->ki_sid = sp->s_sid;
889 strlcpy(kp->ki_login, sp->s_login,
890 sizeof(kp->ki_login));
892 kp->ki_kiflag |= KI_CTTY;
894 kp->ki_kiflag |= KI_SLEADER;
895 /* XXX proctree_lock */
900 if ((p->p_flag & P_CONTROLT) && tp != NULL) {
901 kp->ki_tdev = tty_udev(tp);
902 kp->ki_tpgid = tp->t_pgrp ? tp->t_pgrp->pg_id : NO_PID;
904 kp->ki_tsid = tp->t_session->s_sid;
907 if (p->p_comm[0] != '\0')
908 strlcpy(kp->ki_comm, p->p_comm, sizeof(kp->ki_comm));
909 if (p->p_sysent && p->p_sysent->sv_name != NULL &&
910 p->p_sysent->sv_name[0] != '\0')
911 strlcpy(kp->ki_emul, p->p_sysent->sv_name, sizeof(kp->ki_emul));
912 kp->ki_siglist = p->p_siglist;
913 kp->ki_xstat = p->p_xstat;
914 kp->ki_acflag = p->p_acflag;
915 kp->ki_lock = p->p_lock;
917 kp->ki_ppid = p->p_pptr->p_pid;
921 * Fill in information that is thread specific. Must be called with
922 * target process locked. If 'preferthread' is set, overwrite certain
923 * process-related fields that are maintained for both threads and
927 fill_kinfo_thread(struct thread *td, struct kinfo_proc *kp, int preferthread)
933 PROC_LOCK_ASSERT(p, MA_OWNED);
938 if (td->td_wmesg != NULL)
939 strlcpy(kp->ki_wmesg, td->td_wmesg, sizeof(kp->ki_wmesg));
941 bzero(kp->ki_wmesg, sizeof(kp->ki_wmesg));
942 strlcpy(kp->ki_tdname, td->td_name, sizeof(kp->ki_tdname));
943 if (TD_ON_LOCK(td)) {
944 kp->ki_kiflag |= KI_LOCKBLOCK;
945 strlcpy(kp->ki_lockname, td->td_lockname,
946 sizeof(kp->ki_lockname));
948 kp->ki_kiflag &= ~KI_LOCKBLOCK;
949 bzero(kp->ki_lockname, sizeof(kp->ki_lockname));
952 if (p->p_state == PRS_NORMAL) { /* approximate. */
953 if (TD_ON_RUNQ(td) ||
957 } else if (P_SHOULDSTOP(p)) {
959 } else if (TD_IS_SLEEPING(td)) {
960 kp->ki_stat = SSLEEP;
961 } else if (TD_ON_LOCK(td)) {
966 } else if (p->p_state == PRS_ZOMBIE) {
972 /* Things in the thread */
973 kp->ki_wchan = td->td_wchan;
974 kp->ki_pri.pri_level = td->td_priority;
975 kp->ki_pri.pri_native = td->td_base_pri;
976 kp->ki_lastcpu = td->td_lastcpu;
977 kp->ki_oncpu = td->td_oncpu;
978 kp->ki_tdflags = td->td_flags;
979 kp->ki_tid = td->td_tid;
980 kp->ki_numthreads = p->p_numthreads;
981 kp->ki_pcb = td->td_pcb;
982 kp->ki_kstack = (void *)td->td_kstack;
983 kp->ki_slptime = (ticks - td->td_slptick) / hz;
984 kp->ki_pri.pri_class = td->td_pri_class;
985 kp->ki_pri.pri_user = td->td_user_pri;
988 rufetchtd(td, &kp->ki_rusage);
989 kp->ki_runtime = cputick2usec(td->td_rux.rux_runtime);
990 kp->ki_pctcpu = sched_pctcpu(td);
991 kp->ki_estcpu = td->td_estcpu;
992 kp->ki_cow = td->td_cow;
995 /* We can't get this anymore but ps etc never used it anyway. */
999 kp->ki_siglist = td->td_siglist;
1000 kp->ki_sigmask = td->td_sigmask;
1007 * Fill in a kinfo_proc structure for the specified process.
1008 * Must be called with the target process locked.
1011 fill_kinfo_proc(struct proc *p, struct kinfo_proc *kp)
1014 MPASS(FIRST_THREAD_IN_PROC(p) != NULL);
1016 fill_kinfo_proc_only(p, kp);
1017 fill_kinfo_thread(FIRST_THREAD_IN_PROC(p), kp, 0);
1018 fill_kinfo_aggregate(p, kp);
1025 return (malloc(sizeof(struct pstats), M_SUBPROC, M_ZERO|M_WAITOK));
1029 * Copy parts of p_stats; zero the rest of p_stats (statistics).
1032 pstats_fork(struct pstats *src, struct pstats *dst)
1035 bzero(&dst->pstat_startzero,
1036 __rangeof(struct pstats, pstat_startzero, pstat_endzero));
1037 bcopy(&src->pstat_startcopy, &dst->pstat_startcopy,
1038 __rangeof(struct pstats, pstat_startcopy, pstat_endcopy));
1042 pstats_free(struct pstats *ps)
1045 free(ps, M_SUBPROC);
1048 static struct proc *
1049 zpfind_locked(pid_t pid)
1053 sx_assert(&allproc_lock, SX_LOCKED);
1054 LIST_FOREACH(p, &zombproc, p_list) {
1055 if (p->p_pid == pid) {
1064 * Locate a zombie process by number
1071 sx_slock(&allproc_lock);
1072 p = zpfind_locked(pid);
1073 sx_sunlock(&allproc_lock);
1077 #ifdef COMPAT_FREEBSD32
1080 * This function is typically used to copy out the kernel address, so
1081 * it can be replaced by assignment of zero.
1083 static inline uint32_t
1084 ptr32_trim(void *ptr)
1088 uptr = (uintptr_t)ptr;
1089 return ((uptr > UINT_MAX) ? 0 : uptr);
1092 #define PTRTRIM_CP(src,dst,fld) \
1093 do { (dst).fld = ptr32_trim((src).fld); } while (0)
1096 freebsd32_kinfo_proc_out(const struct kinfo_proc *ki, struct kinfo_proc32 *ki32)
1100 bzero(ki32, sizeof(struct kinfo_proc32));
1101 ki32->ki_structsize = sizeof(struct kinfo_proc32);
1102 CP(*ki, *ki32, ki_layout);
1103 PTRTRIM_CP(*ki, *ki32, ki_args);
1104 PTRTRIM_CP(*ki, *ki32, ki_paddr);
1105 PTRTRIM_CP(*ki, *ki32, ki_addr);
1106 PTRTRIM_CP(*ki, *ki32, ki_tracep);
1107 PTRTRIM_CP(*ki, *ki32, ki_textvp);
1108 PTRTRIM_CP(*ki, *ki32, ki_fd);
1109 PTRTRIM_CP(*ki, *ki32, ki_vmspace);
1110 PTRTRIM_CP(*ki, *ki32, ki_wchan);
1111 CP(*ki, *ki32, ki_pid);
1112 CP(*ki, *ki32, ki_ppid);
1113 CP(*ki, *ki32, ki_pgid);
1114 CP(*ki, *ki32, ki_tpgid);
1115 CP(*ki, *ki32, ki_sid);
1116 CP(*ki, *ki32, ki_tsid);
1117 CP(*ki, *ki32, ki_jobc);
1118 CP(*ki, *ki32, ki_tdev);
1119 CP(*ki, *ki32, ki_siglist);
1120 CP(*ki, *ki32, ki_sigmask);
1121 CP(*ki, *ki32, ki_sigignore);
1122 CP(*ki, *ki32, ki_sigcatch);
1123 CP(*ki, *ki32, ki_uid);
1124 CP(*ki, *ki32, ki_ruid);
1125 CP(*ki, *ki32, ki_svuid);
1126 CP(*ki, *ki32, ki_rgid);
1127 CP(*ki, *ki32, ki_svgid);
1128 CP(*ki, *ki32, ki_ngroups);
1129 for (i = 0; i < KI_NGROUPS; i++)
1130 CP(*ki, *ki32, ki_groups[i]);
1131 CP(*ki, *ki32, ki_size);
1132 CP(*ki, *ki32, ki_rssize);
1133 CP(*ki, *ki32, ki_swrss);
1134 CP(*ki, *ki32, ki_tsize);
1135 CP(*ki, *ki32, ki_dsize);
1136 CP(*ki, *ki32, ki_ssize);
1137 CP(*ki, *ki32, ki_xstat);
1138 CP(*ki, *ki32, ki_acflag);
1139 CP(*ki, *ki32, ki_pctcpu);
1140 CP(*ki, *ki32, ki_estcpu);
1141 CP(*ki, *ki32, ki_slptime);
1142 CP(*ki, *ki32, ki_swtime);
1143 CP(*ki, *ki32, ki_cow);
1144 CP(*ki, *ki32, ki_runtime);
1145 TV_CP(*ki, *ki32, ki_start);
1146 TV_CP(*ki, *ki32, ki_childtime);
1147 CP(*ki, *ki32, ki_flag);
1148 CP(*ki, *ki32, ki_kiflag);
1149 CP(*ki, *ki32, ki_traceflag);
1150 CP(*ki, *ki32, ki_stat);
1151 CP(*ki, *ki32, ki_nice);
1152 CP(*ki, *ki32, ki_lock);
1153 CP(*ki, *ki32, ki_rqindex);
1154 CP(*ki, *ki32, ki_oncpu);
1155 CP(*ki, *ki32, ki_lastcpu);
1156 bcopy(ki->ki_tdname, ki32->ki_tdname, TDNAMLEN + 1);
1157 bcopy(ki->ki_wmesg, ki32->ki_wmesg, WMESGLEN + 1);
1158 bcopy(ki->ki_login, ki32->ki_login, LOGNAMELEN + 1);
1159 bcopy(ki->ki_lockname, ki32->ki_lockname, LOCKNAMELEN + 1);
1160 bcopy(ki->ki_comm, ki32->ki_comm, COMMLEN + 1);
1161 bcopy(ki->ki_emul, ki32->ki_emul, KI_EMULNAMELEN + 1);
1162 bcopy(ki->ki_loginclass, ki32->ki_loginclass, LOGINCLASSLEN + 1);
1163 CP(*ki, *ki32, ki_cr_flags);
1164 CP(*ki, *ki32, ki_jid);
1165 CP(*ki, *ki32, ki_numthreads);
1166 CP(*ki, *ki32, ki_tid);
1167 CP(*ki, *ki32, ki_pri);
1168 freebsd32_rusage_out(&ki->ki_rusage, &ki32->ki_rusage);
1169 freebsd32_rusage_out(&ki->ki_rusage_ch, &ki32->ki_rusage_ch);
1170 PTRTRIM_CP(*ki, *ki32, ki_pcb);
1171 PTRTRIM_CP(*ki, *ki32, ki_kstack);
1172 PTRTRIM_CP(*ki, *ki32, ki_udata);
1173 CP(*ki, *ki32, ki_sflag);
1174 CP(*ki, *ki32, ki_tdflags);
1179 kern_proc_out(struct proc *p, struct sbuf *sb, int flags)
1182 struct kinfo_proc ki;
1183 #ifdef COMPAT_FREEBSD32
1184 struct kinfo_proc32 ki32;
1188 PROC_LOCK_ASSERT(p, MA_OWNED);
1189 MPASS(FIRST_THREAD_IN_PROC(p) != NULL);
1192 fill_kinfo_proc(p, &ki);
1193 if ((flags & KERN_PROC_NOTHREADS) != 0) {
1194 #ifdef COMPAT_FREEBSD32
1195 if ((flags & KERN_PROC_MASK32) != 0) {
1196 freebsd32_kinfo_proc_out(&ki, &ki32);
1197 error = sbuf_bcat(sb, &ki32, sizeof(ki32));
1200 error = sbuf_bcat(sb, &ki, sizeof(ki));
1202 FOREACH_THREAD_IN_PROC(p, td) {
1203 fill_kinfo_thread(td, &ki, 1);
1204 #ifdef COMPAT_FREEBSD32
1205 if ((flags & KERN_PROC_MASK32) != 0) {
1206 freebsd32_kinfo_proc_out(&ki, &ki32);
1207 error = sbuf_bcat(sb, &ki32, sizeof(ki32));
1210 error = sbuf_bcat(sb, &ki, sizeof(ki));
1220 sysctl_out_proc(struct proc *p, struct sysctl_req *req, int flags,
1224 struct kinfo_proc ki;
1230 sbuf_new_for_sysctl(&sb, (char *)&ki, sizeof(ki), req);
1231 error = kern_proc_out(p, &sb, flags);
1232 error2 = sbuf_finish(&sb);
1236 else if (error2 != 0)
1256 sysctl_kern_proc(SYSCTL_HANDLER_ARGS)
1258 int *name = (int *)arg1;
1259 u_int namelen = arg2;
1261 int flags, doingzomb, oid_number;
1264 oid_number = oidp->oid_number;
1265 if (oid_number != KERN_PROC_ALL &&
1266 (oid_number & KERN_PROC_INC_THREAD) == 0)
1267 flags = KERN_PROC_NOTHREADS;
1270 oid_number &= ~KERN_PROC_INC_THREAD;
1272 #ifdef COMPAT_FREEBSD32
1273 if (req->flags & SCTL_MASK32)
1274 flags |= KERN_PROC_MASK32;
1276 if (oid_number == KERN_PROC_PID) {
1279 error = sysctl_wire_old_buffer(req, 0);
1282 error = pget((pid_t)name[0], PGET_CANSEE, &p);
1285 error = sysctl_out_proc(p, req, flags, 0);
1289 switch (oid_number) {
1294 case KERN_PROC_PROC:
1295 if (namelen != 0 && namelen != 1)
1305 /* overestimate by 5 procs */
1306 error = SYSCTL_OUT(req, 0, sizeof (struct kinfo_proc) * 5);
1310 error = sysctl_wire_old_buffer(req, 0);
1313 sx_slock(&allproc_lock);
1314 for (doingzomb=0 ; doingzomb < 2 ; doingzomb++) {
1316 p = LIST_FIRST(&allproc);
1318 p = LIST_FIRST(&zombproc);
1319 for (; p != 0; p = LIST_NEXT(p, p_list)) {
1321 * Skip embryonic processes.
1324 if (p->p_state == PRS_NEW) {
1328 KASSERT(p->p_ucred != NULL,
1329 ("process credential is NULL for non-NEW proc"));
1331 * Show a user only appropriate processes.
1333 if (p_cansee(curthread, p)) {
1338 * TODO - make more efficient (see notes below).
1341 switch (oid_number) {
1344 if (p->p_ucred->cr_gid != (gid_t)name[0]) {
1350 case KERN_PROC_PGRP:
1351 /* could do this by traversing pgrp */
1352 if (p->p_pgrp == NULL ||
1353 p->p_pgrp->pg_id != (pid_t)name[0]) {
1359 case KERN_PROC_RGID:
1360 if (p->p_ucred->cr_rgid != (gid_t)name[0]) {
1366 case KERN_PROC_SESSION:
1367 if (p->p_session == NULL ||
1368 p->p_session->s_sid != (pid_t)name[0]) {
1375 if ((p->p_flag & P_CONTROLT) == 0 ||
1376 p->p_session == NULL) {
1380 /* XXX proctree_lock */
1381 SESS_LOCK(p->p_session);
1382 if (p->p_session->s_ttyp == NULL ||
1383 tty_udev(p->p_session->s_ttyp) !=
1385 SESS_UNLOCK(p->p_session);
1389 SESS_UNLOCK(p->p_session);
1393 if (p->p_ucred->cr_uid != (uid_t)name[0]) {
1399 case KERN_PROC_RUID:
1400 if (p->p_ucred->cr_ruid != (uid_t)name[0]) {
1406 case KERN_PROC_PROC:
1414 error = sysctl_out_proc(p, req, flags, doingzomb);
1416 sx_sunlock(&allproc_lock);
1421 sx_sunlock(&allproc_lock);
1426 pargs_alloc(int len)
1430 pa = malloc(sizeof(struct pargs) + len, M_PARGS,
1432 refcount_init(&pa->ar_ref, 1);
1433 pa->ar_length = len;
1438 pargs_free(struct pargs *pa)
1445 pargs_hold(struct pargs *pa)
1450 refcount_acquire(&pa->ar_ref);
1454 pargs_drop(struct pargs *pa)
1459 if (refcount_release(&pa->ar_ref))
1464 proc_read_mem(struct thread *td, struct proc *p, vm_offset_t offset, void* buf,
1470 iov.iov_base = (caddr_t)buf;
1474 uio.uio_offset = offset;
1475 uio.uio_resid = (ssize_t)len;
1476 uio.uio_segflg = UIO_SYSSPACE;
1477 uio.uio_rw = UIO_READ;
1480 return (proc_rwmem(p, &uio));
1484 proc_read_string(struct thread *td, struct proc *p, const char *sptr, char *buf,
1490 error = proc_read_mem(td, p, (vm_offset_t)sptr, buf, len);
1492 * Reading the chunk may validly return EFAULT if the string is shorter
1493 * than the chunk and is aligned at the end of the page, assuming the
1494 * next page is not mapped. So if EFAULT is returned do a fallback to
1495 * one byte read loop.
1497 if (error == EFAULT) {
1498 for (i = 0; i < len; i++, buf++, sptr++) {
1499 error = proc_read_mem(td, p, (vm_offset_t)sptr, buf, 1);
1510 #define PROC_AUXV_MAX 256 /* Safety limit on auxv size. */
1512 enum proc_vector_type {
1518 #ifdef COMPAT_FREEBSD32
1520 get_proc_vector32(struct thread *td, struct proc *p, char ***proc_vectorp,
1521 size_t *vsizep, enum proc_vector_type type)
1523 struct freebsd32_ps_strings pss;
1525 vm_offset_t vptr, ptr;
1526 uint32_t *proc_vector32;
1531 error = proc_read_mem(td, p, (vm_offset_t)(p->p_sysent->sv_psstrings),
1537 vptr = (vm_offset_t)PTRIN(pss.ps_argvstr);
1538 vsize = pss.ps_nargvstr;
1539 if (vsize > ARG_MAX)
1541 size = vsize * sizeof(int32_t);
1544 vptr = (vm_offset_t)PTRIN(pss.ps_envstr);
1545 vsize = pss.ps_nenvstr;
1546 if (vsize > ARG_MAX)
1548 size = vsize * sizeof(int32_t);
1551 vptr = (vm_offset_t)PTRIN(pss.ps_envstr) +
1552 (pss.ps_nenvstr + 1) * sizeof(int32_t);
1555 for (ptr = vptr, i = 0; i < PROC_AUXV_MAX; i++) {
1556 error = proc_read_mem(td, p, ptr, &aux, sizeof(aux));
1559 if (aux.a_type == AT_NULL)
1563 if (aux.a_type != AT_NULL)
1566 size = vsize * sizeof(aux);
1569 KASSERT(0, ("Wrong proc vector type: %d", type));
1572 proc_vector32 = malloc(size, M_TEMP, M_WAITOK);
1573 error = proc_read_mem(td, p, vptr, proc_vector32, size);
1576 if (type == PROC_AUX) {
1577 *proc_vectorp = (char **)proc_vector32;
1581 proc_vector = malloc(vsize * sizeof(char *), M_TEMP, M_WAITOK);
1582 for (i = 0; i < (int)vsize; i++)
1583 proc_vector[i] = PTRIN(proc_vector32[i]);
1584 *proc_vectorp = proc_vector;
1587 free(proc_vector32, M_TEMP);
1593 get_proc_vector(struct thread *td, struct proc *p, char ***proc_vectorp,
1594 size_t *vsizep, enum proc_vector_type type)
1596 struct ps_strings pss;
1598 vm_offset_t vptr, ptr;
1603 #ifdef COMPAT_FREEBSD32
1604 if (SV_PROC_FLAG(p, SV_ILP32) != 0)
1605 return (get_proc_vector32(td, p, proc_vectorp, vsizep, type));
1607 error = proc_read_mem(td, p, (vm_offset_t)(p->p_sysent->sv_psstrings),
1613 vptr = (vm_offset_t)pss.ps_argvstr;
1614 vsize = pss.ps_nargvstr;
1615 if (vsize > ARG_MAX)
1617 size = vsize * sizeof(char *);
1620 vptr = (vm_offset_t)pss.ps_envstr;
1621 vsize = pss.ps_nenvstr;
1622 if (vsize > ARG_MAX)
1624 size = vsize * sizeof(char *);
1628 * The aux array is just above env array on the stack. Check
1629 * that the address is naturally aligned.
1631 vptr = (vm_offset_t)pss.ps_envstr + (pss.ps_nenvstr + 1)
1633 #if __ELF_WORD_SIZE == 64
1634 if (vptr % sizeof(uint64_t) != 0)
1636 if (vptr % sizeof(uint32_t) != 0)
1640 * We count the array size reading the aux vectors from the
1641 * stack until AT_NULL vector is returned. So (to keep the code
1642 * simple) we read the process stack twice: the first time here
1643 * to find the size and the second time when copying the vectors
1644 * to the allocated proc_vector.
1646 for (ptr = vptr, i = 0; i < PROC_AUXV_MAX; i++) {
1647 error = proc_read_mem(td, p, ptr, &aux, sizeof(aux));
1650 if (aux.a_type == AT_NULL)
1655 * If the PROC_AUXV_MAX entries are iterated over, and we have
1656 * not reached AT_NULL, it is most likely we are reading wrong
1657 * data: either the process doesn't have auxv array or data has
1658 * been modified. Return the error in this case.
1660 if (aux.a_type != AT_NULL)
1663 size = vsize * sizeof(aux);
1666 KASSERT(0, ("Wrong proc vector type: %d", type));
1667 return (EINVAL); /* In case we are built without INVARIANTS. */
1669 proc_vector = malloc(size, M_TEMP, M_WAITOK);
1670 if (proc_vector == NULL)
1672 error = proc_read_mem(td, p, vptr, proc_vector, size);
1674 free(proc_vector, M_TEMP);
1677 *proc_vectorp = proc_vector;
1683 #define GET_PS_STRINGS_CHUNK_SZ 256 /* Chunk size (bytes) for ps_strings operations. */
1686 get_ps_strings(struct thread *td, struct proc *p, struct sbuf *sb,
1687 enum proc_vector_type type)
1689 size_t done, len, nchr, vsize;
1691 char **proc_vector, *sptr;
1692 char pss_string[GET_PS_STRINGS_CHUNK_SZ];
1694 PROC_ASSERT_HELD(p);
1697 * We are not going to read more than 2 * (PATH_MAX + ARG_MAX) bytes.
1699 nchr = 2 * (PATH_MAX + ARG_MAX);
1701 error = get_proc_vector(td, p, &proc_vector, &vsize, type);
1704 for (done = 0, i = 0; i < (int)vsize && done < nchr; i++) {
1706 * The program may have scribbled into its argv array, e.g. to
1707 * remove some arguments. If that has happened, break out
1708 * before trying to read from NULL.
1710 if (proc_vector[i] == NULL)
1712 for (sptr = proc_vector[i]; ; sptr += GET_PS_STRINGS_CHUNK_SZ) {
1713 error = proc_read_string(td, p, sptr, pss_string,
1714 sizeof(pss_string));
1717 len = strnlen(pss_string, GET_PS_STRINGS_CHUNK_SZ);
1718 if (done + len >= nchr)
1719 len = nchr - done - 1;
1720 sbuf_bcat(sb, pss_string, len);
1721 if (len != GET_PS_STRINGS_CHUNK_SZ)
1723 done += GET_PS_STRINGS_CHUNK_SZ;
1725 sbuf_bcat(sb, "", 1);
1729 free(proc_vector, M_TEMP);
1734 proc_getargv(struct thread *td, struct proc *p, struct sbuf *sb)
1737 return (get_ps_strings(curthread, p, sb, PROC_ARG));
1741 proc_getenvv(struct thread *td, struct proc *p, struct sbuf *sb)
1744 return (get_ps_strings(curthread, p, sb, PROC_ENV));
1748 proc_getauxv(struct thread *td, struct proc *p, struct sbuf *sb)
1754 error = get_proc_vector(td, p, &auxv, &vsize, PROC_AUX);
1756 #ifdef COMPAT_FREEBSD32
1757 if (SV_PROC_FLAG(p, SV_ILP32) != 0)
1758 size = vsize * sizeof(Elf32_Auxinfo);
1761 size = vsize * sizeof(Elf_Auxinfo);
1762 error = sbuf_bcat(sb, auxv, size);
1769 * This sysctl allows a process to retrieve the argument list or process
1770 * title for another process without groping around in the address space
1771 * of the other process. It also allow a process to set its own "process
1772 * title to a string of its own choice.
1775 sysctl_kern_proc_args(SYSCTL_HANDLER_ARGS)
1777 int *name = (int *)arg1;
1778 u_int namelen = arg2;
1779 struct pargs *newpa, *pa;
1782 int flags, error = 0, error2;
1787 flags = PGET_CANSEE;
1788 if (req->newptr != NULL)
1789 flags |= PGET_ISCURRENT;
1790 error = pget((pid_t)name[0], flags, &p);
1798 error = SYSCTL_OUT(req, pa->ar_args, pa->ar_length);
1800 } else if ((p->p_flag & (P_WEXIT | P_SYSTEM)) == 0) {
1803 sbuf_new_for_sysctl(&sb, NULL, GET_PS_STRINGS_CHUNK_SZ, req);
1804 error = proc_getargv(curthread, p, &sb);
1805 error2 = sbuf_finish(&sb);
1808 if (error == 0 && error2 != 0)
1813 if (error != 0 || req->newptr == NULL)
1816 if (req->newlen + sizeof(struct pargs) > ps_arg_cache_limit)
1818 newpa = pargs_alloc(req->newlen);
1819 error = SYSCTL_IN(req, newpa->ar_args, req->newlen);
1833 * This sysctl allows a process to retrieve environment of another process.
1836 sysctl_kern_proc_env(SYSCTL_HANDLER_ARGS)
1838 int *name = (int *)arg1;
1839 u_int namelen = arg2;
1847 error = pget((pid_t)name[0], PGET_WANTREAD, &p);
1850 if ((p->p_flag & P_SYSTEM) != 0) {
1855 sbuf_new_for_sysctl(&sb, NULL, GET_PS_STRINGS_CHUNK_SZ, req);
1856 error = proc_getenvv(curthread, p, &sb);
1857 error2 = sbuf_finish(&sb);
1860 return (error != 0 ? error : error2);
1864 * This sysctl allows a process to retrieve ELF auxiliary vector of
1868 sysctl_kern_proc_auxv(SYSCTL_HANDLER_ARGS)
1870 int *name = (int *)arg1;
1871 u_int namelen = arg2;
1879 error = pget((pid_t)name[0], PGET_WANTREAD, &p);
1882 if ((p->p_flag & P_SYSTEM) != 0) {
1886 sbuf_new_for_sysctl(&sb, NULL, GET_PS_STRINGS_CHUNK_SZ, req);
1887 error = proc_getauxv(curthread, p, &sb);
1888 error2 = sbuf_finish(&sb);
1891 return (error != 0 ? error : error2);
1895 * This sysctl allows a process to retrieve the path of the executable for
1896 * itself or another process.
1899 sysctl_kern_proc_pathname(SYSCTL_HANDLER_ARGS)
1901 pid_t *pidp = (pid_t *)arg1;
1902 unsigned int arglen = arg2;
1905 char *retbuf, *freebuf;
1910 if (*pidp == -1) { /* -1 means this process */
1911 p = req->td->td_proc;
1913 error = pget(*pidp, PGET_CANSEE, &p);
1927 error = vn_fullpath(req->td, vp, &retbuf, &freebuf);
1931 error = SYSCTL_OUT(req, retbuf, strlen(retbuf) + 1);
1932 free(freebuf, M_TEMP);
1937 sysctl_kern_proc_sv_name(SYSCTL_HANDLER_ARGS)
1950 error = pget((pid_t)name[0], PGET_CANSEE, &p);
1953 sv_name = p->p_sysent->sv_name;
1955 return (sysctl_handle_string(oidp, sv_name, 0, req));
1958 #ifdef KINFO_OVMENTRY_SIZE
1959 CTASSERT(sizeof(struct kinfo_ovmentry) == KINFO_OVMENTRY_SIZE);
1962 #ifdef COMPAT_FREEBSD7
1964 sysctl_kern_proc_ovmmap(SYSCTL_HANDLER_ARGS)
1966 vm_map_entry_t entry, tmp_entry;
1967 unsigned int last_timestamp;
1968 char *fullpath, *freepath;
1969 struct kinfo_ovmentry *kve;
1979 error = pget((pid_t)name[0], PGET_WANTREAD, &p);
1982 vm = vmspace_acquire_ref(p);
1987 kve = malloc(sizeof(*kve), M_TEMP, M_WAITOK);
1990 vm_map_lock_read(map);
1991 for (entry = map->header.next; entry != &map->header;
1992 entry = entry->next) {
1993 vm_object_t obj, tobj, lobj;
1996 if (entry->eflags & MAP_ENTRY_IS_SUB_MAP)
1999 bzero(kve, sizeof(*kve));
2000 kve->kve_structsize = sizeof(*kve);
2002 kve->kve_private_resident = 0;
2003 obj = entry->object.vm_object;
2005 VM_OBJECT_RLOCK(obj);
2006 if (obj->shadow_count == 1)
2007 kve->kve_private_resident =
2008 obj->resident_page_count;
2010 kve->kve_resident = 0;
2011 addr = entry->start;
2012 while (addr < entry->end) {
2013 if (pmap_extract(map->pmap, addr))
2014 kve->kve_resident++;
2018 for (lobj = tobj = obj; tobj; tobj = tobj->backing_object) {
2020 VM_OBJECT_RLOCK(tobj);
2022 VM_OBJECT_RUNLOCK(lobj);
2026 kve->kve_start = (void*)entry->start;
2027 kve->kve_end = (void*)entry->end;
2028 kve->kve_offset = (off_t)entry->offset;
2030 if (entry->protection & VM_PROT_READ)
2031 kve->kve_protection |= KVME_PROT_READ;
2032 if (entry->protection & VM_PROT_WRITE)
2033 kve->kve_protection |= KVME_PROT_WRITE;
2034 if (entry->protection & VM_PROT_EXECUTE)
2035 kve->kve_protection |= KVME_PROT_EXEC;
2037 if (entry->eflags & MAP_ENTRY_COW)
2038 kve->kve_flags |= KVME_FLAG_COW;
2039 if (entry->eflags & MAP_ENTRY_NEEDS_COPY)
2040 kve->kve_flags |= KVME_FLAG_NEEDS_COPY;
2041 if (entry->eflags & MAP_ENTRY_NOCOREDUMP)
2042 kve->kve_flags |= KVME_FLAG_NOCOREDUMP;
2044 last_timestamp = map->timestamp;
2045 vm_map_unlock_read(map);
2047 kve->kve_fileid = 0;
2053 switch (lobj->type) {
2055 kve->kve_type = KVME_TYPE_DEFAULT;
2058 kve->kve_type = KVME_TYPE_VNODE;
2063 kve->kve_type = KVME_TYPE_SWAP;
2066 kve->kve_type = KVME_TYPE_DEVICE;
2069 kve->kve_type = KVME_TYPE_PHYS;
2072 kve->kve_type = KVME_TYPE_DEAD;
2075 kve->kve_type = KVME_TYPE_SG;
2078 kve->kve_type = KVME_TYPE_UNKNOWN;
2082 VM_OBJECT_RUNLOCK(lobj);
2084 kve->kve_ref_count = obj->ref_count;
2085 kve->kve_shadow_count = obj->shadow_count;
2086 VM_OBJECT_RUNLOCK(obj);
2088 vn_fullpath(curthread, vp, &fullpath,
2090 cred = curthread->td_ucred;
2091 vn_lock(vp, LK_SHARED | LK_RETRY);
2092 if (VOP_GETATTR(vp, &va, cred) == 0) {
2093 kve->kve_fileid = va.va_fileid;
2094 kve->kve_fsid = va.va_fsid;
2099 kve->kve_type = KVME_TYPE_NONE;
2100 kve->kve_ref_count = 0;
2101 kve->kve_shadow_count = 0;
2104 strlcpy(kve->kve_path, fullpath, sizeof(kve->kve_path));
2105 if (freepath != NULL)
2106 free(freepath, M_TEMP);
2108 error = SYSCTL_OUT(req, kve, sizeof(*kve));
2109 vm_map_lock_read(map);
2112 if (last_timestamp != map->timestamp) {
2113 vm_map_lookup_entry(map, addr - 1, &tmp_entry);
2117 vm_map_unlock_read(map);
2123 #endif /* COMPAT_FREEBSD7 */
2125 #ifdef KINFO_VMENTRY_SIZE
2126 CTASSERT(sizeof(struct kinfo_vmentry) == KINFO_VMENTRY_SIZE);
2130 * Must be called with the process locked and will return unlocked.
2133 kern_proc_vmmap_out(struct proc *p, struct sbuf *sb)
2135 vm_map_entry_t entry, tmp_entry;
2136 unsigned int last_timestamp;
2137 char *fullpath, *freepath;
2138 struct kinfo_vmentry *kve;
2146 PROC_LOCK_ASSERT(p, MA_OWNED);
2150 vm = vmspace_acquire_ref(p);
2155 kve = malloc(sizeof(*kve), M_TEMP, M_WAITOK);
2159 vm_map_lock_read(map);
2160 for (entry = map->header.next; entry != &map->header;
2161 entry = entry->next) {
2162 vm_object_t obj, tobj, lobj;
2164 vm_paddr_t locked_pa;
2167 if (entry->eflags & MAP_ENTRY_IS_SUB_MAP)
2170 bzero(kve, sizeof(*kve));
2172 kve->kve_private_resident = 0;
2173 obj = entry->object.vm_object;
2175 VM_OBJECT_RLOCK(obj);
2176 if (obj->shadow_count == 1)
2177 kve->kve_private_resident =
2178 obj->resident_page_count;
2180 kve->kve_resident = 0;
2181 addr = entry->start;
2182 while (addr < entry->end) {
2184 mincoreinfo = pmap_mincore(map->pmap, addr, &locked_pa);
2186 vm_page_unlock(PHYS_TO_VM_PAGE(locked_pa));
2187 if (mincoreinfo & MINCORE_INCORE)
2188 kve->kve_resident++;
2189 if (mincoreinfo & MINCORE_SUPER)
2190 kve->kve_flags |= KVME_FLAG_SUPER;
2194 for (lobj = tobj = obj; tobj; tobj = tobj->backing_object) {
2196 VM_OBJECT_RLOCK(tobj);
2198 VM_OBJECT_RUNLOCK(lobj);
2202 kve->kve_start = entry->start;
2203 kve->kve_end = entry->end;
2204 kve->kve_offset = entry->offset;
2206 if (entry->protection & VM_PROT_READ)
2207 kve->kve_protection |= KVME_PROT_READ;
2208 if (entry->protection & VM_PROT_WRITE)
2209 kve->kve_protection |= KVME_PROT_WRITE;
2210 if (entry->protection & VM_PROT_EXECUTE)
2211 kve->kve_protection |= KVME_PROT_EXEC;
2213 if (entry->eflags & MAP_ENTRY_COW)
2214 kve->kve_flags |= KVME_FLAG_COW;
2215 if (entry->eflags & MAP_ENTRY_NEEDS_COPY)
2216 kve->kve_flags |= KVME_FLAG_NEEDS_COPY;
2217 if (entry->eflags & MAP_ENTRY_NOCOREDUMP)
2218 kve->kve_flags |= KVME_FLAG_NOCOREDUMP;
2219 if (entry->eflags & MAP_ENTRY_GROWS_UP)
2220 kve->kve_flags |= KVME_FLAG_GROWS_UP;
2221 if (entry->eflags & MAP_ENTRY_GROWS_DOWN)
2222 kve->kve_flags |= KVME_FLAG_GROWS_DOWN;
2224 last_timestamp = map->timestamp;
2225 vm_map_unlock_read(map);
2231 switch (lobj->type) {
2233 kve->kve_type = KVME_TYPE_DEFAULT;
2236 kve->kve_type = KVME_TYPE_VNODE;
2241 kve->kve_type = KVME_TYPE_SWAP;
2244 kve->kve_type = KVME_TYPE_DEVICE;
2247 kve->kve_type = KVME_TYPE_PHYS;
2250 kve->kve_type = KVME_TYPE_DEAD;
2253 kve->kve_type = KVME_TYPE_SG;
2256 kve->kve_type = KVME_TYPE_UNKNOWN;
2260 VM_OBJECT_RUNLOCK(lobj);
2262 kve->kve_ref_count = obj->ref_count;
2263 kve->kve_shadow_count = obj->shadow_count;
2264 VM_OBJECT_RUNLOCK(obj);
2266 vn_fullpath(curthread, vp, &fullpath,
2268 kve->kve_vn_type = vntype_to_kinfo(vp->v_type);
2269 cred = curthread->td_ucred;
2270 vn_lock(vp, LK_SHARED | LK_RETRY);
2271 if (VOP_GETATTR(vp, &va, cred) == 0) {
2272 kve->kve_vn_fileid = va.va_fileid;
2273 kve->kve_vn_fsid = va.va_fsid;
2275 MAKEIMODE(va.va_type, va.va_mode);
2276 kve->kve_vn_size = va.va_size;
2277 kve->kve_vn_rdev = va.va_rdev;
2278 kve->kve_status = KF_ATTR_VALID;
2283 kve->kve_type = KVME_TYPE_NONE;
2284 kve->kve_ref_count = 0;
2285 kve->kve_shadow_count = 0;
2288 strlcpy(kve->kve_path, fullpath, sizeof(kve->kve_path));
2289 if (freepath != NULL)
2290 free(freepath, M_TEMP);
2292 /* Pack record size down */
2293 kve->kve_structsize = offsetof(struct kinfo_vmentry, kve_path) +
2294 strlen(kve->kve_path) + 1;
2295 kve->kve_structsize = roundup(kve->kve_structsize,
2297 error = sbuf_bcat(sb, kve, kve->kve_structsize);
2298 vm_map_lock_read(map);
2301 if (last_timestamp != map->timestamp) {
2302 vm_map_lookup_entry(map, addr - 1, &tmp_entry);
2306 vm_map_unlock_read(map);
2314 sysctl_kern_proc_vmmap(SYSCTL_HANDLER_ARGS)
2318 int error, error2, *name;
2321 sbuf_new_for_sysctl(&sb, NULL, sizeof(struct kinfo_vmentry), req);
2322 error = pget((pid_t)name[0], PGET_CANDEBUG | PGET_NOTWEXIT, &p);
2327 error = kern_proc_vmmap_out(p, &sb);
2328 error2 = sbuf_finish(&sb);
2330 return (error != 0 ? error : error2);
2333 #if defined(STACK) || defined(DDB)
2335 sysctl_kern_proc_kstack(SYSCTL_HANDLER_ARGS)
2337 struct kinfo_kstack *kkstp;
2338 int error, i, *name, numthreads;
2339 lwpid_t *lwpidarray;
2346 error = pget((pid_t)name[0], PGET_NOTINEXEC | PGET_WANTREAD, &p);
2350 kkstp = malloc(sizeof(*kkstp), M_TEMP, M_WAITOK);
2351 st = stack_create();
2357 if (numthreads < p->p_numthreads) {
2358 if (lwpidarray != NULL) {
2359 free(lwpidarray, M_TEMP);
2362 numthreads = p->p_numthreads;
2364 lwpidarray = malloc(sizeof(*lwpidarray) * numthreads, M_TEMP,
2372 * XXXRW: During the below loop, execve(2) and countless other sorts
2373 * of changes could have taken place. Should we check to see if the
2374 * vmspace has been replaced, or the like, in order to prevent
2375 * giving a snapshot that spans, say, execve(2), with some threads
2376 * before and some after? Among other things, the credentials could
2377 * have changed, in which case the right to extract debug info might
2378 * no longer be assured.
2380 FOREACH_THREAD_IN_PROC(p, td) {
2381 KASSERT(i < numthreads,
2382 ("sysctl_kern_proc_kstack: numthreads"));
2383 lwpidarray[i] = td->td_tid;
2387 for (i = 0; i < numthreads; i++) {
2388 td = thread_find(p, lwpidarray[i]);
2392 bzero(kkstp, sizeof(*kkstp));
2393 (void)sbuf_new(&sb, kkstp->kkst_trace,
2394 sizeof(kkstp->kkst_trace), SBUF_FIXEDLEN);
2396 kkstp->kkst_tid = td->td_tid;
2397 if (TD_IS_SWAPPED(td))
2398 kkstp->kkst_state = KKST_STATE_SWAPPED;
2399 else if (TD_IS_RUNNING(td))
2400 kkstp->kkst_state = KKST_STATE_RUNNING;
2402 kkstp->kkst_state = KKST_STATE_STACKOK;
2403 stack_save_td(st, td);
2407 stack_sbuf_print(&sb, st);
2410 error = SYSCTL_OUT(req, kkstp, sizeof(*kkstp));
2417 if (lwpidarray != NULL)
2418 free(lwpidarray, M_TEMP);
2420 free(kkstp, M_TEMP);
2426 * This sysctl allows a process to retrieve the full list of groups from
2427 * itself or another process.
2430 sysctl_kern_proc_groups(SYSCTL_HANDLER_ARGS)
2432 pid_t *pidp = (pid_t *)arg1;
2433 unsigned int arglen = arg2;
2440 if (*pidp == -1) { /* -1 means this process */
2441 p = req->td->td_proc;
2443 error = pget(*pidp, PGET_CANSEE, &p);
2448 cred = crhold(p->p_ucred);
2452 error = SYSCTL_OUT(req, cred->cr_groups,
2453 cred->cr_ngroups * sizeof(gid_t));
2459 * This sysctl allows a process to retrieve or/and set the resource limit for
2463 sysctl_kern_proc_rlimit(SYSCTL_HANDLER_ARGS)
2465 int *name = (int *)arg1;
2466 u_int namelen = arg2;
2475 which = (u_int)name[1];
2476 if (which >= RLIM_NLIMITS)
2479 if (req->newptr != NULL && req->newlen != sizeof(rlim))
2482 flags = PGET_HOLD | PGET_NOTWEXIT;
2483 if (req->newptr != NULL)
2484 flags |= PGET_CANDEBUG;
2486 flags |= PGET_CANSEE;
2487 error = pget((pid_t)name[0], flags, &p);
2494 if (req->oldptr != NULL) {
2496 lim_rlimit(p, which, &rlim);
2499 error = SYSCTL_OUT(req, &rlim, sizeof(rlim));
2506 if (req->newptr != NULL) {
2507 error = SYSCTL_IN(req, &rlim, sizeof(rlim));
2509 error = kern_proc_setrlimit(curthread, p, which, &rlim);
2518 * This sysctl allows a process to retrieve ps_strings structure location of
2522 sysctl_kern_proc_ps_strings(SYSCTL_HANDLER_ARGS)
2524 int *name = (int *)arg1;
2525 u_int namelen = arg2;
2527 vm_offset_t ps_strings;
2529 #ifdef COMPAT_FREEBSD32
2530 uint32_t ps_strings32;
2536 error = pget((pid_t)name[0], PGET_CANDEBUG, &p);
2539 #ifdef COMPAT_FREEBSD32
2540 if ((req->flags & SCTL_MASK32) != 0) {
2542 * We return 0 if the 32 bit emulation request is for a 64 bit
2545 ps_strings32 = SV_PROC_FLAG(p, SV_ILP32) != 0 ?
2546 PTROUT(p->p_sysent->sv_psstrings) : 0;
2548 error = SYSCTL_OUT(req, &ps_strings32, sizeof(ps_strings32));
2552 ps_strings = p->p_sysent->sv_psstrings;
2554 error = SYSCTL_OUT(req, &ps_strings, sizeof(ps_strings));
2559 * This sysctl allows a process to retrieve umask of another process.
2562 sysctl_kern_proc_umask(SYSCTL_HANDLER_ARGS)
2564 int *name = (int *)arg1;
2565 u_int namelen = arg2;
2573 error = pget((pid_t)name[0], PGET_WANTREAD, &p);
2577 FILEDESC_SLOCK(p->p_fd);
2578 fd_cmask = p->p_fd->fd_cmask;
2579 FILEDESC_SUNLOCK(p->p_fd);
2581 error = SYSCTL_OUT(req, &fd_cmask, sizeof(fd_cmask));
2586 * This sysctl allows a process to set and retrieve binary osreldate of
2590 sysctl_kern_proc_osrel(SYSCTL_HANDLER_ARGS)
2592 int *name = (int *)arg1;
2593 u_int namelen = arg2;
2595 int flags, error, osrel;
2600 if (req->newptr != NULL && req->newlen != sizeof(osrel))
2603 flags = PGET_HOLD | PGET_NOTWEXIT;
2604 if (req->newptr != NULL)
2605 flags |= PGET_CANDEBUG;
2607 flags |= PGET_CANSEE;
2608 error = pget((pid_t)name[0], flags, &p);
2612 error = SYSCTL_OUT(req, &p->p_osrel, sizeof(p->p_osrel));
2616 if (req->newptr != NULL) {
2617 error = SYSCTL_IN(req, &osrel, sizeof(osrel));
2631 SYSCTL_NODE(_kern, KERN_PROC, proc, CTLFLAG_RD, 0, "Process table");
2633 SYSCTL_PROC(_kern_proc, KERN_PROC_ALL, all, CTLFLAG_RD|CTLTYPE_STRUCT|
2634 CTLFLAG_MPSAFE, 0, 0, sysctl_kern_proc, "S,proc",
2635 "Return entire process table");
2637 static SYSCTL_NODE(_kern_proc, KERN_PROC_GID, gid, CTLFLAG_RD | CTLFLAG_MPSAFE,
2638 sysctl_kern_proc, "Process table");
2640 static SYSCTL_NODE(_kern_proc, KERN_PROC_PGRP, pgrp, CTLFLAG_RD | CTLFLAG_MPSAFE,
2641 sysctl_kern_proc, "Process table");
2643 static SYSCTL_NODE(_kern_proc, KERN_PROC_RGID, rgid, CTLFLAG_RD | CTLFLAG_MPSAFE,
2644 sysctl_kern_proc, "Process table");
2646 static SYSCTL_NODE(_kern_proc, KERN_PROC_SESSION, sid, CTLFLAG_RD |
2647 CTLFLAG_MPSAFE, sysctl_kern_proc, "Process table");
2649 static SYSCTL_NODE(_kern_proc, KERN_PROC_TTY, tty, CTLFLAG_RD | CTLFLAG_MPSAFE,
2650 sysctl_kern_proc, "Process table");
2652 static SYSCTL_NODE(_kern_proc, KERN_PROC_UID, uid, CTLFLAG_RD | CTLFLAG_MPSAFE,
2653 sysctl_kern_proc, "Process table");
2655 static SYSCTL_NODE(_kern_proc, KERN_PROC_RUID, ruid, CTLFLAG_RD | CTLFLAG_MPSAFE,
2656 sysctl_kern_proc, "Process table");
2658 static SYSCTL_NODE(_kern_proc, KERN_PROC_PID, pid, CTLFLAG_RD | CTLFLAG_MPSAFE,
2659 sysctl_kern_proc, "Process table");
2661 static SYSCTL_NODE(_kern_proc, KERN_PROC_PROC, proc, CTLFLAG_RD | CTLFLAG_MPSAFE,
2662 sysctl_kern_proc, "Return process table, no threads");
2664 static SYSCTL_NODE(_kern_proc, KERN_PROC_ARGS, args,
2665 CTLFLAG_RW | CTLFLAG_ANYBODY | CTLFLAG_MPSAFE,
2666 sysctl_kern_proc_args, "Process argument list");
2668 static SYSCTL_NODE(_kern_proc, KERN_PROC_ENV, env, CTLFLAG_RD | CTLFLAG_MPSAFE,
2669 sysctl_kern_proc_env, "Process environment");
2671 static SYSCTL_NODE(_kern_proc, KERN_PROC_AUXV, auxv, CTLFLAG_RD |
2672 CTLFLAG_MPSAFE, sysctl_kern_proc_auxv, "Process ELF auxiliary vector");
2674 static SYSCTL_NODE(_kern_proc, KERN_PROC_PATHNAME, pathname, CTLFLAG_RD |
2675 CTLFLAG_MPSAFE, sysctl_kern_proc_pathname, "Process executable path");
2677 static SYSCTL_NODE(_kern_proc, KERN_PROC_SV_NAME, sv_name, CTLFLAG_RD |
2678 CTLFLAG_MPSAFE, sysctl_kern_proc_sv_name,
2679 "Process syscall vector name (ABI type)");
2681 static SYSCTL_NODE(_kern_proc, (KERN_PROC_GID | KERN_PROC_INC_THREAD), gid_td,
2682 CTLFLAG_RD | CTLFLAG_MPSAFE, sysctl_kern_proc, "Process table");
2684 static SYSCTL_NODE(_kern_proc, (KERN_PROC_PGRP | KERN_PROC_INC_THREAD), pgrp_td,
2685 CTLFLAG_RD | CTLFLAG_MPSAFE, sysctl_kern_proc, "Process table");
2687 static SYSCTL_NODE(_kern_proc, (KERN_PROC_RGID | KERN_PROC_INC_THREAD), rgid_td,
2688 CTLFLAG_RD | CTLFLAG_MPSAFE, sysctl_kern_proc, "Process table");
2690 static SYSCTL_NODE(_kern_proc, (KERN_PROC_SESSION | KERN_PROC_INC_THREAD),
2691 sid_td, CTLFLAG_RD | CTLFLAG_MPSAFE, sysctl_kern_proc, "Process table");
2693 static SYSCTL_NODE(_kern_proc, (KERN_PROC_TTY | KERN_PROC_INC_THREAD), tty_td,
2694 CTLFLAG_RD | CTLFLAG_MPSAFE, sysctl_kern_proc, "Process table");
2696 static SYSCTL_NODE(_kern_proc, (KERN_PROC_UID | KERN_PROC_INC_THREAD), uid_td,
2697 CTLFLAG_RD | CTLFLAG_MPSAFE, sysctl_kern_proc, "Process table");
2699 static SYSCTL_NODE(_kern_proc, (KERN_PROC_RUID | KERN_PROC_INC_THREAD), ruid_td,
2700 CTLFLAG_RD | CTLFLAG_MPSAFE, sysctl_kern_proc, "Process table");
2702 static SYSCTL_NODE(_kern_proc, (KERN_PROC_PID | KERN_PROC_INC_THREAD), pid_td,
2703 CTLFLAG_RD | CTLFLAG_MPSAFE, sysctl_kern_proc, "Process table");
2705 static SYSCTL_NODE(_kern_proc, (KERN_PROC_PROC | KERN_PROC_INC_THREAD), proc_td,
2706 CTLFLAG_RD | CTLFLAG_MPSAFE, sysctl_kern_proc,
2707 "Return process table, no threads");
2709 #ifdef COMPAT_FREEBSD7
2710 static SYSCTL_NODE(_kern_proc, KERN_PROC_OVMMAP, ovmmap, CTLFLAG_RD |
2711 CTLFLAG_MPSAFE, sysctl_kern_proc_ovmmap, "Old Process vm map entries");
2714 static SYSCTL_NODE(_kern_proc, KERN_PROC_VMMAP, vmmap, CTLFLAG_RD |
2715 CTLFLAG_MPSAFE, sysctl_kern_proc_vmmap, "Process vm map entries");
2717 #if defined(STACK) || defined(DDB)
2718 static SYSCTL_NODE(_kern_proc, KERN_PROC_KSTACK, kstack, CTLFLAG_RD |
2719 CTLFLAG_MPSAFE, sysctl_kern_proc_kstack, "Process kernel stacks");
2722 static SYSCTL_NODE(_kern_proc, KERN_PROC_GROUPS, groups, CTLFLAG_RD |
2723 CTLFLAG_MPSAFE, sysctl_kern_proc_groups, "Process groups");
2725 static SYSCTL_NODE(_kern_proc, KERN_PROC_RLIMIT, rlimit, CTLFLAG_RW |
2726 CTLFLAG_ANYBODY | CTLFLAG_MPSAFE, sysctl_kern_proc_rlimit,
2727 "Process resource limits");
2729 static SYSCTL_NODE(_kern_proc, KERN_PROC_PS_STRINGS, ps_strings, CTLFLAG_RD |
2730 CTLFLAG_MPSAFE, sysctl_kern_proc_ps_strings,
2731 "Process ps_strings location");
2733 static SYSCTL_NODE(_kern_proc, KERN_PROC_UMASK, umask, CTLFLAG_RD |
2734 CTLFLAG_MPSAFE, sysctl_kern_proc_umask, "Process umask");
2736 static SYSCTL_NODE(_kern_proc, KERN_PROC_OSREL, osrel, CTLFLAG_RW |
2737 CTLFLAG_ANYBODY | CTLFLAG_MPSAFE, sysctl_kern_proc_osrel,
2738 "Process binary osreldate");