procfs_mem.c revision 1.26 1 /* $NetBSD: procfs_mem.c,v 1.26 2000/09/26 23:28:01 thorpej Exp $ */
2
3 /*
4 * Copyright (c) 1993 Jan-Simon Pendry
5 * Copyright (c) 1993 Sean Eric Fagan
6 * Copyright (c) 1993
7 * The Regents of the University of California. All rights reserved.
8 *
9 * This code is derived from software contributed to Berkeley by
10 * Jan-Simon Pendry and Sean Eric Fagan.
11 *
12 * Redistribution and use in source and binary forms, with or without
13 * modification, are permitted provided that the following conditions
14 * are met:
15 * 1. Redistributions of source code must retain the above copyright
16 * notice, this list of conditions and the following disclaimer.
17 * 2. Redistributions in binary form must reproduce the above copyright
18 * notice, this list of conditions and the following disclaimer in the
19 * documentation and/or other materials provided with the distribution.
20 * 3. All advertising materials mentioning features or use of this software
21 * must display the following acknowledgement:
22 * This product includes software developed by the University of
23 * California, Berkeley and its contributors.
24 * 4. Neither the name of the University nor the names of its contributors
25 * may be used to endorse or promote products derived from this software
26 * without specific prior written permission.
27 *
28 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
29 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
30 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
31 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
32 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
33 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
34 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
35 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
36 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
37 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
38 * SUCH DAMAGE.
39 *
40 * @(#)procfs_mem.c 8.5 (Berkeley) 6/15/94
41 */
42
43 /*
44 * This is a lightly hacked and merged version
45 * of sef's pread/pwrite functions
46 */
47
48 #include <sys/param.h>
49 #include <sys/systm.h>
50 #include <sys/time.h>
51 #include <sys/kernel.h>
52 #include <sys/proc.h>
53 #include <sys/vnode.h>
54
55 #include <miscfs/procfs/procfs.h>
56
57 #include <uvm/uvm_extern.h>
58
59 #define ISSET(t, f) ((t) & (f))
60
61 /*
62 * Copy data in and out of the target process.
63 * We do this by mapping the process's page into
64 * the kernel and then doing a uiomove direct
65 * from the kernel address space.
66 */
67 int
68 procfs_domem(curp, p, pfs, uio)
69 struct proc *curp; /* tracer */
70 struct proc *p; /* traced */
71 struct pfsnode *pfs;
72 struct uio *uio;
73 {
74 int error;
75
76 size_t len;
77 vaddr_t addr;
78
79 len = uio->uio_resid;
80
81 if (len == 0)
82 return (0);
83
84 addr = uio->uio_offset;
85
86 if ((error = procfs_checkioperm(curp, p)) != 0)
87 return (error);
88
89 /* XXXCDC: how should locking work here? */
90 if ((p->p_flag & P_WEXIT) || (p->p_vmspace->vm_refcnt < 1))
91 return(EFAULT);
92 p->p_vmspace->vm_refcnt++; /* XXX */
93 error = uvm_io(&p->p_vmspace->vm_map, uio);
94 uvmspace_free(p->p_vmspace);
95
96 #ifdef PMAP_NEED_PROCWR
97 if (uio->uio_rw == UIO_WRITE)
98 pmap_procwr(p, addr, len);
99 #endif
100 return (error);
101 }
102
103 /*
104 * Given process (p), find the vnode from which
105 * it's text segment is being executed.
106 *
107 * It would be nice to grab this information from
108 * the VM system, however, there is no sure-fire
109 * way of doing that. Instead, fork(), exec() and
110 * wait() all maintain the p_textvp field in the
111 * process proc structure which contains a held
112 * reference to the exec'ed vnode.
113 */
114 struct vnode *
115 procfs_findtextvp(p)
116 struct proc *p;
117 {
118
119 return (p->p_textvp);
120 }
121
122 /*
123 * Ensure that a process has permission to perform I/O on another.
124 * Arguments:
125 * p The process wishing to do the I/O (the tracer).
126 * t The process who's memory/registers will be read/written.
127 */
128 int
129 procfs_checkioperm(p, t)
130 struct proc *p, *t;
131 {
132 int error;
133
134 /*
135 * You cannot attach to a processes mem/regs if:
136 *
137 * (1) it's not owned by you, or is set-id on exec
138 * (unless you're root), or...
139 */
140 if ((t->p_cred->p_ruid != p->p_cred->p_ruid ||
141 ISSET(t->p_flag, P_SUGID)) &&
142 (error = suser(p->p_ucred, &p->p_acflag)) != 0)
143 return (error);
144
145 /*
146 * (2) ...it's init, which controls the security level
147 * of the entire system, and the system was not
148 * compiled with permanetly insecure mode turned on.
149 */
150 if (t == initproc && securelevel > -1)
151 return (EPERM);
152
153 /*
154 * (3) the tracer is chrooted, and its root directory is
155 * not at or above the root directory of the tracee
156 */
157
158 if (!proc_isunder(t, p))
159 return EPERM;
160
161 return (0);
162 }
163
164 #ifdef probably_never
165 /*
166 * Given process (p), find the vnode from which
167 * it's text segment is being mapped.
168 *
169 * (This is here, rather than in procfs_subr in order
170 * to keep all the VM related code in one place.)
171 */
172 struct vnode *
173 procfs_findtextvp(p)
174 struct proc *p;
175 {
176 int error;
177 vm_object_t object;
178 vaddr_t pageno; /* page number */
179
180 /* find a vnode pager for the user address space */
181
182 for (pageno = VM_MIN_ADDRESS;
183 pageno < VM_MAXUSER_ADDRESS;
184 pageno += PAGE_SIZE) {
185 vm_map_t map;
186 vm_map_entry_t out_entry;
187 vm_prot_t out_prot;
188 boolean_t wired, single_use;
189 vaddr_t off;
190
191 map = &p->p_vmspace->vm_map;
192 error = vm_map_lookup(&map, pageno,
193 VM_PROT_READ,
194 &out_entry, &object, &off, &out_prot,
195 &wired, &single_use);
196
197 if (!error) {
198 vm_pager_t pager;
199
200 printf("procfs: found vm object\n");
201 vm_map_lookup_done(map, out_entry);
202 printf("procfs: vm object = %p\n", object);
203
204 /*
205 * At this point, assuming no errors, object
206 * is the VM object mapping UVA (pageno).
207 * Ensure it has a vnode pager, then grab
208 * the vnode from that pager's handle.
209 */
210
211 pager = object->pager;
212 printf("procfs: pager = %p\n", pager);
213 if (pager)
214 printf("procfs: found pager, type = %d\n",
215 pager->pg_type);
216 if (pager && pager->pg_type == PG_VNODE) {
217 struct vnode *vp;
218
219 vp = (struct vnode *) pager->pg_handle;
220 printf("procfs: vp = %p\n", vp);
221 return (vp);
222 }
223 }
224 }
225
226 printf("procfs: text object not found\n");
227 return (0);
228 }
229 #endif /* probably_never */
230