zsvar.h revision 1.7 1 1.7 agc /* $NetBSD: zsvar.h,v 1.7 2003/08/07 16:27:02 agc Exp $ */
2 1.1 leo
3 1.1 leo /*
4 1.1 leo * Copyright (c) 1992, 1993
5 1.1 leo * The Regents of the University of California. All rights reserved.
6 1.7 agc *
7 1.7 agc * This software was developed by the Computer Systems Engineering group
8 1.7 agc * at Lawrence Berkeley Laboratory under DARPA contract BG 91-66 and
9 1.7 agc * contributed to Berkeley.
10 1.7 agc *
11 1.7 agc * All advertising materials mentioning features or use of this software
12 1.7 agc * must display the following acknowledgement:
13 1.7 agc * This product includes software developed by the University of
14 1.7 agc * California, Lawrence Berkeley Laboratory.
15 1.7 agc *
16 1.7 agc * Redistribution and use in source and binary forms, with or without
17 1.7 agc * modification, are permitted provided that the following conditions
18 1.7 agc * are met:
19 1.7 agc * 1. Redistributions of source code must retain the above copyright
20 1.7 agc * notice, this list of conditions and the following disclaimer.
21 1.7 agc * 2. Redistributions in binary form must reproduce the above copyright
22 1.7 agc * notice, this list of conditions and the following disclaimer in the
23 1.7 agc * documentation and/or other materials provided with the distribution.
24 1.7 agc * 3. Neither the name of the University nor the names of its contributors
25 1.7 agc * may be used to endorse or promote products derived from this software
26 1.7 agc * without specific prior written permission.
27 1.7 agc *
28 1.7 agc * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
29 1.7 agc * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
30 1.7 agc * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
31 1.7 agc * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
32 1.7 agc * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
33 1.7 agc * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
34 1.7 agc * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
35 1.7 agc * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
36 1.7 agc * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
37 1.7 agc * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
38 1.7 agc * SUCH DAMAGE.
39 1.7 agc *
40 1.7 agc * @(#)zsvar.h 8.1 (Berkeley) 6/11/93
41 1.7 agc */
42 1.7 agc
43 1.7 agc /*
44 1.7 agc * Copyright (c) 1995 Leo Weppelman (Atari modifications)
45 1.1 leo *
46 1.1 leo * This software was developed by the Computer Systems Engineering group
47 1.1 leo * at Lawrence Berkeley Laboratory under DARPA contract BG 91-66 and
48 1.1 leo * contributed to Berkeley.
49 1.1 leo *
50 1.1 leo * All advertising materials mentioning features or use of this software
51 1.1 leo * must display the following acknowledgement:
52 1.1 leo * This product includes software developed by the University of
53 1.1 leo * California, Lawrence Berkeley Laboratory.
54 1.1 leo *
55 1.1 leo * Redistribution and use in source and binary forms, with or without
56 1.1 leo * modification, are permitted provided that the following conditions
57 1.1 leo * are met:
58 1.1 leo * 1. Redistributions of source code must retain the above copyright
59 1.1 leo * notice, this list of conditions and the following disclaimer.
60 1.1 leo * 2. Redistributions in binary form must reproduce the above copyright
61 1.1 leo * notice, this list of conditions and the following disclaimer in the
62 1.1 leo * documentation and/or other materials provided with the distribution.
63 1.1 leo * 3. All advertising materials mentioning features or use of this software
64 1.1 leo * must display the following acknowledgement:
65 1.1 leo * This product includes software developed by the University of
66 1.1 leo * California, Berkeley and its contributors.
67 1.1 leo * 4. Neither the name of the University nor the names of its contributors
68 1.1 leo * may be used to endorse or promote products derived from this software
69 1.1 leo * without specific prior written permission.
70 1.1 leo *
71 1.1 leo * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
72 1.1 leo * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
73 1.1 leo * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
74 1.1 leo * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
75 1.1 leo * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
76 1.1 leo * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
77 1.1 leo * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
78 1.1 leo * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
79 1.1 leo * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
80 1.1 leo * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
81 1.1 leo * SUCH DAMAGE.
82 1.1 leo *
83 1.1 leo * @(#)zsvar.h 8.1 (Berkeley) 6/11/93
84 1.1 leo */
85 1.5 gwr
86 1.5 gwr /*
87 1.5 gwr * Register layout is machine-dependent...
88 1.5 gwr */
89 1.5 gwr
90 1.5 gwr struct zschan {
91 1.5 gwr u_char zc_xxx0;
92 1.5 gwr volatile u_char zc_csr; /* ctrl,status, and indirect access */
93 1.5 gwr u_char zc_xxx1;
94 1.5 gwr volatile u_char zc_data; /* data */
95 1.5 gwr };
96 1.5 gwr
97 1.5 gwr struct zsdevice {
98 1.5 gwr struct zschan zs_chan[2];
99 1.5 gwr };
100 1.1 leo
101 1.1 leo /*
102 1.1 leo * Software state, per zs channel.
103 1.1 leo *
104 1.1 leo * The zs chip has insufficient buffering, so we provide a software
105 1.1 leo * buffer using a two-level interrupt scheme. The hardware (high priority)
106 1.1 leo * interrupt simply grabs the `cause' of the interrupt and stuffs it into
107 1.1 leo * a ring buffer. It then schedules a software interrupt; the latter
108 1.1 leo * empties the ring as fast as it can, hoping to avoid overflow.
109 1.1 leo *
110 1.1 leo * Interrupts can happen because of:
111 1.1 leo * - received data;
112 1.1 leo * - transmit pseudo-DMA done; and
113 1.1 leo * - status change.
114 1.1 leo * These are all stored together in the (single) ring. The size of the
115 1.1 leo * ring is a power of two, to make % operations fast. Since we need two
116 1.1 leo * bits to distinguish the interrupt type, and up to 16 for the received
117 1.1 leo * data plus RR1 status, we use 32 bits per ring entry.
118 1.1 leo *
119 1.1 leo * When the value is a character + RR1 status, the character is in the
120 1.1 leo * upper 8 bits of the RR1 status.
121 1.1 leo */
122 1.3 jtc #define ZLRB_RING_SIZE 4096 /* ZS line ring buffer size */
123 1.3 jtc #define ZLRB_RING_MASK 4095 /* mask for same */
124 1.1 leo
125 1.1 leo /* 0 is reserved (means "no interrupt") */
126 1.1 leo #define ZRING_RINT 1 /* receive data interrupt */
127 1.1 leo #define ZRING_XINT 2 /* transmit done interrupt */
128 1.1 leo #define ZRING_SINT 3 /* status change interrupt */
129 1.1 leo
130 1.1 leo #define ZRING_TYPE(x) ((x) & 3)
131 1.1 leo #define ZRING_VALUE(x) ((x) >> 8)
132 1.1 leo #define ZRING_MAKE(t, v) ((t) | (v) << 8)
133 1.1 leo
134 1.1 leo struct zs_chanstate {
135 1.1 leo struct zs_chanstate *cs_next; /* linked list for zshard() */
136 1.1 leo volatile struct zschan *cs_zc; /* points to hardware regs */
137 1.1 leo int cs_unit; /* unit number */
138 1.1 leo struct tty *cs_ttyp; /* ### */
139 1.1 leo
140 1.1 leo /*
141 1.1 leo * We must keep a copy of the write registers as they are
142 1.1 leo * mostly write-only and we sometimes need to set and clear
143 1.1 leo * individual bits (e.g., in WR3). Not all of these are
144 1.1 leo * needed but 16 bytes is cheap and this makes the addressing
145 1.1 leo * simpler. Unfortunately, we can only write to some registers
146 1.1 leo * when the chip is not actually transmitting, so whenever
147 1.1 leo * we are expecting a `transmit done' interrupt the preg array
148 1.1 leo * is allowed to `get ahead' of the current values. In a
149 1.1 leo * few places we must change the current value of a register,
150 1.1 leo * rather than (or in addition to) the pending value; for these
151 1.1 leo * cs_creg[] contains the current value.
152 1.1 leo */
153 1.1 leo u_char cs_creg[16]; /* current values */
154 1.1 leo u_char cs_preg[16]; /* pending values */
155 1.1 leo u_char cs_heldchange; /* change pending (creg != preg) */
156 1.1 leo u_char cs_rr0; /* last rr0 processed */
157 1.1 leo
158 1.1 leo /* pure software data, per channel */
159 1.1 leo char cs_softcar; /* software carrier */
160 1.1 leo char cs_xxx; /* (spare) */
161 1.1 leo
162 1.1 leo /*
163 1.1 leo * The transmit byte count and address are used for pseudo-DMA
164 1.1 leo * output in the hardware interrupt code. PDMA can be suspended
165 1.1 leo * to get pending changes done; heldtbc is used for this. It can
166 1.1 leo * also be stopped for ^S; this sets TS_TTSTOP in tp->t_state.
167 1.1 leo */
168 1.1 leo int cs_tbc; /* transmit byte count */
169 1.1 leo caddr_t cs_tba; /* transmit buffer address */
170 1.1 leo int cs_heldtbc; /* held tbc while xmission stopped */
171 1.1 leo
172 1.1 leo /*
173 1.1 leo * Printing an overrun error message often takes long enough to
174 1.1 leo * cause another overrun, so we only print one per second.
175 1.1 leo */
176 1.1 leo long cs_rotime; /* time of last ring overrun */
177 1.1 leo long cs_fotime; /* time of last fifo overrun */
178 1.1 leo
179 1.1 leo /*
180 1.1 leo * The ring buffer.
181 1.1 leo */
182 1.1 leo u_int cs_rbget; /* ring buffer `get' index */
183 1.1 leo volatile u_int cs_rbput; /* ring buffer `put' index */
184 1.4 leo int *cs_rbuf; /* type, value pairs */
185 1.1 leo };
186 1.2 mycroft
187 1.2 mycroft #define ZS_CHAN_A 0
188 1.2 mycroft #define ZS_CHAN_B 1
189 1.1 leo
190 1.1 leo /*
191 1.1 leo * Macros to read and write individual registers (except 0) in a channel.
192 1.1 leo */
193 1.1 leo #define ZS_READ(c, r) ((c)->zc_csr = (r), (c)->zc_csr)
194 1.1 leo #define ZS_WRITE(c, r, v) ((c)->zc_csr = (r), (c)->zc_csr = (v))
195 1.1 leo
196 1.1 leo /*
197 1.6 leo * Split minor into unit, dialin/dialout & flag nibble.
198 1.1 leo */
199 1.1 leo #define ZS_UNIT(dev) ((minor(dev) >> 4) & 0xf)
200 1.1 leo #define ZS_FLAGS(dev) (minor(dev) & 0xf)
201 1.6 leo #define ZS_DIALOUT(dev) (minor(dev) & 0x80000)
202