Home | History | Annotate | Line # | Download | only in sboot
le_poll.c revision 1.1
      1  1.1  chuck /*	$NetBSD: le_poll.c,v 1.1 1995/07/25 23:12:31 chuck Exp $	*/
      2  1.1  chuck 
      3  1.1  chuck /*
      4  1.1  chuck  * Copyright (c) 1993 Adam Glass
      5  1.1  chuck  * All rights reserved.
      6  1.1  chuck  *
      7  1.1  chuck  * Redistribution and use in source and binary forms, with or without
      8  1.1  chuck  * modification, are permitted provided that the following conditions
      9  1.1  chuck  * are met:
     10  1.1  chuck  * 1. Redistributions of source code must retain the above copyright
     11  1.1  chuck  *    notice, this list of conditions and the following disclaimer.
     12  1.1  chuck  * 2. Redistributions in binary form must reproduce the above copyright
     13  1.1  chuck  *    notice, this list of conditions and the following disclaimer in the
     14  1.1  chuck  *    documentation and/or other materials provided with the distribution.
     15  1.1  chuck  * 3. All advertising materials mentioning features or use of this software
     16  1.1  chuck  *    must display the following acknowledgement:
     17  1.1  chuck  *	This product includes software developed by Adam Glass.
     18  1.1  chuck  * 4. The name of the Author may not be used to endorse or promote products
     19  1.1  chuck  *    derived from this software without specific prior written permission.
     20  1.1  chuck  *
     21  1.1  chuck  * THIS SOFTWARE IS PROVIDED BY Adam Glass ``AS IS'' AND
     22  1.1  chuck  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     23  1.1  chuck  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     24  1.1  chuck  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     25  1.1  chuck  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     26  1.1  chuck  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     27  1.1  chuck  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     28  1.1  chuck  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     29  1.1  chuck  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     30  1.1  chuck  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     31  1.1  chuck  * SUCH DAMAGE.
     32  1.1  chuck  */
     33  1.1  chuck 
     34  1.1  chuck #include "sboot.h"
     35  1.1  chuck #include "if_lereg.h"
     36  1.1  chuck 
     37  1.1  chuck struct {
     38  1.1  chuck 	struct	lereg1 *sc_r1;	/* LANCE registers */
     39  1.1  chuck 	struct	lereg2 *sc_r2;	/* RAM */
     40  1.1  chuck 	int next_rmd;
     41  1.1  chuck 	int next_tmd;
     42  1.1  chuck } le_softc;
     43  1.1  chuck 
     44  1.1  chuck void le_error(str, ler1)
     45  1.1  chuck      char *str;
     46  1.1  chuck      struct lereg1 *ler1;
     47  1.1  chuck {
     48  1.1  chuck     /* ler1->ler1_rap = LE_CSRO done in caller */
     49  1.1  chuck     if (ler1->ler1_rdp & LE_C0_BABL) {
     50  1.1  chuck 	printf("le0: been babbling, found by '%s'\n", str);
     51  1.1  chuck 	callrom();
     52  1.1  chuck     }
     53  1.1  chuck     if (ler1->ler1_rdp & LE_C0_CERR) {
     54  1.1  chuck 	ler1->ler1_rdp = LE_C0_CERR;
     55  1.1  chuck     }
     56  1.1  chuck     if (ler1->ler1_rdp & LE_C0_MISS) {
     57  1.1  chuck 	ler1->ler1_rdp = LE_C0_MISS;
     58  1.1  chuck     }
     59  1.1  chuck     if (ler1->ler1_rdp & LE_C0_MERR) {
     60  1.1  chuck 	printf("le0: memory error in '%s'\n", str);
     61  1.1  chuck 	callrom();
     62  1.1  chuck     }
     63  1.1  chuck 
     64  1.1  chuck }
     65  1.1  chuck 
     66  1.1  chuck void le_reset(myea)
     67  1.1  chuck      u_char *myea;
     68  1.1  chuck {
     69  1.1  chuck     struct lereg1 *ler1 = le_softc.sc_r1;
     70  1.1  chuck     struct lereg2 *ler2 = le_softc.sc_r2;
     71  1.1  chuck     unsigned int a;
     72  1.1  chuck     int timo = 100000, stat, i;
     73  1.1  chuck 
     74  1.1  chuck     ler1->ler1_rap = LE_CSR0;
     75  1.1  chuck     ler1->ler1_rdp = LE_C0_STOP;	/* do nothing until we are finished */
     76  1.1  chuck 
     77  1.1  chuck     bzero(ler2, sizeof(*ler2));
     78  1.1  chuck 
     79  1.1  chuck     ler2->ler2_mode = LE_MODE_NORMAL;
     80  1.1  chuck     ler2->ler2_padr[0] = myea[1];
     81  1.1  chuck     ler2->ler2_padr[1] = myea[0];
     82  1.1  chuck     ler2->ler2_padr[2] = myea[3];
     83  1.1  chuck     ler2->ler2_padr[3] = myea[2];
     84  1.1  chuck     ler2->ler2_padr[4] = myea[5];
     85  1.1  chuck     ler2->ler2_padr[5] = myea[4];
     86  1.1  chuck 
     87  1.1  chuck 
     88  1.1  chuck     ler2->ler2_ladrf0 = 0;
     89  1.1  chuck     ler2->ler2_ladrf1 = 0;
     90  1.1  chuck 
     91  1.1  chuck     a = (u_int)ler2->ler2_rmd;
     92  1.1  chuck     ler2->ler2_rlen =  LE_RLEN | (a >> 16);
     93  1.1  chuck     ler2->ler2_rdra = a & LE_ADDR_LOW_MASK;
     94  1.1  chuck 
     95  1.1  chuck     a = (u_int)ler2->ler2_tmd;
     96  1.1  chuck     ler2->ler2_tlen = LE_TLEN | (a >> 16);
     97  1.1  chuck     ler2->ler2_tdra = a & LE_ADDR_LOW_MASK;
     98  1.1  chuck 
     99  1.1  chuck     ler1->ler1_rap = LE_CSR1;
    100  1.1  chuck     a = (u_int)ler2;
    101  1.1  chuck     ler1->ler1_rdp = a & LE_ADDR_LOW_MASK;
    102  1.1  chuck     ler1->ler1_rap = LE_CSR2;
    103  1.1  chuck     ler1->ler1_rdp = a >> 16;
    104  1.1  chuck 
    105  1.1  chuck     for (i = 0; i < LERBUF; i++) {
    106  1.1  chuck 	a = (u_int)&ler2->ler2_rbuf[i];
    107  1.1  chuck 	ler2->ler2_rmd[i].rmd0 = a & LE_ADDR_LOW_MASK;
    108  1.1  chuck 	ler2->ler2_rmd[i].rmd1_bits = LE_R1_OWN;
    109  1.1  chuck 	ler2->ler2_rmd[i].rmd1_hadr = a >> 16;
    110  1.1  chuck 	ler2->ler2_rmd[i].rmd2 = -LEMTU;
    111  1.1  chuck 	ler2->ler2_rmd[i].rmd3 = 0;
    112  1.1  chuck     }
    113  1.1  chuck     for (i = 0; i < LETBUF; i++) {
    114  1.1  chuck 	a = (u_int)&ler2->ler2_tbuf[i];
    115  1.1  chuck 	ler2->ler2_tmd[i].tmd0 = a & LE_ADDR_LOW_MASK;
    116  1.1  chuck 	ler2->ler2_tmd[i].tmd1_bits = 0;
    117  1.1  chuck 	ler2->ler2_tmd[i].tmd1_hadr = a >> 16;
    118  1.1  chuck 	ler2->ler2_tmd[i].tmd2 = 0;
    119  1.1  chuck 	ler2->ler2_tmd[i].tmd3 = 0;
    120  1.1  chuck     }
    121  1.1  chuck 
    122  1.1  chuck     ler1->ler1_rap = LE_CSR3;
    123  1.1  chuck     ler1->ler1_rdp = LE_C3_BSWP;
    124  1.1  chuck 
    125  1.1  chuck     ler1->ler1_rap = LE_CSR0;
    126  1.1  chuck     ler1->ler1_rdp = LE_C0_INIT;
    127  1.1  chuck     do {
    128  1.1  chuck 	if (--timo == 0) {
    129  1.1  chuck 	    printf("le0: init timeout, stat = 0x%x\n", stat);
    130  1.1  chuck 	    break;
    131  1.1  chuck 	}
    132  1.1  chuck 	stat = ler1->ler1_rdp;
    133  1.1  chuck     } while ((stat & LE_C0_IDON) == 0);
    134  1.1  chuck 
    135  1.1  chuck     ler1->ler1_rdp = LE_C0_IDON;
    136  1.1  chuck     le_softc.next_rmd = 0;
    137  1.1  chuck     le_softc.next_tmd = 0;
    138  1.1  chuck     ler1->ler1_rap = LE_CSR0;
    139  1.1  chuck     ler1->ler1_rdp = LE_C0_STRT;
    140  1.1  chuck }
    141  1.1  chuck 
    142  1.1  chuck int le_poll(pkt, len)
    143  1.1  chuck      void *pkt;
    144  1.1  chuck      int len;
    145  1.1  chuck {
    146  1.1  chuck     struct lereg1 *ler1 = le_softc.sc_r1;
    147  1.1  chuck     struct lereg2 *ler2 = le_softc.sc_r2;
    148  1.1  chuck     unsigned int a;
    149  1.1  chuck     int length;
    150  1.1  chuck     struct lermd *rmd;
    151  1.1  chuck 
    152  1.1  chuck     ler1->ler1_rap = LE_CSR0;
    153  1.1  chuck     if ((ler1->ler1_rdp & LE_C0_RINT) != 0)
    154  1.1  chuck       ler1->ler1_rdp = LE_C0_RINT;
    155  1.1  chuck     rmd = &ler2->ler2_rmd[le_softc.next_rmd];
    156  1.1  chuck     if (rmd->rmd1_bits & LE_R1_OWN) {
    157  1.1  chuck 	return(0);
    158  1.1  chuck     }
    159  1.1  chuck     if (ler1->ler1_rdp & LE_C0_ERR)
    160  1.1  chuck 	le_error("le_poll", ler1);
    161  1.1  chuck     if (rmd->rmd1_bits & LE_R1_ERR) {
    162  1.1  chuck 	printf("le0_poll: rmd status 0x%x\n", rmd->rmd1_bits);
    163  1.1  chuck 	length = 0;
    164  1.1  chuck 	goto cleanup;
    165  1.1  chuck     }
    166  1.1  chuck     if ((rmd->rmd1_bits & (LE_R1_STP|LE_R1_ENP)) != (LE_R1_STP|LE_R1_ENP)) {
    167  1.1  chuck 	printf("le_poll: chained packet\n");
    168  1.1  chuck 	callrom();
    169  1.1  chuck     }
    170  1.1  chuck 
    171  1.1  chuck     length = rmd->rmd3;
    172  1.1  chuck     if (length >= LEMTU) {
    173  1.1  chuck 	length = 0;
    174  1.1  chuck 	printf("csr0 when bad things happen: %x\n", ler1->ler1_rdp);
    175  1.1  chuck 	callrom();
    176  1.1  chuck 	goto cleanup;
    177  1.1  chuck     }
    178  1.1  chuck     if (!length) goto cleanup;
    179  1.1  chuck     length -= 4;
    180  1.1  chuck     if (length > 0)
    181  1.1  chuck 	bcopy((char *)&ler2->ler2_rbuf[le_softc.next_rmd], pkt, length);
    182  1.1  chuck 
    183  1.1  chuck  cleanup:
    184  1.1  chuck     a = (u_int)&ler2->ler2_rbuf[le_softc.next_rmd];
    185  1.1  chuck     rmd->rmd0 = a & LE_ADDR_LOW_MASK;
    186  1.1  chuck     rmd->rmd1_hadr = a >> 16;
    187  1.1  chuck     rmd->rmd2 = -LEMTU;
    188  1.1  chuck     le_softc.next_rmd =
    189  1.1  chuck 	(le_softc.next_rmd == (LERBUF - 1)) ? 0 : (le_softc.next_rmd + 1);
    190  1.1  chuck     rmd->rmd1_bits = LE_R1_OWN;
    191  1.1  chuck     return length;
    192  1.1  chuck }
    193  1.1  chuck 
    194  1.1  chuck int le_put(pkt, len)
    195  1.1  chuck      u_char *pkt;
    196  1.1  chuck      size_t len;
    197  1.1  chuck {
    198  1.1  chuck     struct lereg1 *ler1 = le_softc.sc_r1;
    199  1.1  chuck     struct lereg2 *ler2 = le_softc.sc_r2;
    200  1.1  chuck     struct letmd *tmd;
    201  1.1  chuck     int timo = 100000, stat, i;
    202  1.1  chuck     unsigned int a;
    203  1.1  chuck 
    204  1.1  chuck     ler1->ler1_rap = LE_CSR0;
    205  1.1  chuck     if (ler1->ler1_rdp & LE_C0_ERR)
    206  1.1  chuck 	le_error("le_put(way before xmit)", ler1);
    207  1.1  chuck     tmd = &ler2->ler2_tmd[le_softc.next_tmd];
    208  1.1  chuck     while(tmd->tmd1_bits & LE_T1_OWN) {
    209  1.1  chuck 	printf("le0: output buffer busy\n");
    210  1.1  chuck     }
    211  1.1  chuck     bcopy(pkt, (char *)ler2->ler2_tbuf[le_softc.next_tmd], len);
    212  1.1  chuck     if (len < 64)
    213  1.1  chuck 	tmd->tmd2 = -64;
    214  1.1  chuck     else
    215  1.1  chuck 	tmd->tmd2 = -len;
    216  1.1  chuck     tmd->tmd3 = 0;
    217  1.1  chuck     if (ler1->ler1_rdp & LE_C0_ERR)
    218  1.1  chuck 	le_error("le_put(before xmit)", ler1);
    219  1.1  chuck     tmd->tmd1_bits = LE_T1_STP | LE_T1_ENP | LE_T1_OWN;
    220  1.1  chuck     a = (u_int)&ler2->ler2_tbuf[le_softc.next_tmd];
    221  1.1  chuck     tmd->tmd0 = a & LE_ADDR_LOW_MASK;
    222  1.1  chuck     tmd->tmd1_hadr = a >> 16;
    223  1.1  chuck     ler1->ler1_rdp = LE_C0_TDMD;
    224  1.1  chuck     if (ler1->ler1_rdp & LE_C0_ERR)
    225  1.1  chuck 	le_error("le_put(after xmit)", ler1);
    226  1.1  chuck     do {
    227  1.1  chuck 	if (--timo == 0) {
    228  1.1  chuck 	    printf("le0: transmit timeout, stat = 0x%x\n",
    229  1.1  chuck 		   stat);
    230  1.1  chuck 	    if (ler1->ler1_rdp & LE_C0_ERR)
    231  1.1  chuck 		le_error("le_put(timeout)", ler1);
    232  1.1  chuck 	    break;
    233  1.1  chuck 	}
    234  1.1  chuck 	stat = ler1->ler1_rdp;
    235  1.1  chuck     } while ((stat & LE_C0_TINT) == 0);
    236  1.1  chuck     ler1->ler1_rdp = LE_C0_TINT;
    237  1.1  chuck     if (ler1->ler1_rdp & LE_C0_ERR) {
    238  1.1  chuck 	if ((ler1->ler1_rdp & (LE_C0_BABL|LE_C0_CERR|LE_C0_MISS|LE_C0_MERR)) !=
    239  1.1  chuck 		LE_C0_CERR)
    240  1.1  chuck 	  printf("le_put: xmit error, buf %d\n", le_softc.next_tmd);
    241  1.1  chuck 	le_error("le_put(xmit error)", ler1);
    242  1.1  chuck     }
    243  1.1  chuck     le_softc.next_tmd = 0;
    244  1.1  chuck /*	(le_softc.next_tmd == (LETBUF - 1)) ? 0 : le_softc.next_tmd + 1;*/
    245  1.1  chuck     if (tmd->tmd1_bits & LE_T1_ERR) {
    246  1.1  chuck 	printf("le0: transmit error, error = 0x%x\n",
    247  1.1  chuck 	       tmd->tmd3);
    248  1.1  chuck 	return -1;
    249  1.1  chuck     }
    250  1.1  chuck     return len;
    251  1.1  chuck }
    252  1.1  chuck 
    253  1.1  chuck int le_get(pkt, len, timeout)
    254  1.1  chuck      u_char *pkt;
    255  1.1  chuck      size_t len;
    256  1.1  chuck      u_long timeout;
    257  1.1  chuck {
    258  1.1  chuck     int cc;
    259  1.1  chuck     int now, then;
    260  1.1  chuck     int stopat = time() + timeout;
    261  1.1  chuck     then = 0;
    262  1.1  chuck 
    263  1.1  chuck     cc = 0;
    264  1.1  chuck     while ((now = time()) < stopat && !cc) {
    265  1.1  chuck 	cc = le_poll(pkt, len);
    266  1.1  chuck         if (then != now) {
    267  1.1  chuck #ifdef LE_DEBUG
    268  1.1  chuck           printf("%d  \r", stopat - now);
    269  1.1  chuck #endif
    270  1.1  chuck           then = now;
    271  1.1  chuck         }
    272  1.1  chuck         if (cc && (pkt[0] != myea[0] || pkt[1] != myea[1] ||
    273  1.1  chuck                    pkt[2] != myea[2] || pkt[3] != myea[3] ||
    274  1.1  chuck                    pkt[4] != myea[4] || pkt[5] != myea[5])) {
    275  1.1  chuck           cc = 0; /* ignore broadcast / multicast */
    276  1.1  chuck #ifdef LE_DEBUG
    277  1.1  chuck           printf("reject (%d sec left)\n", stopat - now);
    278  1.1  chuck #endif
    279  1.1  chuck         }
    280  1.1  chuck     }
    281  1.1  chuck #ifdef LE_DEBUG
    282  1.1  chuck     printf("\n");
    283  1.1  chuck #endif
    284  1.1  chuck     return cc;
    285  1.1  chuck }
    286  1.1  chuck 
    287  1.1  chuck void le_init()
    288  1.1  chuck {
    289  1.1  chuck     caddr_t addr;
    290  1.1  chuck     int *ea = (int *) LANCE_ADDR;
    291  1.1  chuck     u_long *eram = (u_long *) ERAM_ADDR;
    292  1.1  chuck     u_long e = *ea;
    293  1.1  chuck     if (( e & 0x2fffff00 ) == 0x2fffff00) {
    294  1.1  chuck       printf("ERROR: ethernet address not set!  Use LSAD.\n");
    295  1.1  chuck       callrom();
    296  1.1  chuck     }
    297  1.1  chuck     myea[0] = 0x08;
    298  1.1  chuck     myea[1] = 0x00;
    299  1.1  chuck     myea[2] = 0x3e;
    300  1.1  chuck     e = e >> 8;
    301  1.1  chuck     myea[5] = e & 0xff;
    302  1.1  chuck     e = e >> 8;
    303  1.1  chuck     myea[4] = e & 0xff;
    304  1.1  chuck     e = e >> 8;
    305  1.1  chuck     myea[3] = e;
    306  1.1  chuck     printf("le0: ethernet address: %x:%x:%x:%x:%x:%x\n",
    307  1.1  chuck       myea[0], myea[1], myea[2], myea[3], myea[4], myea[5]);
    308  1.1  chuck     bzero(&le_softc, sizeof(le_softc));
    309  1.1  chuck     le_softc.sc_r1 = (struct lereg1 *) LANCE_REG_ADDR;
    310  1.1  chuck     le_softc.sc_r2 = (struct lereg2 *)(*eram - (1024*1024));
    311  1.1  chuck     le_reset(myea);
    312  1.1  chuck }
    313  1.1  chuck 
    314  1.1  chuck void le_end()
    315  1.1  chuck {
    316  1.1  chuck     struct lereg1 *ler1 = le_softc.sc_r1;
    317  1.1  chuck 
    318  1.1  chuck     ler1->ler1_rap = LE_CSR0;
    319  1.1  chuck     ler1->ler1_rdp = LE_C0_STOP;
    320  1.1  chuck }
    321