1 /* $NetBSD: lebuffer.c,v 1.11 2002/01/14 13:32:47 tsutsui Exp $ */ 2 3 /*- 4 * Copyright (c) 1998 The NetBSD Foundation, Inc. 5 * All rights reserved. 6 * 7 * This code is derived from software contributed to The NetBSD Foundation 8 * by Paul Kranenburg. 9 * 10 * Redistribution and use in source and binary forms, with or without 11 * modification, are permitted provided that the following conditions 12 * are met: 13 * 1. Redistributions of source code must retain the above copyright 14 * notice, this list of conditions and the following disclaimer. 15 * 2. Redistributions in binary form must reproduce the above copyright 16 * notice, this list of conditions and the following disclaimer in the 17 * documentation and/or other materials provided with the distribution. 18 * 3. All advertising materials mentioning features or use of this software 19 * must display the following acknowledgement: 20 * This product includes software developed by the NetBSD 21 * Foundation, Inc. and its contributors. 22 * 4. Neither the name of The NetBSD Foundation nor the names of its 23 * contributors may be used to endorse or promote products derived 24 * from this software without specific prior written permission. 25 * 26 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS 27 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED 28 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 29 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS 30 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 31 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 32 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 33 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 34 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 35 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 36 * POSSIBILITY OF SUCH DAMAGE. 37 */ 38 39 #include <sys/cdefs.h> 40 __KERNEL_RCSID(0, "$NetBSD: lebuffer.c,v 1.11 2002/01/14 13:32:47 tsutsui Exp $"); 41 42 #include <sys/param.h> 43 #include <sys/systm.h> 44 #include <sys/kernel.h> 45 #include <sys/errno.h> 46 #include <sys/device.h> 47 #include <sys/malloc.h> 48 49 #include <machine/bus.h> 50 #include <machine/autoconf.h> 51 #include <machine/cpu.h> 52 53 #include <dev/sbus/sbusvar.h> 54 #include <dev/sbus/lebuffervar.h> 55 56 int lebufprint __P((void *, const char *)); 57 int lebufmatch __P((struct device *, struct cfdata *, void *)); 58 void lebufattach __P((struct device *, struct device *, void *)); 59 60 struct cfattach lebuffer_ca = { 61 sizeof(struct lebuf_softc), lebufmatch, lebufattach 62 }; 63 64 int 65 lebufprint(aux, busname) 66 void *aux; 67 const char *busname; 68 { 69 struct sbus_attach_args *sa = aux; 70 bus_space_tag_t t = sa->sa_bustag; 71 struct lebuf_softc *sc = t->cookie; 72 73 sa->sa_bustag = sc->sc_bustag; /* XXX */ 74 sbus_print(aux, busname); /* XXX */ 75 sa->sa_bustag = t; /* XXX */ 76 return (UNCONF); 77 } 78 79 int 80 lebufmatch(parent, cf, aux) 81 struct device *parent; 82 struct cfdata *cf; 83 void *aux; 84 { 85 struct sbus_attach_args *sa = aux; 86 87 return (strcmp(cf->cf_driver->cd_name, sa->sa_name) == 0); 88 } 89 90 /* 91 * Attach all the sub-devices we can find 92 */ 93 void 94 lebufattach(parent, self, aux) 95 struct device *parent, *self; 96 void *aux; 97 { 98 struct sbus_attach_args *sa = aux; 99 struct lebuf_softc *sc = (void *)self; 100 int node; 101 int sbusburst; 102 bus_space_tag_t sbt; 103 bus_space_handle_t bh; 104 105 sc->sc_bustag = sa->sa_bustag; 106 sc->sc_dmatag = sa->sa_dmatag; 107 108 if (sbus_bus_map(sa->sa_bustag, sa->sa_slot, 109 sa->sa_offset, 110 sa->sa_size, 111 0, 0, &bh) != 0) { 112 printf("%s: attach: cannot map registers\n", self->dv_xname); 113 return; 114 } 115 116 /* 117 * This device's "register space" is just a buffer where the 118 * Lance ring-buffers can be stored. Note the buffer's location 119 * and size, so the `le' driver can pick them up. 120 */ 121 sc->sc_buffer = (caddr_t)(u_long)bh; 122 sc->sc_bufsiz = sa->sa_size; 123 124 node = sc->sc_node = sa->sa_node; 125 126 /* 127 * Get transfer burst size from PROM 128 */ 129 sbusburst = ((struct sbus_softc *)parent)->sc_burst; 130 if (sbusburst == 0) 131 sbusburst = SBUS_BURST_32 - 1; /* 1->16 */ 132 133 sc->sc_burst = PROM_getpropint(node, "burst-sizes", -1); 134 if (sc->sc_burst == -1) 135 /* take SBus burst sizes */ 136 sc->sc_burst = sbusburst; 137 138 /* Clamp at parent's burst sizes */ 139 sc->sc_burst &= sbusburst; 140 141 sbus_establish(&sc->sc_sd, &sc->sc_dev); 142 143 /* Allocate a bus tag */ 144 sbt = (bus_space_tag_t) malloc(sizeof(struct sparc_bus_space_tag), 145 M_DEVBUF, M_NOWAIT|M_ZERO); 146 if (sbt == NULL) { 147 printf("%s: attach: out of memory\n", self->dv_xname); 148 return; 149 } 150 151 printf(": %dK memory\n", sc->sc_bufsiz / 1024); 152 153 sbt->cookie = sc; 154 sbt->parent = sc->sc_bustag; 155 156 /* search through children */ 157 for (node = firstchild(node); node; node = nextsibling(node)) { 158 struct sbus_attach_args sa; 159 sbus_setup_attach_args((struct sbus_softc *)parent, 160 sbt, sc->sc_dmatag, node, &sa); 161 (void)config_found(&sc->sc_dev, (void *)&sa, lebufprint); 162 sbus_destroy_attach_args(&sa); 163 } 164 } 165