[apple/xnu.git] / osfmk / kern / sched.h

/*
 * Copyright (c) 2000-2009 Apple Inc. All rights reserved.
 *
 * @APPLE_OSREFERENCE_LICENSE_HEADER_START@
 * 
 * This file contains Original Code and/or Modifications of Original Code
 * as defined in and that are subject to the Apple Public Source License
 * Version 2.0 (the 'License'). You may not use this file except in
 * compliance with the License. The rights granted to you under the License
 * may not be used to create, or enable the creation or redistribution of,
 * unlawful or unlicensed copies of an Apple operating system, or to
 * circumvent, violate, or enable the circumvention or violation of, any
 * terms of an Apple operating system software license agreement.
 * 
 * Please obtain a copy of the License at
 * http://www.opensource.apple.com/apsl/ and read it before using this file.
 * 
 * The Original Code and all software distributed under the License are
 * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
 * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
 * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.
 * Please see the License for the specific language governing rights and
 * limitations under the License.
 * 
 * @APPLE_OSREFERENCE_LICENSE_HEADER_END@
 */
/*
 * @OSF_COPYRIGHT@
 */
/* 
 * Mach Operating System
 * Copyright (c) 1991,1990,1989,1988,1987 Carnegie Mellon University
 * All Rights Reserved.
 * 
 * Permission to use, copy, modify and distribute this software and its
 * documentation is hereby granted, provided that both the copyright
 * notice and this permission notice appear in all copies of the
 * software, derivative works or modified versions, and any portions
 * thereof, and that both notices appear in supporting documentation.
 * 
 * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
 * CONDITION.  CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND FOR
 * ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
 * 
 * Carnegie Mellon requests users of this software to return to
 * 
 *  Software Distribution Coordinator  or  Software.Distribution@CS.CMU.EDU
 *  School of Computer Science
 *  Carnegie Mellon University
 *  Pittsburgh PA 15213-3890
 * 
 * any improvements or extensions that they make and grant Carnegie Mellon
 * the rights to redistribute these changes.
 */
/*
 */
/*
 *	File:	sched.h
 *	Author:	Avadis Tevanian, Jr.
 *	Date:	1985
 *
 *	Header file for scheduler.
 *
 */

#ifndef	_KERN_SCHED_H_
#define _KERN_SCHED_H_

#include <mach/policy.h>
#include <kern/kern_types.h>
#include <kern/smp.h>
#include <kern/queue.h>
#include <kern/macro_help.h>
#include <kern/timer_call.h>
#include <kern/ast.h>
#include <kern/kalloc.h>
#include <kern/bits.h>

#define	NRQS		128				/* 128 levels per run queue */

#define MAXPRI		(NRQS-1)
#define MINPRI		0				/* lowest legal priority schedulable */
#define	IDLEPRI		MINPRI				/* idle thread priority */
#define	NOPRI		-1

/*
 *	High-level priority assignments
 *
 *************************************************************************
 * 127		Reserved (real-time)
 *				A
 *				+
 *			(32 levels)
 *				+
 *				V
 * 96		Reserved (real-time)
 * 95		Kernel mode only
 *				A
 *				+
 *			(16 levels)
 *				+
 *				V
 * 80		Kernel mode only
 * 79		System high priority
 *				A
 *				+
 *			(16 levels)
 *				+
 *				V
 * 64		System high priority
 * 63		Elevated priorities
 *				A
 *				+
 *			(12 levels)
 *				+
 *				V
 * 52		Elevated priorities
 * 51		Elevated priorities (incl. BSD +nice)
 *				A
 *				+
 *			(20 levels)
 *				+
 *				V
 * 32		Elevated priorities (incl. BSD +nice)
 * 31		Default (default base for threads)
 * 30		Lowered priorities (incl. BSD -nice)
 *				A
 *				+
 *			(20 levels)
 *				+
 *				V
 * 11		Lowered priorities (incl. BSD -nice)
 * 10		Lowered priorities (aged pri's)
 *				A
 *				+
 *			(11 levels)
 *				+
 *				V
 * 0		Lowered priorities (aged pri's / idle)
 *************************************************************************
 */

