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