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_ktrace.h"
38 #include "opt_kstack_pages.h"
39 #include "opt_stack.h"
41 #include <sys/param.h>
42 #include <sys/systm.h>
45 #include <sys/kernel.h>
46 #include <sys/limits.h>
48 #include <sys/loginclass.h>
49 #include <sys/malloc.h>
51 #include <sys/mount.h>
52 #include <sys/mutex.h>
54 #include <sys/ptrace.h>
55 #include <sys/refcount.h>
56 #include <sys/resourcevar.h>
57 #include <sys/rwlock.h>
59 #include <sys/sysent.h>
60 #include <sys/sched.h>
62 #include <sys/stack.h>
64 #include <sys/sysctl.h>
65 #include <sys/filedesc.h>
67 #include <sys/signalvar.h>
72 #include <sys/vnode.h>
73 #include <sys/eventhandler.h>
80 #include <vm/vm_param.h>
81 #include <vm/vm_extern.h>
83 #include <vm/vm_map.h>
84 #include <vm/vm_object.h>
85 #include <vm/vm_page.h>
88 #ifdef COMPAT_FREEBSD32
89 #include <compat/freebsd32/freebsd32.h>
90 #include <compat/freebsd32/freebsd32_util.h>
93 SDT_PROVIDER_DEFINE(proc);
94 SDT_PROBE_DEFINE4(proc, kernel, ctor, entry, "struct proc *", "int",
96 SDT_PROBE_DEFINE4(proc, kernel, ctor, return, "struct proc *", "int",
98 SDT_PROBE_DEFINE4(proc, kernel, dtor, entry, "struct proc *", "int",
99 "void *", "struct thread *");
100 SDT_PROBE_DEFINE3(proc, kernel, dtor, return, "struct proc *", "int",
102 SDT_PROBE_DEFINE3(proc, kernel, init, entry, "struct proc *", "int",
104 SDT_PROBE_DEFINE3(proc, kernel, init, return, "struct proc *", "int",
107 MALLOC_DEFINE(M_PGRP, "pgrp", "process group header");
108 MALLOC_DEFINE(M_SESSION, "session", "session header");
109 static MALLOC_DEFINE(M_PROC, "proc", "Proc structures");
110 MALLOC_DEFINE(M_SUBPROC, "subproc", "Proc sub-structures");
112 static void doenterpgrp(struct proc *, struct pgrp *);
113 static void orphanpg(struct pgrp *pg);
114 static void fill_kinfo_aggregate(struct proc *p, struct kinfo_proc *kp);
115 static void fill_kinfo_proc_only(struct proc *p, struct kinfo_proc *kp);
116 static void fill_kinfo_thread(struct thread *td, struct kinfo_proc *kp,
118 static void pgadjustjobc(struct pgrp *pgrp, int entering);
119 static void pgdelete(struct pgrp *);
120 static int proc_ctor(void *mem, int size, void *arg, int flags);
121 static void proc_dtor(void *mem, int size, void *arg);
122 static int proc_init(void *mem, int size, int flags);
123 static void proc_fini(void *mem, int size);
124 static void pargs_free(struct pargs *pa);
125 static struct proc *zpfind_locked(pid_t pid);
128 * Other process lists
130 struct pidhashhead *pidhashtbl;
132 struct pgrphashhead *pgrphashtbl;
134 struct proclist allproc;
135 struct proclist zombproc;
136 struct sx allproc_lock;
137 struct sx proctree_lock;
138 struct mtx ppeers_lock;
139 uma_zone_t proc_zone;
141 int kstack_pages = KSTACK_PAGES;
142 SYSCTL_INT(_kern, OID_AUTO, kstack_pages, CTLFLAG_RD, &kstack_pages, 0,
143 "Kernel stack size in pages");
144 static int vmmap_skip_res_cnt = 0;
145 SYSCTL_INT(_kern, OID_AUTO, proc_vmmap_skip_resident_count, CTLFLAG_RW,
146 &vmmap_skip_res_cnt, 0,
147 "Skip calculation of the pages resident count in kern.proc.vmmap");
149 CTASSERT(sizeof(struct kinfo_proc) == KINFO_PROC_SIZE);
150 #ifdef COMPAT_FREEBSD32
151 CTASSERT(sizeof(struct kinfo_proc32) == KINFO_PROC32_SIZE);
155 * Initialize global process hashing structures.
161 sx_init(&allproc_lock, "allproc");
162 sx_init(&proctree_lock, "proctree");
163 mtx_init(&ppeers_lock, "p_peers", NULL, MTX_DEF);
165 LIST_INIT(&zombproc);
166 pidhashtbl = hashinit(maxproc / 4, M_PROC, &pidhash);
167 pgrphashtbl = hashinit(maxproc / 4, M_PROC, &pgrphash);
168 proc_zone = uma_zcreate("PROC", sched_sizeof_proc(),
169 proc_ctor, proc_dtor, proc_init, proc_fini,
170 UMA_ALIGN_PTR, UMA_ZONE_NOFREE);
175 * Prepare a proc for use.
178 proc_ctor(void *mem, int size, void *arg, int flags)
182 p = (struct proc *)mem;
183 SDT_PROBE(proc, kernel, ctor , entry, p, size, arg, flags, 0);
184 EVENTHANDLER_INVOKE(process_ctor, p);
185 SDT_PROBE(proc, kernel, ctor , return, p, size, arg, flags, 0);
190 * Reclaim a proc after use.
193 proc_dtor(void *mem, int size, void *arg)
198 /* INVARIANTS checks go here */
199 p = (struct proc *)mem;
200 td = FIRST_THREAD_IN_PROC(p);
201 SDT_PROBE(proc, kernel, dtor, entry, p, size, arg, td, 0);
204 KASSERT((p->p_numthreads == 1),
205 ("bad number of threads in exiting process"));
206 KASSERT(STAILQ_EMPTY(&p->p_ktr), ("proc_dtor: non-empty p_ktr"));
208 /* Free all OSD associated to this thread. */
211 EVENTHANDLER_INVOKE(process_dtor, p);
212 if (p->p_ksi != NULL)
213 KASSERT(! KSI_ONQ(p->p_ksi), ("SIGCHLD queue"));
214 SDT_PROBE(proc, kernel, dtor, return, p, size, arg, 0, 0);
218 * Initialize type-stable parts of a proc (when newly created).
221 proc_init(void *mem, int size, int flags)
225 p = (struct proc *)mem;
226 SDT_PROBE(proc, kernel, init, entry, p, size, flags, 0, 0);
227 p->p_sched = (struct p_sched *)&p[1];
228 bzero(&p->p_mtx, sizeof(struct mtx));
229 mtx_init(&p->p_mtx, "process lock", NULL, MTX_DEF | MTX_DUPOK);
230 mtx_init(&p->p_slock, "process slock", NULL, MTX_SPIN);
231 mtx_init(&p->p_statmtx, "pstatl", NULL, MTX_SPIN);
232 mtx_init(&p->p_itimmtx, "pitiml", NULL, MTX_SPIN);
233 mtx_init(&p->p_profmtx, "pprofl", NULL, MTX_SPIN);
234 cv_init(&p->p_pwait, "ppwait");
235 cv_init(&p->p_dbgwait, "dbgwait");
236 TAILQ_INIT(&p->p_threads); /* all threads in proc */
237 EVENTHANDLER_INVOKE(process_init, p);
238 p->p_stats = pstats_alloc();
239 SDT_PROBE(proc, kernel, init, return, p, size, flags, 0, 0);
244 * UMA should ensure that this function is never called.
245 * Freeing a proc structure would violate type stability.
248 proc_fini(void *mem, int size)
253 p = (struct proc *)mem;
254 EVENTHANDLER_INVOKE(process_fini, p);
255 pstats_free(p->p_stats);
256 thread_free(FIRST_THREAD_IN_PROC(p));
257 mtx_destroy(&p->p_mtx);
258 if (p->p_ksi != NULL)
259 ksiginfo_free(p->p_ksi);
261 panic("proc reclaimed");
266 * Is p an inferior of the current process?
269 inferior(struct proc *p)
272 sx_assert(&proctree_lock, SX_LOCKED);
273 PROC_LOCK_ASSERT(p, MA_OWNED);
274 for (; p != curproc; p = proc_realparent(p)) {
282 pfind_locked(pid_t pid)
286 sx_assert(&allproc_lock, SX_LOCKED);
287 LIST_FOREACH(p, PIDHASH(pid), p_hash) {
288 if (p->p_pid == pid) {
290 if (p->p_state == PRS_NEW) {
301 * Locate a process by number; return only "live" processes -- i.e., neither
302 * zombies nor newly born but incompletely initialized processes. By not
303 * returning processes in the PRS_NEW state, we allow callers to avoid
304 * testing for that condition to avoid dereferencing p_ucred, et al.
311 sx_slock(&allproc_lock);
312 p = pfind_locked(pid);
313 sx_sunlock(&allproc_lock);
318 pfind_tid_locked(pid_t tid)
323 sx_assert(&allproc_lock, SX_LOCKED);
324 FOREACH_PROC_IN_SYSTEM(p) {
326 if (p->p_state == PRS_NEW) {
330 FOREACH_THREAD_IN_PROC(p, td) {
331 if (td->td_tid == tid)
341 * Locate a process group by number.
342 * The caller must hold proctree_lock.
348 register struct pgrp *pgrp;
350 sx_assert(&proctree_lock, SX_LOCKED);
352 LIST_FOREACH(pgrp, PGRPHASH(pgid), pg_hash) {
353 if (pgrp->pg_id == pgid) {
362 * Locate process and do additional manipulations, depending on flags.
365 pget(pid_t pid, int flags, struct proc **pp)
370 sx_slock(&allproc_lock);
371 if (pid <= PID_MAX) {
372 p = pfind_locked(pid);
373 if (p == NULL && (flags & PGET_NOTWEXIT) == 0)
374 p = zpfind_locked(pid);
375 } else if ((flags & PGET_NOTID) == 0) {
376 p = pfind_tid_locked(pid);
380 sx_sunlock(&allproc_lock);
383 if ((flags & PGET_CANSEE) != 0) {
384 error = p_cansee(curthread, p);
388 if ((flags & PGET_CANDEBUG) != 0) {
389 error = p_candebug(curthread, p);
393 if ((flags & PGET_ISCURRENT) != 0 && curproc != p) {
397 if ((flags & PGET_NOTWEXIT) != 0 && (p->p_flag & P_WEXIT) != 0) {
401 if ((flags & PGET_NOTINEXEC) != 0 && (p->p_flag & P_INEXEC) != 0) {
403 * XXXRW: Not clear ESRCH is the right error during proc
409 if ((flags & PGET_HOLD) != 0) {
421 * Create a new process group.
422 * pgid must be equal to the pid of p.
423 * Begin a new session if required.
426 enterpgrp(p, pgid, pgrp, sess)
427 register struct proc *p;
430 struct session *sess;
433 sx_assert(&proctree_lock, SX_XLOCKED);
435 KASSERT(pgrp != NULL, ("enterpgrp: pgrp == NULL"));
436 KASSERT(p->p_pid == pgid,
437 ("enterpgrp: new pgrp and pid != pgid"));
438 KASSERT(pgfind(pgid) == NULL,
439 ("enterpgrp: pgrp with pgid exists"));
440 KASSERT(!SESS_LEADER(p),
441 ("enterpgrp: session leader attempted setpgrp"));
443 mtx_init(&pgrp->pg_mtx, "process group", NULL, MTX_DEF | MTX_DUPOK);
449 mtx_init(&sess->s_mtx, "session", NULL, MTX_DEF);
451 p->p_flag &= ~P_CONTROLT;
455 sess->s_sid = p->p_pid;
456 refcount_init(&sess->s_count, 1);
457 sess->s_ttyvp = NULL;
458 sess->s_ttydp = NULL;
460 bcopy(p->p_session->s_login, sess->s_login,
461 sizeof(sess->s_login));
462 pgrp->pg_session = sess;
463 KASSERT(p == curproc,
464 ("enterpgrp: mksession and p != curproc"));
466 pgrp->pg_session = p->p_session;
467 sess_hold(pgrp->pg_session);
471 LIST_INIT(&pgrp->pg_members);
474 * As we have an exclusive lock of proctree_lock,
475 * this should not deadlock.
477 LIST_INSERT_HEAD(PGRPHASH(pgid), pgrp, pg_hash);
479 SLIST_INIT(&pgrp->pg_sigiolst);
482 doenterpgrp(p, pgrp);
488 * Move p to an existing process group
491 enterthispgrp(p, pgrp)
492 register struct proc *p;
496 sx_assert(&proctree_lock, SX_XLOCKED);
497 PROC_LOCK_ASSERT(p, MA_NOTOWNED);
498 PGRP_LOCK_ASSERT(pgrp, MA_NOTOWNED);
499 PGRP_LOCK_ASSERT(p->p_pgrp, MA_NOTOWNED);
500 SESS_LOCK_ASSERT(p->p_session, MA_NOTOWNED);
501 KASSERT(pgrp->pg_session == p->p_session,
502 ("%s: pgrp's session %p, p->p_session %p.\n",
506 KASSERT(pgrp != p->p_pgrp,
507 ("%s: p belongs to pgrp.", __func__));
509 doenterpgrp(p, pgrp);
515 * Move p to a process group
522 struct pgrp *savepgrp;
524 sx_assert(&proctree_lock, SX_XLOCKED);
525 PROC_LOCK_ASSERT(p, MA_NOTOWNED);
526 PGRP_LOCK_ASSERT(pgrp, MA_NOTOWNED);
527 PGRP_LOCK_ASSERT(p->p_pgrp, MA_NOTOWNED);
528 SESS_LOCK_ASSERT(p->p_session, MA_NOTOWNED);
530 savepgrp = p->p_pgrp;
533 * Adjust eligibility of affected pgrps to participate in job control.
534 * Increment eligibility counts before decrementing, otherwise we
535 * could reach 0 spuriously during the first call.
538 fixjobc(p, p->p_pgrp, 0);
543 LIST_REMOVE(p, p_pglist);
546 LIST_INSERT_HEAD(&pgrp->pg_members, p, p_pglist);
547 PGRP_UNLOCK(savepgrp);
549 if (LIST_EMPTY(&savepgrp->pg_members))
554 * remove process from process group
558 register struct proc *p;
560 struct pgrp *savepgrp;
562 sx_assert(&proctree_lock, SX_XLOCKED);
563 savepgrp = p->p_pgrp;
566 LIST_REMOVE(p, p_pglist);
569 PGRP_UNLOCK(savepgrp);
570 if (LIST_EMPTY(&savepgrp->pg_members))
576 * delete a process group
580 register struct pgrp *pgrp;
582 struct session *savesess;
585 sx_assert(&proctree_lock, SX_XLOCKED);
586 PGRP_LOCK_ASSERT(pgrp, MA_NOTOWNED);
587 SESS_LOCK_ASSERT(pgrp->pg_session, MA_NOTOWNED);
590 * Reset any sigio structures pointing to us as a result of
591 * F_SETOWN with our pgid.
593 funsetownlst(&pgrp->pg_sigiolst);
596 tp = pgrp->pg_session->s_ttyp;
597 LIST_REMOVE(pgrp, pg_hash);
598 savesess = pgrp->pg_session;
601 /* Remove the reference to the pgrp before deallocating it. */
604 tty_rel_pgrp(tp, pgrp);
607 mtx_destroy(&pgrp->pg_mtx);
609 sess_release(savesess);
613 pgadjustjobc(pgrp, entering)
623 if (pgrp->pg_jobc == 0)
630 * Adjust pgrp jobc counters when specified process changes process group.
631 * We count the number of processes in each process group that "qualify"
632 * the group for terminal job control (those with a parent in a different
633 * process group of the same session). If that count reaches zero, the
634 * process group becomes orphaned. Check both the specified process'
635 * process group and that of its children.
636 * entering == 0 => p is leaving specified group.
637 * entering == 1 => p is entering specified group.
640 fixjobc(p, pgrp, entering)
641 register struct proc *p;
642 register struct pgrp *pgrp;
645 register struct pgrp *hispgrp;
646 register struct session *mysession;
648 sx_assert(&proctree_lock, SX_LOCKED);
649 PROC_LOCK_ASSERT(p, MA_NOTOWNED);
650 PGRP_LOCK_ASSERT(pgrp, MA_NOTOWNED);
651 SESS_LOCK_ASSERT(pgrp->pg_session, MA_NOTOWNED);
654 * Check p's parent to see whether p qualifies its own process
655 * group; if so, adjust count for p's process group.
657 mysession = pgrp->pg_session;
658 if ((hispgrp = p->p_pptr->p_pgrp) != pgrp &&
659 hispgrp->pg_session == mysession)
660 pgadjustjobc(pgrp, entering);
663 * Check this process' children to see whether they qualify
664 * their process groups; if so, adjust counts for children's
667 LIST_FOREACH(p, &p->p_children, p_sibling) {
669 if (hispgrp == pgrp ||
670 hispgrp->pg_session != mysession)
673 if (p->p_state == PRS_ZOMBIE) {
678 pgadjustjobc(hispgrp, entering);
683 * A process group has become orphaned;
684 * if there are any stopped processes in the group,
685 * hang-up all process in that group.
691 register struct proc *p;
693 PGRP_LOCK_ASSERT(pg, MA_OWNED);
695 LIST_FOREACH(p, &pg->pg_members, p_pglist) {
697 if (P_SHOULDSTOP(p)) {
699 LIST_FOREACH(p, &pg->pg_members, p_pglist) {
701 kern_psignal(p, SIGHUP);
702 kern_psignal(p, SIGCONT);
712 sess_hold(struct session *s)
715 refcount_acquire(&s->s_count);
719 sess_release(struct session *s)
722 if (refcount_release(&s->s_count)) {
723 if (s->s_ttyp != NULL) {
725 tty_rel_sess(s->s_ttyp, s);
727 mtx_destroy(&s->s_mtx);
734 DB_SHOW_COMMAND(pgrpdump, pgrpdump)
736 register struct pgrp *pgrp;
737 register struct proc *p;
740 for (i = 0; i <= pgrphash; i++) {
741 if (!LIST_EMPTY(&pgrphashtbl[i])) {
742 printf("\tindx %d\n", i);
743 LIST_FOREACH(pgrp, &pgrphashtbl[i], pg_hash) {
745 "\tpgrp %p, pgid %ld, sess %p, sesscnt %d, mem %p\n",
746 (void *)pgrp, (long)pgrp->pg_id,
747 (void *)pgrp->pg_session,
748 pgrp->pg_session->s_count,
749 (void *)LIST_FIRST(&pgrp->pg_members));
750 LIST_FOREACH(p, &pgrp->pg_members, p_pglist) {
751 printf("\t\tpid %ld addr %p pgrp %p\n",
752 (long)p->p_pid, (void *)p,
762 * Calculate the kinfo_proc members which contain process-wide
764 * Must be called with the target process locked.
767 fill_kinfo_aggregate(struct proc *p, struct kinfo_proc *kp)
771 PROC_LOCK_ASSERT(p, MA_OWNED);
775 FOREACH_THREAD_IN_PROC(p, td) {
777 kp->ki_pctcpu += sched_pctcpu(td);
778 kp->ki_estcpu += td->td_estcpu;
784 * Clear kinfo_proc and fill in any information that is common
785 * to all threads in the process.
786 * Must be called with the target process locked.
789 fill_kinfo_proc_only(struct proc *p, struct kinfo_proc *kp)
797 /* For proc_realparent. */
798 sx_assert(&proctree_lock, SX_LOCKED);
799 PROC_LOCK_ASSERT(p, MA_OWNED);
800 bzero(kp, sizeof(*kp));
802 kp->ki_structsize = sizeof(*kp);
804 kp->ki_addr =/* p->p_addr; */0; /* XXX */
805 kp->ki_args = p->p_args;
806 kp->ki_textvp = p->p_textvp;
808 kp->ki_tracep = p->p_tracevp;
809 kp->ki_traceflag = p->p_traceflag;
812 kp->ki_vmspace = p->p_vmspace;
813 kp->ki_flag = p->p_flag;
814 kp->ki_flag2 = p->p_flag2;
817 kp->ki_uid = cred->cr_uid;
818 kp->ki_ruid = cred->cr_ruid;
819 kp->ki_svuid = cred->cr_svuid;
821 if (cred->cr_flags & CRED_FLAG_CAPMODE)
822 kp->ki_cr_flags |= KI_CRF_CAPABILITY_MODE;
823 /* XXX bde doesn't like KI_NGROUPS */
824 if (cred->cr_ngroups > KI_NGROUPS) {
825 kp->ki_ngroups = KI_NGROUPS;
826 kp->ki_cr_flags |= KI_CRF_GRP_OVERFLOW;
828 kp->ki_ngroups = cred->cr_ngroups;
829 bcopy(cred->cr_groups, kp->ki_groups,
830 kp->ki_ngroups * sizeof(gid_t));
831 kp->ki_rgid = cred->cr_rgid;
832 kp->ki_svgid = cred->cr_svgid;
833 /* If jailed(cred), emulate the old P_JAILED flag. */
835 kp->ki_flag |= P_JAILED;
836 /* If inside the jail, use 0 as a jail ID. */
837 if (cred->cr_prison != curthread->td_ucred->cr_prison)
838 kp->ki_jid = cred->cr_prison->pr_id;
840 strlcpy(kp->ki_loginclass, cred->cr_loginclass->lc_name,
841 sizeof(kp->ki_loginclass));
845 mtx_lock(&ps->ps_mtx);
846 kp->ki_sigignore = ps->ps_sigignore;
847 kp->ki_sigcatch = ps->ps_sigcatch;
848 mtx_unlock(&ps->ps_mtx);
850 if (p->p_state != PRS_NEW &&
851 p->p_state != PRS_ZOMBIE &&
852 p->p_vmspace != NULL) {
853 struct vmspace *vm = p->p_vmspace;
855 kp->ki_size = vm->vm_map.size;
856 kp->ki_rssize = vmspace_resident_count(vm); /*XXX*/
857 FOREACH_THREAD_IN_PROC(p, td0) {
858 if (!TD_IS_SWAPPED(td0))
859 kp->ki_rssize += td0->td_kstack_pages;
861 kp->ki_swrss = vm->vm_swrss;
862 kp->ki_tsize = vm->vm_tsize;
863 kp->ki_dsize = vm->vm_dsize;
864 kp->ki_ssize = vm->vm_ssize;
865 } else if (p->p_state == PRS_ZOMBIE)
867 if (kp->ki_flag & P_INMEM)
868 kp->ki_sflag = PS_INMEM;
871 /* Calculate legacy swtime as seconds since 'swtick'. */
872 kp->ki_swtime = (ticks - p->p_swtick) / hz;
873 kp->ki_pid = p->p_pid;
874 kp->ki_nice = p->p_nice;
875 kp->ki_fibnum = p->p_fibnum;
876 kp->ki_start = p->p_stats->p_start;
877 timevaladd(&kp->ki_start, &boottime);
879 rufetch(p, &kp->ki_rusage);
880 kp->ki_runtime = cputick2usec(p->p_rux.rux_runtime);
881 calcru(p, &kp->ki_rusage.ru_utime, &kp->ki_rusage.ru_stime);
883 calccru(p, &kp->ki_childutime, &kp->ki_childstime);
884 /* Some callers want child times in a single value. */
885 kp->ki_childtime = kp->ki_childstime;
886 timevaladd(&kp->ki_childtime, &kp->ki_childutime);
888 FOREACH_THREAD_IN_PROC(p, td0)
889 kp->ki_cow += td0->td_cow;
893 kp->ki_pgid = p->p_pgrp->pg_id;
894 kp->ki_jobc = p->p_pgrp->pg_jobc;
895 sp = p->p_pgrp->pg_session;
898 kp->ki_sid = sp->s_sid;
900 strlcpy(kp->ki_login, sp->s_login,
901 sizeof(kp->ki_login));
903 kp->ki_kiflag |= KI_CTTY;
905 kp->ki_kiflag |= KI_SLEADER;
906 /* XXX proctree_lock */
911 if ((p->p_flag & P_CONTROLT) && tp != NULL) {
912 kp->ki_tdev = tty_udev(tp);
913 kp->ki_tpgid = tp->t_pgrp ? tp->t_pgrp->pg_id : NO_PID;
915 kp->ki_tsid = tp->t_session->s_sid;
918 if (p->p_comm[0] != '\0')
919 strlcpy(kp->ki_comm, p->p_comm, sizeof(kp->ki_comm));
920 if (p->p_sysent && p->p_sysent->sv_name != NULL &&
921 p->p_sysent->sv_name[0] != '\0')
922 strlcpy(kp->ki_emul, p->p_sysent->sv_name, sizeof(kp->ki_emul));
923 kp->ki_siglist = p->p_siglist;
924 kp->ki_xstat = p->p_xstat;
925 kp->ki_acflag = p->p_acflag;
926 kp->ki_lock = p->p_lock;
928 kp->ki_ppid = proc_realparent(p)->p_pid;
929 if (p->p_flag & P_TRACED)
930 kp->ki_tracer = p->p_pptr->p_pid;
935 * Fill in information that is thread specific. Must be called with
936 * target process locked. If 'preferthread' is set, overwrite certain
937 * process-related fields that are maintained for both threads and
941 fill_kinfo_thread(struct thread *td, struct kinfo_proc *kp, int preferthread)
947 PROC_LOCK_ASSERT(p, MA_OWNED);
952 if (td->td_wmesg != NULL)
953 strlcpy(kp->ki_wmesg, td->td_wmesg, sizeof(kp->ki_wmesg));
955 bzero(kp->ki_wmesg, sizeof(kp->ki_wmesg));
956 strlcpy(kp->ki_tdname, td->td_name, sizeof(kp->ki_tdname));
957 if (TD_ON_LOCK(td)) {
958 kp->ki_kiflag |= KI_LOCKBLOCK;
959 strlcpy(kp->ki_lockname, td->td_lockname,
960 sizeof(kp->ki_lockname));
962 kp->ki_kiflag &= ~KI_LOCKBLOCK;
963 bzero(kp->ki_lockname, sizeof(kp->ki_lockname));
966 if (p->p_state == PRS_NORMAL) { /* approximate. */
967 if (TD_ON_RUNQ(td) ||
971 } else if (P_SHOULDSTOP(p)) {
973 } else if (TD_IS_SLEEPING(td)) {
974 kp->ki_stat = SSLEEP;
975 } else if (TD_ON_LOCK(td)) {
980 } else if (p->p_state == PRS_ZOMBIE) {
986 /* Things in the thread */
987 kp->ki_wchan = td->td_wchan;
988 kp->ki_pri.pri_level = td->td_priority;
989 kp->ki_pri.pri_native = td->td_base_pri;
992 * Note: legacy fields; clamp at the old NOCPU value and/or
993 * the maximum u_char CPU value.
995 if (td->td_lastcpu == NOCPU)
996 kp->ki_lastcpu_old = NOCPU_OLD;
997 else if (td->td_lastcpu > MAXCPU_OLD)
998 kp->ki_lastcpu_old = MAXCPU_OLD;
1000 kp->ki_lastcpu_old = td->td_lastcpu;
1002 if (td->td_oncpu == NOCPU)
1003 kp->ki_oncpu_old = NOCPU_OLD;
1004 else if (td->td_oncpu > MAXCPU_OLD)
1005 kp->ki_oncpu_old = MAXCPU_OLD;
1007 kp->ki_oncpu_old = td->td_oncpu;
1009 kp->ki_lastcpu = td->td_lastcpu;
1010 kp->ki_oncpu = td->td_oncpu;
1011 kp->ki_tdflags = td->td_flags;
1012 kp->ki_tid = td->td_tid;
1013 kp->ki_numthreads = p->p_numthreads;
1014 kp->ki_pcb = td->td_pcb;
1015 kp->ki_kstack = (void *)td->td_kstack;
1016 kp->ki_slptime = (ticks - td->td_slptick) / hz;
1017 kp->ki_pri.pri_class = td->td_pri_class;
1018 kp->ki_pri.pri_user = td->td_user_pri;
1021 rufetchtd(td, &kp->ki_rusage);
1022 kp->ki_runtime = cputick2usec(td->td_rux.rux_runtime);
1023 kp->ki_pctcpu = sched_pctcpu(td);
1024 kp->ki_estcpu = td->td_estcpu;
1025 kp->ki_cow = td->td_cow;
1028 /* We can't get this anymore but ps etc never used it anyway. */
1032 kp->ki_siglist = td->td_siglist;
1033 kp->ki_sigmask = td->td_sigmask;
1040 * Fill in a kinfo_proc structure for the specified process.
1041 * Must be called with the target process locked.
1044 fill_kinfo_proc(struct proc *p, struct kinfo_proc *kp)
1047 MPASS(FIRST_THREAD_IN_PROC(p) != NULL);
1049 fill_kinfo_proc_only(p, kp);
1050 fill_kinfo_thread(FIRST_THREAD_IN_PROC(p), kp, 0);
1051 fill_kinfo_aggregate(p, kp);
1058 return (malloc(sizeof(struct pstats), M_SUBPROC, M_ZERO|M_WAITOK));
1062 * Copy parts of p_stats; zero the rest of p_stats (statistics).
1065 pstats_fork(struct pstats *src, struct pstats *dst)
1068 bzero(&dst->pstat_startzero,
1069 __rangeof(struct pstats, pstat_startzero, pstat_endzero));
1070 bcopy(&src->pstat_startcopy, &dst->pstat_startcopy,
1071 __rangeof(struct pstats, pstat_startcopy, pstat_endcopy));
1075 pstats_free(struct pstats *ps)
1078 free(ps, M_SUBPROC);
1081 static struct proc *
1082 zpfind_locked(pid_t pid)
1086 sx_assert(&allproc_lock, SX_LOCKED);
1087 LIST_FOREACH(p, &zombproc, p_list) {
1088 if (p->p_pid == pid) {
1097 * Locate a zombie process by number
1104 sx_slock(&allproc_lock);
1105 p = zpfind_locked(pid);
1106 sx_sunlock(&allproc_lock);
1110 #ifdef COMPAT_FREEBSD32
1113 * This function is typically used to copy out the kernel address, so
1114 * it can be replaced by assignment of zero.
1116 static inline uint32_t
1117 ptr32_trim(void *ptr)
1121 uptr = (uintptr_t)ptr;
1122 return ((uptr > UINT_MAX) ? 0 : uptr);
1125 #define PTRTRIM_CP(src,dst,fld) \
1126 do { (dst).fld = ptr32_trim((src).fld); } while (0)
1129 freebsd32_kinfo_proc_out(const struct kinfo_proc *ki, struct kinfo_proc32 *ki32)
1133 bzero(ki32, sizeof(struct kinfo_proc32));
1134 ki32->ki_structsize = sizeof(struct kinfo_proc32);
1135 CP(*ki, *ki32, ki_layout);
1136 PTRTRIM_CP(*ki, *ki32, ki_args);
1137 PTRTRIM_CP(*ki, *ki32, ki_paddr);
1138 PTRTRIM_CP(*ki, *ki32, ki_addr);
1139 PTRTRIM_CP(*ki, *ki32, ki_tracep);
1140 PTRTRIM_CP(*ki, *ki32, ki_textvp);
1141 PTRTRIM_CP(*ki, *ki32, ki_fd);
1142 PTRTRIM_CP(*ki, *ki32, ki_vmspace);
1143 PTRTRIM_CP(*ki, *ki32, ki_wchan);
1144 CP(*ki, *ki32, ki_pid);
1145 CP(*ki, *ki32, ki_ppid);
1146 CP(*ki, *ki32, ki_pgid);
1147 CP(*ki, *ki32, ki_tpgid);
1148 CP(*ki, *ki32, ki_sid);
1149 CP(*ki, *ki32, ki_tsid);
1150 CP(*ki, *ki32, ki_jobc);
1151 CP(*ki, *ki32, ki_tdev);
1152 CP(*ki, *ki32, ki_siglist);
1153 CP(*ki, *ki32, ki_sigmask);
1154 CP(*ki, *ki32, ki_sigignore);
1155 CP(*ki, *ki32, ki_sigcatch);
1156 CP(*ki, *ki32, ki_uid);
1157 CP(*ki, *ki32, ki_ruid);
1158 CP(*ki, *ki32, ki_svuid);
1159 CP(*ki, *ki32, ki_rgid);
1160 CP(*ki, *ki32, ki_svgid);
1161 CP(*ki, *ki32, ki_ngroups);
1162 for (i = 0; i < KI_NGROUPS; i++)
1163 CP(*ki, *ki32, ki_groups[i]);
1164 CP(*ki, *ki32, ki_size);
1165 CP(*ki, *ki32, ki_rssize);
1166 CP(*ki, *ki32, ki_swrss);
1167 CP(*ki, *ki32, ki_tsize);
1168 CP(*ki, *ki32, ki_dsize);
1169 CP(*ki, *ki32, ki_ssize);
1170 CP(*ki, *ki32, ki_xstat);
1171 CP(*ki, *ki32, ki_acflag);
1172 CP(*ki, *ki32, ki_pctcpu);
1173 CP(*ki, *ki32, ki_estcpu);
1174 CP(*ki, *ki32, ki_slptime);
1175 CP(*ki, *ki32, ki_swtime);
1176 CP(*ki, *ki32, ki_cow);
1177 CP(*ki, *ki32, ki_runtime);
1178 TV_CP(*ki, *ki32, ki_start);
1179 TV_CP(*ki, *ki32, ki_childtime);
1180 CP(*ki, *ki32, ki_flag);
1181 CP(*ki, *ki32, ki_kiflag);
1182 CP(*ki, *ki32, ki_traceflag);
1183 CP(*ki, *ki32, ki_stat);
1184 CP(*ki, *ki32, ki_nice);
1185 CP(*ki, *ki32, ki_lock);
1186 CP(*ki, *ki32, ki_rqindex);
1187 CP(*ki, *ki32, ki_oncpu);
1188 CP(*ki, *ki32, ki_lastcpu);
1190 /* XXX TODO: wrap cpu value as appropriate */
1191 CP(*ki, *ki32, ki_oncpu_old);
1192 CP(*ki, *ki32, ki_lastcpu_old);
1194 bcopy(ki->ki_tdname, ki32->ki_tdname, TDNAMLEN + 1);
1195 bcopy(ki->ki_wmesg, ki32->ki_wmesg, WMESGLEN + 1);
1196 bcopy(ki->ki_login, ki32->ki_login, LOGNAMELEN + 1);
1197 bcopy(ki->ki_lockname, ki32->ki_lockname, LOCKNAMELEN + 1);
1198 bcopy(ki->ki_comm, ki32->ki_comm, COMMLEN + 1);
1199 bcopy(ki->ki_emul, ki32->ki_emul, KI_EMULNAMELEN + 1);
1200 bcopy(ki->ki_loginclass, ki32->ki_loginclass, LOGINCLASSLEN + 1);
1201 CP(*ki, *ki32, ki_tracer);
1202 CP(*ki, *ki32, ki_flag2);
1203 CP(*ki, *ki32, ki_fibnum);
1204 CP(*ki, *ki32, ki_cr_flags);
1205 CP(*ki, *ki32, ki_jid);
1206 CP(*ki, *ki32, ki_numthreads);
1207 CP(*ki, *ki32, ki_tid);
1208 CP(*ki, *ki32, ki_pri);
1209 freebsd32_rusage_out(&ki->ki_rusage, &ki32->ki_rusage);
1210 freebsd32_rusage_out(&ki->ki_rusage_ch, &ki32->ki_rusage_ch);
1211 PTRTRIM_CP(*ki, *ki32, ki_pcb);
1212 PTRTRIM_CP(*ki, *ki32, ki_kstack);
1213 PTRTRIM_CP(*ki, *ki32, ki_udata);
1214 CP(*ki, *ki32, ki_sflag);
1215 CP(*ki, *ki32, ki_tdflags);
1220 kern_proc_out(struct proc *p, struct sbuf *sb, int flags)
1223 struct kinfo_proc ki;
1224 #ifdef COMPAT_FREEBSD32
1225 struct kinfo_proc32 ki32;
1229 PROC_LOCK_ASSERT(p, MA_OWNED);
1230 MPASS(FIRST_THREAD_IN_PROC(p) != NULL);
1233 fill_kinfo_proc(p, &ki);
1234 if ((flags & KERN_PROC_NOTHREADS) != 0) {
1235 #ifdef COMPAT_FREEBSD32
1236 if ((flags & KERN_PROC_MASK32) != 0) {
1237 freebsd32_kinfo_proc_out(&ki, &ki32);
1238 if (sbuf_bcat(sb, &ki32, sizeof(ki32)) != 0)
1242 if (sbuf_bcat(sb, &ki, sizeof(ki)) != 0)
1245 FOREACH_THREAD_IN_PROC(p, td) {
1246 fill_kinfo_thread(td, &ki, 1);
1247 #ifdef COMPAT_FREEBSD32
1248 if ((flags & KERN_PROC_MASK32) != 0) {
1249 freebsd32_kinfo_proc_out(&ki, &ki32);
1250 if (sbuf_bcat(sb, &ki32, sizeof(ki32)) != 0)
1254 if (sbuf_bcat(sb, &ki, sizeof(ki)) != 0)
1265 sysctl_out_proc(struct proc *p, struct sysctl_req *req, int flags,
1269 struct kinfo_proc ki;
1275 sbuf_new_for_sysctl(&sb, (char *)&ki, sizeof(ki), req);
1276 error = kern_proc_out(p, &sb, flags);
1277 error2 = sbuf_finish(&sb);
1281 else if (error2 != 0)
1301 sysctl_kern_proc(SYSCTL_HANDLER_ARGS)
1303 int *name = (int *)arg1;
1304 u_int namelen = arg2;
1306 int flags, doingzomb, oid_number;
1309 oid_number = oidp->oid_number;
1310 if (oid_number != KERN_PROC_ALL &&
1311 (oid_number & KERN_PROC_INC_THREAD) == 0)
1312 flags = KERN_PROC_NOTHREADS;
1315 oid_number &= ~KERN_PROC_INC_THREAD;
1317 #ifdef COMPAT_FREEBSD32
1318 if (req->flags & SCTL_MASK32)
1319 flags |= KERN_PROC_MASK32;
1321 if (oid_number == KERN_PROC_PID) {
1324 error = sysctl_wire_old_buffer(req, 0);
1327 sx_slock(&proctree_lock);
1328 error = pget((pid_t)name[0], PGET_CANSEE, &p);
1330 error = sysctl_out_proc(p, req, flags, 0);
1331 sx_sunlock(&proctree_lock);
1335 switch (oid_number) {
1340 case KERN_PROC_PROC:
1341 if (namelen != 0 && namelen != 1)
1351 /* overestimate by 5 procs */
1352 error = SYSCTL_OUT(req, 0, sizeof (struct kinfo_proc) * 5);
1356 error = sysctl_wire_old_buffer(req, 0);
1359 sx_slock(&proctree_lock);
1360 sx_slock(&allproc_lock);
1361 for (doingzomb=0 ; doingzomb < 2 ; doingzomb++) {
1363 p = LIST_FIRST(&allproc);
1365 p = LIST_FIRST(&zombproc);
1366 for (; p != 0; p = LIST_NEXT(p, p_list)) {
1368 * Skip embryonic processes.
1371 if (p->p_state == PRS_NEW) {
1375 KASSERT(p->p_ucred != NULL,
1376 ("process credential is NULL for non-NEW proc"));
1378 * Show a user only appropriate processes.
1380 if (p_cansee(curthread, p)) {
1385 * TODO - make more efficient (see notes below).
1388 switch (oid_number) {
1391 if (p->p_ucred->cr_gid != (gid_t)name[0]) {
1397 case KERN_PROC_PGRP:
1398 /* could do this by traversing pgrp */
1399 if (p->p_pgrp == NULL ||
1400 p->p_pgrp->pg_id != (pid_t)name[0]) {
1406 case KERN_PROC_RGID:
1407 if (p->p_ucred->cr_rgid != (gid_t)name[0]) {
1413 case KERN_PROC_SESSION:
1414 if (p->p_session == NULL ||
1415 p->p_session->s_sid != (pid_t)name[0]) {
1422 if ((p->p_flag & P_CONTROLT) == 0 ||
1423 p->p_session == NULL) {
1427 /* XXX proctree_lock */
1428 SESS_LOCK(p->p_session);
1429 if (p->p_session->s_ttyp == NULL ||
1430 tty_udev(p->p_session->s_ttyp) !=
1432 SESS_UNLOCK(p->p_session);
1436 SESS_UNLOCK(p->p_session);
1440 if (p->p_ucred->cr_uid != (uid_t)name[0]) {
1446 case KERN_PROC_RUID:
1447 if (p->p_ucred->cr_ruid != (uid_t)name[0]) {
1453 case KERN_PROC_PROC:
1461 error = sysctl_out_proc(p, req, flags, doingzomb);
1463 sx_sunlock(&allproc_lock);
1464 sx_sunlock(&proctree_lock);
1469 sx_sunlock(&allproc_lock);
1470 sx_sunlock(&proctree_lock);
1475 pargs_alloc(int len)
1479 pa = malloc(sizeof(struct pargs) + len, M_PARGS,
1481 refcount_init(&pa->ar_ref, 1);
1482 pa->ar_length = len;
1487 pargs_free(struct pargs *pa)
1494 pargs_hold(struct pargs *pa)
1499 refcount_acquire(&pa->ar_ref);
1503 pargs_drop(struct pargs *pa)
1508 if (refcount_release(&pa->ar_ref))
1513 proc_read_mem(struct thread *td, struct proc *p, vm_offset_t offset, void* buf,
1519 iov.iov_base = (caddr_t)buf;
1523 uio.uio_offset = offset;
1524 uio.uio_resid = (ssize_t)len;
1525 uio.uio_segflg = UIO_SYSSPACE;
1526 uio.uio_rw = UIO_READ;
1529 return (proc_rwmem(p, &uio));
1533 proc_read_string(struct thread *td, struct proc *p, const char *sptr, char *buf,
1539 error = proc_read_mem(td, p, (vm_offset_t)sptr, buf, len);
1541 * Reading the chunk may validly return EFAULT if the string is shorter
1542 * than the chunk and is aligned at the end of the page, assuming the
1543 * next page is not mapped. So if EFAULT is returned do a fallback to
1544 * one byte read loop.
1546 if (error == EFAULT) {
1547 for (i = 0; i < len; i++, buf++, sptr++) {
1548 error = proc_read_mem(td, p, (vm_offset_t)sptr, buf, 1);
1559 #define PROC_AUXV_MAX 256 /* Safety limit on auxv size. */
1561 enum proc_vector_type {
1567 #ifdef COMPAT_FREEBSD32
1569 get_proc_vector32(struct thread *td, struct proc *p, char ***proc_vectorp,
1570 size_t *vsizep, enum proc_vector_type type)
1572 struct freebsd32_ps_strings pss;
1574 vm_offset_t vptr, ptr;
1575 uint32_t *proc_vector32;
1580 error = proc_read_mem(td, p, (vm_offset_t)(p->p_sysent->sv_psstrings),
1586 vptr = (vm_offset_t)PTRIN(pss.ps_argvstr);
1587 vsize = pss.ps_nargvstr;
1588 if (vsize > ARG_MAX)
1590 size = vsize * sizeof(int32_t);
1593 vptr = (vm_offset_t)PTRIN(pss.ps_envstr);
1594 vsize = pss.ps_nenvstr;
1595 if (vsize > ARG_MAX)
1597 size = vsize * sizeof(int32_t);
1600 vptr = (vm_offset_t)PTRIN(pss.ps_envstr) +
1601 (pss.ps_nenvstr + 1) * sizeof(int32_t);
1604 for (ptr = vptr, i = 0; i < PROC_AUXV_MAX; i++) {
1605 error = proc_read_mem(td, p, ptr, &aux, sizeof(aux));
1608 if (aux.a_type == AT_NULL)
1612 if (aux.a_type != AT_NULL)
1615 size = vsize * sizeof(aux);
1618 KASSERT(0, ("Wrong proc vector type: %d", type));
1621 proc_vector32 = malloc(size, M_TEMP, M_WAITOK);
1622 error = proc_read_mem(td, p, vptr, proc_vector32, size);
1625 if (type == PROC_AUX) {
1626 *proc_vectorp = (char **)proc_vector32;
1630 proc_vector = malloc(vsize * sizeof(char *), M_TEMP, M_WAITOK);
1631 for (i = 0; i < (int)vsize; i++)
1632 proc_vector[i] = PTRIN(proc_vector32[i]);
1633 *proc_vectorp = proc_vector;
1636 free(proc_vector32, M_TEMP);
1642 get_proc_vector(struct thread *td, struct proc *p, char ***proc_vectorp,
1643 size_t *vsizep, enum proc_vector_type type)
1645 struct ps_strings pss;
1647 vm_offset_t vptr, ptr;
1652 #ifdef COMPAT_FREEBSD32
1653 if (SV_PROC_FLAG(p, SV_ILP32) != 0)
1654 return (get_proc_vector32(td, p, proc_vectorp, vsizep, type));
1656 error = proc_read_mem(td, p, (vm_offset_t)(p->p_sysent->sv_psstrings),
1662 vptr = (vm_offset_t)pss.ps_argvstr;
1663 vsize = pss.ps_nargvstr;
1664 if (vsize > ARG_MAX)
1666 size = vsize * sizeof(char *);
1669 vptr = (vm_offset_t)pss.ps_envstr;
1670 vsize = pss.ps_nenvstr;
1671 if (vsize > ARG_MAX)
1673 size = vsize * sizeof(char *);
1677 * The aux array is just above env array on the stack. Check
1678 * that the address is naturally aligned.
1680 vptr = (vm_offset_t)pss.ps_envstr + (pss.ps_nenvstr + 1)
1682 #if __ELF_WORD_SIZE == 64
1683 if (vptr % sizeof(uint64_t) != 0)
1685 if (vptr % sizeof(uint32_t) != 0)
1689 * We count the array size reading the aux vectors from the
1690 * stack until AT_NULL vector is returned. So (to keep the code
1691 * simple) we read the process stack twice: the first time here
1692 * to find the size and the second time when copying the vectors
1693 * to the allocated proc_vector.
1695 for (ptr = vptr, i = 0; i < PROC_AUXV_MAX; i++) {
1696 error = proc_read_mem(td, p, ptr, &aux, sizeof(aux));
1699 if (aux.a_type == AT_NULL)
1704 * If the PROC_AUXV_MAX entries are iterated over, and we have
1705 * not reached AT_NULL, it is most likely we are reading wrong
1706 * data: either the process doesn't have auxv array or data has
1707 * been modified. Return the error in this case.
1709 if (aux.a_type != AT_NULL)
1712 size = vsize * sizeof(aux);
1715 KASSERT(0, ("Wrong proc vector type: %d", type));
1716 return (EINVAL); /* In case we are built without INVARIANTS. */
1718 proc_vector = malloc(size, M_TEMP, M_WAITOK);
1719 if (proc_vector == NULL)
1721 error = proc_read_mem(td, p, vptr, proc_vector, size);
1723 free(proc_vector, M_TEMP);
1726 *proc_vectorp = proc_vector;
1732 #define GET_PS_STRINGS_CHUNK_SZ 256 /* Chunk size (bytes) for ps_strings operations. */
1735 get_ps_strings(struct thread *td, struct proc *p, struct sbuf *sb,
1736 enum proc_vector_type type)
1738 size_t done, len, nchr, vsize;
1740 char **proc_vector, *sptr;
1741 char pss_string[GET_PS_STRINGS_CHUNK_SZ];
1743 PROC_ASSERT_HELD(p);
1746 * We are not going to read more than 2 * (PATH_MAX + ARG_MAX) bytes.
1748 nchr = 2 * (PATH_MAX + ARG_MAX);
1750 error = get_proc_vector(td, p, &proc_vector, &vsize, type);
1753 for (done = 0, i = 0; i < (int)vsize && done < nchr; i++) {
1755 * The program may have scribbled into its argv array, e.g. to
1756 * remove some arguments. If that has happened, break out
1757 * before trying to read from NULL.
1759 if (proc_vector[i] == NULL)
1761 for (sptr = proc_vector[i]; ; sptr += GET_PS_STRINGS_CHUNK_SZ) {
1762 error = proc_read_string(td, p, sptr, pss_string,
1763 sizeof(pss_string));
1766 len = strnlen(pss_string, GET_PS_STRINGS_CHUNK_SZ);
1767 if (done + len >= nchr)
1768 len = nchr - done - 1;
1769 sbuf_bcat(sb, pss_string, len);
1770 if (len != GET_PS_STRINGS_CHUNK_SZ)
1772 done += GET_PS_STRINGS_CHUNK_SZ;
1774 sbuf_bcat(sb, "", 1);
1778 free(proc_vector, M_TEMP);
1783 proc_getargv(struct thread *td, struct proc *p, struct sbuf *sb)
1786 return (get_ps_strings(curthread, p, sb, PROC_ARG));
1790 proc_getenvv(struct thread *td, struct proc *p, struct sbuf *sb)
1793 return (get_ps_strings(curthread, p, sb, PROC_ENV));
1797 proc_getauxv(struct thread *td, struct proc *p, struct sbuf *sb)
1803 error = get_proc_vector(td, p, &auxv, &vsize, PROC_AUX);
1805 #ifdef COMPAT_FREEBSD32
1806 if (SV_PROC_FLAG(p, SV_ILP32) != 0)
1807 size = vsize * sizeof(Elf32_Auxinfo);
1810 size = vsize * sizeof(Elf_Auxinfo);
1811 if (sbuf_bcat(sb, auxv, size) != 0)
1819 * This sysctl allows a process to retrieve the argument list or process
1820 * title for another process without groping around in the address space
1821 * of the other process. It also allow a process to set its own "process
1822 * title to a string of its own choice.
1825 sysctl_kern_proc_args(SYSCTL_HANDLER_ARGS)
1827 int *name = (int *)arg1;
1828 u_int namelen = arg2;
1829 struct pargs *newpa, *pa;
1832 int flags, error = 0, error2;
1837 flags = PGET_CANSEE;
1838 if (req->newptr != NULL)
1839 flags |= PGET_ISCURRENT;
1840 error = pget((pid_t)name[0], flags, &p);
1848 error = SYSCTL_OUT(req, pa->ar_args, pa->ar_length);
1850 } else if ((p->p_flag & (P_WEXIT | P_SYSTEM)) == 0) {
1853 sbuf_new_for_sysctl(&sb, NULL, GET_PS_STRINGS_CHUNK_SZ, req);
1854 error = proc_getargv(curthread, p, &sb);
1855 error2 = sbuf_finish(&sb);
1858 if (error == 0 && error2 != 0)
1863 if (error != 0 || req->newptr == NULL)
1866 if (req->newlen + sizeof(struct pargs) > ps_arg_cache_limit)
1868 newpa = pargs_alloc(req->newlen);
1869 error = SYSCTL_IN(req, newpa->ar_args, req->newlen);
1883 * This sysctl allows a process to retrieve environment of another process.
1886 sysctl_kern_proc_env(SYSCTL_HANDLER_ARGS)
1888 int *name = (int *)arg1;
1889 u_int namelen = arg2;
1897 error = pget((pid_t)name[0], PGET_WANTREAD, &p);
1900 if ((p->p_flag & P_SYSTEM) != 0) {
1905 sbuf_new_for_sysctl(&sb, NULL, GET_PS_STRINGS_CHUNK_SZ, req);
1906 error = proc_getenvv(curthread, p, &sb);
1907 error2 = sbuf_finish(&sb);
1910 return (error != 0 ? error : error2);
1914 * This sysctl allows a process to retrieve ELF auxiliary vector of
1918 sysctl_kern_proc_auxv(SYSCTL_HANDLER_ARGS)
1920 int *name = (int *)arg1;
1921 u_int namelen = arg2;
1929 error = pget((pid_t)name[0], PGET_WANTREAD, &p);
1932 if ((p->p_flag & P_SYSTEM) != 0) {
1936 sbuf_new_for_sysctl(&sb, NULL, GET_PS_STRINGS_CHUNK_SZ, req);
1937 error = proc_getauxv(curthread, p, &sb);
1938 error2 = sbuf_finish(&sb);
1941 return (error != 0 ? error : error2);
1945 * This sysctl allows a process to retrieve the path of the executable for
1946 * itself or another process.
1949 sysctl_kern_proc_pathname(SYSCTL_HANDLER_ARGS)
1951 pid_t *pidp = (pid_t *)arg1;
1952 unsigned int arglen = arg2;
1955 char *retbuf, *freebuf;
1960 if (*pidp == -1) { /* -1 means this process */
1961 p = req->td->td_proc;
1963 error = pget(*pidp, PGET_CANSEE, &p);
1977 error = vn_fullpath(req->td, vp, &retbuf, &freebuf);
1981 error = SYSCTL_OUT(req, retbuf, strlen(retbuf) + 1);
1982 free(freebuf, M_TEMP);
1987 sysctl_kern_proc_sv_name(SYSCTL_HANDLER_ARGS)
2000 error = pget((pid_t)name[0], PGET_CANSEE, &p);
2003 sv_name = p->p_sysent->sv_name;
2005 return (sysctl_handle_string(oidp, sv_name, 0, req));
2008 #ifdef KINFO_OVMENTRY_SIZE
2009 CTASSERT(sizeof(struct kinfo_ovmentry) == KINFO_OVMENTRY_SIZE);
2012 #ifdef COMPAT_FREEBSD7
2014 sysctl_kern_proc_ovmmap(SYSCTL_HANDLER_ARGS)
2016 vm_map_entry_t entry, tmp_entry;
2017 unsigned int last_timestamp;
2018 char *fullpath, *freepath;
2019 struct kinfo_ovmentry *kve;
2029 error = pget((pid_t)name[0], PGET_WANTREAD, &p);
2032 vm = vmspace_acquire_ref(p);
2037 kve = malloc(sizeof(*kve), M_TEMP, M_WAITOK);
2040 vm_map_lock_read(map);
2041 for (entry = map->header.next; entry != &map->header;
2042 entry = entry->next) {
2043 vm_object_t obj, tobj, lobj;
2046 if (entry->eflags & MAP_ENTRY_IS_SUB_MAP)
2049 bzero(kve, sizeof(*kve));
2050 kve->kve_structsize = sizeof(*kve);
2052 kve->kve_private_resident = 0;
2053 obj = entry->object.vm_object;
2055 VM_OBJECT_RLOCK(obj);
2056 if (obj->shadow_count == 1)
2057 kve->kve_private_resident =
2058 obj->resident_page_count;
2060 kve->kve_resident = 0;
2061 addr = entry->start;
2062 while (addr < entry->end) {
2063 if (pmap_extract(map->pmap, addr))
2064 kve->kve_resident++;
2068 for (lobj = tobj = obj; tobj; tobj = tobj->backing_object) {
2070 VM_OBJECT_RLOCK(tobj);
2072 VM_OBJECT_RUNLOCK(lobj);
2076 kve->kve_start = (void*)entry->start;
2077 kve->kve_end = (void*)entry->end;
2078 kve->kve_offset = (off_t)entry->offset;
2080 if (entry->protection & VM_PROT_READ)
2081 kve->kve_protection |= KVME_PROT_READ;
2082 if (entry->protection & VM_PROT_WRITE)
2083 kve->kve_protection |= KVME_PROT_WRITE;
2084 if (entry->protection & VM_PROT_EXECUTE)
2085 kve->kve_protection |= KVME_PROT_EXEC;
2087 if (entry->eflags & MAP_ENTRY_COW)
2088 kve->kve_flags |= KVME_FLAG_COW;
2089 if (entry->eflags & MAP_ENTRY_NEEDS_COPY)
2090 kve->kve_flags |= KVME_FLAG_NEEDS_COPY;
2091 if (entry->eflags & MAP_ENTRY_NOCOREDUMP)
2092 kve->kve_flags |= KVME_FLAG_NOCOREDUMP;
2094 last_timestamp = map->timestamp;
2095 vm_map_unlock_read(map);
2097 kve->kve_fileid = 0;
2103 switch (lobj->type) {
2105 kve->kve_type = KVME_TYPE_DEFAULT;
2108 kve->kve_type = KVME_TYPE_VNODE;
2113 kve->kve_type = KVME_TYPE_SWAP;
2116 kve->kve_type = KVME_TYPE_DEVICE;
2119 kve->kve_type = KVME_TYPE_PHYS;
2122 kve->kve_type = KVME_TYPE_DEAD;
2125 kve->kve_type = KVME_TYPE_SG;
2128 kve->kve_type = KVME_TYPE_UNKNOWN;
2132 VM_OBJECT_RUNLOCK(lobj);
2134 kve->kve_ref_count = obj->ref_count;
2135 kve->kve_shadow_count = obj->shadow_count;
2136 VM_OBJECT_RUNLOCK(obj);
2138 vn_fullpath(curthread, vp, &fullpath,
2140 cred = curthread->td_ucred;
2141 vn_lock(vp, LK_SHARED | LK_RETRY);
2142 if (VOP_GETATTR(vp, &va, cred) == 0) {
2143 kve->kve_fileid = va.va_fileid;
2144 kve->kve_fsid = va.va_fsid;
2149 kve->kve_type = KVME_TYPE_NONE;
2150 kve->kve_ref_count = 0;
2151 kve->kve_shadow_count = 0;
2154 strlcpy(kve->kve_path, fullpath, sizeof(kve->kve_path));
2155 if (freepath != NULL)
2156 free(freepath, M_TEMP);
2158 error = SYSCTL_OUT(req, kve, sizeof(*kve));
2159 vm_map_lock_read(map);
2162 if (last_timestamp != map->timestamp) {
2163 vm_map_lookup_entry(map, addr - 1, &tmp_entry);
2167 vm_map_unlock_read(map);
2173 #endif /* COMPAT_FREEBSD7 */
2175 #ifdef KINFO_VMENTRY_SIZE
2176 CTASSERT(sizeof(struct kinfo_vmentry) == KINFO_VMENTRY_SIZE);
2180 kern_proc_vmmap_resident(vm_map_t map, vm_map_entry_t entry,
2181 struct kinfo_vmentry *kve)
2183 vm_object_t obj, tobj;
2186 vm_paddr_t locked_pa;
2187 vm_pindex_t pi, pi_adv, pindex;
2190 obj = entry->object.vm_object;
2191 addr = entry->start;
2193 pi = OFF_TO_IDX(entry->offset);
2194 for (; addr < entry->end; addr += IDX_TO_OFF(pi_adv), pi += pi_adv) {
2195 if (m_adv != NULL) {
2198 pi_adv = OFF_TO_IDX(entry->end - addr);
2200 for (tobj = obj;; tobj = tobj->backing_object) {
2201 m = vm_page_find_least(tobj, pindex);
2203 if (m->pindex == pindex)
2205 if (pi_adv > m->pindex - pindex) {
2206 pi_adv = m->pindex - pindex;
2210 if (tobj->backing_object == NULL)
2212 pindex += OFF_TO_IDX(tobj->
2213 backing_object_offset);
2217 if (m->psind != 0 && addr + pagesizes[1] <= entry->end &&
2218 (addr & (pagesizes[1] - 1)) == 0 &&
2219 (pmap_mincore(map->pmap, addr, &locked_pa) &
2220 MINCORE_SUPER) != 0) {
2221 kve->kve_flags |= KVME_FLAG_SUPER;
2222 pi_adv = OFF_TO_IDX(pagesizes[1]);
2225 * We do not test the found page on validity.
2226 * Either the page is busy and being paged in,
2227 * or it was invalidated. The first case
2228 * should be counted as resident, the second
2229 * is not so clear; we do account both.
2233 kve->kve_resident += pi_adv;
2236 PA_UNLOCK_COND(locked_pa);
2240 * Must be called with the process locked and will return unlocked.
2243 kern_proc_vmmap_out(struct proc *p, struct sbuf *sb)
2245 vm_map_entry_t entry, tmp_entry;
2248 vm_object_t obj, tobj, lobj;
2249 char *fullpath, *freepath;
2250 struct kinfo_vmentry *kve;
2255 unsigned int last_timestamp;
2258 PROC_LOCK_ASSERT(p, MA_OWNED);
2262 vm = vmspace_acquire_ref(p);
2267 kve = malloc(sizeof(*kve), M_TEMP, M_WAITOK);
2271 vm_map_lock_read(map);
2272 for (entry = map->header.next; entry != &map->header;
2273 entry = entry->next) {
2274 if (entry->eflags & MAP_ENTRY_IS_SUB_MAP)
2278 bzero(kve, sizeof(*kve));
2279 obj = entry->object.vm_object;
2281 for (tobj = obj; tobj != NULL;
2282 tobj = tobj->backing_object) {
2283 VM_OBJECT_RLOCK(tobj);
2286 if (obj->backing_object == NULL)
2287 kve->kve_private_resident =
2288 obj->resident_page_count;
2289 if (!vmmap_skip_res_cnt)
2290 kern_proc_vmmap_resident(map, entry, kve);
2291 for (tobj = obj; tobj != NULL;
2292 tobj = tobj->backing_object) {
2293 if (tobj != obj && tobj != lobj)
2294 VM_OBJECT_RUNLOCK(tobj);
2300 kve->kve_start = entry->start;
2301 kve->kve_end = entry->end;
2302 kve->kve_offset = entry->offset;
2304 if (entry->protection & VM_PROT_READ)
2305 kve->kve_protection |= KVME_PROT_READ;
2306 if (entry->protection & VM_PROT_WRITE)
2307 kve->kve_protection |= KVME_PROT_WRITE;
2308 if (entry->protection & VM_PROT_EXECUTE)
2309 kve->kve_protection |= KVME_PROT_EXEC;
2311 if (entry->eflags & MAP_ENTRY_COW)
2312 kve->kve_flags |= KVME_FLAG_COW;
2313 if (entry->eflags & MAP_ENTRY_NEEDS_COPY)
2314 kve->kve_flags |= KVME_FLAG_NEEDS_COPY;
2315 if (entry->eflags & MAP_ENTRY_NOCOREDUMP)
2316 kve->kve_flags |= KVME_FLAG_NOCOREDUMP;
2317 if (entry->eflags & MAP_ENTRY_GROWS_UP)
2318 kve->kve_flags |= KVME_FLAG_GROWS_UP;
2319 if (entry->eflags & MAP_ENTRY_GROWS_DOWN)
2320 kve->kve_flags |= KVME_FLAG_GROWS_DOWN;
2322 last_timestamp = map->timestamp;
2323 vm_map_unlock_read(map);
2329 switch (lobj->type) {
2331 kve->kve_type = KVME_TYPE_DEFAULT;
2334 kve->kve_type = KVME_TYPE_VNODE;
2339 kve->kve_type = KVME_TYPE_SWAP;
2342 kve->kve_type = KVME_TYPE_DEVICE;
2345 kve->kve_type = KVME_TYPE_PHYS;
2348 kve->kve_type = KVME_TYPE_DEAD;
2351 kve->kve_type = KVME_TYPE_SG;
2353 case OBJT_MGTDEVICE:
2354 kve->kve_type = KVME_TYPE_MGTDEVICE;
2357 kve->kve_type = KVME_TYPE_UNKNOWN;
2361 VM_OBJECT_RUNLOCK(lobj);
2363 kve->kve_ref_count = obj->ref_count;
2364 kve->kve_shadow_count = obj->shadow_count;
2365 VM_OBJECT_RUNLOCK(obj);
2367 vn_fullpath(curthread, vp, &fullpath,
2369 kve->kve_vn_type = vntype_to_kinfo(vp->v_type);
2370 cred = curthread->td_ucred;
2371 vn_lock(vp, LK_SHARED | LK_RETRY);
2372 if (VOP_GETATTR(vp, &va, cred) == 0) {
2373 kve->kve_vn_fileid = va.va_fileid;
2374 kve->kve_vn_fsid = va.va_fsid;
2376 MAKEIMODE(va.va_type, va.va_mode);
2377 kve->kve_vn_size = va.va_size;
2378 kve->kve_vn_rdev = va.va_rdev;
2379 kve->kve_status = KF_ATTR_VALID;
2384 kve->kve_type = KVME_TYPE_NONE;
2385 kve->kve_ref_count = 0;
2386 kve->kve_shadow_count = 0;
2389 strlcpy(kve->kve_path, fullpath, sizeof(kve->kve_path));
2390 if (freepath != NULL)
2391 free(freepath, M_TEMP);
2393 /* Pack record size down */
2394 kve->kve_structsize = offsetof(struct kinfo_vmentry, kve_path) +
2395 strlen(kve->kve_path) + 1;
2396 kve->kve_structsize = roundup(kve->kve_structsize,
2398 if (sbuf_bcat(sb, kve, kve->kve_structsize) != 0)
2400 vm_map_lock_read(map);
2403 if (last_timestamp != map->timestamp) {
2404 vm_map_lookup_entry(map, addr - 1, &tmp_entry);
2408 vm_map_unlock_read(map);
2416 sysctl_kern_proc_vmmap(SYSCTL_HANDLER_ARGS)
2420 int error, error2, *name;
2423 sbuf_new_for_sysctl(&sb, NULL, sizeof(struct kinfo_vmentry), req);
2424 error = pget((pid_t)name[0], PGET_CANDEBUG | PGET_NOTWEXIT, &p);
2429 error = kern_proc_vmmap_out(p, &sb);
2430 error2 = sbuf_finish(&sb);
2432 return (error != 0 ? error : error2);
2435 #if defined(STACK) || defined(DDB)
2437 sysctl_kern_proc_kstack(SYSCTL_HANDLER_ARGS)
2439 struct kinfo_kstack *kkstp;
2440 int error, i, *name, numthreads;
2441 lwpid_t *lwpidarray;
2448 error = pget((pid_t)name[0], PGET_NOTINEXEC | PGET_WANTREAD, &p);
2452 kkstp = malloc(sizeof(*kkstp), M_TEMP, M_WAITOK);
2453 st = stack_create();
2459 if (numthreads < p->p_numthreads) {
2460 if (lwpidarray != NULL) {
2461 free(lwpidarray, M_TEMP);
2464 numthreads = p->p_numthreads;
2466 lwpidarray = malloc(sizeof(*lwpidarray) * numthreads, M_TEMP,
2474 * XXXRW: During the below loop, execve(2) and countless other sorts
2475 * of changes could have taken place. Should we check to see if the
2476 * vmspace has been replaced, or the like, in order to prevent
2477 * giving a snapshot that spans, say, execve(2), with some threads
2478 * before and some after? Among other things, the credentials could
2479 * have changed, in which case the right to extract debug info might
2480 * no longer be assured.
2482 FOREACH_THREAD_IN_PROC(p, td) {
2483 KASSERT(i < numthreads,
2484 ("sysctl_kern_proc_kstack: numthreads"));
2485 lwpidarray[i] = td->td_tid;
2489 for (i = 0; i < numthreads; i++) {
2490 td = thread_find(p, lwpidarray[i]);
2494 bzero(kkstp, sizeof(*kkstp));
2495 (void)sbuf_new(&sb, kkstp->kkst_trace,
2496 sizeof(kkstp->kkst_trace), SBUF_FIXEDLEN);
2498 kkstp->kkst_tid = td->td_tid;
2499 if (TD_IS_SWAPPED(td))
2500 kkstp->kkst_state = KKST_STATE_SWAPPED;
2501 else if (TD_IS_RUNNING(td))
2502 kkstp->kkst_state = KKST_STATE_RUNNING;
2504 kkstp->kkst_state = KKST_STATE_STACKOK;
2505 stack_save_td(st, td);
2509 stack_sbuf_print(&sb, st);
2512 error = SYSCTL_OUT(req, kkstp, sizeof(*kkstp));
2519 if (lwpidarray != NULL)
2520 free(lwpidarray, M_TEMP);
2522 free(kkstp, M_TEMP);
2528 * This sysctl allows a process to retrieve the full list of groups from
2529 * itself or another process.
2532 sysctl_kern_proc_groups(SYSCTL_HANDLER_ARGS)
2534 pid_t *pidp = (pid_t *)arg1;
2535 unsigned int arglen = arg2;
2542 if (*pidp == -1) { /* -1 means this process */
2543 p = req->td->td_proc;
2546 error = pget(*pidp, PGET_CANSEE, &p);
2551 cred = crhold(p->p_ucred);
2554 error = SYSCTL_OUT(req, cred->cr_groups,
2555 cred->cr_ngroups * sizeof(gid_t));
2561 * This sysctl allows a process to retrieve or/and set the resource limit for
2565 sysctl_kern_proc_rlimit(SYSCTL_HANDLER_ARGS)
2567 int *name = (int *)arg1;
2568 u_int namelen = arg2;
2577 which = (u_int)name[1];
2578 if (which >= RLIM_NLIMITS)
2581 if (req->newptr != NULL && req->newlen != sizeof(rlim))
2584 flags = PGET_HOLD | PGET_NOTWEXIT;
2585 if (req->newptr != NULL)
2586 flags |= PGET_CANDEBUG;
2588 flags |= PGET_CANSEE;
2589 error = pget((pid_t)name[0], flags, &p);
2596 if (req->oldptr != NULL) {
2598 lim_rlimit(p, which, &rlim);
2601 error = SYSCTL_OUT(req, &rlim, sizeof(rlim));
2608 if (req->newptr != NULL) {
2609 error = SYSCTL_IN(req, &rlim, sizeof(rlim));
2611 error = kern_proc_setrlimit(curthread, p, which, &rlim);
2620 * This sysctl allows a process to retrieve ps_strings structure location of
2624 sysctl_kern_proc_ps_strings(SYSCTL_HANDLER_ARGS)
2626 int *name = (int *)arg1;
2627 u_int namelen = arg2;
2629 vm_offset_t ps_strings;
2631 #ifdef COMPAT_FREEBSD32
2632 uint32_t ps_strings32;
2638 error = pget((pid_t)name[0], PGET_CANDEBUG, &p);
2641 #ifdef COMPAT_FREEBSD32
2642 if ((req->flags & SCTL_MASK32) != 0) {
2644 * We return 0 if the 32 bit emulation request is for a 64 bit
2647 ps_strings32 = SV_PROC_FLAG(p, SV_ILP32) != 0 ?
2648 PTROUT(p->p_sysent->sv_psstrings) : 0;
2650 error = SYSCTL_OUT(req, &ps_strings32, sizeof(ps_strings32));
2654 ps_strings = p->p_sysent->sv_psstrings;
2656 error = SYSCTL_OUT(req, &ps_strings, sizeof(ps_strings));
2661 * This sysctl allows a process to retrieve umask of another process.
2664 sysctl_kern_proc_umask(SYSCTL_HANDLER_ARGS)
2666 int *name = (int *)arg1;
2667 u_int namelen = arg2;
2675 error = pget((pid_t)name[0], PGET_WANTREAD, &p);
2679 FILEDESC_SLOCK(p->p_fd);
2680 fd_cmask = p->p_fd->fd_cmask;
2681 FILEDESC_SUNLOCK(p->p_fd);
2683 error = SYSCTL_OUT(req, &fd_cmask, sizeof(fd_cmask));
2688 * This sysctl allows a process to set and retrieve binary osreldate of
2692 sysctl_kern_proc_osrel(SYSCTL_HANDLER_ARGS)
2694 int *name = (int *)arg1;
2695 u_int namelen = arg2;
2697 int flags, error, osrel;
2702 if (req->newptr != NULL && req->newlen != sizeof(osrel))
2705 flags = PGET_HOLD | PGET_NOTWEXIT;
2706 if (req->newptr != NULL)
2707 flags |= PGET_CANDEBUG;
2709 flags |= PGET_CANSEE;
2710 error = pget((pid_t)name[0], flags, &p);
2714 error = SYSCTL_OUT(req, &p->p_osrel, sizeof(p->p_osrel));
2718 if (req->newptr != NULL) {
2719 error = SYSCTL_IN(req, &osrel, sizeof(osrel));
2734 sysctl_kern_proc_sigtramp(SYSCTL_HANDLER_ARGS)
2736 int *name = (int *)arg1;
2737 u_int namelen = arg2;
2739 struct kinfo_sigtramp kst;
2740 const struct sysentvec *sv;
2742 #ifdef COMPAT_FREEBSD32
2743 struct kinfo_sigtramp32 kst32;
2749 error = pget((pid_t)name[0], PGET_CANDEBUG, &p);
2753 #ifdef COMPAT_FREEBSD32
2754 if ((req->flags & SCTL_MASK32) != 0) {
2755 bzero(&kst32, sizeof(kst32));
2756 if (SV_PROC_FLAG(p, SV_ILP32)) {
2757 if (sv->sv_sigcode_base != 0) {
2758 kst32.ksigtramp_start = sv->sv_sigcode_base;
2759 kst32.ksigtramp_end = sv->sv_sigcode_base +
2762 kst32.ksigtramp_start = sv->sv_psstrings -
2764 kst32.ksigtramp_end = sv->sv_psstrings;
2768 error = SYSCTL_OUT(req, &kst32, sizeof(kst32));
2772 bzero(&kst, sizeof(kst));
2773 if (sv->sv_sigcode_base != 0) {
2774 kst.ksigtramp_start = (char *)sv->sv_sigcode_base;
2775 kst.ksigtramp_end = (char *)sv->sv_sigcode_base +
2778 kst.ksigtramp_start = (char *)sv->sv_psstrings -
2780 kst.ksigtramp_end = (char *)sv->sv_psstrings;
2783 error = SYSCTL_OUT(req, &kst, sizeof(kst));
2787 SYSCTL_NODE(_kern, KERN_PROC, proc, CTLFLAG_RD, 0, "Process table");
2789 SYSCTL_PROC(_kern_proc, KERN_PROC_ALL, all, CTLFLAG_RD|CTLTYPE_STRUCT|
2790 CTLFLAG_MPSAFE, 0, 0, sysctl_kern_proc, "S,proc",
2791 "Return entire process table");
2793 static SYSCTL_NODE(_kern_proc, KERN_PROC_GID, gid, CTLFLAG_RD | CTLFLAG_MPSAFE,
2794 sysctl_kern_proc, "Process table");
2796 static SYSCTL_NODE(_kern_proc, KERN_PROC_PGRP, pgrp, CTLFLAG_RD | CTLFLAG_MPSAFE,
2797 sysctl_kern_proc, "Process table");
2799 static SYSCTL_NODE(_kern_proc, KERN_PROC_RGID, rgid, CTLFLAG_RD | CTLFLAG_MPSAFE,
2800 sysctl_kern_proc, "Process table");
2802 static SYSCTL_NODE(_kern_proc, KERN_PROC_SESSION, sid, CTLFLAG_RD |
2803 CTLFLAG_MPSAFE, sysctl_kern_proc, "Process table");
2805 static SYSCTL_NODE(_kern_proc, KERN_PROC_TTY, tty, CTLFLAG_RD | CTLFLAG_MPSAFE,
2806 sysctl_kern_proc, "Process table");
2808 static SYSCTL_NODE(_kern_proc, KERN_PROC_UID, uid, CTLFLAG_RD | CTLFLAG_MPSAFE,
2809 sysctl_kern_proc, "Process table");
2811 static SYSCTL_NODE(_kern_proc, KERN_PROC_RUID, ruid, CTLFLAG_RD | CTLFLAG_MPSAFE,
2812 sysctl_kern_proc, "Process table");
2814 static SYSCTL_NODE(_kern_proc, KERN_PROC_PID, pid, CTLFLAG_RD | CTLFLAG_MPSAFE,
2815 sysctl_kern_proc, "Process table");
2817 static SYSCTL_NODE(_kern_proc, KERN_PROC_PROC, proc, CTLFLAG_RD | CTLFLAG_MPSAFE,
2818 sysctl_kern_proc, "Return process table, no threads");
2820 static SYSCTL_NODE(_kern_proc, KERN_PROC_ARGS, args,
2821 CTLFLAG_RW | CTLFLAG_ANYBODY | CTLFLAG_MPSAFE,
2822 sysctl_kern_proc_args, "Process argument list");
2824 static SYSCTL_NODE(_kern_proc, KERN_PROC_ENV, env, CTLFLAG_RD | CTLFLAG_MPSAFE,
2825 sysctl_kern_proc_env, "Process environment");
2827 static SYSCTL_NODE(_kern_proc, KERN_PROC_AUXV, auxv, CTLFLAG_RD |
2828 CTLFLAG_MPSAFE, sysctl_kern_proc_auxv, "Process ELF auxiliary vector");
2830 static SYSCTL_NODE(_kern_proc, KERN_PROC_PATHNAME, pathname, CTLFLAG_RD |
2831 CTLFLAG_MPSAFE, sysctl_kern_proc_pathname, "Process executable path");
2833 static SYSCTL_NODE(_kern_proc, KERN_PROC_SV_NAME, sv_name, CTLFLAG_RD |
2834 CTLFLAG_MPSAFE, sysctl_kern_proc_sv_name,
2835 "Process syscall vector name (ABI type)");
2837 static SYSCTL_NODE(_kern_proc, (KERN_PROC_GID | KERN_PROC_INC_THREAD), gid_td,
2838 CTLFLAG_RD | CTLFLAG_MPSAFE, sysctl_kern_proc, "Process table");
2840 static SYSCTL_NODE(_kern_proc, (KERN_PROC_PGRP | KERN_PROC_INC_THREAD), pgrp_td,
2841 CTLFLAG_RD | CTLFLAG_MPSAFE, sysctl_kern_proc, "Process table");
2843 static SYSCTL_NODE(_kern_proc, (KERN_PROC_RGID | KERN_PROC_INC_THREAD), rgid_td,
2844 CTLFLAG_RD | CTLFLAG_MPSAFE, sysctl_kern_proc, "Process table");
2846 static SYSCTL_NODE(_kern_proc, (KERN_PROC_SESSION | KERN_PROC_INC_THREAD),
2847 sid_td, CTLFLAG_RD | CTLFLAG_MPSAFE, sysctl_kern_proc, "Process table");
2849 static SYSCTL_NODE(_kern_proc, (KERN_PROC_TTY | KERN_PROC_INC_THREAD), tty_td,
2850 CTLFLAG_RD | CTLFLAG_MPSAFE, sysctl_kern_proc, "Process table");
2852 static SYSCTL_NODE(_kern_proc, (KERN_PROC_UID | KERN_PROC_INC_THREAD), uid_td,
2853 CTLFLAG_RD | CTLFLAG_MPSAFE, sysctl_kern_proc, "Process table");
2855 static SYSCTL_NODE(_kern_proc, (KERN_PROC_RUID | KERN_PROC_INC_THREAD), ruid_td,
2856 CTLFLAG_RD | CTLFLAG_MPSAFE, sysctl_kern_proc, "Process table");
2858 static SYSCTL_NODE(_kern_proc, (KERN_PROC_PID | KERN_PROC_INC_THREAD), pid_td,
2859 CTLFLAG_RD | CTLFLAG_MPSAFE, sysctl_kern_proc, "Process table");
2861 static SYSCTL_NODE(_kern_proc, (KERN_PROC_PROC | KERN_PROC_INC_THREAD), proc_td,
2862 CTLFLAG_RD | CTLFLAG_MPSAFE, sysctl_kern_proc,
2863 "Return process table, no threads");
2865 #ifdef COMPAT_FREEBSD7
2866 static SYSCTL_NODE(_kern_proc, KERN_PROC_OVMMAP, ovmmap, CTLFLAG_RD |
2867 CTLFLAG_MPSAFE, sysctl_kern_proc_ovmmap, "Old Process vm map entries");
2870 static SYSCTL_NODE(_kern_proc, KERN_PROC_VMMAP, vmmap, CTLFLAG_RD |
2871 CTLFLAG_MPSAFE, sysctl_kern_proc_vmmap, "Process vm map entries");
2873 #if defined(STACK) || defined(DDB)
2874 static SYSCTL_NODE(_kern_proc, KERN_PROC_KSTACK, kstack, CTLFLAG_RD |
2875 CTLFLAG_MPSAFE, sysctl_kern_proc_kstack, "Process kernel stacks");
2878 static SYSCTL_NODE(_kern_proc, KERN_PROC_GROUPS, groups, CTLFLAG_RD |
2879 CTLFLAG_MPSAFE, sysctl_kern_proc_groups, "Process groups");
2881 static SYSCTL_NODE(_kern_proc, KERN_PROC_RLIMIT, rlimit, CTLFLAG_RW |
2882 CTLFLAG_ANYBODY | CTLFLAG_MPSAFE, sysctl_kern_proc_rlimit,
2883 "Process resource limits");
2885 static SYSCTL_NODE(_kern_proc, KERN_PROC_PS_STRINGS, ps_strings, CTLFLAG_RD |
2886 CTLFLAG_MPSAFE, sysctl_kern_proc_ps_strings,
2887 "Process ps_strings location");
2889 static SYSCTL_NODE(_kern_proc, KERN_PROC_UMASK, umask, CTLFLAG_RD |
2890 CTLFLAG_MPSAFE, sysctl_kern_proc_umask, "Process umask");
2892 static SYSCTL_NODE(_kern_proc, KERN_PROC_OSREL, osrel, CTLFLAG_RW |
2893 CTLFLAG_ANYBODY | CTLFLAG_MPSAFE, sysctl_kern_proc_osrel,
2894 "Process binary osreldate");
2896 static SYSCTL_NODE(_kern_proc, KERN_PROC_SIGTRAMP, sigtramp, CTLFLAG_RD |
2897 CTLFLAG_MPSAFE, sysctl_kern_proc_sigtramp,
2898 "Process signal trampoline location");