xref: /freebsd/sys/powerpc/powerpc/mem.c (revision 1d386b48)
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 /*
43  * Memory special file
44  */
45 
46 #include <sys/param.h>
47 #include <sys/conf.h>
48 #include <sys/fcntl.h>
49 #include <sys/kernel.h>
50 #include <sys/lock.h>
51 #include <sys/ioccom.h>
52 #include <sys/malloc.h>
53 #include <sys/memrange.h>
54 #include <sys/module.h>
55 #include <sys/mutex.h>
56 #include <sys/proc.h>
57 #include <sys/msgbuf.h>
58 #include <sys/systm.h>
59 #include <sys/signalvar.h>
60 #include <sys/uio.h>
61 
62 #include <machine/md_var.h>
63 #include <machine/vmparam.h>
64 
65 #include <vm/vm.h>
66 #include <vm/pmap.h>
67 #include <vm/vm_extern.h>
68 #include <vm/vm_page.h>
69 
70 #include <machine/memdev.h>
71 
72 static void ppc_mrinit(struct mem_range_softc *);
73 static int ppc_mrset(struct mem_range_softc *, struct mem_range_desc *, int *);
74 
75 MALLOC_DEFINE(M_MEMDESC, "memdesc", "memory range descriptors");
76 
77 static struct mem_range_ops ppc_mem_range_ops = {
78 	ppc_mrinit,
79 	ppc_mrset,
80 	NULL,
81 	NULL
82 };
83 struct mem_range_softc mem_range_softc = {
84 	&ppc_mem_range_ops,
85 	0, 0, NULL
86 };
87 
88 /* ARGSUSED */
89 int
90 memrw(struct cdev *dev, struct uio *uio, int flags)
91 {
92 	struct iovec *iov;
93 	int error = 0;
94 	vm_offset_t va, eva, off, v;
95 	vm_prot_t prot;
96 	struct vm_page m;
97 	vm_page_t marr;
98 	vm_size_t cnt;
99 	ssize_t orig_resid;
100 
101 	cnt = 0;
102 	error = 0;
103 	orig_resid = uio->uio_resid;
104 
105 	while (uio->uio_resid > 0 && !error) {
106 		iov = uio->uio_iov;
107 		if (iov->iov_len == 0) {
108 			uio->uio_iov++;
109 			uio->uio_iovcnt--;
110 			if (uio->uio_iovcnt < 0)
111 				panic("memrw");
112 			continue;
113 		}
114 		if (dev2unit(dev) == CDEV_MINOR_MEM) {
115 			v = uio->uio_offset;
116 
117 kmem_direct_mapped:	off = v & PAGE_MASK;
118 			cnt = PAGE_SIZE - ((vm_offset_t)iov->iov_base &
119 			    PAGE_MASK);
120 			cnt = min(cnt, PAGE_SIZE - off);
121 			cnt = min(cnt, iov->iov_len);
122 
123 			if (mem_valid(v, cnt)) {
124 				error = EFAULT;
125 				break;
126 			}
127 
128 			if (hw_direct_map && !pmap_dev_direct_mapped(v, cnt)) {
129 				error = uiomove((void *)PHYS_TO_DMAP(v), cnt,
130 				    uio);
131 			} else {
132 				m.phys_addr = trunc_page(v);
133 				marr = &m;
134 				error = uiomove_fromphys(&marr, off, cnt, uio);
135 			}
136 		}
137 		else if (dev2unit(dev) == CDEV_MINOR_KMEM) {
138 			va = uio->uio_offset;
139 
140 			if (hw_direct_map &&
141 			    ((va < VM_MIN_KERNEL_ADDRESS) || (va > virtual_end))) {
142 				v = DMAP_TO_PHYS(va);
143 				goto kmem_direct_mapped;
144 			}
145 
146 			va = trunc_page(uio->uio_offset);
147 			eva = round_page(uio->uio_offset
148 			    + iov->iov_len);
149 
150 			/*
151 			 * Make sure that all the pages are currently resident
152 			 * so that we don't create any zero-fill pages.
153 			 */
154 
155 			for (; va < eva; va += PAGE_SIZE) {
156 				if (pmap_extract(kernel_pmap, va) == 0) {
157 					error = EFAULT;
158 					break;
159 				}
160 			}
161 			if (error != 0)
162 				break;
163 
164 			prot = (uio->uio_rw == UIO_READ)
165 			    ? VM_PROT_READ : VM_PROT_WRITE;
166 
167 			va = uio->uio_offset;
168 			if (((va >= VM_MIN_KERNEL_ADDRESS) && (va <= virtual_end)) &&
169 			    !kernacc((void *) va, iov->iov_len, prot)) {
170 				error = EFAULT;
171 				break;
172 			}
173 
174 			error = uiomove((void *)va, iov->iov_len, uio);
175 		}
176 	}
177 	/*
178 	 * Don't return error if any byte was written.  Read and write
179 	 * can return error only if no i/o was performed.
180 	 */
181 	if (uio->uio_resid != orig_resid)
182 		error = 0;
183 	return (error);
184 }
185 
186 /*
187  * allow user processes to MMAP some memory sections
188  * instead of going through read/write
189  */
190 int
191 memmmap(struct cdev *dev, vm_ooffset_t offset, vm_paddr_t *paddr,
192     int prot, vm_memattr_t *memattr)
193 {
194 	int i;
195 
196 	if (dev2unit(dev) == CDEV_MINOR_MEM)
197 		*paddr = offset;
198 	else
199 		return (EFAULT);
200 
201 	for (i = 0; i < mem_range_softc.mr_ndesc; i++) {
202 		if (!(mem_range_softc.mr_desc[i].mr_flags & MDF_ACTIVE))
203 			continue;
204 
205 		if (offset >= mem_range_softc.mr_desc[i].mr_base &&
206 		    offset < mem_range_softc.mr_desc[i].mr_base +
207 		    mem_range_softc.mr_desc[i].mr_len) {
208 			switch (mem_range_softc.mr_desc[i].mr_flags &
209 			    MDF_ATTRMASK) {
210 			case MDF_WRITEBACK:
211 				*memattr = VM_MEMATTR_WRITE_BACK;
212 				break;
213 			case MDF_WRITECOMBINE:
214 				*memattr = VM_MEMATTR_WRITE_COMBINING;
215 				break;
216 			case MDF_UNCACHEABLE:
217 				*memattr = VM_MEMATTR_UNCACHEABLE;
218 				break;
219 			case MDF_WRITETHROUGH:
220 				*memattr = VM_MEMATTR_WRITE_THROUGH;
221 				break;
222 			}
223 
224 			break;
225 		}
226 	}
227 
228 	return (0);
229 }
230 
231 static void
232 ppc_mrinit(struct mem_range_softc *sc)
233 {
234 	sc->mr_cap = 0;
235 	sc->mr_ndesc = 8; /* XXX: Should be dynamically expandable */
236 	sc->mr_desc = malloc(sc->mr_ndesc * sizeof(struct mem_range_desc),
237 	    M_MEMDESC, M_WAITOK | M_ZERO);
238 }
239 
240 static int
241 ppc_mrset(struct mem_range_softc *sc, struct mem_range_desc *desc, int *arg)
242 {
243 	int i;
244 
245 	switch(*arg) {
246 	case MEMRANGE_SET_UPDATE:
247 		for (i = 0; i < sc->mr_ndesc; i++) {
248 			if (!sc->mr_desc[i].mr_len) {
249 				sc->mr_desc[i] = *desc;
250 				sc->mr_desc[i].mr_flags |= MDF_ACTIVE;
251 				return (0);
252 			}
253 			if (sc->mr_desc[i].mr_base == desc->mr_base &&
254 			    sc->mr_desc[i].mr_len == desc->mr_len)
255 				return (EEXIST);
256 		}
257 		return (ENOSPC);
258 	case MEMRANGE_SET_REMOVE:
259 		for (i = 0; i < sc->mr_ndesc; i++)
260 			if (sc->mr_desc[i].mr_base == desc->mr_base &&
261 			    sc->mr_desc[i].mr_len == desc->mr_len) {
262 				bzero(&sc->mr_desc[i], sizeof(sc->mr_desc[i]));
263 				return (0);
264 			}
265 		return (ENOENT);
266 	default:
267 		return (EOPNOTSUPP);
268 	}
269 
270 	return (0);
271 }
272 
273 /*
274  * Operations for changing memory attributes.
275  *
276  * This is basically just an ioctl shim for mem_range_attr_get
277  * and mem_range_attr_set.
278  */
279 int
280 memioctl_md(struct cdev *dev __unused, u_long cmd, caddr_t data, int flags,
281     struct thread *td)
282 {
283 	int nd, error = 0;
284 	struct mem_range_op *mo = (struct mem_range_op *)data;
285 	struct mem_range_desc *md;
286 
287 	/* is this for us? */
288 	if ((cmd != MEMRANGE_GET) &&
289 	    (cmd != MEMRANGE_SET))
290 		return (ENOTTY);
291 
292 	/* any chance we can handle this? */
293 	if (mem_range_softc.mr_op == NULL)
294 		return (EOPNOTSUPP);
295 
296 	/* do we have any descriptors? */
297 	if (mem_range_softc.mr_ndesc == 0)
298 		return (ENXIO);
299 
300 	switch (cmd) {
301 	case MEMRANGE_GET:
302 		nd = imin(mo->mo_arg[0], mem_range_softc.mr_ndesc);
303 		if (nd > 0) {
304 			md = (struct mem_range_desc *)
305 				malloc(nd * sizeof(struct mem_range_desc),
306 				       M_MEMDESC, M_WAITOK);
307 			error = mem_range_attr_get(md, &nd);
308 			if (!error)
309 				error = copyout(md, mo->mo_desc,
310 					nd * sizeof(struct mem_range_desc));
311 			free(md, M_MEMDESC);
312 		}
313 		else
314 			nd = mem_range_softc.mr_ndesc;
315 		mo->mo_arg[0] = nd;
316 		break;
317 
318 	case MEMRANGE_SET:
319 		md = (struct mem_range_desc *)malloc(sizeof(struct mem_range_desc),
320 						    M_MEMDESC, M_WAITOK);
321 		error = copyin(mo->mo_desc, md, sizeof(struct mem_range_desc));
322 		/* clamp description string */
323 		md->mr_owner[sizeof(md->mr_owner) - 1] = 0;
324 		if (error == 0)
325 			error = mem_range_attr_set(md, &mo->mo_arg[0]);
326 		free(md, M_MEMDESC);
327 		break;
328 	}
329 	return (error);
330 }
331