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
27 #include <sys/cdefs.h>
28 __FBSDID("$FreeBSD$");
30 #include <sys/param.h>
33 #include <ddb/db_output.h>
34 #include <sys/systm.h>
35 #include <sys/malloc.h>
37 #include <sys/interrupt.h>
38 #include <sys/kernel.h>
42 #include <sys/mutex.h>
45 #include <sys/sysctl.h>
48 #include <vm/vm_page.h>
49 #include <vm/vm_map.h>
51 #include <machine/atomic.h>
52 #include <machine/bus.h>
53 #include <machine/md_var.h>
54 #include <machine/specialreg.h>
56 #define MAX_BPAGES 512
57 #define BUS_DMA_COULD_BOUNCE BUS_DMA_BUS3
58 #define BUS_DMA_MIN_ALLOC_COMP BUS_DMA_BUS4
68 bus_dma_filter_t *filter;
76 bus_dma_lock_t *lockfunc;
78 bus_dma_segment_t *segments;
79 struct bounce_zone *bounce_zone;
83 vm_offset_t vaddr; /* kva of bounce buffer */
84 bus_addr_t busaddr; /* Physical address */
85 vm_offset_t datavaddr; /* kva of client data */
86 bus_size_t datacount; /* client data count */
87 STAILQ_ENTRY(bounce_page) links;
90 int busdma_swi_pending;
93 STAILQ_ENTRY(bounce_zone) links;
94 STAILQ_HEAD(bp_list, bounce_page) bounce_page_list;
101 bus_size_t alignment;
106 struct sysctl_ctx_list sysctl_tree;
107 struct sysctl_oid *sysctl_tree_top;
110 static struct mtx bounce_lock;
111 static int total_bpages;
112 static int busdma_zonecount;
113 static STAILQ_HEAD(, bounce_zone) bounce_zone_list;
115 SYSCTL_NODE(_hw, OID_AUTO, busdma, CTLFLAG_RD, 0, "Busdma parameters");
116 SYSCTL_INT(_hw_busdma, OID_AUTO, total_bpages, CTLFLAG_RD, &total_bpages, 0,
117 "Total bounce pages");
120 struct bp_list bpages;
124 void *buf; /* unmapped buffer pointer */
125 bus_size_t buflen; /* unmapped buffer length */
126 bus_dmamap_callback_t *callback;
128 STAILQ_ENTRY(bus_dmamap) links;
131 static STAILQ_HEAD(, bus_dmamap) bounce_map_waitinglist;
132 static STAILQ_HEAD(, bus_dmamap) bounce_map_callbacklist;
133 static struct bus_dmamap nobounce_dmamap;
135 static void init_bounce_pages(void *dummy);
136 static int alloc_bounce_zone(bus_dma_tag_t dmat);
137 static int alloc_bounce_pages(bus_dma_tag_t dmat, u_int numpages);
138 static int reserve_bounce_pages(bus_dma_tag_t dmat, bus_dmamap_t map,
140 static bus_addr_t add_bounce_page(bus_dma_tag_t dmat, bus_dmamap_t map,
141 vm_offset_t vaddr, bus_size_t size);
142 static void free_bounce_page(bus_dma_tag_t dmat, struct bounce_page *bpage);
143 int run_filter(bus_dma_tag_t dmat, bus_addr_t paddr);
144 int _bus_dmamap_count_pages(bus_dma_tag_t dmat, bus_dmamap_t map, void *buf,
145 bus_size_t buflen, int flags);
149 #define pmap_kextract pmap_kextract_ma
153 * Return true if a match is made.
155 * To find a match walk the chain of bus_dma_tag_t's looking for 'paddr'.
157 * If paddr is within the bounds of the dma tag then call the filter callback
158 * to check for a match, if there is no filter callback then assume a match.
161 run_filter(bus_dma_tag_t dmat, bus_addr_t paddr)
168 if (((paddr > dmat->lowaddr && paddr <= dmat->highaddr)
169 || ((paddr & (dmat->alignment - 1)) != 0))
170 && (dmat->filter == NULL
171 || (*dmat->filter)(dmat->filterarg, paddr) != 0))
175 } while (retval == 0 && dmat != NULL);
180 * Convenience function for manipulating driver locks from busdma (during
181 * busdma_swi, for example). Drivers that don't provide their own locks
182 * should specify &Giant to dmat->lockfuncarg. Drivers that use their own
183 * non-mutex locking scheme don't have to use this at all.
186 busdma_lock_mutex(void *arg, bus_dma_lock_op_t op)
190 dmtx = (struct mtx *)arg;
199 panic("Unknown operation 0x%x for busdma_lock_mutex!", op);
204 * dflt_lock should never get called. It gets put into the dma tag when
205 * lockfunc == NULL, which is only valid if the maps that are associated
206 * with the tag are meant to never be defered.
207 * XXX Should have a way to identify which driver is responsible here.
210 dflt_lock(void *arg, bus_dma_lock_op_t op)
212 panic("driver error: busdma dflt_lock called");
216 * Allocate a device specific dma_tag.
219 bus_dma_tag_create(bus_dma_tag_t parent, bus_size_t alignment,
220 bus_size_t boundary, bus_addr_t lowaddr,
221 bus_addr_t highaddr, bus_dma_filter_t *filter,
222 void *filterarg, bus_size_t maxsize, int nsegments,
223 bus_size_t maxsegsz, int flags, bus_dma_lock_t *lockfunc,
224 void *lockfuncarg, bus_dma_tag_t *dmat)
226 bus_dma_tag_t newtag;
229 /* Basic sanity checking */
230 if (boundary != 0 && boundary < maxsegsz)
237 /* Return a NULL tag on failure */
240 newtag = (bus_dma_tag_t)malloc(sizeof(*newtag), M_DEVBUF,
242 if (newtag == NULL) {
243 CTR4(KTR_BUSDMA, "%s returned tag %p tag flags 0x%x error %d",
244 __func__, newtag, 0, error);
248 newtag->parent = parent;
249 newtag->alignment = alignment;
250 newtag->boundary = boundary;
251 newtag->lowaddr = trunc_page((vm_paddr_t)lowaddr) + (PAGE_SIZE - 1);
252 newtag->highaddr = trunc_page((vm_paddr_t)highaddr) +
254 newtag->filter = filter;
255 newtag->filterarg = filterarg;
256 newtag->maxsize = maxsize;
257 newtag->nsegments = nsegments;
258 newtag->maxsegsz = maxsegsz;
259 newtag->flags = flags;
260 newtag->ref_count = 1; /* Count ourself */
261 newtag->map_count = 0;
262 if (lockfunc != NULL) {
263 newtag->lockfunc = lockfunc;
264 newtag->lockfuncarg = lockfuncarg;
266 newtag->lockfunc = dflt_lock;
267 newtag->lockfuncarg = NULL;
269 newtag->segments = NULL;
271 /* Take into account any restrictions imposed by our parent tag */
272 if (parent != NULL) {
273 newtag->lowaddr = MIN(parent->lowaddr, newtag->lowaddr);
274 newtag->highaddr = MAX(parent->highaddr, newtag->highaddr);
275 if (newtag->boundary == 0)
276 newtag->boundary = parent->boundary;
277 else if (parent->boundary != 0)
278 newtag->boundary = MIN(parent->boundary,
280 if ((newtag->filter != NULL) ||
281 ((parent->flags & BUS_DMA_COULD_BOUNCE) != 0))
282 newtag->flags |= BUS_DMA_COULD_BOUNCE;
283 if (newtag->filter == NULL) {
285 * Short circuit looking at our parent directly
286 * since we have encapsulated all of its information
288 newtag->filter = parent->filter;
289 newtag->filterarg = parent->filterarg;
290 newtag->parent = parent->parent;
292 if (newtag->parent != NULL)
293 atomic_add_int(&parent->ref_count, 1);
296 if (newtag->lowaddr < ptoa((vm_paddr_t)Maxmem)
297 || newtag->alignment > 1)
298 newtag->flags |= BUS_DMA_COULD_BOUNCE;
300 if (((newtag->flags & BUS_DMA_COULD_BOUNCE) != 0) &&
301 (flags & BUS_DMA_ALLOCNOW) != 0) {
302 struct bounce_zone *bz;
306 if ((error = alloc_bounce_zone(newtag)) != 0) {
307 free(newtag, M_DEVBUF);
310 bz = newtag->bounce_zone;
312 if (ptoa(bz->total_bpages) < maxsize) {
315 pages = atop(maxsize) - bz->total_bpages;
317 /* Add pages to our bounce pool */
318 if (alloc_bounce_pages(newtag, pages) < pages)
321 /* Performed initial allocation */
322 newtag->flags |= BUS_DMA_MIN_ALLOC_COMP;
326 free(newtag, M_DEVBUF);
330 CTR4(KTR_BUSDMA, "%s returned tag %p tag flags 0x%x error %d",
331 __func__, newtag, (newtag != NULL ? newtag->flags : 0), error);
336 bus_dma_tag_destroy(bus_dma_tag_t dmat)
338 bus_dma_tag_t dmat_copy;
346 if (dmat->map_count != 0) {
351 while (dmat != NULL) {
352 bus_dma_tag_t parent;
354 parent = dmat->parent;
355 atomic_subtract_int(&dmat->ref_count, 1);
356 if (dmat->ref_count == 0) {
357 if (dmat->segments != NULL)
358 free(dmat->segments, M_DEVBUF);
359 free(dmat, M_DEVBUF);
361 * Last reference count, so
362 * release our reference
363 * count on our parent.
371 CTR3(KTR_BUSDMA, "%s tag %p error %d", __func__, dmat_copy, error);
376 * Allocate a handle for mapping from kva/uva/physical
377 * address space into bus device space.
380 bus_dmamap_create(bus_dma_tag_t dmat, int flags, bus_dmamap_t *mapp)
386 if (dmat->segments == NULL) {
387 dmat->segments = (bus_dma_segment_t *)malloc(
388 sizeof(bus_dma_segment_t) * dmat->nsegments, M_DEVBUF,
390 if (dmat->segments == NULL) {
391 CTR3(KTR_BUSDMA, "%s: tag %p error %d",
392 __func__, dmat, ENOMEM);
398 * Bouncing might be required if the driver asks for an active
399 * exclusion region, a data alignment that is stricter than 1, and/or
400 * an active address boundary.
402 if (dmat->flags & BUS_DMA_COULD_BOUNCE) {
405 struct bounce_zone *bz;
408 if (dmat->bounce_zone == NULL) {
409 if ((error = alloc_bounce_zone(dmat)) != 0)
412 bz = dmat->bounce_zone;
414 *mapp = (bus_dmamap_t)malloc(sizeof(**mapp), M_DEVBUF,
417 CTR3(KTR_BUSDMA, "%s: tag %p error %d",
418 __func__, dmat, ENOMEM);
422 /* Initialize the new map */
423 STAILQ_INIT(&((*mapp)->bpages));
426 * Attempt to add pages to our pool on a per-instance
427 * basis up to a sane limit.
429 if (dmat->alignment > 1)
430 maxpages = MAX_BPAGES;
432 maxpages = MIN(MAX_BPAGES, Maxmem -atop(dmat->lowaddr));
433 if ((dmat->flags & BUS_DMA_MIN_ALLOC_COMP) == 0
434 || (dmat->map_count > 0 && bz->total_bpages < maxpages)) {
437 pages = MAX(atop(dmat->maxsize), 1);
438 pages = MIN(maxpages - bz->total_bpages, pages);
439 pages = MAX(pages, 1);
440 if (alloc_bounce_pages(dmat, pages) < pages)
443 if ((dmat->flags & BUS_DMA_MIN_ALLOC_COMP) == 0) {
445 dmat->flags |= BUS_DMA_MIN_ALLOC_COMP;
455 CTR4(KTR_BUSDMA, "%s: tag %p tag flags 0x%x error %d",
456 __func__, dmat, dmat->flags, error);
461 * Destroy a handle for mapping from kva/uva/physical
462 * address space into bus device space.
465 bus_dmamap_destroy(bus_dma_tag_t dmat, bus_dmamap_t map)
467 if (map != NULL && map != &nobounce_dmamap) {
468 if (STAILQ_FIRST(&map->bpages) != NULL) {
469 CTR3(KTR_BUSDMA, "%s: tag %p error %d",
470 __func__, dmat, EBUSY);
476 CTR2(KTR_BUSDMA, "%s: tag %p error 0", __func__, dmat);
482 * Allocate a piece of memory that can be efficiently mapped into
483 * bus device space based on the constraints lited in the dma tag.
484 * A dmamap to for use with dmamap_load is also allocated.
487 bus_dmamem_alloc(bus_dma_tag_t dmat, void** vaddr, int flags,
492 if (flags & BUS_DMA_NOWAIT)
497 /* If we succeed, no mapping/bouncing will be required */
500 if (dmat->segments == NULL) {
501 dmat->segments = (bus_dma_segment_t *)malloc(
502 sizeof(bus_dma_segment_t) * dmat->nsegments, M_DEVBUF,
504 if (dmat->segments == NULL) {
505 CTR4(KTR_BUSDMA, "%s: tag %p tag flags 0x%x error %d",
506 __func__, dmat, dmat->flags, ENOMEM);
510 if (flags & BUS_DMA_ZERO)
515 * (dmat->alignment < dmat->maxsize) is just a quick hack; the exact
516 * alignment guarantees of malloc need to be nailed down, and the
517 * code below should be rewritten to take that into account.
519 * In the meantime, we'll warn the user if malloc gets it wrong.
521 if ((dmat->maxsize <= PAGE_SIZE) &&
522 (dmat->alignment < dmat->maxsize) &&
523 dmat->lowaddr >= ptoa((vm_paddr_t)Maxmem)) {
524 *vaddr = malloc(dmat->maxsize, M_DEVBUF, mflags);
527 * XXX Use Contigmalloc until it is merged into this facility
528 * and handles multi-seg allocations. Nobody is doing
529 * multi-seg allocations yet though.
530 * XXX Certain AGP hardware does.
532 *vaddr = contigmalloc(dmat->maxsize, M_DEVBUF, mflags,
533 0ul, dmat->lowaddr, dmat->alignment? dmat->alignment : 1ul,
536 if (*vaddr == NULL) {
537 CTR4(KTR_BUSDMA, "%s: tag %p tag flags 0x%x error %d",
538 __func__, dmat, dmat->flags, ENOMEM);
540 } else if ((uintptr_t)*vaddr & (dmat->alignment - 1)) {
541 printf("bus_dmamem_alloc failed to align memory properly.\n");
543 if (flags & BUS_DMA_NOCACHE)
544 pmap_change_attr((vm_offset_t)*vaddr, dmat->maxsize,
546 CTR4(KTR_BUSDMA, "%s: tag %p tag flags 0x%x error %d",
547 __func__, dmat, dmat->flags, 0);
552 * Free a piece of memory and it's allociated dmamap, that was allocated
553 * via bus_dmamem_alloc. Make the same choice for free/contigfree.
556 bus_dmamem_free(bus_dma_tag_t dmat, void *vaddr, bus_dmamap_t map)
559 * dmamem does not need to be bounced, so the map should be
563 panic("bus_dmamem_free: Invalid map freed\n");
564 pmap_change_attr((vm_offset_t)vaddr, dmat->maxsize, PAT_WRITE_BACK);
565 if ((dmat->maxsize <= PAGE_SIZE) &&
566 (dmat->alignment < dmat->maxsize) &&
567 dmat->lowaddr >= ptoa((vm_paddr_t)Maxmem))
568 free(vaddr, M_DEVBUF);
570 contigfree(vaddr, dmat->maxsize, M_DEVBUF);
572 CTR3(KTR_BUSDMA, "%s: tag %p flags 0x%x", __func__, dmat, dmat->flags);
576 _bus_dmamap_count_pages(bus_dma_tag_t dmat, bus_dmamap_t map, void *buf,
577 bus_size_t buflen, int flags)
580 vm_offset_t vendaddr;
583 if ((map != &nobounce_dmamap && map->pagesneeded == 0)) {
584 CTR4(KTR_BUSDMA, "lowaddr= %d Maxmem= %d, boundary= %d, "
585 "alignment= %d", dmat->lowaddr, ptoa((vm_paddr_t)Maxmem),
586 dmat->boundary, dmat->alignment);
587 CTR3(KTR_BUSDMA, "map= %p, nobouncemap= %p, pagesneeded= %d",
588 map, &nobounce_dmamap, map->pagesneeded);
590 * Count the number of bounce pages
591 * needed in order to complete this transfer
593 vaddr = (vm_offset_t)buf;
594 vendaddr = (vm_offset_t)buf + buflen;
596 while (vaddr < vendaddr) {
597 paddr = pmap_kextract(vaddr);
598 if (((dmat->flags & BUS_DMA_COULD_BOUNCE) != 0) &&
599 run_filter(dmat, paddr) != 0) {
602 vaddr += (PAGE_SIZE - ((vm_offset_t)vaddr & PAGE_MASK));
604 CTR1(KTR_BUSDMA, "pagesneeded= %d\n", map->pagesneeded);
607 /* Reserve Necessary Bounce Pages */
608 if (map->pagesneeded != 0) {
609 mtx_lock(&bounce_lock);
610 if (flags & BUS_DMA_NOWAIT) {
611 if (reserve_bounce_pages(dmat, map, 0) != 0) {
612 mtx_unlock(&bounce_lock);
616 if (reserve_bounce_pages(dmat, map, 1) != 0) {
617 /* Queue us for resources */
620 map->buflen = buflen;
621 STAILQ_INSERT_TAIL(&bounce_map_waitinglist,
623 mtx_unlock(&bounce_lock);
624 return (EINPROGRESS);
627 mtx_unlock(&bounce_lock);
634 * Utility function to load a linear buffer. lastaddrp holds state
635 * between invocations (for multiple-buffer loads). segp contains
636 * the starting segment on entrace, and the ending segment on exit.
637 * first indicates if this is the first invocation of this function.
640 _bus_dmamap_load_buffer(bus_dma_tag_t dmat,
642 void *buf, bus_size_t buflen,
645 bus_addr_t *lastaddrp,
646 bus_dma_segment_t *segs,
651 bus_addr_t curaddr, lastaddr, baddr, bmask;
656 map = &nobounce_dmamap;
658 if ((dmat->flags & BUS_DMA_COULD_BOUNCE) != 0) {
659 error = _bus_dmamap_count_pages(dmat, map, buf, buflen, flags);
664 vaddr = (vm_offset_t)buf;
665 lastaddr = *lastaddrp;
666 bmask = ~(dmat->boundary - 1);
668 for (seg = *segp; buflen > 0 ; ) {
670 * Get the physical address for this segment.
673 curaddr = pmap_extract(pmap, vaddr);
675 curaddr = pmap_kextract(vaddr);
678 * Compute the segment size, and adjust counts.
680 sgsize = PAGE_SIZE - ((u_long)curaddr & PAGE_MASK);
681 if (sgsize > dmat->maxsegsz)
682 sgsize = dmat->maxsegsz;
687 * Make sure we don't cross any boundaries.
689 if (dmat->boundary > 0) {
690 baddr = (curaddr + dmat->boundary) & bmask;
691 if (sgsize > (baddr - curaddr))
692 sgsize = (baddr - curaddr);
695 if (((dmat->flags & BUS_DMA_COULD_BOUNCE) != 0) &&
696 map->pagesneeded != 0 && run_filter(dmat, curaddr))
697 curaddr = add_bounce_page(dmat, map, vaddr, sgsize);
700 * Insert chunk into a segment, coalescing with
701 * previous segment if possible.
704 segs[seg].ds_addr = curaddr;
705 segs[seg].ds_len = sgsize;
708 if (curaddr == lastaddr &&
709 (segs[seg].ds_len + sgsize) <= dmat->maxsegsz &&
710 (dmat->boundary == 0 ||
711 (segs[seg].ds_addr & bmask) == (curaddr & bmask)))
712 segs[seg].ds_len += sgsize;
714 if (++seg >= dmat->nsegments)
716 segs[seg].ds_addr = curaddr;
717 segs[seg].ds_len = sgsize;
721 lastaddr = curaddr + sgsize;
727 *lastaddrp = lastaddr;
732 return (buflen != 0 ? EFBIG : 0); /* XXX better return value here? */
736 * Map the buffer buf into bus space using the dmamap map.
739 bus_dmamap_load(bus_dma_tag_t dmat, bus_dmamap_t map, void *buf,
740 bus_size_t buflen, bus_dmamap_callback_t *callback,
741 void *callback_arg, int flags)
743 bus_addr_t lastaddr = 0;
744 int error, nsegs = 0;
747 flags |= BUS_DMA_WAITOK;
748 map->callback = callback;
749 map->callback_arg = callback_arg;
752 error = _bus_dmamap_load_buffer(dmat, map, buf, buflen, NULL, flags,
753 &lastaddr, dmat->segments, &nsegs, 1);
755 CTR5(KTR_BUSDMA, "%s: tag %p tag flags 0x%x error %d nsegs %d",
756 __func__, dmat, dmat->flags, error, nsegs + 1);
758 if (error == EINPROGRESS) {
763 (*callback)(callback_arg, dmat->segments, 0, error);
765 (*callback)(callback_arg, dmat->segments, nsegs + 1, 0);
768 * Return ENOMEM to the caller so that it can pass it up the stack.
769 * This error only happens when NOWAIT is set, so deferal is disabled.
779 * Like _bus_dmamap_load(), but for mbufs.
782 _bus_dmamap_load_mbuf_sg(bus_dma_tag_t dmat, bus_dmamap_t map,
783 struct mbuf *m0, bus_dma_segment_t *segs, int *nsegs,
790 flags |= BUS_DMA_NOWAIT;
793 if (m0->m_pkthdr.len <= dmat->maxsize) {
795 bus_addr_t lastaddr = 0;
798 for (m = m0; m != NULL && error == 0; m = m->m_next) {
800 error = _bus_dmamap_load_buffer(dmat, map,
802 NULL, flags, &lastaddr,
811 /* XXX FIXME: Having to increment nsegs is really annoying */
813 CTR5(KTR_BUSDMA, "%s: tag %p tag flags 0x%x error %d nsegs %d",
814 __func__, dmat, dmat->flags, error, *nsegs);
819 bus_dmamap_load_mbuf(bus_dma_tag_t dmat, bus_dmamap_t map,
821 bus_dmamap_callback2_t *callback, void *callback_arg,
826 error = _bus_dmamap_load_mbuf_sg(dmat, map, m0, dmat->segments, &nsegs,
830 /* force "no valid mappings" in callback */
831 (*callback)(callback_arg, dmat->segments, 0, 0, error);
833 (*callback)(callback_arg, dmat->segments,
834 nsegs, m0->m_pkthdr.len, error);
836 CTR5(KTR_BUSDMA, "%s: tag %p tag flags 0x%x error %d nsegs %d",
837 __func__, dmat, dmat->flags, error, nsegs);
842 bus_dmamap_load_mbuf_sg(bus_dma_tag_t dmat, bus_dmamap_t map,
843 struct mbuf *m0, bus_dma_segment_t *segs, int *nsegs,
846 return (_bus_dmamap_load_mbuf_sg(dmat, map, m0, segs, nsegs, flags));
850 * Like _bus_dmamap_load(), but for uios.
853 bus_dmamap_load_uio(bus_dma_tag_t dmat, bus_dmamap_t map,
855 bus_dmamap_callback2_t *callback, void *callback_arg,
859 int nsegs, error, first, i;
864 flags |= BUS_DMA_NOWAIT;
865 resid = uio->uio_resid;
868 if (uio->uio_segflg == UIO_USERSPACE) {
869 KASSERT(uio->uio_td != NULL,
870 ("bus_dmamap_load_uio: USERSPACE but no proc"));
871 pmap = vmspace_pmap(uio->uio_td->td_proc->p_vmspace);
878 lastaddr = (bus_addr_t) 0;
879 for (i = 0; i < uio->uio_iovcnt && resid != 0 && !error; i++) {
881 * Now at the first iovec to load. Load each iovec
882 * until we have exhausted the residual count.
885 resid < iov[i].iov_len ? resid : iov[i].iov_len;
886 caddr_t addr = (caddr_t) iov[i].iov_base;
889 error = _bus_dmamap_load_buffer(dmat, map,
890 addr, minlen, pmap, flags, &lastaddr,
891 dmat->segments, &nsegs, first);
899 /* force "no valid mappings" in callback */
900 (*callback)(callback_arg, dmat->segments, 0, 0, error);
902 (*callback)(callback_arg, dmat->segments,
903 nsegs+1, uio->uio_resid, error);
905 CTR5(KTR_BUSDMA, "%s: tag %p tag flags 0x%x error %d nsegs %d",
906 __func__, dmat, dmat->flags, error, nsegs + 1);
911 * Release the mapping held by map.
914 _bus_dmamap_unload(bus_dma_tag_t dmat, bus_dmamap_t map)
916 struct bounce_page *bpage;
918 while ((bpage = STAILQ_FIRST(&map->bpages)) != NULL) {
919 STAILQ_REMOVE_HEAD(&map->bpages, links);
920 free_bounce_page(dmat, bpage);
925 _bus_dmamap_sync(bus_dma_tag_t dmat, bus_dmamap_t map, bus_dmasync_op_t op)
927 struct bounce_page *bpage;
929 if ((bpage = STAILQ_FIRST(&map->bpages)) != NULL) {
931 * Handle data bouncing. We might also
932 * want to add support for invalidating
933 * the caches on broken hardware
935 CTR4(KTR_BUSDMA, "%s: tag %p tag flags 0x%x op 0x%x "
936 "performing bounce", __func__, op, dmat, dmat->flags);
938 if (op & BUS_DMASYNC_PREWRITE) {
939 while (bpage != NULL) {
940 bcopy((void *)bpage->datavaddr,
941 (void *)bpage->vaddr,
943 bpage = STAILQ_NEXT(bpage, links);
945 dmat->bounce_zone->total_bounced++;
948 if (op & BUS_DMASYNC_POSTREAD) {
949 while (bpage != NULL) {
950 bcopy((void *)bpage->vaddr,
951 (void *)bpage->datavaddr,
953 bpage = STAILQ_NEXT(bpage, links);
955 dmat->bounce_zone->total_bounced++;
961 init_bounce_pages(void *dummy __unused)
965 STAILQ_INIT(&bounce_zone_list);
966 STAILQ_INIT(&bounce_map_waitinglist);
967 STAILQ_INIT(&bounce_map_callbacklist);
968 mtx_init(&bounce_lock, "bounce pages lock", NULL, MTX_DEF);
970 SYSINIT(bpages, SI_SUB_LOCK, SI_ORDER_ANY, init_bounce_pages, NULL);
972 static struct sysctl_ctx_list *
973 busdma_sysctl_tree(struct bounce_zone *bz)
975 return (&bz->sysctl_tree);
978 static struct sysctl_oid *
979 busdma_sysctl_tree_top(struct bounce_zone *bz)
981 return (bz->sysctl_tree_top);
985 alloc_bounce_zone(bus_dma_tag_t dmat)
987 struct bounce_zone *bz;
989 /* Check to see if we already have a suitable zone */
990 STAILQ_FOREACH(bz, &bounce_zone_list, links) {
991 if ((dmat->alignment <= bz->alignment)
992 && (dmat->boundary <= bz->boundary)
993 && (dmat->lowaddr >= bz->lowaddr)) {
994 dmat->bounce_zone = bz;
999 if ((bz = (struct bounce_zone *)malloc(sizeof(*bz), M_DEVBUF,
1000 M_NOWAIT | M_ZERO)) == NULL)
1003 STAILQ_INIT(&bz->bounce_page_list);
1004 bz->free_bpages = 0;
1005 bz->reserved_bpages = 0;
1006 bz->active_bpages = 0;
1007 bz->lowaddr = dmat->lowaddr;
1008 bz->alignment = dmat->alignment;
1009 bz->boundary = dmat->boundary;
1010 snprintf(bz->zoneid, 8, "zone%d", busdma_zonecount);
1012 snprintf(bz->lowaddrid, 18, "%#jx", (uintmax_t)bz->lowaddr);
1013 STAILQ_INSERT_TAIL(&bounce_zone_list, bz, links);
1014 dmat->bounce_zone = bz;
1016 sysctl_ctx_init(&bz->sysctl_tree);
1017 bz->sysctl_tree_top = SYSCTL_ADD_NODE(&bz->sysctl_tree,
1018 SYSCTL_STATIC_CHILDREN(_hw_busdma), OID_AUTO, bz->zoneid,
1020 if (bz->sysctl_tree_top == NULL) {
1021 sysctl_ctx_free(&bz->sysctl_tree);
1022 return (0); /* XXX error code? */
1025 SYSCTL_ADD_INT(busdma_sysctl_tree(bz),
1026 SYSCTL_CHILDREN(busdma_sysctl_tree_top(bz)), OID_AUTO,
1027 "total_bpages", CTLFLAG_RD, &bz->total_bpages, 0,
1028 "Total bounce pages");
1029 SYSCTL_ADD_INT(busdma_sysctl_tree(bz),
1030 SYSCTL_CHILDREN(busdma_sysctl_tree_top(bz)), OID_AUTO,
1031 "free_bpages", CTLFLAG_RD, &bz->free_bpages, 0,
1032 "Free bounce pages");
1033 SYSCTL_ADD_INT(busdma_sysctl_tree(bz),
1034 SYSCTL_CHILDREN(busdma_sysctl_tree_top(bz)), OID_AUTO,
1035 "reserved_bpages", CTLFLAG_RD, &bz->reserved_bpages, 0,
1036 "Reserved bounce pages");
1037 SYSCTL_ADD_INT(busdma_sysctl_tree(bz),
1038 SYSCTL_CHILDREN(busdma_sysctl_tree_top(bz)), OID_AUTO,
1039 "active_bpages", CTLFLAG_RD, &bz->active_bpages, 0,
1040 "Active bounce pages");
1041 SYSCTL_ADD_INT(busdma_sysctl_tree(bz),
1042 SYSCTL_CHILDREN(busdma_sysctl_tree_top(bz)), OID_AUTO,
1043 "total_bounced", CTLFLAG_RD, &bz->total_bounced, 0,
1044 "Total bounce requests");
1045 SYSCTL_ADD_INT(busdma_sysctl_tree(bz),
1046 SYSCTL_CHILDREN(busdma_sysctl_tree_top(bz)), OID_AUTO,
1047 "total_deferred", CTLFLAG_RD, &bz->total_deferred, 0,
1048 "Total bounce requests that were deferred");
1049 SYSCTL_ADD_STRING(busdma_sysctl_tree(bz),
1050 SYSCTL_CHILDREN(busdma_sysctl_tree_top(bz)), OID_AUTO,
1051 "lowaddr", CTLFLAG_RD, bz->lowaddrid, 0, "");
1052 SYSCTL_ADD_INT(busdma_sysctl_tree(bz),
1053 SYSCTL_CHILDREN(busdma_sysctl_tree_top(bz)), OID_AUTO,
1054 "alignment", CTLFLAG_RD, &bz->alignment, 0, "");
1055 SYSCTL_ADD_INT(busdma_sysctl_tree(bz),
1056 SYSCTL_CHILDREN(busdma_sysctl_tree_top(bz)), OID_AUTO,
1057 "boundary", CTLFLAG_RD, &bz->boundary, 0, "");
1063 alloc_bounce_pages(bus_dma_tag_t dmat, u_int numpages)
1065 struct bounce_zone *bz;
1068 bz = dmat->bounce_zone;
1070 while (numpages > 0) {
1071 struct bounce_page *bpage;
1073 bpage = (struct bounce_page *)malloc(sizeof(*bpage), M_DEVBUF,
1078 bpage->vaddr = (vm_offset_t)contigmalloc(PAGE_SIZE, M_DEVBUF,
1083 if (bpage->vaddr == 0) {
1084 free(bpage, M_DEVBUF);
1087 bpage->busaddr = pmap_kextract(bpage->vaddr);
1088 mtx_lock(&bounce_lock);
1089 STAILQ_INSERT_TAIL(&bz->bounce_page_list, bpage, links);
1093 mtx_unlock(&bounce_lock);
1101 reserve_bounce_pages(bus_dma_tag_t dmat, bus_dmamap_t map, int commit)
1103 struct bounce_zone *bz;
1106 mtx_assert(&bounce_lock, MA_OWNED);
1107 bz = dmat->bounce_zone;
1108 pages = MIN(bz->free_bpages, map->pagesneeded - map->pagesreserved);
1109 if (commit == 0 && map->pagesneeded > (map->pagesreserved + pages))
1110 return (map->pagesneeded - (map->pagesreserved + pages));
1111 bz->free_bpages -= pages;
1112 bz->reserved_bpages += pages;
1113 map->pagesreserved += pages;
1114 pages = map->pagesneeded - map->pagesreserved;
1120 add_bounce_page(bus_dma_tag_t dmat, bus_dmamap_t map, vm_offset_t vaddr,
1123 struct bounce_zone *bz;
1124 struct bounce_page *bpage;
1126 KASSERT(dmat->bounce_zone != NULL, ("no bounce zone in dma tag"));
1127 KASSERT(map != NULL && map != &nobounce_dmamap,
1128 ("add_bounce_page: bad map %p", map));
1130 bz = dmat->bounce_zone;
1131 if (map->pagesneeded == 0)
1132 panic("add_bounce_page: map doesn't need any pages");
1135 if (map->pagesreserved == 0)
1136 panic("add_bounce_page: map doesn't need any pages");
1137 map->pagesreserved--;
1139 mtx_lock(&bounce_lock);
1140 bpage = STAILQ_FIRST(&bz->bounce_page_list);
1142 panic("add_bounce_page: free page list is empty");
1144 STAILQ_REMOVE_HEAD(&bz->bounce_page_list, links);
1145 bz->reserved_bpages--;
1146 bz->active_bpages++;
1147 mtx_unlock(&bounce_lock);
1149 bpage->datavaddr = vaddr;
1150 bpage->datacount = size;
1151 STAILQ_INSERT_TAIL(&(map->bpages), bpage, links);
1152 return (bpage->busaddr);
1156 free_bounce_page(bus_dma_tag_t dmat, struct bounce_page *bpage)
1158 struct bus_dmamap *map;
1159 struct bounce_zone *bz;
1161 bz = dmat->bounce_zone;
1162 bpage->datavaddr = 0;
1163 bpage->datacount = 0;
1165 mtx_lock(&bounce_lock);
1166 STAILQ_INSERT_HEAD(&bz->bounce_page_list, bpage, links);
1168 bz->active_bpages--;
1169 if ((map = STAILQ_FIRST(&bounce_map_waitinglist)) != NULL) {
1170 if (reserve_bounce_pages(map->dmat, map, 1) == 0) {
1171 STAILQ_REMOVE_HEAD(&bounce_map_waitinglist, links);
1172 STAILQ_INSERT_TAIL(&bounce_map_callbacklist,
1174 busdma_swi_pending = 1;
1175 bz->total_deferred++;
1176 swi_sched(vm_ih, 0);
1179 mtx_unlock(&bounce_lock);
1186 struct bus_dmamap *map;
1188 mtx_lock(&bounce_lock);
1189 while ((map = STAILQ_FIRST(&bounce_map_callbacklist)) != NULL) {
1190 STAILQ_REMOVE_HEAD(&bounce_map_callbacklist, links);
1191 mtx_unlock(&bounce_lock);
1193 (dmat->lockfunc)(dmat->lockfuncarg, BUS_DMA_LOCK);
1194 bus_dmamap_load(map->dmat, map, map->buf, map->buflen,
1195 map->callback, map->callback_arg, /*flags*/0);
1196 (dmat->lockfunc)(dmat->lockfuncarg, BUS_DMA_UNLOCK);
1197 mtx_lock(&bounce_lock);
1199 mtx_unlock(&bounce_lock);