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>
49 #include <sys/kernel.h>
50 #include <sys/limits.h>
52 #include <sys/loginclass.h>
53 #include <sys/malloc.h>
55 #include <sys/mount.h>
56 #include <sys/mutex.h>
58 #include <sys/ptrace.h>
59 #include <sys/refcount.h>
60 #include <sys/resourcevar.h>
61 #include <sys/rwlock.h>
63 #include <sys/sysent.h>
64 #include <sys/sched.h>
66 #include <sys/stack.h>
68 #include <sys/sysctl.h>
69 #include <sys/filedesc.h>
71 #include <sys/signalvar.h>
75 #include <sys/vnode.h>
83 #include <vm/vm_param.h>
84 #include <vm/vm_extern.h>
86 #include <vm/vm_map.h>
87 #include <vm/vm_object.h>
88 #include <vm/vm_page.h>
91 #include <fs/devfs/devfs.h>
93 #ifdef COMPAT_FREEBSD32
94 #include <compat/freebsd32/freebsd32.h>
95 #include <compat/freebsd32/freebsd32_util.h>
98 SDT_PROVIDER_DEFINE(proc);
100 MALLOC_DEFINE(M_PGRP, "pgrp", "process group header");
101 MALLOC_DEFINE(M_SESSION, "session", "session header");
102 static MALLOC_DEFINE(M_PROC, "proc", "Proc structures");
103 MALLOC_DEFINE(M_SUBPROC, "subproc", "Proc sub-structures");
105 static void fixjobc_enterpgrp(struct proc *p, struct pgrp *pgrp);
106 static void doenterpgrp(struct proc *, struct pgrp *);
107 static void orphanpg(struct pgrp *pg);
108 static void fill_kinfo_aggregate(struct proc *p, struct kinfo_proc *kp);
109 static void fill_kinfo_proc_only(struct proc *p, struct kinfo_proc *kp);
110 static void fill_kinfo_thread(struct thread *td, struct kinfo_proc *kp,
112 static void pgadjustjobc(struct pgrp *pgrp, bool entering);
113 static void pgdelete(struct pgrp *);
114 static int proc_ctor(void *mem, int size, void *arg, int flags);
115 static void proc_dtor(void *mem, int size, void *arg);
116 static int proc_init(void *mem, int size, int flags);
117 static void proc_fini(void *mem, int size);
118 static void pargs_free(struct pargs *pa);
121 * Other process lists
123 struct pidhashhead *pidhashtbl;
124 struct sx *pidhashtbl_lock;
127 struct pgrphashhead *pgrphashtbl;
129 struct proclist allproc;
130 struct sx __exclusive_cache_line allproc_lock;
131 struct sx __exclusive_cache_line proctree_lock;
132 struct mtx __exclusive_cache_line ppeers_lock;
133 struct mtx __exclusive_cache_line procid_lock;
134 uma_zone_t proc_zone;
137 * The offset of various fields in struct proc and struct thread.
138 * These are used by kernel debuggers to enumerate kernel threads and
141 const int proc_off_p_pid = offsetof(struct proc, p_pid);
142 const int proc_off_p_comm = offsetof(struct proc, p_comm);
143 const int proc_off_p_list = offsetof(struct proc, p_list);
144 const int proc_off_p_threads = offsetof(struct proc, p_threads);
145 const int thread_off_td_tid = offsetof(struct thread, td_tid);
146 const int thread_off_td_name = offsetof(struct thread, td_name);
147 const int thread_off_td_oncpu = offsetof(struct thread, td_oncpu);
148 const int thread_off_td_pcb = offsetof(struct thread, td_pcb);
149 const int thread_off_td_plist = offsetof(struct thread, td_plist);
151 EVENTHANDLER_LIST_DEFINE(process_ctor);
152 EVENTHANDLER_LIST_DEFINE(process_dtor);
153 EVENTHANDLER_LIST_DEFINE(process_init);
154 EVENTHANDLER_LIST_DEFINE(process_fini);
155 EVENTHANDLER_LIST_DEFINE(process_exit);
156 EVENTHANDLER_LIST_DEFINE(process_fork);
157 EVENTHANDLER_LIST_DEFINE(process_exec);
159 int kstack_pages = KSTACK_PAGES;
160 SYSCTL_INT(_kern, OID_AUTO, kstack_pages, CTLFLAG_RD, &kstack_pages, 0,
161 "Kernel stack size in pages");
162 static int vmmap_skip_res_cnt = 0;
163 SYSCTL_INT(_kern, OID_AUTO, proc_vmmap_skip_resident_count, CTLFLAG_RW,
164 &vmmap_skip_res_cnt, 0,
165 "Skip calculation of the pages resident count in kern.proc.vmmap");
167 CTASSERT(sizeof(struct kinfo_proc) == KINFO_PROC_SIZE);
168 #ifdef COMPAT_FREEBSD32
169 CTASSERT(sizeof(struct kinfo_proc32) == KINFO_PROC32_SIZE);
173 * Initialize global process hashing structures.
180 sx_init(&allproc_lock, "allproc");
181 sx_init(&proctree_lock, "proctree");
182 mtx_init(&ppeers_lock, "p_peers", NULL, MTX_DEF);
183 mtx_init(&procid_lock, "procid", NULL, MTX_DEF);
185 pidhashtbl = hashinit(maxproc / 4, M_PROC, &pidhash);
186 pidhashlock = (pidhash + 1) / 64;
189 pidhashtbl_lock = malloc(sizeof(*pidhashtbl_lock) * (pidhashlock + 1),
190 M_PROC, M_WAITOK | M_ZERO);
191 for (i = 0; i < pidhashlock + 1; i++)
192 sx_init_flags(&pidhashtbl_lock[i], "pidhash", SX_DUPOK);
193 pgrphashtbl = hashinit(maxproc / 4, M_PROC, &pgrphash);
194 proc_zone = uma_zcreate("PROC", sched_sizeof_proc(),
195 proc_ctor, proc_dtor, proc_init, proc_fini,
196 UMA_ALIGN_PTR, UMA_ZONE_NOFREE);
201 * Prepare a proc for use.
204 proc_ctor(void *mem, int size, void *arg, int flags)
209 p = (struct proc *)mem;
210 EVENTHANDLER_DIRECT_INVOKE(process_ctor, p);
211 td = FIRST_THREAD_IN_PROC(p);
213 /* Make sure all thread constructors are executed */
214 EVENTHANDLER_DIRECT_INVOKE(thread_ctor, td);
220 * Reclaim a proc after use.
223 proc_dtor(void *mem, int size, void *arg)
228 /* INVARIANTS checks go here */
229 p = (struct proc *)mem;
230 td = FIRST_THREAD_IN_PROC(p);
233 KASSERT((p->p_numthreads == 1),
234 ("bad number of threads in exiting process"));
235 KASSERT(STAILQ_EMPTY(&p->p_ktr), ("proc_dtor: non-empty p_ktr"));
237 /* Free all OSD associated to this thread. */
239 td_softdep_cleanup(td);
240 MPASS(td->td_su == NULL);
242 /* Make sure all thread destructors are executed */
243 EVENTHANDLER_DIRECT_INVOKE(thread_dtor, td);
245 EVENTHANDLER_DIRECT_INVOKE(process_dtor, p);
246 if (p->p_ksi != NULL)
247 KASSERT(! KSI_ONQ(p->p_ksi), ("SIGCHLD queue"));
251 * Initialize type-stable parts of a proc (when newly created).
254 proc_init(void *mem, int size, int flags)
258 p = (struct proc *)mem;
259 mtx_init(&p->p_mtx, "process lock", NULL, MTX_DEF | MTX_DUPOK | MTX_NEW);
260 mtx_init(&p->p_slock, "process slock", NULL, MTX_SPIN | MTX_NEW);
261 mtx_init(&p->p_statmtx, "pstatl", NULL, MTX_SPIN | MTX_NEW);
262 mtx_init(&p->p_itimmtx, "pitiml", NULL, MTX_SPIN | MTX_NEW);
263 mtx_init(&p->p_profmtx, "pprofl", NULL, MTX_SPIN | MTX_NEW);
264 cv_init(&p->p_pwait, "ppwait");
265 TAILQ_INIT(&p->p_threads); /* all threads in proc */
266 EVENTHANDLER_DIRECT_INVOKE(process_init, p);
267 p->p_stats = pstats_alloc();
273 * UMA should ensure that this function is never called.
274 * Freeing a proc structure would violate type stability.
277 proc_fini(void *mem, int size)
282 p = (struct proc *)mem;
283 EVENTHANDLER_DIRECT_INVOKE(process_fini, p);
284 pstats_free(p->p_stats);
285 thread_free(FIRST_THREAD_IN_PROC(p));
286 mtx_destroy(&p->p_mtx);
287 if (p->p_ksi != NULL)
288 ksiginfo_free(p->p_ksi);
290 panic("proc reclaimed");
295 * PID space management.
297 * These bitmaps are used by fork_findpid.
299 bitstr_t bit_decl(proc_id_pidmap, PID_MAX);
300 bitstr_t bit_decl(proc_id_grpidmap, PID_MAX);
301 bitstr_t bit_decl(proc_id_sessidmap, PID_MAX);
302 bitstr_t bit_decl(proc_id_reapmap, PID_MAX);
304 static bitstr_t *proc_id_array[] = {
312 proc_id_set(int type, pid_t id)
315 KASSERT(type >= 0 && type < nitems(proc_id_array),
316 ("invalid type %d\n", type));
317 mtx_lock(&procid_lock);
318 KASSERT(bit_test(proc_id_array[type], id) == 0,
319 ("bit %d already set in %d\n", id, type));
320 bit_set(proc_id_array[type], id);
321 mtx_unlock(&procid_lock);
325 proc_id_set_cond(int type, pid_t id)
328 KASSERT(type >= 0 && type < nitems(proc_id_array),
329 ("invalid type %d\n", type));
330 if (bit_test(proc_id_array[type], id))
332 mtx_lock(&procid_lock);
333 bit_set(proc_id_array[type], id);
334 mtx_unlock(&procid_lock);
338 proc_id_clear(int type, pid_t id)
341 KASSERT(type >= 0 && type < nitems(proc_id_array),
342 ("invalid type %d\n", type));
343 mtx_lock(&procid_lock);
344 KASSERT(bit_test(proc_id_array[type], id) != 0,
345 ("bit %d not set in %d\n", id, type));
346 bit_clear(proc_id_array[type], id);
347 mtx_unlock(&procid_lock);
351 * Is p an inferior of the current process?
354 inferior(struct proc *p)
357 sx_assert(&proctree_lock, SX_LOCKED);
358 PROC_LOCK_ASSERT(p, MA_OWNED);
359 for (; p != curproc; p = proc_realparent(p)) {
367 * Shared lock all the pid hash lists.
370 pidhash_slockall(void)
374 for (i = 0; i < pidhashlock + 1; i++)
375 sx_slock(&pidhashtbl_lock[i]);
379 * Shared unlock all the pid hash lists.
382 pidhash_sunlockall(void)
386 for (i = 0; i < pidhashlock + 1; i++)
387 sx_sunlock(&pidhashtbl_lock[i]);
391 * Similar to pfind_any(), this function finds zombies.
394 pfind_any_locked(pid_t pid)
398 sx_assert(PIDHASHLOCK(pid), SX_LOCKED);
399 LIST_FOREACH(p, PIDHASH(pid), p_hash) {
400 if (p->p_pid == pid) {
402 if (p->p_state == PRS_NEW) {
413 * Locate a process by number.
415 * By not returning processes in the PRS_NEW state, we allow callers to avoid
416 * testing for that condition to avoid dereferencing p_ucred, et al.
418 static __always_inline struct proc *
419 _pfind(pid_t pid, bool zombie)
424 if (p->p_pid == pid) {
428 sx_slock(PIDHASHLOCK(pid));
429 LIST_FOREACH(p, PIDHASH(pid), p_hash) {
430 if (p->p_pid == pid) {
432 if (p->p_state == PRS_NEW ||
433 (!zombie && p->p_state == PRS_ZOMBIE)) {
440 sx_sunlock(PIDHASHLOCK(pid));
448 return (_pfind(pid, false));
452 * Same as pfind but allow zombies.
458 return (_pfind(pid, true));
462 * Locate a process group by number.
463 * The caller must hold proctree_lock.
470 sx_assert(&proctree_lock, SX_LOCKED);
472 LIST_FOREACH(pgrp, PGRPHASH(pgid), pg_hash) {
473 if (pgrp->pg_id == pgid) {
482 * Locate process and do additional manipulations, depending on flags.
485 pget(pid_t pid, int flags, struct proc **pp)
492 if (p->p_pid == pid) {
496 if (pid <= PID_MAX) {
497 if ((flags & PGET_NOTWEXIT) == 0)
501 } else if ((flags & PGET_NOTID) == 0) {
502 td1 = tdfind(pid, -1);
508 if ((flags & PGET_CANSEE) != 0) {
509 error = p_cansee(curthread, p);
514 if ((flags & PGET_CANDEBUG) != 0) {
515 error = p_candebug(curthread, p);
519 if ((flags & PGET_ISCURRENT) != 0 && curproc != p) {
523 if ((flags & PGET_NOTWEXIT) != 0 && (p->p_flag & P_WEXIT) != 0) {
527 if ((flags & PGET_NOTINEXEC) != 0 && (p->p_flag & P_INEXEC) != 0) {
529 * XXXRW: Not clear ESRCH is the right error during proc
535 if ((flags & PGET_HOLD) != 0) {
547 * Create a new process group.
548 * pgid must be equal to the pid of p.
549 * Begin a new session if required.
552 enterpgrp(struct proc *p, pid_t pgid, struct pgrp *pgrp, struct session *sess)
555 sx_assert(&proctree_lock, SX_XLOCKED);
557 KASSERT(pgrp != NULL, ("enterpgrp: pgrp == NULL"));
558 KASSERT(p->p_pid == pgid,
559 ("enterpgrp: new pgrp and pid != pgid"));
560 KASSERT(pgfind(pgid) == NULL,
561 ("enterpgrp: pgrp with pgid exists"));
562 KASSERT(!SESS_LEADER(p),
563 ("enterpgrp: session leader attempted setpgrp"));
565 mtx_init(&pgrp->pg_mtx, "process group", NULL, MTX_DEF | MTX_DUPOK);
571 mtx_init(&sess->s_mtx, "session", NULL, MTX_DEF);
573 p->p_flag &= ~P_CONTROLT;
577 sess->s_sid = p->p_pid;
578 proc_id_set(PROC_ID_SESSION, p->p_pid);
579 refcount_init(&sess->s_count, 1);
580 sess->s_ttyvp = NULL;
581 sess->s_ttydp = NULL;
583 bcopy(p->p_session->s_login, sess->s_login,
584 sizeof(sess->s_login));
585 pgrp->pg_session = sess;
586 KASSERT(p == curproc,
587 ("enterpgrp: mksession and p != curproc"));
589 pgrp->pg_session = p->p_session;
590 sess_hold(pgrp->pg_session);
594 proc_id_set(PROC_ID_GROUP, p->p_pid);
595 LIST_INIT(&pgrp->pg_members);
598 * As we have an exclusive lock of proctree_lock,
599 * this should not deadlock.
601 LIST_INSERT_HEAD(PGRPHASH(pgid), pgrp, pg_hash);
603 SLIST_INIT(&pgrp->pg_sigiolst);
606 doenterpgrp(p, pgrp);
612 * Move p to an existing process group
615 enterthispgrp(struct proc *p, struct pgrp *pgrp)
618 sx_assert(&proctree_lock, SX_XLOCKED);
619 PROC_LOCK_ASSERT(p, MA_NOTOWNED);
620 PGRP_LOCK_ASSERT(pgrp, MA_NOTOWNED);
621 PGRP_LOCK_ASSERT(p->p_pgrp, MA_NOTOWNED);
622 SESS_LOCK_ASSERT(p->p_session, MA_NOTOWNED);
623 KASSERT(pgrp->pg_session == p->p_session,
624 ("%s: pgrp's session %p, p->p_session %p.\n",
628 KASSERT(pgrp != p->p_pgrp,
629 ("%s: p belongs to pgrp.", __func__));
631 doenterpgrp(p, pgrp);
637 * If true, any child of q which belongs to group pgrp, qualifies the
638 * process group pgrp as not orphaned.
641 isjobproc(struct proc *q, struct pgrp *pgrp)
643 sx_assert(&proctree_lock, SX_LOCKED);
644 return (q->p_pgrp != pgrp &&
645 q->p_pgrp->pg_session == pgrp->pg_session);
649 jobc_reaper(struct proc *p)
653 sx_assert(&proctree_lock, SX_LOCKED);
657 if (pp->p_reaper == pp ||
658 (pp->p_treeflag & P_TREE_GRPEXITED) == 0)
664 jobc_parent(struct proc *p)
668 sx_assert(&proctree_lock, SX_LOCKED);
670 pp = proc_realparent(p);
671 if (pp->p_pptr == NULL ||
672 (pp->p_treeflag & P_TREE_GRPEXITED) == 0)
674 return (jobc_reaper(pp));
679 check_pgrp_jobc(struct pgrp *pgrp)
684 sx_assert(&proctree_lock, SX_LOCKED);
685 PGRP_LOCK_ASSERT(pgrp, MA_NOTOWNED);
689 LIST_FOREACH(q, &pgrp->pg_members, p_pglist) {
690 if ((q->p_treeflag & P_TREE_GRPEXITED) != 0 ||
693 if (isjobproc(jobc_parent(q), pgrp))
696 KASSERT(pgrp->pg_jobc == cnt, ("pgrp %d %p pg_jobc %d cnt %d",
697 pgrp->pg_id, pgrp, pgrp->pg_jobc, cnt));
703 * Move p to a process group
706 doenterpgrp(struct proc *p, struct pgrp *pgrp)
708 struct pgrp *savepgrp;
710 sx_assert(&proctree_lock, SX_XLOCKED);
711 PROC_LOCK_ASSERT(p, MA_NOTOWNED);
712 PGRP_LOCK_ASSERT(pgrp, MA_NOTOWNED);
713 PGRP_LOCK_ASSERT(p->p_pgrp, MA_NOTOWNED);
714 SESS_LOCK_ASSERT(p->p_session, MA_NOTOWNED);
716 savepgrp = p->p_pgrp;
719 check_pgrp_jobc(pgrp);
720 check_pgrp_jobc(savepgrp);
724 * Adjust eligibility of affected pgrps to participate in job control.
726 fixjobc_enterpgrp(p, pgrp);
731 LIST_REMOVE(p, p_pglist);
734 LIST_INSERT_HEAD(&pgrp->pg_members, p, p_pglist);
735 PGRP_UNLOCK(savepgrp);
737 if (LIST_EMPTY(&savepgrp->pg_members))
742 * remove process from process group
745 leavepgrp(struct proc *p)
747 struct pgrp *savepgrp;
749 sx_assert(&proctree_lock, SX_XLOCKED);
750 savepgrp = p->p_pgrp;
753 LIST_REMOVE(p, p_pglist);
756 PGRP_UNLOCK(savepgrp);
757 if (LIST_EMPTY(&savepgrp->pg_members))
763 * delete a process group
766 pgdelete(struct pgrp *pgrp)
768 struct session *savesess;
771 sx_assert(&proctree_lock, SX_XLOCKED);
772 PGRP_LOCK_ASSERT(pgrp, MA_NOTOWNED);
773 SESS_LOCK_ASSERT(pgrp->pg_session, MA_NOTOWNED);
776 * Reset any sigio structures pointing to us as a result of
777 * F_SETOWN with our pgid.
779 funsetownlst(&pgrp->pg_sigiolst);
782 tp = pgrp->pg_session->s_ttyp;
783 LIST_REMOVE(pgrp, pg_hash);
784 savesess = pgrp->pg_session;
787 /* Remove the reference to the pgrp before deallocating it. */
790 tty_rel_pgrp(tp, pgrp);
793 proc_id_clear(PROC_ID_GROUP, pgrp->pg_id);
794 mtx_destroy(&pgrp->pg_mtx);
796 sess_release(savesess);
800 pgadjustjobc(struct pgrp *pgrp, bool entering)
805 MPASS(pgrp->pg_jobc >= 0);
808 MPASS(pgrp->pg_jobc > 0);
810 if (pgrp->pg_jobc == 0)
817 fixjobc_enterpgrp_q(struct pgrp *pgrp, struct proc *p, struct proc *q, bool adj)
819 struct pgrp *childpgrp;
822 sx_assert(&proctree_lock, SX_LOCKED);
824 if ((q->p_treeflag & P_TREE_GRPEXITED) != 0)
826 childpgrp = q->p_pgrp;
827 future_jobc = childpgrp != pgrp &&
828 childpgrp->pg_session == pgrp->pg_session;
830 if ((adj && !isjobproc(p, childpgrp) && future_jobc) ||
831 (!adj && isjobproc(p, childpgrp) && !future_jobc))
832 pgadjustjobc(childpgrp, adj);
836 * Adjust pgrp jobc counters when specified process changes process group.
837 * We count the number of processes in each process group that "qualify"
838 * the group for terminal job control (those with a parent in a different
839 * process group of the same session). If that count reaches zero, the
840 * process group becomes orphaned. Check both the specified process'
841 * process group and that of its children.
842 * We increment eligibility counts before decrementing, otherwise we
843 * could reach 0 spuriously during the decrement.
846 fixjobc_enterpgrp(struct proc *p, struct pgrp *pgrp)
850 sx_assert(&proctree_lock, SX_LOCKED);
851 PROC_LOCK_ASSERT(p, MA_NOTOWNED);
852 PGRP_LOCK_ASSERT(pgrp, MA_NOTOWNED);
853 SESS_LOCK_ASSERT(pgrp->pg_session, MA_NOTOWNED);
855 if (p->p_pgrp == pgrp)
858 if (isjobproc(jobc_parent(p), pgrp))
859 pgadjustjobc(pgrp, true);
860 LIST_FOREACH(q, &p->p_children, p_sibling) {
861 if ((q->p_treeflag & P_TREE_ORPHANED) != 0)
863 fixjobc_enterpgrp_q(pgrp, p, q, true);
865 LIST_FOREACH(q, &p->p_orphans, p_orphan)
866 fixjobc_enterpgrp_q(pgrp, p, q, true);
868 if (isjobproc(jobc_parent(p), p->p_pgrp))
869 pgadjustjobc(p->p_pgrp, false);
870 LIST_FOREACH(q, &p->p_children, p_sibling) {
871 if ((q->p_treeflag & P_TREE_ORPHANED) != 0)
873 fixjobc_enterpgrp_q(pgrp, p, q, false);
875 LIST_FOREACH(q, &p->p_orphans, p_orphan)
876 fixjobc_enterpgrp_q(pgrp, p, q, false);
880 fixjobc_kill_q(struct proc *p, struct proc *q, bool adj)
882 struct pgrp *childpgrp;
884 sx_assert(&proctree_lock, SX_LOCKED);
886 if ((q->p_treeflag & P_TREE_GRPEXITED) != 0)
888 childpgrp = q->p_pgrp;
890 if ((adj && isjobproc(jobc_reaper(q), childpgrp) &&
891 !isjobproc(p, childpgrp)) || (!adj && !isjobproc(jobc_reaper(q),
892 childpgrp) && isjobproc(p, childpgrp)))
893 pgadjustjobc(childpgrp, adj);
897 fixjobc_kill(struct proc *p)
902 sx_assert(&proctree_lock, SX_LOCKED);
903 PROC_LOCK_ASSERT(p, MA_NOTOWNED);
905 PGRP_LOCK_ASSERT(pgrp, MA_NOTOWNED);
906 SESS_LOCK_ASSERT(pgrp->pg_session, MA_NOTOWNED);
907 check_pgrp_jobc(pgrp);
910 * p no longer affects process group orphanage for children.
911 * It is marked by the flag because p is only physically
912 * removed from its process group on wait(2).
914 MPASS((p->p_treeflag & P_TREE_GRPEXITED) == 0);
915 p->p_treeflag |= P_TREE_GRPEXITED;
918 * Check p's parent to see whether p qualifies its own process
919 * group; if so, adjust count for p's process group.
921 if (isjobproc(jobc_parent(p), pgrp))
922 pgadjustjobc(pgrp, false);
925 * Check this process' children to see whether they qualify
926 * their process groups after reparenting to reaper. If so,
927 * adjust counts for children's process groups.
929 LIST_FOREACH(q, &p->p_children, p_sibling) {
930 if ((q->p_treeflag & P_TREE_ORPHANED) != 0)
932 fixjobc_kill_q(p, q, true);
934 LIST_FOREACH(q, &p->p_orphans, p_orphan)
935 fixjobc_kill_q(p, q, true);
936 LIST_FOREACH(q, &p->p_children, p_sibling) {
937 if ((q->p_treeflag & P_TREE_ORPHANED) != 0)
939 fixjobc_kill_q(p, q, false);
941 LIST_FOREACH(q, &p->p_orphans, p_orphan)
942 fixjobc_kill_q(p, q, false);
944 check_pgrp_jobc(pgrp);
956 MPASS(p->p_flag & P_WEXIT);
957 sx_assert(&proctree_lock, SX_LOCKED);
959 if (SESS_LEADER(p)) {
963 * s_ttyp is not zero'd; we use this to indicate that
964 * the session once had a controlling terminal. (for
965 * logging and informational purposes)
976 * Signal foreground pgrp and revoke access to
977 * controlling terminal if it has not been revoked
980 * Because the TTY may have been revoked in the mean
981 * time and could already have a new session associated
982 * with it, make sure we don't send a SIGHUP to a
983 * foreground process group that does not belong to this
989 if (tp->t_session == sp)
990 tty_signal_pgrp(tp, SIGHUP);
995 sx_xunlock(&proctree_lock);
996 if (vn_lock(ttyvp, LK_EXCLUSIVE) == 0) {
997 VOP_REVOKE(ttyvp, REVOKEALL);
1000 devfs_ctty_unref(ttyvp);
1001 sx_xlock(&proctree_lock);
1008 * A process group has become orphaned;
1009 * if there are any stopped processes in the group,
1010 * hang-up all process in that group.
1013 orphanpg(struct pgrp *pg)
1017 PGRP_LOCK_ASSERT(pg, MA_OWNED);
1019 LIST_FOREACH(p, &pg->pg_members, p_pglist) {
1021 if (P_SHOULDSTOP(p) == P_STOPPED_SIG) {
1023 LIST_FOREACH(p, &pg->pg_members, p_pglist) {
1025 kern_psignal(p, SIGHUP);
1026 kern_psignal(p, SIGCONT);
1036 sess_hold(struct session *s)
1039 refcount_acquire(&s->s_count);
1043 sess_release(struct session *s)
1046 if (refcount_release(&s->s_count)) {
1047 if (s->s_ttyp != NULL) {
1048 tty_lock(s->s_ttyp);
1049 tty_rel_sess(s->s_ttyp, s);
1051 proc_id_clear(PROC_ID_SESSION, s->s_sid);
1052 mtx_destroy(&s->s_mtx);
1060 db_print_pgrp_one(struct pgrp *pgrp, struct proc *p)
1063 " pid %d at %p pr %d pgrp %p e %d jc %d\n",
1064 p->p_pid, p, p->p_pptr == NULL ? -1 : p->p_pptr->p_pid,
1065 p->p_pgrp, (p->p_treeflag & P_TREE_GRPEXITED) != 0,
1066 p->p_pptr == NULL ? 0 : isjobproc(p->p_pptr, pgrp));
1069 DB_SHOW_COMMAND(pgrpdump, pgrpdump)
1075 for (i = 0; i <= pgrphash; i++) {
1076 if (!LIST_EMPTY(&pgrphashtbl[i])) {
1077 db_printf("indx %d\n", i);
1078 LIST_FOREACH(pgrp, &pgrphashtbl[i], pg_hash) {
1080 " pgrp %p, pgid %d, sess %p, sesscnt %d, mem %p\n",
1081 pgrp, (int)pgrp->pg_id, pgrp->pg_session,
1082 pgrp->pg_session->s_count,
1083 LIST_FIRST(&pgrp->pg_members));
1084 LIST_FOREACH(p, &pgrp->pg_members, p_pglist)
1085 db_print_pgrp_one(pgrp, p);
1093 * Calculate the kinfo_proc members which contain process-wide
1095 * Must be called with the target process locked.
1098 fill_kinfo_aggregate(struct proc *p, struct kinfo_proc *kp)
1102 PROC_LOCK_ASSERT(p, MA_OWNED);
1106 FOREACH_THREAD_IN_PROC(p, td) {
1108 kp->ki_pctcpu += sched_pctcpu(td);
1109 kp->ki_estcpu += sched_estcpu(td);
1115 * Clear kinfo_proc and fill in any information that is common
1116 * to all threads in the process.
1117 * Must be called with the target process locked.
1120 fill_kinfo_proc_only(struct proc *p, struct kinfo_proc *kp)
1127 struct timeval boottime;
1129 PROC_LOCK_ASSERT(p, MA_OWNED);
1130 bzero(kp, sizeof(*kp));
1132 kp->ki_structsize = sizeof(*kp);
1134 kp->ki_addr =/* p->p_addr; */0; /* XXX */
1135 kp->ki_args = p->p_args;
1136 kp->ki_textvp = p->p_textvp;
1138 kp->ki_tracep = p->p_tracevp;
1139 kp->ki_traceflag = p->p_traceflag;
1141 kp->ki_fd = p->p_fd;
1142 kp->ki_vmspace = p->p_vmspace;
1143 kp->ki_flag = p->p_flag;
1144 kp->ki_flag2 = p->p_flag2;
1147 kp->ki_uid = cred->cr_uid;
1148 kp->ki_ruid = cred->cr_ruid;
1149 kp->ki_svuid = cred->cr_svuid;
1150 kp->ki_cr_flags = 0;
1151 if (cred->cr_flags & CRED_FLAG_CAPMODE)
1152 kp->ki_cr_flags |= KI_CRF_CAPABILITY_MODE;
1153 /* XXX bde doesn't like KI_NGROUPS */
1154 if (cred->cr_ngroups > KI_NGROUPS) {
1155 kp->ki_ngroups = KI_NGROUPS;
1156 kp->ki_cr_flags |= KI_CRF_GRP_OVERFLOW;
1158 kp->ki_ngroups = cred->cr_ngroups;
1159 bcopy(cred->cr_groups, kp->ki_groups,
1160 kp->ki_ngroups * sizeof(gid_t));
1161 kp->ki_rgid = cred->cr_rgid;
1162 kp->ki_svgid = cred->cr_svgid;
1163 /* If jailed(cred), emulate the old P_JAILED flag. */
1165 kp->ki_flag |= P_JAILED;
1166 /* If inside the jail, use 0 as a jail ID. */
1167 if (cred->cr_prison != curthread->td_ucred->cr_prison)
1168 kp->ki_jid = cred->cr_prison->pr_id;
1170 strlcpy(kp->ki_loginclass, cred->cr_loginclass->lc_name,
1171 sizeof(kp->ki_loginclass));
1175 mtx_lock(&ps->ps_mtx);
1176 kp->ki_sigignore = ps->ps_sigignore;
1177 kp->ki_sigcatch = ps->ps_sigcatch;
1178 mtx_unlock(&ps->ps_mtx);
1180 if (p->p_state != PRS_NEW &&
1181 p->p_state != PRS_ZOMBIE &&
1182 p->p_vmspace != NULL) {
1183 struct vmspace *vm = p->p_vmspace;
1185 kp->ki_size = vm->vm_map.size;
1186 kp->ki_rssize = vmspace_resident_count(vm); /*XXX*/
1187 FOREACH_THREAD_IN_PROC(p, td0) {
1188 if (!TD_IS_SWAPPED(td0))
1189 kp->ki_rssize += td0->td_kstack_pages;
1191 kp->ki_swrss = vm->vm_swrss;
1192 kp->ki_tsize = vm->vm_tsize;
1193 kp->ki_dsize = vm->vm_dsize;
1194 kp->ki_ssize = vm->vm_ssize;
1195 } else if (p->p_state == PRS_ZOMBIE)
1196 kp->ki_stat = SZOMB;
1197 if (kp->ki_flag & P_INMEM)
1198 kp->ki_sflag = PS_INMEM;
1201 /* Calculate legacy swtime as seconds since 'swtick'. */
1202 kp->ki_swtime = (ticks - p->p_swtick) / hz;
1203 kp->ki_pid = p->p_pid;
1204 kp->ki_nice = p->p_nice;
1205 kp->ki_fibnum = p->p_fibnum;
1206 kp->ki_start = p->p_stats->p_start;
1207 getboottime(&boottime);
1208 timevaladd(&kp->ki_start, &boottime);
1210 rufetch(p, &kp->ki_rusage);
1211 kp->ki_runtime = cputick2usec(p->p_rux.rux_runtime);
1212 calcru(p, &kp->ki_rusage.ru_utime, &kp->ki_rusage.ru_stime);
1214 calccru(p, &kp->ki_childutime, &kp->ki_childstime);
1215 /* Some callers want child times in a single value. */
1216 kp->ki_childtime = kp->ki_childstime;
1217 timevaladd(&kp->ki_childtime, &kp->ki_childutime);
1219 FOREACH_THREAD_IN_PROC(p, td0)
1220 kp->ki_cow += td0->td_cow;
1224 kp->ki_pgid = p->p_pgrp->pg_id;
1225 kp->ki_jobc = p->p_pgrp->pg_jobc;
1226 sp = p->p_pgrp->pg_session;
1229 kp->ki_sid = sp->s_sid;
1231 strlcpy(kp->ki_login, sp->s_login,
1232 sizeof(kp->ki_login));
1234 kp->ki_kiflag |= KI_CTTY;
1236 kp->ki_kiflag |= KI_SLEADER;
1237 /* XXX proctree_lock */
1242 if ((p->p_flag & P_CONTROLT) && tp != NULL) {
1243 kp->ki_tdev = tty_udev(tp);
1244 kp->ki_tdev_freebsd11 = kp->ki_tdev; /* truncate */
1245 kp->ki_tpgid = tp->t_pgrp ? tp->t_pgrp->pg_id : NO_PID;
1247 kp->ki_tsid = tp->t_session->s_sid;
1249 kp->ki_tdev = NODEV;
1250 kp->ki_tdev_freebsd11 = kp->ki_tdev; /* truncate */
1252 if (p->p_comm[0] != '\0')
1253 strlcpy(kp->ki_comm, p->p_comm, sizeof(kp->ki_comm));
1254 if (p->p_sysent && p->p_sysent->sv_name != NULL &&
1255 p->p_sysent->sv_name[0] != '\0')
1256 strlcpy(kp->ki_emul, p->p_sysent->sv_name, sizeof(kp->ki_emul));
1257 kp->ki_siglist = p->p_siglist;
1258 kp->ki_xstat = KW_EXITCODE(p->p_xexit, p->p_xsig);
1259 kp->ki_acflag = p->p_acflag;
1260 kp->ki_lock = p->p_lock;
1262 kp->ki_ppid = p->p_oppid;
1263 if (p->p_flag & P_TRACED)
1264 kp->ki_tracer = p->p_pptr->p_pid;
1269 * Fill in information that is thread specific. Must be called with
1270 * target process locked. If 'preferthread' is set, overwrite certain
1271 * process-related fields that are maintained for both threads and
1275 fill_kinfo_thread(struct thread *td, struct kinfo_proc *kp, int preferthread)
1281 PROC_LOCK_ASSERT(p, MA_OWNED);
1286 if (td->td_wmesg != NULL)
1287 strlcpy(kp->ki_wmesg, td->td_wmesg, sizeof(kp->ki_wmesg));
1289 bzero(kp->ki_wmesg, sizeof(kp->ki_wmesg));
1290 if (strlcpy(kp->ki_tdname, td->td_name, sizeof(kp->ki_tdname)) >=
1291 sizeof(kp->ki_tdname)) {
1292 strlcpy(kp->ki_moretdname,
1293 td->td_name + sizeof(kp->ki_tdname) - 1,
1294 sizeof(kp->ki_moretdname));
1296 bzero(kp->ki_moretdname, sizeof(kp->ki_moretdname));
1298 if (TD_ON_LOCK(td)) {
1299 kp->ki_kiflag |= KI_LOCKBLOCK;
1300 strlcpy(kp->ki_lockname, td->td_lockname,
1301 sizeof(kp->ki_lockname));
1303 kp->ki_kiflag &= ~KI_LOCKBLOCK;
1304 bzero(kp->ki_lockname, sizeof(kp->ki_lockname));
1307 if (p->p_state == PRS_NORMAL) { /* approximate. */
1308 if (TD_ON_RUNQ(td) ||
1310 TD_IS_RUNNING(td)) {
1312 } else if (P_SHOULDSTOP(p)) {
1313 kp->ki_stat = SSTOP;
1314 } else if (TD_IS_SLEEPING(td)) {
1315 kp->ki_stat = SSLEEP;
1316 } else if (TD_ON_LOCK(td)) {
1317 kp->ki_stat = SLOCK;
1319 kp->ki_stat = SWAIT;
1321 } else if (p->p_state == PRS_ZOMBIE) {
1322 kp->ki_stat = SZOMB;
1327 /* Things in the thread */
1328 kp->ki_wchan = td->td_wchan;
1329 kp->ki_pri.pri_level = td->td_priority;
1330 kp->ki_pri.pri_native = td->td_base_pri;
1333 * Note: legacy fields; clamp at the old NOCPU value and/or
1334 * the maximum u_char CPU value.
1336 if (td->td_lastcpu == NOCPU)
1337 kp->ki_lastcpu_old = NOCPU_OLD;
1338 else if (td->td_lastcpu > MAXCPU_OLD)
1339 kp->ki_lastcpu_old = MAXCPU_OLD;
1341 kp->ki_lastcpu_old = td->td_lastcpu;
1343 if (td->td_oncpu == NOCPU)
1344 kp->ki_oncpu_old = NOCPU_OLD;
1345 else if (td->td_oncpu > MAXCPU_OLD)
1346 kp->ki_oncpu_old = MAXCPU_OLD;
1348 kp->ki_oncpu_old = td->td_oncpu;
1350 kp->ki_lastcpu = td->td_lastcpu;
1351 kp->ki_oncpu = td->td_oncpu;
1352 kp->ki_tdflags = td->td_flags;
1353 kp->ki_tid = td->td_tid;
1354 kp->ki_numthreads = p->p_numthreads;
1355 kp->ki_pcb = td->td_pcb;
1356 kp->ki_kstack = (void *)td->td_kstack;
1357 kp->ki_slptime = (ticks - td->td_slptick) / hz;
1358 kp->ki_pri.pri_class = td->td_pri_class;
1359 kp->ki_pri.pri_user = td->td_user_pri;
1362 rufetchtd(td, &kp->ki_rusage);
1363 kp->ki_runtime = cputick2usec(td->td_rux.rux_runtime);
1364 kp->ki_pctcpu = sched_pctcpu(td);
1365 kp->ki_estcpu = sched_estcpu(td);
1366 kp->ki_cow = td->td_cow;
1369 /* We can't get this anymore but ps etc never used it anyway. */
1373 kp->ki_siglist = td->td_siglist;
1374 kp->ki_sigmask = td->td_sigmask;
1381 * Fill in a kinfo_proc structure for the specified process.
1382 * Must be called with the target process locked.
1385 fill_kinfo_proc(struct proc *p, struct kinfo_proc *kp)
1388 MPASS(FIRST_THREAD_IN_PROC(p) != NULL);
1390 fill_kinfo_proc_only(p, kp);
1391 fill_kinfo_thread(FIRST_THREAD_IN_PROC(p), kp, 0);
1392 fill_kinfo_aggregate(p, kp);
1399 return (malloc(sizeof(struct pstats), M_SUBPROC, M_ZERO|M_WAITOK));
1403 * Copy parts of p_stats; zero the rest of p_stats (statistics).
1406 pstats_fork(struct pstats *src, struct pstats *dst)
1409 bzero(&dst->pstat_startzero,
1410 __rangeof(struct pstats, pstat_startzero, pstat_endzero));
1411 bcopy(&src->pstat_startcopy, &dst->pstat_startcopy,
1412 __rangeof(struct pstats, pstat_startcopy, pstat_endcopy));
1416 pstats_free(struct pstats *ps)
1419 free(ps, M_SUBPROC);
1422 #ifdef COMPAT_FREEBSD32
1425 * This function is typically used to copy out the kernel address, so
1426 * it can be replaced by assignment of zero.
1428 static inline uint32_t
1429 ptr32_trim(const void *ptr)
1433 uptr = (uintptr_t)ptr;
1434 return ((uptr > UINT_MAX) ? 0 : uptr);
1437 #define PTRTRIM_CP(src,dst,fld) \
1438 do { (dst).fld = ptr32_trim((src).fld); } while (0)
1441 freebsd32_kinfo_proc_out(const struct kinfo_proc *ki, struct kinfo_proc32 *ki32)
1445 bzero(ki32, sizeof(struct kinfo_proc32));
1446 ki32->ki_structsize = sizeof(struct kinfo_proc32);
1447 CP(*ki, *ki32, ki_layout);
1448 PTRTRIM_CP(*ki, *ki32, ki_args);
1449 PTRTRIM_CP(*ki, *ki32, ki_paddr);
1450 PTRTRIM_CP(*ki, *ki32, ki_addr);
1451 PTRTRIM_CP(*ki, *ki32, ki_tracep);
1452 PTRTRIM_CP(*ki, *ki32, ki_textvp);
1453 PTRTRIM_CP(*ki, *ki32, ki_fd);
1454 PTRTRIM_CP(*ki, *ki32, ki_vmspace);
1455 PTRTRIM_CP(*ki, *ki32, ki_wchan);
1456 CP(*ki, *ki32, ki_pid);
1457 CP(*ki, *ki32, ki_ppid);
1458 CP(*ki, *ki32, ki_pgid);
1459 CP(*ki, *ki32, ki_tpgid);
1460 CP(*ki, *ki32, ki_sid);
1461 CP(*ki, *ki32, ki_tsid);
1462 CP(*ki, *ki32, ki_jobc);
1463 CP(*ki, *ki32, ki_tdev);
1464 CP(*ki, *ki32, ki_tdev_freebsd11);
1465 CP(*ki, *ki32, ki_siglist);
1466 CP(*ki, *ki32, ki_sigmask);
1467 CP(*ki, *ki32, ki_sigignore);
1468 CP(*ki, *ki32, ki_sigcatch);
1469 CP(*ki, *ki32, ki_uid);
1470 CP(*ki, *ki32, ki_ruid);
1471 CP(*ki, *ki32, ki_svuid);
1472 CP(*ki, *ki32, ki_rgid);
1473 CP(*ki, *ki32, ki_svgid);
1474 CP(*ki, *ki32, ki_ngroups);
1475 for (i = 0; i < KI_NGROUPS; i++)
1476 CP(*ki, *ki32, ki_groups[i]);
1477 CP(*ki, *ki32, ki_size);
1478 CP(*ki, *ki32, ki_rssize);
1479 CP(*ki, *ki32, ki_swrss);
1480 CP(*ki, *ki32, ki_tsize);
1481 CP(*ki, *ki32, ki_dsize);
1482 CP(*ki, *ki32, ki_ssize);
1483 CP(*ki, *ki32, ki_xstat);
1484 CP(*ki, *ki32, ki_acflag);
1485 CP(*ki, *ki32, ki_pctcpu);
1486 CP(*ki, *ki32, ki_estcpu);
1487 CP(*ki, *ki32, ki_slptime);
1488 CP(*ki, *ki32, ki_swtime);
1489 CP(*ki, *ki32, ki_cow);
1490 CP(*ki, *ki32, ki_runtime);
1491 TV_CP(*ki, *ki32, ki_start);
1492 TV_CP(*ki, *ki32, ki_childtime);
1493 CP(*ki, *ki32, ki_flag);
1494 CP(*ki, *ki32, ki_kiflag);
1495 CP(*ki, *ki32, ki_traceflag);
1496 CP(*ki, *ki32, ki_stat);
1497 CP(*ki, *ki32, ki_nice);
1498 CP(*ki, *ki32, ki_lock);
1499 CP(*ki, *ki32, ki_rqindex);
1500 CP(*ki, *ki32, ki_oncpu);
1501 CP(*ki, *ki32, ki_lastcpu);
1503 /* XXX TODO: wrap cpu value as appropriate */
1504 CP(*ki, *ki32, ki_oncpu_old);
1505 CP(*ki, *ki32, ki_lastcpu_old);
1507 bcopy(ki->ki_tdname, ki32->ki_tdname, TDNAMLEN + 1);
1508 bcopy(ki->ki_wmesg, ki32->ki_wmesg, WMESGLEN + 1);
1509 bcopy(ki->ki_login, ki32->ki_login, LOGNAMELEN + 1);
1510 bcopy(ki->ki_lockname, ki32->ki_lockname, LOCKNAMELEN + 1);
1511 bcopy(ki->ki_comm, ki32->ki_comm, COMMLEN + 1);
1512 bcopy(ki->ki_emul, ki32->ki_emul, KI_EMULNAMELEN + 1);
1513 bcopy(ki->ki_loginclass, ki32->ki_loginclass, LOGINCLASSLEN + 1);
1514 bcopy(ki->ki_moretdname, ki32->ki_moretdname, MAXCOMLEN - TDNAMLEN + 1);
1515 CP(*ki, *ki32, ki_tracer);
1516 CP(*ki, *ki32, ki_flag2);
1517 CP(*ki, *ki32, ki_fibnum);
1518 CP(*ki, *ki32, ki_cr_flags);
1519 CP(*ki, *ki32, ki_jid);
1520 CP(*ki, *ki32, ki_numthreads);
1521 CP(*ki, *ki32, ki_tid);
1522 CP(*ki, *ki32, ki_pri);
1523 freebsd32_rusage_out(&ki->ki_rusage, &ki32->ki_rusage);
1524 freebsd32_rusage_out(&ki->ki_rusage_ch, &ki32->ki_rusage_ch);
1525 PTRTRIM_CP(*ki, *ki32, ki_pcb);
1526 PTRTRIM_CP(*ki, *ki32, ki_kstack);
1527 PTRTRIM_CP(*ki, *ki32, ki_udata);
1528 PTRTRIM_CP(*ki, *ki32, ki_tdaddr);
1529 CP(*ki, *ki32, ki_sflag);
1530 CP(*ki, *ki32, ki_tdflags);
1535 kern_proc_out_size(struct proc *p, int flags)
1539 PROC_LOCK_ASSERT(p, MA_OWNED);
1541 if ((flags & KERN_PROC_NOTHREADS) != 0) {
1542 #ifdef COMPAT_FREEBSD32
1543 if ((flags & KERN_PROC_MASK32) != 0) {
1544 size += sizeof(struct kinfo_proc32);
1547 size += sizeof(struct kinfo_proc);
1549 #ifdef COMPAT_FREEBSD32
1550 if ((flags & KERN_PROC_MASK32) != 0)
1551 size += sizeof(struct kinfo_proc32) * p->p_numthreads;
1554 size += sizeof(struct kinfo_proc) * p->p_numthreads;
1561 kern_proc_out(struct proc *p, struct sbuf *sb, int flags)
1564 struct kinfo_proc ki;
1565 #ifdef COMPAT_FREEBSD32
1566 struct kinfo_proc32 ki32;
1570 PROC_LOCK_ASSERT(p, MA_OWNED);
1571 MPASS(FIRST_THREAD_IN_PROC(p) != NULL);
1574 fill_kinfo_proc(p, &ki);
1575 if ((flags & KERN_PROC_NOTHREADS) != 0) {
1576 #ifdef COMPAT_FREEBSD32
1577 if ((flags & KERN_PROC_MASK32) != 0) {
1578 freebsd32_kinfo_proc_out(&ki, &ki32);
1579 if (sbuf_bcat(sb, &ki32, sizeof(ki32)) != 0)
1583 if (sbuf_bcat(sb, &ki, sizeof(ki)) != 0)
1586 FOREACH_THREAD_IN_PROC(p, td) {
1587 fill_kinfo_thread(td, &ki, 1);
1588 #ifdef COMPAT_FREEBSD32
1589 if ((flags & KERN_PROC_MASK32) != 0) {
1590 freebsd32_kinfo_proc_out(&ki, &ki32);
1591 if (sbuf_bcat(sb, &ki32, sizeof(ki32)) != 0)
1595 if (sbuf_bcat(sb, &ki, sizeof(ki)) != 0)
1606 sysctl_out_proc(struct proc *p, struct sysctl_req *req, int flags)
1609 struct kinfo_proc ki;
1612 if (req->oldptr == NULL)
1613 return (SYSCTL_OUT(req, 0, kern_proc_out_size(p, flags)));
1615 sbuf_new_for_sysctl(&sb, (char *)&ki, sizeof(ki), req);
1616 sbuf_clear_flags(&sb, SBUF_INCLUDENUL);
1617 error = kern_proc_out(p, &sb, flags);
1618 error2 = sbuf_finish(&sb);
1622 else if (error2 != 0)
1628 proc_iterate(int (*cb)(struct proc *, void *), void *cbarg)
1633 for (i = 0; i < pidhashlock + 1; i++) {
1634 sx_slock(&pidhashtbl_lock[i]);
1635 for (j = i; j <= pidhash; j += pidhashlock + 1) {
1636 LIST_FOREACH(p, &pidhashtbl[j], p_hash) {
1637 if (p->p_state == PRS_NEW)
1639 error = cb(p, cbarg);
1640 PROC_LOCK_ASSERT(p, MA_NOTOWNED);
1642 sx_sunlock(&pidhashtbl_lock[i]);
1647 sx_sunlock(&pidhashtbl_lock[i]);
1652 struct kern_proc_out_args {
1653 struct sysctl_req *req;
1660 sysctl_kern_proc_iterate(struct proc *p, void *origarg)
1662 struct kern_proc_out_args *arg = origarg;
1663 int *name = arg->name;
1664 int oid_number = arg->oid_number;
1665 int flags = arg->flags;
1666 struct sysctl_req *req = arg->req;
1671 KASSERT(p->p_ucred != NULL,
1672 ("process credential is NULL for non-NEW proc"));
1674 * Show a user only appropriate processes.
1676 if (p_cansee(curthread, p))
1679 * TODO - make more efficient (see notes below).
1682 switch (oid_number) {
1684 if (p->p_ucred->cr_gid != (gid_t)name[0])
1688 case KERN_PROC_PGRP:
1689 /* could do this by traversing pgrp */
1690 if (p->p_pgrp == NULL ||
1691 p->p_pgrp->pg_id != (pid_t)name[0])
1695 case KERN_PROC_RGID:
1696 if (p->p_ucred->cr_rgid != (gid_t)name[0])
1700 case KERN_PROC_SESSION:
1701 if (p->p_session == NULL ||
1702 p->p_session->s_sid != (pid_t)name[0])
1707 if ((p->p_flag & P_CONTROLT) == 0 ||
1708 p->p_session == NULL)
1710 /* XXX proctree_lock */
1711 SESS_LOCK(p->p_session);
1712 if (p->p_session->s_ttyp == NULL ||
1713 tty_udev(p->p_session->s_ttyp) !=
1715 SESS_UNLOCK(p->p_session);
1718 SESS_UNLOCK(p->p_session);
1722 if (p->p_ucred->cr_uid != (uid_t)name[0])
1726 case KERN_PROC_RUID:
1727 if (p->p_ucred->cr_ruid != (uid_t)name[0])
1731 case KERN_PROC_PROC:
1737 error = sysctl_out_proc(p, req, flags);
1738 PROC_LOCK_ASSERT(p, MA_NOTOWNED);
1746 sysctl_kern_proc(SYSCTL_HANDLER_ARGS)
1748 struct kern_proc_out_args iterarg;
1749 int *name = (int *)arg1;
1750 u_int namelen = arg2;
1752 int flags, oid_number;
1755 oid_number = oidp->oid_number;
1756 if (oid_number != KERN_PROC_ALL &&
1757 (oid_number & KERN_PROC_INC_THREAD) == 0)
1758 flags = KERN_PROC_NOTHREADS;
1761 oid_number &= ~KERN_PROC_INC_THREAD;
1763 #ifdef COMPAT_FREEBSD32
1764 if (req->flags & SCTL_MASK32)
1765 flags |= KERN_PROC_MASK32;
1767 if (oid_number == KERN_PROC_PID) {
1770 error = sysctl_wire_old_buffer(req, 0);
1773 error = pget((pid_t)name[0], PGET_CANSEE, &p);
1775 error = sysctl_out_proc(p, req, flags);
1779 switch (oid_number) {
1784 case KERN_PROC_PROC:
1785 if (namelen != 0 && namelen != 1)
1794 if (req->oldptr == NULL) {
1795 /* overestimate by 5 procs */
1796 error = SYSCTL_OUT(req, 0, sizeof (struct kinfo_proc) * 5);
1800 error = sysctl_wire_old_buffer(req, 0);
1804 iterarg.flags = flags;
1805 iterarg.oid_number = oid_number;
1807 iterarg.name = name;
1808 error = proc_iterate(sysctl_kern_proc_iterate, &iterarg);
1813 pargs_alloc(int len)
1817 pa = malloc(sizeof(struct pargs) + len, M_PARGS,
1819 refcount_init(&pa->ar_ref, 1);
1820 pa->ar_length = len;
1825 pargs_free(struct pargs *pa)
1832 pargs_hold(struct pargs *pa)
1837 refcount_acquire(&pa->ar_ref);
1841 pargs_drop(struct pargs *pa)
1846 if (refcount_release(&pa->ar_ref))
1851 proc_read_string(struct thread *td, struct proc *p, const char *sptr, char *buf,
1857 * This may return a short read if the string is shorter than the chunk
1858 * and is aligned at the end of the page, and the following page is not
1861 n = proc_readmem(td, p, (vm_offset_t)sptr, buf, len);
1867 #define PROC_AUXV_MAX 256 /* Safety limit on auxv size. */
1869 enum proc_vector_type {
1875 #ifdef COMPAT_FREEBSD32
1877 get_proc_vector32(struct thread *td, struct proc *p, char ***proc_vectorp,
1878 size_t *vsizep, enum proc_vector_type type)
1880 struct freebsd32_ps_strings pss;
1882 vm_offset_t vptr, ptr;
1883 uint32_t *proc_vector32;
1889 if (proc_readmem(td, p, (vm_offset_t)p->p_sysent->sv_psstrings, &pss,
1890 sizeof(pss)) != sizeof(pss))
1894 vptr = (vm_offset_t)PTRIN(pss.ps_argvstr);
1895 vsize = pss.ps_nargvstr;
1896 if (vsize > ARG_MAX)
1898 size = vsize * sizeof(int32_t);
1901 vptr = (vm_offset_t)PTRIN(pss.ps_envstr);
1902 vsize = pss.ps_nenvstr;
1903 if (vsize > ARG_MAX)
1905 size = vsize * sizeof(int32_t);
1908 vptr = (vm_offset_t)PTRIN(pss.ps_envstr) +
1909 (pss.ps_nenvstr + 1) * sizeof(int32_t);
1912 for (ptr = vptr, i = 0; i < PROC_AUXV_MAX; i++) {
1913 if (proc_readmem(td, p, ptr, &aux, sizeof(aux)) !=
1916 if (aux.a_type == AT_NULL)
1920 if (aux.a_type != AT_NULL)
1923 size = vsize * sizeof(aux);
1926 KASSERT(0, ("Wrong proc vector type: %d", type));
1929 proc_vector32 = malloc(size, M_TEMP, M_WAITOK);
1930 if (proc_readmem(td, p, vptr, proc_vector32, size) != size) {
1934 if (type == PROC_AUX) {
1935 *proc_vectorp = (char **)proc_vector32;
1939 proc_vector = malloc(vsize * sizeof(char *), M_TEMP, M_WAITOK);
1940 for (i = 0; i < (int)vsize; i++)
1941 proc_vector[i] = PTRIN(proc_vector32[i]);
1942 *proc_vectorp = proc_vector;
1945 free(proc_vector32, M_TEMP);
1951 get_proc_vector(struct thread *td, struct proc *p, char ***proc_vectorp,
1952 size_t *vsizep, enum proc_vector_type type)
1954 struct ps_strings pss;
1956 vm_offset_t vptr, ptr;
1961 #ifdef COMPAT_FREEBSD32
1962 if (SV_PROC_FLAG(p, SV_ILP32) != 0)
1963 return (get_proc_vector32(td, p, proc_vectorp, vsizep, type));
1965 if (proc_readmem(td, p, (vm_offset_t)p->p_sysent->sv_psstrings, &pss,
1966 sizeof(pss)) != sizeof(pss))
1970 vptr = (vm_offset_t)pss.ps_argvstr;
1971 vsize = pss.ps_nargvstr;
1972 if (vsize > ARG_MAX)
1974 size = vsize * sizeof(char *);
1977 vptr = (vm_offset_t)pss.ps_envstr;
1978 vsize = pss.ps_nenvstr;
1979 if (vsize > ARG_MAX)
1981 size = vsize * sizeof(char *);
1985 * The aux array is just above env array on the stack. Check
1986 * that the address is naturally aligned.
1988 vptr = (vm_offset_t)pss.ps_envstr + (pss.ps_nenvstr + 1)
1990 #if __ELF_WORD_SIZE == 64
1991 if (vptr % sizeof(uint64_t) != 0)
1993 if (vptr % sizeof(uint32_t) != 0)
1997 * We count the array size reading the aux vectors from the
1998 * stack until AT_NULL vector is returned. So (to keep the code
1999 * simple) we read the process stack twice: the first time here
2000 * to find the size and the second time when copying the vectors
2001 * to the allocated proc_vector.
2003 for (ptr = vptr, i = 0; i < PROC_AUXV_MAX; i++) {
2004 if (proc_readmem(td, p, ptr, &aux, sizeof(aux)) !=
2007 if (aux.a_type == AT_NULL)
2012 * If the PROC_AUXV_MAX entries are iterated over, and we have
2013 * not reached AT_NULL, it is most likely we are reading wrong
2014 * data: either the process doesn't have auxv array or data has
2015 * been modified. Return the error in this case.
2017 if (aux.a_type != AT_NULL)
2020 size = vsize * sizeof(aux);
2023 KASSERT(0, ("Wrong proc vector type: %d", type));
2024 return (EINVAL); /* In case we are built without INVARIANTS. */
2026 proc_vector = malloc(size, M_TEMP, M_WAITOK);
2027 if (proc_readmem(td, p, vptr, proc_vector, size) != size) {
2028 free(proc_vector, M_TEMP);
2031 *proc_vectorp = proc_vector;
2037 #define GET_PS_STRINGS_CHUNK_SZ 256 /* Chunk size (bytes) for ps_strings operations. */
2040 get_ps_strings(struct thread *td, struct proc *p, struct sbuf *sb,
2041 enum proc_vector_type type)
2043 size_t done, len, nchr, vsize;
2045 char **proc_vector, *sptr;
2046 char pss_string[GET_PS_STRINGS_CHUNK_SZ];
2048 PROC_ASSERT_HELD(p);
2051 * We are not going to read more than 2 * (PATH_MAX + ARG_MAX) bytes.
2053 nchr = 2 * (PATH_MAX + ARG_MAX);
2055 error = get_proc_vector(td, p, &proc_vector, &vsize, type);
2058 for (done = 0, i = 0; i < (int)vsize && done < nchr; i++) {
2060 * The program may have scribbled into its argv array, e.g. to
2061 * remove some arguments. If that has happened, break out
2062 * before trying to read from NULL.
2064 if (proc_vector[i] == NULL)
2066 for (sptr = proc_vector[i]; ; sptr += GET_PS_STRINGS_CHUNK_SZ) {
2067 error = proc_read_string(td, p, sptr, pss_string,
2068 sizeof(pss_string));
2071 len = strnlen(pss_string, GET_PS_STRINGS_CHUNK_SZ);
2072 if (done + len >= nchr)
2073 len = nchr - done - 1;
2074 sbuf_bcat(sb, pss_string, len);
2075 if (len != GET_PS_STRINGS_CHUNK_SZ)
2077 done += GET_PS_STRINGS_CHUNK_SZ;
2079 sbuf_bcat(sb, "", 1);
2083 free(proc_vector, M_TEMP);
2088 proc_getargv(struct thread *td, struct proc *p, struct sbuf *sb)
2091 return (get_ps_strings(curthread, p, sb, PROC_ARG));
2095 proc_getenvv(struct thread *td, struct proc *p, struct sbuf *sb)
2098 return (get_ps_strings(curthread, p, sb, PROC_ENV));
2102 proc_getauxv(struct thread *td, struct proc *p, struct sbuf *sb)
2108 error = get_proc_vector(td, p, &auxv, &vsize, PROC_AUX);
2110 #ifdef COMPAT_FREEBSD32
2111 if (SV_PROC_FLAG(p, SV_ILP32) != 0)
2112 size = vsize * sizeof(Elf32_Auxinfo);
2115 size = vsize * sizeof(Elf_Auxinfo);
2116 if (sbuf_bcat(sb, auxv, size) != 0)
2124 * This sysctl allows a process to retrieve the argument list or process
2125 * title for another process without groping around in the address space
2126 * of the other process. It also allow a process to set its own "process
2127 * title to a string of its own choice.
2130 sysctl_kern_proc_args(SYSCTL_HANDLER_ARGS)
2132 int *name = (int *)arg1;
2133 u_int namelen = arg2;
2134 struct pargs *newpa, *pa;
2137 int flags, error = 0, error2;
2143 pid = (pid_t)name[0];
2145 * If the query is for this process and it is single-threaded, there
2146 * is nobody to modify pargs, thus we can just read.
2149 if (pid == p->p_pid && p->p_numthreads == 1 && req->newptr == NULL &&
2150 (pa = p->p_args) != NULL)
2151 return (SYSCTL_OUT(req, pa->ar_args, pa->ar_length));
2153 flags = PGET_CANSEE;
2154 if (req->newptr != NULL)
2155 flags |= PGET_ISCURRENT;
2156 error = pget(pid, flags, &p);
2164 error = SYSCTL_OUT(req, pa->ar_args, pa->ar_length);
2166 } else if ((p->p_flag & (P_WEXIT | P_SYSTEM)) == 0) {
2169 sbuf_new_for_sysctl(&sb, NULL, GET_PS_STRINGS_CHUNK_SZ, req);
2170 sbuf_clear_flags(&sb, SBUF_INCLUDENUL);
2171 error = proc_getargv(curthread, p, &sb);
2172 error2 = sbuf_finish(&sb);
2175 if (error == 0 && error2 != 0)
2180 if (error != 0 || req->newptr == NULL)
2183 if (req->newlen > ps_arg_cache_limit - sizeof(struct pargs))
2186 if (req->newlen == 0) {
2188 * Clear the argument pointer, so that we'll fetch arguments
2189 * with proc_getargv() until further notice.
2193 newpa = pargs_alloc(req->newlen);
2194 error = SYSCTL_IN(req, newpa->ar_args, req->newlen);
2209 * This sysctl allows a process to retrieve environment of another process.
2212 sysctl_kern_proc_env(SYSCTL_HANDLER_ARGS)
2214 int *name = (int *)arg1;
2215 u_int namelen = arg2;
2223 error = pget((pid_t)name[0], PGET_WANTREAD, &p);
2226 if ((p->p_flag & P_SYSTEM) != 0) {
2231 sbuf_new_for_sysctl(&sb, NULL, GET_PS_STRINGS_CHUNK_SZ, req);
2232 sbuf_clear_flags(&sb, SBUF_INCLUDENUL);
2233 error = proc_getenvv(curthread, p, &sb);
2234 error2 = sbuf_finish(&sb);
2237 return (error != 0 ? error : error2);
2241 * This sysctl allows a process to retrieve ELF auxiliary vector of
2245 sysctl_kern_proc_auxv(SYSCTL_HANDLER_ARGS)
2247 int *name = (int *)arg1;
2248 u_int namelen = arg2;
2256 error = pget((pid_t)name[0], PGET_WANTREAD, &p);
2259 if ((p->p_flag & P_SYSTEM) != 0) {
2263 sbuf_new_for_sysctl(&sb, NULL, GET_PS_STRINGS_CHUNK_SZ, req);
2264 sbuf_clear_flags(&sb, SBUF_INCLUDENUL);
2265 error = proc_getauxv(curthread, p, &sb);
2266 error2 = sbuf_finish(&sb);
2269 return (error != 0 ? error : error2);
2273 * This sysctl allows a process to retrieve the path of the executable for
2274 * itself or another process.
2277 sysctl_kern_proc_pathname(SYSCTL_HANDLER_ARGS)
2279 pid_t *pidp = (pid_t *)arg1;
2280 unsigned int arglen = arg2;
2283 char *retbuf, *freebuf;
2288 if (*pidp == -1) { /* -1 means this process */
2289 p = req->td->td_proc;
2291 error = pget(*pidp, PGET_CANSEE, &p);
2305 error = vn_fullpath(vp, &retbuf, &freebuf);
2309 error = SYSCTL_OUT(req, retbuf, strlen(retbuf) + 1);
2310 free(freebuf, M_TEMP);
2315 sysctl_kern_proc_sv_name(SYSCTL_HANDLER_ARGS)
2328 error = pget((pid_t)name[0], PGET_CANSEE, &p);
2331 sv_name = p->p_sysent->sv_name;
2333 return (sysctl_handle_string(oidp, sv_name, 0, req));
2336 #ifdef KINFO_OVMENTRY_SIZE
2337 CTASSERT(sizeof(struct kinfo_ovmentry) == KINFO_OVMENTRY_SIZE);
2340 #ifdef COMPAT_FREEBSD7
2342 sysctl_kern_proc_ovmmap(SYSCTL_HANDLER_ARGS)
2344 vm_map_entry_t entry, tmp_entry;
2345 unsigned int last_timestamp;
2346 char *fullpath, *freepath;
2347 struct kinfo_ovmentry *kve;
2357 error = pget((pid_t)name[0], PGET_WANTREAD, &p);
2360 vm = vmspace_acquire_ref(p);
2365 kve = malloc(sizeof(*kve), M_TEMP, M_WAITOK);
2368 vm_map_lock_read(map);
2369 VM_MAP_ENTRY_FOREACH(entry, map) {
2370 vm_object_t obj, tobj, lobj;
2373 if (entry->eflags & MAP_ENTRY_IS_SUB_MAP)
2376 bzero(kve, sizeof(*kve));
2377 kve->kve_structsize = sizeof(*kve);
2379 kve->kve_private_resident = 0;
2380 obj = entry->object.vm_object;
2382 VM_OBJECT_RLOCK(obj);
2383 if (obj->shadow_count == 1)
2384 kve->kve_private_resident =
2385 obj->resident_page_count;
2387 kve->kve_resident = 0;
2388 addr = entry->start;
2389 while (addr < entry->end) {
2390 if (pmap_extract(map->pmap, addr))
2391 kve->kve_resident++;
2395 for (lobj = tobj = obj; tobj; tobj = tobj->backing_object) {
2397 VM_OBJECT_RLOCK(tobj);
2398 kve->kve_offset += tobj->backing_object_offset;
2401 VM_OBJECT_RUNLOCK(lobj);
2405 kve->kve_start = (void*)entry->start;
2406 kve->kve_end = (void*)entry->end;
2407 kve->kve_offset += (off_t)entry->offset;
2409 if (entry->protection & VM_PROT_READ)
2410 kve->kve_protection |= KVME_PROT_READ;
2411 if (entry->protection & VM_PROT_WRITE)
2412 kve->kve_protection |= KVME_PROT_WRITE;
2413 if (entry->protection & VM_PROT_EXECUTE)
2414 kve->kve_protection |= KVME_PROT_EXEC;
2416 if (entry->eflags & MAP_ENTRY_COW)
2417 kve->kve_flags |= KVME_FLAG_COW;
2418 if (entry->eflags & MAP_ENTRY_NEEDS_COPY)
2419 kve->kve_flags |= KVME_FLAG_NEEDS_COPY;
2420 if (entry->eflags & MAP_ENTRY_NOCOREDUMP)
2421 kve->kve_flags |= KVME_FLAG_NOCOREDUMP;
2423 last_timestamp = map->timestamp;
2424 vm_map_unlock_read(map);
2426 kve->kve_fileid = 0;
2431 kve->kve_type = vm_object_kvme_type(lobj, &vp);
2432 if (kve->kve_type == KVME_TYPE_MGTDEVICE)
2433 kve->kve_type = KVME_TYPE_UNKNOWN;
2437 VM_OBJECT_RUNLOCK(lobj);
2439 kve->kve_ref_count = obj->ref_count;
2440 kve->kve_shadow_count = obj->shadow_count;
2441 VM_OBJECT_RUNLOCK(obj);
2443 vn_fullpath(vp, &fullpath, &freepath);
2444 cred = curthread->td_ucred;
2445 vn_lock(vp, LK_SHARED | LK_RETRY);
2446 if (VOP_GETATTR(vp, &va, cred) == 0) {
2447 kve->kve_fileid = va.va_fileid;
2449 kve->kve_fsid = va.va_fsid;
2454 kve->kve_type = KVME_TYPE_NONE;
2455 kve->kve_ref_count = 0;
2456 kve->kve_shadow_count = 0;
2459 strlcpy(kve->kve_path, fullpath, sizeof(kve->kve_path));
2460 if (freepath != NULL)
2461 free(freepath, M_TEMP);
2463 error = SYSCTL_OUT(req, kve, sizeof(*kve));
2464 vm_map_lock_read(map);
2467 if (last_timestamp != map->timestamp) {
2468 vm_map_lookup_entry(map, addr - 1, &tmp_entry);
2472 vm_map_unlock_read(map);
2478 #endif /* COMPAT_FREEBSD7 */
2480 #ifdef KINFO_VMENTRY_SIZE
2481 CTASSERT(sizeof(struct kinfo_vmentry) == KINFO_VMENTRY_SIZE);
2485 kern_proc_vmmap_resident(vm_map_t map, vm_map_entry_t entry,
2486 int *resident_count, bool *super)
2488 vm_object_t obj, tobj;
2492 vm_pindex_t pi, pi_adv, pindex;
2495 *resident_count = 0;
2496 if (vmmap_skip_res_cnt)
2500 obj = entry->object.vm_object;
2501 addr = entry->start;
2503 pi = OFF_TO_IDX(entry->offset);
2504 for (; addr < entry->end; addr += IDX_TO_OFF(pi_adv), pi += pi_adv) {
2505 if (m_adv != NULL) {
2508 pi_adv = atop(entry->end - addr);
2510 for (tobj = obj;; tobj = tobj->backing_object) {
2511 m = vm_page_find_least(tobj, pindex);
2513 if (m->pindex == pindex)
2515 if (pi_adv > m->pindex - pindex) {
2516 pi_adv = m->pindex - pindex;
2520 if (tobj->backing_object == NULL)
2522 pindex += OFF_TO_IDX(tobj->
2523 backing_object_offset);
2527 if (m->psind != 0 && addr + pagesizes[1] <= entry->end &&
2528 (addr & (pagesizes[1] - 1)) == 0 &&
2529 (pmap_mincore(map->pmap, addr, &pa) & MINCORE_SUPER) != 0) {
2531 pi_adv = atop(pagesizes[1]);
2534 * We do not test the found page on validity.
2535 * Either the page is busy and being paged in,
2536 * or it was invalidated. The first case
2537 * should be counted as resident, the second
2538 * is not so clear; we do account both.
2542 *resident_count += pi_adv;
2548 * Must be called with the process locked and will return unlocked.
2551 kern_proc_vmmap_out(struct proc *p, struct sbuf *sb, ssize_t maxlen, int flags)
2553 vm_map_entry_t entry, tmp_entry;
2556 vm_object_t obj, tobj, lobj;
2557 char *fullpath, *freepath;
2558 struct kinfo_vmentry *kve;
2563 unsigned int last_timestamp;
2567 PROC_LOCK_ASSERT(p, MA_OWNED);
2571 vm = vmspace_acquire_ref(p);
2576 kve = malloc(sizeof(*kve), M_TEMP, M_WAITOK | M_ZERO);
2580 vm_map_lock_read(map);
2581 VM_MAP_ENTRY_FOREACH(entry, map) {
2582 if (entry->eflags & MAP_ENTRY_IS_SUB_MAP)
2586 bzero(kve, sizeof(*kve));
2587 obj = entry->object.vm_object;
2589 for (tobj = obj; tobj != NULL;
2590 tobj = tobj->backing_object) {
2591 VM_OBJECT_RLOCK(tobj);
2592 kve->kve_offset += tobj->backing_object_offset;
2595 if (obj->backing_object == NULL)
2596 kve->kve_private_resident =
2597 obj->resident_page_count;
2598 kern_proc_vmmap_resident(map, entry,
2599 &kve->kve_resident, &super);
2601 kve->kve_flags |= KVME_FLAG_SUPER;
2602 for (tobj = obj; tobj != NULL;
2603 tobj = tobj->backing_object) {
2604 if (tobj != obj && tobj != lobj)
2605 VM_OBJECT_RUNLOCK(tobj);
2611 kve->kve_start = entry->start;
2612 kve->kve_end = entry->end;
2613 kve->kve_offset += entry->offset;
2615 if (entry->protection & VM_PROT_READ)
2616 kve->kve_protection |= KVME_PROT_READ;
2617 if (entry->protection & VM_PROT_WRITE)
2618 kve->kve_protection |= KVME_PROT_WRITE;
2619 if (entry->protection & VM_PROT_EXECUTE)
2620 kve->kve_protection |= KVME_PROT_EXEC;
2622 if (entry->eflags & MAP_ENTRY_COW)
2623 kve->kve_flags |= KVME_FLAG_COW;
2624 if (entry->eflags & MAP_ENTRY_NEEDS_COPY)
2625 kve->kve_flags |= KVME_FLAG_NEEDS_COPY;
2626 if (entry->eflags & MAP_ENTRY_NOCOREDUMP)
2627 kve->kve_flags |= KVME_FLAG_NOCOREDUMP;
2628 if (entry->eflags & MAP_ENTRY_GROWS_UP)
2629 kve->kve_flags |= KVME_FLAG_GROWS_UP;
2630 if (entry->eflags & MAP_ENTRY_GROWS_DOWN)
2631 kve->kve_flags |= KVME_FLAG_GROWS_DOWN;
2632 if (entry->eflags & MAP_ENTRY_USER_WIRED)
2633 kve->kve_flags |= KVME_FLAG_USER_WIRED;
2635 last_timestamp = map->timestamp;
2636 vm_map_unlock_read(map);
2641 kve->kve_type = vm_object_kvme_type(lobj, &vp);
2645 VM_OBJECT_RUNLOCK(lobj);
2647 kve->kve_ref_count = obj->ref_count;
2648 kve->kve_shadow_count = obj->shadow_count;
2649 VM_OBJECT_RUNLOCK(obj);
2651 vn_fullpath(vp, &fullpath, &freepath);
2652 kve->kve_vn_type = vntype_to_kinfo(vp->v_type);
2653 cred = curthread->td_ucred;
2654 vn_lock(vp, LK_SHARED | LK_RETRY);
2655 if (VOP_GETATTR(vp, &va, cred) == 0) {
2656 kve->kve_vn_fileid = va.va_fileid;
2657 kve->kve_vn_fsid = va.va_fsid;
2658 kve->kve_vn_fsid_freebsd11 =
2659 kve->kve_vn_fsid; /* truncate */
2661 MAKEIMODE(va.va_type, va.va_mode);
2662 kve->kve_vn_size = va.va_size;
2663 kve->kve_vn_rdev = va.va_rdev;
2664 kve->kve_vn_rdev_freebsd11 =
2665 kve->kve_vn_rdev; /* truncate */
2666 kve->kve_status = KF_ATTR_VALID;
2671 kve->kve_type = KVME_TYPE_NONE;
2672 kve->kve_ref_count = 0;
2673 kve->kve_shadow_count = 0;
2676 strlcpy(kve->kve_path, fullpath, sizeof(kve->kve_path));
2677 if (freepath != NULL)
2678 free(freepath, M_TEMP);
2680 /* Pack record size down */
2681 if ((flags & KERN_VMMAP_PACK_KINFO) != 0)
2682 kve->kve_structsize =
2683 offsetof(struct kinfo_vmentry, kve_path) +
2684 strlen(kve->kve_path) + 1;
2686 kve->kve_structsize = sizeof(*kve);
2687 kve->kve_structsize = roundup(kve->kve_structsize,
2690 /* Halt filling and truncate rather than exceeding maxlen */
2691 if (maxlen != -1 && maxlen < kve->kve_structsize) {
2693 vm_map_lock_read(map);
2695 } else if (maxlen != -1)
2696 maxlen -= kve->kve_structsize;
2698 if (sbuf_bcat(sb, kve, kve->kve_structsize) != 0)
2700 vm_map_lock_read(map);
2703 if (last_timestamp != map->timestamp) {
2704 vm_map_lookup_entry(map, addr - 1, &tmp_entry);
2708 vm_map_unlock_read(map);
2716 sysctl_kern_proc_vmmap(SYSCTL_HANDLER_ARGS)
2720 int error, error2, *name;
2723 sbuf_new_for_sysctl(&sb, NULL, sizeof(struct kinfo_vmentry), req);
2724 sbuf_clear_flags(&sb, SBUF_INCLUDENUL);
2725 error = pget((pid_t)name[0], PGET_CANDEBUG | PGET_NOTWEXIT, &p);
2730 error = kern_proc_vmmap_out(p, &sb, -1, KERN_VMMAP_PACK_KINFO);
2731 error2 = sbuf_finish(&sb);
2733 return (error != 0 ? error : error2);
2736 #if defined(STACK) || defined(DDB)
2738 sysctl_kern_proc_kstack(SYSCTL_HANDLER_ARGS)
2740 struct kinfo_kstack *kkstp;
2741 int error, i, *name, numthreads;
2742 lwpid_t *lwpidarray;
2749 error = pget((pid_t)name[0], PGET_NOTINEXEC | PGET_WANTREAD, &p);
2753 kkstp = malloc(sizeof(*kkstp), M_TEMP, M_WAITOK);
2754 st = stack_create(M_WAITOK);
2759 if (lwpidarray != NULL) {
2760 free(lwpidarray, M_TEMP);
2763 numthreads = p->p_numthreads;
2765 lwpidarray = malloc(sizeof(*lwpidarray) * numthreads, M_TEMP,
2768 } while (numthreads < p->p_numthreads);
2771 * XXXRW: During the below loop, execve(2) and countless other sorts
2772 * of changes could have taken place. Should we check to see if the
2773 * vmspace has been replaced, or the like, in order to prevent
2774 * giving a snapshot that spans, say, execve(2), with some threads
2775 * before and some after? Among other things, the credentials could
2776 * have changed, in which case the right to extract debug info might
2777 * no longer be assured.
2780 FOREACH_THREAD_IN_PROC(p, td) {
2781 KASSERT(i < numthreads,
2782 ("sysctl_kern_proc_kstack: numthreads"));
2783 lwpidarray[i] = td->td_tid;
2787 for (i = 0; i < numthreads; i++) {
2788 td = thread_find(p, lwpidarray[i]);
2792 bzero(kkstp, sizeof(*kkstp));
2793 (void)sbuf_new(&sb, kkstp->kkst_trace,
2794 sizeof(kkstp->kkst_trace), SBUF_FIXEDLEN);
2796 kkstp->kkst_tid = td->td_tid;
2797 if (TD_IS_SWAPPED(td))
2798 kkstp->kkst_state = KKST_STATE_SWAPPED;
2799 else if (stack_save_td(st, td) == 0)
2800 kkstp->kkst_state = KKST_STATE_STACKOK;
2802 kkstp->kkst_state = KKST_STATE_RUNNING;
2805 stack_sbuf_print(&sb, st);
2808 error = SYSCTL_OUT(req, kkstp, sizeof(*kkstp));
2815 if (lwpidarray != NULL)
2816 free(lwpidarray, M_TEMP);
2818 free(kkstp, M_TEMP);
2824 * This sysctl allows a process to retrieve the full list of groups from
2825 * itself or another process.
2828 sysctl_kern_proc_groups(SYSCTL_HANDLER_ARGS)
2830 pid_t *pidp = (pid_t *)arg1;
2831 unsigned int arglen = arg2;
2838 if (*pidp == -1) { /* -1 means this process */
2839 p = req->td->td_proc;
2842 error = pget(*pidp, PGET_CANSEE, &p);
2847 cred = crhold(p->p_ucred);
2850 error = SYSCTL_OUT(req, cred->cr_groups,
2851 cred->cr_ngroups * sizeof(gid_t));
2857 * This sysctl allows a process to retrieve or/and set the resource limit for
2861 sysctl_kern_proc_rlimit(SYSCTL_HANDLER_ARGS)
2863 int *name = (int *)arg1;
2864 u_int namelen = arg2;
2873 which = (u_int)name[1];
2874 if (which >= RLIM_NLIMITS)
2877 if (req->newptr != NULL && req->newlen != sizeof(rlim))
2880 flags = PGET_HOLD | PGET_NOTWEXIT;
2881 if (req->newptr != NULL)
2882 flags |= PGET_CANDEBUG;
2884 flags |= PGET_CANSEE;
2885 error = pget((pid_t)name[0], flags, &p);
2892 if (req->oldptr != NULL) {
2894 lim_rlimit_proc(p, which, &rlim);
2897 error = SYSCTL_OUT(req, &rlim, sizeof(rlim));
2904 if (req->newptr != NULL) {
2905 error = SYSCTL_IN(req, &rlim, sizeof(rlim));
2907 error = kern_proc_setrlimit(curthread, p, which, &rlim);
2916 * This sysctl allows a process to retrieve ps_strings structure location of
2920 sysctl_kern_proc_ps_strings(SYSCTL_HANDLER_ARGS)
2922 int *name = (int *)arg1;
2923 u_int namelen = arg2;
2925 vm_offset_t ps_strings;
2927 #ifdef COMPAT_FREEBSD32
2928 uint32_t ps_strings32;
2934 error = pget((pid_t)name[0], PGET_CANDEBUG, &p);
2937 #ifdef COMPAT_FREEBSD32
2938 if ((req->flags & SCTL_MASK32) != 0) {
2940 * We return 0 if the 32 bit emulation request is for a 64 bit
2943 ps_strings32 = SV_PROC_FLAG(p, SV_ILP32) != 0 ?
2944 PTROUT(p->p_sysent->sv_psstrings) : 0;
2946 error = SYSCTL_OUT(req, &ps_strings32, sizeof(ps_strings32));
2950 ps_strings = p->p_sysent->sv_psstrings;
2952 error = SYSCTL_OUT(req, &ps_strings, sizeof(ps_strings));
2957 * This sysctl allows a process to retrieve umask of another process.
2960 sysctl_kern_proc_umask(SYSCTL_HANDLER_ARGS)
2962 int *name = (int *)arg1;
2963 u_int namelen = arg2;
2972 pid = (pid_t)name[0];
2974 if (pid == p->p_pid || pid == 0) {
2975 fd_cmask = p->p_fd->fd_cmask;
2979 error = pget(pid, PGET_WANTREAD, &p);
2983 fd_cmask = p->p_fd->fd_cmask;
2986 error = SYSCTL_OUT(req, &fd_cmask, sizeof(fd_cmask));
2991 * This sysctl allows a process to set and retrieve binary osreldate of
2995 sysctl_kern_proc_osrel(SYSCTL_HANDLER_ARGS)
2997 int *name = (int *)arg1;
2998 u_int namelen = arg2;
3000 int flags, error, osrel;
3005 if (req->newptr != NULL && req->newlen != sizeof(osrel))
3008 flags = PGET_HOLD | PGET_NOTWEXIT;
3009 if (req->newptr != NULL)
3010 flags |= PGET_CANDEBUG;
3012 flags |= PGET_CANSEE;
3013 error = pget((pid_t)name[0], flags, &p);
3017 error = SYSCTL_OUT(req, &p->p_osrel, sizeof(p->p_osrel));
3021 if (req->newptr != NULL) {
3022 error = SYSCTL_IN(req, &osrel, sizeof(osrel));
3037 sysctl_kern_proc_sigtramp(SYSCTL_HANDLER_ARGS)
3039 int *name = (int *)arg1;
3040 u_int namelen = arg2;
3042 struct kinfo_sigtramp kst;
3043 const struct sysentvec *sv;
3045 #ifdef COMPAT_FREEBSD32
3046 struct kinfo_sigtramp32 kst32;
3052 error = pget((pid_t)name[0], PGET_CANDEBUG, &p);
3056 #ifdef COMPAT_FREEBSD32
3057 if ((req->flags & SCTL_MASK32) != 0) {
3058 bzero(&kst32, sizeof(kst32));
3059 if (SV_PROC_FLAG(p, SV_ILP32)) {
3060 if (sv->sv_sigcode_base != 0) {
3061 kst32.ksigtramp_start = sv->sv_sigcode_base;
3062 kst32.ksigtramp_end = sv->sv_sigcode_base +
3065 kst32.ksigtramp_start = sv->sv_psstrings -
3067 kst32.ksigtramp_end = sv->sv_psstrings;
3071 error = SYSCTL_OUT(req, &kst32, sizeof(kst32));
3075 bzero(&kst, sizeof(kst));
3076 if (sv->sv_sigcode_base != 0) {
3077 kst.ksigtramp_start = (char *)sv->sv_sigcode_base;
3078 kst.ksigtramp_end = (char *)sv->sv_sigcode_base +
3081 kst.ksigtramp_start = (char *)sv->sv_psstrings -
3083 kst.ksigtramp_end = (char *)sv->sv_psstrings;
3086 error = SYSCTL_OUT(req, &kst, sizeof(kst));
3091 sysctl_kern_proc_sigfastblk(SYSCTL_HANDLER_ARGS)
3093 int *name = (int *)arg1;
3094 u_int namelen = arg2;
3099 #ifdef COMPAT_FREEBSD32
3104 if (namelen != 1 || req->newptr != NULL)
3107 pid = (pid_t)name[0];
3108 error = pget(pid, PGET_HOLD | PGET_NOTWEXIT | PGET_CANDEBUG, &p);
3113 #ifdef COMPAT_FREEBSD32
3114 if (SV_CURPROC_FLAG(SV_ILP32)) {
3115 if (!SV_PROC_FLAG(p, SV_ILP32)) {
3121 if (pid <= PID_MAX) {
3122 td1 = FIRST_THREAD_IN_PROC(p);
3124 FOREACH_THREAD_IN_PROC(p, td1) {
3125 if (td1->td_tid == pid)
3134 * The access to the private thread flags. It is fine as far
3135 * as no out-of-thin-air values are read from td_pflags, and
3136 * usermode read of the td_sigblock_ptr is racy inherently,
3137 * since target process might have already changed it
3140 if ((td1->td_pflags & TDP_SIGFASTBLOCK) != 0)
3141 addr = (uintptr_t)td1->td_sigblock_ptr;
3151 #ifdef COMPAT_FREEBSD32
3152 if (SV_CURPROC_FLAG(SV_ILP32)) {
3154 error = SYSCTL_OUT(req, &addr32, sizeof(addr32));
3157 error = SYSCTL_OUT(req, &addr, sizeof(addr));
3161 SYSCTL_NODE(_kern, KERN_PROC, proc, CTLFLAG_RD | CTLFLAG_MPSAFE, 0,
3164 SYSCTL_PROC(_kern_proc, KERN_PROC_ALL, all, CTLFLAG_RD|CTLTYPE_STRUCT|
3165 CTLFLAG_MPSAFE, 0, 0, sysctl_kern_proc, "S,proc",
3166 "Return entire process table");
3168 static SYSCTL_NODE(_kern_proc, KERN_PROC_GID, gid, CTLFLAG_RD | CTLFLAG_MPSAFE,
3169 sysctl_kern_proc, "Process table");
3171 static SYSCTL_NODE(_kern_proc, KERN_PROC_PGRP, pgrp, CTLFLAG_RD | CTLFLAG_MPSAFE,
3172 sysctl_kern_proc, "Process table");
3174 static SYSCTL_NODE(_kern_proc, KERN_PROC_RGID, rgid, CTLFLAG_RD | CTLFLAG_MPSAFE,
3175 sysctl_kern_proc, "Process table");
3177 static SYSCTL_NODE(_kern_proc, KERN_PROC_SESSION, sid, CTLFLAG_RD |
3178 CTLFLAG_MPSAFE, sysctl_kern_proc, "Process table");
3180 static SYSCTL_NODE(_kern_proc, KERN_PROC_TTY, tty, CTLFLAG_RD | CTLFLAG_MPSAFE,
3181 sysctl_kern_proc, "Process table");
3183 static SYSCTL_NODE(_kern_proc, KERN_PROC_UID, uid, CTLFLAG_RD | CTLFLAG_MPSAFE,
3184 sysctl_kern_proc, "Process table");
3186 static SYSCTL_NODE(_kern_proc, KERN_PROC_RUID, ruid, CTLFLAG_RD | CTLFLAG_MPSAFE,
3187 sysctl_kern_proc, "Process table");
3189 static SYSCTL_NODE(_kern_proc, KERN_PROC_PID, pid, CTLFLAG_RD | CTLFLAG_MPSAFE,
3190 sysctl_kern_proc, "Process table");
3192 static SYSCTL_NODE(_kern_proc, KERN_PROC_PROC, proc, CTLFLAG_RD | CTLFLAG_MPSAFE,
3193 sysctl_kern_proc, "Return process table, no threads");
3195 static SYSCTL_NODE(_kern_proc, KERN_PROC_ARGS, args,
3196 CTLFLAG_RW | CTLFLAG_CAPWR | CTLFLAG_ANYBODY | CTLFLAG_MPSAFE,
3197 sysctl_kern_proc_args, "Process argument list");
3199 static SYSCTL_NODE(_kern_proc, KERN_PROC_ENV, env, CTLFLAG_RD | CTLFLAG_MPSAFE,
3200 sysctl_kern_proc_env, "Process environment");
3202 static SYSCTL_NODE(_kern_proc, KERN_PROC_AUXV, auxv, CTLFLAG_RD |
3203 CTLFLAG_MPSAFE, sysctl_kern_proc_auxv, "Process ELF auxiliary vector");
3205 static SYSCTL_NODE(_kern_proc, KERN_PROC_PATHNAME, pathname, CTLFLAG_RD |
3206 CTLFLAG_MPSAFE, sysctl_kern_proc_pathname, "Process executable path");
3208 static SYSCTL_NODE(_kern_proc, KERN_PROC_SV_NAME, sv_name, CTLFLAG_RD |
3209 CTLFLAG_MPSAFE, sysctl_kern_proc_sv_name,
3210 "Process syscall vector name (ABI type)");
3212 static SYSCTL_NODE(_kern_proc, (KERN_PROC_GID | KERN_PROC_INC_THREAD), gid_td,
3213 CTLFLAG_RD | CTLFLAG_MPSAFE, sysctl_kern_proc, "Process table");
3215 static SYSCTL_NODE(_kern_proc, (KERN_PROC_PGRP | KERN_PROC_INC_THREAD), pgrp_td,
3216 CTLFLAG_RD | CTLFLAG_MPSAFE, sysctl_kern_proc, "Process table");
3218 static SYSCTL_NODE(_kern_proc, (KERN_PROC_RGID | KERN_PROC_INC_THREAD), rgid_td,
3219 CTLFLAG_RD | CTLFLAG_MPSAFE, sysctl_kern_proc, "Process table");
3221 static SYSCTL_NODE(_kern_proc, (KERN_PROC_SESSION | KERN_PROC_INC_THREAD),
3222 sid_td, CTLFLAG_RD | CTLFLAG_MPSAFE, sysctl_kern_proc, "Process table");
3224 static SYSCTL_NODE(_kern_proc, (KERN_PROC_TTY | KERN_PROC_INC_THREAD), tty_td,
3225 CTLFLAG_RD | CTLFLAG_MPSAFE, sysctl_kern_proc, "Process table");
3227 static SYSCTL_NODE(_kern_proc, (KERN_PROC_UID | KERN_PROC_INC_THREAD), uid_td,
3228 CTLFLAG_RD | CTLFLAG_MPSAFE, sysctl_kern_proc, "Process table");
3230 static SYSCTL_NODE(_kern_proc, (KERN_PROC_RUID | KERN_PROC_INC_THREAD), ruid_td,
3231 CTLFLAG_RD | CTLFLAG_MPSAFE, sysctl_kern_proc, "Process table");
3233 static SYSCTL_NODE(_kern_proc, (KERN_PROC_PID | KERN_PROC_INC_THREAD), pid_td,
3234 CTLFLAG_RD | CTLFLAG_MPSAFE, sysctl_kern_proc, "Process table");
3236 static SYSCTL_NODE(_kern_proc, (KERN_PROC_PROC | KERN_PROC_INC_THREAD), proc_td,
3237 CTLFLAG_RD | CTLFLAG_MPSAFE, sysctl_kern_proc,
3238 "Return process table, no threads");
3240 #ifdef COMPAT_FREEBSD7
3241 static SYSCTL_NODE(_kern_proc, KERN_PROC_OVMMAP, ovmmap, CTLFLAG_RD |
3242 CTLFLAG_MPSAFE, sysctl_kern_proc_ovmmap, "Old Process vm map entries");
3245 static SYSCTL_NODE(_kern_proc, KERN_PROC_VMMAP, vmmap, CTLFLAG_RD |
3246 CTLFLAG_MPSAFE, sysctl_kern_proc_vmmap, "Process vm map entries");
3248 #if defined(STACK) || defined(DDB)
3249 static SYSCTL_NODE(_kern_proc, KERN_PROC_KSTACK, kstack, CTLFLAG_RD |
3250 CTLFLAG_MPSAFE, sysctl_kern_proc_kstack, "Process kernel stacks");
3253 static SYSCTL_NODE(_kern_proc, KERN_PROC_GROUPS, groups, CTLFLAG_RD |
3254 CTLFLAG_MPSAFE, sysctl_kern_proc_groups, "Process groups");
3256 static SYSCTL_NODE(_kern_proc, KERN_PROC_RLIMIT, rlimit, CTLFLAG_RW |
3257 CTLFLAG_ANYBODY | CTLFLAG_MPSAFE, sysctl_kern_proc_rlimit,
3258 "Process resource limits");
3260 static SYSCTL_NODE(_kern_proc, KERN_PROC_PS_STRINGS, ps_strings, CTLFLAG_RD |
3261 CTLFLAG_MPSAFE, sysctl_kern_proc_ps_strings,
3262 "Process ps_strings location");
3264 static SYSCTL_NODE(_kern_proc, KERN_PROC_UMASK, umask, CTLFLAG_RD |
3265 CTLFLAG_MPSAFE, sysctl_kern_proc_umask, "Process umask");
3267 static SYSCTL_NODE(_kern_proc, KERN_PROC_OSREL, osrel, CTLFLAG_RW |
3268 CTLFLAG_ANYBODY | CTLFLAG_MPSAFE, sysctl_kern_proc_osrel,
3269 "Process binary osreldate");
3271 static SYSCTL_NODE(_kern_proc, KERN_PROC_SIGTRAMP, sigtramp, CTLFLAG_RD |
3272 CTLFLAG_MPSAFE, sysctl_kern_proc_sigtramp,
3273 "Process signal trampoline location");
3275 static SYSCTL_NODE(_kern_proc, KERN_PROC_SIGFASTBLK, sigfastblk, CTLFLAG_RD |
3276 CTLFLAG_ANYBODY | CTLFLAG_MPSAFE, sysctl_kern_proc_sigfastblk,
3277 "Thread sigfastblock address");
3282 * stop_all_proc() purpose is to stop all process which have usermode,
3283 * except current process for obvious reasons. This makes it somewhat
3284 * unreliable when invoked from multithreaded process. The service
3285 * must not be user-callable anyway.
3290 struct proc *cp, *p;
3292 bool restart, seen_stopped, seen_exiting, stopped_some;
3296 sx_xlock(&allproc_lock);
3298 seen_exiting = seen_stopped = stopped_some = restart = false;
3299 LIST_REMOVE(cp, p_list);
3300 LIST_INSERT_HEAD(&allproc, cp, p_list);
3302 p = LIST_NEXT(cp, p_list);
3305 LIST_REMOVE(cp, p_list);
3306 LIST_INSERT_AFTER(p, cp, p_list);
3308 if ((p->p_flag & (P_KPROC | P_SYSTEM | P_TOTAL_STOP)) != 0) {
3312 if ((p->p_flag & P_WEXIT) != 0) {
3313 seen_exiting = true;
3317 if (P_SHOULDSTOP(p) == P_STOPPED_SINGLE) {
3319 * Stopped processes are tolerated when there
3320 * are no other processes which might continue
3321 * them. P_STOPPED_SINGLE but not
3322 * P_TOTAL_STOP process still has at least one
3325 seen_stopped = true;
3329 sx_xunlock(&allproc_lock);
3331 r = thread_single(p, SINGLE_ALLPROC);
3335 stopped_some = true;
3338 sx_xlock(&allproc_lock);
3340 /* Catch forked children we did not see in iteration. */
3341 if (gen != allproc_gen)
3343 sx_xunlock(&allproc_lock);
3344 if (restart || stopped_some || seen_exiting || seen_stopped) {
3345 kern_yield(PRI_USER);
3351 resume_all_proc(void)
3353 struct proc *cp, *p;
3356 sx_xlock(&allproc_lock);
3358 LIST_REMOVE(cp, p_list);
3359 LIST_INSERT_HEAD(&allproc, cp, p_list);
3361 p = LIST_NEXT(cp, p_list);
3364 LIST_REMOVE(cp, p_list);
3365 LIST_INSERT_AFTER(p, cp, p_list);
3367 if ((p->p_flag & P_TOTAL_STOP) != 0) {
3368 sx_xunlock(&allproc_lock);
3370 thread_single_end(p, SINGLE_ALLPROC);
3373 sx_xlock(&allproc_lock);
3378 /* Did the loop above missed any stopped process ? */
3379 FOREACH_PROC_IN_SYSTEM(p) {
3380 /* No need for proc lock. */
3381 if ((p->p_flag & P_TOTAL_STOP) != 0)
3384 sx_xunlock(&allproc_lock);
3387 /* #define TOTAL_STOP_DEBUG 1 */
3388 #ifdef TOTAL_STOP_DEBUG
3389 volatile static int ap_resume;
3390 #include <sys/mount.h>
3393 sysctl_debug_stop_all_proc(SYSCTL_HANDLER_ARGS)
3399 error = sysctl_handle_int(oidp, &val, 0, req);
3400 if (error != 0 || req->newptr == NULL)
3405 while (ap_resume == 0)
3413 SYSCTL_PROC(_debug, OID_AUTO, stop_all_proc, CTLTYPE_INT | CTLFLAG_RW |
3414 CTLFLAG_MPSAFE, __DEVOLATILE(int *, &ap_resume), 0,
3415 sysctl_debug_stop_all_proc, "I",