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_wr(&(bz)->spin)
135 #define BZ_UNLOCK(bz) spin_unlock_wr(&(bz)->spin)
137 #define BZ_LOCK(bz) crit_enter()
138 #define BZ_UNLOCK(bz) crit_exit()
141 static struct lwkt_token bounce_zone_tok = LWKT_TOKEN_MP_INITIALIZER;
142 static int busdma_zonecount;
143 static STAILQ_HEAD(, bounce_zone) bounce_zone_list =
144 STAILQ_HEAD_INITIALIZER(bounce_zone_list);
146 int busdma_swi_pending;
147 static int total_bounce_pages;
148 static int max_bounce_pages = MAX_BPAGES;
149 static int bounce_alignment = 1; /* XXX temporary */
151 TUNABLE_INT("hw.busdma.max_bpages", &max_bounce_pages);
152 TUNABLE_INT("hw.busdma.bounce_alignment", &bounce_alignment);
155 struct bp_list bpages;
159 void *buf; /* unmapped buffer pointer */
160 bus_size_t buflen; /* unmapped buffer length */
161 bus_dmamap_callback_t *callback;
163 STAILQ_ENTRY(bus_dmamap) links;
166 static STAILQ_HEAD(, bus_dmamap) bounce_map_callbacklist =
167 STAILQ_HEAD_INITIALIZER(bounce_map_callbacklist);
169 static struct bus_dmamap nobounce_dmamap;
171 static int alloc_bounce_zone(bus_dma_tag_t);
172 static int alloc_bounce_pages(bus_dma_tag_t, u_int, int);
173 static int reserve_bounce_pages(bus_dma_tag_t, bus_dmamap_t, int);
174 static void return_bounce_pages(bus_dma_tag_t, bus_dmamap_t);
175 static bus_addr_t add_bounce_page(bus_dma_tag_t, bus_dmamap_t,
176 vm_offset_t, bus_size_t);
177 static void free_bounce_page(bus_dma_tag_t, struct bounce_page *);
179 static bus_dmamap_t get_map_waiting(bus_dma_tag_t);
180 static void add_map_callback(bus_dmamap_t);
182 SYSCTL_NODE(_hw, OID_AUTO, busdma, CTLFLAG_RD, 0, "Busdma parameters");
183 SYSCTL_INT(_hw_busdma, OID_AUTO, total_bpages, CTLFLAG_RD, &total_bounce_pages,
184 0, "Total bounce pages");
185 SYSCTL_INT(_hw_busdma, OID_AUTO, max_bpages, CTLFLAG_RD, &max_bounce_pages,
186 0, "Max bounce pages per bounce zone");
187 SYSCTL_INT(_hw_busdma, OID_AUTO, bounce_alignment, CTLFLAG_RD,
188 &bounce_alignment, 0, "Obey alignment constraint");
191 run_filter(bus_dma_tag_t dmat, bus_addr_t paddr)
197 if (((paddr > dmat->lowaddr && paddr <= dmat->highaddr) ||
198 (bounce_alignment && (paddr & (dmat->alignment - 1)) != 0))
199 && (dmat->filter == NULL ||
200 dmat->filter(dmat->filterarg, paddr) != 0))
204 } while (retval == 0 && dmat != NULL);
210 bus_dma_tag_lock(bus_dma_tag_t tag, bus_dma_segment_t *cache)
212 if (tag->nsegments <= BUS_DMA_CACHE_SEGMENTS)
215 spin_lock_wr(&tag->spin);
217 return(tag->segments);
222 bus_dma_tag_unlock(bus_dma_tag_t tag)
225 if (tag->nsegments > BUS_DMA_CACHE_SEGMENTS)
226 spin_unlock_wr(&tag->spin);
231 * Allocate a device specific dma_tag.
234 bus_dma_tag_create(bus_dma_tag_t parent, bus_size_t alignment,
235 bus_size_t boundary, bus_addr_t lowaddr,
236 bus_addr_t highaddr, bus_dma_filter_t *filter,
237 void *filterarg, bus_size_t maxsize, int nsegments,
238 bus_size_t maxsegsz, int flags, bus_dma_tag_t *dmat)
240 bus_dma_tag_t newtag;
249 if (alignment & (alignment - 1))
250 panic("alignment must be power of 2\n");
253 if (boundary & (boundary - 1))
254 panic("boundary must be power of 2\n");
255 if (boundary < maxsegsz) {
256 kprintf("boundary < maxsegsz:\n");
262 /* Return a NULL tag on failure */
265 newtag = kmalloc(sizeof(*newtag), M_DEVBUF, M_INTWAIT | M_ZERO);
268 spin_init(&newtag->spin);
270 newtag->parent = parent;
271 newtag->alignment = alignment;
272 newtag->boundary = boundary;
273 newtag->lowaddr = trunc_page((vm_paddr_t)lowaddr) + (PAGE_SIZE - 1);
274 newtag->highaddr = trunc_page((vm_paddr_t)highaddr) + (PAGE_SIZE - 1);
275 newtag->filter = filter;
276 newtag->filterarg = filterarg;
277 newtag->maxsize = maxsize;
278 newtag->nsegments = nsegments;
279 newtag->maxsegsz = maxsegsz;
280 newtag->flags = flags;
281 newtag->ref_count = 1; /* Count ourself */
282 newtag->map_count = 0;
283 newtag->segments = NULL;
284 newtag->bounce_zone = NULL;
286 /* Take into account any restrictions imposed by our parent tag */
287 if (parent != NULL) {
288 newtag->lowaddr = MIN(parent->lowaddr, newtag->lowaddr);
289 newtag->highaddr = MAX(parent->highaddr, newtag->highaddr);
291 if (newtag->boundary == 0) {
292 newtag->boundary = parent->boundary;
293 } else if (parent->boundary != 0) {
294 newtag->boundary = MIN(parent->boundary,
299 newtag->alignment = MAX(parent->alignment, newtag->alignment);
302 if (newtag->filter == NULL) {
304 * Short circuit looking at our parent directly
305 * since we have encapsulated all of its information
307 newtag->filter = parent->filter;
308 newtag->filterarg = parent->filterarg;
309 newtag->parent = parent->parent;
311 if (newtag->parent != NULL)
315 if (newtag->lowaddr < ptoa(Maxmem))
316 newtag->flags |= BUS_DMA_BOUNCE_LOWADDR;
317 if (bounce_alignment && newtag->alignment > 1 &&
318 !(newtag->flags & BUS_DMA_ALIGNED))
319 newtag->flags |= BUS_DMA_BOUNCE_ALIGN;
321 if ((newtag->flags & BUS_DMA_COULD_BOUNCE) &&
322 (flags & BUS_DMA_ALLOCNOW) != 0) {
323 struct bounce_zone *bz;
327 error = alloc_bounce_zone(newtag);
330 bz = newtag->bounce_zone;
332 if (ptoa(bz->total_bpages) < maxsize) {
335 if (flags & BUS_DMA_ONEBPAGE) {
338 pages = atop(round_page(maxsize)) -
340 pages = MAX(pages, 1);
343 /* Add pages to our bounce pool */
344 if (alloc_bounce_pages(newtag, pages, flags) < pages)
347 /* Performed initial allocation */
348 newtag->flags |= BUS_DMA_MIN_ALLOC_COMP;
353 kfree(newtag, M_DEVBUF);
360 bus_dma_tag_destroy(bus_dma_tag_t dmat)
363 if (dmat->map_count != 0)
366 while (dmat != NULL) {
367 bus_dma_tag_t parent;
369 parent = dmat->parent;
371 if (dmat->ref_count == 0) {
372 if (dmat->segments != NULL)
373 kfree(dmat->segments, M_DEVBUF);
374 kfree(dmat, M_DEVBUF);
376 * Last reference count, so
377 * release our reference
378 * count on our parent.
389 bus_dma_tag_getmaxsize(bus_dma_tag_t tag)
391 return(tag->maxsize);
395 * Allocate a handle for mapping from kva/uva/physical
396 * address space into bus device space.
399 bus_dmamap_create(bus_dma_tag_t dmat, int flags, bus_dmamap_t *mapp)
405 if (dmat->segments == NULL) {
406 KKASSERT(dmat->nsegments && dmat->nsegments < 16384);
407 dmat->segments = kmalloc(sizeof(bus_dma_segment_t) *
408 dmat->nsegments, M_DEVBUF, M_INTWAIT);
411 if (dmat->flags & BUS_DMA_COULD_BOUNCE) {
412 struct bounce_zone *bz;
417 if (dmat->bounce_zone == NULL) {
418 error = alloc_bounce_zone(dmat);
422 bz = dmat->bounce_zone;
424 *mapp = kmalloc(sizeof(**mapp), M_DEVBUF, M_INTWAIT | M_ZERO);
426 /* Initialize the new map */
427 STAILQ_INIT(&((*mapp)->bpages));
430 * Attempt to add pages to our pool on a per-instance
431 * basis up to a sane limit.
433 if (dmat->flags & BUS_DMA_BOUNCE_ALIGN) {
434 maxpages = max_bounce_pages;
436 maxpages = MIN(max_bounce_pages,
437 Maxmem - atop(dmat->lowaddr));
439 if ((dmat->flags & BUS_DMA_MIN_ALLOC_COMP) == 0
440 || (dmat->map_count > 0
441 && bz->total_bpages < maxpages)) {
444 if (flags & BUS_DMA_ONEBPAGE) {
447 pages = atop(round_page(dmat->maxsize));
448 pages = MIN(maxpages - bz->total_bpages, pages);
449 pages = MAX(pages, 1);
451 if (alloc_bounce_pages(dmat, pages, flags) < pages)
454 if ((dmat->flags & BUS_DMA_MIN_ALLOC_COMP) == 0) {
456 dmat->flags |= BUS_DMA_MIN_ALLOC_COMP;
470 * Destroy a handle for mapping from kva/uva/physical
471 * address space into bus device space.
474 bus_dmamap_destroy(bus_dma_tag_t dmat, bus_dmamap_t map)
477 if (STAILQ_FIRST(&map->bpages) != NULL)
479 kfree(map, M_DEVBUF);
485 static __inline bus_size_t
486 check_kmalloc(bus_dma_tag_t dmat, const void *vaddr0, int verify)
488 bus_size_t maxsize = 0;
489 uintptr_t vaddr = (uintptr_t)vaddr0;
491 if ((vaddr ^ (vaddr + dmat->maxsize - 1)) & ~PAGE_MASK) {
492 if (verify || bootverbose)
493 kprintf("boundary check failed\n");
495 print_backtrace(-1); /* XXX panic */
496 maxsize = dmat->maxsize;
498 if (vaddr & (dmat->alignment - 1)) {
499 if (verify || bootverbose)
500 kprintf("alignment check failed\n");
502 print_backtrace(-1); /* XXX panic */
503 if (dmat->maxsize < dmat->alignment)
504 maxsize = dmat->alignment;
506 maxsize = dmat->maxsize;
512 * Allocate a piece of memory that can be efficiently mapped into
513 * bus device space based on the constraints lited in the dma tag.
515 * mapp is degenerate. By definition this allocation should not require
516 * bounce buffers so do not allocate a dma map.
519 bus_dmamem_alloc(bus_dma_tag_t dmat, void **vaddr, int flags,
524 /* If we succeed, no mapping/bouncing will be required */
527 if (dmat->segments == NULL) {
528 KKASSERT(dmat->nsegments < 16384);
529 dmat->segments = kmalloc(sizeof(bus_dma_segment_t) *
530 dmat->nsegments, M_DEVBUF, M_INTWAIT);
533 if (flags & BUS_DMA_NOWAIT)
537 if (flags & BUS_DMA_ZERO)
540 if (BUS_DMAMEM_KMALLOC(dmat)) {
543 *vaddr = kmalloc(dmat->maxsize, M_DEVBUF, mflags);
547 * Check whether the allocation
548 * - crossed a page boundary
550 * Retry with power-of-2 alignment in the above cases.
552 maxsize = check_kmalloc(dmat, *vaddr, 0);
556 kfree(*vaddr, M_DEVBUF);
557 /* XXX check for overflow? */
558 for (size = 1; size <= maxsize; size <<= 1)
560 *vaddr = kmalloc(size, M_DEVBUF, mflags);
561 check_kmalloc(dmat, *vaddr, 1);
565 * XXX Use Contigmalloc until it is merged into this facility
566 * and handles multi-seg allocations. Nobody is doing
567 * multi-seg allocations yet though.
569 *vaddr = contigmalloc(dmat->maxsize, M_DEVBUF, mflags,
570 0ul, dmat->lowaddr, dmat->alignment, dmat->boundary);
578 * Free a piece of memory and it's allociated dmamap, that was allocated
579 * via bus_dmamem_alloc. Make the same choice for free/contigfree.
582 bus_dmamem_free(bus_dma_tag_t dmat, void *vaddr, bus_dmamap_t map)
585 * dmamem does not need to be bounced, so the map should be
589 panic("bus_dmamem_free: Invalid map freed\n");
590 if (BUS_DMAMEM_KMALLOC(dmat))
591 kfree(vaddr, M_DEVBUF);
593 contigfree(vaddr, dmat->maxsize, M_DEVBUF);
596 static __inline vm_paddr_t
597 _bus_dma_extract(pmap_t pmap, vm_offset_t vaddr)
600 return pmap_extract(pmap, vaddr);
602 return pmap_kextract(vaddr);
606 * Utility function to load a linear buffer. lastaddrp holds state
607 * between invocations (for multiple-buffer loads). segp contains
608 * the segment following the starting one on entrace, and the ending
609 * segment on exit. first indicates if this is the first invocation
613 _bus_dmamap_load_buffer(bus_dma_tag_t dmat,
615 void *buf, bus_size_t buflen,
616 bus_dma_segment_t *segments,
620 vm_paddr_t *lastpaddrp,
625 vm_paddr_t paddr, nextpaddr;
626 bus_dma_segment_t *sg;
631 map = &nobounce_dmamap;
634 if (dmat->flags & BUS_DMA_ALIGNED)
635 KKASSERT(((uintptr_t)buf & (dmat->alignment - 1)) == 0);
639 * If we are being called during a callback, pagesneeded will
640 * be non-zero, so we can avoid doing the work twice.
642 if ((dmat->flags & BUS_DMA_COULD_BOUNCE) &&
643 map != &nobounce_dmamap && map->pagesneeded == 0) {
644 vm_offset_t vendaddr;
647 * Count the number of bounce pages
648 * needed in order to complete this transfer
650 vaddr = (vm_offset_t)buf;
651 vendaddr = (vm_offset_t)buf + buflen;
653 while (vaddr < vendaddr) {
654 paddr = _bus_dma_extract(pmap, vaddr);
655 if (run_filter(dmat, paddr) != 0)
657 vaddr += (PAGE_SIZE - ((vm_offset_t)vaddr & PAGE_MASK));
661 /* Reserve Necessary Bounce Pages */
662 if (map->pagesneeded != 0) {
663 struct bounce_zone *bz;
665 bz = dmat->bounce_zone;
667 if (flags & BUS_DMA_NOWAIT) {
668 if (reserve_bounce_pages(dmat, map, 0) != 0) {
674 if (reserve_bounce_pages(dmat, map, 1) != 0) {
675 /* Queue us for resources */
678 map->buflen = buflen;
681 &dmat->bounce_zone->bounce_map_waitinglist,
685 return (EINPROGRESS);
691 KKASSERT(*segp >= 1 && *segp <= nsegments);
693 sg = &segments[seg - 1];
695 vaddr = (vm_offset_t)buf;
696 nextpaddr = *lastpaddrp;
697 bmask = ~(dmat->boundary - 1); /* note: will be 0 if boundary is 0 */
699 /* force at least one segment */
706 paddr = _bus_dma_extract(pmap, vaddr);
707 size = PAGE_SIZE - (paddr & PAGE_MASK);
710 if (map->pagesneeded != 0 && run_filter(dmat, paddr)) {
712 * note: this paddr has the same in-page offset
713 * as vaddr and thus the paddr above, so the
714 * size does not have to be recalculated
716 paddr = add_bounce_page(dmat, map, vaddr, size);
720 * Fill in the bus_dma_segment
726 } else if (paddr == nextpaddr) {
736 nextpaddr = paddr + size;
739 * Handle maxsegsz and boundary issues with a nested loop
745 * Limit to the boundary and maximum segment size
747 if (((nextpaddr - 1) ^ sg->ds_addr) & bmask) {
748 tmpsize = dmat->boundary -
749 (sg->ds_addr & ~bmask);
750 if (tmpsize > dmat->maxsegsz)
751 tmpsize = dmat->maxsegsz;
752 KKASSERT(tmpsize < sg->ds_len);
753 } else if (sg->ds_len > dmat->maxsegsz) {
754 tmpsize = dmat->maxsegsz;
760 * Futz, split the data into a new segment.
762 if (seg >= nsegments)
764 sg[1].ds_len = sg[0].ds_len - tmpsize;
765 sg[1].ds_addr = sg[0].ds_addr + tmpsize;
766 sg[0].ds_len = tmpsize;
776 } while (buflen > 0);
782 *lastpaddrp = nextpaddr;
785 if (error && (dmat->flags & BUS_DMA_COULD_BOUNCE) &&
786 map != &nobounce_dmamap) {
787 _bus_dmamap_unload(dmat, map);
788 return_bounce_pages(dmat, map);
794 * Map the buffer buf into bus space using the dmamap map.
797 bus_dmamap_load(bus_dma_tag_t dmat, bus_dmamap_t map, void *buf,
798 bus_size_t buflen, bus_dmamap_callback_t *callback,
799 void *callback_arg, int flags)
801 bus_dma_segment_t cache_segments[BUS_DMA_CACHE_SEGMENTS];
802 bus_dma_segment_t *segments;
803 vm_paddr_t lastaddr = 0;
804 int error, nsegs = 1;
809 * Follow old semantics. Once all of the callers are fixed,
810 * we should get rid of these internal flag "adjustment".
812 flags &= ~BUS_DMA_NOWAIT;
813 flags |= BUS_DMA_WAITOK;
815 map->callback = callback;
816 map->callback_arg = callback_arg;
819 segments = bus_dma_tag_lock(dmat, cache_segments);
820 error = _bus_dmamap_load_buffer(dmat, map, buf, buflen,
821 segments, dmat->nsegments,
822 NULL, flags, &lastaddr, &nsegs, 1);
823 if (error == EINPROGRESS) {
824 bus_dma_tag_unlock(dmat);
827 callback(callback_arg, segments, nsegs, error);
828 bus_dma_tag_unlock(dmat);
833 * Like _bus_dmamap_load(), but for mbufs.
836 bus_dmamap_load_mbuf(bus_dma_tag_t dmat, bus_dmamap_t map,
838 bus_dmamap_callback2_t *callback, void *callback_arg,
841 bus_dma_segment_t cache_segments[BUS_DMA_CACHE_SEGMENTS];
842 bus_dma_segment_t *segments;
847 * Follow old semantics. Once all of the callers are fixed,
848 * we should get rid of these internal flag "adjustment".
850 flags &= ~BUS_DMA_WAITOK;
851 flags |= BUS_DMA_NOWAIT;
853 segments = bus_dma_tag_lock(dmat, cache_segments);
854 error = bus_dmamap_load_mbuf_segment(dmat, map, m0,
855 segments, dmat->nsegments, &nsegs, flags);
857 /* force "no valid mappings" in callback */
858 callback(callback_arg, segments, 0,
861 callback(callback_arg, segments, nsegs,
862 m0->m_pkthdr.len, error);
864 bus_dma_tag_unlock(dmat);
869 bus_dmamap_load_mbuf_segment(bus_dma_tag_t dmat, bus_dmamap_t map,
871 bus_dma_segment_t *segs, int maxsegs,
872 int *nsegs, int flags)
878 KASSERT(maxsegs >= 1, ("invalid maxsegs %d\n", maxsegs));
879 KASSERT(maxsegs <= dmat->nsegments,
880 ("%d too many segments, dmat only support %d segments\n",
881 maxsegs, dmat->nsegments));
882 KASSERT(flags & BUS_DMA_NOWAIT,
883 ("only BUS_DMA_NOWAIT is supported\n"));
885 if (m0->m_pkthdr.len <= dmat->maxsize) {
887 vm_paddr_t lastaddr = 0;
892 for (m = m0; m != NULL && error == 0; m = m->m_next) {
896 error = _bus_dmamap_load_buffer(dmat, map,
899 NULL, flags, &lastaddr,
901 if (error == ENOMEM && !first) {
903 * Out of bounce pages due to too many
904 * fragments in the mbuf chain; return
913 KKASSERT(*nsegs <= maxsegs && *nsegs >= 1);
919 KKASSERT(error != EINPROGRESS);
924 * Like _bus_dmamap_load(), but for uios.
927 bus_dmamap_load_uio(bus_dma_tag_t dmat, bus_dmamap_t map,
929 bus_dmamap_callback2_t *callback, void *callback_arg,
933 int nsegs, error, first, i;
937 bus_dma_segment_t cache_segments[BUS_DMA_CACHE_SEGMENTS];
938 bus_dma_segment_t *segments;
939 bus_dma_segment_t *segs;
942 if (dmat->nsegments <= BUS_DMA_CACHE_SEGMENTS)
943 segments = cache_segments;
945 segments = kmalloc(sizeof(bus_dma_segment_t) * dmat->nsegments,
946 M_DEVBUF, M_WAITOK | M_ZERO);
950 * Follow old semantics. Once all of the callers are fixed,
951 * we should get rid of these internal flag "adjustment".
953 flags &= ~BUS_DMA_WAITOK;
954 flags |= BUS_DMA_NOWAIT;
956 resid = (bus_size_t)uio->uio_resid;
960 nsegs_left = dmat->nsegments;
962 if (uio->uio_segflg == UIO_USERSPACE) {
966 KASSERT(td != NULL && td->td_proc != NULL,
967 ("bus_dmamap_load_uio: USERSPACE but no proc"));
968 pmap = vmspace_pmap(td->td_proc->p_vmspace);
977 for (i = 0; i < uio->uio_iovcnt && resid != 0 && !error; i++) {
979 * Now at the first iovec to load. Load each iovec
980 * until we have exhausted the residual count.
983 resid < iov[i].iov_len ? resid : iov[i].iov_len;
984 caddr_t addr = (caddr_t) iov[i].iov_base;
986 error = _bus_dmamap_load_buffer(dmat, map, addr, minlen,
988 pmap, flags, &lastaddr, &nsegs, first);
999 * Minimum one DMA segment, even if 0-length buffer.
1001 if (nsegs_left == dmat->nsegments)
1005 /* force "no valid mappings" in callback */
1006 callback(callback_arg, segments, 0,
1009 callback(callback_arg, segments, dmat->nsegments - nsegs_left,
1010 (bus_size_t)uio->uio_resid, error);
1012 if (dmat->nsegments > BUS_DMA_CACHE_SEGMENTS)
1013 kfree(segments, M_DEVBUF);
1018 * Release the mapping held by map.
1021 _bus_dmamap_unload(bus_dma_tag_t dmat, bus_dmamap_t map)
1023 struct bounce_page *bpage;
1025 while ((bpage = STAILQ_FIRST(&map->bpages)) != NULL) {
1026 STAILQ_REMOVE_HEAD(&map->bpages, links);
1027 free_bounce_page(dmat, bpage);
1032 _bus_dmamap_sync(bus_dma_tag_t dmat, bus_dmamap_t map, bus_dmasync_op_t op)
1034 struct bounce_page *bpage;
1036 if ((bpage = STAILQ_FIRST(&map->bpages)) != NULL) {
1038 * Handle data bouncing. We might also
1039 * want to add support for invalidating
1040 * the caches on broken hardware
1043 case BUS_DMASYNC_PREWRITE:
1044 while (bpage != NULL) {
1045 bcopy((void *)bpage->datavaddr,
1046 (void *)bpage->vaddr,
1048 bpage = STAILQ_NEXT(bpage, links);
1050 dmat->bounce_zone->total_bounced++;
1053 case BUS_DMASYNC_POSTREAD:
1054 while (bpage != NULL) {
1055 bcopy((void *)bpage->vaddr,
1056 (void *)bpage->datavaddr,
1058 bpage = STAILQ_NEXT(bpage, links);
1060 dmat->bounce_zone->total_bounced++;
1063 case BUS_DMASYNC_PREREAD:
1064 case BUS_DMASYNC_POSTWRITE:
1072 alloc_bounce_zone(bus_dma_tag_t dmat)
1074 struct bounce_zone *bz, *new_bz;
1076 KASSERT(dmat->bounce_zone == NULL,
1077 ("bounce zone was already assigned\n"));
1079 new_bz = kmalloc(sizeof(*new_bz), M_DEVBUF, M_INTWAIT | M_ZERO);
1081 lwkt_gettoken(&bounce_zone_tok);
1083 /* Check to see if we already have a suitable zone */
1084 STAILQ_FOREACH(bz, &bounce_zone_list, links) {
1085 if (dmat->alignment <= bz->alignment &&
1086 dmat->lowaddr >= bz->lowaddr) {
1087 lwkt_reltoken(&bounce_zone_tok);
1089 dmat->bounce_zone = bz;
1090 kfree(new_bz, M_DEVBUF);
1097 spin_init(&bz->spin);
1099 STAILQ_INIT(&bz->bounce_page_list);
1100 STAILQ_INIT(&bz->bounce_map_waitinglist);
1101 bz->free_bpages = 0;
1102 bz->reserved_bpages = 0;
1103 bz->active_bpages = 0;
1104 bz->lowaddr = dmat->lowaddr;
1105 bz->alignment = round_page(dmat->alignment);
1106 ksnprintf(bz->zoneid, 8, "zone%d", busdma_zonecount);
1108 ksnprintf(bz->lowaddrid, 18, "%#jx", (uintmax_t)bz->lowaddr);
1109 STAILQ_INSERT_TAIL(&bounce_zone_list, bz, links);
1111 lwkt_reltoken(&bounce_zone_tok);
1113 dmat->bounce_zone = bz;
1115 sysctl_ctx_init(&bz->sysctl_ctx);
1116 bz->sysctl_tree = SYSCTL_ADD_NODE(&bz->sysctl_ctx,
1117 SYSCTL_STATIC_CHILDREN(_hw_busdma), OID_AUTO, bz->zoneid,
1119 if (bz->sysctl_tree == NULL) {
1120 sysctl_ctx_free(&bz->sysctl_ctx);
1121 return 0; /* XXX error code? */
1124 SYSCTL_ADD_INT(&bz->sysctl_ctx,
1125 SYSCTL_CHILDREN(bz->sysctl_tree), OID_AUTO,
1126 "total_bpages", CTLFLAG_RD, &bz->total_bpages, 0,
1127 "Total bounce pages");
1128 SYSCTL_ADD_INT(&bz->sysctl_ctx,
1129 SYSCTL_CHILDREN(bz->sysctl_tree), OID_AUTO,
1130 "free_bpages", CTLFLAG_RD, &bz->free_bpages, 0,
1131 "Free bounce pages");
1132 SYSCTL_ADD_INT(&bz->sysctl_ctx,
1133 SYSCTL_CHILDREN(bz->sysctl_tree), OID_AUTO,
1134 "reserved_bpages", CTLFLAG_RD, &bz->reserved_bpages, 0,
1135 "Reserved bounce pages");
1136 SYSCTL_ADD_INT(&bz->sysctl_ctx,
1137 SYSCTL_CHILDREN(bz->sysctl_tree), OID_AUTO,
1138 "active_bpages", CTLFLAG_RD, &bz->active_bpages, 0,
1139 "Active bounce pages");
1140 SYSCTL_ADD_INT(&bz->sysctl_ctx,
1141 SYSCTL_CHILDREN(bz->sysctl_tree), OID_AUTO,
1142 "total_bounced", CTLFLAG_RD, &bz->total_bounced, 0,
1143 "Total bounce requests");
1144 SYSCTL_ADD_INT(&bz->sysctl_ctx,
1145 SYSCTL_CHILDREN(bz->sysctl_tree), OID_AUTO,
1146 "total_deferred", CTLFLAG_RD, &bz->total_deferred, 0,
1147 "Total bounce requests that were deferred");
1148 SYSCTL_ADD_INT(&bz->sysctl_ctx,
1149 SYSCTL_CHILDREN(bz->sysctl_tree), OID_AUTO,
1150 "reserve_failed", CTLFLAG_RD, &bz->reserve_failed, 0,
1151 "Total bounce page reservations that were failed");
1152 SYSCTL_ADD_STRING(&bz->sysctl_ctx,
1153 SYSCTL_CHILDREN(bz->sysctl_tree), OID_AUTO,
1154 "lowaddr", CTLFLAG_RD, bz->lowaddrid, 0, "");
1155 SYSCTL_ADD_INT(&bz->sysctl_ctx,
1156 SYSCTL_CHILDREN(bz->sysctl_tree), OID_AUTO,
1157 "alignment", CTLFLAG_RD, &bz->alignment, 0, "");
1163 alloc_bounce_pages(bus_dma_tag_t dmat, u_int numpages, int flags)
1165 struct bounce_zone *bz = dmat->bounce_zone;
1166 int count = 0, mflags;
1168 if (flags & BUS_DMA_NOWAIT)
1173 while (numpages > 0) {
1174 struct bounce_page *bpage;
1176 bpage = kmalloc(sizeof(*bpage), M_DEVBUF, M_INTWAIT | M_ZERO);
1178 bpage->vaddr = (vm_offset_t)contigmalloc(PAGE_SIZE, M_DEVBUF,
1182 if (bpage->vaddr == 0) {
1183 kfree(bpage, M_DEVBUF);
1186 bpage->busaddr = pmap_kextract(bpage->vaddr);
1189 STAILQ_INSERT_TAIL(&bz->bounce_page_list, bpage, links);
1190 total_bounce_pages++;
1201 /* Assume caller holds bounce zone spinlock */
1203 reserve_bounce_pages(bus_dma_tag_t dmat, bus_dmamap_t map, int commit)
1205 struct bounce_zone *bz = dmat->bounce_zone;
1208 pages = MIN(bz->free_bpages, map->pagesneeded - map->pagesreserved);
1209 if (!commit && map->pagesneeded > (map->pagesreserved + pages)) {
1210 bz->reserve_failed++;
1211 return (map->pagesneeded - (map->pagesreserved + pages));
1214 bz->free_bpages -= pages;
1216 bz->reserved_bpages += pages;
1217 KKASSERT(bz->reserved_bpages <= bz->total_bpages);
1219 map->pagesreserved += pages;
1220 pages = map->pagesneeded - map->pagesreserved;
1226 return_bounce_pages(bus_dma_tag_t dmat, bus_dmamap_t map)
1228 struct bounce_zone *bz = dmat->bounce_zone;
1229 int reserved = map->pagesreserved;
1230 bus_dmamap_t wait_map;
1232 map->pagesreserved = 0;
1233 map->pagesneeded = 0;
1240 bz->free_bpages += reserved;
1241 KKASSERT(bz->free_bpages <= bz->total_bpages);
1243 KKASSERT(bz->reserved_bpages >= reserved);
1244 bz->reserved_bpages -= reserved;
1246 wait_map = get_map_waiting(dmat);
1250 if (wait_map != NULL)
1251 add_map_callback(map);
1255 add_bounce_page(bus_dma_tag_t dmat, bus_dmamap_t map, vm_offset_t vaddr,
1258 struct bounce_zone *bz = dmat->bounce_zone;
1259 struct bounce_page *bpage;
1261 KASSERT(map->pagesneeded > 0, ("map doesn't need any pages"));
1264 KASSERT(map->pagesreserved > 0, ("map doesn't reserve any pages"));
1265 map->pagesreserved--;
1269 bpage = STAILQ_FIRST(&bz->bounce_page_list);
1270 KASSERT(bpage != NULL, ("free page list is empty"));
1271 STAILQ_REMOVE_HEAD(&bz->bounce_page_list, links);
1273 KKASSERT(bz->reserved_bpages > 0);
1274 bz->reserved_bpages--;
1276 bz->active_bpages++;
1277 KKASSERT(bz->active_bpages <= bz->total_bpages);
1281 bpage->datavaddr = vaddr;
1282 bpage->datacount = size;
1283 STAILQ_INSERT_TAIL(&map->bpages, bpage, links);
1284 return bpage->busaddr;
1288 free_bounce_page(bus_dma_tag_t dmat, struct bounce_page *bpage)
1290 struct bounce_zone *bz = dmat->bounce_zone;
1293 bpage->datavaddr = 0;
1294 bpage->datacount = 0;
1298 STAILQ_INSERT_HEAD(&bz->bounce_page_list, bpage, links);
1301 KKASSERT(bz->free_bpages <= bz->total_bpages);
1303 KKASSERT(bz->active_bpages > 0);
1304 bz->active_bpages--;
1306 map = get_map_waiting(dmat);
1311 add_map_callback(map);
1314 /* Assume caller holds bounce zone spinlock */
1316 get_map_waiting(bus_dma_tag_t dmat)
1318 struct bounce_zone *bz = dmat->bounce_zone;
1321 map = STAILQ_FIRST(&bz->bounce_map_waitinglist);
1323 if (reserve_bounce_pages(map->dmat, map, 1) == 0) {
1324 STAILQ_REMOVE_HEAD(&bz->bounce_map_waitinglist, links);
1325 bz->total_deferred++;
1334 add_map_callback(bus_dmamap_t map)
1336 /* XXX callbacklist is not MPSAFE */
1339 STAILQ_INSERT_TAIL(&bounce_map_callbacklist, map, links);
1340 busdma_swi_pending = 1;
1352 while ((map = STAILQ_FIRST(&bounce_map_callbacklist)) != NULL) {
1353 STAILQ_REMOVE_HEAD(&bounce_map_callbacklist, links);
1355 bus_dmamap_load(map->dmat, map, map->buf, map->buflen,
1356 map->callback, map->callback_arg, /*flags*/0);