1 /* $NetBSD: lebuffer.c,v 1.7 2000/04/14 08:22:49 mrg 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/types.h> 40 #include <sys/param.h> 41 #include <sys/systm.h> 42 #include <sys/kernel.h> 43 #include <sys/errno.h> 44 #include <sys/device.h> 45 #include <sys/malloc.h> 46 47 #include <machine/bus.h> 48 #include <machine/autoconf.h> 49 #include <machine/cpu.h> 50 51 #include <dev/sbus/sbusvar.h> 52 #include <dev/sbus/lebuffervar.h> 53 54 int lebufprint __P((void *, const char *)); 55 int lebufmatch __P((struct device *, struct cfdata *, void *)); 56 void lebufattach __P((struct device *, struct device *, void *)); 57 58 struct cfattach lebuffer_ca = { 59 sizeof(struct lebuf_softc), lebufmatch, lebufattach 60 }; 61 62 int 63 lebufprint(aux, busname) 64 void *aux; 65 const char *busname; 66 { 67 struct sbus_attach_args *sa = aux; 68 bus_space_tag_t t = sa->sa_bustag; 69 struct lebuf_softc *sc = t->cookie; 70 71 sa->sa_bustag = sc->sc_bustag; /* XXX */ 72 sbus_print(aux, busname); /* XXX */ 73 sa->sa_bustag = t; /* XXX */ 74 return (UNCONF); 75 } 76 77 int 78 lebufmatch(parent, cf, aux) 79 struct device *parent; 80 struct cfdata *cf; 81 void *aux; 82 { 83 struct sbus_attach_args *sa = aux; 84 85 return (strcmp(cf->cf_driver->cd_name, sa->sa_name) == 0); 86 } 87 88 /* 89 * Attach all the sub-devices we can find 90 */ 91 void 92 lebufattach(parent, self, aux) 93 struct device *parent, *self; 94 void *aux; 95 { 96 struct sbus_attach_args *sa = aux; 97 struct lebuf_softc *sc = (void *)self; 98 int node; 99 int sbusburst; 100 bus_space_tag_t sbt; 101 bus_space_handle_t bh; 102 103 sc->sc_bustag = sa->sa_bustag; 104 sc->sc_dmatag = sa->sa_dmatag; 105 106 if (sbus_bus_map(sa->sa_bustag, sa->sa_slot, 107 sa->sa_offset, 108 sa->sa_size, 109 0, 0, &bh) != 0) { 110 printf("%s: attach: cannot map registers\n", self->dv_xname); 111 return; 112 } 113 114 /* 115 * This device's "register space" is just a buffer where the 116 * Lance ring-buffers can be stored. Note the buffer's location 117 * and size, so the `le' driver can pick them up. 118 */ 119 sc->sc_buffer = (caddr_t)(u_long)bh; 120 sc->sc_bufsiz = sa->sa_size; 121 122 node = sc->sc_node = sa->sa_node; 123 124 /* 125 * Get transfer burst size from PROM 126 */ 127 sbusburst = ((struct sbus_softc *)parent)->sc_burst; 128 if (sbusburst == 0) 129 sbusburst = SBUS_BURST_32 - 1; /* 1->16 */ 130 131 sc->sc_burst = getpropint(node, "burst-sizes", -1); 132 if (sc->sc_burst == -1) 133 /* take SBus burst sizes */ 134 sc->sc_burst = sbusburst; 135 136 /* Clamp at parent's burst sizes */ 137 sc->sc_burst &= sbusburst; 138 139 sbus_establish(&sc->sc_sd, &sc->sc_dev); 140 141 /* Allocate a bus tag */ 142 sbt = (bus_space_tag_t) 143 malloc(sizeof(struct sparc_bus_space_tag), M_DEVBUF, M_NOWAIT); 144 if (sbt == NULL) { 145 printf("%s: attach: out of memory\n", self->dv_xname); 146 return; 147 } 148 149 printf(": %dK memory\n", sc->sc_bufsiz / 1024); 150 151 bzero(sbt, sizeof *sbt); 152 sbt->cookie = sc; 153 sbt->parent = sc->sc_bustag; 154 155 /* search through children */ 156 for (node = firstchild(node); node; node = nextsibling(node)) { 157 struct sbus_attach_args sa; 158 sbus_setup_attach_args((struct sbus_softc *)parent, 159 sbt, sc->sc_dmatag, node, &sa); 160 (void)config_found(&sc->sc_dev, (void *)&sa, lebufprint); 161 sbus_destroy_attach_args(&sa); 162 } 163 } 164