[apple/xnu.git] / bsd / kern / kern_synch.c

/*
 * Copyright (c) 2000-2006 Apple Computer, 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@
 */
/* 
 * Mach Operating System
 * Copyright (c) 1987 Carnegie-Mellon University
 * All rights reserved.  The CMU software License Agreement specifies
 * the terms and conditions for use and redistribution.
 */

#include <sys/param.h>
#include <sys/systm.h>
#include <sys/proc_internal.h>
#include <sys/user.h>
#include <sys/file_internal.h>
#include <sys/vnode.h>
#include <sys/kernel.h>

#include <machine/spl.h>

#include <kern/queue.h>
#include <sys/lock.h>
#include <kern/thread.h>
#include <kern/sched_prim.h>
#include <kern/ast.h>

#include <kern/cpu_number.h>
#include <vm/vm_kern.h>

#include <kern/task.h>
#include <mach/time_value.h>
#include <kern/lock.h>

#include <sys/systm.h>			/* for unix_syscall_return() */
#include <libkern/OSAtomic.h>

extern boolean_t thread_should_abort(thread_t);	/* XXX */
extern void compute_averunnable(void *);	/* XXX */


static void
_sleep_continue( __unused void *parameter, wait_result_t wresult)
{
	struct proc *p = current_proc();
	thread_t self  = current_thread();
	struct uthread * ut;
	int sig, catch;
	int error = 0;
	int dropmutex;

	ut = get_bsdthread_info(self);
	catch     = ut->uu_pri & PCATCH;
	dropmutex = ut->uu_pri & PDROP;

	switch (wresult) {
		case THREAD_TIMED_OUT:
			error = EWOULDBLOCK;
			break;
		case THREAD_AWAKENED:
			/*
			 * Posix implies any signal should be delivered
			 * first, regardless of whether awakened due
			 * to receiving event.
			 */
			if (!catch)
				break;
			/* else fall through */
		case THREAD_INTERRUPTED:
			if (catch) {
				if (thread_should_abort(self)) {
					error = EINTR;
				} else if (SHOULDissignal(p,ut)) {
					if ((sig = CURSIG(p)) != 0) {
						if (p->p_sigacts->ps_sigintr & sigmask(sig))
							error = EINTR;
						else
							error = ERESTART;
					}
					if (thread_should_abort(self)) {
						error = EINTR;
					}
				} else if( (ut->uu_flag & ( UT_CANCELDISABLE | UT_CANCEL | UT_CANCELED)) == UT_CANCEL) {
                                        /* due to thread cancel */
                                        error = EINTR;
                                }
			}  else
				error = EINTR;
			break;
	}

	if (error == EINTR || error == ERESTART)
		act_set_astbsd(self);

	if (ut->uu_mtx && !dropmutex)
	        lck_mtx_lock(ut->uu_mtx);

	ut->uu_wchan = NULL;
	ut->uu_wmesg = NULL;

	unix_syscall_return((*ut->uu_continuation)(error));
}

/*
 * Give up the processor till a wakeup occurs
 * on chan, at which time the process
 * enters the scheduling queue at priority pri.
 * The most important effect of pri is that when
 * pri<=PZERO a signal cannot disturb the sleep;
 * if pri>PZERO signals will be processed.
 * If pri&PCATCH is set, signals will cause sleep
 * to return 1, rather than longjmp.
 * Callers of this routine must be prepared for
 * premature return, and check that the reason for
 * sleeping has gone away.
 *
 * if msleep was the entry point, than we have a mutex to deal with
 *
 * The mutex is unlocked before the caller is blocked, and
 * relocked before msleep returns unless the priority includes the PDROP
 * flag... if PDROP is specified, _sleep returns with the mutex unlocked
 * regardless of whether it actually blocked or not.
 */

