[apple/xnu.git] / osfmk / kern / mk_sp.c

/*
 * Copyright (c) 2000-2007 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@
 * 
 */

/* The routines in this module are all obsolete */

#include <mach/boolean.h>
#include <mach/thread_switch.h>
#include <ipc/ipc_port.h>
#include <ipc/ipc_space.h>
#include <kern/ipc_kobject.h>
#include <kern/processor.h>
#include <kern/sched.h>
#include <kern/sched_prim.h>
#include <kern/spl.h>
#include <kern/task.h>
#include <kern/thread.h>
#include <mach/policy.h>

#include <kern/syscall_subr.h>
#include <mach/mach_host_server.h>
#include <mach/mach_syscalls.h>

#include <kern/misc_protos.h>
#include <kern/spl.h>
#include <kern/sched.h>
#include <kern/sched_prim.h>
#include <kern/assert.h>
#include <kern/thread.h>
#include <mach/mach_host_server.h>
#include <mach/thread_act_server.h>
#include <mach/host_priv_server.h>

/*
 *	thread_policy_common:
 *
 *	Set scheduling policy & priority for thread.
 */
static kern_return_t
thread_policy_common(
	thread_t		thread,
	integer_t		policy,
	integer_t		priority)
{
	spl_t			s;

	if (	thread == THREAD_NULL		||
			invalid_policy(policy)		)
		return(KERN_INVALID_ARGUMENT);

	if (thread->static_param)
		return (KERN_SUCCESS);

	if ((policy == POLICY_TIMESHARE)
		&& !SCHED(supports_timeshare_mode)())
		policy = TH_MODE_FIXED;

	s = splsched();
	thread_lock(thread);

	if (	(thread->sched_mode != TH_MODE_REALTIME)	&&
			(thread->saved_mode != TH_MODE_REALTIME)		) {
		if (!(thread->sched_flags & TH_SFLAG_DEMOTED_MASK)) {
			boolean_t	oldmode = thread->sched_mode == TH_MODE_TIMESHARE;

			if (policy == POLICY_TIMESHARE && !oldmode) {
				thread->sched_mode = TH_MODE_TIMESHARE;

				if ((thread->state & (TH_RUN|TH_IDLE)) == TH_RUN) {
					sched_share_incr();

					if (thread->max_priority <= MAXPRI_THROTTLE)
						sched_background_incr();
				}
			}
			else
			if (policy != POLICY_TIMESHARE && oldmode) {
				thread->sched_mode = TH_MODE_FIXED;

				if ((thread->state & (TH_RUN|TH_IDLE)) == TH_RUN) {
					if (thread->max_priority <= MAXPRI_THROTTLE)
						sched_background_decr();

					sched_share_decr();
				}
			}
		}
		else {
			if (policy == POLICY_TIMESHARE)
				thread->saved_mode = TH_MODE_TIMESHARE;
			else
				thread->saved_mode = TH_MODE_FIXED;
		}

		if (priority >= thread->max_priority)
			priority = thread->max_priority - thread->task_priority;
		else
		if (priority >= MINPRI_KERNEL)
			priority -= MINPRI_KERNEL;
		else
		if (priority >= MINPRI_RESERVED)
			priority -= MINPRI_RESERVED;
		else
			priority -= BASEPRI_DEFAULT;

		priority += thread->task_priority;

		if (priority > thread->max_priority)
			priority = thread->max_priority;
		else
		if (priority < MINPRI)
			priority = MINPRI;

		thread->importance = priority - thread->task_priority;


		set_priority(thread, priority);
	}

	thread_unlock(thread);
	splx(s);

	return (KERN_SUCCESS);
}

/*
 *	thread_set_policy
 *
 *	Set scheduling policy and parameters, both base and limit, for 
 *	the given thread. Policy can be any policy implemented by the
 *	processor set, whether enabled or not. 
 */
