2 * SPDX-License-Identifier: BSD-3-Clause
4 * Copyright (c) 1982, 1986, 1989, 1991, 1993
5 * The Regents of the University of California. All rights reserved.
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 * 3. Neither the name of the University nor the names of its contributors
16 * may be used to endorse or promote products derived from this software
17 * without specific prior written permission.
19 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 * @(#)kern_proc.c 8.7 (Berkeley) 2/14/95
34 #include <sys/cdefs.h>
35 __FBSDID("$FreeBSD$");
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>
44 #include <sys/bitstring.h>
46 #include <sys/eventhandler.h>
48 #include <sys/fcntl.h>
50 #include <sys/kernel.h>
51 #include <sys/limits.h>
53 #include <sys/loginclass.h>
54 #include <sys/malloc.h>
56 #include <sys/mount.h>
57 #include <sys/mutex.h>
58 #include <sys/namei.h>
60 #include <sys/ptrace.h>
61 #include <sys/refcount.h>
62 #include <sys/resourcevar.h>
63 #include <sys/rwlock.h>
65 #include <sys/sysent.h>
66 #include <sys/sched.h>
68 #include <sys/stack.h>
70 #include <sys/dtrace_bsd.h>
71 #include <sys/sysctl.h>
72 #include <sys/filedesc.h>
74 #include <sys/signalvar.h>
78 #include <sys/vnode.h>
81 #include <sys/ktrace.h>
89 #include <vm/vm_param.h>
90 #include <vm/vm_extern.h>
92 #include <vm/vm_map.h>
93 #include <vm/vm_object.h>
94 #include <vm/vm_page.h>
97 #include <fs/devfs/devfs.h>
99 #ifdef COMPAT_FREEBSD32
100 #include <compat/freebsd32/freebsd32.h>
101 #include <compat/freebsd32/freebsd32_util.h>
104 SDT_PROVIDER_DEFINE(proc);
106 MALLOC_DEFINE(M_SESSION, "session", "session header");
107 static MALLOC_DEFINE(M_PROC, "proc", "Proc structures");
108 MALLOC_DEFINE(M_SUBPROC, "subproc", "Proc sub-structures");
110 static void doenterpgrp(struct proc *, struct pgrp *);
111 static void orphanpg(struct pgrp *pg);
112 static void fill_kinfo_aggregate(struct proc *p, struct kinfo_proc *kp);
113 static void fill_kinfo_proc_only(struct proc *p, struct kinfo_proc *kp);
114 static void fill_kinfo_thread(struct thread *td, struct kinfo_proc *kp,
116 static void pgdelete(struct pgrp *);
117 static int pgrp_init(void *mem, int size, int flags);
118 static int proc_ctor(void *mem, int size, void *arg, int flags);
119 static void proc_dtor(void *mem, int size, void *arg);
120 static int proc_init(void *mem, int size, int flags);
121 static void proc_fini(void *mem, int size);
122 static void pargs_free(struct pargs *pa);
125 * Other process lists
127 struct pidhashhead *pidhashtbl = NULL;
128 struct sx *pidhashtbl_lock;
131 struct pgrphashhead *pgrphashtbl;
133 struct proclist allproc = LIST_HEAD_INITIALIZER(allproc);
134 struct sx __exclusive_cache_line allproc_lock;
135 struct sx __exclusive_cache_line proctree_lock;
136 struct mtx __exclusive_cache_line ppeers_lock;
137 struct mtx __exclusive_cache_line procid_lock;
138 uma_zone_t proc_zone;
139 uma_zone_t pgrp_zone;
142 * The offset of various fields in struct proc and struct thread.
143 * These are used by kernel debuggers to enumerate kernel threads and
146 const int proc_off_p_pid = offsetof(struct proc, p_pid);
147 const int proc_off_p_comm = offsetof(struct proc, p_comm);
148 const int proc_off_p_list = offsetof(struct proc, p_list);
149 const int proc_off_p_hash = offsetof(struct proc, p_hash);
150 const int proc_off_p_threads = offsetof(struct proc, p_threads);
151 const int thread_off_td_tid = offsetof(struct thread, td_tid);
152 const int thread_off_td_name = offsetof(struct thread, td_name);
153 const int thread_off_td_oncpu = offsetof(struct thread, td_oncpu);
154 const int thread_off_td_pcb = offsetof(struct thread, td_pcb);
155 const int thread_off_td_plist = offsetof(struct thread, td_plist);
157 EVENTHANDLER_LIST_DEFINE(process_ctor);
158 EVENTHANDLER_LIST_DEFINE(process_dtor);
159 EVENTHANDLER_LIST_DEFINE(process_init);
160 EVENTHANDLER_LIST_DEFINE(process_fini);
161 EVENTHANDLER_LIST_DEFINE(process_exit);
162 EVENTHANDLER_LIST_DEFINE(process_fork);
163 EVENTHANDLER_LIST_DEFINE(process_exec);
165 int kstack_pages = KSTACK_PAGES;
166 SYSCTL_INT(_kern, OID_AUTO, kstack_pages, CTLFLAG_RD, &kstack_pages, 0,
167 "Kernel stack size in pages");
168 static int vmmap_skip_res_cnt = 0;
169 SYSCTL_INT(_kern, OID_AUTO, proc_vmmap_skip_resident_count, CTLFLAG_RW,
170 &vmmap_skip_res_cnt, 0,
171 "Skip calculation of the pages resident count in kern.proc.vmmap");
173 CTASSERT(sizeof(struct kinfo_proc) == KINFO_PROC_SIZE);
174 #ifdef COMPAT_FREEBSD32
175 CTASSERT(sizeof(struct kinfo_proc32) == KINFO_PROC32_SIZE);
179 * Initialize global process hashing structures.
186 sx_init(&allproc_lock, "allproc");
187 sx_init(&proctree_lock, "proctree");
188 mtx_init(&ppeers_lock, "p_peers", NULL, MTX_DEF);
189 mtx_init(&procid_lock, "procid", NULL, MTX_DEF);
190 pidhashtbl = hashinit(maxproc / 4, M_PROC, &pidhash);
191 pidhashlock = (pidhash + 1) / 64;
194 pidhashtbl_lock = malloc(sizeof(*pidhashtbl_lock) * (pidhashlock + 1),
195 M_PROC, M_WAITOK | M_ZERO);
196 for (i = 0; i < pidhashlock + 1; i++)
197 sx_init_flags(&pidhashtbl_lock[i], "pidhash", SX_DUPOK);
198 pgrphashtbl = hashinit(maxproc / 4, M_PROC, &pgrphash);
199 proc_zone = uma_zcreate("PROC", sched_sizeof_proc(),
200 proc_ctor, proc_dtor, proc_init, proc_fini,
201 UMA_ALIGN_PTR, UMA_ZONE_NOFREE);
202 pgrp_zone = uma_zcreate("PGRP", sizeof(struct pgrp), NULL, NULL,
203 pgrp_init, NULL, UMA_ALIGN_PTR, UMA_ZONE_NOFREE);
208 * Prepare a proc for use.
211 proc_ctor(void *mem, int size, void *arg, int flags)
216 p = (struct proc *)mem;
218 kdtrace_proc_ctor(p);
220 EVENTHANDLER_DIRECT_INVOKE(process_ctor, p);
221 td = FIRST_THREAD_IN_PROC(p);
223 /* Make sure all thread constructors are executed */
224 EVENTHANDLER_DIRECT_INVOKE(thread_ctor, td);
230 * Reclaim a proc after use.
233 proc_dtor(void *mem, int size, void *arg)
238 /* INVARIANTS checks go here */
239 p = (struct proc *)mem;
240 td = FIRST_THREAD_IN_PROC(p);
243 KASSERT((p->p_numthreads == 1),
244 ("bad number of threads in exiting process"));
245 KASSERT(STAILQ_EMPTY(&p->p_ktr), ("proc_dtor: non-empty p_ktr"));
247 /* Free all OSD associated to this thread. */
251 /* Make sure all thread destructors are executed */
252 EVENTHANDLER_DIRECT_INVOKE(thread_dtor, td);
254 EVENTHANDLER_DIRECT_INVOKE(process_dtor, p);
256 kdtrace_proc_dtor(p);
258 if (p->p_ksi != NULL)
259 KASSERT(! KSI_ONQ(p->p_ksi), ("SIGCHLD queue"));
263 * Initialize type-stable parts of a proc (when newly created).
266 proc_init(void *mem, int size, int flags)
270 p = (struct proc *)mem;
271 mtx_init(&p->p_mtx, "process lock", NULL, MTX_DEF | MTX_DUPOK | MTX_NEW);
272 mtx_init(&p->p_slock, "process slock", NULL, MTX_SPIN | MTX_NEW);
273 mtx_init(&p->p_statmtx, "pstatl", NULL, MTX_SPIN | MTX_NEW);
274 mtx_init(&p->p_itimmtx, "pitiml", NULL, MTX_SPIN | MTX_NEW);
275 mtx_init(&p->p_profmtx, "pprofl", NULL, MTX_SPIN | MTX_NEW);
276 cv_init(&p->p_pwait, "ppwait");
277 TAILQ_INIT(&p->p_threads); /* all threads in proc */
278 EVENTHANDLER_DIRECT_INVOKE(process_init, p);
279 p->p_stats = pstats_alloc();
285 * UMA should ensure that this function is never called.
286 * Freeing a proc structure would violate type stability.
289 proc_fini(void *mem, int size)
294 p = (struct proc *)mem;
295 EVENTHANDLER_DIRECT_INVOKE(process_fini, p);
296 pstats_free(p->p_stats);
297 thread_free(FIRST_THREAD_IN_PROC(p));
298 mtx_destroy(&p->p_mtx);
299 if (p->p_ksi != NULL)
300 ksiginfo_free(p->p_ksi);
302 panic("proc reclaimed");
307 pgrp_init(void *mem, int size, int flags)
312 mtx_init(&pg->pg_mtx, "process group", NULL, MTX_DEF | MTX_DUPOK);
313 sx_init(&pg->pg_killsx, "killpg racer");
318 * PID space management.
320 * These bitmaps are used by fork_findpid.
322 bitstr_t bit_decl(proc_id_pidmap, PID_MAX);
323 bitstr_t bit_decl(proc_id_grpidmap, PID_MAX);
324 bitstr_t bit_decl(proc_id_sessidmap, PID_MAX);
325 bitstr_t bit_decl(proc_id_reapmap, PID_MAX);
327 static bitstr_t *proc_id_array[] = {
335 proc_id_set(int type, pid_t id)
338 KASSERT(type >= 0 && type < nitems(proc_id_array),
339 ("invalid type %d\n", type));
340 mtx_lock(&procid_lock);
341 KASSERT(bit_test(proc_id_array[type], id) == 0,
342 ("bit %d already set in %d\n", id, type));
343 bit_set(proc_id_array[type], id);
344 mtx_unlock(&procid_lock);
348 proc_id_set_cond(int type, pid_t id)
351 KASSERT(type >= 0 && type < nitems(proc_id_array),
352 ("invalid type %d\n", type));
353 if (bit_test(proc_id_array[type], id))
355 mtx_lock(&procid_lock);
356 bit_set(proc_id_array[type], id);
357 mtx_unlock(&procid_lock);
361 proc_id_clear(int type, pid_t id)
364 KASSERT(type >= 0 && type < nitems(proc_id_array),
365 ("invalid type %d\n", type));
366 mtx_lock(&procid_lock);
367 KASSERT(bit_test(proc_id_array[type], id) != 0,
368 ("bit %d not set in %d\n", id, type));
369 bit_clear(proc_id_array[type], id);
370 mtx_unlock(&procid_lock);
374 * Is p an inferior of the current process?
377 inferior(struct proc *p)
380 sx_assert(&proctree_lock, SX_LOCKED);
381 PROC_LOCK_ASSERT(p, MA_OWNED);
382 for (; p != curproc; p = proc_realparent(p)) {
390 * Shared lock all the pid hash lists.
393 pidhash_slockall(void)
397 for (i = 0; i < pidhashlock + 1; i++)
398 sx_slock(&pidhashtbl_lock[i]);
402 * Shared unlock all the pid hash lists.
405 pidhash_sunlockall(void)
409 for (i = 0; i < pidhashlock + 1; i++)
410 sx_sunlock(&pidhashtbl_lock[i]);
414 * Similar to pfind_any(), this function finds zombies.
417 pfind_any_locked(pid_t pid)
421 sx_assert(PIDHASHLOCK(pid), SX_LOCKED);
422 LIST_FOREACH(p, PIDHASH(pid), p_hash) {
423 if (p->p_pid == pid) {
425 if (p->p_state == PRS_NEW) {
436 * Locate a process by number.
438 * By not returning processes in the PRS_NEW state, we allow callers to avoid
439 * testing for that condition to avoid dereferencing p_ucred, et al.
441 static __always_inline struct proc *
442 _pfind(pid_t pid, bool zombie)
447 if (p->p_pid == pid) {
451 sx_slock(PIDHASHLOCK(pid));
452 LIST_FOREACH(p, PIDHASH(pid), p_hash) {
453 if (p->p_pid == pid) {
455 if (p->p_state == PRS_NEW ||
456 (!zombie && p->p_state == PRS_ZOMBIE)) {
463 sx_sunlock(PIDHASHLOCK(pid));
471 return (_pfind(pid, false));
475 * Same as pfind but allow zombies.
481 return (_pfind(pid, true));
485 * Locate a process group by number.
486 * The caller must hold proctree_lock.
493 sx_assert(&proctree_lock, SX_LOCKED);
495 LIST_FOREACH(pgrp, PGRPHASH(pgid), pg_hash) {
496 if (pgrp->pg_id == pgid) {
505 * Locate process and do additional manipulations, depending on flags.
508 pget(pid_t pid, int flags, struct proc **pp)
515 if (p->p_pid == pid) {
519 if (pid <= PID_MAX) {
520 if ((flags & PGET_NOTWEXIT) == 0)
524 } else if ((flags & PGET_NOTID) == 0) {
525 td1 = tdfind(pid, -1);
531 if ((flags & PGET_CANSEE) != 0) {
532 error = p_cansee(curthread, p);
537 if ((flags & PGET_CANDEBUG) != 0) {
538 error = p_candebug(curthread, p);
542 if ((flags & PGET_ISCURRENT) != 0 && curproc != p) {
546 if ((flags & PGET_NOTWEXIT) != 0 && (p->p_flag & P_WEXIT) != 0) {
550 if ((flags & PGET_NOTINEXEC) != 0 && (p->p_flag & P_INEXEC) != 0) {
552 * XXXRW: Not clear ESRCH is the right error during proc
558 if ((flags & PGET_HOLD) != 0) {
570 * Create a new process group.
571 * pgid must be equal to the pid of p.
572 * Begin a new session if required.
575 enterpgrp(struct proc *p, pid_t pgid, struct pgrp *pgrp, struct session *sess)
577 struct pgrp *old_pgrp;
579 sx_assert(&proctree_lock, SX_XLOCKED);
581 KASSERT(pgrp != NULL, ("enterpgrp: pgrp == NULL"));
582 KASSERT(p->p_pid == pgid,
583 ("enterpgrp: new pgrp and pid != pgid"));
584 KASSERT(pgfind(pgid) == NULL,
585 ("enterpgrp: pgrp with pgid exists"));
586 KASSERT(!SESS_LEADER(p),
587 ("enterpgrp: session leader attempted setpgrp"));
589 old_pgrp = p->p_pgrp;
590 if (!sx_try_xlock(&old_pgrp->pg_killsx)) {
591 sx_xunlock(&proctree_lock);
592 sx_xlock(&old_pgrp->pg_killsx);
593 sx_xunlock(&old_pgrp->pg_killsx);
596 MPASS(old_pgrp == p->p_pgrp);
602 mtx_init(&sess->s_mtx, "session", NULL, MTX_DEF);
604 p->p_flag &= ~P_CONTROLT;
608 sess->s_sid = p->p_pid;
609 proc_id_set(PROC_ID_SESSION, p->p_pid);
610 refcount_init(&sess->s_count, 1);
611 sess->s_ttyvp = NULL;
612 sess->s_ttydp = NULL;
614 bcopy(p->p_session->s_login, sess->s_login,
615 sizeof(sess->s_login));
616 pgrp->pg_session = sess;
617 KASSERT(p == curproc,
618 ("enterpgrp: mksession and p != curproc"));
620 pgrp->pg_session = p->p_session;
621 sess_hold(pgrp->pg_session);
625 proc_id_set(PROC_ID_GROUP, p->p_pid);
626 LIST_INIT(&pgrp->pg_members);
630 * As we have an exclusive lock of proctree_lock,
631 * this should not deadlock.
633 LIST_INSERT_HEAD(PGRPHASH(pgid), pgrp, pg_hash);
634 SLIST_INIT(&pgrp->pg_sigiolst);
637 doenterpgrp(p, pgrp);
639 sx_xunlock(&old_pgrp->pg_killsx);
644 * Move p to an existing process group
647 enterthispgrp(struct proc *p, struct pgrp *pgrp)
649 struct pgrp *old_pgrp;
651 sx_assert(&proctree_lock, SX_XLOCKED);
652 PROC_LOCK_ASSERT(p, MA_NOTOWNED);
653 PGRP_LOCK_ASSERT(pgrp, MA_NOTOWNED);
654 PGRP_LOCK_ASSERT(p->p_pgrp, MA_NOTOWNED);
655 SESS_LOCK_ASSERT(p->p_session, MA_NOTOWNED);
656 KASSERT(pgrp->pg_session == p->p_session,
657 ("%s: pgrp's session %p, p->p_session %p proc %p\n",
658 __func__, pgrp->pg_session, p->p_session, p));
659 KASSERT(pgrp != p->p_pgrp,
660 ("%s: p %p belongs to pgrp %p", __func__, p, pgrp));
662 old_pgrp = p->p_pgrp;
663 if (!sx_try_xlock(&old_pgrp->pg_killsx)) {
664 sx_xunlock(&proctree_lock);
665 sx_xlock(&old_pgrp->pg_killsx);
666 sx_xunlock(&old_pgrp->pg_killsx);
669 MPASS(old_pgrp == p->p_pgrp);
670 if (!sx_try_xlock(&pgrp->pg_killsx)) {
671 sx_xunlock(&old_pgrp->pg_killsx);
672 sx_xunlock(&proctree_lock);
673 sx_xlock(&pgrp->pg_killsx);
674 sx_xunlock(&pgrp->pg_killsx);
678 doenterpgrp(p, pgrp);
680 sx_xunlock(&pgrp->pg_killsx);
681 sx_xunlock(&old_pgrp->pg_killsx);
686 * If true, any child of q which belongs to group pgrp, qualifies the
687 * process group pgrp as not orphaned.
690 isjobproc(struct proc *q, struct pgrp *pgrp)
692 sx_assert(&proctree_lock, SX_LOCKED);
694 return (q->p_pgrp != pgrp &&
695 q->p_pgrp->pg_session == pgrp->pg_session);
699 jobc_reaper(struct proc *p)
703 sx_assert(&proctree_lock, SA_LOCKED);
707 if (pp->p_reaper == pp ||
708 (pp->p_treeflag & P_TREE_GRPEXITED) == 0)
714 jobc_parent(struct proc *p, struct proc *p_exiting)
718 sx_assert(&proctree_lock, SA_LOCKED);
720 pp = proc_realparent(p);
721 if (pp->p_pptr == NULL || pp == p_exiting ||
722 (pp->p_treeflag & P_TREE_GRPEXITED) == 0)
724 return (jobc_reaper(pp));
728 pgrp_calc_jobc(struct pgrp *pgrp)
734 if (!mtx_owned(&pgrp->pg_mtx))
735 sx_assert(&proctree_lock, SA_LOCKED);
739 LIST_FOREACH(q, &pgrp->pg_members, p_pglist) {
740 if ((q->p_treeflag & P_TREE_GRPEXITED) != 0 ||
743 if (isjobproc(jobc_parent(q, NULL), pgrp))
750 * Move p to a process group
753 doenterpgrp(struct proc *p, struct pgrp *pgrp)
755 struct pgrp *savepgrp;
758 sx_assert(&proctree_lock, SX_XLOCKED);
759 PROC_LOCK_ASSERT(p, MA_NOTOWNED);
760 PGRP_LOCK_ASSERT(pgrp, MA_NOTOWNED);
761 PGRP_LOCK_ASSERT(p->p_pgrp, MA_NOTOWNED);
762 SESS_LOCK_ASSERT(p->p_session, MA_NOTOWNED);
764 savepgrp = p->p_pgrp;
765 pp = jobc_parent(p, NULL);
769 if (isjobproc(pp, savepgrp) && pgrp_calc_jobc(savepgrp) == 1)
772 LIST_REMOVE(p, p_pglist);
775 LIST_INSERT_HEAD(&pgrp->pg_members, p, p_pglist);
776 if (isjobproc(pp, pgrp))
777 pgrp->pg_flags &= ~PGRP_ORPHANED;
778 PGRP_UNLOCK(savepgrp);
780 if (LIST_EMPTY(&savepgrp->pg_members))
785 * remove process from process group
788 leavepgrp(struct proc *p)
790 struct pgrp *savepgrp;
792 sx_assert(&proctree_lock, SX_XLOCKED);
793 savepgrp = p->p_pgrp;
796 LIST_REMOVE(p, p_pglist);
799 PGRP_UNLOCK(savepgrp);
800 if (LIST_EMPTY(&savepgrp->pg_members))
806 * delete a process group
809 pgdelete(struct pgrp *pgrp)
811 struct session *savesess;
814 sx_assert(&proctree_lock, SX_XLOCKED);
815 PGRP_LOCK_ASSERT(pgrp, MA_NOTOWNED);
816 SESS_LOCK_ASSERT(pgrp->pg_session, MA_NOTOWNED);
819 * Reset any sigio structures pointing to us as a result of
820 * F_SETOWN with our pgid. The proctree lock ensures that
821 * new sigio structures will not be added after this point.
823 funsetownlst(&pgrp->pg_sigiolst);
826 tp = pgrp->pg_session->s_ttyp;
827 LIST_REMOVE(pgrp, pg_hash);
828 savesess = pgrp->pg_session;
831 /* Remove the reference to the pgrp before deallocating it. */
834 tty_rel_pgrp(tp, pgrp);
837 proc_id_clear(PROC_ID_GROUP, pgrp->pg_id);
838 uma_zfree(pgrp_zone, pgrp);
839 sess_release(savesess);
844 fixjobc_kill(struct proc *p)
849 sx_assert(&proctree_lock, SX_LOCKED);
850 PROC_LOCK_ASSERT(p, MA_NOTOWNED);
852 PGRP_LOCK_ASSERT(pgrp, MA_NOTOWNED);
853 SESS_LOCK_ASSERT(pgrp->pg_session, MA_NOTOWNED);
856 * p no longer affects process group orphanage for children.
857 * It is marked by the flag because p is only physically
858 * removed from its process group on wait(2).
860 MPASS((p->p_treeflag & P_TREE_GRPEXITED) == 0);
861 p->p_treeflag |= P_TREE_GRPEXITED;
864 * Check if exiting p orphans its own group.
867 if (isjobproc(jobc_parent(p, NULL), pgrp)) {
869 if (pgrp_calc_jobc(pgrp) == 0)
875 * Check this process' children to see whether they qualify
876 * their process groups after reparenting to reaper.
878 LIST_FOREACH(q, &p->p_children, p_sibling) {
881 if (pgrp_calc_jobc(pgrp) == 0) {
883 * We want to handle exactly the children that
884 * has p as realparent. Then, when calculating
885 * jobc_parent for children, we should ignore
886 * P_TREE_GRPEXITED flag already set on p.
888 if (jobc_parent(q, p) == p && isjobproc(p, pgrp))
891 pgrp->pg_flags &= ~PGRP_ORPHANED;
894 LIST_FOREACH(q, &p->p_orphans, p_orphan) {
897 if (pgrp_calc_jobc(pgrp) == 0) {
898 if (isjobproc(p, pgrp))
901 pgrp->pg_flags &= ~PGRP_ORPHANED;
915 MPASS(p->p_flag & P_WEXIT);
916 sx_assert(&proctree_lock, SX_LOCKED);
918 if (SESS_LEADER(p)) {
922 * s_ttyp is not zero'd; we use this to indicate that
923 * the session once had a controlling terminal. (for
924 * logging and informational purposes)
935 * Signal foreground pgrp and revoke access to
936 * controlling terminal if it has not been revoked
939 * Because the TTY may have been revoked in the mean
940 * time and could already have a new session associated
941 * with it, make sure we don't send a SIGHUP to a
942 * foreground process group that does not belong to this
948 if (tp->t_session == sp)
949 tty_signal_pgrp(tp, SIGHUP);
954 sx_xunlock(&proctree_lock);
955 if (vn_lock(ttyvp, LK_EXCLUSIVE) == 0) {
956 VOP_REVOKE(ttyvp, REVOKEALL);
959 devfs_ctty_unref(ttyvp);
960 sx_xlock(&proctree_lock);
967 * A process group has become orphaned, mark it as such for signal
968 * delivery code. If there are any stopped processes in the group,
969 * hang-up all process in that group.
972 orphanpg(struct pgrp *pg)
976 PGRP_LOCK_ASSERT(pg, MA_OWNED);
978 pg->pg_flags |= PGRP_ORPHANED;
980 LIST_FOREACH(p, &pg->pg_members, p_pglist) {
982 if (P_SHOULDSTOP(p) == P_STOPPED_SIG) {
984 LIST_FOREACH(p, &pg->pg_members, p_pglist) {
986 kern_psignal(p, SIGHUP);
987 kern_psignal(p, SIGCONT);
997 sess_hold(struct session *s)
1000 refcount_acquire(&s->s_count);
1004 sess_release(struct session *s)
1007 if (refcount_release(&s->s_count)) {
1008 if (s->s_ttyp != NULL) {
1009 tty_lock(s->s_ttyp);
1010 tty_rel_sess(s->s_ttyp, s);
1012 proc_id_clear(PROC_ID_SESSION, s->s_sid);
1013 mtx_destroy(&s->s_mtx);
1021 db_print_pgrp_one(struct pgrp *pgrp, struct proc *p)
1024 " pid %d at %p pr %d pgrp %p e %d jc %d\n",
1025 p->p_pid, p, p->p_pptr == NULL ? -1 : p->p_pptr->p_pid,
1026 p->p_pgrp, (p->p_treeflag & P_TREE_GRPEXITED) != 0,
1027 p->p_pptr == NULL ? 0 : isjobproc(p->p_pptr, pgrp));
1030 DB_SHOW_COMMAND_FLAGS(pgrpdump, pgrpdump, DB_CMD_MEMSAFE)
1036 for (i = 0; i <= pgrphash; i++) {
1037 if (!LIST_EMPTY(&pgrphashtbl[i])) {
1038 db_printf("indx %d\n", i);
1039 LIST_FOREACH(pgrp, &pgrphashtbl[i], pg_hash) {
1041 " pgrp %p, pgid %d, sess %p, sesscnt %d, mem %p\n",
1042 pgrp, (int)pgrp->pg_id, pgrp->pg_session,
1043 pgrp->pg_session->s_count,
1044 LIST_FIRST(&pgrp->pg_members));
1045 LIST_FOREACH(p, &pgrp->pg_members, p_pglist)
1046 db_print_pgrp_one(pgrp, p);
1054 * Calculate the kinfo_proc members which contain process-wide
1056 * Must be called with the target process locked.
1059 fill_kinfo_aggregate(struct proc *p, struct kinfo_proc *kp)
1063 PROC_LOCK_ASSERT(p, MA_OWNED);
1067 FOREACH_THREAD_IN_PROC(p, td) {
1069 kp->ki_pctcpu += sched_pctcpu(td);
1070 kp->ki_estcpu += sched_estcpu(td);
1076 * Fill in any information that is common to all threads in the process.
1077 * Must be called with the target process locked.
1080 fill_kinfo_proc_only(struct proc *p, struct kinfo_proc *kp)
1085 struct timeval boottime;
1087 PROC_LOCK_ASSERT(p, MA_OWNED);
1089 kp->ki_structsize = sizeof(*kp);
1091 kp->ki_addr =/* p->p_addr; */0; /* XXX */
1092 kp->ki_args = p->p_args;
1093 kp->ki_textvp = p->p_textvp;
1095 kp->ki_tracep = ktr_get_tracevp(p, false);
1096 kp->ki_traceflag = p->p_traceflag;
1098 kp->ki_fd = p->p_fd;
1099 kp->ki_pd = p->p_pd;
1100 kp->ki_vmspace = p->p_vmspace;
1101 kp->ki_flag = p->p_flag;
1102 kp->ki_flag2 = p->p_flag2;
1105 kp->ki_uid = cred->cr_uid;
1106 kp->ki_ruid = cred->cr_ruid;
1107 kp->ki_svuid = cred->cr_svuid;
1108 kp->ki_cr_flags = 0;
1109 if (cred->cr_flags & CRED_FLAG_CAPMODE)
1110 kp->ki_cr_flags |= KI_CRF_CAPABILITY_MODE;
1111 /* XXX bde doesn't like KI_NGROUPS */
1112 if (cred->cr_ngroups > KI_NGROUPS) {
1113 kp->ki_ngroups = KI_NGROUPS;
1114 kp->ki_cr_flags |= KI_CRF_GRP_OVERFLOW;
1116 kp->ki_ngroups = cred->cr_ngroups;
1117 bcopy(cred->cr_groups, kp->ki_groups,
1118 kp->ki_ngroups * sizeof(gid_t));
1119 kp->ki_rgid = cred->cr_rgid;
1120 kp->ki_svgid = cred->cr_svgid;
1121 /* If jailed(cred), emulate the old P_JAILED flag. */
1123 kp->ki_flag |= P_JAILED;
1124 /* If inside the jail, use 0 as a jail ID. */
1125 if (cred->cr_prison != curthread->td_ucred->cr_prison)
1126 kp->ki_jid = cred->cr_prison->pr_id;
1128 strlcpy(kp->ki_loginclass, cred->cr_loginclass->lc_name,
1129 sizeof(kp->ki_loginclass));
1133 mtx_lock(&ps->ps_mtx);
1134 kp->ki_sigignore = ps->ps_sigignore;
1135 kp->ki_sigcatch = ps->ps_sigcatch;
1136 mtx_unlock(&ps->ps_mtx);
1138 if (p->p_state != PRS_NEW &&
1139 p->p_state != PRS_ZOMBIE &&
1140 p->p_vmspace != NULL) {
1141 struct vmspace *vm = p->p_vmspace;
1143 kp->ki_size = vm->vm_map.size;
1144 kp->ki_rssize = vmspace_resident_count(vm); /*XXX*/
1145 FOREACH_THREAD_IN_PROC(p, td0) {
1146 if (!TD_IS_SWAPPED(td0))
1147 kp->ki_rssize += td0->td_kstack_pages;
1149 kp->ki_swrss = vm->vm_swrss;
1150 kp->ki_tsize = vm->vm_tsize;
1151 kp->ki_dsize = vm->vm_dsize;
1152 kp->ki_ssize = vm->vm_ssize;
1153 } else if (p->p_state == PRS_ZOMBIE)
1154 kp->ki_stat = SZOMB;
1155 if (kp->ki_flag & P_INMEM)
1156 kp->ki_sflag = PS_INMEM;
1159 /* Calculate legacy swtime as seconds since 'swtick'. */
1160 kp->ki_swtime = (ticks - p->p_swtick) / hz;
1161 kp->ki_pid = p->p_pid;
1162 kp->ki_nice = p->p_nice;
1163 kp->ki_fibnum = p->p_fibnum;
1164 kp->ki_start = p->p_stats->p_start;
1165 getboottime(&boottime);
1166 timevaladd(&kp->ki_start, &boottime);
1168 rufetch(p, &kp->ki_rusage);
1169 kp->ki_runtime = cputick2usec(p->p_rux.rux_runtime);
1170 calcru(p, &kp->ki_rusage.ru_utime, &kp->ki_rusage.ru_stime);
1172 calccru(p, &kp->ki_childutime, &kp->ki_childstime);
1173 /* Some callers want child times in a single value. */
1174 kp->ki_childtime = kp->ki_childstime;
1175 timevaladd(&kp->ki_childtime, &kp->ki_childutime);
1177 FOREACH_THREAD_IN_PROC(p, td0)
1178 kp->ki_cow += td0->td_cow;
1180 if (p->p_comm[0] != '\0')
1181 strlcpy(kp->ki_comm, p->p_comm, sizeof(kp->ki_comm));
1182 if (p->p_sysent && p->p_sysent->sv_name != NULL &&
1183 p->p_sysent->sv_name[0] != '\0')
1184 strlcpy(kp->ki_emul, p->p_sysent->sv_name, sizeof(kp->ki_emul));
1185 kp->ki_siglist = p->p_siglist;
1186 kp->ki_xstat = KW_EXITCODE(p->p_xexit, p->p_xsig);
1187 kp->ki_acflag = p->p_acflag;
1188 kp->ki_lock = p->p_lock;
1190 kp->ki_ppid = p->p_oppid;
1191 if (p->p_flag & P_TRACED)
1192 kp->ki_tracer = p->p_pptr->p_pid;
1197 * Fill job-related process information.
1200 fill_kinfo_proc_pgrp(struct proc *p, struct kinfo_proc *kp)
1206 sx_assert(&proctree_lock, SA_LOCKED);
1207 PROC_LOCK_ASSERT(p, MA_OWNED);
1213 kp->ki_pgid = pgrp->pg_id;
1214 kp->ki_jobc = pgrp_calc_jobc(pgrp);
1216 sp = pgrp->pg_session;
1220 kp->ki_sid = sp->s_sid;
1222 strlcpy(kp->ki_login, sp->s_login, sizeof(kp->ki_login));
1224 kp->ki_kiflag |= KI_CTTY;
1226 kp->ki_kiflag |= KI_SLEADER;
1231 if ((p->p_flag & P_CONTROLT) && tp != NULL) {
1232 kp->ki_tdev = tty_udev(tp);
1233 kp->ki_tdev_freebsd11 = kp->ki_tdev; /* truncate */
1234 kp->ki_tpgid = tp->t_pgrp ? tp->t_pgrp->pg_id : NO_PID;
1236 kp->ki_tsid = tp->t_session->s_sid;
1238 kp->ki_tdev = NODEV;
1239 kp->ki_tdev_freebsd11 = kp->ki_tdev; /* truncate */
1244 * Fill in information that is thread specific. Must be called with
1245 * target process locked. If 'preferthread' is set, overwrite certain
1246 * process-related fields that are maintained for both threads and
1250 fill_kinfo_thread(struct thread *td, struct kinfo_proc *kp, int preferthread)
1256 PROC_LOCK_ASSERT(p, MA_OWNED);
1261 if (td->td_wmesg != NULL)
1262 strlcpy(kp->ki_wmesg, td->td_wmesg, sizeof(kp->ki_wmesg));
1264 bzero(kp->ki_wmesg, sizeof(kp->ki_wmesg));
1265 if (strlcpy(kp->ki_tdname, td->td_name, sizeof(kp->ki_tdname)) >=
1266 sizeof(kp->ki_tdname)) {
1267 strlcpy(kp->ki_moretdname,
1268 td->td_name + sizeof(kp->ki_tdname) - 1,
1269 sizeof(kp->ki_moretdname));
1271 bzero(kp->ki_moretdname, sizeof(kp->ki_moretdname));
1273 if (TD_ON_LOCK(td)) {
1274 kp->ki_kiflag |= KI_LOCKBLOCK;
1275 strlcpy(kp->ki_lockname, td->td_lockname,
1276 sizeof(kp->ki_lockname));
1278 kp->ki_kiflag &= ~KI_LOCKBLOCK;
1279 bzero(kp->ki_lockname, sizeof(kp->ki_lockname));
1282 if (p->p_state == PRS_NORMAL) { /* approximate. */
1283 if (TD_ON_RUNQ(td) ||
1285 TD_IS_RUNNING(td)) {
1287 } else if (P_SHOULDSTOP(p)) {
1288 kp->ki_stat = SSTOP;
1289 } else if (TD_IS_SLEEPING(td)) {
1290 kp->ki_stat = SSLEEP;
1291 } else if (TD_ON_LOCK(td)) {
1292 kp->ki_stat = SLOCK;
1294 kp->ki_stat = SWAIT;
1296 } else if (p->p_state == PRS_ZOMBIE) {
1297 kp->ki_stat = SZOMB;
1302 /* Things in the thread */
1303 kp->ki_wchan = td->td_wchan;
1304 kp->ki_pri.pri_level = td->td_priority;
1305 kp->ki_pri.pri_native = td->td_base_pri;
1308 * Note: legacy fields; clamp at the old NOCPU value and/or
1309 * the maximum u_char CPU value.
1311 if (td->td_lastcpu == NOCPU)
1312 kp->ki_lastcpu_old = NOCPU_OLD;
1313 else if (td->td_lastcpu > MAXCPU_OLD)
1314 kp->ki_lastcpu_old = MAXCPU_OLD;
1316 kp->ki_lastcpu_old = td->td_lastcpu;
1318 if (td->td_oncpu == NOCPU)
1319 kp->ki_oncpu_old = NOCPU_OLD;
1320 else if (td->td_oncpu > MAXCPU_OLD)
1321 kp->ki_oncpu_old = MAXCPU_OLD;
1323 kp->ki_oncpu_old = td->td_oncpu;
1325 kp->ki_lastcpu = td->td_lastcpu;
1326 kp->ki_oncpu = td->td_oncpu;
1327 kp->ki_tdflags = td->td_flags;
1328 kp->ki_tid = td->td_tid;
1329 kp->ki_numthreads = p->p_numthreads;
1330 kp->ki_pcb = td->td_pcb;
1331 kp->ki_kstack = (void *)td->td_kstack;
1332 kp->ki_slptime = (ticks - td->td_slptick) / hz;
1333 kp->ki_pri.pri_class = td->td_pri_class;
1334 kp->ki_pri.pri_user = td->td_user_pri;
1337 rufetchtd(td, &kp->ki_rusage);
1338 kp->ki_runtime = cputick2usec(td->td_rux.rux_runtime);
1339 kp->ki_pctcpu = sched_pctcpu(td);
1340 kp->ki_estcpu = sched_estcpu(td);
1341 kp->ki_cow = td->td_cow;
1344 /* We can't get this anymore but ps etc never used it anyway. */
1348 kp->ki_siglist = td->td_siglist;
1349 kp->ki_sigmask = td->td_sigmask;
1356 * Fill in a kinfo_proc structure for the specified process.
1357 * Must be called with the target process locked.
1360 fill_kinfo_proc(struct proc *p, struct kinfo_proc *kp)
1362 MPASS(FIRST_THREAD_IN_PROC(p) != NULL);
1364 bzero(kp, sizeof(*kp));
1366 fill_kinfo_proc_pgrp(p,kp);
1367 fill_kinfo_proc_only(p, kp);
1368 fill_kinfo_thread(FIRST_THREAD_IN_PROC(p), kp, 0);
1369 fill_kinfo_aggregate(p, kp);
1376 return (malloc(sizeof(struct pstats), M_SUBPROC, M_ZERO|M_WAITOK));
1380 * Copy parts of p_stats; zero the rest of p_stats (statistics).
1383 pstats_fork(struct pstats *src, struct pstats *dst)
1386 bzero(&dst->pstat_startzero,
1387 __rangeof(struct pstats, pstat_startzero, pstat_endzero));
1388 bcopy(&src->pstat_startcopy, &dst->pstat_startcopy,
1389 __rangeof(struct pstats, pstat_startcopy, pstat_endcopy));
1393 pstats_free(struct pstats *ps)
1396 free(ps, M_SUBPROC);
1399 #ifdef COMPAT_FREEBSD32
1402 * This function is typically used to copy out the kernel address, so
1403 * it can be replaced by assignment of zero.
1405 static inline uint32_t
1406 ptr32_trim(const void *ptr)
1410 uptr = (uintptr_t)ptr;
1411 return ((uptr > UINT_MAX) ? 0 : uptr);
1414 #define PTRTRIM_CP(src,dst,fld) \
1415 do { (dst).fld = ptr32_trim((src).fld); } while (0)
1418 freebsd32_kinfo_proc_out(const struct kinfo_proc *ki, struct kinfo_proc32 *ki32)
1422 bzero(ki32, sizeof(struct kinfo_proc32));
1423 ki32->ki_structsize = sizeof(struct kinfo_proc32);
1424 CP(*ki, *ki32, ki_layout);
1425 PTRTRIM_CP(*ki, *ki32, ki_args);
1426 PTRTRIM_CP(*ki, *ki32, ki_paddr);
1427 PTRTRIM_CP(*ki, *ki32, ki_addr);
1428 PTRTRIM_CP(*ki, *ki32, ki_tracep);
1429 PTRTRIM_CP(*ki, *ki32, ki_textvp);
1430 PTRTRIM_CP(*ki, *ki32, ki_fd);
1431 PTRTRIM_CP(*ki, *ki32, ki_vmspace);
1432 PTRTRIM_CP(*ki, *ki32, ki_wchan);
1433 CP(*ki, *ki32, ki_pid);
1434 CP(*ki, *ki32, ki_ppid);
1435 CP(*ki, *ki32, ki_pgid);
1436 CP(*ki, *ki32, ki_tpgid);
1437 CP(*ki, *ki32, ki_sid);
1438 CP(*ki, *ki32, ki_tsid);
1439 CP(*ki, *ki32, ki_jobc);
1440 CP(*ki, *ki32, ki_tdev);
1441 CP(*ki, *ki32, ki_tdev_freebsd11);
1442 CP(*ki, *ki32, ki_siglist);
1443 CP(*ki, *ki32, ki_sigmask);
1444 CP(*ki, *ki32, ki_sigignore);
1445 CP(*ki, *ki32, ki_sigcatch);
1446 CP(*ki, *ki32, ki_uid);
1447 CP(*ki, *ki32, ki_ruid);
1448 CP(*ki, *ki32, ki_svuid);
1449 CP(*ki, *ki32, ki_rgid);
1450 CP(*ki, *ki32, ki_svgid);
1451 CP(*ki, *ki32, ki_ngroups);
1452 for (i = 0; i < KI_NGROUPS; i++)
1453 CP(*ki, *ki32, ki_groups[i]);
1454 CP(*ki, *ki32, ki_size);
1455 CP(*ki, *ki32, ki_rssize);
1456 CP(*ki, *ki32, ki_swrss);
1457 CP(*ki, *ki32, ki_tsize);
1458 CP(*ki, *ki32, ki_dsize);
1459 CP(*ki, *ki32, ki_ssize);
1460 CP(*ki, *ki32, ki_xstat);
1461 CP(*ki, *ki32, ki_acflag);
1462 CP(*ki, *ki32, ki_pctcpu);
1463 CP(*ki, *ki32, ki_estcpu);
1464 CP(*ki, *ki32, ki_slptime);
1465 CP(*ki, *ki32, ki_swtime);
1466 CP(*ki, *ki32, ki_cow);
1467 CP(*ki, *ki32, ki_runtime);
1468 TV_CP(*ki, *ki32, ki_start);
1469 TV_CP(*ki, *ki32, ki_childtime);
1470 CP(*ki, *ki32, ki_flag);
1471 CP(*ki, *ki32, ki_kiflag);
1472 CP(*ki, *ki32, ki_traceflag);
1473 CP(*ki, *ki32, ki_stat);
1474 CP(*ki, *ki32, ki_nice);
1475 CP(*ki, *ki32, ki_lock);
1476 CP(*ki, *ki32, ki_rqindex);
1477 CP(*ki, *ki32, ki_oncpu);
1478 CP(*ki, *ki32, ki_lastcpu);
1480 /* XXX TODO: wrap cpu value as appropriate */
1481 CP(*ki, *ki32, ki_oncpu_old);
1482 CP(*ki, *ki32, ki_lastcpu_old);
1484 bcopy(ki->ki_tdname, ki32->ki_tdname, TDNAMLEN + 1);
1485 bcopy(ki->ki_wmesg, ki32->ki_wmesg, WMESGLEN + 1);
1486 bcopy(ki->ki_login, ki32->ki_login, LOGNAMELEN + 1);
1487 bcopy(ki->ki_lockname, ki32->ki_lockname, LOCKNAMELEN + 1);
1488 bcopy(ki->ki_comm, ki32->ki_comm, COMMLEN + 1);
1489 bcopy(ki->ki_emul, ki32->ki_emul, KI_EMULNAMELEN + 1);
1490 bcopy(ki->ki_loginclass, ki32->ki_loginclass, LOGINCLASSLEN + 1);
1491 bcopy(ki->ki_moretdname, ki32->ki_moretdname, MAXCOMLEN - TDNAMLEN + 1);
1492 CP(*ki, *ki32, ki_tracer);
1493 CP(*ki, *ki32, ki_flag2);
1494 CP(*ki, *ki32, ki_fibnum);
1495 CP(*ki, *ki32, ki_cr_flags);
1496 CP(*ki, *ki32, ki_jid);
1497 CP(*ki, *ki32, ki_numthreads);
1498 CP(*ki, *ki32, ki_tid);
1499 CP(*ki, *ki32, ki_pri);
1500 freebsd32_rusage_out(&ki->ki_rusage, &ki32->ki_rusage);
1501 freebsd32_rusage_out(&ki->ki_rusage_ch, &ki32->ki_rusage_ch);
1502 PTRTRIM_CP(*ki, *ki32, ki_pcb);
1503 PTRTRIM_CP(*ki, *ki32, ki_kstack);
1504 PTRTRIM_CP(*ki, *ki32, ki_udata);
1505 PTRTRIM_CP(*ki, *ki32, ki_tdaddr);
1506 CP(*ki, *ki32, ki_sflag);
1507 CP(*ki, *ki32, ki_tdflags);
1512 kern_proc_out_size(struct proc *p, int flags)
1516 PROC_LOCK_ASSERT(p, MA_OWNED);
1518 if ((flags & KERN_PROC_NOTHREADS) != 0) {
1519 #ifdef COMPAT_FREEBSD32
1520 if ((flags & KERN_PROC_MASK32) != 0) {
1521 size += sizeof(struct kinfo_proc32);
1524 size += sizeof(struct kinfo_proc);
1526 #ifdef COMPAT_FREEBSD32
1527 if ((flags & KERN_PROC_MASK32) != 0)
1528 size += sizeof(struct kinfo_proc32) * p->p_numthreads;
1531 size += sizeof(struct kinfo_proc) * p->p_numthreads;
1538 kern_proc_out(struct proc *p, struct sbuf *sb, int flags)
1541 struct kinfo_proc ki;
1542 #ifdef COMPAT_FREEBSD32
1543 struct kinfo_proc32 ki32;
1547 PROC_LOCK_ASSERT(p, MA_OWNED);
1548 MPASS(FIRST_THREAD_IN_PROC(p) != NULL);
1551 fill_kinfo_proc(p, &ki);
1552 if ((flags & KERN_PROC_NOTHREADS) != 0) {
1553 #ifdef COMPAT_FREEBSD32
1554 if ((flags & KERN_PROC_MASK32) != 0) {
1555 freebsd32_kinfo_proc_out(&ki, &ki32);
1556 if (sbuf_bcat(sb, &ki32, sizeof(ki32)) != 0)
1560 if (sbuf_bcat(sb, &ki, sizeof(ki)) != 0)
1563 FOREACH_THREAD_IN_PROC(p, td) {
1564 fill_kinfo_thread(td, &ki, 1);
1565 #ifdef COMPAT_FREEBSD32
1566 if ((flags & KERN_PROC_MASK32) != 0) {
1567 freebsd32_kinfo_proc_out(&ki, &ki32);
1568 if (sbuf_bcat(sb, &ki32, sizeof(ki32)) != 0)
1572 if (sbuf_bcat(sb, &ki, sizeof(ki)) != 0)
1583 sysctl_out_proc(struct proc *p, struct sysctl_req *req, int flags)
1586 struct kinfo_proc ki;
1589 if (req->oldptr == NULL)
1590 return (SYSCTL_OUT(req, 0, kern_proc_out_size(p, flags)));
1592 sbuf_new_for_sysctl(&sb, (char *)&ki, sizeof(ki), req);
1593 sbuf_clear_flags(&sb, SBUF_INCLUDENUL);
1594 error = kern_proc_out(p, &sb, flags);
1595 error2 = sbuf_finish(&sb);
1599 else if (error2 != 0)
1605 proc_iterate(int (*cb)(struct proc *, void *), void *cbarg)
1610 for (i = 0; i < pidhashlock + 1; i++) {
1611 sx_slock(&proctree_lock);
1612 sx_slock(&pidhashtbl_lock[i]);
1613 for (j = i; j <= pidhash; j += pidhashlock + 1) {
1614 LIST_FOREACH(p, &pidhashtbl[j], p_hash) {
1615 if (p->p_state == PRS_NEW)
1617 error = cb(p, cbarg);
1618 PROC_LOCK_ASSERT(p, MA_NOTOWNED);
1620 sx_sunlock(&pidhashtbl_lock[i]);
1621 sx_sunlock(&proctree_lock);
1626 sx_sunlock(&pidhashtbl_lock[i]);
1627 sx_sunlock(&proctree_lock);
1632 struct kern_proc_out_args {
1633 struct sysctl_req *req;
1640 sysctl_kern_proc_iterate(struct proc *p, void *origarg)
1642 struct kern_proc_out_args *arg = origarg;
1643 int *name = arg->name;
1644 int oid_number = arg->oid_number;
1645 int flags = arg->flags;
1646 struct sysctl_req *req = arg->req;
1651 KASSERT(p->p_ucred != NULL,
1652 ("process credential is NULL for non-NEW proc"));
1654 * Show a user only appropriate processes.
1656 if (p_cansee(curthread, p))
1659 * TODO - make more efficient (see notes below).
1662 switch (oid_number) {
1664 if (p->p_ucred->cr_gid != (gid_t)name[0])
1668 case KERN_PROC_PGRP:
1669 /* could do this by traversing pgrp */
1670 if (p->p_pgrp == NULL ||
1671 p->p_pgrp->pg_id != (pid_t)name[0])
1675 case KERN_PROC_RGID:
1676 if (p->p_ucred->cr_rgid != (gid_t)name[0])
1680 case KERN_PROC_SESSION:
1681 if (p->p_session == NULL ||
1682 p->p_session->s_sid != (pid_t)name[0])
1687 if ((p->p_flag & P_CONTROLT) == 0 ||
1688 p->p_session == NULL)
1690 /* XXX proctree_lock */
1691 SESS_LOCK(p->p_session);
1692 if (p->p_session->s_ttyp == NULL ||
1693 tty_udev(p->p_session->s_ttyp) !=
1695 SESS_UNLOCK(p->p_session);
1698 SESS_UNLOCK(p->p_session);
1702 if (p->p_ucred->cr_uid != (uid_t)name[0])
1706 case KERN_PROC_RUID:
1707 if (p->p_ucred->cr_ruid != (uid_t)name[0])
1711 case KERN_PROC_PROC:
1717 error = sysctl_out_proc(p, req, flags);
1718 PROC_LOCK_ASSERT(p, MA_NOTOWNED);
1726 sysctl_kern_proc(SYSCTL_HANDLER_ARGS)
1728 struct kern_proc_out_args iterarg;
1729 int *name = (int *)arg1;
1730 u_int namelen = arg2;
1732 int flags, oid_number;
1735 oid_number = oidp->oid_number;
1736 if (oid_number != KERN_PROC_ALL &&
1737 (oid_number & KERN_PROC_INC_THREAD) == 0)
1738 flags = KERN_PROC_NOTHREADS;
1741 oid_number &= ~KERN_PROC_INC_THREAD;
1743 #ifdef COMPAT_FREEBSD32
1744 if (req->flags & SCTL_MASK32)
1745 flags |= KERN_PROC_MASK32;
1747 if (oid_number == KERN_PROC_PID) {
1750 error = sysctl_wire_old_buffer(req, 0);
1753 sx_slock(&proctree_lock);
1754 error = pget((pid_t)name[0], PGET_CANSEE, &p);
1756 error = sysctl_out_proc(p, req, flags);
1757 sx_sunlock(&proctree_lock);
1761 switch (oid_number) {
1766 case KERN_PROC_PROC:
1767 if (namelen != 0 && namelen != 1)
1776 if (req->oldptr == NULL) {
1777 /* overestimate by 5 procs */
1778 error = SYSCTL_OUT(req, 0, sizeof (struct kinfo_proc) * 5);
1782 error = sysctl_wire_old_buffer(req, 0);
1786 iterarg.flags = flags;
1787 iterarg.oid_number = oid_number;
1789 iterarg.name = name;
1790 error = proc_iterate(sysctl_kern_proc_iterate, &iterarg);
1795 pargs_alloc(int len)
1799 pa = malloc(sizeof(struct pargs) + len, M_PARGS,
1801 refcount_init(&pa->ar_ref, 1);
1802 pa->ar_length = len;
1807 pargs_free(struct pargs *pa)
1814 pargs_hold(struct pargs *pa)
1819 refcount_acquire(&pa->ar_ref);
1823 pargs_drop(struct pargs *pa)
1828 if (refcount_release(&pa->ar_ref))
1833 proc_read_string(struct thread *td, struct proc *p, const char *sptr, char *buf,
1839 * This may return a short read if the string is shorter than the chunk
1840 * and is aligned at the end of the page, and the following page is not
1843 n = proc_readmem(td, p, (vm_offset_t)sptr, buf, len);
1849 #define PROC_AUXV_MAX 256 /* Safety limit on auxv size. */
1851 enum proc_vector_type {
1857 #ifdef COMPAT_FREEBSD32
1859 get_proc_vector32(struct thread *td, struct proc *p, char ***proc_vectorp,
1860 size_t *vsizep, enum proc_vector_type type)
1862 struct freebsd32_ps_strings pss;
1864 vm_offset_t vptr, ptr;
1865 uint32_t *proc_vector32;
1871 if (proc_readmem(td, p, PROC_PS_STRINGS(p), &pss, sizeof(pss)) !=
1876 vptr = (vm_offset_t)PTRIN(pss.ps_argvstr);
1877 vsize = pss.ps_nargvstr;
1878 if (vsize > ARG_MAX)
1880 size = vsize * sizeof(int32_t);
1883 vptr = (vm_offset_t)PTRIN(pss.ps_envstr);
1884 vsize = pss.ps_nenvstr;
1885 if (vsize > ARG_MAX)
1887 size = vsize * sizeof(int32_t);
1890 vptr = (vm_offset_t)PTRIN(pss.ps_envstr) +
1891 (pss.ps_nenvstr + 1) * sizeof(int32_t);
1894 for (ptr = vptr, i = 0; i < PROC_AUXV_MAX; i++) {
1895 if (proc_readmem(td, p, ptr, &aux, sizeof(aux)) !=
1898 if (aux.a_type == AT_NULL)
1902 if (aux.a_type != AT_NULL)
1905 size = vsize * sizeof(aux);
1908 KASSERT(0, ("Wrong proc vector type: %d", type));
1911 proc_vector32 = malloc(size, M_TEMP, M_WAITOK);
1912 if (proc_readmem(td, p, vptr, proc_vector32, size) != size) {
1916 if (type == PROC_AUX) {
1917 *proc_vectorp = (char **)proc_vector32;
1921 proc_vector = malloc(vsize * sizeof(char *), M_TEMP, M_WAITOK);
1922 for (i = 0; i < (int)vsize; i++)
1923 proc_vector[i] = PTRIN(proc_vector32[i]);
1924 *proc_vectorp = proc_vector;
1927 free(proc_vector32, M_TEMP);
1933 get_proc_vector(struct thread *td, struct proc *p, char ***proc_vectorp,
1934 size_t *vsizep, enum proc_vector_type type)
1936 struct ps_strings pss;
1938 vm_offset_t vptr, ptr;
1943 #ifdef COMPAT_FREEBSD32
1944 if (SV_PROC_FLAG(p, SV_ILP32) != 0)
1945 return (get_proc_vector32(td, p, proc_vectorp, vsizep, type));
1947 if (proc_readmem(td, p, PROC_PS_STRINGS(p), &pss, sizeof(pss)) !=
1952 vptr = (vm_offset_t)pss.ps_argvstr;
1953 vsize = pss.ps_nargvstr;
1954 if (vsize > ARG_MAX)
1956 size = vsize * sizeof(char *);
1959 vptr = (vm_offset_t)pss.ps_envstr;
1960 vsize = pss.ps_nenvstr;
1961 if (vsize > ARG_MAX)
1963 size = vsize * sizeof(char *);
1967 * The aux array is just above env array on the stack. Check
1968 * that the address is naturally aligned.
1970 vptr = (vm_offset_t)pss.ps_envstr + (pss.ps_nenvstr + 1)
1972 #if __ELF_WORD_SIZE == 64
1973 if (vptr % sizeof(uint64_t) != 0)
1975 if (vptr % sizeof(uint32_t) != 0)
1979 * We count the array size reading the aux vectors from the
1980 * stack until AT_NULL vector is returned. So (to keep the code
1981 * simple) we read the process stack twice: the first time here
1982 * to find the size and the second time when copying the vectors
1983 * to the allocated proc_vector.
1985 for (ptr = vptr, i = 0; i < PROC_AUXV_MAX; i++) {
1986 if (proc_readmem(td, p, ptr, &aux, sizeof(aux)) !=
1989 if (aux.a_type == AT_NULL)
1994 * If the PROC_AUXV_MAX entries are iterated over, and we have
1995 * not reached AT_NULL, it is most likely we are reading wrong
1996 * data: either the process doesn't have auxv array or data has
1997 * been modified. Return the error in this case.
1999 if (aux.a_type != AT_NULL)
2002 size = vsize * sizeof(aux);
2005 KASSERT(0, ("Wrong proc vector type: %d", type));
2006 return (EINVAL); /* In case we are built without INVARIANTS. */
2008 proc_vector = malloc(size, M_TEMP, M_WAITOK);
2009 if (proc_readmem(td, p, vptr, proc_vector, size) != size) {
2010 free(proc_vector, M_TEMP);
2013 *proc_vectorp = proc_vector;
2019 #define GET_PS_STRINGS_CHUNK_SZ 256 /* Chunk size (bytes) for ps_strings operations. */
2022 get_ps_strings(struct thread *td, struct proc *p, struct sbuf *sb,
2023 enum proc_vector_type type)
2025 size_t done, len, nchr, vsize;
2027 char **proc_vector, *sptr;
2028 char pss_string[GET_PS_STRINGS_CHUNK_SZ];
2030 PROC_ASSERT_HELD(p);
2033 * We are not going to read more than 2 * (PATH_MAX + ARG_MAX) bytes.
2035 nchr = 2 * (PATH_MAX + ARG_MAX);
2037 error = get_proc_vector(td, p, &proc_vector, &vsize, type);
2040 for (done = 0, i = 0; i < (int)vsize && done < nchr; i++) {
2042 * The program may have scribbled into its argv array, e.g. to
2043 * remove some arguments. If that has happened, break out
2044 * before trying to read from NULL.
2046 if (proc_vector[i] == NULL)
2048 for (sptr = proc_vector[i]; ; sptr += GET_PS_STRINGS_CHUNK_SZ) {
2049 error = proc_read_string(td, p, sptr, pss_string,
2050 sizeof(pss_string));
2053 len = strnlen(pss_string, GET_PS_STRINGS_CHUNK_SZ);
2054 if (done + len >= nchr)
2055 len = nchr - done - 1;
2056 sbuf_bcat(sb, pss_string, len);
2057 if (len != GET_PS_STRINGS_CHUNK_SZ)
2059 done += GET_PS_STRINGS_CHUNK_SZ;
2061 sbuf_bcat(sb, "", 1);
2065 free(proc_vector, M_TEMP);
2070 proc_getargv(struct thread *td, struct proc *p, struct sbuf *sb)
2073 return (get_ps_strings(curthread, p, sb, PROC_ARG));
2077 proc_getenvv(struct thread *td, struct proc *p, struct sbuf *sb)
2080 return (get_ps_strings(curthread, p, sb, PROC_ENV));
2084 proc_getauxv(struct thread *td, struct proc *p, struct sbuf *sb)
2090 error = get_proc_vector(td, p, &auxv, &vsize, PROC_AUX);
2092 #ifdef COMPAT_FREEBSD32
2093 if (SV_PROC_FLAG(p, SV_ILP32) != 0)
2094 size = vsize * sizeof(Elf32_Auxinfo);
2097 size = vsize * sizeof(Elf_Auxinfo);
2098 if (sbuf_bcat(sb, auxv, size) != 0)
2106 * This sysctl allows a process to retrieve the argument list or process
2107 * title for another process without groping around in the address space
2108 * of the other process. It also allow a process to set its own "process
2109 * title to a string of its own choice.
2112 sysctl_kern_proc_args(SYSCTL_HANDLER_ARGS)
2114 int *name = (int *)arg1;
2115 u_int namelen = arg2;
2116 struct pargs *newpa, *pa;
2119 int flags, error = 0, error2;
2126 pid = (pid_t)name[0];
2132 * If the query is for this process and it is single-threaded, there
2133 * is nobody to modify pargs, thus we can just read.
2135 if (pid == p->p_pid && p->p_numthreads == 1 && req->newptr == NULL &&
2136 (pa = p->p_args) != NULL)
2137 return (SYSCTL_OUT(req, pa->ar_args, pa->ar_length));
2139 flags = PGET_CANSEE;
2140 if (req->newptr != NULL)
2141 flags |= PGET_ISCURRENT;
2142 error = pget(pid, flags, &p);
2150 error = SYSCTL_OUT(req, pa->ar_args, pa->ar_length);
2152 } else if ((p->p_flag & (P_WEXIT | P_SYSTEM)) == 0) {
2155 sbuf_new_for_sysctl(&sb, NULL, GET_PS_STRINGS_CHUNK_SZ, req);
2156 sbuf_clear_flags(&sb, SBUF_INCLUDENUL);
2157 error = proc_getargv(curthread, p, &sb);
2158 error2 = sbuf_finish(&sb);
2161 if (error == 0 && error2 != 0)
2166 if (error != 0 || req->newptr == NULL)
2169 if (req->newlen > ps_arg_cache_limit - sizeof(struct pargs))
2172 if (req->newlen == 0) {
2174 * Clear the argument pointer, so that we'll fetch arguments
2175 * with proc_getargv() until further notice.
2179 newpa = pargs_alloc(req->newlen);
2180 error = SYSCTL_IN(req, newpa->ar_args, req->newlen);
2195 * This sysctl allows a process to retrieve environment of another process.
2198 sysctl_kern_proc_env(SYSCTL_HANDLER_ARGS)
2200 int *name = (int *)arg1;
2201 u_int namelen = arg2;
2209 error = pget((pid_t)name[0], PGET_WANTREAD, &p);
2212 if ((p->p_flag & P_SYSTEM) != 0) {
2217 sbuf_new_for_sysctl(&sb, NULL, GET_PS_STRINGS_CHUNK_SZ, req);
2218 sbuf_clear_flags(&sb, SBUF_INCLUDENUL);
2219 error = proc_getenvv(curthread, p, &sb);
2220 error2 = sbuf_finish(&sb);
2223 return (error != 0 ? error : error2);
2227 * This sysctl allows a process to retrieve ELF auxiliary vector of
2231 sysctl_kern_proc_auxv(SYSCTL_HANDLER_ARGS)
2233 int *name = (int *)arg1;
2234 u_int namelen = arg2;
2242 error = pget((pid_t)name[0], PGET_WANTREAD, &p);
2245 if ((p->p_flag & P_SYSTEM) != 0) {
2249 sbuf_new_for_sysctl(&sb, NULL, GET_PS_STRINGS_CHUNK_SZ, req);
2250 sbuf_clear_flags(&sb, SBUF_INCLUDENUL);
2251 error = proc_getauxv(curthread, p, &sb);
2252 error2 = sbuf_finish(&sb);
2255 return (error != 0 ? error : error2);
2259 * Look up the canonical executable path running in the specified process.
2260 * It tries to return the same hardlink name as was used for execve(2).
2261 * This allows the programs that modify their behavior based on their progname,
2262 * to operate correctly.
2264 * Result is returned in retbuf, it must not be freed, similar to vn_fullpath()
2265 * calling conventions.
2266 * binname is a pointer to temporary string buffer of length MAXPATHLEN,
2267 * allocated and freed by caller.
2268 * freebuf should be freed by caller, from the M_TEMP malloc type.
2271 proc_get_binpath(struct proc *p, char *binname, char **retbuf,
2274 struct nameidata nd;
2275 struct vnode *vp, *dvp;
2276 size_t freepath_size;
2280 PROC_LOCK_ASSERT(p, MA_OWNED);
2293 if (p->p_binname != NULL)
2294 strlcpy(binname, p->p_binname, MAXPATHLEN);
2299 if (dvp != NULL && binname[0] != '\0') {
2300 freepath_size = MAXPATHLEN;
2301 if (vn_fullpath_hardlink(vp, dvp, binname, strlen(binname),
2302 retbuf, freebuf, &freepath_size) == 0) {
2304 * Recheck the looked up path. The binary
2305 * might have been renamed or replaced, in
2306 * which case we should not report old name.
2308 NDINIT(&nd, LOOKUP, FOLLOW, UIO_SYSSPACE, *retbuf);
2312 do_fullpath = false;
2319 free(*freebuf, M_TEMP);
2321 error = vn_fullpath(vp, retbuf, freebuf);
2330 * This sysctl allows a process to retrieve the path of the executable for
2331 * itself or another process.
2334 sysctl_kern_proc_pathname(SYSCTL_HANDLER_ARGS)
2336 pid_t *pidp = (pid_t *)arg1;
2337 unsigned int arglen = arg2;
2339 char *retbuf, *freebuf, *binname;
2344 binname = malloc(MAXPATHLEN, M_TEMP, M_WAITOK);
2346 if (*pidp == -1) { /* -1 means this process */
2348 p = req->td->td_proc;
2351 error = pget(*pidp, PGET_CANSEE, &p);
2355 error = proc_get_binpath(p, binname, &retbuf, &freebuf);
2356 free(binname, M_TEMP);
2359 error = SYSCTL_OUT(req, retbuf, strlen(retbuf) + 1);
2360 free(freebuf, M_TEMP);
2365 sysctl_kern_proc_sv_name(SYSCTL_HANDLER_ARGS)
2378 error = pget((pid_t)name[0], PGET_CANSEE, &p);
2381 sv_name = p->p_sysent->sv_name;
2383 return (sysctl_handle_string(oidp, sv_name, 0, req));
2386 #ifdef KINFO_OVMENTRY_SIZE
2387 CTASSERT(sizeof(struct kinfo_ovmentry) == KINFO_OVMENTRY_SIZE);
2390 #ifdef COMPAT_FREEBSD7
2392 sysctl_kern_proc_ovmmap(SYSCTL_HANDLER_ARGS)
2394 vm_map_entry_t entry, tmp_entry;
2395 unsigned int last_timestamp, namelen;
2396 char *fullpath, *freepath;
2397 struct kinfo_ovmentry *kve;
2411 error = pget((pid_t)name[0], PGET_WANTREAD, &p);
2414 vm = vmspace_acquire_ref(p);
2419 kve = malloc(sizeof(*kve), M_TEMP, M_WAITOK);
2422 vm_map_lock_read(map);
2423 VM_MAP_ENTRY_FOREACH(entry, map) {
2424 vm_object_t obj, tobj, lobj;
2427 if (entry->eflags & MAP_ENTRY_IS_SUB_MAP)
2430 bzero(kve, sizeof(*kve));
2431 kve->kve_structsize = sizeof(*kve);
2433 kve->kve_private_resident = 0;
2434 obj = entry->object.vm_object;
2436 VM_OBJECT_RLOCK(obj);
2437 if (obj->shadow_count == 1)
2438 kve->kve_private_resident =
2439 obj->resident_page_count;
2441 kve->kve_resident = 0;
2442 addr = entry->start;
2443 while (addr < entry->end) {
2444 if (pmap_extract(map->pmap, addr))
2445 kve->kve_resident++;
2449 for (lobj = tobj = obj; tobj; tobj = tobj->backing_object) {
2451 VM_OBJECT_RLOCK(tobj);
2452 kve->kve_offset += tobj->backing_object_offset;
2455 VM_OBJECT_RUNLOCK(lobj);
2459 kve->kve_start = (void*)entry->start;
2460 kve->kve_end = (void*)entry->end;
2461 kve->kve_offset += (off_t)entry->offset;
2463 if (entry->protection & VM_PROT_READ)
2464 kve->kve_protection |= KVME_PROT_READ;
2465 if (entry->protection & VM_PROT_WRITE)
2466 kve->kve_protection |= KVME_PROT_WRITE;
2467 if (entry->protection & VM_PROT_EXECUTE)
2468 kve->kve_protection |= KVME_PROT_EXEC;
2470 if (entry->eflags & MAP_ENTRY_COW)
2471 kve->kve_flags |= KVME_FLAG_COW;
2472 if (entry->eflags & MAP_ENTRY_NEEDS_COPY)
2473 kve->kve_flags |= KVME_FLAG_NEEDS_COPY;
2474 if (entry->eflags & MAP_ENTRY_NOCOREDUMP)
2475 kve->kve_flags |= KVME_FLAG_NOCOREDUMP;
2477 last_timestamp = map->timestamp;
2478 vm_map_unlock_read(map);
2480 kve->kve_fileid = 0;
2485 kve->kve_type = vm_object_kvme_type(lobj, &vp);
2486 if (kve->kve_type == KVME_TYPE_MGTDEVICE)
2487 kve->kve_type = KVME_TYPE_UNKNOWN;
2491 VM_OBJECT_RUNLOCK(lobj);
2493 kve->kve_ref_count = obj->ref_count;
2494 kve->kve_shadow_count = obj->shadow_count;
2495 VM_OBJECT_RUNLOCK(obj);
2497 vn_fullpath(vp, &fullpath, &freepath);
2498 cred = curthread->td_ucred;
2499 vn_lock(vp, LK_SHARED | LK_RETRY);
2500 if (VOP_GETATTR(vp, &va, cred) == 0) {
2501 kve->kve_fileid = va.va_fileid;
2503 kve->kve_fsid = va.va_fsid;
2508 kve->kve_type = KVME_TYPE_NONE;
2509 kve->kve_ref_count = 0;
2510 kve->kve_shadow_count = 0;
2513 strlcpy(kve->kve_path, fullpath, sizeof(kve->kve_path));
2514 if (freepath != NULL)
2515 free(freepath, M_TEMP);
2517 error = SYSCTL_OUT(req, kve, sizeof(*kve));
2518 vm_map_lock_read(map);
2521 if (last_timestamp != map->timestamp) {
2522 vm_map_lookup_entry(map, addr - 1, &tmp_entry);
2526 vm_map_unlock_read(map);
2532 #endif /* COMPAT_FREEBSD7 */
2534 #ifdef KINFO_VMENTRY_SIZE
2535 CTASSERT(sizeof(struct kinfo_vmentry) == KINFO_VMENTRY_SIZE);
2539 kern_proc_vmmap_resident(vm_map_t map, vm_map_entry_t entry,
2540 int *resident_count, bool *super)
2542 vm_object_t obj, tobj;
2546 vm_pindex_t pi, pi_adv, pindex;
2549 *resident_count = 0;
2550 if (vmmap_skip_res_cnt)
2554 obj = entry->object.vm_object;
2555 addr = entry->start;
2557 pi = OFF_TO_IDX(entry->offset);
2558 for (; addr < entry->end; addr += IDX_TO_OFF(pi_adv), pi += pi_adv) {
2559 if (m_adv != NULL) {
2562 pi_adv = atop(entry->end - addr);
2564 for (tobj = obj;; tobj = tobj->backing_object) {
2565 m = vm_page_find_least(tobj, pindex);
2567 if (m->pindex == pindex)
2569 if (pi_adv > m->pindex - pindex) {
2570 pi_adv = m->pindex - pindex;
2574 if (tobj->backing_object == NULL)
2576 pindex += OFF_TO_IDX(tobj->
2577 backing_object_offset);
2581 if (m->psind != 0 && addr + pagesizes[1] <= entry->end &&
2582 (addr & (pagesizes[1] - 1)) == 0 &&
2583 (pmap_mincore(map->pmap, addr, &pa) & MINCORE_SUPER) != 0) {
2585 pi_adv = atop(pagesizes[1]);
2588 * We do not test the found page on validity.
2589 * Either the page is busy and being paged in,
2590 * or it was invalidated. The first case
2591 * should be counted as resident, the second
2592 * is not so clear; we do account both.
2596 *resident_count += pi_adv;
2602 * Must be called with the process locked and will return unlocked.
2605 kern_proc_vmmap_out(struct proc *p, struct sbuf *sb, ssize_t maxlen, int flags)
2607 vm_map_entry_t entry, tmp_entry;
2610 vm_object_t lobj, nobj, obj, tobj;
2611 char *fullpath, *freepath;
2612 struct kinfo_vmentry *kve;
2617 unsigned int last_timestamp;
2621 PROC_LOCK_ASSERT(p, MA_OWNED);
2625 vm = vmspace_acquire_ref(p);
2630 kve = malloc(sizeof(*kve), M_TEMP, M_WAITOK | M_ZERO);
2634 vm_map_lock_read(map);
2635 VM_MAP_ENTRY_FOREACH(entry, map) {
2636 if (entry->eflags & MAP_ENTRY_IS_SUB_MAP)
2640 bzero(kve, sizeof(*kve));
2641 obj = entry->object.vm_object;
2643 if ((obj->flags & OBJ_ANON) != 0)
2644 kve->kve_obj = (uintptr_t)obj;
2646 for (tobj = obj; tobj != NULL;
2647 tobj = tobj->backing_object) {
2648 VM_OBJECT_RLOCK(tobj);
2649 kve->kve_offset += tobj->backing_object_offset;
2652 if (obj->backing_object == NULL)
2653 kve->kve_private_resident =
2654 obj->resident_page_count;
2655 kern_proc_vmmap_resident(map, entry,
2656 &kve->kve_resident, &super);
2658 kve->kve_flags |= KVME_FLAG_SUPER;
2659 for (tobj = obj; tobj != NULL; tobj = nobj) {
2660 nobj = tobj->backing_object;
2661 if (tobj != obj && tobj != lobj)
2662 VM_OBJECT_RUNLOCK(tobj);
2668 kve->kve_start = entry->start;
2669 kve->kve_end = entry->end;
2670 kve->kve_offset += entry->offset;
2672 if (entry->protection & VM_PROT_READ)
2673 kve->kve_protection |= KVME_PROT_READ;
2674 if (entry->protection & VM_PROT_WRITE)
2675 kve->kve_protection |= KVME_PROT_WRITE;
2676 if (entry->protection & VM_PROT_EXECUTE)
2677 kve->kve_protection |= KVME_PROT_EXEC;
2679 if (entry->eflags & MAP_ENTRY_COW)
2680 kve->kve_flags |= KVME_FLAG_COW;
2681 if (entry->eflags & MAP_ENTRY_NEEDS_COPY)
2682 kve->kve_flags |= KVME_FLAG_NEEDS_COPY;
2683 if (entry->eflags & MAP_ENTRY_NOCOREDUMP)
2684 kve->kve_flags |= KVME_FLAG_NOCOREDUMP;
2685 if (entry->eflags & MAP_ENTRY_GROWS_UP)
2686 kve->kve_flags |= KVME_FLAG_GROWS_UP;
2687 if (entry->eflags & MAP_ENTRY_GROWS_DOWN)
2688 kve->kve_flags |= KVME_FLAG_GROWS_DOWN;
2689 if (entry->eflags & MAP_ENTRY_USER_WIRED)
2690 kve->kve_flags |= KVME_FLAG_USER_WIRED;
2692 guard = (entry->eflags & MAP_ENTRY_GUARD) != 0;
2694 last_timestamp = map->timestamp;
2695 vm_map_unlock_read(map);
2700 kve->kve_type = vm_object_kvme_type(lobj, &vp);
2704 VM_OBJECT_RUNLOCK(lobj);
2706 kve->kve_ref_count = obj->ref_count;
2707 kve->kve_shadow_count = obj->shadow_count;
2708 VM_OBJECT_RUNLOCK(obj);
2710 vn_fullpath(vp, &fullpath, &freepath);
2711 kve->kve_vn_type = vntype_to_kinfo(vp->v_type);
2712 cred = curthread->td_ucred;
2713 vn_lock(vp, LK_SHARED | LK_RETRY);
2714 if (VOP_GETATTR(vp, &va, cred) == 0) {
2715 kve->kve_vn_fileid = va.va_fileid;
2716 kve->kve_vn_fsid = va.va_fsid;
2717 kve->kve_vn_fsid_freebsd11 =
2718 kve->kve_vn_fsid; /* truncate */
2720 MAKEIMODE(va.va_type, va.va_mode);
2721 kve->kve_vn_size = va.va_size;
2722 kve->kve_vn_rdev = va.va_rdev;
2723 kve->kve_vn_rdev_freebsd11 =
2724 kve->kve_vn_rdev; /* truncate */
2725 kve->kve_status = KF_ATTR_VALID;
2730 kve->kve_type = guard ? KVME_TYPE_GUARD :
2732 kve->kve_ref_count = 0;
2733 kve->kve_shadow_count = 0;
2736 strlcpy(kve->kve_path, fullpath, sizeof(kve->kve_path));
2737 if (freepath != NULL)
2738 free(freepath, M_TEMP);
2740 /* Pack record size down */
2741 if ((flags & KERN_VMMAP_PACK_KINFO) != 0)
2742 kve->kve_structsize =
2743 offsetof(struct kinfo_vmentry, kve_path) +
2744 strlen(kve->kve_path) + 1;
2746 kve->kve_structsize = sizeof(*kve);
2747 kve->kve_structsize = roundup(kve->kve_structsize,
2750 /* Halt filling and truncate rather than exceeding maxlen */
2751 if (maxlen != -1 && maxlen < kve->kve_structsize) {
2753 vm_map_lock_read(map);
2755 } else if (maxlen != -1)
2756 maxlen -= kve->kve_structsize;
2758 if (sbuf_bcat(sb, kve, kve->kve_structsize) != 0)
2760 vm_map_lock_read(map);
2763 if (last_timestamp != map->timestamp) {
2764 vm_map_lookup_entry(map, addr - 1, &tmp_entry);
2768 vm_map_unlock_read(map);
2776 sysctl_kern_proc_vmmap(SYSCTL_HANDLER_ARGS)
2781 int error, error2, *name;
2788 sbuf_new_for_sysctl(&sb, NULL, sizeof(struct kinfo_vmentry), req);
2789 sbuf_clear_flags(&sb, SBUF_INCLUDENUL);
2790 error = pget((pid_t)name[0], PGET_CANDEBUG | PGET_NOTWEXIT, &p);
2795 error = kern_proc_vmmap_out(p, &sb, -1, KERN_VMMAP_PACK_KINFO);
2796 error2 = sbuf_finish(&sb);
2798 return (error != 0 ? error : error2);
2801 #if defined(STACK) || defined(DDB)
2803 sysctl_kern_proc_kstack(SYSCTL_HANDLER_ARGS)
2805 struct kinfo_kstack *kkstp;
2806 int error, i, *name, numthreads;
2807 lwpid_t *lwpidarray;
2819 error = pget((pid_t)name[0], PGET_NOTINEXEC | PGET_WANTREAD, &p);
2823 kkstp = malloc(sizeof(*kkstp), M_TEMP, M_WAITOK);
2824 st = stack_create(M_WAITOK);
2829 if (lwpidarray != NULL) {
2830 free(lwpidarray, M_TEMP);
2833 numthreads = p->p_numthreads;
2835 lwpidarray = malloc(sizeof(*lwpidarray) * numthreads, M_TEMP,
2838 } while (numthreads < p->p_numthreads);
2841 * XXXRW: During the below loop, execve(2) and countless other sorts
2842 * of changes could have taken place. Should we check to see if the
2843 * vmspace has been replaced, or the like, in order to prevent
2844 * giving a snapshot that spans, say, execve(2), with some threads
2845 * before and some after? Among other things, the credentials could
2846 * have changed, in which case the right to extract debug info might
2847 * no longer be assured.
2850 FOREACH_THREAD_IN_PROC(p, td) {
2851 KASSERT(i < numthreads,
2852 ("sysctl_kern_proc_kstack: numthreads"));
2853 lwpidarray[i] = td->td_tid;
2858 for (i = 0; i < numthreads; i++) {
2859 td = tdfind(lwpidarray[i], p->p_pid);
2863 bzero(kkstp, sizeof(*kkstp));
2864 (void)sbuf_new(&sb, kkstp->kkst_trace,
2865 sizeof(kkstp->kkst_trace), SBUF_FIXEDLEN);
2867 kkstp->kkst_tid = td->td_tid;
2868 if (TD_IS_SWAPPED(td))
2869 kkstp->kkst_state = KKST_STATE_SWAPPED;
2870 else if (stack_save_td(st, td) == 0)
2871 kkstp->kkst_state = KKST_STATE_STACKOK;
2873 kkstp->kkst_state = KKST_STATE_RUNNING;
2876 stack_sbuf_print(&sb, st);
2879 error = SYSCTL_OUT(req, kkstp, sizeof(*kkstp));
2884 if (lwpidarray != NULL)
2885 free(lwpidarray, M_TEMP);
2887 free(kkstp, M_TEMP);
2893 * This sysctl allows a process to retrieve the full list of groups from
2894 * itself or another process.
2897 sysctl_kern_proc_groups(SYSCTL_HANDLER_ARGS)
2899 pid_t *pidp = (pid_t *)arg1;
2900 unsigned int arglen = arg2;
2907 if (*pidp == -1) { /* -1 means this process */
2908 p = req->td->td_proc;
2911 error = pget(*pidp, PGET_CANSEE, &p);
2916 cred = crhold(p->p_ucred);
2919 error = SYSCTL_OUT(req, cred->cr_groups,
2920 cred->cr_ngroups * sizeof(gid_t));
2926 * This sysctl allows a process to retrieve or/and set the resource limit for
2930 sysctl_kern_proc_rlimit(SYSCTL_HANDLER_ARGS)
2932 int *name = (int *)arg1;
2933 u_int namelen = arg2;
2942 which = (u_int)name[1];
2943 if (which >= RLIM_NLIMITS)
2946 if (req->newptr != NULL && req->newlen != sizeof(rlim))
2949 flags = PGET_HOLD | PGET_NOTWEXIT;
2950 if (req->newptr != NULL)
2951 flags |= PGET_CANDEBUG;
2953 flags |= PGET_CANSEE;
2954 error = pget((pid_t)name[0], flags, &p);
2961 if (req->oldptr != NULL) {
2963 lim_rlimit_proc(p, which, &rlim);
2966 error = SYSCTL_OUT(req, &rlim, sizeof(rlim));
2973 if (req->newptr != NULL) {
2974 error = SYSCTL_IN(req, &rlim, sizeof(rlim));
2976 error = kern_proc_setrlimit(curthread, p, which, &rlim);
2985 * This sysctl allows a process to retrieve ps_strings structure location of
2989 sysctl_kern_proc_ps_strings(SYSCTL_HANDLER_ARGS)
2991 int *name = (int *)arg1;
2992 u_int namelen = arg2;
2994 vm_offset_t ps_strings;
2996 #ifdef COMPAT_FREEBSD32
2997 uint32_t ps_strings32;
3003 error = pget((pid_t)name[0], PGET_CANDEBUG, &p);
3006 #ifdef COMPAT_FREEBSD32
3007 if ((req->flags & SCTL_MASK32) != 0) {
3009 * We return 0 if the 32 bit emulation request is for a 64 bit
3012 ps_strings32 = SV_PROC_FLAG(p, SV_ILP32) != 0 ?
3013 PTROUT(PROC_PS_STRINGS(p)) : 0;
3015 error = SYSCTL_OUT(req, &ps_strings32, sizeof(ps_strings32));
3019 ps_strings = PROC_PS_STRINGS(p);
3021 error = SYSCTL_OUT(req, &ps_strings, sizeof(ps_strings));
3026 * This sysctl allows a process to retrieve umask of another process.
3029 sysctl_kern_proc_umask(SYSCTL_HANDLER_ARGS)
3031 int *name = (int *)arg1;
3032 u_int namelen = arg2;
3041 pid = (pid_t)name[0];
3043 if (pid == p->p_pid || pid == 0) {
3044 cmask = p->p_pd->pd_cmask;
3048 error = pget(pid, PGET_WANTREAD, &p);
3052 cmask = p->p_pd->pd_cmask;
3055 error = SYSCTL_OUT(req, &cmask, sizeof(cmask));
3060 * This sysctl allows a process to set and retrieve binary osreldate of
3064 sysctl_kern_proc_osrel(SYSCTL_HANDLER_ARGS)
3066 int *name = (int *)arg1;
3067 u_int namelen = arg2;
3069 int flags, error, osrel;
3074 if (req->newptr != NULL && req->newlen != sizeof(osrel))
3077 flags = PGET_HOLD | PGET_NOTWEXIT;
3078 if (req->newptr != NULL)
3079 flags |= PGET_CANDEBUG;
3081 flags |= PGET_CANSEE;
3082 error = pget((pid_t)name[0], flags, &p);
3086 error = SYSCTL_OUT(req, &p->p_osrel, sizeof(p->p_osrel));
3090 if (req->newptr != NULL) {
3091 error = SYSCTL_IN(req, &osrel, sizeof(osrel));
3106 sysctl_kern_proc_sigtramp(SYSCTL_HANDLER_ARGS)
3108 int *name = (int *)arg1;
3109 u_int namelen = arg2;
3111 struct kinfo_sigtramp kst;
3112 const struct sysentvec *sv;
3114 #ifdef COMPAT_FREEBSD32
3115 struct kinfo_sigtramp32 kst32;
3121 error = pget((pid_t)name[0], PGET_CANDEBUG, &p);
3125 #ifdef COMPAT_FREEBSD32
3126 if ((req->flags & SCTL_MASK32) != 0) {
3127 bzero(&kst32, sizeof(kst32));
3128 if (SV_PROC_FLAG(p, SV_ILP32)) {
3129 if (PROC_HAS_SHP(p)) {
3130 kst32.ksigtramp_start = PROC_SIGCODE(p);
3131 kst32.ksigtramp_end = kst32.ksigtramp_start +
3132 ((sv->sv_flags & SV_DSO_SIG) == 0 ?
3134 (uintptr_t)sv->sv_szsigcode);
3136 kst32.ksigtramp_start = PROC_PS_STRINGS(p) -
3138 kst32.ksigtramp_end = PROC_PS_STRINGS(p);
3142 error = SYSCTL_OUT(req, &kst32, sizeof(kst32));
3146 bzero(&kst, sizeof(kst));
3147 if (PROC_HAS_SHP(p)) {
3148 kst.ksigtramp_start = (char *)PROC_SIGCODE(p);
3149 kst.ksigtramp_end = (char *)kst.ksigtramp_start +
3150 ((sv->sv_flags & SV_DSO_SIG) == 0 ? *sv->sv_szsigcode :
3151 (uintptr_t)sv->sv_szsigcode);
3153 kst.ksigtramp_start = (char *)PROC_PS_STRINGS(p) -
3155 kst.ksigtramp_end = (char *)PROC_PS_STRINGS(p);
3158 error = SYSCTL_OUT(req, &kst, sizeof(kst));
3163 sysctl_kern_proc_sigfastblk(SYSCTL_HANDLER_ARGS)
3165 int *name = (int *)arg1;
3166 u_int namelen = arg2;
3171 #ifdef COMPAT_FREEBSD32
3176 if (namelen != 1 || req->newptr != NULL)
3179 pid = (pid_t)name[0];
3180 error = pget(pid, PGET_HOLD | PGET_NOTWEXIT | PGET_CANDEBUG, &p);
3185 #ifdef COMPAT_FREEBSD32
3186 if (SV_CURPROC_FLAG(SV_ILP32)) {
3187 if (!SV_PROC_FLAG(p, SV_ILP32)) {
3193 if (pid <= PID_MAX) {
3194 td1 = FIRST_THREAD_IN_PROC(p);
3196 FOREACH_THREAD_IN_PROC(p, td1) {
3197 if (td1->td_tid == pid)
3206 * The access to the private thread flags. It is fine as far
3207 * as no out-of-thin-air values are read from td_pflags, and
3208 * usermode read of the td_sigblock_ptr is racy inherently,
3209 * since target process might have already changed it
3212 if ((td1->td_pflags & TDP_SIGFASTBLOCK) != 0)
3213 addr = (uintptr_t)td1->td_sigblock_ptr;
3223 #ifdef COMPAT_FREEBSD32
3224 if (SV_CURPROC_FLAG(SV_ILP32)) {
3226 error = SYSCTL_OUT(req, &addr32, sizeof(addr32));
3229 error = SYSCTL_OUT(req, &addr, sizeof(addr));
3234 sysctl_kern_proc_vm_layout(SYSCTL_HANDLER_ARGS)
3236 struct kinfo_vm_layout kvm;
3238 struct vmspace *vmspace;
3242 if ((u_int)arg2 != 1)
3245 error = pget((pid_t)name[0], PGET_CANDEBUG, &p);
3248 #ifdef COMPAT_FREEBSD32
3249 if (SV_CURPROC_FLAG(SV_ILP32)) {
3250 if (!SV_PROC_FLAG(p, SV_ILP32)) {
3256 vmspace = vmspace_acquire_ref(p);
3259 memset(&kvm, 0, sizeof(kvm));
3260 kvm.kvm_min_user_addr = vm_map_min(&vmspace->vm_map);
3261 kvm.kvm_max_user_addr = vm_map_max(&vmspace->vm_map);
3262 kvm.kvm_text_addr = (uintptr_t)vmspace->vm_taddr;
3263 kvm.kvm_text_size = vmspace->vm_tsize;
3264 kvm.kvm_data_addr = (uintptr_t)vmspace->vm_daddr;
3265 kvm.kvm_data_size = vmspace->vm_dsize;
3266 kvm.kvm_stack_addr = (uintptr_t)vmspace->vm_maxsaddr;
3267 kvm.kvm_stack_size = vmspace->vm_ssize;
3268 kvm.kvm_shp_addr = vmspace->vm_shp_base;
3269 kvm.kvm_shp_size = p->p_sysent->sv_shared_page_len;
3270 if ((vmspace->vm_map.flags & MAP_WIREFUTURE) != 0)
3271 kvm.kvm_map_flags |= KMAP_FLAG_WIREFUTURE;
3272 if ((vmspace->vm_map.flags & MAP_ASLR) != 0)
3273 kvm.kvm_map_flags |= KMAP_FLAG_ASLR;
3274 if ((vmspace->vm_map.flags & MAP_ASLR_IGNSTART) != 0)
3275 kvm.kvm_map_flags |= KMAP_FLAG_ASLR_IGNSTART;
3276 if ((vmspace->vm_map.flags & MAP_WXORX) != 0)
3277 kvm.kvm_map_flags |= KMAP_FLAG_WXORX;
3278 if ((vmspace->vm_map.flags & MAP_ASLR_STACK) != 0)
3279 kvm.kvm_map_flags |= KMAP_FLAG_ASLR_STACK;
3280 if (vmspace->vm_shp_base != p->p_sysent->sv_shared_page_base &&
3282 kvm.kvm_map_flags |= KMAP_FLAG_ASLR_SHARED_PAGE;
3284 #ifdef COMPAT_FREEBSD32
3285 if (SV_CURPROC_FLAG(SV_ILP32)) {
3286 struct kinfo_vm_layout32 kvm32;
3288 memset(&kvm32, 0, sizeof(kvm32));
3289 kvm32.kvm_min_user_addr = (uint32_t)kvm.kvm_min_user_addr;
3290 kvm32.kvm_max_user_addr = (uint32_t)kvm.kvm_max_user_addr;
3291 kvm32.kvm_text_addr = (uint32_t)kvm.kvm_text_addr;
3292 kvm32.kvm_text_size = (uint32_t)kvm.kvm_text_size;
3293 kvm32.kvm_data_addr = (uint32_t)kvm.kvm_data_addr;
3294 kvm32.kvm_data_size = (uint32_t)kvm.kvm_data_size;
3295 kvm32.kvm_stack_addr = (uint32_t)kvm.kvm_stack_addr;
3296 kvm32.kvm_stack_size = (uint32_t)kvm.kvm_stack_size;
3297 kvm32.kvm_shp_addr = (uint32_t)kvm.kvm_shp_addr;
3298 kvm32.kvm_shp_size = (uint32_t)kvm.kvm_shp_size;
3299 kvm32.kvm_map_flags = kvm.kvm_map_flags;
3300 error = SYSCTL_OUT(req, &kvm32, sizeof(kvm32));
3305 error = SYSCTL_OUT(req, &kvm, sizeof(kvm));
3306 #ifdef COMPAT_FREEBSD32
3309 vmspace_free(vmspace);
3313 SYSCTL_NODE(_kern, KERN_PROC, proc, CTLFLAG_RD | CTLFLAG_MPSAFE, 0,
3316 SYSCTL_PROC(_kern_proc, KERN_PROC_ALL, all, CTLFLAG_RD|CTLTYPE_STRUCT|
3317 CTLFLAG_MPSAFE, 0, 0, sysctl_kern_proc, "S,proc",
3318 "Return entire process table");
3320 static SYSCTL_NODE(_kern_proc, KERN_PROC_GID, gid, CTLFLAG_RD | CTLFLAG_MPSAFE,
3321 sysctl_kern_proc, "Process table");
3323 static SYSCTL_NODE(_kern_proc, KERN_PROC_PGRP, pgrp, CTLFLAG_RD | CTLFLAG_MPSAFE,
3324 sysctl_kern_proc, "Process table");
3326 static SYSCTL_NODE(_kern_proc, KERN_PROC_RGID, rgid, CTLFLAG_RD | CTLFLAG_MPSAFE,
3327 sysctl_kern_proc, "Process table");
3329 static SYSCTL_NODE(_kern_proc, KERN_PROC_SESSION, sid, CTLFLAG_RD |
3330 CTLFLAG_MPSAFE, sysctl_kern_proc, "Process table");
3332 static SYSCTL_NODE(_kern_proc, KERN_PROC_TTY, tty, CTLFLAG_RD | CTLFLAG_MPSAFE,
3333 sysctl_kern_proc, "Process table");
3335 static SYSCTL_NODE(_kern_proc, KERN_PROC_UID, uid, CTLFLAG_RD | CTLFLAG_MPSAFE,
3336 sysctl_kern_proc, "Process table");
3338 static SYSCTL_NODE(_kern_proc, KERN_PROC_RUID, ruid, CTLFLAG_RD | CTLFLAG_MPSAFE,
3339 sysctl_kern_proc, "Process table");
3341 static SYSCTL_NODE(_kern_proc, KERN_PROC_PID, pid, CTLFLAG_RD | CTLFLAG_MPSAFE,
3342 sysctl_kern_proc, "Process table");
3344 static SYSCTL_NODE(_kern_proc, KERN_PROC_PROC, proc, CTLFLAG_RD | CTLFLAG_MPSAFE,
3345 sysctl_kern_proc, "Return process table, no threads");
3347 static SYSCTL_NODE(_kern_proc, KERN_PROC_ARGS, args,
3348 CTLFLAG_RW | CTLFLAG_CAPWR | CTLFLAG_ANYBODY | CTLFLAG_MPSAFE,
3349 sysctl_kern_proc_args, "Process argument list");
3351 static SYSCTL_NODE(_kern_proc, KERN_PROC_ENV, env, CTLFLAG_RD | CTLFLAG_MPSAFE,
3352 sysctl_kern_proc_env, "Process environment");
3354 static SYSCTL_NODE(_kern_proc, KERN_PROC_AUXV, auxv, CTLFLAG_RD |
3355 CTLFLAG_MPSAFE, sysctl_kern_proc_auxv, "Process ELF auxiliary vector");
3357 static SYSCTL_NODE(_kern_proc, KERN_PROC_PATHNAME, pathname, CTLFLAG_RD |
3358 CTLFLAG_MPSAFE, sysctl_kern_proc_pathname, "Process executable path");
3360 static SYSCTL_NODE(_kern_proc, KERN_PROC_SV_NAME, sv_name, CTLFLAG_RD |
3361 CTLFLAG_MPSAFE, sysctl_kern_proc_sv_name,
3362 "Process syscall vector name (ABI type)");
3364 static SYSCTL_NODE(_kern_proc, (KERN_PROC_GID | KERN_PROC_INC_THREAD), gid_td,
3365 CTLFLAG_RD | CTLFLAG_MPSAFE, sysctl_kern_proc, "Process table");
3367 static SYSCTL_NODE(_kern_proc, (KERN_PROC_PGRP | KERN_PROC_INC_THREAD), pgrp_td,
3368 CTLFLAG_RD | CTLFLAG_MPSAFE, sysctl_kern_proc, "Process table");
3370 static SYSCTL_NODE(_kern_proc, (KERN_PROC_RGID | KERN_PROC_INC_THREAD), rgid_td,
3371 CTLFLAG_RD | CTLFLAG_MPSAFE, sysctl_kern_proc, "Process table");
3373 static SYSCTL_NODE(_kern_proc, (KERN_PROC_SESSION | KERN_PROC_INC_THREAD),
3374 sid_td, CTLFLAG_RD | CTLFLAG_MPSAFE, sysctl_kern_proc, "Process table");
3376 static SYSCTL_NODE(_kern_proc, (KERN_PROC_TTY | KERN_PROC_INC_THREAD), tty_td,
3377 CTLFLAG_RD | CTLFLAG_MPSAFE, sysctl_kern_proc, "Process table");
3379 static SYSCTL_NODE(_kern_proc, (KERN_PROC_UID | KERN_PROC_INC_THREAD), uid_td,
3380 CTLFLAG_RD | CTLFLAG_MPSAFE, sysctl_kern_proc, "Process table");
3382 static SYSCTL_NODE(_kern_proc, (KERN_PROC_RUID | KERN_PROC_INC_THREAD), ruid_td,
3383 CTLFLAG_RD | CTLFLAG_MPSAFE, sysctl_kern_proc, "Process table");
3385 static SYSCTL_NODE(_kern_proc, (KERN_PROC_PID | KERN_PROC_INC_THREAD), pid_td,
3386 CTLFLAG_RD | CTLFLAG_MPSAFE, sysctl_kern_proc, "Process table");
3388 static SYSCTL_NODE(_kern_proc, (KERN_PROC_PROC | KERN_PROC_INC_THREAD), proc_td,
3389 CTLFLAG_RD | CTLFLAG_MPSAFE, sysctl_kern_proc,
3390 "Return process table, including threads");
3392 #ifdef COMPAT_FREEBSD7
3393 static SYSCTL_NODE(_kern_proc, KERN_PROC_OVMMAP, ovmmap, CTLFLAG_RD |
3394 CTLFLAG_MPSAFE, sysctl_kern_proc_ovmmap, "Old Process vm map entries");
3397 static SYSCTL_NODE(_kern_proc, KERN_PROC_VMMAP, vmmap, CTLFLAG_RD |
3398 CTLFLAG_MPSAFE, sysctl_kern_proc_vmmap, "Process vm map entries");
3400 #if defined(STACK) || defined(DDB)
3401 static SYSCTL_NODE(_kern_proc, KERN_PROC_KSTACK, kstack, CTLFLAG_RD |
3402 CTLFLAG_MPSAFE, sysctl_kern_proc_kstack, "Process kernel stacks");
3405 static SYSCTL_NODE(_kern_proc, KERN_PROC_GROUPS, groups, CTLFLAG_RD |
3406 CTLFLAG_MPSAFE, sysctl_kern_proc_groups, "Process groups");
3408 static SYSCTL_NODE(_kern_proc, KERN_PROC_RLIMIT, rlimit, CTLFLAG_RW |
3409 CTLFLAG_ANYBODY | CTLFLAG_MPSAFE, sysctl_kern_proc_rlimit,
3410 "Process resource limits");
3412 static SYSCTL_NODE(_kern_proc, KERN_PROC_PS_STRINGS, ps_strings, CTLFLAG_RD |
3413 CTLFLAG_MPSAFE, sysctl_kern_proc_ps_strings,
3414 "Process ps_strings location");
3416 static SYSCTL_NODE(_kern_proc, KERN_PROC_UMASK, umask, CTLFLAG_RD |
3417 CTLFLAG_MPSAFE, sysctl_kern_proc_umask, "Process umask");
3419 static SYSCTL_NODE(_kern_proc, KERN_PROC_OSREL, osrel, CTLFLAG_RW |
3420 CTLFLAG_ANYBODY | CTLFLAG_MPSAFE, sysctl_kern_proc_osrel,
3421 "Process binary osreldate");
3423 static SYSCTL_NODE(_kern_proc, KERN_PROC_SIGTRAMP, sigtramp, CTLFLAG_RD |
3424 CTLFLAG_MPSAFE, sysctl_kern_proc_sigtramp,
3425 "Process signal trampoline location");
3427 static SYSCTL_NODE(_kern_proc, KERN_PROC_SIGFASTBLK, sigfastblk, CTLFLAG_RD |
3428 CTLFLAG_ANYBODY | CTLFLAG_MPSAFE, sysctl_kern_proc_sigfastblk,
3429 "Thread sigfastblock address");
3431 static SYSCTL_NODE(_kern_proc, KERN_PROC_VM_LAYOUT, vm_layout, CTLFLAG_RD |
3432 CTLFLAG_ANYBODY | CTLFLAG_MPSAFE, sysctl_kern_proc_vm_layout,
3433 "Process virtual address space layout info");
3435 static struct sx stop_all_proc_blocker;
3436 SX_SYSINIT(stop_all_proc_blocker, &stop_all_proc_blocker, "sapblk");
3439 stop_all_proc_block(void)
3441 return (sx_xlock_sig(&stop_all_proc_blocker) == 0);
3445 stop_all_proc_unblock(void)
3447 sx_xunlock(&stop_all_proc_blocker);
3453 * stop_all_proc() purpose is to stop all process which have usermode,
3454 * except current process for obvious reasons. This makes it somewhat
3455 * unreliable when invoked from multithreaded process. The service
3456 * must not be user-callable anyway.
3461 struct proc *cp, *p;
3463 bool restart, seen_stopped, seen_exiting, stopped_some;
3465 if (!stop_all_proc_block())
3470 sx_xlock(&allproc_lock);
3472 seen_exiting = seen_stopped = stopped_some = restart = false;
3473 LIST_REMOVE(cp, p_list);
3474 LIST_INSERT_HEAD(&allproc, cp, p_list);
3476 p = LIST_NEXT(cp, p_list);
3479 LIST_REMOVE(cp, p_list);
3480 LIST_INSERT_AFTER(p, cp, p_list);
3482 if ((p->p_flag & (P_KPROC | P_SYSTEM | P_TOTAL_STOP)) != 0) {
3486 if ((p->p_flag2 & P2_WEXIT) != 0) {
3487 seen_exiting = true;
3491 if (P_SHOULDSTOP(p) == P_STOPPED_SINGLE) {
3493 * Stopped processes are tolerated when there
3494 * are no other processes which might continue
3495 * them. P_STOPPED_SINGLE but not
3496 * P_TOTAL_STOP process still has at least one
3499 seen_stopped = true;
3503 sx_xunlock(&allproc_lock);
3505 r = thread_single(p, SINGLE_ALLPROC);
3509 stopped_some = true;
3512 sx_xlock(&allproc_lock);
3514 /* Catch forked children we did not see in iteration. */
3515 if (gen != allproc_gen)
3517 sx_xunlock(&allproc_lock);
3518 if (restart || stopped_some || seen_exiting || seen_stopped) {
3519 kern_yield(PRI_USER);
3525 resume_all_proc(void)
3527 struct proc *cp, *p;
3530 sx_xlock(&allproc_lock);
3532 LIST_REMOVE(cp, p_list);
3533 LIST_INSERT_HEAD(&allproc, cp, p_list);
3535 p = LIST_NEXT(cp, p_list);
3538 LIST_REMOVE(cp, p_list);
3539 LIST_INSERT_AFTER(p, cp, p_list);
3541 if ((p->p_flag & P_TOTAL_STOP) != 0) {
3542 sx_xunlock(&allproc_lock);
3544 thread_single_end(p, SINGLE_ALLPROC);
3547 sx_xlock(&allproc_lock);
3552 /* Did the loop above missed any stopped process ? */
3553 FOREACH_PROC_IN_SYSTEM(p) {
3554 /* No need for proc lock. */
3555 if ((p->p_flag & P_TOTAL_STOP) != 0)
3558 sx_xunlock(&allproc_lock);
3560 stop_all_proc_unblock();
3563 /* #define TOTAL_STOP_DEBUG 1 */
3564 #ifdef TOTAL_STOP_DEBUG
3565 volatile static int ap_resume;
3566 #include <sys/mount.h>
3569 sysctl_debug_stop_all_proc(SYSCTL_HANDLER_ARGS)
3575 error = sysctl_handle_int(oidp, &val, 0, req);
3576 if (error != 0 || req->newptr == NULL)
3581 while (ap_resume == 0)
3589 SYSCTL_PROC(_debug, OID_AUTO, stop_all_proc, CTLTYPE_INT | CTLFLAG_RW |
3590 CTLFLAG_MPSAFE, __DEVOLATILE(int *, &ap_resume), 0,
3591 sysctl_debug_stop_all_proc, "I",