1 #![stable(feature = "rust1", since = "1.0.0")]
3 //! Thread-safe reference-counting pointers.
5 //! See the [`Arc<T>`][Arc] documentation for more details.
9 use core::cmp::Ordering;
10 use core::convert::{From, TryFrom};
12 use core::hash::{Hash, Hasher};
14 use core::intrinsics::abort;
15 #[cfg(not(no_global_oom_handling))]
17 use core::marker::{PhantomData, Unpin, Unsize};
18 #[cfg(not(no_global_oom_handling))]
19 use core::mem::size_of_val;
20 use core::mem::{self, align_of_val_raw};
21 use core::ops::{CoerceUnsized, Deref, DispatchFromDyn, Receiver};
22 use core::panic::{RefUnwindSafe, UnwindSafe};
24 use core::ptr::{self, NonNull};
25 #[cfg(not(no_global_oom_handling))]
26 use core::slice::from_raw_parts_mut;
27 use core::sync::atomic;
28 use core::sync::atomic::Ordering::{Acquire, Relaxed, Release, SeqCst};
30 #[cfg(not(no_global_oom_handling))]
31 use crate::alloc::handle_alloc_error;
32 #[cfg(not(no_global_oom_handling))]
33 use crate::alloc::{box_free, WriteCloneIntoRaw};
34 use crate::alloc::{AllocError, Allocator, Global, Layout};
35 use crate::borrow::{Cow, ToOwned};
36 use crate::boxed::Box;
37 use crate::rc::is_dangling;
38 #[cfg(not(no_global_oom_handling))]
39 use crate::string::String;
40 #[cfg(not(no_global_oom_handling))]
46 /// A soft limit on the amount of references that may be made to an `Arc`.
48 /// Going above this limit will abort your program (although not
49 /// necessarily) at _exactly_ `MAX_REFCOUNT + 1` references.
50 const MAX_REFCOUNT: usize = (isize::MAX) as usize;
52 #[cfg(not(sanitize = "thread"))]
53 macro_rules! acquire {
55 atomic::fence(Acquire)
59 // ThreadSanitizer does not support memory fences. To avoid false positive
60 // reports in Arc / Weak implementation use atomic loads for synchronization
62 #[cfg(sanitize = "thread")]
63 macro_rules! acquire {
69 /// A thread-safe reference-counting pointer. 'Arc' stands for 'Atomically
70 /// Reference Counted'.
72 /// The type `Arc<T>` provides shared ownership of a value of type `T`,
73 /// allocated in the heap. Invoking [`clone`][clone] on `Arc` produces
74 /// a new `Arc` instance, which points to the same allocation on the heap as the
75 /// source `Arc`, while increasing a reference count. When the last `Arc`
76 /// pointer to a given allocation is destroyed, the value stored in that allocation (often
77 /// referred to as "inner value") is also dropped.
79 /// Shared references in Rust disallow mutation by default, and `Arc` is no
80 /// exception: you cannot generally obtain a mutable reference to something
81 /// inside an `Arc`. If you need to mutate through an `Arc`, use
82 /// [`Mutex`][mutex], [`RwLock`][rwlock], or one of the [`Atomic`][atomic]
87 /// Unlike [`Rc<T>`], `Arc<T>` uses atomic operations for its reference
88 /// counting. This means that it is thread-safe. The disadvantage is that
89 /// atomic operations are more expensive than ordinary memory accesses. If you
90 /// are not sharing reference-counted allocations between threads, consider using
91 /// [`Rc<T>`] for lower overhead. [`Rc<T>`] is a safe default, because the
92 /// compiler will catch any attempt to send an [`Rc<T>`] between threads.
93 /// However, a library might choose `Arc<T>` in order to give library consumers
96 /// `Arc<T>` will implement [`Send`] and [`Sync`] as long as the `T` implements
97 /// [`Send`] and [`Sync`]. Why can't you put a non-thread-safe type `T` in an
98 /// `Arc<T>` to make it thread-safe? This may be a bit counter-intuitive at
99 /// first: after all, isn't the point of `Arc<T>` thread safety? The key is
100 /// this: `Arc<T>` makes it thread safe to have multiple ownership of the same
101 /// data, but it doesn't add thread safety to its data. Consider
102 /// <code>Arc<[RefCell\<T>]></code>. [`RefCell<T>`] isn't [`Sync`], and if `Arc<T>` was always
103 /// [`Send`], <code>Arc<[RefCell\<T>]></code> would be as well. But then we'd have a problem:
104 /// [`RefCell<T>`] is not thread safe; it keeps track of the borrowing count using
105 /// non-atomic operations.
107 /// In the end, this means that you may need to pair `Arc<T>` with some sort of
108 /// [`std::sync`] type, usually [`Mutex<T>`][mutex].
110 /// ## Breaking cycles with `Weak`
112 /// The [`downgrade`][downgrade] method can be used to create a non-owning
113 /// [`Weak`] pointer. A [`Weak`] pointer can be [`upgrade`][upgrade]d
114 /// to an `Arc`, but this will return [`None`] if the value stored in the allocation has
115 /// already been dropped. In other words, `Weak` pointers do not keep the value
116 /// inside the allocation alive; however, they *do* keep the allocation
117 /// (the backing store for the value) alive.
119 /// A cycle between `Arc` pointers will never be deallocated. For this reason,
120 /// [`Weak`] is used to break cycles. For example, a tree could have
121 /// strong `Arc` pointers from parent nodes to children, and [`Weak`]
122 /// pointers from children back to their parents.
124 /// # Cloning references
126 /// Creating a new reference from an existing reference-counted pointer is done using the
127 /// `Clone` trait implemented for [`Arc<T>`][Arc] and [`Weak<T>`][Weak].
130 /// use std::sync::Arc;
131 /// let foo = Arc::new(vec![1.0, 2.0, 3.0]);
132 /// // The two syntaxes below are equivalent.
133 /// let a = foo.clone();
134 /// let b = Arc::clone(&foo);
135 /// // a, b, and foo are all Arcs that point to the same memory location
138 /// ## `Deref` behavior
140 /// `Arc<T>` automatically dereferences to `T` (via the [`Deref`][deref] trait),
141 /// so you can call `T`'s methods on a value of type `Arc<T>`. To avoid name
142 /// clashes with `T`'s methods, the methods of `Arc<T>` itself are associated
143 /// functions, called using [fully qualified syntax]:
146 /// use std::sync::Arc;
148 /// let my_arc = Arc::new(());
149 /// let my_weak = Arc::downgrade(&my_arc);
152 /// `Arc<T>`'s implementations of traits like `Clone` may also be called using
153 /// fully qualified syntax. Some people prefer to use fully qualified syntax,
154 /// while others prefer using method-call syntax.
157 /// use std::sync::Arc;
159 /// let arc = Arc::new(());
160 /// // Method-call syntax
161 /// let arc2 = arc.clone();
162 /// // Fully qualified syntax
163 /// let arc3 = Arc::clone(&arc);
166 /// [`Weak<T>`][Weak] does not auto-dereference to `T`, because the inner value may have
167 /// already been dropped.
169 /// [`Rc<T>`]: crate::rc::Rc
170 /// [clone]: Clone::clone
171 /// [mutex]: ../../std/sync/struct.Mutex.html
172 /// [rwlock]: ../../std/sync/struct.RwLock.html
173 /// [atomic]: core::sync::atomic
174 /// [`Send`]: core::marker::Send
175 /// [`Sync`]: core::marker::Sync
176 /// [deref]: core::ops::Deref
177 /// [downgrade]: Arc::downgrade
178 /// [upgrade]: Weak::upgrade
179 /// [RefCell\<T>]: core::cell::RefCell
180 /// [`RefCell<T>`]: core::cell::RefCell
181 /// [`std::sync`]: ../../std/sync/index.html
182 /// [`Arc::clone(&from)`]: Arc::clone
183 /// [fully qualified syntax]: https://doc.rust-lang.org/book/ch19-03-advanced-traits.html#fully-qualified-syntax-for-disambiguation-calling-methods-with-the-same-name
187 /// Sharing some immutable data between threads:
189 // Note that we **do not** run these tests here. The windows builders get super
190 // unhappy if a thread outlives the main thread and then exits at the same time
191 // (something deadlocks) so we just avoid this entirely by not running these
194 /// use std::sync::Arc;
197 /// let five = Arc::new(5);
200 /// let five = Arc::clone(&five);
202 /// thread::spawn(move || {
203 /// println!("{:?}", five);
208 /// Sharing a mutable [`AtomicUsize`]:
210 /// [`AtomicUsize`]: core::sync::atomic::AtomicUsize "sync::atomic::AtomicUsize"
213 /// use std::sync::Arc;
214 /// use std::sync::atomic::{AtomicUsize, Ordering};
217 /// let val = Arc::new(AtomicUsize::new(5));
220 /// let val = Arc::clone(&val);
222 /// thread::spawn(move || {
223 /// let v = val.fetch_add(1, Ordering::SeqCst);
224 /// println!("{:?}", v);
229 /// See the [`rc` documentation][rc_examples] for more examples of reference
230 /// counting in general.
232 /// [rc_examples]: crate::rc#examples
233 #[cfg_attr(not(test), rustc_diagnostic_item = "Arc")]
234 #[stable(feature = "rust1", since = "1.0.0")]
235 pub struct Arc<T: ?Sized> {
236 ptr: NonNull<ArcInner<T>>,
237 phantom: PhantomData<ArcInner<T>>,
240 #[stable(feature = "rust1", since = "1.0.0")]
241 unsafe impl<T: ?Sized + Sync + Send> Send for Arc<T> {}
242 #[stable(feature = "rust1", since = "1.0.0")]
243 unsafe impl<T: ?Sized + Sync + Send> Sync for Arc<T> {}
245 #[stable(feature = "catch_unwind", since = "1.9.0")]
246 impl<T: RefUnwindSafe + ?Sized> UnwindSafe for Arc<T> {}
248 #[unstable(feature = "coerce_unsized", issue = "27732")]
249 impl<T: ?Sized + Unsize<U>, U: ?Sized> CoerceUnsized<Arc<U>> for Arc<T> {}
251 #[unstable(feature = "dispatch_from_dyn", issue = "none")]
252 impl<T: ?Sized + Unsize<U>, U: ?Sized> DispatchFromDyn<Arc<U>> for Arc<T> {}
254 impl<T: ?Sized> Arc<T> {
255 unsafe fn from_inner(ptr: NonNull<ArcInner<T>>) -> Self {
256 Self { ptr, phantom: PhantomData }
259 unsafe fn from_ptr(ptr: *mut ArcInner<T>) -> Self {
260 unsafe { Self::from_inner(NonNull::new_unchecked(ptr)) }
264 /// `Weak` is a version of [`Arc`] that holds a non-owning reference to the
265 /// managed allocation. The allocation is accessed by calling [`upgrade`] on the `Weak`
266 /// pointer, which returns an <code>[Option]<[Arc]\<T>></code>.
268 /// Since a `Weak` reference does not count towards ownership, it will not
269 /// prevent the value stored in the allocation from being dropped, and `Weak` itself makes no
270 /// guarantees about the value still being present. Thus it may return [`None`]
271 /// when [`upgrade`]d. Note however that a `Weak` reference *does* prevent the allocation
272 /// itself (the backing store) from being deallocated.
274 /// A `Weak` pointer is useful for keeping a temporary reference to the allocation
275 /// managed by [`Arc`] without preventing its inner value from being dropped. It is also used to
276 /// prevent circular references between [`Arc`] pointers, since mutual owning references
277 /// would never allow either [`Arc`] to be dropped. For example, a tree could
278 /// have strong [`Arc`] pointers from parent nodes to children, and `Weak`
279 /// pointers from children back to their parents.
281 /// The typical way to obtain a `Weak` pointer is to call [`Arc::downgrade`].
283 /// [`upgrade`]: Weak::upgrade
284 #[stable(feature = "arc_weak", since = "1.4.0")]
285 pub struct Weak<T: ?Sized> {
286 // This is a `NonNull` to allow optimizing the size of this type in enums,
287 // but it is not necessarily a valid pointer.
288 // `Weak::new` sets this to `usize::MAX` so that it doesn’t need
289 // to allocate space on the heap. That's not a value a real pointer
290 // will ever have because RcBox has alignment at least 2.
291 // This is only possible when `T: Sized`; unsized `T` never dangle.
292 ptr: NonNull<ArcInner<T>>,
295 #[stable(feature = "arc_weak", since = "1.4.0")]
296 unsafe impl<T: ?Sized + Sync + Send> Send for Weak<T> {}
297 #[stable(feature = "arc_weak", since = "1.4.0")]
298 unsafe impl<T: ?Sized + Sync + Send> Sync for Weak<T> {}
300 #[unstable(feature = "coerce_unsized", issue = "27732")]
301 impl<T: ?Sized + Unsize<U>, U: ?Sized> CoerceUnsized<Weak<U>> for Weak<T> {}
302 #[unstable(feature = "dispatch_from_dyn", issue = "none")]
303 impl<T: ?Sized + Unsize<U>, U: ?Sized> DispatchFromDyn<Weak<U>> for Weak<T> {}
305 #[stable(feature = "arc_weak", since = "1.4.0")]
306 impl<T: ?Sized + fmt::Debug> fmt::Debug for Weak<T> {
307 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
312 // This is repr(C) to future-proof against possible field-reordering, which
313 // would interfere with otherwise safe [into|from]_raw() of transmutable
316 struct ArcInner<T: ?Sized> {
317 strong: atomic::AtomicUsize,
319 // the value usize::MAX acts as a sentinel for temporarily "locking" the
320 // ability to upgrade weak pointers or downgrade strong ones; this is used
321 // to avoid races in `make_mut` and `get_mut`.
322 weak: atomic::AtomicUsize,
327 unsafe impl<T: ?Sized + Sync + Send> Send for ArcInner<T> {}
328 unsafe impl<T: ?Sized + Sync + Send> Sync for ArcInner<T> {}
331 /// Constructs a new `Arc<T>`.
336 /// use std::sync::Arc;
338 /// let five = Arc::new(5);
340 #[cfg(not(no_global_oom_handling))]
342 #[stable(feature = "rust1", since = "1.0.0")]
343 pub fn new(data: T) -> Arc<T> {
344 // Start the weak pointer count as 1 which is the weak pointer that's
345 // held by all the strong pointers (kinda), see std/rc.rs for more info
346 let x: Box<_> = box ArcInner {
347 strong: atomic::AtomicUsize::new(1),
348 weak: atomic::AtomicUsize::new(1),
351 unsafe { Self::from_inner(Box::leak(x).into()) }
354 /// Constructs a new `Arc<T>` using a weak reference to itself. Attempting
355 /// to upgrade the weak reference before this function returns will result
356 /// in a `None` value. However, the weak reference may be cloned freely and
357 /// stored for use at a later time.
361 /// #![feature(arc_new_cyclic)]
362 /// #![allow(dead_code)]
364 /// use std::sync::{Arc, Weak};
370 /// let foo = Arc::new_cyclic(|me| Foo {
374 #[cfg(not(no_global_oom_handling))]
376 #[unstable(feature = "arc_new_cyclic", issue = "75861")]
377 pub fn new_cyclic(data_fn: impl FnOnce(&Weak<T>) -> T) -> Arc<T> {
378 // Construct the inner in the "uninitialized" state with a single
380 let uninit_ptr: NonNull<_> = Box::leak(box ArcInner {
381 strong: atomic::AtomicUsize::new(0),
382 weak: atomic::AtomicUsize::new(1),
383 data: mem::MaybeUninit::<T>::uninit(),
386 let init_ptr: NonNull<ArcInner<T>> = uninit_ptr.cast();
388 let weak = Weak { ptr: init_ptr };
390 // It's important we don't give up ownership of the weak pointer, or
391 // else the memory might be freed by the time `data_fn` returns. If
392 // we really wanted to pass ownership, we could create an additional
393 // weak pointer for ourselves, but this would result in additional
394 // updates to the weak reference count which might not be necessary
396 let data = data_fn(&weak);
398 // Now we can properly initialize the inner value and turn our weak
399 // reference into a strong reference.
400 let strong = unsafe {
401 let inner = init_ptr.as_ptr();
402 ptr::write(ptr::addr_of_mut!((*inner).data), data);
404 // The above write to the data field must be visible to any threads which
405 // observe a non-zero strong count. Therefore we need at least "Release" ordering
406 // in order to synchronize with the `compare_exchange_weak` in `Weak::upgrade`.
408 // "Acquire" ordering is not required. When considering the possible behaviours
409 // of `data_fn` we only need to look at what it could do with a reference to a
410 // non-upgradeable `Weak`:
411 // - It can *clone* the `Weak`, increasing the weak reference count.
412 // - It can drop those clones, decreasing the weak reference count (but never to zero).
414 // These side effects do not impact us in any way, and no other side effects are
415 // possible with safe code alone.
416 let prev_value = (*inner).strong.fetch_add(1, Release);
417 debug_assert_eq!(prev_value, 0, "No prior strong references should exist");
419 Arc::from_inner(init_ptr)
422 // Strong references should collectively own a shared weak reference,
423 // so don't run the destructor for our old weak reference.
428 /// Constructs a new `Arc` with uninitialized contents.
433 /// #![feature(new_uninit)]
434 /// #![feature(get_mut_unchecked)]
436 /// use std::sync::Arc;
438 /// let mut five = Arc::<u32>::new_uninit();
440 /// // Deferred initialization:
441 /// Arc::get_mut(&mut five).unwrap().write(5);
443 /// let five = unsafe { five.assume_init() };
445 /// assert_eq!(*five, 5)
447 #[cfg(not(no_global_oom_handling))]
448 #[unstable(feature = "new_uninit", issue = "63291")]
450 pub fn new_uninit() -> Arc<mem::MaybeUninit<T>> {
452 Arc::from_ptr(Arc::allocate_for_layout(
454 |layout| Global.allocate(layout),
455 |mem| mem as *mut ArcInner<mem::MaybeUninit<T>>,
460 /// Constructs a new `Arc` with uninitialized contents, with the memory
461 /// being filled with `0` bytes.
463 /// See [`MaybeUninit::zeroed`][zeroed] for examples of correct and incorrect usage
469 /// #![feature(new_uninit)]
471 /// use std::sync::Arc;
473 /// let zero = Arc::<u32>::new_zeroed();
474 /// let zero = unsafe { zero.assume_init() };
476 /// assert_eq!(*zero, 0)
479 /// [zeroed]: mem::MaybeUninit::zeroed
480 #[cfg(not(no_global_oom_handling))]
481 #[unstable(feature = "new_uninit", issue = "63291")]
483 pub fn new_zeroed() -> Arc<mem::MaybeUninit<T>> {
485 Arc::from_ptr(Arc::allocate_for_layout(
487 |layout| Global.allocate_zeroed(layout),
488 |mem| mem as *mut ArcInner<mem::MaybeUninit<T>>,
493 /// Constructs a new `Pin<Arc<T>>`. If `T` does not implement `Unpin`, then
494 /// `data` will be pinned in memory and unable to be moved.
495 #[cfg(not(no_global_oom_handling))]
496 #[stable(feature = "pin", since = "1.33.0")]
498 pub fn pin(data: T) -> Pin<Arc<T>> {
499 unsafe { Pin::new_unchecked(Arc::new(data)) }
502 /// Constructs a new `Pin<Arc<T>>`, return an error if allocation fails.
503 #[unstable(feature = "allocator_api", issue = "32838")]
505 pub fn try_pin(data: T) -> Result<Pin<Arc<T>>, AllocError> {
506 unsafe { Ok(Pin::new_unchecked(Arc::try_new(data)?)) }
509 /// Constructs a new `Arc<T>`, returning an error if allocation fails.
514 /// #![feature(allocator_api)]
515 /// use std::sync::Arc;
517 /// let five = Arc::try_new(5)?;
518 /// # Ok::<(), std::alloc::AllocError>(())
520 #[unstable(feature = "allocator_api", issue = "32838")]
522 pub fn try_new(data: T) -> Result<Arc<T>, AllocError> {
523 // Start the weak pointer count as 1 which is the weak pointer that's
524 // held by all the strong pointers (kinda), see std/rc.rs for more info
525 let x: Box<_> = Box::try_new(ArcInner {
526 strong: atomic::AtomicUsize::new(1),
527 weak: atomic::AtomicUsize::new(1),
530 unsafe { Ok(Self::from_inner(Box::leak(x).into())) }
533 /// Constructs a new `Arc` with uninitialized contents, returning an error
534 /// if allocation fails.
539 /// #![feature(new_uninit, allocator_api)]
540 /// #![feature(get_mut_unchecked)]
542 /// use std::sync::Arc;
544 /// let mut five = Arc::<u32>::try_new_uninit()?;
546 /// // Deferred initialization:
547 /// Arc::get_mut(&mut five).unwrap().write(5);
549 /// let five = unsafe { five.assume_init() };
551 /// assert_eq!(*five, 5);
552 /// # Ok::<(), std::alloc::AllocError>(())
554 #[unstable(feature = "allocator_api", issue = "32838")]
555 // #[unstable(feature = "new_uninit", issue = "63291")]
556 pub fn try_new_uninit() -> Result<Arc<mem::MaybeUninit<T>>, AllocError> {
558 Ok(Arc::from_ptr(Arc::try_allocate_for_layout(
560 |layout| Global.allocate(layout),
561 |mem| mem as *mut ArcInner<mem::MaybeUninit<T>>,
566 /// Constructs a new `Arc` with uninitialized contents, with the memory
567 /// being filled with `0` bytes, returning an error if allocation fails.
569 /// See [`MaybeUninit::zeroed`][zeroed] for examples of correct and incorrect usage
575 /// #![feature(new_uninit, allocator_api)]
577 /// use std::sync::Arc;
579 /// let zero = Arc::<u32>::try_new_zeroed()?;
580 /// let zero = unsafe { zero.assume_init() };
582 /// assert_eq!(*zero, 0);
583 /// # Ok::<(), std::alloc::AllocError>(())
586 /// [zeroed]: mem::MaybeUninit::zeroed
587 #[unstable(feature = "allocator_api", issue = "32838")]
588 // #[unstable(feature = "new_uninit", issue = "63291")]
589 pub fn try_new_zeroed() -> Result<Arc<mem::MaybeUninit<T>>, AllocError> {
591 Ok(Arc::from_ptr(Arc::try_allocate_for_layout(
593 |layout| Global.allocate_zeroed(layout),
594 |mem| mem as *mut ArcInner<mem::MaybeUninit<T>>,
598 /// Returns the inner value, if the `Arc` has exactly one strong reference.
600 /// Otherwise, an [`Err`] is returned with the same `Arc` that was
603 /// This will succeed even if there are outstanding weak references.
608 /// use std::sync::Arc;
610 /// let x = Arc::new(3);
611 /// assert_eq!(Arc::try_unwrap(x), Ok(3));
613 /// let x = Arc::new(4);
614 /// let _y = Arc::clone(&x);
615 /// assert_eq!(*Arc::try_unwrap(x).unwrap_err(), 4);
618 #[stable(feature = "arc_unique", since = "1.4.0")]
619 pub fn try_unwrap(this: Self) -> Result<T, Self> {
620 if this.inner().strong.compare_exchange(1, 0, Relaxed, Relaxed).is_err() {
624 acquire!(this.inner().strong);
627 let elem = ptr::read(&this.ptr.as_ref().data);
629 // Make a weak pointer to clean up the implicit strong-weak reference
630 let _weak = Weak { ptr: this.ptr };
639 /// Constructs a new atomically reference-counted slice with uninitialized contents.
644 /// #![feature(new_uninit)]
645 /// #![feature(get_mut_unchecked)]
647 /// use std::sync::Arc;
649 /// let mut values = Arc::<[u32]>::new_uninit_slice(3);
651 /// // Deferred initialization:
652 /// let data = Arc::get_mut(&mut values).unwrap();
653 /// data[0].write(1);
654 /// data[1].write(2);
655 /// data[2].write(3);
657 /// let values = unsafe { values.assume_init() };
659 /// assert_eq!(*values, [1, 2, 3])
661 #[cfg(not(no_global_oom_handling))]
662 #[unstable(feature = "new_uninit", issue = "63291")]
664 pub fn new_uninit_slice(len: usize) -> Arc<[mem::MaybeUninit<T>]> {
665 unsafe { Arc::from_ptr(Arc::allocate_for_slice(len)) }
668 /// Constructs a new atomically reference-counted slice with uninitialized contents, with the memory being
669 /// filled with `0` bytes.
671 /// See [`MaybeUninit::zeroed`][zeroed] for examples of correct and
672 /// incorrect usage of this method.
677 /// #![feature(new_uninit)]
679 /// use std::sync::Arc;
681 /// let values = Arc::<[u32]>::new_zeroed_slice(3);
682 /// let values = unsafe { values.assume_init() };
684 /// assert_eq!(*values, [0, 0, 0])
687 /// [zeroed]: mem::MaybeUninit::zeroed
688 #[cfg(not(no_global_oom_handling))]
689 #[unstable(feature = "new_uninit", issue = "63291")]
691 pub fn new_zeroed_slice(len: usize) -> Arc<[mem::MaybeUninit<T>]> {
693 Arc::from_ptr(Arc::allocate_for_layout(
694 Layout::array::<T>(len).unwrap(),
695 |layout| Global.allocate_zeroed(layout),
697 ptr::slice_from_raw_parts_mut(mem as *mut T, len)
698 as *mut ArcInner<[mem::MaybeUninit<T>]>
705 impl<T> Arc<mem::MaybeUninit<T>> {
706 /// Converts to `Arc<T>`.
710 /// As with [`MaybeUninit::assume_init`],
711 /// it is up to the caller to guarantee that the inner value
712 /// really is in an initialized state.
713 /// Calling this when the content is not yet fully initialized
714 /// causes immediate undefined behavior.
716 /// [`MaybeUninit::assume_init`]: mem::MaybeUninit::assume_init
721 /// #![feature(new_uninit)]
722 /// #![feature(get_mut_unchecked)]
724 /// use std::sync::Arc;
726 /// let mut five = Arc::<u32>::new_uninit();
728 /// // Deferred initialization:
729 /// Arc::get_mut(&mut five).unwrap().write(5);
731 /// let five = unsafe { five.assume_init() };
733 /// assert_eq!(*five, 5)
735 #[unstable(feature = "new_uninit", issue = "63291")]
736 #[must_use = "`self` will be dropped if the result is not used"]
738 pub unsafe fn assume_init(self) -> Arc<T> {
739 unsafe { Arc::from_inner(mem::ManuallyDrop::new(self).ptr.cast()) }
743 impl<T> Arc<[mem::MaybeUninit<T>]> {
744 /// Converts to `Arc<[T]>`.
748 /// As with [`MaybeUninit::assume_init`],
749 /// it is up to the caller to guarantee that the inner value
750 /// really is in an initialized state.
751 /// Calling this when the content is not yet fully initialized
752 /// causes immediate undefined behavior.
754 /// [`MaybeUninit::assume_init`]: mem::MaybeUninit::assume_init
759 /// #![feature(new_uninit)]
760 /// #![feature(get_mut_unchecked)]
762 /// use std::sync::Arc;
764 /// let mut values = Arc::<[u32]>::new_uninit_slice(3);
766 /// // Deferred initialization:
767 /// let data = Arc::get_mut(&mut values).unwrap();
768 /// data[0].write(1);
769 /// data[1].write(2);
770 /// data[2].write(3);
772 /// let values = unsafe { values.assume_init() };
774 /// assert_eq!(*values, [1, 2, 3])
776 #[unstable(feature = "new_uninit", issue = "63291")]
777 #[must_use = "`self` will be dropped if the result is not used"]
779 pub unsafe fn assume_init(self) -> Arc<[T]> {
780 unsafe { Arc::from_ptr(mem::ManuallyDrop::new(self).ptr.as_ptr() as _) }
784 impl<T: ?Sized> Arc<T> {
785 /// Consumes the `Arc`, returning the wrapped pointer.
787 /// To avoid a memory leak the pointer must be converted back to an `Arc` using
788 /// [`Arc::from_raw`].
793 /// use std::sync::Arc;
795 /// let x = Arc::new("hello".to_owned());
796 /// let x_ptr = Arc::into_raw(x);
797 /// assert_eq!(unsafe { &*x_ptr }, "hello");
799 #[must_use = "losing the pointer will leak memory"]
800 #[stable(feature = "rc_raw", since = "1.17.0")]
801 pub fn into_raw(this: Self) -> *const T {
802 let ptr = Self::as_ptr(&this);
807 /// Provides a raw pointer to the data.
809 /// The counts are not affected in any way and the `Arc` is not consumed. The pointer is valid for
810 /// as long as there are strong counts in the `Arc`.
815 /// use std::sync::Arc;
817 /// let x = Arc::new("hello".to_owned());
818 /// let y = Arc::clone(&x);
819 /// let x_ptr = Arc::as_ptr(&x);
820 /// assert_eq!(x_ptr, Arc::as_ptr(&y));
821 /// assert_eq!(unsafe { &*x_ptr }, "hello");
824 #[stable(feature = "rc_as_ptr", since = "1.45.0")]
825 pub fn as_ptr(this: &Self) -> *const T {
826 let ptr: *mut ArcInner<T> = NonNull::as_ptr(this.ptr);
828 // SAFETY: This cannot go through Deref::deref or RcBoxPtr::inner because
829 // this is required to retain raw/mut provenance such that e.g. `get_mut` can
830 // write through the pointer after the Rc is recovered through `from_raw`.
831 unsafe { ptr::addr_of_mut!((*ptr).data) }
834 /// Constructs an `Arc<T>` from a raw pointer.
836 /// The raw pointer must have been previously returned by a call to
837 /// [`Arc<U>::into_raw`][into_raw] where `U` must have the same size and
838 /// alignment as `T`. This is trivially true if `U` is `T`.
839 /// Note that if `U` is not `T` but has the same size and alignment, this is
840 /// basically like transmuting references of different types. See
841 /// [`mem::transmute`][transmute] for more information on what
842 /// restrictions apply in this case.
844 /// The user of `from_raw` has to make sure a specific value of `T` is only
847 /// This function is unsafe because improper use may lead to memory unsafety,
848 /// even if the returned `Arc<T>` is never accessed.
850 /// [into_raw]: Arc::into_raw
851 /// [transmute]: core::mem::transmute
856 /// use std::sync::Arc;
858 /// let x = Arc::new("hello".to_owned());
859 /// let x_ptr = Arc::into_raw(x);
862 /// // Convert back to an `Arc` to prevent leak.
863 /// let x = Arc::from_raw(x_ptr);
864 /// assert_eq!(&*x, "hello");
866 /// // Further calls to `Arc::from_raw(x_ptr)` would be memory-unsafe.
869 /// // The memory was freed when `x` went out of scope above, so `x_ptr` is now dangling!
871 #[stable(feature = "rc_raw", since = "1.17.0")]
872 pub unsafe fn from_raw(ptr: *const T) -> Self {
874 let offset = data_offset(ptr);
876 // Reverse the offset to find the original ArcInner.
877 let arc_ptr = (ptr as *mut ArcInner<T>).set_ptr_value((ptr as *mut u8).offset(-offset));
879 Self::from_ptr(arc_ptr)
883 /// Creates a new [`Weak`] pointer to this allocation.
888 /// use std::sync::Arc;
890 /// let five = Arc::new(5);
892 /// let weak_five = Arc::downgrade(&five);
894 #[must_use = "this returns a new `Weak` pointer, \
895 without modifying the original `Arc`"]
896 #[stable(feature = "arc_weak", since = "1.4.0")]
897 pub fn downgrade(this: &Self) -> Weak<T> {
898 // This Relaxed is OK because we're checking the value in the CAS
900 let mut cur = this.inner().weak.load(Relaxed);
903 // check if the weak counter is currently "locked"; if so, spin.
904 if cur == usize::MAX {
906 cur = this.inner().weak.load(Relaxed);
910 // NOTE: this code currently ignores the possibility of overflow
911 // into usize::MAX; in general both Rc and Arc need to be adjusted
912 // to deal with overflow.
914 // Unlike with Clone(), we need this to be an Acquire read to
915 // synchronize with the write coming from `is_unique`, so that the
916 // events prior to that write happen before this read.
917 match this.inner().weak.compare_exchange_weak(cur, cur + 1, Acquire, Relaxed) {
919 // Make sure we do not create a dangling Weak
920 debug_assert!(!is_dangling(this.ptr.as_ptr()));
921 return Weak { ptr: this.ptr };
923 Err(old) => cur = old,
928 /// Gets the number of [`Weak`] pointers to this allocation.
932 /// This method by itself is safe, but using it correctly requires extra care.
933 /// Another thread can change the weak count at any time,
934 /// including potentially between calling this method and acting on the result.
939 /// use std::sync::Arc;
941 /// let five = Arc::new(5);
942 /// let _weak_five = Arc::downgrade(&five);
944 /// // This assertion is deterministic because we haven't shared
945 /// // the `Arc` or `Weak` between threads.
946 /// assert_eq!(1, Arc::weak_count(&five));
950 #[stable(feature = "arc_counts", since = "1.15.0")]
951 pub fn weak_count(this: &Self) -> usize {
952 let cnt = this.inner().weak.load(SeqCst);
953 // If the weak count is currently locked, the value of the
954 // count was 0 just before taking the lock.
955 if cnt == usize::MAX { 0 } else { cnt - 1 }
958 /// Gets the number of strong (`Arc`) pointers to this allocation.
962 /// This method by itself is safe, but using it correctly requires extra care.
963 /// Another thread can change the strong count at any time,
964 /// including potentially between calling this method and acting on the result.
969 /// use std::sync::Arc;
971 /// let five = Arc::new(5);
972 /// let _also_five = Arc::clone(&five);
974 /// // This assertion is deterministic because we haven't shared
975 /// // the `Arc` between threads.
976 /// assert_eq!(2, Arc::strong_count(&five));
980 #[stable(feature = "arc_counts", since = "1.15.0")]
981 pub fn strong_count(this: &Self) -> usize {
982 this.inner().strong.load(SeqCst)
985 /// Increments the strong reference count on the `Arc<T>` associated with the
986 /// provided pointer by one.
990 /// The pointer must have been obtained through `Arc::into_raw`, and the
991 /// associated `Arc` instance must be valid (i.e. the strong count must be at
992 /// least 1) for the duration of this method.
997 /// use std::sync::Arc;
999 /// let five = Arc::new(5);
1002 /// let ptr = Arc::into_raw(five);
1003 /// Arc::increment_strong_count(ptr);
1005 /// // This assertion is deterministic because we haven't shared
1006 /// // the `Arc` between threads.
1007 /// let five = Arc::from_raw(ptr);
1008 /// assert_eq!(2, Arc::strong_count(&five));
1012 #[stable(feature = "arc_mutate_strong_count", since = "1.51.0")]
1013 pub unsafe fn increment_strong_count(ptr: *const T) {
1014 // Retain Arc, but don't touch refcount by wrapping in ManuallyDrop
1015 let arc = unsafe { mem::ManuallyDrop::new(Arc::<T>::from_raw(ptr)) };
1016 // Now increase refcount, but don't drop new refcount either
1017 let _arc_clone: mem::ManuallyDrop<_> = arc.clone();
1020 /// Decrements the strong reference count on the `Arc<T>` associated with the
1021 /// provided pointer by one.
1025 /// The pointer must have been obtained through `Arc::into_raw`, and the
1026 /// associated `Arc` instance must be valid (i.e. the strong count must be at
1027 /// least 1) when invoking this method. This method can be used to release the final
1028 /// `Arc` and backing storage, but **should not** be called after the final `Arc` has been
1034 /// use std::sync::Arc;
1036 /// let five = Arc::new(5);
1039 /// let ptr = Arc::into_raw(five);
1040 /// Arc::increment_strong_count(ptr);
1042 /// // Those assertions are deterministic because we haven't shared
1043 /// // the `Arc` between threads.
1044 /// let five = Arc::from_raw(ptr);
1045 /// assert_eq!(2, Arc::strong_count(&five));
1046 /// Arc::decrement_strong_count(ptr);
1047 /// assert_eq!(1, Arc::strong_count(&five));
1051 #[stable(feature = "arc_mutate_strong_count", since = "1.51.0")]
1052 pub unsafe fn decrement_strong_count(ptr: *const T) {
1053 unsafe { mem::drop(Arc::from_raw(ptr)) };
1057 fn inner(&self) -> &ArcInner<T> {
1058 // This unsafety is ok because while this arc is alive we're guaranteed
1059 // that the inner pointer is valid. Furthermore, we know that the
1060 // `ArcInner` structure itself is `Sync` because the inner data is
1061 // `Sync` as well, so we're ok loaning out an immutable pointer to these
1063 unsafe { self.ptr.as_ref() }
1066 // Non-inlined part of `drop`.
1068 unsafe fn drop_slow(&mut self) {
1069 // Destroy the data at this time, even though we must not free the box
1070 // allocation itself (there might still be weak pointers lying around).
1071 unsafe { ptr::drop_in_place(Self::get_mut_unchecked(self)) };
1073 // Drop the weak ref collectively held by all strong references
1074 drop(Weak { ptr: self.ptr });
1077 /// Returns `true` if the two `Arc`s point to the same allocation
1078 /// (in a vein similar to [`ptr::eq`]).
1083 /// use std::sync::Arc;
1085 /// let five = Arc::new(5);
1086 /// let same_five = Arc::clone(&five);
1087 /// let other_five = Arc::new(5);
1089 /// assert!(Arc::ptr_eq(&five, &same_five));
1090 /// assert!(!Arc::ptr_eq(&five, &other_five));
1093 /// [`ptr::eq`]: core::ptr::eq "ptr::eq"
1096 #[stable(feature = "ptr_eq", since = "1.17.0")]
1097 pub fn ptr_eq(this: &Self, other: &Self) -> bool {
1098 this.ptr.as_ptr() == other.ptr.as_ptr()
1102 impl<T: ?Sized> Arc<T> {
1103 /// Allocates an `ArcInner<T>` with sufficient space for
1104 /// a possibly-unsized inner value where the value has the layout provided.
1106 /// The function `mem_to_arcinner` is called with the data pointer
1107 /// and must return back a (potentially fat)-pointer for the `ArcInner<T>`.
1108 #[cfg(not(no_global_oom_handling))]
1109 unsafe fn allocate_for_layout(
1110 value_layout: Layout,
1111 allocate: impl FnOnce(Layout) -> Result<NonNull<[u8]>, AllocError>,
1112 mem_to_arcinner: impl FnOnce(*mut u8) -> *mut ArcInner<T>,
1113 ) -> *mut ArcInner<T> {
1114 // Calculate layout using the given value layout.
1115 // Previously, layout was calculated on the expression
1116 // `&*(ptr as *const ArcInner<T>)`, but this created a misaligned
1117 // reference (see #54908).
1118 let layout = Layout::new::<ArcInner<()>>().extend(value_layout).unwrap().0.pad_to_align();
1120 Arc::try_allocate_for_layout(value_layout, allocate, mem_to_arcinner)
1121 .unwrap_or_else(|_| handle_alloc_error(layout))
1125 /// Allocates an `ArcInner<T>` with sufficient space for
1126 /// a possibly-unsized inner value where the value has the layout provided,
1127 /// returning an error if allocation fails.
1129 /// The function `mem_to_arcinner` is called with the data pointer
1130 /// and must return back a (potentially fat)-pointer for the `ArcInner<T>`.
1131 unsafe fn try_allocate_for_layout(
1132 value_layout: Layout,
1133 allocate: impl FnOnce(Layout) -> Result<NonNull<[u8]>, AllocError>,
1134 mem_to_arcinner: impl FnOnce(*mut u8) -> *mut ArcInner<T>,
1135 ) -> Result<*mut ArcInner<T>, AllocError> {
1136 // Calculate layout using the given value layout.
1137 // Previously, layout was calculated on the expression
1138 // `&*(ptr as *const ArcInner<T>)`, but this created a misaligned
1139 // reference (see #54908).
1140 let layout = Layout::new::<ArcInner<()>>().extend(value_layout).unwrap().0.pad_to_align();
1142 let ptr = allocate(layout)?;
1144 // Initialize the ArcInner
1145 let inner = mem_to_arcinner(ptr.as_non_null_ptr().as_ptr());
1146 debug_assert_eq!(unsafe { Layout::for_value(&*inner) }, layout);
1149 ptr::write(&mut (*inner).strong, atomic::AtomicUsize::new(1));
1150 ptr::write(&mut (*inner).weak, atomic::AtomicUsize::new(1));
1156 /// Allocates an `ArcInner<T>` with sufficient space for an unsized inner value.
1157 #[cfg(not(no_global_oom_handling))]
1158 unsafe fn allocate_for_ptr(ptr: *const T) -> *mut ArcInner<T> {
1159 // Allocate for the `ArcInner<T>` using the given value.
1161 Self::allocate_for_layout(
1162 Layout::for_value(&*ptr),
1163 |layout| Global.allocate(layout),
1164 |mem| (ptr as *mut ArcInner<T>).set_ptr_value(mem) as *mut ArcInner<T>,
1169 #[cfg(not(no_global_oom_handling))]
1170 fn from_box(v: Box<T>) -> Arc<T> {
1172 let (box_unique, alloc) = Box::into_unique(v);
1173 let bptr = box_unique.as_ptr();
1175 let value_size = size_of_val(&*bptr);
1176 let ptr = Self::allocate_for_ptr(bptr);
1178 // Copy value as bytes
1179 ptr::copy_nonoverlapping(
1180 bptr as *const T as *const u8,
1181 &mut (*ptr).data as *mut _ as *mut u8,
1185 // Free the allocation without dropping its contents
1186 box_free(box_unique, alloc);
1194 /// Allocates an `ArcInner<[T]>` with the given length.
1195 #[cfg(not(no_global_oom_handling))]
1196 unsafe fn allocate_for_slice(len: usize) -> *mut ArcInner<[T]> {
1198 Self::allocate_for_layout(
1199 Layout::array::<T>(len).unwrap(),
1200 |layout| Global.allocate(layout),
1201 |mem| ptr::slice_from_raw_parts_mut(mem as *mut T, len) as *mut ArcInner<[T]>,
1206 /// Copy elements from slice into newly allocated Arc<\[T\]>
1208 /// Unsafe because the caller must either take ownership or bind `T: Copy`.
1209 #[cfg(not(no_global_oom_handling))]
1210 unsafe fn copy_from_slice(v: &[T]) -> Arc<[T]> {
1212 let ptr = Self::allocate_for_slice(v.len());
1214 ptr::copy_nonoverlapping(v.as_ptr(), &mut (*ptr).data as *mut [T] as *mut T, v.len());
1220 /// Constructs an `Arc<[T]>` from an iterator known to be of a certain size.
1222 /// Behavior is undefined should the size be wrong.
1223 #[cfg(not(no_global_oom_handling))]
1224 unsafe fn from_iter_exact(iter: impl iter::Iterator<Item = T>, len: usize) -> Arc<[T]> {
1225 // Panic guard while cloning T elements.
1226 // In the event of a panic, elements that have been written
1227 // into the new ArcInner will be dropped, then the memory freed.
1235 impl<T> Drop for Guard<T> {
1236 fn drop(&mut self) {
1238 let slice = from_raw_parts_mut(self.elems, self.n_elems);
1239 ptr::drop_in_place(slice);
1241 Global.deallocate(self.mem, self.layout);
1247 let ptr = Self::allocate_for_slice(len);
1249 let mem = ptr as *mut _ as *mut u8;
1250 let layout = Layout::for_value(&*ptr);
1252 // Pointer to first element
1253 let elems = &mut (*ptr).data as *mut [T] as *mut T;
1255 let mut guard = Guard { mem: NonNull::new_unchecked(mem), elems, layout, n_elems: 0 };
1257 for (i, item) in iter.enumerate() {
1258 ptr::write(elems.add(i), item);
1262 // All clear. Forget the guard so it doesn't free the new ArcInner.
1270 /// Specialization trait used for `From<&[T]>`.
1271 #[cfg(not(no_global_oom_handling))]
1272 trait ArcFromSlice<T> {
1273 fn from_slice(slice: &[T]) -> Self;
1276 #[cfg(not(no_global_oom_handling))]
1277 impl<T: Clone> ArcFromSlice<T> for Arc<[T]> {
1279 default fn from_slice(v: &[T]) -> Self {
1280 unsafe { Self::from_iter_exact(v.iter().cloned(), v.len()) }
1284 #[cfg(not(no_global_oom_handling))]
1285 impl<T: Copy> ArcFromSlice<T> for Arc<[T]> {
1287 fn from_slice(v: &[T]) -> Self {
1288 unsafe { Arc::copy_from_slice(v) }
1292 #[stable(feature = "rust1", since = "1.0.0")]
1293 impl<T: ?Sized> Clone for Arc<T> {
1294 /// Makes a clone of the `Arc` pointer.
1296 /// This creates another pointer to the same allocation, increasing the
1297 /// strong reference count.
1302 /// use std::sync::Arc;
1304 /// let five = Arc::new(5);
1306 /// let _ = Arc::clone(&five);
1309 fn clone(&self) -> Arc<T> {
1310 // Using a relaxed ordering is alright here, as knowledge of the
1311 // original reference prevents other threads from erroneously deleting
1314 // As explained in the [Boost documentation][1], Increasing the
1315 // reference counter can always be done with memory_order_relaxed: New
1316 // references to an object can only be formed from an existing
1317 // reference, and passing an existing reference from one thread to
1318 // another must already provide any required synchronization.
1320 // [1]: (www.boost.org/doc/libs/1_55_0/doc/html/atomic/usage_examples.html)
1321 let old_size = self.inner().strong.fetch_add(1, Relaxed);
1323 // However we need to guard against massive refcounts in case someone
1324 // is `mem::forget`ing Arcs. If we don't do this the count can overflow
1325 // and users will use-after free. We racily saturate to `isize::MAX` on
1326 // the assumption that there aren't ~2 billion threads incrementing
1327 // the reference count at once. This branch will never be taken in
1328 // any realistic program.
1330 // We abort because such a program is incredibly degenerate, and we
1331 // don't care to support it.
1332 if old_size > MAX_REFCOUNT {
1336 unsafe { Self::from_inner(self.ptr) }
1340 #[stable(feature = "rust1", since = "1.0.0")]
1341 impl<T: ?Sized> Deref for Arc<T> {
1345 fn deref(&self) -> &T {
1350 #[unstable(feature = "receiver_trait", issue = "none")]
1351 impl<T: ?Sized> Receiver for Arc<T> {}
1353 impl<T: Clone> Arc<T> {
1354 /// Makes a mutable reference into the given `Arc`.
1356 /// If there are other `Arc` pointers to the same allocation, then `make_mut` will
1357 /// [`clone`] the inner value to a new allocation to ensure unique ownership. This is also
1358 /// referred to as clone-on-write.
1360 /// However, if there are no other `Arc` pointers to this allocation, but some [`Weak`]
1361 /// pointers, then the [`Weak`] pointers will be disassociated and the inner value will not
1364 /// See also [`get_mut`], which will fail rather than cloning the inner value
1365 /// or diassociating [`Weak`] pointers.
1367 /// [`clone`]: Clone::clone
1368 /// [`get_mut`]: Arc::get_mut
1373 /// use std::sync::Arc;
1375 /// let mut data = Arc::new(5);
1377 /// *Arc::make_mut(&mut data) += 1; // Won't clone anything
1378 /// let mut other_data = Arc::clone(&data); // Won't clone inner data
1379 /// *Arc::make_mut(&mut data) += 1; // Clones inner data
1380 /// *Arc::make_mut(&mut data) += 1; // Won't clone anything
1381 /// *Arc::make_mut(&mut other_data) *= 2; // Won't clone anything
1383 /// // Now `data` and `other_data` point to different allocations.
1384 /// assert_eq!(*data, 8);
1385 /// assert_eq!(*other_data, 12);
1388 /// [`Weak`] pointers will be disassociated:
1391 /// use std::sync::Arc;
1393 /// let mut data = Arc::new(75);
1394 /// let weak = Arc::downgrade(&data);
1396 /// assert!(75 == *data);
1397 /// assert!(75 == *weak.upgrade().unwrap());
1399 /// *Arc::make_mut(&mut data) += 1;
1401 /// assert!(76 == *data);
1402 /// assert!(weak.upgrade().is_none());
1404 #[cfg(not(no_global_oom_handling))]
1406 #[stable(feature = "arc_unique", since = "1.4.0")]
1407 pub fn make_mut(this: &mut Self) -> &mut T {
1408 // Note that we hold both a strong reference and a weak reference.
1409 // Thus, releasing our strong reference only will not, by itself, cause
1410 // the memory to be deallocated.
1412 // Use Acquire to ensure that we see any writes to `weak` that happen
1413 // before release writes (i.e., decrements) to `strong`. Since we hold a
1414 // weak count, there's no chance the ArcInner itself could be
1416 if this.inner().strong.compare_exchange(1, 0, Acquire, Relaxed).is_err() {
1417 // Another strong pointer exists, so we must clone.
1418 // Pre-allocate memory to allow writing the cloned value directly.
1419 let mut arc = Self::new_uninit();
1421 let data = Arc::get_mut_unchecked(&mut arc);
1422 (**this).write_clone_into_raw(data.as_mut_ptr());
1423 *this = arc.assume_init();
1425 } else if this.inner().weak.load(Relaxed) != 1 {
1426 // Relaxed suffices in the above because this is fundamentally an
1427 // optimization: we are always racing with weak pointers being
1428 // dropped. Worst case, we end up allocated a new Arc unnecessarily.
1430 // We removed the last strong ref, but there are additional weak
1431 // refs remaining. We'll move the contents to a new Arc, and
1432 // invalidate the other weak refs.
1434 // Note that it is not possible for the read of `weak` to yield
1435 // usize::MAX (i.e., locked), since the weak count can only be
1436 // locked by a thread with a strong reference.
1438 // Materialize our own implicit weak pointer, so that it can clean
1439 // up the ArcInner as needed.
1440 let _weak = Weak { ptr: this.ptr };
1442 // Can just steal the data, all that's left is Weaks
1443 let mut arc = Self::new_uninit();
1445 let data = Arc::get_mut_unchecked(&mut arc);
1446 data.as_mut_ptr().copy_from_nonoverlapping(&**this, 1);
1447 ptr::write(this, arc.assume_init());
1450 // We were the sole reference of either kind; bump back up the
1451 // strong ref count.
1452 this.inner().strong.store(1, Release);
1455 // As with `get_mut()`, the unsafety is ok because our reference was
1456 // either unique to begin with, or became one upon cloning the contents.
1457 unsafe { Self::get_mut_unchecked(this) }
1461 impl<T: ?Sized> Arc<T> {
1462 /// Returns a mutable reference into the given `Arc`, if there are
1463 /// no other `Arc` or [`Weak`] pointers to the same allocation.
1465 /// Returns [`None`] otherwise, because it is not safe to
1466 /// mutate a shared value.
1468 /// See also [`make_mut`][make_mut], which will [`clone`][clone]
1469 /// the inner value when there are other `Arc` pointers.
1471 /// [make_mut]: Arc::make_mut
1472 /// [clone]: Clone::clone
1477 /// use std::sync::Arc;
1479 /// let mut x = Arc::new(3);
1480 /// *Arc::get_mut(&mut x).unwrap() = 4;
1481 /// assert_eq!(*x, 4);
1483 /// let _y = Arc::clone(&x);
1484 /// assert!(Arc::get_mut(&mut x).is_none());
1487 #[stable(feature = "arc_unique", since = "1.4.0")]
1488 pub fn get_mut(this: &mut Self) -> Option<&mut T> {
1489 if this.is_unique() {
1490 // This unsafety is ok because we're guaranteed that the pointer
1491 // returned is the *only* pointer that will ever be returned to T. Our
1492 // reference count is guaranteed to be 1 at this point, and we required
1493 // the Arc itself to be `mut`, so we're returning the only possible
1494 // reference to the inner data.
1495 unsafe { Some(Arc::get_mut_unchecked(this)) }
1501 /// Returns a mutable reference into the given `Arc`,
1502 /// without any check.
1504 /// See also [`get_mut`], which is safe and does appropriate checks.
1506 /// [`get_mut`]: Arc::get_mut
1510 /// Any other `Arc` or [`Weak`] pointers to the same allocation must not be dereferenced
1511 /// for the duration of the returned borrow.
1512 /// This is trivially the case if no such pointers exist,
1513 /// for example immediately after `Arc::new`.
1518 /// #![feature(get_mut_unchecked)]
1520 /// use std::sync::Arc;
1522 /// let mut x = Arc::new(String::new());
1524 /// Arc::get_mut_unchecked(&mut x).push_str("foo")
1526 /// assert_eq!(*x, "foo");
1529 #[unstable(feature = "get_mut_unchecked", issue = "63292")]
1530 pub unsafe fn get_mut_unchecked(this: &mut Self) -> &mut T {
1531 // We are careful to *not* create a reference covering the "count" fields, as
1532 // this would alias with concurrent access to the reference counts (e.g. by `Weak`).
1533 unsafe { &mut (*this.ptr.as_ptr()).data }
1536 /// Determine whether this is the unique reference (including weak refs) to
1537 /// the underlying data.
1539 /// Note that this requires locking the weak ref count.
1540 fn is_unique(&mut self) -> bool {
1541 // lock the weak pointer count if we appear to be the sole weak pointer
1544 // The acquire label here ensures a happens-before relationship with any
1545 // writes to `strong` (in particular in `Weak::upgrade`) prior to decrements
1546 // of the `weak` count (via `Weak::drop`, which uses release). If the upgraded
1547 // weak ref was never dropped, the CAS here will fail so we do not care to synchronize.
1548 if self.inner().weak.compare_exchange(1, usize::MAX, Acquire, Relaxed).is_ok() {
1549 // This needs to be an `Acquire` to synchronize with the decrement of the `strong`
1550 // counter in `drop` -- the only access that happens when any but the last reference
1551 // is being dropped.
1552 let unique = self.inner().strong.load(Acquire) == 1;
1554 // The release write here synchronizes with a read in `downgrade`,
1555 // effectively preventing the above read of `strong` from happening
1557 self.inner().weak.store(1, Release); // release the lock
1565 #[stable(feature = "rust1", since = "1.0.0")]
1566 unsafe impl<#[may_dangle] T: ?Sized> Drop for Arc<T> {
1567 /// Drops the `Arc`.
1569 /// This will decrement the strong reference count. If the strong reference
1570 /// count reaches zero then the only other references (if any) are
1571 /// [`Weak`], so we `drop` the inner value.
1576 /// use std::sync::Arc;
1580 /// impl Drop for Foo {
1581 /// fn drop(&mut self) {
1582 /// println!("dropped!");
1586 /// let foo = Arc::new(Foo);
1587 /// let foo2 = Arc::clone(&foo);
1589 /// drop(foo); // Doesn't print anything
1590 /// drop(foo2); // Prints "dropped!"
1593 fn drop(&mut self) {
1594 // Because `fetch_sub` is already atomic, we do not need to synchronize
1595 // with other threads unless we are going to delete the object. This
1596 // same logic applies to the below `fetch_sub` to the `weak` count.
1597 if self.inner().strong.fetch_sub(1, Release) != 1 {
1601 // This fence is needed to prevent reordering of use of the data and
1602 // deletion of the data. Because it is marked `Release`, the decreasing
1603 // of the reference count synchronizes with this `Acquire` fence. This
1604 // means that use of the data happens before decreasing the reference
1605 // count, which happens before this fence, which happens before the
1606 // deletion of the data.
1608 // As explained in the [Boost documentation][1],
1610 // > It is important to enforce any possible access to the object in one
1611 // > thread (through an existing reference) to *happen before* deleting
1612 // > the object in a different thread. This is achieved by a "release"
1613 // > operation after dropping a reference (any access to the object
1614 // > through this reference must obviously happened before), and an
1615 // > "acquire" operation before deleting the object.
1617 // In particular, while the contents of an Arc are usually immutable, it's
1618 // possible to have interior writes to something like a Mutex<T>. Since a
1619 // Mutex is not acquired when it is deleted, we can't rely on its
1620 // synchronization logic to make writes in thread A visible to a destructor
1621 // running in thread B.
1623 // Also note that the Acquire fence here could probably be replaced with an
1624 // Acquire load, which could improve performance in highly-contended
1625 // situations. See [2].
1627 // [1]: (www.boost.org/doc/libs/1_55_0/doc/html/atomic/usage_examples.html)
1628 // [2]: (https://github.com/rust-lang/rust/pull/41714)
1629 acquire!(self.inner().strong);
1637 impl Arc<dyn Any + Send + Sync> {
1639 #[stable(feature = "rc_downcast", since = "1.29.0")]
1640 /// Attempt to downcast the `Arc<dyn Any + Send + Sync>` to a concrete type.
1645 /// use std::any::Any;
1646 /// use std::sync::Arc;
1648 /// fn print_if_string(value: Arc<dyn Any + Send + Sync>) {
1649 /// if let Ok(string) = value.downcast::<String>() {
1650 /// println!("String ({}): {}", string.len(), string);
1654 /// let my_string = "Hello World".to_string();
1655 /// print_if_string(Arc::new(my_string));
1656 /// print_if_string(Arc::new(0i8));
1658 pub fn downcast<T>(self) -> Result<Arc<T>, Self>
1660 T: Any + Send + Sync + 'static,
1662 if (*self).is::<T>() {
1664 let ptr = self.ptr.cast::<ArcInner<T>>();
1666 Ok(Arc::from_inner(ptr))
1675 /// Constructs a new `Weak<T>`, without allocating any memory.
1676 /// Calling [`upgrade`] on the return value always gives [`None`].
1678 /// [`upgrade`]: Weak::upgrade
1683 /// use std::sync::Weak;
1685 /// let empty: Weak<i64> = Weak::new();
1686 /// assert!(empty.upgrade().is_none());
1688 #[stable(feature = "downgraded_weak", since = "1.10.0")]
1690 pub fn new() -> Weak<T> {
1691 Weak { ptr: NonNull::new(usize::MAX as *mut ArcInner<T>).expect("MAX is not 0") }
1695 /// Helper type to allow accessing the reference counts without
1696 /// making any assertions about the data field.
1697 struct WeakInner<'a> {
1698 weak: &'a atomic::AtomicUsize,
1699 strong: &'a atomic::AtomicUsize,
1702 impl<T: ?Sized> Weak<T> {
1703 /// Returns a raw pointer to the object `T` pointed to by this `Weak<T>`.
1705 /// The pointer is valid only if there are some strong references. The pointer may be dangling,
1706 /// unaligned or even [`null`] otherwise.
1711 /// use std::sync::Arc;
1714 /// let strong = Arc::new("hello".to_owned());
1715 /// let weak = Arc::downgrade(&strong);
1716 /// // Both point to the same object
1717 /// assert!(ptr::eq(&*strong, weak.as_ptr()));
1718 /// // The strong here keeps it alive, so we can still access the object.
1719 /// assert_eq!("hello", unsafe { &*weak.as_ptr() });
1722 /// // But not any more. We can do weak.as_ptr(), but accessing the pointer would lead to
1723 /// // undefined behaviour.
1724 /// // assert_eq!("hello", unsafe { &*weak.as_ptr() });
1727 /// [`null`]: core::ptr::null "ptr::null"
1729 #[stable(feature = "weak_into_raw", since = "1.45.0")]
1730 pub fn as_ptr(&self) -> *const T {
1731 let ptr: *mut ArcInner<T> = NonNull::as_ptr(self.ptr);
1733 if is_dangling(ptr) {
1734 // If the pointer is dangling, we return the sentinel directly. This cannot be
1735 // a valid payload address, as the payload is at least as aligned as ArcInner (usize).
1738 // SAFETY: if is_dangling returns false, then the pointer is dereferenceable.
1739 // The payload may be dropped at this point, and we have to maintain provenance,
1740 // so use raw pointer manipulation.
1741 unsafe { ptr::addr_of_mut!((*ptr).data) }
1745 /// Consumes the `Weak<T>` and turns it into a raw pointer.
1747 /// This converts the weak pointer into a raw pointer, while still preserving the ownership of
1748 /// one weak reference (the weak count is not modified by this operation). It can be turned
1749 /// back into the `Weak<T>` with [`from_raw`].
1751 /// The same restrictions of accessing the target of the pointer as with
1752 /// [`as_ptr`] apply.
1757 /// use std::sync::{Arc, Weak};
1759 /// let strong = Arc::new("hello".to_owned());
1760 /// let weak = Arc::downgrade(&strong);
1761 /// let raw = weak.into_raw();
1763 /// assert_eq!(1, Arc::weak_count(&strong));
1764 /// assert_eq!("hello", unsafe { &*raw });
1766 /// drop(unsafe { Weak::from_raw(raw) });
1767 /// assert_eq!(0, Arc::weak_count(&strong));
1770 /// [`from_raw`]: Weak::from_raw
1771 /// [`as_ptr`]: Weak::as_ptr
1772 #[must_use = "`self` will be dropped if the result is not used"]
1773 #[stable(feature = "weak_into_raw", since = "1.45.0")]
1774 pub fn into_raw(self) -> *const T {
1775 let result = self.as_ptr();
1780 /// Converts a raw pointer previously created by [`into_raw`] back into `Weak<T>`.
1782 /// This can be used to safely get a strong reference (by calling [`upgrade`]
1783 /// later) or to deallocate the weak count by dropping the `Weak<T>`.
1785 /// It takes ownership of one weak reference (with the exception of pointers created by [`new`],
1786 /// as these don't own anything; the method still works on them).
1790 /// The pointer must have originated from the [`into_raw`] and must still own its potential
1793 /// It is allowed for the strong count to be 0 at the time of calling this. Nevertheless, this
1794 /// takes ownership of one weak reference currently represented as a raw pointer (the weak
1795 /// count is not modified by this operation) and therefore it must be paired with a previous
1796 /// call to [`into_raw`].
1800 /// use std::sync::{Arc, Weak};
1802 /// let strong = Arc::new("hello".to_owned());
1804 /// let raw_1 = Arc::downgrade(&strong).into_raw();
1805 /// let raw_2 = Arc::downgrade(&strong).into_raw();
1807 /// assert_eq!(2, Arc::weak_count(&strong));
1809 /// assert_eq!("hello", &*unsafe { Weak::from_raw(raw_1) }.upgrade().unwrap());
1810 /// assert_eq!(1, Arc::weak_count(&strong));
1814 /// // Decrement the last weak count.
1815 /// assert!(unsafe { Weak::from_raw(raw_2) }.upgrade().is_none());
1818 /// [`new`]: Weak::new
1819 /// [`into_raw`]: Weak::into_raw
1820 /// [`upgrade`]: Weak::upgrade
1821 #[stable(feature = "weak_into_raw", since = "1.45.0")]
1822 pub unsafe fn from_raw(ptr: *const T) -> Self {
1823 // See Weak::as_ptr for context on how the input pointer is derived.
1825 let ptr = if is_dangling(ptr as *mut T) {
1826 // This is a dangling Weak.
1827 ptr as *mut ArcInner<T>
1829 // Otherwise, we're guaranteed the pointer came from a nondangling Weak.
1830 // SAFETY: data_offset is safe to call, as ptr references a real (potentially dropped) T.
1831 let offset = unsafe { data_offset(ptr) };
1832 // Thus, we reverse the offset to get the whole RcBox.
1833 // SAFETY: the pointer originated from a Weak, so this offset is safe.
1834 unsafe { (ptr as *mut ArcInner<T>).set_ptr_value((ptr as *mut u8).offset(-offset)) }
1837 // SAFETY: we now have recovered the original Weak pointer, so can create the Weak.
1838 Weak { ptr: unsafe { NonNull::new_unchecked(ptr) } }
1842 impl<T: ?Sized> Weak<T> {
1843 /// Attempts to upgrade the `Weak` pointer to an [`Arc`], delaying
1844 /// dropping of the inner value if successful.
1846 /// Returns [`None`] if the inner value has since been dropped.
1851 /// use std::sync::Arc;
1853 /// let five = Arc::new(5);
1855 /// let weak_five = Arc::downgrade(&five);
1857 /// let strong_five: Option<Arc<_>> = weak_five.upgrade();
1858 /// assert!(strong_five.is_some());
1860 /// // Destroy all strong pointers.
1861 /// drop(strong_five);
1864 /// assert!(weak_five.upgrade().is_none());
1866 #[must_use = "this returns a new `Arc`, \
1867 without modifying the original weak pointer"]
1868 #[stable(feature = "arc_weak", since = "1.4.0")]
1869 pub fn upgrade(&self) -> Option<Arc<T>> {
1870 // We use a CAS loop to increment the strong count instead of a
1871 // fetch_add as this function should never take the reference count
1872 // from zero to one.
1873 let inner = self.inner()?;
1875 // Relaxed load because any write of 0 that we can observe
1876 // leaves the field in a permanently zero state (so a
1877 // "stale" read of 0 is fine), and any other value is
1878 // confirmed via the CAS below.
1879 let mut n = inner.strong.load(Relaxed);
1886 // See comments in `Arc::clone` for why we do this (for `mem::forget`).
1887 if n > MAX_REFCOUNT {
1891 // Relaxed is fine for the failure case because we don't have any expectations about the new state.
1892 // Acquire is necessary for the success case to synchronise with `Arc::new_cyclic`, when the inner
1893 // value can be initialized after `Weak` references have already been created. In that case, we
1894 // expect to observe the fully initialized value.
1895 match inner.strong.compare_exchange_weak(n, n + 1, Acquire, Relaxed) {
1896 Ok(_) => return Some(unsafe { Arc::from_inner(self.ptr) }), // null checked above
1897 Err(old) => n = old,
1902 /// Gets the number of strong (`Arc`) pointers pointing to this allocation.
1904 /// If `self` was created using [`Weak::new`], this will return 0.
1906 #[stable(feature = "weak_counts", since = "1.41.0")]
1907 pub fn strong_count(&self) -> usize {
1908 if let Some(inner) = self.inner() { inner.strong.load(SeqCst) } else { 0 }
1911 /// Gets an approximation of the number of `Weak` pointers pointing to this
1914 /// If `self` was created using [`Weak::new`], or if there are no remaining
1915 /// strong pointers, this will return 0.
1919 /// Due to implementation details, the returned value can be off by 1 in
1920 /// either direction when other threads are manipulating any `Arc`s or
1921 /// `Weak`s pointing to the same allocation.
1923 #[stable(feature = "weak_counts", since = "1.41.0")]
1924 pub fn weak_count(&self) -> usize {
1927 let weak = inner.weak.load(SeqCst);
1928 let strong = inner.strong.load(SeqCst);
1932 // Since we observed that there was at least one strong pointer
1933 // after reading the weak count, we know that the implicit weak
1934 // reference (present whenever any strong references are alive)
1935 // was still around when we observed the weak count, and can
1936 // therefore safely subtract it.
1943 /// Returns `None` when the pointer is dangling and there is no allocated `ArcInner`,
1944 /// (i.e., when this `Weak` was created by `Weak::new`).
1946 fn inner(&self) -> Option<WeakInner<'_>> {
1947 if is_dangling(self.ptr.as_ptr()) {
1950 // We are careful to *not* create a reference covering the "data" field, as
1951 // the field may be mutated concurrently (for example, if the last `Arc`
1952 // is dropped, the data field will be dropped in-place).
1954 let ptr = self.ptr.as_ptr();
1955 WeakInner { strong: &(*ptr).strong, weak: &(*ptr).weak }
1960 /// Returns `true` if the two `Weak`s point to the same allocation (similar to
1961 /// [`ptr::eq`]), or if both don't point to any allocation
1962 /// (because they were created with `Weak::new()`).
1966 /// Since this compares pointers it means that `Weak::new()` will equal each
1967 /// other, even though they don't point to any allocation.
1972 /// use std::sync::Arc;
1974 /// let first_rc = Arc::new(5);
1975 /// let first = Arc::downgrade(&first_rc);
1976 /// let second = Arc::downgrade(&first_rc);
1978 /// assert!(first.ptr_eq(&second));
1980 /// let third_rc = Arc::new(5);
1981 /// let third = Arc::downgrade(&third_rc);
1983 /// assert!(!first.ptr_eq(&third));
1986 /// Comparing `Weak::new`.
1989 /// use std::sync::{Arc, Weak};
1991 /// let first = Weak::new();
1992 /// let second = Weak::new();
1993 /// assert!(first.ptr_eq(&second));
1995 /// let third_rc = Arc::new(());
1996 /// let third = Arc::downgrade(&third_rc);
1997 /// assert!(!first.ptr_eq(&third));
2000 /// [`ptr::eq`]: core::ptr::eq "ptr::eq"
2003 #[stable(feature = "weak_ptr_eq", since = "1.39.0")]
2004 pub fn ptr_eq(&self, other: &Self) -> bool {
2005 self.ptr.as_ptr() == other.ptr.as_ptr()
2009 #[stable(feature = "arc_weak", since = "1.4.0")]
2010 impl<T: ?Sized> Clone for Weak<T> {
2011 /// Makes a clone of the `Weak` pointer that points to the same allocation.
2016 /// use std::sync::{Arc, Weak};
2018 /// let weak_five = Arc::downgrade(&Arc::new(5));
2020 /// let _ = Weak::clone(&weak_five);
2023 fn clone(&self) -> Weak<T> {
2024 let inner = if let Some(inner) = self.inner() {
2027 return Weak { ptr: self.ptr };
2029 // See comments in Arc::clone() for why this is relaxed. This can use a
2030 // fetch_add (ignoring the lock) because the weak count is only locked
2031 // where are *no other* weak pointers in existence. (So we can't be
2032 // running this code in that case).
2033 let old_size = inner.weak.fetch_add(1, Relaxed);
2035 // See comments in Arc::clone() for why we do this (for mem::forget).
2036 if old_size > MAX_REFCOUNT {
2040 Weak { ptr: self.ptr }
2044 #[stable(feature = "downgraded_weak", since = "1.10.0")]
2045 impl<T> Default for Weak<T> {
2046 /// Constructs a new `Weak<T>`, without allocating memory.
2047 /// Calling [`upgrade`] on the return value always
2050 /// [`upgrade`]: Weak::upgrade
2055 /// use std::sync::Weak;
2057 /// let empty: Weak<i64> = Default::default();
2058 /// assert!(empty.upgrade().is_none());
2060 fn default() -> Weak<T> {
2065 #[stable(feature = "arc_weak", since = "1.4.0")]
2066 unsafe impl<#[may_dangle] T: ?Sized> Drop for Weak<T> {
2067 /// Drops the `Weak` pointer.
2072 /// use std::sync::{Arc, Weak};
2076 /// impl Drop for Foo {
2077 /// fn drop(&mut self) {
2078 /// println!("dropped!");
2082 /// let foo = Arc::new(Foo);
2083 /// let weak_foo = Arc::downgrade(&foo);
2084 /// let other_weak_foo = Weak::clone(&weak_foo);
2086 /// drop(weak_foo); // Doesn't print anything
2087 /// drop(foo); // Prints "dropped!"
2089 /// assert!(other_weak_foo.upgrade().is_none());
2091 fn drop(&mut self) {
2092 // If we find out that we were the last weak pointer, then its time to
2093 // deallocate the data entirely. See the discussion in Arc::drop() about
2094 // the memory orderings
2096 // It's not necessary to check for the locked state here, because the
2097 // weak count can only be locked if there was precisely one weak ref,
2098 // meaning that drop could only subsequently run ON that remaining weak
2099 // ref, which can only happen after the lock is released.
2100 let inner = if let Some(inner) = self.inner() { inner } else { return };
2102 if inner.weak.fetch_sub(1, Release) == 1 {
2103 acquire!(inner.weak);
2104 unsafe { Global.deallocate(self.ptr.cast(), Layout::for_value_raw(self.ptr.as_ptr())) }
2109 #[stable(feature = "rust1", since = "1.0.0")]
2110 trait ArcEqIdent<T: ?Sized + PartialEq> {
2111 fn eq(&self, other: &Arc<T>) -> bool;
2112 fn ne(&self, other: &Arc<T>) -> bool;
2115 #[stable(feature = "rust1", since = "1.0.0")]
2116 impl<T: ?Sized + PartialEq> ArcEqIdent<T> for Arc<T> {
2118 default fn eq(&self, other: &Arc<T>) -> bool {
2122 default fn ne(&self, other: &Arc<T>) -> bool {
2127 /// We're doing this specialization here, and not as a more general optimization on `&T`, because it
2128 /// would otherwise add a cost to all equality checks on refs. We assume that `Arc`s are used to
2129 /// store large values, that are slow to clone, but also heavy to check for equality, causing this
2130 /// cost to pay off more easily. It's also more likely to have two `Arc` clones, that point to
2131 /// the same value, than two `&T`s.
2133 /// We can only do this when `T: Eq` as a `PartialEq` might be deliberately irreflexive.
2134 #[stable(feature = "rust1", since = "1.0.0")]
2135 impl<T: ?Sized + crate::rc::MarkerEq> ArcEqIdent<T> for Arc<T> {
2137 fn eq(&self, other: &Arc<T>) -> bool {
2138 Arc::ptr_eq(self, other) || **self == **other
2142 fn ne(&self, other: &Arc<T>) -> bool {
2143 !Arc::ptr_eq(self, other) && **self != **other
2147 #[stable(feature = "rust1", since = "1.0.0")]
2148 impl<T: ?Sized + PartialEq> PartialEq for Arc<T> {
2149 /// Equality for two `Arc`s.
2151 /// Two `Arc`s are equal if their inner values are equal, even if they are
2152 /// stored in different allocation.
2154 /// If `T` also implements `Eq` (implying reflexivity of equality),
2155 /// two `Arc`s that point to the same allocation are always equal.
2160 /// use std::sync::Arc;
2162 /// let five = Arc::new(5);
2164 /// assert!(five == Arc::new(5));
2167 fn eq(&self, other: &Arc<T>) -> bool {
2168 ArcEqIdent::eq(self, other)
2171 /// Inequality for two `Arc`s.
2173 /// Two `Arc`s are unequal if their inner values are unequal.
2175 /// If `T` also implements `Eq` (implying reflexivity of equality),
2176 /// two `Arc`s that point to the same value are never unequal.
2181 /// use std::sync::Arc;
2183 /// let five = Arc::new(5);
2185 /// assert!(five != Arc::new(6));
2188 fn ne(&self, other: &Arc<T>) -> bool {
2189 ArcEqIdent::ne(self, other)
2193 #[stable(feature = "rust1", since = "1.0.0")]
2194 impl<T: ?Sized + PartialOrd> PartialOrd for Arc<T> {
2195 /// Partial comparison for two `Arc`s.
2197 /// The two are compared by calling `partial_cmp()` on their inner values.
2202 /// use std::sync::Arc;
2203 /// use std::cmp::Ordering;
2205 /// let five = Arc::new(5);
2207 /// assert_eq!(Some(Ordering::Less), five.partial_cmp(&Arc::new(6)));
2209 fn partial_cmp(&self, other: &Arc<T>) -> Option<Ordering> {
2210 (**self).partial_cmp(&**other)
2213 /// Less-than comparison for two `Arc`s.
2215 /// The two are compared by calling `<` on their inner values.
2220 /// use std::sync::Arc;
2222 /// let five = Arc::new(5);
2224 /// assert!(five < Arc::new(6));
2226 fn lt(&self, other: &Arc<T>) -> bool {
2227 *(*self) < *(*other)
2230 /// 'Less than or equal to' comparison for two `Arc`s.
2232 /// The two are compared by calling `<=` on their inner values.
2237 /// use std::sync::Arc;
2239 /// let five = Arc::new(5);
2241 /// assert!(five <= Arc::new(5));
2243 fn le(&self, other: &Arc<T>) -> bool {
2244 *(*self) <= *(*other)
2247 /// Greater-than comparison for two `Arc`s.
2249 /// The two are compared by calling `>` on their inner values.
2254 /// use std::sync::Arc;
2256 /// let five = Arc::new(5);
2258 /// assert!(five > Arc::new(4));
2260 fn gt(&self, other: &Arc<T>) -> bool {
2261 *(*self) > *(*other)
2264 /// 'Greater than or equal to' comparison for two `Arc`s.
2266 /// The two are compared by calling `>=` on their inner values.
2271 /// use std::sync::Arc;
2273 /// let five = Arc::new(5);
2275 /// assert!(five >= Arc::new(5));
2277 fn ge(&self, other: &Arc<T>) -> bool {
2278 *(*self) >= *(*other)
2281 #[stable(feature = "rust1", since = "1.0.0")]
2282 impl<T: ?Sized + Ord> Ord for Arc<T> {
2283 /// Comparison for two `Arc`s.
2285 /// The two are compared by calling `cmp()` on their inner values.
2290 /// use std::sync::Arc;
2291 /// use std::cmp::Ordering;
2293 /// let five = Arc::new(5);
2295 /// assert_eq!(Ordering::Less, five.cmp(&Arc::new(6)));
2297 fn cmp(&self, other: &Arc<T>) -> Ordering {
2298 (**self).cmp(&**other)
2301 #[stable(feature = "rust1", since = "1.0.0")]
2302 impl<T: ?Sized + Eq> Eq for Arc<T> {}
2304 #[stable(feature = "rust1", since = "1.0.0")]
2305 impl<T: ?Sized + fmt::Display> fmt::Display for Arc<T> {
2306 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
2307 fmt::Display::fmt(&**self, f)
2311 #[stable(feature = "rust1", since = "1.0.0")]
2312 impl<T: ?Sized + fmt::Debug> fmt::Debug for Arc<T> {
2313 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
2314 fmt::Debug::fmt(&**self, f)
2318 #[stable(feature = "rust1", since = "1.0.0")]
2319 impl<T: ?Sized> fmt::Pointer for Arc<T> {
2320 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
2321 fmt::Pointer::fmt(&(&**self as *const T), f)
2325 #[cfg(not(no_global_oom_handling))]
2326 #[stable(feature = "rust1", since = "1.0.0")]
2327 impl<T: Default> Default for Arc<T> {
2328 /// Creates a new `Arc<T>`, with the `Default` value for `T`.
2333 /// use std::sync::Arc;
2335 /// let x: Arc<i32> = Default::default();
2336 /// assert_eq!(*x, 0);
2338 fn default() -> Arc<T> {
2339 Arc::new(Default::default())
2343 #[stable(feature = "rust1", since = "1.0.0")]
2344 impl<T: ?Sized + Hash> Hash for Arc<T> {
2345 fn hash<H: Hasher>(&self, state: &mut H) {
2346 (**self).hash(state)
2350 #[cfg(not(no_global_oom_handling))]
2351 #[stable(feature = "from_for_ptrs", since = "1.6.0")]
2352 impl<T> From<T> for Arc<T> {
2353 /// Converts a `T` into an `Arc<T>`
2355 /// The conversion moves the value into a
2356 /// newly allocated `Arc`. It is equivalent to
2357 /// calling `Arc::new(t)`.
2361 /// # use std::sync::Arc;
2363 /// let arc = Arc::new(5);
2365 /// assert_eq!(Arc::from(x), arc);
2367 fn from(t: T) -> Self {
2372 #[cfg(not(no_global_oom_handling))]
2373 #[stable(feature = "shared_from_slice", since = "1.21.0")]
2374 impl<T: Clone> From<&[T]> for Arc<[T]> {
2375 /// Allocate a reference-counted slice and fill it by cloning `v`'s items.
2380 /// # use std::sync::Arc;
2381 /// let original: &[i32] = &[1, 2, 3];
2382 /// let shared: Arc<[i32]> = Arc::from(original);
2383 /// assert_eq!(&[1, 2, 3], &shared[..]);
2386 fn from(v: &[T]) -> Arc<[T]> {
2387 <Self as ArcFromSlice<T>>::from_slice(v)
2391 #[cfg(not(no_global_oom_handling))]
2392 #[stable(feature = "shared_from_slice", since = "1.21.0")]
2393 impl From<&str> for Arc<str> {
2394 /// Allocate a reference-counted `str` and copy `v` into it.
2399 /// # use std::sync::Arc;
2400 /// let shared: Arc<str> = Arc::from("eggplant");
2401 /// assert_eq!("eggplant", &shared[..]);
2404 fn from(v: &str) -> Arc<str> {
2405 let arc = Arc::<[u8]>::from(v.as_bytes());
2406 unsafe { Arc::from_raw(Arc::into_raw(arc) as *const str) }
2410 #[cfg(not(no_global_oom_handling))]
2411 #[stable(feature = "shared_from_slice", since = "1.21.0")]
2412 impl From<String> for Arc<str> {
2413 /// Allocate a reference-counted `str` and copy `v` into it.
2418 /// # use std::sync::Arc;
2419 /// let unique: String = "eggplant".to_owned();
2420 /// let shared: Arc<str> = Arc::from(unique);
2421 /// assert_eq!("eggplant", &shared[..]);
2424 fn from(v: String) -> Arc<str> {
2429 #[cfg(not(no_global_oom_handling))]
2430 #[stable(feature = "shared_from_slice", since = "1.21.0")]
2431 impl<T: ?Sized> From<Box<T>> for Arc<T> {
2432 /// Move a boxed object to a new, reference-counted allocation.
2437 /// # use std::sync::Arc;
2438 /// let unique: Box<str> = Box::from("eggplant");
2439 /// let shared: Arc<str> = Arc::from(unique);
2440 /// assert_eq!("eggplant", &shared[..]);
2443 fn from(v: Box<T>) -> Arc<T> {
2448 #[cfg(not(no_global_oom_handling))]
2449 #[stable(feature = "shared_from_slice", since = "1.21.0")]
2450 impl<T> From<Vec<T>> for Arc<[T]> {
2451 /// Allocate a reference-counted slice and move `v`'s items into it.
2456 /// # use std::sync::Arc;
2457 /// let unique: Vec<i32> = vec![1, 2, 3];
2458 /// let shared: Arc<[i32]> = Arc::from(unique);
2459 /// assert_eq!(&[1, 2, 3], &shared[..]);
2462 fn from(mut v: Vec<T>) -> Arc<[T]> {
2464 let arc = Arc::copy_from_slice(&v);
2466 // Allow the Vec to free its memory, but not destroy its contents
2474 #[stable(feature = "shared_from_cow", since = "1.45.0")]
2475 impl<'a, B> From<Cow<'a, B>> for Arc<B>
2477 B: ToOwned + ?Sized,
2478 Arc<B>: From<&'a B> + From<B::Owned>,
2480 /// Create an atomically reference-counted pointer from
2481 /// a clone-on-write pointer by copying its content.
2486 /// # use std::sync::Arc;
2487 /// # use std::borrow::Cow;
2488 /// let cow: Cow<str> = Cow::Borrowed("eggplant");
2489 /// let shared: Arc<str> = Arc::from(cow);
2490 /// assert_eq!("eggplant", &shared[..]);
2493 fn from(cow: Cow<'a, B>) -> Arc<B> {
2495 Cow::Borrowed(s) => Arc::from(s),
2496 Cow::Owned(s) => Arc::from(s),
2501 #[stable(feature = "boxed_slice_try_from", since = "1.43.0")]
2502 impl<T, const N: usize> TryFrom<Arc<[T]>> for Arc<[T; N]> {
2503 type Error = Arc<[T]>;
2505 fn try_from(boxed_slice: Arc<[T]>) -> Result<Self, Self::Error> {
2506 if boxed_slice.len() == N {
2507 Ok(unsafe { Arc::from_raw(Arc::into_raw(boxed_slice) as *mut [T; N]) })
2514 #[cfg(not(no_global_oom_handling))]
2515 #[stable(feature = "shared_from_iter", since = "1.37.0")]
2516 impl<T> iter::FromIterator<T> for Arc<[T]> {
2517 /// Takes each element in the `Iterator` and collects it into an `Arc<[T]>`.
2519 /// # Performance characteristics
2521 /// ## The general case
2523 /// In the general case, collecting into `Arc<[T]>` is done by first
2524 /// collecting into a `Vec<T>`. That is, when writing the following:
2527 /// # use std::sync::Arc;
2528 /// let evens: Arc<[u8]> = (0..10).filter(|&x| x % 2 == 0).collect();
2529 /// # assert_eq!(&*evens, &[0, 2, 4, 6, 8]);
2532 /// this behaves as if we wrote:
2535 /// # use std::sync::Arc;
2536 /// let evens: Arc<[u8]> = (0..10).filter(|&x| x % 2 == 0)
2537 /// .collect::<Vec<_>>() // The first set of allocations happens here.
2538 /// .into(); // A second allocation for `Arc<[T]>` happens here.
2539 /// # assert_eq!(&*evens, &[0, 2, 4, 6, 8]);
2542 /// This will allocate as many times as needed for constructing the `Vec<T>`
2543 /// and then it will allocate once for turning the `Vec<T>` into the `Arc<[T]>`.
2545 /// ## Iterators of known length
2547 /// When your `Iterator` implements `TrustedLen` and is of an exact size,
2548 /// a single allocation will be made for the `Arc<[T]>`. For example:
2551 /// # use std::sync::Arc;
2552 /// let evens: Arc<[u8]> = (0..10).collect(); // Just a single allocation happens here.
2553 /// # assert_eq!(&*evens, &*(0..10).collect::<Vec<_>>());
2555 fn from_iter<I: iter::IntoIterator<Item = T>>(iter: I) -> Self {
2556 ToArcSlice::to_arc_slice(iter.into_iter())
2560 /// Specialization trait used for collecting into `Arc<[T]>`.
2561 trait ToArcSlice<T>: Iterator<Item = T> + Sized {
2562 fn to_arc_slice(self) -> Arc<[T]>;
2565 #[cfg(not(no_global_oom_handling))]
2566 impl<T, I: Iterator<Item = T>> ToArcSlice<T> for I {
2567 default fn to_arc_slice(self) -> Arc<[T]> {
2568 self.collect::<Vec<T>>().into()
2572 #[cfg(not(no_global_oom_handling))]
2573 impl<T, I: iter::TrustedLen<Item = T>> ToArcSlice<T> for I {
2574 fn to_arc_slice(self) -> Arc<[T]> {
2575 // This is the case for a `TrustedLen` iterator.
2576 let (low, high) = self.size_hint();
2577 if let Some(high) = high {
2581 "TrustedLen iterator's size hint is not exact: {:?}",
2586 // SAFETY: We need to ensure that the iterator has an exact length and we have.
2587 Arc::from_iter_exact(self, low)
2590 // TrustedLen contract guarantees that `upper_bound == `None` implies an iterator
2591 // length exceeding `usize::MAX`.
2592 // The default implementation would collect into a vec which would panic.
2593 // Thus we panic here immediately without invoking `Vec` code.
2594 panic!("capacity overflow");
2599 #[stable(feature = "rust1", since = "1.0.0")]
2600 impl<T: ?Sized> borrow::Borrow<T> for Arc<T> {
2601 fn borrow(&self) -> &T {
2606 #[stable(since = "1.5.0", feature = "smart_ptr_as_ref")]
2607 impl<T: ?Sized> AsRef<T> for Arc<T> {
2608 fn as_ref(&self) -> &T {
2613 #[stable(feature = "pin", since = "1.33.0")]
2614 impl<T: ?Sized> Unpin for Arc<T> {}
2616 /// Get the offset within an `ArcInner` for the payload behind a pointer.
2620 /// The pointer must point to (and have valid metadata for) a previously
2621 /// valid instance of T, but the T is allowed to be dropped.
2622 unsafe fn data_offset<T: ?Sized>(ptr: *const T) -> isize {
2623 // Align the unsized value to the end of the ArcInner.
2624 // Because RcBox is repr(C), it will always be the last field in memory.
2625 // SAFETY: since the only unsized types possible are slices, trait objects,
2626 // and extern types, the input safety requirement is currently enough to
2627 // satisfy the requirements of align_of_val_raw; this is an implementation
2628 // detail of the language that must not be relied upon outside of std.
2629 unsafe { data_offset_align(align_of_val_raw(ptr)) }
2633 fn data_offset_align(align: usize) -> isize {
2634 let layout = Layout::new::<ArcInner<()>>();
2635 (layout.size() + layout.padding_needed_for(align)) as isize