bus_dma.c revision 1.15 1 1.15 thorpej /* $NetBSD: bus_dma.c,v 1.15 2002/09/25 22:21:29 thorpej Exp $ */
2 1.1 ragge
3 1.1 ragge /*-
4 1.1 ragge * Copyright (c) 1996, 1997, 1998 The NetBSD Foundation, Inc.
5 1.1 ragge * All rights reserved.
6 1.1 ragge *
7 1.1 ragge * This code is derived from software contributed to The NetBSD Foundation
8 1.1 ragge * by Jason R. Thorpe of the Numerical Aerospace Simulation Facility,
9 1.1 ragge * NASA Ames Research Center.
10 1.1 ragge *
11 1.1 ragge * Redistribution and use in source and binary forms, with or without
12 1.1 ragge * modification, are permitted provided that the following conditions
13 1.1 ragge * are met:
14 1.1 ragge * 1. Redistributions of source code must retain the above copyright
15 1.1 ragge * notice, this list of conditions and the following disclaimer.
16 1.1 ragge * 2. Redistributions in binary form must reproduce the above copyright
17 1.1 ragge * notice, this list of conditions and the following disclaimer in the
18 1.1 ragge * documentation and/or other materials provided with the distribution.
19 1.1 ragge * 3. All advertising materials mentioning features or use of this software
20 1.1 ragge * must display the following acknowledgement:
21 1.1 ragge * This product includes software developed by the NetBSD
22 1.1 ragge * Foundation, Inc. and its contributors.
23 1.1 ragge * 4. Neither the name of The NetBSD Foundation nor the names of its
24 1.1 ragge * contributors may be used to endorse or promote products derived
25 1.1 ragge * from this software without specific prior written permission.
26 1.1 ragge *
27 1.1 ragge * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
28 1.1 ragge * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
29 1.1 ragge * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
30 1.1 ragge * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
31 1.1 ragge * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
32 1.1 ragge * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
33 1.1 ragge * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
34 1.1 ragge * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
35 1.1 ragge * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
36 1.1 ragge * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
37 1.1 ragge * POSSIBILITY OF SUCH DAMAGE.
38 1.1 ragge */
39 1.1 ragge /*
40 1.1 ragge * bus_dma routines for vax. File copied from arm32/bus_dma.c.
41 1.1 ragge * NetBSD: bus_dma.c,v 1.11 1998/09/21 22:53:35 thorpej Exp
42 1.1 ragge */
43 1.1 ragge
44 1.1 ragge #include <sys/param.h>
45 1.1 ragge #include <sys/systm.h>
46 1.1 ragge #include <sys/kernel.h>
47 1.1 ragge #include <sys/proc.h>
48 1.1 ragge #include <sys/buf.h>
49 1.1 ragge #include <sys/reboot.h>
50 1.1 ragge #include <sys/conf.h>
51 1.1 ragge #include <sys/file.h>
52 1.1 ragge #include <sys/malloc.h>
53 1.1 ragge #include <sys/mbuf.h>
54 1.1 ragge #include <sys/vnode.h>
55 1.1 ragge #include <sys/device.h>
56 1.1 ragge
57 1.1 ragge #include <uvm/uvm_extern.h>
58 1.1 ragge
59 1.1 ragge #define _VAX_BUS_DMA_PRIVATE
60 1.1 ragge #include <machine/bus.h>
61 1.1 ragge
62 1.1 ragge #include <machine/ka43.h>
63 1.1 ragge #include <machine/sid.h>
64 1.1 ragge
65 1.1 ragge extern vaddr_t avail_start, avail_end, virtual_avail;
66 1.1 ragge
67 1.1 ragge int _bus_dmamap_load_buffer __P((bus_dma_tag_t, bus_dmamap_t, void *,
68 1.6 matt bus_size_t, struct proc *, int, vaddr_t *, int *, int));
69 1.1 ragge int _bus_dma_inrange __P((bus_dma_segment_t *, int, bus_addr_t));
70 1.1 ragge int _bus_dmamem_alloc_range __P((bus_dma_tag_t, bus_size_t, bus_size_t,
71 1.1 ragge bus_size_t, bus_dma_segment_t*, int, int *, int, vaddr_t, vaddr_t));
72 1.1 ragge /*
73 1.1 ragge * Common function for DMA map creation. May be called by bus-specific
74 1.1 ragge * DMA map creation functions.
75 1.1 ragge */
76 1.1 ragge int
77 1.1 ragge _bus_dmamap_create(t, size, nsegments, maxsegsz, boundary, flags, dmamp)
78 1.1 ragge bus_dma_tag_t t;
79 1.1 ragge bus_size_t size;
80 1.1 ragge int nsegments;
81 1.1 ragge bus_size_t maxsegsz;
82 1.1 ragge bus_size_t boundary;
83 1.1 ragge int flags;
84 1.1 ragge bus_dmamap_t *dmamp;
85 1.1 ragge {
86 1.1 ragge struct vax_bus_dmamap *map;
87 1.1 ragge void *mapstore;
88 1.1 ragge size_t mapsize;
89 1.1 ragge
90 1.1 ragge #ifdef DEBUG_DMA
91 1.1 ragge printf("dmamap_create: t=%p size=%lx nseg=%x msegsz=%lx boundary=%lx flags=%x\n",
92 1.1 ragge t, size, nsegments, maxsegsz, boundary, flags);
93 1.1 ragge #endif /* DEBUG_DMA */
94 1.1 ragge
95 1.1 ragge /*
96 1.1 ragge * Allocate and initialize the DMA map. The end of the map
97 1.1 ragge * is a variable-sized array of segments, so we allocate enough
98 1.1 ragge * room for them in one shot.
99 1.1 ragge *
100 1.1 ragge * Note we don't preserve the WAITOK or NOWAIT flags. Preservation
101 1.1 ragge * of ALLOCNOW notifies others that we've reserved these resources,
102 1.1 ragge * and they are not to be freed.
103 1.1 ragge *
104 1.1 ragge * The bus_dmamap_t includes one bus_dma_segment_t, hence
105 1.1 ragge * the (nsegments - 1).
106 1.1 ragge */
107 1.1 ragge mapsize = sizeof(struct vax_bus_dmamap) +
108 1.1 ragge (sizeof(bus_dma_segment_t) * (nsegments - 1));
109 1.1 ragge if ((mapstore = malloc(mapsize, M_DMAMAP,
110 1.1 ragge (flags & BUS_DMA_NOWAIT) ? M_NOWAIT : M_WAITOK)) == NULL)
111 1.1 ragge return (ENOMEM);
112 1.1 ragge
113 1.1 ragge bzero(mapstore, mapsize);
114 1.1 ragge map = (struct vax_bus_dmamap *)mapstore;
115 1.1 ragge map->_dm_size = size;
116 1.1 ragge map->_dm_segcnt = nsegments;
117 1.1 ragge map->_dm_maxsegsz = maxsegsz;
118 1.1 ragge map->_dm_boundary = boundary;
119 1.1 ragge map->_dm_flags = flags & ~(BUS_DMA_WAITOK|BUS_DMA_NOWAIT);
120 1.1 ragge map->dm_mapsize = 0; /* no valid mappings */
121 1.1 ragge map->dm_nsegs = 0;
122 1.1 ragge
123 1.1 ragge *dmamp = map;
124 1.1 ragge #ifdef DEBUG_DMA
125 1.1 ragge printf("dmamap_create:map=%p\n", map);
126 1.1 ragge #endif /* DEBUG_DMA */
127 1.1 ragge return (0);
128 1.1 ragge }
129 1.1 ragge
130 1.1 ragge /*
131 1.1 ragge * Common function for DMA map destruction. May be called by bus-specific
132 1.1 ragge * DMA map destruction functions.
133 1.1 ragge */
134 1.1 ragge void
135 1.1 ragge _bus_dmamap_destroy(t, map)
136 1.1 ragge bus_dma_tag_t t;
137 1.1 ragge bus_dmamap_t map;
138 1.1 ragge {
139 1.1 ragge
140 1.1 ragge #ifdef DEBUG_DMA
141 1.1 ragge printf("dmamap_destroy: t=%p map=%p\n", t, map);
142 1.1 ragge #endif /* DEBUG_DMA */
143 1.1 ragge #ifdef DIAGNOSTIC
144 1.1 ragge if (map->dm_nsegs > 0)
145 1.1 ragge printf("bus_dmamap_destroy() called for map with valid mappings\n");
146 1.1 ragge #endif /* DIAGNOSTIC */
147 1.1 ragge free(map, M_DEVBUF);
148 1.1 ragge }
149 1.1 ragge
150 1.1 ragge /*
151 1.1 ragge * Common function for loading a DMA map with a linear buffer. May
152 1.1 ragge * be called by bus-specific DMA map load functions.
153 1.1 ragge */
154 1.1 ragge int
155 1.1 ragge _bus_dmamap_load(t, map, buf, buflen, p, flags)
156 1.1 ragge bus_dma_tag_t t;
157 1.1 ragge bus_dmamap_t map;
158 1.1 ragge void *buf;
159 1.1 ragge bus_size_t buflen;
160 1.1 ragge struct proc *p;
161 1.1 ragge int flags;
162 1.1 ragge {
163 1.6 matt vaddr_t lastaddr;
164 1.1 ragge int seg, error;
165 1.1 ragge
166 1.1 ragge #ifdef DEBUG_DMA
167 1.1 ragge printf("dmamap_load: t=%p map=%p buf=%p len=%lx p=%p f=%d\n",
168 1.1 ragge t, map, buf, buflen, p, flags);
169 1.1 ragge #endif /* DEBUG_DMA */
170 1.1 ragge
171 1.1 ragge /*
172 1.1 ragge * Make sure that on error condition we return "no valid mappings".
173 1.1 ragge */
174 1.1 ragge map->dm_mapsize = 0;
175 1.1 ragge map->dm_nsegs = 0;
176 1.1 ragge
177 1.1 ragge if (buflen > map->_dm_size)
178 1.1 ragge return (EINVAL);
179 1.1 ragge
180 1.1 ragge seg = 0;
181 1.1 ragge error = _bus_dmamap_load_buffer(t, map, buf, buflen, p, flags,
182 1.1 ragge &lastaddr, &seg, 1);
183 1.1 ragge if (error == 0) {
184 1.1 ragge map->dm_mapsize = buflen;
185 1.1 ragge map->dm_nsegs = seg + 1;
186 1.1 ragge }
187 1.1 ragge #ifdef DEBUG_DMA
188 1.1 ragge printf("dmamap_load: error=%d\n", error);
189 1.1 ragge #endif /* DEBUG_DMA */
190 1.1 ragge return (error);
191 1.1 ragge }
192 1.1 ragge
193 1.1 ragge /*
194 1.1 ragge * Like _bus_dmamap_load(), but for mbufs.
195 1.1 ragge */
196 1.1 ragge int
197 1.1 ragge _bus_dmamap_load_mbuf(t, map, m0, flags)
198 1.1 ragge bus_dma_tag_t t;
199 1.1 ragge bus_dmamap_t map;
200 1.1 ragge struct mbuf *m0;
201 1.1 ragge int flags;
202 1.1 ragge {
203 1.6 matt vaddr_t lastaddr;
204 1.1 ragge int seg, error, first;
205 1.1 ragge struct mbuf *m;
206 1.1 ragge
207 1.1 ragge #ifdef DEBUG_DMA
208 1.1 ragge printf("dmamap_load_mbuf: t=%p map=%p m0=%p f=%d\n",
209 1.1 ragge t, map, m0, flags);
210 1.1 ragge #endif /* DEBUG_DMA */
211 1.1 ragge
212 1.1 ragge /*
213 1.1 ragge * Make sure that on error condition we return "no valid mappings."
214 1.1 ragge */
215 1.1 ragge map->dm_mapsize = 0;
216 1.1 ragge map->dm_nsegs = 0;
217 1.1 ragge
218 1.1 ragge #ifdef DIAGNOSTIC
219 1.1 ragge if ((m0->m_flags & M_PKTHDR) == 0)
220 1.1 ragge panic("_bus_dmamap_load_mbuf: no packet header");
221 1.1 ragge #endif /* DIAGNOSTIC */
222 1.1 ragge
223 1.1 ragge if (m0->m_pkthdr.len > map->_dm_size)
224 1.1 ragge return (EINVAL);
225 1.1 ragge
226 1.1 ragge first = 1;
227 1.1 ragge seg = 0;
228 1.1 ragge error = 0;
229 1.1 ragge for (m = m0; m != NULL && error == 0; m = m->m_next) {
230 1.1 ragge error = _bus_dmamap_load_buffer(t, map, m->m_data, m->m_len,
231 1.1 ragge NULL, flags, &lastaddr, &seg, first);
232 1.1 ragge first = 0;
233 1.1 ragge }
234 1.1 ragge if (error == 0) {
235 1.1 ragge map->dm_mapsize = m0->m_pkthdr.len;
236 1.1 ragge map->dm_nsegs = seg + 1;
237 1.1 ragge }
238 1.1 ragge #ifdef DEBUG_DMA
239 1.1 ragge printf("dmamap_load_mbuf: error=%d\n", error);
240 1.1 ragge #endif /* DEBUG_DMA */
241 1.1 ragge return (error);
242 1.1 ragge }
243 1.1 ragge
244 1.1 ragge /*
245 1.1 ragge * Like _bus_dmamap_load(), but for uios.
246 1.1 ragge */
247 1.1 ragge int
248 1.1 ragge _bus_dmamap_load_uio(t, map, uio, flags)
249 1.1 ragge bus_dma_tag_t t;
250 1.1 ragge bus_dmamap_t map;
251 1.1 ragge struct uio *uio;
252 1.1 ragge int flags;
253 1.1 ragge {
254 1.6 matt vaddr_t lastaddr;
255 1.1 ragge int seg, i, error, first;
256 1.1 ragge bus_size_t minlen, resid;
257 1.1 ragge struct proc *p = NULL;
258 1.1 ragge struct iovec *iov;
259 1.1 ragge caddr_t addr;
260 1.1 ragge
261 1.1 ragge /*
262 1.1 ragge * Make sure that on error condition we return "no valid mappings."
263 1.1 ragge */
264 1.1 ragge map->dm_mapsize = 0;
265 1.1 ragge map->dm_nsegs = 0;
266 1.1 ragge
267 1.1 ragge resid = uio->uio_resid;
268 1.1 ragge iov = uio->uio_iov;
269 1.1 ragge
270 1.1 ragge if (uio->uio_segflg == UIO_USERSPACE) {
271 1.1 ragge p = uio->uio_procp;
272 1.1 ragge #ifdef DIAGNOSTIC
273 1.1 ragge if (p == NULL)
274 1.1 ragge panic("_bus_dmamap_load_uio: USERSPACE but no proc");
275 1.1 ragge #endif
276 1.1 ragge }
277 1.1 ragge
278 1.1 ragge first = 1;
279 1.1 ragge seg = 0;
280 1.1 ragge error = 0;
281 1.1 ragge for (i = 0; i < uio->uio_iovcnt && resid != 0 && error == 0; i++) {
282 1.1 ragge /*
283 1.1 ragge * Now at the first iovec to load. Load each iovec
284 1.1 ragge * until we have exhausted the residual count.
285 1.1 ragge */
286 1.1 ragge minlen = resid < iov[i].iov_len ? resid : iov[i].iov_len;
287 1.1 ragge addr = (caddr_t)iov[i].iov_base;
288 1.1 ragge
289 1.1 ragge error = _bus_dmamap_load_buffer(t, map, addr, minlen,
290 1.1 ragge p, flags, &lastaddr, &seg, first);
291 1.1 ragge first = 0;
292 1.1 ragge
293 1.1 ragge resid -= minlen;
294 1.1 ragge }
295 1.1 ragge if (error == 0) {
296 1.1 ragge map->dm_mapsize = uio->uio_resid;
297 1.1 ragge map->dm_nsegs = seg + 1;
298 1.1 ragge }
299 1.1 ragge return (error);
300 1.1 ragge }
301 1.1 ragge
302 1.1 ragge /*
303 1.1 ragge * Like _bus_dmamap_load(), but for raw memory allocated with
304 1.1 ragge * bus_dmamem_alloc().
305 1.1 ragge */
306 1.1 ragge int
307 1.1 ragge _bus_dmamap_load_raw(t, map, segs, nsegs, size, flags)
308 1.1 ragge bus_dma_tag_t t;
309 1.1 ragge bus_dmamap_t map;
310 1.1 ragge bus_dma_segment_t *segs;
311 1.1 ragge int nsegs;
312 1.1 ragge bus_size_t size;
313 1.1 ragge int flags;
314 1.1 ragge {
315 1.1 ragge
316 1.1 ragge panic("_bus_dmamap_load_raw: not implemented");
317 1.1 ragge }
318 1.1 ragge
319 1.1 ragge /*
320 1.1 ragge * Common function for unloading a DMA map. May be called by
321 1.1 ragge * bus-specific DMA map unload functions.
322 1.1 ragge */
323 1.1 ragge void
324 1.1 ragge _bus_dmamap_unload(t, map)
325 1.1 ragge bus_dma_tag_t t;
326 1.1 ragge bus_dmamap_t map;
327 1.1 ragge {
328 1.1 ragge
329 1.1 ragge #ifdef DEBUG_DMA
330 1.1 ragge printf("dmamap_unload: t=%p map=%p\n", t, map);
331 1.1 ragge #endif /* DEBUG_DMA */
332 1.1 ragge
333 1.1 ragge /*
334 1.1 ragge * No resources to free; just mark the mappings as
335 1.1 ragge * invalid.
336 1.1 ragge */
337 1.1 ragge map->dm_mapsize = 0;
338 1.1 ragge map->dm_nsegs = 0;
339 1.1 ragge }
340 1.1 ragge
341 1.1 ragge /*
342 1.1 ragge * Common function for DMA map synchronization. May be called
343 1.1 ragge * by bus-specific DMA map synchronization functions.
344 1.1 ragge */
345 1.1 ragge void
346 1.1 ragge _bus_dmamap_sync(t, map, offset, len, ops)
347 1.1 ragge bus_dma_tag_t t;
348 1.1 ragge bus_dmamap_t map;
349 1.1 ragge bus_addr_t offset;
350 1.1 ragge bus_size_t len;
351 1.1 ragge int ops;
352 1.1 ragge {
353 1.1 ragge #ifdef DEBUG_DMA
354 1.1 ragge printf("dmamap_sync: t=%p map=%p offset=%lx len=%lx ops=%x\n",
355 1.1 ragge t, map, offset, len, ops);
356 1.1 ragge #endif /* DEBUG_DMA */
357 1.1 ragge /*
358 1.1 ragge * A vax only has snoop-cache, so this routine is a no-op.
359 1.1 ragge */
360 1.1 ragge return;
361 1.1 ragge }
362 1.1 ragge
363 1.1 ragge /*
364 1.1 ragge * Common function for DMA-safe memory allocation. May be called
365 1.1 ragge * by bus-specific DMA memory allocation functions.
366 1.1 ragge */
367 1.1 ragge
368 1.1 ragge int
369 1.1 ragge _bus_dmamem_alloc(t, size, alignment, boundary, segs, nsegs, rsegs, flags)
370 1.1 ragge bus_dma_tag_t t;
371 1.1 ragge bus_size_t size, alignment, boundary;
372 1.1 ragge bus_dma_segment_t *segs;
373 1.1 ragge int nsegs;
374 1.1 ragge int *rsegs;
375 1.1 ragge int flags;
376 1.1 ragge {
377 1.1 ragge int error;
378 1.1 ragge
379 1.1 ragge error = (_bus_dmamem_alloc_range(t, size, alignment, boundary,
380 1.1 ragge segs, nsegs, rsegs, flags, round_page(avail_start),
381 1.1 ragge trunc_page(avail_end)));
382 1.1 ragge return(error);
383 1.1 ragge }
384 1.1 ragge
385 1.1 ragge /*
386 1.1 ragge * Common function for freeing DMA-safe memory. May be called by
387 1.1 ragge * bus-specific DMA memory free functions.
388 1.1 ragge */
389 1.1 ragge void
390 1.1 ragge _bus_dmamem_free(t, segs, nsegs)
391 1.1 ragge bus_dma_tag_t t;
392 1.1 ragge bus_dma_segment_t *segs;
393 1.1 ragge int nsegs;
394 1.1 ragge {
395 1.12 chs struct vm_page *m;
396 1.1 ragge bus_addr_t addr;
397 1.1 ragge struct pglist mlist;
398 1.1 ragge int curseg;
399 1.1 ragge
400 1.1 ragge #ifdef DEBUG_DMA
401 1.1 ragge printf("dmamem_free: t=%p segs=%p nsegs=%x\n", t, segs, nsegs);
402 1.1 ragge #endif /* DEBUG_DMA */
403 1.1 ragge
404 1.1 ragge /*
405 1.1 ragge * Build a list of pages to free back to the VM system.
406 1.1 ragge */
407 1.1 ragge TAILQ_INIT(&mlist);
408 1.1 ragge for (curseg = 0; curseg < nsegs; curseg++) {
409 1.1 ragge for (addr = segs[curseg].ds_addr;
410 1.1 ragge addr < (segs[curseg].ds_addr + segs[curseg].ds_len);
411 1.1 ragge addr += PAGE_SIZE) {
412 1.1 ragge m = PHYS_TO_VM_PAGE(addr);
413 1.1 ragge TAILQ_INSERT_TAIL(&mlist, m, pageq);
414 1.1 ragge }
415 1.1 ragge }
416 1.1 ragge uvm_pglistfree(&mlist);
417 1.1 ragge }
418 1.1 ragge
419 1.1 ragge /*
420 1.1 ragge * Common function for mapping DMA-safe memory. May be called by
421 1.1 ragge * bus-specific DMA memory map functions.
422 1.1 ragge */
423 1.1 ragge int
424 1.1 ragge _bus_dmamem_map(t, segs, nsegs, size, kvap, flags)
425 1.1 ragge bus_dma_tag_t t;
426 1.1 ragge bus_dma_segment_t *segs;
427 1.1 ragge int nsegs;
428 1.1 ragge size_t size;
429 1.1 ragge caddr_t *kvap;
430 1.1 ragge int flags;
431 1.1 ragge {
432 1.6 matt vaddr_t va;
433 1.1 ragge bus_addr_t addr;
434 1.1 ragge int curseg;
435 1.1 ragge
436 1.1 ragge /*
437 1.1 ragge * Special case (but common):
438 1.1 ragge * If there is only one physical segment then the already-mapped
439 1.1 ragge * virtual address is returned, since all physical memory is already
440 1.1 ragge * in the beginning of kernel virtual memory.
441 1.1 ragge */
442 1.1 ragge if (nsegs == 1) {
443 1.1 ragge *kvap = (caddr_t)(segs[0].ds_addr | KERNBASE);
444 1.1 ragge /*
445 1.1 ragge * KA43 (3100/m76) must have its DMA-safe memory accessed
446 1.1 ragge * through DIAGMEM. Remap it here.
447 1.1 ragge */
448 1.1 ragge if (vax_boardtype == VAX_BTYP_43) {
449 1.1 ragge pmap_map((vaddr_t)*kvap, segs[0].ds_addr|KA43_DIAGMEM,
450 1.1 ragge (segs[0].ds_addr|KA43_DIAGMEM) + size,
451 1.1 ragge VM_PROT_READ|VM_PROT_WRITE);
452 1.1 ragge }
453 1.1 ragge return 0;
454 1.1 ragge }
455 1.1 ragge size = round_page(size);
456 1.1 ragge va = uvm_km_valloc(kernel_map, size);
457 1.1 ragge
458 1.1 ragge if (va == 0)
459 1.1 ragge return (ENOMEM);
460 1.1 ragge
461 1.1 ragge *kvap = (caddr_t)va;
462 1.1 ragge
463 1.1 ragge for (curseg = 0; curseg < nsegs; curseg++) {
464 1.1 ragge for (addr = segs[curseg].ds_addr;
465 1.1 ragge addr < (segs[curseg].ds_addr + segs[curseg].ds_len);
466 1.1 ragge addr += NBPG, va += NBPG, size -= NBPG) {
467 1.1 ragge if (size == 0)
468 1.1 ragge panic("_bus_dmamem_map: size botch");
469 1.1 ragge if (vax_boardtype == VAX_BTYP_43)
470 1.1 ragge addr |= KA43_DIAGMEM;
471 1.2 thorpej pmap_enter(pmap_kernel(), va, addr,
472 1.5 thorpej VM_PROT_READ | VM_PROT_WRITE,
473 1.5 thorpej VM_PROT_READ | VM_PROT_WRITE | PMAP_WIRED);
474 1.1 ragge }
475 1.1 ragge }
476 1.13 chris pmap_update(pmap_kernel());
477 1.1 ragge return (0);
478 1.1 ragge }
479 1.1 ragge
480 1.1 ragge /*
481 1.1 ragge * Common function for unmapping DMA-safe memory. May be called by
482 1.1 ragge * bus-specific DMA memory unmapping functions.
483 1.1 ragge */
484 1.1 ragge void
485 1.1 ragge _bus_dmamem_unmap(t, kva, size)
486 1.1 ragge bus_dma_tag_t t;
487 1.1 ragge caddr_t kva;
488 1.1 ragge size_t size;
489 1.1 ragge {
490 1.1 ragge
491 1.1 ragge #ifdef DEBUG_DMA
492 1.1 ragge printf("dmamem_unmap: t=%p kva=%p size=%x\n", t, kva, size);
493 1.1 ragge #endif /* DEBUG_DMA */
494 1.1 ragge #ifdef DIAGNOSTIC
495 1.1 ragge if ((u_long)kva & PGOFSET)
496 1.1 ragge panic("_bus_dmamem_unmap");
497 1.1 ragge #endif /* DIAGNOSTIC */
498 1.1 ragge
499 1.1 ragge /* Avoid free'ing if not mapped */
500 1.1 ragge if (kva >= (caddr_t)virtual_avail)
501 1.6 matt uvm_km_free(kernel_map, (vaddr_t)kva, round_page(size));
502 1.1 ragge }
503 1.1 ragge
504 1.1 ragge /*
505 1.1 ragge * Common functin for mmap(2)'ing DMA-safe memory. May be called by
506 1.1 ragge * bus-specific DMA mmap(2)'ing functions.
507 1.1 ragge */
508 1.7 simonb paddr_t
509 1.1 ragge _bus_dmamem_mmap(t, segs, nsegs, off, prot, flags)
510 1.1 ragge bus_dma_tag_t t;
511 1.1 ragge bus_dma_segment_t *segs;
512 1.7 simonb int nsegs;
513 1.7 simonb off_t off;
514 1.7 simonb int prot, flags;
515 1.1 ragge {
516 1.1 ragge int i;
517 1.1 ragge
518 1.1 ragge for (i = 0; i < nsegs; i++) {
519 1.1 ragge #ifdef DIAGNOSTIC
520 1.1 ragge if (off & PGOFSET)
521 1.1 ragge panic("_bus_dmamem_mmap: offset unaligned");
522 1.1 ragge if (segs[i].ds_addr & PGOFSET)
523 1.1 ragge panic("_bus_dmamem_mmap: segment unaligned");
524 1.1 ragge if (segs[i].ds_len & PGOFSET)
525 1.1 ragge panic("_bus_dmamem_mmap: segment size not multiple"
526 1.1 ragge " of page size");
527 1.1 ragge #endif /* DIAGNOSTIC */
528 1.1 ragge if (off >= segs[i].ds_len) {
529 1.1 ragge off -= segs[i].ds_len;
530 1.1 ragge continue;
531 1.1 ragge }
532 1.1 ragge
533 1.1 ragge return (btop((u_long)segs[i].ds_addr + off));
534 1.1 ragge }
535 1.1 ragge
536 1.1 ragge /* Page not found. */
537 1.1 ragge return (-1);
538 1.1 ragge }
539 1.1 ragge
540 1.1 ragge /**********************************************************************
541 1.1 ragge * DMA utility functions
542 1.1 ragge **********************************************************************/
543 1.1 ragge
544 1.1 ragge /*
545 1.1 ragge * Utility function to load a linear buffer. lastaddrp holds state
546 1.1 ragge * between invocations (for multiple-buffer loads). segp contains
547 1.1 ragge * the starting segment on entrace, and the ending segment on exit.
548 1.1 ragge * first indicates if this is the first invocation of this function.
549 1.1 ragge */
550 1.1 ragge int
551 1.1 ragge _bus_dmamap_load_buffer(t, map, buf, buflen, p, flags, lastaddrp, segp, first)
552 1.1 ragge bus_dma_tag_t t;
553 1.1 ragge bus_dmamap_t map;
554 1.1 ragge void *buf;
555 1.1 ragge bus_size_t buflen;
556 1.1 ragge struct proc *p;
557 1.1 ragge int flags;
558 1.6 matt vaddr_t *lastaddrp;
559 1.1 ragge int *segp;
560 1.1 ragge int first;
561 1.1 ragge {
562 1.1 ragge bus_size_t sgsize;
563 1.1 ragge bus_addr_t curaddr, lastaddr, baddr, bmask;
564 1.6 matt vaddr_t vaddr = (vaddr_t)buf;
565 1.1 ragge int seg;
566 1.1 ragge pmap_t pmap;
567 1.1 ragge
568 1.1 ragge #ifdef DEBUG_DMA
569 1.1 ragge printf("_bus_dmamem_load_buffer(buf=%p, len=%lx, flags=%d, 1st=%d)\n",
570 1.1 ragge buf, buflen, flags, first);
571 1.1 ragge #endif /* DEBUG_DMA */
572 1.1 ragge
573 1.1 ragge if (p != NULL)
574 1.1 ragge pmap = p->p_vmspace->vm_map.pmap;
575 1.1 ragge else
576 1.1 ragge pmap = pmap_kernel();
577 1.1 ragge
578 1.1 ragge lastaddr = *lastaddrp;
579 1.1 ragge bmask = ~(map->_dm_boundary - 1);
580 1.1 ragge
581 1.1 ragge for (seg = *segp; buflen > 0; ) {
582 1.1 ragge /*
583 1.1 ragge * Get the physical address for this segment.
584 1.1 ragge */
585 1.3 thorpej (void) pmap_extract(pmap, (vaddr_t)vaddr, &curaddr);
586 1.1 ragge
587 1.1 ragge #if 0
588 1.1 ragge /*
589 1.1 ragge * Make sure we're in an allowed DMA range.
590 1.1 ragge */
591 1.1 ragge if (t->_ranges != NULL &&
592 1.1 ragge _bus_dma_inrange(t->_ranges, t->_nranges, curaddr) == 0)
593 1.1 ragge return (EINVAL);
594 1.1 ragge #endif
595 1.1 ragge
596 1.1 ragge /*
597 1.1 ragge * Compute the segment size, and adjust counts.
598 1.1 ragge */
599 1.1 ragge sgsize = NBPG - ((u_long)vaddr & PGOFSET);
600 1.1 ragge if (buflen < sgsize)
601 1.1 ragge sgsize = buflen;
602 1.1 ragge
603 1.1 ragge /*
604 1.1 ragge * Make sure we don't cross any boundaries.
605 1.1 ragge */
606 1.1 ragge if (map->_dm_boundary > 0) {
607 1.1 ragge baddr = (curaddr + map->_dm_boundary) & bmask;
608 1.1 ragge if (sgsize > (baddr - curaddr))
609 1.1 ragge sgsize = (baddr - curaddr);
610 1.1 ragge }
611 1.1 ragge
612 1.1 ragge /*
613 1.1 ragge * Insert chunk into a segment, coalescing with
614 1.1 ragge * previous segment if possible.
615 1.1 ragge */
616 1.1 ragge if (first) {
617 1.1 ragge map->dm_segs[seg].ds_addr = curaddr;
618 1.1 ragge map->dm_segs[seg].ds_len = sgsize;
619 1.1 ragge first = 0;
620 1.1 ragge } else {
621 1.1 ragge if (curaddr == lastaddr &&
622 1.1 ragge (map->dm_segs[seg].ds_len + sgsize) <=
623 1.1 ragge map->_dm_maxsegsz &&
624 1.1 ragge (map->_dm_boundary == 0 ||
625 1.1 ragge (map->dm_segs[seg].ds_addr & bmask) ==
626 1.1 ragge (curaddr & bmask)))
627 1.1 ragge map->dm_segs[seg].ds_len += sgsize;
628 1.1 ragge else {
629 1.1 ragge if (++seg >= map->_dm_segcnt)
630 1.1 ragge break;
631 1.1 ragge map->dm_segs[seg].ds_addr = curaddr;
632 1.1 ragge map->dm_segs[seg].ds_len = sgsize;
633 1.1 ragge }
634 1.1 ragge }
635 1.1 ragge
636 1.1 ragge lastaddr = curaddr + sgsize;
637 1.1 ragge vaddr += sgsize;
638 1.1 ragge buflen -= sgsize;
639 1.1 ragge }
640 1.1 ragge
641 1.1 ragge *segp = seg;
642 1.1 ragge *lastaddrp = lastaddr;
643 1.1 ragge
644 1.1 ragge /*
645 1.1 ragge * Did we fit?
646 1.1 ragge */
647 1.1 ragge if (buflen != 0)
648 1.1 ragge return (EFBIG); /* XXX better return value here? */
649 1.1 ragge return (0);
650 1.1 ragge }
651 1.1 ragge
652 1.1 ragge /*
653 1.1 ragge * Check to see if the specified page is in an allowed DMA range.
654 1.1 ragge */
655 1.1 ragge int
656 1.1 ragge _bus_dma_inrange(ranges, nranges, curaddr)
657 1.1 ragge bus_dma_segment_t *ranges;
658 1.1 ragge int nranges;
659 1.1 ragge bus_addr_t curaddr;
660 1.1 ragge {
661 1.1 ragge bus_dma_segment_t *ds;
662 1.1 ragge int i;
663 1.1 ragge
664 1.1 ragge for (i = 0, ds = ranges; i < nranges; i++, ds++) {
665 1.1 ragge if (curaddr >= ds->ds_addr &&
666 1.1 ragge round_page(curaddr) <= (ds->ds_addr + ds->ds_len))
667 1.1 ragge return (1);
668 1.1 ragge }
669 1.1 ragge
670 1.1 ragge return (0);
671 1.1 ragge }
672 1.1 ragge
673 1.1 ragge /*
674 1.1 ragge * Allocate physical memory from the given physical address range.
675 1.1 ragge * Called by DMA-safe memory allocation methods.
676 1.1 ragge */
677 1.1 ragge int
678 1.1 ragge _bus_dmamem_alloc_range(t, size, alignment, boundary, segs, nsegs, rsegs,
679 1.1 ragge flags, low, high)
680 1.1 ragge bus_dma_tag_t t;
681 1.1 ragge bus_size_t size, alignment, boundary;
682 1.1 ragge bus_dma_segment_t *segs;
683 1.1 ragge int nsegs;
684 1.1 ragge int *rsegs;
685 1.1 ragge int flags;
686 1.6 matt vaddr_t low;
687 1.6 matt vaddr_t high;
688 1.1 ragge {
689 1.6 matt vaddr_t curaddr, lastaddr;
690 1.12 chs struct vm_page *m;
691 1.1 ragge struct pglist mlist;
692 1.1 ragge int curseg, error;
693 1.1 ragge
694 1.1 ragge #ifdef DEBUG_DMA
695 1.1 ragge printf("alloc_range: t=%p size=%lx align=%lx boundary=%lx segs=%p nsegs=%x rsegs=%p flags=%x lo=%lx hi=%lx\n",
696 1.1 ragge t, size, alignment, boundary, segs, nsegs, rsegs, flags, low, high);
697 1.1 ragge #endif /* DEBUG_DMA */
698 1.1 ragge
699 1.1 ragge /* Always round the size. */
700 1.1 ragge size = round_page(size);
701 1.1 ragge
702 1.1 ragge /*
703 1.1 ragge * Allocate pages from the VM system.
704 1.1 ragge */
705 1.1 ragge error = uvm_pglistalloc(size, low, high, alignment, boundary,
706 1.1 ragge &mlist, nsegs, (flags & BUS_DMA_NOWAIT) == 0);
707 1.1 ragge if (error)
708 1.1 ragge return (error);
709 1.1 ragge
710 1.1 ragge /*
711 1.1 ragge * Compute the location, size, and number of segments actually
712 1.1 ragge * returned by the VM code.
713 1.1 ragge */
714 1.1 ragge m = mlist.tqh_first;
715 1.1 ragge curseg = 0;
716 1.1 ragge lastaddr = segs[curseg].ds_addr = VM_PAGE_TO_PHYS(m);
717 1.1 ragge segs[curseg].ds_len = PAGE_SIZE;
718 1.1 ragge #ifdef DEBUG_DMA
719 1.1 ragge printf("alloc: page %lx\n", lastaddr);
720 1.1 ragge #endif /* DEBUG_DMA */
721 1.1 ragge m = m->pageq.tqe_next;
722 1.1 ragge
723 1.1 ragge for (; m != NULL; m = m->pageq.tqe_next) {
724 1.1 ragge curaddr = VM_PAGE_TO_PHYS(m);
725 1.1 ragge #ifdef DIAGNOSTIC
726 1.1 ragge if (curaddr < low || curaddr >= high) {
727 1.10 soren printf("uvm_pglistalloc returned non-sensical"
728 1.1 ragge " address 0x%lx\n", curaddr);
729 1.1 ragge panic("_bus_dmamem_alloc_range");
730 1.1 ragge }
731 1.1 ragge #endif /* DIAGNOSTIC */
732 1.1 ragge #ifdef DEBUG_DMA
733 1.1 ragge printf("alloc: page %lx\n", curaddr);
734 1.1 ragge #endif /* DEBUG_DMA */
735 1.1 ragge if (curaddr == (lastaddr + PAGE_SIZE))
736 1.1 ragge segs[curseg].ds_len += PAGE_SIZE;
737 1.1 ragge else {
738 1.1 ragge curseg++;
739 1.1 ragge segs[curseg].ds_addr = curaddr;
740 1.1 ragge segs[curseg].ds_len = PAGE_SIZE;
741 1.1 ragge }
742 1.1 ragge lastaddr = curaddr;
743 1.1 ragge }
744 1.1 ragge
745 1.1 ragge *rsegs = curseg + 1;
746 1.1 ragge
747 1.1 ragge return (0);
748 1.1 ragge }
749 1.4 ragge
750 1.4 ragge /*
751 1.4 ragge * "generic" DMA struct, nothing special.
752 1.4 ragge */
753 1.4 ragge struct vax_bus_dma_tag vax_bus_dma_tag = {
754 1.4 ragge NULL,
755 1.4 ragge 0,
756 1.4 ragge 0,
757 1.4 ragge 0,
758 1.4 ragge 0,
759 1.4 ragge 0,
760 1.4 ragge _bus_dmamap_create,
761 1.4 ragge _bus_dmamap_destroy,
762 1.4 ragge _bus_dmamap_load,
763 1.4 ragge _bus_dmamap_load_mbuf,
764 1.4 ragge _bus_dmamap_load_uio,
765 1.4 ragge _bus_dmamap_load_raw,
766 1.4 ragge _bus_dmamap_unload,
767 1.4 ragge _bus_dmamap_sync,
768 1.4 ragge _bus_dmamem_alloc,
769 1.4 ragge _bus_dmamem_free,
770 1.4 ragge _bus_dmamem_map,
771 1.4 ragge _bus_dmamem_unmap,
772 1.4 ragge _bus_dmamem_mmap,
773 1.4 ragge };
774