|
|
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 is only permitted until one year after the first shipment ! 9: * of 4.4BSD by the Regents. Otherwise, redistribution and use in source and ! 10: * binary forms are permitted provided that: (1) source distributions retain ! 11: * this entire copyright notice and comment, and (2) distributions including ! 12: * binaries display the following acknowledgement: This product includes ! 13: * software developed by the University of California, Berkeley and its ! 14: * contributors'' in the documentation or other materials provided with the ! 15: * distribution and in all advertising materials mentioning features or use ! 16: * of this software. Neither the name of the University nor the names of ! 17: * its contributors may be used to endorse or promote products derived from ! 18: * this software without specific prior written permission. ! 19: * THIS SOFTWARE IS PROVIDED AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED ! 20: * WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF ! 21: * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. ! 22: * ! 23: * @(#)bivar.h 7.3 (Berkeley) 6/28/90 ! 24: */ ! 25: ! 26: /* ! 27: * Software status per BI node. ! 28: */ ! 29: ! 30: struct binode_status { ! 31: /* int bh_type; /* type of adapter */ ! 32: struct biiregs *bh_bi; /* virt addr of registers */ ! 33: struct biiregs *bh_physbi; /* phys addr of registers */ ! 34: int bh_errcnt; /* number of errors */ ! 35: int bh_ivec; /* interrupt vector */ ! 36: int bh_arb; /* arbitration */ ! 37: }; ! 38: ! 39: /* ! 40: * ... per BI ! 41: */ ! 42: struct bi_hd { ! 43: short bh_nodes; /* which nodes are present */ ! 44: struct binode_status bh_nodes[16]; /* info about those nodes */ ! 45: };
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.