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