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