|
|
1.1 ! root 1: /* ! 2: * Copyright (c) 2000 Apple Computer, Inc. All rights reserved. ! 3: * ! 4: * @APPLE_LICENSE_HEADER_START@ ! 5: * ! 6: * The contents of this file constitute Original Code as defined in and ! 7: * are subject to the Apple Public Source License Version 1.1 (the ! 8: * "License"). You may not use this file except in compliance with the ! 9: * License. Please obtain a copy of the License at ! 10: * http://www.apple.com/publicsource and read it before using this file. ! 11: * ! 12: * This Original Code and all software distributed under the License are ! 13: * distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER ! 14: * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES, ! 15: * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY, ! 16: * FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT. Please see the ! 17: * License for the specific language governing rights and limitations ! 18: * under the License. ! 19: * ! 20: * @APPLE_LICENSE_HEADER_END@ ! 21: */ ! 22: /*- ! 23: * Copyright (c) 1988 University of Utah. ! 24: * Copyright (c) 1982, 1986, 1990, 1993 ! 25: * The Regents of the University of California. All rights reserved. ! 26: * ! 27: * This code is derived from software contributed to Berkeley by ! 28: * the Systems Programming Group of the University of Utah Computer ! 29: * Science Department, and code derived from software contributed to ! 30: * Berkeley by William Jolitz. ! 31: * ! 32: * Redistribution and use in source and binary forms, with or without ! 33: * modification, are permitted provided that the following conditions ! 34: * are met: ! 35: * 1. Redistributions of source code must retain the above copyright ! 36: * notice, this list of conditions and the following disclaimer. ! 37: * 2. Redistributions in binary form must reproduce the above copyright ! 38: * notice, this list of conditions and the following disclaimer in the ! 39: * documentation and/or other materials provided with the distribution. ! 40: * 3. All advertising materials mentioning features or use of this software ! 41: * must display the following acknowledgement: ! 42: * This product includes software developed by the University of ! 43: * California, Berkeley and its contributors. ! 44: * 4. Neither the name of the University nor the names of its contributors ! 45: * may be used to endorse or promote products derived from this software ! 46: * without specific prior written permission. ! 47: * ! 48: * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND ! 49: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE ! 50: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ! 51: * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE ! 52: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL ! 53: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS ! 54: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) ! 55: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT ! 56: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY ! 57: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF ! 58: * SUCH DAMAGE. ! 59: * ! 60: * from: Utah $Hdr: mem.c 1.13 89/10/08$ ! 61: * @(#)mem.c 8.1 (Berkeley) 6/11/93 ! 62: */ ! 63: ! 64: #include <mach_load.h> ! 65: ! 66: /* ! 67: * Memory special file ! 68: */ ! 69: ! 70: #include <sys/param.h> ! 71: #include <sys/dir.h> ! 72: #include <sys/proc.h> ! 73: #include <sys/buf.h> ! 74: #include <sys/systm.h> ! 75: #include <sys/vm.h> ! 76: #include <sys/uio.h> ! 77: ! 78: #include <mach/vm_types.h> ! 79: #include <mach/vm_param.h> ! 80: #include <vm/vm_kern.h> /* for kernel_map */ ! 81: ! 82: mmread(dev, uio) ! 83: dev_t dev; ! 84: struct uio *uio; ! 85: { ! 86: ! 87: return (mmrw(dev, uio, UIO_READ)); ! 88: } ! 89: ! 90: mmwrite(dev, uio) ! 91: dev_t dev; ! 92: struct uio *uio; ! 93: { ! 94: ! 95: return (mmrw(dev, uio, UIO_WRITE)); ! 96: } ! 97: ! 98: mmrw(dev, uio, rw) ! 99: dev_t dev; ! 100: struct uio *uio; ! 101: enum uio_rw rw; ! 102: { ! 103: register int o; ! 104: register u_int c, v; ! 105: register struct iovec *iov; ! 106: int error = 0; ! 107: vm_offset_t where; ! 108: int spl; ! 109: vm_size_t size; ! 110: extern boolean_t kernacc(off_t, size_t ); ! 111: ! 112: while (uio->uio_resid > 0 && error == 0) { ! 113: iov = uio->uio_iov; ! 114: if (iov->iov_len == 0) { ! 115: uio->uio_iov++; ! 116: uio->uio_iovcnt--; ! 117: if (uio->uio_iovcnt < 0) ! 118: panic("mmrw"); ! 119: continue; ! 120: } ! 121: switch (minor(dev)) { ! 122: ! 123: /* minor device 0 is physical memory */ ! 124: case 0: ! 125: v = trunc_page(uio->uio_offset); ! 126: if (uio->uio_offset >= mem_size) ! 127: goto fault; ! 128: ! 129: size= PAGE_SIZE; ! 130: if (kmem_alloc(kernel_map, &where, size) ! 131: != KERN_SUCCESS) { ! 132: goto fault; ! 133: } ! 134: o = uio->uio_offset - v; ! 135: c = min(PAGE_SIZE - o, (u_int)iov->iov_len); ! 136: error = uiomove((caddr_t) (where + o), c, uio); ! 137: kmem_free(kernel_map, where, PAGE_SIZE); ! 138: continue; ! 139: ! 140: /* minor device 1 is kernel memory */ ! 141: case 1: ! 142: /* Do some sanity checking */ ! 143: if (((vm_address_t)uio->uio_offset >= VM_MAX_KERNEL_ADDRESS) || ! 144: ((vm_address_t)uio->uio_offset <= VM_MIN_KERNEL_ADDRESS)) ! 145: goto fault; ! 146: c = iov->iov_len; ! 147: if (!kernacc(uio->uio_offset, c)) ! 148: goto fault; ! 149: error = uiomove((caddr_t)uio->uio_offset, (int)c, uio); ! 150: continue; ! 151: ! 152: /* minor device 2 is EOF/RATHOLE */ ! 153: case 2: ! 154: if (rw == UIO_READ) ! 155: return (0); ! 156: c = iov->iov_len; ! 157: break; ! 158: default: ! 159: goto fault; ! 160: break; ! 161: } ! 162: ! 163: if (error) ! 164: break; ! 165: iov->iov_base += c; ! 166: iov->iov_len -= c; ! 167: uio->uio_offset += c; ! 168: uio->uio_resid -= c; ! 169: } ! 170: return (error); ! 171: fault: ! 172: return (EFAULT); ! 173: } ! 174: ! 175: ! 176: boolean_t ! 177: kernacc( ! 178: off_t start, ! 179: size_t len ! 180: ) ! 181: { ! 182: off_t base; ! 183: off_t end; ! 184: ! 185: base = trunc_page(start); ! 186: end = start + len; ! 187: ! 188: while (base < end) { ! 189: if(kvtophys((vm_offset_t)base) == NULL) ! 190: return(FALSE); ! 191: base += page_size; ! 192: } ! 193: ! 194: return (TRUE); ! 195: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.