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