#define BASEPRI_RTQUEUES	(BASEPRI_REALTIME + 1)				/* 97 */
#define BASEPRI_REALTIME	(MAXPRI - (NRQS / 4) + 1)			/* 96 */

#define MAXPRI_KERNEL		(BASEPRI_REALTIME - 1)				/* 95 */
#define BASEPRI_PREEMPT_HIGH	(BASEPRI_PREEMPT + 1)				/* 93 */
#define BASEPRI_PREEMPT		(MAXPRI_KERNEL - 3)				/* 92 */
#define BASEPRI_VM		(BASEPRI_PREEMPT - 1)				/* 91 */

#define BASEPRI_KERNEL		(MINPRI_KERNEL + 1)				/* 81 */
#define MINPRI_KERNEL		(MAXPRI_KERNEL - (NRQS / 8) + 1)		/* 80 */

#define MAXPRI_RESERVED		(MINPRI_KERNEL - 1)				/* 79 */
#define BASEPRI_GRAPHICS	(MAXPRI_RESERVED - 3)				/* 76 */
#define MINPRI_RESERVED		(MAXPRI_RESERVED - (NRQS / 8) + 1)		/* 64 */

#define MAXPRI_USER		(MINPRI_RESERVED - 1)				/* 63 */
#define BASEPRI_CONTROL		(BASEPRI_DEFAULT + 17)				/* 48 */
#define BASEPRI_FOREGROUND	(BASEPRI_DEFAULT + 16)				/* 47 */
#define BASEPRI_BACKGROUND	(BASEPRI_DEFAULT + 15)				/* 46 */
#define BASEPRI_USER_INITIATED	(BASEPRI_DEFAULT +  6)				/* 37 */
#define BASEPRI_DEFAULT		(MAXPRI_USER - (NRQS / 4))			/* 31 */
#define MAXPRI_SUPPRESSED	(BASEPRI_DEFAULT - 3)				/* 28 */
#define BASEPRI_UTILITY		(BASEPRI_DEFAULT - 11)				/* 20 */
#define MAXPRI_THROTTLE		(MINPRI + 4)					/*  4 */
#define MINPRI_USER		MINPRI						/*  0 */

#define DEPRESSPRI		MINPRI			/* depress priority */
#define MAXPRI_PROMOTE		(MAXPRI_KERNEL)		/* ceiling for mutex promotion */

/* Type used for thread->sched_mode and saved_mode */
typedef enum {
	TH_MODE_NONE = 0,					/* unassigned, usually for saved_mode only */
	TH_MODE_REALTIME,					/* time constraints supplied */
	TH_MODE_FIXED,						/* use fixed priorities, no decay */
	TH_MODE_TIMESHARE,					/* use timesharing algorithm */
} sched_mode_t;

/* Buckets used for load calculation */
typedef enum {
	TH_BUCKET_RUN = 0,      /* All runnable threads */
	TH_BUCKET_FIXPRI,       /* Fixed-priority */
	TH_BUCKET_SHARE_FG,     /* Timeshare thread above BASEPRI_UTILITY */
	TH_BUCKET_SHARE_UT,     /* Timeshare thread between BASEPRI_UTILITY and MAXPRI_THROTTLE */
	TH_BUCKET_SHARE_BG,     /* Timeshare thread between MAXPRI_THROTTLE and MINPRI */
	TH_BUCKET_MAX,
} sched_bucket_t;

/*
 *	Macro to check for invalid priorities.
 */
#define invalid_pri(pri) ((pri) < MINPRI || (pri) > MAXPRI)

struct runq_stats {
	uint64_t				count_sum;
	uint64_t				last_change_timestamp;
};

#if defined(CONFIG_SCHED_TIMESHARE_CORE) || defined(CONFIG_SCHED_PROTO)

