X-Git-Url: https://git.saurik.com/apple/xnu.git/blobdiff_plain/d7e50217d7adf6e52786a38bcaa4cd698cb9a79e..6601e61aa18bf4f09af135ff61fc7f4771d23b06:/osfmk/kern/mk_sp.c diff --git a/osfmk/kern/mk_sp.c b/osfmk/kern/mk_sp.c index f976f5f51..565681e39 100644 --- a/osfmk/kern/mk_sp.c +++ b/osfmk/kern/mk_sp.c @@ -1,24 +1,21 @@ /* - * Copyright (c) 2000 Apple Computer, Inc. All rights reserved. + * Copyright (c) 2000-2004 Apple Computer, Inc. All rights reserved. * * @APPLE_LICENSE_HEADER_START@ * - * Copyright (c) 1999-2003 Apple Computer, Inc. All Rights Reserved. + * The contents of this file constitute Original Code as defined in and + * are subject to the Apple Public Source License Version 1.1 (the + * "License"). You may not use this file except in compliance with the + * License. Please obtain a copy of the License at + * http://www.apple.com/publicsource and read it before using this file. * - * 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. 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 + * This 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. + * FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT. Please see the + * License for the specific language governing rights and limitations + * under the License. * * @APPLE_LICENSE_HEADER_END@ */ @@ -27,12 +24,7 @@ * */ -/*** - *** ??? The following lines were picked up when code was incorporated - *** into this file from `kern/syscall_subr.c.' These should be moved - *** with the code if it moves again. Otherwise, they should be trimmed, - *** based on the files included above. - ***/ +/* The routines in this module are all obsolete */ #include #include @@ -45,19 +37,12 @@ #include #include #include -#include #include #include #include #include -/*** - *** ??? End of lines picked up when code was incorporated - *** into this file from `kern/syscall_subr.c.' - ***/ - -#include #include #include #include @@ -65,131 +50,8 @@ #include #include #include - -/*** - *** ??? The next two files supply the prototypes for `thread_set_policy()' - *** and `thread_policy.' These routines cannot stay here if they are - *** exported Mach system calls. - ***/ #include #include -#include - -void -_mk_sp_thread_unblock( - thread_t thread) -{ - thread_setrun(thread, TAIL_Q); - - thread->current_quantum = 0; - thread->computation_metered = 0; - thread->reason = AST_NONE; - - KERNEL_DEBUG_CONSTANT( - MACHDBG_CODE(DBG_MACH_SCHED,MACH_MAKE_RUNNABLE) | DBG_FUNC_NONE, - (int)thread, (int)thread->sched_pri, 0, 0, 0); -} - -void -_mk_sp_thread_done( - thread_t old_thread, - thread_t new_thread, - processor_t processor) -{ - /* - * A running thread is being taken off a processor: - */ - clock_get_uptime(&processor->last_dispatch); - if (!(old_thread->state & TH_IDLE)) { - /* - * Compute remainder of current quantum. - */ - if ( first_quantum(processor) && - processor->quantum_end > processor->last_dispatch ) - old_thread->current_quantum = - (processor->quantum_end - processor->last_dispatch); - else - old_thread->current_quantum = 0; - - /* - * For non-realtime threads treat a tiny - * remaining quantum as an expired quantum - * but include what's left next time. - */ - if (!(old_thread->sched_mode & TH_MODE_REALTIME)) { - if (old_thread->current_quantum < min_std_quantum) { - old_thread->reason |= AST_QUANTUM; - old_thread->current_quantum += std_quantum; - } - } - else - if (old_thread->current_quantum == 0) - old_thread->reason |= AST_QUANTUM; - - /* - * If we are doing a direct handoff then - * give the remainder of our quantum to - * the next guy. - */ - if ((old_thread->reason & (AST_HANDOFF|AST_QUANTUM)) == AST_HANDOFF) { - new_thread->current_quantum = old_thread->current_quantum; - old_thread->reason |= AST_QUANTUM; - old_thread->current_quantum = 0; - } - - old_thread->last_switch = processor->last_dispatch; - - old_thread->computation_metered += - (old_thread->last_switch - old_thread->computation_epoch); - } -} - -void -_mk_sp_thread_begin( - thread_t thread, - processor_t processor) -{ - - /* - * The designated thread is beginning execution: - */ - if (!(thread->state & TH_IDLE)) { - if (thread->current_quantum == 0) - thread->current_quantum = - (thread->sched_mode & TH_MODE_REALTIME)? - thread->realtime.computation: std_quantum; - - processor->quantum_end = - (processor->last_dispatch + thread->current_quantum); - timer_call_enter1(&processor->quantum_timer, - thread, processor->quantum_end); - - processor->slice_quanta = - (thread->sched_mode & TH_MODE_TIMESHARE)? - processor->processor_set->set_quanta: 1; - - thread->last_switch = processor->last_dispatch; - - thread->computation_epoch = thread->last_switch; - } - else { - timer_call_cancel(&processor->quantum_timer); - - processor->slice_quanta = 1; - } -} - -void -_mk_sp_thread_dispatch( - thread_t thread) -{ - if (thread->reason & AST_QUANTUM) - thread_setrun(thread, TAIL_Q); - else - thread_setrun(thread, HEAD_Q); - - thread->reason = AST_NONE; -} /* * thread_policy_common: @@ -214,10 +76,21 @@ thread_policy_common( if ( !(thread->sched_mode & TH_MODE_REALTIME) && !(thread->safe_mode & TH_MODE_REALTIME) ) { if (!(thread->sched_mode & TH_MODE_FAILSAFE)) { - if (policy == POLICY_TIMESHARE) + integer_t oldmode = (thread->sched_mode & TH_MODE_TIMESHARE); + + if (policy == POLICY_TIMESHARE && !oldmode) { thread->sched_mode |= TH_MODE_TIMESHARE; + + if (thread->state & TH_RUN) + pset_share_incr(thread->processor_set); + } else + if (policy != POLICY_TIMESHARE && oldmode) { thread->sched_mode &= ~TH_MODE_TIMESHARE; + + if (thread->state & TH_RUN) + pset_share_decr(thread->processor_set); + } } else { if (policy == POLICY_TIMESHARE) @@ -232,8 +105,8 @@ thread_policy_common( if (priority >= MINPRI_KERNEL) priority -= MINPRI_KERNEL; else - if (priority >= MINPRI_SYSTEM) - priority -= MINPRI_SYSTEM; + if (priority >= MINPRI_RESERVED) + priority -= MINPRI_RESERVED; else priority -= BASEPRI_DEFAULT; @@ -265,7 +138,7 @@ thread_policy_common( */ kern_return_t thread_set_policy( - thread_act_t thr_act, + thread_t thread, processor_set_t pset, policy_t policy, policy_base_t base, @@ -273,25 +146,19 @@ thread_set_policy( policy_limit_t limit, mach_msg_type_number_t limit_count) { - thread_t thread; int max, bas; kern_return_t result = KERN_SUCCESS; - if ( thr_act == THR_ACT_NULL || + if ( thread == THREAD_NULL || pset == PROCESSOR_SET_NULL ) return (KERN_INVALID_ARGUMENT); - thread = act_lock_thread(thr_act); - if (thread == THREAD_NULL) { - act_unlock_thread(thr_act); - - return(KERN_INVALID_ARGUMENT); - } + thread_mtx_lock(thread); if (pset != thread->processor_set) { - act_unlock_thread(thr_act); + thread_mtx_unlock(thread); - return(KERN_FAILURE); + return (KERN_FAILURE); } switch (policy) { @@ -365,15 +232,16 @@ thread_set_policy( } if (result != KERN_SUCCESS) { - act_unlock_thread(thr_act); + thread_mtx_unlock(thread); - return(result); + return (result); } result = thread_policy_common(thread, policy, bas); - act_unlock_thread(thr_act); - return(result); + thread_mtx_unlock(thread); + + return (result); } @@ -386,38 +254,37 @@ thread_set_policy( */ kern_return_t thread_policy( - thread_act_t thr_act, + thread_t thread, policy_t policy, policy_base_t base, mach_msg_type_number_t count, boolean_t set_limit) { - thread_t thread; - processor_set_t pset; kern_return_t result = KERN_SUCCESS; + processor_set_t pset; policy_limit_t limit; int limcount; policy_rr_limit_data_t rr_limit; policy_fifo_limit_data_t fifo_limit; policy_timeshare_limit_data_t ts_limit; - if (thr_act == THR_ACT_NULL) + if (thread == THREAD_NULL) return (KERN_INVALID_ARGUMENT); - thread = act_lock_thread(thr_act); + thread_mtx_lock(thread); + pset = thread->processor_set; - if ( thread == THREAD_NULL || - pset == PROCESSOR_SET_NULL ){ - act_unlock_thread(thr_act); + if (pset == PROCESSOR_SET_NULL) { + thread_mtx_unlock(thread); - return(KERN_INVALID_ARGUMENT); + return (KERN_INVALID_ARGUMENT); } if ( invalid_policy(policy) || ((POLICY_TIMESHARE | POLICY_RR | POLICY_FIFO) & policy) == 0 ) { - act_unlock_thread(thr_act); + thread_mtx_unlock(thread); - return(KERN_INVALID_POLICY); + return (KERN_INVALID_POLICY); } if (set_limit) { @@ -563,513 +430,11 @@ thread_policy( } - act_unlock_thread(thr_act); + thread_mtx_unlock(thread); if (result == KERN_SUCCESS) - result = thread_set_policy(thr_act, pset, + result = thread_set_policy(thread, pset, policy, base, count, limit, limcount); return(result); } - -/* - * Define shifts for simulating (5/8)**n - */ - -shift_data_t wait_shift[32] = { - {1,1},{1,3},{1,-3},{2,-7},{3,5},{3,-5},{4,-8},{5,7}, - {5,-7},{6,-10},{7,10},{7,-9},{8,-11},{9,12},{9,-11},{10,-13}, - {11,14},{11,-13},{12,-15},{13,17},{13,-15},{14,-17},{15,19},{16,18}, - {16,-19},{17,22},{18,20},{18,-20},{19,26},{20,22},{20,-22},{21,-27}}; - -/* - * do_priority_computation: - * - * Calculate new priority for thread based on its base priority plus - * accumulated usage. PRI_SHIFT and PRI_SHIFT_2 convert from - * usage to priorities. SCHED_SHIFT converts for the scaling - * of the sched_usage field by SCHED_SCALE. This scaling comes - * from the multiplication by sched_load (thread_timer_delta) - * in sched.h. sched_load is calculated as a scaled overload - * factor in compute_mach_factor (mach_factor.c). - */ -#ifdef PRI_SHIFT_2 -#if PRI_SHIFT_2 > 0 -#define do_priority_computation(thread, pri) \ - MACRO_BEGIN \ - (pri) = (thread)->priority /* start with base priority */ \ - - ((thread)->sched_usage >> (PRI_SHIFT + SCHED_SHIFT)) \ - - ((thread)->sched_usage >> (PRI_SHIFT_2 + SCHED_SHIFT)); \ - if ((pri) < MINPRI_STANDARD) \ - (pri) = MINPRI_STANDARD; \ - else \ - if ((pri) > MAXPRI_STANDARD) \ - (pri) = MAXPRI_STANDARD; \ - MACRO_END -#else /* PRI_SHIFT_2 */ -#define do_priority_computation(thread, pri) \ - MACRO_BEGIN \ - (pri) = (thread)->priority /* start with base priority */ \ - - ((thread)->sched_usage >> (PRI_SHIFT + SCHED_SHIFT)) \ - + ((thread)->sched_usage >> (SCHED_SHIFT - PRI_SHIFT_2)); \ - if ((pri) < MINPRI_STANDARD) \ - (pri) = MINPRI_STANDARD; \ - else \ - if ((pri) > MAXPRI_STANDARD) \ - (pri) = MAXPRI_STANDARD; \ - MACRO_END -#endif /* PRI_SHIFT_2 */ -#else /* defined(PRI_SHIFT_2) */ -#define do_priority_computation(thread, pri) \ - MACRO_BEGIN \ - (pri) = (thread)->priority /* start with base priority */ \ - - ((thread)->sched_usage >> (PRI_SHIFT + SCHED_SHIFT)); \ - if ((pri) < MINPRI_STANDARD) \ - (pri) = MINPRI_STANDARD; \ - else \ - if ((pri) > MAXPRI_STANDARD) \ - (pri) = MAXPRI_STANDARD; \ - MACRO_END -#endif /* defined(PRI_SHIFT_2) */ - -void -set_priority( - register thread_t thread, - register int priority) -{ - thread->priority = priority; - compute_priority(thread, FALSE); -} - -/* - * compute_priority: - * - * Reset the current scheduled priority of the - * thread according to its base priority if the - * thread has not been promoted or depressed. - * - * If the thread is timesharing, adjust according - * to recent cpu usage. - * - * The thread *must* be locked by the caller. - */ -void -compute_priority( - register thread_t thread, - boolean_t override_depress) -{ - register int priority; - - if ( !(thread->sched_mode & TH_MODE_PROMOTED) && - (!(thread->sched_mode & TH_MODE_ISDEPRESSED) || - override_depress ) ) { - if (thread->sched_mode & TH_MODE_TIMESHARE) - do_priority_computation(thread, priority); - else - priority = thread->priority; - - set_sched_pri(thread, priority); - } -} - -/* - * compute_my_priority: - * - * Version of compute priority for current thread. - * Caller must have thread locked and thread must - * be timesharing and not depressed. - * - * Only used for priority updates. - */ -void -compute_my_priority( - register thread_t thread) -{ - register int priority; - - do_priority_computation(thread, priority); - assert(thread->runq == RUN_QUEUE_NULL); - thread->sched_pri = priority; -} - -/* - * update_priority - * - * Cause the priority computation of a thread that has been - * sleeping or suspended to "catch up" with the system. Thread - * *MUST* be locked by caller. If thread is running, then this - * can only be called by the thread on itself. - */ -void -update_priority( - register thread_t thread) -{ - register unsigned int ticks; - register shift_t shiftp; - - ticks = sched_tick - thread->sched_stamp; - assert(ticks != 0); - - /* - * If asleep for more than 30 seconds forget all - * cpu_usage, else catch up on missed aging. - * 5/8 ** n is approximated by the two shifts - * in the wait_shift array. - */ - thread->sched_stamp += ticks; - thread_timer_delta(thread); - if (ticks > 30) { - thread->cpu_usage = 0; - thread->sched_usage = 0; - } - else { - thread->cpu_usage += thread->cpu_delta; - thread->sched_usage += thread->sched_delta; - - shiftp = &wait_shift[ticks]; - if (shiftp->shift2 > 0) { - thread->cpu_usage = - (thread->cpu_usage >> shiftp->shift1) + - (thread->cpu_usage >> shiftp->shift2); - thread->sched_usage = - (thread->sched_usage >> shiftp->shift1) + - (thread->sched_usage >> shiftp->shift2); - } - else { - thread->cpu_usage = - (thread->cpu_usage >> shiftp->shift1) - - (thread->cpu_usage >> -(shiftp->shift2)); - thread->sched_usage = - (thread->sched_usage >> shiftp->shift1) - - (thread->sched_usage >> -(shiftp->shift2)); - } - } - - thread->cpu_delta = 0; - thread->sched_delta = 0; - - /* - * Check for fail-safe release. - */ - if ( (thread->sched_mode & TH_MODE_FAILSAFE) && - thread->sched_stamp >= thread->safe_release ) { - if (!(thread->safe_mode & TH_MODE_TIMESHARE)) { - if (thread->safe_mode & TH_MODE_REALTIME) { - thread->priority = BASEPRI_REALTIME; - - thread->sched_mode |= TH_MODE_REALTIME; - } - - thread->sched_mode &= ~TH_MODE_TIMESHARE; - - if (!(thread->sched_mode & TH_MODE_ISDEPRESSED)) - set_sched_pri(thread, thread->priority); - } - - thread->safe_mode = 0; - thread->sched_mode &= ~TH_MODE_FAILSAFE; - } - - /* - * Recompute scheduled priority if appropriate. - */ - if ( (thread->sched_mode & TH_MODE_TIMESHARE) && - !(thread->sched_mode & TH_MODE_PROMOTED) && - !(thread->sched_mode & TH_MODE_ISDEPRESSED) ) { - register int new_pri; - - do_priority_computation(thread, new_pri); - if (new_pri != thread->sched_pri) { - run_queue_t runq; - - runq = rem_runq(thread); - thread->sched_pri = new_pri; - if (runq != RUN_QUEUE_NULL) - thread_setrun(thread, TAIL_Q); - } - } -} - -/* - * thread_switch_continue: - * - * Continuation routine for a thread switch. - * - * Just need to arrange the return value gets sent out correctly and that - * we cancel the timer or the depression called for by the options to the - * thread_switch call. - */ -void -_mk_sp_thread_switch_continue(void) -{ - register thread_t self = current_thread(); - int wait_result = self->wait_result; - int option = self->saved.swtch.option; - - if (option == SWITCH_OPTION_WAIT && wait_result != THREAD_TIMED_OUT) - thread_cancel_timer(); - else - if (option == SWITCH_OPTION_DEPRESS) - _mk_sp_thread_depress_abort(self, FALSE); - - thread_syscall_return(KERN_SUCCESS); - /*NOTREACHED*/ -} - -/* - * thread_switch: - * - * Context switch. User may supply thread hint. - * - * Fixed priority threads that call this get what they asked for - * even if that violates priority order. - */ -kern_return_t -_mk_sp_thread_switch( - thread_act_t hint_act, - int option, - mach_msg_timeout_t option_time) -{ - register thread_t self = current_thread(); - register processor_t myprocessor; - int s; - - /* - * Check and use thr_act hint if appropriate. It is not - * appropriate to give a hint that shares the current shuttle. - */ - if (hint_act != THR_ACT_NULL) { - register thread_t thread = act_lock_thread(hint_act); - - if ( thread != THREAD_NULL && - thread != self && - thread->top_act == hint_act ) { - s = splsched(); - thread_lock(thread); - - /* - * Check if the thread is in the right pset. Then - * pull it off its run queue. If it - * doesn't come, then it's not eligible. - */ - if ( thread->processor_set == self->processor_set && - rem_runq(thread) != RUN_QUEUE_NULL ) { - /* - * Hah, got it!! - */ - thread_unlock(thread); - - act_unlock_thread(hint_act); - act_deallocate(hint_act); - - if (option == SWITCH_OPTION_WAIT) - assert_wait_timeout(option_time, THREAD_ABORTSAFE); - else - if (option == SWITCH_OPTION_DEPRESS) - _mk_sp_thread_depress_ms(option_time); - - self->saved.swtch.option = option; - - thread_run(self, _mk_sp_thread_switch_continue, thread); - /* NOTREACHED */ - } - - thread_unlock(thread); - splx(s); - } - - act_unlock_thread(hint_act); - act_deallocate(hint_act); - } - - /* - * No handoff hint supplied, or hint was wrong. Call thread_block() in - * hopes of running something else. If nothing else is runnable, - * thread_block will detect this. WARNING: thread_switch with no - * option will not do anything useful if the thread calling it is the - * highest priority thread (can easily happen with a collection - * of timesharing threads). - */ - mp_disable_preemption(); - myprocessor = current_processor(); - if ( option != SWITCH_OPTION_NONE || - myprocessor->processor_set->runq.count > 0 || - myprocessor->runq.count > 0 ) { - mp_enable_preemption(); - - if (option == SWITCH_OPTION_WAIT) - assert_wait_timeout(option_time, THREAD_ABORTSAFE); - else - if (option == SWITCH_OPTION_DEPRESS) - _mk_sp_thread_depress_ms(option_time); - - self->saved.swtch.option = option; - - thread_block_reason(_mk_sp_thread_switch_continue, - (option == SWITCH_OPTION_DEPRESS)? - AST_YIELD: AST_NONE); - } - else - mp_enable_preemption(); - -out: - if (option == SWITCH_OPTION_WAIT) - thread_cancel_timer(); - else - if (option == SWITCH_OPTION_DEPRESS) - _mk_sp_thread_depress_abort(self, FALSE); - - return (KERN_SUCCESS); -} - -/* - * Depress thread's priority to lowest possible for the specified interval, - * with a value of zero resulting in no timeout being scheduled. - */ -void -_mk_sp_thread_depress_abstime( - uint64_t interval) -{ - register thread_t self = current_thread(); - uint64_t deadline; - spl_t s; - - s = splsched(); - wake_lock(self); - thread_lock(self); - if (!(self->sched_mode & TH_MODE_ISDEPRESSED)) { - processor_t myprocessor = self->last_processor; - - self->sched_pri = DEPRESSPRI; - myprocessor->current_pri = self->sched_pri; - self->sched_mode &= ~TH_MODE_PREEMPT; - self->sched_mode |= TH_MODE_DEPRESS; - thread_unlock(self); - - if (interval != 0) { - clock_absolutetime_interval_to_deadline(interval, &deadline); - if (!timer_call_enter(&self->depress_timer, deadline)) - self->depress_timer_active++; - } - } - else - thread_unlock(self); - wake_unlock(self); - splx(s); -} - -void -_mk_sp_thread_depress_ms( - mach_msg_timeout_t interval) -{ - uint64_t abstime; - - clock_interval_to_absolutetime_interval( - interval, 1000*NSEC_PER_USEC, &abstime); - _mk_sp_thread_depress_abstime(abstime); -} - -/* - * Priority depression expiration. - */ -void -thread_depress_expire( - timer_call_param_t p0, - timer_call_param_t p1) -{ - thread_t thread = p0; - spl_t s; - - s = splsched(); - wake_lock(thread); - if (--thread->depress_timer_active == 1) { - thread_lock(thread); - thread->sched_mode &= ~TH_MODE_ISDEPRESSED; - compute_priority(thread, FALSE); - thread_unlock(thread); - } - else - if (thread->depress_timer_active == 0) - thread_wakeup_one(&thread->depress_timer_active); - wake_unlock(thread); - splx(s); -} - -/* - * Prematurely abort priority depression if there is one. - */ -kern_return_t -_mk_sp_thread_depress_abort( - register thread_t thread, - boolean_t abortall) -{ - kern_return_t result = KERN_NOT_DEPRESSED; - spl_t s; - - s = splsched(); - wake_lock(thread); - thread_lock(thread); - if (abortall || !(thread->sched_mode & TH_MODE_POLLDEPRESS)) { - if (thread->sched_mode & TH_MODE_ISDEPRESSED) { - thread->sched_mode &= ~TH_MODE_ISDEPRESSED; - compute_priority(thread, FALSE); - result = KERN_SUCCESS; - } - - thread_unlock(thread); - - if (timer_call_cancel(&thread->depress_timer)) - thread->depress_timer_active--; - } - else - thread_unlock(thread); - wake_unlock(thread); - splx(s); - - return (result); -} - -void -_mk_sp_thread_perhaps_yield( - thread_t self) -{ - spl_t s; - - assert(self == current_thread()); - - s = splsched(); - if (!(self->sched_mode & (TH_MODE_REALTIME|TH_MODE_TIMESHARE))) { - extern uint64_t max_poll_computation; - extern int sched_poll_yield_shift; - uint64_t abstime, total_computation; - - clock_get_uptime(&abstime); - total_computation = abstime - self->computation_epoch; - total_computation += self->computation_metered; - if (total_computation >= max_poll_computation) { - processor_t myprocessor = current_processor(); - ast_t preempt; - - wake_lock(self); - thread_lock(self); - if (!(self->sched_mode & TH_MODE_ISDEPRESSED)) { - self->sched_pri = DEPRESSPRI; - myprocessor->current_pri = self->sched_pri; - self->sched_mode &= ~TH_MODE_PREEMPT; - } - self->computation_epoch = abstime; - self->computation_metered = 0; - self->sched_mode |= TH_MODE_POLLDEPRESS; - thread_unlock(self); - - abstime += (total_computation >> sched_poll_yield_shift); - if (!timer_call_enter(&self->depress_timer, abstime)) - self->depress_timer_active++; - wake_unlock(self); - - if ((preempt = csw_check(self, myprocessor)) != AST_NONE) - ast_on(preempt); - } - } - splx(s); -}