kern_ktrace.c revision 1.1 1 1.1 cgd /*
2 1.1 cgd * Copyright (c) 1989 The Regents of the University of California.
3 1.1 cgd * All rights reserved.
4 1.1 cgd *
5 1.1 cgd * Redistribution and use in source and binary forms, with or without
6 1.1 cgd * modification, are permitted provided that the following conditions
7 1.1 cgd * are met:
8 1.1 cgd * 1. Redistributions of source code must retain the above copyright
9 1.1 cgd * notice, this list of conditions and the following disclaimer.
10 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer in the
12 1.1 cgd * documentation and/or other materials provided with the distribution.
13 1.1 cgd * 3. All advertising materials mentioning features or use of this software
14 1.1 cgd * must display the following acknowledgement:
15 1.1 cgd * This product includes software developed by the University of
16 1.1 cgd * California, Berkeley and its contributors.
17 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
18 1.1 cgd * may be used to endorse or promote products derived from this software
19 1.1 cgd * without specific prior written permission.
20 1.1 cgd *
21 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 1.1 cgd * SUCH DAMAGE.
32 1.1 cgd *
33 1.1 cgd * @(#)kern_ktrace.c 7.15 (Berkeley) 6/21/91
34 1.1 cgd */
35 1.1 cgd
36 1.1 cgd #ifdef KTRACE
37 1.1 cgd
38 1.1 cgd #include "param.h"
39 1.1 cgd #include "proc.h"
40 1.1 cgd #include "file.h"
41 1.1 cgd #include "namei.h"
42 1.1 cgd #include "vnode.h"
43 1.1 cgd #include "ktrace.h"
44 1.1 cgd #include "malloc.h"
45 1.1 cgd #include "syslog.h"
46 1.1 cgd
47 1.1 cgd struct ktr_header *
48 1.1 cgd ktrgetheader(type)
49 1.1 cgd {
50 1.1 cgd register struct ktr_header *kth;
51 1.1 cgd struct proc *p = curproc; /* XXX */
52 1.1 cgd
53 1.1 cgd MALLOC(kth, struct ktr_header *, sizeof (struct ktr_header),
54 1.1 cgd M_TEMP, M_WAITOK);
55 1.1 cgd kth->ktr_type = type;
56 1.1 cgd microtime(&kth->ktr_time);
57 1.1 cgd kth->ktr_pid = p->p_pid;
58 1.1 cgd bcopy(p->p_comm, kth->ktr_comm, MAXCOMLEN);
59 1.1 cgd return (kth);
60 1.1 cgd }
61 1.1 cgd
62 1.1 cgd ktrsyscall(vp, code, narg, args)
63 1.1 cgd struct vnode *vp;
64 1.1 cgd int code, narg, args[];
65 1.1 cgd {
66 1.1 cgd struct ktr_header *kth = ktrgetheader(KTR_SYSCALL);
67 1.1 cgd struct ktr_syscall *ktp;
68 1.1 cgd register len = sizeof(struct ktr_syscall) + (narg * sizeof(int));
69 1.1 cgd int *argp, i;
70 1.1 cgd
71 1.1 cgd MALLOC(ktp, struct ktr_syscall *, len, M_TEMP, M_WAITOK);
72 1.1 cgd ktp->ktr_code = code;
73 1.1 cgd ktp->ktr_narg = narg;
74 1.1 cgd argp = (int *)((char *)ktp + sizeof(struct ktr_syscall));
75 1.1 cgd for (i = 0; i < narg; i++)
76 1.1 cgd *argp++ = args[i];
77 1.1 cgd kth->ktr_buf = (caddr_t)ktp;
78 1.1 cgd kth->ktr_len = len;
79 1.1 cgd ktrwrite(vp, kth);
80 1.1 cgd FREE(ktp, M_TEMP);
81 1.1 cgd FREE(kth, M_TEMP);
82 1.1 cgd }
83 1.1 cgd
84 1.1 cgd ktrsysret(vp, code, error, retval)
85 1.1 cgd struct vnode *vp;
86 1.1 cgd int code, error, retval;
87 1.1 cgd {
88 1.1 cgd struct ktr_header *kth = ktrgetheader(KTR_SYSRET);
89 1.1 cgd struct ktr_sysret ktp;
90 1.1 cgd
91 1.1 cgd ktp.ktr_code = code;
92 1.1 cgd ktp.ktr_error = error;
93 1.1 cgd ktp.ktr_retval = retval; /* what about val2 ? */
94 1.1 cgd
95 1.1 cgd kth->ktr_buf = (caddr_t)&ktp;
96 1.1 cgd kth->ktr_len = sizeof(struct ktr_sysret);
97 1.1 cgd
98 1.1 cgd ktrwrite(vp, kth);
99 1.1 cgd FREE(kth, M_TEMP);
100 1.1 cgd }
101 1.1 cgd
102 1.1 cgd ktrnamei(vp, path)
103 1.1 cgd struct vnode *vp;
104 1.1 cgd char *path;
105 1.1 cgd {
106 1.1 cgd struct ktr_header *kth = ktrgetheader(KTR_NAMEI);
107 1.1 cgd
108 1.1 cgd kth->ktr_len = strlen(path);
109 1.1 cgd kth->ktr_buf = path;
110 1.1 cgd
111 1.1 cgd ktrwrite(vp, kth);
112 1.1 cgd FREE(kth, M_TEMP);
113 1.1 cgd }
114 1.1 cgd
115 1.1 cgd ktrgenio(vp, fd, rw, iov, len, error)
116 1.1 cgd struct vnode *vp;
117 1.1 cgd int fd;
118 1.1 cgd enum uio_rw rw;
119 1.1 cgd register struct iovec *iov;
120 1.1 cgd {
121 1.1 cgd struct ktr_header *kth = ktrgetheader(KTR_GENIO);
122 1.1 cgd register struct ktr_genio *ktp;
123 1.1 cgd register caddr_t cp;
124 1.1 cgd register int resid = len, cnt;
125 1.1 cgd
126 1.1 cgd if (error)
127 1.1 cgd return;
128 1.1 cgd MALLOC(ktp, struct ktr_genio *, sizeof(struct ktr_genio) + len,
129 1.1 cgd M_TEMP, M_WAITOK);
130 1.1 cgd ktp->ktr_fd = fd;
131 1.1 cgd ktp->ktr_rw = rw;
132 1.1 cgd cp = (caddr_t)((char *)ktp + sizeof (struct ktr_genio));
133 1.1 cgd while (resid > 0) {
134 1.1 cgd if ((cnt = iov->iov_len) > resid)
135 1.1 cgd cnt = resid;
136 1.1 cgd if (copyin(iov->iov_base, cp, (unsigned)cnt))
137 1.1 cgd goto done;
138 1.1 cgd cp += cnt;
139 1.1 cgd resid -= cnt;
140 1.1 cgd iov++;
141 1.1 cgd }
142 1.1 cgd kth->ktr_buf = (caddr_t)ktp;
143 1.1 cgd kth->ktr_len = sizeof (struct ktr_genio) + len;
144 1.1 cgd
145 1.1 cgd ktrwrite(vp, kth);
146 1.1 cgd done:
147 1.1 cgd FREE(kth, M_TEMP);
148 1.1 cgd FREE(ktp, M_TEMP);
149 1.1 cgd }
150 1.1 cgd
151 1.1 cgd ktrpsig(vp, sig, action, mask, code)
152 1.1 cgd struct vnode *vp;
153 1.1 cgd sig_t action;
154 1.1 cgd {
155 1.1 cgd struct ktr_header *kth = ktrgetheader(KTR_PSIG);
156 1.1 cgd struct ktr_psig kp;
157 1.1 cgd
158 1.1 cgd kp.signo = (char)sig;
159 1.1 cgd kp.action = action;
160 1.1 cgd kp.mask = mask;
161 1.1 cgd kp.code = code;
162 1.1 cgd kth->ktr_buf = (caddr_t)&kp;
163 1.1 cgd kth->ktr_len = sizeof (struct ktr_psig);
164 1.1 cgd
165 1.1 cgd ktrwrite(vp, kth);
166 1.1 cgd FREE(kth, M_TEMP);
167 1.1 cgd }
168 1.1 cgd
169 1.1 cgd /* Interface and common routines */
170 1.1 cgd
171 1.1 cgd /*
172 1.1 cgd * ktrace system call
173 1.1 cgd */
174 1.1 cgd /* ARGSUSED */
175 1.1 cgd ktrace(curp, uap, retval)
176 1.1 cgd struct proc *curp;
177 1.1 cgd register struct args {
178 1.1 cgd char *fname;
179 1.1 cgd int ops;
180 1.1 cgd int facs;
181 1.1 cgd int pid;
182 1.1 cgd } *uap;
183 1.1 cgd int *retval;
184 1.1 cgd {
185 1.1 cgd register struct vnode *vp = NULL;
186 1.1 cgd register struct proc *p;
187 1.1 cgd struct pgrp *pg;
188 1.1 cgd int facs = uap->facs & ~KTRFAC_ROOT;
189 1.1 cgd int ops = KTROP(uap->ops);
190 1.1 cgd int descend = uap->ops & KTRFLAG_DESCEND;
191 1.1 cgd int ret = 0;
192 1.1 cgd int error = 0;
193 1.1 cgd struct nameidata nd;
194 1.1 cgd
195 1.1 cgd if (ops != KTROP_CLEAR) {
196 1.1 cgd /*
197 1.1 cgd * an operation which requires a file argument.
198 1.1 cgd */
199 1.1 cgd nd.ni_segflg = UIO_USERSPACE;
200 1.1 cgd nd.ni_dirp = uap->fname;
201 1.1 cgd if (error = vn_open(&nd, curp, FREAD|FWRITE, 0))
202 1.1 cgd return (error);
203 1.1 cgd vp = nd.ni_vp;
204 1.1 cgd VOP_UNLOCK(vp);
205 1.1 cgd if (vp->v_type != VREG) {
206 1.1 cgd (void) vn_close(vp, FREAD|FWRITE, curp->p_ucred, curp);
207 1.1 cgd return (EACCES);
208 1.1 cgd }
209 1.1 cgd }
210 1.1 cgd /*
211 1.1 cgd * Clear all uses of the tracefile
212 1.1 cgd */
213 1.1 cgd if (ops == KTROP_CLEARFILE) {
214 1.1 cgd for (p = allproc; p != NULL; p = p->p_nxt) {
215 1.1 cgd if (p->p_tracep == vp) {
216 1.1 cgd if (ktrcanset(curp, p)) {
217 1.1 cgd p->p_tracep = NULL;
218 1.1 cgd p->p_traceflag = 0;
219 1.1 cgd (void) vn_close(vp, FREAD|FWRITE,
220 1.1 cgd p->p_ucred, p);
221 1.1 cgd } else
222 1.1 cgd error = EPERM;
223 1.1 cgd }
224 1.1 cgd }
225 1.1 cgd goto done;
226 1.1 cgd }
227 1.1 cgd /*
228 1.1 cgd * need something to (un)trace (XXX - why is this here?)
229 1.1 cgd */
230 1.1 cgd if (!facs) {
231 1.1 cgd error = EINVAL;
232 1.1 cgd goto done;
233 1.1 cgd }
234 1.1 cgd /*
235 1.1 cgd * do it
236 1.1 cgd */
237 1.1 cgd if (uap->pid < 0) {
238 1.1 cgd /*
239 1.1 cgd * by process group
240 1.1 cgd */
241 1.1 cgd pg = pgfind(-uap->pid);
242 1.1 cgd if (pg == NULL) {
243 1.1 cgd error = ESRCH;
244 1.1 cgd goto done;
245 1.1 cgd }
246 1.1 cgd for (p = pg->pg_mem; p != NULL; p = p->p_pgrpnxt)
247 1.1 cgd if (descend)
248 1.1 cgd ret |= ktrsetchildren(curp, p, ops, facs, vp);
249 1.1 cgd else
250 1.1 cgd ret |= ktrops(curp, p, ops, facs, vp);
251 1.1 cgd
252 1.1 cgd } else {
253 1.1 cgd /*
254 1.1 cgd * by pid
255 1.1 cgd */
256 1.1 cgd p = pfind(uap->pid);
257 1.1 cgd if (p == NULL) {
258 1.1 cgd error = ESRCH;
259 1.1 cgd goto done;
260 1.1 cgd }
261 1.1 cgd if (descend)
262 1.1 cgd ret |= ktrsetchildren(curp, p, ops, facs, vp);
263 1.1 cgd else
264 1.1 cgd ret |= ktrops(curp, p, ops, facs, vp);
265 1.1 cgd }
266 1.1 cgd if (!ret)
267 1.1 cgd error = EPERM;
268 1.1 cgd done:
269 1.1 cgd if (vp != NULL)
270 1.1 cgd (void) vn_close(vp, FWRITE, curp->p_ucred, curp);
271 1.1 cgd return (error);
272 1.1 cgd }
273 1.1 cgd
274 1.1 cgd ktrops(curp, p, ops, facs, vp)
275 1.1 cgd struct proc *curp, *p;
276 1.1 cgd struct vnode *vp;
277 1.1 cgd {
278 1.1 cgd
279 1.1 cgd if (!ktrcanset(curp, p))
280 1.1 cgd return (0);
281 1.1 cgd if (ops == KTROP_SET) {
282 1.1 cgd if (p->p_tracep != vp) {
283 1.1 cgd /*
284 1.1 cgd * if trace file already in use, relinquish
285 1.1 cgd */
286 1.1 cgd if (p->p_tracep != NULL)
287 1.1 cgd vrele(p->p_tracep);
288 1.1 cgd VREF(vp);
289 1.1 cgd p->p_tracep = vp;
290 1.1 cgd }
291 1.1 cgd p->p_traceflag |= facs;
292 1.1 cgd if (curp->p_ucred->cr_uid == 0)
293 1.1 cgd p->p_traceflag |= KTRFAC_ROOT;
294 1.1 cgd } else {
295 1.1 cgd /* KTROP_CLEAR */
296 1.1 cgd if (((p->p_traceflag &= ~facs) & KTRFAC_MASK) == 0) {
297 1.1 cgd /* no more tracing */
298 1.1 cgd p->p_traceflag = 0;
299 1.1 cgd if (p->p_tracep != NULL) {
300 1.1 cgd vrele(p->p_tracep);
301 1.1 cgd p->p_tracep = NULL;
302 1.1 cgd }
303 1.1 cgd }
304 1.1 cgd }
305 1.1 cgd
306 1.1 cgd return (1);
307 1.1 cgd }
308 1.1 cgd
309 1.1 cgd ktrsetchildren(curp, top, ops, facs, vp)
310 1.1 cgd struct proc *curp, *top;
311 1.1 cgd struct vnode *vp;
312 1.1 cgd {
313 1.1 cgd register struct proc *p;
314 1.1 cgd register int ret = 0;
315 1.1 cgd
316 1.1 cgd p = top;
317 1.1 cgd for (;;) {
318 1.1 cgd ret |= ktrops(curp, p, ops, facs, vp);
319 1.1 cgd /*
320 1.1 cgd * If this process has children, descend to them next,
321 1.1 cgd * otherwise do any siblings, and if done with this level,
322 1.1 cgd * follow back up the tree (but not past top).
323 1.1 cgd */
324 1.1 cgd if (p->p_cptr)
325 1.1 cgd p = p->p_cptr;
326 1.1 cgd else if (p == top)
327 1.1 cgd return (ret);
328 1.1 cgd else if (p->p_osptr)
329 1.1 cgd p = p->p_osptr;
330 1.1 cgd else for (;;) {
331 1.1 cgd p = p->p_pptr;
332 1.1 cgd if (p == top)
333 1.1 cgd return (ret);
334 1.1 cgd if (p->p_osptr) {
335 1.1 cgd p = p->p_osptr;
336 1.1 cgd break;
337 1.1 cgd }
338 1.1 cgd }
339 1.1 cgd }
340 1.1 cgd /*NOTREACHED*/
341 1.1 cgd }
342 1.1 cgd
343 1.1 cgd ktrwrite(vp, kth)
344 1.1 cgd struct vnode *vp;
345 1.1 cgd register struct ktr_header *kth;
346 1.1 cgd {
347 1.1 cgd struct uio auio;
348 1.1 cgd struct iovec aiov[2];
349 1.1 cgd register struct proc *p = curproc; /* XXX */
350 1.1 cgd int error;
351 1.1 cgd
352 1.1 cgd if (vp == NULL)
353 1.1 cgd return;
354 1.1 cgd auio.uio_iov = &aiov[0];
355 1.1 cgd auio.uio_offset = 0;
356 1.1 cgd auio.uio_segflg = UIO_SYSSPACE;
357 1.1 cgd auio.uio_rw = UIO_WRITE;
358 1.1 cgd aiov[0].iov_base = (caddr_t)kth;
359 1.1 cgd aiov[0].iov_len = sizeof(struct ktr_header);
360 1.1 cgd auio.uio_resid = sizeof(struct ktr_header);
361 1.1 cgd auio.uio_iovcnt = 1;
362 1.1 cgd auio.uio_procp = (struct proc *)0;
363 1.1 cgd if (kth->ktr_len > 0) {
364 1.1 cgd auio.uio_iovcnt++;
365 1.1 cgd aiov[1].iov_base = kth->ktr_buf;
366 1.1 cgd aiov[1].iov_len = kth->ktr_len;
367 1.1 cgd auio.uio_resid += kth->ktr_len;
368 1.1 cgd }
369 1.1 cgd VOP_LOCK(vp);
370 1.1 cgd error = VOP_WRITE(vp, &auio, IO_UNIT|IO_APPEND, p->p_ucred);
371 1.1 cgd VOP_UNLOCK(vp);
372 1.1 cgd if (!error)
373 1.1 cgd return;
374 1.1 cgd /*
375 1.1 cgd * If error encountered, give up tracing on this vnode.
376 1.1 cgd */
377 1.1 cgd log(LOG_NOTICE, "ktrace write failed, errno %d, tracing stopped\n",
378 1.1 cgd error);
379 1.1 cgd for (p = allproc; p != NULL; p = p->p_nxt) {
380 1.1 cgd if (p->p_tracep == vp) {
381 1.1 cgd p->p_tracep = NULL;
382 1.1 cgd p->p_traceflag = 0;
383 1.1 cgd vrele(vp);
384 1.1 cgd }
385 1.1 cgd }
386 1.1 cgd }
387 1.1 cgd
388 1.1 cgd /*
389 1.1 cgd * Return true if caller has permission to set the ktracing state
390 1.1 cgd * of target. Essentially, the target can't possess any
391 1.1 cgd * more permissions than the caller. KTRFAC_ROOT signifies that
392 1.1 cgd * root previously set the tracing status on the target process, and
393 1.1 cgd * so, only root may further change it.
394 1.1 cgd *
395 1.1 cgd * TODO: check groups. use caller effective gid.
396 1.1 cgd */
397 1.1 cgd ktrcanset(callp, targetp)
398 1.1 cgd struct proc *callp, *targetp;
399 1.1 cgd {
400 1.1 cgd register struct pcred *caller = callp->p_cred;
401 1.1 cgd register struct pcred *target = targetp->p_cred;
402 1.1 cgd
403 1.1 cgd if ((caller->pc_ucred->cr_uid == target->p_ruid &&
404 1.1 cgd target->p_ruid == target->p_svuid &&
405 1.1 cgd caller->p_rgid == target->p_rgid && /* XXX */
406 1.1 cgd target->p_rgid == target->p_svgid &&
407 1.1 cgd (targetp->p_traceflag & KTRFAC_ROOT) == 0) ||
408 1.1 cgd caller->pc_ucred->cr_uid == 0)
409 1.1 cgd return (1);
410 1.1 cgd
411 1.1 cgd return (0);
412 1.1 cgd }
413 1.1 cgd
414 1.1 cgd #endif
415