struct run_queue {
	int					highq;				/* highest runnable queue */
	bitmap_t				bitmap[BITMAP_LEN(NRQS)];	/* run queue bitmap array */
	int					count;				/* # of threads total */
	int					urgency;			/* level of preemption urgency */
	queue_head_t		queues[NRQS];		/* one for each priority */

	struct runq_stats	runq_stats;
};

inline static void
rq_bitmap_set(bitmap_t *map, u_int n)
{
	assert(n < NRQS);	
	bitmap_set(map, n);
}

inline static void
rq_bitmap_clear(bitmap_t *map, u_int n)
{
	assert(n < NRQS);	
	bitmap_clear(map, n);
}

#endif /* defined(CONFIG_SCHED_TIMESHARE_CORE) || defined(CONFIG_SCHED_PROTO) */

struct rt_queue {
	_Atomic int		count;				/* # of threads total */
	queue_head_t		queue;				/* all runnable RT threads */
#if __SMP__
	decl_simple_lock_data(,rt_lock)
#endif
	struct runq_stats	runq_stats;
};
typedef struct rt_queue *rt_queue_t;

#if defined(CONFIG_SCHED_GRRR_CORE)

/*
 * We map standard Mach priorities to an abstract scale that more properly
 * indicates how we want processor time allocated under contention.
 */
typedef uint8_t	grrr_proportional_priority_t;
typedef uint8_t grrr_group_index_t;

#define NUM_GRRR_PROPORTIONAL_PRIORITIES	256
#define MAX_GRRR_PROPORTIONAL_PRIORITY ((grrr_proportional_priority_t)255)

#if 0
#define NUM_GRRR_GROUPS 8					/* log(256) */
#endif

#define NUM_GRRR_GROUPS 64					/* 256/4 */

struct grrr_group {
	queue_chain_t			priority_order;				/* next greatest weight group */
	grrr_proportional_priority_t		minpriority;
	grrr_group_index_t		index;

	queue_head_t			clients;
	int						count;
	uint32_t				weight;
#if 0
	uint32_t				deferred_removal_weight;
#endif
	uint32_t				work;
	thread_t				current_client;
};

struct grrr_run_queue {
	int					count;
	uint32_t			last_rescale_tick;
	struct grrr_group	groups[NUM_GRRR_GROUPS];
	queue_head_t		sorted_group_list;
	uint32_t			weight;
	grrr_group_t		current_group;
	
	struct runq_stats   runq_stats;
};

#endif /* defined(CONFIG_SCHED_GRRR_CORE) */

extern int rt_runq_count(processor_set_t);
extern void rt_runq_count_incr(processor_set_t);
extern void rt_runq_count_decr(processor_set_t);

#if defined(CONFIG_SCHED_MULTIQ)
sched_group_t   sched_group_create(void);
void            sched_group_destroy(sched_group_t sched_group);
#endif /* defined(CONFIG_SCHED_MULTIQ) */


/*
 *	Scheduler routines.
 */

/* Handle quantum expiration for an executing thread */
extern void		thread_quantum_expire(
					timer_call_param_t	processor,
					timer_call_param_t	thread);

/* Context switch check for current processor */
extern ast_t	csw_check(processor_t		processor,
						ast_t			check_reason);

#if defined(CONFIG_SCHED_TIMESHARE_CORE)
extern uint32_t	std_quantum, min_std_quantum;
extern uint32_t	std_quantum_us;
#endif /* CONFIG_SCHED_TIMESHARE_CORE */

extern uint32_t thread_depress_time;
extern uint32_t default_timeshare_computation;
extern uint32_t default_timeshare_constraint;

extern uint32_t	max_rt_quantum, min_rt_quantum;

extern int default_preemption_rate;
extern int default_bg_preemption_rate;

#if defined(CONFIG_SCHED_TIMESHARE_CORE)

/*
 *	Age usage  at approximately (1 << SCHED_TICK_SHIFT) times per second
 *	Aging may be deferred during periods where all processors are idle
 *	and cumulatively applied during periods of activity.
 */
#define SCHED_TICK_SHIFT	3
#define SCHED_TICK_MAX_DELTA	(8)

