2 * Copyright (c) 1997, 1998 Justin T. Gibbs.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions, and the following disclaimer,
10 * without modification, immediately at the beginning of the file.
11 * 2. The name of the author may not be used to endorse or promote products
12 * derived from this software without specific prior written permission.
14 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
15 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR
18 * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
19 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
20 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
21 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
22 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
23 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
26 * $FreeBSD: src/sys/i386/i386/busdma_machdep.c,v 1.94 2008/08/15 20:51:31 kmacy Exp $
27 * $DragonFly: src/sys/platform/pc32/i386/busdma_machdep.c,v 1.23 2008/06/05 18:06:32 swildner Exp $
30 #include <sys/param.h>
31 #include <sys/systm.h>
32 #include <sys/malloc.h>
35 #include <sys/bus_dma.h>
36 #include <sys/kernel.h>
37 #include <sys/sysctl.h>
40 #include <sys/thread2.h>
41 #include <sys/spinlock2.h>
42 #include <sys/mplock2.h>
45 #include <vm/vm_page.h>
47 /* XXX needed for to access pmap to convert per-proc virtual to physical */
50 #include <vm/vm_map.h>
52 #include <machine/md_var.h>
54 #define MAX_BPAGES 1024
57 * 16 x N declared on stack.
59 #define BUS_DMA_CACHE_SEGMENTS 8
70 bus_dma_filter_t *filter;
78 bus_dma_segment_t *segments;
79 struct bounce_zone *bounce_zone;
88 * bus_dma_tag private flags
90 #define BUS_DMA_BOUNCE_ALIGN BUS_DMA_BUS2
91 #define BUS_DMA_BOUNCE_LOWADDR BUS_DMA_BUS3
92 #define BUS_DMA_MIN_ALLOC_COMP BUS_DMA_BUS4
94 #define BUS_DMA_COULD_BOUNCE (BUS_DMA_BOUNCE_LOWADDR | BUS_DMA_BOUNCE_ALIGN)
96 #define BUS_DMAMEM_KMALLOC(dmat) \
97 ((dmat)->maxsize <= PAGE_SIZE && \
98 (dmat)->alignment <= PAGE_SIZE && \
99 (dmat)->lowaddr >= ptoa(Maxmem))
102 vm_offset_t vaddr; /* kva of bounce buffer */
103 bus_addr_t busaddr; /* Physical address */
104 vm_offset_t datavaddr; /* kva of client data */
105 bus_size_t datacount; /* client data count */
106 STAILQ_ENTRY(bounce_page) links;
110 STAILQ_ENTRY(bounce_zone) links;
111 STAILQ_HEAD(bp_list, bounce_page) bounce_page_list;
112 STAILQ_HEAD(, bus_dmamap) bounce_map_waitinglist;
114 struct spinlock spin;
125 bus_size_t alignment;
129 struct sysctl_ctx_list sysctl_ctx;
130 struct sysctl_oid *sysctl_tree;
134 #define BZ_LOCK(bz) spin_lock(&(bz)->spin)
135 #define BZ_UNLOCK(bz) spin_unlock(&(bz)->spin)
137 #define BZ_LOCK(bz) crit_enter()
138 #define BZ_UNLOCK(bz) crit_exit()
141 static struct lwkt_token bounce_zone_tok =
142 LWKT_TOKEN_MP_INITIALIZER(bounce_zone_tok);
143 static int busdma_zonecount;
144 static STAILQ_HEAD(, bounce_zone) bounce_zone_list =
145 STAILQ_HEAD_INITIALIZER(bounce_zone_list);
147 static int busdma_priv_zonecount = -1;
149 int busdma_swi_pending;
150 static int total_bounce_pages;
151 static int max_bounce_pages = MAX_BPAGES;
152 static int bounce_alignment = 1; /* XXX temporary */
154 TUNABLE_INT("hw.busdma.max_bpages", &max_bounce_pages);
155 TUNABLE_INT("hw.busdma.bounce_alignment", &bounce_alignment);
158 struct bp_list bpages;
162 void *buf; /* unmapped buffer pointer */
163 bus_size_t buflen; /* unmapped buffer length */
164 bus_dmamap_callback_t *callback;
166 STAILQ_ENTRY(bus_dmamap) links;
169 static STAILQ_HEAD(, bus_dmamap) bounce_map_callbacklist =
170 STAILQ_HEAD_INITIALIZER(bounce_map_callbacklist);
171 static struct spinlock bounce_map_list_spin =
172 SPINLOCK_INITIALIZER(&bounce_map_list_spin);
174 static struct bus_dmamap nobounce_dmamap;
176 static int alloc_bounce_zone(bus_dma_tag_t);
177 static int alloc_bounce_pages(bus_dma_tag_t, u_int, int);
178 static void free_bounce_pages_all(bus_dma_tag_t);
179 static void free_bounce_zone(bus_dma_tag_t);
180 static int reserve_bounce_pages(bus_dma_tag_t, bus_dmamap_t, int);
181 static void return_bounce_pages(bus_dma_tag_t, bus_dmamap_t);
182 static bus_addr_t add_bounce_page(bus_dma_tag_t, bus_dmamap_t,
183 vm_offset_t, bus_size_t);
184 static void free_bounce_page(bus_dma_tag_t, struct bounce_page *);
186 static bus_dmamap_t get_map_waiting(bus_dma_tag_t);
187 static void add_map_callback(bus_dmamap_t);
189 SYSCTL_NODE(_hw, OID_AUTO, busdma, CTLFLAG_RD, 0, "Busdma parameters");
190 SYSCTL_INT(_hw_busdma, OID_AUTO, total_bpages, CTLFLAG_RD, &total_bounce_pages,
191 0, "Total bounce pages");
192 SYSCTL_INT(_hw_busdma, OID_AUTO, max_bpages, CTLFLAG_RD, &max_bounce_pages,
193 0, "Max bounce pages per bounce zone");
194 SYSCTL_INT(_hw_busdma, OID_AUTO, bounce_alignment, CTLFLAG_RD,
195 &bounce_alignment, 0, "Obey alignment constraint");
198 run_filter(bus_dma_tag_t dmat, bus_addr_t paddr)
204 if (((paddr > dmat->lowaddr && paddr <= dmat->highaddr) ||
205 (bounce_alignment && (paddr & (dmat->alignment - 1)) != 0))
206 && (dmat->filter == NULL ||
207 dmat->filter(dmat->filterarg, paddr) != 0))
211 } while (retval == 0 && dmat != NULL);
217 bus_dma_tag_lock(bus_dma_tag_t tag, bus_dma_segment_t *cache)
219 if (tag->flags & BUS_DMA_PROTECTED)
220 return(tag->segments);
222 if (tag->nsegments <= BUS_DMA_CACHE_SEGMENTS)
225 spin_lock(&tag->spin);
227 return(tag->segments);
232 bus_dma_tag_unlock(bus_dma_tag_t tag)
235 if (tag->flags & BUS_DMA_PROTECTED)
238 if (tag->nsegments > BUS_DMA_CACHE_SEGMENTS)
239 spin_unlock(&tag->spin);
244 * Allocate a device specific dma_tag.
247 bus_dma_tag_create(bus_dma_tag_t parent, bus_size_t alignment,
248 bus_size_t boundary, bus_addr_t lowaddr,
249 bus_addr_t highaddr, bus_dma_filter_t *filter,
250 void *filterarg, bus_size_t maxsize, int nsegments,
251 bus_size_t maxsegsz, int flags, bus_dma_tag_t *dmat)
253 bus_dma_tag_t newtag;
262 if (alignment & (alignment - 1))
263 panic("alignment must be power of 2\n");
266 if (boundary & (boundary - 1))
267 panic("boundary must be power of 2\n");
268 if (boundary < maxsegsz) {
269 kprintf("boundary < maxsegsz:\n");
275 /* Return a NULL tag on failure */
278 newtag = kmalloc(sizeof(*newtag), M_DEVBUF, M_INTWAIT | M_ZERO);
281 spin_init(&newtag->spin);
283 newtag->parent = parent;
284 newtag->alignment = alignment;
285 newtag->boundary = boundary;
286 newtag->lowaddr = trunc_page((vm_paddr_t)lowaddr) + (PAGE_SIZE - 1);
287 newtag->highaddr = trunc_page((vm_paddr_t)highaddr) + (PAGE_SIZE - 1);
288 newtag->filter = filter;
289 newtag->filterarg = filterarg;
290 newtag->maxsize = maxsize;
291 newtag->nsegments = nsegments;
292 newtag->maxsegsz = maxsegsz;
293 newtag->flags = flags;
294 newtag->ref_count = 1; /* Count ourself */
295 newtag->map_count = 0;
296 newtag->segments = NULL;
297 newtag->bounce_zone = NULL;
299 /* Take into account any restrictions imposed by our parent tag */
300 if (parent != NULL) {
301 newtag->lowaddr = MIN(parent->lowaddr, newtag->lowaddr);
302 newtag->highaddr = MAX(parent->highaddr, newtag->highaddr);
304 if (newtag->boundary == 0) {
305 newtag->boundary = parent->boundary;
306 } else if (parent->boundary != 0) {
307 newtag->boundary = MIN(parent->boundary,
312 newtag->alignment = MAX(parent->alignment, newtag->alignment);
315 if (newtag->filter == NULL) {
317 * Short circuit looking at our parent directly
318 * since we have encapsulated all of its information
320 newtag->filter = parent->filter;
321 newtag->filterarg = parent->filterarg;
322 newtag->parent = parent->parent;
324 if (newtag->parent != NULL)
328 if (newtag->lowaddr < ptoa(Maxmem))
329 newtag->flags |= BUS_DMA_BOUNCE_LOWADDR;
330 if (bounce_alignment && newtag->alignment > 1 &&
331 !(newtag->flags & BUS_DMA_ALIGNED))
332 newtag->flags |= BUS_DMA_BOUNCE_ALIGN;
334 if ((newtag->flags & BUS_DMA_COULD_BOUNCE) &&
335 (flags & BUS_DMA_ALLOCNOW) != 0) {
336 struct bounce_zone *bz;
340 error = alloc_bounce_zone(newtag);
343 bz = newtag->bounce_zone;
345 if ((newtag->flags & BUS_DMA_ALLOCALL) == 0 &&
346 ptoa(bz->total_bpages) < maxsize) {
349 if (flags & BUS_DMA_ONEBPAGE) {
352 pages = atop(round_page(maxsize)) -
354 pages = MAX(pages, 1);
357 /* Add pages to our bounce pool */
358 if (alloc_bounce_pages(newtag, pages, flags) < pages)
361 /* Performed initial allocation */
362 newtag->flags |= BUS_DMA_MIN_ALLOC_COMP;
367 free_bounce_zone(newtag);
368 kfree(newtag, M_DEVBUF);
376 bus_dma_tag_destroy(bus_dma_tag_t dmat)
379 if (dmat->map_count != 0)
382 while (dmat != NULL) {
383 bus_dma_tag_t parent;
385 parent = dmat->parent;
387 if (dmat->ref_count == 0) {
388 free_bounce_zone(dmat);
389 if (dmat->segments != NULL)
390 kfree(dmat->segments, M_DEVBUF);
391 kfree(dmat, M_DEVBUF);
393 * Last reference count, so
394 * release our reference
395 * count on our parent.
406 bus_dma_tag_getmaxsize(bus_dma_tag_t tag)
408 return(tag->maxsize);
412 * Allocate a handle for mapping from kva/uva/physical
413 * address space into bus device space.
416 bus_dmamap_create(bus_dma_tag_t dmat, int flags, bus_dmamap_t *mapp)
422 if (dmat->segments == NULL) {
423 KKASSERT(dmat->nsegments && dmat->nsegments < 16384);
424 dmat->segments = kmalloc(sizeof(bus_dma_segment_t) *
425 dmat->nsegments, M_DEVBUF, M_INTWAIT);
428 if (dmat->flags & BUS_DMA_COULD_BOUNCE) {
429 struct bounce_zone *bz;
434 if (dmat->bounce_zone == NULL) {
435 error = alloc_bounce_zone(dmat);
439 bz = dmat->bounce_zone;
441 *mapp = kmalloc(sizeof(**mapp), M_DEVBUF, M_INTWAIT | M_ZERO);
443 /* Initialize the new map */
444 STAILQ_INIT(&((*mapp)->bpages));
447 * Attempt to add pages to our pool on a per-instance
448 * basis up to a sane limit.
450 if (dmat->flags & BUS_DMA_ALLOCALL) {
451 maxpages = Maxmem - atop(dmat->lowaddr);
452 } else if (dmat->flags & BUS_DMA_BOUNCE_ALIGN) {
453 maxpages = max_bounce_pages;
455 maxpages = MIN(max_bounce_pages,
456 Maxmem - atop(dmat->lowaddr));
458 if ((dmat->flags & BUS_DMA_MIN_ALLOC_COMP) == 0 ||
459 (dmat->map_count > 0 && bz->total_bpages < maxpages)) {
462 if (flags & BUS_DMA_ONEBPAGE) {
465 pages = atop(round_page(dmat->maxsize));
466 pages = MIN(maxpages - bz->total_bpages, pages);
467 pages = MAX(pages, 1);
469 if (alloc_bounce_pages(dmat, pages, flags) < pages)
472 if ((dmat->flags & BUS_DMA_MIN_ALLOC_COMP) == 0) {
474 (dmat->flags & BUS_DMA_ALLOCALL) == 0)
475 dmat->flags |= BUS_DMA_MIN_ALLOC_COMP;
489 * Destroy a handle for mapping from kva/uva/physical
490 * address space into bus device space.
493 bus_dmamap_destroy(bus_dma_tag_t dmat, bus_dmamap_t map)
496 if (STAILQ_FIRST(&map->bpages) != NULL)
498 kfree(map, M_DEVBUF);
504 static __inline bus_size_t
505 check_kmalloc(bus_dma_tag_t dmat, const void *vaddr0, int verify)
507 bus_size_t maxsize = 0;
508 uintptr_t vaddr = (uintptr_t)vaddr0;
510 if ((vaddr ^ (vaddr + dmat->maxsize - 1)) & ~PAGE_MASK) {
511 if (verify || bootverbose)
512 kprintf("boundary check failed\n");
514 print_backtrace(-1); /* XXX panic */
515 maxsize = dmat->maxsize;
517 if (vaddr & (dmat->alignment - 1)) {
518 if (verify || bootverbose)
519 kprintf("alignment check failed\n");
521 print_backtrace(-1); /* XXX panic */
522 if (dmat->maxsize < dmat->alignment)
523 maxsize = dmat->alignment;
525 maxsize = dmat->maxsize;
531 * Allocate a piece of memory that can be efficiently mapped into
532 * bus device space based on the constraints lited in the dma tag.
534 * mapp is degenerate. By definition this allocation should not require
535 * bounce buffers so do not allocate a dma map.
538 bus_dmamem_alloc(bus_dma_tag_t dmat, void **vaddr, int flags,
543 /* If we succeed, no mapping/bouncing will be required */
546 if (dmat->segments == NULL) {
547 KKASSERT(dmat->nsegments < 16384);
548 dmat->segments = kmalloc(sizeof(bus_dma_segment_t) *
549 dmat->nsegments, M_DEVBUF, M_INTWAIT);
552 if (flags & BUS_DMA_NOWAIT)
556 if (flags & BUS_DMA_ZERO)
559 if (BUS_DMAMEM_KMALLOC(dmat)) {
562 *vaddr = kmalloc(dmat->maxsize, M_DEVBUF, mflags);
566 * Check whether the allocation
567 * - crossed a page boundary
569 * Retry with power-of-2 alignment in the above cases.
571 maxsize = check_kmalloc(dmat, *vaddr, 0);
575 kfree(*vaddr, M_DEVBUF);
576 /* XXX check for overflow? */
577 for (size = 1; size <= maxsize; size <<= 1)
579 *vaddr = kmalloc(size, M_DEVBUF, mflags);
580 check_kmalloc(dmat, *vaddr, 1);
584 * XXX Use Contigmalloc until it is merged into this facility
585 * and handles multi-seg allocations. Nobody is doing
586 * multi-seg allocations yet though.
588 *vaddr = contigmalloc(dmat->maxsize, M_DEVBUF, mflags,
589 0ul, dmat->lowaddr, dmat->alignment, dmat->boundary);
597 * Free a piece of memory and it's allociated dmamap, that was allocated
598 * via bus_dmamem_alloc. Make the same choice for free/contigfree.
601 bus_dmamem_free(bus_dma_tag_t dmat, void *vaddr, bus_dmamap_t map)
604 * dmamem does not need to be bounced, so the map should be
608 panic("bus_dmamem_free: Invalid map freed\n");
609 if (BUS_DMAMEM_KMALLOC(dmat))
610 kfree(vaddr, M_DEVBUF);
612 contigfree(vaddr, dmat->maxsize, M_DEVBUF);
615 static __inline vm_paddr_t
616 _bus_dma_extract(pmap_t pmap, vm_offset_t vaddr)
619 return pmap_extract(pmap, vaddr);
621 return pmap_kextract(vaddr);
625 * Utility function to load a linear buffer. lastaddrp holds state
626 * between invocations (for multiple-buffer loads). segp contains
627 * the segment following the starting one on entrace, and the ending
628 * segment on exit. first indicates if this is the first invocation
632 _bus_dmamap_load_buffer(bus_dma_tag_t dmat,
634 void *buf, bus_size_t buflen,
635 bus_dma_segment_t *segments,
639 vm_paddr_t *lastpaddrp,
644 vm_paddr_t paddr, nextpaddr;
645 bus_dma_segment_t *sg;
650 map = &nobounce_dmamap;
653 if (dmat->flags & BUS_DMA_ALIGNED)
654 KKASSERT(((uintptr_t)buf & (dmat->alignment - 1)) == 0);
658 * If we are being called during a callback, pagesneeded will
659 * be non-zero, so we can avoid doing the work twice.
661 if ((dmat->flags & BUS_DMA_COULD_BOUNCE) &&
662 map != &nobounce_dmamap && map->pagesneeded == 0) {
663 vm_offset_t vendaddr;
666 * Count the number of bounce pages
667 * needed in order to complete this transfer
669 vaddr = (vm_offset_t)buf;
670 vendaddr = (vm_offset_t)buf + buflen;
672 while (vaddr < vendaddr) {
673 paddr = _bus_dma_extract(pmap, vaddr);
674 if (run_filter(dmat, paddr) != 0)
676 vaddr += (PAGE_SIZE - ((vm_offset_t)vaddr & PAGE_MASK));
680 /* Reserve Necessary Bounce Pages */
681 if (map->pagesneeded != 0) {
682 struct bounce_zone *bz;
684 bz = dmat->bounce_zone;
686 if (flags & BUS_DMA_NOWAIT) {
687 if (reserve_bounce_pages(dmat, map, 0) != 0) {
693 if (reserve_bounce_pages(dmat, map, 1) != 0) {
694 /* Queue us for resources */
697 map->buflen = buflen;
700 &dmat->bounce_zone->bounce_map_waitinglist,
704 return (EINPROGRESS);
710 KKASSERT(*segp >= 1 && *segp <= nsegments);
712 sg = &segments[seg - 1];
714 vaddr = (vm_offset_t)buf;
715 nextpaddr = *lastpaddrp;
716 bmask = ~(dmat->boundary - 1); /* note: will be 0 if boundary is 0 */
718 /* force at least one segment */
725 paddr = _bus_dma_extract(pmap, vaddr);
726 size = PAGE_SIZE - (paddr & PAGE_MASK);
729 if (map->pagesneeded != 0 && run_filter(dmat, paddr)) {
731 * note: this paddr has the same in-page offset
732 * as vaddr and thus the paddr above, so the
733 * size does not have to be recalculated
735 paddr = add_bounce_page(dmat, map, vaddr, size);
739 * Fill in the bus_dma_segment
745 } else if (paddr == nextpaddr) {
755 nextpaddr = paddr + size;
758 * Handle maxsegsz and boundary issues with a nested loop
764 * Limit to the boundary and maximum segment size
766 if (((nextpaddr - 1) ^ sg->ds_addr) & bmask) {
767 tmpsize = dmat->boundary -
768 (sg->ds_addr & ~bmask);
769 if (tmpsize > dmat->maxsegsz)
770 tmpsize = dmat->maxsegsz;
771 KKASSERT(tmpsize < sg->ds_len);
772 } else if (sg->ds_len > dmat->maxsegsz) {
773 tmpsize = dmat->maxsegsz;
779 * Futz, split the data into a new segment.
781 if (seg >= nsegments)
783 sg[1].ds_len = sg[0].ds_len - tmpsize;
784 sg[1].ds_addr = sg[0].ds_addr + tmpsize;
785 sg[0].ds_len = tmpsize;
795 } while (buflen > 0);
801 *lastpaddrp = nextpaddr;
804 if (error && (dmat->flags & BUS_DMA_COULD_BOUNCE) &&
805 map != &nobounce_dmamap) {
806 _bus_dmamap_unload(dmat, map);
807 return_bounce_pages(dmat, map);
813 * Map the buffer buf into bus space using the dmamap map.
816 bus_dmamap_load(bus_dma_tag_t dmat, bus_dmamap_t map, void *buf,
817 bus_size_t buflen, bus_dmamap_callback_t *callback,
818 void *callback_arg, int flags)
820 bus_dma_segment_t cache_segments[BUS_DMA_CACHE_SEGMENTS];
821 bus_dma_segment_t *segments;
822 vm_paddr_t lastaddr = 0;
823 int error, nsegs = 1;
828 * Follow old semantics. Once all of the callers are fixed,
829 * we should get rid of these internal flag "adjustment".
831 flags &= ~BUS_DMA_NOWAIT;
832 flags |= BUS_DMA_WAITOK;
834 map->callback = callback;
835 map->callback_arg = callback_arg;
838 segments = bus_dma_tag_lock(dmat, cache_segments);
839 error = _bus_dmamap_load_buffer(dmat, map, buf, buflen,
840 segments, dmat->nsegments,
841 NULL, flags, &lastaddr, &nsegs, 1);
842 if (error == EINPROGRESS) {
843 KKASSERT((dmat->flags &
844 (BUS_DMA_PRIVBZONE | BUS_DMA_ALLOCALL)) !=
845 (BUS_DMA_PRIVBZONE | BUS_DMA_ALLOCALL));
847 if (dmat->flags & BUS_DMA_PROTECTED)
848 panic("protected dmamap callback will be defered\n");
850 bus_dma_tag_unlock(dmat);
853 callback(callback_arg, segments, nsegs, error);
854 bus_dma_tag_unlock(dmat);
859 * Like _bus_dmamap_load(), but for mbufs.
862 bus_dmamap_load_mbuf(bus_dma_tag_t dmat, bus_dmamap_t map,
864 bus_dmamap_callback2_t *callback, void *callback_arg,
867 bus_dma_segment_t cache_segments[BUS_DMA_CACHE_SEGMENTS];
868 bus_dma_segment_t *segments;
873 * Follow old semantics. Once all of the callers are fixed,
874 * we should get rid of these internal flag "adjustment".
876 flags &= ~BUS_DMA_WAITOK;
877 flags |= BUS_DMA_NOWAIT;
879 segments = bus_dma_tag_lock(dmat, cache_segments);
880 error = bus_dmamap_load_mbuf_segment(dmat, map, m0,
881 segments, dmat->nsegments, &nsegs, flags);
883 /* force "no valid mappings" in callback */
884 callback(callback_arg, segments, 0,
887 callback(callback_arg, segments, nsegs,
888 m0->m_pkthdr.len, error);
890 bus_dma_tag_unlock(dmat);
895 bus_dmamap_load_mbuf_segment(bus_dma_tag_t dmat, bus_dmamap_t map,
897 bus_dma_segment_t *segs, int maxsegs,
898 int *nsegs, int flags)
904 KASSERT(maxsegs >= 1, ("invalid maxsegs %d\n", maxsegs));
905 KASSERT(maxsegs <= dmat->nsegments,
906 ("%d too many segments, dmat only support %d segments\n",
907 maxsegs, dmat->nsegments));
908 KASSERT(flags & BUS_DMA_NOWAIT,
909 ("only BUS_DMA_NOWAIT is supported\n"));
911 if (m0->m_pkthdr.len <= dmat->maxsize) {
913 vm_paddr_t lastaddr = 0;
918 for (m = m0; m != NULL && error == 0; m = m->m_next) {
922 error = _bus_dmamap_load_buffer(dmat, map,
925 NULL, flags, &lastaddr,
927 if (error == ENOMEM && !first) {
929 * Out of bounce pages due to too many
930 * fragments in the mbuf chain; return
939 KKASSERT(*nsegs <= maxsegs && *nsegs >= 1);
945 KKASSERT(error != EINPROGRESS);
950 * Like _bus_dmamap_load(), but for uios.
953 bus_dmamap_load_uio(bus_dma_tag_t dmat, bus_dmamap_t map,
955 bus_dmamap_callback2_t *callback, void *callback_arg,
959 int nsegs, error, first, i;
963 bus_dma_segment_t cache_segments[BUS_DMA_CACHE_SEGMENTS];
964 bus_dma_segment_t *segments;
965 bus_dma_segment_t *segs;
968 if (dmat->nsegments <= BUS_DMA_CACHE_SEGMENTS)
969 segments = cache_segments;
971 segments = kmalloc(sizeof(bus_dma_segment_t) * dmat->nsegments,
972 M_DEVBUF, M_WAITOK | M_ZERO);
976 * Follow old semantics. Once all of the callers are fixed,
977 * we should get rid of these internal flag "adjustment".
979 flags &= ~BUS_DMA_WAITOK;
980 flags |= BUS_DMA_NOWAIT;
982 resid = (bus_size_t)uio->uio_resid;
986 nsegs_left = dmat->nsegments;
988 if (uio->uio_segflg == UIO_USERSPACE) {
992 KASSERT(td != NULL && td->td_proc != NULL,
993 ("bus_dmamap_load_uio: USERSPACE but no proc"));
994 pmap = vmspace_pmap(td->td_proc->p_vmspace);
1003 for (i = 0; i < uio->uio_iovcnt && resid != 0 && !error; i++) {
1005 * Now at the first iovec to load. Load each iovec
1006 * until we have exhausted the residual count.
1009 resid < iov[i].iov_len ? resid : iov[i].iov_len;
1010 caddr_t addr = (caddr_t) iov[i].iov_base;
1012 error = _bus_dmamap_load_buffer(dmat, map, addr, minlen,
1014 pmap, flags, &lastaddr, &nsegs, first);
1019 nsegs_left -= nsegs;
1025 * Minimum one DMA segment, even if 0-length buffer.
1027 if (nsegs_left == dmat->nsegments)
1031 /* force "no valid mappings" in callback */
1032 callback(callback_arg, segments, 0,
1035 callback(callback_arg, segments, dmat->nsegments - nsegs_left,
1036 (bus_size_t)uio->uio_resid, error);
1038 if (dmat->nsegments > BUS_DMA_CACHE_SEGMENTS)
1039 kfree(segments, M_DEVBUF);
1044 * Release the mapping held by map.
1047 _bus_dmamap_unload(bus_dma_tag_t dmat, bus_dmamap_t map)
1049 struct bounce_page *bpage;
1051 while ((bpage = STAILQ_FIRST(&map->bpages)) != NULL) {
1052 STAILQ_REMOVE_HEAD(&map->bpages, links);
1053 free_bounce_page(dmat, bpage);
1058 _bus_dmamap_sync(bus_dma_tag_t dmat, bus_dmamap_t map, bus_dmasync_op_t op)
1060 struct bounce_page *bpage;
1062 if ((bpage = STAILQ_FIRST(&map->bpages)) != NULL) {
1064 * Handle data bouncing. We might also
1065 * want to add support for invalidating
1066 * the caches on broken hardware
1069 case BUS_DMASYNC_PREWRITE:
1070 while (bpage != NULL) {
1071 bcopy((void *)bpage->datavaddr,
1072 (void *)bpage->vaddr,
1074 bpage = STAILQ_NEXT(bpage, links);
1076 dmat->bounce_zone->total_bounced++;
1079 case BUS_DMASYNC_POSTREAD:
1080 while (bpage != NULL) {
1081 bcopy((void *)bpage->vaddr,
1082 (void *)bpage->datavaddr,
1084 bpage = STAILQ_NEXT(bpage, links);
1086 dmat->bounce_zone->total_bounced++;
1089 case BUS_DMASYNC_PREREAD:
1090 case BUS_DMASYNC_POSTWRITE:
1098 alloc_bounce_zone(bus_dma_tag_t dmat)
1100 struct bounce_zone *bz, *new_bz;
1102 KASSERT(dmat->bounce_zone == NULL,
1103 ("bounce zone was already assigned\n"));
1105 new_bz = kmalloc(sizeof(*new_bz), M_DEVBUF, M_INTWAIT | M_ZERO);
1107 lwkt_gettoken(&bounce_zone_tok);
1109 if ((dmat->flags & BUS_DMA_PRIVBZONE) == 0) {
1111 * For shared bounce zone, check to see
1112 * if we already have a suitable zone
1114 STAILQ_FOREACH(bz, &bounce_zone_list, links) {
1115 if (dmat->alignment <= bz->alignment &&
1116 dmat->lowaddr >= bz->lowaddr) {
1117 lwkt_reltoken(&bounce_zone_tok);
1119 dmat->bounce_zone = bz;
1120 kfree(new_bz, M_DEVBUF);
1128 spin_init(&bz->spin);
1130 STAILQ_INIT(&bz->bounce_page_list);
1131 STAILQ_INIT(&bz->bounce_map_waitinglist);
1132 bz->free_bpages = 0;
1133 bz->reserved_bpages = 0;
1134 bz->active_bpages = 0;
1135 bz->lowaddr = dmat->lowaddr;
1136 bz->alignment = round_page(dmat->alignment);
1137 ksnprintf(bz->lowaddrid, 18, "%#jx", (uintmax_t)bz->lowaddr);
1139 if ((dmat->flags & BUS_DMA_PRIVBZONE) == 0) {
1140 ksnprintf(bz->zoneid, 8, "zone%d", busdma_zonecount);
1142 STAILQ_INSERT_TAIL(&bounce_zone_list, bz, links);
1144 ksnprintf(bz->zoneid, 8, "zone%d", busdma_priv_zonecount);
1145 busdma_priv_zonecount--;
1148 lwkt_reltoken(&bounce_zone_tok);
1150 dmat->bounce_zone = bz;
1152 sysctl_ctx_init(&bz->sysctl_ctx);
1153 bz->sysctl_tree = SYSCTL_ADD_NODE(&bz->sysctl_ctx,
1154 SYSCTL_STATIC_CHILDREN(_hw_busdma), OID_AUTO, bz->zoneid,
1156 if (bz->sysctl_tree == NULL) {
1157 sysctl_ctx_free(&bz->sysctl_ctx);
1158 return 0; /* XXX error code? */
1161 SYSCTL_ADD_INT(&bz->sysctl_ctx,
1162 SYSCTL_CHILDREN(bz->sysctl_tree), OID_AUTO,
1163 "total_bpages", CTLFLAG_RD, &bz->total_bpages, 0,
1164 "Total bounce pages");
1165 SYSCTL_ADD_INT(&bz->sysctl_ctx,
1166 SYSCTL_CHILDREN(bz->sysctl_tree), OID_AUTO,
1167 "free_bpages", CTLFLAG_RD, &bz->free_bpages, 0,
1168 "Free bounce pages");
1169 SYSCTL_ADD_INT(&bz->sysctl_ctx,
1170 SYSCTL_CHILDREN(bz->sysctl_tree), OID_AUTO,
1171 "reserved_bpages", CTLFLAG_RD, &bz->reserved_bpages, 0,
1172 "Reserved bounce pages");
1173 SYSCTL_ADD_INT(&bz->sysctl_ctx,
1174 SYSCTL_CHILDREN(bz->sysctl_tree), OID_AUTO,
1175 "active_bpages", CTLFLAG_RD, &bz->active_bpages, 0,
1176 "Active bounce pages");
1177 SYSCTL_ADD_INT(&bz->sysctl_ctx,
1178 SYSCTL_CHILDREN(bz->sysctl_tree), OID_AUTO,
1179 "total_bounced", CTLFLAG_RD, &bz->total_bounced, 0,
1180 "Total bounce requests");
1181 SYSCTL_ADD_INT(&bz->sysctl_ctx,
1182 SYSCTL_CHILDREN(bz->sysctl_tree), OID_AUTO,
1183 "total_deferred", CTLFLAG_RD, &bz->total_deferred, 0,
1184 "Total bounce requests that were deferred");
1185 SYSCTL_ADD_INT(&bz->sysctl_ctx,
1186 SYSCTL_CHILDREN(bz->sysctl_tree), OID_AUTO,
1187 "reserve_failed", CTLFLAG_RD, &bz->reserve_failed, 0,
1188 "Total bounce page reservations that were failed");
1189 SYSCTL_ADD_STRING(&bz->sysctl_ctx,
1190 SYSCTL_CHILDREN(bz->sysctl_tree), OID_AUTO,
1191 "lowaddr", CTLFLAG_RD, bz->lowaddrid, 0, "");
1192 SYSCTL_ADD_INT(&bz->sysctl_ctx,
1193 SYSCTL_CHILDREN(bz->sysctl_tree), OID_AUTO,
1194 "alignment", CTLFLAG_RD, &bz->alignment, 0, "");
1200 alloc_bounce_pages(bus_dma_tag_t dmat, u_int numpages, int flags)
1202 struct bounce_zone *bz = dmat->bounce_zone;
1203 int count = 0, mflags;
1205 if (flags & BUS_DMA_NOWAIT)
1210 while (numpages > 0) {
1211 struct bounce_page *bpage;
1213 bpage = kmalloc(sizeof(*bpage), M_DEVBUF, M_INTWAIT | M_ZERO);
1215 bpage->vaddr = (vm_offset_t)contigmalloc(PAGE_SIZE, M_DEVBUF,
1219 if (bpage->vaddr == 0) {
1220 kfree(bpage, M_DEVBUF);
1223 bpage->busaddr = pmap_kextract(bpage->vaddr);
1226 STAILQ_INSERT_TAIL(&bz->bounce_page_list, bpage, links);
1227 total_bounce_pages++;
1239 free_bounce_pages_all(bus_dma_tag_t dmat)
1241 struct bounce_zone *bz = dmat->bounce_zone;
1242 struct bounce_page *bpage;
1246 while ((bpage = STAILQ_FIRST(&bz->bounce_page_list)) != NULL) {
1247 STAILQ_REMOVE_HEAD(&bz->bounce_page_list, links);
1249 KKASSERT(total_bounce_pages > 0);
1250 total_bounce_pages--;
1252 KKASSERT(bz->total_bpages > 0);
1255 KKASSERT(bz->free_bpages > 0);
1258 contigfree((void *)bpage->vaddr, PAGE_SIZE, M_DEVBUF);
1259 kfree(bpage, M_DEVBUF);
1261 if (bz->total_bpages) {
1262 kprintf("#%d bounce pages are still in use\n",
1264 print_backtrace(-1);
1271 free_bounce_zone(bus_dma_tag_t dmat)
1273 struct bounce_zone *bz = dmat->bounce_zone;
1278 if ((dmat->flags & BUS_DMA_PRIVBZONE) == 0)
1281 free_bounce_pages_all(dmat);
1282 dmat->bounce_zone = NULL;
1284 if (bz->sysctl_tree != NULL)
1285 sysctl_ctx_free(&bz->sysctl_ctx);
1286 kfree(bz, M_DEVBUF);
1289 /* Assume caller holds bounce zone spinlock */
1291 reserve_bounce_pages(bus_dma_tag_t dmat, bus_dmamap_t map, int commit)
1293 struct bounce_zone *bz = dmat->bounce_zone;
1296 pages = MIN(bz->free_bpages, map->pagesneeded - map->pagesreserved);
1297 if (!commit && map->pagesneeded > (map->pagesreserved + pages)) {
1298 bz->reserve_failed++;
1299 return (map->pagesneeded - (map->pagesreserved + pages));
1302 bz->free_bpages -= pages;
1304 bz->reserved_bpages += pages;
1305 KKASSERT(bz->reserved_bpages <= bz->total_bpages);
1307 map->pagesreserved += pages;
1308 pages = map->pagesneeded - map->pagesreserved;
1314 return_bounce_pages(bus_dma_tag_t dmat, bus_dmamap_t map)
1316 struct bounce_zone *bz = dmat->bounce_zone;
1317 int reserved = map->pagesreserved;
1318 bus_dmamap_t wait_map;
1320 map->pagesreserved = 0;
1321 map->pagesneeded = 0;
1328 bz->free_bpages += reserved;
1329 KKASSERT(bz->free_bpages <= bz->total_bpages);
1331 KKASSERT(bz->reserved_bpages >= reserved);
1332 bz->reserved_bpages -= reserved;
1334 wait_map = get_map_waiting(dmat);
1338 if (wait_map != NULL)
1339 add_map_callback(map);
1343 add_bounce_page(bus_dma_tag_t dmat, bus_dmamap_t map, vm_offset_t vaddr,
1346 struct bounce_zone *bz = dmat->bounce_zone;
1347 struct bounce_page *bpage;
1349 KASSERT(map->pagesneeded > 0, ("map doesn't need any pages"));
1352 KASSERT(map->pagesreserved > 0, ("map doesn't reserve any pages"));
1353 map->pagesreserved--;
1357 bpage = STAILQ_FIRST(&bz->bounce_page_list);
1358 KASSERT(bpage != NULL, ("free page list is empty"));
1359 STAILQ_REMOVE_HEAD(&bz->bounce_page_list, links);
1361 KKASSERT(bz->reserved_bpages > 0);
1362 bz->reserved_bpages--;
1364 bz->active_bpages++;
1365 KKASSERT(bz->active_bpages <= bz->total_bpages);
1369 bpage->datavaddr = vaddr;
1370 bpage->datacount = size;
1371 STAILQ_INSERT_TAIL(&map->bpages, bpage, links);
1372 return bpage->busaddr;
1376 free_bounce_page(bus_dma_tag_t dmat, struct bounce_page *bpage)
1378 struct bounce_zone *bz = dmat->bounce_zone;
1381 bpage->datavaddr = 0;
1382 bpage->datacount = 0;
1386 STAILQ_INSERT_HEAD(&bz->bounce_page_list, bpage, links);
1389 KKASSERT(bz->free_bpages <= bz->total_bpages);
1391 KKASSERT(bz->active_bpages > 0);
1392 bz->active_bpages--;
1394 map = get_map_waiting(dmat);
1399 add_map_callback(map);
1402 /* Assume caller holds bounce zone spinlock */
1404 get_map_waiting(bus_dma_tag_t dmat)
1406 struct bounce_zone *bz = dmat->bounce_zone;
1409 map = STAILQ_FIRST(&bz->bounce_map_waitinglist);
1411 if (reserve_bounce_pages(map->dmat, map, 1) == 0) {
1412 STAILQ_REMOVE_HEAD(&bz->bounce_map_waitinglist, links);
1413 bz->total_deferred++;
1422 add_map_callback(bus_dmamap_t map)
1424 spin_lock(&bounce_map_list_spin);
1425 STAILQ_INSERT_TAIL(&bounce_map_callbacklist, map, links);
1426 busdma_swi_pending = 1;
1428 spin_unlock(&bounce_map_list_spin);
1436 spin_lock(&bounce_map_list_spin);
1437 while ((map = STAILQ_FIRST(&bounce_map_callbacklist)) != NULL) {
1438 STAILQ_REMOVE_HEAD(&bounce_map_callbacklist, links);
1439 spin_unlock(&bounce_map_list_spin);
1440 bus_dmamap_load(map->dmat, map, map->buf, map->buflen,
1441 map->callback, map->callback_arg, /*flags*/0);
1442 spin_lock(&bounce_map_list_spin);
1444 spin_unlock(&bounce_map_list_spin);