bus_dma.c revision 1.23 1 /* $NetBSD: bus_dma.c,v 1.23 2005/04/01 11:59:36 yamt 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.23 2005/04/01 11:59:36 yamt 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 __P((bus_dma_tag_t, bus_dmamap_t, void *,
72 bus_size_t, struct proc *, int, vaddr_t *, int *, int));
73 int _bus_dma_inrange __P((bus_dma_segment_t *, int, bus_addr_t));
74 int _bus_dmamem_alloc_range __P((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(t, size, nsegments, maxsegsz, boundary, flags, dmamp)
82 bus_dma_tag_t t;
83 bus_size_t size;
84 int nsegments;
85 bus_size_t maxsegsz;
86 bus_size_t boundary;
87 int flags;
88 bus_dmamap_t *dmamp;
89 {
90 struct vax_bus_dmamap *map;
91 void *mapstore;
92 size_t mapsize;
93
94 #ifdef DEBUG_DMA
95 printf("dmamap_create: t=%p size=%lx nseg=%x msegsz=%lx boundary=%lx flags=%x\n",
96 t, size, nsegments, maxsegsz, boundary, flags);
97 #endif /* DEBUG_DMA */
98
99 /*
100 * Allocate and initialize the DMA map. The end of the map
101 * is a variable-sized array of segments, so we allocate enough
102 * room for them in one shot.
103 *
104 * Note we don't preserve the WAITOK or NOWAIT flags. Preservation
105 * of ALLOCNOW notifies others that we've reserved these resources,
106 * and they are not to be freed.
107 *
108 * The bus_dmamap_t includes one bus_dma_segment_t, hence
109 * the (nsegments - 1).
110 */
111 mapsize = sizeof(struct vax_bus_dmamap) +
112 (sizeof(bus_dma_segment_t) * (nsegments - 1));
113 if ((mapstore = malloc(mapsize, M_DMAMAP,
114 (flags & BUS_DMA_NOWAIT) ? M_NOWAIT : M_WAITOK)) == NULL)
115 return (ENOMEM);
116
117 bzero(mapstore, mapsize);
118 map = (struct vax_bus_dmamap *)mapstore;
119 map->_dm_size = size;
120 map->_dm_segcnt = nsegments;
121 map->_dm_maxmaxsegsz = maxsegsz;
122 map->_dm_boundary = boundary;
123 map->_dm_flags = flags & ~(BUS_DMA_WAITOK|BUS_DMA_NOWAIT);
124 map->dm_maxsegsz = maxsegsz;
125 map->dm_mapsize = 0; /* no valid mappings */
126 map->dm_nsegs = 0;
127
128 *dmamp = map;
129 #ifdef DEBUG_DMA
130 printf("dmamap_create:map=%p\n", map);
131 #endif /* DEBUG_DMA */
132 return (0);
133 }
134
135 /*
136 * Common function for DMA map destruction. May be called by bus-specific
137 * DMA map destruction functions.
138 */
139 void
140 _bus_dmamap_destroy(t, map)
141 bus_dma_tag_t t;
142 bus_dmamap_t map;
143 {
144
145 #ifdef DEBUG_DMA
146 printf("dmamap_destroy: t=%p map=%p\n", t, map);
147 #endif /* DEBUG_DMA */
148 #ifdef DIAGNOSTIC
149 if (map->dm_nsegs > 0)
150 printf("bus_dmamap_destroy() called for map with valid mappings\n");
151 #endif /* DIAGNOSTIC */
152 free(map, M_DEVBUF);
153 }
154
155 /*
156 * Common function for loading a DMA map with a linear buffer. May
157 * be called by bus-specific DMA map load functions.
158 */
159 int
160 _bus_dmamap_load(t, map, buf, buflen, p, flags)
161 bus_dma_tag_t t;
162 bus_dmamap_t map;
163 void *buf;
164 bus_size_t buflen;
165 struct proc *p;
166 int flags;
167 {
168 vaddr_t lastaddr;
169 int seg, error;
170
171 #ifdef DEBUG_DMA
172 printf("dmamap_load: t=%p map=%p buf=%p len=%lx p=%p f=%d\n",
173 t, map, buf, buflen, p, flags);
174 #endif /* DEBUG_DMA */
175
176 /*
177 * Make sure that on error condition we return "no valid mappings".
178 */
179 map->dm_mapsize = 0;
180 map->dm_nsegs = 0;
181 KASSERT(map->dm_maxsegsz <= map->_dm_maxmaxsegsz);
182
183 if (buflen > map->_dm_size)
184 return (EINVAL);
185
186 seg = 0;
187 error = _bus_dmamap_load_buffer(t, map, buf, buflen, p, flags,
188 &lastaddr, &seg, 1);
189 if (error == 0) {
190 map->dm_mapsize = buflen;
191 map->dm_nsegs = seg + 1;
192 }
193 #ifdef DEBUG_DMA
194 printf("dmamap_load: error=%d\n", error);
195 #endif /* DEBUG_DMA */
196 return (error);
197 }
198
199 /*
200 * Like _bus_dmamap_load(), but for mbufs.
201 */
202 int
203 _bus_dmamap_load_mbuf(t, map, m0, flags)
204 bus_dma_tag_t t;
205 bus_dmamap_t map;
206 struct mbuf *m0;
207 int flags;
208 {
209 vaddr_t lastaddr;
210 int seg, error, first;
211 struct mbuf *m;
212
213 #ifdef DEBUG_DMA
214 printf("dmamap_load_mbuf: t=%p map=%p m0=%p f=%d\n",
215 t, map, m0, flags);
216 #endif /* DEBUG_DMA */
217
218 /*
219 * Make sure that on error condition we return "no valid mappings."
220 */
221 map->dm_mapsize = 0;
222 map->dm_nsegs = 0;
223 KASSERT(map->dm_maxsegsz <= map->_dm_maxmaxsegsz);
224
225 #ifdef DIAGNOSTIC
226 if ((m0->m_flags & M_PKTHDR) == 0)
227 panic("_bus_dmamap_load_mbuf: no packet header");
228 #endif /* DIAGNOSTIC */
229
230 if (m0->m_pkthdr.len > map->_dm_size)
231 return (EINVAL);
232
233 first = 1;
234 seg = 0;
235 error = 0;
236 for (m = m0; m != NULL && error == 0; m = m->m_next) {
237 if (m->m_len == 0)
238 continue;
239 error = _bus_dmamap_load_buffer(t, map, m->m_data, m->m_len,
240 NULL, flags, &lastaddr, &seg, first);
241 first = 0;
242 }
243 if (error == 0) {
244 map->dm_mapsize = m0->m_pkthdr.len;
245 map->dm_nsegs = seg + 1;
246 }
247 #ifdef DEBUG_DMA
248 printf("dmamap_load_mbuf: error=%d\n", error);
249 #endif /* DEBUG_DMA */
250 return (error);
251 }
252
253 /*
254 * Like _bus_dmamap_load(), but for uios.
255 */
256 int
257 _bus_dmamap_load_uio(t, map, uio, flags)
258 bus_dma_tag_t t;
259 bus_dmamap_t map;
260 struct uio *uio;
261 int flags;
262 {
263 vaddr_t lastaddr;
264 int seg, i, error, first;
265 bus_size_t minlen, resid;
266 struct proc *p = NULL;
267 struct iovec *iov;
268 caddr_t addr;
269
270 /*
271 * Make sure that on error condition we return "no valid mappings."
272 */
273 map->dm_mapsize = 0;
274 map->dm_nsegs = 0;
275 KASSERT(map->dm_maxsegsz <= map->_dm_maxmaxsegsz);
276
277 resid = uio->uio_resid;
278 iov = uio->uio_iov;
279
280 if (uio->uio_segflg == UIO_USERSPACE) {
281 p = uio->uio_procp;
282 #ifdef DIAGNOSTIC
283 if (p == NULL)
284 panic("_bus_dmamap_load_uio: USERSPACE but no proc");
285 #endif
286 }
287
288 first = 1;
289 seg = 0;
290 error = 0;
291 for (i = 0; i < uio->uio_iovcnt && resid != 0 && error == 0; i++) {
292 /*
293 * Now at the first iovec to load. Load each iovec
294 * until we have exhausted the residual count.
295 */
296 minlen = resid < iov[i].iov_len ? resid : iov[i].iov_len;
297 addr = (caddr_t)iov[i].iov_base;
298
299 error = _bus_dmamap_load_buffer(t, map, addr, minlen,
300 p, flags, &lastaddr, &seg, first);
301 first = 0;
302
303 resid -= minlen;
304 }
305 if (error == 0) {
306 map->dm_mapsize = uio->uio_resid;
307 map->dm_nsegs = seg + 1;
308 }
309 return (error);
310 }
311
312 /*
313 * Like _bus_dmamap_load(), but for raw memory allocated with
314 * bus_dmamem_alloc().
315 */
316 int
317 _bus_dmamap_load_raw(t, map, segs, nsegs, size, flags)
318 bus_dma_tag_t t;
319 bus_dmamap_t map;
320 bus_dma_segment_t *segs;
321 int nsegs;
322 bus_size_t size;
323 int flags;
324 {
325
326 panic("_bus_dmamap_load_raw: not implemented");
327 }
328
329 /*
330 * Common function for unloading a DMA map. May be called by
331 * bus-specific DMA map unload functions.
332 */
333 void
334 _bus_dmamap_unload(t, map)
335 bus_dma_tag_t t;
336 bus_dmamap_t map;
337 {
338
339 #ifdef DEBUG_DMA
340 printf("dmamap_unload: t=%p map=%p\n", t, map);
341 #endif /* DEBUG_DMA */
342
343 /*
344 * No resources to free; just mark the mappings as
345 * invalid.
346 */
347 map->dm_maxsegsz = map->_dm_maxmaxsegsz;
348 map->dm_mapsize = 0;
349 map->dm_nsegs = 0;
350 }
351
352 /*
353 * Common function for DMA map synchronization. May be called
354 * by bus-specific DMA map synchronization functions.
355 */
356 void
357 _bus_dmamap_sync(t, map, offset, len, ops)
358 bus_dma_tag_t t;
359 bus_dmamap_t map;
360 bus_addr_t offset;
361 bus_size_t len;
362 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(t, size, alignment, boundary, segs, nsegs, rsegs, flags)
381 bus_dma_tag_t t;
382 bus_size_t size, alignment, boundary;
383 bus_dma_segment_t *segs;
384 int nsegs;
385 int *rsegs;
386 int flags;
387 {
388 int error;
389
390 error = (_bus_dmamem_alloc_range(t, size, alignment, boundary,
391 segs, nsegs, rsegs, flags, round_page(avail_start),
392 trunc_page(avail_end)));
393 return(error);
394 }
395
396 /*
397 * Common function for freeing DMA-safe memory. May be called by
398 * bus-specific DMA memory free functions.
399 */
400 void
401 _bus_dmamem_free(t, segs, nsegs)
402 bus_dma_tag_t t;
403 bus_dma_segment_t *segs;
404 int nsegs;
405 {
406 struct vm_page *m;
407 bus_addr_t addr;
408 struct pglist mlist;
409 int curseg;
410
411 #ifdef DEBUG_DMA
412 printf("dmamem_free: t=%p segs=%p nsegs=%x\n", t, segs, nsegs);
413 #endif /* DEBUG_DMA */
414
415 /*
416 * Build a list of pages to free back to the VM system.
417 */
418 TAILQ_INIT(&mlist);
419 for (curseg = 0; curseg < nsegs; curseg++) {
420 for (addr = segs[curseg].ds_addr;
421 addr < (segs[curseg].ds_addr + segs[curseg].ds_len);
422 addr += PAGE_SIZE) {
423 m = PHYS_TO_VM_PAGE(addr);
424 TAILQ_INSERT_TAIL(&mlist, m, pageq);
425 }
426 }
427 uvm_pglistfree(&mlist);
428 }
429
430 /*
431 * Common function for mapping DMA-safe memory. May be called by
432 * bus-specific DMA memory map functions.
433 */
434 int
435 _bus_dmamem_map(t, segs, nsegs, size, kvap, flags)
436 bus_dma_tag_t t;
437 bus_dma_segment_t *segs;
438 int nsegs;
439 size_t size;
440 caddr_t *kvap;
441 int flags;
442 {
443 vaddr_t va;
444 bus_addr_t addr;
445 int curseg;
446
447 /*
448 * Special case (but common):
449 * If there is only one physical segment then the already-mapped
450 * virtual address is returned, since all physical memory is already
451 * in the beginning of kernel virtual memory.
452 */
453 if (nsegs == 1) {
454 *kvap = (caddr_t)(segs[0].ds_addr | KERNBASE);
455 /*
456 * KA43 (3100/m76) must have its DMA-safe memory accessed
457 * through DIAGMEM. Remap it here.
458 */
459 if (vax_boardtype == VAX_BTYP_43) {
460 pmap_map((vaddr_t)*kvap, segs[0].ds_addr|KA43_DIAGMEM,
461 (segs[0].ds_addr|KA43_DIAGMEM) + size,
462 VM_PROT_READ|VM_PROT_WRITE);
463 }
464 return 0;
465 }
466 size = round_page(size);
467 va = uvm_km_alloc(kernel_map, size, 0, UVM_KMF_VAONLY);
468
469 if (va == 0)
470 return (ENOMEM);
471
472 *kvap = (caddr_t)va;
473
474 for (curseg = 0; curseg < nsegs; curseg++) {
475 for (addr = segs[curseg].ds_addr;
476 addr < (segs[curseg].ds_addr + segs[curseg].ds_len);
477 addr += PAGE_SIZE, va += PAGE_SIZE, size -= PAGE_SIZE) {
478 if (size == 0)
479 panic("_bus_dmamem_map: size botch");
480 if (vax_boardtype == VAX_BTYP_43)
481 addr |= KA43_DIAGMEM;
482 pmap_enter(pmap_kernel(), va, addr,
483 VM_PROT_READ | VM_PROT_WRITE,
484 VM_PROT_READ | VM_PROT_WRITE | PMAP_WIRED);
485 }
486 }
487 pmap_update(pmap_kernel());
488 return (0);
489 }
490
491 /*
492 * Common function for unmapping DMA-safe memory. May be called by
493 * bus-specific DMA memory unmapping functions.
494 */
495 void
496 _bus_dmamem_unmap(t, kva, size)
497 bus_dma_tag_t t;
498 caddr_t kva;
499 size_t size;
500 {
501
502 #ifdef DEBUG_DMA
503 printf("dmamem_unmap: t=%p kva=%p size=%x\n", t, kva, size);
504 #endif /* DEBUG_DMA */
505 #ifdef DIAGNOSTIC
506 if ((u_long)kva & PGOFSET)
507 panic("_bus_dmamem_unmap");
508 #endif /* DIAGNOSTIC */
509
510 /* Avoid free'ing if not mapped */
511 if (kva < (caddr_t)virtual_avail)
512 return;
513
514 size = round_page(size);
515 pmap_remove(pmap_kernel(), (vaddr_t)kva, (vaddr_t)kva + size);
516 pmap_update(pmap_kernel());
517 uvm_km_free(kernel_map, (vaddr_t)kva, size, UVM_KMF_VAONLY);
518 }
519
520 /*
521 * Common functin for mmap(2)'ing DMA-safe memory. May be called by
522 * bus-specific DMA mmap(2)'ing functions.
523 */
524 paddr_t
525 _bus_dmamem_mmap(t, segs, nsegs, off, prot, flags)
526 bus_dma_tag_t t;
527 bus_dma_segment_t *segs;
528 int nsegs;
529 off_t off;
530 int prot, flags;
531 {
532 int i;
533
534 for (i = 0; i < nsegs; i++) {
535 #ifdef DIAGNOSTIC
536 if (off & PGOFSET)
537 panic("_bus_dmamem_mmap: offset unaligned");
538 if (segs[i].ds_addr & PGOFSET)
539 panic("_bus_dmamem_mmap: segment unaligned");
540 if (segs[i].ds_len & PGOFSET)
541 panic("_bus_dmamem_mmap: segment size not multiple"
542 " of page size");
543 #endif /* DIAGNOSTIC */
544 if (off >= segs[i].ds_len) {
545 off -= segs[i].ds_len;
546 continue;
547 }
548
549 return (btop((u_long)segs[i].ds_addr + off));
550 }
551
552 /* Page not found. */
553 return (-1);
554 }
555
556 /**********************************************************************
557 * DMA utility functions
558 **********************************************************************/
559
560 /*
561 * Utility function to load a linear buffer. lastaddrp holds state
562 * between invocations (for multiple-buffer loads). segp contains
563 * the starting segment on entrace, and the ending segment on exit.
564 * first indicates if this is the first invocation of this function.
565 */
566 int
567 _bus_dmamap_load_buffer(t, map, buf, buflen, p, flags, lastaddrp, segp, first)
568 bus_dma_tag_t t;
569 bus_dmamap_t map;
570 void *buf;
571 bus_size_t buflen;
572 struct proc *p;
573 int flags;
574 vaddr_t *lastaddrp;
575 int *segp;
576 int first;
577 {
578 bus_size_t sgsize;
579 bus_addr_t curaddr, lastaddr, baddr, bmask;
580 vaddr_t vaddr = (vaddr_t)buf;
581 int seg;
582 pmap_t pmap;
583
584 #ifdef DEBUG_DMA
585 printf("_bus_dmamem_load_buffer(buf=%p, len=%lx, flags=%d, 1st=%d)\n",
586 buf, buflen, flags, first);
587 #endif /* DEBUG_DMA */
588
589 if (p != NULL)
590 pmap = p->p_vmspace->vm_map.pmap;
591 else
592 pmap = pmap_kernel();
593
594 lastaddr = *lastaddrp;
595 bmask = ~(map->_dm_boundary - 1);
596
597 for (seg = *segp; buflen > 0; ) {
598 /*
599 * Get the physical address for this segment.
600 */
601 (void) pmap_extract(pmap, (vaddr_t)vaddr, &curaddr);
602
603 #if 0
604 /*
605 * Make sure we're in an allowed DMA range.
606 */
607 if (t->_ranges != NULL &&
608 _bus_dma_inrange(t->_ranges, t->_nranges, curaddr) == 0)
609 return (EINVAL);
610 #endif
611
612 /*
613 * Compute the segment size, and adjust counts.
614 */
615 sgsize = PAGE_SIZE - ((u_long)vaddr & PGOFSET);
616 if (buflen < sgsize)
617 sgsize = buflen;
618
619 /*
620 * Make sure we don't cross any boundaries.
621 */
622 if (map->_dm_boundary > 0) {
623 baddr = (curaddr + map->_dm_boundary) & bmask;
624 if (sgsize > (baddr - curaddr))
625 sgsize = (baddr - curaddr);
626 }
627
628 /*
629 * Insert chunk into a segment, coalescing with
630 * previous segment if possible.
631 */
632 if (first) {
633 map->dm_segs[seg].ds_addr = curaddr;
634 map->dm_segs[seg].ds_len = sgsize;
635 first = 0;
636 } else {
637 if (curaddr == lastaddr &&
638 (map->dm_segs[seg].ds_len + sgsize) <=
639 map->dm_maxsegsz &&
640 (map->_dm_boundary == 0 ||
641 (map->dm_segs[seg].ds_addr & bmask) ==
642 (curaddr & bmask)))
643 map->dm_segs[seg].ds_len += sgsize;
644 else {
645 if (++seg >= map->_dm_segcnt)
646 break;
647 map->dm_segs[seg].ds_addr = curaddr;
648 map->dm_segs[seg].ds_len = sgsize;
649 }
650 }
651
652 lastaddr = curaddr + sgsize;
653 vaddr += sgsize;
654 buflen -= sgsize;
655 }
656
657 *segp = seg;
658 *lastaddrp = lastaddr;
659
660 /*
661 * Did we fit?
662 */
663 if (buflen != 0)
664 return (EFBIG); /* XXX better return value here? */
665 return (0);
666 }
667
668 /*
669 * Check to see if the specified page is in an allowed DMA range.
670 */
671 int
672 _bus_dma_inrange(ranges, nranges, curaddr)
673 bus_dma_segment_t *ranges;
674 int nranges;
675 bus_addr_t curaddr;
676 {
677 bus_dma_segment_t *ds;
678 int i;
679
680 for (i = 0, ds = ranges; i < nranges; i++, ds++) {
681 if (curaddr >= ds->ds_addr &&
682 round_page(curaddr) <= (ds->ds_addr + ds->ds_len))
683 return (1);
684 }
685
686 return (0);
687 }
688
689 /*
690 * Allocate physical memory from the given physical address range.
691 * Called by DMA-safe memory allocation methods.
692 */
693 int
694 _bus_dmamem_alloc_range(t, size, alignment, boundary, segs, nsegs, rsegs,
695 flags, low, high)
696 bus_dma_tag_t t;
697 bus_size_t size, alignment, boundary;
698 bus_dma_segment_t *segs;
699 int nsegs;
700 int *rsegs;
701 int flags;
702 vaddr_t low;
703 vaddr_t high;
704 {
705 vaddr_t curaddr, lastaddr;
706 struct vm_page *m;
707 struct pglist mlist;
708 int curseg, error;
709
710 #ifdef DEBUG_DMA
711 printf("alloc_range: t=%p size=%lx align=%lx boundary=%lx segs=%p nsegs=%x rsegs=%p flags=%x lo=%lx hi=%lx\n",
712 t, size, alignment, boundary, segs, nsegs, rsegs, flags, low, high);
713 #endif /* DEBUG_DMA */
714
715 /* Always round the size. */
716 size = round_page(size);
717
718 /*
719 * Allocate pages from the VM system.
720 */
721 error = uvm_pglistalloc(size, low, high, alignment, boundary,
722 &mlist, nsegs, (flags & BUS_DMA_NOWAIT) == 0);
723 if (error)
724 return (error);
725
726 /*
727 * Compute the location, size, and number of segments actually
728 * returned by the VM code.
729 */
730 m = mlist.tqh_first;
731 curseg = 0;
732 lastaddr = segs[curseg].ds_addr = VM_PAGE_TO_PHYS(m);
733 segs[curseg].ds_len = PAGE_SIZE;
734 #ifdef DEBUG_DMA
735 printf("alloc: page %lx\n", lastaddr);
736 #endif /* DEBUG_DMA */
737 m = m->pageq.tqe_next;
738
739 for (; m != NULL; m = m->pageq.tqe_next) {
740 curaddr = VM_PAGE_TO_PHYS(m);
741 #ifdef DIAGNOSTIC
742 if (curaddr < low || curaddr >= high) {
743 printf("uvm_pglistalloc returned non-sensical"
744 " address 0x%lx\n", curaddr);
745 panic("_bus_dmamem_alloc_range");
746 }
747 #endif /* DIAGNOSTIC */
748 #ifdef DEBUG_DMA
749 printf("alloc: page %lx\n", curaddr);
750 #endif /* DEBUG_DMA */
751 if (curaddr == (lastaddr + PAGE_SIZE))
752 segs[curseg].ds_len += PAGE_SIZE;
753 else {
754 curseg++;
755 segs[curseg].ds_addr = curaddr;
756 segs[curseg].ds_len = PAGE_SIZE;
757 }
758 lastaddr = curaddr;
759 }
760
761 *rsegs = curseg + 1;
762
763 return (0);
764 }
765
766 /*
767 * "generic" DMA struct, nothing special.
768 */
769 struct vax_bus_dma_tag vax_bus_dma_tag = {
770 NULL,
771 0,
772 0,
773 0,
774 0,
775 0,
776 _bus_dmamap_create,
777 _bus_dmamap_destroy,
778 _bus_dmamap_load,
779 _bus_dmamap_load_mbuf,
780 _bus_dmamap_load_uio,
781 _bus_dmamap_load_raw,
782 _bus_dmamap_unload,
783 _bus_dmamap_sync,
784 _bus_dmamem_alloc,
785 _bus_dmamem_free,
786 _bus_dmamem_map,
787 _bus_dmamem_unmap,
788 _bus_dmamem_mmap,
789 };
790