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