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 //! Thread-local reference-counted boxes (the `Rc<T>` type).
15 //! The `Rc<T>` type provides shared ownership of an immutable value.
16 //! Destruction is deterministic, and will occur as soon as the last owner is
17 //! gone. It is marked as non-sendable because it avoids the overhead of atomic
18 //! reference counting.
20 //! The `downgrade` method can be used to create a non-owning `Weak<T>` pointer
21 //! to the box. A `Weak<T>` pointer can be upgraded to an `Rc<T>` pointer, but
22 //! will return `None` if the value has already been dropped.
24 //! For example, a tree with parent pointers can be represented by putting the
25 //! nodes behind strong `Rc<T>` pointers, and then storing the parent pointers
26 //! as `Weak<T>` pointers.
30 //! Consider a scenario where a set of `Gadget`s are owned by a given `Owner`.
31 //! We want to have our `Gadget`s point to their `Owner`. We can't do this with
32 //! unique ownership, because more than one gadget may belong to the same
33 //! `Owner`. `Rc<T>` allows us to share an `Owner` between multiple `Gadget`s,
34 //! and have the `Owner` remain allocated as long as any `Gadget` points at it.
41 //! // ...other fields
47 //! // ...other fields
51 //! // Create a reference counted Owner.
52 //! let gadget_owner : Rc<Owner> = Rc::new(
53 //! Owner { name: String::from("Gadget Man") }
56 //! // Create Gadgets belonging to gadget_owner. To increment the reference
57 //! // count we clone the `Rc<T>` object.
58 //! let gadget1 = Gadget { id: 1, owner: gadget_owner.clone() };
59 //! let gadget2 = Gadget { id: 2, owner: gadget_owner.clone() };
61 //! drop(gadget_owner);
63 //! // Despite dropping gadget_owner, we're still able to print out the name
64 //! // of the Owner of the Gadgets. This is because we've only dropped the
65 //! // reference count object, not the Owner it wraps. As long as there are
66 //! // other `Rc<T>` objects pointing at the same Owner, it will remain
67 //! // allocated. Notice that the `Rc<T>` wrapper around Gadget.owner gets
68 //! // automatically dereferenced for us.
69 //! println!("Gadget {} owned by {}", gadget1.id, gadget1.owner.name);
70 //! println!("Gadget {} owned by {}", gadget2.id, gadget2.owner.name);
72 //! // At the end of the method, gadget1 and gadget2 get destroyed, and with
73 //! // them the last counted references to our Owner. Gadget Man now gets
74 //! // destroyed as well.
78 //! If our requirements change, and we also need to be able to traverse from
79 //! Owner → Gadget, we will run into problems: an `Rc<T>` pointer from Owner
80 //! → Gadget introduces a cycle between the objects. This means that their
81 //! reference counts can never reach 0, and the objects will remain allocated: a
82 //! memory leak. In order to get around this, we can use `Weak<T>` pointers.
83 //! These pointers don't contribute to the total count.
85 //! Rust actually makes it somewhat difficult to produce this loop in the first
86 //! place: in order to end up with two objects that point at each other, one of
87 //! them needs to be mutable. This is problematic because `Rc<T>` enforces
88 //! memory safety by only giving out shared references to the object it wraps,
89 //! and these don't allow direct mutation. We need to wrap the part of the
90 //! object we wish to mutate in a `RefCell`, which provides *interior
91 //! mutability*: a method to achieve mutability through a shared reference.
92 //! `RefCell` enforces Rust's borrowing rules at runtime. Read the `Cell`
93 //! documentation for more details on interior mutability.
97 //! use std::rc::Weak;
98 //! use std::cell::RefCell;
102 //! gadgets: RefCell<Vec<Weak<Gadget>>>,
103 //! // ...other fields
108 //! owner: Rc<Owner>,
109 //! // ...other fields
113 //! // Create a reference counted Owner. Note the fact that we've put the
114 //! // Owner's vector of Gadgets inside a RefCell so that we can mutate it
115 //! // through a shared reference.
116 //! let gadget_owner : Rc<Owner> = Rc::new(
118 //! name: "Gadget Man".to_string(),
119 //! gadgets: RefCell::new(Vec::new()),
123 //! // Create Gadgets belonging to gadget_owner as before.
124 //! let gadget1 = Rc::new(Gadget{id: 1, owner: gadget_owner.clone()});
125 //! let gadget2 = Rc::new(Gadget{id: 2, owner: gadget_owner.clone()});
127 //! // Add the Gadgets to their Owner. To do this we mutably borrow from
128 //! // the RefCell holding the Owner's Gadgets.
129 //! gadget_owner.gadgets.borrow_mut().push(Rc::downgrade(&gadget1));
130 //! gadget_owner.gadgets.borrow_mut().push(Rc::downgrade(&gadget2));
132 //! // Iterate over our Gadgets, printing their details out
133 //! for gadget_opt in gadget_owner.gadgets.borrow().iter() {
135 //! // gadget_opt is a Weak<Gadget>. Since weak pointers can't guarantee
136 //! // that their object is still allocated, we need to call upgrade()
137 //! // on them to turn them into a strong reference. This returns an
138 //! // Option, which contains a reference to our object if it still
140 //! let gadget = gadget_opt.upgrade().unwrap();
141 //! println!("Gadget {} owned by {}", gadget.id, gadget.owner.name);
144 //! // At the end of the method, gadget_owner, gadget1 and gadget2 get
145 //! // destroyed. There are now no strong (`Rc<T>`) references to the gadgets.
146 //! // Once they get destroyed, the Gadgets get destroyed. This zeroes the
147 //! // reference count on Gadget Man, they get destroyed as well.
151 #![stable(feature = "rust1", since = "1.0.0")]
159 use core
::cell
::Cell
;
160 use core
::cmp
::Ordering
;
162 use core
::hash
::{Hasher, Hash}
;
163 use core
::intrinsics
::{assume, abort}
;
165 use core
::marker
::Unsize
;
166 use core
::mem
::{self, align_of_val, size_of_val, forget, uninitialized}
;
167 use core
::ops
::Deref
;
168 use core
::ops
::CoerceUnsized
;
169 use core
::ptr
::{self, Shared}
;
170 use core
::convert
::From
;
172 use heap
::deallocate
;
174 struct RcBox
<T
: ?Sized
> {
181 /// A reference-counted pointer type over an immutable value.
183 /// See the [module level documentation](./index.html) for more details.
184 #[unsafe_no_drop_flag]
185 #[stable(feature = "rust1", since = "1.0.0")]
186 pub struct Rc
<T
: ?Sized
> {
187 // FIXME #12808: strange names to try to avoid interfering with field
188 // accesses of the contained type via Deref
189 _ptr
: Shared
<RcBox
<T
>>,
192 #[stable(feature = "rust1", since = "1.0.0")]
193 impl<T
: ?Sized
> !marker
::Send
for Rc
<T
> {}
194 #[stable(feature = "rust1", since = "1.0.0")]
195 impl<T
: ?Sized
> !marker
::Sync
for Rc
<T
> {}
197 #[unstable(feature = "coerce_unsized", issue = "27732")]
198 impl<T
: ?Sized
+ Unsize
<U
>, U
: ?Sized
> CoerceUnsized
<Rc
<U
>> for Rc
<T
> {}
201 /// Constructs a new `Rc<T>`.
208 /// let five = Rc::new(5);
210 #[stable(feature = "rust1", since = "1.0.0")]
211 pub fn new(value
: T
) -> Rc
<T
> {
214 // there is an implicit weak pointer owned by all the strong
215 // pointers, which ensures that the weak destructor never frees
216 // the allocation while the strong destructor is running, even
217 // if the weak pointer is stored inside the strong one.
218 _ptr
: Shared
::new(Box
::into_raw(box RcBox
{
219 strong
: Cell
::new(1),
227 /// Unwraps the contained value if the `Rc<T>` has only one strong reference.
228 /// This will succeed even if there are outstanding weak references.
230 /// Otherwise, an `Err` is returned with the same `Rc<T>`.
237 /// let x = Rc::new(3);
238 /// assert_eq!(Rc::try_unwrap(x), Ok(3));
240 /// let x = Rc::new(4);
241 /// let _y = x.clone();
242 /// assert_eq!(Rc::try_unwrap(x), Err(Rc::new(4)));
245 #[stable(feature = "rc_unique", since = "1.4.0")]
246 pub fn try_unwrap(this
: Self) -> Result
<T
, Self> {
247 if Rc
::would_unwrap(&this
) {
249 let val
= ptr
::read(&*this
); // copy the contained object
251 // Indicate to Weaks that they can't be promoted by decrememting
252 // the strong count, and then remove the implicit "strong weak"
253 // pointer while also handling drop logic by just crafting a
256 let _weak
= Weak { _ptr: this._ptr }
;
265 /// Checks if `Rc::try_unwrap` would return `Ok`.
266 #[unstable(feature = "rc_would_unwrap",
267 reason
= "just added for niche usecase",
269 pub fn would_unwrap(this
: &Self) -> bool
{
270 Rc
::strong_count(&this
) == 1
274 impl<T
: ?Sized
> Rc
<T
> {
275 /// Downgrades the `Rc<T>` to a `Weak<T>` reference.
282 /// let five = Rc::new(5);
284 /// let weak_five = Rc::downgrade(&five);
286 #[stable(feature = "rc_weak", since = "1.4.0")]
287 pub fn downgrade(this
: &Self) -> Weak
<T
> {
289 Weak { _ptr: this._ptr }
292 /// Get the number of weak references to this value.
294 #[unstable(feature = "rc_counts", reason = "not clearly useful",
296 pub fn weak_count(this
: &Self) -> usize {
300 /// Get the number of strong references to this value.
302 #[unstable(feature = "rc_counts", reason = "not clearly useful",
304 pub fn strong_count(this
: &Self) -> usize {
308 /// Returns true if there are no other `Rc` or `Weak<T>` values that share
309 /// the same inner value.
314 /// #![feature(rc_counts)]
318 /// let five = Rc::new(5);
320 /// assert!(Rc::is_unique(&five));
323 #[unstable(feature = "rc_counts", reason = "uniqueness has unclear meaning",
325 pub fn is_unique(this
: &Self) -> bool
{
326 Rc
::weak_count(this
) == 0 && Rc
::strong_count(this
) == 1
329 /// Returns a mutable reference to the contained value if the `Rc<T>` has
330 /// one strong reference and no weak references.
332 /// Returns `None` if the `Rc<T>` is not unique.
339 /// let mut x = Rc::new(3);
340 /// *Rc::get_mut(&mut x).unwrap() = 4;
341 /// assert_eq!(*x, 4);
343 /// let _y = x.clone();
344 /// assert!(Rc::get_mut(&mut x).is_none());
347 #[stable(feature = "rc_unique", since = "1.4.0")]
348 pub fn get_mut(this
: &mut Self) -> Option
<&mut T
> {
349 if Rc
::is_unique(this
) {
350 let inner
= unsafe { &mut **this._ptr }
;
351 Some(&mut inner
.value
)
358 impl<T
: Clone
> Rc
<T
> {
359 /// Make a mutable reference into the given `Rc<T>` by cloning the inner
360 /// data if the `Rc<T>` doesn't have one strong reference and no weak
363 /// This is also referred to as a copy-on-write.
370 /// let mut data = Rc::new(5);
372 /// *Rc::make_mut(&mut data) += 1; // Won't clone anything
373 /// let mut other_data = data.clone(); // Won't clone inner data
374 /// *Rc::make_mut(&mut data) += 1; // Clones inner data
375 /// *Rc::make_mut(&mut data) += 1; // Won't clone anything
376 /// *Rc::make_mut(&mut other_data) *= 2; // Won't clone anything
378 /// // Note: data and other_data now point to different numbers
379 /// assert_eq!(*data, 8);
380 /// assert_eq!(*other_data, 12);
384 #[stable(feature = "rc_unique", since = "1.4.0")]
385 pub fn make_mut(this
: &mut Self) -> &mut T
{
386 if Rc
::strong_count(this
) != 1 {
387 // Gotta clone the data, there are other Rcs
388 *this
= Rc
::new((**this
).clone())
389 } else if Rc
::weak_count(this
) != 0 {
390 // Can just steal the data, all that's left is Weaks
392 let mut swap
= Rc
::new(ptr
::read(&(**this
._ptr
).value
));
393 mem
::swap(this
, &mut swap
);
395 // Remove implicit strong-weak ref (no need to craft a fake
396 // Weak here -- we know other Weaks can clean up for us)
401 // This unsafety is ok because we're guaranteed that the pointer
402 // returned is the *only* pointer that will ever be returned to T. Our
403 // reference count is guaranteed to be 1 at this point, and we required
404 // the `Rc<T>` itself to be `mut`, so we're returning the only possible
405 // reference to the inner value.
406 let inner
= unsafe { &mut **this._ptr }
;
411 #[stable(feature = "rust1", since = "1.0.0")]
412 impl<T
: ?Sized
> Deref
for Rc
<T
> {
416 fn deref(&self) -> &T
{
421 #[stable(feature = "rust1", since = "1.0.0")]
422 impl<T
: ?Sized
> Drop
for Rc
<T
> {
423 /// Drops the `Rc<T>`.
425 /// This will decrement the strong reference count. If the strong reference
426 /// count becomes zero and the only other references are `Weak<T>` ones,
427 /// `drop`s the inner value.
435 /// let five = Rc::new(5);
439 /// drop(five); // explicit drop
442 /// let five = Rc::new(5);
446 /// } // implicit drop
448 #[unsafe_destructor_blind_to_params]
451 let ptr
= *self._ptr
;
452 let thin
= ptr
as *const ();
454 if thin
as usize != mem
::POST_DROP_USIZE
{
456 if self.strong() == 0 {
457 // destroy the contained object
458 ptr
::drop_in_place(&mut (*ptr
).value
);
460 // remove the implicit "strong weak" pointer now that we've
461 // destroyed the contents.
464 if self.weak() == 0 {
465 deallocate(ptr
as *mut u8, size_of_val(&*ptr
), align_of_val(&*ptr
))
473 #[stable(feature = "rust1", since = "1.0.0")]
474 impl<T
: ?Sized
> Clone
for Rc
<T
> {
475 /// Makes a clone of the `Rc<T>`.
477 /// When you clone an `Rc<T>`, it will create another pointer to the data and
478 /// increase the strong reference counter.
485 /// let five = Rc::new(5);
490 fn clone(&self) -> Rc
<T
> {
492 Rc { _ptr: self._ptr }
496 #[stable(feature = "rust1", since = "1.0.0")]
497 impl<T
: Default
> Default
for Rc
<T
> {
498 /// Creates a new `Rc<T>`, with the `Default` value for `T`.
505 /// let x: Rc<i32> = Default::default();
508 fn default() -> Rc
<T
> {
509 Rc
::new(Default
::default())
513 #[stable(feature = "rust1", since = "1.0.0")]
514 impl<T
: ?Sized
+ PartialEq
> PartialEq
for Rc
<T
> {
515 /// Equality for two `Rc<T>`s.
517 /// Two `Rc<T>`s are equal if their inner value are equal.
524 /// let five = Rc::new(5);
526 /// five == Rc::new(5);
529 fn eq(&self, other
: &Rc
<T
>) -> bool
{
533 /// Inequality for two `Rc<T>`s.
535 /// Two `Rc<T>`s are unequal if their inner value are unequal.
542 /// let five = Rc::new(5);
544 /// five != Rc::new(5);
547 fn ne(&self, other
: &Rc
<T
>) -> bool
{
552 #[stable(feature = "rust1", since = "1.0.0")]
553 impl<T
: ?Sized
+ Eq
> Eq
for Rc
<T
> {}
555 #[stable(feature = "rust1", since = "1.0.0")]
556 impl<T
: ?Sized
+ PartialOrd
> PartialOrd
for Rc
<T
> {
557 /// Partial comparison for two `Rc<T>`s.
559 /// The two are compared by calling `partial_cmp()` on their inner values.
566 /// let five = Rc::new(5);
568 /// five.partial_cmp(&Rc::new(5));
571 fn partial_cmp(&self, other
: &Rc
<T
>) -> Option
<Ordering
> {
572 (**self).partial_cmp(&**other
)
575 /// Less-than comparison for two `Rc<T>`s.
577 /// The two are compared by calling `<` on their inner values.
584 /// let five = Rc::new(5);
586 /// five < Rc::new(5);
589 fn lt(&self, other
: &Rc
<T
>) -> bool
{
593 /// 'Less-than or equal to' comparison for two `Rc<T>`s.
595 /// The two are compared by calling `<=` on their inner values.
602 /// let five = Rc::new(5);
604 /// five <= Rc::new(5);
607 fn le(&self, other
: &Rc
<T
>) -> bool
{
611 /// Greater-than comparison for two `Rc<T>`s.
613 /// The two are compared by calling `>` on their inner values.
620 /// let five = Rc::new(5);
622 /// five > Rc::new(5);
625 fn gt(&self, other
: &Rc
<T
>) -> bool
{
629 /// 'Greater-than or equal to' comparison for two `Rc<T>`s.
631 /// The two are compared by calling `>=` on their inner values.
638 /// let five = Rc::new(5);
640 /// five >= Rc::new(5);
643 fn ge(&self, other
: &Rc
<T
>) -> bool
{
648 #[stable(feature = "rust1", since = "1.0.0")]
649 impl<T
: ?Sized
+ Ord
> Ord
for Rc
<T
> {
650 /// Comparison for two `Rc<T>`s.
652 /// The two are compared by calling `cmp()` on their inner values.
659 /// let five = Rc::new(5);
661 /// five.partial_cmp(&Rc::new(5));
664 fn cmp(&self, other
: &Rc
<T
>) -> Ordering
{
665 (**self).cmp(&**other
)
669 #[stable(feature = "rust1", since = "1.0.0")]
670 impl<T
: ?Sized
+ Hash
> Hash
for Rc
<T
> {
671 fn hash
<H
: Hasher
>(&self, state
: &mut H
) {
672 (**self).hash(state
);
676 #[stable(feature = "rust1", since = "1.0.0")]
677 impl<T
: ?Sized
+ fmt
::Display
> fmt
::Display
for Rc
<T
> {
678 fn fmt(&self, f
: &mut fmt
::Formatter
) -> fmt
::Result
{
679 fmt
::Display
::fmt(&**self, f
)
683 #[stable(feature = "rust1", since = "1.0.0")]
684 impl<T
: ?Sized
+ fmt
::Debug
> fmt
::Debug
for Rc
<T
> {
685 fn fmt(&self, f
: &mut fmt
::Formatter
) -> fmt
::Result
{
686 fmt
::Debug
::fmt(&**self, f
)
690 #[stable(feature = "rust1", since = "1.0.0")]
691 impl<T
> fmt
::Pointer
for Rc
<T
> {
692 fn fmt(&self, f
: &mut fmt
::Formatter
) -> fmt
::Result
{
693 fmt
::Pointer
::fmt(&*self._ptr
, f
)
697 #[stable(feature = "from_for_ptrs", since = "1.6.0")]
698 impl<T
> From
<T
> for Rc
<T
> {
699 fn from(t
: T
) -> Self {
704 /// A weak version of `Rc<T>`.
706 /// Weak references do not count when determining if the inner value should be
709 /// See the [module level documentation](./index.html) for more.
710 #[unsafe_no_drop_flag]
711 #[stable(feature = "rc_weak", since = "1.4.0")]
712 pub struct Weak
<T
: ?Sized
> {
713 // FIXME #12808: strange names to try to avoid interfering with
714 // field accesses of the contained type via Deref
715 _ptr
: Shared
<RcBox
<T
>>,
718 #[stable(feature = "rust1", since = "1.0.0")]
719 impl<T
: ?Sized
> !marker
::Send
for Weak
<T
> {}
720 #[stable(feature = "rust1", since = "1.0.0")]
721 impl<T
: ?Sized
> !marker
::Sync
for Weak
<T
> {}
723 #[unstable(feature = "coerce_unsized", issue = "27732")]
724 impl<T
: ?Sized
+ Unsize
<U
>, U
: ?Sized
> CoerceUnsized
<Weak
<U
>> for Weak
<T
> {}
726 impl<T
: ?Sized
> Weak
<T
> {
727 /// Upgrades a weak reference to a strong reference.
729 /// Upgrades the `Weak<T>` reference to an `Rc<T>`, if possible.
731 /// Returns `None` if there were no strong references and the data was
739 /// let five = Rc::new(5);
741 /// let weak_five = Rc::downgrade(&five);
743 /// let strong_five: Option<Rc<_>> = weak_five.upgrade();
745 #[stable(feature = "rc_weak", since = "1.4.0")]
746 pub fn upgrade(&self) -> Option
<Rc
<T
>> {
747 if self.strong() == 0 {
751 Some(Rc { _ptr: self._ptr }
)
756 #[stable(feature = "rust1", since = "1.0.0")]
757 impl<T
: ?Sized
> Drop
for Weak
<T
> {
758 /// Drops the `Weak<T>`.
760 /// This will decrement the weak reference count.
768 /// let five = Rc::new(5);
769 /// let weak_five = Rc::downgrade(&five);
773 /// drop(weak_five); // explicit drop
776 /// let five = Rc::new(5);
777 /// let weak_five = Rc::downgrade(&five);
781 /// } // implicit drop
785 let ptr
= *self._ptr
;
786 let thin
= ptr
as *const ();
788 if thin
as usize != mem
::POST_DROP_USIZE
{
790 // the weak count starts at 1, and will only go to zero if all
791 // the strong pointers have disappeared.
792 if self.weak() == 0 {
793 deallocate(ptr
as *mut u8, size_of_val(&*ptr
), align_of_val(&*ptr
))
800 #[stable(feature = "rc_weak", since = "1.4.0")]
801 impl<T
: ?Sized
> Clone
for Weak
<T
> {
802 /// Makes a clone of the `Weak<T>`.
804 /// This increases the weak reference count.
811 /// let weak_five = Rc::downgrade(&Rc::new(5));
813 /// weak_five.clone();
816 fn clone(&self) -> Weak
<T
> {
818 Weak { _ptr: self._ptr }
822 #[stable(feature = "rust1", since = "1.0.0")]
823 impl<T
: ?Sized
+ fmt
::Debug
> fmt
::Debug
for Weak
<T
> {
824 fn fmt(&self, f
: &mut fmt
::Formatter
) -> fmt
::Result
{
830 /// Constructs a new `Weak<T>` without an accompanying instance of T.
832 /// This allocates memory for T, but does not initialize it. Calling
833 /// Weak<T>::upgrade() on the return value always gives None.
838 /// #![feature(downgraded_weak)]
840 /// use std::rc::Weak;
842 /// let empty: Weak<i64> = Weak::new();
844 #[unstable(feature = "downgraded_weak",
845 reason
= "recently added",
847 pub fn new() -> Weak
<T
> {
850 _ptr
: Shared
::new(Box
::into_raw(box RcBox
{
851 strong
: Cell
::new(0),
853 value
: uninitialized(),
860 // NOTE: We checked_add here to deal with mem::forget safety. In particular
861 // if you mem::forget Rcs (or Weaks), the ref-count can overflow, and then
862 // you can free the allocation while outstanding Rcs (or Weaks) exist.
863 // We abort because this is such a degenerate scenario that we don't care about
864 // what happens -- no real program should ever experience this.
866 // This should have negligible overhead since you don't actually need to
867 // clone these much in Rust thanks to ownership and move-semantics.
870 trait RcBoxPtr
<T
: ?Sized
> {
871 fn inner(&self) -> &RcBox
<T
>;
874 fn strong(&self) -> usize {
875 self.inner().strong
.get()
879 fn inc_strong(&self) {
880 self.inner().strong
.set(self.strong().checked_add(1).unwrap_or_else(|| unsafe { abort() }
));
884 fn dec_strong(&self) {
885 self.inner().strong
.set(self.strong() - 1);
889 fn weak(&self) -> usize {
890 self.inner().weak
.get()
895 self.inner().weak
.set(self.weak().checked_add(1).unwrap_or_else(|| unsafe { abort() }
));
900 self.inner().weak
.set(self.weak() - 1);
904 impl<T
: ?Sized
> RcBoxPtr
<T
> for Rc
<T
> {
906 fn inner(&self) -> &RcBox
<T
> {
908 // Safe to assume this here, as if it weren't true, we'd be breaking
909 // the contract anyway.
910 // This allows the null check to be elided in the destructor if we
911 // manipulated the reference count in the same function.
912 assume(!(*(&self._ptr
as *const _
as *const *const ())).is_null());
918 impl<T
: ?Sized
> RcBoxPtr
<T
> for Weak
<T
> {
920 fn inner(&self) -> &RcBox
<T
> {
922 // Safe to assume this here, as if it weren't true, we'd be breaking
923 // the contract anyway.
924 // This allows the null check to be elided in the destructor if we
925 // manipulated the reference count in the same function.
926 assume(!(*(&self._ptr
as *const _
as *const *const ())).is_null());
934 use super::{Rc, Weak}
;
936 use std
::cell
::RefCell
;
937 use std
::option
::Option
;
938 use std
::option
::Option
::{Some, None}
;
939 use std
::result
::Result
::{Err, Ok}
;
941 use std
::clone
::Clone
;
942 use std
::convert
::From
;
946 let x
= Rc
::new(RefCell
::new(5));
948 *x
.borrow_mut() = 20;
949 assert_eq
!(*y
.borrow(), 20);
959 fn test_simple_clone() {
967 fn test_destructor() {
968 let x
: Rc
<Box
<_
>> = Rc
::new(box 5);
975 let y
= Rc
::downgrade(&x
);
976 assert
!(y
.upgrade().is_some());
982 let y
= Rc
::downgrade(&x
);
984 assert
!(y
.upgrade().is_none());
988 fn weak_self_cyclic() {
990 x
: RefCell
<Option
<Weak
<Cycle
>>>,
993 let a
= Rc
::new(Cycle { x: RefCell::new(None) }
);
994 let b
= Rc
::downgrade(&a
.clone());
995 *a
.x
.borrow_mut() = Some(b
);
997 // hopefully we don't double-free (or leak)...
1003 assert
!(Rc
::is_unique(&x
));
1005 assert
!(!Rc
::is_unique(&x
));
1007 assert
!(Rc
::is_unique(&x
));
1008 let w
= Rc
::downgrade(&x
);
1009 assert
!(!Rc
::is_unique(&x
));
1011 assert
!(Rc
::is_unique(&x
));
1015 fn test_strong_count() {
1016 let a
= Rc
::new(0u32);
1017 assert
!(Rc
::strong_count(&a
) == 1);
1018 let w
= Rc
::downgrade(&a
);
1019 assert
!(Rc
::strong_count(&a
) == 1);
1020 let b
= w
.upgrade().expect("upgrade of live rc failed");
1021 assert
!(Rc
::strong_count(&b
) == 2);
1022 assert
!(Rc
::strong_count(&a
) == 2);
1025 assert
!(Rc
::strong_count(&b
) == 1);
1027 assert
!(Rc
::strong_count(&b
) == 2);
1028 assert
!(Rc
::strong_count(&c
) == 2);
1032 fn test_weak_count() {
1033 let a
= Rc
::new(0u32);
1034 assert
!(Rc
::strong_count(&a
) == 1);
1035 assert
!(Rc
::weak_count(&a
) == 0);
1036 let w
= Rc
::downgrade(&a
);
1037 assert
!(Rc
::strong_count(&a
) == 1);
1038 assert
!(Rc
::weak_count(&a
) == 1);
1040 assert
!(Rc
::strong_count(&a
) == 1);
1041 assert
!(Rc
::weak_count(&a
) == 0);
1043 assert
!(Rc
::strong_count(&a
) == 2);
1044 assert
!(Rc
::weak_count(&a
) == 0);
1051 assert_eq
!(Rc
::try_unwrap(x
), Ok(3));
1054 assert_eq
!(Rc
::try_unwrap(x
), Err(Rc
::new(4)));
1056 let _w
= Rc
::downgrade(&x
);
1057 assert_eq
!(Rc
::try_unwrap(x
), Ok(5));
1062 let mut x
= Rc
::new(3);
1063 *Rc
::get_mut(&mut x
).unwrap() = 4;
1066 assert
!(Rc
::get_mut(&mut x
).is_none());
1068 assert
!(Rc
::get_mut(&mut x
).is_some());
1069 let _w
= Rc
::downgrade(&x
);
1070 assert
!(Rc
::get_mut(&mut x
).is_none());
1074 fn test_cowrc_clone_make_unique() {
1075 let mut cow0
= Rc
::new(75);
1076 let mut cow1
= cow0
.clone();
1077 let mut cow2
= cow1
.clone();
1079 assert
!(75 == *Rc
::make_mut(&mut cow0
));
1080 assert
!(75 == *Rc
::make_mut(&mut cow1
));
1081 assert
!(75 == *Rc
::make_mut(&mut cow2
));
1083 *Rc
::make_mut(&mut cow0
) += 1;
1084 *Rc
::make_mut(&mut cow1
) += 2;
1085 *Rc
::make_mut(&mut cow2
) += 3;
1087 assert
!(76 == *cow0
);
1088 assert
!(77 == *cow1
);
1089 assert
!(78 == *cow2
);
1091 // none should point to the same backing memory
1092 assert
!(*cow0
!= *cow1
);
1093 assert
!(*cow0
!= *cow2
);
1094 assert
!(*cow1
!= *cow2
);
1098 fn test_cowrc_clone_unique2() {
1099 let mut cow0
= Rc
::new(75);
1100 let cow1
= cow0
.clone();
1101 let cow2
= cow1
.clone();
1103 assert
!(75 == *cow0
);
1104 assert
!(75 == *cow1
);
1105 assert
!(75 == *cow2
);
1107 *Rc
::make_mut(&mut cow0
) += 1;
1109 assert
!(76 == *cow0
);
1110 assert
!(75 == *cow1
);
1111 assert
!(75 == *cow2
);
1113 // cow1 and cow2 should share the same contents
1114 // cow0 should have a unique reference
1115 assert
!(*cow0
!= *cow1
);
1116 assert
!(*cow0
!= *cow2
);
1117 assert
!(*cow1
== *cow2
);
1121 fn test_cowrc_clone_weak() {
1122 let mut cow0
= Rc
::new(75);
1123 let cow1_weak
= Rc
::downgrade(&cow0
);
1125 assert
!(75 == *cow0
);
1126 assert
!(75 == *cow1_weak
.upgrade().unwrap());
1128 *Rc
::make_mut(&mut cow0
) += 1;
1130 assert
!(76 == *cow0
);
1131 assert
!(cow1_weak
.upgrade().is_none());
1136 let foo
= Rc
::new(75);
1137 assert_eq
!(format
!("{:?}", foo
), "75");
1142 let foo
: Rc
<[i32]> = Rc
::new([1, 2, 3]);
1143 assert_eq
!(foo
, foo
.clone());
1147 fn test_from_owned() {
1149 let foo_rc
= Rc
::from(foo
);
1150 assert
!(123 == *foo_rc
);
1154 fn test_new_weak() {
1155 let foo
: Weak
<usize> = Weak
::new();
1156 assert
!(foo
.upgrade().is_none());
1160 #[stable(feature = "rust1", since = "1.0.0")]
1161 impl<T
: ?Sized
> borrow
::Borrow
<T
> for Rc
<T
> {
1162 fn borrow(&self) -> &T
{
1167 #[stable(since = "1.5.0", feature = "smart_ptr_as_ref")]
1168 impl<T
: ?Sized
> AsRef
<T
> for Rc
<T
> {
1169 fn as_ref(&self) -> &T
{