1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283
|
/*
* Mach Operating System
* Copyright (c) 1993, 1992,1991,1990 Carnegie Mellon University
* All Rights Reserved.
*
* Permission to use, copy, modify and distribute this software and its
* documentation is hereby granted, provided that both the copyright
* notice and this permission notice appear in all copies of the
* software, derivative works or modified versions, and any portions
* thereof, and that both notices appear in supporting documentation.
*
* CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
* CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND FOR
* ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
*
* Carnegie Mellon requests users of this software to return to
*
* Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU
* School of Computer Science
* Carnegie Mellon University
* Pittsburgh PA 15213-3890
*
* any improvements or extensions that they make and grant Carnegie Mellon
* the rights to redistribute these changes.
*/
#include <mach/message.h>
#include <kern/counters.h>
#include "cpu_number.h"
#include <kern/debug.h>
#include <kern/lock.h>
#include <kern/mach_clock.h>
#include <kern/thread.h>
#include <kern/sched_prim.h>
#include <kern/processor.h>
#include <kern/thread_swap.h>
#include <kern/ipc_sched.h>
#include <machine/machspl.h> /* for splsched/splx */
#include <machine/pmap.h>
/*
* These functions really belong in kern/sched_prim.c.
*/
/*
* Routine: thread_go
* Purpose:
* Start a thread running.
* Conditions:
* IPC locks may be held.
*/
void
thread_go(
thread_t thread)
{
int state;
spl_t s;
s = splsched();
thread_lock(thread);
reset_timeout_check(&thread->timer);
state = thread->state;
switch (state & TH_SCHED_STATE) {
case TH_WAIT | TH_SUSP | TH_UNINT:
case TH_WAIT | TH_UNINT:
case TH_WAIT:
/*
* Sleeping and not suspendable - put
* on run queue.
*/
thread->state = (state &~ TH_WAIT) | TH_RUN;
thread->wait_result = THREAD_AWAKENED;
thread_setrun(thread, TRUE);
break;
case TH_WAIT | TH_SUSP:
case TH_RUN | TH_WAIT:
case TH_RUN | TH_WAIT | TH_SUSP:
case TH_RUN | TH_WAIT | TH_UNINT:
case TH_RUN | TH_WAIT | TH_SUSP | TH_UNINT:
/*
* Either already running, or suspended.
*/
thread->state = state & ~TH_WAIT;
thread->wait_result = THREAD_AWAKENED;
break;
default:
/*
* Not waiting.
*/
break;
}
thread_unlock(thread);
splx(s);
}
/*
* Routine: thread_will_wait
* Purpose:
* Assert that the thread intends to block.
*/
void
thread_will_wait(
thread_t thread)
{
spl_t s;
s = splsched();
thread_lock(thread);
assert(thread->wait_result = -1); /* for later assertions */
thread->state |= TH_WAIT;
thread_unlock(thread);
splx(s);
}
/*
* Routine: thread_will_wait_with_timeout
* Purpose:
* Assert that the thread intends to block,
* with a timeout.
*/
void
thread_will_wait_with_timeout(
thread_t thread,
mach_msg_timeout_t msecs)
{
natural_t ticks = convert_ipc_timeout_to_ticks(msecs);
spl_t s;
s = splsched();
thread_lock(thread);
assert(thread->wait_result = -1); /* for later assertions */
thread->state |= TH_WAIT;
set_timeout(&thread->timer, ticks);
thread_unlock(thread);
splx(s);
}
#if MACH_HOST
#define check_processor_set(thread) \
(current_processor()->processor_set == (thread)->processor_set)
#else /* MACH_HOST */
#define check_processor_set(thread) TRUE
#endif /* MACH_HOST */
#if NCPUS > 1
#define check_bound_processor(thread) \
((thread)->bound_processor == PROCESSOR_NULL || \
(thread)->bound_processor == current_processor())
#else /* NCPUS > 1 */
#define check_bound_processor(thread) TRUE
#endif /* NCPUS > 1 */
/*
* Routine: thread_handoff
* Purpose:
* Switch to a new thread (new), leaving the current
* thread (old) blocked. If successful, moves the
* kernel stack from old to new and returns as the
* new thread. An explicit continuation for the old thread
* must be supplied.
*
* NOTE: Although we wakeup new, we don't set new->wait_result.
* Returns:
* TRUE if the handoff happened.
*/
boolean_t
thread_handoff(
thread_t old,
continuation_t continuation,
thread_t new)
{
spl_t s;
assert(current_thread() == old);
/*
* XXX Dubious things here:
* I don't check the idle_count on the processor set.
* No scheduling priority or policy checks.
* I assume the new thread is interruptible.
*/
s = splsched();
thread_lock(new);
/*
* The first thing we must do is check the state
* of the threads, to ensure we can handoff.
* This check uses current_processor()->processor_set,
* which we can read without locking.
*/
if ((old->stack_privilege == current_stack()) ||
(new->state != (TH_WAIT|TH_SWAPPED)) ||
!check_processor_set(new) ||
!check_bound_processor(new)) {
thread_unlock(new);
(void) splx(s);
counter(c_thread_handoff_misses++);
return FALSE;
}
reset_timeout_check(&new->timer);
new->state = TH_RUN;
thread_unlock(new);
#if NCPUS > 1
new->last_processor = current_processor();
#endif /* NCPUS > 1 */
ast_context(new, cpu_number());
timer_switch(&new->system_timer);
/*
* stack_handoff is machine-dependent. It does the
* machine-dependent components of a context-switch, like
* changing address spaces. It updates active_threads.
*/
stack_handoff(old, new);
/*
* Now we must dispose of the old thread.
* This is like thread_continue, except
* that the old thread isn't waiting yet.
*/
thread_lock(old);
old->swap_func = continuation;
assert(old->wait_result = -1); /* for later assertions */
if (old->state == TH_RUN) {
/*
* This is our fast path.
*/
old->state = TH_WAIT|TH_SWAPPED;
}
else if (old->state == (TH_RUN|TH_SUSP)) {
/*
* Somebody is trying to suspend the thread.
*/
old->state = TH_WAIT|TH_SUSP|TH_SWAPPED;
if (old->wake_active) {
/*
* Someone wants to know when the thread
* really stops.
*/
old->wake_active = FALSE;
thread_unlock(old);
thread_wakeup(TH_EV_WAKE_ACTIVE(old));
goto after_old_thread;
}
} else
panic("thread_handoff");
thread_unlock(old);
after_old_thread:
(void) splx(s);
counter(c_thread_handoff_hits++);
return TRUE;
}
|