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/systm.h>
35 #include <sys/capsicum.h>
38 #include <sys/mutex.h>
41 #include <sys/procctl.h>
43 #include <sys/syscallsubr.h>
44 #include <sys/sysproto.h>
49 #include <vm/vm_map.h>
50 #include <vm/vm_extern.h>
53 protect_setchild(struct thread *td, struct proc *p, int flags)
56 PROC_LOCK_ASSERT(p, MA_OWNED);
57 if (p->p_flag & P_SYSTEM || p_cansched(td, p) != 0)
59 if (flags & PPROT_SET) {
60 p->p_flag |= P_PROTECTED;
61 if (flags & PPROT_INHERIT)
62 p->p_flag2 |= P2_INHERIT_PROTECTED;
64 p->p_flag &= ~P_PROTECTED;
65 p->p_flag2 &= ~P2_INHERIT_PROTECTED;
71 protect_setchildren(struct thread *td, struct proc *top, int flags)
78 sx_assert(&proctree_lock, SX_LOCKED);
80 ret |= protect_setchild(td, p, flags);
83 * If this process has children, descend to them next,
84 * otherwise do any siblings, and if done with this level,
85 * follow back up the tree (but not past top).
87 if (!LIST_EMPTY(&p->p_children))
88 p = LIST_FIRST(&p->p_children);
94 if (LIST_NEXT(p, p_sibling)) {
95 p = LIST_NEXT(p, p_sibling);
105 protect_set(struct thread *td, struct proc *p, int flags)
109 switch (PPROT_OP(flags)) {
117 if ((PPROT_FLAGS(flags) & ~(PPROT_DESCEND | PPROT_INHERIT)) != 0)
120 error = priv_check(td, PRIV_VM_MADV_PROTECT);
124 if (flags & PPROT_DESCEND)
125 ret = protect_setchildren(td, p, flags);
127 ret = protect_setchild(td, p, flags);
134 reap_acquire(struct thread *td, struct proc *p)
137 sx_assert(&proctree_lock, SX_XLOCKED);
140 if ((p->p_treeflag & P_TREE_REAPER) != 0)
142 p->p_treeflag |= P_TREE_REAPER;
144 * We do not reattach existing children and the whole tree
145 * under them to us, since p->p_reaper already seen them.
151 reap_release(struct thread *td, struct proc *p)
154 sx_assert(&proctree_lock, SX_XLOCKED);
159 if ((p->p_treeflag & P_TREE_REAPER) == 0)
161 reaper_abandon_children(p, false);
166 reap_status(struct thread *td, struct proc *p,
167 struct procctl_reaper_status *rs)
169 struct proc *reap, *p2, *first_p;
171 sx_assert(&proctree_lock, SX_LOCKED);
172 bzero(rs, sizeof(*rs));
173 if ((p->p_treeflag & P_TREE_REAPER) == 0) {
177 rs->rs_flags |= REAPER_STATUS_OWNED;
179 if (reap == initproc)
180 rs->rs_flags |= REAPER_STATUS_REALINIT;
181 rs->rs_reaper = reap->p_pid;
182 rs->rs_descendants = 0;
184 if (!LIST_EMPTY(&reap->p_reaplist)) {
185 first_p = LIST_FIRST(&reap->p_children);
187 first_p = LIST_FIRST(&reap->p_reaplist);
188 rs->rs_pid = first_p->p_pid;
189 LIST_FOREACH(p2, &reap->p_reaplist, p_reapsibling) {
190 if (proc_realparent(p2) == reap)
192 rs->rs_descendants++;
201 reap_getpids(struct thread *td, struct proc *p, struct procctl_reaper_pids *rp)
203 struct proc *reap, *p2;
204 struct procctl_reaper_pidinfo *pi, *pip;
208 sx_assert(&proctree_lock, SX_LOCKED);
210 reap = (p->p_treeflag & P_TREE_REAPER) == 0 ? p->p_reaper : p;
213 LIST_FOREACH(p2, &reap->p_reaplist, p_reapsibling)
215 sx_unlock(&proctree_lock);
216 if (rp->rp_count < n)
218 pi = malloc(n * sizeof(*pi), M_TEMP, M_WAITOK);
219 sx_slock(&proctree_lock);
220 LIST_FOREACH(p2, &reap->p_reaplist, p_reapsibling) {
224 bzero(pip, sizeof(*pip));
225 pip->pi_pid = p2->p_pid;
226 pip->pi_subtree = p2->p_reapsubtree;
227 pip->pi_flags = REAPER_PIDINFO_VALID;
228 if (proc_realparent(p2) == reap)
229 pip->pi_flags |= REAPER_PIDINFO_CHILD;
230 if ((p2->p_treeflag & P_TREE_REAPER) != 0)
231 pip->pi_flags |= REAPER_PIDINFO_REAPER;
234 sx_sunlock(&proctree_lock);
235 error = copyout(pi, rp->rp_pids, i * sizeof(*pi));
237 sx_slock(&proctree_lock);
243 reap_kill_proc(struct thread *td, struct proc *p2, ksiginfo_t *ksi,
244 struct procctl_reaper_kill *rk, int *error)
249 error1 = p_cansignal(td, p2, rk->rk_sig);
251 pksignal(p2, rk->rk_sig, ksi);
254 } else if (*error == ESRCH) {
255 rk->rk_fpid = p2->p_pid;
261 struct reap_kill_tracker {
263 TAILQ_ENTRY(reap_kill_tracker) link;
266 TAILQ_HEAD(reap_kill_tracker_head, reap_kill_tracker);
269 reap_kill_sched(struct reap_kill_tracker_head *tracker, struct proc *p2)
271 struct reap_kill_tracker *t;
273 t = malloc(sizeof(struct reap_kill_tracker), M_TEMP, M_WAITOK);
275 TAILQ_INSERT_TAIL(tracker, t, link);
279 reap_kill(struct thread *td, struct proc *p, struct procctl_reaper_kill *rk)
281 struct proc *reap, *p2;
283 struct reap_kill_tracker_head tracker;
284 struct reap_kill_tracker *t;
287 sx_assert(&proctree_lock, SX_LOCKED);
288 if (IN_CAPABILITY_MODE(td))
290 if (rk->rk_sig <= 0 || rk->rk_sig > _SIG_MAXSIG ||
291 (rk->rk_flags & ~(REAPER_KILL_CHILDREN |
292 REAPER_KILL_SUBTREE)) != 0 || (rk->rk_flags &
293 (REAPER_KILL_CHILDREN | REAPER_KILL_SUBTREE)) ==
294 (REAPER_KILL_CHILDREN | REAPER_KILL_SUBTREE))
297 reap = (p->p_treeflag & P_TREE_REAPER) == 0 ? p->p_reaper : p;
299 ksi.ksi_signo = rk->rk_sig;
300 ksi.ksi_code = SI_USER;
301 ksi.ksi_pid = td->td_proc->p_pid;
302 ksi.ksi_uid = td->td_ucred->cr_ruid;
306 if ((rk->rk_flags & REAPER_KILL_CHILDREN) != 0) {
307 for (p2 = LIST_FIRST(&reap->p_children); p2 != NULL;
308 p2 = LIST_NEXT(p2, p_sibling)) {
309 reap_kill_proc(td, p2, &ksi, rk, &error);
311 * Do not end the loop on error, signal
316 TAILQ_INIT(&tracker);
317 reap_kill_sched(&tracker, reap);
318 while ((t = TAILQ_FIRST(&tracker)) != NULL) {
319 MPASS((t->parent->p_treeflag & P_TREE_REAPER) != 0);
320 TAILQ_REMOVE(&tracker, t, link);
321 for (p2 = LIST_FIRST(&t->parent->p_reaplist); p2 != NULL;
322 p2 = LIST_NEXT(p2, p_reapsibling)) {
323 if (t->parent == reap &&
324 (rk->rk_flags & REAPER_KILL_SUBTREE) != 0 &&
325 p2->p_reapsubtree != rk->rk_subtree)
327 if ((p2->p_treeflag & P_TREE_REAPER) != 0)
328 reap_kill_sched(&tracker, p2);
329 reap_kill_proc(td, p2, &ksi, rk, &error);
339 trace_ctl(struct thread *td, struct proc *p, int state)
342 PROC_LOCK_ASSERT(p, MA_OWNED);
345 * Ktrace changes p_traceflag from or to zero under the
346 * process lock, so the test does not need to acquire ktrace
349 if ((p->p_flag & P_TRACED) != 0 || p->p_traceflag != 0)
353 case PROC_TRACE_CTL_ENABLE:
354 if (td->td_proc != p)
356 p->p_flag2 &= ~(P2_NOTRACE | P2_NOTRACE_EXEC);
358 case PROC_TRACE_CTL_DISABLE_EXEC:
359 p->p_flag2 |= P2_NOTRACE_EXEC | P2_NOTRACE;
361 case PROC_TRACE_CTL_DISABLE:
362 if ((p->p_flag2 & P2_NOTRACE_EXEC) != 0) {
363 KASSERT((p->p_flag2 & P2_NOTRACE) != 0,
364 ("dandling P2_NOTRACE_EXEC"));
365 if (td->td_proc != p)
367 p->p_flag2 &= ~P2_NOTRACE_EXEC;
369 p->p_flag2 |= P2_NOTRACE;
379 trace_status(struct thread *td, struct proc *p, int *data)
382 if ((p->p_flag2 & P2_NOTRACE) != 0) {
383 KASSERT((p->p_flag & P_TRACED) == 0,
384 ("%d traced but tracing disabled", p->p_pid));
386 } else if ((p->p_flag & P_TRACED) != 0) {
387 *data = p->p_pptr->p_pid;
395 trapcap_ctl(struct thread *td, struct proc *p, int state)
398 PROC_LOCK_ASSERT(p, MA_OWNED);
401 case PROC_TRAPCAP_CTL_ENABLE:
402 p->p_flag2 |= P2_TRAPCAP;
404 case PROC_TRAPCAP_CTL_DISABLE:
405 p->p_flag2 &= ~P2_TRAPCAP;
414 trapcap_status(struct thread *td, struct proc *p, int *data)
417 *data = (p->p_flag2 & P2_TRAPCAP) != 0 ? PROC_TRAPCAP_CTL_ENABLE :
418 PROC_TRAPCAP_CTL_DISABLE;
423 protmax_ctl(struct thread *td, struct proc *p, int state)
425 PROC_LOCK_ASSERT(p, MA_OWNED);
428 case PROC_PROTMAX_FORCE_ENABLE:
429 p->p_flag2 &= ~P2_PROTMAX_DISABLE;
430 p->p_flag2 |= P2_PROTMAX_ENABLE;
432 case PROC_PROTMAX_FORCE_DISABLE:
433 p->p_flag2 |= P2_PROTMAX_DISABLE;
434 p->p_flag2 &= ~P2_PROTMAX_ENABLE;
436 case PROC_PROTMAX_NOFORCE:
437 p->p_flag2 &= ~(P2_PROTMAX_ENABLE | P2_PROTMAX_DISABLE);
446 protmax_status(struct thread *td, struct proc *p, int *data)
450 switch (p->p_flag2 & (P2_PROTMAX_ENABLE | P2_PROTMAX_DISABLE)) {
452 d = PROC_ASLR_NOFORCE;
454 case P2_PROTMAX_ENABLE:
455 d = PROC_PROTMAX_FORCE_ENABLE;
457 case P2_PROTMAX_DISABLE:
458 d = PROC_PROTMAX_FORCE_DISABLE;
461 if (kern_mmap_maxprot(p, PROT_READ) == PROT_READ)
462 d |= PROC_PROTMAX_ACTIVE;
468 aslr_ctl(struct thread *td, struct proc *p, int state)
471 PROC_LOCK_ASSERT(p, MA_OWNED);
474 case PROC_ASLR_FORCE_ENABLE:
475 p->p_flag2 &= ~P2_ASLR_DISABLE;
476 p->p_flag2 |= P2_ASLR_ENABLE;
478 case PROC_ASLR_FORCE_DISABLE:
479 p->p_flag2 |= P2_ASLR_DISABLE;
480 p->p_flag2 &= ~P2_ASLR_ENABLE;
482 case PROC_ASLR_NOFORCE:
483 p->p_flag2 &= ~(P2_ASLR_ENABLE | P2_ASLR_DISABLE);
492 aslr_status(struct thread *td, struct proc *p, int *data)
497 switch (p->p_flag2 & (P2_ASLR_ENABLE | P2_ASLR_DISABLE)) {
499 d = PROC_ASLR_NOFORCE;
502 d = PROC_ASLR_FORCE_ENABLE;
504 case P2_ASLR_DISABLE:
505 d = PROC_ASLR_FORCE_DISABLE;
508 if ((p->p_flag & P_WEXIT) == 0) {
511 vm = vmspace_acquire_ref(p);
512 if (vm != NULL && (vm->vm_map.flags & MAP_ASLR) != 0) {
513 d |= PROC_ASLR_ACTIVE;
523 #ifndef _SYS_SYSPROTO_H_
524 struct procctl_args {
533 sys_procctl(struct thread *td, struct procctl_args *uap)
537 struct procctl_reaper_status rs;
538 struct procctl_reaper_pids rp;
539 struct procctl_reaper_kill rk;
541 int error, error1, flags, signum;
543 if (uap->com >= PROC_PROCCTL_MD_MIN)
544 return (cpu_procctl(td, uap->idtype, uap->id,
545 uap->com, uap->data));
549 case PROC_PROTMAX_CTL:
552 case PROC_TRAPCAP_CTL:
553 error = copyin(uap->data, &flags, sizeof(flags));
558 case PROC_REAP_ACQUIRE:
559 case PROC_REAP_RELEASE:
560 if (uap->data != NULL)
564 case PROC_REAP_STATUS:
567 case PROC_REAP_GETPIDS:
568 error = copyin(uap->data, &x.rp, sizeof(x.rp));
574 error = copyin(uap->data, &x.rk, sizeof(x.rk));
579 case PROC_ASLR_STATUS:
580 case PROC_PROTMAX_STATUS:
581 case PROC_TRACE_STATUS:
582 case PROC_TRAPCAP_STATUS:
585 case PROC_PDEATHSIG_CTL:
586 error = copyin(uap->data, &signum, sizeof(signum));
591 case PROC_PDEATHSIG_STATUS:
597 error = kern_procctl(td, uap->idtype, uap->id, uap->com, data);
599 case PROC_REAP_STATUS:
601 error = copyout(&x.rs, uap->data, sizeof(x.rs));
604 error1 = copyout(&x.rk, uap->data, sizeof(x.rk));
608 case PROC_ASLR_STATUS:
609 case PROC_PROTMAX_STATUS:
610 case PROC_TRACE_STATUS:
611 case PROC_TRAPCAP_STATUS:
613 error = copyout(&flags, uap->data, sizeof(flags));
615 case PROC_PDEATHSIG_STATUS:
617 error = copyout(&signum, uap->data, sizeof(signum));
624 kern_procctl_single(struct thread *td, struct proc *p, int com, void *data)
627 PROC_LOCK_ASSERT(p, MA_OWNED);
630 return (aslr_ctl(td, p, *(int *)data));
631 case PROC_ASLR_STATUS:
632 return (aslr_status(td, p, data));
634 return (protect_set(td, p, *(int *)data));
635 case PROC_PROTMAX_CTL:
636 return (protmax_ctl(td, p, *(int *)data));
637 case PROC_PROTMAX_STATUS:
638 return (protmax_status(td, p, data));
639 case PROC_REAP_ACQUIRE:
640 return (reap_acquire(td, p));
641 case PROC_REAP_RELEASE:
642 return (reap_release(td, p));
643 case PROC_REAP_STATUS:
644 return (reap_status(td, p, data));
645 case PROC_REAP_GETPIDS:
646 return (reap_getpids(td, p, data));
648 return (reap_kill(td, p, data));
650 return (trace_ctl(td, p, *(int *)data));
651 case PROC_TRACE_STATUS:
652 return (trace_status(td, p, data));
653 case PROC_TRAPCAP_CTL:
654 return (trapcap_ctl(td, p, *(int *)data));
655 case PROC_TRAPCAP_STATUS:
656 return (trapcap_status(td, p, data));
663 kern_procctl(struct thread *td, idtype_t idtype, id_t id, int com, void *data)
667 int error, first_error, ok;
673 case PROC_ASLR_STATUS:
674 case PROC_PROTMAX_CTL:
675 case PROC_PROTMAX_STATUS:
676 case PROC_REAP_ACQUIRE:
677 case PROC_REAP_RELEASE:
678 case PROC_REAP_STATUS:
679 case PROC_REAP_GETPIDS:
681 case PROC_TRACE_STATUS:
682 case PROC_TRAPCAP_STATUS:
683 case PROC_PDEATHSIG_CTL:
684 case PROC_PDEATHSIG_STATUS:
690 case PROC_PDEATHSIG_CTL:
691 signum = *(int *)data;
693 if ((id != 0 && id != p->p_pid) ||
694 (signum != 0 && !_SIG_VALID(signum)))
697 p->p_pdeathsig = signum;
700 case PROC_PDEATHSIG_STATUS:
702 if (id != 0 && id != p->p_pid)
705 *(int *)data = p->p_pdeathsig;
712 case PROC_REAP_STATUS:
713 case PROC_REAP_GETPIDS:
716 case PROC_TRAPCAP_CTL:
717 sx_slock(&proctree_lock);
720 case PROC_REAP_ACQUIRE:
721 case PROC_REAP_RELEASE:
722 sx_xlock(&proctree_lock);
726 case PROC_ASLR_STATUS:
727 case PROC_PROTMAX_CTL:
728 case PROC_PROTMAX_STATUS:
729 case PROC_TRACE_STATUS:
730 case PROC_TRAPCAP_STATUS:
744 error = p_cansee(td, p);
746 error = kern_procctl_single(td, p, com, data);
751 * Attempt to apply the operation to all members of the
752 * group. Ignore processes in the group that can't be
753 * seen. Ignore errors so long as at least one process is
754 * able to complete the request successfully.
764 LIST_FOREACH(p, &pg->pg_members, p_pglist) {
766 if (p->p_state == PRS_NEW || p_cansee(td, p) != 0) {
770 error = kern_procctl_single(td, p, com, data);
774 else if (first_error == 0)
779 else if (first_error != 0)
783 * Was not able to see any processes in the
793 sx_unlock(&proctree_lock);