2013-05-04 18:51:05 -05:00
|
|
|
// Copyright 2013 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.
|
|
|
|
|
2013-12-24 10:08:28 -06:00
|
|
|
/*! Task-local reference-counted boxes (`Rc` type)
|
2013-05-28 22:11:41 -05:00
|
|
|
|
2013-10-10 10:45:52 -05:00
|
|
|
The `Rc` type provides shared ownership of an immutable value. Destruction is deterministic, and
|
|
|
|
will occur as soon as the last owner is gone. It is marked as non-sendable because it avoids the
|
|
|
|
overhead of atomic reference counting.
|
2013-05-04 18:51:05 -05:00
|
|
|
|
|
|
|
*/
|
|
|
|
|
2013-10-10 10:45:52 -05:00
|
|
|
use ptr::RawPtr;
|
|
|
|
use unstable::intrinsics::transmute;
|
|
|
|
use ops::Drop;
|
|
|
|
use kinds::{Freeze, Send};
|
|
|
|
use clone::{Clone, DeepClone};
|
2013-11-21 23:30:34 -06:00
|
|
|
use cell::RefCell;
|
2013-11-24 10:29:44 -06:00
|
|
|
use cmp::{Eq, TotalEq, Ord, TotalOrd, Ordering};
|
2013-07-24 07:11:49 -05:00
|
|
|
|
2013-05-04 18:51:05 -05:00
|
|
|
struct RcBox<T> {
|
|
|
|
value: T,
|
|
|
|
count: uint
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Immutable reference counted pointer type
|
2013-06-27 15:45:09 -05:00
|
|
|
#[unsafe_no_drop_flag]
|
2013-06-28 16:33:58 -05:00
|
|
|
#[no_send]
|
2013-05-04 18:51:05 -05:00
|
|
|
pub struct Rc<T> {
|
2013-10-10 10:45:52 -05:00
|
|
|
priv ptr: *mut RcBox<T>
|
2013-05-15 17:06:22 -05:00
|
|
|
}
|
|
|
|
|
2013-07-24 07:11:49 -05:00
|
|
|
impl<T: Freeze> Rc<T> {
|
2013-10-10 10:45:52 -05:00
|
|
|
/// Construct a new reference-counted box from a `Freeze` value
|
|
|
|
#[inline]
|
|
|
|
pub fn new(value: T) -> Rc<T> {
|
|
|
|
unsafe {
|
|
|
|
Rc::new_unchecked(value)
|
|
|
|
}
|
2013-07-24 07:11:49 -05:00
|
|
|
}
|
2013-05-15 17:06:22 -05:00
|
|
|
}
|
2013-05-04 18:51:05 -05:00
|
|
|
|
2013-11-06 16:56:22 -06:00
|
|
|
impl<T: Send> Rc<T> {
|
|
|
|
/// Construct a new reference-counted box from a `Send` value
|
|
|
|
#[inline]
|
|
|
|
pub fn from_send(value: T) -> Rc<T> {
|
|
|
|
unsafe {
|
|
|
|
Rc::new_unchecked(value)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-11-21 23:30:34 -06:00
|
|
|
impl<T: Freeze> Rc<RefCell<T>> {
|
|
|
|
/// Construct a new reference-counted box from a `RefCell`-wrapped `Freeze` value
|
2013-11-16 23:59:42 -06:00
|
|
|
#[inline]
|
2013-11-21 23:30:34 -06:00
|
|
|
pub fn from_mut(value: RefCell<T>) -> Rc<RefCell<T>> {
|
2013-11-16 23:59:42 -06:00
|
|
|
unsafe {
|
|
|
|
Rc::new_unchecked(value)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-05-31 17:17:22 -05:00
|
|
|
impl<T> Rc<T> {
|
2013-10-10 10:45:52 -05:00
|
|
|
/// Unsafety construct a new reference-counted box from any value.
|
|
|
|
///
|
2013-11-06 16:56:22 -06:00
|
|
|
/// It is possible to create cycles, which will leak, and may interact
|
|
|
|
/// poorly with managed pointers.
|
2013-06-18 16:45:18 -05:00
|
|
|
#[inline]
|
2013-10-10 10:45:52 -05:00
|
|
|
pub unsafe fn new_unchecked(value: T) -> Rc<T> {
|
|
|
|
Rc{ptr: transmute(~RcBox{value: value, count: 1})}
|
2013-05-04 18:51:05 -05:00
|
|
|
}
|
|
|
|
|
2013-10-10 10:45:52 -05:00
|
|
|
/// Borrow the value contained in the reference-counted box
|
|
|
|
#[inline]
|
|
|
|
pub fn borrow<'r>(&'r self) -> &'r T {
|
|
|
|
unsafe { &(*self.ptr).value }
|
2013-05-04 18:51:05 -05:00
|
|
|
}
|
2013-11-24 10:29:44 -06:00
|
|
|
|
|
|
|
/// Determine if two reference-counted pointers point to the same object
|
|
|
|
#[inline]
|
|
|
|
pub fn ptr_eq(&self, other: &Rc<T>) -> bool {
|
|
|
|
self.ptr == other.ptr
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
impl<T: Eq> Eq for Rc<T> {
|
|
|
|
#[inline]
|
|
|
|
fn eq(&self, other: &Rc<T>) -> bool {
|
|
|
|
unsafe { (*self.ptr).value == (*other.ptr).value }
|
|
|
|
}
|
|
|
|
|
|
|
|
#[inline]
|
|
|
|
fn ne(&self, other: &Rc<T>) -> bool {
|
|
|
|
unsafe { (*self.ptr).value != (*other.ptr).value }
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
impl<T: TotalEq> TotalEq for Rc<T> {
|
|
|
|
#[inline]
|
|
|
|
fn equals(&self, other: &Rc<T>) -> bool {
|
|
|
|
unsafe { (*self.ptr).value.equals(&(*other.ptr).value) }
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
impl<T: Ord> Ord for Rc<T> {
|
|
|
|
#[inline]
|
|
|
|
fn lt(&self, other: &Rc<T>) -> bool {
|
|
|
|
unsafe { (*self.ptr).value < (*other.ptr).value }
|
|
|
|
}
|
|
|
|
|
|
|
|
#[inline]
|
|
|
|
fn le(&self, other: &Rc<T>) -> bool {
|
|
|
|
unsafe { (*self.ptr).value <= (*other.ptr).value }
|
|
|
|
}
|
|
|
|
|
|
|
|
#[inline]
|
|
|
|
fn ge(&self, other: &Rc<T>) -> bool {
|
|
|
|
unsafe { (*self.ptr).value >= (*other.ptr).value }
|
|
|
|
}
|
|
|
|
|
|
|
|
#[inline]
|
|
|
|
fn gt(&self, other: &Rc<T>) -> bool {
|
|
|
|
unsafe { (*self.ptr).value > (*other.ptr).value }
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
impl<T: TotalOrd> TotalOrd for Rc<T> {
|
|
|
|
#[inline]
|
|
|
|
fn cmp(&self, other: &Rc<T>) -> Ordering {
|
|
|
|
unsafe { (*self.ptr).value.cmp(&(*other.ptr).value) }
|
|
|
|
}
|
2013-05-04 18:51:05 -05:00
|
|
|
}
|
|
|
|
|
2013-05-15 17:06:22 -05:00
|
|
|
impl<T> Clone for Rc<T> {
|
2013-05-04 18:51:05 -05:00
|
|
|
#[inline]
|
|
|
|
fn clone(&self) -> Rc<T> {
|
|
|
|
unsafe {
|
|
|
|
(*self.ptr).count += 1;
|
2013-05-07 11:57:28 -05:00
|
|
|
Rc{ptr: self.ptr}
|
2013-05-04 18:51:05 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-05-15 17:06:22 -05:00
|
|
|
impl<T: DeepClone> DeepClone for Rc<T> {
|
2013-05-14 23:45:40 -05:00
|
|
|
#[inline]
|
|
|
|
fn deep_clone(&self) -> Rc<T> {
|
2013-10-10 10:45:52 -05:00
|
|
|
unsafe { Rc::new_unchecked(self.borrow().deep_clone()) }
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
#[unsafe_destructor]
|
|
|
|
impl<T> Drop for Rc<T> {
|
|
|
|
fn drop(&mut self) {
|
|
|
|
unsafe {
|
|
|
|
if self.ptr.is_not_null() {
|
|
|
|
(*self.ptr).count -= 1;
|
|
|
|
if (*self.ptr).count == 0 {
|
|
|
|
let _: ~RcBox<T> = transmute(self.ptr);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2013-05-14 23:45:40 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-05-04 18:51:05 -05:00
|
|
|
#[cfg(test)]
|
|
|
|
mod test_rc {
|
|
|
|
use super::*;
|
2013-11-21 23:30:34 -06:00
|
|
|
use cell::RefCell;
|
2013-05-14 23:45:40 -05:00
|
|
|
|
|
|
|
#[test]
|
|
|
|
fn test_clone() {
|
2013-11-21 23:30:34 -06:00
|
|
|
let x = Rc::from_send(RefCell::new(5));
|
2013-11-06 16:56:22 -06:00
|
|
|
let y = x.clone();
|
2013-11-20 16:17:12 -06:00
|
|
|
x.borrow().with_mut(|inner| {
|
2013-11-06 16:56:22 -06:00
|
|
|
*inner = 20;
|
2013-11-20 16:17:12 -06:00
|
|
|
});
|
2013-11-16 13:19:25 -06:00
|
|
|
assert_eq!(y.borrow().with(|v| *v), 20);
|
2013-05-14 23:45:40 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
fn test_deep_clone() {
|
2013-11-21 23:30:34 -06:00
|
|
|
let x = Rc::from_send(RefCell::new(5));
|
2013-11-06 16:56:22 -06:00
|
|
|
let y = x.deep_clone();
|
2013-11-20 16:17:12 -06:00
|
|
|
x.borrow().with_mut(|inner| {
|
2013-11-06 16:56:22 -06:00
|
|
|
*inner = 20;
|
2013-11-20 16:17:12 -06:00
|
|
|
});
|
2013-11-16 13:19:25 -06:00
|
|
|
assert_eq!(y.borrow().with(|v| *v), 5);
|
2013-05-14 23:45:40 -05:00
|
|
|
}
|
2013-05-04 18:51:05 -05:00
|
|
|
|
|
|
|
#[test]
|
|
|
|
fn test_simple() {
|
2013-10-10 10:45:52 -05:00
|
|
|
let x = Rc::new(5);
|
2013-05-04 18:51:05 -05:00
|
|
|
assert_eq!(*x.borrow(), 5);
|
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
2013-05-15 01:23:12 -05:00
|
|
|
fn test_simple_clone() {
|
2013-10-10 10:45:52 -05:00
|
|
|
let x = Rc::new(5);
|
2013-05-04 18:51:05 -05:00
|
|
|
let y = x.clone();
|
|
|
|
assert_eq!(*x.borrow(), 5);
|
|
|
|
assert_eq!(*y.borrow(), 5);
|
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
fn test_destructor() {
|
2013-11-06 16:56:22 -06:00
|
|
|
let x = Rc::from_send(~5);
|
|
|
|
assert_eq!(**x.borrow(), 5);
|
2013-05-04 18:51:05 -05:00
|
|
|
}
|
2013-11-16 23:59:42 -06:00
|
|
|
|
|
|
|
#[test]
|
|
|
|
fn test_from_mut() {
|
|
|
|
let a = 10;
|
2013-11-21 23:30:34 -06:00
|
|
|
let _x = Rc::from_mut(RefCell::new(&a));
|
2013-11-16 23:59:42 -06:00
|
|
|
}
|
2013-05-04 18:51:05 -05:00
|
|
|
}
|