iommu.c revision 1.96 1 1.96 chs /* $NetBSD: iommu.c,v 1.96 2020/06/14 01:40:05 chs Exp $ */
2 1.1 pk
3 1.1 pk /*
4 1.1 pk * Copyright (c) 1996
5 1.3 abrown * The President and Fellows of Harvard College. All rights reserved.
6 1.1 pk * Copyright (c) 1995 Paul Kranenburg
7 1.1 pk *
8 1.1 pk * Redistribution and use in source and binary forms, with or without
9 1.1 pk * modification, are permitted provided that the following conditions
10 1.1 pk * are met:
11 1.1 pk * 1. Redistributions of source code must retain the above copyright
12 1.1 pk * notice, this list of conditions and the following disclaimer.
13 1.1 pk * 2. Redistributions in binary form must reproduce the above copyright
14 1.1 pk * notice, this list of conditions and the following disclaimer in the
15 1.1 pk * documentation and/or other materials provided with the distribution.
16 1.1 pk * 3. All advertising materials mentioning features or use of this software
17 1.1 pk * must display the following acknowledgement:
18 1.1 pk * This product includes software developed by Aaron Brown and
19 1.1 pk * Harvard University.
20 1.1 pk * This product includes software developed by Paul Kranenburg.
21 1.1 pk * 4. Neither the name of the University nor the names of its contributors
22 1.1 pk * may be used to endorse or promote products derived from this software
23 1.1 pk * without specific prior written permission.
24 1.1 pk *
25 1.1 pk * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
26 1.1 pk * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27 1.1 pk * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
28 1.1 pk * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
29 1.1 pk * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
30 1.1 pk * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
31 1.1 pk * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
32 1.1 pk * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
33 1.1 pk * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
34 1.1 pk * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35 1.1 pk * SUCH DAMAGE.
36 1.1 pk *
37 1.1 pk */
38 1.76 lukem
39 1.76 lukem #include <sys/cdefs.h>
40 1.96 chs __KERNEL_RCSID(0, "$NetBSD: iommu.c,v 1.96 2020/06/14 01:40:05 chs Exp $");
41 1.76 lukem
42 1.62 darrenr #include "opt_sparc_arch.h"
43 1.1 pk
44 1.1 pk #include <sys/param.h>
45 1.18 pk #include <sys/extent.h>
46 1.18 pk #include <sys/malloc.h>
47 1.18 pk #include <sys/queue.h>
48 1.1 pk #include <sys/systm.h>
49 1.1 pk #include <sys/device.h>
50 1.58 chs #include <sys/proc.h>
51 1.25 pk
52 1.31 pk #include <uvm/uvm.h>
53 1.1 pk
54 1.18 pk #define _SPARC_BUS_DMA_PRIVATE
55 1.93 dyoung #include <sys/bus.h>
56 1.1 pk #include <machine/autoconf.h>
57 1.1 pk #include <machine/ctlreg.h>
58 1.1 pk #include <sparc/sparc/asm.h>
59 1.1 pk #include <sparc/sparc/vaddrs.h>
60 1.9 pk #include <sparc/sparc/cpuvar.h>
61 1.1 pk #include <sparc/sparc/iommureg.h>
62 1.16 pk #include <sparc/sparc/iommuvar.h>
63 1.1 pk
64 1.1 pk struct iommu_softc {
65 1.1 pk struct iommureg *sc_reg;
66 1.1 pk u_int sc_pagesize;
67 1.1 pk u_int sc_range;
68 1.21 pk bus_addr_t sc_dvmabase;
69 1.1 pk iopte_t *sc_ptes;
70 1.80 pk int sc_cachecoherent;
71 1.33 pk /*
72 1.33 pk * Note: operations on the extent map are being protected with
73 1.33 pk * splhigh(), since we cannot predict at which interrupt priority
74 1.33 pk * our clients will run.
75 1.33 pk */
76 1.67 thorpej struct sparc_bus_dma_tag sc_dmatag;
77 1.67 thorpej struct extent *sc_dvmamap;
78 1.67 thorpej };
79 1.1 pk
80 1.1 pk /* autoconfiguration driver */
81 1.82 uwe int iommu_print(void *, const char *);
82 1.94 mrg void iommu_attach(device_t, device_t, void *);
83 1.94 mrg int iommu_match(device_t, cfdata_t, void *);
84 1.1 pk
85 1.60 darrenr #if defined(SUN4M)
86 1.82 uwe static void iommu_copy_prom_entries(struct iommu_softc *);
87 1.60 darrenr #endif
88 1.42 pk
89 1.94 mrg CFATTACH_DECL_NEW(iommu, sizeof(struct iommu_softc),
90 1.72 thorpej iommu_match, iommu_attach, NULL, NULL);
91 1.1 pk
92 1.18 pk /* IOMMU DMA map functions */
93 1.82 uwe int iommu_dmamap_create(bus_dma_tag_t, bus_size_t, int, bus_size_t,
94 1.82 uwe bus_size_t, int, bus_dmamap_t *);
95 1.82 uwe int iommu_dmamap_load(bus_dma_tag_t, bus_dmamap_t, void *,
96 1.82 uwe bus_size_t, struct proc *, int);
97 1.82 uwe int iommu_dmamap_load_mbuf(bus_dma_tag_t, bus_dmamap_t,
98 1.82 uwe struct mbuf *, int);
99 1.82 uwe int iommu_dmamap_load_uio(bus_dma_tag_t, bus_dmamap_t,
100 1.82 uwe struct uio *, int);
101 1.82 uwe int iommu_dmamap_load_raw(bus_dma_tag_t, bus_dmamap_t,
102 1.82 uwe bus_dma_segment_t *, int, bus_size_t, int);
103 1.82 uwe void iommu_dmamap_unload(bus_dma_tag_t, bus_dmamap_t);
104 1.82 uwe void iommu_dmamap_sync(bus_dma_tag_t, bus_dmamap_t, bus_addr_t,
105 1.82 uwe bus_size_t, int);
106 1.82 uwe
107 1.82 uwe int iommu_dmamem_map(bus_dma_tag_t, bus_dma_segment_t *,
108 1.85 christos int, size_t, void **, int);
109 1.85 christos void iommu_dmamem_unmap(bus_dma_tag_t, void *, size_t);
110 1.82 uwe paddr_t iommu_dmamem_mmap(bus_dma_tag_t, bus_dma_segment_t *,
111 1.82 uwe int, off_t, int, int);
112 1.67 thorpej int iommu_dvma_alloc(struct iommu_softc *, bus_dmamap_t, vaddr_t,
113 1.67 thorpej bus_size_t, int, bus_addr_t *, bus_size_t *);
114 1.18 pk
115 1.1 pk /*
116 1.1 pk * Print the location of some iommu-attached device (called just
117 1.1 pk * before attaching that device). If `iommu' is not NULL, the
118 1.1 pk * device was found but not configured; print the iommu as well.
119 1.1 pk * Return UNCONF (config_find ignores this if the device was configured).
120 1.1 pk */
121 1.1 pk int
122 1.82 uwe iommu_print(void *args, const char *iommu)
123 1.1 pk {
124 1.16 pk struct iommu_attach_args *ia = args;
125 1.1 pk
126 1.1 pk if (iommu)
127 1.74 thorpej aprint_normal("%s at %s", ia->iom_name, iommu);
128 1.1 pk return (UNCONF);
129 1.1 pk }
130 1.1 pk
131 1.1 pk int
132 1.94 mrg iommu_match(device_t parent, cfdata_t cf, void *aux)
133 1.1 pk {
134 1.16 pk struct mainbus_attach_args *ma = aux;
135 1.1 pk
136 1.65 thorpej if (CPU_ISSUN4 || CPU_ISSUN4C)
137 1.1 pk return (0);
138 1.68 thorpej return (strcmp(cf->cf_name, ma->ma_name) == 0);
139 1.1 pk }
140 1.1 pk
141 1.1 pk /*
142 1.1 pk * Attach the iommu.
143 1.1 pk */
144 1.1 pk void
145 1.94 mrg iommu_attach(device_t parent, device_t self, void *aux)
146 1.1 pk {
147 1.4 pk #if defined(SUN4M)
148 1.94 mrg struct iommu_softc *sc = device_private(self);
149 1.16 pk struct mainbus_attach_args *ma = aux;
150 1.67 thorpej struct sparc_bus_dma_tag *dmat = &sc->sc_dmatag;
151 1.43 pk bus_space_handle_t bh;
152 1.21 pk int node;
153 1.53 uwe int js1_implicit_iommu;
154 1.42 pk int i, s;
155 1.43 pk u_int iopte_table_pa;
156 1.43 pk struct pglist mlist;
157 1.43 pk u_int size;
158 1.54 chs struct vm_page *m;
159 1.43 pk vaddr_t va;
160 1.1 pk
161 1.67 thorpej dmat->_cookie = sc;
162 1.67 thorpej dmat->_dmamap_create = iommu_dmamap_create;
163 1.67 thorpej dmat->_dmamap_destroy = _bus_dmamap_destroy;
164 1.67 thorpej dmat->_dmamap_load = iommu_dmamap_load;
165 1.67 thorpej dmat->_dmamap_load_mbuf = iommu_dmamap_load_mbuf;
166 1.67 thorpej dmat->_dmamap_load_uio = iommu_dmamap_load_uio;
167 1.67 thorpej dmat->_dmamap_load_raw = iommu_dmamap_load_raw;
168 1.67 thorpej dmat->_dmamap_unload = iommu_dmamap_unload;
169 1.67 thorpej dmat->_dmamap_sync = iommu_dmamap_sync;
170 1.67 thorpej
171 1.67 thorpej dmat->_dmamem_alloc = _bus_dmamem_alloc;
172 1.67 thorpej dmat->_dmamem_free = _bus_dmamem_free;
173 1.67 thorpej dmat->_dmamem_map = iommu_dmamem_map;
174 1.67 thorpej dmat->_dmamem_unmap = _bus_dmamem_unmap;
175 1.67 thorpej dmat->_dmamem_mmap = iommu_dmamem_mmap;
176 1.53 uwe
177 1.83 uwe /*
178 1.53 uwe * JS1/OF device tree does not have an iommu node and sbus
179 1.53 uwe * node is directly under root. mainbus_attach detects this
180 1.53 uwe * and calls us with sbus node instead so that we can attach
181 1.53 uwe * implicit iommu and attach that sbus node under it.
182 1.53 uwe */
183 1.16 pk node = ma->ma_node;
184 1.78 pk if (strcmp(prom_getpropstring(node, "name"), "sbus") == 0)
185 1.53 uwe js1_implicit_iommu = 1;
186 1.53 uwe else
187 1.53 uwe js1_implicit_iommu = 0;
188 1.1 pk
189 1.1 pk /*
190 1.1 pk * Map registers into our space. The PROM may have done this
191 1.1 pk * already, but I feel better if we have our own copy. Plus, the
192 1.43 pk * prom doesn't map the entire register set.
193 1.1 pk *
194 1.1 pk * XXX struct iommureg is bigger than ra->ra_len; what are the
195 1.1 pk * other fields for?
196 1.1 pk */
197 1.67 thorpej if (bus_space_map(ma->ma_bustag, ma->ma_paddr,
198 1.67 thorpej sizeof(struct iommureg), 0, &bh) != 0) {
199 1.16 pk printf("iommu_attach: cannot map registers\n");
200 1.16 pk return;
201 1.16 pk }
202 1.16 pk sc->sc_reg = (struct iommureg *)bh;
203 1.1 pk
204 1.80 pk sc->sc_cachecoherent = js1_implicit_iommu ? 0
205 1.53 uwe : node_has_property(node, "cache-coherence?");
206 1.9 pk if (CACHEINFO.c_enabled == 0) /* XXX - is this correct? */
207 1.80 pk sc->sc_cachecoherent = 0;
208 1.1 pk
209 1.75 thorpej sc->sc_pagesize = js1_implicit_iommu ? PAGE_SIZE
210 1.78 pk : prom_getpropint(node, "page-size", PAGE_SIZE),
211 1.1 pk
212 1.1 pk /*
213 1.43 pk * Allocate memory for I/O pagetables.
214 1.43 pk * This takes 64K of contiguous physical memory to map 64M of
215 1.43 pk * DVMA space (starting at IOMMU_DVMA_BASE).
216 1.43 pk * The table must be aligned on a (-IOMMU_DVMA_BASE/pagesize)
217 1.43 pk * boundary (i.e. 64K for 64M of DVMA space).
218 1.1 pk */
219 1.1 pk
220 1.43 pk size = ((0 - IOMMU_DVMA_BASE) / sc->sc_pagesize) * sizeof(iopte_t);
221 1.43 pk if (uvm_pglistalloc(size, vm_first_phys, vm_first_phys+vm_num_phys,
222 1.43 pk size, 0, &mlist, 1, 0) != 0)
223 1.43 pk panic("iommu_attach: no memory");
224 1.43 pk
225 1.81 yamt va = uvm_km_alloc(kernel_map, size, 0, UVM_KMF_VAONLY);
226 1.43 pk if (va == 0)
227 1.43 pk panic("iommu_attach: no memory");
228 1.43 pk
229 1.43 pk sc->sc_ptes = (iopte_t *)va;
230 1.43 pk
231 1.43 pk m = TAILQ_FIRST(&mlist);
232 1.43 pk iopte_table_pa = VM_PAGE_TO_PHYS(m);
233 1.43 pk
234 1.43 pk /* Map the pages */
235 1.90 ad for (; m != NULL; m = TAILQ_NEXT(m,pageq.queue)) {
236 1.43 pk paddr_t pa = VM_PAGE_TO_PHYS(m);
237 1.92 cegger pmap_kenter_pa(va, pa | PMAP_NC,
238 1.92 cegger VM_PROT_READ | VM_PROT_WRITE, 0);
239 1.75 thorpej va += PAGE_SIZE;
240 1.43 pk }
241 1.55 chris pmap_update(pmap_kernel());
242 1.1 pk
243 1.1 pk /*
244 1.42 pk * Copy entries from current IOMMU table.
245 1.42 pk * XXX - Why do we need to do this?
246 1.1 pk */
247 1.42 pk iommu_copy_prom_entries(sc);
248 1.1 pk
249 1.1 pk /*
250 1.1 pk * Now we can install our new pagetable into the IOMMU
251 1.1 pk */
252 1.22 pk sc->sc_range = 0 - IOMMU_DVMA_BASE;
253 1.22 pk sc->sc_dvmabase = IOMMU_DVMA_BASE;
254 1.1 pk
255 1.1 pk /* calculate log2(sc->sc_range/16MB) */
256 1.1 pk i = ffs(sc->sc_range/(1 << 24)) - 1;
257 1.1 pk if ((1 << i) != (sc->sc_range/(1 << 24)))
258 1.69 provos panic("iommu: bad range: %d", i);
259 1.1 pk
260 1.1 pk s = splhigh();
261 1.1 pk IOMMU_FLUSHALL(sc);
262 1.1 pk
263 1.43 pk /* Load range and physical address of PTEs */
264 1.1 pk sc->sc_reg->io_cr = (sc->sc_reg->io_cr & ~IOMMU_CTL_RANGE) |
265 1.1 pk (i << IOMMU_CTL_RANGESHFT) | IOMMU_CTL_ME;
266 1.43 pk sc->sc_reg->io_bar = (iopte_table_pa >> 4) & IOMMU_BAR_IBA;
267 1.1 pk
268 1.1 pk IOMMU_FLUSHALL(sc);
269 1.1 pk splx(s);
270 1.1 pk
271 1.13 fair printf(": version 0x%x/0x%x, page-size %d, range %dMB\n",
272 1.1 pk (sc->sc_reg->io_cr & IOMMU_CTL_VER) >> 24,
273 1.1 pk (sc->sc_reg->io_cr & IOMMU_CTL_IMPL) >> 28,
274 1.1 pk sc->sc_pagesize,
275 1.1 pk sc->sc_range >> 20);
276 1.1 pk
277 1.67 thorpej sc->sc_dvmamap = extent_create("iommudvma",
278 1.22 pk IOMMU_DVMA_BASE, IOMMU_DVMA_END,
279 1.96 chs 0, 0, EX_WAITOK);
280 1.53 uwe
281 1.53 uwe /*
282 1.53 uwe * If we are attaching implicit iommu on JS1/OF we do not have
283 1.53 uwe * an iommu node to traverse, instead mainbus_attach passed us
284 1.53 uwe * sbus node in ma.ma_node. Attach it as the only iommu child.
285 1.53 uwe */
286 1.53 uwe if (js1_implicit_iommu) {
287 1.53 uwe struct iommu_attach_args ia;
288 1.66 thorpej struct openprom_addr sbus_iommu_reg = { 0, 0x10001000, 0x28 };
289 1.53 uwe
290 1.91 cegger memset(&ia, 0, sizeof ia);
291 1.53 uwe
292 1.53 uwe /* Propagate BUS & DMA tags */
293 1.53 uwe ia.iom_bustag = ma->ma_bustag;
294 1.67 thorpej ia.iom_dmatag = &sc->sc_dmatag;
295 1.53 uwe
296 1.53 uwe ia.iom_name = "sbus";
297 1.53 uwe ia.iom_node = node;
298 1.53 uwe ia.iom_reg = &sbus_iommu_reg;
299 1.53 uwe ia.iom_nreg = 1;
300 1.53 uwe
301 1.94 mrg (void) config_found(self, (void *)&ia, iommu_print);
302 1.53 uwe return;
303 1.53 uwe }
304 1.1 pk
305 1.1 pk /*
306 1.1 pk * Loop through ROM children (expect Sbus among them).
307 1.1 pk */
308 1.1 pk for (node = firstchild(node); node; node = nextsibling(node)) {
309 1.16 pk struct iommu_attach_args ia;
310 1.16 pk
311 1.91 cegger memset(&ia, 0, sizeof ia);
312 1.78 pk ia.iom_name = prom_getpropstring(node, "name");
313 1.16 pk
314 1.16 pk /* Propagate BUS & DMA tags */
315 1.16 pk ia.iom_bustag = ma->ma_bustag;
316 1.67 thorpej ia.iom_dmatag = &sc->sc_dmatag;
317 1.27 pk
318 1.16 pk ia.iom_node = node;
319 1.27 pk
320 1.27 pk ia.iom_reg = NULL;
321 1.78 pk prom_getprop(node, "reg", sizeof(struct openprom_addr),
322 1.77 mrg &ia.iom_nreg, &ia.iom_reg);
323 1.27 pk
324 1.94 mrg (void) config_found(self, (void *)&ia, iommu_print);
325 1.27 pk if (ia.iom_reg != NULL)
326 1.27 pk free(ia.iom_reg, M_DEVBUF);
327 1.1 pk }
328 1.4 pk #endif
329 1.1 pk }
330 1.1 pk
331 1.60 darrenr #if defined(SUN4M)
332 1.42 pk static void
333 1.82 uwe iommu_copy_prom_entries(struct iommu_softc *sc)
334 1.42 pk {
335 1.42 pk u_int pbase, pa;
336 1.42 pk u_int range;
337 1.42 pk iopte_t *tpte_p;
338 1.42 pk u_int pagesz = sc->sc_pagesize;
339 1.42 pk int use_ac = (cpuinfo.cpu_impl == 4 && cpuinfo.mxcc);
340 1.42 pk u_int mmupcr_save;
341 1.42 pk
342 1.42 pk /*
343 1.42 pk * We read in the original table using MMU bypass and copy all
344 1.42 pk * of its entries to the appropriate place in our new table,
345 1.42 pk * even if the sizes are different.
346 1.42 pk * This is pretty easy since we know DVMA ends at 0xffffffff.
347 1.42 pk */
348 1.42 pk
349 1.42 pk range = (1 << 24) <<
350 1.42 pk ((sc->sc_reg->io_cr & IOMMU_CTL_RANGE) >> IOMMU_CTL_RANGESHFT);
351 1.42 pk
352 1.42 pk pbase = (sc->sc_reg->io_bar & IOMMU_BAR_IBA) <<
353 1.42 pk (14 - IOMMU_BAR_IBASHFT);
354 1.42 pk
355 1.42 pk if (use_ac) {
356 1.42 pk /*
357 1.42 pk * Set MMU AC bit so we'll still read from the cache
358 1.42 pk * in by-pass mode.
359 1.42 pk */
360 1.42 pk mmupcr_save = lda(SRMMU_PCR, ASI_SRMMU);
361 1.42 pk sta(SRMMU_PCR, ASI_SRMMU, mmupcr_save | VIKING_PCR_AC);
362 1.42 pk } else
363 1.86 msaitoh mmupcr_save = 0; /* XXX - avoid GCC `uninitialized' warning */
364 1.42 pk
365 1.42 pk /* Flush entire IOMMU TLB before messing with the in-memory tables */
366 1.42 pk IOMMU_FLUSHALL(sc);
367 1.42 pk
368 1.42 pk /*
369 1.42 pk * tpte_p = top of our PTE table
370 1.42 pk * pa = top of current PTE table
371 1.42 pk * Then work downwards and copy entries until we hit the bottom
372 1.42 pk * of either table.
373 1.42 pk */
374 1.42 pk for (tpte_p = &sc->sc_ptes[((0 - IOMMU_DVMA_BASE)/pagesz) - 1],
375 1.42 pk pa = (u_int)pbase + (range/pagesz - 1)*sizeof(iopte_t);
376 1.42 pk tpte_p >= &sc->sc_ptes[0] && pa >= (u_int)pbase;
377 1.42 pk tpte_p--, pa -= sizeof(iopte_t)) {
378 1.42 pk
379 1.42 pk *tpte_p = lda(pa, ASI_BYPASS);
380 1.42 pk }
381 1.42 pk
382 1.42 pk if (use_ac) {
383 1.42 pk /* restore mmu after bug-avoidance */
384 1.42 pk sta(SRMMU_PCR, ASI_SRMMU, mmupcr_save);
385 1.42 pk }
386 1.42 pk }
387 1.60 darrenr #endif
388 1.42 pk
389 1.67 thorpej static void
390 1.67 thorpej iommu_enter(struct iommu_softc *sc, bus_addr_t dva, paddr_t pa)
391 1.1 pk {
392 1.1 pk int pte;
393 1.1 pk
394 1.39 pk /* This routine relies on the fact that sc->sc_pagesize == PAGE_SIZE */
395 1.39 pk
396 1.39 pk #ifdef DIAGNOSTIC
397 1.39 pk if (dva < sc->sc_dvmabase)
398 1.39 pk panic("iommu_enter: dva 0x%lx not in DVMA space", (long)dva);
399 1.1 pk #endif
400 1.1 pk
401 1.1 pk pte = atop(pa) << IOPTE_PPNSHFT;
402 1.1 pk pte &= IOPTE_PPN;
403 1.80 pk pte |= IOPTE_V | IOPTE_W | (sc->sc_cachecoherent ? IOPTE_C : 0);
404 1.39 pk sc->sc_ptes[atop(dva - sc->sc_dvmabase)] = pte;
405 1.39 pk IOMMU_FLUSHPAGE(sc, dva);
406 1.1 pk }
407 1.1 pk
408 1.1 pk /*
409 1.67 thorpej * iommu_remove: removes mappings created by iommu_enter
410 1.1 pk */
411 1.67 thorpej static void
412 1.67 thorpej iommu_remove(struct iommu_softc *sc, bus_addr_t dva, bus_size_t len)
413 1.1 pk {
414 1.21 pk u_int pagesz = sc->sc_pagesize;
415 1.21 pk bus_addr_t base = sc->sc_dvmabase;
416 1.1 pk
417 1.1 pk #ifdef DEBUG
418 1.42 pk if (dva < base)
419 1.44 cjs panic("iommu_remove: va 0x%lx not in DVMA space", (long)dva);
420 1.1 pk #endif
421 1.1 pk
422 1.21 pk while ((long)len > 0) {
423 1.1 pk #ifdef notyet
424 1.1 pk #ifdef DEBUG
425 1.42 pk if ((sc->sc_ptes[atop(dva - base)] & IOPTE_V) == 0)
426 1.42 pk panic("iommu_remove: clearing invalid pte at dva 0x%lx",
427 1.42 pk (long)dva);
428 1.1 pk #endif
429 1.1 pk #endif
430 1.42 pk sc->sc_ptes[atop(dva - base)] = 0;
431 1.42 pk IOMMU_FLUSHPAGE(sc, dva);
432 1.21 pk len -= pagesz;
433 1.42 pk dva += pagesz;
434 1.1 pk }
435 1.1 pk }
436 1.1 pk
437 1.1 pk #if 0 /* These registers aren't there??? */
438 1.1 pk void
439 1.82 uwe iommu_error(void)
440 1.1 pk {
441 1.1 pk struct iommu_softc *sc = X;
442 1.1 pk struct iommureg *iop = sc->sc_reg;
443 1.1 pk
444 1.13 fair printf("iommu: afsr 0x%x, afar 0x%x\n", iop->io_afsr, iop->io_afar);
445 1.13 fair printf("iommu: mfsr 0x%x, mfar 0x%x\n", iop->io_mfsr, iop->io_mfar);
446 1.1 pk }
447 1.82 uwe
448 1.1 pk int
449 1.82 uwe iommu_alloc(u_int va, u_int len)
450 1.1 pk {
451 1.1 pk struct iommu_softc *sc = X;
452 1.35 thorpej int off, tva, iovaddr, pte;
453 1.35 thorpej paddr_t pa;
454 1.1 pk
455 1.1 pk off = (int)va & PGOFSET;
456 1.1 pk len = round_page(len + off);
457 1.1 pk va -= off;
458 1.1 pk
459 1.1 pk if ((int)sc->sc_dvmacur + len > 0)
460 1.1 pk sc->sc_dvmacur = sc->sc_dvmabase;
461 1.1 pk
462 1.1 pk iovaddr = tva = sc->sc_dvmacur;
463 1.1 pk sc->sc_dvmacur += len;
464 1.1 pk while (len) {
465 1.35 thorpej (void) pmap_extract(pmap_kernel(), va, &pa);
466 1.1 pk
467 1.1 pk #define IOMMU_PPNSHIFT 8
468 1.1 pk #define IOMMU_V 0x00000002
469 1.1 pk #define IOMMU_W 0x00000004
470 1.1 pk
471 1.1 pk pte = atop(pa) << IOMMU_PPNSHIFT;
472 1.1 pk pte |= IOMMU_V | IOMMU_W;
473 1.1 pk sta(sc->sc_ptes + atop(tva - sc->sc_dvmabase), ASI_BYPASS, pte);
474 1.1 pk sc->sc_reg->io_flushpage = tva;
475 1.75 thorpej len -= PAGE_SIZE;
476 1.75 thorpej va += PAGE_SIZE;
477 1.75 thorpej tva += PAGE_SIZE;
478 1.1 pk }
479 1.1 pk return iovaddr + off;
480 1.1 pk }
481 1.1 pk #endif
482 1.18 pk
483 1.18 pk
484 1.18 pk /*
485 1.50 pk * IOMMU DMA map functions.
486 1.45 pk */
487 1.45 pk int
488 1.82 uwe iommu_dmamap_create(bus_dma_tag_t t, bus_size_t size, int nsegments,
489 1.82 uwe bus_size_t maxsegsz, bus_size_t boundary, int flags,
490 1.82 uwe bus_dmamap_t *dmamp)
491 1.45 pk {
492 1.67 thorpej struct iommu_softc *sc = t->_cookie;
493 1.45 pk bus_dmamap_t map;
494 1.45 pk int error;
495 1.45 pk
496 1.45 pk if ((error = _bus_dmamap_create(t, size, nsegments, maxsegsz,
497 1.45 pk boundary, flags, &map)) != 0)
498 1.45 pk return (error);
499 1.45 pk
500 1.45 pk if ((flags & BUS_DMA_24BIT) != 0) {
501 1.45 pk /* Limit this map to the range usable by `24-bit' devices */
502 1.45 pk map->_dm_ex_start = D24_DVMA_BASE;
503 1.45 pk map->_dm_ex_end = D24_DVMA_END;
504 1.45 pk } else {
505 1.45 pk /* Enable allocations from the entire map */
506 1.67 thorpej map->_dm_ex_start = sc->sc_dvmamap->ex_start;
507 1.67 thorpej map->_dm_ex_end = sc->sc_dvmamap->ex_end;
508 1.45 pk }
509 1.45 pk
510 1.45 pk *dmamp = map;
511 1.45 pk return (0);
512 1.45 pk }
513 1.45 pk
514 1.45 pk /*
515 1.41 pk * Internal routine to allocate space in the IOMMU map.
516 1.18 pk */
517 1.18 pk int
518 1.82 uwe iommu_dvma_alloc(struct iommu_softc *sc, bus_dmamap_t map,
519 1.82 uwe vaddr_t va, bus_size_t len, int flags,
520 1.82 uwe bus_addr_t *dvap, bus_size_t *sgsizep)
521 1.18 pk {
522 1.26 pk bus_size_t sgsize;
523 1.56 eeh u_long align, voff, dvaddr;
524 1.33 pk int s, error;
525 1.41 pk int pagesz = PAGE_SIZE;
526 1.18 pk
527 1.18 pk /*
528 1.24 pk * Remember page offset, then truncate the buffer address to
529 1.24 pk * a page boundary.
530 1.24 pk */
531 1.41 pk voff = va & (pagesz - 1);
532 1.41 pk va &= -pagesz;
533 1.24 pk
534 1.39 pk if (len > map->_dm_size)
535 1.18 pk return (EINVAL);
536 1.18 pk
537 1.41 pk sgsize = (len + voff + pagesz - 1) & -pagesz;
538 1.45 pk align = dvma_cachealign ? dvma_cachealign : map->_dm_align;
539 1.18 pk
540 1.33 pk s = splhigh();
541 1.67 thorpej error = extent_alloc_subregion1(sc->sc_dvmamap,
542 1.45 pk map->_dm_ex_start, map->_dm_ex_end,
543 1.41 pk sgsize, align, va & (align-1),
544 1.41 pk map->_dm_boundary,
545 1.37 pk (flags & BUS_DMA_NOWAIT) == 0
546 1.37 pk ? EX_WAITOK : EX_NOWAIT,
547 1.56 eeh &dvaddr);
548 1.33 pk splx(s);
549 1.56 eeh *dvap = (bus_addr_t)dvaddr;
550 1.39 pk *sgsizep = sgsize;
551 1.39 pk return (error);
552 1.39 pk }
553 1.39 pk
554 1.39 pk /*
555 1.50 pk * Prepare buffer for DMA transfer.
556 1.39 pk */
557 1.39 pk int
558 1.82 uwe iommu_dmamap_load(bus_dma_tag_t t, bus_dmamap_t map,
559 1.82 uwe void *buf, bus_size_t buflen,
560 1.82 uwe struct proc *p, int flags)
561 1.39 pk {
562 1.67 thorpej struct iommu_softc *sc = t->_cookie;
563 1.39 pk bus_size_t sgsize;
564 1.39 pk bus_addr_t dva;
565 1.39 pk vaddr_t va = (vaddr_t)buf;
566 1.41 pk int pagesz = PAGE_SIZE;
567 1.39 pk pmap_t pmap;
568 1.39 pk int error;
569 1.39 pk
570 1.39 pk /*
571 1.39 pk * Make sure that on error condition we return "no valid mappings".
572 1.39 pk */
573 1.39 pk map->dm_nsegs = 0;
574 1.39 pk
575 1.39 pk /* Allocate IOMMU resources */
576 1.67 thorpej if ((error = iommu_dvma_alloc(sc, map, va, buflen, flags,
577 1.39 pk &dva, &sgsize)) != 0)
578 1.33 pk return (error);
579 1.18 pk
580 1.87 macallan if ((sc->sc_cachecoherent == 0) ||
581 1.88 macallan (curcpu()->cacheinfo.ec_totalsize == 0))
582 1.80 pk cache_flush(buf, buflen); /* XXX - move to bus_dma_sync? */
583 1.18 pk
584 1.18 pk /*
585 1.18 pk * We always use just one segment.
586 1.18 pk */
587 1.18 pk map->dm_mapsize = buflen;
588 1.18 pk map->dm_nsegs = 1;
589 1.41 pk map->dm_segs[0].ds_addr = dva + (va & (pagesz - 1));
590 1.26 pk map->dm_segs[0].ds_len = buflen;
591 1.41 pk map->dm_segs[0]._ds_sgsize = sgsize;
592 1.18 pk
593 1.18 pk if (p != NULL)
594 1.18 pk pmap = p->p_vmspace->vm_map.pmap;
595 1.18 pk else
596 1.18 pk pmap = pmap_kernel();
597 1.18 pk
598 1.24 pk for (; sgsize != 0; ) {
599 1.35 thorpej paddr_t pa;
600 1.18 pk /*
601 1.18 pk * Get the physical address for this page.
602 1.18 pk */
603 1.79 pk if (!pmap_extract(pmap, va, &pa)) {
604 1.79 pk iommu_dmamap_unload(t, map);
605 1.79 pk return (EFAULT);
606 1.79 pk }
607 1.18 pk
608 1.67 thorpej iommu_enter(sc, dva, pa);
609 1.24 pk
610 1.41 pk dva += pagesz;
611 1.41 pk va += pagesz;
612 1.41 pk sgsize -= pagesz;
613 1.18 pk }
614 1.24 pk
615 1.18 pk return (0);
616 1.18 pk }
617 1.18 pk
618 1.18 pk /*
619 1.18 pk * Like _bus_dmamap_load(), but for mbufs.
620 1.18 pk */
621 1.18 pk int
622 1.82 uwe iommu_dmamap_load_mbuf(bus_dma_tag_t t, bus_dmamap_t map,
623 1.82 uwe struct mbuf *m, int flags)
624 1.18 pk {
625 1.18 pk
626 1.41 pk panic("_bus_dmamap_load_mbuf: not implemented");
627 1.18 pk }
628 1.18 pk
629 1.18 pk /*
630 1.18 pk * Like _bus_dmamap_load(), but for uios.
631 1.18 pk */
632 1.18 pk int
633 1.82 uwe iommu_dmamap_load_uio(bus_dma_tag_t t, bus_dmamap_t map,
634 1.82 uwe struct uio *uio, int flags)
635 1.18 pk {
636 1.18 pk
637 1.18 pk panic("_bus_dmamap_load_uio: not implemented");
638 1.18 pk }
639 1.18 pk
640 1.18 pk /*
641 1.18 pk * Like _bus_dmamap_load(), but for raw memory allocated with
642 1.18 pk * bus_dmamem_alloc().
643 1.18 pk */
644 1.18 pk int
645 1.82 uwe iommu_dmamap_load_raw(bus_dma_tag_t t, bus_dmamap_t map,
646 1.82 uwe bus_dma_segment_t *segs, int nsegs, bus_size_t size,
647 1.82 uwe int flags)
648 1.18 pk {
649 1.67 thorpej struct iommu_softc *sc = t->_cookie;
650 1.54 chs struct vm_page *m;
651 1.21 pk paddr_t pa;
652 1.24 pk bus_addr_t dva;
653 1.39 pk bus_size_t sgsize;
654 1.18 pk struct pglist *mlist;
655 1.40 pk int pagesz = PAGE_SIZE;
656 1.39 pk int error;
657 1.18 pk
658 1.39 pk map->dm_nsegs = 0;
659 1.18 pk
660 1.39 pk /* Allocate IOMMU resources */
661 1.67 thorpej if ((error = iommu_dvma_alloc(sc, map, segs[0]._ds_va, size,
662 1.39 pk flags, &dva, &sgsize)) != 0)
663 1.33 pk return (error);
664 1.18 pk
665 1.18 pk /*
666 1.39 pk * Note DVMA address in case bus_dmamem_map() is called later.
667 1.39 pk * It can then insure cache coherency by choosing a KVA that
668 1.39 pk * is aligned to `ds_addr'.
669 1.18 pk */
670 1.24 pk segs[0].ds_addr = dva;
671 1.18 pk segs[0].ds_len = size;
672 1.18 pk
673 1.39 pk map->dm_segs[0].ds_addr = dva;
674 1.39 pk map->dm_segs[0].ds_len = size;
675 1.41 pk map->dm_segs[0]._ds_sgsize = sgsize;
676 1.39 pk
677 1.39 pk /* Map physical pages into IOMMU */
678 1.18 pk mlist = segs[0]._ds_mlist;
679 1.90 ad for (m = TAILQ_FIRST(mlist); m != NULL; m = TAILQ_NEXT(m,pageq.queue)) {
680 1.39 pk if (sgsize == 0)
681 1.39 pk panic("iommu_dmamap_load_raw: size botch");
682 1.21 pk pa = VM_PAGE_TO_PHYS(m);
683 1.67 thorpej iommu_enter(sc, dva, pa);
684 1.40 pk dva += pagesz;
685 1.40 pk sgsize -= pagesz;
686 1.18 pk }
687 1.18 pk
688 1.39 pk map->dm_nsegs = 1;
689 1.39 pk map->dm_mapsize = size;
690 1.39 pk
691 1.18 pk return (0);
692 1.18 pk }
693 1.18 pk
694 1.18 pk /*
695 1.39 pk * Unload an IOMMU DMA map.
696 1.18 pk */
697 1.18 pk void
698 1.82 uwe iommu_dmamap_unload(bus_dma_tag_t t, bus_dmamap_t map)
699 1.18 pk {
700 1.67 thorpej struct iommu_softc *sc = t->_cookie;
701 1.39 pk bus_dma_segment_t *segs = map->dm_segs;
702 1.39 pk int nsegs = map->dm_nsegs;
703 1.39 pk bus_addr_t dva;
704 1.18 pk bus_size_t len;
705 1.39 pk int i, s, error;
706 1.39 pk
707 1.39 pk for (i = 0; i < nsegs; i++) {
708 1.41 pk dva = segs[i].ds_addr & -PAGE_SIZE;
709 1.41 pk len = segs[i]._ds_sgsize;
710 1.39 pk
711 1.67 thorpej iommu_remove(sc, dva, len);
712 1.39 pk s = splhigh();
713 1.67 thorpej error = extent_free(sc->sc_dvmamap, dva, len, EX_NOWAIT);
714 1.39 pk splx(s);
715 1.39 pk if (error != 0)
716 1.39 pk printf("warning: %ld of DVMA space lost\n", (long)len);
717 1.39 pk }
718 1.18 pk
719 1.39 pk /* Mark the mappings as invalid. */
720 1.39 pk map->dm_mapsize = 0;
721 1.39 pk map->dm_nsegs = 0;
722 1.39 pk }
723 1.18 pk
724 1.39 pk /*
725 1.39 pk * DMA map synchronization.
726 1.39 pk */
727 1.39 pk void
728 1.82 uwe iommu_dmamap_sync(bus_dma_tag_t t, bus_dmamap_t map,
729 1.82 uwe bus_addr_t offset, bus_size_t len, int ops)
730 1.39 pk {
731 1.18 pk
732 1.18 pk /*
733 1.39 pk * XXX Should flush CPU write buffers.
734 1.18 pk */
735 1.18 pk }
736 1.18 pk
737 1.18 pk /*
738 1.39 pk * Map DMA-safe memory.
739 1.18 pk */
740 1.18 pk int
741 1.82 uwe iommu_dmamem_map(bus_dma_tag_t t, bus_dma_segment_t *segs, int nsegs,
742 1.85 christos size_t size, void **kvap, int flags)
743 1.18 pk {
744 1.80 pk struct iommu_softc *sc = t->_cookie;
745 1.54 chs struct vm_page *m;
746 1.39 pk vaddr_t va;
747 1.18 pk bus_addr_t addr;
748 1.18 pk struct pglist *mlist;
749 1.18 pk int cbit;
750 1.18 pk u_long align;
751 1.40 pk int pagesz = PAGE_SIZE;
752 1.18 pk
753 1.18 pk if (nsegs != 1)
754 1.18 pk panic("iommu_dmamem_map: nsegs = %d", nsegs);
755 1.18 pk
756 1.80 pk cbit = sc->sc_cachecoherent ? 0 : PMAP_NC;
757 1.40 pk align = dvma_cachealign ? dvma_cachealign : pagesz;
758 1.18 pk
759 1.18 pk size = round_page(size);
760 1.18 pk
761 1.18 pk /*
762 1.39 pk * In case the segment has already been loaded by
763 1.39 pk * iommu_dmamap_load_raw(), find a region of kernel virtual
764 1.84 christos * addresses that can accommodate our aligment requirements.
765 1.18 pk */
766 1.40 pk va = _bus_dma_valloc_skewed(size, 0, align,
767 1.40 pk segs[0].ds_addr & (align - 1));
768 1.39 pk if (va == 0)
769 1.18 pk return (ENOMEM);
770 1.18 pk
771 1.39 pk segs[0]._ds_va = va;
772 1.85 christos *kvap = (void *)va;
773 1.18 pk
774 1.39 pk /*
775 1.39 pk * Map the pages allocated in _bus_dmamem_alloc() to the
776 1.39 pk * kernel virtual address space.
777 1.39 pk */
778 1.18 pk mlist = segs[0]._ds_mlist;
779 1.90 ad for (m = TAILQ_FIRST(mlist); m != NULL; m = TAILQ_NEXT(m,pageq.queue)) {
780 1.18 pk
781 1.18 pk if (size == 0)
782 1.18 pk panic("iommu_dmamem_map: size botch");
783 1.18 pk
784 1.18 pk addr = VM_PAGE_TO_PHYS(m);
785 1.92 cegger pmap_kenter_pa(va, addr | cbit,
786 1.92 cegger VM_PROT_READ | VM_PROT_WRITE, 0);
787 1.18 pk #if 0
788 1.18 pk if (flags & BUS_DMA_COHERENT)
789 1.18 pk /* XXX */;
790 1.18 pk #endif
791 1.40 pk va += pagesz;
792 1.40 pk size -= pagesz;
793 1.18 pk }
794 1.55 chris pmap_update(pmap_kernel());
795 1.18 pk
796 1.18 pk return (0);
797 1.18 pk }
798 1.18 pk
799 1.81 yamt void
800 1.85 christos iommu_dmamem_unmap(bus_dma_tag_t t, void *kva, size_t size)
801 1.81 yamt {
802 1.81 yamt
803 1.81 yamt #ifdef DIAGNOSTIC
804 1.81 yamt if ((u_long)kva & PAGE_MASK)
805 1.81 yamt panic("iommu_dmamem_unmap");
806 1.81 yamt #endif
807 1.81 yamt
808 1.81 yamt size = round_page(size);
809 1.81 yamt pmap_kremove((vaddr_t)kva, size);
810 1.81 yamt pmap_update(pmap_kernel());
811 1.81 yamt uvm_unmap(kernel_map, (vaddr_t)kva, (vaddr_t)kva + size);
812 1.81 yamt }
813 1.81 yamt
814 1.81 yamt
815 1.18 pk /*
816 1.39 pk * mmap(2)'ing DMA-safe memory.
817 1.18 pk */
818 1.46 simonb paddr_t
819 1.82 uwe iommu_dmamem_mmap(bus_dma_tag_t t, bus_dma_segment_t *segs, int nsegs,
820 1.82 uwe off_t off, int prot, int flags)
821 1.18 pk {
822 1.18 pk
823 1.18 pk panic("_bus_dmamem_mmap: not implemented");
824 1.18 pk }
825