1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
|
/* $OpenBSD: if_le.c,v 1.1 1998/02/03 11:48:27 maja Exp $ */
/* $NetBSD: if_le.c,v 1.2 1997/03/22 12:47:31 ragge Exp $ */
/*
* Copyright (c) 1997 Ludd, University of Lule}, Sweden.
* All rights reserved.
*
* 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 at Ludd, University of
* Lule}, Sweden and its contributors.
* 4. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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.
*/
/*
* Standalone routine for MicroVAX LANCE chip.
*/
#include <sys/param.h>
#include <sys/types.h>
#include <netinet/in.h>
#include <netinet/in_systm.h>
#include <lib/libsa/netif.h>
#include <dev/ic/am7990reg.h>
#define ETHER_MIN_LEN 64
#define ETHER_MAX_LEN 1518
#define ETHER_ADDR_LEN 6
/*
* The following are incorrect. Why doesn't DEC follow its own specs???
*/
#define TLEN 1
#define NTBUF (1 << TLEN)
#define RLEN 3
#define NRBUF (1 << RLEN)
#define BUFSIZE 1518
#define QW_ALLOC(x) ((alloc((x) + 7) + 7) & ~7)
int le_probe(), le_match(), le_get(), le_put();
void le_init();
struct netif_stats le_stats;
struct netif_dif le_ifs[] = {
/* dif_unit dif_nsel dif_stats dif_private */
{ 0, 1, &le_stats, },
};
struct netif_stats le_stats;
struct netif_driver le_driver = {
"le", le_match, le_probe, le_init, le_get, le_put, 0, le_ifs, 1,
};
/*
* Init block & buffer descriptors according to DEC system
* specification documentation.
*/
struct initblock {
short ib_mode;
char ib_padr[6]; /* Ethernet address */
int ib_ladrf1;
int ib_ladrf2;
int ib_rdr; /* Receive address */
int ib_tdr; /* Transmit address */
} *initblock = NULL;
struct nireg {
volatile short ni_rdp; /* data port */
volatile short ni_pad0;
volatile short ni_rap; /* register select port */
} *nireg = (struct nireg *)0x200e0000;
volatile struct buffdesc {
int bd_adrflg;
short bd_bcnt;
short bd_mcnt;
} *rdesc, *tdesc;
/* Flags in the address field */
#define BR_OWN 0x80000000
#define BR_ERR 0x40000000
#define BR_FRAM 0x20000000
#define BR_OFLO 0x10000000
#define BR_CRC 0x08000000
#define BR_BUFF 0x04000000
#define BR_STP 0x02000000
#define BR_ENP 0x01000000
#define BT_OWN 0x80000000
#define BT_ERR 0x40000000
#define BT_MORE 0x10000000
#define BT_ONE 0x08000000
#define BT_DEF 0x04000000
#define BT_STP 0x02000000
#define BT_ENP 0x01000000
int next_rdesc, next_tdesc;
#define LEWRCSR(port, val) { \
nireg->ni_rap = (port); \
nireg->ni_rdp = (val); \
}
#define LERDCSR(port) \
(nireg->ni_rap = port, nireg->ni_rdp)
int
le_match(nif, machdep_hint)
struct netif *nif;
void *machdep_hint;
{
return strcmp(machdep_hint, "le") == 0;
}
le_probe(nif, machdep_hint)
struct netif *nif;
void *machdep_hint;
{
return 0;
}
void
le_init(desc, machdep_hint)
struct iodesc *desc;
void *machdep_hint;
{
int stat, i, *ea;
volatile int to = 100000;
*(int *)0x20080014 = 0; /* Be sure we do DMA in low 16MB */
next_rdesc = next_tdesc = 0;
LEWRCSR(LE_CSR0, LE_C0_STOP);
while (to--)
;
if (initblock == NULL) {
ea = (void *)0x20090000; /* XXX ethernetadressen */
for (i = 0; i < 6; i++)
desc->myea[i] = ea[i] & 0377;
initblock = (void *)alloc(sizeof(struct initblock));
initblock->ib_mode = LE_MODE_NORMAL;
bcopy(desc->myea, initblock->ib_padr, 6);
initblock->ib_ladrf1 = 0;
initblock->ib_ladrf2 = 0;
(int)rdesc = QW_ALLOC(sizeof(struct buffdesc) * NRBUF);
initblock->ib_rdr = (RLEN << 29) | (int)rdesc;
(int)tdesc = QW_ALLOC(sizeof(struct buffdesc) * NTBUF);
initblock->ib_tdr = (TLEN << 29) | (int)tdesc;
for (i = 0; i < NRBUF; i++) {
rdesc[i].bd_adrflg = alloc(BUFSIZE) | BR_OWN;
rdesc[i].bd_bcnt = -BUFSIZE;
rdesc[i].bd_mcnt = 0;
}
for (i = 0; i < NTBUF; i++) {
tdesc[i].bd_adrflg = alloc(BUFSIZE);
tdesc[i].bd_bcnt = 0xf000;
tdesc[i].bd_mcnt = 0;
}
}
LEWRCSR(LE_CSR1, (int)initblock & 0xffff);
LEWRCSR(LE_CSR2, ((int)initblock >> 16) & 0xff);
LEWRCSR(LE_CSR0, LE_C0_INIT);
to = 100000;
while (to--)
if (LERDCSR(LE_CSR0) & LE_C0_IDON)
break;
LEWRCSR(LE_CSR0, LE_C0_INEA | LE_C0_STRT | LE_C0_IDON);
}
int
le_get(desc, pkt, maxlen, timeout)
struct iodesc *desc;
void *pkt;
int maxlen;
time_t timeout;
{
int csr, len;
volatile int to = 100000 * timeout;
retry:
if (to-- == 0)
return 0;
csr = LERDCSR(LE_CSR0);
LEWRCSR(LE_CSR0, csr & (LE_C0_BABL|LE_C0_MISS|LE_C0_MERR|LE_C0_RINT));
if (rdesc[next_rdesc].bd_adrflg & BR_OWN)
goto retry;
if (rdesc[next_rdesc].bd_adrflg & BR_ERR)
len = 0;
else {
if ((len = rdesc[next_rdesc].bd_mcnt - 4) > maxlen)
len = maxlen;
bcopy((void *)(rdesc[next_rdesc].bd_adrflg&0xffffff),pkt,len);
}
rdesc[next_rdesc].bd_mcnt = 0;
rdesc[next_rdesc].bd_adrflg |= BR_OWN;
if (++next_rdesc >= NRBUF)
next_rdesc = 0;
if (len == 0)
goto retry;
return len;
}
int
le_put(desc, pkt, len)
struct iodesc *desc;
void *pkt;
int len;
{
volatile int to = 100000;
int csr;
retry:
if (--to == 0)
return -1;
csr = LERDCSR(LE_CSR0);
LEWRCSR(LE_CSR0, csr & (LE_C0_MISS|LE_C0_CERR|LE_C0_TINT));
if (tdesc[next_tdesc].bd_adrflg & BT_OWN)
goto retry;
bcopy(pkt, (void *)(tdesc[next_tdesc].bd_adrflg & 0xffffff), len);
tdesc[next_tdesc].bd_bcnt =
(len < ETHER_MIN_LEN ? -ETHER_MIN_LEN : -len);
tdesc[next_tdesc].bd_mcnt = 0;
tdesc[next_tdesc].bd_adrflg |= BT_OWN | BT_STP | BT_ENP;
LEWRCSR(LE_CSR0, LE_C0_TDMD);
to = 100000;
while (((LERDCSR(LE_CSR0) & LE_C0_TINT) == 0) && --to)
;
LEWRCSR(LE_CSR0, LE_C0_TINT);
if (++next_tdesc >= NTBUF)
next_tdesc = 0;
if (to)
return len;
return -1;
}
|