extern unsigned		sched_tick;
extern uint32_t		sched_tick_interval;

#endif /* CONFIG_SCHED_TIMESHARE_CORE */

extern uint64_t		sched_one_second_interval;

/* Periodic computation of various averages */
extern void		compute_averages(uint64_t);

extern void		compute_averunnable(
					void			*nrun);

extern void		compute_stack_target(
					void			*arg);

extern void		compute_memory_pressure(
					void			*arg);

extern void		compute_pageout_gc_throttle(
					void			*arg);

extern void		compute_pmap_gc_throttle(
					void			*arg);

/*
 *	Conversion factor from usage
 *	to priority.
 */
#if defined(CONFIG_SCHED_TIMESHARE_CORE)

#define MAX_LOAD (NRQS - 1)
extern uint32_t		sched_pri_shifts[TH_BUCKET_MAX];
extern uint32_t		sched_fixed_shift;
extern int8_t		sched_load_shifts[NRQS];
extern uint32_t		sched_decay_usage_age_factor;
void sched_timeshare_consider_maintenance(uint64_t ctime);
#endif /* CONFIG_SCHED_TIMESHARE_CORE */

void sched_consider_recommended_cores(uint64_t ctime, thread_t thread);

extern int32_t		sched_poll_yield_shift;
extern uint64_t		sched_safe_duration;

extern uint32_t		sched_load_average, sched_mach_factor;

extern uint32_t		avenrun[3], mach_factor[3];

extern uint64_t		max_unsafe_computation;
extern uint64_t		max_poll_computation;

extern volatile uint32_t sched_run_buckets[TH_BUCKET_MAX];

extern uint32_t sched_run_incr(thread_t thread);
extern uint32_t sched_run_decr(thread_t thread);

/*
 *	thread_timer_delta macro takes care of both thread timers.
 */
#define thread_timer_delta(thread, delta)					\
MACRO_BEGIN													\
	(delta) = (typeof(delta))timer_delta(&(thread)->system_timer,			\
							&(thread)->system_timer_save);	\
	(delta) += (typeof(delta))timer_delta(&(thread)->user_timer,			\
							&(thread)->user_timer_save);	\
MACRO_END

#endif	/* _KERN_SCHED_H_ */
Commit	Line	Data
1c79356b	1	/*
b0d623f7	2	* Copyright (c) 2000-2009 Apple Inc. All rights reserved.
1c79356b	3	*
2d21ac55	4	* @APPLE_OSREFERENCE_LICENSE_HEADER_START@
1c79356b	5	*
2d21ac55 A	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.
8f6c56a5	14	*
2d21ac55 A	15	* Please obtain a copy of the License at
	16	* http://www.opensource.apple.com/apsl/ and read it before using this file.
	17	*
	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
8f6c56a5 A	20	* EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
8f6c56a5 A	21	* INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
2d21ac55 A	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.
8f6c56a5	25	*
2d21ac55	26	* @APPLE_OSREFERENCE_LICENSE_HEADER_END@
1c79356b A	27	*/
	28	/*
	29	* @OSF_COPYRIGHT@
	30	*/
	31	/*
	32	* Mach Operating System
	33	* Copyright (c) 1991,1990,1989,1988,1987 Carnegie Mellon University
	34	* All Rights Reserved.
	35	*
	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.
	41	*
	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.
	45	*
	46	* Carnegie Mellon requests users of this software to return to
	47	*
	48	* Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU
	49	* School of Computer Science
	50	* Carnegie Mellon University
	51	* Pittsburgh PA 15213-3890
	52	*
	53	* any improvements or extensions that they make and grant Carnegie Mellon
	54	* the rights to redistribute these changes.
	55	*/
	56	/*
	57	*/
	58	/*
	59	* File: sched.h
	60	* Author: Avadis Tevanian, Jr.
	61	* Date: 1985
	62	*
	63	* Header file for scheduler.
	64	*
	65	*/
	66
	67	#ifndef _KERN_SCHED_H_
	68	#define _KERN_SCHED_H_
	69
