2 * Copyright (c) 2000 Apple Computer, Inc. All rights reserved.
4 * @APPLE_LICENSE_HEADER_START@
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.
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
20 * @APPLE_LICENSE_HEADER_END@
23 * @OSF_FREE_COPYRIGHT@
26 * Mach Operating System
27 * Copyright (c) 1991,1990,1989,1988 Carnegie Mellon University
28 * All Rights Reserved.
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.
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.
40 * Carnegie Mellon requests users of this software to return to
42 * Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU
43 * School of Computer Science
44 * Carnegie Mellon University
45 * Pittsburgh PA 15213-3890
47 * any improvements or extensions that they make and grant Carnegie Mellon
48 * the rights to redistribute these changes.
54 * Author: Avadis Tevanian, Jr.
56 * This file contains the structure definitions for tasks.
60 * Copyright (c) 1993 The University of Utah and
61 * the Computer Systems Laboratory (CSL). All rights reserved.
63 * Permission to use, copy, modify and distribute this software and its
64 * documentation is hereby granted, provided that both the copyright
65 * notice and this permission notice appear in all copies of the
66 * software, derivative works or modified versions, and any portions
67 * thereof, and that both notices appear in supporting documentation.
69 * THE UNIVERSITY OF UTAH AND CSL ALLOW FREE USE OF THIS SOFTWARE IN ITS "AS
70 * IS" CONDITION. THE UNIVERSITY OF UTAH AND CSL DISCLAIM ANY LIABILITY OF
71 * ANY KIND FOR ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
73 * CSL requests users of this software to return to csl-dist@cs.utah.edu any
74 * improvements that they make and grant CSL redistribution rights.
81 #include <kern/kern_types.h>
82 #include <mach/mach_types.h>
85 #ifdef MACH_KERNEL_PRIVATE
86 #include <mach/boolean.h>
87 #include <mach/port.h>
88 #include <mach/time_value.h>
89 #include <mach/message.h>
90 #include <mach/mach_param.h>
91 #include <mach/task_info.h>
92 #include <mach/exception_types.h>
93 #include <mach_prof.h>
94 #include <machine/task.h>
95 #include <kern/queue.h>
96 #include <kern/exception.h>
97 #include <kern/lock.h>
98 #include <kern/syscall_emulation.h>
99 #include <norma_task.h>
100 #include <mach_host.h>
101 #include <fast_tas.h>
102 #include <task_swapper.h>
103 #include <kern/thread_act.h>
105 typedef struct task
{
106 /* Synchronization/destruction information */
107 decl_mutex_data(,lock
) /* Task's lock */
108 int ref_count
; /* Number of references to me */
109 boolean_t active
; /* Task has not been terminated */
110 boolean_t kernel_loaded
; /* Created with kernel_task_create() */
113 vm_map_t map
; /* Address space description */
114 queue_chain_t pset_tasks
; /* list of tasks assigned to pset */
115 void *user_data
; /* Arbitrary data settable via IPC */
116 int suspend_count
; /* Internal scheduling only */
119 /* Task swapper data */
120 unsigned short swap_state
; /* swap state (e.g. IN/OUT) */
121 unsigned short swap_flags
; /* swap flags (e.g. MAKE_UNSWAPP) */
122 unsigned int swap_stamp
; /* when last swapped */
123 unsigned long swap_rss
; /* size (pages) when last swapped */
124 int swap_ast_waiting
; /* number of threads that have not */
125 /* reached a clean point and halted */
126 int swap_nswap
; /* number of times this task swapped */
127 queue_chain_t swapped_tasks
; /* list of non-resident tasks */
128 #endif /* TASK_SWAPPER */
130 /* Activations in this task */
131 queue_head_t thr_acts
; /* list of thread_activations */
134 int active_act_count
; /* have not terminate_self yet */
136 processor_set_t processor_set
; /* processor set for new threads */
138 boolean_t may_assign
; /* can assigned pset be changed? */
139 boolean_t assign_active
; /* waiting for may_assign */
140 #endif /* MACH_HOST */
142 /* User-visible scheduling information */
143 integer_t user_stop_count
; /* outstanding stops */
147 integer_t priority
; /* base priority for threads */
148 integer_t max_priority
; /* maximum priority for threads */
150 /* Task security token */
151 security_token_t sec_token
;
154 time_value_t total_user_time
; /* user time for dead threads */
155 time_value_t total_system_time
; /* system time for dead threads */
158 boolean_t task_profiled
; /* is task being profiled ? */
159 struct prof_data
*profil_buffer
;/* profile struct if so */
160 #endif /* MACH_PROF */
163 decl_mutex_data(,itk_lock_data
)
164 struct ipc_port
*itk_self
; /* not a right, doesn't hold ref */
165 struct ipc_port
*itk_sself
; /* a send right */
166 struct exception_action exc_actions
[EXC_TYPES_COUNT
];
167 /* a send right each valid element */
168 struct ipc_port
*itk_host
; /* a send right */
169 struct ipc_port
*itk_bootstrap
; /* a send right */
170 struct ipc_port
*itk_registered
[TASK_PORT_REGISTER_MAX
];
171 /* all send rights */
173 struct ipc_space
*itk_space
;
175 /* RPC subsystem information */
176 queue_head_t subsystem_list
; /* list of subsystems */
177 int subsystem_count
;/* number of subsystems */
179 /* Synchronizer ownership information */
180 queue_head_t semaphore_list
; /* list of owned semaphores */
181 queue_head_t lock_set_list
; /* list of owned lock sets */
182 int semaphores_owned
; /* number of semaphores owned */
183 int lock_sets_owned
; /* number of lock sets owned */
185 /* User space system call emulation support */
186 struct eml_dispatch
*eml_dispatch
;
189 struct ipc_port
*wired_ledger_port
;
190 struct ipc_port
*paged_ledger_port
;
193 long child_node
; /* if != -1, node for new children */
194 #endif /* NORMA_TASK */
196 vm_offset_t fast_tas_base
;
197 vm_offset_t fast_tas_end
;
198 #endif /* FAST_TAS */
200 integer_t faults
; /* faults counter */
201 integer_t pageins
; /* pageins counter */
202 integer_t cow_faults
; /* copy on write fault counter */
203 integer_t messages_sent
; /* messages sent counter */
204 integer_t messages_received
; /* messages received counter */
205 integer_t syscalls_mach
; /* mach system call counter */
206 integer_t syscalls_unix
; /* unix system call counter */
207 integer_t csw
; /* context switch counter */
211 vm_offset_t system_shared_region
;
212 vm_offset_t dynamic_working_set
;
216 #define task_lock(task) mutex_lock(&(task)->lock)
217 #define task_lock_try(task) mutex_try(&(task)->lock)
218 #define task_unlock(task) mutex_unlock(&(task)->lock)
220 #define itk_lock_init(task) mutex_init(&(task)->itk_lock_data, \
221 ETAP_THREAD_TASK_ITK)
222 #define itk_lock(task) mutex_lock(&(task)->itk_lock_data)
223 #define itk_unlock(task) mutex_unlock(&(task)->itk_lock_data)
226 * Internal only routines
229 /* Initialize task module */
230 extern void task_init(void);
233 extern kern_return_t
task_create_local(
235 boolean_t inherit_memory
,
236 boolean_t kernel_loaded
,
237 task_t
*child_task
); /* OUT */
240 /* Freeze and unfreeze task from being reassigned processor sets */
241 extern void task_freeze(
244 extern void task_unfreeze(
246 #endif /* MACH_HOST */
248 extern void consider_task_collect(void);
250 #define current_task_fast() (current_act_fast()->task)
251 #define current_task() current_task_fast()
253 #else /* !MACH_KERNEL_PRIVATE */
255 extern task_t
current_task(void);
257 #endif /* !MACH_KERNEL_PRIVATE */
259 extern task_t kernel_task
;
260 extern boolean_t
is_kerneltask(task_t
);
262 /* Temporarily hold all threads in a task */
263 extern kern_return_t
task_hold(
266 /* Release temporary hold on all threads in a task */
267 extern kern_return_t
task_release(
270 /* Get a task prepared for major changes */
271 extern kern_return_t
task_halt(
274 /* Take reference on task (make sure it doesn't go away) */
275 extern void task_reference(task_t task
);
277 /* Try to take a reference on task, return false if it would block */
278 extern boolean_t
task_reference_try(task_t task
);
280 /* Remove reference to task */
281 extern void task_deallocate(task_t task
);
283 #if defined(MACH_KERNEL_PRIVATE) || defined(BSD_BUILD)
284 extern kern_return_t
task_importance(
286 integer_t importance
);
289 /* JMM - should just be temporary (implementation in bsd_kern still) */
290 extern void *get_bsdtask_info(task_t
);
291 extern void set_bsdtask_info(task_t
,void *);
292 extern vm_map_t
get_task_map(task_t
);
293 extern vm_map_t
swap_task_map(task_t
, vm_map_t
);
294 extern pmap_t
get_task_pmap(task_t
);
295 #endif /* _KERN_TASK_H_ */