bus_dma.c revision 1.22 1 /* $NetBSD: bus_dma.c,v 1.22 1998/06/03 04:15:05 thorpej 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_uvm.h"
41 #include "opt_pmap_new.h"
42
43 #include <sys/cdefs.h> /* RCS ID & Copyright macro defns */
44
45 __KERNEL_RCSID(0, "$NetBSD: bus_dma.c,v 1.22 1998/06/03 04:15:05 thorpej Exp $");
46
47 #include <sys/param.h>
48 #include <sys/systm.h>
49 #include <sys/kernel.h>
50 #include <sys/device.h>
51 #include <sys/malloc.h>
52 #include <sys/proc.h>
53 #include <sys/mbuf.h>
54
55 #include <vm/vm.h>
56 #include <vm/vm_kern.h>
57 #if defined(UVM)
58 #include <uvm/uvm_extern.h>
59 #endif
60
61 #define _ALPHA_BUS_DMA_PRIVATE
62 #include <machine/bus.h>
63 #include <machine/intr.h>
64
65 int _bus_dmamap_load_buffer_direct_common __P((bus_dmamap_t,
66 void *, bus_size_t, struct proc *, int, bus_addr_t,
67 bus_size_t, vm_offset_t *, int *, int));
68
69 /*
70 * Common function for DMA map creation. May be called by bus-specific
71 * DMA map creation functions.
72 */
73 int
74 _bus_dmamap_create(t, size, nsegments, maxsegsz, boundary, flags, dmamp)
75 bus_dma_tag_t t;
76 bus_size_t size;
77 int nsegments;
78 bus_size_t maxsegsz;
79 bus_size_t boundary;
80 int flags;
81 bus_dmamap_t *dmamp;
82 {
83 struct alpha_bus_dmamap *map;
84 void *mapstore;
85 size_t mapsize;
86
87 /*
88 * Allcoate and initialize the DMA map. The end of the map
89 * is a variable-sized array of segments, so we allocate enough
90 * room for them in one shot.
91 *
92 * Note we don't preserve the WAITOK or NOWAIT flags. Preservation
93 * of ALLOCNOW notifes others that we've reserved these resources,
94 * and they are not to be freed.
95 *
96 * The bus_dmamap_t includes one bus_dma_segment_t, hence
97 * the (nsegments - 1).
98 */
99 mapsize = sizeof(struct alpha_bus_dmamap) +
100 (sizeof(bus_dma_segment_t) * (nsegments - 1));
101 if ((mapstore = malloc(mapsize, M_DMAMAP,
102 (flags & BUS_DMA_NOWAIT) ? M_NOWAIT : M_WAITOK)) == NULL)
103 return (ENOMEM);
104
105 bzero(mapstore, mapsize);
106 map = (struct alpha_bus_dmamap *)mapstore;
107 map->_dm_size = size;
108 map->_dm_segcnt = nsegments;
109 map->_dm_maxsegsz = maxsegsz;
110 map->_dm_boundary = boundary;
111 map->_dm_flags = flags & ~(BUS_DMA_WAITOK|BUS_DMA_NOWAIT);
112 map->dm_mapsize = 0; /* no valid mappings */
113 map->dm_nsegs = 0;
114
115 *dmamp = map;
116 return (0);
117 }
118
119 /*
120 * Common function for DMA map destruction. May be called by bus-specific
121 * DMA map destruction functions.
122 */
123 void
124 _bus_dmamap_destroy(t, map)
125 bus_dma_tag_t t;
126 bus_dmamap_t map;
127 {
128
129 free(map, M_DMAMAP);
130 }
131
132 /*
133 * Utility function to load a linear buffer. lastaddrp holds state
134 * between invocations (for multiple-buffer loads). segp contains
135 * the starting segment on entrance, and the ending segment on exit.
136 * first indicates if this is the first invocation of this function.
137 */
138 int
139 _bus_dmamap_load_buffer_direct_common(map, buf, buflen, p, flags, wbase,
140 wsize, lastaddrp, segp, first)
141 bus_dmamap_t map;
142 void *buf;
143 bus_size_t buflen;
144 struct proc *p;
145 int flags;
146 bus_addr_t wbase;
147 bus_size_t wsize;
148 vm_offset_t *lastaddrp;
149 int *segp;
150 int first;
151 {
152 bus_size_t sgsize;
153 bus_addr_t curaddr, lastaddr, baddr, bmask;
154 vm_offset_t vaddr = (vm_offset_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 (wsize != 0 && curaddr >= wsize)
175 return (EINVAL);
176
177 curaddr |= 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 */
247 int
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 vm_offset_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(map, buf, buflen,
270 p, flags, t->_wbase, t->_wsize, &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 */
287 int
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 vm_offset_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(map,
317 m->m_data, m->m_len, NULL, flags, t->_wbase, t->_wsize,
318 &lastaddr, &seg, first);
319 first = 0;
320 }
321 if (error == 0) {
322 map->dm_mapsize = m0->m_pkthdr.len;
323 map->dm_nsegs = seg + 1;
324 } else if (t->_next_window != NULL) {
325 /*
326 * Give the next window a chance.
327 */
328 error = bus_dmamap_load_mbuf(t->_next_window, map, m0, flags);
329 }
330 return (error);
331 }
332
333 /*
334 * Like _bus_dmamap_load_direct_common(), but for uios.
335 */
336 int
337 _bus_dmamap_load_uio_direct(t, map, uio, flags)
338 bus_dma_tag_t t;
339 bus_dmamap_t map;
340 struct uio *uio;
341 int flags;
342 {
343
344 panic("_bus_dmamap_load_uio_direct: not implemented");
345 }
346
347 /*
348 * Like _bus_dmamap_load_direct_common(), but for raw memory.
349 */
350 int
351 _bus_dmamap_load_raw_direct(t, map, segs, nsegs, size, flags)
352 bus_dma_tag_t t;
353 bus_dmamap_t map;
354 bus_dma_segment_t *segs;
355 int nsegs;
356 bus_size_t size;
357 int flags;
358 {
359
360 panic("_bus_dmamap_load_raw_direct: not implemented");
361 }
362
363 /*
364 * Common function for unloading a DMA map. May be called by
365 * chipset-specific DMA map unload functions.
366 */
367 void
368 _bus_dmamap_unload(t, map)
369 bus_dma_tag_t t;
370 bus_dmamap_t map;
371 {
372
373 /*
374 * No resources to free; just mark the mappings as
375 * invalid.
376 */
377 map->dm_mapsize = 0;
378 map->dm_nsegs = 0;
379 }
380
381 /*
382 * Common function for DMA map synchronization. May be called
383 * by chipset-specific DMA map synchronization functions.
384 */
385 void
386 _bus_dmamap_sync(t, map, offset, len, ops)
387 bus_dma_tag_t t;
388 bus_dmamap_t map;
389 bus_addr_t offset;
390 bus_size_t len;
391 int ops;
392 {
393
394 /*
395 * Flush the store buffer.
396 */
397 alpha_mb();
398 }
399
400 /*
401 * Common function for DMA-safe memory allocation. May be called
402 * by bus-specific DMA memory allocation functions.
403 */
404 int
405 _bus_dmamem_alloc(t, size, alignment, boundary, segs, nsegs, rsegs, flags)
406 bus_dma_tag_t t;
407 bus_size_t size, alignment, boundary;
408 bus_dma_segment_t *segs;
409 int nsegs;
410 int *rsegs;
411 int flags;
412 {
413 extern vm_offset_t avail_start, avail_end;
414 vm_offset_t curaddr, lastaddr, high;
415 vm_page_t m;
416 struct pglist mlist;
417 int curseg, error;
418
419 /* Always round the size. */
420 size = round_page(size);
421
422 high = avail_end - PAGE_SIZE;
423
424 /*
425 * Allocate pages from the VM system.
426 */
427 TAILQ_INIT(&mlist);
428 #if defined(UVM)
429 error = uvm_pglistalloc(size, avail_start, high, alignment, boundary,
430 &mlist, nsegs, (flags & BUS_DMA_NOWAIT) == 0);
431 #else
432 error = vm_page_alloc_memory(size, avail_start, high,
433 alignment, boundary, &mlist, nsegs, (flags & BUS_DMA_NOWAIT) == 0);
434 #endif
435 if (error)
436 return (error);
437
438 /*
439 * Compute the location, size, and number of segments actually
440 * returned by the VM code.
441 */
442 m = mlist.tqh_first;
443 curseg = 0;
444 lastaddr = segs[curseg].ds_addr = VM_PAGE_TO_PHYS(m);
445 segs[curseg].ds_len = PAGE_SIZE;
446 m = m->pageq.tqe_next;
447
448 for (; m != NULL; m = m->pageq.tqe_next) {
449 curaddr = VM_PAGE_TO_PHYS(m);
450 #ifdef DIAGNOSTIC
451 if (curaddr < avail_start || curaddr >= high) {
452 printf("vm_page_alloc_memory returned non-sensical"
453 " address 0x%lx\n", curaddr);
454 panic("_bus_dmamem_alloc");
455 }
456 #endif
457 if (curaddr == (lastaddr + PAGE_SIZE))
458 segs[curseg].ds_len += PAGE_SIZE;
459 else {
460 curseg++;
461 segs[curseg].ds_addr = curaddr;
462 segs[curseg].ds_len = PAGE_SIZE;
463 }
464 lastaddr = curaddr;
465 }
466
467 *rsegs = curseg + 1;
468
469 return (0);
470 }
471
472 /*
473 * Common function for freeing DMA-safe memory. May be called by
474 * bus-specific DMA memory free functions.
475 */
476 void
477 _bus_dmamem_free(t, segs, nsegs)
478 bus_dma_tag_t t;
479 bus_dma_segment_t *segs;
480 int nsegs;
481 {
482 vm_page_t m;
483 bus_addr_t addr;
484 struct pglist mlist;
485 int curseg;
486
487 /*
488 * Build a list of pages to free back to the VM system.
489 */
490 TAILQ_INIT(&mlist);
491 for (curseg = 0; curseg < nsegs; curseg++) {
492 for (addr = segs[curseg].ds_addr;
493 addr < (segs[curseg].ds_addr + segs[curseg].ds_len);
494 addr += PAGE_SIZE) {
495 m = PHYS_TO_VM_PAGE(addr);
496 TAILQ_INSERT_TAIL(&mlist, m, pageq);
497 }
498 }
499
500 #if defined(UVM)
501 uvm_pglistfree(&mlist);
502 #else
503 vm_page_free_memory(&mlist);
504 #endif
505 }
506
507 /*
508 * Common function for mapping DMA-safe memory. May be called by
509 * bus-specific DMA memory map functions.
510 */
511 int
512 _bus_dmamem_map(t, segs, nsegs, size, kvap, flags)
513 bus_dma_tag_t t;
514 bus_dma_segment_t *segs;
515 int nsegs;
516 size_t size;
517 caddr_t *kvap;
518 int flags;
519 {
520 vm_offset_t va;
521 bus_addr_t addr;
522 int curseg;
523
524 /*
525 * If we're only mapping 1 segment, use K0SEG, to avoid
526 * TLB thrashing.
527 */
528 if (nsegs == 1) {
529 *kvap = (caddr_t)ALPHA_PHYS_TO_K0SEG(segs[0].ds_addr);
530 return (0);
531 }
532
533 size = round_page(size);
534
535 #if defined(UVM)
536 va = uvm_km_valloc(kernel_map, size);
537 #else
538 va = kmem_alloc_pageable(kernel_map, size);
539 #endif
540
541 if (va == 0)
542 return (ENOMEM);
543
544 *kvap = (caddr_t)va;
545
546 for (curseg = 0; curseg < nsegs; curseg++) {
547 for (addr = segs[curseg].ds_addr;
548 addr < (segs[curseg].ds_addr + segs[curseg].ds_len);
549 addr += NBPG, va += NBPG, size -= NBPG) {
550 if (size == 0)
551 panic("_bus_dmamem_map: size botch");
552 #if defined(PMAP_NEW)
553 pmap_kenter_pa(va, addr, VM_PROT_READ | VM_PROT_WRITE);
554 #else
555 pmap_enter(pmap_kernel(), va, addr,
556 VM_PROT_READ | VM_PROT_WRITE, TRUE);
557 #endif
558 }
559 }
560
561 return (0);
562 }
563
564 /*
565 * Common function for unmapping DMA-safe memory. May be called by
566 * bus-specific DMA memory unmapping functions.
567 */
568 void
569 _bus_dmamem_unmap(t, kva, size)
570 bus_dma_tag_t t;
571 caddr_t kva;
572 size_t size;
573 {
574
575 #ifdef DIAGNOSTIC
576 if ((u_long)kva & PGOFSET)
577 panic("_bus_dmamem_unmap");
578 #endif
579
580 /*
581 * Nothing to do if we mapped it with K0SEG.
582 */
583 if (kva >= (caddr_t)ALPHA_K0SEG_BASE &&
584 kva <= (caddr_t)ALPHA_K0SEG_END)
585 return;
586
587 size = round_page(size);
588 #if defined(UVM)
589 uvm_km_free(kernel_map, (vm_offset_t)kva, size);
590 #else
591 kmem_free(kernel_map, (vm_offset_t)kva, size);
592 #endif
593 }
594
595 /*
596 * Common functin for mmap(2)'ing DMA-safe memory. May be called by
597 * bus-specific DMA mmap(2)'ing functions.
598 */
599 int
600 _bus_dmamem_mmap(t, segs, nsegs, off, prot, flags)
601 bus_dma_tag_t t;
602 bus_dma_segment_t *segs;
603 int nsegs, off, prot, flags;
604 {
605 int i;
606
607 for (i = 0; i < nsegs; i++) {
608 #ifdef DIAGNOSTIC
609 if (off & PGOFSET)
610 panic("_bus_dmamem_mmap: offset unaligned");
611 if (segs[i].ds_addr & PGOFSET)
612 panic("_bus_dmamem_mmap: segment unaligned");
613 if (segs[i].ds_len & PGOFSET)
614 panic("_bus_dmamem_mmap: segment size not multiple"
615 " of page size");
616 #endif
617 if (off >= segs[i].ds_len) {
618 off -= segs[i].ds_len;
619 continue;
620 }
621
622 return (alpha_btop((caddr_t)segs[i].ds_addr + off));
623 }
624
625 /* Page not found. */
626 return (-1);
627 }
628