1c79356b A	70	#include <mach/policy.h>
1c79356b A	71	#include <kern/kern_types.h>
5ba3f43e	72	#include <kern/smp.h>
1c79356b	73	#include <kern/queue.h>
1c79356b	74	#include <kern/macro_help.h>
0b4e3aa0	75	#include <kern/timer_call.h>
9bccf70c	76	#include <kern/ast.h>
39037602 A	77	#include <kern/kalloc.h>
39037602 A	78	#include <kern/bits.h>
1c79356b	79
9bccf70c	80	#define NRQS 128 /* 128 levels per run queue */
1c79356b A	81
1c79356b A	82	#define MAXPRI (NRQS-1)
39037602 A	83	#define MINPRI 0 /* lowest legal priority schedulable */
	84	#define IDLEPRI MINPRI /* idle thread priority */
	85	#define NOPRI -1
1c79356b A	86
	87	/*
	88	* High-level priority assignments
	89	*
	90	*************************************************************************
	91	* 127 Reserved (real-time)
	92	* A
	93	* +
	94	* (32 levels)
	95	* +
	96	* V
	97	* 96 Reserved (real-time)
	98	* 95 Kernel mode only
	99	* A
	100	* +
	101	* (16 levels)
	102	* +
	103	* V
	104	* 80 Kernel mode only
0b4e3aa0	105	* 79 System high priority
1c79356b A	106	* A
	107	* +
	108	* (16 levels)
	109	* +
	110	* V
0b4e3aa0	111	* 64 System high priority
1c79356b A	112	* 63 Elevated priorities
	113	* A
	114	* +
	115	* (12 levels)
	116	* +
	117	* V
	118	* 52 Elevated priorities
	119	* 51 Elevated priorities (incl. BSD +nice)
	120	* A
	121	* +
	122	* (20 levels)
	123	* +
	124	* V
	125	* 32 Elevated priorities (incl. BSD +nice)
	126	* 31 Default (default base for threads)
	127	* 30 Lowered priorities (incl. BSD -nice)
	128	* A
	129	* +
	130	* (20 levels)
	131	* +
	132	* V
	133	* 11 Lowered priorities (incl. BSD -nice)
	134	* 10 Lowered priorities (aged pri's)
	135	* A
	136	* +
	137	* (11 levels)
	138	* +
	139	* V
	140	* 0 Lowered priorities (aged pri's / idle)
	141	*************************************************************************
	142	*/
	143
55e303ae	144	#define BASEPRI_RTQUEUES (BASEPRI_REALTIME + 1) /* 97 */
1c79356b A	145	#define BASEPRI_REALTIME (MAXPRI - (NRQS / 4) + 1) /* 96 */
1c79356b A	146
91447636	147	#define MAXPRI_KERNEL (BASEPRI_REALTIME - 1) /* 95 */
5ba3f43e A	148	#define BASEPRI_PREEMPT_HIGH (BASEPRI_PREEMPT + 1) /* 93 */
	149	#define BASEPRI_PREEMPT (MAXPRI_KERNEL - 3) /* 92 */
	150	#define BASEPRI_VM (BASEPRI_PREEMPT - 1) /* 91 */
	151
39037602 A	152	#define BASEPRI_KERNEL (MINPRI_KERNEL + 1) /* 81 */
39037602 A	153	#define MINPRI_KERNEL (MAXPRI_KERNEL - (NRQS / 8) + 1) /* 80 */
1c79356b	154
39037602	155	#define MAXPRI_RESERVED (MINPRI_KERNEL - 1) /* 79 */
39236c6e	156	#define BASEPRI_GRAPHICS (MAXPRI_RESERVED - 3) /* 76 */
39037602	157	#define MINPRI_RESERVED (MAXPRI_RESERVED - (NRQS / 8) + 1) /* 64 */
1c79356b	158
39037602	159	#define MAXPRI_USER (MINPRI_RESERVED - 1) /* 63 */
9bccf70c A	160	#define BASEPRI_CONTROL (BASEPRI_DEFAULT + 17) /* 48 */
	161	#define BASEPRI_FOREGROUND (BASEPRI_DEFAULT + 16) /* 47 */
	162	#define BASEPRI_BACKGROUND (BASEPRI_DEFAULT + 15) /* 46 */