static int
_sleep(
	caddr_t		chan,
	int		pri,
	const char	*wmsg,
	u_int64_t	abstime,
	int		(*continuation)(int),
        lck_mtx_t	*mtx)
{
	struct proc *p;
	thread_t self = current_thread();
	struct uthread * ut;
	int sig, catch = pri & PCATCH;
	int dropmutex  = pri & PDROP;
	int wait_result;
	int error = 0;

	ut = get_bsdthread_info(self);

	p = current_proc();
	p->p_priority = pri & PRIMASK;
	/* It can still block in proc_exit() after the teardown. */
	if (p->p_stats != NULL)
		OSIncrementAtomic(&p->p_stats->p_ru.ru_nvcsw);

	/* set wait message & channel */
	ut->uu_wchan = chan;
	ut->uu_wmesg = wmsg ? wmsg : "unknown";

	if (mtx != NULL && chan != NULL && (thread_continue_t)continuation == THREAD_CONTINUE_NULL) {

		if (abstime)
			wait_result = lck_mtx_sleep_deadline(mtx, (dropmutex) ? LCK_SLEEP_UNLOCK : 0,
							     chan, (catch) ? THREAD_ABORTSAFE : THREAD_UNINT, abstime);
		else
			wait_result = lck_mtx_sleep(mtx, (dropmutex) ? LCK_SLEEP_UNLOCK : 0,
							     chan, (catch) ? THREAD_ABORTSAFE : THREAD_UNINT);
	}
	else {
		if (chan != NULL)
			assert_wait_deadline(chan, (catch) ? THREAD_ABORTSAFE : THREAD_UNINT, abstime);
		if (mtx)
			lck_mtx_unlock(mtx);
		if (catch) {
			if (SHOULDissignal(p,ut)) {
				if ((sig = CURSIG(p)) != 0) {
					if (clear_wait(self, THREAD_INTERRUPTED) == KERN_FAILURE)
						goto block;
					if (p->p_sigacts->ps_sigintr & sigmask(sig))
						error = EINTR;
					else
						error = ERESTART;
					if (mtx && !dropmutex)
		        			lck_mtx_lock(mtx);
					goto out;
				}
			}
			if (thread_should_abort(self)) {
				if (clear_wait(self, THREAD_INTERRUPTED) == KERN_FAILURE)
					goto block;
				error = EINTR;

				if (mtx && !dropmutex)
				        lck_mtx_lock(mtx);
				goto out;
			}
		}		


block:
		if ((thread_continue_t)continuation != THREAD_CONTINUE_NULL) {
		        ut->uu_continuation = continuation;
			ut->uu_pri  = pri;
			ut->uu_timo = abstime? 1: 0;
			ut->uu_mtx  = mtx;
			(void) thread_block(_sleep_continue);
			/* NOTREACHED */
		}
		
		wait_result = thread_block(THREAD_CONTINUE_NULL);

		if (mtx && !dropmutex)
		        lck_mtx_lock(mtx);
	}

	switch (wait_result) {
		case THREAD_TIMED_OUT:
			error = EWOULDBLOCK;
			break;
		case THREAD_AWAKENED:
			/*
			 * Posix implies any signal should be delivered
			 * first, regardless of whether awakened due
			 * to receiving event.
			 */
			if (!catch)
				break;
			/* else fall through */
		case THREAD_INTERRUPTED:
			if (catch) {
				if (thread_should_abort(self)) {
					error = EINTR;
				} else if (SHOULDissignal(p, ut)) {
					if ((sig = CURSIG(p)) != 0) {
						if (p->p_sigacts->ps_sigintr & sigmask(sig))
							error = EINTR;
						else
							error = ERESTART;
					}
					if (thread_should_abort(self)) {
						error = EINTR;
					}
				}
			}  else
				error = EINTR;
			break;
	}
out:
	if (error == EINTR || error == ERESTART)
		act_set_astbsd(self);
	ut->uu_wchan = NULL;
	ut->uu_wmesg = NULL;

	return (error);
}

int
sleep(
	void	*chan,
	int		pri)
{
	return _sleep((caddr_t)chan, pri, (char *)NULL, 0, (int (*)(int))0, (lck_mtx_t *)0);
}

