|
|
1.1 ! root 1: /* ! 2: * Copyright (c) 1988 University of Utah. ! 3: * Copyright (c) 1982, 1986, 1990 The Regents of the University of California. ! 4: * All rights reserved. ! 5: * ! 6: * This code is derived from software contributed to Berkeley by ! 7: * the Systems Programming Group of the University of Utah Computer ! 8: * Science Department. ! 9: * ! 10: * Redistribution is only permitted until one year after the first shipment ! 11: * of 4.4BSD by the Regents. Otherwise, redistribution and use in source and ! 12: * binary forms are permitted provided that: (1) source distributions retain ! 13: * this entire copyright notice and comment, and (2) distributions including ! 14: * binaries display the following acknowledgement: This product includes ! 15: * software developed by the University of California, Berkeley and its ! 16: * contributors'' in the documentation or other materials provided with the ! 17: * distribution and in all advertising materials mentioning features or use ! 18: * of this software. Neither the name of the University nor the names of ! 19: * its contributors may be used to endorse or promote products derived from ! 20: * this software without specific prior written permission. ! 21: * THIS SOFTWARE IS PROVIDED AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED ! 22: * WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF ! 23: * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. ! 24: * ! 25: * from: Utah $Hdr: trap.h 1.6 88/11/25$ ! 26: * ! 27: * @(#)trap.h 7.2 (Berkeley) 6/22/90 ! 28: */ ! 29: ! 30: /* ! 31: * Trap type values ! 32: */ ! 33: ! 34: #define T_BUSERR 0 ! 35: #define T_ADDRERR 1 ! 36: #define T_ILLINST 2 ! 37: #define T_ZERODIV 3 ! 38: #define T_CHKINST 4 ! 39: #define T_TRAPVINST 5 ! 40: #define T_PRIVINST 6 ! 41: #define T_TRACE 7 ! 42: #define T_MMUFLT 8 ! 43: #define T_SSIR 9 ! 44: #define T_FMTERR 10 ! 45: #define T_FPERR 11 ! 46: #define T_COPERR 12 ! 47: #define T_ASTFLT 13 ! 48: #define T_TRAP15 15
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.