Home | History | Annotate | Line # | Download | only in dev
dma.c revision 1.11
      1  1.11  christos /*	$NetBSD: dma.c,v 1.11 1996/10/13 04:10:52 christos 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.3       leo #include <sys/queue.h>
     58   1.1       leo #include <machine/cpu.h>
     59   1.1       leo #include <machine/iomap.h>
     60   1.1       leo #include <machine/dma.h>
     61   1.1       leo 
     62   1.1       leo #define	NDMA_DEV	10	/* Max 2 floppy's, 8 hard-disks		*/
     63   1.3       leo typedef struct dma_entry {
     64   1.3       leo 	TAILQ_ENTRY(dma_entry)	entries;	/* List pointers	   */
     65   1.6       leo 	void		(*call_func)(void *);	/* Call when lock granted  */
     66   1.6       leo 	void		(*int_func)(void *);	/* Call on DMA interrupt   */
     67   1.6       leo 	void		*softc;			/* Arg. to int_func	   */
     68   1.6       leo 	int		*lock_stat;		/* status of DMA lock	   */
     69   1.3       leo } DMA_ENTRY;
     70   1.3       leo 
     71   1.3       leo /*
     72   1.3       leo  * Preallocated entries. An allocator seem an overkill here.
     73   1.3       leo  */
     74   1.3       leo static	DMA_ENTRY dmatable[NDMA_DEV];	/* preallocated entries		*/
     75   1.3       leo 
     76   1.3       leo /*
     77   1.3       leo  * Heads of free and active lists:
     78   1.3       leo  */
     79   1.3       leo static  TAILQ_HEAD(freehead, dma_entry)	dma_free;
     80   1.3       leo static  TAILQ_HEAD(acthead, dma_entry)	dma_active;
     81   1.3       leo 
     82   1.3       leo static	int	must_init = 1;		/* Must initialize		*/
     83   1.1       leo 
     84   1.6       leo void	cdmaint __P((int));
     85   1.6       leo 
     86   1.6       leo long	sr;	/* sr at time of interrupt */
     87   1.3       leo static	void	init_queues __P((void));
     88   1.1       leo 
     89   1.6       leo static void
     90   1.6       leo init_queues()
     91   1.3       leo {
     92   1.3       leo 	int	i;
     93   1.3       leo 
     94   1.3       leo 	TAILQ_INIT(&dma_free);
     95   1.3       leo 	TAILQ_INIT(&dma_active);
     96   1.3       leo 
     97   1.3       leo 	for(i = 0; i < NDMA_DEV; i++)
     98   1.3       leo 		TAILQ_INSERT_HEAD(&dma_free, &dmatable[i], entries);
     99   1.3       leo }
    100   1.3       leo 
    101   1.6       leo int
    102   1.6       leo st_dmagrab(int_func, call_func, softc, lock_stat, rcaller)
    103   1.6       leo dma_farg	int_func;
    104   1.6       leo dma_farg 	call_func;
    105   1.6       leo void		*softc;
    106   1.6       leo int		*lock_stat;
    107   1.6       leo int		rcaller;
    108   1.1       leo {
    109   1.1       leo 	int		sps;
    110   1.3       leo 	DMA_ENTRY	*req;
    111   1.1       leo 
    112   1.3       leo 	if(must_init) {
    113   1.3       leo 		init_queues();
    114   1.3       leo 		must_init = 0;
    115   1.3       leo 	}
    116   1.3       leo 	*lock_stat = DMA_LOCK_REQ;
    117   1.1       leo 
    118   1.3       leo 	sps = splhigh();
    119   1.3       leo 
    120   1.3       leo 	/*
    121   1.3       leo 	 * Create a request...
    122   1.3       leo 	 */
    123   1.3       leo 	if(dma_free.tqh_first == NULL)
    124   1.3       leo 		panic("st_dmagrab: Too many outstanding requests\n");
    125   1.3       leo 	req = dma_free.tqh_first;
    126   1.3       leo 	TAILQ_REMOVE(&dma_free, dma_free.tqh_first, entries);
    127   1.3       leo 	req->call_func = call_func;
    128   1.3       leo 	req->int_func  = int_func;
    129   1.3       leo 	req->softc     = softc;
    130   1.3       leo 	req->lock_stat = lock_stat;
    131   1.3       leo 	TAILQ_INSERT_TAIL(&dma_active, req, entries);
    132   1.3       leo 
    133   1.3       leo 	if(dma_active.tqh_first != req) {
    134   1.1       leo 		splx(sps);
    135   1.2       leo 		return(0);
    136   1.1       leo 	}
    137   1.3       leo 	splx(sps);
    138   1.3       leo 
    139   1.3       leo 	/*
    140   1.3       leo 	 * We're at the head of the queue, ergo: we got the lock.
    141   1.3       leo 	 */
    142   1.3       leo 	*lock_stat = DMA_LOCK_GRANT;
    143   1.3       leo 
    144   1.2       leo 	if(rcaller) {
    145   1.2       leo 		/*
    146   1.2       leo 		 * Just return to caller immediately without going
    147   1.2       leo 		 * through 'call_func' first.
    148   1.2       leo 		 */
    149   1.2       leo 		return(1);
    150   1.2       leo 	}
    151   1.2       leo 
    152   1.1       leo 	(*call_func)(softc);	/* Call followup function		*/
    153   1.2       leo 	return(0);
    154   1.1       leo }
    155   1.1       leo 
    156   1.2       leo void
    157   1.3       leo st_dmafree(softc, lock_stat)
    158   1.3       leo void	*softc;
    159   1.3       leo int	*lock_stat;
    160   1.1       leo {
    161   1.1       leo 	int		sps;
    162   1.3       leo 	DMA_ENTRY	*req;
    163   1.1       leo 
    164   1.3       leo 	sps = splhigh();
    165   1.3       leo 
    166   1.3       leo 	/*
    167   1.3       leo 	 * Some validity checks first.
    168   1.3       leo 	 */
    169   1.3       leo 	if((req = dma_active.tqh_first) == NULL)
    170   1.3       leo 		panic("st_dmafree: empty active queue\n");
    171   1.3       leo 	if(req->softc != softc)
    172  1.11  christos 		printf("Caller of st_dmafree is not lock-owner!\n");
    173   1.3       leo 
    174   1.3       leo 	/*
    175   1.3       leo 	 * Clear lock status, move request from active to free queue.
    176   1.3       leo 	 */
    177   1.3       leo 	*lock_stat = 0;
    178   1.3       leo 	TAILQ_REMOVE(&dma_active, req, entries);
    179   1.3       leo 	TAILQ_INSERT_HEAD(&dma_free, req, entries);
    180   1.3       leo 
    181   1.3       leo 	if((req = dma_active.tqh_first) != NULL) {
    182   1.3       leo 		/*
    183   1.3       leo 		 * Call next request through softint handler. This avoids
    184   1.3       leo 		 * spl-conflicts.
    185   1.3       leo 		 */
    186   1.3       leo 		*req->lock_stat = DMA_LOCK_GRANT;
    187   1.7       leo 		add_sicallback((si_farg)req->call_func, req->softc, 0);
    188   1.1       leo 	}
    189   1.1       leo 	splx(sps);
    190   1.3       leo 	return;
    191   1.1       leo }
    192   1.1       leo 
    193   1.2       leo int
    194   1.2       leo st_dmawanted()
    195   1.2       leo {
    196   1.3       leo 	return(dma_active.tqh_first->entries.tqe_next != NULL);
    197   1.2       leo }
    198   1.2       leo 
    199   1.6       leo void
    200   1.1       leo cdmaint(sr)
    201   1.6       leo int	sr;	/* sr at time of interrupt */
    202   1.1       leo {
    203   1.6       leo 	dma_farg	int_func;
    204   1.6       leo 	void		*softc;
    205   1.4       leo 
    206   1.4       leo 	if(dma_active.tqh_first != NULL) {
    207   1.4       leo 		int_func = dma_active.tqh_first->int_func;
    208   1.4       leo 		softc    = dma_active.tqh_first->softc;
    209   1.8       leo 
    210   1.8       leo 		if(!BASEPRI(sr))
    211   1.8       leo 			add_sicallback((si_farg)int_func, softc, 0);
    212   1.8       leo 		else {
    213   1.8       leo 			spl1();
    214   1.8       leo 			(*int_func)(softc);
    215   1.9       leo 			spl0();
    216   1.8       leo 		}
    217   1.4       leo 	}
    218  1.11  christos 	else printf("DMA interrupt discarded\n");
    219   1.1       leo }
    220   1.1       leo 
    221   1.2       leo /*
    222   1.2       leo  * Setup address for DMA-transfer.
    223   1.2       leo  * Note: The order _is_ important!
    224   1.2       leo  */
    225   1.2       leo void
    226   1.4       leo st_dmaaddr_set(address)
    227   1.1       leo caddr_t	address;
    228   1.1       leo {
    229   1.1       leo 	register u_long ad = (u_long)address;
    230   1.1       leo 
    231   1.1       leo 	DMA->dma_addr[AD_LOW ] = (ad     ) & 0xff;
    232   1.1       leo 	DMA->dma_addr[AD_MID ] = (ad >> 8) & 0xff;
    233   1.1       leo 	DMA->dma_addr[AD_HIGH] = (ad >>16) & 0xff;
    234   1.1       leo }
    235   1.1       leo 
    236   1.2       leo /*
    237   1.4       leo  * Get address from DMA unit.
    238   1.4       leo  */
    239   1.4       leo u_long
    240   1.4       leo st_dmaaddr_get()
    241   1.4       leo {
    242   1.4       leo 	register u_long ad = 0;
    243   1.4       leo 
    244   1.4       leo 	ad  = (DMA->dma_addr[AD_LOW ] & 0xff);
    245   1.4       leo 	ad |= (DMA->dma_addr[AD_MID ] & 0xff) << 8;
    246   1.4       leo 	ad |= (DMA->dma_addr[AD_HIGH] & 0xff) <<16;
    247   1.4       leo 	return(ad);
    248   1.4       leo }
    249   1.4       leo 
    250   1.4       leo /*
    251   1.2       leo  * Program the DMA-controller to transfer 'nblk' blocks of 512 bytes.
    252   1.2       leo  * The DMA_WRBIT trick flushes the FIFO before doing DMA.
    253   1.2       leo  */
    254   1.2       leo void
    255   1.4       leo st_dmacomm(mode, nblk)
    256   1.4       leo int	mode, nblk;
    257   1.1       leo {
    258   1.1       leo 	DMA->dma_mode = mode;
    259   1.2       leo 	DMA->dma_mode = mode ^ DMA_WRBIT;
    260   1.1       leo 	DMA->dma_mode = mode;
    261   1.4       leo 	DMA->dma_data = nblk;
    262   1.5       leo 	delay(2);	/* Needed for Falcon */
    263   1.4       leo 	DMA->dma_mode = DMA_SCREG | (mode & DMA_WRBIT);
    264   1.1       leo }
    265