int
msleep0(
	void		*chan,
	lck_mtx_t	*mtx,
	int		pri,
	const char	*wmsg,
	int		timo,
	int		(*continuation)(int))
{
	u_int64_t	abstime = 0;

	if (timo)
		clock_interval_to_deadline(timo, NSEC_PER_SEC / hz, &abstime);

	return _sleep((caddr_t)chan, pri, wmsg, abstime, continuation, mtx);
}

int
msleep(
	void		*chan,
	lck_mtx_t	*mtx,
	int		pri,
	const char	*wmsg,
	struct timespec		*ts)
{
	u_int64_t	abstime = 0;

	if (ts && (ts->tv_sec || ts->tv_nsec)) {
		nanoseconds_to_absolutetime((uint64_t)ts->tv_sec * NSEC_PER_SEC + ts->tv_nsec,  &abstime );
		clock_absolutetime_interval_to_deadline( abstime, &abstime );
	}

	return _sleep((caddr_t)chan, pri, wmsg, abstime, (int (*)(int))0, mtx);
}

int
msleep1(
	void		*chan,
	lck_mtx_t	*mtx,
	int		pri,
	const char	*wmsg,
	u_int64_t	abstime)
{
	return _sleep((caddr_t)chan, pri, wmsg, abstime, (int (*)(int))0, mtx);
}

int
tsleep(
	void		*chan,
	int		pri,
	const char	*wmsg,
	int		timo)
{
	u_int64_t	abstime = 0;

	if (timo)
		clock_interval_to_deadline(timo, NSEC_PER_SEC / hz, &abstime);
	return _sleep((caddr_t)chan, pri, wmsg, abstime, (int (*)(int))0, (lck_mtx_t *)0);
}

int
tsleep0(
	void		*chan,
	int		pri,
	const char	*wmsg,
	int		timo,
	int		(*continuation)(int))
{			
	u_int64_t	abstime = 0;

	if (timo)
		clock_interval_to_deadline(timo, NSEC_PER_SEC / hz, &abstime);
	return _sleep((caddr_t)chan, pri, wmsg, abstime, continuation, (lck_mtx_t *)0);
}

int
tsleep1(
	void		*chan,
	int		pri,
	const char	*wmsg,
	u_int64_t	abstime,
	int		(*continuation)(int))
{			
	return _sleep((caddr_t)chan, pri, wmsg, abstime, continuation, (lck_mtx_t *)0);
}

/*
 * Wake up all processes sleeping on chan.
 */
void
wakeup(void *chan)
{
	thread_wakeup_prim((caddr_t)chan, FALSE, THREAD_AWAKENED);
}

/*
 * Wake up the first process sleeping on chan.
 *
 * Be very sure that the first process is really
 * the right one to wakeup.
 */
void
wakeup_one(caddr_t chan)
{
	thread_wakeup_prim((caddr_t)chan, TRUE, THREAD_AWAKENED);
}

/*
 * Compute the priority of a process when running in user mode.
 * Arrange to reschedule if the resulting priority is better
 * than that of the current process.
 */
void
resetpriority(struct proc *p)
{
	(void)task_importance(p->task, -p->p_nice);
}

struct loadavg averunnable =
	{ {0, 0, 0}, FSCALE };		/* load average, of runnable procs */
/*
 * Constants for averages over 1, 5, and 15 minutes
 * when sampling at 5 second intervals.
 */
static fixpt_t cexp[3] = {
    (fixpt_t)(0.9200444146293232 * FSCALE),    /* exp(-1/12) */
    (fixpt_t)(0.9834714538216174 * FSCALE),    /* exp(-1/60) */
    (fixpt_t)(0.9944598480048967 * FSCALE),    /* exp(-1/180) */
};

void
compute_averunnable(void *arg)
{
	unsigned int		nrun = *(unsigned int *)arg;
	struct loadavg		*avg = &averunnable;
	int		i;

    for (i = 0; i < 3; i++)
        avg->ldavg[i] = (cexp[i] * avg->ldavg[i] +
            nrun * FSCALE * (FSCALE - cexp[i])) >> FSHIFT;
}
Commit	Line	Data
1c79356b	1	/*
2d21ac55	2	* Copyright (c) 2000-2006 Apple Computer, 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	* Mach Operating System
	30	* Copyright (c) 1987 Carnegie-Mellon University
	31	* All rights reserved. The CMU software License Agreement specifies
	32	* the terms and conditions for use and redistribution.
	33	*/
	34
	35	#include <sys/param.h>
	36	#include <sys/systm.h>
