FreeBSD/Linux Kernel Cross Reference
sys/arm/arm/mem.c
1 /*-
2 * SPDX-License-Identifier: BSD-3-Clause
3 *
4 * Copyright (c) 1988 University of Utah.
5 * Copyright (c) 1982, 1986, 1990 The Regents of the University of California.
6 * All rights reserved.
7 *
8 * This code is derived from software contributed to Berkeley by
9 * the Systems Programming Group of the University of Utah Computer
10 * Science Department, and code derived from software contributed to
11 * Berkeley by William Jolitz.
12 *
13 * Redistribution and use in source and binary forms, with or without
14 * modification, are permitted provided that the following conditions
15 * are met:
16 * 1. Redistributions of source code must retain the above copyright
17 * notice, this list of conditions and the following disclaimer.
18 * 2. Redistributions in binary form must reproduce the above copyright
19 * notice, this list of conditions and the following disclaimer in the
20 * documentation and/or other materials provided with the distribution.
21 * 3. Neither the name of the University nor the names of its contributors
22 * may be used to endorse or promote products derived from this software
23 * without specific prior written permission.
24 *
25 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
26 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
28 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
29 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
30 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
31 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
32 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
33 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
34 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35 * SUCH DAMAGE.
36 *
37 * from: Utah $Hdr: mem.c 1.13 89/10/08$
38 * from: @(#)mem.c 7.2 (Berkeley) 5/9/91
39 */
40
41 #include <sys/cdefs.h>
42 __FBSDID("$FreeBSD$");
43
44 /*
45 * Memory special file
46 */
47
48 #include <sys/param.h>
49 #include <sys/conf.h>
50 #include <sys/fcntl.h>
51 #include <sys/ioccom.h>
52 #include <sys/kernel.h>
53 #include <sys/lock.h>
54 #include <sys/malloc.h>
55 #include <sys/memrange.h>
56 #include <sys/module.h>
57 #include <sys/mutex.h>
58 #include <sys/proc.h>
59 #include <sys/signalvar.h>
60 #include <sys/sx.h>
61 #include <sys/systm.h>
62 #include <sys/uio.h>
63
64 #include <vm/vm.h>
65 #include <vm/vm_param.h>
66 #include <vm/vm_page.h>
67 #include <vm/vm_phys.h>
68 #include <vm/vm_dumpset.h>
69 #include <vm/pmap.h>
70 #include <vm/vm_extern.h>
71
72 #include <machine/memdev.h>
73
74 /*
75 * Used in /dev/mem drivers and elsewhere
76 */
77 MALLOC_DEFINE(M_MEMDESC, "memdesc", "memory range descriptors");
78
79 struct mem_range_softc mem_range_softc;
80
81 static struct sx tmppt_lock;
82 SX_SYSINIT(tmppt, &tmppt_lock, "mem4map");
83
84 /* ARGSUSED */
85 int
86 memrw(struct cdev *dev, struct uio *uio, int flags)
87 {
88 int o;
89 u_int c = 0, v;
90 struct iovec *iov;
91 int error = 0;
92 vm_offset_t addr, eaddr;
93
94 while (uio->uio_resid > 0 && error == 0) {
95 iov = uio->uio_iov;
96 if (iov->iov_len == 0) {
97 uio->uio_iov++;
98 uio->uio_iovcnt--;
99 if (uio->uio_iovcnt < 0)
100 panic("memrw");
101 continue;
102 }
103 if (dev2unit(dev) == CDEV_MINOR_MEM) {
104 int i;
105 int address_valid = 0;
106
107 v = uio->uio_offset;
108 v &= ~PAGE_MASK;
109 for (i = 0; dump_avail[i] || dump_avail[i + 1];
110 i += 2) {
111 if (v >= dump_avail[i] &&
112 v < dump_avail[i + 1]) {
113 address_valid = 1;
114 break;
115 }
116 }
117 if (!address_valid)
118 return (EINVAL);
119 sx_xlock(&tmppt_lock);
120 pmap_kenter((vm_offset_t)_tmppt, v);
121 pmap_tlb_flush(kernel_pmap, (vm_offset_t)_tmppt);
122 o = (int)uio->uio_offset & PAGE_MASK;
123 c = (u_int)(PAGE_SIZE - ((int)iov->iov_base & PAGE_MASK));
124 c = min(c, (u_int)(PAGE_SIZE - o));
125 c = min(c, (u_int)iov->iov_len);
126 error = uiomove((caddr_t)&_tmppt[o], (int)c, uio);
127 pmap_qremove((vm_offset_t)_tmppt, 1);
128 sx_xunlock(&tmppt_lock);
129 continue;
130 }
131 else if (dev2unit(dev) == CDEV_MINOR_KMEM) {
132 c = iov->iov_len;
133
134 /*
135 * Make sure that all of the pages are currently
136 * resident so that we don't create any zero-fill
137 * pages.
138 */
139 addr = trunc_page(uio->uio_offset);
140 eaddr = round_page(uio->uio_offset + c);
141
142 for (; addr < eaddr; addr += PAGE_SIZE)
143 if (pmap_extract(kernel_pmap, addr) == 0)
144 return (EFAULT);
145 if (!kernacc((caddr_t)(int)uio->uio_offset, c,
146 uio->uio_rw == UIO_READ ?
147 VM_PROT_READ : VM_PROT_WRITE))
148 return (EFAULT);
149 error = uiomove((caddr_t)(int)uio->uio_offset, (int)c, uio);
150 continue;
151 }
152 /* else panic! */
153 }
154 return (error);
155 }
156
157 /*
158 * allow user processes to MMAP some memory sections
159 * instead of going through read/write
160 */
161 /* ARGSUSED */
162
163 int
164 memmmap(struct cdev *dev, vm_ooffset_t offset, vm_paddr_t *paddr,
165 int prot __unused, vm_memattr_t *memattr __unused)
166 {
167 if (dev2unit(dev) == CDEV_MINOR_MEM) {
168 *paddr = offset;
169 return (0);
170 }
171 return (-1);
172 }
173
174 int
175 memioctl_md(struct cdev *dev __unused, u_long cmd __unused,
176 caddr_t data __unused, int flags __unused, struct thread *td __unused)
177 {
178 return (ENOTTY);
179 }
Cache object: dc360ce40dbf4549d7619f920a9e2133
|