bus_dma.c revision 1.11 1 1.11 thorpej /* $NetBSD: bus_dma.c,v 1.11 2001/04/24 04:31:15 thorpej Exp $ */
2 1.1 ragge
3 1.1 ragge /*-
4 1.1 ragge * Copyright (c) 1996, 1997, 1998 The NetBSD Foundation, Inc.
5 1.1 ragge * All rights reserved.
6 1.1 ragge *
7 1.1 ragge * This code is derived from software contributed to The NetBSD Foundation
8 1.1 ragge * by Jason R. Thorpe of the Numerical Aerospace Simulation Facility,
9 1.1 ragge * NASA Ames Research Center.
10 1.1 ragge *
11 1.1 ragge * Redistribution and use in source and binary forms, with or without
12 1.1 ragge * modification, are permitted provided that the following conditions
13 1.1 ragge * are met:
14 1.1 ragge * 1. Redistributions of source code must retain the above copyright
15 1.1 ragge * notice, this list of conditions and the following disclaimer.
16 1.1 ragge * 2. Redistributions in binary form must reproduce the above copyright
17 1.1 ragge * notice, this list of conditions and the following disclaimer in the
18 1.1 ragge * documentation and/or other materials provided with the distribution.
19 1.1 ragge * 3. All advertising materials mentioning features or use of this software
20 1.1 ragge * must display the following acknowledgement:
21 1.1 ragge * This product includes software developed by the NetBSD
22 1.1 ragge * Foundation, Inc. and its contributors.
23 1.1 ragge * 4. Neither the name of The NetBSD Foundation nor the names of its
24 1.1 ragge * contributors may be used to endorse or promote products derived
25 1.1 ragge * from this software without specific prior written permission.
26 1.1 ragge *
27 1.1 ragge * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
28 1.1 ragge * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
29 1.1 ragge * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
30 1.1 ragge * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
31 1.1 ragge * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
32 1.1 ragge * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
33 1.1 ragge * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
34 1.1 ragge * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
35 1.1 ragge * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
36 1.1 ragge * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
37 1.1 ragge * POSSIBILITY OF SUCH DAMAGE.
38 1.1 ragge */
39 1.1 ragge /*
40 1.1 ragge * bus_dma routines for vax. File copied from arm32/bus_dma.c.
41 1.1 ragge * NetBSD: bus_dma.c,v 1.11 1998/09/21 22:53:35 thorpej Exp
42 1.1 ragge */
43 1.1 ragge
44 1.1 ragge #include <sys/param.h>
45 1.1 ragge #include <sys/systm.h>
46 1.1 ragge #include <sys/kernel.h>
47 1.1 ragge #include <sys/map.h>
48 1.1 ragge #include <sys/proc.h>
49 1.1 ragge #include <sys/buf.h>
50 1.1 ragge #include <sys/reboot.h>
51 1.1 ragge #include <sys/conf.h>
52 1.1 ragge #include <sys/file.h>
53 1.1 ragge #include <sys/malloc.h>
54 1.1 ragge #include <sys/mbuf.h>
55 1.1 ragge #include <sys/vnode.h>
56 1.1 ragge #include <sys/device.h>
57 1.1 ragge
58 1.1 ragge #include <uvm/uvm_extern.h>
59 1.1 ragge
60 1.1 ragge #define _VAX_BUS_DMA_PRIVATE
61 1.1 ragge #include <machine/bus.h>
62 1.1 ragge
63 1.1 ragge #include <machine/ka43.h>
64 1.1 ragge #include <machine/sid.h>
65 1.1 ragge
66 1.1 ragge extern vaddr_t avail_start, avail_end, virtual_avail;
67 1.1 ragge
68 1.1 ragge int _bus_dmamap_load_buffer __P((bus_dma_tag_t, bus_dmamap_t, void *,
69 1.6 matt bus_size_t, struct proc *, int, vaddr_t *, int *, int));
70 1.1 ragge int _bus_dma_inrange __P((bus_dma_segment_t *, int, bus_addr_t));
71 1.1 ragge int _bus_dmamem_alloc_range __P((bus_dma_tag_t, bus_size_t, bus_size_t,
72 1.1 ragge bus_size_t, bus_dma_segment_t*, int, int *, int, vaddr_t, vaddr_t));
73 1.1 ragge /*
74 1.1 ragge * Common function for DMA map creation. May be called by bus-specific
75 1.1 ragge * DMA map creation functions.
76 1.1 ragge */
77 1.1 ragge int
78 1.1 ragge _bus_dmamap_create(t, size, nsegments, maxsegsz, boundary, flags, dmamp)
79 1.1 ragge bus_dma_tag_t t;
80 1.1 ragge bus_size_t size;
81 1.1 ragge int nsegments;
82 1.1 ragge bus_size_t maxsegsz;
83 1.1 ragge bus_size_t boundary;
84 1.1 ragge int flags;
85 1.1 ragge bus_dmamap_t *dmamp;
86 1.1 ragge {
87 1.1 ragge struct vax_bus_dmamap *map;
88 1.1 ragge void *mapstore;
89 1.1 ragge size_t mapsize;
90 1.1 ragge
91 1.1 ragge #ifdef DEBUG_DMA
92 1.1 ragge printf("dmamap_create: t=%p size=%lx nseg=%x msegsz=%lx boundary=%lx flags=%x\n",
93 1.1 ragge t, size, nsegments, maxsegsz, boundary, flags);
94 1.1 ragge #endif /* DEBUG_DMA */
95 1.1 ragge
96 1.1 ragge /*
97 1.1 ragge * Allocate and initialize the DMA map. The end of the map
98 1.1 ragge * is a variable-sized array of segments, so we allocate enough
99 1.1 ragge * room for them in one shot.
100 1.1 ragge *
101 1.1 ragge * Note we don't preserve the WAITOK or NOWAIT flags. Preservation
102 1.1 ragge * of ALLOCNOW notifies others that we've reserved these resources,
103 1.1 ragge * and they are not to be freed.
104 1.1 ragge *
105 1.1 ragge * The bus_dmamap_t includes one bus_dma_segment_t, hence
106 1.1 ragge * the (nsegments - 1).
107 1.1 ragge */
108 1.1 ragge mapsize = sizeof(struct vax_bus_dmamap) +
109 1.1 ragge (sizeof(bus_dma_segment_t) * (nsegments - 1));
110 1.1 ragge if ((mapstore = malloc(mapsize, M_DMAMAP,
111 1.1 ragge (flags & BUS_DMA_NOWAIT) ? M_NOWAIT : M_WAITOK)) == NULL)
112 1.1 ragge return (ENOMEM);
113 1.1 ragge
114 1.1 ragge bzero(mapstore, mapsize);
115 1.1 ragge map = (struct vax_bus_dmamap *)mapstore;
116 1.1 ragge map->_dm_size = size;
117 1.1 ragge map->_dm_segcnt = nsegments;
118 1.1 ragge map->_dm_maxsegsz = maxsegsz;
119 1.1 ragge map->_dm_boundary = boundary;
120 1.1 ragge map->_dm_flags = flags & ~(BUS_DMA_WAITOK|BUS_DMA_NOWAIT);
121 1.1 ragge map->dm_mapsize = 0; /* no valid mappings */
122 1.1 ragge map->dm_nsegs = 0;
123 1.1 ragge
124 1.1 ragge *dmamp = map;
125 1.1 ragge #ifdef DEBUG_DMA
126 1.1 ragge printf("dmamap_create:map=%p\n", map);
127 1.1 ragge #endif /* DEBUG_DMA */
128 1.1 ragge return (0);
129 1.1 ragge }
130 1.1 ragge
131 1.1 ragge /*
132 1.1 ragge * Common function for DMA map destruction. May be called by bus-specific
133 1.1 ragge * DMA map destruction functions.
134 1.1 ragge */
135 1.1 ragge void
136 1.1 ragge _bus_dmamap_destroy(t, map)
137 1.1 ragge bus_dma_tag_t t;
138 1.1 ragge bus_dmamap_t map;
139 1.1 ragge {
140 1.1 ragge
141 1.1 ragge #ifdef DEBUG_DMA
142 1.1 ragge printf("dmamap_destroy: t=%p map=%p\n", t, map);
143 1.1 ragge #endif /* DEBUG_DMA */
144 1.1 ragge #ifdef DIAGNOSTIC
145 1.1 ragge if (map->dm_nsegs > 0)
146 1.1 ragge printf("bus_dmamap_destroy() called for map with valid mappings\n");
147 1.1 ragge #endif /* DIAGNOSTIC */
148 1.1 ragge free(map, M_DEVBUF);
149 1.1 ragge }
150 1.1 ragge
151 1.1 ragge /*
152 1.1 ragge * Common function for loading a DMA map with a linear buffer. May
153 1.1 ragge * be called by bus-specific DMA map load functions.
154 1.1 ragge */
155 1.1 ragge int
156 1.1 ragge _bus_dmamap_load(t, map, buf, buflen, p, flags)
157 1.1 ragge bus_dma_tag_t t;
158 1.1 ragge bus_dmamap_t map;
159 1.1 ragge void *buf;
160 1.1 ragge bus_size_t buflen;
161 1.1 ragge struct proc *p;
162 1.1 ragge int flags;
163 1.1 ragge {
164 1.6 matt vaddr_t lastaddr;
165 1.1 ragge int seg, error;
166 1.1 ragge
167 1.1 ragge #ifdef DEBUG_DMA
168 1.1 ragge printf("dmamap_load: t=%p map=%p buf=%p len=%lx p=%p f=%d\n",
169 1.1 ragge t, map, buf, buflen, p, flags);
170 1.1 ragge #endif /* DEBUG_DMA */
171 1.1 ragge
172 1.1 ragge /*
173 1.1 ragge * Make sure that on error condition we return "no valid mappings".
174 1.1 ragge */
175 1.1 ragge map->dm_mapsize = 0;
176 1.1 ragge map->dm_nsegs = 0;
177 1.1 ragge
178 1.1 ragge if (buflen > map->_dm_size)
179 1.1 ragge return (EINVAL);
180 1.1 ragge
181 1.1 ragge seg = 0;
182 1.1 ragge error = _bus_dmamap_load_buffer(t, map, buf, buflen, p, flags,
183 1.1 ragge &lastaddr, &seg, 1);
184 1.1 ragge if (error == 0) {
185 1.1 ragge map->dm_mapsize = buflen;
186 1.1 ragge map->dm_nsegs = seg + 1;
187 1.1 ragge }
188 1.1 ragge #ifdef DEBUG_DMA
189 1.1 ragge printf("dmamap_load: error=%d\n", error);
190 1.1 ragge #endif /* DEBUG_DMA */
191 1.1 ragge return (error);
192 1.1 ragge }
193 1.1 ragge
194 1.1 ragge /*
195 1.1 ragge * Like _bus_dmamap_load(), but for mbufs.
196 1.1 ragge */
197 1.1 ragge int
198 1.1 ragge _bus_dmamap_load_mbuf(t, map, m0, flags)
199 1.1 ragge bus_dma_tag_t t;
200 1.1 ragge bus_dmamap_t map;
201 1.1 ragge struct mbuf *m0;
202 1.1 ragge int flags;
203 1.1 ragge {
204 1.6 matt vaddr_t lastaddr;
205 1.1 ragge int seg, error, first;
206 1.1 ragge struct mbuf *m;
207 1.1 ragge
208 1.1 ragge #ifdef DEBUG_DMA
209 1.1 ragge printf("dmamap_load_mbuf: t=%p map=%p m0=%p f=%d\n",
210 1.1 ragge t, map, m0, flags);
211 1.1 ragge #endif /* DEBUG_DMA */
212 1.1 ragge
213 1.1 ragge /*
214 1.1 ragge * Make sure that on error condition we return "no valid mappings."
215 1.1 ragge */
216 1.1 ragge map->dm_mapsize = 0;
217 1.1 ragge map->dm_nsegs = 0;
218 1.1 ragge
219 1.1 ragge #ifdef DIAGNOSTIC
220 1.1 ragge if ((m0->m_flags & M_PKTHDR) == 0)
221 1.1 ragge panic("_bus_dmamap_load_mbuf: no packet header");
222 1.1 ragge #endif /* DIAGNOSTIC */
223 1.1 ragge
224 1.1 ragge if (m0->m_pkthdr.len > map->_dm_size)
225 1.1 ragge return (EINVAL);
226 1.1 ragge
227 1.1 ragge first = 1;
228 1.1 ragge seg = 0;
229 1.1 ragge error = 0;
230 1.1 ragge for (m = m0; m != NULL && error == 0; m = m->m_next) {
231 1.1 ragge error = _bus_dmamap_load_buffer(t, map, m->m_data, m->m_len,
232 1.1 ragge NULL, flags, &lastaddr, &seg, first);
233 1.1 ragge first = 0;
234 1.1 ragge }
235 1.1 ragge if (error == 0) {
236 1.1 ragge map->dm_mapsize = m0->m_pkthdr.len;
237 1.1 ragge map->dm_nsegs = seg + 1;
238 1.1 ragge }
239 1.1 ragge #ifdef DEBUG_DMA
240 1.1 ragge printf("dmamap_load_mbuf: error=%d\n", error);
241 1.1 ragge #endif /* DEBUG_DMA */
242 1.1 ragge return (error);
243 1.1 ragge }
244 1.1 ragge
245 1.1 ragge /*
246 1.1 ragge * Like _bus_dmamap_load(), but for uios.
247 1.1 ragge */
248 1.1 ragge int
249 1.1 ragge _bus_dmamap_load_uio(t, map, uio, flags)
250 1.1 ragge bus_dma_tag_t t;
251 1.1 ragge bus_dmamap_t map;
252 1.1 ragge struct uio *uio;
253 1.1 ragge int flags;
254 1.1 ragge {
255 1.6 matt vaddr_t lastaddr;
256 1.1 ragge int seg, i, error, first;
257 1.1 ragge bus_size_t minlen, resid;
258 1.1 ragge struct proc *p = NULL;
259 1.1 ragge struct iovec *iov;
260 1.1 ragge caddr_t addr;
261 1.1 ragge
262 1.1 ragge /*
263 1.1 ragge * Make sure that on error condition we return "no valid mappings."
264 1.1 ragge */
265 1.1 ragge map->dm_mapsize = 0;
266 1.1 ragge map->dm_nsegs = 0;
267 1.1 ragge
268 1.1 ragge resid = uio->uio_resid;
269 1.1 ragge iov = uio->uio_iov;
270 1.1 ragge
271 1.1 ragge if (uio->uio_segflg == UIO_USERSPACE) {
272 1.1 ragge p = uio->uio_procp;
273 1.1 ragge #ifdef DIAGNOSTIC
274 1.1 ragge if (p == NULL)
275 1.1 ragge panic("_bus_dmamap_load_uio: USERSPACE but no proc");
276 1.1 ragge #endif
277 1.1 ragge }
278 1.1 ragge
279 1.1 ragge first = 1;
280 1.1 ragge seg = 0;
281 1.1 ragge error = 0;
282 1.1 ragge for (i = 0; i < uio->uio_iovcnt && resid != 0 && error == 0; i++) {
283 1.1 ragge /*
284 1.1 ragge * Now at the first iovec to load. Load each iovec
285 1.1 ragge * until we have exhausted the residual count.
286 1.1 ragge */
287 1.1 ragge minlen = resid < iov[i].iov_len ? resid : iov[i].iov_len;
288 1.1 ragge addr = (caddr_t)iov[i].iov_base;
289 1.1 ragge
290 1.1 ragge error = _bus_dmamap_load_buffer(t, map, addr, minlen,
291 1.1 ragge p, flags, &lastaddr, &seg, first);
292 1.1 ragge first = 0;
293 1.1 ragge
294 1.1 ragge resid -= minlen;
295 1.1 ragge }
296 1.1 ragge if (error == 0) {
297 1.1 ragge map->dm_mapsize = uio->uio_resid;
298 1.1 ragge map->dm_nsegs = seg + 1;
299 1.1 ragge }
300 1.1 ragge return (error);
301 1.1 ragge }
302 1.1 ragge
303 1.1 ragge /*
304 1.1 ragge * Like _bus_dmamap_load(), but for raw memory allocated with
305 1.1 ragge * bus_dmamem_alloc().
306 1.1 ragge */
307 1.1 ragge int
308 1.1 ragge _bus_dmamap_load_raw(t, map, segs, nsegs, size, flags)
309 1.1 ragge bus_dma_tag_t t;
310 1.1 ragge bus_dmamap_t map;
311 1.1 ragge bus_dma_segment_t *segs;
312 1.1 ragge int nsegs;
313 1.1 ragge bus_size_t size;
314 1.1 ragge int flags;
315 1.1 ragge {
316 1.1 ragge
317 1.1 ragge panic("_bus_dmamap_load_raw: not implemented");
318 1.1 ragge }
319 1.1 ragge
320 1.1 ragge /*
321 1.1 ragge * Common function for unloading a DMA map. May be called by
322 1.1 ragge * bus-specific DMA map unload functions.
323 1.1 ragge */
324 1.1 ragge void
325 1.1 ragge _bus_dmamap_unload(t, map)
326 1.1 ragge bus_dma_tag_t t;
327 1.1 ragge bus_dmamap_t map;
328 1.1 ragge {
329 1.1 ragge
330 1.1 ragge #ifdef DEBUG_DMA
331 1.1 ragge printf("dmamap_unload: t=%p map=%p\n", t, map);
332 1.1 ragge #endif /* DEBUG_DMA */
333 1.1 ragge
334 1.1 ragge /*
335 1.1 ragge * No resources to free; just mark the mappings as
336 1.1 ragge * invalid.
337 1.1 ragge */
338 1.1 ragge map->dm_mapsize = 0;
339 1.1 ragge map->dm_nsegs = 0;
340 1.1 ragge }
341 1.1 ragge
342 1.1 ragge /*
343 1.1 ragge * Common function for DMA map synchronization. May be called
344 1.1 ragge * by bus-specific DMA map synchronization functions.
345 1.1 ragge */
346 1.1 ragge void
347 1.1 ragge _bus_dmamap_sync(t, map, offset, len, ops)
348 1.1 ragge bus_dma_tag_t t;
349 1.1 ragge bus_dmamap_t map;
350 1.1 ragge bus_addr_t offset;
351 1.1 ragge bus_size_t len;
352 1.1 ragge int ops;
353 1.1 ragge {
354 1.1 ragge #ifdef DEBUG_DMA
355 1.1 ragge printf("dmamap_sync: t=%p map=%p offset=%lx len=%lx ops=%x\n",
356 1.1 ragge t, map, offset, len, ops);
357 1.1 ragge #endif /* DEBUG_DMA */
358 1.1 ragge /*
359 1.1 ragge * A vax only has snoop-cache, so this routine is a no-op.
360 1.1 ragge */
361 1.1 ragge return;
362 1.1 ragge }
363 1.1 ragge
364 1.1 ragge /*
365 1.1 ragge * Common function for DMA-safe memory allocation. May be called
366 1.1 ragge * by bus-specific DMA memory allocation functions.
367 1.1 ragge */
368 1.1 ragge
369 1.1 ragge int
370 1.1 ragge _bus_dmamem_alloc(t, size, alignment, boundary, segs, nsegs, rsegs, flags)
371 1.1 ragge bus_dma_tag_t t;
372 1.1 ragge bus_size_t size, alignment, boundary;
373 1.1 ragge bus_dma_segment_t *segs;
374 1.1 ragge int nsegs;
375 1.1 ragge int *rsegs;
376 1.1 ragge int flags;
377 1.1 ragge {
378 1.1 ragge int error;
379 1.1 ragge
380 1.1 ragge error = (_bus_dmamem_alloc_range(t, size, alignment, boundary,
381 1.1 ragge segs, nsegs, rsegs, flags, round_page(avail_start),
382 1.1 ragge trunc_page(avail_end)));
383 1.1 ragge return(error);
384 1.1 ragge }
385 1.1 ragge
386 1.1 ragge /*
387 1.1 ragge * Common function for freeing DMA-safe memory. May be called by
388 1.1 ragge * bus-specific DMA memory free functions.
389 1.1 ragge */
390 1.1 ragge void
391 1.1 ragge _bus_dmamem_free(t, segs, nsegs)
392 1.1 ragge bus_dma_tag_t t;
393 1.1 ragge bus_dma_segment_t *segs;
394 1.1 ragge int nsegs;
395 1.1 ragge {
396 1.1 ragge vm_page_t m;
397 1.1 ragge bus_addr_t addr;
398 1.1 ragge struct pglist mlist;
399 1.1 ragge int curseg;
400 1.1 ragge
401 1.1 ragge #ifdef DEBUG_DMA
402 1.1 ragge printf("dmamem_free: t=%p segs=%p nsegs=%x\n", t, segs, nsegs);
403 1.1 ragge #endif /* DEBUG_DMA */
404 1.1 ragge
405 1.1 ragge /*
406 1.1 ragge * Build a list of pages to free back to the VM system.
407 1.1 ragge */
408 1.1 ragge TAILQ_INIT(&mlist);
409 1.1 ragge for (curseg = 0; curseg < nsegs; curseg++) {
410 1.1 ragge for (addr = segs[curseg].ds_addr;
411 1.1 ragge addr < (segs[curseg].ds_addr + segs[curseg].ds_len);
412 1.1 ragge addr += PAGE_SIZE) {
413 1.1 ragge m = PHYS_TO_VM_PAGE(addr);
414 1.1 ragge TAILQ_INSERT_TAIL(&mlist, m, pageq);
415 1.1 ragge }
416 1.1 ragge }
417 1.1 ragge uvm_pglistfree(&mlist);
418 1.1 ragge }
419 1.1 ragge
420 1.1 ragge /*
421 1.1 ragge * Common function for mapping DMA-safe memory. May be called by
422 1.1 ragge * bus-specific DMA memory map functions.
423 1.1 ragge */
424 1.1 ragge int
425 1.1 ragge _bus_dmamem_map(t, segs, nsegs, size, kvap, flags)
426 1.1 ragge bus_dma_tag_t t;
427 1.1 ragge bus_dma_segment_t *segs;
428 1.1 ragge int nsegs;
429 1.1 ragge size_t size;
430 1.1 ragge caddr_t *kvap;
431 1.1 ragge int flags;
432 1.1 ragge {
433 1.6 matt vaddr_t va;
434 1.1 ragge bus_addr_t addr;
435 1.1 ragge int curseg;
436 1.1 ragge
437 1.1 ragge /*
438 1.1 ragge * Special case (but common):
439 1.1 ragge * If there is only one physical segment then the already-mapped
440 1.1 ragge * virtual address is returned, since all physical memory is already
441 1.1 ragge * in the beginning of kernel virtual memory.
442 1.1 ragge */
443 1.1 ragge if (nsegs == 1) {
444 1.1 ragge *kvap = (caddr_t)(segs[0].ds_addr | KERNBASE);
445 1.1 ragge /*
446 1.1 ragge * KA43 (3100/m76) must have its DMA-safe memory accessed
447 1.1 ragge * through DIAGMEM. Remap it here.
448 1.1 ragge */
449 1.1 ragge if (vax_boardtype == VAX_BTYP_43) {
450 1.1 ragge pmap_map((vaddr_t)*kvap, segs[0].ds_addr|KA43_DIAGMEM,
451 1.1 ragge (segs[0].ds_addr|KA43_DIAGMEM) + size,
452 1.1 ragge VM_PROT_READ|VM_PROT_WRITE);
453 1.1 ragge }
454 1.1 ragge return 0;
455 1.1 ragge }
456 1.1 ragge size = round_page(size);
457 1.1 ragge va = uvm_km_valloc(kernel_map, size);
458 1.1 ragge
459 1.1 ragge if (va == 0)
460 1.1 ragge return (ENOMEM);
461 1.1 ragge
462 1.1 ragge *kvap = (caddr_t)va;
463 1.1 ragge
464 1.1 ragge for (curseg = 0; curseg < nsegs; curseg++) {
465 1.1 ragge for (addr = segs[curseg].ds_addr;
466 1.1 ragge addr < (segs[curseg].ds_addr + segs[curseg].ds_len);
467 1.1 ragge addr += NBPG, va += NBPG, size -= NBPG) {
468 1.1 ragge if (size == 0)
469 1.1 ragge panic("_bus_dmamem_map: size botch");
470 1.1 ragge if (vax_boardtype == VAX_BTYP_43)
471 1.1 ragge addr |= KA43_DIAGMEM;
472 1.2 thorpej pmap_enter(pmap_kernel(), va, addr,
473 1.5 thorpej VM_PROT_READ | VM_PROT_WRITE,
474 1.5 thorpej VM_PROT_READ | VM_PROT_WRITE | PMAP_WIRED);
475 1.1 ragge }
476 1.1 ragge }
477 1.11 thorpej pmap_update();
478 1.1 ragge return (0);
479 1.1 ragge }
480 1.1 ragge
481 1.1 ragge /*
482 1.1 ragge * Common function for unmapping DMA-safe memory. May be called by
483 1.1 ragge * bus-specific DMA memory unmapping functions.
484 1.1 ragge */
485 1.1 ragge void
486 1.1 ragge _bus_dmamem_unmap(t, kva, size)
487 1.1 ragge bus_dma_tag_t t;
488 1.1 ragge caddr_t kva;
489 1.1 ragge size_t size;
490 1.1 ragge {
491 1.1 ragge
492 1.1 ragge #ifdef DEBUG_DMA
493 1.1 ragge printf("dmamem_unmap: t=%p kva=%p size=%x\n", t, kva, size);
494 1.1 ragge #endif /* DEBUG_DMA */
495 1.1 ragge #ifdef DIAGNOSTIC
496 1.1 ragge if ((u_long)kva & PGOFSET)
497 1.1 ragge panic("_bus_dmamem_unmap");
498 1.1 ragge #endif /* DIAGNOSTIC */
499 1.1 ragge
500 1.1 ragge /* Avoid free'ing if not mapped */
501 1.1 ragge if (kva >= (caddr_t)virtual_avail)
502 1.6 matt uvm_km_free(kernel_map, (vaddr_t)kva, round_page(size));
503 1.1 ragge }
504 1.1 ragge
505 1.1 ragge /*
506 1.1 ragge * Common functin for mmap(2)'ing DMA-safe memory. May be called by
507 1.1 ragge * bus-specific DMA mmap(2)'ing functions.
508 1.1 ragge */
509 1.7 simonb paddr_t
510 1.1 ragge _bus_dmamem_mmap(t, segs, nsegs, off, prot, flags)
511 1.1 ragge bus_dma_tag_t t;
512 1.1 ragge bus_dma_segment_t *segs;
513 1.7 simonb int nsegs;
514 1.7 simonb off_t off;
515 1.7 simonb int prot, flags;
516 1.1 ragge {
517 1.1 ragge int i;
518 1.1 ragge
519 1.1 ragge for (i = 0; i < nsegs; i++) {
520 1.1 ragge #ifdef DIAGNOSTIC
521 1.1 ragge if (off & PGOFSET)
522 1.1 ragge panic("_bus_dmamem_mmap: offset unaligned");
523 1.1 ragge if (segs[i].ds_addr & PGOFSET)
524 1.1 ragge panic("_bus_dmamem_mmap: segment unaligned");
525 1.1 ragge if (segs[i].ds_len & PGOFSET)
526 1.1 ragge panic("_bus_dmamem_mmap: segment size not multiple"
527 1.1 ragge " of page size");
528 1.1 ragge #endif /* DIAGNOSTIC */
529 1.1 ragge if (off >= segs[i].ds_len) {
530 1.1 ragge off -= segs[i].ds_len;
531 1.1 ragge continue;
532 1.1 ragge }
533 1.1 ragge
534 1.1 ragge return (btop((u_long)segs[i].ds_addr + off));
535 1.1 ragge }
536 1.1 ragge
537 1.1 ragge /* Page not found. */
538 1.1 ragge return (-1);
539 1.1 ragge }
540 1.1 ragge
541 1.1 ragge /**********************************************************************
542 1.1 ragge * DMA utility functions
543 1.1 ragge **********************************************************************/
544 1.1 ragge
545 1.1 ragge /*
546 1.1 ragge * Utility function to load a linear buffer. lastaddrp holds state
547 1.1 ragge * between invocations (for multiple-buffer loads). segp contains
548 1.1 ragge * the starting segment on entrace, and the ending segment on exit.
549 1.1 ragge * first indicates if this is the first invocation of this function.
550 1.1 ragge */
551 1.1 ragge int
552 1.1 ragge _bus_dmamap_load_buffer(t, map, buf, buflen, p, flags, lastaddrp, segp, first)
553 1.1 ragge bus_dma_tag_t t;
554 1.1 ragge bus_dmamap_t map;
555 1.1 ragge void *buf;
556 1.1 ragge bus_size_t buflen;
557 1.1 ragge struct proc *p;
558 1.1 ragge int flags;
559 1.6 matt vaddr_t *lastaddrp;
560 1.1 ragge int *segp;
561 1.1 ragge int first;
562 1.1 ragge {
563 1.1 ragge bus_size_t sgsize;
564 1.1 ragge bus_addr_t curaddr, lastaddr, baddr, bmask;
565 1.6 matt vaddr_t vaddr = (vaddr_t)buf;
566 1.1 ragge int seg;
567 1.1 ragge pmap_t pmap;
568 1.1 ragge
569 1.1 ragge #ifdef DEBUG_DMA
570 1.1 ragge printf("_bus_dmamem_load_buffer(buf=%p, len=%lx, flags=%d, 1st=%d)\n",
571 1.1 ragge buf, buflen, flags, first);
572 1.1 ragge #endif /* DEBUG_DMA */
573 1.1 ragge
574 1.1 ragge if (p != NULL)
575 1.1 ragge pmap = p->p_vmspace->vm_map.pmap;
576 1.1 ragge else
577 1.1 ragge pmap = pmap_kernel();
578 1.1 ragge
579 1.1 ragge lastaddr = *lastaddrp;
580 1.1 ragge bmask = ~(map->_dm_boundary - 1);
581 1.1 ragge
582 1.1 ragge for (seg = *segp; buflen > 0; ) {
583 1.1 ragge /*
584 1.1 ragge * Get the physical address for this segment.
585 1.1 ragge */
586 1.3 thorpej (void) pmap_extract(pmap, (vaddr_t)vaddr, &curaddr);
587 1.1 ragge
588 1.1 ragge #if 0
589 1.1 ragge /*
590 1.1 ragge * Make sure we're in an allowed DMA range.
591 1.1 ragge */
592 1.1 ragge if (t->_ranges != NULL &&
593 1.1 ragge _bus_dma_inrange(t->_ranges, t->_nranges, curaddr) == 0)
594 1.1 ragge return (EINVAL);
595 1.1 ragge #endif
596 1.1 ragge
597 1.1 ragge /*
598 1.1 ragge * Compute the segment size, and adjust counts.
599 1.1 ragge */
600 1.1 ragge sgsize = NBPG - ((u_long)vaddr & PGOFSET);
601 1.1 ragge if (buflen < sgsize)
602 1.1 ragge sgsize = buflen;
603 1.1 ragge
604 1.1 ragge /*
605 1.1 ragge * Make sure we don't cross any boundaries.
606 1.1 ragge */
607 1.1 ragge if (map->_dm_boundary > 0) {
608 1.1 ragge baddr = (curaddr + map->_dm_boundary) & bmask;
609 1.1 ragge if (sgsize > (baddr - curaddr))
610 1.1 ragge sgsize = (baddr - curaddr);
611 1.1 ragge }
612 1.1 ragge
613 1.1 ragge /*
614 1.1 ragge * Insert chunk into a segment, coalescing with
615 1.1 ragge * previous segment if possible.
616 1.1 ragge */
617 1.1 ragge if (first) {
618 1.1 ragge map->dm_segs[seg].ds_addr = curaddr;
619 1.1 ragge map->dm_segs[seg].ds_len = sgsize;
620 1.1 ragge first = 0;
621 1.1 ragge } else {
622 1.1 ragge if (curaddr == lastaddr &&
623 1.1 ragge (map->dm_segs[seg].ds_len + sgsize) <=
624 1.1 ragge map->_dm_maxsegsz &&
625 1.1 ragge (map->_dm_boundary == 0 ||
626 1.1 ragge (map->dm_segs[seg].ds_addr & bmask) ==
627 1.1 ragge (curaddr & bmask)))
628 1.1 ragge map->dm_segs[seg].ds_len += sgsize;
629 1.1 ragge else {
630 1.1 ragge if (++seg >= map->_dm_segcnt)
631 1.1 ragge break;
632 1.1 ragge map->dm_segs[seg].ds_addr = curaddr;
633 1.1 ragge map->dm_segs[seg].ds_len = sgsize;
634 1.1 ragge }
635 1.1 ragge }
636 1.1 ragge
637 1.1 ragge lastaddr = curaddr + sgsize;
638 1.1 ragge vaddr += sgsize;
639 1.1 ragge buflen -= sgsize;
640 1.1 ragge }
641 1.1 ragge
642 1.1 ragge *segp = seg;
643 1.1 ragge *lastaddrp = lastaddr;
644 1.1 ragge
645 1.1 ragge /*
646 1.1 ragge * Did we fit?
647 1.1 ragge */
648 1.1 ragge if (buflen != 0)
649 1.1 ragge return (EFBIG); /* XXX better return value here? */
650 1.1 ragge return (0);
651 1.1 ragge }
652 1.1 ragge
653 1.1 ragge /*
654 1.1 ragge * Check to see if the specified page is in an allowed DMA range.
655 1.1 ragge */
656 1.1 ragge int
657 1.1 ragge _bus_dma_inrange(ranges, nranges, curaddr)
658 1.1 ragge bus_dma_segment_t *ranges;
659 1.1 ragge int nranges;
660 1.1 ragge bus_addr_t curaddr;
661 1.1 ragge {
662 1.1 ragge bus_dma_segment_t *ds;
663 1.1 ragge int i;
664 1.1 ragge
665 1.1 ragge for (i = 0, ds = ranges; i < nranges; i++, ds++) {
666 1.1 ragge if (curaddr >= ds->ds_addr &&
667 1.1 ragge round_page(curaddr) <= (ds->ds_addr + ds->ds_len))
668 1.1 ragge return (1);
669 1.1 ragge }
670 1.1 ragge
671 1.1 ragge return (0);
672 1.1 ragge }
673 1.1 ragge
674 1.1 ragge /*
675 1.1 ragge * Allocate physical memory from the given physical address range.
676 1.1 ragge * Called by DMA-safe memory allocation methods.
677 1.1 ragge */
678 1.1 ragge int
679 1.1 ragge _bus_dmamem_alloc_range(t, size, alignment, boundary, segs, nsegs, rsegs,
680 1.1 ragge flags, low, high)
681 1.1 ragge bus_dma_tag_t t;
682 1.1 ragge bus_size_t size, alignment, boundary;
683 1.1 ragge bus_dma_segment_t *segs;
684 1.1 ragge int nsegs;
685 1.1 ragge int *rsegs;
686 1.1 ragge int flags;
687 1.6 matt vaddr_t low;
688 1.6 matt vaddr_t high;
689 1.1 ragge {
690 1.6 matt vaddr_t curaddr, lastaddr;
691 1.1 ragge vm_page_t m;
692 1.1 ragge struct pglist mlist;
693 1.1 ragge int curseg, error;
694 1.1 ragge
695 1.1 ragge #ifdef DEBUG_DMA
696 1.1 ragge printf("alloc_range: t=%p size=%lx align=%lx boundary=%lx segs=%p nsegs=%x rsegs=%p flags=%x lo=%lx hi=%lx\n",
697 1.1 ragge t, size, alignment, boundary, segs, nsegs, rsegs, flags, low, high);
698 1.1 ragge #endif /* DEBUG_DMA */
699 1.1 ragge
700 1.1 ragge /* Always round the size. */
701 1.1 ragge size = round_page(size);
702 1.1 ragge
703 1.1 ragge /*
704 1.1 ragge * Allocate pages from the VM system.
705 1.1 ragge */
706 1.1 ragge TAILQ_INIT(&mlist);
707 1.1 ragge error = uvm_pglistalloc(size, low, high, alignment, boundary,
708 1.1 ragge &mlist, nsegs, (flags & BUS_DMA_NOWAIT) == 0);
709 1.1 ragge if (error)
710 1.1 ragge return (error);
711 1.1 ragge
712 1.1 ragge /*
713 1.1 ragge * Compute the location, size, and number of segments actually
714 1.1 ragge * returned by the VM code.
715 1.1 ragge */
716 1.1 ragge m = mlist.tqh_first;
717 1.1 ragge curseg = 0;
718 1.1 ragge lastaddr = segs[curseg].ds_addr = VM_PAGE_TO_PHYS(m);
719 1.1 ragge segs[curseg].ds_len = PAGE_SIZE;
720 1.1 ragge #ifdef DEBUG_DMA
721 1.1 ragge printf("alloc: page %lx\n", lastaddr);
722 1.1 ragge #endif /* DEBUG_DMA */
723 1.1 ragge m = m->pageq.tqe_next;
724 1.1 ragge
725 1.1 ragge for (; m != NULL; m = m->pageq.tqe_next) {
726 1.1 ragge curaddr = VM_PAGE_TO_PHYS(m);
727 1.1 ragge #ifdef DIAGNOSTIC
728 1.1 ragge if (curaddr < low || curaddr >= high) {
729 1.10 soren printf("uvm_pglistalloc returned non-sensical"
730 1.1 ragge " address 0x%lx\n", curaddr);
731 1.1 ragge panic("_bus_dmamem_alloc_range");
732 1.1 ragge }
733 1.1 ragge #endif /* DIAGNOSTIC */
734 1.1 ragge #ifdef DEBUG_DMA
735 1.1 ragge printf("alloc: page %lx\n", curaddr);
736 1.1 ragge #endif /* DEBUG_DMA */
737 1.1 ragge if (curaddr == (lastaddr + PAGE_SIZE))
738 1.1 ragge segs[curseg].ds_len += PAGE_SIZE;
739 1.1 ragge else {
740 1.1 ragge curseg++;
741 1.1 ragge segs[curseg].ds_addr = curaddr;
742 1.1 ragge segs[curseg].ds_len = PAGE_SIZE;
743 1.1 ragge }
744 1.1 ragge lastaddr = curaddr;
745 1.1 ragge }
746 1.1 ragge
747 1.1 ragge *rsegs = curseg + 1;
748 1.1 ragge
749 1.1 ragge return (0);
750 1.1 ragge }
751 1.4 ragge
752 1.4 ragge /*
753 1.4 ragge * "generic" DMA struct, nothing special.
754 1.4 ragge */
755 1.4 ragge struct vax_bus_dma_tag vax_bus_dma_tag = {
756 1.4 ragge NULL,
757 1.4 ragge 0,
758 1.4 ragge 0,
759 1.4 ragge 0,
760 1.4 ragge 0,
761 1.4 ragge 0,
762 1.4 ragge _bus_dmamap_create,
763 1.4 ragge _bus_dmamap_destroy,
764 1.4 ragge _bus_dmamap_load,
765 1.4 ragge _bus_dmamap_load_mbuf,
766 1.4 ragge _bus_dmamap_load_uio,
767 1.4 ragge _bus_dmamap_load_raw,
768 1.4 ragge _bus_dmamap_unload,
769 1.4 ragge _bus_dmamap_sync,
770 1.4 ragge _bus_dmamem_alloc,
771 1.4 ragge _bus_dmamem_free,
772 1.4 ragge _bus_dmamem_map,
773 1.4 ragge _bus_dmamem_unmap,
774 1.4 ragge _bus_dmamem_mmap,
775 1.4 ragge };
776