|
|
1.1 root 1: /*
2: * Mach Operating System
3: * Copyright (c) 1993-1988 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: *
28: * This file contains the structure definitions for the user-visible
29: * thread state. This thread state is examined with the thread_get_state
30: * kernel call and may be changed with the thread_set_state kernel call.
31: *
32: */
33:
34: #ifndef _MACH_THREAD_STATUS_H_
35: #define _MACH_THREAD_STATUS_H_
36:
37: /*
38: * The actual structure that comprises the thread state is defined
39: * in the machine dependent module.
40: */
41: #include <mach/machine/vm_types.h>
42: #include <mach/machine/thread_status.h>
43:
44: /*
45: * Generic definition for machine-dependent thread status.
46: */
47:
48: typedef natural_t *thread_state_t; /* Variable-length array */
49:
50: #define THREAD_STATE_MAX (1024) /* Maximum array size */
51: typedef natural_t thread_state_data_t[THREAD_STATE_MAX];
52:
53: #define THREAD_STATE_FLAVOR_LIST 0 /* List of valid flavors */
54:
55: #endif /* _MACH_THREAD_STATUS_H_ */
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.