fe8ab488	163	#define BASEPRI_USER_INITIATED (BASEPRI_DEFAULT + 6) /* 37 */
0b4e3aa0	164	#define BASEPRI_DEFAULT (MAXPRI_USER - (NRQS / 4)) /* 31 */
39236c6e	165	#define MAXPRI_SUPPRESSED (BASEPRI_DEFAULT - 3) /* 28 */
fe8ab488	166	#define BASEPRI_UTILITY (BASEPRI_DEFAULT - 11) /* 20 */
39037602 A	167	#define MAXPRI_THROTTLE (MINPRI + 4) /* 4 */
39037602 A	168	#define MINPRI_USER MINPRI /* 0 */
1c79356b	169
39037602	170	#define DEPRESSPRI MINPRI /* depress priority */
fe8ab488	171	#define MAXPRI_PROMOTE (MAXPRI_KERNEL) /* ceiling for mutex promotion */
d1ecb069	172
6d2010ae A	173	/* Type used for thread->sched_mode and saved_mode */
	174	typedef enum {
	175	TH_MODE_NONE = 0, /* unassigned, usually for saved_mode only */
	176	TH_MODE_REALTIME, /* time constraints supplied */
	177	TH_MODE_FIXED, /* use fixed priorities, no decay */
	178	TH_MODE_TIMESHARE, /* use timesharing algorithm */
6d2010ae A	179	} sched_mode_t;
6d2010ae A	180
39037602 A	181	/* Buckets used for load calculation */
	182	typedef enum {
	183	TH_BUCKET_RUN = 0, /* All runnable threads */
	184	TH_BUCKET_FIXPRI, /* Fixed-priority */
	185	TH_BUCKET_SHARE_FG, /* Timeshare thread above BASEPRI_UTILITY */
	186	TH_BUCKET_SHARE_UT, /* Timeshare thread between BASEPRI_UTILITY and MAXPRI_THROTTLE */
	187	TH_BUCKET_SHARE_BG, /* Timeshare thread between MAXPRI_THROTTLE and MINPRI */
	188	TH_BUCKET_MAX,
	189	} sched_bucket_t;
	190
1c79356b A	191	/*
	192	* Macro to check for invalid priorities.
	193	*/
	194	#define invalid_pri(pri) ((pri) < MINPRI \|\| (pri) > MAXPRI)
	195
6d2010ae A	196	struct runq_stats {
	197	uint64_t count_sum;
	198	uint64_t last_change_timestamp;
	199	};
	200
fe8ab488	201	#if defined(CONFIG_SCHED_TIMESHARE_CORE) \|\| defined(CONFIG_SCHED_PROTO)
6d2010ae	202
1c79356b	203	struct run_queue {
1c79356b	204	int highq; /* highest runnable queue */
39037602	205	bitmap_t bitmap[BITMAP_LEN(NRQS)]; /* run queue bitmap array */
55e303ae	206	int count; /* # of threads total */
9bccf70c	207	int urgency; /* level of preemption urgency */
55e303ae	208	queue_head_t queues[NRQS]; /* one for each priority */
6d2010ae A	209
6d2010ae A	210	struct runq_stats runq_stats;
1c79356b A	211	};
1c79356b A	212
39037602 A	213	inline static void
	214	rq_bitmap_set(bitmap_t *map, u_int n)
	215	{
	216	assert(n < NRQS);
	217	bitmap_set(map, n);
	218	}
	219
	220	inline static void
	221	rq_bitmap_clear(bitmap_t *map, u_int n)
	222	{
	223	assert(n < NRQS);
	224	bitmap_clear(map, n);
	225	}
	226
