sys_ptrace_common.c revision 1.26 1 1.26 christos /* $NetBSD: sys_ptrace_common.c,v 1.26 2017/12/09 05:18:45 christos Exp $ */
2 1.1 pgoyette
3 1.1 pgoyette /*-
4 1.1 pgoyette * Copyright (c) 2008, 2009 The NetBSD Foundation, Inc.
5 1.1 pgoyette * All rights reserved.
6 1.1 pgoyette *
7 1.1 pgoyette * This code is derived from software contributed to The NetBSD Foundation
8 1.1 pgoyette * by Andrew Doran.
9 1.1 pgoyette *
10 1.1 pgoyette * Redistribution and use in source and binary forms, with or without
11 1.1 pgoyette * modification, are permitted provided that the following conditions
12 1.1 pgoyette * are met:
13 1.1 pgoyette * 1. Redistributions of source code must retain the above copyright
14 1.1 pgoyette * notice, this list of conditions and the following disclaimer.
15 1.1 pgoyette * 2. Redistributions in binary form must reproduce the above copyright
16 1.1 pgoyette * notice, this list of conditions and the following disclaimer in the
17 1.1 pgoyette * documentation and/or other materials provided with the distribution.
18 1.1 pgoyette *
19 1.1 pgoyette * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
20 1.1 pgoyette * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
21 1.1 pgoyette * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 1.1 pgoyette * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
23 1.1 pgoyette * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
24 1.1 pgoyette * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
25 1.1 pgoyette * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
26 1.1 pgoyette * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
27 1.1 pgoyette * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
28 1.1 pgoyette * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
29 1.1 pgoyette * POSSIBILITY OF SUCH DAMAGE.
30 1.1 pgoyette */
31 1.1 pgoyette
32 1.1 pgoyette /*-
33 1.1 pgoyette * Copyright (c) 1982, 1986, 1989, 1993
34 1.1 pgoyette * The Regents of the University of California. All rights reserved.
35 1.1 pgoyette * (c) UNIX System Laboratories, Inc.
36 1.1 pgoyette * All or some portions of this file are derived from material licensed
37 1.1 pgoyette * to the University of California by American Telephone and Telegraph
38 1.1 pgoyette * Co. or Unix System Laboratories, Inc. and are reproduced herein with
39 1.1 pgoyette * the permission of UNIX System Laboratories, Inc.
40 1.1 pgoyette *
41 1.1 pgoyette * This code is derived from software contributed to Berkeley by
42 1.1 pgoyette * Jan-Simon Pendry.
43 1.1 pgoyette *
44 1.1 pgoyette * Redistribution and use in source and binary forms, with or without
45 1.1 pgoyette * modification, are permitted provided that the following conditions
46 1.1 pgoyette * are met:
47 1.1 pgoyette * 1. Redistributions of source code must retain the above copyright
48 1.1 pgoyette * notice, this list of conditions and the following disclaimer.
49 1.1 pgoyette * 2. Redistributions in binary form must reproduce the above copyright
50 1.1 pgoyette * notice, this list of conditions and the following disclaimer in the
51 1.1 pgoyette * documentation and/or other materials provided with the distribution.
52 1.1 pgoyette * 3. Neither the name of the University nor the names of its contributors
53 1.1 pgoyette * may be used to endorse or promote products derived from this software
54 1.1 pgoyette * without specific prior written permission.
55 1.1 pgoyette *
56 1.1 pgoyette * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
57 1.1 pgoyette * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
58 1.1 pgoyette * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
59 1.1 pgoyette * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
60 1.1 pgoyette * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
61 1.1 pgoyette * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
62 1.1 pgoyette * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
63 1.1 pgoyette * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
64 1.1 pgoyette * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
65 1.1 pgoyette * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
66 1.1 pgoyette * SUCH DAMAGE.
67 1.1 pgoyette *
68 1.1 pgoyette * from: @(#)sys_process.c 8.1 (Berkeley) 6/10/93
69 1.1 pgoyette */
70 1.1 pgoyette
71 1.1 pgoyette /*-
72 1.1 pgoyette * Copyright (c) 1993 Jan-Simon Pendry.
73 1.1 pgoyette * Copyright (c) 1994 Christopher G. Demetriou. All rights reserved.
74 1.1 pgoyette *
75 1.1 pgoyette * This code is derived from software contributed to Berkeley by
76 1.1 pgoyette * Jan-Simon Pendry.
77 1.1 pgoyette *
78 1.1 pgoyette * Redistribution and use in source and binary forms, with or without
79 1.1 pgoyette * modification, are permitted provided that the following conditions
80 1.1 pgoyette * are met:
81 1.1 pgoyette * 1. Redistributions of source code must retain the above copyright
82 1.1 pgoyette * notice, this list of conditions and the following disclaimer.
83 1.1 pgoyette * 2. Redistributions in binary form must reproduce the above copyright
84 1.1 pgoyette * notice, this list of conditions and the following disclaimer in the
85 1.1 pgoyette * documentation and/or other materials provided with the distribution.
86 1.1 pgoyette * 3. All advertising materials mentioning features or use of this software
87 1.1 pgoyette * must display the following acknowledgement:
88 1.1 pgoyette * This product includes software developed by the University of
89 1.1 pgoyette * California, Berkeley and its contributors.
90 1.1 pgoyette * 4. Neither the name of the University nor the names of its contributors
91 1.1 pgoyette * may be used to endorse or promote products derived from this software
92 1.1 pgoyette * without specific prior written permission.
93 1.1 pgoyette *
94 1.1 pgoyette * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
95 1.1 pgoyette * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
96 1.1 pgoyette * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
97 1.1 pgoyette * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
98 1.1 pgoyette * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
99 1.1 pgoyette * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
100 1.1 pgoyette * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
101 1.1 pgoyette * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
102 1.1 pgoyette * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
103 1.1 pgoyette * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
104 1.1 pgoyette * SUCH DAMAGE.
105 1.1 pgoyette *
106 1.1 pgoyette * from: @(#)sys_process.c 8.1 (Berkeley) 6/10/93
107 1.1 pgoyette */
108 1.1 pgoyette
109 1.1 pgoyette /*
110 1.1 pgoyette * References:
111 1.1 pgoyette * (1) Bach's "The Design of the UNIX Operating System",
112 1.1 pgoyette * (2) sys/miscfs/procfs from UCB's 4.4BSD-Lite distribution,
113 1.1 pgoyette * (3) the "4.4BSD Programmer's Reference Manual" published
114 1.1 pgoyette * by USENIX and O'Reilly & Associates.
115 1.1 pgoyette * The 4.4BSD PRM does a reasonably good job of documenting what the various
116 1.1 pgoyette * ptrace() requests should actually do, and its text is quoted several times
117 1.1 pgoyette * in this file.
118 1.1 pgoyette */
119 1.1 pgoyette
120 1.1 pgoyette #include <sys/cdefs.h>
121 1.26 christos __KERNEL_RCSID(0, "$NetBSD: sys_ptrace_common.c,v 1.26 2017/12/09 05:18:45 christos Exp $");
122 1.1 pgoyette
123 1.1 pgoyette #ifdef _KERNEL_OPT
124 1.1 pgoyette #include "opt_ptrace.h"
125 1.1 pgoyette #include "opt_ktrace.h"
126 1.1 pgoyette #include "opt_pax.h"
127 1.24 christos #include "opt_compat_netbsd32.h"
128 1.1 pgoyette #endif
129 1.1 pgoyette
130 1.25 christos #if defined(__HAVE_COMPAT_NETBSD32) && !defined(COMPAT_NETBSD32) \
131 1.25 christos && !defined(_RUMPKERNEL)
132 1.25 christos #define COMPAT_NETBSD32
133 1.25 christos #endif
134 1.25 christos
135 1.1 pgoyette #include <sys/param.h>
136 1.1 pgoyette #include <sys/systm.h>
137 1.1 pgoyette #include <sys/proc.h>
138 1.1 pgoyette #include <sys/errno.h>
139 1.1 pgoyette #include <sys/exec.h>
140 1.1 pgoyette #include <sys/pax.h>
141 1.1 pgoyette #include <sys/ptrace.h>
142 1.1 pgoyette #include <sys/uio.h>
143 1.1 pgoyette #include <sys/ras.h>
144 1.1 pgoyette #include <sys/kmem.h>
145 1.1 pgoyette #include <sys/kauth.h>
146 1.1 pgoyette #include <sys/mount.h>
147 1.1 pgoyette #include <sys/syscallargs.h>
148 1.1 pgoyette #include <sys/module.h>
149 1.1 pgoyette #include <sys/condvar.h>
150 1.1 pgoyette #include <sys/mutex.h>
151 1.1 pgoyette
152 1.1 pgoyette #include <uvm/uvm_extern.h>
153 1.1 pgoyette
154 1.1 pgoyette #include <machine/reg.h>
155 1.1 pgoyette
156 1.1 pgoyette #ifdef PTRACE
157 1.1 pgoyette
158 1.1 pgoyette # ifdef DEBUG
159 1.1 pgoyette # define DPRINTF(a) uprintf a
160 1.1 pgoyette # else
161 1.1 pgoyette # define DPRINTF(a)
162 1.1 pgoyette # endif
163 1.1 pgoyette
164 1.1 pgoyette static kauth_listener_t ptrace_listener;
165 1.1 pgoyette static int process_auxv_offset(struct proc *, struct uio *);
166 1.1 pgoyette
167 1.1 pgoyette #if 0
168 1.1 pgoyette static int ptrace_cbref;
169 1.1 pgoyette static kmutex_t ptrace_mtx;
170 1.1 pgoyette static kcondvar_t ptrace_cv;
171 1.1 pgoyette #endif
172 1.1 pgoyette
173 1.1 pgoyette static int
174 1.1 pgoyette ptrace_listener_cb(kauth_cred_t cred, kauth_action_t action, void *cookie,
175 1.1 pgoyette void *arg0, void *arg1, void *arg2, void *arg3)
176 1.1 pgoyette {
177 1.1 pgoyette struct proc *p;
178 1.1 pgoyette int result;
179 1.1 pgoyette
180 1.1 pgoyette result = KAUTH_RESULT_DEFER;
181 1.1 pgoyette p = arg0;
182 1.1 pgoyette
183 1.1 pgoyette #if 0
184 1.1 pgoyette mutex_enter(&ptrace_mtx);
185 1.1 pgoyette ptrace_cbref++;
186 1.1 pgoyette mutex_exit(&ptrace_mtx);
187 1.1 pgoyette #endif
188 1.1 pgoyette if (action != KAUTH_PROCESS_PTRACE)
189 1.1 pgoyette goto out;
190 1.1 pgoyette
191 1.1 pgoyette switch ((u_long)arg1) {
192 1.1 pgoyette case PT_TRACE_ME:
193 1.1 pgoyette case PT_ATTACH:
194 1.1 pgoyette case PT_WRITE_I:
195 1.1 pgoyette case PT_WRITE_D:
196 1.1 pgoyette case PT_READ_I:
197 1.1 pgoyette case PT_READ_D:
198 1.1 pgoyette case PT_IO:
199 1.1 pgoyette #ifdef PT_GETREGS
200 1.1 pgoyette case PT_GETREGS:
201 1.1 pgoyette #endif
202 1.1 pgoyette #ifdef PT_SETREGS
203 1.1 pgoyette case PT_SETREGS:
204 1.1 pgoyette #endif
205 1.1 pgoyette #ifdef PT_GETFPREGS
206 1.1 pgoyette case PT_GETFPREGS:
207 1.1 pgoyette #endif
208 1.1 pgoyette #ifdef PT_SETFPREGS
209 1.1 pgoyette case PT_SETFPREGS:
210 1.1 pgoyette #endif
211 1.17 kamil #ifdef PT_GETDBREGS
212 1.17 kamil case PT_GETDBREGS:
213 1.17 kamil #endif
214 1.17 kamil #ifdef PT_SETDBREGS
215 1.17 kamil case PT_SETDBREGS:
216 1.7 kamil #endif
217 1.1 pgoyette case PT_SET_EVENT_MASK:
218 1.1 pgoyette case PT_GET_EVENT_MASK:
219 1.1 pgoyette case PT_GET_PROCESS_STATE:
220 1.8 kamil case PT_SET_SIGINFO:
221 1.8 kamil case PT_GET_SIGINFO:
222 1.14 kamil case PT_SET_SIGMASK:
223 1.14 kamil case PT_GET_SIGMASK:
224 1.1 pgoyette #ifdef __HAVE_PTRACE_MACHDEP
225 1.1 pgoyette PTRACE_MACHDEP_REQUEST_CASES
226 1.1 pgoyette #endif
227 1.1 pgoyette if (kauth_cred_getuid(cred) != kauth_cred_getuid(p->p_cred) ||
228 1.1 pgoyette ISSET(p->p_flag, PK_SUGID)) {
229 1.1 pgoyette break;
230 1.1 pgoyette }
231 1.1 pgoyette
232 1.1 pgoyette result = KAUTH_RESULT_ALLOW;
233 1.1 pgoyette
234 1.1 pgoyette break;
235 1.1 pgoyette
236 1.1 pgoyette #ifdef PT_STEP
237 1.1 pgoyette case PT_STEP:
238 1.21 kamil case PT_SETSTEP:
239 1.21 kamil case PT_CLEARSTEP:
240 1.1 pgoyette #endif
241 1.1 pgoyette case PT_CONTINUE:
242 1.1 pgoyette case PT_KILL:
243 1.1 pgoyette case PT_DETACH:
244 1.1 pgoyette case PT_LWPINFO:
245 1.1 pgoyette case PT_SYSCALL:
246 1.1 pgoyette case PT_SYSCALLEMU:
247 1.1 pgoyette case PT_DUMPCORE:
248 1.15 kamil case PT_RESUME:
249 1.15 kamil case PT_SUSPEND:
250 1.1 pgoyette result = KAUTH_RESULT_ALLOW;
251 1.1 pgoyette break;
252 1.1 pgoyette
253 1.1 pgoyette default:
254 1.1 pgoyette break;
255 1.1 pgoyette }
256 1.1 pgoyette
257 1.1 pgoyette out:
258 1.1 pgoyette #if 0
259 1.1 pgoyette mutex_enter(&ptrace_mtx);
260 1.1 pgoyette if (--ptrace_cbref == 0)
261 1.1 pgoyette cv_broadcast(&ptrace_cv);
262 1.1 pgoyette mutex_exit(&ptrace_mtx);
263 1.1 pgoyette #endif
264 1.1 pgoyette
265 1.1 pgoyette return result;
266 1.1 pgoyette }
267 1.1 pgoyette
268 1.1 pgoyette int
269 1.1 pgoyette ptrace_init(void)
270 1.1 pgoyette {
271 1.1 pgoyette
272 1.1 pgoyette #if 0
273 1.1 pgoyette mutex_init(&ptrace_mtx, MUTEX_DEFAULT, IPL_NONE);
274 1.1 pgoyette cv_init(&ptrace_cv, "ptracecb");
275 1.1 pgoyette ptrace_cbref = 0;
276 1.1 pgoyette #endif
277 1.1 pgoyette ptrace_listener = kauth_listen_scope(KAUTH_SCOPE_PROCESS,
278 1.1 pgoyette ptrace_listener_cb, NULL);
279 1.1 pgoyette return 0;
280 1.1 pgoyette }
281 1.1 pgoyette
282 1.1 pgoyette int
283 1.1 pgoyette ptrace_fini(void)
284 1.1 pgoyette {
285 1.1 pgoyette
286 1.1 pgoyette kauth_unlisten_scope(ptrace_listener);
287 1.1 pgoyette
288 1.1 pgoyette #if 0
289 1.1 pgoyette /* Make sure no-one is executing our kauth listener */
290 1.1 pgoyette
291 1.1 pgoyette mutex_enter(&ptrace_mtx);
292 1.1 pgoyette while (ptrace_cbref != 0)
293 1.1 pgoyette cv_wait(&ptrace_cv, &ptrace_mtx);
294 1.1 pgoyette mutex_exit(&ptrace_mtx);
295 1.1 pgoyette mutex_destroy(&ptrace_mtx);
296 1.1 pgoyette cv_destroy(&ptrace_cv);
297 1.1 pgoyette #endif
298 1.1 pgoyette
299 1.1 pgoyette return 0;
300 1.1 pgoyette }
301 1.1 pgoyette
302 1.1 pgoyette int
303 1.1 pgoyette do_ptrace(struct ptrace_methods *ptm, struct lwp *l, int req, pid_t pid,
304 1.1 pgoyette void *addr, int data, register_t *retval)
305 1.1 pgoyette {
306 1.1 pgoyette struct proc *p = l->l_proc;
307 1.1 pgoyette struct lwp *lt;
308 1.1 pgoyette struct lwp *lt2;
309 1.1 pgoyette struct proc *t; /* target process */
310 1.1 pgoyette struct uio uio;
311 1.1 pgoyette struct iovec iov;
312 1.1 pgoyette struct ptrace_io_desc piod;
313 1.1 pgoyette struct ptrace_event pe;
314 1.1 pgoyette struct ptrace_state ps;
315 1.1 pgoyette struct ptrace_lwpinfo pl;
316 1.8 kamil struct ptrace_siginfo psi;
317 1.1 pgoyette struct vmspace *vm;
318 1.1 pgoyette int error, write, tmp, pheld;
319 1.1 pgoyette int signo = 0;
320 1.1 pgoyette int resume_all;
321 1.1 pgoyette ksiginfo_t ksi;
322 1.1 pgoyette char *path;
323 1.1 pgoyette int len = 0;
324 1.1 pgoyette error = 0;
325 1.1 pgoyette
326 1.1 pgoyette /*
327 1.1 pgoyette * If attaching or detaching, we need to get a write hold on the
328 1.1 pgoyette * proclist lock so that we can re-parent the target process.
329 1.1 pgoyette */
330 1.1 pgoyette mutex_enter(proc_lock);
331 1.1 pgoyette
332 1.1 pgoyette /* "A foolish consistency..." XXX */
333 1.1 pgoyette if (req == PT_TRACE_ME) {
334 1.1 pgoyette t = p;
335 1.1 pgoyette mutex_enter(t->p_lock);
336 1.1 pgoyette } else {
337 1.1 pgoyette /* Find the process we're supposed to be operating on. */
338 1.1 pgoyette t = proc_find(pid);
339 1.1 pgoyette if (t == NULL) {
340 1.1 pgoyette mutex_exit(proc_lock);
341 1.1 pgoyette return ESRCH;
342 1.1 pgoyette }
343 1.1 pgoyette
344 1.1 pgoyette /* XXX-elad */
345 1.1 pgoyette mutex_enter(t->p_lock);
346 1.1 pgoyette error = kauth_authorize_process(l->l_cred, KAUTH_PROCESS_CANSEE,
347 1.1 pgoyette t, KAUTH_ARG(KAUTH_REQ_PROCESS_CANSEE_ENTRY), NULL, NULL);
348 1.1 pgoyette if (error) {
349 1.1 pgoyette mutex_exit(proc_lock);
350 1.1 pgoyette mutex_exit(t->p_lock);
351 1.1 pgoyette return ESRCH;
352 1.1 pgoyette }
353 1.1 pgoyette }
354 1.1 pgoyette
355 1.1 pgoyette /*
356 1.1 pgoyette * Grab a reference on the process to prevent it from execing or
357 1.1 pgoyette * exiting.
358 1.1 pgoyette */
359 1.1 pgoyette if (!rw_tryenter(&t->p_reflock, RW_READER)) {
360 1.1 pgoyette mutex_exit(proc_lock);
361 1.1 pgoyette mutex_exit(t->p_lock);
362 1.1 pgoyette return EBUSY;
363 1.1 pgoyette }
364 1.1 pgoyette
365 1.1 pgoyette /* Make sure we can operate on it. */
366 1.1 pgoyette switch (req) {
367 1.1 pgoyette case PT_TRACE_ME:
368 1.1 pgoyette /* Saying that you're being traced is always legal. */
369 1.1 pgoyette break;
370 1.1 pgoyette
371 1.1 pgoyette case PT_ATTACH:
372 1.1 pgoyette /*
373 1.1 pgoyette * You can't attach to a process if:
374 1.1 pgoyette * (1) it's the process that's doing the attaching,
375 1.1 pgoyette */
376 1.1 pgoyette if (t->p_pid == p->p_pid) {
377 1.1 pgoyette error = EINVAL;
378 1.1 pgoyette break;
379 1.1 pgoyette }
380 1.1 pgoyette
381 1.1 pgoyette /*
382 1.1 pgoyette * (2) it's a system process
383 1.1 pgoyette */
384 1.1 pgoyette if (t->p_flag & PK_SYSTEM) {
385 1.1 pgoyette error = EPERM;
386 1.1 pgoyette break;
387 1.1 pgoyette }
388 1.1 pgoyette
389 1.1 pgoyette /*
390 1.1 pgoyette * (3) it's already being traced, or
391 1.1 pgoyette */
392 1.1 pgoyette if (ISSET(t->p_slflag, PSL_TRACED)) {
393 1.1 pgoyette error = EBUSY;
394 1.1 pgoyette break;
395 1.1 pgoyette }
396 1.1 pgoyette
397 1.1 pgoyette /*
398 1.1 pgoyette * (4) the tracer is chrooted, and its root directory is
399 1.1 pgoyette * not at or above the root directory of the tracee
400 1.1 pgoyette */
401 1.1 pgoyette mutex_exit(t->p_lock); /* XXXSMP */
402 1.1 pgoyette tmp = proc_isunder(t, l);
403 1.1 pgoyette mutex_enter(t->p_lock); /* XXXSMP */
404 1.1 pgoyette if (!tmp) {
405 1.1 pgoyette error = EPERM;
406 1.1 pgoyette break;
407 1.1 pgoyette }
408 1.1 pgoyette break;
409 1.1 pgoyette
410 1.1 pgoyette case PT_READ_I:
411 1.1 pgoyette case PT_READ_D:
412 1.1 pgoyette case PT_WRITE_I:
413 1.1 pgoyette case PT_WRITE_D:
414 1.1 pgoyette case PT_IO:
415 1.13 kamil case PT_SET_SIGINFO:
416 1.13 kamil case PT_GET_SIGINFO:
417 1.14 kamil case PT_SET_SIGMASK:
418 1.14 kamil case PT_GET_SIGMASK:
419 1.1 pgoyette #ifdef PT_GETREGS
420 1.1 pgoyette case PT_GETREGS:
421 1.1 pgoyette #endif
422 1.1 pgoyette #ifdef PT_SETREGS
423 1.1 pgoyette case PT_SETREGS:
424 1.1 pgoyette #endif
425 1.1 pgoyette #ifdef PT_GETFPREGS
426 1.1 pgoyette case PT_GETFPREGS:
427 1.1 pgoyette #endif
428 1.1 pgoyette #ifdef PT_SETFPREGS
429 1.1 pgoyette case PT_SETFPREGS:
430 1.1 pgoyette #endif
431 1.17 kamil #ifdef PT_GETDBREGS
432 1.17 kamil case PT_GETDBREGS:
433 1.17 kamil #endif
434 1.17 kamil #ifdef PT_SETDBREGS
435 1.17 kamil case PT_SETDBREGS:
436 1.7 kamil #endif
437 1.1 pgoyette #ifdef __HAVE_PTRACE_MACHDEP
438 1.1 pgoyette PTRACE_MACHDEP_REQUEST_CASES
439 1.1 pgoyette #endif
440 1.1 pgoyette /*
441 1.1 pgoyette * You can't read/write the memory or registers of a process
442 1.1 pgoyette * if the tracer is chrooted, and its root directory is not at
443 1.1 pgoyette * or above the root directory of the tracee.
444 1.1 pgoyette */
445 1.1 pgoyette mutex_exit(t->p_lock); /* XXXSMP */
446 1.1 pgoyette tmp = proc_isunder(t, l);
447 1.1 pgoyette mutex_enter(t->p_lock); /* XXXSMP */
448 1.1 pgoyette if (!tmp) {
449 1.1 pgoyette error = EPERM;
450 1.1 pgoyette break;
451 1.1 pgoyette }
452 1.1 pgoyette /*FALLTHROUGH*/
453 1.1 pgoyette
454 1.1 pgoyette case PT_CONTINUE:
455 1.1 pgoyette case PT_KILL:
456 1.1 pgoyette case PT_DETACH:
457 1.1 pgoyette case PT_LWPINFO:
458 1.1 pgoyette case PT_SYSCALL:
459 1.1 pgoyette case PT_SYSCALLEMU:
460 1.1 pgoyette case PT_DUMPCORE:
461 1.1 pgoyette #ifdef PT_STEP
462 1.1 pgoyette case PT_STEP:
463 1.21 kamil case PT_SETSTEP:
464 1.21 kamil case PT_CLEARSTEP:
465 1.1 pgoyette #endif
466 1.1 pgoyette case PT_SET_EVENT_MASK:
467 1.1 pgoyette case PT_GET_EVENT_MASK:
468 1.1 pgoyette case PT_GET_PROCESS_STATE:
469 1.15 kamil case PT_RESUME:
470 1.15 kamil case PT_SUSPEND:
471 1.1 pgoyette /*
472 1.1 pgoyette * You can't do what you want to the process if:
473 1.1 pgoyette * (1) It's not being traced at all,
474 1.1 pgoyette */
475 1.1 pgoyette if (!ISSET(t->p_slflag, PSL_TRACED)) {
476 1.1 pgoyette error = EPERM;
477 1.1 pgoyette break;
478 1.1 pgoyette }
479 1.1 pgoyette
480 1.1 pgoyette /*
481 1.23 kamil * (2) it's not being traced by _you_, or
482 1.1 pgoyette */
483 1.1 pgoyette if (t->p_pptr != p) {
484 1.1 pgoyette DPRINTF(("parent %d != %d\n", t->p_pptr->p_pid,
485 1.1 pgoyette p->p_pid));
486 1.1 pgoyette error = EBUSY;
487 1.1 pgoyette break;
488 1.1 pgoyette }
489 1.1 pgoyette
490 1.1 pgoyette /*
491 1.23 kamil * (3) it's not currently stopped.
492 1.1 pgoyette */
493 1.1 pgoyette if (t->p_stat != SSTOP || !t->p_waited /* XXXSMP */) {
494 1.1 pgoyette DPRINTF(("stat %d flag %d\n", t->p_stat,
495 1.1 pgoyette !t->p_waited));
496 1.1 pgoyette error = EBUSY;
497 1.1 pgoyette break;
498 1.1 pgoyette }
499 1.1 pgoyette break;
500 1.1 pgoyette
501 1.1 pgoyette default: /* It was not a legal request. */
502 1.1 pgoyette error = EINVAL;
503 1.1 pgoyette break;
504 1.1 pgoyette }
505 1.1 pgoyette
506 1.1 pgoyette if (error == 0) {
507 1.1 pgoyette error = kauth_authorize_process(l->l_cred,
508 1.1 pgoyette KAUTH_PROCESS_PTRACE, t, KAUTH_ARG(req),
509 1.1 pgoyette NULL, NULL);
510 1.1 pgoyette }
511 1.1 pgoyette if (error == 0) {
512 1.1 pgoyette lt = lwp_find_first(t);
513 1.1 pgoyette if (lt == NULL)
514 1.1 pgoyette error = ESRCH;
515 1.1 pgoyette }
516 1.1 pgoyette
517 1.1 pgoyette if (error != 0) {
518 1.1 pgoyette mutex_exit(proc_lock);
519 1.1 pgoyette mutex_exit(t->p_lock);
520 1.1 pgoyette rw_exit(&t->p_reflock);
521 1.1 pgoyette return error;
522 1.1 pgoyette }
523 1.1 pgoyette
524 1.1 pgoyette /* Do single-step fixup if needed. */
525 1.1 pgoyette FIX_SSTEP(t);
526 1.1 pgoyette KASSERT(lt != NULL);
527 1.1 pgoyette lwp_addref(lt);
528 1.1 pgoyette
529 1.1 pgoyette /*
530 1.1 pgoyette * Which locks do we need held? XXX Ugly.
531 1.1 pgoyette */
532 1.1 pgoyette switch (req) {
533 1.1 pgoyette #ifdef PT_STEP
534 1.1 pgoyette case PT_STEP:
535 1.1 pgoyette #endif
536 1.1 pgoyette case PT_CONTINUE:
537 1.1 pgoyette case PT_DETACH:
538 1.1 pgoyette case PT_KILL:
539 1.1 pgoyette case PT_SYSCALL:
540 1.1 pgoyette case PT_SYSCALLEMU:
541 1.1 pgoyette case PT_ATTACH:
542 1.1 pgoyette case PT_TRACE_ME:
543 1.1 pgoyette pheld = 1;
544 1.1 pgoyette break;
545 1.1 pgoyette default:
546 1.1 pgoyette mutex_exit(proc_lock);
547 1.1 pgoyette mutex_exit(t->p_lock);
548 1.1 pgoyette pheld = 0;
549 1.1 pgoyette break;
550 1.1 pgoyette }
551 1.1 pgoyette
552 1.1 pgoyette /* Now do the operation. */
553 1.1 pgoyette write = 0;
554 1.1 pgoyette *retval = 0;
555 1.1 pgoyette tmp = 0;
556 1.1 pgoyette resume_all = 1;
557 1.1 pgoyette
558 1.1 pgoyette switch (req) {
559 1.1 pgoyette case PT_TRACE_ME:
560 1.1 pgoyette /* Just set the trace flag. */
561 1.1 pgoyette SET(t->p_slflag, PSL_TRACED);
562 1.1 pgoyette t->p_opptr = t->p_pptr;
563 1.1 pgoyette break;
564 1.1 pgoyette
565 1.1 pgoyette case PT_WRITE_I: /* XXX no separate I and D spaces */
566 1.1 pgoyette case PT_WRITE_D:
567 1.1 pgoyette #if defined(__HAVE_RAS)
568 1.1 pgoyette /*
569 1.1 pgoyette * Can't write to a RAS
570 1.1 pgoyette */
571 1.1 pgoyette if (ras_lookup(t, addr) != (void *)-1) {
572 1.1 pgoyette error = EACCES;
573 1.1 pgoyette break;
574 1.1 pgoyette }
575 1.1 pgoyette #endif
576 1.1 pgoyette write = 1;
577 1.1 pgoyette tmp = data;
578 1.1 pgoyette /* FALLTHROUGH */
579 1.1 pgoyette
580 1.1 pgoyette case PT_READ_I: /* XXX no separate I and D spaces */
581 1.1 pgoyette case PT_READ_D:
582 1.1 pgoyette /* write = 0 done above. */
583 1.1 pgoyette iov.iov_base = (void *)&tmp;
584 1.1 pgoyette iov.iov_len = sizeof(tmp);
585 1.1 pgoyette uio.uio_iov = &iov;
586 1.1 pgoyette uio.uio_iovcnt = 1;
587 1.1 pgoyette uio.uio_offset = (off_t)(unsigned long)addr;
588 1.1 pgoyette uio.uio_resid = sizeof(tmp);
589 1.1 pgoyette uio.uio_rw = write ? UIO_WRITE : UIO_READ;
590 1.1 pgoyette UIO_SETUP_SYSSPACE(&uio);
591 1.1 pgoyette
592 1.1 pgoyette error = process_domem(l, lt, &uio);
593 1.1 pgoyette if (!write)
594 1.1 pgoyette *retval = tmp;
595 1.1 pgoyette break;
596 1.1 pgoyette
597 1.1 pgoyette case PT_IO:
598 1.1 pgoyette error = ptm->ptm_copyinpiod(&piod, addr);
599 1.1 pgoyette if (error)
600 1.1 pgoyette break;
601 1.1 pgoyette
602 1.1 pgoyette iov.iov_base = piod.piod_addr;
603 1.1 pgoyette iov.iov_len = piod.piod_len;
604 1.1 pgoyette uio.uio_iov = &iov;
605 1.1 pgoyette uio.uio_iovcnt = 1;
606 1.1 pgoyette uio.uio_offset = (off_t)(unsigned long)piod.piod_offs;
607 1.1 pgoyette uio.uio_resid = piod.piod_len;
608 1.1 pgoyette
609 1.1 pgoyette switch (piod.piod_op) {
610 1.1 pgoyette case PIOD_READ_D:
611 1.1 pgoyette case PIOD_READ_I:
612 1.1 pgoyette uio.uio_rw = UIO_READ;
613 1.1 pgoyette break;
614 1.1 pgoyette case PIOD_WRITE_D:
615 1.1 pgoyette case PIOD_WRITE_I:
616 1.1 pgoyette /*
617 1.1 pgoyette * Can't write to a RAS
618 1.1 pgoyette */
619 1.1 pgoyette if (ras_lookup(t, addr) != (void *)-1) {
620 1.1 pgoyette return EACCES;
621 1.1 pgoyette }
622 1.1 pgoyette uio.uio_rw = UIO_WRITE;
623 1.1 pgoyette break;
624 1.1 pgoyette case PIOD_READ_AUXV:
625 1.1 pgoyette req = PT_READ_D;
626 1.1 pgoyette uio.uio_rw = UIO_READ;
627 1.20 kamil tmp = t->p_execsw->es_arglen;
628 1.1 pgoyette if (uio.uio_offset > tmp)
629 1.1 pgoyette return EIO;
630 1.1 pgoyette if (uio.uio_resid > tmp - uio.uio_offset)
631 1.1 pgoyette uio.uio_resid = tmp - uio.uio_offset;
632 1.1 pgoyette piod.piod_len = iov.iov_len = uio.uio_resid;
633 1.1 pgoyette error = process_auxv_offset(t, &uio);
634 1.1 pgoyette break;
635 1.1 pgoyette default:
636 1.1 pgoyette error = EINVAL;
637 1.1 pgoyette break;
638 1.1 pgoyette }
639 1.1 pgoyette if (error)
640 1.1 pgoyette break;
641 1.1 pgoyette error = proc_vmspace_getref(l->l_proc, &vm);
642 1.1 pgoyette if (error)
643 1.1 pgoyette break;
644 1.1 pgoyette uio.uio_vmspace = vm;
645 1.1 pgoyette
646 1.1 pgoyette error = process_domem(l, lt, &uio);
647 1.1 pgoyette piod.piod_len -= uio.uio_resid;
648 1.1 pgoyette (void) ptm->ptm_copyoutpiod(&piod, addr);
649 1.1 pgoyette
650 1.1 pgoyette uvmspace_free(vm);
651 1.1 pgoyette break;
652 1.1 pgoyette
653 1.1 pgoyette case PT_DUMPCORE:
654 1.1 pgoyette if ((path = addr) != NULL) {
655 1.1 pgoyette char *dst;
656 1.1 pgoyette len = data;
657 1.1 pgoyette
658 1.1 pgoyette if (len < 0 || len >= MAXPATHLEN) {
659 1.1 pgoyette error = EINVAL;
660 1.1 pgoyette break;
661 1.1 pgoyette }
662 1.1 pgoyette dst = kmem_alloc(len + 1, KM_SLEEP);
663 1.1 pgoyette if ((error = copyin(path, dst, len)) != 0) {
664 1.1 pgoyette kmem_free(dst, len + 1);
665 1.1 pgoyette break;
666 1.1 pgoyette }
667 1.1 pgoyette path = dst;
668 1.1 pgoyette path[len] = '\0';
669 1.1 pgoyette }
670 1.1 pgoyette error = (*coredump_vec)(lt, path);
671 1.1 pgoyette if (path)
672 1.1 pgoyette kmem_free(path, len + 1);
673 1.1 pgoyette break;
674 1.1 pgoyette
675 1.1 pgoyette #ifdef PT_STEP
676 1.1 pgoyette case PT_STEP:
677 1.1 pgoyette /*
678 1.1 pgoyette * From the 4.4BSD PRM:
679 1.1 pgoyette * "Execution continues as in request PT_CONTINUE; however
680 1.1 pgoyette * as soon as possible after execution of at least one
681 1.1 pgoyette * instruction, execution stops again. [ ... ]"
682 1.1 pgoyette */
683 1.1 pgoyette #endif
684 1.1 pgoyette case PT_CONTINUE:
685 1.1 pgoyette case PT_SYSCALL:
686 1.1 pgoyette case PT_DETACH:
687 1.1 pgoyette if (req == PT_SYSCALL) {
688 1.1 pgoyette if (!ISSET(t->p_slflag, PSL_SYSCALL)) {
689 1.1 pgoyette SET(t->p_slflag, PSL_SYSCALL);
690 1.1 pgoyette #ifdef __HAVE_SYSCALL_INTERN
691 1.1 pgoyette (*t->p_emul->e_syscall_intern)(t);
692 1.1 pgoyette #endif
693 1.1 pgoyette }
694 1.1 pgoyette } else {
695 1.1 pgoyette if (ISSET(t->p_slflag, PSL_SYSCALL)) {
696 1.1 pgoyette CLR(t->p_slflag, PSL_SYSCALL);
697 1.1 pgoyette #ifdef __HAVE_SYSCALL_INTERN
698 1.1 pgoyette (*t->p_emul->e_syscall_intern)(t);
699 1.1 pgoyette #endif
700 1.1 pgoyette }
701 1.1 pgoyette }
702 1.1 pgoyette t->p_trace_enabled = trace_is_enabled(t);
703 1.1 pgoyette
704 1.1 pgoyette /*
705 1.1 pgoyette * Pick up the LWPID, if supplied. There are two cases:
706 1.1 pgoyette * data < 0 : step or continue single thread, lwp = -data
707 1.1 pgoyette * data > 0 in PT_STEP : step this thread, continue others
708 1.1 pgoyette * For operations other than PT_STEP, data > 0 means
709 1.1 pgoyette * data is the signo to deliver to the process.
710 1.1 pgoyette */
711 1.1 pgoyette tmp = data;
712 1.1 pgoyette if (tmp >= 0) {
713 1.1 pgoyette #ifdef PT_STEP
714 1.1 pgoyette if (req == PT_STEP)
715 1.1 pgoyette signo = 0;
716 1.1 pgoyette else
717 1.1 pgoyette #endif
718 1.1 pgoyette {
719 1.1 pgoyette signo = tmp;
720 1.1 pgoyette tmp = 0; /* don't search for LWP */
721 1.1 pgoyette }
722 1.1 pgoyette } else
723 1.1 pgoyette tmp = -tmp;
724 1.1 pgoyette
725 1.1 pgoyette if (tmp > 0) {
726 1.1 pgoyette if (req == PT_DETACH) {
727 1.1 pgoyette error = EINVAL;
728 1.1 pgoyette break;
729 1.1 pgoyette }
730 1.1 pgoyette lwp_delref2 (lt);
731 1.1 pgoyette lt = lwp_find(t, tmp);
732 1.1 pgoyette if (lt == NULL) {
733 1.1 pgoyette error = ESRCH;
734 1.1 pgoyette break;
735 1.1 pgoyette }
736 1.1 pgoyette lwp_addref(lt);
737 1.1 pgoyette resume_all = 0;
738 1.1 pgoyette signo = 0;
739 1.1 pgoyette }
740 1.1 pgoyette
741 1.1 pgoyette /*
742 1.1 pgoyette * From the 4.4BSD PRM:
743 1.1 pgoyette * "The data argument is taken as a signal number and the
744 1.1 pgoyette * child's execution continues at location addr as if it
745 1.1 pgoyette * incurred that signal. Normally the signal number will
746 1.1 pgoyette * be either 0 to indicate that the signal that caused the
747 1.1 pgoyette * stop should be ignored, or that value fetched out of
748 1.1 pgoyette * the process's image indicating which signal caused
749 1.1 pgoyette * the stop. If addr is (int *)1 then execution continues
750 1.1 pgoyette * from where it stopped."
751 1.1 pgoyette */
752 1.1 pgoyette
753 1.1 pgoyette /* Check that the data is a valid signal number or zero. */
754 1.1 pgoyette if (signo < 0 || signo >= NSIG) {
755 1.1 pgoyette error = EINVAL;
756 1.1 pgoyette break;
757 1.1 pgoyette }
758 1.1 pgoyette
759 1.15 kamil /* Prevent process deadlock */
760 1.15 kamil if (resume_all) {
761 1.15 kamil #ifdef PT_STEP
762 1.15 kamil if (req == PT_STEP) {
763 1.15 kamil if (lt->l_flag & LW_WSUSPEND) {
764 1.15 kamil error = EDEADLK;
765 1.15 kamil break;
766 1.15 kamil }
767 1.15 kamil } else
768 1.15 kamil #endif
769 1.15 kamil {
770 1.15 kamil error = EDEADLK;
771 1.15 kamil LIST_FOREACH(lt2, &t->p_lwps, l_sibling) {
772 1.15 kamil if ((lt2->l_flag & LW_WSUSPEND) == 0) {
773 1.15 kamil error = 0;
774 1.15 kamil break;
775 1.15 kamil }
776 1.15 kamil }
777 1.15 kamil if (error != 0)
778 1.15 kamil break;
779 1.15 kamil }
780 1.15 kamil } else {
781 1.15 kamil if (lt->l_flag & LW_WSUSPEND) {
782 1.15 kamil error = EDEADLK;
783 1.15 kamil break;
784 1.15 kamil }
785 1.15 kamil }
786 1.15 kamil
787 1.1 pgoyette /* If the address parameter is not (int *)1, set the pc. */
788 1.1 pgoyette if ((int *)addr != (int *)1) {
789 1.1 pgoyette error = process_set_pc(lt, addr);
790 1.1 pgoyette if (error != 0)
791 1.1 pgoyette break;
792 1.1 pgoyette }
793 1.1 pgoyette #ifdef PT_STEP
794 1.1 pgoyette /*
795 1.1 pgoyette * Arrange for a single-step, if that's requested and possible.
796 1.1 pgoyette * More precisely, set the single step status as requested for
797 1.1 pgoyette * the requested thread, and clear it for other threads.
798 1.1 pgoyette */
799 1.1 pgoyette LIST_FOREACH(lt2, &t->p_lwps, l_sibling) {
800 1.21 kamil if (ISSET(lt2->l_pflag, LP_SINGLESTEP)) {
801 1.21 kamil lwp_lock(lt2);
802 1.21 kamil process_sstep(lt2, 1);
803 1.21 kamil lwp_unlock(lt2);
804 1.21 kamil } else if (lt != lt2) {
805 1.1 pgoyette lwp_lock(lt2);
806 1.1 pgoyette process_sstep(lt2, 0);
807 1.1 pgoyette lwp_unlock(lt2);
808 1.1 pgoyette }
809 1.1 pgoyette }
810 1.21 kamil error = process_sstep(lt,
811 1.21 kamil ISSET(lt->l_pflag, LP_SINGLESTEP) || req == PT_STEP);
812 1.1 pgoyette if (error)
813 1.1 pgoyette break;
814 1.1 pgoyette #endif
815 1.1 pgoyette if (req == PT_DETACH) {
816 1.23 kamil CLR(t->p_slflag, PSL_TRACED|PSL_SYSCALL);
817 1.1 pgoyette
818 1.1 pgoyette /* give process back to original parent or init */
819 1.1 pgoyette if (t->p_opptr != t->p_pptr) {
820 1.1 pgoyette struct proc *pp = t->p_opptr;
821 1.1 pgoyette proc_reparent(t, pp ? pp : initproc);
822 1.1 pgoyette }
823 1.1 pgoyette
824 1.1 pgoyette /* not being traced any more */
825 1.1 pgoyette t->p_opptr = NULL;
826 1.21 kamil
827 1.21 kamil /* clear single step */
828 1.21 kamil LIST_FOREACH(lt2, &t->p_lwps, l_sibling) {
829 1.21 kamil CLR(lt2->l_pflag, LP_SINGLESTEP);
830 1.21 kamil }
831 1.21 kamil CLR(lt->l_pflag, LP_SINGLESTEP);
832 1.1 pgoyette }
833 1.1 pgoyette sendsig:
834 1.1 pgoyette t->p_fpid = 0;
835 1.9 kamil t->p_vfpid = 0;
836 1.9 kamil t->p_vfpid_done = 0;
837 1.10 kamil t->p_lwp_created = 0;
838 1.10 kamil t->p_lwp_exited = 0;
839 1.1 pgoyette /* Finally, deliver the requested signal (or none). */
840 1.1 pgoyette if (t->p_stat == SSTOP) {
841 1.1 pgoyette /*
842 1.1 pgoyette * Unstop the process. If it needs to take a
843 1.1 pgoyette * signal, make all efforts to ensure that at
844 1.1 pgoyette * an LWP runs to see it.
845 1.1 pgoyette */
846 1.1 pgoyette t->p_xsig = signo;
847 1.1 pgoyette if (resume_all)
848 1.1 pgoyette proc_unstop(t);
849 1.1 pgoyette else
850 1.1 pgoyette lwp_unstop(lt);
851 1.8 kamil } else if (t->p_sigctx.ps_faked) {
852 1.8 kamil if (signo != t->p_sigctx.ps_info._signo) {
853 1.8 kamil error = EINVAL;
854 1.8 kamil break;
855 1.8 kamil }
856 1.8 kamil t->p_sigctx.ps_faked = false;
857 1.8 kamil KSI_INIT_EMPTY(&ksi);
858 1.8 kamil ksi.ksi_info = t->p_sigctx.ps_info;
859 1.8 kamil ksi.ksi_lid = t->p_sigctx.ps_lwp;
860 1.8 kamil kpsignal2(t, &ksi);
861 1.1 pgoyette } else if (signo != 0) {
862 1.1 pgoyette KSI_INIT_EMPTY(&ksi);
863 1.1 pgoyette ksi.ksi_signo = signo;
864 1.1 pgoyette kpsignal2(t, &ksi);
865 1.1 pgoyette }
866 1.1 pgoyette break;
867 1.1 pgoyette
868 1.1 pgoyette case PT_SYSCALLEMU:
869 1.1 pgoyette if (!ISSET(t->p_slflag, PSL_SYSCALL) || t->p_stat != SSTOP) {
870 1.1 pgoyette error = EINVAL;
871 1.1 pgoyette break;
872 1.1 pgoyette }
873 1.1 pgoyette SET(t->p_slflag, PSL_SYSCALLEMU);
874 1.1 pgoyette break;
875 1.1 pgoyette
876 1.21 kamil #ifdef PT_STEP
877 1.21 kamil case PT_SETSTEP:
878 1.21 kamil write = 1;
879 1.21 kamil
880 1.21 kamil case PT_CLEARSTEP:
881 1.21 kamil /* write = 0 done above. */
882 1.21 kamil
883 1.21 kamil tmp = data;
884 1.21 kamil if (tmp != 0 && t->p_nlwps > 1) {
885 1.21 kamil lwp_delref(lt);
886 1.21 kamil mutex_enter(t->p_lock);
887 1.21 kamil lt = lwp_find(t, tmp);
888 1.21 kamil if (lt == NULL) {
889 1.21 kamil mutex_exit(t->p_lock);
890 1.21 kamil error = ESRCH;
891 1.21 kamil break;
892 1.21 kamil }
893 1.21 kamil lwp_addref(lt);
894 1.21 kamil mutex_exit(t->p_lock);
895 1.21 kamil }
896 1.21 kamil
897 1.21 kamil if (ISSET(lt->l_flag, LW_SYSTEM))
898 1.21 kamil error = EINVAL;
899 1.21 kamil else if (write)
900 1.21 kamil SET(lt->l_pflag, LP_SINGLESTEP);
901 1.21 kamil else
902 1.21 kamil CLR(lt->l_pflag, LP_SINGLESTEP);
903 1.21 kamil break;
904 1.21 kamil #endif
905 1.21 kamil
906 1.1 pgoyette case PT_KILL:
907 1.1 pgoyette /* just send the process a KILL signal. */
908 1.1 pgoyette signo = SIGKILL;
909 1.1 pgoyette goto sendsig; /* in PT_CONTINUE, above. */
910 1.1 pgoyette
911 1.1 pgoyette case PT_ATTACH:
912 1.1 pgoyette /*
913 1.1 pgoyette * Go ahead and set the trace flag.
914 1.1 pgoyette * Save the old parent (it's reset in
915 1.1 pgoyette * _DETACH, and also in kern_exit.c:wait4()
916 1.1 pgoyette * Reparent the process so that the tracing
917 1.1 pgoyette * proc gets to see all the action.
918 1.1 pgoyette * Stop the target.
919 1.1 pgoyette */
920 1.2 christos proc_changeparent(t, p);
921 1.4 christos signo = SIGSTOP;
922 1.1 pgoyette goto sendsig;
923 1.1 pgoyette
924 1.1 pgoyette case PT_GET_EVENT_MASK:
925 1.1 pgoyette if (data != sizeof(pe)) {
926 1.1 pgoyette DPRINTF(("ptrace(%d): %d != %zu\n", req,
927 1.1 pgoyette data, sizeof(pe)));
928 1.1 pgoyette error = EINVAL;
929 1.1 pgoyette break;
930 1.1 pgoyette }
931 1.1 pgoyette memset(&pe, 0, sizeof(pe));
932 1.1 pgoyette pe.pe_set_event = ISSET(t->p_slflag, PSL_TRACEFORK) ?
933 1.1 pgoyette PTRACE_FORK : 0;
934 1.9 kamil pe.pe_set_event |= ISSET(t->p_slflag, PSL_TRACEVFORK) ?
935 1.9 kamil PTRACE_VFORK : 0;
936 1.9 kamil pe.pe_set_event |= ISSET(t->p_slflag, PSL_TRACEVFORK_DONE) ?
937 1.9 kamil PTRACE_VFORK_DONE : 0;
938 1.10 kamil pe.pe_set_event |= ISSET(t->p_slflag, PSL_TRACELWP_CREATE) ?
939 1.10 kamil PTRACE_LWP_CREATE : 0;
940 1.10 kamil pe.pe_set_event |= ISSET(t->p_slflag, PSL_TRACELWP_EXIT) ?
941 1.10 kamil PTRACE_LWP_EXIT : 0;
942 1.1 pgoyette error = copyout(&pe, addr, sizeof(pe));
943 1.1 pgoyette break;
944 1.1 pgoyette
945 1.1 pgoyette case PT_SET_EVENT_MASK:
946 1.1 pgoyette if (data != sizeof(pe)) {
947 1.1 pgoyette DPRINTF(("ptrace(%d): %d != %zu\n", req, data,
948 1.1 pgoyette sizeof(pe)));
949 1.1 pgoyette error = EINVAL;
950 1.1 pgoyette break;
951 1.1 pgoyette }
952 1.1 pgoyette if ((error = copyin(addr, &pe, sizeof(pe))) != 0)
953 1.1 pgoyette return error;
954 1.1 pgoyette if (pe.pe_set_event & PTRACE_FORK)
955 1.1 pgoyette SET(t->p_slflag, PSL_TRACEFORK);
956 1.1 pgoyette else
957 1.1 pgoyette CLR(t->p_slflag, PSL_TRACEFORK);
958 1.9 kamil #if notyet
959 1.9 kamil if (pe.pe_set_event & PTRACE_VFORK)
960 1.9 kamil SET(t->p_slflag, PSL_TRACEVFORK);
961 1.9 kamil else
962 1.9 kamil CLR(t->p_slflag, PSL_TRACEVFORK);
963 1.9 kamil #else
964 1.9 kamil if (pe.pe_set_event & PTRACE_VFORK) {
965 1.9 kamil error = ENOTSUP;
966 1.9 kamil break;
967 1.9 kamil }
968 1.9 kamil #endif
969 1.9 kamil if (pe.pe_set_event & PTRACE_VFORK_DONE)
970 1.9 kamil SET(t->p_slflag, PSL_TRACEVFORK_DONE);
971 1.9 kamil else
972 1.9 kamil CLR(t->p_slflag, PSL_TRACEVFORK_DONE);
973 1.10 kamil if (pe.pe_set_event & PTRACE_LWP_CREATE)
974 1.10 kamil SET(t->p_slflag, PSL_TRACELWP_CREATE);
975 1.10 kamil else
976 1.10 kamil CLR(t->p_slflag, PSL_TRACELWP_CREATE);
977 1.10 kamil if (pe.pe_set_event & PTRACE_LWP_EXIT)
978 1.10 kamil SET(t->p_slflag, PSL_TRACELWP_EXIT);
979 1.10 kamil else
980 1.10 kamil CLR(t->p_slflag, PSL_TRACELWP_EXIT);
981 1.1 pgoyette break;
982 1.1 pgoyette
983 1.1 pgoyette case PT_GET_PROCESS_STATE:
984 1.1 pgoyette if (data != sizeof(ps)) {
985 1.1 pgoyette DPRINTF(("ptrace(%d): %d != %zu\n", req, data,
986 1.1 pgoyette sizeof(ps)));
987 1.1 pgoyette error = EINVAL;
988 1.1 pgoyette break;
989 1.1 pgoyette }
990 1.1 pgoyette memset(&ps, 0, sizeof(ps));
991 1.1 pgoyette if (t->p_fpid) {
992 1.1 pgoyette ps.pe_report_event = PTRACE_FORK;
993 1.1 pgoyette ps.pe_other_pid = t->p_fpid;
994 1.9 kamil } else if (t->p_vfpid) {
995 1.9 kamil ps.pe_report_event = PTRACE_VFORK;
996 1.9 kamil ps.pe_other_pid = t->p_vfpid;
997 1.9 kamil } else if (t->p_vfpid_done) {
998 1.9 kamil ps.pe_report_event = PTRACE_VFORK_DONE;
999 1.9 kamil ps.pe_other_pid = t->p_vfpid_done;
1000 1.10 kamil } else if (t->p_lwp_created) {
1001 1.10 kamil ps.pe_report_event = PTRACE_LWP_CREATE;
1002 1.10 kamil ps.pe_lwp = t->p_lwp_created;
1003 1.10 kamil } else if (t->p_lwp_exited) {
1004 1.10 kamil ps.pe_report_event = PTRACE_LWP_EXIT;
1005 1.10 kamil ps.pe_lwp = t->p_lwp_exited;
1006 1.1 pgoyette }
1007 1.1 pgoyette error = copyout(&ps, addr, sizeof(ps));
1008 1.1 pgoyette break;
1009 1.1 pgoyette
1010 1.1 pgoyette case PT_LWPINFO:
1011 1.1 pgoyette if (data != sizeof(pl)) {
1012 1.1 pgoyette DPRINTF(("ptrace(%d): %d != %zu\n", req, data,
1013 1.1 pgoyette sizeof(pl)));
1014 1.1 pgoyette error = EINVAL;
1015 1.1 pgoyette break;
1016 1.1 pgoyette }
1017 1.1 pgoyette error = copyin(addr, &pl, sizeof(pl));
1018 1.1 pgoyette if (error)
1019 1.1 pgoyette break;
1020 1.1 pgoyette tmp = pl.pl_lwpid;
1021 1.1 pgoyette lwp_delref(lt);
1022 1.1 pgoyette mutex_enter(t->p_lock);
1023 1.1 pgoyette if (tmp == 0)
1024 1.1 pgoyette lt = lwp_find_first(t);
1025 1.1 pgoyette else {
1026 1.1 pgoyette lt = lwp_find(t, tmp);
1027 1.1 pgoyette if (lt == NULL) {
1028 1.1 pgoyette mutex_exit(t->p_lock);
1029 1.1 pgoyette error = ESRCH;
1030 1.1 pgoyette break;
1031 1.1 pgoyette }
1032 1.1 pgoyette lt = LIST_NEXT(lt, l_sibling);
1033 1.1 pgoyette }
1034 1.1 pgoyette while (lt != NULL && !lwp_alive(lt))
1035 1.1 pgoyette lt = LIST_NEXT(lt, l_sibling);
1036 1.1 pgoyette pl.pl_lwpid = 0;
1037 1.1 pgoyette pl.pl_event = 0;
1038 1.1 pgoyette if (lt) {
1039 1.1 pgoyette lwp_addref(lt);
1040 1.1 pgoyette pl.pl_lwpid = lt->l_lid;
1041 1.15 kamil
1042 1.15 kamil if (lt->l_flag & LW_WSUSPEND)
1043 1.15 kamil pl.pl_event = PL_EVENT_SUSPENDED;
1044 1.6 christos /*
1045 1.6 christos * If we match the lwp, or it was sent to every lwp,
1046 1.6 christos * we set PL_EVENT_SIGNAL.
1047 1.6 christos * XXX: ps_lwp == 0 means everyone and noone, so
1048 1.6 christos * check ps_signo too.
1049 1.6 christos */
1050 1.15 kamil else if (lt->l_lid == t->p_sigctx.ps_lwp
1051 1.15 kamil || (t->p_sigctx.ps_lwp == 0 &&
1052 1.15 kamil t->p_sigctx.ps_info._signo))
1053 1.1 pgoyette pl.pl_event = PL_EVENT_SIGNAL;
1054 1.1 pgoyette }
1055 1.1 pgoyette mutex_exit(t->p_lock);
1056 1.1 pgoyette
1057 1.1 pgoyette error = copyout(&pl, addr, sizeof(pl));
1058 1.1 pgoyette break;
1059 1.1 pgoyette
1060 1.8 kamil case PT_SET_SIGINFO:
1061 1.8 kamil if (data != sizeof(psi)) {
1062 1.8 kamil DPRINTF(("ptrace(%d): %d != %zu\n", req, data,
1063 1.8 kamil sizeof(psi)));
1064 1.8 kamil error = EINVAL;
1065 1.8 kamil break;
1066 1.8 kamil }
1067 1.8 kamil
1068 1.8 kamil error = copyin(addr, &psi, sizeof(psi));
1069 1.8 kamil if (error)
1070 1.8 kamil break;
1071 1.8 kamil
1072 1.8 kamil /* Check that the data is a valid signal number or zero. */
1073 1.8 kamil if (psi.psi_siginfo.si_signo < 0 ||
1074 1.8 kamil psi.psi_siginfo.si_signo >= NSIG) {
1075 1.8 kamil error = EINVAL;
1076 1.8 kamil break;
1077 1.8 kamil }
1078 1.8 kamil
1079 1.8 kamil tmp = psi.psi_lwpid;
1080 1.8 kamil if (tmp != 0)
1081 1.8 kamil lwp_delref(lt);
1082 1.8 kamil
1083 1.8 kamil mutex_enter(t->p_lock);
1084 1.8 kamil
1085 1.8 kamil if (tmp != 0) {
1086 1.8 kamil lt = lwp_find(t, tmp);
1087 1.8 kamil if (lt == NULL) {
1088 1.8 kamil mutex_exit(t->p_lock);
1089 1.8 kamil error = ESRCH;
1090 1.8 kamil break;
1091 1.8 kamil }
1092 1.8 kamil lwp_addref(lt);
1093 1.8 kamil }
1094 1.8 kamil
1095 1.8 kamil t->p_sigctx.ps_faked = true;
1096 1.8 kamil t->p_sigctx.ps_info = psi.psi_siginfo._info;
1097 1.8 kamil t->p_sigctx.ps_lwp = psi.psi_lwpid;
1098 1.8 kamil mutex_exit(t->p_lock);
1099 1.8 kamil break;
1100 1.8 kamil
1101 1.8 kamil case PT_GET_SIGINFO:
1102 1.8 kamil if (data != sizeof(psi)) {
1103 1.8 kamil DPRINTF(("ptrace(%d): %d != %zu\n", req, data,
1104 1.8 kamil sizeof(psi)));
1105 1.8 kamil error = EINVAL;
1106 1.8 kamil break;
1107 1.8 kamil }
1108 1.8 kamil mutex_enter(t->p_lock);
1109 1.8 kamil psi.psi_siginfo._info = t->p_sigctx.ps_info;
1110 1.8 kamil psi.psi_lwpid = t->p_sigctx.ps_lwp;
1111 1.8 kamil mutex_exit(t->p_lock);
1112 1.8 kamil
1113 1.8 kamil error = copyout(&psi, addr, sizeof(psi));
1114 1.8 kamil if (error)
1115 1.8 kamil break;
1116 1.8 kamil
1117 1.8 kamil break;
1118 1.8 kamil
1119 1.14 kamil case PT_SET_SIGMASK:
1120 1.14 kamil write = 1;
1121 1.14 kamil
1122 1.14 kamil case PT_GET_SIGMASK:
1123 1.14 kamil /* write = 0 done above. */
1124 1.14 kamil
1125 1.14 kamil tmp = data;
1126 1.14 kamil if (tmp != 0 && t->p_nlwps > 1) {
1127 1.14 kamil lwp_delref(lt);
1128 1.14 kamil mutex_enter(t->p_lock);
1129 1.14 kamil lt = lwp_find(t, tmp);
1130 1.14 kamil if (lt == NULL) {
1131 1.14 kamil mutex_exit(t->p_lock);
1132 1.14 kamil error = ESRCH;
1133 1.14 kamil break;
1134 1.14 kamil }
1135 1.14 kamil lwp_addref(lt);
1136 1.14 kamil mutex_exit(t->p_lock);
1137 1.14 kamil }
1138 1.14 kamil
1139 1.16 kamil if (lt->l_flag & LW_SYSTEM)
1140 1.14 kamil error = EINVAL;
1141 1.16 kamil else if (write == 1) {
1142 1.14 kamil error = copyin(addr, <->l_sigmask, sizeof(sigset_t));
1143 1.16 kamil sigminusset(&sigcantmask, <->l_sigmask);
1144 1.16 kamil } else
1145 1.14 kamil error = copyout(<->l_sigmask, addr, sizeof(sigset_t));
1146 1.14 kamil
1147 1.14 kamil break;
1148 1.14 kamil
1149 1.15 kamil case PT_RESUME:
1150 1.15 kamil write = 1;
1151 1.15 kamil
1152 1.15 kamil case PT_SUSPEND:
1153 1.15 kamil /* write = 0 done above. */
1154 1.15 kamil
1155 1.15 kamil tmp = data;
1156 1.15 kamil if (tmp != 0 && t->p_nlwps > 1) {
1157 1.15 kamil lwp_delref(lt);
1158 1.15 kamil mutex_enter(t->p_lock);
1159 1.15 kamil lt = lwp_find(t, tmp);
1160 1.15 kamil if (lt == NULL) {
1161 1.15 kamil mutex_exit(t->p_lock);
1162 1.15 kamil error = ESRCH;
1163 1.15 kamil break;
1164 1.15 kamil }
1165 1.15 kamil lwp_addref(lt);
1166 1.15 kamil mutex_exit(t->p_lock);
1167 1.15 kamil }
1168 1.15 kamil if (lt->l_flag & LW_SYSTEM) {
1169 1.15 kamil error = EINVAL;
1170 1.15 kamil } else {
1171 1.15 kamil lwp_lock(lt);
1172 1.15 kamil if (write == 0)
1173 1.15 kamil lt->l_flag |= LW_WSUSPEND;
1174 1.15 kamil else
1175 1.15 kamil lt->l_flag &= ~LW_WSUSPEND;
1176 1.15 kamil lwp_unlock(lt);
1177 1.15 kamil }
1178 1.15 kamil break;
1179 1.15 kamil
1180 1.1 pgoyette #ifdef PT_SETREGS
1181 1.1 pgoyette case PT_SETREGS:
1182 1.1 pgoyette write = 1;
1183 1.1 pgoyette #endif
1184 1.1 pgoyette #ifdef PT_GETREGS
1185 1.1 pgoyette case PT_GETREGS:
1186 1.1 pgoyette /* write = 0 done above. */
1187 1.1 pgoyette #endif
1188 1.1 pgoyette #if defined(PT_SETREGS) || defined(PT_GETREGS)
1189 1.1 pgoyette tmp = data;
1190 1.1 pgoyette if (tmp != 0 && t->p_nlwps > 1) {
1191 1.1 pgoyette lwp_delref(lt);
1192 1.1 pgoyette mutex_enter(t->p_lock);
1193 1.1 pgoyette lt = lwp_find(t, tmp);
1194 1.1 pgoyette if (lt == NULL) {
1195 1.1 pgoyette mutex_exit(t->p_lock);
1196 1.1 pgoyette error = ESRCH;
1197 1.1 pgoyette break;
1198 1.1 pgoyette }
1199 1.1 pgoyette lwp_addref(lt);
1200 1.1 pgoyette mutex_exit(t->p_lock);
1201 1.1 pgoyette }
1202 1.1 pgoyette if (!process_validregs(lt))
1203 1.1 pgoyette error = EINVAL;
1204 1.1 pgoyette else {
1205 1.1 pgoyette error = proc_vmspace_getref(p, &vm);
1206 1.1 pgoyette if (error)
1207 1.1 pgoyette break;
1208 1.1 pgoyette iov.iov_base = addr;
1209 1.1 pgoyette iov.iov_len = PROC_REGSZ(p);
1210 1.1 pgoyette uio.uio_iov = &iov;
1211 1.1 pgoyette uio.uio_iovcnt = 1;
1212 1.1 pgoyette uio.uio_offset = 0;
1213 1.1 pgoyette uio.uio_resid = iov.iov_len;
1214 1.1 pgoyette uio.uio_rw = write ? UIO_WRITE : UIO_READ;
1215 1.1 pgoyette uio.uio_vmspace = vm;
1216 1.1 pgoyette
1217 1.1 pgoyette error = ptm->ptm_doregs(l, lt, &uio);
1218 1.1 pgoyette uvmspace_free(vm);
1219 1.1 pgoyette }
1220 1.1 pgoyette break;
1221 1.1 pgoyette #endif
1222 1.1 pgoyette
1223 1.1 pgoyette #ifdef PT_SETFPREGS
1224 1.1 pgoyette case PT_SETFPREGS:
1225 1.1 pgoyette write = 1;
1226 1.5 christos /*FALLTHROUGH*/
1227 1.1 pgoyette #endif
1228 1.1 pgoyette #ifdef PT_GETFPREGS
1229 1.1 pgoyette case PT_GETFPREGS:
1230 1.1 pgoyette /* write = 0 done above. */
1231 1.1 pgoyette #endif
1232 1.1 pgoyette #if defined(PT_SETFPREGS) || defined(PT_GETFPREGS)
1233 1.1 pgoyette tmp = data;
1234 1.1 pgoyette if (tmp != 0 && t->p_nlwps > 1) {
1235 1.1 pgoyette lwp_delref(lt);
1236 1.1 pgoyette mutex_enter(t->p_lock);
1237 1.1 pgoyette lt = lwp_find(t, tmp);
1238 1.1 pgoyette if (lt == NULL) {
1239 1.1 pgoyette mutex_exit(t->p_lock);
1240 1.1 pgoyette error = ESRCH;
1241 1.1 pgoyette break;
1242 1.1 pgoyette }
1243 1.1 pgoyette lwp_addref(lt);
1244 1.1 pgoyette mutex_exit(t->p_lock);
1245 1.1 pgoyette }
1246 1.1 pgoyette if (!process_validfpregs(lt))
1247 1.1 pgoyette error = EINVAL;
1248 1.1 pgoyette else {
1249 1.1 pgoyette error = proc_vmspace_getref(p, &vm);
1250 1.1 pgoyette if (error)
1251 1.1 pgoyette break;
1252 1.1 pgoyette iov.iov_base = addr;
1253 1.1 pgoyette iov.iov_len = PROC_FPREGSZ(p);
1254 1.1 pgoyette uio.uio_iov = &iov;
1255 1.1 pgoyette uio.uio_iovcnt = 1;
1256 1.1 pgoyette uio.uio_offset = 0;
1257 1.1 pgoyette uio.uio_resid = iov.iov_len;
1258 1.1 pgoyette uio.uio_rw = write ? UIO_WRITE : UIO_READ;
1259 1.1 pgoyette uio.uio_vmspace = vm;
1260 1.1 pgoyette
1261 1.1 pgoyette error = ptm->ptm_dofpregs(l, lt, &uio);
1262 1.1 pgoyette uvmspace_free(vm);
1263 1.1 pgoyette }
1264 1.1 pgoyette break;
1265 1.1 pgoyette #endif
1266 1.1 pgoyette
1267 1.17 kamil #ifdef PT_SETDBREGS
1268 1.17 kamil case PT_SETDBREGS:
1269 1.7 kamil write = 1;
1270 1.17 kamil /*FALLTHROUGH*/
1271 1.17 kamil #endif
1272 1.17 kamil #ifdef PT_GETDBREGS
1273 1.17 kamil case PT_GETDBREGS:
1274 1.17 kamil /* write = 0 done above. */
1275 1.17 kamil #endif
1276 1.17 kamil #if defined(PT_SETDBREGS) || defined(PT_GETDBREGS)
1277 1.17 kamil tmp = data;
1278 1.7 kamil if (tmp != 0 && t->p_nlwps > 1) {
1279 1.7 kamil lwp_delref(lt);
1280 1.7 kamil mutex_enter(t->p_lock);
1281 1.7 kamil lt = lwp_find(t, tmp);
1282 1.7 kamil if (lt == NULL) {
1283 1.7 kamil mutex_exit(t->p_lock);
1284 1.7 kamil error = ESRCH;
1285 1.7 kamil break;
1286 1.7 kamil }
1287 1.7 kamil lwp_addref(lt);
1288 1.7 kamil mutex_exit(t->p_lock);
1289 1.7 kamil }
1290 1.17 kamil if (!process_validdbregs(lt))
1291 1.7 kamil error = EINVAL;
1292 1.7 kamil else {
1293 1.17 kamil error = proc_vmspace_getref(p, &vm);
1294 1.17 kamil if (error)
1295 1.17 kamil break;
1296 1.17 kamil iov.iov_base = addr;
1297 1.17 kamil iov.iov_len = PROC_DBREGSZ(p);
1298 1.17 kamil uio.uio_iov = &iov;
1299 1.17 kamil uio.uio_iovcnt = 1;
1300 1.17 kamil uio.uio_offset = 0;
1301 1.17 kamil uio.uio_resid = iov.iov_len;
1302 1.17 kamil uio.uio_rw = write ? UIO_WRITE : UIO_READ;
1303 1.17 kamil uio.uio_vmspace = vm;
1304 1.17 kamil
1305 1.17 kamil error = ptm->ptm_dodbregs(l, lt, &uio);
1306 1.17 kamil uvmspace_free(vm);
1307 1.7 kamil }
1308 1.7 kamil break;
1309 1.7 kamil #endif
1310 1.7 kamil
1311 1.1 pgoyette #ifdef __HAVE_PTRACE_MACHDEP
1312 1.1 pgoyette PTRACE_MACHDEP_REQUEST_CASES
1313 1.1 pgoyette error = ptrace_machdep_dorequest(l, lt, req, addr, data);
1314 1.1 pgoyette break;
1315 1.1 pgoyette #endif
1316 1.1 pgoyette }
1317 1.1 pgoyette
1318 1.1 pgoyette if (pheld) {
1319 1.1 pgoyette mutex_exit(t->p_lock);
1320 1.1 pgoyette mutex_exit(proc_lock);
1321 1.1 pgoyette }
1322 1.1 pgoyette if (lt != NULL)
1323 1.1 pgoyette lwp_delref(lt);
1324 1.1 pgoyette rw_exit(&t->p_reflock);
1325 1.1 pgoyette
1326 1.1 pgoyette return error;
1327 1.1 pgoyette }
1328 1.1 pgoyette
1329 1.24 christos typedef int (*regfunc_t)(struct lwp *, void *);
1330 1.24 christos
1331 1.24 christos #if defined(PT_GETDBREGS) || defined(PT_SETDBREGS) || \
1332 1.24 christos defined(PT_GETFPREGS) || defined(PT_SETFPREGS) || \
1333 1.24 christos defined(PT_GETREGS) || defined(PT_SETREGS)
1334 1.24 christos static int
1335 1.24 christos proc_regio(struct lwp *l, struct uio *uio, size_t kl, regfunc_t r, regfunc_t w)
1336 1.1 pgoyette {
1337 1.24 christos char buf[1024];
1338 1.1 pgoyette int error;
1339 1.1 pgoyette char *kv;
1340 1.1 pgoyette
1341 1.24 christos if (kl > sizeof(buf))
1342 1.24 christos return E2BIG;
1343 1.24 christos
1344 1.24 christos if (uio->uio_offset < 0 || uio->uio_offset > (off_t)kl)
1345 1.1 pgoyette return EINVAL;
1346 1.1 pgoyette
1347 1.24 christos kv = buf + uio->uio_offset;
1348 1.24 christos kl -= uio->uio_offset;
1349 1.1 pgoyette
1350 1.24 christos if (kl > uio->uio_resid)
1351 1.1 pgoyette kl = uio->uio_resid;
1352 1.1 pgoyette
1353 1.24 christos error = (*r)(l, buf);
1354 1.1 pgoyette if (error == 0)
1355 1.1 pgoyette error = uiomove(kv, kl, uio);
1356 1.1 pgoyette if (error == 0 && uio->uio_rw == UIO_WRITE) {
1357 1.1 pgoyette if (l->l_stat != LSSTOP)
1358 1.1 pgoyette error = EBUSY;
1359 1.1 pgoyette else
1360 1.24 christos error = (*w)(l, buf);
1361 1.1 pgoyette }
1362 1.1 pgoyette
1363 1.1 pgoyette uio->uio_offset = 0;
1364 1.1 pgoyette return error;
1365 1.24 christos }
1366 1.24 christos #endif
1367 1.24 christos
1368 1.24 christos int
1369 1.24 christos process_doregs(struct lwp *curl /*tracer*/,
1370 1.24 christos struct lwp *l /*traced*/,
1371 1.24 christos struct uio *uio)
1372 1.24 christos {
1373 1.24 christos #if defined(PT_GETREGS) || defined(PT_SETREGS)
1374 1.24 christos size_t s;
1375 1.24 christos regfunc_t r, w;
1376 1.24 christos
1377 1.24 christos #ifdef COMPAT_NETBSD32
1378 1.24 christos const bool pk32 = (l->l_proc->p_flag & PK_32) != 0;
1379 1.24 christos
1380 1.24 christos if (__predict_false(pk32)) {
1381 1.26 christos s = sizeof(process_reg32);
1382 1.24 christos r = (regfunc_t)process_read_regs32;
1383 1.24 christos w = (regfunc_t)process_write_regs32;
1384 1.24 christos } else
1385 1.24 christos #endif
1386 1.24 christos {
1387 1.24 christos s = sizeof(struct reg);
1388 1.24 christos r = (regfunc_t)process_read_regs;
1389 1.24 christos w = (regfunc_t)process_write_regs;
1390 1.24 christos }
1391 1.24 christos return proc_regio(l, uio, s, r, w);
1392 1.1 pgoyette #else
1393 1.1 pgoyette return EINVAL;
1394 1.1 pgoyette #endif
1395 1.1 pgoyette }
1396 1.1 pgoyette
1397 1.1 pgoyette int
1398 1.1 pgoyette process_validregs(struct lwp *l)
1399 1.1 pgoyette {
1400 1.1 pgoyette
1401 1.1 pgoyette #if defined(PT_SETREGS) || defined(PT_GETREGS)
1402 1.1 pgoyette return (l->l_flag & LW_SYSTEM) == 0;
1403 1.1 pgoyette #else
1404 1.1 pgoyette return 0;
1405 1.1 pgoyette #endif
1406 1.1 pgoyette }
1407 1.1 pgoyette
1408 1.1 pgoyette int
1409 1.1 pgoyette process_dofpregs(struct lwp *curl /*tracer*/,
1410 1.1 pgoyette struct lwp *l /*traced*/,
1411 1.1 pgoyette struct uio *uio)
1412 1.1 pgoyette {
1413 1.1 pgoyette #if defined(PT_GETFPREGS) || defined(PT_SETFPREGS)
1414 1.24 christos size_t s;
1415 1.24 christos regfunc_t r, w;
1416 1.1 pgoyette
1417 1.24 christos #ifdef COMPAT_NETBSD32
1418 1.24 christos const bool pk32 = (l->l_proc->p_flag & PK_32) != 0;
1419 1.1 pgoyette
1420 1.24 christos if (__predict_false(pk32)) {
1421 1.26 christos s = sizeof(process_fpreg32);
1422 1.24 christos r = (regfunc_t)process_read_fpregs32;
1423 1.24 christos w = (regfunc_t)process_write_fpregs32;
1424 1.24 christos } else
1425 1.24 christos #endif
1426 1.24 christos {
1427 1.24 christos s = sizeof(struct fpreg);
1428 1.24 christos r = (regfunc_t)process_read_fpregs;
1429 1.24 christos w = (regfunc_t)process_write_fpregs;
1430 1.1 pgoyette }
1431 1.24 christos return proc_regio(l, uio, s, r, w);
1432 1.1 pgoyette #else
1433 1.1 pgoyette return EINVAL;
1434 1.1 pgoyette #endif
1435 1.1 pgoyette }
1436 1.1 pgoyette
1437 1.1 pgoyette int
1438 1.1 pgoyette process_validfpregs(struct lwp *l)
1439 1.1 pgoyette {
1440 1.1 pgoyette
1441 1.1 pgoyette #if defined(PT_SETFPREGS) || defined(PT_GETFPREGS)
1442 1.1 pgoyette return (l->l_flag & LW_SYSTEM) == 0;
1443 1.1 pgoyette #else
1444 1.1 pgoyette return 0;
1445 1.1 pgoyette #endif
1446 1.1 pgoyette }
1447 1.1 pgoyette
1448 1.17 kamil int
1449 1.17 kamil process_dodbregs(struct lwp *curl /*tracer*/,
1450 1.17 kamil struct lwp *l /*traced*/,
1451 1.17 kamil struct uio *uio)
1452 1.17 kamil {
1453 1.17 kamil #if defined(PT_GETDBREGS) || defined(PT_SETDBREGS)
1454 1.24 christos size_t s;
1455 1.24 christos regfunc_t r, w;
1456 1.17 kamil
1457 1.24 christos #ifdef COMPAT_NETBSD32
1458 1.24 christos const bool pk32 = (l->l_proc->p_flag & PK_32) != 0;
1459 1.17 kamil
1460 1.24 christos if (__predict_false(pk32)) {
1461 1.26 christos s = sizeof(process_dbreg32);
1462 1.24 christos r = (regfunc_t)process_read_dbregs32;
1463 1.24 christos w = (regfunc_t)process_write_dbregs32;
1464 1.24 christos } else
1465 1.24 christos #endif
1466 1.24 christos {
1467 1.24 christos s = sizeof(struct dbreg);
1468 1.24 christos r = (regfunc_t)process_read_dbregs;
1469 1.24 christos w = (regfunc_t)process_write_dbregs;
1470 1.17 kamil }
1471 1.24 christos return proc_regio(l, uio, s, r, w);
1472 1.17 kamil #else
1473 1.17 kamil return EINVAL;
1474 1.17 kamil #endif
1475 1.17 kamil }
1476 1.17 kamil
1477 1.17 kamil int
1478 1.17 kamil process_validdbregs(struct lwp *l)
1479 1.17 kamil {
1480 1.17 kamil
1481 1.17 kamil #if defined(PT_SETDBREGS) || defined(PT_GETDBREGS)
1482 1.17 kamil return (l->l_flag & LW_SYSTEM) == 0;
1483 1.17 kamil #else
1484 1.17 kamil return 0;
1485 1.17 kamil #endif
1486 1.17 kamil }
1487 1.17 kamil
1488 1.1 pgoyette static int
1489 1.1 pgoyette process_auxv_offset(struct proc *p, struct uio *uio)
1490 1.1 pgoyette {
1491 1.1 pgoyette struct ps_strings pss;
1492 1.1 pgoyette int error;
1493 1.1 pgoyette off_t off = (off_t)p->p_psstrp;
1494 1.1 pgoyette
1495 1.1 pgoyette if ((error = copyin_psstrings(p, &pss)) != 0)
1496 1.1 pgoyette return error;
1497 1.1 pgoyette
1498 1.1 pgoyette if (pss.ps_envstr == NULL)
1499 1.1 pgoyette return EIO;
1500 1.1 pgoyette
1501 1.1 pgoyette uio->uio_offset += (off_t)(vaddr_t)(pss.ps_envstr + pss.ps_nenvstr + 1);
1502 1.1 pgoyette #ifdef __MACHINE_STACK_GROWS_UP
1503 1.1 pgoyette if (uio->uio_offset < off)
1504 1.1 pgoyette return EIO;
1505 1.1 pgoyette #else
1506 1.1 pgoyette if (uio->uio_offset > off)
1507 1.1 pgoyette return EIO;
1508 1.1 pgoyette if ((uio->uio_offset + uio->uio_resid) > off)
1509 1.1 pgoyette uio->uio_resid = off - uio->uio_offset;
1510 1.1 pgoyette #endif
1511 1.1 pgoyette return 0;
1512 1.1 pgoyette }
1513 1.1 pgoyette #endif /* PTRACE */
1514 1.1 pgoyette
1515 1.1 pgoyette MODULE(MODULE_CLASS_EXEC, ptrace_common, "");
1516 1.1 pgoyette
1517 1.1 pgoyette static int
1518 1.1 pgoyette ptrace_common_modcmd(modcmd_t cmd, void *arg)
1519 1.1 pgoyette {
1520 1.1 pgoyette int error;
1521 1.1 pgoyette
1522 1.1 pgoyette switch (cmd) {
1523 1.1 pgoyette case MODULE_CMD_INIT:
1524 1.1 pgoyette error = ptrace_init();
1525 1.1 pgoyette break;
1526 1.1 pgoyette case MODULE_CMD_FINI:
1527 1.1 pgoyette error = ptrace_fini();
1528 1.1 pgoyette break;
1529 1.1 pgoyette default:
1530 1.1 pgoyette ptrace_hooks();
1531 1.1 pgoyette error = ENOTTY;
1532 1.1 pgoyette break;
1533 1.1 pgoyette }
1534 1.1 pgoyette return error;
1535 1.1 pgoyette }
1536