kern_return_t
thread_set_policy(
	thread_t				thread,
	processor_set_t			pset,
	policy_t				policy,
	policy_base_t			base,
	mach_msg_type_number_t	base_count,
	policy_limit_t			limit,
	mach_msg_type_number_t	limit_count)
{
	int 					max, bas;
	kern_return_t			result = KERN_SUCCESS;

	if (	thread == THREAD_NULL			||
			pset == PROCESSOR_SET_NULL || pset != &pset0)
		return (KERN_INVALID_ARGUMENT);

	thread_mtx_lock(thread);

	switch (policy) {

	case POLICY_RR:
	{
		policy_rr_base_t		rr_base = (policy_rr_base_t) base;
		policy_rr_limit_t		rr_limit = (policy_rr_limit_t) limit;

		if (	base_count != POLICY_RR_BASE_COUNT		||
				limit_count != POLICY_RR_LIMIT_COUNT		) {
			result = KERN_INVALID_ARGUMENT;
			break;
		}

		bas = rr_base->base_priority;
		max = rr_limit->max_priority;
		if (invalid_pri(bas) || invalid_pri(max)) {
			result = KERN_INVALID_ARGUMENT;
			break;
		}

		break;
	}

	case POLICY_FIFO:
	{
		policy_fifo_base_t		fifo_base = (policy_fifo_base_t) base;
		policy_fifo_limit_t		fifo_limit = (policy_fifo_limit_t) limit;

		if (	base_count != POLICY_FIFO_BASE_COUNT	||
				limit_count != POLICY_FIFO_LIMIT_COUNT)		{
			result = KERN_INVALID_ARGUMENT;
			break;
		}

		bas = fifo_base->base_priority;
		max = fifo_limit->max_priority;
		if (invalid_pri(bas) || invalid_pri(max)) {
			result = KERN_INVALID_ARGUMENT;
			break;
		}

		break;
	}

	case POLICY_TIMESHARE:
	{
		policy_timeshare_base_t		ts_base = (policy_timeshare_base_t) base;
		policy_timeshare_limit_t	ts_limit =
						(policy_timeshare_limit_t) limit;

		if (	base_count != POLICY_TIMESHARE_BASE_COUNT		||
				limit_count != POLICY_TIMESHARE_LIMIT_COUNT			) {
			result = KERN_INVALID_ARGUMENT;
			break;
		}

		bas = ts_base->base_priority;
		max = ts_limit->max_priority;
		if (invalid_pri(bas) || invalid_pri(max)) {
			result = KERN_INVALID_ARGUMENT;
			break;
		}

		break;
	}

	default:
		result = KERN_INVALID_POLICY;
	}

	if (result != KERN_SUCCESS) {
		thread_mtx_unlock(thread);

		return (result);
	}

	result = thread_policy_common(thread, policy, bas);

	thread_mtx_unlock(thread);

	return (result);
}


/*
 * 	thread_policy
 *
 *	Set scheduling policy and parameters, both base and limit, for
 *	the given thread. Policy must be a policy which is enabled for the
 *	processor set. Change contained threads if requested. 
 */