fe8ab488	227	#endif /* defined(CONFIG_SCHED_TIMESHARE_CORE) \|\| defined(CONFIG_SCHED_PROTO) */
1c79356b	228
6d2010ae	229	struct rt_queue {
5ba3f43e	230	_Atomic int count; /* # of threads total */
6d2010ae	231	queue_head_t queue; /* all runnable RT threads */
5ba3f43e A	232	#if __SMP__
	233	decl_simple_lock_data(,rt_lock)
	234	#endif
6d2010ae A	235	struct runq_stats runq_stats;
6d2010ae A	236	};
5ba3f43e	237	typedef struct rt_queue *rt_queue_t;
6d2010ae	238
6d2010ae	239	#if defined(CONFIG_SCHED_GRRR_CORE)
1c79356b A	240
1c79356b A	241	/*
6d2010ae A	242	* We map standard Mach priorities to an abstract scale that more properly
6d2010ae A	243	* indicates how we want processor time allocated under contention.
1c79356b	244	*/
6d2010ae A	245	typedef uint8_t grrr_proportional_priority_t;
	246	typedef uint8_t grrr_group_index_t;
	247
	248	#define NUM_GRRR_PROPORTIONAL_PRIORITIES 256
	249	#define MAX_GRRR_PROPORTIONAL_PRIORITY ((grrr_proportional_priority_t)255)
	250
	251	#if 0
	252	#define NUM_GRRR_GROUPS 8 /* log(256) */
	253	#endif
	254
	255	#define NUM_GRRR_GROUPS 64 /* 256/4 */
	256
	257	struct grrr_group {
	258	queue_chain_t priority_order; /* next greatest weight group */
	259	grrr_proportional_priority_t minpriority;
	260	grrr_group_index_t index;
	261
	262	queue_head_t clients;
	263	int count;
	264	uint32_t weight;
	265	#if 0
	266	uint32_t deferred_removal_weight;
	267	#endif
	268	uint32_t work;
	269	thread_t current_client;
	270	};
	271
	272	struct grrr_run_queue {
	273	int count;
	274	uint32_t last_rescale_tick;
	275	struct grrr_group groups[NUM_GRRR_GROUPS];
	276	queue_head_t sorted_group_list;
	277	uint32_t weight;
	278	grrr_group_t current_group;
	279
	280	struct runq_stats runq_stats;
	281	};
	282
	283	#endif /* defined(CONFIG_SCHED_GRRR_CORE) */
	284
5ba3f43e A	285	extern int rt_runq_count(processor_set_t);
	286	extern void rt_runq_count_incr(processor_set_t);
	287	extern void rt_runq_count_decr(processor_set_t);
6d2010ae	288
fe8ab488 A	289	#if defined(CONFIG_SCHED_MULTIQ)
	290	sched_group_t sched_group_create(void);
	291	void sched_group_destroy(sched_group_t sched_group);
3e170ce0	292	#endif /* defined(CONFIG_SCHED_MULTIQ) */
fe8ab488	293
fe8ab488	294
fe8ab488	295
6d2010ae A	296	/*
	297	* Scheduler routines.
	298	*/
1c79356b	299
0b4e3aa0 A	300	/* Handle quantum expiration for an executing thread */
	301	extern void thread_quantum_expire(
	302	timer_call_param_t processor,
	303	timer_call_param_t thread);
	304
c910b4d9	305	/* Context switch check for current processor */
fe8ab488 A	306	extern ast_t csw_check(processor_t processor,
fe8ab488 A	307	ast_t check_reason);
9bccf70c	308
fe8ab488	309	#if defined(CONFIG_SCHED_TIMESHARE_CORE)
0b4e3aa0 A	310	extern uint32_t std_quantum, min_std_quantum;
0b4e3aa0 A	311	extern uint32_t std_quantum_us;
fe8ab488	312	#endif /* CONFIG_SCHED_TIMESHARE_CORE */
6d2010ae A	313
	314	extern uint32_t thread_depress_time;
	315	extern uint32_t default_timeshare_computation;
	316	extern uint32_t default_timeshare_constraint;
