dma.c revision 1.20 1 1.20 thorpej /* $NetBSD: dma.c,v 1.20 1997/10/04 17:38:00 thorpej Exp $ */
2 1.20 thorpej
3 1.20 thorpej /*-
4 1.20 thorpej * Copyright (c) 1996, 1997 The NetBSD Foundation, Inc.
5 1.20 thorpej * All rights reserved.
6 1.20 thorpej *
7 1.20 thorpej * This code is derived from software contributed to The NetBSD Foundation
8 1.20 thorpej * by Jason R. Thorpe.
9 1.20 thorpej *
10 1.20 thorpej * Redistribution and use in source and binary forms, with or without
11 1.20 thorpej * modification, are permitted provided that the following conditions
12 1.20 thorpej * are met:
13 1.20 thorpej * 1. Redistributions of source code must retain the above copyright
14 1.20 thorpej * notice, this list of conditions and the following disclaimer.
15 1.20 thorpej * 2. Redistributions in binary form must reproduce the above copyright
16 1.20 thorpej * notice, this list of conditions and the following disclaimer in the
17 1.20 thorpej * documentation and/or other materials provided with the distribution.
18 1.20 thorpej * 3. All advertising materials mentioning features or use of this software
19 1.20 thorpej * must display the following acknowledgement:
20 1.20 thorpej * This product includes software developed by the NetBSD
21 1.20 thorpej * Foundation, Inc. and its contributors.
22 1.20 thorpej * 4. Neither the name of The NetBSD Foundation nor the names of its
23 1.20 thorpej * contributors may be used to endorse or promote products derived
24 1.20 thorpej * from this software without specific prior written permission.
25 1.20 thorpej *
26 1.20 thorpej * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
27 1.20 thorpej * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
28 1.20 thorpej * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
29 1.20 thorpej * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
30 1.20 thorpej * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
31 1.20 thorpej * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
32 1.20 thorpej * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
33 1.20 thorpej * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
34 1.20 thorpej * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
35 1.20 thorpej * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
36 1.20 thorpej * POSSIBILITY OF SUCH DAMAGE.
37 1.20 thorpej */
38 1.5 cgd
39 1.1 cgd /*
40 1.4 mycroft * Copyright (c) 1982, 1990, 1993
41 1.4 mycroft * The Regents of the University of California. All rights reserved.
42 1.1 cgd *
43 1.1 cgd * Redistribution and use in source and binary forms, with or without
44 1.1 cgd * modification, are permitted provided that the following conditions
45 1.1 cgd * are met:
46 1.1 cgd * 1. Redistributions of source code must retain the above copyright
47 1.1 cgd * notice, this list of conditions and the following disclaimer.
48 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
49 1.1 cgd * notice, this list of conditions and the following disclaimer in the
50 1.1 cgd * documentation and/or other materials provided with the distribution.
51 1.1 cgd * 3. All advertising materials mentioning features or use of this software
52 1.1 cgd * must display the following acknowledgement:
53 1.1 cgd * This product includes software developed by the University of
54 1.1 cgd * California, Berkeley and its contributors.
55 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
56 1.1 cgd * may be used to endorse or promote products derived from this software
57 1.1 cgd * without specific prior written permission.
58 1.1 cgd *
59 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
60 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
61 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
62 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
63 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
64 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
65 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
66 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
67 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
68 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
69 1.1 cgd * SUCH DAMAGE.
70 1.1 cgd *
71 1.5 cgd * @(#)dma.c 8.1 (Berkeley) 6/10/93
72 1.1 cgd */
73 1.1 cgd
74 1.1 cgd /*
75 1.1 cgd * DMA driver
76 1.1 cgd */
77 1.1 cgd
78 1.18 thorpej #include <machine/hp300spu.h> /* XXX param.h includes cpu.h */
79 1.18 thorpej
80 1.4 mycroft #include <sys/param.h>
81 1.4 mycroft #include <sys/systm.h>
82 1.4 mycroft #include <sys/time.h>
83 1.4 mycroft #include <sys/kernel.h>
84 1.4 mycroft #include <sys/proc.h>
85 1.11 thorpej #include <sys/device.h>
86 1.4 mycroft
87 1.14 scottr #include <machine/frame.h>
88 1.4 mycroft #include <machine/cpu.h>
89 1.17 thorpej #include <machine/intr.h>
90 1.4 mycroft
91 1.4 mycroft #include <hp300/dev/dmareg.h>
92 1.4 mycroft #include <hp300/dev/dmavar.h>
93 1.1 cgd
94 1.1 cgd /*
95 1.1 cgd * The largest single request will be MAXPHYS bytes which will require
96 1.1 cgd * at most MAXPHYS/NBPG+1 chain elements to describe, i.e. if none of
97 1.1 cgd * the buffer pages are physically contiguous (MAXPHYS/NBPG) and the
98 1.1 cgd * buffer is not page aligned (+1).
99 1.1 cgd */
100 1.1 cgd #define DMAMAXIO (MAXPHYS/NBPG+1)
101 1.1 cgd
102 1.19 thorpej struct dma_chain {
103 1.1 cgd int dc_count;
104 1.1 cgd char *dc_addr;
105 1.1 cgd };
106 1.1 cgd
107 1.19 thorpej struct dma_channel {
108 1.11 thorpej struct dmaqueue *dm_job; /* current job */
109 1.6 thorpej struct dmadevice *dm_hwaddr; /* registers if DMA_C */
110 1.6 thorpej struct dmaBdevice *dm_Bhwaddr; /* registers if not DMA_C */
111 1.6 thorpej char dm_flags; /* misc. flags */
112 1.6 thorpej u_short dm_cmd; /* DMA controller command */
113 1.11 thorpej int dm_cur; /* current segment */
114 1.11 thorpej int dm_last; /* last segment */
115 1.6 thorpej struct dma_chain dm_chain[DMAMAXIO]; /* all segments */
116 1.6 thorpej };
117 1.6 thorpej
118 1.19 thorpej struct dma_softc {
119 1.6 thorpej struct dmareg *sc_dmareg; /* pointer to our hardware */
120 1.6 thorpej struct dma_channel sc_chan[NDMACHAN]; /* 2 channels */
121 1.11 thorpej TAILQ_HEAD(, dmaqueue) sc_queue; /* job queue */
122 1.6 thorpej char sc_type; /* A, B, or C */
123 1.10 thorpej int sc_ipl; /* our interrupt level */
124 1.10 thorpej void *sc_ih; /* interrupt cookie */
125 1.19 thorpej } dma_softc;
126 1.1 cgd
127 1.1 cgd /* types */
128 1.1 cgd #define DMA_B 0
129 1.1 cgd #define DMA_C 1
130 1.1 cgd
131 1.1 cgd /* flags */
132 1.1 cgd #define DMAF_PCFLUSH 0x01
133 1.1 cgd #define DMAF_VCFLUSH 0x02
134 1.1 cgd #define DMAF_NOINTR 0x04
135 1.1 cgd
136 1.7 thorpej int dmaintr __P((void *));
137 1.1 cgd
138 1.1 cgd #ifdef DEBUG
139 1.1 cgd int dmadebug = 0;
140 1.1 cgd #define DDB_WORD 0x01 /* same as DMAGO_WORD */
141 1.1 cgd #define DDB_LWORD 0x02 /* same as DMAGO_LWORD */
142 1.1 cgd #define DDB_FOLLOW 0x04
143 1.1 cgd #define DDB_IO 0x08
144 1.1 cgd
145 1.3 mycroft void dmatimeout __P((void *));
146 1.6 thorpej int dmatimo[NDMACHAN];
147 1.1 cgd
148 1.6 thorpej long dmahits[NDMACHAN];
149 1.6 thorpej long dmamisses[NDMACHAN];
150 1.6 thorpej long dmabyte[NDMACHAN];
151 1.6 thorpej long dmaword[NDMACHAN];
152 1.6 thorpej long dmalword[NDMACHAN];
153 1.1 cgd #endif
154 1.1 cgd
155 1.19 thorpej /*
156 1.19 thorpej * Initialize the DMA engine, called by dioattach()
157 1.19 thorpej */
158 1.1 cgd void
159 1.1 cgd dmainit()
160 1.1 cgd {
161 1.19 thorpej struct dma_softc *sc = &dma_softc;
162 1.6 thorpej struct dmareg *dma;
163 1.6 thorpej struct dma_channel *dc;
164 1.6 thorpej int i;
165 1.1 cgd char rev;
166 1.1 cgd
167 1.6 thorpej /* There's just one. */
168 1.6 thorpej sc->sc_dmareg = (struct dmareg *)DMA_BASE;
169 1.6 thorpej dma = sc->sc_dmareg;
170 1.6 thorpej
171 1.1 cgd /*
172 1.6 thorpej * Determine the DMA type. A DMA_A or DMA_B will fail the
173 1.6 thorpej * following probe.
174 1.6 thorpej *
175 1.6 thorpej * XXX Don't know how to easily differentiate the A and B cards,
176 1.1 cgd * so we just hope nobody has an A card (A cards will work if
177 1.10 thorpej * splbio works out to ipl 3).
178 1.1 cgd */
179 1.6 thorpej if (badbaddr((char *)&dma->dma_id[2])) {
180 1.1 cgd rev = 'B';
181 1.1 cgd #if !defined(HP320)
182 1.1 cgd panic("dmainit: DMA card requires hp320 support");
183 1.1 cgd #endif
184 1.6 thorpej } else
185 1.6 thorpej rev = dma->dma_id[2];
186 1.6 thorpej
187 1.6 thorpej sc->sc_type = (rev == 'B') ? DMA_B : DMA_C;
188 1.1 cgd
189 1.11 thorpej TAILQ_INIT(&sc->sc_queue);
190 1.11 thorpej
191 1.6 thorpej for (i = 0; i < NDMACHAN; i++) {
192 1.6 thorpej dc = &sc->sc_chan[i];
193 1.11 thorpej dc->dm_job = NULL;
194 1.6 thorpej switch (i) {
195 1.6 thorpej case 0:
196 1.6 thorpej dc->dm_hwaddr = &dma->dma_chan0;
197 1.6 thorpej dc->dm_Bhwaddr = &dma->dma_Bchan0;
198 1.6 thorpej break;
199 1.6 thorpej
200 1.6 thorpej case 1:
201 1.6 thorpej dc->dm_hwaddr = &dma->dma_chan1;
202 1.6 thorpej dc->dm_Bhwaddr = &dma->dma_Bchan1;
203 1.6 thorpej break;
204 1.6 thorpej
205 1.6 thorpej default:
206 1.6 thorpej panic("dmainit: more than 2 channels?");
207 1.6 thorpej /* NOTREACHED */
208 1.6 thorpej }
209 1.1 cgd }
210 1.11 thorpej
211 1.1 cgd #ifdef DEBUG
212 1.1 cgd /* make sure timeout is really not needed */
213 1.6 thorpej timeout(dmatimeout, sc, 30 * hz);
214 1.1 cgd #endif
215 1.1 cgd
216 1.19 thorpej printf("98620%c, 2 channels, %d bit DMA\n",
217 1.19 thorpej rev, (rev == 'B') ? 16 : 32);
218 1.7 thorpej
219 1.10 thorpej /*
220 1.10 thorpej * Defer hooking up our interrupt until the first
221 1.10 thorpej * DMA-using controller has hooked up theirs.
222 1.10 thorpej */
223 1.10 thorpej sc->sc_ih = NULL;
224 1.10 thorpej }
225 1.10 thorpej
226 1.10 thorpej /*
227 1.10 thorpej * Compute the ipl and (re)establish the interrupt handler
228 1.10 thorpej * for the DMA controller.
229 1.10 thorpej */
230 1.10 thorpej void
231 1.10 thorpej dmacomputeipl()
232 1.10 thorpej {
233 1.19 thorpej struct dma_softc *sc = &dma_softc;
234 1.10 thorpej
235 1.10 thorpej if (sc->sc_ih != NULL)
236 1.17 thorpej intr_disestablish(sc->sc_ih);
237 1.10 thorpej
238 1.10 thorpej /*
239 1.10 thorpej * Our interrupt level must be as high as the highest
240 1.10 thorpej * device using DMA (i.e. splbio).
241 1.10 thorpej */
242 1.10 thorpej sc->sc_ipl = PSLTOIPL(hp300_bioipl);
243 1.17 thorpej sc->sc_ih = intr_establish(dmaintr, sc, sc->sc_ipl, IPL_BIO);
244 1.1 cgd }
245 1.1 cgd
246 1.1 cgd int
247 1.1 cgd dmareq(dq)
248 1.11 thorpej struct dmaqueue *dq;
249 1.1 cgd {
250 1.19 thorpej struct dma_softc *sc = &dma_softc;
251 1.11 thorpej int i, chan, s;
252 1.11 thorpej
253 1.11 thorpej #if 1
254 1.11 thorpej s = splhigh(); /* XXXthorpej */
255 1.11 thorpej #else
256 1.11 thorpej s = splbio();
257 1.11 thorpej #endif
258 1.11 thorpej
259 1.11 thorpej chan = dq->dq_chan;
260 1.11 thorpej for (i = NDMACHAN - 1; i >= 0; i--) {
261 1.11 thorpej /*
262 1.11 thorpej * Can we use this channel?
263 1.11 thorpej */
264 1.1 cgd if ((chan & (1 << i)) == 0)
265 1.1 cgd continue;
266 1.11 thorpej
267 1.11 thorpej /*
268 1.11 thorpej * We can use it; is it busy?
269 1.11 thorpej */
270 1.11 thorpej if (sc->sc_chan[i].dm_job != NULL)
271 1.1 cgd continue;
272 1.11 thorpej
273 1.11 thorpej /*
274 1.11 thorpej * Not busy; give the caller this channel.
275 1.11 thorpej */
276 1.11 thorpej sc->sc_chan[i].dm_job = dq;
277 1.11 thorpej dq->dq_chan = i;
278 1.1 cgd splx(s);
279 1.11 thorpej return (1);
280 1.1 cgd }
281 1.11 thorpej
282 1.11 thorpej /*
283 1.11 thorpej * Couldn't get a channel now; put this in the queue.
284 1.11 thorpej */
285 1.11 thorpej TAILQ_INSERT_TAIL(&sc->sc_queue, dq, dq_list);
286 1.1 cgd splx(s);
287 1.11 thorpej return (0);
288 1.1 cgd }
289 1.1 cgd
290 1.1 cgd void
291 1.1 cgd dmafree(dq)
292 1.11 thorpej struct dmaqueue *dq;
293 1.1 cgd {
294 1.11 thorpej int unit = dq->dq_chan;
295 1.19 thorpej struct dma_softc *sc = &dma_softc;
296 1.11 thorpej struct dma_channel *dc = &sc->sc_chan[unit];
297 1.11 thorpej struct dmaqueue *dn;
298 1.11 thorpej int chan, s;
299 1.11 thorpej
300 1.11 thorpej #if 1
301 1.11 thorpej s = splhigh(); /* XXXthorpej */
302 1.11 thorpej #else
303 1.11 thorpej s = splbio();
304 1.11 thorpej #endif
305 1.1 cgd
306 1.1 cgd #ifdef DEBUG
307 1.1 cgd dmatimo[unit] = 0;
308 1.1 cgd #endif
309 1.11 thorpej
310 1.1 cgd DMA_CLEAR(dc);
311 1.18 thorpej
312 1.18 thorpej #if defined(CACHE_HAVE_PAC) || defined(M68040)
313 1.1 cgd /*
314 1.1 cgd * XXX we may not always go thru the flush code in dmastop()
315 1.1 cgd */
316 1.6 thorpej if (dc->dm_flags & DMAF_PCFLUSH) {
317 1.1 cgd PCIA();
318 1.6 thorpej dc->dm_flags &= ~DMAF_PCFLUSH;
319 1.1 cgd }
320 1.1 cgd #endif
321 1.18 thorpej
322 1.18 thorpej #if defined(CACHE_HAVE_VAC)
323 1.6 thorpej if (dc->dm_flags & DMAF_VCFLUSH) {
324 1.1 cgd /*
325 1.1 cgd * 320/350s have VACs that may also need flushing.
326 1.1 cgd * In our case we only flush the supervisor side
327 1.1 cgd * because we know that if we are DMAing to user
328 1.1 cgd * space, the physical pages will also be mapped
329 1.1 cgd * in kernel space (via vmapbuf) and hence cache-
330 1.1 cgd * inhibited by the pmap module due to the multiple
331 1.1 cgd * mapping.
332 1.1 cgd */
333 1.1 cgd DCIS();
334 1.6 thorpej dc->dm_flags &= ~DMAF_VCFLUSH;
335 1.1 cgd }
336 1.1 cgd #endif
337 1.18 thorpej
338 1.11 thorpej /*
339 1.11 thorpej * Channel is now free. Look for another job to run on this
340 1.11 thorpej * channel.
341 1.11 thorpej */
342 1.11 thorpej dc->dm_job = NULL;
343 1.1 cgd chan = 1 << unit;
344 1.11 thorpej for (dn = sc->sc_queue.tqh_first; dn != NULL;
345 1.11 thorpej dn = dn->dq_list.tqe_next) {
346 1.11 thorpej if (dn->dq_chan & chan) {
347 1.11 thorpej /* Found one... */
348 1.11 thorpej TAILQ_REMOVE(&sc->sc_queue, dn, dq_list);
349 1.11 thorpej dc->dm_job = dn;
350 1.11 thorpej dn->dq_chan = dq->dq_chan;
351 1.1 cgd splx(s);
352 1.11 thorpej
353 1.11 thorpej /* Start the initiator. */
354 1.11 thorpej (*dn->dq_start)(dn->dq_softc);
355 1.1 cgd return;
356 1.1 cgd }
357 1.1 cgd }
358 1.1 cgd splx(s);
359 1.1 cgd }
360 1.1 cgd
361 1.1 cgd void
362 1.1 cgd dmago(unit, addr, count, flags)
363 1.1 cgd int unit;
364 1.13 scottr char *addr;
365 1.13 scottr int count;
366 1.13 scottr int flags;
367 1.1 cgd {
368 1.19 thorpej struct dma_softc *sc = &dma_softc;
369 1.13 scottr struct dma_channel *dc = &sc->sc_chan[unit];
370 1.13 scottr char *dmaend = NULL;
371 1.13 scottr int seg, tcount;
372 1.1 cgd
373 1.1 cgd if (count > MAXPHYS)
374 1.1 cgd panic("dmago: count > MAXPHYS");
375 1.18 thorpej
376 1.1 cgd #if defined(HP320)
377 1.6 thorpej if (sc->sc_type == DMA_B && (flags & DMAGO_LWORD))
378 1.1 cgd panic("dmago: no can do 32-bit DMA");
379 1.1 cgd #endif
380 1.18 thorpej
381 1.1 cgd #ifdef DEBUG
382 1.1 cgd if (dmadebug & DDB_FOLLOW)
383 1.15 scottr printf("dmago(%d, %p, %x, %x)\n",
384 1.1 cgd unit, addr, count, flags);
385 1.1 cgd if (flags & DMAGO_LWORD)
386 1.1 cgd dmalword[unit]++;
387 1.1 cgd else if (flags & DMAGO_WORD)
388 1.1 cgd dmaword[unit]++;
389 1.1 cgd else
390 1.1 cgd dmabyte[unit]++;
391 1.1 cgd #endif
392 1.1 cgd /*
393 1.1 cgd * Build the DMA chain
394 1.1 cgd */
395 1.11 thorpej for (seg = 0; count > 0; seg++) {
396 1.11 thorpej dc->dm_chain[seg].dc_addr = (char *) kvtop(addr);
397 1.18 thorpej #if defined(M68040)
398 1.4 mycroft /*
399 1.4 mycroft * Push back dirty cache lines
400 1.4 mycroft */
401 1.4 mycroft if (mmutype == MMU_68040)
402 1.14 scottr DCFP((vm_offset_t)dc->dm_chain[seg].dc_addr);
403 1.4 mycroft #endif
404 1.1 cgd if (count < (tcount = NBPG - ((int)addr & PGOFSET)))
405 1.1 cgd tcount = count;
406 1.11 thorpej dc->dm_chain[seg].dc_count = tcount;
407 1.1 cgd addr += tcount;
408 1.1 cgd count -= tcount;
409 1.1 cgd if (flags & DMAGO_LWORD)
410 1.1 cgd tcount >>= 2;
411 1.1 cgd else if (flags & DMAGO_WORD)
412 1.1 cgd tcount >>= 1;
413 1.11 thorpej
414 1.11 thorpej /*
415 1.11 thorpej * Try to compact the DMA transfer if the pages are adjacent.
416 1.11 thorpej * Note: this will never happen on the first iteration.
417 1.11 thorpej */
418 1.11 thorpej if (dc->dm_chain[seg].dc_addr == dmaend
419 1.1 cgd #if defined(HP320)
420 1.1 cgd /* only 16-bit count on 98620B */
421 1.6 thorpej && (sc->sc_type != DMA_B ||
422 1.11 thorpej dc->dm_chain[seg - 1].dc_count + tcount <= 65536)
423 1.1 cgd #endif
424 1.1 cgd ) {
425 1.1 cgd #ifdef DEBUG
426 1.1 cgd dmahits[unit]++;
427 1.1 cgd #endif
428 1.11 thorpej dmaend += dc->dm_chain[seg].dc_count;
429 1.11 thorpej dc->dm_chain[--seg].dc_count += tcount;
430 1.1 cgd } else {
431 1.1 cgd #ifdef DEBUG
432 1.1 cgd dmamisses[unit]++;
433 1.1 cgd #endif
434 1.11 thorpej dmaend = dc->dm_chain[seg].dc_addr +
435 1.11 thorpej dc->dm_chain[seg].dc_count;
436 1.11 thorpej dc->dm_chain[seg].dc_count = tcount;
437 1.1 cgd }
438 1.1 cgd }
439 1.11 thorpej dc->dm_cur = 0;
440 1.11 thorpej dc->dm_last = --seg;
441 1.6 thorpej dc->dm_flags = 0;
442 1.1 cgd /*
443 1.1 cgd * Set up the command word based on flags
444 1.1 cgd */
445 1.10 thorpej dc->dm_cmd = DMA_ENAB | DMA_IPL(sc->sc_ipl) | DMA_START;
446 1.1 cgd if ((flags & DMAGO_READ) == 0)
447 1.6 thorpej dc->dm_cmd |= DMA_WRT;
448 1.1 cgd if (flags & DMAGO_LWORD)
449 1.6 thorpej dc->dm_cmd |= DMA_LWORD;
450 1.1 cgd else if (flags & DMAGO_WORD)
451 1.6 thorpej dc->dm_cmd |= DMA_WORD;
452 1.1 cgd if (flags & DMAGO_PRI)
453 1.6 thorpej dc->dm_cmd |= DMA_PRI;
454 1.18 thorpej
455 1.18 thorpej #if defined(M68040)
456 1.4 mycroft /*
457 1.4 mycroft * On the 68040 we need to flush (push) the data cache before a
458 1.4 mycroft * DMA (already done above) and flush again after DMA completes.
459 1.4 mycroft * In theory we should only need to flush prior to a write DMA
460 1.4 mycroft * and purge after a read DMA but if the entire page is not
461 1.4 mycroft * involved in the DMA we might purge some valid data.
462 1.4 mycroft */
463 1.4 mycroft if (mmutype == MMU_68040 && (flags & DMAGO_READ))
464 1.6 thorpej dc->dm_flags |= DMAF_PCFLUSH;
465 1.4 mycroft #endif
466 1.18 thorpej
467 1.18 thorpej #if defined(CACHE_HAVE_PAC)
468 1.1 cgd /*
469 1.1 cgd * Remember if we need to flush external physical cache when
470 1.1 cgd * DMA is done. We only do this if we are reading (writing memory).
471 1.1 cgd */
472 1.1 cgd if (ectype == EC_PHYS && (flags & DMAGO_READ))
473 1.6 thorpej dc->dm_flags |= DMAF_PCFLUSH;
474 1.1 cgd #endif
475 1.18 thorpej
476 1.18 thorpej #if defined(CACHE_HAVE_VAC)
477 1.1 cgd if (ectype == EC_VIRT && (flags & DMAGO_READ))
478 1.6 thorpej dc->dm_flags |= DMAF_VCFLUSH;
479 1.1 cgd #endif
480 1.18 thorpej
481 1.1 cgd /*
482 1.1 cgd * Remember if we can skip the dma completion interrupt on
483 1.1 cgd * the last segment in the chain.
484 1.1 cgd */
485 1.1 cgd if (flags & DMAGO_NOINT) {
486 1.6 thorpej if (dc->dm_cur == dc->dm_last)
487 1.6 thorpej dc->dm_cmd &= ~DMA_ENAB;
488 1.1 cgd else
489 1.6 thorpej dc->dm_flags |= DMAF_NOINTR;
490 1.1 cgd }
491 1.1 cgd #ifdef DEBUG
492 1.11 thorpej if (dmadebug & DDB_IO) {
493 1.15 scottr if (((dmadebug&DDB_WORD) && (dc->dm_cmd&DMA_WORD)) ||
494 1.15 scottr ((dmadebug&DDB_LWORD) && (dc->dm_cmd&DMA_LWORD))) {
495 1.9 christos printf("dmago: cmd %x, flags %x\n",
496 1.6 thorpej dc->dm_cmd, dc->dm_flags);
497 1.11 thorpej for (seg = 0; seg <= dc->dm_last; seg++)
498 1.15 scottr printf(" %d: %d@%p\n", seg,
499 1.11 thorpej dc->dm_chain[seg].dc_count,
500 1.11 thorpej dc->dm_chain[seg].dc_addr);
501 1.1 cgd }
502 1.11 thorpej }
503 1.1 cgd dmatimo[unit] = 1;
504 1.1 cgd #endif
505 1.19 thorpej DMA_ARM(sc, dc);
506 1.1 cgd }
507 1.1 cgd
508 1.1 cgd void
509 1.1 cgd dmastop(unit)
510 1.13 scottr int unit;
511 1.1 cgd {
512 1.19 thorpej struct dma_softc *sc = &dma_softc;
513 1.13 scottr struct dma_channel *dc = &sc->sc_chan[unit];
514 1.1 cgd
515 1.1 cgd #ifdef DEBUG
516 1.1 cgd if (dmadebug & DDB_FOLLOW)
517 1.9 christos printf("dmastop(%d)\n", unit);
518 1.1 cgd dmatimo[unit] = 0;
519 1.1 cgd #endif
520 1.1 cgd DMA_CLEAR(dc);
521 1.18 thorpej
522 1.18 thorpej #if defined(CACHE_HAVE_PAC) || defined(M68040)
523 1.6 thorpej if (dc->dm_flags & DMAF_PCFLUSH) {
524 1.1 cgd PCIA();
525 1.6 thorpej dc->dm_flags &= ~DMAF_PCFLUSH;
526 1.1 cgd }
527 1.1 cgd #endif
528 1.18 thorpej
529 1.18 thorpej #if defined(CACHE_HAVE_VAC)
530 1.6 thorpej if (dc->dm_flags & DMAF_VCFLUSH) {
531 1.1 cgd /*
532 1.1 cgd * 320/350s have VACs that may also need flushing.
533 1.1 cgd * In our case we only flush the supervisor side
534 1.1 cgd * because we know that if we are DMAing to user
535 1.1 cgd * space, the physical pages will also be mapped
536 1.1 cgd * in kernel space (via vmapbuf) and hence cache-
537 1.1 cgd * inhibited by the pmap module due to the multiple
538 1.1 cgd * mapping.
539 1.1 cgd */
540 1.1 cgd DCIS();
541 1.6 thorpej dc->dm_flags &= ~DMAF_VCFLUSH;
542 1.1 cgd }
543 1.1 cgd #endif
544 1.18 thorpej
545 1.1 cgd /*
546 1.1 cgd * We may get this interrupt after a device service routine
547 1.1 cgd * has freed the dma channel. So, ignore the intr if there's
548 1.1 cgd * nothing on the queue.
549 1.1 cgd */
550 1.11 thorpej if (dc->dm_job != NULL)
551 1.11 thorpej (*dc->dm_job->dq_done)(dc->dm_job->dq_softc);
552 1.1 cgd }
553 1.1 cgd
554 1.1 cgd int
555 1.7 thorpej dmaintr(arg)
556 1.7 thorpej void *arg;
557 1.1 cgd {
558 1.7 thorpej struct dma_softc *sc = arg;
559 1.13 scottr struct dma_channel *dc;
560 1.13 scottr int i, stat;
561 1.1 cgd int found = 0;
562 1.1 cgd
563 1.1 cgd #ifdef DEBUG
564 1.1 cgd if (dmadebug & DDB_FOLLOW)
565 1.9 christos printf("dmaintr\n");
566 1.1 cgd #endif
567 1.6 thorpej for (i = 0; i < NDMACHAN; i++) {
568 1.6 thorpej dc = &sc->sc_chan[i];
569 1.1 cgd stat = DMA_STAT(dc);
570 1.1 cgd if ((stat & DMA_INTR) == 0)
571 1.1 cgd continue;
572 1.1 cgd found++;
573 1.1 cgd #ifdef DEBUG
574 1.1 cgd if (dmadebug & DDB_IO) {
575 1.15 scottr if (((dmadebug&DDB_WORD) && (dc->dm_cmd&DMA_WORD)) ||
576 1.15 scottr ((dmadebug&DDB_LWORD) && (dc->dm_cmd&DMA_LWORD)))
577 1.11 thorpej printf("dmaintr: flags %x unit %d stat %x next %d\n",
578 1.11 thorpej dc->dm_flags, i, stat, dc->dm_cur + 1);
579 1.1 cgd }
580 1.1 cgd if (stat & DMA_ARMED)
581 1.19 thorpej printf("dma channel %d: intr when armed\n", i);
582 1.1 cgd #endif
583 1.11 thorpej /*
584 1.11 thorpej * Load the next segemnt, or finish up if we're done.
585 1.11 thorpej */
586 1.11 thorpej dc->dm_cur++;
587 1.11 thorpej if (dc->dm_cur <= dc->dm_last) {
588 1.1 cgd #ifdef DEBUG
589 1.1 cgd dmatimo[i] = 1;
590 1.1 cgd #endif
591 1.1 cgd /*
592 1.11 thorpej * If we're the last segment, disable the
593 1.11 thorpej * completion interrupt, if necessary.
594 1.1 cgd */
595 1.6 thorpej if (dc->dm_cur == dc->dm_last &&
596 1.6 thorpej (dc->dm_flags & DMAF_NOINTR))
597 1.6 thorpej dc->dm_cmd &= ~DMA_ENAB;
598 1.1 cgd DMA_CLEAR(dc);
599 1.19 thorpej DMA_ARM(sc, dc);
600 1.1 cgd } else
601 1.1 cgd dmastop(i);
602 1.1 cgd }
603 1.1 cgd return(found);
604 1.1 cgd }
605 1.1 cgd
606 1.1 cgd #ifdef DEBUG
607 1.1 cgd void
608 1.3 mycroft dmatimeout(arg)
609 1.3 mycroft void *arg;
610 1.1 cgd {
611 1.13 scottr int i, s;
612 1.6 thorpej struct dma_softc *sc = arg;
613 1.1 cgd
614 1.6 thorpej for (i = 0; i < NDMACHAN; i++) {
615 1.1 cgd s = splbio();
616 1.1 cgd if (dmatimo[i]) {
617 1.1 cgd if (dmatimo[i] > 1)
618 1.19 thorpej printf("dma channel %d timeout #%d\n",
619 1.19 thorpej i, dmatimo[i]-1);
620 1.1 cgd dmatimo[i]++;
621 1.1 cgd }
622 1.1 cgd splx(s);
623 1.1 cgd }
624 1.6 thorpej timeout(dmatimeout, sc, 30 * hz);
625 1.1 cgd }
626 1.1 cgd #endif
627