|
|
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: * ! 33: * @(#)if_lereg.h 7.1 (Berkeley) 5/8/90 ! 34: */ ! 35: ! 36: #define LEID 21 ! 37: ! 38: #define LEMTU 1518 ! 39: #define LEMINSIZE 60 /* should be 64 if mode DTCR is set */ ! 40: #define LERBUF 8 ! 41: #define LERBUFLOG2 3 ! 42: #define LE_RLEN (LERBUFLOG2 << 13) ! 43: #define LETBUF 1 ! 44: #define LETBUFLOG2 0 ! 45: #define LE_TLEN (LETBUFLOG2 << 13) ! 46: ! 47: #define vu_char volatile u_char ! 48: ! 49: /* ! 50: * LANCE registers. ! 51: */ ! 52: struct lereg0 { ! 53: u_char ler0_pad0; ! 54: vu_char ler0_id; /* ID */ ! 55: u_char ler0_pad1; ! 56: vu_char ler0_status; /* interrupt enable/status */ ! 57: }; ! 58: ! 59: struct lereg1 { ! 60: u_short ler1_rdp; /* data port */ ! 61: u_short ler1_rap; /* register select port */ ! 62: }; ! 63: ! 64: /* ! 65: * Overlayed on 16K dual-port RAM. ! 66: * Current size is 13,758 bytes with 8 x 1518 receive buffers and ! 67: * 1 x 1518 transmit buffer. ! 68: */ ! 69: struct lereg2 { ! 70: /* init block */ ! 71: u_short ler2_mode; /* +0x0000 */ ! 72: u_char ler2_padr[6]; /* +0x0002 */ ! 73: u_long ler2_ladrf0; /* +0x0008 */ ! 74: u_long ler2_ladrf1; /* +0x000C */ ! 75: u_short ler2_rdra; /* +0x0010 */ ! 76: u_short ler2_rlen; /* +0x0012 */ ! 77: u_short ler2_tdra; /* +0x0014 */ ! 78: u_short ler2_tlen; /* +0x0016 */ ! 79: /* receive message descriptors */ ! 80: struct lermd { /* +0x0018 */ ! 81: u_short rmd0; ! 82: u_short rmd1; ! 83: short rmd2; ! 84: u_short rmd3; ! 85: } ler2_rmd[LERBUF]; ! 86: /* transmit message descriptors */ ! 87: struct letmd { /* +0x0058 */ ! 88: u_short tmd0; ! 89: u_short tmd1; ! 90: short tmd2; ! 91: u_short tmd3; ! 92: } ler2_tmd[LETBUF]; ! 93: char ler2_rbuf[LERBUF][LEMTU]; /* +0x0060 */ ! 94: char ler2_tbuf[LETBUF][LEMTU]; /* +0x2FD0 */ ! 95: }; ! 96: ! 97: /* ! 98: * Control and status bits -- lereg0 ! 99: */ ! 100: #define LE_IE 0x80 /* interrupt enable */ ! 101: #define LE_IR 0x40 /* interrupt requested */ ! 102: #define LE_LOCK 0x08 /* lock status register */ ! 103: #define LE_ACK 0x04 /* ack of lock */ ! 104: #define LE_JAB 0x02 /* loss of tx clock (???) */ ! 105: #define LE_IPL(x) ((((x) >> 4) & 0x3) + 3) ! 106: ! 107: /* ! 108: * Control and status bits -- lereg1 ! 109: */ ! 110: #define LE_CSR0 0 ! 111: #define LE_CSR1 1 ! 112: #define LE_CSR2 2 ! 113: #define LE_CSR3 3 ! 114: ! 115: #define LE_SERR 0x8000 ! 116: #define LE_BABL 0x4000 ! 117: #define LE_CERR 0x2000 ! 118: #define LE_MISS 0x1000 ! 119: #define LE_MERR 0x0800 ! 120: #define LE_RINT 0x0400 ! 121: #define LE_TINT 0x0200 ! 122: #define LE_IDON 0x0100 ! 123: #define LE_INTR 0x0080 ! 124: #define LE_INEA 0x0040 ! 125: #define LE_RXON 0x0020 ! 126: #define LE_TXON 0x0010 ! 127: #define LE_TDMD 0x0008 ! 128: #define LE_STOP 0x0004 ! 129: #define LE_STRT 0x0002 ! 130: #define LE_INIT 0x0001 ! 131: ! 132: #define LE_BSWP 0x4 ! 133: #define LE_MODE 0x0 ! 134: ! 135: /* ! 136: * Control and status bits -- lereg2 ! 137: */ ! 138: #define LE_OWN 0x8000 ! 139: #define LE_ERR 0x4000 ! 140: #define LE_STP 0x0200 ! 141: #define LE_ENP 0x0100 ! 142: ! 143: #define LE_FRAM 0x2000 ! 144: #define LE_OFLO 0x1000 ! 145: #define LE_CRC 0x0800 ! 146: #define LE_RBUFF 0x0400 ! 147: #define LE_MORE 0x1000 ! 148: #define LE_ONE 0x0800 ! 149: #define LE_DEF 0x0400 ! 150: #define LE_TBUFF 0x8000 ! 151: #define LE_UFLO 0x4000 ! 152: #define LE_LCOL 0x1000 ! 153: #define LE_LCAR 0x0800 ! 154: #define LE_RTRY 0x0400
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.