2 * Copyright (c) 2014 John Baldwin
3 * Copyright (c) 2014, 2016 The FreeBSD Foundation
5 * Portions of this software were developed by Konstantin Belousov
6 * under sponsorship from the FreeBSD Foundation.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
30 #include <sys/cdefs.h>
31 __FBSDID("$FreeBSD$");
33 #include <sys/param.h>
34 #include <sys/_unrhdr.h>
35 #include <sys/systm.h>
36 #include <sys/capsicum.h>
39 #include <sys/mutex.h>
42 #include <sys/procctl.h>
44 #include <sys/syscallsubr.h>
45 #include <sys/sysproto.h>
46 #include <sys/taskqueue.h>
51 #include <vm/vm_map.h>
52 #include <vm/vm_extern.h>
55 protect_setchild(struct thread *td, struct proc *p, int flags)
58 PROC_LOCK_ASSERT(p, MA_OWNED);
59 if (p->p_flag & P_SYSTEM || p_cansched(td, p) != 0)
61 if (flags & PPROT_SET) {
62 p->p_flag |= P_PROTECTED;
63 if (flags & PPROT_INHERIT)
64 p->p_flag2 |= P2_INHERIT_PROTECTED;
66 p->p_flag &= ~P_PROTECTED;
67 p->p_flag2 &= ~P2_INHERIT_PROTECTED;
73 protect_setchildren(struct thread *td, struct proc *top, int flags)
80 sx_assert(&proctree_lock, SX_LOCKED);
82 ret |= protect_setchild(td, p, flags);
85 * If this process has children, descend to them next,
86 * otherwise do any siblings, and if done with this level,
87 * follow back up the tree (but not past top).
89 if (!LIST_EMPTY(&p->p_children))
90 p = LIST_FIRST(&p->p_children);
96 if (LIST_NEXT(p, p_sibling)) {
97 p = LIST_NEXT(p, p_sibling);
107 protect_set(struct thread *td, struct proc *p, void *data)
109 int error, flags, ret;
111 flags = *(int *)data;
112 switch (PPROT_OP(flags)) {
120 if ((PPROT_FLAGS(flags) & ~(PPROT_DESCEND | PPROT_INHERIT)) != 0)
123 error = priv_check(td, PRIV_VM_MADV_PROTECT);
127 if (flags & PPROT_DESCEND)
128 ret = protect_setchildren(td, p, flags);
130 ret = protect_setchild(td, p, flags);
137 reap_acquire(struct thread *td, struct proc *p, void *data __unused)
140 sx_assert(&proctree_lock, SX_XLOCKED);
141 if (p != td->td_proc)
143 if ((p->p_treeflag & P_TREE_REAPER) != 0)
145 p->p_treeflag |= P_TREE_REAPER;
147 * We do not reattach existing children and the whole tree
148 * under them to us, since p->p_reaper already seen them.
154 reap_release(struct thread *td, struct proc *p, void *data __unused)
157 sx_assert(&proctree_lock, SX_XLOCKED);
158 if (p != td->td_proc)
162 if ((p->p_treeflag & P_TREE_REAPER) == 0)
164 reaper_abandon_children(p, false);
169 reap_status(struct thread *td, struct proc *p, void *data)
171 struct proc *reap, *p2, *first_p;
172 struct procctl_reaper_status *rs;
175 sx_assert(&proctree_lock, SX_LOCKED);
176 if ((p->p_treeflag & P_TREE_REAPER) == 0) {
180 rs->rs_flags |= REAPER_STATUS_OWNED;
182 if (reap == initproc)
183 rs->rs_flags |= REAPER_STATUS_REALINIT;
184 rs->rs_reaper = reap->p_pid;
185 rs->rs_descendants = 0;
187 if (!LIST_EMPTY(&reap->p_reaplist)) {
188 first_p = LIST_FIRST(&reap->p_children);
190 first_p = LIST_FIRST(&reap->p_reaplist);
191 rs->rs_pid = first_p->p_pid;
192 LIST_FOREACH(p2, &reap->p_reaplist, p_reapsibling) {
193 if (proc_realparent(p2) == reap)
195 rs->rs_descendants++;
204 reap_getpids(struct thread *td, struct proc *p, void *data)
206 struct proc *reap, *p2;
207 struct procctl_reaper_pidinfo *pi, *pip;
208 struct procctl_reaper_pids *rp;
213 sx_assert(&proctree_lock, SX_LOCKED);
215 reap = (p->p_treeflag & P_TREE_REAPER) == 0 ? p->p_reaper : p;
218 LIST_FOREACH(p2, &reap->p_reaplist, p_reapsibling)
220 sx_unlock(&proctree_lock);
221 if (rp->rp_count < n)
223 pi = malloc(n * sizeof(*pi), M_TEMP, M_WAITOK);
224 sx_slock(&proctree_lock);
225 LIST_FOREACH(p2, &reap->p_reaplist, p_reapsibling) {
229 bzero(pip, sizeof(*pip));
230 pip->pi_pid = p2->p_pid;
231 pip->pi_subtree = p2->p_reapsubtree;
232 pip->pi_flags = REAPER_PIDINFO_VALID;
233 if (proc_realparent(p2) == reap)
234 pip->pi_flags |= REAPER_PIDINFO_CHILD;
235 if ((p2->p_treeflag & P_TREE_REAPER) != 0)
236 pip->pi_flags |= REAPER_PIDINFO_REAPER;
239 sx_sunlock(&proctree_lock);
240 error = copyout(pi, rp->rp_pids, i * sizeof(*pi));
242 sx_slock(&proctree_lock);
247 struct reap_kill_proc_work {
251 struct procctl_reaper_kill *rk;
257 reap_kill_proc_locked(struct reap_kill_proc_work *w)
262 PROC_LOCK_ASSERT(w->target, MA_OWNED);
263 PROC_ASSERT_HELD(w->target);
265 error1 = cr_cansignal(w->cr, w->target, w->rk->rk_sig);
267 if (*w->error == ESRCH) {
268 w->rk->rk_fpid = w->target->p_pid;
275 * The need_stop indicates if the target process needs to be
276 * suspended before being signalled. This is needed when we
277 * guarantee that all processes in subtree are signalled,
278 * avoiding the race with some process not yet fully linked
279 * into all structures during fork, ignored by iterator, and
280 * then escaping signalling.
282 * The thread cannot usefully stop itself anyway, and if other
283 * thread of the current process forks while the current
284 * thread signals the whole subtree, it is an application
287 if ((w->target->p_flag & (P_KPROC | P_SYSTEM | P_STOPPED)) == 0)
288 need_stop = thread_single(w->target, SINGLE_ALLPROC) == 0;
292 (void)pksignal(w->target, w->rk->rk_sig, w->ksi);
297 thread_single_end(w->target, SINGLE_ALLPROC);
301 reap_kill_proc_work(void *arg, int pending __unused)
303 struct reap_kill_proc_work *w;
306 PROC_LOCK(w->target);
307 if ((w->target->p_flag2 & P2_WEXIT) == 0)
308 reap_kill_proc_locked(w);
309 PROC_UNLOCK(w->target);
311 sx_xlock(&proctree_lock);
314 sx_xunlock(&proctree_lock);
317 struct reap_kill_tracker {
319 TAILQ_ENTRY(reap_kill_tracker) link;
322 TAILQ_HEAD(reap_kill_tracker_head, reap_kill_tracker);
325 reap_kill_sched(struct reap_kill_tracker_head *tracker, struct proc *p2)
327 struct reap_kill_tracker *t;
330 if ((p2->p_flag2 & P2_WEXIT) != 0) {
336 t = malloc(sizeof(struct reap_kill_tracker), M_TEMP, M_WAITOK);
338 TAILQ_INSERT_TAIL(tracker, t, link);
342 reap_kill_sched_free(struct reap_kill_tracker *t)
349 reap_kill_children(struct thread *td, struct proc *reaper,
350 struct procctl_reaper_kill *rk, ksiginfo_t *ksi, int *error)
355 LIST_FOREACH(p2, &reaper->p_children, p_sibling) {
357 if ((p2->p_flag2 & P2_WEXIT) == 0) {
358 error1 = p_cansignal(td, p2, rk->rk_sig);
360 if (*error == ESRCH) {
361 rk->rk_fpid = p2->p_pid;
366 * Do not end the loop on error,
367 * signal everything we can.
370 (void)pksignal(p2, rk->rk_sig, ksi);
379 reap_kill_subtree_once(struct thread *td, struct proc *p, struct proc *reaper,
380 struct unrhdr *pids, struct reap_kill_proc_work *w)
382 struct reap_kill_tracker_head tracker;
383 struct reap_kill_tracker *t;
389 TAILQ_INIT(&tracker);
390 reap_kill_sched(&tracker, reaper);
391 while ((t = TAILQ_FIRST(&tracker)) != NULL) {
392 TAILQ_REMOVE(&tracker, t, link);
395 * Since reap_kill_proc() drops proctree_lock sx, it
396 * is possible that the tracked reaper is no longer.
397 * In this case the subtree is reparented to the new
398 * reaper, which should handle it.
400 if ((t->parent->p_treeflag & P_TREE_REAPER) == 0) {
401 reap_kill_sched_free(t);
406 LIST_FOREACH(p2, &t->parent->p_reaplist, p_reapsibling) {
407 if (t->parent == reaper &&
408 (w->rk->rk_flags & REAPER_KILL_SUBTREE) != 0 &&
409 p2->p_reapsubtree != w->rk->rk_subtree)
411 if ((p2->p_treeflag & P_TREE_REAPER) != 0)
412 reap_kill_sched(&tracker, p2);
413 if (alloc_unr_specific(pids, p2->p_pid) != p2->p_pid)
415 if (p2 == td->td_proc) {
416 if ((p2->p_flag & P_HADTHREADS) != 0 &&
417 (p2->p_flag2 & P2_WEXIT) == 0) {
418 xlocked = sx_xlocked(&proctree_lock);
419 sx_unlock(&proctree_lock);
426 r = thread_single(p2, SINGLE_NO_EXIT);
427 (void)pksignal(p2, w->rk->rk_sig, w->ksi);
430 thread_single_end(p2, SINGLE_NO_EXIT);
434 sx_xlock(&proctree_lock);
436 sx_slock(&proctree_lock);
440 if ((p2->p_flag2 & P2_WEXIT) == 0) {
444 taskqueue_enqueue(taskqueue_thread,
446 while (w->target != NULL) {
448 &proctree_lock, PWAIT,
458 reap_kill_sched_free(t);
464 reap_kill_subtree(struct thread *td, struct proc *p, struct proc *reaper,
465 struct reap_kill_proc_work *w)
470 * pids records processes which were already signalled, to
471 * avoid doubling signals to them if iteration needs to be
474 init_unrhdr(&pids, 1, PID_MAX, UNR_NO_MTX);
475 PROC_LOCK(td->td_proc);
476 if ((td->td_proc->p_flag2 & P2_WEXIT) != 0) {
477 PROC_UNLOCK(td->td_proc);
480 PROC_UNLOCK(td->td_proc);
481 while (reap_kill_subtree_once(td, p, reaper, &pids, w))
489 reap_kill_sapblk(struct thread *td __unused, void *data)
491 struct procctl_reaper_kill *rk;
494 return ((rk->rk_flags & REAPER_KILL_CHILDREN) == 0);
498 reap_kill(struct thread *td, struct proc *p, void *data)
500 struct reap_kill_proc_work w;
503 struct procctl_reaper_kill *rk;
507 sx_assert(&proctree_lock, SX_LOCKED);
508 if (IN_CAPABILITY_MODE(td))
510 if (rk->rk_sig <= 0 || rk->rk_sig > _SIG_MAXSIG ||
511 (rk->rk_flags & ~(REAPER_KILL_CHILDREN |
512 REAPER_KILL_SUBTREE)) != 0 || (rk->rk_flags &
513 (REAPER_KILL_CHILDREN | REAPER_KILL_SUBTREE)) ==
514 (REAPER_KILL_CHILDREN | REAPER_KILL_SUBTREE))
517 reaper = (p->p_treeflag & P_TREE_REAPER) == 0 ? p->p_reaper : p;
519 ksi.ksi_signo = rk->rk_sig;
520 ksi.ksi_code = SI_USER;
521 ksi.ksi_pid = td->td_proc->p_pid;
522 ksi.ksi_uid = td->td_ucred->cr_ruid;
526 if ((rk->rk_flags & REAPER_KILL_CHILDREN) != 0) {
527 reap_kill_children(td, reaper, rk, &ksi, &error);
529 w.cr = crhold(td->td_ucred);
533 TASK_INIT(&w.t, 0, reap_kill_proc_work, &w);
536 * Prevent swapout, since w, ksi, and possibly rk, are
537 * allocated on the stack. We sleep in
538 * reap_kill_subtree_once() waiting for task to
539 * complete single-threading.
543 reap_kill_subtree(td, p, reaper, &w);
552 trace_ctl(struct thread *td, struct proc *p, void *data)
556 PROC_LOCK_ASSERT(p, MA_OWNED);
557 state = *(int *)data;
560 * Ktrace changes p_traceflag from or to zero under the
561 * process lock, so the test does not need to acquire ktrace
564 if ((p->p_flag & P_TRACED) != 0 || p->p_traceflag != 0)
568 case PROC_TRACE_CTL_ENABLE:
569 if (td->td_proc != p)
571 p->p_flag2 &= ~(P2_NOTRACE | P2_NOTRACE_EXEC);
573 case PROC_TRACE_CTL_DISABLE_EXEC:
574 p->p_flag2 |= P2_NOTRACE_EXEC | P2_NOTRACE;
576 case PROC_TRACE_CTL_DISABLE:
577 if ((p->p_flag2 & P2_NOTRACE_EXEC) != 0) {
578 KASSERT((p->p_flag2 & P2_NOTRACE) != 0,
579 ("dandling P2_NOTRACE_EXEC"));
580 if (td->td_proc != p)
582 p->p_flag2 &= ~P2_NOTRACE_EXEC;
584 p->p_flag2 |= P2_NOTRACE;
594 trace_status(struct thread *td, struct proc *p, void *data)
599 if ((p->p_flag2 & P2_NOTRACE) != 0) {
600 KASSERT((p->p_flag & P_TRACED) == 0,
601 ("%d traced but tracing disabled", p->p_pid));
603 } else if ((p->p_flag & P_TRACED) != 0) {
604 *status = p->p_pptr->p_pid;
612 trapcap_ctl(struct thread *td, struct proc *p, void *data)
616 PROC_LOCK_ASSERT(p, MA_OWNED);
617 state = *(int *)data;
620 case PROC_TRAPCAP_CTL_ENABLE:
621 p->p_flag2 |= P2_TRAPCAP;
623 case PROC_TRAPCAP_CTL_DISABLE:
624 p->p_flag2 &= ~P2_TRAPCAP;
633 trapcap_status(struct thread *td, struct proc *p, void *data)
638 *status = (p->p_flag2 & P2_TRAPCAP) != 0 ? PROC_TRAPCAP_CTL_ENABLE :
639 PROC_TRAPCAP_CTL_DISABLE;
644 no_new_privs_ctl(struct thread *td, struct proc *p, void *data)
648 PROC_LOCK_ASSERT(p, MA_OWNED);
649 state = *(int *)data;
651 if (state != PROC_NO_NEW_PRIVS_ENABLE)
653 p->p_flag2 |= P2_NO_NEW_PRIVS;
658 no_new_privs_status(struct thread *td, struct proc *p, void *data)
661 *(int *)data = (p->p_flag2 & P2_NO_NEW_PRIVS) != 0 ?
662 PROC_NO_NEW_PRIVS_ENABLE : PROC_NO_NEW_PRIVS_DISABLE;
667 protmax_ctl(struct thread *td, struct proc *p, void *data)
671 PROC_LOCK_ASSERT(p, MA_OWNED);
672 state = *(int *)data;
675 case PROC_PROTMAX_FORCE_ENABLE:
676 p->p_flag2 &= ~P2_PROTMAX_DISABLE;
677 p->p_flag2 |= P2_PROTMAX_ENABLE;
679 case PROC_PROTMAX_FORCE_DISABLE:
680 p->p_flag2 |= P2_PROTMAX_DISABLE;
681 p->p_flag2 &= ~P2_PROTMAX_ENABLE;
683 case PROC_PROTMAX_NOFORCE:
684 p->p_flag2 &= ~(P2_PROTMAX_ENABLE | P2_PROTMAX_DISABLE);
693 protmax_status(struct thread *td, struct proc *p, void *data)
697 switch (p->p_flag2 & (P2_PROTMAX_ENABLE | P2_PROTMAX_DISABLE)) {
699 d = PROC_PROTMAX_NOFORCE;
701 case P2_PROTMAX_ENABLE:
702 d = PROC_PROTMAX_FORCE_ENABLE;
704 case P2_PROTMAX_DISABLE:
705 d = PROC_PROTMAX_FORCE_DISABLE;
708 if (kern_mmap_maxprot(p, PROT_READ) == PROT_READ)
709 d |= PROC_PROTMAX_ACTIVE;
715 aslr_ctl(struct thread *td, struct proc *p, void *data)
719 PROC_LOCK_ASSERT(p, MA_OWNED);
720 state = *(int *)data;
723 case PROC_ASLR_FORCE_ENABLE:
724 p->p_flag2 &= ~P2_ASLR_DISABLE;
725 p->p_flag2 |= P2_ASLR_ENABLE;
727 case PROC_ASLR_FORCE_DISABLE:
728 p->p_flag2 |= P2_ASLR_DISABLE;
729 p->p_flag2 &= ~P2_ASLR_ENABLE;
731 case PROC_ASLR_NOFORCE:
732 p->p_flag2 &= ~(P2_ASLR_ENABLE | P2_ASLR_DISABLE);
741 aslr_status(struct thread *td, struct proc *p, void *data)
746 switch (p->p_flag2 & (P2_ASLR_ENABLE | P2_ASLR_DISABLE)) {
748 d = PROC_ASLR_NOFORCE;
751 d = PROC_ASLR_FORCE_ENABLE;
753 case P2_ASLR_DISABLE:
754 d = PROC_ASLR_FORCE_DISABLE;
757 if ((p->p_flag & P_WEXIT) == 0) {
760 vm = vmspace_acquire_ref(p);
762 if ((vm->vm_map.flags & MAP_ASLR) != 0)
763 d |= PROC_ASLR_ACTIVE;
774 stackgap_ctl(struct thread *td, struct proc *p, void *data)
778 PROC_LOCK_ASSERT(p, MA_OWNED);
779 state = *(int *)data;
781 if ((state & ~(PROC_STACKGAP_ENABLE | PROC_STACKGAP_DISABLE |
782 PROC_STACKGAP_ENABLE_EXEC | PROC_STACKGAP_DISABLE_EXEC)) != 0)
784 switch (state & (PROC_STACKGAP_ENABLE | PROC_STACKGAP_DISABLE)) {
785 case PROC_STACKGAP_ENABLE:
786 if ((p->p_flag2 & P2_STKGAP_DISABLE) != 0)
789 case PROC_STACKGAP_DISABLE:
790 p->p_flag2 |= P2_STKGAP_DISABLE;
797 switch (state & (PROC_STACKGAP_ENABLE_EXEC |
798 PROC_STACKGAP_DISABLE_EXEC)) {
799 case PROC_STACKGAP_ENABLE_EXEC:
800 p->p_flag2 &= ~P2_STKGAP_DISABLE_EXEC;
802 case PROC_STACKGAP_DISABLE_EXEC:
803 p->p_flag2 |= P2_STKGAP_DISABLE_EXEC;
814 stackgap_status(struct thread *td, struct proc *p, void *data)
818 PROC_LOCK_ASSERT(p, MA_OWNED);
820 d = (p->p_flag2 & P2_STKGAP_DISABLE) != 0 ? PROC_STACKGAP_DISABLE :
821 PROC_STACKGAP_ENABLE;
822 d |= (p->p_flag2 & P2_STKGAP_DISABLE_EXEC) != 0 ?
823 PROC_STACKGAP_DISABLE_EXEC : PROC_STACKGAP_ENABLE_EXEC;
829 wxmap_ctl(struct thread *td, struct proc *p, void *data)
835 PROC_LOCK_ASSERT(p, MA_OWNED);
836 if ((p->p_flag & P_WEXIT) != 0)
838 state = *(int *)data;
841 case PROC_WX_MAPPINGS_PERMIT:
842 p->p_flag2 |= P2_WXORX_DISABLE;
845 vm = vmspace_acquire_ref(p);
849 map->flags &= ~MAP_WXORX;
856 case PROC_WX_MAPPINGS_DISALLOW_EXEC:
857 p->p_flag2 |= P2_WXORX_ENABLE_EXEC;
867 wxmap_status(struct thread *td, struct proc *p, void *data)
872 PROC_LOCK_ASSERT(p, MA_OWNED);
873 if ((p->p_flag & P_WEXIT) != 0)
877 if ((p->p_flag2 & P2_WXORX_DISABLE) != 0)
878 d |= PROC_WX_MAPPINGS_PERMIT;
879 if ((p->p_flag2 & P2_WXORX_ENABLE_EXEC) != 0)
880 d |= PROC_WX_MAPPINGS_DISALLOW_EXEC;
883 vm = vmspace_acquire_ref(p);
885 if ((vm->vm_map.flags & MAP_WXORX) != 0)
886 d |= PROC_WXORX_ENFORCE;
896 pdeathsig_ctl(struct thread *td, struct proc *p, void *data)
900 signum = *(int *)data;
901 if (p != td->td_proc || (signum != 0 && !_SIG_VALID(signum)))
903 p->p_pdeathsig = signum;
908 pdeathsig_status(struct thread *td, struct proc *p, void *data)
910 if (p != td->td_proc)
912 *(int *)data = p->p_pdeathsig;
922 struct procctl_cmd_info {
925 bool esrch_is_einval : 1;
926 bool copyout_on_error : 1;
927 bool no_nonnull_data : 1;
928 bool need_candebug : 1;
931 int (*exec)(struct thread *, struct proc *, void *);
932 bool (*sapblk)(struct thread *, void *);
934 static const struct procctl_cmd_info procctl_cmds_info[] = {
936 { .lock_tree = PCTL_SLOCKED, .one_proc = false,
937 .esrch_is_einval = false, .no_nonnull_data = false,
938 .need_candebug = false,
939 .copyin_sz = sizeof(int), .copyout_sz = 0,
940 .exec = protect_set, .copyout_on_error = false, },
941 [PROC_REAP_ACQUIRE] =
942 { .lock_tree = PCTL_XLOCKED, .one_proc = true,
943 .esrch_is_einval = false, .no_nonnull_data = true,
944 .need_candebug = false,
945 .copyin_sz = 0, .copyout_sz = 0,
946 .exec = reap_acquire, .copyout_on_error = false, },
947 [PROC_REAP_RELEASE] =
948 { .lock_tree = PCTL_XLOCKED, .one_proc = true,
949 .esrch_is_einval = false, .no_nonnull_data = true,
950 .need_candebug = false,
951 .copyin_sz = 0, .copyout_sz = 0,
952 .exec = reap_release, .copyout_on_error = false, },
954 { .lock_tree = PCTL_SLOCKED, .one_proc = true,
955 .esrch_is_einval = false, .no_nonnull_data = false,
956 .need_candebug = false,
958 .copyout_sz = sizeof(struct procctl_reaper_status),
959 .exec = reap_status, .copyout_on_error = false, },
960 [PROC_REAP_GETPIDS] =
961 { .lock_tree = PCTL_SLOCKED, .one_proc = true,
962 .esrch_is_einval = false, .no_nonnull_data = false,
963 .need_candebug = false,
964 .copyin_sz = sizeof(struct procctl_reaper_pids),
966 .exec = reap_getpids, .copyout_on_error = false, },
968 { .lock_tree = PCTL_SLOCKED, .one_proc = true,
969 .esrch_is_einval = false, .no_nonnull_data = false,
970 .need_candebug = false,
971 .copyin_sz = sizeof(struct procctl_reaper_kill),
972 .copyout_sz = sizeof(struct procctl_reaper_kill),
973 .exec = reap_kill, .copyout_on_error = true,
974 .sapblk = reap_kill_sapblk, },
976 { .lock_tree = PCTL_SLOCKED, .one_proc = false,
977 .esrch_is_einval = false, .no_nonnull_data = false,
978 .need_candebug = true,
979 .copyin_sz = sizeof(int), .copyout_sz = 0,
980 .exec = trace_ctl, .copyout_on_error = false, },
981 [PROC_TRACE_STATUS] =
982 { .lock_tree = PCTL_UNLOCKED, .one_proc = true,
983 .esrch_is_einval = false, .no_nonnull_data = false,
984 .need_candebug = false,
985 .copyin_sz = 0, .copyout_sz = sizeof(int),
986 .exec = trace_status, .copyout_on_error = false, },
988 { .lock_tree = PCTL_SLOCKED, .one_proc = false,
989 .esrch_is_einval = false, .no_nonnull_data = false,
990 .need_candebug = true,
991 .copyin_sz = sizeof(int), .copyout_sz = 0,
992 .exec = trapcap_ctl, .copyout_on_error = false, },
993 [PROC_TRAPCAP_STATUS] =
994 { .lock_tree = PCTL_UNLOCKED, .one_proc = true,
995 .esrch_is_einval = false, .no_nonnull_data = false,
996 .need_candebug = false,
997 .copyin_sz = 0, .copyout_sz = sizeof(int),
998 .exec = trapcap_status, .copyout_on_error = false, },
999 [PROC_PDEATHSIG_CTL] =
1000 { .lock_tree = PCTL_UNLOCKED, .one_proc = true,
1001 .esrch_is_einval = true, .no_nonnull_data = false,
1002 .need_candebug = false,
1003 .copyin_sz = sizeof(int), .copyout_sz = 0,
1004 .exec = pdeathsig_ctl, .copyout_on_error = false, },
1005 [PROC_PDEATHSIG_STATUS] =
1006 { .lock_tree = PCTL_UNLOCKED, .one_proc = true,
1007 .esrch_is_einval = true, .no_nonnull_data = false,
1008 .need_candebug = false,
1009 .copyin_sz = 0, .copyout_sz = sizeof(int),
1010 .exec = pdeathsig_status, .copyout_on_error = false, },
1012 { .lock_tree = PCTL_UNLOCKED, .one_proc = true,
1013 .esrch_is_einval = false, .no_nonnull_data = false,
1014 .need_candebug = true,
1015 .copyin_sz = sizeof(int), .copyout_sz = 0,
1016 .exec = aslr_ctl, .copyout_on_error = false, },
1017 [PROC_ASLR_STATUS] =
1018 { .lock_tree = PCTL_UNLOCKED, .one_proc = true,
1019 .esrch_is_einval = false, .no_nonnull_data = false,
1020 .need_candebug = false,
1021 .copyin_sz = 0, .copyout_sz = sizeof(int),
1022 .exec = aslr_status, .copyout_on_error = false, },
1023 [PROC_PROTMAX_CTL] =
1024 { .lock_tree = PCTL_UNLOCKED, .one_proc = true,
1025 .esrch_is_einval = false, .no_nonnull_data = false,
1026 .need_candebug = true,
1027 .copyin_sz = sizeof(int), .copyout_sz = 0,
1028 .exec = protmax_ctl, .copyout_on_error = false, },
1029 [PROC_PROTMAX_STATUS] =
1030 { .lock_tree = PCTL_UNLOCKED, .one_proc = true,
1031 .esrch_is_einval = false, .no_nonnull_data = false,
1032 .need_candebug = false,
1033 .copyin_sz = 0, .copyout_sz = sizeof(int),
1034 .exec = protmax_status, .copyout_on_error = false, },
1035 [PROC_STACKGAP_CTL] =
1036 { .lock_tree = PCTL_UNLOCKED, .one_proc = true,
1037 .esrch_is_einval = false, .no_nonnull_data = false,
1038 .need_candebug = true,
1039 .copyin_sz = sizeof(int), .copyout_sz = 0,
1040 .exec = stackgap_ctl, .copyout_on_error = false, },
1041 [PROC_STACKGAP_STATUS] =
1042 { .lock_tree = PCTL_UNLOCKED, .one_proc = true,
1043 .esrch_is_einval = false, .no_nonnull_data = false,
1044 .need_candebug = false,
1045 .copyin_sz = 0, .copyout_sz = sizeof(int),
1046 .exec = stackgap_status, .copyout_on_error = false, },
1047 [PROC_NO_NEW_PRIVS_CTL] =
1048 { .lock_tree = PCTL_SLOCKED, .one_proc = true,
1049 .esrch_is_einval = false, .no_nonnull_data = false,
1050 .need_candebug = true,
1051 .copyin_sz = sizeof(int), .copyout_sz = 0,
1052 .exec = no_new_privs_ctl, .copyout_on_error = false, },
1053 [PROC_NO_NEW_PRIVS_STATUS] =
1054 { .lock_tree = PCTL_UNLOCKED, .one_proc = true,
1055 .esrch_is_einval = false, .no_nonnull_data = false,
1056 .need_candebug = false,
1057 .copyin_sz = 0, .copyout_sz = sizeof(int),
1058 .exec = no_new_privs_status, .copyout_on_error = false, },
1060 { .lock_tree = PCTL_UNLOCKED, .one_proc = true,
1061 .esrch_is_einval = false, .no_nonnull_data = false,
1062 .need_candebug = true,
1063 .copyin_sz = sizeof(int), .copyout_sz = 0,
1064 .exec = wxmap_ctl, .copyout_on_error = false, },
1065 [PROC_WXMAP_STATUS] =
1066 { .lock_tree = PCTL_UNLOCKED, .one_proc = true,
1067 .esrch_is_einval = false, .no_nonnull_data = false,
1068 .need_candebug = false,
1069 .copyin_sz = 0, .copyout_sz = sizeof(int),
1070 .exec = wxmap_status, .copyout_on_error = false, },
1074 sys_procctl(struct thread *td, struct procctl_args *uap)
1077 struct procctl_reaper_status rs;
1078 struct procctl_reaper_pids rp;
1079 struct procctl_reaper_kill rk;
1082 const struct procctl_cmd_info *cmd_info;
1085 if (uap->com >= PROC_PROCCTL_MD_MIN)
1086 return (cpu_procctl(td, uap->idtype, uap->id,
1087 uap->com, uap->data));
1088 if (uap->com == 0 || uap->com >= nitems(procctl_cmds_info))
1090 cmd_info = &procctl_cmds_info[uap->com];
1091 bzero(&x, sizeof(x));
1093 if (cmd_info->copyin_sz > 0) {
1094 error = copyin(uap->data, &x, cmd_info->copyin_sz);
1097 } else if (cmd_info->no_nonnull_data && uap->data != NULL) {
1101 error = kern_procctl(td, uap->idtype, uap->id, uap->com, &x);
1103 if (cmd_info->copyout_sz > 0 && (error == 0 ||
1104 cmd_info->copyout_on_error)) {
1105 error1 = copyout(&x, uap->data, cmd_info->copyout_sz);
1113 kern_procctl_single(struct thread *td, struct proc *p, int com, void *data)
1116 PROC_LOCK_ASSERT(p, MA_OWNED);
1117 return (procctl_cmds_info[com].exec(td, p, data));
1121 kern_procctl(struct thread *td, idtype_t idtype, id_t id, int com, void *data)
1125 const struct procctl_cmd_info *cmd_info;
1126 int error, first_error, ok;
1129 MPASS(com > 0 && com < nitems(procctl_cmds_info));
1130 cmd_info = &procctl_cmds_info[com];
1131 if (idtype != P_PID && cmd_info->one_proc)
1135 if (cmd_info->sapblk != NULL) {
1136 sapblk = cmd_info->sapblk(td, data);
1137 if (sapblk && !stop_all_proc_block())
1141 switch (cmd_info->lock_tree) {
1143 sx_xlock(&proctree_lock);
1146 sx_slock(&proctree_lock);
1161 error = cmd_info->esrch_is_einval ?
1165 error = cmd_info->need_candebug ? p_candebug(td, p) :
1169 error = kern_procctl_single(td, p, com, data);
1174 * Attempt to apply the operation to all members of the
1175 * group. Ignore processes in the group that can't be
1176 * seen. Ignore errors so long as at least one process is
1177 * able to complete the request successfully.
1187 LIST_FOREACH(p, &pg->pg_members, p_pglist) {
1189 if (p->p_state == PRS_NEW ||
1190 p->p_state == PRS_ZOMBIE ||
1191 (cmd_info->need_candebug ? p_candebug(td, p) :
1192 p_cansee(td, p)) != 0) {
1196 error = kern_procctl_single(td, p, com, data);
1200 else if (first_error == 0)
1201 first_error = error;
1205 else if (first_error != 0)
1206 error = first_error;
1209 * Was not able to see any processes in the
1219 switch (cmd_info->lock_tree) {
1221 sx_xunlock(&proctree_lock);
1224 sx_sunlock(&proctree_lock);
1230 stop_all_proc_unblock();