kern_return_t
thread_policy(
	thread_t				thread,
	policy_t				policy,
	policy_base_t			base,
	mach_msg_type_number_t	count,
	boolean_t				set_limit)
{
	kern_return_t			result = KERN_SUCCESS;
	processor_set_t			pset = &pset0;
	policy_limit_t			limit = NULL;
	int						limcount = 0;
	policy_rr_limit_data_t			rr_limit;
	policy_fifo_limit_data_t		fifo_limit;
	policy_timeshare_limit_data_t	ts_limit;
	
	if (thread == THREAD_NULL)
		return (KERN_INVALID_ARGUMENT);

	thread_mtx_lock(thread);

	if (	invalid_policy(policy)											||
			((POLICY_TIMESHARE | POLICY_RR | POLICY_FIFO) & policy) == 0	) {
		thread_mtx_unlock(thread);

		return (KERN_INVALID_POLICY);
	}

	if (set_limit) {
		/*
	 	 * 	Set scheduling limits to base priority.
		 */
		switch (policy) {

		case POLICY_RR:
		{
			policy_rr_base_t rr_base;

			if (count != POLICY_RR_BASE_COUNT) {
				result = KERN_INVALID_ARGUMENT;
				break;
			}

			limcount = POLICY_RR_LIMIT_COUNT;
			rr_base = (policy_rr_base_t) base;
			rr_limit.max_priority = rr_base->base_priority;
			limit = (policy_limit_t) &rr_limit;

			break;
		}

		case POLICY_FIFO:
		{
			policy_fifo_base_t fifo_base;

			if (count != POLICY_FIFO_BASE_COUNT) {
				result = KERN_INVALID_ARGUMENT;
				break;
			}

			limcount = POLICY_FIFO_LIMIT_COUNT;
			fifo_base = (policy_fifo_base_t) base;
			fifo_limit.max_priority = fifo_base->base_priority;
			limit = (policy_limit_t) &fifo_limit;

			break;
		}

		case POLICY_TIMESHARE:
		{
			policy_timeshare_base_t ts_base;

			if (count != POLICY_TIMESHARE_BASE_COUNT) {
				result = KERN_INVALID_ARGUMENT;
				break;
			}

			limcount = POLICY_TIMESHARE_LIMIT_COUNT;
			ts_base = (policy_timeshare_base_t) base;
			ts_limit.max_priority = ts_base->base_priority;
			limit = (policy_limit_t) &ts_limit;

			break;
		}

		default:
			result = KERN_INVALID_POLICY;
			break;
		}

	}
	else {
		/*
		 *	Use current scheduling limits. Ensure that the
		 *	new base priority will not exceed current limits.
		 */
		switch (policy) {

		case POLICY_RR:
		{
			policy_rr_base_t rr_base;

			if (count != POLICY_RR_BASE_COUNT) {
				result = KERN_INVALID_ARGUMENT;
				break;
			}

			limcount = POLICY_RR_LIMIT_COUNT;
			rr_base = (policy_rr_base_t) base;
			if (rr_base->base_priority > thread->max_priority) {
				result = KERN_POLICY_LIMIT;
				break;
			}

			rr_limit.max_priority = thread->max_priority;
			limit = (policy_limit_t) &rr_limit;

			break;
		}

		case POLICY_FIFO:
		{
			policy_fifo_base_t fifo_base;

			if (count != POLICY_FIFO_BASE_COUNT) {
				result = KERN_INVALID_ARGUMENT;
				break;
			}

			limcount = POLICY_FIFO_LIMIT_COUNT;
			fifo_base = (policy_fifo_base_t) base;
			if (fifo_base->base_priority > thread->max_priority) {
				result = KERN_POLICY_LIMIT;
				break;
			}

			fifo_limit.max_priority = thread->max_priority;
			limit = (policy_limit_t) &fifo_limit;

			break;
		}

		case POLICY_TIMESHARE:
		{
			policy_timeshare_base_t ts_base;

			if (count != POLICY_TIMESHARE_BASE_COUNT) {
				result = KERN_INVALID_ARGUMENT;
				break;
			}

			limcount = POLICY_TIMESHARE_LIMIT_COUNT;
			ts_base = (policy_timeshare_base_t) base;
			if (ts_base->base_priority > thread->max_priority) {
				result = KERN_POLICY_LIMIT;
				break;
			}

			ts_limit.max_priority = thread->max_priority;
			limit = (policy_limit_t) &ts_limit;

			break;
		}

		default:
			result = KERN_INVALID_POLICY;
			break;
		}

	}

	thread_mtx_unlock(thread);

	if (result == KERN_SUCCESS)
	    result = thread_set_policy(thread, pset,
					 policy, base, count, limit, limcount);

	return(result);
}
Commit	Line	Data
1c79356b	1	/*
2d21ac55	2	* Copyright (c) 2000-2007 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
91447636	33	/* The routines in this module are all obsolete */
1c79356b A	34
	35	#include <mach/boolean.h>
	36	#include <mach/thread_switch.h>
	37	#include <ipc/ipc_port.h>
	38	#include <ipc/ipc_space.h>
	39	#include <kern/ipc_kobject.h>
	40	#include <kern/processor.h>
	41	#include <kern/sched.h>
	42	#include <kern/sched_prim.h>
	43	#include <kern/spl.h>
	44	#include <kern/task.h>
	45	#include <kern/thread.h>
1c79356b A	46	#include <mach/policy.h>
	47
	48	#include <kern/syscall_subr.h>
	49	#include <mach/mach_host_server.h>
	50	#include <mach/mach_syscalls.h>
	51
1c79356b A	52	#include <kern/misc_protos.h>
	53	#include <kern/spl.h>
	54	#include <kern/sched.h>
	55	#include <kern/sched_prim.h>
	56	#include <kern/assert.h>
	57	#include <kern/thread.h>
	58	#include <mach/mach_host_server.h>
1c79356b A	59	#include <mach/thread_act_server.h>
	60	#include <mach/host_priv_server.h>
	61
