bus_dma.c revision 1.20 1 /* $NetBSD: bus_dma.c,v 1.20 1998/05/29 15:25:07 matt 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.20 1998/05/29 15:25:07 matt 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 vm_offset_t curaddr, lastaddr, baddr, bmask;
154 vm_offset_t vaddr = (vm_offset_t)buf;
155 int seg;
156
157 lastaddr = *lastaddrp;
158 if (map->_dm_boundary > 0)
159 bmask = ~(map->_dm_boundary - 1);
160 else
161 bmask = 0;
162
163 for (seg = *segp; buflen > 0 ; ) {
164 /*
165 * Get the physical address for this segment.
166 */
167 if (p != NULL)
168 curaddr = pmap_extract(p->p_vmspace->vm_map.pmap,
169 vaddr);
170 else
171 curaddr = vtophys(vaddr);
172
173 /*
174 * If we're beyond the current DMA window, indicate
175 * that and try to fall back into SGMAPs.
176 */
177 if (wsize != 0 && curaddr >= wsize)
178 return (EINVAL);
179
180 curaddr |= wbase;
181
182 /*
183 * Compute the segment size, and adjust counts.
184 */
185 sgsize = NBPG - ((u_long)vaddr & PGOFSET);
186 if (buflen < sgsize)
187 sgsize = buflen;
188 /*
189 * Make sure we don't cross any boundaries
190 */
191 if (bmask) {
192 baddr = (curaddr + map->_dm_boundary) & bmask;
193 if (baddr - curaddr < sgsize)
194 sgsize = baddr - curaddr;
195 }
196
197 /*
198 * Insert chunk into a segment, coalescing with
199 * the previous segment if possible.
200 */
201 if (first) {
202 map->dm_segs[seg].ds_addr = curaddr;
203 map->dm_segs[seg].ds_len = sgsize;
204 first = 0;
205 } else {
206 if (curaddr == lastaddr &&
207 (map->dm_segs[seg].ds_len + sgsize) <=
208 map->_dm_maxsegsz &&
209 (map->_dm_boundary == 0 ||
210 (map->dm_segs[seg].ds_addr & bmask) ==
211 ((curaddr + sgsize - 1) & bmask)))
212 map->dm_segs[seg].ds_len += sgsize;
213 else {
214 if (++seg >= map->_dm_segcnt)
215 break;
216 map->dm_segs[seg].ds_addr = curaddr;
217 map->dm_segs[seg].ds_len = sgsize;
218 }
219 }
220
221 lastaddr = curaddr + sgsize;
222 vaddr += sgsize;
223 buflen -= sgsize;
224 }
225
226 *segp = seg;
227 *lastaddrp = lastaddr;
228
229 /*
230 * Did we fit?
231 */
232 if (buflen != 0) {
233 /*
234 * If there is a chained window, we will automatically
235 * fall back to it.
236 */
237 return (EFBIG); /* XXX better return value here? */
238 }
239
240 return (0);
241 }
242
243 /*
244 * Common function for loading a direct-mapped DMA map with a linear
245 * buffer. Called by bus-specific DMA map load functions with the
246 * OR value appropriate for indicating "direct-mapped" for that
247 * chipset.
248 */
249 int
250 _bus_dmamap_load_direct(t, map, buf, buflen, p, flags)
251 bus_dma_tag_t t;
252 bus_dmamap_t map;
253 void *buf;
254 bus_size_t buflen;
255 struct proc *p;
256 int flags;
257 {
258 vm_offset_t lastaddr;
259 int seg, error;
260
261 /*
262 * Make sure that on error condition we return "no valid mappings".
263 */
264 map->dm_mapsize = 0;
265 map->dm_nsegs = 0;
266
267 if (buflen > map->_dm_size)
268 return (EINVAL);
269
270 seg = 0;
271 error = _bus_dmamap_load_buffer_direct_common(map, buf, buflen,
272 p, flags, t->_wbase, t->_wsize, &lastaddr, &seg, 1);
273 if (error == 0) {
274 map->dm_mapsize = buflen;
275 map->dm_nsegs = seg + 1;
276 } else if (t->_next_window != NULL) {
277 /*
278 * Give the next window a chance.
279 */
280 error = bus_dmamap_load(t->_next_window, map, buf, buflen,
281 p, flags);
282 }
283 return (error);
284 }
285
286 /*
287 * Like _bus_dmamap_load_direct_common(), but for mbufs.
288 */
289 int
290 _bus_dmamap_load_mbuf_direct(t, map, m0, flags)
291 bus_dma_tag_t t;
292 bus_dmamap_t map;
293 struct mbuf *m0;
294 int flags;
295 {
296 vm_offset_t lastaddr;
297 int seg, error, first;
298 struct mbuf *m;
299
300 /*
301 * Make sure that on error condition we return "no valid mappings."
302 */
303 map->dm_mapsize = 0;
304 map->dm_nsegs = 0;
305
306 #ifdef DIAGNOSTIC
307 if ((m0->m_flags & M_PKTHDR) == 0)
308 panic("_bus_dmamap_load_mbuf_direct_common: no packet header");
309 #endif
310
311 if (m0->m_pkthdr.len > map->_dm_size)
312 return (EINVAL);
313
314 first = 1;
315 seg = 0;
316 error = 0;
317 for (m = m0; m != NULL && error == 0; m = m->m_next) {
318 error = _bus_dmamap_load_buffer_direct_common(map,
319 m->m_data, m->m_len, NULL, flags, t->_wbase, t->_wsize,
320 &lastaddr, &seg, first);
321 first = 0;
322 }
323 if (error == 0) {
324 map->dm_mapsize = m0->m_pkthdr.len;
325 map->dm_nsegs = seg + 1;
326 } else if (t->_next_window != NULL) {
327 /*
328 * Give the next window a chance.
329 */
330 error = bus_dmamap_load_mbuf(t->_next_window, map, m0, flags);
331 }
332 return (error);
333 }
334
335 /*
336 * Like _bus_dmamap_load_direct_common(), but for uios.
337 */
338 int
339 _bus_dmamap_load_uio_direct(t, map, uio, flags)
340 bus_dma_tag_t t;
341 bus_dmamap_t map;
342 struct uio *uio;
343 int flags;
344 {
345
346 panic("_bus_dmamap_load_uio_direct: not implemented");
347 }
348
349 /*
350 * Like _bus_dmamap_load_direct_common(), but for raw memory.
351 */
352 int
353 _bus_dmamap_load_raw_direct(t, map, segs, nsegs, size, flags)
354 bus_dma_tag_t t;
355 bus_dmamap_t map;
356 bus_dma_segment_t *segs;
357 int nsegs;
358 bus_size_t size;
359 int flags;
360 {
361
362 panic("_bus_dmamap_load_raw_direct: not implemented");
363 }
364
365 /*
366 * Common function for unloading a DMA map. May be called by
367 * chipset-specific DMA map unload functions.
368 */
369 void
370 _bus_dmamap_unload(t, map)
371 bus_dma_tag_t t;
372 bus_dmamap_t map;
373 {
374
375 /*
376 * No resources to free; just mark the mappings as
377 * invalid.
378 */
379 map->dm_mapsize = 0;
380 map->dm_nsegs = 0;
381 }
382
383 /*
384 * Common function for DMA map synchronization. May be called
385 * by chipset-specific DMA map synchronization functions.
386 */
387 void
388 _bus_dmamap_sync(t, map, offset, len, ops)
389 bus_dma_tag_t t;
390 bus_dmamap_t map;
391 bus_addr_t offset;
392 bus_size_t len;
393 int ops;
394 {
395
396 /*
397 * Flush the store buffer.
398 */
399 alpha_mb();
400 }
401
402 /*
403 * Common function for DMA-safe memory allocation. May be called
404 * by bus-specific DMA memory allocation functions.
405 */
406 int
407 _bus_dmamem_alloc(t, size, alignment, boundary, segs, nsegs, rsegs, flags)
408 bus_dma_tag_t t;
409 bus_size_t size, alignment, boundary;
410 bus_dma_segment_t *segs;
411 int nsegs;
412 int *rsegs;
413 int flags;
414 {
415 extern vm_offset_t avail_start, avail_end;
416 vm_offset_t curaddr, lastaddr, high;
417 vm_page_t m;
418 struct pglist mlist;
419 int curseg, error;
420
421 /* Always round the size. */
422 size = round_page(size);
423
424 high = avail_end - PAGE_SIZE;
425
426 /*
427 * Allocate pages from the VM system.
428 */
429 TAILQ_INIT(&mlist);
430 #if defined(UVM)
431 error = uvm_pglistalloc(size, avail_start, high, alignment, boundary,
432 &mlist, nsegs, (flags & BUS_DMA_NOWAIT) == 0);
433 #else
434 error = vm_page_alloc_memory(size, avail_start, high,
435 alignment, boundary, &mlist, nsegs, (flags & BUS_DMA_NOWAIT) == 0);
436 #endif
437 if (error)
438 return (error);
439
440 /*
441 * Compute the location, size, and number of segments actually
442 * returned by the VM code.
443 */
444 m = mlist.tqh_first;
445 curseg = 0;
446 lastaddr = segs[curseg].ds_addr = VM_PAGE_TO_PHYS(m);
447 segs[curseg].ds_len = PAGE_SIZE;
448 m = m->pageq.tqe_next;
449
450 for (; m != NULL; m = m->pageq.tqe_next) {
451 curaddr = VM_PAGE_TO_PHYS(m);
452 #ifdef DIAGNOSTIC
453 if (curaddr < avail_start || curaddr >= high) {
454 printf("vm_page_alloc_memory returned non-sensical"
455 " address 0x%lx\n", curaddr);
456 panic("_bus_dmamem_alloc");
457 }
458 #endif
459 if (curaddr == (lastaddr + PAGE_SIZE))
460 segs[curseg].ds_len += PAGE_SIZE;
461 else {
462 curseg++;
463 segs[curseg].ds_addr = curaddr;
464 segs[curseg].ds_len = PAGE_SIZE;
465 }
466 lastaddr = curaddr;
467 }
468
469 *rsegs = curseg + 1;
470
471 return (0);
472 }
473
474 /*
475 * Common function for freeing DMA-safe memory. May be called by
476 * bus-specific DMA memory free functions.
477 */
478 void
479 _bus_dmamem_free(t, segs, nsegs)
480 bus_dma_tag_t t;
481 bus_dma_segment_t *segs;
482 int nsegs;
483 {
484 vm_page_t m;
485 bus_addr_t addr;
486 struct pglist mlist;
487 int curseg;
488
489 /*
490 * Build a list of pages to free back to the VM system.
491 */
492 TAILQ_INIT(&mlist);
493 for (curseg = 0; curseg < nsegs; curseg++) {
494 for (addr = segs[curseg].ds_addr;
495 addr < (segs[curseg].ds_addr + segs[curseg].ds_len);
496 addr += PAGE_SIZE) {
497 m = PHYS_TO_VM_PAGE(addr);
498 TAILQ_INSERT_TAIL(&mlist, m, pageq);
499 }
500 }
501
502 #if defined(UVM)
503 uvm_pglistfree(&mlist);
504 #else
505 vm_page_free_memory(&mlist);
506 #endif
507 }
508
509 /*
510 * Common function for mapping DMA-safe memory. May be called by
511 * bus-specific DMA memory map functions.
512 */
513 int
514 _bus_dmamem_map(t, segs, nsegs, size, kvap, flags)
515 bus_dma_tag_t t;
516 bus_dma_segment_t *segs;
517 int nsegs;
518 size_t size;
519 caddr_t *kvap;
520 int flags;
521 {
522 vm_offset_t va;
523 bus_addr_t addr;
524 int curseg;
525
526 /*
527 * If we're only mapping 1 segment, use K0SEG, to avoid
528 * TLB thrashing.
529 */
530 if (nsegs == 1) {
531 *kvap = (caddr_t)ALPHA_PHYS_TO_K0SEG(segs[0].ds_addr);
532 return (0);
533 }
534
535 size = round_page(size);
536
537 #if defined(UVM)
538 va = uvm_km_valloc(kernel_map, size);
539 #else
540 va = kmem_alloc_pageable(kernel_map, size);
541 #endif
542
543 if (va == 0)
544 return (ENOMEM);
545
546 *kvap = (caddr_t)va;
547
548 for (curseg = 0; curseg < nsegs; curseg++) {
549 for (addr = segs[curseg].ds_addr;
550 addr < (segs[curseg].ds_addr + segs[curseg].ds_len);
551 addr += NBPG, va += NBPG, size -= NBPG) {
552 if (size == 0)
553 panic("_bus_dmamem_map: size botch");
554 #if defined(PMAP_NEW)
555 pmap_kenter_pa(va, addr, VM_PROT_READ | VM_PROT_WRITE);
556 #else
557 pmap_enter(pmap_kernel(), va, addr,
558 VM_PROT_READ | VM_PROT_WRITE, TRUE);
559 #endif
560 }
561 }
562
563 return (0);
564 }
565
566 /*
567 * Common function for unmapping DMA-safe memory. May be called by
568 * bus-specific DMA memory unmapping functions.
569 */
570 void
571 _bus_dmamem_unmap(t, kva, size)
572 bus_dma_tag_t t;
573 caddr_t kva;
574 size_t size;
575 {
576
577 #ifdef DIAGNOSTIC
578 if ((u_long)kva & PGOFSET)
579 panic("_bus_dmamem_unmap");
580 #endif
581
582 /*
583 * Nothing to do if we mapped it with K0SEG.
584 */
585 if (kva >= (caddr_t)ALPHA_K0SEG_BASE &&
586 kva <= (caddr_t)ALPHA_K0SEG_END)
587 return;
588
589 size = round_page(size);
590 #if defined(UVM)
591 uvm_km_free(kernel_map, (vm_offset_t)kva, size);
592 #else
593 kmem_free(kernel_map, (vm_offset_t)kva, size);
594 #endif
595 }
596
597 /*
598 * Common functin for mmap(2)'ing DMA-safe memory. May be called by
599 * bus-specific DMA mmap(2)'ing functions.
600 */
601 int
602 _bus_dmamem_mmap(t, segs, nsegs, off, prot, flags)
603 bus_dma_tag_t t;
604 bus_dma_segment_t *segs;
605 int nsegs, off, prot, flags;
606 {
607 int i;
608
609 for (i = 0; i < nsegs; i++) {
610 #ifdef DIAGNOSTIC
611 if (off & PGOFSET)
612 panic("_bus_dmamem_mmap: offset unaligned");
613 if (segs[i].ds_addr & PGOFSET)
614 panic("_bus_dmamem_mmap: segment unaligned");
615 if (segs[i].ds_len & PGOFSET)
616 panic("_bus_dmamem_mmap: segment size not multiple"
617 " of page size");
618 #endif
619 if (off >= segs[i].ds_len) {
620 off -= segs[i].ds_len;
621 continue;
622 }
623
624 return (alpha_btop((caddr_t)segs[i].ds_addr + off));
625 }
626
627 /* Page not found. */
628 return (-1);
629 }
630