NetBSD/sys/dev/isa/isadmavar.h

140 lines
5.3 KiB
C
Raw Normal View History

/* $NetBSD: isadmavar.h,v 1.14 1998/06/28 06:59:36 thorpej Exp $ */
/*-
* Copyright (c) 1997, 1998 The NetBSD Foundation, Inc.
* All rights reserved.
*
* This code is derived from software contributed to The NetBSD Foundation
* by Jason R. Thorpe of the Numerical Aerospace Simulation Facility,
* NASA Ames Research Center.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the NetBSD
* Foundation, Inc. and its contributors.
* 4. Neither the name of The NetBSD Foundation nor the names of its
* contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
* ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
* TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*/
#ifndef _DEV_ISA_ISADMAVAR_H_
#define _DEV_ISA_ISADMAVAR_H_
#define MAX_ISADMA 65536
#define DMAMODE_WRITE 0x00
#define DMAMODE_READ 0x01
#define DMAMODE_LOOP 0x02
#define DMAMODE_LOOPDEMAND 0x04
1994-10-27 07:14:23 +03:00
/*
* ISA DMA state. This structure is provided by the ISA chipset
* DMA entry points to the generic back-end functions that actually
* frob the controller.
*/
struct isa_dma_state {
struct device *ids_dev; /* associated device (for dv_xname) */
bus_space_tag_t ids_bst; /* bus space tag for DMA controller */
bus_space_handle_t ids_dma1h; /* handle for DMA controller #1 */
bus_space_handle_t ids_dma2h; /* handle for DMA controller #2 */
bus_space_handle_t ids_dmapgh; /* handle for DMA page registers */
bus_dma_tag_t ids_dmat; /* DMA tag for DMA controller */
bus_dmamap_t ids_dmamaps[8]; /* DMA maps for each channel */
bus_size_t ids_dmalength[8]; /* size of DMA transfer per channel */
int ids_drqmap; /* available DRQs (bitmap) */
int ids_dmareads; /* state for isa_dmadone() (bitmap) */
int ids_dmafinished; /* DMA completion state (bitmap) */
int ids_masked; /* masked channels (bitmap) */
int ids_frozen; /* `frozen' count */
int ids_initialized; /* only initialize once... */
};
#define ISA_DMA_DRQ_ISFREE(state, drq) \
(((state)->ids_drqmap & (1 << (drq))) == 0)
#define ISA_DMA_DRQ_ALLOC(state, drq) \
(state)->ids_drqmap |= (1 << (drq))
#define ISA_DMA_DRQ_FREE(state, drq) \
(state)->ids_drqmap &= ~(1 << (drq))
#define ISA_DMA_MASK_SET(state, drq) \
(state)->ids_masked |= (1 << (drq))
#define ISA_DMA_MASK_CLR(state, drq) \
(state)->ids_masked &= ~(1 << (drq))
/*
* Memory list used by _isa_malloc().
*/
struct isa_mem {
struct isa_dma_state *ids;
int chan;
bus_size_t size;
bus_addr_t addr;
caddr_t kva;
struct isa_mem *next;
};
#ifdef _KERNEL
struct proc;
void _isa_dmainit __P((struct isa_dma_state *, bus_space_tag_t,
bus_dma_tag_t, struct device *));
int _isa_dmacascade __P((struct isa_dma_state *, int));
int _isa_dmamap_create __P((struct isa_dma_state *, int,
bus_size_t, int));
void _isa_dmamap_destroy __P((struct isa_dma_state *, int));
int _isa_dmastart __P((struct isa_dma_state *, int, void *, bus_size_t,
struct proc *, int, int));
void _isa_dmaabort __P((struct isa_dma_state *, int));
bus_size_t _isa_dmacount __P((struct isa_dma_state *, int));
int _isa_dmafinished __P((struct isa_dma_state *, int));
void _isa_dmadone __P((struct isa_dma_state *, int));
void _isa_dmafreeze __P((struct isa_dma_state *));
void _isa_dmathaw __P((struct isa_dma_state *));
int _isa_dmamem_alloc __P((struct isa_dma_state *, int, bus_size_t,
bus_addr_t *, int));
void _isa_dmamem_free __P((struct isa_dma_state *, int, bus_addr_t,
bus_size_t));
int _isa_dmamem_map __P((struct isa_dma_state *, int, bus_addr_t,
bus_size_t, caddr_t *, int));
void _isa_dmamem_unmap __P((struct isa_dma_state *, int, caddr_t,
size_t));
int _isa_dmamem_mmap __P((struct isa_dma_state *, int, bus_addr_t,
bus_size_t, int, int, int));
int _isa_drq_isfree __P((struct isa_dma_state *, int));
void *_isa_malloc __P((struct isa_dma_state *, int, size_t, int, int));
void _isa_free __P((void *, int));
int _isa_mappage __P((void *, int, int));
#endif /* _KERNEL */
#endif /* _DEV_ISA_ISADMAVAR_H_ */