sys_ptrace_common.c revision 1.5 1 1.5 christos /* $NetBSD: sys_ptrace_common.c,v 1.5 2016/11/19 19:06:12 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.5 christos __KERNEL_RCSID(0, "$NetBSD: sys_ptrace_common.c,v 1.5 2016/11/19 19:06:12 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.1 pgoyette #endif
128 1.1 pgoyette
129 1.1 pgoyette #include <sys/param.h>
130 1.1 pgoyette #include <sys/systm.h>
131 1.1 pgoyette #include <sys/proc.h>
132 1.1 pgoyette #include <sys/errno.h>
133 1.1 pgoyette #include <sys/exec.h>
134 1.1 pgoyette #include <sys/pax.h>
135 1.1 pgoyette #include <sys/ptrace.h>
136 1.1 pgoyette #include <sys/uio.h>
137 1.1 pgoyette #include <sys/ras.h>
138 1.1 pgoyette #include <sys/kmem.h>
139 1.1 pgoyette #include <sys/kauth.h>
140 1.1 pgoyette #include <sys/mount.h>
141 1.1 pgoyette #include <sys/syscallargs.h>
142 1.1 pgoyette #include <sys/module.h>
143 1.1 pgoyette #include <sys/condvar.h>
144 1.1 pgoyette #include <sys/mutex.h>
145 1.1 pgoyette
146 1.1 pgoyette #include <uvm/uvm_extern.h>
147 1.1 pgoyette
148 1.1 pgoyette #include <machine/reg.h>
149 1.1 pgoyette
150 1.1 pgoyette #ifdef PTRACE
151 1.1 pgoyette
152 1.1 pgoyette # ifdef DEBUG
153 1.1 pgoyette # define DPRINTF(a) uprintf a
154 1.1 pgoyette # else
155 1.1 pgoyette # define DPRINTF(a)
156 1.1 pgoyette # endif
157 1.1 pgoyette
158 1.1 pgoyette static kauth_listener_t ptrace_listener;
159 1.1 pgoyette static int process_auxv_offset(struct proc *, struct uio *);
160 1.1 pgoyette
161 1.1 pgoyette #if 0
162 1.1 pgoyette static int ptrace_cbref;
163 1.1 pgoyette static kmutex_t ptrace_mtx;
164 1.1 pgoyette static kcondvar_t ptrace_cv;
165 1.1 pgoyette #endif
166 1.1 pgoyette
167 1.1 pgoyette static int
168 1.1 pgoyette ptrace_listener_cb(kauth_cred_t cred, kauth_action_t action, void *cookie,
169 1.1 pgoyette void *arg0, void *arg1, void *arg2, void *arg3)
170 1.1 pgoyette {
171 1.1 pgoyette struct proc *p;
172 1.1 pgoyette int result;
173 1.1 pgoyette
174 1.1 pgoyette result = KAUTH_RESULT_DEFER;
175 1.1 pgoyette p = arg0;
176 1.1 pgoyette
177 1.1 pgoyette #if 0
178 1.1 pgoyette mutex_enter(&ptrace_mtx);
179 1.1 pgoyette ptrace_cbref++;
180 1.1 pgoyette mutex_exit(&ptrace_mtx);
181 1.1 pgoyette #endif
182 1.1 pgoyette if (action != KAUTH_PROCESS_PTRACE)
183 1.1 pgoyette goto out;
184 1.1 pgoyette
185 1.1 pgoyette switch ((u_long)arg1) {
186 1.1 pgoyette case PT_TRACE_ME:
187 1.1 pgoyette case PT_ATTACH:
188 1.1 pgoyette case PT_WRITE_I:
189 1.1 pgoyette case PT_WRITE_D:
190 1.1 pgoyette case PT_READ_I:
191 1.1 pgoyette case PT_READ_D:
192 1.1 pgoyette case PT_IO:
193 1.1 pgoyette #ifdef PT_GETREGS
194 1.1 pgoyette case PT_GETREGS:
195 1.1 pgoyette #endif
196 1.1 pgoyette #ifdef PT_SETREGS
197 1.1 pgoyette case PT_SETREGS:
198 1.1 pgoyette #endif
199 1.1 pgoyette #ifdef PT_GETFPREGS
200 1.1 pgoyette case PT_GETFPREGS:
201 1.1 pgoyette #endif
202 1.1 pgoyette #ifdef PT_SETFPREGS
203 1.1 pgoyette case PT_SETFPREGS:
204 1.1 pgoyette #endif
205 1.1 pgoyette case PT_SET_EVENT_MASK:
206 1.1 pgoyette case PT_GET_EVENT_MASK:
207 1.1 pgoyette case PT_GET_PROCESS_STATE:
208 1.1 pgoyette #ifdef __HAVE_PTRACE_MACHDEP
209 1.1 pgoyette PTRACE_MACHDEP_REQUEST_CASES
210 1.1 pgoyette #endif
211 1.1 pgoyette if (kauth_cred_getuid(cred) != kauth_cred_getuid(p->p_cred) ||
212 1.1 pgoyette ISSET(p->p_flag, PK_SUGID)) {
213 1.1 pgoyette break;
214 1.1 pgoyette }
215 1.1 pgoyette
216 1.1 pgoyette result = KAUTH_RESULT_ALLOW;
217 1.1 pgoyette
218 1.1 pgoyette break;
219 1.1 pgoyette
220 1.1 pgoyette #ifdef PT_STEP
221 1.1 pgoyette case PT_STEP:
222 1.1 pgoyette #endif
223 1.1 pgoyette case PT_CONTINUE:
224 1.1 pgoyette case PT_KILL:
225 1.1 pgoyette case PT_DETACH:
226 1.1 pgoyette case PT_LWPINFO:
227 1.1 pgoyette case PT_SYSCALL:
228 1.1 pgoyette case PT_SYSCALLEMU:
229 1.1 pgoyette case PT_DUMPCORE:
230 1.1 pgoyette result = KAUTH_RESULT_ALLOW;
231 1.1 pgoyette break;
232 1.1 pgoyette
233 1.1 pgoyette default:
234 1.1 pgoyette break;
235 1.1 pgoyette }
236 1.1 pgoyette
237 1.1 pgoyette out:
238 1.1 pgoyette #if 0
239 1.1 pgoyette mutex_enter(&ptrace_mtx);
240 1.1 pgoyette if (--ptrace_cbref == 0)
241 1.1 pgoyette cv_broadcast(&ptrace_cv);
242 1.1 pgoyette mutex_exit(&ptrace_mtx);
243 1.1 pgoyette #endif
244 1.1 pgoyette
245 1.1 pgoyette return result;
246 1.1 pgoyette }
247 1.1 pgoyette
248 1.1 pgoyette int
249 1.1 pgoyette ptrace_init(void)
250 1.1 pgoyette {
251 1.1 pgoyette
252 1.1 pgoyette #if 0
253 1.1 pgoyette mutex_init(&ptrace_mtx, MUTEX_DEFAULT, IPL_NONE);
254 1.1 pgoyette cv_init(&ptrace_cv, "ptracecb");
255 1.1 pgoyette ptrace_cbref = 0;
256 1.1 pgoyette #endif
257 1.1 pgoyette ptrace_listener = kauth_listen_scope(KAUTH_SCOPE_PROCESS,
258 1.1 pgoyette ptrace_listener_cb, NULL);
259 1.1 pgoyette return 0;
260 1.1 pgoyette }
261 1.1 pgoyette
262 1.1 pgoyette int
263 1.1 pgoyette ptrace_fini(void)
264 1.1 pgoyette {
265 1.1 pgoyette
266 1.1 pgoyette kauth_unlisten_scope(ptrace_listener);
267 1.1 pgoyette
268 1.1 pgoyette #if 0
269 1.1 pgoyette /* Make sure no-one is executing our kauth listener */
270 1.1 pgoyette
271 1.1 pgoyette mutex_enter(&ptrace_mtx);
272 1.1 pgoyette while (ptrace_cbref != 0)
273 1.1 pgoyette cv_wait(&ptrace_cv, &ptrace_mtx);
274 1.1 pgoyette mutex_exit(&ptrace_mtx);
275 1.1 pgoyette mutex_destroy(&ptrace_mtx);
276 1.1 pgoyette cv_destroy(&ptrace_cv);
277 1.1 pgoyette #endif
278 1.1 pgoyette
279 1.1 pgoyette return 0;
280 1.1 pgoyette }
281 1.1 pgoyette
282 1.1 pgoyette int
283 1.1 pgoyette do_ptrace(struct ptrace_methods *ptm, struct lwp *l, int req, pid_t pid,
284 1.1 pgoyette void *addr, int data, register_t *retval)
285 1.1 pgoyette {
286 1.1 pgoyette struct proc *p = l->l_proc;
287 1.1 pgoyette struct lwp *lt;
288 1.1 pgoyette #ifdef PT_STEP
289 1.1 pgoyette struct lwp *lt2;
290 1.1 pgoyette #endif
291 1.1 pgoyette struct proc *t; /* target process */
292 1.1 pgoyette struct uio uio;
293 1.1 pgoyette struct iovec iov;
294 1.1 pgoyette struct ptrace_io_desc piod;
295 1.1 pgoyette struct ptrace_event pe;
296 1.1 pgoyette struct ptrace_state ps;
297 1.1 pgoyette struct ptrace_lwpinfo pl;
298 1.1 pgoyette struct vmspace *vm;
299 1.1 pgoyette int error, write, tmp, pheld;
300 1.1 pgoyette int signo = 0;
301 1.1 pgoyette int resume_all;
302 1.1 pgoyette ksiginfo_t ksi;
303 1.1 pgoyette char *path;
304 1.1 pgoyette int len = 0;
305 1.1 pgoyette error = 0;
306 1.1 pgoyette
307 1.1 pgoyette /*
308 1.1 pgoyette * If attaching or detaching, we need to get a write hold on the
309 1.1 pgoyette * proclist lock so that we can re-parent the target process.
310 1.1 pgoyette */
311 1.1 pgoyette mutex_enter(proc_lock);
312 1.1 pgoyette
313 1.1 pgoyette /* "A foolish consistency..." XXX */
314 1.1 pgoyette if (req == PT_TRACE_ME) {
315 1.1 pgoyette t = p;
316 1.1 pgoyette mutex_enter(t->p_lock);
317 1.1 pgoyette } else {
318 1.1 pgoyette /* Find the process we're supposed to be operating on. */
319 1.1 pgoyette t = proc_find(pid);
320 1.1 pgoyette if (t == NULL) {
321 1.1 pgoyette mutex_exit(proc_lock);
322 1.1 pgoyette return ESRCH;
323 1.1 pgoyette }
324 1.1 pgoyette
325 1.1 pgoyette /* XXX-elad */
326 1.1 pgoyette mutex_enter(t->p_lock);
327 1.1 pgoyette error = kauth_authorize_process(l->l_cred, KAUTH_PROCESS_CANSEE,
328 1.1 pgoyette t, KAUTH_ARG(KAUTH_REQ_PROCESS_CANSEE_ENTRY), NULL, NULL);
329 1.1 pgoyette if (error) {
330 1.1 pgoyette mutex_exit(proc_lock);
331 1.1 pgoyette mutex_exit(t->p_lock);
332 1.1 pgoyette return ESRCH;
333 1.1 pgoyette }
334 1.1 pgoyette }
335 1.1 pgoyette
336 1.1 pgoyette /*
337 1.1 pgoyette * Grab a reference on the process to prevent it from execing or
338 1.1 pgoyette * exiting.
339 1.1 pgoyette */
340 1.1 pgoyette if (!rw_tryenter(&t->p_reflock, RW_READER)) {
341 1.1 pgoyette mutex_exit(proc_lock);
342 1.1 pgoyette mutex_exit(t->p_lock);
343 1.1 pgoyette return EBUSY;
344 1.1 pgoyette }
345 1.1 pgoyette
346 1.1 pgoyette /* Make sure we can operate on it. */
347 1.1 pgoyette switch (req) {
348 1.1 pgoyette case PT_TRACE_ME:
349 1.1 pgoyette /* Saying that you're being traced is always legal. */
350 1.1 pgoyette break;
351 1.1 pgoyette
352 1.1 pgoyette case PT_ATTACH:
353 1.1 pgoyette /*
354 1.1 pgoyette * You can't attach to a process if:
355 1.1 pgoyette * (1) it's the process that's doing the attaching,
356 1.1 pgoyette */
357 1.1 pgoyette if (t->p_pid == p->p_pid) {
358 1.1 pgoyette error = EINVAL;
359 1.1 pgoyette break;
360 1.1 pgoyette }
361 1.1 pgoyette
362 1.1 pgoyette /*
363 1.1 pgoyette * (2) it's a system process
364 1.1 pgoyette */
365 1.1 pgoyette if (t->p_flag & PK_SYSTEM) {
366 1.1 pgoyette error = EPERM;
367 1.1 pgoyette break;
368 1.1 pgoyette }
369 1.1 pgoyette
370 1.1 pgoyette /*
371 1.1 pgoyette * (3) it's already being traced, or
372 1.1 pgoyette */
373 1.1 pgoyette if (ISSET(t->p_slflag, PSL_TRACED)) {
374 1.1 pgoyette error = EBUSY;
375 1.1 pgoyette break;
376 1.1 pgoyette }
377 1.1 pgoyette
378 1.1 pgoyette /*
379 1.1 pgoyette * (4) the tracer is chrooted, and its root directory is
380 1.1 pgoyette * not at or above the root directory of the tracee
381 1.1 pgoyette */
382 1.1 pgoyette mutex_exit(t->p_lock); /* XXXSMP */
383 1.1 pgoyette tmp = proc_isunder(t, l);
384 1.1 pgoyette mutex_enter(t->p_lock); /* XXXSMP */
385 1.1 pgoyette if (!tmp) {
386 1.1 pgoyette error = EPERM;
387 1.1 pgoyette break;
388 1.1 pgoyette }
389 1.1 pgoyette break;
390 1.1 pgoyette
391 1.1 pgoyette case PT_READ_I:
392 1.1 pgoyette case PT_READ_D:
393 1.1 pgoyette case PT_WRITE_I:
394 1.1 pgoyette case PT_WRITE_D:
395 1.1 pgoyette case PT_IO:
396 1.1 pgoyette #ifdef PT_GETREGS
397 1.1 pgoyette case PT_GETREGS:
398 1.1 pgoyette #endif
399 1.1 pgoyette #ifdef PT_SETREGS
400 1.1 pgoyette case PT_SETREGS:
401 1.1 pgoyette #endif
402 1.1 pgoyette #ifdef PT_GETFPREGS
403 1.1 pgoyette case PT_GETFPREGS:
404 1.1 pgoyette #endif
405 1.1 pgoyette #ifdef PT_SETFPREGS
406 1.1 pgoyette case PT_SETFPREGS:
407 1.1 pgoyette #endif
408 1.1 pgoyette #ifdef __HAVE_PTRACE_MACHDEP
409 1.1 pgoyette PTRACE_MACHDEP_REQUEST_CASES
410 1.1 pgoyette #endif
411 1.1 pgoyette /*
412 1.1 pgoyette * You can't read/write the memory or registers of a process
413 1.1 pgoyette * if the tracer is chrooted, and its root directory is not at
414 1.1 pgoyette * or above the root directory of the tracee.
415 1.1 pgoyette */
416 1.1 pgoyette mutex_exit(t->p_lock); /* XXXSMP */
417 1.1 pgoyette tmp = proc_isunder(t, l);
418 1.1 pgoyette mutex_enter(t->p_lock); /* XXXSMP */
419 1.1 pgoyette if (!tmp) {
420 1.1 pgoyette error = EPERM;
421 1.1 pgoyette break;
422 1.1 pgoyette }
423 1.1 pgoyette /*FALLTHROUGH*/
424 1.1 pgoyette
425 1.1 pgoyette case PT_CONTINUE:
426 1.1 pgoyette case PT_KILL:
427 1.1 pgoyette case PT_DETACH:
428 1.1 pgoyette case PT_LWPINFO:
429 1.1 pgoyette case PT_SYSCALL:
430 1.1 pgoyette case PT_SYSCALLEMU:
431 1.1 pgoyette case PT_DUMPCORE:
432 1.1 pgoyette #ifdef PT_STEP
433 1.1 pgoyette case PT_STEP:
434 1.1 pgoyette #endif
435 1.1 pgoyette case PT_SET_EVENT_MASK:
436 1.1 pgoyette case PT_GET_EVENT_MASK:
437 1.1 pgoyette case PT_GET_PROCESS_STATE:
438 1.1 pgoyette /*
439 1.1 pgoyette * You can't do what you want to the process if:
440 1.1 pgoyette * (1) It's not being traced at all,
441 1.1 pgoyette */
442 1.1 pgoyette if (!ISSET(t->p_slflag, PSL_TRACED)) {
443 1.1 pgoyette error = EPERM;
444 1.1 pgoyette break;
445 1.1 pgoyette }
446 1.1 pgoyette
447 1.1 pgoyette /*
448 1.1 pgoyette * (2) it's being traced by procfs (which has
449 1.1 pgoyette * different signal delivery semantics),
450 1.1 pgoyette */
451 1.1 pgoyette if (ISSET(t->p_slflag, PSL_FSTRACE)) {
452 1.1 pgoyette DPRINTF(("file system traced\n"));
453 1.1 pgoyette error = EBUSY;
454 1.1 pgoyette break;
455 1.1 pgoyette }
456 1.1 pgoyette
457 1.1 pgoyette /*
458 1.1 pgoyette * (3) it's not being traced by _you_, or
459 1.1 pgoyette */
460 1.1 pgoyette if (t->p_pptr != p) {
461 1.1 pgoyette DPRINTF(("parent %d != %d\n", t->p_pptr->p_pid,
462 1.1 pgoyette p->p_pid));
463 1.1 pgoyette error = EBUSY;
464 1.1 pgoyette break;
465 1.1 pgoyette }
466 1.1 pgoyette
467 1.1 pgoyette /*
468 1.1 pgoyette * (4) it's not currently stopped.
469 1.1 pgoyette */
470 1.1 pgoyette if (t->p_stat != SSTOP || !t->p_waited /* XXXSMP */) {
471 1.1 pgoyette DPRINTF(("stat %d flag %d\n", t->p_stat,
472 1.1 pgoyette !t->p_waited));
473 1.1 pgoyette error = EBUSY;
474 1.1 pgoyette break;
475 1.1 pgoyette }
476 1.1 pgoyette break;
477 1.1 pgoyette
478 1.1 pgoyette default: /* It was not a legal request. */
479 1.1 pgoyette error = EINVAL;
480 1.1 pgoyette break;
481 1.1 pgoyette }
482 1.1 pgoyette
483 1.1 pgoyette if (error == 0) {
484 1.1 pgoyette error = kauth_authorize_process(l->l_cred,
485 1.1 pgoyette KAUTH_PROCESS_PTRACE, t, KAUTH_ARG(req),
486 1.1 pgoyette NULL, NULL);
487 1.1 pgoyette }
488 1.1 pgoyette if (error == 0) {
489 1.1 pgoyette lt = lwp_find_first(t);
490 1.1 pgoyette if (lt == NULL)
491 1.1 pgoyette error = ESRCH;
492 1.1 pgoyette }
493 1.1 pgoyette
494 1.1 pgoyette if (error != 0) {
495 1.1 pgoyette mutex_exit(proc_lock);
496 1.1 pgoyette mutex_exit(t->p_lock);
497 1.1 pgoyette rw_exit(&t->p_reflock);
498 1.1 pgoyette return error;
499 1.1 pgoyette }
500 1.1 pgoyette
501 1.1 pgoyette /* Do single-step fixup if needed. */
502 1.1 pgoyette FIX_SSTEP(t);
503 1.1 pgoyette KASSERT(lt != NULL);
504 1.1 pgoyette lwp_addref(lt);
505 1.1 pgoyette
506 1.1 pgoyette /*
507 1.1 pgoyette * Which locks do we need held? XXX Ugly.
508 1.1 pgoyette */
509 1.1 pgoyette switch (req) {
510 1.1 pgoyette #ifdef PT_STEP
511 1.1 pgoyette case PT_STEP:
512 1.1 pgoyette #endif
513 1.1 pgoyette case PT_CONTINUE:
514 1.1 pgoyette case PT_DETACH:
515 1.1 pgoyette case PT_KILL:
516 1.1 pgoyette case PT_SYSCALL:
517 1.1 pgoyette case PT_SYSCALLEMU:
518 1.1 pgoyette case PT_ATTACH:
519 1.1 pgoyette case PT_TRACE_ME:
520 1.1 pgoyette pheld = 1;
521 1.1 pgoyette break;
522 1.1 pgoyette default:
523 1.1 pgoyette mutex_exit(proc_lock);
524 1.1 pgoyette mutex_exit(t->p_lock);
525 1.1 pgoyette pheld = 0;
526 1.1 pgoyette break;
527 1.1 pgoyette }
528 1.1 pgoyette
529 1.1 pgoyette /* Now do the operation. */
530 1.1 pgoyette write = 0;
531 1.1 pgoyette *retval = 0;
532 1.1 pgoyette tmp = 0;
533 1.1 pgoyette resume_all = 1;
534 1.1 pgoyette
535 1.1 pgoyette switch (req) {
536 1.1 pgoyette case PT_TRACE_ME:
537 1.1 pgoyette /* Just set the trace flag. */
538 1.1 pgoyette SET(t->p_slflag, PSL_TRACED);
539 1.1 pgoyette t->p_opptr = t->p_pptr;
540 1.1 pgoyette break;
541 1.1 pgoyette
542 1.1 pgoyette case PT_WRITE_I: /* XXX no separate I and D spaces */
543 1.1 pgoyette case PT_WRITE_D:
544 1.1 pgoyette #if defined(__HAVE_RAS)
545 1.1 pgoyette /*
546 1.1 pgoyette * Can't write to a RAS
547 1.1 pgoyette */
548 1.1 pgoyette if (ras_lookup(t, addr) != (void *)-1) {
549 1.1 pgoyette error = EACCES;
550 1.1 pgoyette break;
551 1.1 pgoyette }
552 1.1 pgoyette #endif
553 1.1 pgoyette write = 1;
554 1.1 pgoyette tmp = data;
555 1.1 pgoyette /* FALLTHROUGH */
556 1.1 pgoyette
557 1.1 pgoyette case PT_READ_I: /* XXX no separate I and D spaces */
558 1.1 pgoyette case PT_READ_D:
559 1.1 pgoyette /* write = 0 done above. */
560 1.1 pgoyette iov.iov_base = (void *)&tmp;
561 1.1 pgoyette iov.iov_len = sizeof(tmp);
562 1.1 pgoyette uio.uio_iov = &iov;
563 1.1 pgoyette uio.uio_iovcnt = 1;
564 1.1 pgoyette uio.uio_offset = (off_t)(unsigned long)addr;
565 1.1 pgoyette uio.uio_resid = sizeof(tmp);
566 1.1 pgoyette uio.uio_rw = write ? UIO_WRITE : UIO_READ;
567 1.1 pgoyette UIO_SETUP_SYSSPACE(&uio);
568 1.1 pgoyette
569 1.1 pgoyette error = process_domem(l, lt, &uio);
570 1.1 pgoyette if (!write)
571 1.1 pgoyette *retval = tmp;
572 1.1 pgoyette break;
573 1.1 pgoyette
574 1.1 pgoyette case PT_IO:
575 1.1 pgoyette error = ptm->ptm_copyinpiod(&piod, addr);
576 1.1 pgoyette if (error)
577 1.1 pgoyette break;
578 1.1 pgoyette
579 1.1 pgoyette iov.iov_base = piod.piod_addr;
580 1.1 pgoyette iov.iov_len = piod.piod_len;
581 1.1 pgoyette uio.uio_iov = &iov;
582 1.1 pgoyette uio.uio_iovcnt = 1;
583 1.1 pgoyette uio.uio_offset = (off_t)(unsigned long)piod.piod_offs;
584 1.1 pgoyette uio.uio_resid = piod.piod_len;
585 1.1 pgoyette
586 1.1 pgoyette switch (piod.piod_op) {
587 1.1 pgoyette case PIOD_READ_D:
588 1.1 pgoyette case PIOD_READ_I:
589 1.1 pgoyette uio.uio_rw = UIO_READ;
590 1.1 pgoyette break;
591 1.1 pgoyette case PIOD_WRITE_D:
592 1.1 pgoyette case PIOD_WRITE_I:
593 1.1 pgoyette /*
594 1.1 pgoyette * Can't write to a RAS
595 1.1 pgoyette */
596 1.1 pgoyette if (ras_lookup(t, addr) != (void *)-1) {
597 1.1 pgoyette return EACCES;
598 1.1 pgoyette }
599 1.1 pgoyette uio.uio_rw = UIO_WRITE;
600 1.1 pgoyette break;
601 1.1 pgoyette case PIOD_READ_AUXV:
602 1.1 pgoyette req = PT_READ_D;
603 1.1 pgoyette uio.uio_rw = UIO_READ;
604 1.1 pgoyette tmp = t->p_execsw->es_arglen * PROC_PTRSZ(t);
605 1.1 pgoyette if (uio.uio_offset > tmp)
606 1.1 pgoyette return EIO;
607 1.1 pgoyette if (uio.uio_resid > tmp - uio.uio_offset)
608 1.1 pgoyette uio.uio_resid = tmp - uio.uio_offset;
609 1.1 pgoyette piod.piod_len = iov.iov_len = uio.uio_resid;
610 1.1 pgoyette error = process_auxv_offset(t, &uio);
611 1.1 pgoyette if (error)
612 1.1 pgoyette return error;
613 1.1 pgoyette break;
614 1.1 pgoyette default:
615 1.1 pgoyette error = EINVAL;
616 1.1 pgoyette break;
617 1.1 pgoyette }
618 1.1 pgoyette if (error)
619 1.1 pgoyette break;
620 1.1 pgoyette error = proc_vmspace_getref(l->l_proc, &vm);
621 1.1 pgoyette if (error)
622 1.1 pgoyette break;
623 1.1 pgoyette uio.uio_vmspace = vm;
624 1.1 pgoyette
625 1.1 pgoyette error = process_domem(l, lt, &uio);
626 1.1 pgoyette piod.piod_len -= uio.uio_resid;
627 1.1 pgoyette (void) ptm->ptm_copyoutpiod(&piod, addr);
628 1.1 pgoyette
629 1.1 pgoyette uvmspace_free(vm);
630 1.1 pgoyette break;
631 1.1 pgoyette
632 1.1 pgoyette case PT_DUMPCORE:
633 1.1 pgoyette if ((path = addr) != NULL) {
634 1.1 pgoyette char *dst;
635 1.1 pgoyette len = data;
636 1.1 pgoyette
637 1.1 pgoyette if (len < 0 || len >= MAXPATHLEN) {
638 1.1 pgoyette error = EINVAL;
639 1.1 pgoyette break;
640 1.1 pgoyette }
641 1.1 pgoyette dst = kmem_alloc(len + 1, KM_SLEEP);
642 1.1 pgoyette if ((error = copyin(path, dst, len)) != 0) {
643 1.1 pgoyette kmem_free(dst, len + 1);
644 1.1 pgoyette break;
645 1.1 pgoyette }
646 1.1 pgoyette path = dst;
647 1.1 pgoyette path[len] = '\0';
648 1.1 pgoyette }
649 1.1 pgoyette error = (*coredump_vec)(lt, path);
650 1.1 pgoyette if (path)
651 1.1 pgoyette kmem_free(path, len + 1);
652 1.1 pgoyette break;
653 1.1 pgoyette
654 1.1 pgoyette #ifdef PT_STEP
655 1.1 pgoyette case PT_STEP:
656 1.1 pgoyette /*
657 1.1 pgoyette * From the 4.4BSD PRM:
658 1.1 pgoyette * "Execution continues as in request PT_CONTINUE; however
659 1.1 pgoyette * as soon as possible after execution of at least one
660 1.1 pgoyette * instruction, execution stops again. [ ... ]"
661 1.1 pgoyette */
662 1.1 pgoyette #endif
663 1.1 pgoyette case PT_CONTINUE:
664 1.1 pgoyette case PT_SYSCALL:
665 1.1 pgoyette case PT_DETACH:
666 1.1 pgoyette if (req == PT_SYSCALL) {
667 1.1 pgoyette if (!ISSET(t->p_slflag, PSL_SYSCALL)) {
668 1.1 pgoyette SET(t->p_slflag, PSL_SYSCALL);
669 1.1 pgoyette #ifdef __HAVE_SYSCALL_INTERN
670 1.1 pgoyette (*t->p_emul->e_syscall_intern)(t);
671 1.1 pgoyette #endif
672 1.1 pgoyette }
673 1.1 pgoyette } else {
674 1.1 pgoyette if (ISSET(t->p_slflag, PSL_SYSCALL)) {
675 1.1 pgoyette CLR(t->p_slflag, PSL_SYSCALL);
676 1.1 pgoyette #ifdef __HAVE_SYSCALL_INTERN
677 1.1 pgoyette (*t->p_emul->e_syscall_intern)(t);
678 1.1 pgoyette #endif
679 1.1 pgoyette }
680 1.1 pgoyette }
681 1.1 pgoyette t->p_trace_enabled = trace_is_enabled(t);
682 1.1 pgoyette
683 1.1 pgoyette /*
684 1.1 pgoyette * Pick up the LWPID, if supplied. There are two cases:
685 1.1 pgoyette * data < 0 : step or continue single thread, lwp = -data
686 1.1 pgoyette * data > 0 in PT_STEP : step this thread, continue others
687 1.1 pgoyette * For operations other than PT_STEP, data > 0 means
688 1.1 pgoyette * data is the signo to deliver to the process.
689 1.1 pgoyette */
690 1.1 pgoyette tmp = data;
691 1.1 pgoyette if (tmp >= 0) {
692 1.1 pgoyette #ifdef PT_STEP
693 1.1 pgoyette if (req == PT_STEP)
694 1.1 pgoyette signo = 0;
695 1.1 pgoyette else
696 1.1 pgoyette #endif
697 1.1 pgoyette {
698 1.1 pgoyette signo = tmp;
699 1.1 pgoyette tmp = 0; /* don't search for LWP */
700 1.1 pgoyette }
701 1.1 pgoyette } else
702 1.1 pgoyette tmp = -tmp;
703 1.1 pgoyette
704 1.1 pgoyette if (tmp > 0) {
705 1.1 pgoyette if (req == PT_DETACH) {
706 1.1 pgoyette error = EINVAL;
707 1.1 pgoyette break;
708 1.1 pgoyette }
709 1.1 pgoyette lwp_delref2 (lt);
710 1.1 pgoyette lt = lwp_find(t, tmp);
711 1.1 pgoyette if (lt == NULL) {
712 1.1 pgoyette error = ESRCH;
713 1.1 pgoyette break;
714 1.1 pgoyette }
715 1.1 pgoyette lwp_addref(lt);
716 1.1 pgoyette resume_all = 0;
717 1.1 pgoyette signo = 0;
718 1.1 pgoyette }
719 1.1 pgoyette
720 1.1 pgoyette /*
721 1.1 pgoyette * From the 4.4BSD PRM:
722 1.1 pgoyette * "The data argument is taken as a signal number and the
723 1.1 pgoyette * child's execution continues at location addr as if it
724 1.1 pgoyette * incurred that signal. Normally the signal number will
725 1.1 pgoyette * be either 0 to indicate that the signal that caused the
726 1.1 pgoyette * stop should be ignored, or that value fetched out of
727 1.1 pgoyette * the process's image indicating which signal caused
728 1.1 pgoyette * the stop. If addr is (int *)1 then execution continues
729 1.1 pgoyette * from where it stopped."
730 1.1 pgoyette */
731 1.1 pgoyette
732 1.1 pgoyette /* Check that the data is a valid signal number or zero. */
733 1.1 pgoyette if (signo < 0 || signo >= NSIG) {
734 1.1 pgoyette error = EINVAL;
735 1.1 pgoyette break;
736 1.1 pgoyette }
737 1.1 pgoyette
738 1.1 pgoyette /* If the address parameter is not (int *)1, set the pc. */
739 1.1 pgoyette if ((int *)addr != (int *)1) {
740 1.1 pgoyette error = process_set_pc(lt, addr);
741 1.1 pgoyette if (error != 0)
742 1.1 pgoyette break;
743 1.1 pgoyette }
744 1.1 pgoyette #ifdef PT_STEP
745 1.1 pgoyette /*
746 1.1 pgoyette * Arrange for a single-step, if that's requested and possible.
747 1.1 pgoyette * More precisely, set the single step status as requested for
748 1.1 pgoyette * the requested thread, and clear it for other threads.
749 1.1 pgoyette */
750 1.1 pgoyette LIST_FOREACH(lt2, &t->p_lwps, l_sibling) {
751 1.1 pgoyette if (lt != lt2) {
752 1.1 pgoyette lwp_lock(lt2);
753 1.1 pgoyette process_sstep(lt2, 0);
754 1.1 pgoyette lwp_unlock(lt2);
755 1.1 pgoyette }
756 1.1 pgoyette }
757 1.1 pgoyette error = process_sstep(lt, req == PT_STEP);
758 1.1 pgoyette if (error)
759 1.1 pgoyette break;
760 1.1 pgoyette #endif
761 1.1 pgoyette if (req == PT_DETACH) {
762 1.1 pgoyette CLR(t->p_slflag, PSL_TRACED|PSL_FSTRACE|PSL_SYSCALL);
763 1.1 pgoyette
764 1.1 pgoyette /* give process back to original parent or init */
765 1.1 pgoyette if (t->p_opptr != t->p_pptr) {
766 1.1 pgoyette struct proc *pp = t->p_opptr;
767 1.1 pgoyette proc_reparent(t, pp ? pp : initproc);
768 1.1 pgoyette }
769 1.1 pgoyette
770 1.1 pgoyette /* not being traced any more */
771 1.1 pgoyette t->p_opptr = NULL;
772 1.1 pgoyette }
773 1.1 pgoyette sendsig:
774 1.1 pgoyette t->p_fpid = 0;
775 1.1 pgoyette /* Finally, deliver the requested signal (or none). */
776 1.1 pgoyette if (t->p_stat == SSTOP) {
777 1.1 pgoyette /*
778 1.1 pgoyette * Unstop the process. If it needs to take a
779 1.1 pgoyette * signal, make all efforts to ensure that at
780 1.1 pgoyette * an LWP runs to see it.
781 1.1 pgoyette */
782 1.1 pgoyette t->p_xsig = signo;
783 1.1 pgoyette if (resume_all)
784 1.1 pgoyette proc_unstop(t);
785 1.1 pgoyette else
786 1.1 pgoyette lwp_unstop(lt);
787 1.1 pgoyette } else if (signo != 0) {
788 1.1 pgoyette KSI_INIT_EMPTY(&ksi);
789 1.1 pgoyette ksi.ksi_signo = signo;
790 1.1 pgoyette kpsignal2(t, &ksi);
791 1.1 pgoyette }
792 1.1 pgoyette break;
793 1.1 pgoyette
794 1.1 pgoyette case PT_SYSCALLEMU:
795 1.1 pgoyette if (!ISSET(t->p_slflag, PSL_SYSCALL) || t->p_stat != SSTOP) {
796 1.1 pgoyette error = EINVAL;
797 1.1 pgoyette break;
798 1.1 pgoyette }
799 1.1 pgoyette SET(t->p_slflag, PSL_SYSCALLEMU);
800 1.1 pgoyette break;
801 1.1 pgoyette
802 1.1 pgoyette case PT_KILL:
803 1.1 pgoyette /* just send the process a KILL signal. */
804 1.1 pgoyette signo = SIGKILL;
805 1.1 pgoyette goto sendsig; /* in PT_CONTINUE, above. */
806 1.1 pgoyette
807 1.1 pgoyette case PT_ATTACH:
808 1.1 pgoyette /*
809 1.1 pgoyette * Go ahead and set the trace flag.
810 1.1 pgoyette * Save the old parent (it's reset in
811 1.1 pgoyette * _DETACH, and also in kern_exit.c:wait4()
812 1.1 pgoyette * Reparent the process so that the tracing
813 1.1 pgoyette * proc gets to see all the action.
814 1.1 pgoyette * Stop the target.
815 1.1 pgoyette */
816 1.2 christos proc_changeparent(t, p);
817 1.4 christos signo = SIGSTOP;
818 1.1 pgoyette goto sendsig;
819 1.1 pgoyette
820 1.1 pgoyette case PT_GET_EVENT_MASK:
821 1.1 pgoyette if (data != sizeof(pe)) {
822 1.1 pgoyette DPRINTF(("ptrace(%d): %d != %zu\n", req,
823 1.1 pgoyette data, sizeof(pe)));
824 1.1 pgoyette error = EINVAL;
825 1.1 pgoyette break;
826 1.1 pgoyette }
827 1.1 pgoyette memset(&pe, 0, sizeof(pe));
828 1.1 pgoyette pe.pe_set_event = ISSET(t->p_slflag, PSL_TRACEFORK) ?
829 1.1 pgoyette PTRACE_FORK : 0;
830 1.1 pgoyette error = copyout(&pe, addr, sizeof(pe));
831 1.1 pgoyette break;
832 1.1 pgoyette
833 1.1 pgoyette case PT_SET_EVENT_MASK:
834 1.1 pgoyette if (data != sizeof(pe)) {
835 1.1 pgoyette DPRINTF(("ptrace(%d): %d != %zu\n", req, data,
836 1.1 pgoyette sizeof(pe)));
837 1.1 pgoyette error = EINVAL;
838 1.1 pgoyette break;
839 1.1 pgoyette }
840 1.1 pgoyette if ((error = copyin(addr, &pe, sizeof(pe))) != 0)
841 1.1 pgoyette return error;
842 1.1 pgoyette if (pe.pe_set_event & PTRACE_FORK)
843 1.1 pgoyette SET(t->p_slflag, PSL_TRACEFORK);
844 1.1 pgoyette else
845 1.1 pgoyette CLR(t->p_slflag, PSL_TRACEFORK);
846 1.1 pgoyette break;
847 1.1 pgoyette
848 1.1 pgoyette case PT_GET_PROCESS_STATE:
849 1.1 pgoyette if (data != sizeof(ps)) {
850 1.1 pgoyette DPRINTF(("ptrace(%d): %d != %zu\n", req, data,
851 1.1 pgoyette sizeof(ps)));
852 1.1 pgoyette error = EINVAL;
853 1.1 pgoyette break;
854 1.1 pgoyette }
855 1.1 pgoyette memset(&ps, 0, sizeof(ps));
856 1.1 pgoyette if (t->p_fpid) {
857 1.1 pgoyette ps.pe_report_event = PTRACE_FORK;
858 1.1 pgoyette ps.pe_other_pid = t->p_fpid;
859 1.1 pgoyette }
860 1.1 pgoyette error = copyout(&ps, addr, sizeof(ps));
861 1.1 pgoyette break;
862 1.1 pgoyette
863 1.1 pgoyette case PT_LWPINFO:
864 1.1 pgoyette if (data != sizeof(pl)) {
865 1.1 pgoyette DPRINTF(("ptrace(%d): %d != %zu\n", req, data,
866 1.1 pgoyette sizeof(pl)));
867 1.1 pgoyette error = EINVAL;
868 1.1 pgoyette break;
869 1.1 pgoyette }
870 1.1 pgoyette error = copyin(addr, &pl, sizeof(pl));
871 1.1 pgoyette if (error)
872 1.1 pgoyette break;
873 1.1 pgoyette tmp = pl.pl_lwpid;
874 1.1 pgoyette lwp_delref(lt);
875 1.1 pgoyette mutex_enter(t->p_lock);
876 1.1 pgoyette if (tmp == 0)
877 1.1 pgoyette lt = lwp_find_first(t);
878 1.1 pgoyette else {
879 1.1 pgoyette lt = lwp_find(t, tmp);
880 1.1 pgoyette if (lt == NULL) {
881 1.1 pgoyette mutex_exit(t->p_lock);
882 1.1 pgoyette error = ESRCH;
883 1.1 pgoyette break;
884 1.1 pgoyette }
885 1.1 pgoyette lt = LIST_NEXT(lt, l_sibling);
886 1.1 pgoyette }
887 1.1 pgoyette while (lt != NULL && !lwp_alive(lt))
888 1.1 pgoyette lt = LIST_NEXT(lt, l_sibling);
889 1.1 pgoyette pl.pl_lwpid = 0;
890 1.1 pgoyette pl.pl_event = 0;
891 1.1 pgoyette if (lt) {
892 1.1 pgoyette lwp_addref(lt);
893 1.1 pgoyette pl.pl_lwpid = lt->l_lid;
894 1.1 pgoyette if (lt->l_lid == t->p_sigctx.ps_lwp)
895 1.1 pgoyette pl.pl_event = PL_EVENT_SIGNAL;
896 1.1 pgoyette }
897 1.1 pgoyette mutex_exit(t->p_lock);
898 1.1 pgoyette
899 1.1 pgoyette error = copyout(&pl, addr, sizeof(pl));
900 1.1 pgoyette break;
901 1.1 pgoyette
902 1.1 pgoyette #ifdef PT_SETREGS
903 1.1 pgoyette case PT_SETREGS:
904 1.1 pgoyette write = 1;
905 1.1 pgoyette #endif
906 1.1 pgoyette #ifdef PT_GETREGS
907 1.1 pgoyette case PT_GETREGS:
908 1.1 pgoyette /* write = 0 done above. */
909 1.1 pgoyette #endif
910 1.1 pgoyette #if defined(PT_SETREGS) || defined(PT_GETREGS)
911 1.1 pgoyette tmp = data;
912 1.1 pgoyette if (tmp != 0 && t->p_nlwps > 1) {
913 1.1 pgoyette lwp_delref(lt);
914 1.1 pgoyette mutex_enter(t->p_lock);
915 1.1 pgoyette lt = lwp_find(t, tmp);
916 1.1 pgoyette if (lt == NULL) {
917 1.1 pgoyette mutex_exit(t->p_lock);
918 1.1 pgoyette error = ESRCH;
919 1.1 pgoyette break;
920 1.1 pgoyette }
921 1.1 pgoyette lwp_addref(lt);
922 1.1 pgoyette mutex_exit(t->p_lock);
923 1.1 pgoyette }
924 1.1 pgoyette if (!process_validregs(lt))
925 1.1 pgoyette error = EINVAL;
926 1.1 pgoyette else {
927 1.1 pgoyette error = proc_vmspace_getref(p, &vm);
928 1.1 pgoyette if (error)
929 1.1 pgoyette break;
930 1.1 pgoyette iov.iov_base = addr;
931 1.1 pgoyette iov.iov_len = PROC_REGSZ(p);
932 1.1 pgoyette uio.uio_iov = &iov;
933 1.1 pgoyette uio.uio_iovcnt = 1;
934 1.1 pgoyette uio.uio_offset = 0;
935 1.1 pgoyette uio.uio_resid = iov.iov_len;
936 1.1 pgoyette uio.uio_rw = write ? UIO_WRITE : UIO_READ;
937 1.1 pgoyette uio.uio_vmspace = vm;
938 1.1 pgoyette
939 1.1 pgoyette error = ptm->ptm_doregs(l, lt, &uio);
940 1.1 pgoyette uvmspace_free(vm);
941 1.1 pgoyette }
942 1.1 pgoyette break;
943 1.1 pgoyette #endif
944 1.1 pgoyette
945 1.1 pgoyette #ifdef PT_SETFPREGS
946 1.1 pgoyette case PT_SETFPREGS:
947 1.1 pgoyette write = 1;
948 1.5 christos /*FALLTHROUGH*/
949 1.1 pgoyette #endif
950 1.1 pgoyette #ifdef PT_GETFPREGS
951 1.1 pgoyette case PT_GETFPREGS:
952 1.1 pgoyette /* write = 0 done above. */
953 1.1 pgoyette #endif
954 1.1 pgoyette #if defined(PT_SETFPREGS) || defined(PT_GETFPREGS)
955 1.1 pgoyette tmp = data;
956 1.1 pgoyette if (tmp != 0 && t->p_nlwps > 1) {
957 1.1 pgoyette lwp_delref(lt);
958 1.1 pgoyette mutex_enter(t->p_lock);
959 1.1 pgoyette lt = lwp_find(t, tmp);
960 1.1 pgoyette if (lt == NULL) {
961 1.1 pgoyette mutex_exit(t->p_lock);
962 1.1 pgoyette error = ESRCH;
963 1.1 pgoyette break;
964 1.1 pgoyette }
965 1.1 pgoyette lwp_addref(lt);
966 1.1 pgoyette mutex_exit(t->p_lock);
967 1.1 pgoyette }
968 1.1 pgoyette if (!process_validfpregs(lt))
969 1.1 pgoyette error = EINVAL;
970 1.1 pgoyette else {
971 1.1 pgoyette error = proc_vmspace_getref(p, &vm);
972 1.1 pgoyette if (error)
973 1.1 pgoyette break;
974 1.1 pgoyette iov.iov_base = addr;
975 1.1 pgoyette iov.iov_len = PROC_FPREGSZ(p);
976 1.1 pgoyette uio.uio_iov = &iov;
977 1.1 pgoyette uio.uio_iovcnt = 1;
978 1.1 pgoyette uio.uio_offset = 0;
979 1.1 pgoyette uio.uio_resid = iov.iov_len;
980 1.1 pgoyette uio.uio_rw = write ? UIO_WRITE : UIO_READ;
981 1.1 pgoyette uio.uio_vmspace = vm;
982 1.1 pgoyette
983 1.1 pgoyette error = ptm->ptm_dofpregs(l, lt, &uio);
984 1.1 pgoyette uvmspace_free(vm);
985 1.1 pgoyette }
986 1.1 pgoyette break;
987 1.1 pgoyette #endif
988 1.1 pgoyette
989 1.1 pgoyette #ifdef __HAVE_PTRACE_MACHDEP
990 1.1 pgoyette PTRACE_MACHDEP_REQUEST_CASES
991 1.1 pgoyette error = ptrace_machdep_dorequest(l, lt, req, addr, data);
992 1.1 pgoyette break;
993 1.1 pgoyette #endif
994 1.1 pgoyette }
995 1.1 pgoyette
996 1.1 pgoyette if (pheld) {
997 1.1 pgoyette mutex_exit(t->p_lock);
998 1.1 pgoyette mutex_exit(proc_lock);
999 1.1 pgoyette }
1000 1.1 pgoyette if (lt != NULL)
1001 1.1 pgoyette lwp_delref(lt);
1002 1.1 pgoyette rw_exit(&t->p_reflock);
1003 1.1 pgoyette
1004 1.1 pgoyette return error;
1005 1.1 pgoyette }
1006 1.1 pgoyette
1007 1.1 pgoyette int
1008 1.1 pgoyette process_doregs(struct lwp *curl /*tracer*/,
1009 1.1 pgoyette struct lwp *l /*traced*/,
1010 1.1 pgoyette struct uio *uio)
1011 1.1 pgoyette {
1012 1.1 pgoyette #if defined(PT_GETREGS) || defined(PT_SETREGS)
1013 1.1 pgoyette int error;
1014 1.1 pgoyette struct reg r;
1015 1.1 pgoyette char *kv;
1016 1.1 pgoyette int kl;
1017 1.1 pgoyette
1018 1.1 pgoyette if (uio->uio_offset < 0 || uio->uio_offset > (off_t)sizeof(r))
1019 1.1 pgoyette return EINVAL;
1020 1.1 pgoyette
1021 1.1 pgoyette kl = sizeof(r);
1022 1.1 pgoyette kv = (char *)&r;
1023 1.1 pgoyette
1024 1.1 pgoyette kv += uio->uio_offset;
1025 1.1 pgoyette kl -= uio->uio_offset;
1026 1.1 pgoyette if ((size_t)kl > uio->uio_resid)
1027 1.1 pgoyette kl = uio->uio_resid;
1028 1.1 pgoyette
1029 1.1 pgoyette error = process_read_regs(l, &r);
1030 1.1 pgoyette if (error == 0)
1031 1.1 pgoyette error = uiomove(kv, kl, uio);
1032 1.1 pgoyette if (error == 0 && uio->uio_rw == UIO_WRITE) {
1033 1.1 pgoyette if (l->l_stat != LSSTOP)
1034 1.1 pgoyette error = EBUSY;
1035 1.1 pgoyette else
1036 1.1 pgoyette error = process_write_regs(l, &r);
1037 1.1 pgoyette }
1038 1.1 pgoyette
1039 1.1 pgoyette uio->uio_offset = 0;
1040 1.1 pgoyette return error;
1041 1.1 pgoyette #else
1042 1.1 pgoyette return EINVAL;
1043 1.1 pgoyette #endif
1044 1.1 pgoyette }
1045 1.1 pgoyette
1046 1.1 pgoyette int
1047 1.1 pgoyette process_validregs(struct lwp *l)
1048 1.1 pgoyette {
1049 1.1 pgoyette
1050 1.1 pgoyette #if defined(PT_SETREGS) || defined(PT_GETREGS)
1051 1.1 pgoyette return (l->l_flag & LW_SYSTEM) == 0;
1052 1.1 pgoyette #else
1053 1.1 pgoyette return 0;
1054 1.1 pgoyette #endif
1055 1.1 pgoyette }
1056 1.1 pgoyette
1057 1.1 pgoyette int
1058 1.1 pgoyette process_dofpregs(struct lwp *curl /*tracer*/,
1059 1.1 pgoyette struct lwp *l /*traced*/,
1060 1.1 pgoyette struct uio *uio)
1061 1.1 pgoyette {
1062 1.1 pgoyette #if defined(PT_GETFPREGS) || defined(PT_SETFPREGS)
1063 1.1 pgoyette int error;
1064 1.1 pgoyette struct fpreg r;
1065 1.1 pgoyette char *kv;
1066 1.1 pgoyette size_t kl;
1067 1.1 pgoyette
1068 1.1 pgoyette if (uio->uio_offset < 0 || uio->uio_offset > (off_t)sizeof(r))
1069 1.1 pgoyette return EINVAL;
1070 1.1 pgoyette
1071 1.1 pgoyette kl = sizeof(r);
1072 1.1 pgoyette kv = (char *)&r;
1073 1.1 pgoyette
1074 1.1 pgoyette kv += uio->uio_offset;
1075 1.1 pgoyette kl -= uio->uio_offset;
1076 1.1 pgoyette if (kl > uio->uio_resid)
1077 1.1 pgoyette kl = uio->uio_resid;
1078 1.1 pgoyette
1079 1.1 pgoyette error = process_read_fpregs(l, &r, &kl);
1080 1.1 pgoyette if (error == 0)
1081 1.1 pgoyette error = uiomove(kv, kl, uio);
1082 1.1 pgoyette if (error == 0 && uio->uio_rw == UIO_WRITE) {
1083 1.1 pgoyette if (l->l_stat != LSSTOP)
1084 1.1 pgoyette error = EBUSY;
1085 1.1 pgoyette else
1086 1.1 pgoyette error = process_write_fpregs(l, &r, kl);
1087 1.1 pgoyette }
1088 1.1 pgoyette uio->uio_offset = 0;
1089 1.1 pgoyette return error;
1090 1.1 pgoyette #else
1091 1.1 pgoyette return EINVAL;
1092 1.1 pgoyette #endif
1093 1.1 pgoyette }
1094 1.1 pgoyette
1095 1.1 pgoyette int
1096 1.1 pgoyette process_validfpregs(struct lwp *l)
1097 1.1 pgoyette {
1098 1.1 pgoyette
1099 1.1 pgoyette #if defined(PT_SETFPREGS) || defined(PT_GETFPREGS)
1100 1.1 pgoyette return (l->l_flag & LW_SYSTEM) == 0;
1101 1.1 pgoyette #else
1102 1.1 pgoyette return 0;
1103 1.1 pgoyette #endif
1104 1.1 pgoyette }
1105 1.1 pgoyette
1106 1.1 pgoyette static int
1107 1.1 pgoyette process_auxv_offset(struct proc *p, struct uio *uio)
1108 1.1 pgoyette {
1109 1.1 pgoyette struct ps_strings pss;
1110 1.1 pgoyette int error;
1111 1.1 pgoyette off_t off = (off_t)p->p_psstrp;
1112 1.1 pgoyette
1113 1.1 pgoyette if ((error = copyin_psstrings(p, &pss)) != 0)
1114 1.1 pgoyette return error;
1115 1.1 pgoyette
1116 1.1 pgoyette if (pss.ps_envstr == NULL)
1117 1.1 pgoyette return EIO;
1118 1.1 pgoyette
1119 1.1 pgoyette uio->uio_offset += (off_t)(vaddr_t)(pss.ps_envstr + pss.ps_nenvstr + 1);
1120 1.1 pgoyette #ifdef __MACHINE_STACK_GROWS_UP
1121 1.1 pgoyette if (uio->uio_offset < off)
1122 1.1 pgoyette return EIO;
1123 1.1 pgoyette #else
1124 1.1 pgoyette if (uio->uio_offset > off)
1125 1.1 pgoyette return EIO;
1126 1.1 pgoyette if ((uio->uio_offset + uio->uio_resid) > off)
1127 1.1 pgoyette uio->uio_resid = off - uio->uio_offset;
1128 1.1 pgoyette #endif
1129 1.1 pgoyette return 0;
1130 1.1 pgoyette }
1131 1.1 pgoyette #endif /* PTRACE */
1132 1.1 pgoyette
1133 1.1 pgoyette MODULE(MODULE_CLASS_EXEC, ptrace_common, "");
1134 1.1 pgoyette
1135 1.1 pgoyette static int
1136 1.1 pgoyette ptrace_common_modcmd(modcmd_t cmd, void *arg)
1137 1.1 pgoyette {
1138 1.1 pgoyette int error;
1139 1.1 pgoyette
1140 1.1 pgoyette switch (cmd) {
1141 1.1 pgoyette case MODULE_CMD_INIT:
1142 1.1 pgoyette error = ptrace_init();
1143 1.1 pgoyette break;
1144 1.1 pgoyette case MODULE_CMD_FINI:
1145 1.1 pgoyette error = ptrace_fini();
1146 1.1 pgoyette break;
1147 1.1 pgoyette default:
1148 1.1 pgoyette ptrace_hooks();
1149 1.1 pgoyette error = ENOTTY;
1150 1.1 pgoyette break;
1151 1.1 pgoyette }
1152 1.1 pgoyette return error;
1153 1.1 pgoyette }
1154 1.1 pgoyette
1155