91447636	37	#include <sys/proc_internal.h>
1c79356b	38	#include <sys/user.h>
91447636	39	#include <sys/file_internal.h>
1c79356b A	40	#include <sys/vnode.h>
1c79356b A	41	#include <sys/kernel.h>
1c79356b A	42
	43	#include <machine/spl.h>
	44
	45	#include <kern/queue.h>
	46	#include <sys/lock.h>
	47	#include <kern/thread.h>
9bccf70c	48	#include <kern/sched_prim.h>
1c79356b A	49	#include <kern/ast.h>
	50
	51	#include <kern/cpu_number.h>
	52	#include <vm/vm_kern.h>
	53
	54	#include <kern/task.h>
	55	#include <mach/time_value.h>
91447636 A	56	#include <kern/lock.h>
91447636 A	57
2d21ac55 A	58	#include <sys/systm.h> /* for unix_syscall_return() */
	59	#include <libkern/OSAtomic.h>
	60
	61	extern boolean_t thread_should_abort(thread_t); /* XXX */
	62	extern void compute_averunnable(void ); / XXX */
	63
1c79356b	64
9bccf70c A	65
9bccf70c A	66	static void
2d21ac55	67	_sleep_continue( __unused void *parameter, wait_result_t wresult)
1c79356b	68	{
2d21ac55 A	69	struct proc *p = current_proc();
2d21ac55 A	70	thread_t self = current_thread();
1c79356b A	71	struct uthread * ut;
	72	int sig, catch;
	73	int error = 0;
91447636	74	int dropmutex;
1c79356b	75
55e303ae	76	ut = get_bsdthread_info(self);
91447636 A	77	catch = ut->uu_pri & PCATCH;
91447636 A	78	dropmutex = ut->uu_pri & PDROP;
1c79356b	79
91447636	80	switch (wresult) {
1c79356b A	81	case THREAD_TIMED_OUT:
	82	error = EWOULDBLOCK;
	83	break;
	84	case THREAD_AWAKENED:
	85	/*
	86	* Posix implies any signal should be delivered
	87	* first, regardless of whether awakened due
	88	* to receiving event.
	89	*/
	90	if (!catch)
	91	break;
	92	/* else fall through */
	93	case THREAD_INTERRUPTED:
	94	if (catch) {
55e303ae	95	if (thread_should_abort(self)) {
1c79356b A	96	error = EINTR;
1c79356b A	97	} else if (SHOULDissignal(p,ut)) {
2d21ac55	98	if ((sig = CURSIG(p)) != 0) {
1c79356b A	99	if (p->p_sigacts->ps_sigintr & sigmask(sig))
	100	error = EINTR;
	101	else
	102	error = ERESTART;
	103	}
55e303ae	104	if (thread_should_abort(self)) {
1c79356b A	105	error = EINTR;
1c79356b A	106	}
91447636 A	107	} else if( (ut->uu_flag & ( UT_CANCELDISABLE \| UT_CANCEL \| UT_CANCELED)) == UT_CANCEL) {
	108	/* due to thread cancel */
	109	error = EINTR;
	110	}
1c79356b A	111	} else
	112	error = EINTR;
	113	break;
	114	}
	115
9bccf70c	116	if (error == EINTR \|\| error == ERESTART)
55e303ae	117	act_set_astbsd(self);
9bccf70c	118
91447636 A	119	if (ut->uu_mtx && !dropmutex)
91447636 A	120	lck_mtx_lock(ut->uu_mtx);
9bccf70c	121
2d21ac55 A	122	ut->uu_wchan = NULL;
	123	ut->uu_wmesg = NULL;
	124
1c79356b A	125	unix_syscall_return((*ut->uu_continuation)(error));
	126	}
	127
	128	/*
	129	* Give up the processor till a wakeup occurs
	130	* on chan, at which time the process
	131	* enters the scheduling queue at priority pri.
	132	* The most important effect of pri is that when
	133	* pri<=PZERO a signal cannot disturb the sleep;
	134	* if pri>PZERO signals will be processed.
	135	* If pri&PCATCH is set, signals will cause sleep
	136	* to return 1, rather than longjmp.
	137	* Callers of this routine must be prepared for
	138	* premature return, and check that the reason for
	139	* sleeping has gone away.
91447636 A	140	*
	141	* if msleep was the entry point, than we have a mutex to deal with
	142	*
	143	* The mutex is unlocked before the caller is blocked, and
	144	* relocked before msleep returns unless the priority includes the PDROP
	145	* flag... if PDROP is specified, _sleep returns with the mutex unlocked
	146	* regardless of whether it actually blocked or not.
1c79356b A	147	*/
1c79356b A	148
9bccf70c A	149	static int
	150	_sleep(
	151	caddr_t chan,
91447636 A	152	int pri,
91447636 A	153	const char *wmsg,
9bccf70c	154	u_int64_t abstime,
91447636 A	155	int (*continuation)(int),
91447636 A	156	lck_mtx_t *mtx)
1c79356b	157	{
2d21ac55 A	158	struct proc *p;
2d21ac55 A	159	thread_t self = current_thread();
1c79356b A	160	struct uthread * ut;
1c79356b A	161	int sig, catch = pri & PCATCH;
91447636	162	int dropmutex = pri & PDROP;
9bccf70c	163	int wait_result;
1c79356b	164	int error = 0;
1c79356b	165
55e303ae	166	ut = get_bsdthread_info(self);
91447636	167
1c79356b	168	p = current_proc();
1c79356b	169	p->p_priority = pri & PRIMASK;
2d21ac55 A	170	/* It can still block in proc_exit() after the teardown. */
	171	if (p->p_stats != NULL)
	172	OSIncrementAtomic(&p->p_stats->p_ru.ru_nvcsw);
	173
	174	/* set wait message & channel */
	175	ut->uu_wchan = chan;
	176	ut->uu_wmesg = wmsg ? wmsg : "unknown";
91447636 A	177
	178	if (mtx != NULL && chan != NULL && (thread_continue_t)continuation == THREAD_CONTINUE_NULL) {
	179
	180	if (abstime)
	181	wait_result = lck_mtx_sleep_deadline(mtx, (dropmutex) ? LCK_SLEEP_UNLOCK : 0,
	182	chan, (catch) ? THREAD_ABORTSAFE : THREAD_UNINT, abstime);
	183	else
	184	wait_result = lck_mtx_sleep(mtx, (dropmutex) ? LCK_SLEEP_UNLOCK : 0,
	185	chan, (catch) ? THREAD_ABORTSAFE : THREAD_UNINT);
	186	}
	187	else {
	188	if (chan != NULL)
	189	assert_wait_deadline(chan, (catch) ? THREAD_ABORTSAFE : THREAD_UNINT, abstime);
	190	if (mtx)
	191	lck_mtx_unlock(mtx);
	192	if (catch) {
	193	if (SHOULDissignal(p,ut)) {
2d21ac55	194	if ((sig = CURSIG(p)) != 0) {
91447636 A	195	if (clear_wait(self, THREAD_INTERRUPTED) == KERN_FAILURE)
91447636 A	196	goto block;
91447636 A	197	if (p->p_sigacts->ps_sigintr & sigmask(sig))
	198	error = EINTR;
	199	else
	200	error = ERESTART;
	201	if (mtx && !dropmutex)
	202	lck_mtx_lock(mtx);
1c79356b A	203	goto out;
1c79356b A	204	}
91447636 A	205	}
	206	if (thread_should_abort(self)) {
	207	if (clear_wait(self, THREAD_INTERRUPTED) == KERN_FAILURE)
	208	goto block;
	209	error = EINTR;
	210
	211	if (mtx && !dropmutex)
	212	lck_mtx_lock(mtx);
1c79356b A	213	goto out;
1c79356b A	214	}
91447636	215	}
1c79356b	216
55e303ae	217
91447636 A	218	block:
	219	if ((thread_continue_t)continuation != THREAD_CONTINUE_NULL) {
	220	ut->uu_continuation = continuation;
	221	ut->uu_pri = pri;
	222	ut->uu_timo = abstime? 1: 0;
	223	ut->uu_mtx = mtx;
	224	(void) thread_block(_sleep_continue);
	225	/* NOTREACHED */
	226	}
	227
	228	wait_result = thread_block(THREAD_CONTINUE_NULL);
1c79356b	229
91447636 A	230	if (mtx && !dropmutex)
91447636 A	231	lck_mtx_lock(mtx);
1c79356b A	232	}
1c79356b A	233
9bccf70c	234	switch (wait_result) {
1c79356b A	235	case THREAD_TIMED_OUT:
	236	error = EWOULDBLOCK;
	237	break;
	238	case THREAD_AWAKENED:
	239	/*
	240	* Posix implies any signal should be delivered
	241	* first, regardless of whether awakened due
	242	* to receiving event.
	243	*/
	244	if (!catch)
	245	break;
	246	/* else fall through */
	247	case THREAD_INTERRUPTED:
	248	if (catch) {
55e303ae	249	if (thread_should_abort(self)) {
1c79356b	250	error = EINTR;
91447636	251	} else if (SHOULDissignal(p, ut)) {
2d21ac55	252	if ((sig = CURSIG(p)) != 0) {
1c79356b A	253	if (p->p_sigacts->ps_sigintr & sigmask(sig))
	254	error = EINTR;
	255	else
	256	error = ERESTART;
	257	}
55e303ae	258	if (thread_should_abort(self)) {
1c79356b A	259	error = EINTR;
	260	}
	261	}
1c79356b A	262	} else
	263	error = EINTR;
	264	break;
	265	}
	266	out:
9bccf70c	267	if (error == EINTR \|\| error == ERESTART)
55e303ae	268	act_set_astbsd(self);
2d21ac55 A	269	ut->uu_wchan = NULL;
2d21ac55 A	270	ut->uu_wmesg = NULL;
91447636	271
1c79356b A	272	return (error);
	273	}
	274
