1 // Copyright 2013-2014 The Rust Project Developers. See the COPYRIGHT
2 // file at the top-level directory of this distribution and at
3 // http://rust-lang.org/COPYRIGHT.
5 // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
6 // http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
7 // <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
8 // option. This file may not be copied, modified, or distributed
9 // except according to those terms.
13 use std::mem::transmute;
17 // FIXME #7761: Registers is boxed so that it is 16-byte aligned, for storing
18 // SSE regs. It would be marginally better not to do this. In C++ we
19 // use an attribute on a struct.
20 // FIXME #7761: It would be nice to define regs as `Box<Option<Registers>>`
21 // since the registers are sometimes empty, but the discriminant would
22 // then misalign the regs again.
24 /// Hold the registers while the task or scheduler is suspended
26 /// Lower bound and upper bound for the stack
27 stack_bounds: Option<(uint, uint)>,
30 pub type InitFn = extern "C" fn(uint, *(), *()) -> !;
33 pub fn empty() -> Context {
40 /// Create a new context that will resume execution by running proc()
42 /// The `init` function will be run with `arg` and the `start` procedure
43 /// split up into code and env pointers. It is required that the `init`
44 /// function never return.
46 /// FIXME: this is basically an awful the interface. The main reason for
47 /// this is to reduce the number of allocations made when a green
48 /// task is spawned as much as possible
49 pub fn new(init: InitFn, arg: uint, start: proc():Send,
50 stack: &mut Stack) -> Context {
52 let sp: *uint = stack.end();
53 let sp: *mut uint = sp as *mut uint;
54 // Save and then immediately load the current context,
55 // which we will then modify to call the given function when restored
56 let mut regs = new_regs();
58 initialize_call_frame(&mut *regs,
61 unsafe { transmute(start) },
64 // Scheduler tasks don't have a stack in the "we allocated it" sense,
65 // but rather they run on pthreads stacks. We have complete control over
66 // them in terms of the code running on them (and hopefully they don't
67 // overflow). Additionally, their coroutine stacks are listed as being
68 // zero-length, so that's how we detect what's what here.
69 let stack_base: *uint = stack.start();
70 let bounds = if sp as uint == stack_base as uint {
73 Some((stack_base as uint, sp as uint))
83 Suspend the current execution context and resume another by
84 saving the registers values of the executing thread to a Context
85 then loading the registers from a previously saved Context.
87 pub fn swap(out_context: &mut Context, in_context: &Context) {
88 rtdebug!("swapping contexts");
89 let out_regs: &mut Registers = match out_context {
90 &Context { regs: box ref mut r, .. } => r
92 let in_regs: &Registers = match in_context {
93 &Context { regs: box ref r, .. } => r
96 rtdebug!("noting the stack limit and doing raw swap");
99 // Right before we switch to the new context, set the new context's
100 // stack limit in the OS-specified TLS slot. This also means that
101 // we cannot call any more rust functions after record_stack_bounds
102 // returns because they would all likely fail due to the limit being
103 // invalid for the current task. Lucky for us `rust_swap_registers`
104 // is a C function so we don't have to worry about that!
105 match in_context.stack_bounds {
106 Some((lo, hi)) => stack::record_stack_bounds(lo, hi),
107 // If we're going back to one of the original contexts or
108 // something that's possibly not a "normal task", then reset
109 // the stack limit to 0 to make morestack never fail
110 None => stack::record_stack_bounds(0, uint::MAX),
112 rust_swap_registers(out_regs, in_regs)
117 #[link(name = "context_switch", kind = "static")]
119 fn rust_swap_registers(out_regs: *mut Registers, in_regs: *Registers);
122 // Register contexts used in various architectures
124 // These structures all represent a context of one task throughout its
125 // execution. Each struct is a representation of the architecture's register
126 // set. When swapping between tasks, these register sets are used to save off
127 // the current registers into one struct, and load them all from another.
129 // Note that this is only used for context switching, which means that some of
130 // the registers may go unused. For example, for architectures with
131 // callee/caller saved registers, the context will only reflect the callee-saved
132 // registers. This is because the caller saved registers are already stored
133 // elsewhere on the stack (if it was necessary anyway).
135 // Additionally, there may be fields on various architectures which are unused
136 // entirely because they only reflect what is theoretically possible for a
137 // "complete register set" to show, but user-space cannot alter these registers.
138 // An example of this would be the segment selectors for x86.
140 // These structures/functions are roughly in-sync with the source files inside
141 // of src/rt/arch/$arch. The only currently used function from those folders is
142 // the `rust_swap_registers` function, but that's only because for now segmented
143 // stacks are disabled.
145 #[cfg(target_arch = "x86")]
148 eax: u32, ebx: u32, ecx: u32, edx: u32,
149 ebp: u32, esi: u32, edi: u32, esp: u32,
150 cs: u16, ds: u16, ss: u16, es: u16, fs: u16, gs: u16,
151 eflags: u32, eip: u32
154 #[cfg(target_arch = "x86")]
155 fn new_regs() -> Box<Registers> {
157 eax: 0, ebx: 0, ecx: 0, edx: 0,
158 ebp: 0, esi: 0, edi: 0, esp: 0,
159 cs: 0, ds: 0, ss: 0, es: 0, fs: 0, gs: 0,
164 #[cfg(target_arch = "x86")]
165 fn initialize_call_frame(regs: &mut Registers, fptr: InitFn, arg: uint,
166 procedure: raw::Procedure, sp: *mut uint) {
168 // x86 has interesting stack alignment requirements, so do some alignment
169 // plus some offsetting to figure out what the actual stack should be.
170 let sp = align_down(sp);
171 let sp = mut_offset(sp, -4);
173 unsafe { *mut_offset(sp, 2) = procedure.env as uint };
174 unsafe { *mut_offset(sp, 1) = procedure.code as uint };
175 unsafe { *mut_offset(sp, 0) = arg as uint };
176 let sp = mut_offset(sp, -1);
177 unsafe { *sp = 0 }; // The final return address
179 regs.esp = sp as u32;
180 regs.eip = fptr as u32;
182 // Last base pointer on the stack is 0
186 // windows requires saving more registers (both general and XMM), so the windows
187 // register context must be larger.
188 #[cfg(windows, target_arch = "x86_64")]
189 type Registers = [uint, ..34];
190 #[cfg(not(windows), target_arch = "x86_64")]
191 type Registers = [uint, ..22];
193 #[cfg(windows, target_arch = "x86_64")]
194 fn new_regs() -> Box<Registers> { box() ([0, .. 34]) }
195 #[cfg(not(windows), target_arch = "x86_64")]
196 fn new_regs() -> Box<Registers> { box() ([0, .. 22]) }
198 #[cfg(target_arch = "x86_64")]
199 fn initialize_call_frame(regs: &mut Registers, fptr: InitFn, arg: uint,
200 procedure: raw::Procedure, sp: *mut uint) {
201 extern { fn rust_bootstrap_green_task(); }
203 // Redefinitions from rt/arch/x86_64/regs.h
204 static RUSTRT_RSP: uint = 1;
205 static RUSTRT_IP: uint = 8;
206 static RUSTRT_RBP: uint = 2;
207 static RUSTRT_R12: uint = 4;
208 static RUSTRT_R13: uint = 5;
209 static RUSTRT_R14: uint = 6;
210 static RUSTRT_R15: uint = 7;
212 let sp = align_down(sp);
213 let sp = mut_offset(sp, -1);
215 // The final return address. 0 indicates the bottom of the stack
218 rtdebug!("creating call frame");
219 rtdebug!("fptr {:#x}", fptr as uint);
220 rtdebug!("arg {:#x}", arg);
221 rtdebug!("sp {}", sp);
223 // These registers are frobbed by rust_bootstrap_green_task into the right
224 // location so we can invoke the "real init function", `fptr`.
225 regs[RUSTRT_R12] = arg as uint;
226 regs[RUSTRT_R13] = procedure.code as uint;
227 regs[RUSTRT_R14] = procedure.env as uint;
228 regs[RUSTRT_R15] = fptr as uint;
230 // These registers are picked up by the regular context switch paths. These
231 // will put us in "mostly the right context" except for frobbing all the
232 // arguments to the right place. We have the small trampoline code inside of
233 // rust_bootstrap_green_task to do that.
234 regs[RUSTRT_RSP] = sp as uint;
235 regs[RUSTRT_IP] = rust_bootstrap_green_task as uint;
237 // Last base pointer on the stack should be 0
238 regs[RUSTRT_RBP] = 0;
241 #[cfg(target_arch = "arm")]
242 type Registers = [uint, ..32];
244 #[cfg(target_arch = "arm")]
245 fn new_regs() -> Box<Registers> { box {[0, .. 32]} }
247 #[cfg(target_arch = "arm")]
248 fn initialize_call_frame(regs: &mut Registers, fptr: InitFn, arg: uint,
249 procedure: raw::Procedure, sp: *mut uint) {
250 extern { fn rust_bootstrap_green_task(); }
252 let sp = align_down(sp);
253 // sp of arm eabi is 8-byte aligned
254 let sp = mut_offset(sp, -2);
256 // The final return address. 0 indicates the bottom of the stack
259 // ARM uses the same technique as x86_64 to have a landing pad for the start
260 // of all new green tasks. Neither r1/r2 are saved on a context switch, so
261 // the shim will copy r3/r4 into r1/r2 and then execute the function in r5
262 regs[0] = arg as uint; // r0
263 regs[3] = procedure.code as uint; // r3
264 regs[4] = procedure.env as uint; // r4
265 regs[5] = fptr as uint; // r5
266 regs[13] = sp as uint; // #52 sp, r13
267 regs[14] = rust_bootstrap_green_task as uint; // #56 pc, r14 --> lr
270 #[cfg(target_arch = "mips")]
271 #[cfg(target_arch = "mipsel")]
272 type Registers = [uint, ..32];
274 #[cfg(target_arch = "mips")]
275 #[cfg(target_arch = "mipsel")]
276 fn new_regs() -> Box<Registers> { box {[0, .. 32]} }
278 #[cfg(target_arch = "mips")]
279 #[cfg(target_arch = "mipsel")]
280 fn initialize_call_frame(regs: &mut Registers, fptr: InitFn, arg: uint,
281 procedure: raw::Procedure, sp: *mut uint) {
282 let sp = align_down(sp);
283 // sp of mips o32 is 8-byte aligned
284 let sp = mut_offset(sp, -2);
286 // The final return address. 0 indicates the bottom of the stack
289 regs[4] = arg as uint;
290 regs[5] = procedure.code as uint;
291 regs[6] = procedure.env as uint;
292 regs[29] = sp as uint;
293 regs[25] = fptr as uint;
294 regs[31] = fptr as uint;
297 fn align_down(sp: *mut uint) -> *mut uint {
298 let sp = (sp as uint) & !(16 - 1);
302 // ptr::mut_offset is positive ints only
304 pub fn mut_offset<T>(ptr: *mut T, count: int) -> *mut T {
305 use std::mem::size_of;
306 (ptr as int + count * (size_of::<T>() as int)) as *mut T