if_le.c revision 1.23
1 /* $NetBSD: if_le.c,v 1.23 2002/10/01 05:19:00 thorpej Exp $ */ 2 3 /*- 4 * Copyright (c) 1997, 1998 The NetBSD Foundation, Inc. 5 * All rights reserved. 6 * 7 * This code is derived from software contributed to The NetBSD Foundation 8 * by Charles M. Hannum and by Jason R. Thorpe of the Numerical Aerospace 9 * Simulation Facility, NASA Ames Research Center. 10 * 11 * Redistribution and use in source and binary forms, with or without 12 * modification, are permitted provided that the following conditions 13 * are met: 14 * 1. Redistributions of source code must retain the above copyright 15 * notice, this list of conditions and the following disclaimer. 16 * 2. Redistributions in binary form must reproduce the above copyright 17 * notice, this list of conditions and the following disclaimer in the 18 * documentation and/or other materials provided with the distribution. 19 * 3. All advertising materials mentioning features or use of this software 20 * must display the following acknowledgement: 21 * This product includes software developed by the NetBSD 22 * Foundation, Inc. and its contributors. 23 * 4. Neither the name of The NetBSD Foundation nor the names of its 24 * contributors may be used to endorse or promote products derived 25 * from this software without specific prior written permission. 26 * 27 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS 28 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED 29 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 30 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS 31 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 32 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 33 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 34 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 35 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 36 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 37 * POSSIBILITY OF SUCH DAMAGE. 38 */ 39 40 /*- 41 * Copyright (c) 1992, 1993 42 * The Regents of the University of California. All rights reserved. 43 * 44 * This code is derived from software contributed to Berkeley by 45 * Ralph Campbell and Rick Macklem. 46 * 47 * Redistribution and use in source and binary forms, with or without 48 * modification, are permitted provided that the following conditions 49 * are met: 50 * 1. Redistributions of source code must retain the above copyright 51 * notice, this list of conditions and the following disclaimer. 52 * 2. Redistributions in binary form must reproduce the above copyright 53 * notice, this list of conditions and the following disclaimer in the 54 * documentation and/or other materials provided with the distribution. 55 * 3. All advertising materials mentioning features or use of this software 56 * must display the following acknowledgement: 57 * This product includes software developed by the University of 58 * California, Berkeley and its contributors. 59 * 4. Neither the name of the University nor the names of its contributors 60 * may be used to endorse or promote products derived from this software 61 * without specific prior written permission. 62 * 63 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 64 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 65 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 66 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 67 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 68 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 69 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 70 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 71 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 72 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 73 * SUCH DAMAGE. 74 * 75 * @(#)if_le.c 8.2 (Berkeley) 11/16/93 76 */ 77 78 #include "opt_inet.h" 79 #include "bpfilter.h" 80 81 #include <sys/param.h> 82 #include <sys/syslog.h> 83 #include <sys/socket.h> 84 #include <sys/device.h> 85 #include <sys/reboot.h> 86 87 #include <uvm/uvm_extern.h> 88 89 #include <net/if.h> 90 #include <net/if_ether.h> 91 #include <net/if_media.h> 92 93 #ifdef INET 94 #include <netinet/in.h> 95 #include <netinet/if_inarp.h> 96 #endif 97 98 #include <machine/cpu.h> 99 #include <machine/nexus.h> 100 #include <machine/scb.h> 101 102 #include <dev/ic/lancereg.h> 103 #include <dev/ic/lancevar.h> 104 #include <dev/ic/am7990reg.h> 105 #include <dev/ic/am7990var.h> 106 107 #include "ioconf.h" 108 109 #define LEVEC 0xd4 /* Interrupt vector on 3300/3400 */ 110 111 struct le_softc { 112 struct am7990_softc sc_am7990; /* Must be first */ 113 struct evcnt sc_intrcnt; 114 volatile u_short *sc_rap; 115 volatile u_short *sc_rdp; 116 }; 117 118 int le_ibus_match __P((struct device *, struct cfdata *, void *)); 119 void le_ibus_attach __P((struct device *, struct device *, void *)); 120 void lewrcsr __P((struct lance_softc *, u_int16_t, u_int16_t)); 121 u_int16_t lerdcsr __P((struct lance_softc *, u_int16_t)); 122 void lance_copytobuf_gap2 __P((struct lance_softc *, void *, int, int)); 123 void lance_copyfrombuf_gap2 __P((struct lance_softc *, void *, int, int)); 124 void lance_zerobuf_gap2 __P((struct lance_softc *, int, int)); 125 126 CFATTACH_DECL(le_ibus, sizeof(struct le_softc), 127 le_ibus_match, le_ibus_attach, NULL, NULL) 128 129 void 130 lewrcsr(ls, port, val) 131 struct lance_softc *ls; 132 u_int16_t port, val; 133 { 134 struct le_softc *sc = (void *)ls; 135 136 *sc->sc_rap = port; 137 *sc->sc_rdp = val; 138 } 139 140 u_int16_t 141 lerdcsr(ls, port) 142 struct lance_softc *ls; 143 u_int16_t port; 144 { 145 struct le_softc *sc = (void *)ls; 146 147 *sc->sc_rap = port; 148 return *sc->sc_rdp; 149 } 150 151 int 152 le_ibus_match(parent, cf, aux) 153 struct device *parent; 154 struct cfdata *cf; 155 void *aux; 156 { 157 struct bp_conf *bp = aux; 158 159 if (strcmp("lance", bp->type)) 160 return 0; 161 return 1; 162 } 163 164 void 165 le_ibus_attach(parent, self, aux) 166 struct device *parent, *self; 167 void *aux; 168 { 169 struct le_softc *sc = (void *)self; 170 int *lance_addr; 171 int i, vec, br; 172 173 sc->sc_rdp = (short *)vax_map_physmem(0x20084400, 1); 174 sc->sc_rap = sc->sc_rdp + 2; 175 176 /* 177 * Set interrupt vector, by forcing an interrupt. 178 */ 179 scb_vecref(0, 0); /* Clear vector ref */ 180 *sc->sc_rap = LE_CSR0; 181 *sc->sc_rdp = LE_C0_STOP; 182 DELAY(100); 183 *sc->sc_rdp = LE_C0_INIT|LE_C0_INEA; 184 DELAY(100000); 185 i = scb_vecref(&vec, &br); 186 if (i == 0 || vec == 0) 187 return; 188 scb_vecalloc(vec, (void (*)(void *))am7990_intr, sc, 189 SCB_ISTACK, &sc->sc_intrcnt); 190 evcnt_attach_dynamic(&sc->sc_intrcnt, EVCNT_TYPE_INTR, NULL, 191 self->dv_xname, "intr"); 192 193 printf(": vec %o ipl %x\n%s", vec, br, self->dv_xname); 194 /* 195 * MD functions. 196 */ 197 sc->sc_am7990.lsc.sc_rdcsr = lerdcsr; 198 sc->sc_am7990.lsc.sc_wrcsr = lewrcsr; 199 sc->sc_am7990.lsc.sc_nocarrier = NULL; 200 201 sc->sc_am7990.lsc.sc_mem = 202 (void *)uvm_km_valloc(kernel_map, (128 * 1024)); 203 if (sc->sc_am7990.lsc.sc_mem == 0) 204 return; 205 206 ioaccess((vaddr_t)sc->sc_am7990.lsc.sc_mem, 0x20120000, 207 (128 * 1024) >> VAX_PGSHIFT); 208 209 210 sc->sc_am7990.lsc.sc_addr = 0; 211 sc->sc_am7990.lsc.sc_memsize = (64 * 1024); 212 213 sc->sc_am7990.lsc.sc_copytodesc = lance_copytobuf_gap2; 214 sc->sc_am7990.lsc.sc_copyfromdesc = lance_copyfrombuf_gap2; 215 sc->sc_am7990.lsc.sc_copytobuf = lance_copytobuf_gap2; 216 sc->sc_am7990.lsc.sc_copyfrombuf = lance_copyfrombuf_gap2; 217 sc->sc_am7990.lsc.sc_zerobuf = lance_zerobuf_gap2; 218 219 /* 220 * Get the ethernet address out of rom 221 */ 222 lance_addr = (int *)vax_map_physmem(0x20084200, 1); 223 for (i = 0; i < 6; i++) 224 sc->sc_am7990.lsc.sc_enaddr[i] = (u_char)lance_addr[i]; 225 vax_unmap_physmem((vaddr_t)lance_addr, 1); 226 227 bcopy(self->dv_xname, sc->sc_am7990.lsc.sc_ethercom.ec_if.if_xname, 228 IFNAMSIZ); 229 am7990_config(&sc->sc_am7990); 230 } 231 232 /* 233 * gap2: two bytes of data followed by two bytes of pad. 234 * 235 * Buffers must be 4-byte aligned. The code doesn't worry about 236 * doing an extra byte. 237 */ 238 239 void 240 lance_copytobuf_gap2(sc, fromv, boff, len) 241 struct lance_softc *sc; 242 void *fromv; 243 int boff; 244 register int len; 245 { 246 volatile caddr_t buf = sc->sc_mem; 247 register caddr_t from = fromv; 248 register volatile u_int16_t *bptr; 249 250 if (boff & 0x1) { 251 /* handle unaligned first byte */ 252 bptr = ((volatile u_int16_t *)buf) + (boff - 1); 253 *bptr = (*from++ << 8) | (*bptr & 0xff); 254 bptr += 2; 255 len--; 256 } else 257 bptr = ((volatile u_int16_t *)buf) + boff; 258 while (len > 1) { 259 *bptr = (from[1] << 8) | (from[0] & 0xff); 260 bptr += 2; 261 from += 2; 262 len -= 2; 263 } 264 if (len == 1) 265 *bptr = (u_int16_t)*from; 266 } 267 268 void 269 lance_copyfrombuf_gap2(sc, tov, boff, len) 270 struct lance_softc *sc; 271 void *tov; 272 int boff, len; 273 { 274 volatile caddr_t buf = sc->sc_mem; 275 register caddr_t to = tov; 276 register volatile u_int16_t *bptr; 277 register u_int16_t tmp; 278 279 if (boff & 0x1) { 280 /* handle unaligned first byte */ 281 bptr = ((volatile u_int16_t *)buf) + (boff - 1); 282 *to++ = (*bptr >> 8) & 0xff; 283 bptr += 2; 284 len--; 285 } else 286 bptr = ((volatile u_int16_t *)buf) + boff; 287 while (len > 1) { 288 tmp = *bptr; 289 *to++ = tmp & 0xff; 290 *to++ = (tmp >> 8) & 0xff; 291 bptr += 2; 292 len -= 2; 293 } 294 if (len == 1) 295 *to = *bptr & 0xff; 296 } 297 298 void 299 lance_zerobuf_gap2(sc, boff, len) 300 struct lance_softc *sc; 301 int boff, len; 302 { 303 volatile caddr_t buf = sc->sc_mem; 304 register volatile u_int16_t *bptr; 305 306 if ((unsigned)boff & 0x1) { 307 bptr = ((volatile u_int16_t *)buf) + (boff - 1); 308 *bptr &= 0xff; 309 bptr += 2; 310 len--; 311 } else 312 bptr = ((volatile u_int16_t *)buf) + boff; 313 while (len > 0) { 314 *bptr = 0; 315 bptr += 2; 316 len -= 2; 317 } 318 } 319
Indexes created Tue Sep 23 02:09:52 GMT 2025