9bccf70c A	275	int
	276	sleep(
	277	void *chan,
	278	int pri)
1c79356b	279	{
91447636 A	280	return _sleep((caddr_t)chan, pri, (char )NULL, 0, (int ()(int))0, (lck_mtx_t *)0);
	281	}
	282
	283	int
	284	msleep0(
	285	void *chan,
	286	lck_mtx_t *mtx,
	287	int pri,
	288	const char *wmsg,
	289	int timo,
	290	int (*continuation)(int))
	291	{
	292	u_int64_t abstime = 0;
	293
	294	if (timo)
	295	clock_interval_to_deadline(timo, NSEC_PER_SEC / hz, &abstime);
	296
	297	return _sleep((caddr_t)chan, pri, wmsg, abstime, continuation, mtx);
	298	}
	299
	300	int
	301	msleep(
	302	void *chan,
	303	lck_mtx_t *mtx,
	304	int pri,
	305	const char *wmsg,
	306	struct timespec *ts)
	307	{
	308	u_int64_t abstime = 0;
	309
	310	if (ts && (ts->tv_sec \|\| ts->tv_nsec)) {
	311	nanoseconds_to_absolutetime((uint64_t)ts->tv_sec * NSEC_PER_SEC + ts->tv_nsec, &abstime );
	312	clock_absolutetime_interval_to_deadline( abstime, &abstime );
	313	}
	314
	315	return _sleep((caddr_t)chan, pri, wmsg, abstime, (int (*)(int))0, mtx);
	316	}
	317
	318	int
	319	msleep1(
	320	void *chan,
	321	lck_mtx_t *mtx,
	322	int pri,
	323	const char *wmsg,
	324	u_int64_t abstime)
	325	{
	326	return _sleep((caddr_t)chan, pri, wmsg, abstime, (int (*)(int))0, mtx);
1c79356b A	327	}
1c79356b A	328
9bccf70c A	329	int
9bccf70c A	330	tsleep(
91447636	331	void *chan,
9bccf70c	332	int pri,
91447636	333	const char *wmsg,
9bccf70c A	334	int timo)
	335	{
	336	u_int64_t abstime = 0;
	337
	338	if (timo)
	339	clock_interval_to_deadline(timo, NSEC_PER_SEC / hz, &abstime);
91447636	340	return _sleep((caddr_t)chan, pri, wmsg, abstime, (int ()(int))0, (lck_mtx_t )0);
1c79356b A	341	}
1c79356b A	342
9bccf70c A	343	int
9bccf70c A	344	tsleep0(
91447636	345	void *chan,
9bccf70c	346	int pri,
91447636	347	const char *wmsg,
9bccf70c A	348	int timo,
9bccf70c A	349	int (*continuation)(int))
1c79356b	350	{
9bccf70c A	351	u_int64_t abstime = 0;
	352
	353	if (timo)
	354	clock_interval_to_deadline(timo, NSEC_PER_SEC / hz, &abstime);
91447636	355	return _sleep((caddr_t)chan, pri, wmsg, abstime, continuation, (lck_mtx_t *)0);
0b4e3aa0 A	356	}
0b4e3aa0 A	357
9bccf70c A	358	int
	359	tsleep1(
	360	void *chan,
91447636 A	361	int pri,
91447636 A	362	const char *wmsg,
9bccf70c	363	u_int64_t abstime,
91447636	364	int (*continuation)(int))
0b4e3aa0	365	{
91447636	366	return _sleep((caddr_t)chan, pri, wmsg, abstime, continuation, (lck_mtx_t *)0);
1c79356b A	367	}
	368
	369	/*
	370	* Wake up all processes sleeping on chan.
	371	*/
	372	void
