Home | History | Annotate | Line # | Download | only in dev
dma.c revision 1.14.40.1
      1  1.14.40.1  jdolecek /*	$NetBSD: dma.c,v 1.14.40.1 2002/10/10 18:32:00 jdolecek Exp $	*/
      2        1.1       leo 
      3        1.1       leo /*
      4        1.1       leo  * Copyright (c) 1995 Leo Weppelman.
      5        1.1       leo  * All rights reserved.
      6        1.1       leo  *
      7        1.1       leo  * Redistribution and use in source and binary forms, with or without
      8        1.1       leo  * modification, are permitted provided that the following conditions
      9        1.1       leo  * are met:
     10        1.1       leo  * 1. Redistributions of source code must retain the above copyright
     11        1.1       leo  *    notice, this list of conditions and the following disclaimer.
     12        1.1       leo  * 2. Redistributions in binary form must reproduce the above copyright
     13        1.1       leo  *    notice, this list of conditions and the following disclaimer in the
     14        1.1       leo  *    documentation and/or other materials provided with the distribution.
     15        1.1       leo  * 3. All advertising materials mentioning features or use of this software
     16        1.1       leo  *    must display the following acknowledgement:
     17        1.1       leo  *      This product includes software developed by Leo Weppelman.
     18        1.1       leo  * 4. The name of the author may not be used to endorse or promote products
     19        1.1       leo  *    derived from this software without specific prior written permission
     20        1.1       leo  *
     21        1.1       leo  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
     22        1.1       leo  * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
     23        1.1       leo  * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
     24        1.1       leo  * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
     25        1.1       leo  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
     26        1.1       leo  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
     27        1.1       leo  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
     28        1.1       leo  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
     29        1.1       leo  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
     30        1.1       leo  * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
     31        1.1       leo  */
     32        1.1       leo 
     33        1.1       leo /*
     34        1.1       leo  * This file contains special code dealing with the DMA interface
     35        1.1       leo  * on the Atari ST.
     36        1.1       leo  *
     37        1.1       leo  * The DMA circuitry requires some special treatment for the peripheral
     38        1.1       leo  * devices which make use of the ST's DMA feature (the hard disk and the
     39        1.1       leo  * floppy drive).
     40        1.1       leo  * All devices using DMA need mutually exclusive access and can follow some
     41        1.1       leo  * standard pattern which will be provided in this file.
     42        1.1       leo  *
     43        1.1       leo  * The file contains the following entry points:
     44        1.1       leo  *
     45        1.2       leo  *	st_dmagrab:	ensure exclusive access to the DMA circuitry
     46        1.2       leo  *	st_dmafree:	free exclusive access to the DMA circuitry
     47        1.2       leo  *	st_dmawanted:	somebody is queued waiting for DMA-access
     48        1.1       leo  *	dmaint:		DMA interrupt routine, switches to the current driver
     49        1.4       leo  *	st_dmaaddr_set:	specify 24 bit RAM address
     50        1.4       leo  *	st_dmaaddr_get:	get address of last DMA-op
     51        1.2       leo  *	st_dmacomm:	program DMA, flush FIFO first
     52        1.1       leo  */
     53        1.1       leo 
     54        1.1       leo #include <sys/param.h>
     55        1.1       leo #include <sys/systm.h>
     56        1.1       leo #include <sys/kernel.h>
     57       1.14       leo #include <sys/proc.h>
     58        1.3       leo #include <sys/queue.h>
     59       1.12       leo 
     60        1.1       leo #include <machine/cpu.h>
     61        1.1       leo #include <machine/iomap.h>
     62        1.1       leo #include <machine/dma.h>
     63        1.1       leo 
     64       1.12       leo #include <atari/atari/intr.h>
     65       1.12       leo 
     66        1.1       leo #define	NDMA_DEV	10	/* Max 2 floppy's, 8 hard-disks		*/
     67        1.3       leo typedef struct dma_entry {
     68        1.3       leo 	TAILQ_ENTRY(dma_entry)	entries;	/* List pointers	   */
     69        1.6       leo 	void		(*call_func)(void *);	/* Call when lock granted  */
     70        1.6       leo 	void		(*int_func)(void *);	/* Call on DMA interrupt   */
     71        1.6       leo 	void		*softc;			/* Arg. to int_func	   */
     72        1.6       leo 	int		*lock_stat;		/* status of DMA lock	   */
     73        1.3       leo } DMA_ENTRY;
     74        1.3       leo 
     75        1.3       leo /*
     76        1.3       leo  * Preallocated entries. An allocator seem an overkill here.
     77        1.3       leo  */
     78        1.3       leo static	DMA_ENTRY dmatable[NDMA_DEV];	/* preallocated entries		*/
     79        1.3       leo 
     80        1.3       leo /*
     81        1.3       leo  * Heads of free and active lists:
     82        1.3       leo  */
     83        1.3       leo static  TAILQ_HEAD(freehead, dma_entry)	dma_free;
     84        1.3       leo static  TAILQ_HEAD(acthead, dma_entry)	dma_active;
     85        1.3       leo 
     86        1.3       leo static	int	must_init = 1;		/* Must initialize		*/
     87        1.1       leo 
     88       1.13       leo int	cdmaint __P((void *, int));
     89        1.6       leo 
     90       1.12       leo static	void	st_dma_init __P((void));
     91        1.1       leo 
     92        1.6       leo static void
     93       1.12       leo st_dma_init()
     94        1.3       leo {
     95        1.3       leo 	int	i;
     96        1.3       leo 
     97        1.3       leo 	TAILQ_INIT(&dma_free);
     98        1.3       leo 	TAILQ_INIT(&dma_active);
     99        1.3       leo 
    100        1.3       leo 	for(i = 0; i < NDMA_DEV; i++)
    101        1.3       leo 		TAILQ_INSERT_HEAD(&dma_free, &dmatable[i], entries);
    102       1.12       leo 
    103       1.13       leo 	if (intr_establish(7, USER_VEC, 0, cdmaint, NULL) == NULL)
    104  1.14.40.1  jdolecek 		panic("st_dma_init: Can't establish interrupt");
    105        1.3       leo }
    106        1.3       leo 
    107        1.6       leo int
    108        1.6       leo st_dmagrab(int_func, call_func, softc, lock_stat, rcaller)
    109        1.6       leo dma_farg	int_func;
    110        1.6       leo dma_farg 	call_func;
    111        1.6       leo void		*softc;
    112        1.6       leo int		*lock_stat;
    113        1.6       leo int		rcaller;
    114        1.1       leo {
    115        1.1       leo 	int		sps;
    116        1.3       leo 	DMA_ENTRY	*req;
    117        1.1       leo 
    118        1.3       leo 	if(must_init) {
    119       1.12       leo 		st_dma_init();
    120        1.3       leo 		must_init = 0;
    121        1.3       leo 	}
    122        1.3       leo 	*lock_stat = DMA_LOCK_REQ;
    123        1.1       leo 
    124        1.3       leo 	sps = splhigh();
    125        1.3       leo 
    126        1.3       leo 	/*
    127        1.3       leo 	 * Create a request...
    128        1.3       leo 	 */
    129        1.3       leo 	if(dma_free.tqh_first == NULL)
    130  1.14.40.1  jdolecek 		panic("st_dmagrab: Too many outstanding requests");
    131        1.3       leo 	req = dma_free.tqh_first;
    132        1.3       leo 	TAILQ_REMOVE(&dma_free, dma_free.tqh_first, entries);
    133        1.3       leo 	req->call_func = call_func;
    134        1.3       leo 	req->int_func  = int_func;
    135        1.3       leo 	req->softc     = softc;
    136        1.3       leo 	req->lock_stat = lock_stat;
    137        1.3       leo 	TAILQ_INSERT_TAIL(&dma_active, req, entries);
    138        1.3       leo 
    139        1.3       leo 	if(dma_active.tqh_first != req) {
    140       1.14       leo 		if (call_func == NULL) {
    141       1.14       leo 			do {
    142       1.14       leo 				tsleep(&dma_active, PRIBIO, "dmalck", 0);
    143       1.14       leo 			} while (*req->lock_stat != DMA_LOCK_GRANT);
    144       1.14       leo 			splx(sps);
    145       1.14       leo 			return(1);
    146       1.14       leo 		}
    147        1.1       leo 		splx(sps);
    148        1.2       leo 		return(0);
    149        1.1       leo 	}
    150        1.3       leo 	splx(sps);
    151        1.3       leo 
    152        1.3       leo 	/*
    153        1.3       leo 	 * We're at the head of the queue, ergo: we got the lock.
    154        1.3       leo 	 */
    155        1.3       leo 	*lock_stat = DMA_LOCK_GRANT;
    156        1.3       leo 
    157       1.14       leo 	if(rcaller || (call_func == NULL)) {
    158        1.2       leo 		/*
    159        1.2       leo 		 * Just return to caller immediately without going
    160        1.2       leo 		 * through 'call_func' first.
    161        1.2       leo 		 */
    162        1.2       leo 		return(1);
    163        1.2       leo 	}
    164        1.2       leo 
    165        1.1       leo 	(*call_func)(softc);	/* Call followup function		*/
    166        1.2       leo 	return(0);
    167        1.1       leo }
    168        1.1       leo 
    169        1.2       leo void
    170        1.3       leo st_dmafree(softc, lock_stat)
    171        1.3       leo void	*softc;
    172        1.3       leo int	*lock_stat;
    173        1.1       leo {
    174        1.1       leo 	int		sps;
    175        1.3       leo 	DMA_ENTRY	*req;
    176        1.1       leo 
    177        1.3       leo 	sps = splhigh();
    178        1.3       leo 
    179        1.3       leo 	/*
    180        1.3       leo 	 * Some validity checks first.
    181        1.3       leo 	 */
    182        1.3       leo 	if((req = dma_active.tqh_first) == NULL)
    183  1.14.40.1  jdolecek 		panic("st_dmafree: empty active queue");
    184        1.3       leo 	if(req->softc != softc)
    185       1.11  christos 		printf("Caller of st_dmafree is not lock-owner!\n");
    186        1.3       leo 
    187        1.3       leo 	/*
    188        1.3       leo 	 * Clear lock status, move request from active to free queue.
    189        1.3       leo 	 */
    190        1.3       leo 	*lock_stat = 0;
    191        1.3       leo 	TAILQ_REMOVE(&dma_active, req, entries);
    192        1.3       leo 	TAILQ_INSERT_HEAD(&dma_free, req, entries);
    193        1.3       leo 
    194        1.3       leo 	if((req = dma_active.tqh_first) != NULL) {
    195        1.3       leo 		*req->lock_stat = DMA_LOCK_GRANT;
    196       1.14       leo 
    197       1.14       leo 		if (req->call_func == NULL)
    198       1.14       leo 			wakeup((caddr_t)&dma_active);
    199       1.14       leo 		else {
    200       1.14       leo 		    /*
    201       1.14       leo 		     * Call next request through softint handler. This avoids
    202       1.14       leo 		     * spl-conflicts.
    203       1.14       leo 		     */
    204       1.14       leo 		    add_sicallback((si_farg)req->call_func, req->softc, 0);
    205       1.14       leo 		}
    206        1.1       leo 	}
    207        1.1       leo 	splx(sps);
    208        1.3       leo 	return;
    209        1.1       leo }
    210        1.1       leo 
    211        1.2       leo int
    212        1.2       leo st_dmawanted()
    213        1.2       leo {
    214        1.3       leo 	return(dma_active.tqh_first->entries.tqe_next != NULL);
    215        1.2       leo }
    216        1.2       leo 
    217       1.13       leo int
    218       1.12       leo cdmaint(unused, sr)
    219       1.12       leo void	*unused;
    220        1.6       leo int	sr;	/* sr at time of interrupt */
    221        1.1       leo {
    222        1.6       leo 	dma_farg	int_func;
    223        1.6       leo 	void		*softc;
    224        1.4       leo 
    225        1.4       leo 	if(dma_active.tqh_first != NULL) {
    226       1.13       leo 		/*
    227       1.13       leo 		 * Due to the logic of the ST-DMA chip, it is not possible to
    228       1.13       leo 		 * check for stray interrupts here...
    229       1.13       leo 		 */
    230        1.4       leo 		int_func = dma_active.tqh_first->int_func;
    231        1.4       leo 		softc    = dma_active.tqh_first->softc;
    232        1.8       leo 
    233        1.8       leo 		if(!BASEPRI(sr))
    234        1.8       leo 			add_sicallback((si_farg)int_func, softc, 0);
    235        1.8       leo 		else {
    236        1.8       leo 			spl1();
    237        1.8       leo 			(*int_func)(softc);
    238        1.9       leo 			spl0();
    239        1.8       leo 		}
    240       1.13       leo 		return 1;
    241        1.4       leo 	}
    242       1.13       leo 	return 0;
    243        1.1       leo }
    244        1.1       leo 
    245        1.2       leo /*
    246        1.2       leo  * Setup address for DMA-transfer.
    247        1.2       leo  * Note: The order _is_ important!
    248        1.2       leo  */
    249        1.2       leo void
    250        1.4       leo st_dmaaddr_set(address)
    251        1.1       leo caddr_t	address;
    252        1.1       leo {
    253        1.1       leo 	register u_long ad = (u_long)address;
    254        1.1       leo 
    255        1.1       leo 	DMA->dma_addr[AD_LOW ] = (ad     ) & 0xff;
    256        1.1       leo 	DMA->dma_addr[AD_MID ] = (ad >> 8) & 0xff;
    257        1.1       leo 	DMA->dma_addr[AD_HIGH] = (ad >>16) & 0xff;
    258        1.1       leo }
    259        1.1       leo 
    260        1.2       leo /*
    261        1.4       leo  * Get address from DMA unit.
    262        1.4       leo  */
    263        1.4       leo u_long
    264        1.4       leo st_dmaaddr_get()
    265        1.4       leo {
    266        1.4       leo 	register u_long ad = 0;
    267        1.4       leo 
    268        1.4       leo 	ad  = (DMA->dma_addr[AD_LOW ] & 0xff);
    269        1.4       leo 	ad |= (DMA->dma_addr[AD_MID ] & 0xff) << 8;
    270        1.4       leo 	ad |= (DMA->dma_addr[AD_HIGH] & 0xff) <<16;
    271        1.4       leo 	return(ad);
    272        1.4       leo }
    273        1.4       leo 
    274        1.4       leo /*
    275        1.2       leo  * Program the DMA-controller to transfer 'nblk' blocks of 512 bytes.
    276        1.2       leo  * The DMA_WRBIT trick flushes the FIFO before doing DMA.
    277        1.2       leo  */
    278        1.2       leo void
    279        1.4       leo st_dmacomm(mode, nblk)
    280        1.4       leo int	mode, nblk;
    281        1.1       leo {
    282        1.1       leo 	DMA->dma_mode = mode;
    283        1.2       leo 	DMA->dma_mode = mode ^ DMA_WRBIT;
    284        1.1       leo 	DMA->dma_mode = mode;
    285        1.4       leo 	DMA->dma_data = nblk;
    286        1.5       leo 	delay(2);	/* Needed for Falcon */
    287        1.4       leo 	DMA->dma_mode = DMA_SCREG | (mode & DMA_WRBIT);
    288        1.1       leo }
    289