1 /*-
2 * Copyright (c) 1997, 1998 Justin T. Gibbs.
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
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.
13 *
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
24 * SUCH DAMAGE.
25 */
26
27 #include <sys/cdefs.h>
28 __FBSDID("$FreeBSD: releng/8.0/sys/amd64/amd64/busdma_machdep.c 191438 2009-04-23 20:24:19Z jhb $");
29
30 #include <sys/param.h>
31 #include <sys/systm.h>
32 #include <sys/malloc.h>
33 #include <sys/bus.h>
34 #include <sys/interrupt.h>
35 #include <sys/kernel.h>
36 #include <sys/ktr.h>
37 #include <sys/lock.h>
38 #include <sys/proc.h>
39 #include <sys/mutex.h>
40 #include <sys/mbuf.h>
41 #include <sys/uio.h>
42 #include <sys/sysctl.h>
43
44 #include <vm/vm.h>
45 #include <vm/vm_page.h>
46 #include <vm/vm_map.h>
47
48 #include <machine/atomic.h>
49 #include <machine/bus.h>
50 #include <machine/md_var.h>
51 #include <machine/specialreg.h>
52
53 #define MAX_BPAGES 8192
54
55 struct bounce_zone;
56
57 struct bus_dma_tag {
58 bus_dma_tag_t parent;
59 bus_size_t alignment;
60 bus_size_t boundary;
61 bus_addr_t lowaddr;
62 bus_addr_t highaddr;
63 bus_dma_filter_t *filter;
64 void *filterarg;
65 bus_size_t maxsize;
66 u_int nsegments;
67 bus_size_t maxsegsz;
68 int flags;
69 int ref_count;
70 int map_count;
71 bus_dma_lock_t *lockfunc;
72 void *lockfuncarg;
73 bus_dma_segment_t *segments;
74 struct bounce_zone *bounce_zone;
75 };
76
77 struct bounce_page {
78 vm_offset_t vaddr; /* kva of bounce buffer */
79 bus_addr_t busaddr; /* Physical address */
80 vm_offset_t datavaddr; /* kva of client data */
81 bus_size_t datacount; /* client data count */
82 STAILQ_ENTRY(bounce_page) links;
83 };
84
85 int busdma_swi_pending;
86
87 struct bounce_zone {
88 STAILQ_ENTRY(bounce_zone) links;
89 STAILQ_HEAD(bp_list, bounce_page) bounce_page_list;
90 int total_bpages;
91 int free_bpages;
92 int reserved_bpages;
93 int active_bpages;
94 int total_bounced;
95 int total_deferred;
96 int map_count;
97 bus_size_t alignment;
98 bus_addr_t lowaddr;
99 char zoneid[8];
100 char lowaddrid[20];
101 struct sysctl_ctx_list sysctl_tree;
102 struct sysctl_oid *sysctl_tree_top;
103 };
104
105 static struct mtx bounce_lock;
106 static int total_bpages;
107 static int busdma_zonecount;
108 static STAILQ_HEAD(, bounce_zone) bounce_zone_list;
109
110 SYSCTL_NODE(_hw, OID_AUTO, busdma, CTLFLAG_RD, 0, "Busdma parameters");
111 SYSCTL_INT(_hw_busdma, OID_AUTO, total_bpages, CTLFLAG_RD, &total_bpages, 0,
112 "Total bounce pages");
113
114 struct bus_dmamap {
115 struct bp_list bpages;
116 int pagesneeded;
117 int pagesreserved;
118 bus_dma_tag_t dmat;
119 void *buf; /* unmapped buffer pointer */
120 bus_size_t buflen; /* unmapped buffer length */
121 bus_dmamap_callback_t *callback;
122 void *callback_arg;
123 STAILQ_ENTRY(bus_dmamap) links;
124 };
125
126 static STAILQ_HEAD(, bus_dmamap) bounce_map_waitinglist;
127 static STAILQ_HEAD(, bus_dmamap) bounce_map_callbacklist;
128 static struct bus_dmamap nobounce_dmamap;
129
130 static void init_bounce_pages(void *dummy);
131 static int alloc_bounce_zone(bus_dma_tag_t dmat);
132 static int alloc_bounce_pages(bus_dma_tag_t dmat, u_int numpages);
133 static int reserve_bounce_pages(bus_dma_tag_t dmat, bus_dmamap_t map,
134 int commit);
135 static bus_addr_t add_bounce_page(bus_dma_tag_t dmat, bus_dmamap_t map,
136 vm_offset_t vaddr, bus_size_t size);
137 static void free_bounce_page(bus_dma_tag_t dmat, struct bounce_page *bpage);
138 static __inline int run_filter(bus_dma_tag_t dmat, bus_addr_t paddr);
139
140 /*
141 * Return true if a match is made.
142 *
143 * To find a match walk the chain of bus_dma_tag_t's looking for 'paddr'.
144 *
145 * If paddr is within the bounds of the dma tag then call the filter callback
146 * to check for a match, if there is no filter callback then assume a match.
147 */
148 static __inline int
149 run_filter(bus_dma_tag_t dmat, bus_addr_t paddr)
150 {
151 int retval;
152
153 retval = 0;
154
155 do {
156 if (((paddr > dmat->lowaddr && paddr <= dmat->highaddr)
157 || ((paddr & (dmat->alignment - 1)) != 0))
158 && (dmat->filter == NULL
159 || (*dmat->filter)(dmat->filterarg, paddr) != 0))
160 retval = 1;
161
162 dmat = dmat->parent;
163 } while (retval == 0 && dmat != NULL);
164 return (retval);
165 }
166
167 /*
168 * Convenience function for manipulating driver locks from busdma (during
169 * busdma_swi, for example). Drivers that don't provide their own locks
170 * should specify &Giant to dmat->lockfuncarg. Drivers that use their own
171 * non-mutex locking scheme don't have to use this at all.
172 */
173 void
174 busdma_lock_mutex(void *arg, bus_dma_lock_op_t op)
175 {
176 struct mtx *dmtx;
177
178 dmtx = (struct mtx *)arg;
179 switch (op) {
180 case BUS_DMA_LOCK:
181 mtx_lock(dmtx);
182 break;
183 case BUS_DMA_UNLOCK:
184 mtx_unlock(dmtx);
185 break;
186 default:
187 panic("Unknown operation 0x%x for busdma_lock_mutex!", op);
188 }
189 }
190
191 /*
192 * dflt_lock should never get called. It gets put into the dma tag when
193 * lockfunc == NULL, which is only valid if the maps that are associated
194 * with the tag are meant to never be defered.
195 * XXX Should have a way to identify which driver is responsible here.
196 */
197 static void
198 dflt_lock(void *arg, bus_dma_lock_op_t op)
199 {
200 panic("driver error: busdma dflt_lock called");
201 }
202
203 #define BUS_DMA_COULD_BOUNCE BUS_DMA_BUS3
204 #define BUS_DMA_MIN_ALLOC_COMP BUS_DMA_BUS4
205 /*
206 * Allocate a device specific dma_tag.
207 */
208 int
209 bus_dma_tag_create(bus_dma_tag_t parent, bus_size_t alignment,
210 bus_size_t boundary, bus_addr_t lowaddr,
211 bus_addr_t highaddr, bus_dma_filter_t *filter,
212 void *filterarg, bus_size_t maxsize, int nsegments,
213 bus_size_t maxsegsz, int flags, bus_dma_lock_t *lockfunc,
214 void *lockfuncarg, bus_dma_tag_t *dmat)
215 {
216 bus_dma_tag_t newtag;
217 int error = 0;
218
219 /* Basic sanity checking */
220 if (boundary != 0 && boundary < maxsegsz)
221 maxsegsz = boundary;
222
223 if (maxsegsz == 0) {
224 return (EINVAL);
225 }
226
227 /* Return a NULL tag on failure */
228 *dmat = NULL;
229
230 newtag = (bus_dma_tag_t)malloc(sizeof(*newtag), M_DEVBUF,
231 M_ZERO | M_NOWAIT);
232 if (newtag == NULL) {
233 CTR4(KTR_BUSDMA, "%s returned tag %p tag flags 0x%x error %d",
234 __func__, newtag, 0, error);
235 return (ENOMEM);
236 }
237
238 newtag->parent = parent;
239 newtag->alignment = alignment;
240 newtag->boundary = boundary;
241 newtag->lowaddr = trunc_page((vm_paddr_t)lowaddr) + (PAGE_SIZE - 1);
242 newtag->highaddr = trunc_page((vm_paddr_t)highaddr) +
243 (PAGE_SIZE - 1);
244 newtag->filter = filter;
245 newtag->filterarg = filterarg;
246 newtag->maxsize = maxsize;
247 newtag->nsegments = nsegments;
248 newtag->maxsegsz = maxsegsz;
249 newtag->flags = flags;
250 newtag->ref_count = 1; /* Count ourself */
251 newtag->map_count = 0;
252 if (lockfunc != NULL) {
253 newtag->lockfunc = lockfunc;
254 newtag->lockfuncarg = lockfuncarg;
255 } else {
256 newtag->lockfunc = dflt_lock;
257 newtag->lockfuncarg = NULL;
258 }
259 newtag->segments = NULL;
260
261 /* Take into account any restrictions imposed by our parent tag */
262 if (parent != NULL) {
263 newtag->lowaddr = MIN(parent->lowaddr, newtag->lowaddr);
264 newtag->highaddr = MAX(parent->highaddr, newtag->highaddr);
265 if (newtag->boundary == 0)
266 newtag->boundary = parent->boundary;
267 else if (parent->boundary != 0)
268 newtag->boundary = MIN(parent->boundary,
269 newtag->boundary);
270 if (newtag->filter == NULL) {
271 /*
272 * Short circuit looking at our parent directly
273 * since we have encapsulated all of its information
274 */
275 newtag->filter = parent->filter;
276 newtag->filterarg = parent->filterarg;
277 newtag->parent = parent->parent;
278 }
279 if (newtag->parent != NULL)
280 atomic_add_int(&parent->ref_count, 1);
281 }
282
283 if (newtag->lowaddr < ptoa((vm_paddr_t)Maxmem)
284 || newtag->alignment > 1)
285 newtag->flags |= BUS_DMA_COULD_BOUNCE;
286
287 if (((newtag->flags & BUS_DMA_COULD_BOUNCE) != 0) &&
288 (flags & BUS_DMA_ALLOCNOW) != 0) {
289 struct bounce_zone *bz;
290
291 /* Must bounce */
292
293 if ((error = alloc_bounce_zone(newtag)) != 0) {
294 free(newtag, M_DEVBUF);
295 return (error);
296 }
297 bz = newtag->bounce_zone;
298
299 if (ptoa(bz->total_bpages) < maxsize) {
300 int pages;
301
302 pages = atop(maxsize) - bz->total_bpages;
303
304 /* Add pages to our bounce pool */
305 if (alloc_bounce_pages(newtag, pages) < pages)
306 error = ENOMEM;
307 }
308 /* Performed initial allocation */
309 newtag->flags |= BUS_DMA_MIN_ALLOC_COMP;
310 }
311
312 if (error != 0) {
313 free(newtag, M_DEVBUF);
314 } else {
315 *dmat = newtag;
316 }
317 CTR4(KTR_BUSDMA, "%s returned tag %p tag flags 0x%x error %d",
318 __func__, newtag, (newtag != NULL ? newtag->flags : 0), error);
319 return (error);
320 }
321
322 int
323 bus_dma_tag_destroy(bus_dma_tag_t dmat)
324 {
325 bus_dma_tag_t dmat_copy;
326 int error;
327
328 error = 0;
329 dmat_copy = dmat;
330
331 if (dmat != NULL) {
332
333 if (dmat->map_count != 0) {
334 error = EBUSY;
335 goto out;
336 }
337
338 while (dmat != NULL) {
339 bus_dma_tag_t parent;
340
341 parent = dmat->parent;
342 atomic_subtract_int(&dmat->ref_count, 1);
343 if (dmat->ref_count == 0) {
344 if (dmat->segments != NULL)
345 free(dmat->segments, M_DEVBUF);
346 free(dmat, M_DEVBUF);
347 /*
348 * Last reference count, so
349 * release our reference
350 * count on our parent.
351 */
352 dmat = parent;
353 } else
354 dmat = NULL;
355 }
356 }
357 out:
358 CTR3(KTR_BUSDMA, "%s tag %p error %d", __func__, dmat_copy, error);
359 return (error);
360 }
361
362 /*
363 * Allocate a handle for mapping from kva/uva/physical
364 * address space into bus device space.
365 */
366 int
367 bus_dmamap_create(bus_dma_tag_t dmat, int flags, bus_dmamap_t *mapp)
368 {
369 int error;
370
371 error = 0;
372
373 if (dmat->segments == NULL) {
374 dmat->segments = (bus_dma_segment_t *)malloc(
375 sizeof(bus_dma_segment_t) * dmat->nsegments, M_DEVBUF,
376 M_NOWAIT);
377 if (dmat->segments == NULL) {
378 CTR3(KTR_BUSDMA, "%s: tag %p error %d",
379 __func__, dmat, ENOMEM);
380 return (ENOMEM);
381 }
382 }
383
384 /*
385 * Bouncing might be required if the driver asks for an active
386 * exclusion region, a data alignment that is stricter than 1, and/or
387 * an active address boundary.
388 */
389 if (dmat->flags & BUS_DMA_COULD_BOUNCE) {
390
391 /* Must bounce */
392 struct bounce_zone *bz;
393 int maxpages;
394
395 if (dmat->bounce_zone == NULL) {
396 if ((error = alloc_bounce_zone(dmat)) != 0)
397 return (error);
398 }
399 bz = dmat->bounce_zone;
400
401 *mapp = (bus_dmamap_t)malloc(sizeof(**mapp), M_DEVBUF,
402 M_NOWAIT | M_ZERO);
403 if (*mapp == NULL) {
404 CTR3(KTR_BUSDMA, "%s: tag %p error %d",
405 __func__, dmat, ENOMEM);
406 return (ENOMEM);
407 }
408
409 /* Initialize the new map */
410 STAILQ_INIT(&((*mapp)->bpages));
411
412 /*
413 * Attempt to add pages to our pool on a per-instance
414 * basis up to a sane limit.
415 */
416 if (dmat->alignment > 1)
417 maxpages = MAX_BPAGES;
418 else
419 maxpages = MIN(MAX_BPAGES, Maxmem -atop(dmat->lowaddr));
420 if ((dmat->flags & BUS_DMA_MIN_ALLOC_COMP) == 0
421 || (bz->map_count > 0 && bz->total_bpages < maxpages)) {
422 int pages;
423
424 pages = MAX(atop(dmat->maxsize), 1);
425 pages = MIN(maxpages - bz->total_bpages, pages);
426 pages = MAX(pages, 1);
427 if (alloc_bounce_pages(dmat, pages) < pages)
428 error = ENOMEM;
429
430 if ((dmat->flags & BUS_DMA_MIN_ALLOC_COMP) == 0) {
431 if (error == 0)
432 dmat->flags |= BUS_DMA_MIN_ALLOC_COMP;
433 } else {
434 error = 0;
435 }
436 }
437 bz->map_count++;
438 } else {
439 *mapp = NULL;
440 }
441 if (error == 0)
442 dmat->map_count++;
443 CTR4(KTR_BUSDMA, "%s: tag %p tag flags 0x%x error %d",
444 __func__, dmat, dmat->flags, error);
445 return (error);
446 }
447
448 /*
449 * Destroy a handle for mapping from kva/uva/physical
450 * address space into bus device space.
451 */
452 int
453 bus_dmamap_destroy(bus_dma_tag_t dmat, bus_dmamap_t map)
454 {
455 if (map != NULL && map != &nobounce_dmamap) {
456 if (STAILQ_FIRST(&map->bpages) != NULL) {
457 CTR3(KTR_BUSDMA, "%s: tag %p error %d",
458 __func__, dmat, EBUSY);
459 return (EBUSY);
460 }
461 if (dmat->bounce_zone)
462 dmat->bounce_zone->map_count--;
463 free(map, M_DEVBUF);
464 }
465 dmat->map_count--;
466 CTR2(KTR_BUSDMA, "%s: tag %p error 0", __func__, dmat);
467 return (0);
468 }
469
470
471 /*
472 * Allocate a piece of memory that can be efficiently mapped into
473 * bus device space based on the constraints lited in the dma tag.
474 * A dmamap to for use with dmamap_load is also allocated.
475 */
476 int
477 bus_dmamem_alloc(bus_dma_tag_t dmat, void** vaddr, int flags,
478 bus_dmamap_t *mapp)
479 {
480 int mflags;
481
482 if (flags & BUS_DMA_NOWAIT)
483 mflags = M_NOWAIT;
484 else
485 mflags = M_WAITOK;
486
487 /* If we succeed, no mapping/bouncing will be required */
488 *mapp = NULL;
489
490 if (dmat->segments == NULL) {
491 dmat->segments = (bus_dma_segment_t *)malloc(
492 sizeof(bus_dma_segment_t) * dmat->nsegments, M_DEVBUF,
493 mflags);
494 if (dmat->segments == NULL) {
495 CTR4(KTR_BUSDMA, "%s: tag %p tag flags 0x%x error %d",
496 __func__, dmat, dmat->flags, ENOMEM);
497 return (ENOMEM);
498 }
499 }
500 if (flags & BUS_DMA_ZERO)
501 mflags |= M_ZERO;
502
503 /*
504 * XXX:
505 * (dmat->alignment < dmat->maxsize) is just a quick hack; the exact
506 * alignment guarantees of malloc need to be nailed down, and the
507 * code below should be rewritten to take that into account.
508 *
509 * In the meantime, we'll warn the user if malloc gets it wrong.
510 */
511 if ((dmat->maxsize <= PAGE_SIZE) &&
512 (dmat->alignment < dmat->maxsize) &&
513 dmat->lowaddr >= ptoa((vm_paddr_t)Maxmem)) {
514 *vaddr = malloc(dmat->maxsize, M_DEVBUF, mflags);
515 } else {
516 /*
517 * XXX Use Contigmalloc until it is merged into this facility
518 * and handles multi-seg allocations. Nobody is doing
519 * multi-seg allocations yet though.
520 * XXX Certain AGP hardware does.
521 */
522 *vaddr = contigmalloc(dmat->maxsize, M_DEVBUF, mflags,
523 0ul, dmat->lowaddr, dmat->alignment? dmat->alignment : 1ul,
524 dmat->boundary);
525 }
526 if (*vaddr == NULL) {
527 CTR4(KTR_BUSDMA, "%s: tag %p tag flags 0x%x error %d",
528 __func__, dmat, dmat->flags, ENOMEM);
529 return (ENOMEM);
530 } else if ((uintptr_t)*vaddr & (dmat->alignment - 1)) {
531 printf("bus_dmamem_alloc failed to align memory properly.\n");
532 }
533 if (flags & BUS_DMA_NOCACHE)
534 pmap_change_attr((vm_offset_t)*vaddr, dmat->maxsize,
535 PAT_UNCACHEABLE);
536 CTR4(KTR_BUSDMA, "%s: tag %p tag flags 0x%x error %d",
537 __func__, dmat, dmat->flags, 0);
538 return (0);
539 }
540
541 /*
542 * Free a piece of memory and it's allociated dmamap, that was allocated
543 * via bus_dmamem_alloc. Make the same choice for free/contigfree.
544 */
545 void
546 bus_dmamem_free(bus_dma_tag_t dmat, void *vaddr, bus_dmamap_t map)
547 {
548 /*
549 * dmamem does not need to be bounced, so the map should be
550 * NULL
551 */
552 if (map != NULL)
553 panic("bus_dmamem_free: Invalid map freed\n");
554 pmap_change_attr((vm_offset_t)vaddr, dmat->maxsize, PAT_WRITE_BACK);
555 if ((dmat->maxsize <= PAGE_SIZE) &&
556 (dmat->alignment < dmat->maxsize) &&
557 dmat->lowaddr >= ptoa((vm_paddr_t)Maxmem))
558 free(vaddr, M_DEVBUF);
559 else {
560 contigfree(vaddr, dmat->maxsize, M_DEVBUF);
561 }
562 CTR3(KTR_BUSDMA, "%s: tag %p flags 0x%x", __func__, dmat, dmat->flags);
563 }
564
565 /*
566 * Utility function to load a linear buffer. lastaddrp holds state
567 * between invocations (for multiple-buffer loads). segp contains
568 * the starting segment on entrace, and the ending segment on exit.
569 * first indicates if this is the first invocation of this function.
570 */
571 static __inline int
572 _bus_dmamap_load_buffer(bus_dma_tag_t dmat,
573 bus_dmamap_t map,
574 void *buf, bus_size_t buflen,
575 pmap_t pmap,
576 int flags,
577 bus_addr_t *lastaddrp,
578 bus_dma_segment_t *segs,
579 int *segp,
580 int first)
581 {
582 bus_size_t sgsize;
583 bus_addr_t curaddr, lastaddr, baddr, bmask;
584 vm_offset_t vaddr;
585 bus_addr_t paddr;
586 int seg;
587
588 if (map == NULL)
589 map = &nobounce_dmamap;
590
591 if ((map != &nobounce_dmamap && map->pagesneeded == 0)
592 && ((dmat->flags & BUS_DMA_COULD_BOUNCE) != 0)) {
593 vm_offset_t vendaddr;
594
595 CTR4(KTR_BUSDMA, "lowaddr= %d Maxmem= %d, boundary= %d, "
596 "alignment= %d", dmat->lowaddr, ptoa((vm_paddr_t)Maxmem),
597 dmat->boundary, dmat->alignment);
598 CTR3(KTR_BUSDMA, "map= %p, nobouncemap= %p, pagesneeded= %d",
599 map, &nobounce_dmamap, map->pagesneeded);
600 /*
601 * Count the number of bounce pages
602 * needed in order to complete this transfer
603 */
604 vaddr = (vm_offset_t)buf;
605 vendaddr = (vm_offset_t)buf + buflen;
606
607 while (vaddr < vendaddr) {
608 if (pmap)
609 paddr = pmap_extract(pmap, vaddr);
610 else
611 paddr = pmap_kextract(vaddr);
612 if (run_filter(dmat, paddr) != 0)
613 map->pagesneeded++;
614 vaddr += (PAGE_SIZE - ((vm_offset_t)vaddr & PAGE_MASK));
615 }
616 CTR1(KTR_BUSDMA, "pagesneeded= %d\n", map->pagesneeded);
617 }
618
619 /* Reserve Necessary Bounce Pages */
620 if (map->pagesneeded != 0) {
621 mtx_lock(&bounce_lock);
622 if (flags & BUS_DMA_NOWAIT) {
623 if (reserve_bounce_pages(dmat, map, 0) != 0) {
624 mtx_unlock(&bounce_lock);
625 return (ENOMEM);
626 }
627 } else {
628 if (reserve_bounce_pages(dmat, map, 1) != 0) {
629 /* Queue us for resources */
630 map->dmat = dmat;
631 map->buf = buf;
632 map->buflen = buflen;
633 STAILQ_INSERT_TAIL(&bounce_map_waitinglist,
634 map, links);
635 mtx_unlock(&bounce_lock);
636 return (EINPROGRESS);
637 }
638 }
639 mtx_unlock(&bounce_lock);
640 }
641
642 vaddr = (vm_offset_t)buf;
643 lastaddr = *lastaddrp;
644 bmask = ~(dmat->boundary - 1);
645
646 for (seg = *segp; buflen > 0 ; ) {
647 /*
648 * Get the physical address for this segment.
649 */
650 if (pmap)
651 curaddr = pmap_extract(pmap, vaddr);
652 else
653 curaddr = pmap_kextract(vaddr);
654
655 /*
656 * Compute the segment size, and adjust counts.
657 */
658 sgsize = PAGE_SIZE - ((u_long)curaddr & PAGE_MASK);
659 if (sgsize > dmat->maxsegsz)
660 sgsize = dmat->maxsegsz;
661 if (buflen < sgsize)
662 sgsize = buflen;
663
664 /*
665 * Make sure we don't cross any boundaries.
666 */
667 if (dmat->boundary > 0) {
668 baddr = (curaddr + dmat->boundary) & bmask;
669 if (sgsize > (baddr - curaddr))
670 sgsize = (baddr - curaddr);
671 }
672
673 if (map->pagesneeded != 0 && run_filter(dmat, curaddr))
674 curaddr = add_bounce_page(dmat, map, vaddr, sgsize);
675
676 /*
677 * Insert chunk into a segment, coalescing with
678 * previous segment if possible.
679 */
680 if (first) {
681 segs[seg].ds_addr = curaddr;
682 segs[seg].ds_len = sgsize;
683 first = 0;
684 } else {
685 if (curaddr == lastaddr &&
686 (segs[seg].ds_len + sgsize) <= dmat->maxsegsz &&
687 (dmat->boundary == 0 ||
688 (segs[seg].ds_addr & bmask) == (curaddr & bmask)))
689 segs[seg].ds_len += sgsize;
690 else {
691 if (++seg >= dmat->nsegments)
692 break;
693 segs[seg].ds_addr = curaddr;
694 segs[seg].ds_len = sgsize;
695 }
696 }
697
698 lastaddr = curaddr + sgsize;
699 vaddr += sgsize;
700 buflen -= sgsize;
701 }
702
703 *segp = seg;
704 *lastaddrp = lastaddr;
705
706 /*
707 * Did we fit?
708 */
709 return (buflen != 0 ? EFBIG : 0); /* XXX better return value here? */
710 }
711
712 /*
713 * Map the buffer buf into bus space using the dmamap map.
714 */
715 int
716 bus_dmamap_load(bus_dma_tag_t dmat, bus_dmamap_t map, void *buf,
717 bus_size_t buflen, bus_dmamap_callback_t *callback,
718 void *callback_arg, int flags)
719 {
720 bus_addr_t lastaddr = 0;
721 int error, nsegs = 0;
722
723 if (map != NULL) {
724 flags |= BUS_DMA_WAITOK;
725 map->callback = callback;
726 map->callback_arg = callback_arg;
727 }
728
729 error = _bus_dmamap_load_buffer(dmat, map, buf, buflen, NULL, flags,
730 &lastaddr, dmat->segments, &nsegs, 1);
731
732 CTR5(KTR_BUSDMA, "%s: tag %p tag flags 0x%x error %d nsegs %d",
733 __func__, dmat, dmat->flags, error, nsegs + 1);
734
735 if (error == EINPROGRESS) {
736 return (error);
737 }
738
739 if (error)
740 (*callback)(callback_arg, dmat->segments, 0, error);
741 else
742 (*callback)(callback_arg, dmat->segments, nsegs + 1, 0);
743
744 /*
745 * Return ENOMEM to the caller so that it can pass it up the stack.
746 * This error only happens when NOWAIT is set, so deferal is disabled.
747 */
748 if (error == ENOMEM)
749 return (error);
750
751 return (0);
752 }
753
754
755 /*
756 * Like _bus_dmamap_load(), but for mbufs.
757 */
758 int
759 bus_dmamap_load_mbuf(bus_dma_tag_t dmat, bus_dmamap_t map,
760 struct mbuf *m0,
761 bus_dmamap_callback2_t *callback, void *callback_arg,
762 int flags)
763 {
764 int nsegs, error;
765
766 M_ASSERTPKTHDR(m0);
767
768 flags |= BUS_DMA_NOWAIT;
769 nsegs = 0;
770 error = 0;
771 if (m0->m_pkthdr.len <= dmat->maxsize) {
772 int first = 1;
773 bus_addr_t lastaddr = 0;
774 struct mbuf *m;
775
776 for (m = m0; m != NULL && error == 0; m = m->m_next) {
777 if (m->m_len > 0) {
778 error = _bus_dmamap_load_buffer(dmat, map,
779 m->m_data, m->m_len,
780 NULL, flags, &lastaddr,
781 dmat->segments, &nsegs, first);
782 first = 0;
783 }
784 }
785 } else {
786 error = EINVAL;
787 }
788
789 if (error) {
790 /* force "no valid mappings" in callback */
791 (*callback)(callback_arg, dmat->segments, 0, 0, error);
792 } else {
793 (*callback)(callback_arg, dmat->segments,
794 nsegs+1, m0->m_pkthdr.len, error);
795 }
796 CTR5(KTR_BUSDMA, "%s: tag %p tag flags 0x%x error %d nsegs %d",
797 __func__, dmat, dmat->flags, error, nsegs + 1);
798 return (error);
799 }
800
801 int
802 bus_dmamap_load_mbuf_sg(bus_dma_tag_t dmat, bus_dmamap_t map,
803 struct mbuf *m0, bus_dma_segment_t *segs, int *nsegs,
804 int flags)
805 {
806 int error;
807
808 M_ASSERTPKTHDR(m0);
809
810 flags |= BUS_DMA_NOWAIT;
811 *nsegs = 0;
812 error = 0;
813 if (m0->m_pkthdr.len <= dmat->maxsize) {
814 int first = 1;
815 bus_addr_t lastaddr = 0;
816 struct mbuf *m;
817
818 for (m = m0; m != NULL && error == 0; m = m->m_next) {
819 if (m->m_len > 0) {
820 error = _bus_dmamap_load_buffer(dmat, map,
821 m->m_data, m->m_len,
822 NULL, flags, &lastaddr,
823 segs, nsegs, first);
824 first = 0;
825 }
826 }
827 } else {
828 error = EINVAL;
829 }
830
831 /* XXX FIXME: Having to increment nsegs is really annoying */
832 ++*nsegs;
833 CTR5(KTR_BUSDMA, "%s: tag %p tag flags 0x%x error %d nsegs %d",
834 __func__, dmat, dmat->flags, error, *nsegs);
835 return (error);
836 }
837
838 /*
839 * Like _bus_dmamap_load(), but for uios.
840 */
841 int
842 bus_dmamap_load_uio(bus_dma_tag_t dmat, bus_dmamap_t map,
843 struct uio *uio,
844 bus_dmamap_callback2_t *callback, void *callback_arg,
845 int flags)
846 {
847 bus_addr_t lastaddr = 0;
848 int nsegs, error, first, i;
849 bus_size_t resid;
850 struct iovec *iov;
851 pmap_t pmap;
852
853 flags |= BUS_DMA_NOWAIT;
854 resid = uio->uio_resid;
855 iov = uio->uio_iov;
856
857 if (uio->uio_segflg == UIO_USERSPACE) {
858 KASSERT(uio->uio_td != NULL,
859 ("bus_dmamap_load_uio: USERSPACE but no proc"));
860 pmap = vmspace_pmap(uio->uio_td->td_proc->p_vmspace);
861 } else
862 pmap = NULL;
863
864 nsegs = 0;
865 error = 0;
866 first = 1;
867 for (i = 0; i < uio->uio_iovcnt && resid != 0 && !error; i++) {
868 /*
869 * Now at the first iovec to load. Load each iovec
870 * until we have exhausted the residual count.
871 */
872 bus_size_t minlen =
873 resid < iov[i].iov_len ? resid : iov[i].iov_len;
874 caddr_t addr = (caddr_t) iov[i].iov_base;
875
876 if (minlen > 0) {
877 error = _bus_dmamap_load_buffer(dmat, map,
878 addr, minlen, pmap, flags, &lastaddr,
879 dmat->segments, &nsegs, first);
880 first = 0;
881
882 resid -= minlen;
883 }
884 }
885
886 if (error) {
887 /* force "no valid mappings" in callback */
888 (*callback)(callback_arg, dmat->segments, 0, 0, error);
889 } else {
890 (*callback)(callback_arg, dmat->segments,
891 nsegs+1, uio->uio_resid, error);
892 }
893 CTR5(KTR_BUSDMA, "%s: tag %p tag flags 0x%x error %d nsegs %d",
894 __func__, dmat, dmat->flags, error, nsegs + 1);
895 return (error);
896 }
897
898 /*
899 * Release the mapping held by map.
900 */
901 void
902 _bus_dmamap_unload(bus_dma_tag_t dmat, bus_dmamap_t map)
903 {
904 struct bounce_page *bpage;
905
906 while ((bpage = STAILQ_FIRST(&map->bpages)) != NULL) {
907 STAILQ_REMOVE_HEAD(&map->bpages, links);
908 free_bounce_page(dmat, bpage);
909 }
910 }
911
912 void
913 _bus_dmamap_sync(bus_dma_tag_t dmat, bus_dmamap_t map, bus_dmasync_op_t op)
914 {
915 struct bounce_page *bpage;
916
917 if ((bpage = STAILQ_FIRST(&map->bpages)) != NULL) {
918 /*
919 * Handle data bouncing. We might also
920 * want to add support for invalidating
921 * the caches on broken hardware
922 */
923 CTR4(KTR_BUSDMA, "%s: tag %p tag flags 0x%x op 0x%x "
924 "performing bounce", __func__, op, dmat, dmat->flags);
925
926 if (op & BUS_DMASYNC_PREWRITE) {
927 while (bpage != NULL) {
928 bcopy((void *)bpage->datavaddr,
929 (void *)bpage->vaddr,
930 bpage->datacount);
931 bpage = STAILQ_NEXT(bpage, links);
932 }
933 dmat->bounce_zone->total_bounced++;
934 }
935
936 if (op & BUS_DMASYNC_POSTREAD) {
937 while (bpage != NULL) {
938 bcopy((void *)bpage->vaddr,
939 (void *)bpage->datavaddr,
940 bpage->datacount);
941 bpage = STAILQ_NEXT(bpage, links);
942 }
943 dmat->bounce_zone->total_bounced++;
944 }
945 }
946 }
947
948 static void
949 init_bounce_pages(void *dummy __unused)
950 {
951
952 total_bpages = 0;
953 STAILQ_INIT(&bounce_zone_list);
954 STAILQ_INIT(&bounce_map_waitinglist);
955 STAILQ_INIT(&bounce_map_callbacklist);
956 mtx_init(&bounce_lock, "bounce pages lock", NULL, MTX_DEF);
957 }
958 SYSINIT(bpages, SI_SUB_LOCK, SI_ORDER_ANY, init_bounce_pages, NULL);
959
960 static struct sysctl_ctx_list *
961 busdma_sysctl_tree(struct bounce_zone *bz)
962 {
963 return (&bz->sysctl_tree);
964 }
965
966 static struct sysctl_oid *
967 busdma_sysctl_tree_top(struct bounce_zone *bz)
968 {
969 return (bz->sysctl_tree_top);
970 }
971
972 static int
973 alloc_bounce_zone(bus_dma_tag_t dmat)
974 {
975 struct bounce_zone *bz;
976
977 /* Check to see if we already have a suitable zone */
978 STAILQ_FOREACH(bz, &bounce_zone_list, links) {
979 if ((dmat->alignment <= bz->alignment)
980 && (dmat->lowaddr >= bz->lowaddr)) {
981 dmat->bounce_zone = bz;
982 return (0);
983 }
984 }
985
986 if ((bz = (struct bounce_zone *)malloc(sizeof(*bz), M_DEVBUF,
987 M_NOWAIT | M_ZERO)) == NULL)
988 return (ENOMEM);
989
990 STAILQ_INIT(&bz->bounce_page_list);
991 bz->free_bpages = 0;
992 bz->reserved_bpages = 0;
993 bz->active_bpages = 0;
994 bz->lowaddr = dmat->lowaddr;
995 bz->alignment = MAX(dmat->alignment, PAGE_SIZE);
996 bz->map_count = 0;
997 snprintf(bz->zoneid, 8, "zone%d", busdma_zonecount);
998 busdma_zonecount++;
999 snprintf(bz->lowaddrid, 18, "%#jx", (uintmax_t)bz->lowaddr);
1000 STAILQ_INSERT_TAIL(&bounce_zone_list, bz, links);
1001 dmat->bounce_zone = bz;
1002
1003 sysctl_ctx_init(&bz->sysctl_tree);
1004 bz->sysctl_tree_top = SYSCTL_ADD_NODE(&bz->sysctl_tree,
1005 SYSCTL_STATIC_CHILDREN(_hw_busdma), OID_AUTO, bz->zoneid,
1006 CTLFLAG_RD, 0, "");
1007 if (bz->sysctl_tree_top == NULL) {
1008 sysctl_ctx_free(&bz->sysctl_tree);
1009 return (0); /* XXX error code? */
1010 }
1011
1012 SYSCTL_ADD_INT(busdma_sysctl_tree(bz),
1013 SYSCTL_CHILDREN(busdma_sysctl_tree_top(bz)), OID_AUTO,
1014 "total_bpages", CTLFLAG_RD, &bz->total_bpages, 0,
1015 "Total bounce pages");
1016 SYSCTL_ADD_INT(busdma_sysctl_tree(bz),
1017 SYSCTL_CHILDREN(busdma_sysctl_tree_top(bz)), OID_AUTO,
1018 "free_bpages", CTLFLAG_RD, &bz->free_bpages, 0,
1019 "Free bounce pages");
1020 SYSCTL_ADD_INT(busdma_sysctl_tree(bz),
1021 SYSCTL_CHILDREN(busdma_sysctl_tree_top(bz)), OID_AUTO,
1022 "reserved_bpages", CTLFLAG_RD, &bz->reserved_bpages, 0,
1023 "Reserved bounce pages");
1024 SYSCTL_ADD_INT(busdma_sysctl_tree(bz),
1025 SYSCTL_CHILDREN(busdma_sysctl_tree_top(bz)), OID_AUTO,
1026 "active_bpages", CTLFLAG_RD, &bz->active_bpages, 0,
1027 "Active bounce pages");
1028 SYSCTL_ADD_INT(busdma_sysctl_tree(bz),
1029 SYSCTL_CHILDREN(busdma_sysctl_tree_top(bz)), OID_AUTO,
1030 "total_bounced", CTLFLAG_RD, &bz->total_bounced, 0,
1031 "Total bounce requests");
1032 SYSCTL_ADD_INT(busdma_sysctl_tree(bz),
1033 SYSCTL_CHILDREN(busdma_sysctl_tree_top(bz)), OID_AUTO,
1034 "total_deferred", CTLFLAG_RD, &bz->total_deferred, 0,
1035 "Total bounce requests that were deferred");
1036 SYSCTL_ADD_STRING(busdma_sysctl_tree(bz),
1037 SYSCTL_CHILDREN(busdma_sysctl_tree_top(bz)), OID_AUTO,
1038 "lowaddr", CTLFLAG_RD, bz->lowaddrid, 0, "");
1039 SYSCTL_ADD_INT(busdma_sysctl_tree(bz),
1040 SYSCTL_CHILDREN(busdma_sysctl_tree_top(bz)), OID_AUTO,
1041 "alignment", CTLFLAG_RD, &bz->alignment, 0, "");
1042
1043 return (0);
1044 }
1045
1046 static int
1047 alloc_bounce_pages(bus_dma_tag_t dmat, u_int numpages)
1048 {
1049 struct bounce_zone *bz;
1050 int count;
1051
1052 bz = dmat->bounce_zone;
1053 count = 0;
1054 while (numpages > 0) {
1055 struct bounce_page *bpage;
1056
1057 bpage = (struct bounce_page *)malloc(sizeof(*bpage), M_DEVBUF,
1058 M_NOWAIT | M_ZERO);
1059
1060 if (bpage == NULL)
1061 break;
1062 bpage->vaddr = (vm_offset_t)contigmalloc(PAGE_SIZE, M_DEVBUF,
1063 M_NOWAIT, 0ul,
1064 bz->lowaddr,
1065 PAGE_SIZE,
1066 0);
1067 if (bpage->vaddr == 0) {
1068 free(bpage, M_DEVBUF);
1069 break;
1070 }
1071 bpage->busaddr = pmap_kextract(bpage->vaddr);
1072 mtx_lock(&bounce_lock);
1073 STAILQ_INSERT_TAIL(&bz->bounce_page_list, bpage, links);
1074 total_bpages++;
1075 bz->total_bpages++;
1076 bz->free_bpages++;
1077 mtx_unlock(&bounce_lock);
1078 count++;
1079 numpages--;
1080 }
1081 return (count);
1082 }
1083
1084 static int
1085 reserve_bounce_pages(bus_dma_tag_t dmat, bus_dmamap_t map, int commit)
1086 {
1087 struct bounce_zone *bz;
1088 int pages;
1089
1090 mtx_assert(&bounce_lock, MA_OWNED);
1091 bz = dmat->bounce_zone;
1092 pages = MIN(bz->free_bpages, map->pagesneeded - map->pagesreserved);
1093 if (commit == 0 && map->pagesneeded > (map->pagesreserved + pages))
1094 return (map->pagesneeded - (map->pagesreserved + pages));
1095 bz->free_bpages -= pages;
1096 bz->reserved_bpages += pages;
1097 map->pagesreserved += pages;
1098 pages = map->pagesneeded - map->pagesreserved;
1099
1100 return (pages);
1101 }
1102
1103 static bus_addr_t
1104 add_bounce_page(bus_dma_tag_t dmat, bus_dmamap_t map, vm_offset_t vaddr,
1105 bus_size_t size)
1106 {
1107 struct bounce_zone *bz;
1108 struct bounce_page *bpage;
1109
1110 KASSERT(dmat->bounce_zone != NULL, ("no bounce zone in dma tag"));
1111 KASSERT(map != NULL && map != &nobounce_dmamap,
1112 ("add_bounce_page: bad map %p", map));
1113
1114 bz = dmat->bounce_zone;
1115 if (map->pagesneeded == 0)
1116 panic("add_bounce_page: map doesn't need any pages");
1117 map->pagesneeded--;
1118
1119 if (map->pagesreserved == 0)
1120 panic("add_bounce_page: map doesn't need any pages");
1121 map->pagesreserved--;
1122
1123 mtx_lock(&bounce_lock);
1124 bpage = STAILQ_FIRST(&bz->bounce_page_list);
1125 if (bpage == NULL)
1126 panic("add_bounce_page: free page list is empty");
1127
1128 STAILQ_REMOVE_HEAD(&bz->bounce_page_list, links);
1129 bz->reserved_bpages--;
1130 bz->active_bpages++;
1131 mtx_unlock(&bounce_lock);
1132
1133 if (dmat->flags & BUS_DMA_KEEP_PG_OFFSET) {
1134 /* Page offset needs to be preserved. */
1135 bpage->vaddr |= vaddr & PAGE_MASK;
1136 bpage->busaddr |= vaddr & PAGE_MASK;
1137 }
1138 bpage->datavaddr = vaddr;
1139 bpage->datacount = size;
1140 STAILQ_INSERT_TAIL(&(map->bpages), bpage, links);
1141 return (bpage->busaddr);
1142 }
1143
1144 static void
1145 free_bounce_page(bus_dma_tag_t dmat, struct bounce_page *bpage)
1146 {
1147 struct bus_dmamap *map;
1148 struct bounce_zone *bz;
1149
1150 bz = dmat->bounce_zone;
1151 bpage->datavaddr = 0;
1152 bpage->datacount = 0;
1153 if (dmat->flags & BUS_DMA_KEEP_PG_OFFSET) {
1154 /*
1155 * Reset the bounce page to start at offset 0. Other uses
1156 * of this bounce page may need to store a full page of
1157 * data and/or assume it starts on a page boundary.
1158 */
1159 bpage->vaddr &= ~PAGE_MASK;
1160 bpage->busaddr &= ~PAGE_MASK;
1161 }
1162
1163 mtx_lock(&bounce_lock);
1164 STAILQ_INSERT_HEAD(&bz->bounce_page_list, bpage, links);
1165 bz->free_bpages++;
1166 bz->active_bpages--;
1167 if ((map = STAILQ_FIRST(&bounce_map_waitinglist)) != NULL) {
1168 if (reserve_bounce_pages(map->dmat, map, 1) == 0) {
1169 STAILQ_REMOVE_HEAD(&bounce_map_waitinglist, links);
1170 STAILQ_INSERT_TAIL(&bounce_map_callbacklist,
1171 map, links);
1172 busdma_swi_pending = 1;
1173 bz->total_deferred++;
1174 swi_sched(vm_ih, 0);
1175 }
1176 }
1177 mtx_unlock(&bounce_lock);
1178 }
1179
1180 void
1181 busdma_swi(void)
1182 {
1183 bus_dma_tag_t dmat;
1184 struct bus_dmamap *map;
1185
1186 mtx_lock(&bounce_lock);
1187 while ((map = STAILQ_FIRST(&bounce_map_callbacklist)) != NULL) {
1188 STAILQ_REMOVE_HEAD(&bounce_map_callbacklist, links);
1189 mtx_unlock(&bounce_lock);
1190 dmat = map->dmat;
1191 (dmat->lockfunc)(dmat->lockfuncarg, BUS_DMA_LOCK);
1192 bus_dmamap_load(map->dmat, map, map->buf, map->buflen,
1193 map->callback, map->callback_arg, /*flags*/0);
1194 (dmat->lockfunc)(dmat->lockfuncarg, BUS_DMA_UNLOCK);
1195 mtx_lock(&bounce_lock);
1196 }
1197 mtx_unlock(&bounce_lock);
1198 }
Cache object: 0a539cea683ea0d8a582a6682d59f08f
|