2d21ac55	373	wakeup(void *chan)
1c79356b	374	{
9bccf70c	375	thread_wakeup_prim((caddr_t)chan, FALSE, THREAD_AWAKENED);
1c79356b A	376	}
	377
	378	/*
	379	* Wake up the first process sleeping on chan.
	380	*
	381	* Be very sure that the first process is really
	382	* the right one to wakeup.
	383	*/
9bccf70c	384	void
2d21ac55	385	wakeup_one(caddr_t chan)
1c79356b A	386	{
	387	thread_wakeup_prim((caddr_t)chan, TRUE, THREAD_AWAKENED);
	388	}
	389
	390	/*
	391	* Compute the priority of a process when running in user mode.
	392	* Arrange to reschedule if the resulting priority is better
	393	* than that of the current process.
	394	*/
	395	void
2d21ac55	396	resetpriority(struct proc *p)
1c79356b	397	{
0b4e3aa0	398	(void)task_importance(p->task, -p->p_nice);
1c79356b	399	}
9bccf70c A	400
	401	struct loadavg averunnable =
	402	{ {0, 0, 0}, FSCALE }; /* load average, of runnable procs */
	403	/*
	404	* Constants for averages over 1, 5, and 15 minutes
	405	* when sampling at 5 second intervals.
	406	*/
	407	static fixpt_t cexp[3] = {
	408	(fixpt_t)(0.9200444146293232 * FSCALE), /* exp(-1/12) */
	409	(fixpt_t)(0.9834714538216174 * FSCALE), /* exp(-1/60) */
	410	(fixpt_t)(0.9944598480048967 * FSCALE), /* exp(-1/180) */
	411	};
	412
	413	void
2d21ac55	414	compute_averunnable(void *arg)
9bccf70c	415	{
91447636	416	unsigned int nrun = (unsigned int )arg;
9bccf70c	417	struct loadavg *avg = &averunnable;
2d21ac55	418	int i;
9bccf70c A	419
	420	for (i = 0; i < 3; i++)
	421	avg->ldavg[i] = (cexp[i] * avg->ldavg[i] +
	422	nrun * FSCALE * (FSCALE - cexp[i])) >> FSHIFT;
	423	}