2 * Copyright (c) 2000-2009 Apple Inc. All rights reserved.
4 * @APPLE_OSREFERENCE_LICENSE_HEADER_START@
6 * This file contains Original Code and/or Modifications of Original Code
7 * as defined in and that are subject to the Apple Public Source License
8 * Version 2.0 (the 'License'). You may not use this file except in
9 * compliance with the License. The rights granted to you under the License
10 * may not be used to create, or enable the creation or redistribution of,
11 * unlawful or unlicensed copies of an Apple operating system, or to
12 * circumvent, violate, or enable the circumvention or violation of, any
13 * terms of an Apple operating system software license agreement.
15 * Please obtain a copy of the License at
16 * http://www.opensource.apple.com/apsl/ and read it before using this file.
18 * The Original Code and all software distributed under the License are
19 * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
20 * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
21 * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
22 * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.
23 * Please see the License for the specific language governing rights and
24 * limitations under the License.
26 * @APPLE_OSREFERENCE_LICENSE_HEADER_END@
32 * Mach Operating System
33 * Copyright (c) 1991,1990,1989,1988,1987 Carnegie Mellon University
34 * All Rights Reserved.
36 * Permission to use, copy, modify and distribute this software and its
37 * documentation is hereby granted, provided that both the copyright
38 * notice and this permission notice appear in all copies of the
39 * software, derivative works or modified versions, and any portions
40 * thereof, and that both notices appear in supporting documentation.
42 * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
43 * CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND FOR
44 * ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
46 * Carnegie Mellon requests users of this software to return to
48 * Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU
49 * School of Computer Science
50 * Carnegie Mellon University
51 * Pittsburgh PA 15213-3890
53 * any improvements or extensions that they make and grant Carnegie Mellon
54 * the rights to redistribute these changes.
60 * Author: Avadis Tevanian, Jr.
63 * Header file for scheduler.
67 #ifndef _KERN_SCHED_H_
68 #define _KERN_SCHED_H_
70 #include <stat_time.h>
72 #include <mach/policy.h>
73 #include <kern/kern_types.h>
74 #include <kern/queue.h>
75 #include <kern/lock.h>
76 #include <kern/macro_help.h>
77 #include <kern/timer_call.h>
80 #define NRQS 128 /* 128 levels per run queue */
81 #define NRQBM (NRQS / 32) /* number of words per bit map */
83 #define MAXPRI (NRQS-1)
84 #define MINPRI IDLEPRI /* lowest legal priority schedulable */
85 #define IDLEPRI 0 /* idle thread priority */
88 * High-level priority assignments
90 *************************************************************************
91 * 127 Reserved (real-time)
97 * 96 Reserved (real-time)
104 * 80 Kernel mode only
105 * 79 System high priority
111 * 64 System high priority
112 * 63 Elevated priorities
118 * 52 Elevated priorities
119 * 51 Elevated priorities (incl. BSD +nice)
125 * 32 Elevated priorities (incl. BSD +nice)
126 * 31 Default (default base for threads)
127 * 30 Lowered priorities (incl. BSD -nice)
133 * 11 Lowered priorities (incl. BSD -nice)
134 * 10 Lowered priorities (aged pri's)
140 * 0 Lowered priorities (aged pri's / idle)
141 *************************************************************************
144 #define BASEPRI_RTQUEUES (BASEPRI_REALTIME + 1) /* 97 */
145 #define BASEPRI_REALTIME (MAXPRI - (NRQS / 4) + 1) /* 96 */
147 #define MAXPRI_KERNEL (BASEPRI_REALTIME - 1) /* 95 */
148 #define BASEPRI_PREEMPT (MAXPRI_KERNEL - 2) /* 93 */
149 #define BASEPRI_KERNEL (MINPRI_KERNEL + 1) /* 81 */
150 #define MINPRI_KERNEL (MAXPRI_KERNEL - (NRQS / 8) + 1) /* 80 */
152 #define MAXPRI_RESERVED (MINPRI_KERNEL - 1) /* 79 */
153 #define MINPRI_RESERVED (MAXPRI_RESERVED - (NRQS / 8) + 1) /* 64 */
155 #define MAXPRI_USER (MINPRI_RESERVED - 1) /* 63 */
156 #define BASEPRI_CONTROL (BASEPRI_DEFAULT + 17) /* 48 */
157 #define BASEPRI_FOREGROUND (BASEPRI_DEFAULT + 16) /* 47 */
158 #define BASEPRI_BACKGROUND (BASEPRI_DEFAULT + 15) /* 46 */
159 #define BASEPRI_DEFAULT (MAXPRI_USER - (NRQS / 4)) /* 31 */
160 #define MAXPRI_THROTTLE (MINPRI + 4) /* 4 */
161 #define MINPRI_USER MINPRI /* 0 */
163 #ifdef CONFIG_EMBEDDED
164 #define DEPRESSPRI MAXPRI_THROTTLE
166 #define DEPRESSPRI MINPRI /* depress priority */
169 /* Type used for thread->sched_mode and saved_mode */
171 TH_MODE_NONE
= 0, /* unassigned, usually for saved_mode only */
172 TH_MODE_REALTIME
, /* time constraints supplied */
173 TH_MODE_FIXED
, /* use fixed priorities, no decay */
174 TH_MODE_TIMESHARE
, /* use timesharing algorithm */
175 TH_MODE_FAIRSHARE
/* use fair-share scheduling */
179 * Macro to check for invalid priorities.
181 #define invalid_pri(pri) ((pri) < MINPRI || (pri) > MAXPRI)
185 uint64_t last_change_timestamp
;
188 #if defined(CONFIG_SCHED_TRADITIONAL) || defined(CONFIG_SCHED_PROTO) || defined(CONFIG_SCHED_FIXEDPRIORITY)
191 int highq
; /* highest runnable queue */
192 int bitmap
[NRQBM
]; /* run queue bitmap array */
193 int count
; /* # of threads total */
194 int urgency
; /* level of preemption urgency */
195 queue_head_t queues
[NRQS
]; /* one for each priority */
197 struct runq_stats runq_stats
;
200 #endif /* defined(CONFIG_SCHED_TRADITIONAL) || defined(CONFIG_SCHED_PROTO) || defined(CONFIG_SCHED_FIXEDPRIORITY) */
203 int count
; /* # of threads total */
204 queue_head_t queue
; /* all runnable RT threads */
206 struct runq_stats runq_stats
;
209 #if defined(CONFIG_SCHED_TRADITIONAL) || defined(CONFIG_SCHED_PROTO) || defined(CONFIG_SCHED_FIXEDPRIORITY)
210 struct fairshare_queue
{
211 int count
; /* # of threads total */
212 queue_head_t queue
; /* all runnable threads demoted to fairshare scheduling */
214 struct runq_stats runq_stats
;
218 #if defined(CONFIG_SCHED_GRRR_CORE)
221 * We map standard Mach priorities to an abstract scale that more properly
222 * indicates how we want processor time allocated under contention.
224 typedef uint8_t grrr_proportional_priority_t
;
225 typedef uint8_t grrr_group_index_t
;
227 #define NUM_GRRR_PROPORTIONAL_PRIORITIES 256
228 #define MAX_GRRR_PROPORTIONAL_PRIORITY ((grrr_proportional_priority_t)255)
231 #define NUM_GRRR_GROUPS 8 /* log(256) */
234 #define NUM_GRRR_GROUPS 64 /* 256/4 */
237 queue_chain_t priority_order
; /* next greatest weight group */
238 grrr_proportional_priority_t minpriority
;
239 grrr_group_index_t index
;
241 queue_head_t clients
;
245 uint32_t deferred_removal_weight
;
248 thread_t current_client
;
251 struct grrr_run_queue
{
253 uint32_t last_rescale_tick
;
254 struct grrr_group groups
[NUM_GRRR_GROUPS
];
255 queue_head_t sorted_group_list
;
257 grrr_group_t current_group
;
259 struct runq_stats runq_stats
;
262 #endif /* defined(CONFIG_SCHED_GRRR_CORE) */
264 #define first_timeslice(processor) ((processor)->timeslice > 0)
266 extern struct rt_queue rt_runq
;
269 * Scheduler routines.
272 /* Handle quantum expiration for an executing thread */
273 extern void thread_quantum_expire(
274 timer_call_param_t processor
,
275 timer_call_param_t thread
);
277 /* Context switch check for current processor */
278 extern ast_t
csw_check(processor_t processor
);
280 #if defined(CONFIG_SCHED_TRADITIONAL)
281 extern uint32_t std_quantum
, min_std_quantum
;
282 extern uint32_t std_quantum_us
;
285 extern uint32_t thread_depress_time
;
286 extern uint32_t default_timeshare_computation
;
287 extern uint32_t default_timeshare_constraint
;
289 extern uint32_t max_rt_quantum
, min_rt_quantum
;
291 extern uint32_t sched_cswtime
;
293 #if defined(CONFIG_SCHED_TRADITIONAL)
296 * Age usage (1 << SCHED_TICK_SHIFT) times per second.
298 #define SCHED_TICK_SHIFT 3
300 extern unsigned sched_tick
;
301 extern uint32_t sched_tick_interval
;
303 #endif /* CONFIG_SCHED_TRADITIONAL */
305 extern uint64_t sched_one_second_interval
;
307 /* Periodic computation of various averages */
308 extern void compute_averages(void);
310 extern void compute_averunnable(
313 extern void compute_stack_target(
316 extern void compute_memory_pressure(
319 extern void compute_zone_gc_throttle(
322 extern void compute_pmap_gc_throttle(
326 * Conversion factor from usage
329 #if defined(CONFIG_SCHED_TRADITIONAL)
330 extern uint32_t sched_pri_shift
;
331 extern uint32_t sched_fixed_shift
;
332 extern int8_t sched_load_shifts
[NRQS
];
335 extern int32_t sched_poll_yield_shift
;
336 extern uint64_t sched_safe_duration
;
338 extern uint32_t sched_run_count
, sched_share_count
;
339 extern uint32_t sched_load_average
, sched_mach_factor
;
341 extern uint32_t avenrun
[3], mach_factor
[3];
343 extern uint64_t max_unsafe_computation
;
344 extern uint64_t max_poll_computation
;
346 #define sched_run_incr() \
348 hw_atomic_add(&sched_run_count, 1); \
351 #define sched_run_decr() \
353 hw_atomic_sub(&sched_run_count, 1); \
356 #define sched_share_incr() \
358 (void)hw_atomic_add(&sched_share_count, 1); \
361 #define sched_share_decr() \
363 (void)hw_atomic_sub(&sched_share_count, 1); \
367 * thread_timer_delta macro takes care of both thread timers.
369 #define thread_timer_delta(thread, delta) \
371 (delta) = (typeof(delta))timer_delta(&(thread)->system_timer, \
372 &(thread)->system_timer_save); \
373 (delta) += (typeof(delta))timer_delta(&(thread)->user_timer, \
374 &(thread)->user_timer_save); \
377 #endif /* _KERN_SCHED_H_ */