1c79356b A	62	/*
	63	* thread_policy_common:
	64	*
0b4e3aa0	65	* Set scheduling policy & priority for thread.
1c79356b	66	*/
0b4e3aa0	67	static kern_return_t
1c79356b A	68	thread_policy_common(
	69	thread_t thread,
	70	integer_t policy,
0b4e3aa0	71	integer_t priority)
1c79356b	72	{
1c79356b A	73	spl_t s;
	74
	75	if ( thread == THREAD_NULL \|\|
	76	invalid_policy(policy) )
	77	return(KERN_INVALID_ARGUMENT);
	78
2d21ac55 A	79	if (thread->static_param)
	80	return (KERN_SUCCESS);
	81
6d2010ae A	82	if ((policy == POLICY_TIMESHARE)
	83	&& !SCHED(supports_timeshare_mode)())
	84	policy = TH_MODE_FIXED;
	85
1c79356b A	86	s = splsched();
	87	thread_lock(thread);
	88
6d2010ae A	89	if ( (thread->sched_mode != TH_MODE_REALTIME) &&
	90	(thread->saved_mode != TH_MODE_REALTIME) ) {
	91	if (!(thread->sched_flags & TH_SFLAG_DEMOTED_MASK)) {
	92	boolean_t oldmode = thread->sched_mode == TH_MODE_TIMESHARE;
55e303ae A	93
55e303ae A	94	if (policy == POLICY_TIMESHARE && !oldmode) {
6d2010ae	95	thread->sched_mode = TH_MODE_TIMESHARE;
55e303ae	96
39236c6e	97	if ((thread->state & (TH_RUN\|TH_IDLE)) == TH_RUN) {
2d21ac55	98	sched_share_incr();
39236c6e A	99
	100	if (thread->max_priority <= MAXPRI_THROTTLE)
	101	sched_background_incr();
	102	}
55e303ae	103	}
0b4e3aa0	104	else
55e303ae	105	if (policy != POLICY_TIMESHARE && oldmode) {
6d2010ae	106	thread->sched_mode = TH_MODE_FIXED;
55e303ae	107
39236c6e A	108	if ((thread->state & (TH_RUN\|TH_IDLE)) == TH_RUN) {
	109	if (thread->max_priority <= MAXPRI_THROTTLE)
	110	sched_background_decr();
	111
2d21ac55	112	sched_share_decr();
39236c6e	113	}
55e303ae	114	}
0b4e3aa0 A	115	}
	116	else {
	117	if (policy == POLICY_TIMESHARE)
6d2010ae	118	thread->saved_mode = TH_MODE_TIMESHARE;
0b4e3aa0	119	else
6d2010ae	120	thread->saved_mode = TH_MODE_FIXED;
0b4e3aa0 A	121	}
	122
	123	if (priority >= thread->max_priority)
	124	priority = thread->max_priority - thread->task_priority;
	125	else
	126	if (priority >= MINPRI_KERNEL)
	127	priority -= MINPRI_KERNEL;
	128	else
91447636 A	129	if (priority >= MINPRI_RESERVED)
91447636 A	130	priority -= MINPRI_RESERVED;
0b4e3aa0 A	131	else
	132	priority -= BASEPRI_DEFAULT;
	133
	134	priority += thread->task_priority;
	135
	136	if (priority > thread->max_priority)
	137	priority = thread->max_priority;
9bccf70c A	138	else
	139	if (priority < MINPRI)
	140	priority = MINPRI;
0b4e3aa0	141
316670eb A	142	thread->importance = priority - thread->task_priority;
316670eb A	143
6d2010ae	144
9bccf70c	145	set_priority(thread, priority);
1c79356b A	146	}
	147
	148	thread_unlock(thread);
	149	splx(s);
	150
0b4e3aa0	151	return (KERN_SUCCESS);
1c79356b A	152	}
	153
	154	/*
	155	* thread_set_policy
	156	*
	157	* Set scheduling policy and parameters, both base and limit, for
	158	* the given thread. Policy can be any policy implemented by the
	159	* processor set, whether enabled or not.
	160	*/
	161	kern_return_t
	162	thread_set_policy(
91447636	163	thread_t thread,
1c79356b A	164	processor_set_t pset,
	165	policy_t policy,
	166	policy_base_t base,
	167	mach_msg_type_number_t base_count,
	168	policy_limit_t limit,
	169	mach_msg_type_number_t limit_count)
	170	{
0b4e3aa0	171	int max, bas;
1c79356b A	172	kern_return_t result = KERN_SUCCESS;
1c79356b A	173
91447636	174	if ( thread == THREAD_NULL \|\|
2d21ac55	175	pset == PROCESSOR_SET_NULL \|\| pset != &pset0)
1c79356b A	176	return (KERN_INVALID_ARGUMENT);
1c79356b A	177
91447636	178	thread_mtx_lock(thread);
1c79356b	179
1c79356b A	180	switch (policy) {
	181
	182	case POLICY_RR:
	183	{
	184	policy_rr_base_t rr_base = (policy_rr_base_t) base;
	185	policy_rr_limit_t rr_limit = (policy_rr_limit_t) limit;
	186
	187	if ( base_count != POLICY_RR_BASE_COUNT \|\|
	188	limit_count != POLICY_RR_LIMIT_COUNT ) {
	189	result = KERN_INVALID_ARGUMENT;
	190	break;
	191	}
	192
1c79356b A	193	bas = rr_base->base_priority;
	194	max = rr_limit->max_priority;
	195	if (invalid_pri(bas) \|\| invalid_pri(max)) {
	196	result = KERN_INVALID_ARGUMENT;
	197	break;
	198	}
	199
	200	break;
	201	}
	202
	203	case POLICY_FIFO:
	204	{
	205	policy_fifo_base_t fifo_base = (policy_fifo_base_t) base;
	206	policy_fifo_limit_t fifo_limit = (policy_fifo_limit_t) limit;
	207
	208	if ( base_count != POLICY_FIFO_BASE_COUNT \|\|
	209	limit_count != POLICY_FIFO_LIMIT_COUNT) {
	210	result = KERN_INVALID_ARGUMENT;
	211	break;
	212	}
	213
1c79356b A	214	bas = fifo_base->base_priority;
	215	max = fifo_limit->max_priority;
	216	if (invalid_pri(bas) \|\| invalid_pri(max)) {
	217	result = KERN_INVALID_ARGUMENT;
	218	break;
	219	}
	220
	221	break;
	222	}
	223
	224	case POLICY_TIMESHARE:
	225	{
	226	policy_timeshare_base_t ts_base = (policy_timeshare_base_t) base;
	227	policy_timeshare_limit_t ts_limit =
	228	(policy_timeshare_limit_t) limit;
	229
	230	if ( base_count != POLICY_TIMESHARE_BASE_COUNT \|\|
	231	limit_count != POLICY_TIMESHARE_LIMIT_COUNT ) {
	232	result = KERN_INVALID_ARGUMENT;
	233	break;
	234	}
	235
1c79356b A	236	bas = ts_base->base_priority;
	237	max = ts_limit->max_priority;
	238	if (invalid_pri(bas) \|\| invalid_pri(max)) {
	239	result = KERN_INVALID_ARGUMENT;
	240	break;
	241	}
	242
	243	break;
	244	}
	245
	246	default:
	247	result = KERN_INVALID_POLICY;
	248	}
	249
	250	if (result != KERN_SUCCESS) {
91447636	251	thread_mtx_unlock(thread);
1c79356b	252
91447636	253	return (result);
1c79356b A	254	}
1c79356b A	255
0b4e3aa0	256	result = thread_policy_common(thread, policy, bas);
1c79356b	257
91447636 A	258	thread_mtx_unlock(thread);
	259
	260	return (result);
1c79356b A	261	}
	262
	263
	264	/*
	265	* thread_policy
	266	*
	267	* Set scheduling policy and parameters, both base and limit, for
	268	* the given thread. Policy must be a policy which is enabled for the
	269	* processor set. Change contained threads if requested.
	270	*/
	271	kern_return_t
	272	thread_policy(
91447636	273	thread_t thread,
1c79356b A	274	policy_t policy,
	275	policy_base_t base,
	276	mach_msg_type_number_t count,
	277	boolean_t set_limit)
	278	{
1c79356b	279	kern_return_t result = KERN_SUCCESS;
2d21ac55 A	280	processor_set_t pset = &pset0;
	281	policy_limit_t limit = NULL;
	282	int limcount = 0;
1c79356b A	283	policy_rr_limit_data_t rr_limit;
	284	policy_fifo_limit_data_t fifo_limit;
	285	policy_timeshare_limit_data_t ts_limit;
	286
91447636	287	if (thread == THREAD_NULL)
1c79356b A	288	return (KERN_INVALID_ARGUMENT);
1c79356b A	289
91447636 A	290	thread_mtx_lock(thread);
91447636 A	291
0b4e3aa0 A	292	if ( invalid_policy(policy) \|\|
0b4e3aa0 A	293	((POLICY_TIMESHARE \| POLICY_RR \| POLICY_FIFO) & policy) == 0 ) {
91447636	294	thread_mtx_unlock(thread);
1c79356b	295
91447636	296	return (KERN_INVALID_POLICY);
1c79356b A	297	}
	298
	299	if (set_limit) {
	300	/*
	301	* Set scheduling limits to base priority.
	302	*/
	303	switch (policy) {
	304
	305	case POLICY_RR:
	306	{
	307	policy_rr_base_t rr_base;
	308
	309	if (count != POLICY_RR_BASE_COUNT) {
	310	result = KERN_INVALID_ARGUMENT;
	311	break;
	312	}
	313
	314	limcount = POLICY_RR_LIMIT_COUNT;
	315	rr_base = (policy_rr_base_t) base;
	316	rr_limit.max_priority = rr_base->base_priority;
	317	limit = (policy_limit_t) &rr_limit;
	318
	319	break;
	320	}
	321
	322	case POLICY_FIFO:
	323	{
	324	policy_fifo_base_t fifo_base;
	325
	326	if (count != POLICY_FIFO_BASE_COUNT) {
	327	result = KERN_INVALID_ARGUMENT;
	328	break;
	329	}
	330
	331	limcount = POLICY_FIFO_LIMIT_COUNT;
	332	fifo_base = (policy_fifo_base_t) base;
	333	fifo_limit.max_priority = fifo_base->base_priority;
	334	limit = (policy_limit_t) &fifo_limit;
	335
	336	break;
	337	}
	338
	339	case POLICY_TIMESHARE:
	340	{
	341	policy_timeshare_base_t ts_base;
	342
	343	if (count != POLICY_TIMESHARE_BASE_COUNT) {
	344	result = KERN_INVALID_ARGUMENT;
	345	break;
	346	}
	347
	348	limcount = POLICY_TIMESHARE_LIMIT_COUNT;
	349	ts_base = (policy_timeshare_base_t) base;
	350	ts_limit.max_priority = ts_base->base_priority;
	351	limit = (policy_limit_t) &ts_limit;
	352
	353	break;
	354	}
	355
	356	default:
	357	result = KERN_INVALID_POLICY;
	358	break;
	359	}
	360
361	}
362	else {
363	/*
364	* Use current scheduling limits. Ensure that the
365	* new base priority will not exceed current limits.
366	*/
367	switch (policy) {
368
369	case POLICY_RR:
370	{
371	policy_rr_base_t rr_base;
372
373	if (count != POLICY_RR_BASE_COUNT) {
374	result = KERN_INVALID_ARGUMENT;
375	break;
376	}
377
378	limcount = POLICY_RR_LIMIT_COUNT;
379	rr_base = (policy_rr_base_t) base;
380	if (rr_base->base_priority > thread->max_priority) {
381	result = KERN_POLICY_LIMIT;
382	break;
383	}
384
385	rr_limit.max_priority = thread->max_priority;
386	limit = (policy_limit_t) &rr_limit;
387
388	break;
389	}
390
391	case POLICY_FIFO:
392	{
393	policy_fifo_base_t fifo_base;
394
395	if (count != POLICY_FIFO_BASE_COUNT) {
396	result = KERN_INVALID_ARGUMENT;
397	break;
398	}
399
400	limcount = POLICY_FIFO_LIMIT_COUNT;
401	fifo_base = (policy_fifo_base_t) base;
402	if (fifo_base->base_priority > thread->max_priority) {
403	result = KERN_POLICY_LIMIT;
404	break;
405	}
406
407	fifo_limit.max_priority = thread->max_priority;
408	limit = (policy_limit_t) &fifo_limit;
409
410	break;
411	}
412
413	case POLICY_TIMESHARE:
414	{
415	policy_timeshare_base_t ts_base;
416
417	if (count != POLICY_TIMESHARE_BASE_COUNT) {
418	result = KERN_INVALID_ARGUMENT;
419	break;
420	}
421
422	limcount = POLICY_TIMESHARE_LIMIT_COUNT;
423	ts_base = (policy_timeshare_base_t) base;
424	if (ts_base->base_priority > thread->max_priority) {
425	result = KERN_POLICY_LIMIT;
426	break;
427	}
428
429	ts_limit.max_priority = thread->max_priority;
430	limit = (policy_limit_t) &ts_limit;
431
432	break;
433	}
434
435	default:
436	result = KERN_INVALID_POLICY;
437	break;
438	}
439
440	}
441
91447636	442	thread_mtx_unlock(thread);
1c79356b A	443
1c79356b A	444	if (result == KERN_SUCCESS)
91447636	445	result = thread_set_policy(thread, pset,
1c79356b A	446	policy, base, count, limit, limcount);
	447
	448	return(result);
	449	}