|
|
1.1 ! root 1: /* ! 2: * Mach Operating System ! 3: * Copyright (c) 1991,1990,1989,1988,1987 Carnegie Mellon University ! 4: * All Rights Reserved. ! 5: * ! 6: * Permission to use, copy, modify and distribute this software and its ! 7: * documentation is hereby granted, provided that both the copyright ! 8: * notice and this permission notice appear in all copies of the ! 9: * software, derivative works or modified versions, and any portions ! 10: * thereof, and that both notices appear in supporting documentation. ! 11: * ! 12: * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS" ! 13: * CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND FOR ! 14: * ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE. ! 15: * ! 16: * Carnegie Mellon requests users of this software to return to ! 17: * ! 18: * Software Distribution Coordinator or [email protected] ! 19: * School of Computer Science ! 20: * Carnegie Mellon University ! 21: * Pittsburgh PA 15213-3890 ! 22: * ! 23: * any improvements or extensions that they make and grant Carnegie Mellon ! 24: * the rights to redistribute these changes. ! 25: */ ! 26: ! 27: #ifndef _KERN_SYSCALL_SW_H_ ! 28: #define _KERN_SYSCALL_SW_H_ ! 29: ! 30: /* ! 31: * mach_trap_stack indicates the trap may discard ! 32: * its kernel stack. Some architectures may need ! 33: * to save more state in the pcb for these traps. ! 34: */ ! 35: ! 36: typedef struct { ! 37: int mach_trap_arg_count; ! 38: int (*mach_trap_function)(); ! 39: boolean_t mach_trap_stack; ! 40: int mach_trap_unused; ! 41: } mach_trap_t; ! 42: ! 43: extern mach_trap_t mach_trap_table[]; ! 44: extern int mach_trap_count; ! 45: ! 46: #define MACH_TRAP(name, arg_count) \ ! 47: { (arg_count), (int (*)()) (name), FALSE, 0 } ! 48: #define MACH_TRAP_STACK(name, arg_count) \ ! 49: { (arg_count), (int (*)()) (name), TRUE, 0 } ! 50: ! 51: #endif /* _KERN_SYSCALL_SW_H_ */
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.