1 /*-
2 * Copyright (c) 2014 John Baldwin
3 * Copyright (c) 2014, 2016 The FreeBSD Foundation
4 *
5 * Portions of this software were developed by Konstantin Belousov
6 * under sponsorship from the FreeBSD Foundation.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
10 * are met:
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.
16 *
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
27 * SUCH DAMAGE.
28 */
29
30 #include <sys/cdefs.h>
31 __FBSDID("$FreeBSD$");
32
33 #include <sys/param.h>
34 #include <sys/systm.h>
35 #include <sys/capsicum.h>
36 #include <sys/lock.h>
37 #include <sys/mutex.h>
38 #include <sys/priv.h>
39 #include <sys/proc.h>
40 #include <sys/procctl.h>
41 #include <sys/sx.h>
42 #include <sys/syscallsubr.h>
43 #include <sys/sysproto.h>
44 #include <sys/wait.h>
45
46 #include <vm/vm.h>
47 #include <vm/pmap.h>
48 #include <vm/vm_map.h>
49 #include <vm/vm_extern.h>
50
51 static int
protect_setchild(struct thread * td,struct proc * p,int flags)52 protect_setchild(struct thread *td, struct proc *p, int flags)
53 {
54
55 PROC_LOCK_ASSERT(p, MA_OWNED);
56 if (p->p_flag & P_SYSTEM || p_cansched(td, p) != 0)
57 return (0);
58 if (flags & PPROT_SET) {
59 p->p_flag |= P_PROTECTED;
60 if (flags & PPROT_INHERIT)
61 p->p_flag2 |= P2_INHERIT_PROTECTED;
62 } else {
63 p->p_flag &= ~P_PROTECTED;
64 p->p_flag2 &= ~P2_INHERIT_PROTECTED;
65 }
66 return (1);
67 }
68
69 static int
protect_setchildren(struct thread * td,struct proc * top,int flags)70 protect_setchildren(struct thread *td, struct proc *top, int flags)
71 {
72 struct proc *p;
73 int ret;
74
75 p = top;
76 ret = 0;
77 sx_assert(&proctree_lock, SX_LOCKED);
78 for (;;) {
79 ret |= protect_setchild(td, p, flags);
80 PROC_UNLOCK(p);
81 /*
82 * If this process has children, descend to them next,
83 * otherwise do any siblings, and if done with this level,
84 * follow back up the tree (but not past top).
85 */
86 if (!LIST_EMPTY(&p->p_children))
87 p = LIST_FIRST(&p->p_children);
88 else for (;;) {
89 if (p == top) {
90 PROC_LOCK(p);
91 return (ret);
92 }
93 if (LIST_NEXT(p, p_sibling)) {
94 p = LIST_NEXT(p, p_sibling);
95 break;
96 }
97 p = p->p_pptr;
98 }
99 PROC_LOCK(p);
100 }
101 }
102
103 static int
protect_set(struct thread * td,struct proc * p,int flags)104 protect_set(struct thread *td, struct proc *p, int flags)
105 {
106 int error, ret;
107
108 switch (PPROT_OP(flags)) {
109 case PPROT_SET:
110 case PPROT_CLEAR:
111 break;
112 default:
113 return (EINVAL);
114 }
115
116 if ((PPROT_FLAGS(flags) & ~(PPROT_DESCEND | PPROT_INHERIT)) != 0)
117 return (EINVAL);
118
119 error = priv_check(td, PRIV_VM_MADV_PROTECT);
120 if (error)
121 return (error);
122
123 if (flags & PPROT_DESCEND)
124 ret = protect_setchildren(td, p, flags);
125 else
126 ret = protect_setchild(td, p, flags);
127 if (ret == 0)
128 return (EPERM);
129 return (0);
130 }
131
132 static int
reap_acquire(struct thread * td,struct proc * p)133 reap_acquire(struct thread *td, struct proc *p)
134 {
135
136 sx_assert(&proctree_lock, SX_XLOCKED);
137 if (p != curproc)
138 return (EPERM);
139 if ((p->p_treeflag & P_TREE_REAPER) != 0)
140 return (EBUSY);
141 p->p_treeflag |= P_TREE_REAPER;
142 /*
143 * We do not reattach existing children and the whole tree
144 * under them to us, since p->p_reaper already seen them.
145 */
146 return (0);
147 }
148
149 static int
reap_release(struct thread * td,struct proc * p)150 reap_release(struct thread *td, struct proc *p)
151 {
152
153 sx_assert(&proctree_lock, SX_XLOCKED);
154 if (p != curproc)
155 return (EPERM);
156 if (p == initproc)
157 return (EINVAL);
158 if ((p->p_treeflag & P_TREE_REAPER) == 0)
159 return (EINVAL);
160 reaper_abandon_children(p, false);
161 return (0);
162 }
163
164 static int
reap_status(struct thread * td,struct proc * p,struct procctl_reaper_status * rs)165 reap_status(struct thread *td, struct proc *p,
166 struct procctl_reaper_status *rs)
167 {
168 struct proc *reap, *p2, *first_p;
169
170 sx_assert(&proctree_lock, SX_LOCKED);
171 bzero(rs, sizeof(*rs));
172 if ((p->p_treeflag & P_TREE_REAPER) == 0) {
173 reap = p->p_reaper;
174 } else {
175 reap = p;
176 rs->rs_flags |= REAPER_STATUS_OWNED;
177 }
178 if (reap == initproc)
179 rs->rs_flags |= REAPER_STATUS_REALINIT;
180 rs->rs_reaper = reap->p_pid;
181 rs->rs_descendants = 0;
182 rs->rs_children = 0;
183 if (!LIST_EMPTY(&reap->p_reaplist)) {
184 first_p = LIST_FIRST(&reap->p_children);
185 if (first_p == NULL)
186 first_p = LIST_FIRST(&reap->p_reaplist);
187 rs->rs_pid = first_p->p_pid;
188 LIST_FOREACH(p2, &reap->p_reaplist, p_reapsibling) {
189 if (proc_realparent(p2) == reap)
190 rs->rs_children++;
191 rs->rs_descendants++;
192 }
193 } else {
194 rs->rs_pid = -1;
195 }
196 return (0);
197 }
198
199 static int
reap_getpids(struct thread * td,struct proc * p,struct procctl_reaper_pids * rp)200 reap_getpids(struct thread *td, struct proc *p, struct procctl_reaper_pids *rp)
201 {
202 struct proc *reap, *p2;
203 struct procctl_reaper_pidinfo *pi, *pip;
204 u_int i, n;
205 int error;
206
207 sx_assert(&proctree_lock, SX_LOCKED);
208 PROC_UNLOCK(p);
209 reap = (p->p_treeflag & P_TREE_REAPER) == 0 ? p->p_reaper : p;
210 n = i = 0;
211 error = 0;
212 LIST_FOREACH(p2, &reap->p_reaplist, p_reapsibling)
213 n++;
214 sx_unlock(&proctree_lock);
215 if (rp->rp_count < n)
216 n = rp->rp_count;
217 pi = malloc(n * sizeof(*pi), M_TEMP, M_WAITOK);
218 sx_slock(&proctree_lock);
219 LIST_FOREACH(p2, &reap->p_reaplist, p_reapsibling) {
220 if (i == n)
221 break;
222 pip = &pi[i];
223 bzero(pip, sizeof(*pip));
224 pip->pi_pid = p2->p_pid;
225 pip->pi_subtree = p2->p_reapsubtree;
226 pip->pi_flags = REAPER_PIDINFO_VALID;
227 if (proc_realparent(p2) == reap)
228 pip->pi_flags |= REAPER_PIDINFO_CHILD;
229 if ((p2->p_treeflag & P_TREE_REAPER) != 0)
230 pip->pi_flags |= REAPER_PIDINFO_REAPER;
231 i++;
232 }
233 sx_sunlock(&proctree_lock);
234 error = copyout(pi, rp->rp_pids, i * sizeof(*pi));
235 free(pi, M_TEMP);
236 sx_slock(&proctree_lock);
237 PROC_LOCK(p);
238 return (error);
239 }
240
241 static void
reap_kill_proc(struct thread * td,struct proc * p2,ksiginfo_t * ksi,struct procctl_reaper_kill * rk,int * error)242 reap_kill_proc(struct thread *td, struct proc *p2, ksiginfo_t *ksi,
243 struct procctl_reaper_kill *rk, int *error)
244 {
245 int error1;
246
247 PROC_LOCK(p2);
248 error1 = p_cansignal(td, p2, rk->rk_sig);
249 if (error1 == 0) {
250 pksignal(p2, rk->rk_sig, ksi);
251 rk->rk_killed++;
252 *error = error1;
253 } else if (*error == ESRCH) {
254 rk->rk_fpid = p2->p_pid;
255 *error = error1;
256 }
257 PROC_UNLOCK(p2);
258 }
259
260 struct reap_kill_tracker {
261 struct proc *parent;
262 TAILQ_ENTRY(reap_kill_tracker) link;
263 };
264
265 TAILQ_HEAD(reap_kill_tracker_head, reap_kill_tracker);
266
267 static void
reap_kill_sched(struct reap_kill_tracker_head * tracker,struct proc * p2)268 reap_kill_sched(struct reap_kill_tracker_head *tracker, struct proc *p2)
269 {
270 struct reap_kill_tracker *t;
271
272 t = malloc(sizeof(struct reap_kill_tracker), M_TEMP, M_WAITOK);
273 t->parent = p2;
274 TAILQ_INSERT_TAIL(tracker, t, link);
275 }
276
277 static int
reap_kill(struct thread * td,struct proc * p,struct procctl_reaper_kill * rk)278 reap_kill(struct thread *td, struct proc *p, struct procctl_reaper_kill *rk)
279 {
280 struct proc *reap, *p2;
281 ksiginfo_t ksi;
282 struct reap_kill_tracker_head tracker;
283 struct reap_kill_tracker *t;
284 int error;
285
286 sx_assert(&proctree_lock, SX_LOCKED);
287 if (IN_CAPABILITY_MODE(td))
288 return (ECAPMODE);
289 if (rk->rk_sig <= 0 || rk->rk_sig > _SIG_MAXSIG ||
290 (rk->rk_flags & ~(REAPER_KILL_CHILDREN |
291 REAPER_KILL_SUBTREE)) != 0 || (rk->rk_flags &
292 (REAPER_KILL_CHILDREN | REAPER_KILL_SUBTREE)) ==
293 (REAPER_KILL_CHILDREN | REAPER_KILL_SUBTREE))
294 return (EINVAL);
295 PROC_UNLOCK(p);
296 reap = (p->p_treeflag & P_TREE_REAPER) == 0 ? p->p_reaper : p;
297 ksiginfo_init(&ksi);
298 ksi.ksi_signo = rk->rk_sig;
299 ksi.ksi_code = SI_USER;
300 ksi.ksi_pid = td->td_proc->p_pid;
301 ksi.ksi_uid = td->td_ucred->cr_ruid;
302 error = ESRCH;
303 rk->rk_killed = 0;
304 rk->rk_fpid = -1;
305 if ((rk->rk_flags & REAPER_KILL_CHILDREN) != 0) {
306 for (p2 = LIST_FIRST(&reap->p_children); p2 != NULL;
307 p2 = LIST_NEXT(p2, p_sibling)) {
308 reap_kill_proc(td, p2, &ksi, rk, &error);
309 /*
310 * Do not end the loop on error, signal
311 * everything we can.
312 */
313 }
314 } else {
315 TAILQ_INIT(&tracker);
316 reap_kill_sched(&tracker, reap);
317 while ((t = TAILQ_FIRST(&tracker)) != NULL) {
318 MPASS((t->parent->p_treeflag & P_TREE_REAPER) != 0);
319 TAILQ_REMOVE(&tracker, t, link);
320 for (p2 = LIST_FIRST(&t->parent->p_reaplist); p2 != NULL;
321 p2 = LIST_NEXT(p2, p_reapsibling)) {
322 if (t->parent == reap &&
323 (rk->rk_flags & REAPER_KILL_SUBTREE) != 0 &&
324 p2->p_reapsubtree != rk->rk_subtree)
325 continue;
326 if ((p2->p_treeflag & P_TREE_REAPER) != 0)
327 reap_kill_sched(&tracker, p2);
328 reap_kill_proc(td, p2, &ksi, rk, &error);
329 }
330 free(t, M_TEMP);
331 }
332 }
333 PROC_LOCK(p);
334 return (error);
335 }
336
337 static int
trace_ctl(struct thread * td,struct proc * p,int state)338 trace_ctl(struct thread *td, struct proc *p, int state)
339 {
340
341 PROC_LOCK_ASSERT(p, MA_OWNED);
342
343 /*
344 * Ktrace changes p_traceflag from or to zero under the
345 * process lock, so the test does not need to acquire ktrace
346 * mutex.
347 */
348 if ((p->p_flag & P_TRACED) != 0 || p->p_traceflag != 0)
349 return (EBUSY);
350
351 switch (state) {
352 case PROC_TRACE_CTL_ENABLE:
353 if (td->td_proc != p)
354 return (EPERM);
355 p->p_flag2 &= ~(P2_NOTRACE | P2_NOTRACE_EXEC);
356 break;
357 case PROC_TRACE_CTL_DISABLE_EXEC:
358 p->p_flag2 |= P2_NOTRACE_EXEC | P2_NOTRACE;
359 break;
360 case PROC_TRACE_CTL_DISABLE:
361 if ((p->p_flag2 & P2_NOTRACE_EXEC) != 0) {
362 KASSERT((p->p_flag2 & P2_NOTRACE) != 0,
363 ("dandling P2_NOTRACE_EXEC"));
364 if (td->td_proc != p)
365 return (EPERM);
366 p->p_flag2 &= ~P2_NOTRACE_EXEC;
367 } else {
368 p->p_flag2 |= P2_NOTRACE;
369 }
370 break;
371 default:
372 return (EINVAL);
373 }
374 return (0);
375 }
376
377 static int
trace_status(struct thread * td,struct proc * p,int * data)378 trace_status(struct thread *td, struct proc *p, int *data)
379 {
380
381 if ((p->p_flag2 & P2_NOTRACE) != 0) {
382 KASSERT((p->p_flag & P_TRACED) == 0,
383 ("%d traced but tracing disabled", p->p_pid));
384 *data = -1;
385 } else if ((p->p_flag & P_TRACED) != 0) {
386 *data = p->p_pptr->p_pid;
387 } else {
388 *data = 0;
389 }
390 return (0);
391 }
392
393 static int
trapcap_ctl(struct thread * td,struct proc * p,int state)394 trapcap_ctl(struct thread *td, struct proc *p, int state)
395 {
396
397 PROC_LOCK_ASSERT(p, MA_OWNED);
398
399 switch (state) {
400 case PROC_TRAPCAP_CTL_ENABLE:
401 p->p_flag2 |= P2_TRAPCAP;
402 break;
403 case PROC_TRAPCAP_CTL_DISABLE:
404 p->p_flag2 &= ~P2_TRAPCAP;
405 break;
406 default:
407 return (EINVAL);
408 }
409 return (0);
410 }
411
412 static int
trapcap_status(struct thread * td,struct proc * p,int * data)413 trapcap_status(struct thread *td, struct proc *p, int *data)
414 {
415
416 *data = (p->p_flag2 & P2_TRAPCAP) != 0 ? PROC_TRAPCAP_CTL_ENABLE :
417 PROC_TRAPCAP_CTL_DISABLE;
418 return (0);
419 }
420
421 static int
aslr_ctl(struct thread * td,struct proc * p,int state)422 aslr_ctl(struct thread *td, struct proc *p, int state)
423 {
424
425 PROC_LOCK_ASSERT(p, MA_OWNED);
426
427 switch (state) {
428 case PROC_ASLR_FORCE_ENABLE:
429 p->p_flag2 &= ~P2_ASLR_DISABLE;
430 p->p_flag2 |= P2_ASLR_ENABLE;
431 break;
432 case PROC_ASLR_FORCE_DISABLE:
433 p->p_flag2 |= P2_ASLR_DISABLE;
434 p->p_flag2 &= ~P2_ASLR_ENABLE;
435 break;
436 case PROC_ASLR_NOFORCE:
437 p->p_flag2 &= ~(P2_ASLR_ENABLE | P2_ASLR_DISABLE);
438 break;
439 default:
440 return (EINVAL);
441 }
442 return (0);
443 }
444
445 static int
aslr_status(struct thread * td,struct proc * p,int * data)446 aslr_status(struct thread *td, struct proc *p, int *data)
447 {
448 struct vmspace *vm;
449 int d;
450
451 switch (p->p_flag2 & (P2_ASLR_ENABLE | P2_ASLR_DISABLE)) {
452 case 0:
453 d = PROC_ASLR_NOFORCE;
454 break;
455 case P2_ASLR_ENABLE:
456 d = PROC_ASLR_FORCE_ENABLE;
457 break;
458 case P2_ASLR_DISABLE:
459 d = PROC_ASLR_FORCE_DISABLE;
460 break;
461 }
462 if ((p->p_flag & P_WEXIT) == 0) {
463 _PHOLD(p);
464 PROC_UNLOCK(p);
465 vm = vmspace_acquire_ref(p);
466 if (vm != NULL && (vm->vm_map.flags & MAP_ASLR) != 0) {
467 d |= PROC_ASLR_ACTIVE;
468 vmspace_free(vm);
469 }
470 PROC_LOCK(p);
471 _PRELE(p);
472 }
473 *data = d;
474 return (0);
475 }
476
477 static int
stackgap_ctl(struct thread * td,struct proc * p,int state)478 stackgap_ctl(struct thread *td, struct proc *p, int state)
479 {
480 PROC_LOCK_ASSERT(p, MA_OWNED);
481
482 if ((state & ~(PROC_STACKGAP_ENABLE | PROC_STACKGAP_DISABLE |
483 PROC_STACKGAP_ENABLE_EXEC | PROC_STACKGAP_DISABLE_EXEC)) != 0)
484 return (EINVAL);
485 switch (state & (PROC_STACKGAP_ENABLE | PROC_STACKGAP_DISABLE)) {
486 case PROC_STACKGAP_ENABLE:
487 if ((p->p_flag2 & P2_STKGAP_DISABLE) != 0)
488 return (EINVAL);
489 break;
490 case PROC_STACKGAP_DISABLE:
491 p->p_flag2 |= P2_STKGAP_DISABLE;
492 break;
493 case 0:
494 break;
495 default:
496 return (EINVAL);
497 }
498 switch (state & (PROC_STACKGAP_ENABLE_EXEC |
499 PROC_STACKGAP_DISABLE_EXEC)) {
500 case PROC_STACKGAP_ENABLE_EXEC:
501 p->p_flag2 &= ~P2_STKGAP_DISABLE_EXEC;
502 break;
503 case PROC_STACKGAP_DISABLE_EXEC:
504 p->p_flag2 |= P2_STKGAP_DISABLE_EXEC;
505 break;
506 case 0:
507 break;
508 default:
509 return (EINVAL);
510 }
511 return (0);
512 }
513
514 static int
stackgap_status(struct thread * td,struct proc * p,int * data)515 stackgap_status(struct thread *td, struct proc *p, int *data)
516 {
517 PROC_LOCK_ASSERT(p, MA_OWNED);
518
519 *data = (p->p_flag2 & P2_STKGAP_DISABLE) != 0 ? PROC_STACKGAP_DISABLE :
520 PROC_STACKGAP_ENABLE;
521 *data |= (p->p_flag2 & P2_STKGAP_DISABLE_EXEC) != 0 ?
522 PROC_STACKGAP_DISABLE_EXEC : PROC_STACKGAP_ENABLE_EXEC;
523 return (0);
524 }
525
526 #ifndef _SYS_SYSPROTO_H_
527 struct procctl_args {
528 idtype_t idtype;
529 id_t id;
530 int com;
531 void *data;
532 };
533 #endif
534 /* ARGSUSED */
535 int
sys_procctl(struct thread * td,struct procctl_args * uap)536 sys_procctl(struct thread *td, struct procctl_args *uap)
537 {
538 void *data;
539 union {
540 struct procctl_reaper_status rs;
541 struct procctl_reaper_pids rp;
542 struct procctl_reaper_kill rk;
543 } x;
544 int error, error1, flags, signum;
545
546 if (uap->com >= PROC_PROCCTL_MD_MIN)
547 return (cpu_procctl(td, uap->idtype, uap->id,
548 uap->com, uap->data));
549
550 switch (uap->com) {
551 case PROC_ASLR_CTL:
552 case PROC_SPROTECT:
553 case PROC_STACKGAP_CTL:
554 case PROC_TRACE_CTL:
555 case PROC_TRAPCAP_CTL:
556 error = copyin(uap->data, &flags, sizeof(flags));
557 if (error != 0)
558 return (error);
559 data = &flags;
560 break;
561 case PROC_REAP_ACQUIRE:
562 case PROC_REAP_RELEASE:
563 if (uap->data != NULL)
564 return (EINVAL);
565 data = NULL;
566 break;
567 case PROC_REAP_STATUS:
568 data = &x.rs;
569 break;
570 case PROC_REAP_GETPIDS:
571 error = copyin(uap->data, &x.rp, sizeof(x.rp));
572 if (error != 0)
573 return (error);
574 data = &x.rp;
575 break;
576 case PROC_REAP_KILL:
577 error = copyin(uap->data, &x.rk, sizeof(x.rk));
578 if (error != 0)
579 return (error);
580 data = &x.rk;
581 break;
582 case PROC_ASLR_STATUS:
583 case PROC_STACKGAP_STATUS:
584 case PROC_TRACE_STATUS:
585 case PROC_TRAPCAP_STATUS:
586 data = &flags;
587 break;
588 case PROC_PDEATHSIG_CTL:
589 error = copyin(uap->data, &signum, sizeof(signum));
590 if (error != 0)
591 return (error);
592 data = &signum;
593 break;
594 case PROC_PDEATHSIG_STATUS:
595 data = &signum;
596 break;
597 default:
598 return (EINVAL);
599 }
600 error = kern_procctl(td, uap->idtype, uap->id, uap->com, data);
601 switch (uap->com) {
602 case PROC_REAP_STATUS:
603 if (error == 0)
604 error = copyout(&x.rs, uap->data, sizeof(x.rs));
605 break;
606 case PROC_REAP_KILL:
607 error1 = copyout(&x.rk, uap->data, sizeof(x.rk));
608 if (error == 0)
609 error = error1;
610 break;
611 case PROC_ASLR_STATUS:
612 case PROC_STACKGAP_STATUS:
613 case PROC_TRACE_STATUS:
614 case PROC_TRAPCAP_STATUS:
615 if (error == 0)
616 error = copyout(&flags, uap->data, sizeof(flags));
617 break;
618 case PROC_PDEATHSIG_STATUS:
619 if (error == 0)
620 error = copyout(&signum, uap->data, sizeof(signum));
621 break;
622 }
623 return (error);
624 }
625
626 static int
kern_procctl_single(struct thread * td,struct proc * p,int com,void * data)627 kern_procctl_single(struct thread *td, struct proc *p, int com, void *data)
628 {
629
630 PROC_LOCK_ASSERT(p, MA_OWNED);
631 switch (com) {
632 case PROC_ASLR_CTL:
633 return (aslr_ctl(td, p, *(int *)data));
634 case PROC_ASLR_STATUS:
635 return (aslr_status(td, p, data));
636 case PROC_SPROTECT:
637 return (protect_set(td, p, *(int *)data));
638 case PROC_STACKGAP_CTL:
639 return (stackgap_ctl(td, p, *(int *)data));
640 case PROC_STACKGAP_STATUS:
641 return (stackgap_status(td, p, data));
642 case PROC_REAP_ACQUIRE:
643 return (reap_acquire(td, p));
644 case PROC_REAP_RELEASE:
645 return (reap_release(td, p));
646 case PROC_REAP_STATUS:
647 return (reap_status(td, p, data));
648 case PROC_REAP_GETPIDS:
649 return (reap_getpids(td, p, data));
650 case PROC_REAP_KILL:
651 return (reap_kill(td, p, data));
652 case PROC_TRACE_CTL:
653 return (trace_ctl(td, p, *(int *)data));
654 case PROC_TRACE_STATUS:
655 return (trace_status(td, p, data));
656 case PROC_TRAPCAP_CTL:
657 return (trapcap_ctl(td, p, *(int *)data));
658 case PROC_TRAPCAP_STATUS:
659 return (trapcap_status(td, p, data));
660 default:
661 return (EINVAL);
662 }
663 }
664
665 int
kern_procctl(struct thread * td,idtype_t idtype,id_t id,int com,void * data)666 kern_procctl(struct thread *td, idtype_t idtype, id_t id, int com, void *data)
667 {
668 struct pgrp *pg;
669 struct proc *p;
670 int error, first_error, ok;
671 int signum;
672 bool tree_locked;
673
674 switch (com) {
675 case PROC_ASLR_CTL:
676 case PROC_ASLR_STATUS:
677 case PROC_REAP_ACQUIRE:
678 case PROC_REAP_RELEASE:
679 case PROC_REAP_STATUS:
680 case PROC_REAP_GETPIDS:
681 case PROC_REAP_KILL:
682 case PROC_STACKGAP_CTL:
683 case PROC_STACKGAP_STATUS:
684 case PROC_TRACE_STATUS:
685 case PROC_TRAPCAP_STATUS:
686 case PROC_PDEATHSIG_CTL:
687 case PROC_PDEATHSIG_STATUS:
688 if (idtype != P_PID)
689 return (EINVAL);
690 }
691
692 switch (com) {
693 case PROC_PDEATHSIG_CTL:
694 signum = *(int *)data;
695 p = td->td_proc;
696 if ((id != 0 && id != p->p_pid) ||
697 (signum != 0 && !_SIG_VALID(signum)))
698 return (EINVAL);
699 PROC_LOCK(p);
700 p->p_pdeathsig = signum;
701 PROC_UNLOCK(p);
702 return (0);
703 case PROC_PDEATHSIG_STATUS:
704 p = td->td_proc;
705 if (id != 0 && id != p->p_pid)
706 return (EINVAL);
707 PROC_LOCK(p);
708 *(int *)data = p->p_pdeathsig;
709 PROC_UNLOCK(p);
710 return (0);
711 }
712
713 switch (com) {
714 case PROC_SPROTECT:
715 case PROC_REAP_STATUS:
716 case PROC_REAP_GETPIDS:
717 case PROC_REAP_KILL:
718 case PROC_TRACE_CTL:
719 case PROC_TRAPCAP_CTL:
720 sx_slock(&proctree_lock);
721 tree_locked = true;
722 break;
723 case PROC_REAP_ACQUIRE:
724 case PROC_REAP_RELEASE:
725 sx_xlock(&proctree_lock);
726 tree_locked = true;
727 break;
728 case PROC_ASLR_CTL:
729 case PROC_ASLR_STATUS:
730 case PROC_STACKGAP_CTL:
731 case PROC_STACKGAP_STATUS:
732 case PROC_TRACE_STATUS:
733 case PROC_TRAPCAP_STATUS:
734 tree_locked = false;
735 break;
736 default:
737 return (EINVAL);
738 }
739
740 switch (idtype) {
741 case P_PID:
742 p = pfind(id);
743 if (p == NULL) {
744 error = ESRCH;
745 break;
746 }
747 error = p_cansee(td, p);
748 if (error == 0)
749 error = kern_procctl_single(td, p, com, data);
750 PROC_UNLOCK(p);
751 break;
752 case P_PGID:
753 /*
754 * Attempt to apply the operation to all members of the
755 * group. Ignore processes in the group that can't be
756 * seen. Ignore errors so long as at least one process is
757 * able to complete the request successfully.
758 */
759 pg = pgfind(id);
760 if (pg == NULL) {
761 error = ESRCH;
762 break;
763 }
764 PGRP_UNLOCK(pg);
765 ok = 0;
766 first_error = 0;
767 LIST_FOREACH(p, &pg->pg_members, p_pglist) {
768 PROC_LOCK(p);
769 if (p->p_state == PRS_NEW || p_cansee(td, p) != 0) {
770 PROC_UNLOCK(p);
771 continue;
772 }
773 error = kern_procctl_single(td, p, com, data);
774 PROC_UNLOCK(p);
775 if (error == 0)
776 ok = 1;
777 else if (first_error == 0)
778 first_error = error;
779 }
780 if (ok)
781 error = 0;
782 else if (first_error != 0)
783 error = first_error;
784 else
785 /*
786 * Was not able to see any processes in the
787 * process group.
788 */
789 error = ESRCH;
790 break;
791 default:
792 error = EINVAL;
793 break;
794 }
795 if (tree_locked)
796 sx_unlock(&proctree_lock);
797 return (error);
798 }
799