diff options
| author | Alex Crichton <alex@alexcrichton.com> | 2013-08-10 20:06:39 -0700 |
|---|---|---|
| committer | Alex Crichton <alex@alexcrichton.com> | 2013-08-27 21:29:11 -0700 |
| commit | 06a7195e9e9cea81854c39ce2c1376fe588bc1b0 (patch) | |
| tree | f71efbc05e978adb420e11fadd397a41683e379f /src/libstd/task | |
| parent | 578e68047736167239c52fa1aba0347011ff1bc3 (diff) | |
| download | rust-06a7195e9e9cea81854c39ce2c1376fe588bc1b0.tar.gz rust-06a7195e9e9cea81854c39ce2c1376fe588bc1b0.zip | |
Consolidate local_data implementations, and cleanup
This moves all local_data stuff into the `local_data` module and only that module alone. It also removes a fair amount of "super-unsafe" code in favor of just vanilla code generated by the compiler at the same time. Closes #8113
Diffstat (limited to 'src/libstd/task')
| -rw-r--r-- | src/libstd/task/local_data_priv.rs | 322 | ||||
| -rw-r--r-- | src/libstd/task/mod.rs | 1 |
2 files changed, 0 insertions, 323 deletions
diff --git a/src/libstd/task/local_data_priv.rs b/src/libstd/task/local_data_priv.rs deleted file mode 100644 index 2c2dfd8f689..00000000000 --- a/src/libstd/task/local_data_priv.rs +++ /dev/null @@ -1,322 +0,0 @@ -// Copyright 2012 The Rust Project Developers. See the COPYRIGHT -// file at the top-level directory of this distribution and at -// http://rust-lang.org/COPYRIGHT. -// -// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or -// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license -// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your -// option. This file may not be copied, modified, or distributed -// except according to those terms. - -#[allow(missing_doc)]; - -use cast; -use libc; -use local_data; -use prelude::*; -use ptr; -use unstable::raw; -use util; - -use rt::task::{Task, LocalStorage}; - -pub enum Handle { - NewHandle(*mut LocalStorage) -} - -impl Handle { - pub fn new() -> Handle { - use rt::local::Local; - unsafe { - let task: *mut Task = Local::unsafe_borrow(); - NewHandle(&mut (*task).storage) - } - } -} - -#[deriving(Eq)] -enum LoanState { - NoLoan, ImmLoan, MutLoan -} - -impl LoanState { - fn describe(&self) -> &'static str { - match *self { - NoLoan => "no loan", - ImmLoan => "immutable", - MutLoan => "mutable" - } - } -} - -trait LocalData {} -impl<T: 'static> LocalData for T {} - -// The task-local-map stores all TLS information for the currently running task. -// It is stored as an owned pointer into the runtime, and it's only allocated -// when TLS is used for the first time. This map must be very carefully -// constructed because it has many mutable loans unsoundly handed out on it to -// the various invocations of TLS requests. -// -// One of the most important operations is loaning a value via `get` to a -// caller. In doing so, the slot that the TLS entry is occupying cannot be -// invalidated because upon returning it's loan state must be updated. Currently -// the TLS map is a vector, but this is possibly dangerous because the vector -// can be reallocated/moved when new values are pushed onto it. -// -// This problem currently isn't solved in a very elegant way. Inside the `get` -// function, it internally "invalidates" all references after the loan is -// finished and looks up into the vector again. In theory this will prevent -// pointers from being moved under our feet so long as LLVM doesn't go too crazy -// with the optimizations. -// -// n.b. Other structures are not sufficient right now: -// * HashMap uses ~[T] internally (push reallocates/moves) -// * TreeMap is plausible, but it's in extra -// * dlist plausible, but not in std -// * a custom owned linked list was attempted, but difficult to write -// and involved a lot of extra code bloat -// -// n.b. Has to be stored with a pointer at outermost layer; the foreign call -// returns void *. -// -// n.b. If TLS is used heavily in future, this could be made more efficient with -// a proper map. -type TaskLocalMap = ~[Option<(*libc::c_void, TLSValue, LoanState)>]; -type TLSValue = ~LocalData:; - -fn cleanup_task_local_map(map_ptr: *libc::c_void) { - unsafe { - assert!(!map_ptr.is_null()); - // Get and keep the single reference that was created at the - // beginning. - let _map: TaskLocalMap = cast::transmute(map_ptr); - // All local_data will be destroyed along with the map. - } -} - -// Gets the map from the runtime. Lazily initialises if not done so already. -unsafe fn get_local_map(handle: Handle) -> &mut TaskLocalMap { - - unsafe fn newsched_map(local: *mut LocalStorage) -> &mut TaskLocalMap { - // This is based on the same idea as the oldsched code above. - match &mut *local { - // If the at_exit function is already set, then we just need to take - // a loan out on the TLS map stored inside - &LocalStorage(ref mut map_ptr, Some(_)) => { - assert!(map_ptr.is_not_null()); - return cast::transmute(map_ptr); - } - // If this is the first time we've accessed TLS, perform similar - // actions to the oldsched way of doing things. - &LocalStorage(ref mut map_ptr, ref mut at_exit) => { - assert!(map_ptr.is_null()); - assert!(at_exit.is_none()); - let map: TaskLocalMap = ~[]; - *map_ptr = cast::transmute(map); - *at_exit = Some(cleanup_task_local_map); - return cast::transmute(map_ptr); - } - } - } - - match handle { - NewHandle(local_storage) => newsched_map(local_storage) - } -} - -unsafe fn key_to_key_value<T: 'static>(key: local_data::Key<T>) -> *libc::c_void { - let pair: raw::Closure = cast::transmute_copy(&key); - return pair.code as *libc::c_void; -} - -pub unsafe fn local_pop<T: 'static>(handle: Handle, - key: local_data::Key<T>) -> Option<T> { - let map = get_local_map(handle); - let key_value = key_to_key_value(key); - - for entry in map.mut_iter() { - match *entry { - Some((k, _, loan)) if k == key_value => { - if loan != NoLoan { - fail!("TLS value cannot be removed because it is already \ - borrowed as %s", loan.describe()); - } - // Move the data out of the `entry` slot via util::replace. This - // is guaranteed to succeed because we already matched on `Some` - // above. - let data = match util::replace(entry, None) { - Some((_, data, _)) => data, - None => abort(), - }; - - // Move `data` into transmute to get out the memory that it - // owns, we must free it manually later. - let (_vtable, box): (uint, ~~T) = cast::transmute(data); - - // Read the box's value (using the compiler's built-in - // auto-deref functionality to obtain a pointer to the base) - let ret = ptr::read_ptr(cast::transmute::<&T, *mut T>(*box)); - - // Finally free the allocated memory. we don't want this to - // actually touch the memory inside because it's all duplicated - // now, so the box is transmuted to a 0-sized type. We also use - // a type which references `T` because currently the layout - // could depend on whether T contains managed pointers or not. - let _: ~~[T, ..0] = cast::transmute(box); - - // Everything is now deallocated, and we own the value that was - // located inside TLS, so we now return it. - return Some(ret); - } - _ => {} - } - } - return None; -} - -pub unsafe fn local_get<T: 'static, U>(handle: Handle, - key: local_data::Key<T>, - f: &fn(Option<&T>) -> U) -> U { - local_get_with(handle, key, ImmLoan, f) -} - -pub unsafe fn local_get_mut<T: 'static, U>(handle: Handle, - key: local_data::Key<T>, - f: &fn(Option<&mut T>) -> U) -> U { - do local_get_with(handle, key, MutLoan) |x| { - match x { - None => f(None), - // We're violating a lot of compiler guarantees with this - // invocation of `transmute_mut`, but we're doing runtime checks to - // ensure that it's always valid (only one at a time). - // - // there is no need to be upset! - Some(x) => { f(Some(cast::transmute_mut(x))) } - } - } -} - -unsafe fn local_get_with<T: 'static, U>(handle: Handle, - key: local_data::Key<T>, - state: LoanState, - f: &fn(Option<&T>) -> U) -> U { - // This function must be extremely careful. Because TLS can store owned - // values, and we must have some form of `get` function other than `pop`, - // this function has to give a `&` reference back to the caller. - // - // One option is to return the reference, but this cannot be sound because - // the actual lifetime of the object is not known. The slot in TLS could not - // be modified until the object goes out of scope, but the TLS code cannot - // know when this happens. - // - // For this reason, the reference is yielded to a specified closure. This - // way the TLS code knows exactly what the lifetime of the yielded pointer - // is, allowing callers to acquire references to owned data. This is also - // sound so long as measures are taken to ensure that while a TLS slot is - // loaned out to a caller, it's not modified recursively. - let map = get_local_map(handle); - let key_value = key_to_key_value(key); - - let pos = map.iter().position(|entry| { - match *entry { - Some((k, _, _)) if k == key_value => true, _ => false - } - }); - match pos { - None => { return f(None); } - Some(i) => { - let ret; - let mut return_loan = false; - match map[i] { - Some((_, ref data, ref mut loan)) => { - match (state, *loan) { - (_, NoLoan) => { - *loan = state; - return_loan = true; - } - (ImmLoan, ImmLoan) => {} - (want, cur) => { - fail!("TLS slot cannot be borrowed as %s because \ - it is already borrowed as %s", - want.describe(), cur.describe()); - } - } - // data was created with `~~T as ~LocalData`, so we extract - // pointer part of the trait, (as ~~T), and then use - // compiler coercions to achieve a '&' pointer. - match *cast::transmute::<&TLSValue, &(uint, ~~T)>(data) { - (_vtable, ref box) => { - let value: &T = **box; - ret = f(Some(value)); - } - } - } - _ => abort() - } - - // n.b. 'data' and 'loans' are both invalid pointers at the point - // 'f' returned because `f` could have appended more TLS items which - // in turn relocated the vector. Hence we do another lookup here to - // fixup the loans. - if return_loan { - match map[i] { - Some((_, _, ref mut loan)) => { *loan = NoLoan; } - None => { abort(); } - } - } - return ret; - } - } -} - -fn abort() -> ! { - #[fixed_stack_segment]; #[inline(never)]; - - unsafe { libc::abort() } -} - -pub unsafe fn local_set<T: 'static>(handle: Handle, - key: local_data::Key<T>, - data: T) { - let map = get_local_map(handle); - let keyval = key_to_key_value(key); - - // When the task-local map is destroyed, all the data needs to be cleaned - // up. For this reason we can't do some clever tricks to store '~T' as a - // '*c_void' or something like that. To solve the problem, we cast - // everything to a trait (LocalData) which is then stored inside the map. - // Upon destruction of the map, all the objects will be destroyed and the - // traits have enough information about them to destroy themselves. - // - // FIXME(#7673): This should be "~data as ~LocalData" (without the colon at - // the end, and only one sigil) - let data = ~~data as ~LocalData:; - - fn insertion_position(map: &mut TaskLocalMap, - key: *libc::c_void) -> Option<uint> { - // First see if the map contains this key already - let curspot = map.iter().position(|entry| { - match *entry { - Some((ekey, _, loan)) if key == ekey => { - if loan != NoLoan { - fail!("TLS value cannot be overwritten because it is - already borrowed as %s", loan.describe()) - } - true - } - _ => false, - } - }); - // If it doesn't contain the key, just find a slot that's None - match curspot { - Some(i) => Some(i), - None => map.iter().position(|entry| entry.is_none()) - } - } - - match insertion_position(map, keyval) { - Some(i) => { map[i] = Some((keyval, data, NoLoan)); } - None => { map.push(Some((keyval, data, NoLoan))); } - } -} diff --git a/src/libstd/task/mod.rs b/src/libstd/task/mod.rs index c0b331c52ee..b52dd3a906b 100644 --- a/src/libstd/task/mod.rs +++ b/src/libstd/task/mod.rs @@ -52,7 +52,6 @@ use util; #[cfg(test)] use ptr; #[cfg(test)] use task; -mod local_data_priv; pub mod spawn; /** |
