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