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>
37 #include <sys/mutex.h>
40 #include <sys/procctl.h>
42 #include <sys/syscallsubr.h>
43 #include <sys/sysproto.h>
47 protect_setchild(struct thread *td, struct proc *p, int flags)
50 PROC_LOCK_ASSERT(p, MA_OWNED);
51 if (p->p_flag & P_SYSTEM || p_cansched(td, p) != 0)
53 if (flags & PPROT_SET) {
54 p->p_flag |= P_PROTECTED;
55 if (flags & PPROT_INHERIT)
56 p->p_flag2 |= P2_INHERIT_PROTECTED;
58 p->p_flag &= ~P_PROTECTED;
59 p->p_flag2 &= ~P2_INHERIT_PROTECTED;
65 protect_setchildren(struct thread *td, struct proc *top, int flags)
72 sx_assert(&proctree_lock, SX_LOCKED);
74 ret |= protect_setchild(td, p, flags);
77 * If this process has children, descend to them next,
78 * otherwise do any siblings, and if done with this level,
79 * follow back up the tree (but not past top).
81 if (!LIST_EMPTY(&p->p_children))
82 p = LIST_FIRST(&p->p_children);
88 if (LIST_NEXT(p, p_sibling)) {
89 p = LIST_NEXT(p, p_sibling);
99 protect_set(struct thread *td, struct proc *p, int flags)
103 switch (PPROT_OP(flags)) {
111 if ((PPROT_FLAGS(flags) & ~(PPROT_DESCEND | PPROT_INHERIT)) != 0)
114 error = priv_check(td, PRIV_VM_MADV_PROTECT);
118 if (flags & PPROT_DESCEND)
119 ret = protect_setchildren(td, p, flags);
121 ret = protect_setchild(td, p, flags);
128 reap_acquire(struct thread *td, struct proc *p)
131 sx_assert(&proctree_lock, SX_XLOCKED);
134 if ((p->p_treeflag & P_TREE_REAPER) != 0)
136 p->p_treeflag |= P_TREE_REAPER;
138 * We do not reattach existing children and the whole tree
139 * under them to us, since p->p_reaper already seen them.
145 reap_release(struct thread *td, struct proc *p)
148 sx_assert(&proctree_lock, SX_XLOCKED);
153 if ((p->p_treeflag & P_TREE_REAPER) == 0)
155 reaper_abandon_children(p, false);
160 reap_status(struct thread *td, struct proc *p,
161 struct procctl_reaper_status *rs)
163 struct proc *reap, *p2, *first_p;
165 sx_assert(&proctree_lock, SX_LOCKED);
166 bzero(rs, sizeof(*rs));
167 if ((p->p_treeflag & P_TREE_REAPER) == 0) {
171 rs->rs_flags |= REAPER_STATUS_OWNED;
173 if (reap == initproc)
174 rs->rs_flags |= REAPER_STATUS_REALINIT;
175 rs->rs_reaper = reap->p_pid;
176 rs->rs_descendants = 0;
178 if (!LIST_EMPTY(&reap->p_reaplist)) {
179 first_p = LIST_FIRST(&reap->p_children);
181 first_p = LIST_FIRST(&reap->p_reaplist);
182 rs->rs_pid = first_p->p_pid;
183 LIST_FOREACH(p2, &reap->p_reaplist, p_reapsibling) {
184 if (proc_realparent(p2) == reap)
186 rs->rs_descendants++;
195 reap_getpids(struct thread *td, struct proc *p, struct procctl_reaper_pids *rp)
197 struct proc *reap, *p2;
198 struct procctl_reaper_pidinfo *pi, *pip;
202 sx_assert(&proctree_lock, SX_LOCKED);
204 reap = (p->p_treeflag & P_TREE_REAPER) == 0 ? p->p_reaper : p;
207 LIST_FOREACH(p2, &reap->p_reaplist, p_reapsibling)
209 sx_unlock(&proctree_lock);
210 if (rp->rp_count < n)
212 pi = malloc(n * sizeof(*pi), M_TEMP, M_WAITOK);
213 sx_slock(&proctree_lock);
214 LIST_FOREACH(p2, &reap->p_reaplist, p_reapsibling) {
218 bzero(pip, sizeof(*pip));
219 pip->pi_pid = p2->p_pid;
220 pip->pi_subtree = p2->p_reapsubtree;
221 pip->pi_flags = REAPER_PIDINFO_VALID;
222 if (proc_realparent(p2) == reap)
223 pip->pi_flags |= REAPER_PIDINFO_CHILD;
224 if ((p2->p_treeflag & P_TREE_REAPER) != 0)
225 pip->pi_flags |= REAPER_PIDINFO_REAPER;
228 sx_sunlock(&proctree_lock);
229 error = copyout(pi, rp->rp_pids, i * sizeof(*pi));
231 sx_slock(&proctree_lock);
237 reap_kill_proc(struct thread *td, struct proc *p2, ksiginfo_t *ksi,
238 struct procctl_reaper_kill *rk, int *error)
243 error1 = p_cansignal(td, p2, rk->rk_sig);
245 pksignal(p2, rk->rk_sig, ksi);
248 } else if (*error == ESRCH) {
249 rk->rk_fpid = p2->p_pid;
255 struct reap_kill_tracker {
257 TAILQ_ENTRY(reap_kill_tracker) link;
260 TAILQ_HEAD(reap_kill_tracker_head, reap_kill_tracker);
263 reap_kill_sched(struct reap_kill_tracker_head *tracker, struct proc *p2)
265 struct reap_kill_tracker *t;
267 t = malloc(sizeof(struct reap_kill_tracker), M_TEMP, M_WAITOK);
269 TAILQ_INSERT_TAIL(tracker, t, link);
273 reap_kill(struct thread *td, struct proc *p, struct procctl_reaper_kill *rk)
275 struct proc *reap, *p2;
277 struct reap_kill_tracker_head tracker;
278 struct reap_kill_tracker *t;
281 sx_assert(&proctree_lock, SX_LOCKED);
282 if (IN_CAPABILITY_MODE(td))
284 if (rk->rk_sig <= 0 || rk->rk_sig > _SIG_MAXSIG ||
285 (rk->rk_flags & ~(REAPER_KILL_CHILDREN |
286 REAPER_KILL_SUBTREE)) != 0 || (rk->rk_flags &
287 (REAPER_KILL_CHILDREN | REAPER_KILL_SUBTREE)) ==
288 (REAPER_KILL_CHILDREN | REAPER_KILL_SUBTREE))
291 reap = (p->p_treeflag & P_TREE_REAPER) == 0 ? p->p_reaper : p;
293 ksi.ksi_signo = rk->rk_sig;
294 ksi.ksi_code = SI_USER;
295 ksi.ksi_pid = td->td_proc->p_pid;
296 ksi.ksi_uid = td->td_ucred->cr_ruid;
300 if ((rk->rk_flags & REAPER_KILL_CHILDREN) != 0) {
301 for (p2 = LIST_FIRST(&reap->p_children); p2 != NULL;
302 p2 = LIST_NEXT(p2, p_sibling)) {
303 reap_kill_proc(td, p2, &ksi, rk, &error);
305 * Do not end the loop on error, signal
310 TAILQ_INIT(&tracker);
311 reap_kill_sched(&tracker, reap);
312 while ((t = TAILQ_FIRST(&tracker)) != NULL) {
313 MPASS((t->parent->p_treeflag & P_TREE_REAPER) != 0);
314 TAILQ_REMOVE(&tracker, t, link);
315 for (p2 = LIST_FIRST(&t->parent->p_reaplist); p2 != NULL;
316 p2 = LIST_NEXT(p2, p_reapsibling)) {
317 if (t->parent == reap &&
318 (rk->rk_flags & REAPER_KILL_SUBTREE) != 0 &&
319 p2->p_reapsubtree != rk->rk_subtree)
321 if ((p2->p_treeflag & P_TREE_REAPER) != 0)
322 reap_kill_sched(&tracker, p2);
323 reap_kill_proc(td, p2, &ksi, rk, &error);
333 trace_ctl(struct thread *td, struct proc *p, int state)
336 PROC_LOCK_ASSERT(p, MA_OWNED);
339 * Ktrace changes p_traceflag from or to zero under the
340 * process lock, so the test does not need to acquire ktrace
343 if ((p->p_flag & P_TRACED) != 0 || p->p_traceflag != 0)
347 case PROC_TRACE_CTL_ENABLE:
348 if (td->td_proc != p)
350 p->p_flag2 &= ~(P2_NOTRACE | P2_NOTRACE_EXEC);
352 case PROC_TRACE_CTL_DISABLE_EXEC:
353 p->p_flag2 |= P2_NOTRACE_EXEC | P2_NOTRACE;
355 case PROC_TRACE_CTL_DISABLE:
356 if ((p->p_flag2 & P2_NOTRACE_EXEC) != 0) {
357 KASSERT((p->p_flag2 & P2_NOTRACE) != 0,
358 ("dandling P2_NOTRACE_EXEC"));
359 if (td->td_proc != p)
361 p->p_flag2 &= ~P2_NOTRACE_EXEC;
363 p->p_flag2 |= P2_NOTRACE;
373 trace_status(struct thread *td, struct proc *p, int *data)
376 if ((p->p_flag2 & P2_NOTRACE) != 0) {
377 KASSERT((p->p_flag & P_TRACED) == 0,
378 ("%d traced but tracing disabled", p->p_pid));
380 } else if ((p->p_flag & P_TRACED) != 0) {
381 *data = p->p_pptr->p_pid;
389 trapcap_ctl(struct thread *td, struct proc *p, int state)
392 PROC_LOCK_ASSERT(p, MA_OWNED);
395 case PROC_TRAPCAP_CTL_ENABLE:
396 p->p_flag2 |= P2_TRAPCAP;
398 case PROC_TRAPCAP_CTL_DISABLE:
399 p->p_flag2 &= ~P2_TRAPCAP;
408 trapcap_status(struct thread *td, struct proc *p, int *data)
411 *data = (p->p_flag2 & P2_TRAPCAP) != 0 ? PROC_TRAPCAP_CTL_ENABLE :
412 PROC_TRAPCAP_CTL_DISABLE;
416 #ifndef _SYS_SYSPROTO_H_
417 struct procctl_args {
426 sys_procctl(struct thread *td, struct procctl_args *uap)
430 struct procctl_reaper_status rs;
431 struct procctl_reaper_pids rp;
432 struct procctl_reaper_kill rk;
434 int error, error1, flags, signum;
439 case PROC_TRAPCAP_CTL:
440 error = copyin(uap->data, &flags, sizeof(flags));
445 case PROC_REAP_ACQUIRE:
446 case PROC_REAP_RELEASE:
447 if (uap->data != NULL)
451 case PROC_REAP_STATUS:
454 case PROC_REAP_GETPIDS:
455 error = copyin(uap->data, &x.rp, sizeof(x.rp));
461 error = copyin(uap->data, &x.rk, sizeof(x.rk));
466 case PROC_TRACE_STATUS:
467 case PROC_TRAPCAP_STATUS:
470 case PROC_PDEATHSIG_CTL:
471 error = copyin(uap->data, &signum, sizeof(signum));
476 case PROC_PDEATHSIG_STATUS:
482 error = kern_procctl(td, uap->idtype, uap->id, uap->com, data);
484 case PROC_REAP_STATUS:
486 error = copyout(&x.rs, uap->data, sizeof(x.rs));
489 error1 = copyout(&x.rk, uap->data, sizeof(x.rk));
493 case PROC_TRACE_STATUS:
494 case PROC_TRAPCAP_STATUS:
496 error = copyout(&flags, uap->data, sizeof(flags));
498 case PROC_PDEATHSIG_STATUS:
500 error = copyout(&signum, uap->data, sizeof(signum));
507 kern_procctl_single(struct thread *td, struct proc *p, int com, void *data)
510 PROC_LOCK_ASSERT(p, MA_OWNED);
513 return (protect_set(td, p, *(int *)data));
514 case PROC_REAP_ACQUIRE:
515 return (reap_acquire(td, p));
516 case PROC_REAP_RELEASE:
517 return (reap_release(td, p));
518 case PROC_REAP_STATUS:
519 return (reap_status(td, p, data));
520 case PROC_REAP_GETPIDS:
521 return (reap_getpids(td, p, data));
523 return (reap_kill(td, p, data));
525 return (trace_ctl(td, p, *(int *)data));
526 case PROC_TRACE_STATUS:
527 return (trace_status(td, p, data));
528 case PROC_TRAPCAP_CTL:
529 return (trapcap_ctl(td, p, *(int *)data));
530 case PROC_TRAPCAP_STATUS:
531 return (trapcap_status(td, p, data));
538 kern_procctl(struct thread *td, idtype_t idtype, id_t id, int com, void *data)
542 int error, first_error, ok;
547 case PROC_REAP_ACQUIRE:
548 case PROC_REAP_RELEASE:
549 case PROC_REAP_STATUS:
550 case PROC_REAP_GETPIDS:
552 case PROC_TRACE_STATUS:
553 case PROC_TRAPCAP_STATUS:
554 case PROC_PDEATHSIG_CTL:
555 case PROC_PDEATHSIG_STATUS:
561 case PROC_PDEATHSIG_CTL:
562 signum = *(int *)data;
564 if ((id != 0 && id != p->p_pid) ||
565 (signum != 0 && !_SIG_VALID(signum)))
568 p->p_pdeathsig = signum;
571 case PROC_PDEATHSIG_STATUS:
573 if (id != 0 && id != p->p_pid)
576 *(int *)data = p->p_pdeathsig;
583 case PROC_REAP_STATUS:
584 case PROC_REAP_GETPIDS:
587 case PROC_TRAPCAP_CTL:
588 sx_slock(&proctree_lock);
591 case PROC_REAP_ACQUIRE:
592 case PROC_REAP_RELEASE:
593 sx_xlock(&proctree_lock);
596 case PROC_TRACE_STATUS:
597 case PROC_TRAPCAP_STATUS:
611 error = p_cansee(td, p);
613 error = kern_procctl_single(td, p, com, data);
618 * Attempt to apply the operation to all members of the
619 * group. Ignore processes in the group that can't be
620 * seen. Ignore errors so long as at least one process is
621 * able to complete the request successfully.
631 LIST_FOREACH(p, &pg->pg_members, p_pglist) {
633 if (p->p_state == PRS_NEW || p_cansee(td, p) != 0) {
637 error = kern_procctl_single(td, p, com, data);
641 else if (first_error == 0)
646 else if (first_error != 0)
650 * Was not able to see any processes in the
660 sx_unlock(&proctree_lock);