|
|
1.1 ! root 1: /* ! 2: * Copyright (c) 1995-1994 The University of Utah and ! 3: * the Computer Systems Laboratory at the University of Utah (CSL). ! 4: * All rights reserved. ! 5: * ! 6: * Permission to use, copy, modify and distribute this software is hereby ! 7: * granted provided that (1) source code retains these copyright, permission, ! 8: * and disclaimer notices, and (2) redistributions including binaries ! 9: * reproduce the notices in supporting documentation, and (3) all advertising ! 10: * materials mentioning features or use of this software display the following ! 11: * acknowledgement: ``This product includes software developed by the ! 12: * Computer Systems Laboratory at the University of Utah.'' ! 13: * ! 14: * THE UNIVERSITY OF UTAH AND CSL ALLOW FREE USE OF THIS SOFTWARE IN ITS "AS ! 15: * IS" CONDITION. THE UNIVERSITY OF UTAH AND CSL DISCLAIM ANY LIABILITY OF ! 16: * ANY KIND FOR ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE. ! 17: * ! 18: * CSL requests users of this software to return to [email protected] any ! 19: * improvements that they make and grant CSL redistribution rights. ! 20: * ! 21: * Author: Bryan Ford, University of Utah CSL ! 22: */ ! 23: #ifndef _I386_UTIL_LDT_ ! 24: #define _I386_UTIL_LDT_ ! 25: ! 26: #include "config.h" ! 27: ! 28: /* If more-specific code wants a standard LDT, ! 29: then it should define ENABLE_KERNEL_LDT in config.h. */ ! 30: #ifdef ENABLE_KERNEL_LDT ! 31: ! 32: #include <mach/machine/seg.h> ! 33: ! 34: /* Fill a segment descriptor in a CPU's master LDT. */ ! 35: #define fill_ldt_descriptor(cpu, selector, base, limit, access, sizebits) \ ! 36: fill_descriptor(&(cpu)->tables.ldt[(selector)/8], \ ! 37: base, limit, access, sizebits) ! 38: ! 39: #define fill_ldt_gate(cpu, selector, offset, dest_selector, access, word_count) \ ! 40: fill_gate((struct i386_gate*)&(cpu)->tables.ldt[(selector)/8], \ ! 41: offset, dest_selector, access, word_count) ! 42: ! 43: #endif ENABLE_KERNEL_LDT ! 44: ! 45: #endif _I386_UTIL_LDT_
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.