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