|
|
1.1 root 1: /*
2: * Copyright (c) 1982, 1990 The Regents of the University of California.
3: * All rights reserved.
4: *
5: * Redistribution and use in source and binary forms, with or without
6: * modification, are permitted provided that the following conditions
7: * are met:
8: * 1. Redistributions of source code must retain the above copyright
9: * notice, this list of conditions and the following disclaimer.
10: * 2. Redistributions in binary form must reproduce the above copyright
11: * notice, this list of conditions and the following disclaimer in the
12: * documentation and/or other materials provided with the distribution.
13: * 3. All advertising materials mentioning features or use of this software
14: * must display the following acknowledgement:
15: * This product includes software developed by the University of
16: * California, Berkeley and its contributors.
17: * 4. Neither the name of the University nor the names of its contributors
18: * may be used to endorse or promote products derived from this software
19: * without specific prior written permission.
20: *
21: * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24: * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31: * SUCH DAMAGE.
32: *
1.1.1.2 ! root 33: * from: @(#)hpibvar.h 7.3 (Berkeley) 5/7/91
! 34: * hpibvar.h,v 1.2 1993/05/22 07:56:22 cgd Exp
1.1 root 35: */
36:
37: #define HPIB_IPL(x) ((((x) >> 4) & 0x3) + 3)
38:
39: #define HPIBA 32
40: #define HPIBB 1
41: #define HPIBC 8
42: #define HPIBA_BA 21
43: #define HPIBC_BA 30
44: #define HPIBA_IPL 3
45:
46: #define CSA_BA 0x1F
47:
48: #define IDS_WDMA 0x04
49: #define IDS_WRITE 0x08
50: #define IDS_IR 0x40
51: #define IDS_IE 0x80
52: #define IDS_DMA(x) (1 << (x))
53:
54: #define C_DCL 0x14
55: #define C_LAG 0x20
56: #define C_UNL 0x3f
57: #define C_TAG 0x40
58: #define C_UNA 0x5e
59: #define C_UNT 0x5f
60: #define C_SCG 0x60
61:
62: struct hpib_softc {
63: struct hp_ctlr *sc_hc;
64: int sc_flags;
65: struct devqueue sc_dq;
66: struct devqueue sc_sq;
67: int sc_ba;
68: int sc_type;
69: char *sc_addr;
70: int sc_count;
71: int sc_curcnt;
72: };
73:
74: /* sc_flags */
75: #define HPIBF_IO 0x1
76: #define HPIBF_DONE 0x2
77: #define HPIBF_PPOLL 0x4
78: #define HPIBF_READ 0x8
79: #define HPIBF_DMA16 0x8000
80:
81: #ifdef KERNEL
82: extern struct hpib_softc hpib_softc[];
83: extern caddr_t internalhpib;
84: extern int hpibtimeout;
85: extern int hpibdmathresh;
86: #endif
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.