|
|
1.1 root 1: /*
2: * Copyright (c) 2000 Apple Computer, Inc. All rights reserved.
3: *
4: * @APPLE_LICENSE_HEADER_START@
5: *
6: * The contents of this file constitute Original Code as defined in and
7: * are subject to the Apple Public Source License Version 1.1 (the
8: * "License"). You may not use this file except in compliance with the
9: * License. Please obtain a copy of the License at
10: * http://www.apple.com/publicsource and read it before using this file.
11: *
12: * This Original Code and all software distributed under the License are
13: * distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER
14: * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
15: * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
16: * FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT. Please see the
17: * License for the specific language governing rights and limitations
18: * under the License.
19: *
20: * @APPLE_LICENSE_HEADER_END@
21: */
22: /*
23: * @OSF_COPYRIGHT@
24: */
25: /*
26: * Mach Operating System
27: * Copyright (c) 1991,1990 Carnegie Mellon University
28: * All Rights Reserved.
29: *
30: * Permission to use, copy, modify and distribute this software and its
31: * documentation is hereby granted, provided that both the copyright
32: * notice and this permission notice appear in all copies of the
33: * software, derivative works or modified versions, and any portions
34: * thereof, and that both notices appear in supporting documentation.
35: *
36: * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
37: * CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND FOR
38: * ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
39: *
40: * Carnegie Mellon requests users of this software to return to
41: *
42: * Software Distribution Coordinator or [email protected]
43: * School of Computer Science
44: * Carnegie Mellon University
45: * Pittsburgh PA 15213-3890
46: *
47: * any improvements or extensions that they make and grant Carnegie Mellon
48: * the rights to redistribute these changes.
49: */
50: /*
51: */
52:
53: #ifndef _I386_TRAP_H_
54: #define _I386_TRAP_H_
55:
56: /*
57: * Hardware trap vectors for i386.
58: */
59: #define T_DIVIDE_ERROR 0
60: #define T_DEBUG 1
61: #define T_NMI 2 /* non-maskable interrupt */
62: #define T_INT3 3 /* int 3 instruction */
63: #define T_OVERFLOW 4 /* overflow test */
64: #define T_OUT_OF_BOUNDS 5 /* bounds check */
65: #define T_INVALID_OPCODE 6 /* invalid op code */
66: #define T_NO_FPU 7 /* no floating point */
67: #define T_DOUBLE_FAULT 8 /* double fault */
68: #define T_FPU_FAULT 9
69: /* 10 */
70: #define T_SEGMENT_NOT_PRESENT 11
71: #define T_STACK_FAULT 12
72: #define T_GENERAL_PROTECTION 13
73: #define T_PAGE_FAULT 14
74: /* 15 */
75: #define T_FLOATING_POINT_ERROR 16
76: #define T_WATCHPOINT 17
77: #define T_PREEMPT 255
78:
79: #define TRAP_NAMES "divide error", "debug trap", "NMI", "breakpoint", \
80: "overflow", "bounds check", "invalid opcode", \
81: "no coprocessor", "double fault", "coprocessor overrun", \
82: "invalid TSS", "segment not present", "stack bounds", \
83: "general protection", "page fault", "(reserved)", \
84: "coprocessor error", "watchpoint"
85:
86: /*
87: * Page-fault trap codes.
88: */
89: #define T_PF_PROT 0x1 /* protection violation */
90: #define T_PF_WRITE 0x2 /* write access */
91: #define T_PF_USER 0x4 /* from user state */
92:
93: #if !defined(ASSEMBLER) && defined(MACH_KERNEL)
94:
95: #include <i386/thread.h>
96:
97: extern void i386_exception(
98: int exc,
99: int code,
100: int subcode);
101:
102: extern void thread_exception_return(void);
103:
104: extern boolean_t kernel_trap(
105: struct i386_saved_state *regs);
106:
107: extern void panic_trap(
108: struct i386_saved_state *regs);
109:
110: extern void user_trap(
111: struct i386_saved_state *regs);
112:
113: extern void i386_astintr(int preemption);
114:
115: #endif /* !ASSEMBLER && MACH_KERNEL */
116:
117: #endif /* _I386_TRAP_H_ */
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.