|
|
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 are permitted
9: * provided that the above copyright notice and this paragraph are
10: * duplicated in all such forms and that any documentation,
11: * advertising materials, and other materials related to such
12: * distribution and use acknowledge that the software was developed
13: * by the University of California, Berkeley. The name of the
14: * University may not be used to endorse or promote products derived
15: * from this software without specific prior written permission.
16: * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
17: * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
18: * WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.
19: *
20: * @(#)bivar.h 7.2 (Berkeley) 7/9/88
21: */
22:
23: /*
24: * Software status per BI node.
25: */
26:
27: struct binode_status {
28: /* int bh_type; /* type of adapter */
29: struct biiregs *bh_bi; /* virt addr of registers */
30: struct biiregs *bh_physbi; /* phys addr of registers */
31: int bh_errcnt; /* number of errors */
32: int bh_ivec; /* interrupt vector */
33: int bh_arb; /* arbitration */
34: };
35:
36: /*
37: * ... per BI
38: */
39: struct bi_hd {
40: short bh_nodes; /* which nodes are present */
41: struct binode_status bh_nodes[16]; /* info about those nodes */
42: };
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.