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 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947
// Copyright 2013-2014 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. //! Task-local reference-counted boxes (the `Rc<T>` type). //! //! The `Rc<T>` 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. //! //! The `downgrade` method can be used to create a non-owning `Weak<T>` pointer to the box. A //! `Weak<T>` pointer can be upgraded to an `Rc<T>` pointer, but will return `None` if the value //! has already been dropped. //! //! For example, a tree with parent pointers can be represented by putting the nodes behind strong //! `Rc<T>` pointers, and then storing the parent pointers as `Weak<T>` pointers. //! //! # Examples //! //! Consider a scenario where a set of `Gadget`s are owned by a given `Owner`. We want to have our //! `Gadget`s point to their `Owner`. We can't do this with unique ownership, because more than one //! gadget may belong to the same `Owner`. `Rc<T>` allows us to share an `Owner` between multiple //! `Gadget`s, and have the `Owner` remain allocated as long as any `Gadget` points at it. //! //! ```rust //! use std::rc::Rc; //! //! struct Owner { //! name: String //! // ...other fields //! } //! //! struct Gadget { //! id: int, //! owner: Rc<Owner> //! // ...other fields //! } //! //! fn main() { //! // Create a reference counted Owner. //! let gadget_owner : Rc<Owner> = Rc::new( //! Owner { name: String::from_str("Gadget Man") } //! ); //! //! // Create Gadgets belonging to gadget_owner. To increment the reference //! // count we clone the `Rc<T>` object. //! let gadget1 = Gadget { id: 1, owner: gadget_owner.clone() }; //! let gadget2 = Gadget { id: 2, owner: gadget_owner.clone() }; //! //! drop(gadget_owner); //! //! // Despite dropping gadget_owner, we're still able to print out the name of //! // the Owner of the Gadgets. This is because we've only dropped the //! // reference count object, not the Owner it wraps. As long as there are //! // other `Rc<T>` objects pointing at the same Owner, it will remain allocated. Notice //! // that the `Rc<T>` wrapper around Gadget.owner gets automatically dereferenced //! // for us. //! println!("Gadget {} owned by {}", gadget1.id, gadget1.owner.name); //! println!("Gadget {} owned by {}", gadget2.id, gadget2.owner.name); //! //! // At the end of the method, gadget1 and gadget2 get destroyed, and with //! // them the last counted references to our Owner. Gadget Man now gets //! // destroyed as well. //! } //! ``` //! //! If our requirements change, and we also need to be able to traverse from Owner → Gadget, we //! will run into problems: an `Rc<T>` pointer from Owner → Gadget introduces a cycle between the //! objects. This means that their reference counts can never reach 0, and the objects will remain //! allocated: a memory leak. In order to get around this, we can use `Weak<T>` pointers. These //! pointers don't contribute to the total count. //! //! Rust actually makes it somewhat difficult to produce this loop in the first place: in order to //! end up with two objects that point at each other, one of them needs to be mutable. This is //! problematic because `Rc<T>` enforces memory safety by only giving out shared references to the //! object it wraps, and these don't allow direct mutation. We need to wrap the part of the object //! we wish to mutate in a `RefCell`, which provides *interior mutability*: a method to achieve //! mutability through a shared reference. `RefCell` enforces Rust's borrowing rules at runtime. //! Read the `Cell` documentation for more details on interior mutability. //! //! ```rust //! use std::rc::Rc; //! use std::rc::Weak; //! use std::cell::RefCell; //! //! struct Owner { //! name: String, //! gadgets: RefCell<Vec<Weak<Gadget>>> //! // ...other fields //! } //! //! struct Gadget { //! id: int, //! owner: Rc<Owner> //! // ...other fields //! } //! //! fn main() { //! // Create a reference counted Owner. Note the fact that we've put the //! // Owner's vector of Gadgets inside a RefCell so that we can mutate it //! // through a shared reference. //! let gadget_owner : Rc<Owner> = Rc::new( //! Owner { //! name: "Gadget Man".to_string(), //! gadgets: RefCell::new(Vec::new()) //! } //! ); //! //! // Create Gadgets belonging to gadget_owner as before. //! let gadget1 = Rc::new(Gadget{id: 1, owner: gadget_owner.clone()}); //! let gadget2 = Rc::new(Gadget{id: 2, owner: gadget_owner.clone()}); //! //! // Add the Gadgets to their Owner. To do this we mutably borrow from //! // the RefCell holding the Owner's Gadgets. //! gadget_owner.gadgets.borrow_mut().push(gadget1.clone().downgrade()); //! gadget_owner.gadgets.borrow_mut().push(gadget2.clone().downgrade()); //! //! // Iterate over our Gadgets, printing their details out //! for gadget_opt in gadget_owner.gadgets.borrow().iter() { //! //! // gadget_opt is a Weak<Gadget>. Since weak pointers can't guarantee //! // that their object is still allocated, we need to call upgrade() on them //! // to turn them into a strong reference. This returns an Option, which //! // contains a reference to our object if it still exists. //! let gadget = gadget_opt.upgrade().unwrap(); //! println!("Gadget {} owned by {}", gadget.id, gadget.owner.name); //! } //! //! // At the end of the method, gadget_owner, gadget1 and gadget2 get //! // destroyed. There are now no strong (`Rc<T>`) references to the gadgets. //! // Once they get destroyed, the Gadgets get destroyed. This zeroes the //! // reference count on Gadget Man, so he gets destroyed as well. //! } //! ``` #![stable] use core::borrow::BorrowFrom; use core::cell::Cell; use core::clone::Clone; use core::cmp::{PartialEq, PartialOrd, Eq, Ord, Ordering}; use core::default::Default; use core::fmt; use core::kinds::marker; use core::mem::{transmute, min_align_of, size_of, forget}; use core::ops::{Deref, Drop}; use core::option::Option; use core::option::Option::{Some, None}; use core::ptr; use core::ptr::RawPtr; use core::result::Result; use core::result::Result::{Ok, Err}; use heap::deallocate; struct RcBox<T> { value: T, strong: Cell<uint>, weak: Cell<uint> } /// An immutable reference-counted pointer type. /// /// See the [module level documentation](../index.html) for more. #[unsafe_no_drop_flag] #[stable] pub struct Rc<T> { // FIXME #12808: strange names to try to avoid interfering with // field accesses of the contained type via Deref _ptr: *mut RcBox<T>, _nosend: marker::NoSend, _noshare: marker::NoSync } impl<T> Rc<T> { /// Constructs a new `Rc<T>`. /// /// # Examples /// /// ``` /// use std::rc::Rc; /// /// let five = Rc::new(5i); /// ``` #[stable] pub fn new(value: T) -> Rc<T> { unsafe { Rc { // there is an implicit weak pointer owned by all the // strong pointers, which ensures that the weak // destructor never frees the allocation while the // strong destructor is running, even if the weak // pointer is stored inside the strong one. _ptr: transmute(box RcBox { value: value, strong: Cell::new(1), weak: Cell::new(1) }), _nosend: marker::NoSend, _noshare: marker::NoSync } } } /// Downgrades the `Rc<T>` to a `Weak<T>` reference. /// /// # Examples /// /// ``` /// use std::rc::Rc; /// /// let five = Rc::new(5i); /// /// let weak_five = five.downgrade(); /// ``` #[experimental = "Weak pointers may not belong in this module"] pub fn downgrade(&self) -> Weak<T> { self.inc_weak(); Weak { _ptr: self._ptr, _nosend: marker::NoSend, _noshare: marker::NoSync } } } /// Get the number of weak references to this value. #[inline] #[experimental] pub fn weak_count<T>(this: &Rc<T>) -> uint { this.weak() - 1 } /// Get the number of strong references to this value. #[inline] #[experimental] pub fn strong_count<T>(this: &Rc<T>) -> uint { this.strong() } /// Returns true if there are no other `Rc` or `Weak<T>` values that share the same inner value. /// /// # Examples /// /// ``` /// use std::rc; /// use std::rc::Rc; /// /// let five = Rc::new(5i); /// /// rc::is_unique(&five); /// ``` #[inline] #[experimental] pub fn is_unique<T>(rc: &Rc<T>) -> bool { weak_count(rc) == 0 && strong_count(rc) == 1 } /// Unwraps the contained value if the `Rc<T>` is unique. /// /// If the `Rc<T>` is not unique, an `Err` is returned with the same `Rc<T>`. /// /// # Example /// /// ``` /// use std::rc::{mod, Rc}; /// /// let x = Rc::new(3u); /// assert_eq!(rc::try_unwrap(x), Ok(3u)); /// /// let x = Rc::new(4u); /// let _y = x.clone(); /// assert_eq!(rc::try_unwrap(x), Err(Rc::new(4u))); /// ``` #[inline] #[experimental] pub fn try_unwrap<T>(rc: Rc<T>) -> Result<T, Rc<T>> { if is_unique(&rc) { unsafe { let val = ptr::read(&*rc); // copy the contained object // destruct the box and skip our Drop // we can ignore the refcounts because we know we're unique deallocate(rc._ptr as *mut u8, size_of::<RcBox<T>>(), min_align_of::<RcBox<T>>()); forget(rc); Ok(val) } } else { Err(rc) } } /// Returns a mutable reference to the contained value if the `Rc<T>` is unique. /// /// Returns `None` if the `Rc<T>` is not unique. /// /// # Example /// /// ``` /// use std::rc::{mod, Rc}; /// /// let mut x = Rc::new(3u); /// *rc::get_mut(&mut x).unwrap() = 4u; /// assert_eq!(*x, 4u); /// /// let _y = x.clone(); /// assert!(rc::get_mut(&mut x).is_none()); /// ``` #[inline] #[experimental] pub fn get_mut<'a, T>(rc: &'a mut Rc<T>) -> Option<&'a mut T> { if is_unique(rc) { let inner = unsafe { &mut *rc._ptr }; Some(&mut inner.value) } else { None } } impl<T: Clone> Rc<T> { /// Make a mutable reference from the given `Rc<T>`. /// /// This is also referred to as a copy-on-write operation because the inner data is cloned if /// the reference count is greater than one. /// /// # Examples /// /// ``` /// use std::rc::Rc; /// /// let mut five = Rc::new(5i); /// /// let mut_five = five.make_unique(); /// ``` #[inline] #[experimental] pub fn make_unique(&mut self) -> &mut T { if !is_unique(self) { *self = Rc::new((**self).clone()) } // This unsafety is ok because we're guaranteed that the pointer // returned is the *only* pointer that will ever be returned to T. Our // reference count is guaranteed to be 1 at this point, and we required // the `Rc<T>` itself to be `mut`, so we're returning the only possible // reference to the inner value. let inner = unsafe { &mut *self._ptr }; &mut inner.value } } impl<T> BorrowFrom<Rc<T>> for T { fn borrow_from(owned: &Rc<T>) -> &T { &**owned } } #[experimental = "Deref is experimental."] impl<T> Deref<T> for Rc<T> { #[inline(always)] fn deref(&self) -> &T { &self.inner().value } } #[unsafe_destructor] #[experimental = "Drop is experimental."] impl<T> Drop for Rc<T> { /// Drops the `Rc<T>`. /// /// This will decrement the strong reference count. If the strong reference count becomes zero /// and the only other references are `Weak<T>` ones, `drop`s the inner value. /// /// # Examples /// /// ``` /// use std::rc::Rc; /// /// { /// let five = Rc::new(5i); /// /// // stuff /// /// drop(five); // explict drop /// } /// { /// let five = Rc::new(5i); /// /// // stuff /// /// } // implicit drop /// ``` fn drop(&mut self) { unsafe { if !self._ptr.is_null() { self.dec_strong(); if self.strong() == 0 { ptr::read(&**self); // destroy the contained object // remove the implicit "strong weak" pointer now // that we've destroyed the contents. self.dec_weak(); if self.weak() == 0 { deallocate(self._ptr as *mut u8, size_of::<RcBox<T>>(), min_align_of::<RcBox<T>>()) } } } } } } #[unstable = "Clone is unstable."] impl<T> Clone for Rc<T> { /// Makes a clone of the `Rc<T>`. /// /// This increases the strong reference count. /// /// # Examples /// /// ``` /// use std::rc::Rc; /// /// let five = Rc::new(5i); /// /// five.clone(); /// ``` #[inline] fn clone(&self) -> Rc<T> { self.inc_strong(); Rc { _ptr: self._ptr, _nosend: marker::NoSend, _noshare: marker::NoSync } } } #[stable] impl<T: Default> Default for Rc<T> { /// Creates a new `Rc<T>`, with the `Default` value for `T`. /// /// # Examples /// /// ``` /// use std::rc::Rc; /// use std::default::Default; /// /// let x: Rc<int> = Default::default(); /// ``` #[inline] fn default() -> Rc<T> { Rc::new(Default::default()) } } #[unstable = "PartialEq is unstable."] impl<T: PartialEq> PartialEq for Rc<T> { /// Equality for two `Rc<T>`s. /// /// Two `Rc<T>`s are equal if their inner value are equal. /// /// # Examples /// /// ``` /// use std::rc::Rc; /// /// let five = Rc::new(5i); /// /// five == Rc::new(5i); /// ``` #[inline(always)] fn eq(&self, other: &Rc<T>) -> bool { **self == **other } /// Inequality for two `Rc<T>`s. /// /// Two `Rc<T>`s are unequal if their inner value are unequal. /// /// # Examples /// /// ``` /// use std::rc::Rc; /// /// let five = Rc::new(5i); /// /// five != Rc::new(5i); /// ``` #[inline(always)] fn ne(&self, other: &Rc<T>) -> bool { **self != **other } } #[unstable = "Eq is unstable."] impl<T: Eq> Eq for Rc<T> {} #[unstable = "PartialOrd is unstable."] impl<T: PartialOrd> PartialOrd for Rc<T> { /// Partial comparison for two `Rc<T>`s. /// /// The two are compared by calling `partial_cmp()` on their inner values. /// /// # Examples /// /// ``` /// use std::rc::Rc; /// /// let five = Rc::new(5i); /// /// five.partial_cmp(&Rc::new(5i)); /// ``` #[inline(always)] fn partial_cmp(&self, other: &Rc<T>) -> Option<Ordering> { (**self).partial_cmp(&**other) } /// Less-than comparison for two `Rc<T>`s. /// /// The two are compared by calling `<` on their inner values. /// /// # Examples /// /// ``` /// use std::rc::Rc; /// /// let five = Rc::new(5i); /// /// five < Rc::new(5i); /// ``` #[inline(always)] fn lt(&self, other: &Rc<T>) -> bool { **self < **other } /// 'Less-than or equal to' comparison for two `Rc<T>`s. /// /// The two are compared by calling `<=` on their inner values. /// /// # Examples /// /// ``` /// use std::rc::Rc; /// /// let five = Rc::new(5i); /// /// five <= Rc::new(5i); /// ``` #[inline(always)] fn le(&self, other: &Rc<T>) -> bool { **self <= **other } /// Greater-than comparison for two `Rc<T>`s. /// /// The two are compared by calling `>` on their inner values. /// /// # Examples /// /// ``` /// use std::rc::Rc; /// /// let five = Rc::new(5i); /// /// five > Rc::new(5i); /// ``` #[inline(always)] fn gt(&self, other: &Rc<T>) -> bool { **self > **other } /// 'Greater-than or equal to' comparison for two `Rc<T>`s. /// /// The two are compared by calling `>=` on their inner values. /// /// # Examples /// /// ``` /// use std::rc::Rc; /// /// let five = Rc::new(5i); /// /// five >= Rc::new(5i); /// ``` #[inline(always)] fn ge(&self, other: &Rc<T>) -> bool { **self >= **other } } #[unstable = "Ord is unstable."] impl<T: Ord> Ord for Rc<T> { /// Comparison for two `Rc<T>`s. /// /// The two are compared by calling `cmp()` on their inner values. /// /// # Examples /// /// ``` /// use std::rc::Rc; /// /// let five = Rc::new(5i); /// /// five.partial_cmp(&Rc::new(5i)); /// ``` #[inline] fn cmp(&self, other: &Rc<T>) -> Ordering { (**self).cmp(&**other) } } #[experimental = "Show is experimental."] impl<T: fmt::Show> fmt::Show for Rc<T> { fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result { (**self).fmt(f) } } /// A weak version of `Rc<T>`. /// /// Weak references do not count when determining if the inner value should be dropped. /// /// See the [module level documentation](../index.html) for more. #[unsafe_no_drop_flag] #[experimental = "Weak pointers may not belong in this module."] pub struct Weak<T> { // FIXME #12808: strange names to try to avoid interfering with // field accesses of the contained type via Deref _ptr: *mut RcBox<T>, _nosend: marker::NoSend, _noshare: marker::NoSync } #[experimental = "Weak pointers may not belong in this module."] impl<T> Weak<T> { /// Upgrades a weak reference to a strong reference. /// /// Upgrades the `Weak<T>` reference to an `Rc<T>`, if possible. /// /// Returns `None` if there were no strong references and the data was destroyed. /// /// # Examples /// /// ``` /// use std::rc::Rc; /// /// let five = Rc::new(5i); /// /// let weak_five = five.downgrade(); /// /// let strong_five: Option<Rc<_>> = weak_five.upgrade(); /// ``` pub fn upgrade(&self) -> Option<Rc<T>> { if self.strong() == 0 { None } else { self.inc_strong(); Some(Rc { _ptr: self._ptr, _nosend: marker::NoSend, _noshare: marker::NoSync }) } } } #[unsafe_destructor] #[experimental = "Weak pointers may not belong in this module."] impl<T> Drop for Weak<T> { /// Drops the `Weak<T>`. /// /// This will decrement the weak reference count. /// /// # Examples /// /// ``` /// use std::rc::Rc; /// /// { /// let five = Rc::new(5i); /// let weak_five = five.downgrade(); /// /// // stuff /// /// drop(weak_five); // explict drop /// } /// { /// let five = Rc::new(5i); /// let weak_five = five.downgrade(); /// /// // stuff /// /// } // implicit drop /// ``` fn drop(&mut self) { unsafe { if !self._ptr.is_null() { self.dec_weak(); // the weak count starts at 1, and will only go to // zero if all the strong pointers have disappeared. if self.weak() == 0 { deallocate(self._ptr as *mut u8, size_of::<RcBox<T>>(), min_align_of::<RcBox<T>>()) } } } } } #[experimental = "Weak pointers may not belong in this module."] impl<T> Clone for Weak<T> { /// Makes a clone of the `Weak<T>`. /// /// This increases the weak reference count. /// /// # Examples /// /// ``` /// use std::rc::Rc; /// /// let weak_five = Rc::new(5i).downgrade(); /// /// weak_five.clone(); /// ``` #[inline] fn clone(&self) -> Weak<T> { self.inc_weak(); Weak { _ptr: self._ptr, _nosend: marker::NoSend, _noshare: marker::NoSync } } } #[doc(hidden)] trait RcBoxPtr<T> { fn inner(&self) -> &RcBox<T>; #[inline] fn strong(&self) -> uint { self.inner().strong.get() } #[inline] fn inc_strong(&self) { self.inner().strong.set(self.strong() + 1); } #[inline] fn dec_strong(&self) { self.inner().strong.set(self.strong() - 1); } #[inline] fn weak(&self) -> uint { self.inner().weak.get() } #[inline] fn inc_weak(&self) { self.inner().weak.set(self.weak() + 1); } #[inline] fn dec_weak(&self) { self.inner().weak.set(self.weak() - 1); } } impl<T> RcBoxPtr<T> for Rc<T> { #[inline(always)] fn inner(&self) -> &RcBox<T> { unsafe { &(*self._ptr) } } } impl<T> RcBoxPtr<T> for Weak<T> { #[inline(always)] fn inner(&self) -> &RcBox<T> { unsafe { &(*self._ptr) } } } #[cfg(test)] #[allow(experimental)] mod tests { use super::{Rc, Weak, weak_count, strong_count}; use std::cell::RefCell; use std::option::Option; use std::option::Option::{Some, None}; use std::result::Result::{Err, Ok}; use std::mem::drop; use std::clone::Clone; #[test] fn test_clone() { let x = Rc::new(RefCell::new(5i)); let y = x.clone(); *x.borrow_mut() = 20; assert_eq!(*y.borrow(), 20); } #[test] fn test_simple() { let x = Rc::new(5i); assert_eq!(*x, 5); } #[test] fn test_simple_clone() { let x = Rc::new(5i); let y = x.clone(); assert_eq!(*x, 5); assert_eq!(*y, 5); } #[test] fn test_destructor() { let x = Rc::new(box 5i); assert_eq!(**x, 5); } #[test] fn test_live() { let x = Rc::new(5i); let y = x.downgrade(); assert!(y.upgrade().is_some()); } #[test] fn test_dead() { let x = Rc::new(5i); let y = x.downgrade(); drop(x); assert!(y.upgrade().is_none()); } #[test] fn weak_self_cyclic() { struct Cycle { x: RefCell<Option<Weak<Cycle>>> } let a = Rc::new(Cycle { x: RefCell::new(None) }); let b = a.clone().downgrade(); *a.x.borrow_mut() = Some(b); // hopefully we don't double-free (or leak)... } #[test] fn is_unique() { let x = Rc::new(3u); assert!(super::is_unique(&x)); let y = x.clone(); assert!(!super::is_unique(&x)); drop(y); assert!(super::is_unique(&x)); let w = x.downgrade(); assert!(!super::is_unique(&x)); drop(w); assert!(super::is_unique(&x)); } #[test] fn test_strong_count() { let a = Rc::new(0u32); assert!(strong_count(&a) == 1); let w = a.downgrade(); assert!(strong_count(&a) == 1); let b = w.upgrade().expect("upgrade of live rc failed"); assert!(strong_count(&b) == 2); assert!(strong_count(&a) == 2); drop(w); drop(a); assert!(strong_count(&b) == 1); let c = b.clone(); assert!(strong_count(&b) == 2); assert!(strong_count(&c) == 2); } #[test] fn test_weak_count() { let a = Rc::new(0u32); assert!(strong_count(&a) == 1); assert!(weak_count(&a) == 0); let w = a.downgrade(); assert!(strong_count(&a) == 1); assert!(weak_count(&a) == 1); drop(w); assert!(strong_count(&a) == 1); assert!(weak_count(&a) == 0); let c = a.clone(); assert!(strong_count(&a) == 2); assert!(weak_count(&a) == 0); drop(c); } #[test] fn try_unwrap() { let x = Rc::new(3u); assert_eq!(super::try_unwrap(x), Ok(3u)); let x = Rc::new(4u); let _y = x.clone(); assert_eq!(super::try_unwrap(x), Err(Rc::new(4u))); let x = Rc::new(5u); let _w = x.downgrade(); assert_eq!(super::try_unwrap(x), Err(Rc::new(5u))); } #[test] fn get_mut() { let mut x = Rc::new(3u); *super::get_mut(&mut x).unwrap() = 4u; assert_eq!(*x, 4u); let y = x.clone(); assert!(super::get_mut(&mut x).is_none()); drop(y); assert!(super::get_mut(&mut x).is_some()); let _w = x.downgrade(); assert!(super::get_mut(&mut x).is_none()); } #[test] fn test_cowrc_clone_make_unique() { let mut cow0 = Rc::new(75u); let mut cow1 = cow0.clone(); let mut cow2 = cow1.clone(); assert!(75 == *cow0.make_unique()); assert!(75 == *cow1.make_unique()); assert!(75 == *cow2.make_unique()); *cow0.make_unique() += 1; *cow1.make_unique() += 2; *cow2.make_unique() += 3; assert!(76 == *cow0); assert!(77 == *cow1); assert!(78 == *cow2); // none should point to the same backing memory assert!(*cow0 != *cow1); assert!(*cow0 != *cow2); assert!(*cow1 != *cow2); } #[test] fn test_cowrc_clone_unique2() { let mut cow0 = Rc::new(75u); let cow1 = cow0.clone(); let cow2 = cow1.clone(); assert!(75 == *cow0); assert!(75 == *cow1); assert!(75 == *cow2); *cow0.make_unique() += 1; assert!(76 == *cow0); assert!(75 == *cow1); assert!(75 == *cow2); // cow1 and cow2 should share the same contents // cow0 should have a unique reference assert!(*cow0 != *cow1); assert!(*cow0 != *cow2); assert!(*cow1 == *cow2); } #[test] fn test_cowrc_clone_weak() { let mut cow0 = Rc::new(75u); let cow1_weak = cow0.downgrade(); assert!(75 == *cow0); assert!(75 == *cow1_weak.upgrade().unwrap()); *cow0.make_unique() += 1; assert!(76 == *cow0); assert!(cow1_weak.upgrade().is_none()); } }