kern_ras.c revision 1.4 1 1.4 thorpej /* $NetBSD: kern_ras.c,v 1.4 2003/01/18 10:06:29 thorpej Exp $ */
2 1.1 gmcgarry
3 1.1 gmcgarry /*-
4 1.1 gmcgarry * Copyright (c) 2002 The NetBSD Foundation, Inc.
5 1.1 gmcgarry * All rights reserved.
6 1.1 gmcgarry *
7 1.1 gmcgarry * This code is derived from software contributed to The NetBSD Foundation
8 1.1 gmcgarry * by Gregory McGarry.
9 1.1 gmcgarry *
10 1.1 gmcgarry * Redistribution and use in source and binary forms, with or without
11 1.1 gmcgarry * modification, are permitted provided that the following conditions
12 1.1 gmcgarry * are met:
13 1.1 gmcgarry * 1. Redistributions of source code must retain the above copyright
14 1.1 gmcgarry * notice, this list of conditions and the following disclaimer.
15 1.1 gmcgarry * 2. Redistributions in binary form must reproduce the above copyright
16 1.1 gmcgarry * notice, this list of conditions and the following disclaimer in the
17 1.1 gmcgarry * documentation and/or other materials provided with the distribution.
18 1.1 gmcgarry * 3. All advertising materials mentioning features or use of this software
19 1.1 gmcgarry * must display the following acknowledgement:
20 1.1 gmcgarry * This product includes software developed by the NetBSD
21 1.1 gmcgarry * Foundation, Inc. and its contributors.
22 1.1 gmcgarry * 4. Neither the name of The NetBSD Foundation nor the names of its
23 1.1 gmcgarry * contributors may be used to endorse or promote products derived
24 1.1 gmcgarry * from this software without specific prior written permission.
25 1.1 gmcgarry *
26 1.1 gmcgarry * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
27 1.1 gmcgarry * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
28 1.1 gmcgarry * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
29 1.1 gmcgarry * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
30 1.1 gmcgarry * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
31 1.1 gmcgarry * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
32 1.1 gmcgarry * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
33 1.1 gmcgarry * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
34 1.1 gmcgarry * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
35 1.1 gmcgarry * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
36 1.1 gmcgarry * POSSIBILITY OF SUCH DAMAGE.
37 1.1 gmcgarry */
38 1.1 gmcgarry
39 1.1 gmcgarry #include <sys/cdefs.h>
40 1.4 thorpej __KERNEL_RCSID(0, "$NetBSD: kern_ras.c,v 1.4 2003/01/18 10:06:29 thorpej Exp $");
41 1.1 gmcgarry
42 1.1 gmcgarry #include <sys/param.h>
43 1.1 gmcgarry #include <sys/lock.h>
44 1.1 gmcgarry #include <sys/systm.h>
45 1.1 gmcgarry #include <sys/pool.h>
46 1.1 gmcgarry #include <sys/proc.h>
47 1.1 gmcgarry #include <sys/ras.h>
48 1.4 thorpej #include <sys/sa.h>
49 1.4 thorpej #include <sys/savar.h>
50 1.1 gmcgarry
51 1.1 gmcgarry #include <sys/mount.h>
52 1.1 gmcgarry #include <sys/syscallargs.h>
53 1.1 gmcgarry
54 1.1 gmcgarry #include <uvm/uvm_extern.h>
55 1.1 gmcgarry
56 1.1 gmcgarry #define MAX_RAS_PER_PROC 16
57 1.1 gmcgarry
58 1.3 thorpej u_int ras_per_proc = MAX_RAS_PER_PROC;
59 1.1 gmcgarry
60 1.1 gmcgarry #ifdef DEBUG
61 1.1 gmcgarry int ras_debug = 0;
62 1.1 gmcgarry #define DPRINTF(x) if (ras_debug) printf x
63 1.1 gmcgarry #else
64 1.1 gmcgarry #define DPRINTF(x) /* nothing */
65 1.1 gmcgarry #endif
66 1.1 gmcgarry
67 1.1 gmcgarry int ras_install(struct proc *, caddr_t, size_t);
68 1.1 gmcgarry int ras_purge(struct proc *, caddr_t, size_t);
69 1.1 gmcgarry
70 1.1 gmcgarry extern struct pool ras_pool;
71 1.1 gmcgarry
72 1.1 gmcgarry /*
73 1.1 gmcgarry * Check the specified address to see if it is within the
74 1.1 gmcgarry * sequence. If it is found, we return the restart address,
75 1.1 gmcgarry * otherwise we return -1. If we do perform a restart, we
76 1.1 gmcgarry * mark the sequence as hit.
77 1.1 gmcgarry */
78 1.1 gmcgarry caddr_t
79 1.1 gmcgarry ras_lookup(struct proc *p, caddr_t addr)
80 1.1 gmcgarry {
81 1.1 gmcgarry struct ras *rp;
82 1.1 gmcgarry
83 1.1 gmcgarry #ifdef DIAGNOSTIC
84 1.1 gmcgarry if (addr < (caddr_t)VM_MIN_ADDRESS ||
85 1.1 gmcgarry addr > (caddr_t)VM_MAXUSER_ADDRESS)
86 1.1 gmcgarry return ((caddr_t)-1);
87 1.1 gmcgarry #endif
88 1.1 gmcgarry
89 1.1 gmcgarry simple_lock(&p->p_raslock);
90 1.1 gmcgarry LIST_FOREACH(rp, &p->p_raslist, ras_list) {
91 1.1 gmcgarry if (addr > rp->ras_startaddr && addr < rp->ras_endaddr) {
92 1.1 gmcgarry rp->ras_hits++;
93 1.1 gmcgarry simple_unlock(&p->p_raslock);
94 1.1 gmcgarry #ifdef DIAGNOSTIC
95 1.1 gmcgarry DPRINTF(("RAS hit: p=%p %p\n", p, addr));
96 1.1 gmcgarry #endif
97 1.1 gmcgarry return (rp->ras_startaddr);
98 1.1 gmcgarry }
99 1.1 gmcgarry }
100 1.1 gmcgarry simple_unlock(&p->p_raslock);
101 1.1 gmcgarry
102 1.1 gmcgarry return ((caddr_t)-1);
103 1.1 gmcgarry }
104 1.1 gmcgarry
105 1.1 gmcgarry /*
106 1.1 gmcgarry * During a fork, we copy all of the sequences from parent p1 to
107 1.1 gmcgarry * the child p2.
108 1.1 gmcgarry */
109 1.1 gmcgarry int
110 1.1 gmcgarry ras_fork(struct proc *p1, struct proc *p2)
111 1.1 gmcgarry {
112 1.1 gmcgarry struct ras *rp, *nrp;
113 1.1 gmcgarry
114 1.1 gmcgarry DPRINTF(("ras_fork: p1=%p, p2=%p, p1->p_nras=%d\n",
115 1.1 gmcgarry p1, p2, p1->p_nras));
116 1.1 gmcgarry
117 1.1 gmcgarry simple_lock(&p1->p_raslock);
118 1.1 gmcgarry LIST_FOREACH(rp, &p1->p_raslist, ras_list) {
119 1.1 gmcgarry nrp = pool_get(&ras_pool, PR_NOWAIT);
120 1.1 gmcgarry nrp->ras_startaddr = rp->ras_startaddr;
121 1.1 gmcgarry nrp->ras_endaddr = rp->ras_endaddr;
122 1.1 gmcgarry nrp->ras_hits = 0;
123 1.1 gmcgarry LIST_INSERT_HEAD(&p2->p_raslist, nrp, ras_list);
124 1.1 gmcgarry }
125 1.1 gmcgarry p2->p_nras = p1->p_nras;
126 1.1 gmcgarry simple_unlock(&p1->p_raslock);
127 1.1 gmcgarry
128 1.1 gmcgarry return (0);
129 1.1 gmcgarry }
130 1.1 gmcgarry
131 1.1 gmcgarry /*
132 1.1 gmcgarry * Nuke all sequences for this process.
133 1.1 gmcgarry */
134 1.1 gmcgarry int
135 1.1 gmcgarry ras_purgeall(struct proc *p)
136 1.1 gmcgarry {
137 1.1 gmcgarry struct ras *rp;
138 1.1 gmcgarry
139 1.1 gmcgarry simple_lock(&p->p_raslock);
140 1.1 gmcgarry while (!LIST_EMPTY(&p->p_raslist)) {
141 1.1 gmcgarry rp = LIST_FIRST(&p->p_raslist);
142 1.1 gmcgarry DPRINTF(("RAS %p-%p, hits %d\n", rp->ras_startaddr,
143 1.1 gmcgarry rp->ras_endaddr, rp->ras_hits));
144 1.1 gmcgarry LIST_REMOVE(rp, ras_list);
145 1.1 gmcgarry pool_put(&ras_pool, rp);
146 1.1 gmcgarry }
147 1.1 gmcgarry p->p_nras = 0;
148 1.1 gmcgarry simple_unlock(&p->p_raslock);
149 1.1 gmcgarry
150 1.1 gmcgarry return (0);
151 1.1 gmcgarry }
152 1.1 gmcgarry
153 1.1 gmcgarry /*
154 1.1 gmcgarry * Install the new sequence. If it already exists, return
155 1.1 gmcgarry * an error.
156 1.1 gmcgarry */
157 1.1 gmcgarry int
158 1.1 gmcgarry ras_install(struct proc *p, caddr_t addr, size_t len)
159 1.1 gmcgarry {
160 1.1 gmcgarry struct ras *rp;
161 1.1 gmcgarry caddr_t endaddr = addr + len;
162 1.1 gmcgarry
163 1.1 gmcgarry if (addr < (caddr_t)VM_MIN_ADDRESS ||
164 1.1 gmcgarry addr > (caddr_t)VM_MAXUSER_ADDRESS)
165 1.1 gmcgarry return (EINVAL);
166 1.1 gmcgarry
167 1.1 gmcgarry if (len <= 0)
168 1.1 gmcgarry return (EINVAL);
169 1.1 gmcgarry
170 1.1 gmcgarry if (p->p_nras >= ras_per_proc)
171 1.1 gmcgarry return (EINVAL);
172 1.1 gmcgarry
173 1.1 gmcgarry simple_lock(&p->p_raslock);
174 1.1 gmcgarry LIST_FOREACH(rp, &p->p_raslist, ras_list) {
175 1.1 gmcgarry if ((addr > rp->ras_startaddr && addr < rp->ras_endaddr) ||
176 1.1 gmcgarry (endaddr > rp->ras_startaddr &&
177 1.1 gmcgarry endaddr < rp->ras_endaddr) ||
178 1.1 gmcgarry (addr < rp->ras_startaddr && endaddr > rp->ras_endaddr)) {
179 1.1 gmcgarry simple_unlock(&p->p_raslock);
180 1.1 gmcgarry return (EINVAL);
181 1.1 gmcgarry }
182 1.1 gmcgarry }
183 1.1 gmcgarry rp = pool_get(&ras_pool, PR_NOWAIT);
184 1.1 gmcgarry rp->ras_startaddr = addr;
185 1.1 gmcgarry rp->ras_endaddr = endaddr;
186 1.1 gmcgarry rp->ras_hits = 0;
187 1.1 gmcgarry LIST_INSERT_HEAD(&p->p_raslist, rp, ras_list);
188 1.1 gmcgarry p->p_nras++;
189 1.1 gmcgarry simple_unlock(&p->p_raslock);
190 1.1 gmcgarry
191 1.1 gmcgarry return (0);
192 1.1 gmcgarry }
193 1.1 gmcgarry
194 1.1 gmcgarry /*
195 1.1 gmcgarry * Nuke the specified sequence. Both address and len must
196 1.1 gmcgarry * match, otherwise we return an error.
197 1.1 gmcgarry */
198 1.1 gmcgarry int
199 1.1 gmcgarry ras_purge(struct proc *p, caddr_t addr, size_t len)
200 1.1 gmcgarry {
201 1.1 gmcgarry struct ras *rp;
202 1.1 gmcgarry caddr_t endaddr = addr + len;
203 1.1 gmcgarry int error = ESRCH;
204 1.1 gmcgarry
205 1.1 gmcgarry simple_lock(&p->p_raslock);
206 1.1 gmcgarry LIST_FOREACH(rp, &p->p_raslist, ras_list) {
207 1.1 gmcgarry if (addr == rp->ras_startaddr && endaddr == rp->ras_endaddr) {
208 1.1 gmcgarry LIST_REMOVE(rp, ras_list);
209 1.1 gmcgarry pool_put(&ras_pool, rp);
210 1.1 gmcgarry p->p_nras--;
211 1.1 gmcgarry error = 0;
212 1.1 gmcgarry break;
213 1.1 gmcgarry }
214 1.1 gmcgarry }
215 1.1 gmcgarry simple_unlock(&p->p_raslock);
216 1.1 gmcgarry
217 1.1 gmcgarry return (error);
218 1.1 gmcgarry }
219 1.1 gmcgarry
220 1.1 gmcgarry /*ARGSUSED*/
221 1.1 gmcgarry int
222 1.4 thorpej sys_rasctl(struct lwp *l, void *v, register_t *retval)
223 1.1 gmcgarry {
224 1.1 gmcgarry
225 1.1 gmcgarry #if defined(__HAVE_RAS)
226 1.1 gmcgarry
227 1.1 gmcgarry struct sys_rasctl_args /* {
228 1.1 gmcgarry syscallarg(caddr_t) addr;
229 1.1 gmcgarry syscallarg(size_t) len;
230 1.1 gmcgarry syscallarg(int) op;
231 1.1 gmcgarry } */ *uap = v;
232 1.4 thorpej struct proc *p = l->l_proc;
233 1.1 gmcgarry caddr_t addr;
234 1.1 gmcgarry size_t len;
235 1.1 gmcgarry int op;
236 1.1 gmcgarry int error;
237 1.1 gmcgarry
238 1.1 gmcgarry /*
239 1.1 gmcgarry * first, extract syscall args from the uap.
240 1.1 gmcgarry */
241 1.1 gmcgarry
242 1.1 gmcgarry addr = (caddr_t)SCARG(uap, addr);
243 1.1 gmcgarry len = (size_t)SCARG(uap, len);
244 1.1 gmcgarry op = SCARG(uap, op);
245 1.1 gmcgarry
246 1.2 thorpej DPRINTF(("sys_rasctl: p=%p addr=%p, len=%ld, op=0x%x\n",
247 1.2 thorpej p, addr, (long)len, op));
248 1.1 gmcgarry
249 1.1 gmcgarry switch (op) {
250 1.1 gmcgarry case RAS_INSTALL:
251 1.1 gmcgarry error = ras_install(p, addr, len);
252 1.1 gmcgarry break;
253 1.1 gmcgarry case RAS_PURGE:
254 1.1 gmcgarry error = ras_purge(p, addr, len);
255 1.1 gmcgarry break;
256 1.1 gmcgarry case RAS_PURGE_ALL:
257 1.1 gmcgarry error = ras_purgeall(p);
258 1.1 gmcgarry break;
259 1.1 gmcgarry default:
260 1.1 gmcgarry error = EINVAL;
261 1.1 gmcgarry break;
262 1.1 gmcgarry }
263 1.1 gmcgarry
264 1.1 gmcgarry return (error);
265 1.1 gmcgarry
266 1.1 gmcgarry #else
267 1.1 gmcgarry
268 1.1 gmcgarry return (EOPNOTSUPP);
269 1.1 gmcgarry
270 1.1 gmcgarry #endif
271 1.1 gmcgarry
272 1.1 gmcgarry }
273