bus_dma.c revision 1.28
1/* $NetBSD: bus_dma.c,v 1.28 1999/03/24 05:50:52 mrg Exp $ */ 2 3/*- 4 * Copyright (c) 1997, 1998 The NetBSD Foundation, Inc. 5 * All rights reserved. 6 * 7 * This code is derived from software contributed to The NetBSD Foundation 8 * by Jason R. Thorpe of the Numerical Aerospace Simulation Facility, 9 * NASA Ames Research Center. 10 * 11 * Redistribution and use in source and binary forms, with or without 12 * modification, are permitted provided that the following conditions 13 * are met: 14 * 1. Redistributions of source code must retain the above copyright 15 * notice, this list of conditions and the following disclaimer. 16 * 2. Redistributions in binary form must reproduce the above copyright 17 * notice, this list of conditions and the following disclaimer in the 18 * documentation and/or other materials provided with the distribution. 19 * 3. All advertising materials mentioning features or use of this software 20 * must display the following acknowledgement: 21 * This product includes software developed by the NetBSD 22 * Foundation, Inc. and its contributors. 23 * 4. Neither the name of The NetBSD Foundation nor the names of its 24 * contributors may be used to endorse or promote products derived 25 * from this software without specific prior written permission. 26 * 27 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS 28 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED 29 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 30 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS 31 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 32 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 33 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 34 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 35 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 36 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 37 * POSSIBILITY OF SUCH DAMAGE. 38 */ 39 40#include "opt_pmap_new.h" 41 42#include <sys/cdefs.h> /* RCS ID & Copyright macro defns */ 43 44__KERNEL_RCSID(0, "$NetBSD: bus_dma.c,v 1.28 1999/03/24 05:50:52 mrg Exp $"); 45 46#include <sys/param.h> 47#include <sys/systm.h> 48#include <sys/kernel.h> 49#include <sys/device.h> 50#include <sys/malloc.h> 51#include <sys/proc.h> 52#include <sys/mbuf.h> 53 54#include <vm/vm.h> 55#include <vm/vm_kern.h> 56 57#include <uvm/uvm_extern.h> 58 59#define _ALPHA_BUS_DMA_PRIVATE 60#include <machine/bus.h> 61#include <machine/intr.h> 62 63int _bus_dmamap_load_buffer_direct_common __P((bus_dma_tag_t, 64 bus_dmamap_t, void *, bus_size_t, struct proc *, int, 65 paddr_t *, int *, int)); 66 67/* 68 * Common function for DMA map creation. May be called by bus-specific 69 * DMA map creation functions. 70 */ 71int 72_bus_dmamap_create(t, size, nsegments, maxsegsz, boundary, flags, dmamp) 73 bus_dma_tag_t t; 74 bus_size_t size; 75 int nsegments; 76 bus_size_t maxsegsz; 77 bus_size_t boundary; 78 int flags; 79 bus_dmamap_t *dmamp; 80{ 81 struct alpha_bus_dmamap *map; 82 void *mapstore; 83 size_t mapsize; 84 85 /* 86 * Allcoate and initialize the DMA map. The end of the map 87 * is a variable-sized array of segments, so we allocate enough 88 * room for them in one shot. 89 * 90 * Note we don't preserve the WAITOK or NOWAIT flags. Preservation 91 * of ALLOCNOW notifes others that we've reserved these resources, 92 * and they are not to be freed. 93 * 94 * The bus_dmamap_t includes one bus_dma_segment_t, hence 95 * the (nsegments - 1). 96 */ 97 mapsize = sizeof(struct alpha_bus_dmamap) + 98 (sizeof(bus_dma_segment_t) * (nsegments - 1)); 99 if ((mapstore = malloc(mapsize, M_DMAMAP, 100 (flags & BUS_DMA_NOWAIT) ? M_NOWAIT : M_WAITOK)) == NULL) 101 return (ENOMEM); 102 103 bzero(mapstore, mapsize); 104 map = (struct alpha_bus_dmamap *)mapstore; 105 map->_dm_size = size; 106 map->_dm_segcnt = nsegments; 107 map->_dm_maxsegsz = maxsegsz; 108 if (t->_boundary != 0 && t->_boundary < boundary) 109 map->_dm_boundary = t->_boundary; 110 else 111 map->_dm_boundary = boundary; 112 map->_dm_flags = flags & ~(BUS_DMA_WAITOK|BUS_DMA_NOWAIT); 113 map->dm_mapsize = 0; /* no valid mappings */ 114 map->dm_nsegs = 0; 115 116 *dmamp = map; 117 return (0); 118} 119 120/* 121 * Common function for DMA map destruction. May be called by bus-specific 122 * DMA map destruction functions. 123 */ 124void 125_bus_dmamap_destroy(t, map) 126 bus_dma_tag_t t; 127 bus_dmamap_t map; 128{ 129 130 free(map, M_DMAMAP); 131} 132 133/* 134 * Utility function to load a linear buffer. lastaddrp holds state 135 * between invocations (for multiple-buffer loads). segp contains 136 * the starting segment on entrance, and the ending segment on exit. 137 * first indicates if this is the first invocation of this function. 138 */ 139int 140_bus_dmamap_load_buffer_direct_common(t, map, buf, buflen, p, flags, 141 lastaddrp, segp, first) 142 bus_dma_tag_t t; 143 bus_dmamap_t map; 144 void *buf; 145 bus_size_t buflen; 146 struct proc *p; 147 int flags; 148 paddr_t *lastaddrp; 149 int *segp; 150 int first; 151{ 152 bus_size_t sgsize; 153 bus_addr_t curaddr, lastaddr, baddr, bmask; 154 vaddr_t vaddr = (vaddr_t)buf; 155 int seg; 156 157 lastaddr = *lastaddrp; 158 bmask = ~(map->_dm_boundary - 1); 159 160 for (seg = *segp; buflen > 0 ; ) { 161 /* 162 * Get the physical address for this segment. 163 */ 164 if (p != NULL) 165 curaddr = pmap_extract(p->p_vmspace->vm_map.pmap, 166 vaddr); 167 else 168 curaddr = vtophys(vaddr); 169 170 /* 171 * If we're beyond the current DMA window, indicate 172 * that and try to fall back into SGMAPs. 173 */ 174 if (t->_wsize != 0 && curaddr >= t->_wsize) 175 return (EINVAL); 176 177 curaddr |= t->_wbase; 178 179 /* 180 * Compute the segment size, and adjust counts. 181 */ 182 sgsize = NBPG - ((u_long)vaddr & PGOFSET); 183 if (buflen < sgsize) 184 sgsize = buflen; 185 186 /* 187 * Make sure we don't cross any boundaries. 188 */ 189 if (map->_dm_boundary > 0) { 190 baddr = (curaddr + map->_dm_boundary) & bmask; 191 if (sgsize > (baddr - curaddr)) 192 sgsize = (baddr - curaddr); 193 } 194 195 /* 196 * Insert chunk into a segment, coalescing with 197 * the previous segment if possible. 198 */ 199 if (first) { 200 map->dm_segs[seg].ds_addr = curaddr; 201 map->dm_segs[seg].ds_len = sgsize; 202 first = 0; 203 } else { 204 if (curaddr == lastaddr && 205 (map->dm_segs[seg].ds_len + sgsize) <= 206 map->_dm_maxsegsz && 207 (map->_dm_boundary == 0 || 208 (map->dm_segs[seg].ds_addr & bmask) == 209 (curaddr & bmask))) 210 map->dm_segs[seg].ds_len += sgsize; 211 else { 212 if (++seg >= map->_dm_segcnt) 213 break; 214 map->dm_segs[seg].ds_addr = curaddr; 215 map->dm_segs[seg].ds_len = sgsize; 216 } 217 } 218 219 lastaddr = curaddr + sgsize; 220 vaddr += sgsize; 221 buflen -= sgsize; 222 } 223 224 *segp = seg; 225 *lastaddrp = lastaddr; 226 227 /* 228 * Did we fit? 229 */ 230 if (buflen != 0) { 231 /* 232 * If there is a chained window, we will automatically 233 * fall back to it. 234 */ 235 return (EFBIG); /* XXX better return value here? */ 236 } 237 238 return (0); 239} 240 241/* 242 * Common function for loading a direct-mapped DMA map with a linear 243 * buffer. Called by bus-specific DMA map load functions with the 244 * OR value appropriate for indicating "direct-mapped" for that 245 * chipset. 246 */ 247int 248_bus_dmamap_load_direct(t, map, buf, buflen, p, flags) 249 bus_dma_tag_t t; 250 bus_dmamap_t map; 251 void *buf; 252 bus_size_t buflen; 253 struct proc *p; 254 int flags; 255{ 256 paddr_t lastaddr; 257 int seg, error; 258 259 /* 260 * Make sure that on error condition we return "no valid mappings". 261 */ 262 map->dm_mapsize = 0; 263 map->dm_nsegs = 0; 264 265 if (buflen > map->_dm_size) 266 return (EINVAL); 267 268 seg = 0; 269 error = _bus_dmamap_load_buffer_direct_common(t, map, buf, buflen, 270 p, flags, &lastaddr, &seg, 1); 271 if (error == 0) { 272 map->dm_mapsize = buflen; 273 map->dm_nsegs = seg + 1; 274 } else if (t->_next_window != NULL) { 275 /* 276 * Give the next window a chance. 277 */ 278 error = bus_dmamap_load(t->_next_window, map, buf, buflen, 279 p, flags); 280 } 281 return (error); 282} 283 284/* 285 * Like _bus_dmamap_load_direct_common(), but for mbufs. 286 */ 287int 288_bus_dmamap_load_mbuf_direct(t, map, m0, flags) 289 bus_dma_tag_t t; 290 bus_dmamap_t map; 291 struct mbuf *m0; 292 int flags; 293{ 294 paddr_t lastaddr; 295 int seg, error, first; 296 struct mbuf *m; 297 298 /* 299 * Make sure that on error condition we return "no valid mappings." 300 */ 301 map->dm_mapsize = 0; 302 map->dm_nsegs = 0; 303 304#ifdef DIAGNOSTIC 305 if ((m0->m_flags & M_PKTHDR) == 0) 306 panic("_bus_dmamap_load_mbuf_direct_common: no packet header"); 307#endif 308 309 if (m0->m_pkthdr.len > map->_dm_size) 310 return (EINVAL); 311 312 first = 1; 313 seg = 0; 314 error = 0; 315 for (m = m0; m != NULL && error == 0; m = m->m_next) { 316 error = _bus_dmamap_load_buffer_direct_common(t, map, 317 m->m_data, m->m_len, NULL, flags, &lastaddr, &seg, first); 318 first = 0; 319 } 320 if (error == 0) { 321 map->dm_mapsize = m0->m_pkthdr.len; 322 map->dm_nsegs = seg + 1; 323 } else if (t->_next_window != NULL) { 324 /* 325 * Give the next window a chance. 326 */ 327 error = bus_dmamap_load_mbuf(t->_next_window, map, m0, flags); 328 } 329 return (error); 330} 331 332/* 333 * Like _bus_dmamap_load_direct_common(), but for uios. 334 */ 335int 336_bus_dmamap_load_uio_direct(t, map, uio, flags) 337 bus_dma_tag_t t; 338 bus_dmamap_t map; 339 struct uio *uio; 340 int flags; 341{ 342 paddr_t lastaddr; 343 int seg, i, error, first; 344 bus_size_t minlen, resid; 345 struct proc *p = NULL; 346 struct iovec *iov; 347 caddr_t addr; 348 349 /* 350 * Make sure that on error condition we return "no valid mappings." 351 */ 352 map->dm_mapsize = 0; 353 map->dm_nsegs = 0; 354 355 resid = uio->uio_resid; 356 iov = uio->uio_iov; 357 358 if (uio->uio_segflg == UIO_USERSPACE) { 359 p = uio->uio_procp; 360#ifdef DIAGNOSTIC 361 if (p == NULL) 362 panic("_bus_dmamap_load_direct_common: USERSPACE but no proc"); 363#endif 364 } 365 366 first = 1; 367 seg = 0; 368 error = 0; 369 for (i = 0; i < uio->uio_iovcnt && resid != 0 && error == 0; i++) { 370 /* 371 * Now at the first iovec to load. Load each iovec 372 * until we have exhausted the residual count. 373 */ 374 minlen = resid < iov[i].iov_len ? resid : iov[i].iov_len; 375 addr = (caddr_t)iov[i].iov_base; 376 377 error = _bus_dmamap_load_buffer_direct_common(t, map, 378 addr, minlen, p, flags, &lastaddr, &seg, first); 379 first = 0; 380 381 resid -= minlen; 382 } 383 if (error == 0) { 384 map->dm_mapsize = uio->uio_resid; 385 map->dm_nsegs = seg + 1; 386 } else if (t->_next_window != NULL) { 387 /* 388 * Give the next window a chance. 389 */ 390 error = bus_dmamap_load_uio(t->_next_window, map, uio, flags); 391 } 392 return (error); 393} 394 395/* 396 * Like _bus_dmamap_load_direct_common(), but for raw memory. 397 */ 398int 399_bus_dmamap_load_raw_direct(t, map, segs, nsegs, size, flags) 400 bus_dma_tag_t t; 401 bus_dmamap_t map; 402 bus_dma_segment_t *segs; 403 int nsegs; 404 bus_size_t size; 405 int flags; 406{ 407 408 panic("_bus_dmamap_load_raw_direct: not implemented"); 409} 410 411/* 412 * Common function for unloading a DMA map. May be called by 413 * chipset-specific DMA map unload functions. 414 */ 415void 416_bus_dmamap_unload(t, map) 417 bus_dma_tag_t t; 418 bus_dmamap_t map; 419{ 420 421 /* 422 * No resources to free; just mark the mappings as 423 * invalid. 424 */ 425 map->dm_mapsize = 0; 426 map->dm_nsegs = 0; 427} 428 429/* 430 * Common function for DMA map synchronization. May be called 431 * by chipset-specific DMA map synchronization functions. 432 */ 433void 434_bus_dmamap_sync(t, map, offset, len, ops) 435 bus_dma_tag_t t; 436 bus_dmamap_t map; 437 bus_addr_t offset; 438 bus_size_t len; 439 int ops; 440{ 441 442 /* 443 * Flush the store buffer. 444 */ 445 alpha_mb(); 446} 447 448/* 449 * Common function for DMA-safe memory allocation. May be called 450 * by bus-specific DMA memory allocation functions. 451 */ 452int 453_bus_dmamem_alloc(t, size, alignment, boundary, segs, nsegs, rsegs, flags) 454 bus_dma_tag_t t; 455 bus_size_t size, alignment, boundary; 456 bus_dma_segment_t *segs; 457 int nsegs; 458 int *rsegs; 459 int flags; 460{ 461 extern paddr_t avail_start, avail_end; 462 paddr_t curaddr, lastaddr, high; 463 vm_page_t m; 464 struct pglist mlist; 465 int curseg, error; 466 467 /* Always round the size. */ 468 size = round_page(size); 469 470 high = avail_end - PAGE_SIZE; 471 472 /* 473 * Allocate pages from the VM system. 474 */ 475 TAILQ_INIT(&mlist); 476 error = uvm_pglistalloc(size, avail_start, high, alignment, boundary, 477 &mlist, nsegs, (flags & BUS_DMA_NOWAIT) == 0); 478 if (error) 479 return (error); 480 481 /* 482 * Compute the location, size, and number of segments actually 483 * returned by the VM code. 484 */ 485 m = mlist.tqh_first; 486 curseg = 0; 487 lastaddr = segs[curseg].ds_addr = VM_PAGE_TO_PHYS(m); 488 segs[curseg].ds_len = PAGE_SIZE; 489 m = m->pageq.tqe_next; 490 491 for (; m != NULL; m = m->pageq.tqe_next) { 492 curaddr = VM_PAGE_TO_PHYS(m); 493#ifdef DIAGNOSTIC 494 if (curaddr < avail_start || curaddr >= high) { 495 printf("vm_page_alloc_memory returned non-sensical" 496 " address 0x%lx\n", curaddr); 497 panic("_bus_dmamem_alloc"); 498 } 499#endif 500 if (curaddr == (lastaddr + PAGE_SIZE)) 501 segs[curseg].ds_len += PAGE_SIZE; 502 else { 503 curseg++; 504 segs[curseg].ds_addr = curaddr; 505 segs[curseg].ds_len = PAGE_SIZE; 506 } 507 lastaddr = curaddr; 508 } 509 510 *rsegs = curseg + 1; 511 512 return (0); 513} 514 515/* 516 * Common function for freeing DMA-safe memory. May be called by 517 * bus-specific DMA memory free functions. 518 */ 519void 520_bus_dmamem_free(t, segs, nsegs) 521 bus_dma_tag_t t; 522 bus_dma_segment_t *segs; 523 int nsegs; 524{ 525 vm_page_t m; 526 bus_addr_t addr; 527 struct pglist mlist; 528 int curseg; 529 530 /* 531 * Build a list of pages to free back to the VM system. 532 */ 533 TAILQ_INIT(&mlist); 534 for (curseg = 0; curseg < nsegs; curseg++) { 535 for (addr = segs[curseg].ds_addr; 536 addr < (segs[curseg].ds_addr + segs[curseg].ds_len); 537 addr += PAGE_SIZE) { 538 m = PHYS_TO_VM_PAGE(addr); 539 TAILQ_INSERT_TAIL(&mlist, m, pageq); 540 } 541 } 542 543 uvm_pglistfree(&mlist); 544} 545 546/* 547 * Common function for mapping DMA-safe memory. May be called by 548 * bus-specific DMA memory map functions. 549 */ 550int 551_bus_dmamem_map(t, segs, nsegs, size, kvap, flags) 552 bus_dma_tag_t t; 553 bus_dma_segment_t *segs; 554 int nsegs; 555 size_t size; 556 caddr_t *kvap; 557 int flags; 558{ 559 vaddr_t va; 560 bus_addr_t addr; 561 int curseg; 562 563 /* 564 * If we're only mapping 1 segment, use K0SEG, to avoid 565 * TLB thrashing. 566 */ 567 if (nsegs == 1) { 568 *kvap = (caddr_t)ALPHA_PHYS_TO_K0SEG(segs[0].ds_addr); 569 return (0); 570 } 571 572 size = round_page(size); 573 574 va = uvm_km_valloc(kernel_map, size); 575 576 if (va == 0) 577 return (ENOMEM); 578 579 *kvap = (caddr_t)va; 580 581 for (curseg = 0; curseg < nsegs; curseg++) { 582 for (addr = segs[curseg].ds_addr; 583 addr < (segs[curseg].ds_addr + segs[curseg].ds_len); 584 addr += NBPG, va += NBPG, size -= NBPG) { 585 if (size == 0) 586 panic("_bus_dmamem_map: size botch"); 587#if defined(PMAP_NEW) 588 pmap_kenter_pa(va, addr, VM_PROT_READ | VM_PROT_WRITE); 589#else 590 pmap_enter(pmap_kernel(), va, addr, 591 VM_PROT_READ | VM_PROT_WRITE, TRUE); 592#endif 593 } 594 } 595 596 return (0); 597} 598 599/* 600 * Common function for unmapping DMA-safe memory. May be called by 601 * bus-specific DMA memory unmapping functions. 602 */ 603void 604_bus_dmamem_unmap(t, kva, size) 605 bus_dma_tag_t t; 606 caddr_t kva; 607 size_t size; 608{ 609 610#ifdef DIAGNOSTIC 611 if ((u_long)kva & PGOFSET) 612 panic("_bus_dmamem_unmap"); 613#endif 614 615 /* 616 * Nothing to do if we mapped it with K0SEG. 617 */ 618 if (kva >= (caddr_t)ALPHA_K0SEG_BASE && 619 kva <= (caddr_t)ALPHA_K0SEG_END) 620 return; 621 622 size = round_page(size); 623 uvm_km_free(kernel_map, (vaddr_t)kva, size); 624} 625 626/* 627 * Common functin for mmap(2)'ing DMA-safe memory. May be called by 628 * bus-specific DMA mmap(2)'ing functions. 629 */ 630int 631_bus_dmamem_mmap(t, segs, nsegs, off, prot, flags) 632 bus_dma_tag_t t; 633 bus_dma_segment_t *segs; 634 int nsegs, off, prot, flags; 635{ 636 int i; 637 638 for (i = 0; i < nsegs; i++) { 639#ifdef DIAGNOSTIC 640 if (off & PGOFSET) 641 panic("_bus_dmamem_mmap: offset unaligned"); 642 if (segs[i].ds_addr & PGOFSET) 643 panic("_bus_dmamem_mmap: segment unaligned"); 644 if (segs[i].ds_len & PGOFSET) 645 panic("_bus_dmamem_mmap: segment size not multiple" 646 " of page size"); 647#endif 648 if (off >= segs[i].ds_len) { 649 off -= segs[i].ds_len; 650 continue; 651 } 652 653 return (alpha_btop((caddr_t)segs[i].ds_addr + off)); 654 } 655 656 /* Page not found. */ 657 return (-1); 658} 659