[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, spinmutex;

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

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