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