|
|
1.1 root 1: /*
2: * Copyright (c) 1988 Regents of the University of California.
3: * All rights reserved.
4: *
5: * This code is derived from software contributed to Berkeley by
6: * Chris Torek.
7: *
8: * Redistribution and use in source and binary forms, with or without
9: * modification, are permitted provided that the following conditions
10: * are met:
11: * 1. Redistributions of source code must retain the above copyright
12: * notice, this list of conditions and the following disclaimer.
13: * 2. Redistributions in binary form must reproduce the above copyright
14: * notice, this list of conditions and the following disclaimer in the
15: * documentation and/or other materials provided with the distribution.
16: * 3. All advertising materials mentioning features or use of this software
17: * must display the following acknowledgement:
18: * This product includes software developed by the University of
19: * California, Berkeley and its contributors.
20: * 4. Neither the name of the University nor the names of its contributors
21: * may be used to endorse or promote products derived from this software
22: * without specific prior written permission.
23: *
24: * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27: * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34: * SUCH DAMAGE.
35: *
36: * @(#)bi.c 7.4 (Berkeley) 12/16/90
37: */
38:
39: /*
40: * VAXBI specific routines.
41: */
42:
43: #include "sys/param.h"
44: #include "../include/cpu.h"
45: #include "../include/mtpr.h"
46: #include "../vax/nexus.h"
47: #include "bireg.h"
48:
49: bi_reset(bi)
50: register struct biiregs *bi;
51: {
52:
53: bi->bi_csr |= BICSR_NRST;
54: DELAY(10000); /* ??? */
55: }
56:
57: /*
58: * Reset with self test. Return true iff reset fails.
59: * BEWARE, THIS RESETS THE BI ARBITRATION LEVEL TO ARB_NONE
60: * does self test ever cause a bi bus error?
61: */
62: bi_selftest(bi)
63: register struct biiregs *bi;
64: {
65: register int timo;
66:
67: bi->bi_csr |= BICSR_ARB_NONE; /* why? */
68: bi->bi_csr |= BICSR_STS | BICSR_INIT;/* must this be separate? */
69: DELAY(50); /* why? */
70: timo = todr() + 1000;
71: while (bi->bi_csr & BICSR_BROKE) {
72: if (todr() > timo) /* reset failed */
73: return (-1);
74: }
75: return (0); /* reset OK */
76: }
77:
78: /*
79: * THIS SHOULD PROBABLY WORK MORE LIKE ubaerror()
80: * (but then we would need to be able to reset BI nodes)
81: * (we need a per-BI-device driver structure!)
82: */
83: bi_buserr(binum)
84: int binum;
85: {
86: register struct bi_node *bi;
87: register int node;
88: extern int bi_nodes;
89: extern int cold;
90:
91: printf("vaxbi%d: bus error\n", binum);
92: bi = (struct bi_node *) &nexus[binum * NNODEBI];/* XXX */
93: for (node = 0; node < 16; node++, bi++) {
94: if ((bi_nodes & (1 << node)) == 0) /* XXX crude */
95: continue;
96: printf("node %x: ber=%b\n", node, bi->biic.bi_ber, BIBER_BITS);
97: }
98: panic("bi_buserr");
99: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.