1c79356b	317
0b4e3aa0	318	extern uint32_t max_rt_quantum, min_rt_quantum;
1c79356b	319
316670eb A	320	extern int default_preemption_rate;
316670eb A	321	extern int default_bg_preemption_rate;
91447636	322
fe8ab488	323	#if defined(CONFIG_SCHED_TIMESHARE_CORE)
6d2010ae	324
1c79356b	325	/*
39236c6e A	326	* Age usage at approximately (1 << SCHED_TICK_SHIFT) times per second
	327	* Aging may be deferred during periods where all processors are idle
	328	* and cumulatively applied during periods of activity.
1c79356b	329	*/
91447636	330	#define SCHED_TICK_SHIFT 3
39236c6e	331	#define SCHED_TICK_MAX_DELTA (8)
91447636 A	332
	333	extern unsigned sched_tick;
	334	extern uint32_t sched_tick_interval;
	335
fe8ab488	336	#endif /* CONFIG_SCHED_TIMESHARE_CORE */
6d2010ae A	337
	338	extern uint64_t sched_one_second_interval;
	339
91447636	340	/* Periodic computation of various averages */
39236c6e	341	extern void compute_averages(uint64_t);
1c79356b	342
91447636 A	343	extern void compute_averunnable(
	344	void *nrun);
	345
	346	extern void compute_stack_target(
	347	void *arg);
1c79356b	348
b0d623f7 A	349	extern void compute_memory_pressure(
	350	void *arg);
	351
316670eb A	352	extern void compute_pageout_gc_throttle(
	353	void *arg);
	354
6d2010ae A	355	extern void compute_pmap_gc_throttle(
	356	void *arg);
	357
1c79356b	358	/*
91447636 A	359	* Conversion factor from usage
	360	* to priority.
	361	*/
fe8ab488	362	#if defined(CONFIG_SCHED_TIMESHARE_CORE)
39037602 A	363
	364	#define MAX_LOAD (NRQS - 1)
	365	extern uint32_t sched_pri_shifts[TH_BUCKET_MAX];
2d21ac55	366	extern uint32_t sched_fixed_shift;
91447636	367	extern int8_t sched_load_shifts[NRQS];
39236c6e	368	extern uint32_t sched_decay_usage_age_factor;
490019cf	369	void sched_timeshare_consider_maintenance(uint64_t ctime);
fe8ab488	370	#endif /* CONFIG_SCHED_TIMESHARE_CORE */
1c79356b	371
490019cf A	372	void sched_consider_recommended_cores(uint64_t ctime, thread_t thread);
490019cf A	373
91447636	374	extern int32_t sched_poll_yield_shift;
6d2010ae	375	extern uint64_t sched_safe_duration;
1c79356b	376
2d21ac55 A	377	extern uint32_t sched_load_average, sched_mach_factor;
	378
	379	extern uint32_t avenrun[3], mach_factor[3];
	380
91447636 A	381	extern uint64_t max_unsafe_computation;
91447636 A	382	extern uint64_t max_poll_computation;
1c79356b	383
39037602	384	extern volatile uint32_t sched_run_buckets[TH_BUCKET_MAX];
39236c6e	385
39037602 A	386	extern uint32_t sched_run_incr(thread_t thread);
39037602 A	387	extern uint32_t sched_run_decr(thread_t thread);
fe8ab488	388
1c79356b A	389	/*
	390	* thread_timer_delta macro takes care of both thread timers.
	391	*/
91447636	392	#define thread_timer_delta(thread, delta) \
1c79356b	393	MACRO_BEGIN \
b0d623f7	394	(delta) = (typeof(delta))timer_delta(&(thread)->system_timer, \
91447636	395	&(thread)->system_timer_save); \
b0d623f7	396	(delta) += (typeof(delta))timer_delta(&(thread)->user_timer, \
91447636	397	&(thread)->user_timer_save); \
1c79356b A	398	MACRO_END
1c79356b A	399
1c79356b	400	#endif /* _KERN_SCHED_H_ */