Annotation of sys/arch/mvme88k/stand/netboot/if_le.c, Revision 1.1.1.1
1.1 nbrk 1: /* $OpenBSD: if_le.c,v 1.6 2006/05/16 22:52:26 miod Exp $ */
2:
3: /*
4: * Copyright (c) 1995 Theo de Raadt
5: *
6: * Redistribution and use in source and binary forms, with or without
7: * modification, are permitted provided that the following conditions
8: * are met:
9: * 1. Redistributions of source code must retain the above copyright
10: * notice, this list of conditions and the following disclaimer.
11: * 2. Redistributions in binary form must reproduce the above copyright
12: * notice, this list of conditions and the following disclaimer in the
13: * documentation and/or other materials provided with the distribution.
14: *
15: * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS
16: * OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
17: * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
18: * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
19: * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
20: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
21: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
22: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
23: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
24: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
25: * SUCH DAMAGE.
26: *
27: * Copyright (c) 1993 Adam Glass
28: * All rights reserved.
29: *
30: * Redistribution and use in source and binary forms, with or without
31: * modification, are permitted provided that the following conditions
32: * are met:
33: * 1. Redistributions of source code must retain the above copyright
34: * notice, this list of conditions and the following disclaimer.
35: * 2. Redistributions in binary form must reproduce the above copyright
36: * notice, this list of conditions and the following disclaimer in the
37: * documentation and/or other materials provided with the distribution.
38: * 3. All advertising materials mentioning features or use of this software
39: * must display the following acknowledgement:
40: * This product includes software developed by Adam Glass.
41: * 4. The name of the Author may not be used to endorse or promote products
42: * derived from this software without specific prior written permission.
43: *
44: * THIS SOFTWARE IS PROVIDED BY Adam Glass ``AS IS'' AND
45: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
46: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
47: * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
48: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
49: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
50: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
51: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
52: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
53: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
54: * SUCH DAMAGE.
55: */
56:
57: #include <sys/param.h>
58: #include <sys/types.h>
59:
60: #include <netinet/in.h>
61: #include <netinet/in_systm.h>
62:
63: #include <machine/prom.h>
64:
65: #include "stand.h"
66: #include "libsa.h"
67: #include "netif.h"
68: #include "config.h"
69:
70: #include "if_lereg.h"
71:
72: int le_debug = 0;
73:
74: void le_end(struct netif *);
75: void le_error(struct netif *, char *, volatile struct lereg1 *);
76: int le_get(struct iodesc *, void *, size_t, time_t);
77: void le_init(struct iodesc *, void *);
78: int le_match(struct netif *, void *);
79: int le_poll(struct iodesc *, void *, int);
80: int le_probe(struct netif *, void *);
81: int le_put(struct iodesc *, void *, size_t);
82: void le_reset(struct netif *, u_char *);
83:
84: struct netif_stats le_stats;
85:
86: struct netif_dif le0_dif = {
87: 0, /* unit */
88: 1, /* nsel */
89: &le_stats,
90: 0,
91: 0,
92: };
93:
94: struct netif_driver le_driver = {
95: "le", /* netif_bname */
96: le_match, /* match */
97: le_probe, /* probe */
98: le_init, /* init */
99: le_get, /* get */
100: le_put, /* put */
101: le_end, /* end */
102: &le0_dif, /* netif_ifs */
103: 1, /* netif_nifs */
104: };
105:
106: struct le_configuration {
107: unsigned int phys_addr;
108: int used;
109: } le_config[] = {
110: { LANCE_REG_ADDR, 0 }
111: };
112:
113: int nle_config = sizeof(le_config) / (sizeof(le_config[0]));
114:
115: struct {
116: struct lereg1 *sc_r1; /* LANCE registers */
117: struct lereg2 *sc_r2; /* RAM */
118: int next_rmd;
119: int next_tmd;
120: } le_softc;
121:
122: int
123: le_match(nif, machdep_hint)
124: struct netif *nif;
125: void *machdep_hint;
126: {
127: char *name;
128: int i, val = 0;
129:
130: name = machdep_hint;
131: if (name && !bcmp(le_driver.netif_bname, name, 2))
132: val += 10;
133: for (i = 0; i < nle_config; i++) {
134: if (le_config[i].used)
135: continue;
136: if (le_debug)
137: printf("le%d: le_match --> %d\n", i, val + 1);
138: le_config[i].used++;
139: return val + 1;
140: }
141: if (le_debug)
142: printf("le%d: le_match --> 0\n", i);
143: return 0;
144: }
145:
146: int
147: le_probe(nif, machdep_hint)
148: struct netif *nif;
149: void *machdep_hint;
150: {
151:
152: /* the set unit is the current unit */
153: if (le_debug)
154: printf("le%d: le_probe called\n", nif->nif_unit);
155:
156: return 1;
157: }
158:
159: void
160: le_error(nif, str, ler1)
161: struct netif *nif;
162: char *str;
163: volatile struct lereg1 *ler1;
164: {
165: /* ler1->ler1_rap = LE_CSRO done in caller */
166: if (ler1->ler1_rdp & LE_C0_BABL)
167: panic("le%d: been babbling, found by '%s'", nif->nif_unit, str);
168: if (ler1->ler1_rdp & LE_C0_CERR) {
169: le_stats.collision_error++;
170: ler1->ler1_rdp = LE_C0_CERR;
171: }
172: if (ler1->ler1_rdp & LE_C0_MISS) {
173: le_stats.missed++;
174: ler1->ler1_rdp = LE_C0_MISS;
175: }
176: if (ler1->ler1_rdp & LE_C0_MERR) {
177: printf("le%d: memory error in '%s'\n", nif->nif_unit, str);
178: panic("memory error");
179: }
180: }
181:
182: void
183: le_reset(nif, myea)
184: struct netif *nif;
185: u_char *myea;
186: {
187: struct lereg1 *ler1 = le_softc.sc_r1;
188: struct lereg2 *ler2 = le_softc.sc_r2;
189: unsigned int a;
190: int timo = 100000, stat, i;
191:
192: if (le_debug)
193: printf("le%d: le_reset called\n", nif->nif_unit);
194: ler1->ler1_rap = LE_CSR0;
195: ler1->ler1_rdp = LE_C0_STOP; /* do nothing until we are finished */
196:
197: bzero(ler2, sizeof(*ler2));
198:
199: ler2->ler2_mode = LE_MODE_NORMAL;
200: ler2->ler2_padr[0] = myea[1];
201: ler2->ler2_padr[1] = myea[0];
202: ler2->ler2_padr[2] = myea[3];
203: ler2->ler2_padr[3] = myea[2];
204: ler2->ler2_padr[4] = myea[5];
205: ler2->ler2_padr[5] = myea[4];
206:
207:
208: ler2->ler2_ladrf0 = 0;
209: ler2->ler2_ladrf1 = 0;
210:
211: a = (u_int) ler2->ler2_rmd;
212: ler2->ler2_rlen = LE_RLEN | (a >> 16);
213: ler2->ler2_rdra = a & LE_ADDR_LOW_MASK;
214:
215: a = (u_int) ler2->ler2_tmd;
216: ler2->ler2_tlen = LE_TLEN | (a >> 16);
217: ler2->ler2_tdra = a & LE_ADDR_LOW_MASK;
218:
219: ler1->ler1_rap = LE_CSR1;
220: a = (u_int) ler2;
221: ler1->ler1_rdp = a & LE_ADDR_LOW_MASK;
222: ler1->ler1_rap = LE_CSR2;
223: ler1->ler1_rdp = a >> 16;
224:
225: for (i = 0; i < LERBUF; i++) {
226: a = (u_int) & ler2->ler2_rbuf[i];
227: ler2->ler2_rmd[i].rmd0 = a & LE_ADDR_LOW_MASK;
228: ler2->ler2_rmd[i].rmd1_bits = LE_R1_OWN;
229: ler2->ler2_rmd[i].rmd1_hadr = a >> 16;
230: ler2->ler2_rmd[i].rmd2 = -LEMTU;
231: ler2->ler2_rmd[i].rmd3 = 0;
232: }
233: for (i = 0; i < LETBUF; i++) {
234: a = (u_int) & ler2->ler2_tbuf[i];
235: ler2->ler2_tmd[i].tmd0 = a & LE_ADDR_LOW_MASK;
236: ler2->ler2_tmd[i].tmd1_bits = 0;
237: ler2->ler2_tmd[i].tmd1_hadr = a >> 16;
238: ler2->ler2_tmd[i].tmd2 = 0;
239: ler2->ler2_tmd[i].tmd3 = 0;
240: }
241:
242: ler1->ler1_rap = LE_CSR3;
243: ler1->ler1_rdp = LE_C3_BSWP;
244:
245: ler1->ler1_rap = LE_CSR0;
246: ler1->ler1_rdp = LE_C0_INIT;
247: do {
248: if (--timo == 0) {
249: printf("le%d: init timeout, stat = 0x%x\n",
250: nif->nif_unit, stat);
251: break;
252: }
253: stat = ler1->ler1_rdp;
254: } while ((stat & LE_C0_IDON) == 0);
255:
256: ler1->ler1_rdp = LE_C0_IDON;
257: le_softc.next_rmd = 0;
258: le_softc.next_tmd = 0;
259: ler1->ler1_rap = LE_CSR0;
260: ler1->ler1_rdp = LE_C0_STRT;
261: }
262:
263: int
264: le_poll(desc, pkt, len)
265: struct iodesc *desc;
266: void *pkt;
267: int len;
268: {
269: struct lereg1 *ler1 = le_softc.sc_r1;
270: struct lereg2 *ler2 = le_softc.sc_r2;
271: unsigned int a;
272: int length;
273: struct lermd *rmd;
274:
275:
276: ler1->ler1_rap = LE_CSR0;
277: if ((ler1->ler1_rdp & LE_C0_RINT) != 0)
278: ler1->ler1_rdp = LE_C0_RINT;
279: rmd = &ler2->ler2_rmd[le_softc.next_rmd];
280: if (rmd->rmd1_bits & LE_R1_OWN) {
281: return (0);
282: }
283: if (ler1->ler1_rdp & LE_C0_ERR)
284: le_error(desc->io_netif, "le_poll", ler1);
285: if (rmd->rmd1_bits & LE_R1_ERR) {
286: printf("le%d_poll: rmd status 0x%x\n", desc->io_netif->nif_unit,
287: rmd->rmd1_bits);
288: length = 0;
289: goto cleanup;
290: }
291: if ((rmd->rmd1_bits & (LE_R1_STP | LE_R1_ENP)) != (LE_R1_STP | LE_R1_ENP))
292: panic("le_poll: chained packet");
293:
294: length = rmd->rmd3;
295: if (length >= LEMTU) {
296: length = 0;
297: panic("csr0 when bad things happen: %x", ler1->ler1_rdp);
298: goto cleanup;
299: }
300: if (!length)
301: goto cleanup;
302: length -= 4;
303: if (length > 0) {
304:
305: /*
306: * if buffer is smaller than the packet truncate it.
307: * (is this wise?)
308: */
309: if (length > len)
310: length = len;
311:
312: bcopy((void *)&ler2->ler2_rbuf[le_softc.next_rmd], pkt, length);
313: }
314: cleanup:
315: a = (u_int) & ler2->ler2_rbuf[le_softc.next_rmd];
316: rmd->rmd0 = a & LE_ADDR_LOW_MASK;
317: rmd->rmd1_hadr = a >> 16;
318: rmd->rmd2 = -LEMTU;
319: le_softc.next_rmd =
320: (le_softc.next_rmd == (LERBUF - 1)) ? 0 : (le_softc.next_rmd + 1);
321: rmd->rmd1_bits = LE_R1_OWN;
322: return length;
323: }
324:
325: int
326: le_put(desc, pkt, len)
327: struct iodesc *desc;
328: void *pkt;
329: size_t len;
330: {
331: volatile struct lereg1 *ler1 = le_softc.sc_r1;
332: volatile struct lereg2 *ler2 = le_softc.sc_r2;
333: volatile struct letmd *tmd;
334: int timo = 100000, stat, i;
335: unsigned int a;
336:
337: ler1->ler1_rap = LE_CSR0;
338: if (ler1->ler1_rdp & LE_C0_ERR)
339: le_error(desc->io_netif, "le_put(way before xmit)", ler1);
340: tmd = &ler2->ler2_tmd[le_softc.next_tmd];
341: while (tmd->tmd1_bits & LE_T1_OWN) {
342: printf("le%d: output buffer busy\n", desc->io_netif->nif_unit);
343: }
344: bcopy(pkt, (void *)ler2->ler2_tbuf[le_softc.next_tmd], len);
345: if (len < 64)
346: tmd->tmd2 = -64;
347: else
348: tmd->tmd2 = -len;
349: tmd->tmd3 = 0;
350: if (ler1->ler1_rdp & LE_C0_ERR)
351: le_error(desc->io_netif, "le_put(before xmit)", ler1);
352: tmd->tmd1_bits = LE_T1_STP | LE_T1_ENP | LE_T1_OWN;
353: a = (u_int) & ler2->ler2_tbuf[le_softc.next_tmd];
354: tmd->tmd0 = a & LE_ADDR_LOW_MASK;
355: tmd->tmd1_hadr = a >> 16;
356: ler1->ler1_rdp = LE_C0_TDMD;
357: if (ler1->ler1_rdp & LE_C0_ERR)
358: le_error(desc->io_netif, "le_put(after xmit)", ler1);
359: do {
360: if (--timo == 0) {
361: printf("le%d: transmit timeout, stat = 0x%x\n",
362: desc->io_netif->nif_unit, stat);
363: if (ler1->ler1_rdp & LE_C0_ERR)
364: le_error(desc->io_netif, "le_put(timeout)", ler1);
365: break;
366: }
367: stat = ler1->ler1_rdp;
368: } while ((stat & LE_C0_TINT) == 0);
369: ler1->ler1_rdp = LE_C0_TINT;
370: if (ler1->ler1_rdp & LE_C0_ERR) {
371: if ((ler1->ler1_rdp & (LE_C0_BABL | LE_C0_CERR | LE_C0_MISS |
372: LE_C0_MERR)) !=
373: LE_C0_CERR)
374: printf("le_put: xmit error, buf %d\n", le_softc.next_tmd);
375: le_error(desc->io_netif, "le_put(xmit error)", ler1);
376: }
377: le_softc.next_tmd = 0;
378: /* (le_softc.next_tmd == (LETBUF - 1)) ? 0 : le_softc.next_tmd + 1;*/
379: if (tmd->tmd1_bits & LE_T1_DEF)
380: le_stats.deferred++;
381: if (tmd->tmd1_bits & LE_T1_ONE)
382: le_stats.collisions++;
383: if (tmd->tmd1_bits & LE_T1_MORE)
384: le_stats.collisions += 2;
385: if (tmd->tmd1_bits & LE_T1_ERR) {
386: printf("le%d: transmit error, error = 0x%x\n", desc->io_netif->nif_unit,
387: tmd->tmd3);
388: return -1;
389: }
390: if (le_debug) {
391: printf("le%d: le_put() successful: sent %d\n",
392: desc->io_netif->nif_unit, len);
393: printf("le%d: le_put(): tmd1_bits: %x tmd3: %x\n",
394: desc->io_netif->nif_unit,
395: (unsigned int) tmd->tmd1_bits,
396: (unsigned int) tmd->tmd3);
397: }
398: return len;
399: }
400:
401: int
402: le_get(desc, pkt, len, timeout)
403: struct iodesc *desc;
404: void *pkt;
405: size_t len;
406: time_t timeout;
407: {
408: time_t t;
409: int cc;
410:
411: t = getsecs();
412: cc = 0;
413: while (((getsecs() - t) < timeout) && !cc) {
414: cc = le_poll(desc, pkt, len);
415: }
416: return cc;
417: }
418: /*
419: * init le device. return 0 on failure, 1 if ok.
420: */
421: void
422: le_init(desc, machdep_hint)
423: struct iodesc *desc;
424: void *machdep_hint;
425: {
426: u_long eram = 4*1024*1024;
427: struct netif *nif = desc->io_netif;
428:
429: if (le_debug)
430: printf("le%d: le_init called\n", desc->io_netif->nif_unit);
431: machdep_common_ether(desc->myea);
432: bzero(&le_softc, sizeof(le_softc));
433: le_softc.sc_r1 =
434: (struct lereg1 *) le_config[desc->io_netif->nif_unit].phys_addr;
435: le_softc.sc_r2 = (struct lereg2 *) (eram - (1024 * 1024));
436: le_reset(desc->io_netif, desc->myea);
437: printf("device: %s%d attached to %s\n", nif->nif_driver->netif_bname,
438: nif->nif_unit, ether_sprintf(desc->myea));
439: }
440:
441: void
442: le_end(nif)
443: struct netif *nif;
444: {
445: struct lereg1 *ler1 = le_softc.sc_r1;
446:
447: if (le_debug)
448: printf("le%d: le_end called\n", nif->nif_unit);
449: ler1->ler1_rap = LE_CSR0;
450: ler1->ler1_rdp = LE_C0_STOP;
451: }
CVSweb
![[BACK]](/icons/back.gif){kind=icon}
Return to if_le.c CVS log ![[TXT]](/icons/text.gif){kind=icon}
![[DIR]](/icons/dir.gif){kind=icon}
Up to [local] / sys / arch / mvme88k / stand / netboot