|
|
1.1 root 1: /*
2: * Copyright (c) 1982, 1986 Regents of the University of California.
3: * All rights reserved. The Berkeley software License Agreement
4: * specifies the terms and conditions for redistribution.
5: *
6: * @(#)trap.h 7.3 (Berkeley) 7/11/87
7: */
8:
9: /*
10: * Trap type values
11: * also known in trap.c for name strings
12: */
13:
14: #define T_RESADFLT 0 /* reserved addressing fault */
15: #define T_PRIVINFLT 1 /* privileged instruction fault */
16: #define T_RESOPFLT 2 /* reserved operand fault */
17: /* definitions for <sys/signal.h> */
18: #define ILL_RESAD_FAULT T_RESADFLT
19: #define ILL_PRIVIN_FAULT T_PRIVINFLT
20: #define ILL_RESOP_FAULT T_RESOPFLT
21: /* CHME, CHMS, CHMU are not yet given back to users reasonably */
22: #define T_BPTFLT 3 /* bpt instruction fault */
23: #define T_XFCFLT 4 /* xfc instruction fault */
24: #define T_SYSCALL 5 /* chmk instruction (syscall trap) */
25: #define T_ARITHTRAP 6 /* arithmetic trap */
26: #define T_ASTFLT 7 /* software level 2 trap (ast deliv) */
27: #define T_SEGFLT 8 /* segmentation fault */
28: #define T_PROTFLT 9 /* protection fault */
29: #define T_TRCTRAP 10 /* trace trap */
30: #define T_COMPATFLT 11 /* compatibility mode fault */
31: #define T_PAGEFLT 12 /* page fault */
32: #define T_TABLEFLT 13 /* page table fault */
33: #define T_KDBTRAP 14 /* kernel debugger trap */
34:
35: /* codes for SIGFPE/ARITHTRAP */
36: #define FPE_INTOVF_TRAP 0x1 /* integer overflow */
37: #define FPE_INTDIV_TRAP 0x2 /* integer divide by zero */
38: #define FPE_FLTOVF_TRAP 0x3 /* floating overflow */
39: #define FPE_FLTDIV_TRAP 0x4 /* floating/decimal divide by zero */
40: #define FPE_FLTUND_TRAP 0x5 /* floating underflow */
41: #define FPE_DECOVF_TRAP 0x6 /* decimal overflow */
42: #define FPE_SUBRNG_TRAP 0x7 /* subscript out of range */
43: #define FPE_FLTOVF_FAULT 0x8 /* floating overflow fault */
44: #define FPE_FLTDIV_FAULT 0x9 /* divide by zero floating fault */
45: #define FPE_FLTUND_FAULT 0xa /* floating underflow fault */
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.