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