1999-08-04 23:12:22 +04:00
|
|
|
/* $NetBSD: bi.c,v 1.13 1999/08/04 19:12:22 ragge Exp $ */
|
1999-07-12 17:42:24 +04:00
|
|
|
/*
|
|
|
|
* Copyright (c) 1996 Ludd, University of Lule}, Sweden.
|
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
* documentation and/or other materials provided with the distribution.
|
|
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
|
|
* must display the following acknowledgement:
|
|
|
|
* This product includes software developed at Ludd, University of
|
|
|
|
* Lule}, Sweden and its contributors.
|
|
|
|
* 4. The name of the author may not be used to endorse or promote products
|
|
|
|
* derived from this software without specific prior written permission
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
|
|
|
|
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
|
|
|
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
|
|
|
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
|
|
|
|
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
|
|
|
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
|
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
|
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
|
|
|
|
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* VAXBI specific routines.
|
|
|
|
*/
|
|
|
|
/*
|
|
|
|
* TODO
|
|
|
|
* handle BIbus errors more gracefully.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <sys/param.h>
|
|
|
|
#include <sys/systm.h>
|
|
|
|
|
1999-08-04 23:12:22 +04:00
|
|
|
#include <machine/bus.h>
|
1999-07-12 17:42:24 +04:00
|
|
|
#include <machine/cpu.h>
|
|
|
|
|
1999-08-04 23:12:22 +04:00
|
|
|
#include <dev/bi/bireg.h>
|
|
|
|
#include <dev/bi/bivar.h>
|
1999-07-12 17:42:24 +04:00
|
|
|
|
|
|
|
static int bi_print __P((void *, const char *));
|
|
|
|
|
|
|
|
struct bi_list bi_list[] = {
|
|
|
|
{BIDT_MS820, 1, "ms820"},
|
|
|
|
{BIDT_DRB32, 0, "drb32"},
|
|
|
|
{BIDT_DWBUA, 0, "dwbua"},
|
|
|
|
{BIDT_KLESI, 0, "klesi"},
|
|
|
|
{BIDT_KA820, 1, "ka820"},
|
|
|
|
{BIDT_DB88, 0, "db88"},
|
|
|
|
{BIDT_CIBCA, 0, "cibca"},
|
|
|
|
{BIDT_DMB32, 0, "dmb32"},
|
|
|
|
{BIDT_CIBCI, 0, "cibci"},
|
|
|
|
{BIDT_KA800, 0, "ka800"},
|
|
|
|
{BIDT_KDB50, 0, "kdb50"},
|
|
|
|
{BIDT_DWMBA, 0, "dwmba"},
|
|
|
|
{BIDT_KFBTA, 0, "kfbta"},
|
|
|
|
{BIDT_DEBNK, 0, "debnk"},
|
|
|
|
{BIDT_DEBNA, 0, "debna"},
|
|
|
|
{0,0,0}
|
|
|
|
};
|
|
|
|
|
|
|
|
int
|
|
|
|
bi_print(aux, name)
|
|
|
|
void *aux;
|
|
|
|
const char *name;
|
|
|
|
{
|
|
|
|
struct bi_attach_args *ba = aux;
|
|
|
|
struct bi_list *bl;
|
|
|
|
|
|
|
|
for (bl = &bi_list[0]; bl->bl_nr; bl++)
|
1999-08-04 23:12:22 +04:00
|
|
|
if (bl->bl_nr == bus_space_read_2(ba->ba_iot, ba->ba_ioh, 0))
|
1999-07-12 17:42:24 +04:00
|
|
|
break;
|
|
|
|
|
|
|
|
if (name) {
|
|
|
|
if (bl->bl_nr == 0)
|
|
|
|
printf("unknown device 0x%x",
|
1999-08-04 23:12:22 +04:00
|
|
|
bus_space_read_2(ba->ba_iot, ba->ba_ioh, 0));
|
1999-07-12 17:42:24 +04:00
|
|
|
else
|
|
|
|
printf(bl->bl_name);
|
|
|
|
printf(" at %s", name);
|
|
|
|
}
|
|
|
|
printf(" node %d", ba->ba_nodenr);
|
|
|
|
#ifdef DEBUG
|
1999-08-04 23:12:22 +04:00
|
|
|
if (bus_space_read_4(ba->ba_iot, ba->ba_ioh, BIREG_SADR) &&
|
|
|
|
bus_space_read_4(ba->ba_iot, ba->ba_ioh, BIREG_EADR))
|
|
|
|
printf(" [sadr %x eadr %x]",
|
|
|
|
bus_space_read_4(ba->ba_iot, ba->ba_ioh, BIREG_SADR),
|
|
|
|
bus_space_read_4(ba->ba_iot, ba->ba_ioh, BIREG_EADR));
|
1999-07-12 17:42:24 +04:00
|
|
|
#endif
|
|
|
|
return bl->bl_havedriver ? UNCONF : UNSUPP;
|
|
|
|
}
|
|
|
|
|
1999-08-04 23:12:22 +04:00
|
|
|
static int lastiv = 0;
|
1999-07-12 17:42:24 +04:00
|
|
|
|
|
|
|
void
|
1999-08-04 23:12:22 +04:00
|
|
|
bi_attach(sc)
|
|
|
|
struct bi_softc *sc;
|
1999-07-12 17:42:24 +04:00
|
|
|
{
|
|
|
|
struct bi_attach_args ba;
|
|
|
|
int nodenr;
|
|
|
|
|
|
|
|
printf("\n");
|
|
|
|
|
1999-08-04 23:12:22 +04:00
|
|
|
ba.ba_iot = sc->sc_iot;
|
|
|
|
ba.ba_busnr = sc->sc_busnr;
|
|
|
|
/*
|
|
|
|
* Interrupt numbers. All vectors from 256-512 are free, use
|
|
|
|
* them for BI devices and just count them up.
|
|
|
|
* Above 512 are only interrupt vectors for unibus devices.
|
|
|
|
* Is it realistic with more than 64 BI devices???
|
|
|
|
*/
|
1999-07-12 17:42:24 +04:00
|
|
|
for (nodenr = 0; nodenr < NNODEBI; nodenr++) {
|
1999-08-04 23:12:22 +04:00
|
|
|
if (bus_space_map(sc->sc_iot, sc->sc_addr + BI_NODE(nodenr),
|
|
|
|
NODESIZE, 0, &ba.ba_ioh)) {
|
|
|
|
printf("bi_attach: bus_space_map failed, node %d\n",
|
|
|
|
nodenr);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
if (badaddr((caddr_t)ba.ba_ioh, 4)) {
|
|
|
|
bus_space_unmap(sc->sc_iot, ba.ba_ioh, NODESIZE);
|
1999-07-12 17:42:24 +04:00
|
|
|
} else {
|
|
|
|
ba.ba_nodenr = nodenr;
|
1999-08-04 23:12:22 +04:00
|
|
|
ba.ba_ivec = 256 + lastiv;
|
|
|
|
lastiv += 4;
|
|
|
|
config_found(&sc->sc_dev, &ba, bi_print);
|
1999-07-12 17:42:24 +04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|