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 /// let five = unsafe {
441 /// // Deferred initialization:
442 /// Arc::get_mut_unchecked(&mut five).as_mut_ptr().write(5);
444 /// five.assume_init()
447 /// assert_eq!(*five, 5)
449 #[cfg(not(no_global_oom_handling))]
450 #[unstable(feature = "new_uninit", issue = "63291")]
452 pub fn new_uninit() -> Arc<mem::MaybeUninit<T>> {
454 Arc::from_ptr(Arc::allocate_for_layout(
456 |layout| Global.allocate(layout),
457 |mem| mem as *mut ArcInner<mem::MaybeUninit<T>>,
462 /// Constructs a new `Arc` with uninitialized contents, with the memory
463 /// being filled with `0` bytes.
465 /// See [`MaybeUninit::zeroed`][zeroed] for examples of correct and incorrect usage
471 /// #![feature(new_uninit)]
473 /// use std::sync::Arc;
475 /// let zero = Arc::<u32>::new_zeroed();
476 /// let zero = unsafe { zero.assume_init() };
478 /// assert_eq!(*zero, 0)
481 /// [zeroed]: mem::MaybeUninit::zeroed
482 #[cfg(not(no_global_oom_handling))]
483 #[unstable(feature = "new_uninit", issue = "63291")]
485 pub fn new_zeroed() -> Arc<mem::MaybeUninit<T>> {
487 Arc::from_ptr(Arc::allocate_for_layout(
489 |layout| Global.allocate_zeroed(layout),
490 |mem| mem as *mut ArcInner<mem::MaybeUninit<T>>,
495 /// Constructs a new `Pin<Arc<T>>`. If `T` does not implement `Unpin`, then
496 /// `data` will be pinned in memory and unable to be moved.
497 #[cfg(not(no_global_oom_handling))]
498 #[stable(feature = "pin", since = "1.33.0")]
500 pub fn pin(data: T) -> Pin<Arc<T>> {
501 unsafe { Pin::new_unchecked(Arc::new(data)) }
504 /// Constructs a new `Pin<Arc<T>>`, return an error if allocation fails.
505 #[unstable(feature = "allocator_api", issue = "32838")]
507 pub fn try_pin(data: T) -> Result<Pin<Arc<T>>, AllocError> {
508 unsafe { Ok(Pin::new_unchecked(Arc::try_new(data)?)) }
511 /// Constructs a new `Arc<T>`, returning an error if allocation fails.
516 /// #![feature(allocator_api)]
517 /// use std::sync::Arc;
519 /// let five = Arc::try_new(5)?;
520 /// # Ok::<(), std::alloc::AllocError>(())
522 #[unstable(feature = "allocator_api", issue = "32838")]
524 pub fn try_new(data: T) -> Result<Arc<T>, AllocError> {
525 // Start the weak pointer count as 1 which is the weak pointer that's
526 // held by all the strong pointers (kinda), see std/rc.rs for more info
527 let x: Box<_> = Box::try_new(ArcInner {
528 strong: atomic::AtomicUsize::new(1),
529 weak: atomic::AtomicUsize::new(1),
532 unsafe { Ok(Self::from_inner(Box::leak(x).into())) }
535 /// Constructs a new `Arc` with uninitialized contents, returning an error
536 /// if allocation fails.
541 /// #![feature(new_uninit, allocator_api)]
542 /// #![feature(get_mut_unchecked)]
544 /// use std::sync::Arc;
546 /// let mut five = Arc::<u32>::try_new_uninit()?;
548 /// let five = unsafe {
549 /// // Deferred initialization:
550 /// Arc::get_mut_unchecked(&mut five).as_mut_ptr().write(5);
552 /// five.assume_init()
555 /// assert_eq!(*five, 5);
556 /// # Ok::<(), std::alloc::AllocError>(())
558 #[unstable(feature = "allocator_api", issue = "32838")]
559 // #[unstable(feature = "new_uninit", issue = "63291")]
560 pub fn try_new_uninit() -> Result<Arc<mem::MaybeUninit<T>>, AllocError> {
562 Ok(Arc::from_ptr(Arc::try_allocate_for_layout(
564 |layout| Global.allocate(layout),
565 |mem| mem as *mut ArcInner<mem::MaybeUninit<T>>,
570 /// Constructs a new `Arc` with uninitialized contents, with the memory
571 /// being filled with `0` bytes, returning an error if allocation fails.
573 /// See [`MaybeUninit::zeroed`][zeroed] for examples of correct and incorrect usage
579 /// #![feature(new_uninit, allocator_api)]
581 /// use std::sync::Arc;
583 /// let zero = Arc::<u32>::try_new_zeroed()?;
584 /// let zero = unsafe { zero.assume_init() };
586 /// assert_eq!(*zero, 0);
587 /// # Ok::<(), std::alloc::AllocError>(())
590 /// [zeroed]: mem::MaybeUninit::zeroed
591 #[unstable(feature = "allocator_api", issue = "32838")]
592 // #[unstable(feature = "new_uninit", issue = "63291")]
593 pub fn try_new_zeroed() -> Result<Arc<mem::MaybeUninit<T>>, AllocError> {
595 Ok(Arc::from_ptr(Arc::try_allocate_for_layout(
597 |layout| Global.allocate_zeroed(layout),
598 |mem| mem as *mut ArcInner<mem::MaybeUninit<T>>,
602 /// Returns the inner value, if the `Arc` has exactly one strong reference.
604 /// Otherwise, an [`Err`] is returned with the same `Arc` that was
607 /// This will succeed even if there are outstanding weak references.
612 /// use std::sync::Arc;
614 /// let x = Arc::new(3);
615 /// assert_eq!(Arc::try_unwrap(x), Ok(3));
617 /// let x = Arc::new(4);
618 /// let _y = Arc::clone(&x);
619 /// assert_eq!(*Arc::try_unwrap(x).unwrap_err(), 4);
622 #[stable(feature = "arc_unique", since = "1.4.0")]
623 pub fn try_unwrap(this: Self) -> Result<T, Self> {
624 if this.inner().strong.compare_exchange(1, 0, Relaxed, Relaxed).is_err() {
628 acquire!(this.inner().strong);
631 let elem = ptr::read(&this.ptr.as_ref().data);
633 // Make a weak pointer to clean up the implicit strong-weak reference
634 let _weak = Weak { ptr: this.ptr };
643 /// Constructs a new atomically reference-counted slice with uninitialized contents.
648 /// #![feature(new_uninit)]
649 /// #![feature(get_mut_unchecked)]
651 /// use std::sync::Arc;
653 /// let mut values = Arc::<[u32]>::new_uninit_slice(3);
655 /// let values = unsafe {
656 /// // Deferred initialization:
657 /// Arc::get_mut_unchecked(&mut values)[0].as_mut_ptr().write(1);
658 /// Arc::get_mut_unchecked(&mut values)[1].as_mut_ptr().write(2);
659 /// Arc::get_mut_unchecked(&mut values)[2].as_mut_ptr().write(3);
661 /// values.assume_init()
664 /// assert_eq!(*values, [1, 2, 3])
666 #[cfg(not(no_global_oom_handling))]
667 #[unstable(feature = "new_uninit", issue = "63291")]
669 pub fn new_uninit_slice(len: usize) -> Arc<[mem::MaybeUninit<T>]> {
670 unsafe { Arc::from_ptr(Arc::allocate_for_slice(len)) }
673 /// Constructs a new atomically reference-counted slice with uninitialized contents, with the memory being
674 /// filled with `0` bytes.
676 /// See [`MaybeUninit::zeroed`][zeroed] for examples of correct and
677 /// incorrect usage of this method.
682 /// #![feature(new_uninit)]
684 /// use std::sync::Arc;
686 /// let values = Arc::<[u32]>::new_zeroed_slice(3);
687 /// let values = unsafe { values.assume_init() };
689 /// assert_eq!(*values, [0, 0, 0])
692 /// [zeroed]: mem::MaybeUninit::zeroed
693 #[cfg(not(no_global_oom_handling))]
694 #[unstable(feature = "new_uninit", issue = "63291")]
696 pub fn new_zeroed_slice(len: usize) -> Arc<[mem::MaybeUninit<T>]> {
698 Arc::from_ptr(Arc::allocate_for_layout(
699 Layout::array::<T>(len).unwrap(),
700 |layout| Global.allocate_zeroed(layout),
702 ptr::slice_from_raw_parts_mut(mem as *mut T, len)
703 as *mut ArcInner<[mem::MaybeUninit<T>]>
710 impl<T> Arc<mem::MaybeUninit<T>> {
711 /// Converts to `Arc<T>`.
715 /// As with [`MaybeUninit::assume_init`],
716 /// it is up to the caller to guarantee that the inner value
717 /// really is in an initialized state.
718 /// Calling this when the content is not yet fully initialized
719 /// causes immediate undefined behavior.
721 /// [`MaybeUninit::assume_init`]: mem::MaybeUninit::assume_init
726 /// #![feature(new_uninit)]
727 /// #![feature(get_mut_unchecked)]
729 /// use std::sync::Arc;
731 /// let mut five = Arc::<u32>::new_uninit();
733 /// let five = unsafe {
734 /// // Deferred initialization:
735 /// Arc::get_mut_unchecked(&mut five).as_mut_ptr().write(5);
737 /// five.assume_init()
740 /// assert_eq!(*five, 5)
742 #[unstable(feature = "new_uninit", issue = "63291")]
743 #[must_use = "`self` will be dropped if the result is not used"]
745 pub unsafe fn assume_init(self) -> Arc<T> {
746 unsafe { Arc::from_inner(mem::ManuallyDrop::new(self).ptr.cast()) }
750 impl<T> Arc<[mem::MaybeUninit<T>]> {
751 /// Converts to `Arc<[T]>`.
755 /// As with [`MaybeUninit::assume_init`],
756 /// it is up to the caller to guarantee that the inner value
757 /// really is in an initialized state.
758 /// Calling this when the content is not yet fully initialized
759 /// causes immediate undefined behavior.
761 /// [`MaybeUninit::assume_init`]: mem::MaybeUninit::assume_init
766 /// #![feature(new_uninit)]
767 /// #![feature(get_mut_unchecked)]
769 /// use std::sync::Arc;
771 /// let mut values = Arc::<[u32]>::new_uninit_slice(3);
773 /// let values = unsafe {
774 /// // Deferred initialization:
775 /// Arc::get_mut_unchecked(&mut values)[0].as_mut_ptr().write(1);
776 /// Arc::get_mut_unchecked(&mut values)[1].as_mut_ptr().write(2);
777 /// Arc::get_mut_unchecked(&mut values)[2].as_mut_ptr().write(3);
779 /// values.assume_init()
782 /// assert_eq!(*values, [1, 2, 3])
784 #[unstable(feature = "new_uninit", issue = "63291")]
785 #[must_use = "`self` will be dropped if the result is not used"]
787 pub unsafe fn assume_init(self) -> Arc<[T]> {
788 unsafe { Arc::from_ptr(mem::ManuallyDrop::new(self).ptr.as_ptr() as _) }
792 impl<T: ?Sized> Arc<T> {
793 /// Consumes the `Arc`, returning the wrapped pointer.
795 /// To avoid a memory leak the pointer must be converted back to an `Arc` using
796 /// [`Arc::from_raw`].
801 /// use std::sync::Arc;
803 /// let x = Arc::new("hello".to_owned());
804 /// let x_ptr = Arc::into_raw(x);
805 /// assert_eq!(unsafe { &*x_ptr }, "hello");
807 #[must_use = "losing the pointer will leak memory"]
808 #[stable(feature = "rc_raw", since = "1.17.0")]
809 pub fn into_raw(this: Self) -> *const T {
810 let ptr = Self::as_ptr(&this);
815 /// Provides a raw pointer to the data.
817 /// The counts are not affected in any way and the `Arc` is not consumed. The pointer is valid for
818 /// as long as there are strong counts in the `Arc`.
823 /// use std::sync::Arc;
825 /// let x = Arc::new("hello".to_owned());
826 /// let y = Arc::clone(&x);
827 /// let x_ptr = Arc::as_ptr(&x);
828 /// assert_eq!(x_ptr, Arc::as_ptr(&y));
829 /// assert_eq!(unsafe { &*x_ptr }, "hello");
832 #[stable(feature = "rc_as_ptr", since = "1.45.0")]
833 pub fn as_ptr(this: &Self) -> *const T {
834 let ptr: *mut ArcInner<T> = NonNull::as_ptr(this.ptr);
836 // SAFETY: This cannot go through Deref::deref or RcBoxPtr::inner because
837 // this is required to retain raw/mut provenance such that e.g. `get_mut` can
838 // write through the pointer after the Rc is recovered through `from_raw`.
839 unsafe { ptr::addr_of_mut!((*ptr).data) }
842 /// Constructs an `Arc<T>` from a raw pointer.
844 /// The raw pointer must have been previously returned by a call to
845 /// [`Arc<U>::into_raw`][into_raw] where `U` must have the same size and
846 /// alignment as `T`. This is trivially true if `U` is `T`.
847 /// Note that if `U` is not `T` but has the same size and alignment, this is
848 /// basically like transmuting references of different types. See
849 /// [`mem::transmute`][transmute] for more information on what
850 /// restrictions apply in this case.
852 /// The user of `from_raw` has to make sure a specific value of `T` is only
855 /// This function is unsafe because improper use may lead to memory unsafety,
856 /// even if the returned `Arc<T>` is never accessed.
858 /// [into_raw]: Arc::into_raw
859 /// [transmute]: core::mem::transmute
864 /// use std::sync::Arc;
866 /// let x = Arc::new("hello".to_owned());
867 /// let x_ptr = Arc::into_raw(x);
870 /// // Convert back to an `Arc` to prevent leak.
871 /// let x = Arc::from_raw(x_ptr);
872 /// assert_eq!(&*x, "hello");
874 /// // Further calls to `Arc::from_raw(x_ptr)` would be memory-unsafe.
877 /// // The memory was freed when `x` went out of scope above, so `x_ptr` is now dangling!
879 #[stable(feature = "rc_raw", since = "1.17.0")]
880 pub unsafe fn from_raw(ptr: *const T) -> Self {
882 let offset = data_offset(ptr);
884 // Reverse the offset to find the original ArcInner.
885 let arc_ptr = (ptr as *mut ArcInner<T>).set_ptr_value((ptr as *mut u8).offset(-offset));
887 Self::from_ptr(arc_ptr)
891 /// Creates a new [`Weak`] pointer to this allocation.
896 /// use std::sync::Arc;
898 /// let five = Arc::new(5);
900 /// let weak_five = Arc::downgrade(&five);
902 #[must_use = "this returns a new `Weak` pointer, \
903 without modifying the original `Arc`"]
904 #[stable(feature = "arc_weak", since = "1.4.0")]
905 pub fn downgrade(this: &Self) -> Weak<T> {
906 // This Relaxed is OK because we're checking the value in the CAS
908 let mut cur = this.inner().weak.load(Relaxed);
911 // check if the weak counter is currently "locked"; if so, spin.
912 if cur == usize::MAX {
914 cur = this.inner().weak.load(Relaxed);
918 // NOTE: this code currently ignores the possibility of overflow
919 // into usize::MAX; in general both Rc and Arc need to be adjusted
920 // to deal with overflow.
922 // Unlike with Clone(), we need this to be an Acquire read to
923 // synchronize with the write coming from `is_unique`, so that the
924 // events prior to that write happen before this read.
925 match this.inner().weak.compare_exchange_weak(cur, cur + 1, Acquire, Relaxed) {
927 // Make sure we do not create a dangling Weak
928 debug_assert!(!is_dangling(this.ptr.as_ptr()));
929 return Weak { ptr: this.ptr };
931 Err(old) => cur = old,
936 /// Gets the number of [`Weak`] pointers to this allocation.
940 /// This method by itself is safe, but using it correctly requires extra care.
941 /// Another thread can change the weak count at any time,
942 /// including potentially between calling this method and acting on the result.
947 /// use std::sync::Arc;
949 /// let five = Arc::new(5);
950 /// let _weak_five = Arc::downgrade(&five);
952 /// // This assertion is deterministic because we haven't shared
953 /// // the `Arc` or `Weak` between threads.
954 /// assert_eq!(1, Arc::weak_count(&five));
958 #[stable(feature = "arc_counts", since = "1.15.0")]
959 pub fn weak_count(this: &Self) -> usize {
960 let cnt = this.inner().weak.load(SeqCst);
961 // If the weak count is currently locked, the value of the
962 // count was 0 just before taking the lock.
963 if cnt == usize::MAX { 0 } else { cnt - 1 }
966 /// Gets the number of strong (`Arc`) pointers to this allocation.
970 /// This method by itself is safe, but using it correctly requires extra care.
971 /// Another thread can change the strong count at any time,
972 /// including potentially between calling this method and acting on the result.
977 /// use std::sync::Arc;
979 /// let five = Arc::new(5);
980 /// let _also_five = Arc::clone(&five);
982 /// // This assertion is deterministic because we haven't shared
983 /// // the `Arc` between threads.
984 /// assert_eq!(2, Arc::strong_count(&five));
988 #[stable(feature = "arc_counts", since = "1.15.0")]
989 pub fn strong_count(this: &Self) -> usize {
990 this.inner().strong.load(SeqCst)
993 /// Increments the strong reference count on the `Arc<T>` associated with the
994 /// provided pointer by one.
998 /// The pointer must have been obtained through `Arc::into_raw`, and the
999 /// associated `Arc` instance must be valid (i.e. the strong count must be at
1000 /// least 1) for the duration of this method.
1005 /// use std::sync::Arc;
1007 /// let five = Arc::new(5);
1010 /// let ptr = Arc::into_raw(five);
1011 /// Arc::increment_strong_count(ptr);
1013 /// // This assertion is deterministic because we haven't shared
1014 /// // the `Arc` between threads.
1015 /// let five = Arc::from_raw(ptr);
1016 /// assert_eq!(2, Arc::strong_count(&five));
1020 #[stable(feature = "arc_mutate_strong_count", since = "1.51.0")]
1021 pub unsafe fn increment_strong_count(ptr: *const T) {
1022 // Retain Arc, but don't touch refcount by wrapping in ManuallyDrop
1023 let arc = unsafe { mem::ManuallyDrop::new(Arc::<T>::from_raw(ptr)) };
1024 // Now increase refcount, but don't drop new refcount either
1025 let _arc_clone: mem::ManuallyDrop<_> = arc.clone();
1028 /// Decrements the strong reference count on the `Arc<T>` associated with the
1029 /// provided pointer by one.
1033 /// The pointer must have been obtained through `Arc::into_raw`, and the
1034 /// associated `Arc` instance must be valid (i.e. the strong count must be at
1035 /// least 1) when invoking this method. This method can be used to release the final
1036 /// `Arc` and backing storage, but **should not** be called after the final `Arc` has been
1042 /// use std::sync::Arc;
1044 /// let five = Arc::new(5);
1047 /// let ptr = Arc::into_raw(five);
1048 /// Arc::increment_strong_count(ptr);
1050 /// // Those assertions are deterministic because we haven't shared
1051 /// // the `Arc` between threads.
1052 /// let five = Arc::from_raw(ptr);
1053 /// assert_eq!(2, Arc::strong_count(&five));
1054 /// Arc::decrement_strong_count(ptr);
1055 /// assert_eq!(1, Arc::strong_count(&five));
1059 #[stable(feature = "arc_mutate_strong_count", since = "1.51.0")]
1060 pub unsafe fn decrement_strong_count(ptr: *const T) {
1061 unsafe { mem::drop(Arc::from_raw(ptr)) };
1065 fn inner(&self) -> &ArcInner<T> {
1066 // This unsafety is ok because while this arc is alive we're guaranteed
1067 // that the inner pointer is valid. Furthermore, we know that the
1068 // `ArcInner` structure itself is `Sync` because the inner data is
1069 // `Sync` as well, so we're ok loaning out an immutable pointer to these
1071 unsafe { self.ptr.as_ref() }
1074 // Non-inlined part of `drop`.
1076 unsafe fn drop_slow(&mut self) {
1077 // Destroy the data at this time, even though we must not free the box
1078 // allocation itself (there might still be weak pointers lying around).
1079 unsafe { ptr::drop_in_place(Self::get_mut_unchecked(self)) };
1081 // Drop the weak ref collectively held by all strong references
1082 drop(Weak { ptr: self.ptr });
1085 /// Returns `true` if the two `Arc`s point to the same allocation
1086 /// (in a vein similar to [`ptr::eq`]).
1091 /// use std::sync::Arc;
1093 /// let five = Arc::new(5);
1094 /// let same_five = Arc::clone(&five);
1095 /// let other_five = Arc::new(5);
1097 /// assert!(Arc::ptr_eq(&five, &same_five));
1098 /// assert!(!Arc::ptr_eq(&five, &other_five));
1101 /// [`ptr::eq`]: core::ptr::eq "ptr::eq"
1104 #[stable(feature = "ptr_eq", since = "1.17.0")]
1105 pub fn ptr_eq(this: &Self, other: &Self) -> bool {
1106 this.ptr.as_ptr() == other.ptr.as_ptr()
1110 impl<T: ?Sized> Arc<T> {
1111 /// Allocates an `ArcInner<T>` with sufficient space for
1112 /// a possibly-unsized inner value where the value has the layout provided.
1114 /// The function `mem_to_arcinner` is called with the data pointer
1115 /// and must return back a (potentially fat)-pointer for the `ArcInner<T>`.
1116 #[cfg(not(no_global_oom_handling))]
1117 unsafe fn allocate_for_layout(
1118 value_layout: Layout,
1119 allocate: impl FnOnce(Layout) -> Result<NonNull<[u8]>, AllocError>,
1120 mem_to_arcinner: impl FnOnce(*mut u8) -> *mut ArcInner<T>,
1121 ) -> *mut ArcInner<T> {
1122 // Calculate layout using the given value layout.
1123 // Previously, layout was calculated on the expression
1124 // `&*(ptr as *const ArcInner<T>)`, but this created a misaligned
1125 // reference (see #54908).
1126 let layout = Layout::new::<ArcInner<()>>().extend(value_layout).unwrap().0.pad_to_align();
1128 Arc::try_allocate_for_layout(value_layout, allocate, mem_to_arcinner)
1129 .unwrap_or_else(|_| handle_alloc_error(layout))
1133 /// Allocates an `ArcInner<T>` with sufficient space for
1134 /// a possibly-unsized inner value where the value has the layout provided,
1135 /// returning an error if allocation fails.
1137 /// The function `mem_to_arcinner` is called with the data pointer
1138 /// and must return back a (potentially fat)-pointer for the `ArcInner<T>`.
1139 unsafe fn try_allocate_for_layout(
1140 value_layout: Layout,
1141 allocate: impl FnOnce(Layout) -> Result<NonNull<[u8]>, AllocError>,
1142 mem_to_arcinner: impl FnOnce(*mut u8) -> *mut ArcInner<T>,
1143 ) -> Result<*mut ArcInner<T>, AllocError> {
1144 // Calculate layout using the given value layout.
1145 // Previously, layout was calculated on the expression
1146 // `&*(ptr as *const ArcInner<T>)`, but this created a misaligned
1147 // reference (see #54908).
1148 let layout = Layout::new::<ArcInner<()>>().extend(value_layout).unwrap().0.pad_to_align();
1150 let ptr = allocate(layout)?;
1152 // Initialize the ArcInner
1153 let inner = mem_to_arcinner(ptr.as_non_null_ptr().as_ptr());
1154 debug_assert_eq!(unsafe { Layout::for_value(&*inner) }, layout);
1157 ptr::write(&mut (*inner).strong, atomic::AtomicUsize::new(1));
1158 ptr::write(&mut (*inner).weak, atomic::AtomicUsize::new(1));
1164 /// Allocates an `ArcInner<T>` with sufficient space for an unsized inner value.
1165 #[cfg(not(no_global_oom_handling))]
1166 unsafe fn allocate_for_ptr(ptr: *const T) -> *mut ArcInner<T> {
1167 // Allocate for the `ArcInner<T>` using the given value.
1169 Self::allocate_for_layout(
1170 Layout::for_value(&*ptr),
1171 |layout| Global.allocate(layout),
1172 |mem| (ptr as *mut ArcInner<T>).set_ptr_value(mem) as *mut ArcInner<T>,
1177 #[cfg(not(no_global_oom_handling))]
1178 fn from_box(v: Box<T>) -> Arc<T> {
1180 let (box_unique, alloc) = Box::into_unique(v);
1181 let bptr = box_unique.as_ptr();
1183 let value_size = size_of_val(&*bptr);
1184 let ptr = Self::allocate_for_ptr(bptr);
1186 // Copy value as bytes
1187 ptr::copy_nonoverlapping(
1188 bptr as *const T as *const u8,
1189 &mut (*ptr).data as *mut _ as *mut u8,
1193 // Free the allocation without dropping its contents
1194 box_free(box_unique, alloc);
1202 /// Allocates an `ArcInner<[T]>` with the given length.
1203 #[cfg(not(no_global_oom_handling))]
1204 unsafe fn allocate_for_slice(len: usize) -> *mut ArcInner<[T]> {
1206 Self::allocate_for_layout(
1207 Layout::array::<T>(len).unwrap(),
1208 |layout| Global.allocate(layout),
1209 |mem| ptr::slice_from_raw_parts_mut(mem as *mut T, len) as *mut ArcInner<[T]>,
1214 /// Copy elements from slice into newly allocated Arc<\[T\]>
1216 /// Unsafe because the caller must either take ownership or bind `T: Copy`.
1217 #[cfg(not(no_global_oom_handling))]
1218 unsafe fn copy_from_slice(v: &[T]) -> Arc<[T]> {
1220 let ptr = Self::allocate_for_slice(v.len());
1222 ptr::copy_nonoverlapping(v.as_ptr(), &mut (*ptr).data as *mut [T] as *mut T, v.len());
1228 /// Constructs an `Arc<[T]>` from an iterator known to be of a certain size.
1230 /// Behavior is undefined should the size be wrong.
1231 #[cfg(not(no_global_oom_handling))]
1232 unsafe fn from_iter_exact(iter: impl iter::Iterator<Item = T>, len: usize) -> Arc<[T]> {
1233 // Panic guard while cloning T elements.
1234 // In the event of a panic, elements that have been written
1235 // into the new ArcInner will be dropped, then the memory freed.
1243 impl<T> Drop for Guard<T> {
1244 fn drop(&mut self) {
1246 let slice = from_raw_parts_mut(self.elems, self.n_elems);
1247 ptr::drop_in_place(slice);
1249 Global.deallocate(self.mem, self.layout);
1255 let ptr = Self::allocate_for_slice(len);
1257 let mem = ptr as *mut _ as *mut u8;
1258 let layout = Layout::for_value(&*ptr);
1260 // Pointer to first element
1261 let elems = &mut (*ptr).data as *mut [T] as *mut T;
1263 let mut guard = Guard { mem: NonNull::new_unchecked(mem), elems, layout, n_elems: 0 };
1265 for (i, item) in iter.enumerate() {
1266 ptr::write(elems.add(i), item);
1270 // All clear. Forget the guard so it doesn't free the new ArcInner.
1278 /// Specialization trait used for `From<&[T]>`.
1279 #[cfg(not(no_global_oom_handling))]
1280 trait ArcFromSlice<T> {
1281 fn from_slice(slice: &[T]) -> Self;
1284 #[cfg(not(no_global_oom_handling))]
1285 impl<T: Clone> ArcFromSlice<T> for Arc<[T]> {
1287 default fn from_slice(v: &[T]) -> Self {
1288 unsafe { Self::from_iter_exact(v.iter().cloned(), v.len()) }
1292 #[cfg(not(no_global_oom_handling))]
1293 impl<T: Copy> ArcFromSlice<T> for Arc<[T]> {
1295 fn from_slice(v: &[T]) -> Self {
1296 unsafe { Arc::copy_from_slice(v) }
1300 #[stable(feature = "rust1", since = "1.0.0")]
1301 impl<T: ?Sized> Clone for Arc<T> {
1302 /// Makes a clone of the `Arc` pointer.
1304 /// This creates another pointer to the same allocation, increasing the
1305 /// strong reference count.
1310 /// use std::sync::Arc;
1312 /// let five = Arc::new(5);
1314 /// let _ = Arc::clone(&five);
1317 fn clone(&self) -> Arc<T> {
1318 // Using a relaxed ordering is alright here, as knowledge of the
1319 // original reference prevents other threads from erroneously deleting
1322 // As explained in the [Boost documentation][1], Increasing the
1323 // reference counter can always be done with memory_order_relaxed: New
1324 // references to an object can only be formed from an existing
1325 // reference, and passing an existing reference from one thread to
1326 // another must already provide any required synchronization.
1328 // [1]: (www.boost.org/doc/libs/1_55_0/doc/html/atomic/usage_examples.html)
1329 let old_size = self.inner().strong.fetch_add(1, Relaxed);
1331 // However we need to guard against massive refcounts in case someone
1332 // is `mem::forget`ing Arcs. If we don't do this the count can overflow
1333 // and users will use-after free. We racily saturate to `isize::MAX` on
1334 // the assumption that there aren't ~2 billion threads incrementing
1335 // the reference count at once. This branch will never be taken in
1336 // any realistic program.
1338 // We abort because such a program is incredibly degenerate, and we
1339 // don't care to support it.
1340 if old_size > MAX_REFCOUNT {
1344 unsafe { Self::from_inner(self.ptr) }
1348 #[stable(feature = "rust1", since = "1.0.0")]
1349 impl<T: ?Sized> Deref for Arc<T> {
1353 fn deref(&self) -> &T {
1358 #[unstable(feature = "receiver_trait", issue = "none")]
1359 impl<T: ?Sized> Receiver for Arc<T> {}
1361 impl<T: Clone> Arc<T> {
1362 /// Makes a mutable reference into the given `Arc`.
1364 /// If there are other `Arc` pointers to the same allocation, then `make_mut` will
1365 /// [`clone`] the inner value to a new allocation to ensure unique ownership. This is also
1366 /// referred to as clone-on-write.
1368 /// However, if there are no other `Arc` pointers to this allocation, but some [`Weak`]
1369 /// pointers, then the [`Weak`] pointers will be disassociated and the inner value will not
1372 /// See also [`get_mut`], which will fail rather than cloning the inner value
1373 /// or diassociating [`Weak`] pointers.
1375 /// [`clone`]: Clone::clone
1376 /// [`get_mut`]: Arc::get_mut
1381 /// use std::sync::Arc;
1383 /// let mut data = Arc::new(5);
1385 /// *Arc::make_mut(&mut data) += 1; // Won't clone anything
1386 /// let mut other_data = Arc::clone(&data); // Won't clone inner data
1387 /// *Arc::make_mut(&mut data) += 1; // Clones inner data
1388 /// *Arc::make_mut(&mut data) += 1; // Won't clone anything
1389 /// *Arc::make_mut(&mut other_data) *= 2; // Won't clone anything
1391 /// // Now `data` and `other_data` point to different allocations.
1392 /// assert_eq!(*data, 8);
1393 /// assert_eq!(*other_data, 12);
1396 /// [`Weak`] pointers will be disassociated:
1399 /// use std::sync::Arc;
1401 /// let mut data = Arc::new(75);
1402 /// let weak = Arc::downgrade(&data);
1404 /// assert!(75 == *data);
1405 /// assert!(75 == *weak.upgrade().unwrap());
1407 /// *Arc::make_mut(&mut data) += 1;
1409 /// assert!(76 == *data);
1410 /// assert!(weak.upgrade().is_none());
1412 #[cfg(not(no_global_oom_handling))]
1414 #[stable(feature = "arc_unique", since = "1.4.0")]
1415 pub fn make_mut(this: &mut Self) -> &mut T {
1416 // Note that we hold both a strong reference and a weak reference.
1417 // Thus, releasing our strong reference only will not, by itself, cause
1418 // the memory to be deallocated.
1420 // Use Acquire to ensure that we see any writes to `weak` that happen
1421 // before release writes (i.e., decrements) to `strong`. Since we hold a
1422 // weak count, there's no chance the ArcInner itself could be
1424 if this.inner().strong.compare_exchange(1, 0, Acquire, Relaxed).is_err() {
1425 // Another strong pointer exists, so we must clone.
1426 // Pre-allocate memory to allow writing the cloned value directly.
1427 let mut arc = Self::new_uninit();
1429 let data = Arc::get_mut_unchecked(&mut arc);
1430 (**this).write_clone_into_raw(data.as_mut_ptr());
1431 *this = arc.assume_init();
1433 } else if this.inner().weak.load(Relaxed) != 1 {
1434 // Relaxed suffices in the above because this is fundamentally an
1435 // optimization: we are always racing with weak pointers being
1436 // dropped. Worst case, we end up allocated a new Arc unnecessarily.
1438 // We removed the last strong ref, but there are additional weak
1439 // refs remaining. We'll move the contents to a new Arc, and
1440 // invalidate the other weak refs.
1442 // Note that it is not possible for the read of `weak` to yield
1443 // usize::MAX (i.e., locked), since the weak count can only be
1444 // locked by a thread with a strong reference.
1446 // Materialize our own implicit weak pointer, so that it can clean
1447 // up the ArcInner as needed.
1448 let _weak = Weak { ptr: this.ptr };
1450 // Can just steal the data, all that's left is Weaks
1451 let mut arc = Self::new_uninit();
1453 let data = Arc::get_mut_unchecked(&mut arc);
1454 data.as_mut_ptr().copy_from_nonoverlapping(&**this, 1);
1455 ptr::write(this, arc.assume_init());
1458 // We were the sole reference of either kind; bump back up the
1459 // strong ref count.
1460 this.inner().strong.store(1, Release);
1463 // As with `get_mut()`, the unsafety is ok because our reference was
1464 // either unique to begin with, or became one upon cloning the contents.
1465 unsafe { Self::get_mut_unchecked(this) }
1469 impl<T: ?Sized> Arc<T> {
1470 /// Returns a mutable reference into the given `Arc`, if there are
1471 /// no other `Arc` or [`Weak`] pointers to the same allocation.
1473 /// Returns [`None`] otherwise, because it is not safe to
1474 /// mutate a shared value.
1476 /// See also [`make_mut`][make_mut], which will [`clone`][clone]
1477 /// the inner value when there are other `Arc` pointers.
1479 /// [make_mut]: Arc::make_mut
1480 /// [clone]: Clone::clone
1485 /// use std::sync::Arc;
1487 /// let mut x = Arc::new(3);
1488 /// *Arc::get_mut(&mut x).unwrap() = 4;
1489 /// assert_eq!(*x, 4);
1491 /// let _y = Arc::clone(&x);
1492 /// assert!(Arc::get_mut(&mut x).is_none());
1495 #[stable(feature = "arc_unique", since = "1.4.0")]
1496 pub fn get_mut(this: &mut Self) -> Option<&mut T> {
1497 if this.is_unique() {
1498 // This unsafety is ok because we're guaranteed that the pointer
1499 // returned is the *only* pointer that will ever be returned to T. Our
1500 // reference count is guaranteed to be 1 at this point, and we required
1501 // the Arc itself to be `mut`, so we're returning the only possible
1502 // reference to the inner data.
1503 unsafe { Some(Arc::get_mut_unchecked(this)) }
1509 /// Returns a mutable reference into the given `Arc`,
1510 /// without any check.
1512 /// See also [`get_mut`], which is safe and does appropriate checks.
1514 /// [`get_mut`]: Arc::get_mut
1518 /// Any other `Arc` or [`Weak`] pointers to the same allocation must not be dereferenced
1519 /// for the duration of the returned borrow.
1520 /// This is trivially the case if no such pointers exist,
1521 /// for example immediately after `Arc::new`.
1526 /// #![feature(get_mut_unchecked)]
1528 /// use std::sync::Arc;
1530 /// let mut x = Arc::new(String::new());
1532 /// Arc::get_mut_unchecked(&mut x).push_str("foo")
1534 /// assert_eq!(*x, "foo");
1537 #[unstable(feature = "get_mut_unchecked", issue = "63292")]
1538 pub unsafe fn get_mut_unchecked(this: &mut Self) -> &mut T {
1539 // We are careful to *not* create a reference covering the "count" fields, as
1540 // this would alias with concurrent access to the reference counts (e.g. by `Weak`).
1541 unsafe { &mut (*this.ptr.as_ptr()).data }
1544 /// Determine whether this is the unique reference (including weak refs) to
1545 /// the underlying data.
1547 /// Note that this requires locking the weak ref count.
1548 fn is_unique(&mut self) -> bool {
1549 // lock the weak pointer count if we appear to be the sole weak pointer
1552 // The acquire label here ensures a happens-before relationship with any
1553 // writes to `strong` (in particular in `Weak::upgrade`) prior to decrements
1554 // of the `weak` count (via `Weak::drop`, which uses release). If the upgraded
1555 // weak ref was never dropped, the CAS here will fail so we do not care to synchronize.
1556 if self.inner().weak.compare_exchange(1, usize::MAX, Acquire, Relaxed).is_ok() {
1557 // This needs to be an `Acquire` to synchronize with the decrement of the `strong`
1558 // counter in `drop` -- the only access that happens when any but the last reference
1559 // is being dropped.
1560 let unique = self.inner().strong.load(Acquire) == 1;
1562 // The release write here synchronizes with a read in `downgrade`,
1563 // effectively preventing the above read of `strong` from happening
1565 self.inner().weak.store(1, Release); // release the lock
1573 #[stable(feature = "rust1", since = "1.0.0")]
1574 unsafe impl<#[may_dangle] T: ?Sized> Drop for Arc<T> {
1575 /// Drops the `Arc`.
1577 /// This will decrement the strong reference count. If the strong reference
1578 /// count reaches zero then the only other references (if any) are
1579 /// [`Weak`], so we `drop` the inner value.
1584 /// use std::sync::Arc;
1588 /// impl Drop for Foo {
1589 /// fn drop(&mut self) {
1590 /// println!("dropped!");
1594 /// let foo = Arc::new(Foo);
1595 /// let foo2 = Arc::clone(&foo);
1597 /// drop(foo); // Doesn't print anything
1598 /// drop(foo2); // Prints "dropped!"
1601 fn drop(&mut self) {
1602 // Because `fetch_sub` is already atomic, we do not need to synchronize
1603 // with other threads unless we are going to delete the object. This
1604 // same logic applies to the below `fetch_sub` to the `weak` count.
1605 if self.inner().strong.fetch_sub(1, Release) != 1 {
1609 // This fence is needed to prevent reordering of use of the data and
1610 // deletion of the data. Because it is marked `Release`, the decreasing
1611 // of the reference count synchronizes with this `Acquire` fence. This
1612 // means that use of the data happens before decreasing the reference
1613 // count, which happens before this fence, which happens before the
1614 // deletion of the data.
1616 // As explained in the [Boost documentation][1],
1618 // > It is important to enforce any possible access to the object in one
1619 // > thread (through an existing reference) to *happen before* deleting
1620 // > the object in a different thread. This is achieved by a "release"
1621 // > operation after dropping a reference (any access to the object
1622 // > through this reference must obviously happened before), and an
1623 // > "acquire" operation before deleting the object.
1625 // In particular, while the contents of an Arc are usually immutable, it's
1626 // possible to have interior writes to something like a Mutex<T>. Since a
1627 // Mutex is not acquired when it is deleted, we can't rely on its
1628 // synchronization logic to make writes in thread A visible to a destructor
1629 // running in thread B.
1631 // Also note that the Acquire fence here could probably be replaced with an
1632 // Acquire load, which could improve performance in highly-contended
1633 // situations. See [2].
1635 // [1]: (www.boost.org/doc/libs/1_55_0/doc/html/atomic/usage_examples.html)
1636 // [2]: (https://github.com/rust-lang/rust/pull/41714)
1637 acquire!(self.inner().strong);
1645 impl Arc<dyn Any + Send + Sync> {
1647 #[stable(feature = "rc_downcast", since = "1.29.0")]
1648 /// Attempt to downcast the `Arc<dyn Any + Send + Sync>` to a concrete type.
1653 /// use std::any::Any;
1654 /// use std::sync::Arc;
1656 /// fn print_if_string(value: Arc<dyn Any + Send + Sync>) {
1657 /// if let Ok(string) = value.downcast::<String>() {
1658 /// println!("String ({}): {}", string.len(), string);
1662 /// let my_string = "Hello World".to_string();
1663 /// print_if_string(Arc::new(my_string));
1664 /// print_if_string(Arc::new(0i8));
1666 pub fn downcast<T>(self) -> Result<Arc<T>, Self>
1668 T: Any + Send + Sync + 'static,
1670 if (*self).is::<T>() {
1672 let ptr = self.ptr.cast::<ArcInner<T>>();
1674 Ok(Arc::from_inner(ptr))
1683 /// Constructs a new `Weak<T>`, without allocating any memory.
1684 /// Calling [`upgrade`] on the return value always gives [`None`].
1686 /// [`upgrade`]: Weak::upgrade
1691 /// use std::sync::Weak;
1693 /// let empty: Weak<i64> = Weak::new();
1694 /// assert!(empty.upgrade().is_none());
1696 #[stable(feature = "downgraded_weak", since = "1.10.0")]
1698 pub fn new() -> Weak<T> {
1699 Weak { ptr: NonNull::new(usize::MAX as *mut ArcInner<T>).expect("MAX is not 0") }
1703 /// Helper type to allow accessing the reference counts without
1704 /// making any assertions about the data field.
1705 struct WeakInner<'a> {
1706 weak: &'a atomic::AtomicUsize,
1707 strong: &'a atomic::AtomicUsize,
1710 impl<T: ?Sized> Weak<T> {
1711 /// Returns a raw pointer to the object `T` pointed to by this `Weak<T>`.
1713 /// The pointer is valid only if there are some strong references. The pointer may be dangling,
1714 /// unaligned or even [`null`] otherwise.
1719 /// use std::sync::Arc;
1722 /// let strong = Arc::new("hello".to_owned());
1723 /// let weak = Arc::downgrade(&strong);
1724 /// // Both point to the same object
1725 /// assert!(ptr::eq(&*strong, weak.as_ptr()));
1726 /// // The strong here keeps it alive, so we can still access the object.
1727 /// assert_eq!("hello", unsafe { &*weak.as_ptr() });
1730 /// // But not any more. We can do weak.as_ptr(), but accessing the pointer would lead to
1731 /// // undefined behaviour.
1732 /// // assert_eq!("hello", unsafe { &*weak.as_ptr() });
1735 /// [`null`]: core::ptr::null "ptr::null"
1737 #[stable(feature = "weak_into_raw", since = "1.45.0")]
1738 pub fn as_ptr(&self) -> *const T {
1739 let ptr: *mut ArcInner<T> = NonNull::as_ptr(self.ptr);
1741 if is_dangling(ptr) {
1742 // If the pointer is dangling, we return the sentinel directly. This cannot be
1743 // a valid payload address, as the payload is at least as aligned as ArcInner (usize).
1746 // SAFETY: if is_dangling returns false, then the pointer is dereferenceable.
1747 // The payload may be dropped at this point, and we have to maintain provenance,
1748 // so use raw pointer manipulation.
1749 unsafe { ptr::addr_of_mut!((*ptr).data) }
1753 /// Consumes the `Weak<T>` and turns it into a raw pointer.
1755 /// This converts the weak pointer into a raw pointer, while still preserving the ownership of
1756 /// one weak reference (the weak count is not modified by this operation). It can be turned
1757 /// back into the `Weak<T>` with [`from_raw`].
1759 /// The same restrictions of accessing the target of the pointer as with
1760 /// [`as_ptr`] apply.
1765 /// use std::sync::{Arc, Weak};
1767 /// let strong = Arc::new("hello".to_owned());
1768 /// let weak = Arc::downgrade(&strong);
1769 /// let raw = weak.into_raw();
1771 /// assert_eq!(1, Arc::weak_count(&strong));
1772 /// assert_eq!("hello", unsafe { &*raw });
1774 /// drop(unsafe { Weak::from_raw(raw) });
1775 /// assert_eq!(0, Arc::weak_count(&strong));
1778 /// [`from_raw`]: Weak::from_raw
1779 /// [`as_ptr`]: Weak::as_ptr
1780 #[must_use = "`self` will be dropped if the result is not used"]
1781 #[stable(feature = "weak_into_raw", since = "1.45.0")]
1782 pub fn into_raw(self) -> *const T {
1783 let result = self.as_ptr();
1788 /// Converts a raw pointer previously created by [`into_raw`] back into `Weak<T>`.
1790 /// This can be used to safely get a strong reference (by calling [`upgrade`]
1791 /// later) or to deallocate the weak count by dropping the `Weak<T>`.
1793 /// It takes ownership of one weak reference (with the exception of pointers created by [`new`],
1794 /// as these don't own anything; the method still works on them).
1798 /// The pointer must have originated from the [`into_raw`] and must still own its potential
1801 /// It is allowed for the strong count to be 0 at the time of calling this. Nevertheless, this
1802 /// takes ownership of one weak reference currently represented as a raw pointer (the weak
1803 /// count is not modified by this operation) and therefore it must be paired with a previous
1804 /// call to [`into_raw`].
1808 /// use std::sync::{Arc, Weak};
1810 /// let strong = Arc::new("hello".to_owned());
1812 /// let raw_1 = Arc::downgrade(&strong).into_raw();
1813 /// let raw_2 = Arc::downgrade(&strong).into_raw();
1815 /// assert_eq!(2, Arc::weak_count(&strong));
1817 /// assert_eq!("hello", &*unsafe { Weak::from_raw(raw_1) }.upgrade().unwrap());
1818 /// assert_eq!(1, Arc::weak_count(&strong));
1822 /// // Decrement the last weak count.
1823 /// assert!(unsafe { Weak::from_raw(raw_2) }.upgrade().is_none());
1826 /// [`new`]: Weak::new
1827 /// [`into_raw`]: Weak::into_raw
1828 /// [`upgrade`]: Weak::upgrade
1829 #[stable(feature = "weak_into_raw", since = "1.45.0")]
1830 pub unsafe fn from_raw(ptr: *const T) -> Self {
1831 // See Weak::as_ptr for context on how the input pointer is derived.
1833 let ptr = if is_dangling(ptr as *mut T) {
1834 // This is a dangling Weak.
1835 ptr as *mut ArcInner<T>
1837 // Otherwise, we're guaranteed the pointer came from a nondangling Weak.
1838 // SAFETY: data_offset is safe to call, as ptr references a real (potentially dropped) T.
1839 let offset = unsafe { data_offset(ptr) };
1840 // Thus, we reverse the offset to get the whole RcBox.
1841 // SAFETY: the pointer originated from a Weak, so this offset is safe.
1842 unsafe { (ptr as *mut ArcInner<T>).set_ptr_value((ptr as *mut u8).offset(-offset)) }
1845 // SAFETY: we now have recovered the original Weak pointer, so can create the Weak.
1846 Weak { ptr: unsafe { NonNull::new_unchecked(ptr) } }
1850 impl<T: ?Sized> Weak<T> {
1851 /// Attempts to upgrade the `Weak` pointer to an [`Arc`], delaying
1852 /// dropping of the inner value if successful.
1854 /// Returns [`None`] if the inner value has since been dropped.
1859 /// use std::sync::Arc;
1861 /// let five = Arc::new(5);
1863 /// let weak_five = Arc::downgrade(&five);
1865 /// let strong_five: Option<Arc<_>> = weak_five.upgrade();
1866 /// assert!(strong_five.is_some());
1868 /// // Destroy all strong pointers.
1869 /// drop(strong_five);
1872 /// assert!(weak_five.upgrade().is_none());
1874 #[must_use = "this returns a new `Arc`, \
1875 without modifying the original weak pointer"]
1876 #[stable(feature = "arc_weak", since = "1.4.0")]
1877 pub fn upgrade(&self) -> Option<Arc<T>> {
1878 // We use a CAS loop to increment the strong count instead of a
1879 // fetch_add as this function should never take the reference count
1880 // from zero to one.
1881 let inner = self.inner()?;
1883 // Relaxed load because any write of 0 that we can observe
1884 // leaves the field in a permanently zero state (so a
1885 // "stale" read of 0 is fine), and any other value is
1886 // confirmed via the CAS below.
1887 let mut n = inner.strong.load(Relaxed);
1894 // See comments in `Arc::clone` for why we do this (for `mem::forget`).
1895 if n > MAX_REFCOUNT {
1899 // Relaxed is fine for the failure case because we don't have any expectations about the new state.
1900 // Acquire is necessary for the success case to synchronise with `Arc::new_cyclic`, when the inner
1901 // value can be initialized after `Weak` references have already been created. In that case, we
1902 // expect to observe the fully initialized value.
1903 match inner.strong.compare_exchange_weak(n, n + 1, Acquire, Relaxed) {
1904 Ok(_) => return Some(unsafe { Arc::from_inner(self.ptr) }), // null checked above
1905 Err(old) => n = old,
1910 /// Gets the number of strong (`Arc`) pointers pointing to this allocation.
1912 /// If `self` was created using [`Weak::new`], this will return 0.
1914 #[stable(feature = "weak_counts", since = "1.41.0")]
1915 pub fn strong_count(&self) -> usize {
1916 if let Some(inner) = self.inner() { inner.strong.load(SeqCst) } else { 0 }
1919 /// Gets an approximation of the number of `Weak` pointers pointing to this
1922 /// If `self` was created using [`Weak::new`], or if there are no remaining
1923 /// strong pointers, this will return 0.
1927 /// Due to implementation details, the returned value can be off by 1 in
1928 /// either direction when other threads are manipulating any `Arc`s or
1929 /// `Weak`s pointing to the same allocation.
1931 #[stable(feature = "weak_counts", since = "1.41.0")]
1932 pub fn weak_count(&self) -> usize {
1935 let weak = inner.weak.load(SeqCst);
1936 let strong = inner.strong.load(SeqCst);
1940 // Since we observed that there was at least one strong pointer
1941 // after reading the weak count, we know that the implicit weak
1942 // reference (present whenever any strong references are alive)
1943 // was still around when we observed the weak count, and can
1944 // therefore safely subtract it.
1951 /// Returns `None` when the pointer is dangling and there is no allocated `ArcInner`,
1952 /// (i.e., when this `Weak` was created by `Weak::new`).
1954 fn inner(&self) -> Option<WeakInner<'_>> {
1955 if is_dangling(self.ptr.as_ptr()) {
1958 // We are careful to *not* create a reference covering the "data" field, as
1959 // the field may be mutated concurrently (for example, if the last `Arc`
1960 // is dropped, the data field will be dropped in-place).
1962 let ptr = self.ptr.as_ptr();
1963 WeakInner { strong: &(*ptr).strong, weak: &(*ptr).weak }
1968 /// Returns `true` if the two `Weak`s point to the same allocation (similar to
1969 /// [`ptr::eq`]), or if both don't point to any allocation
1970 /// (because they were created with `Weak::new()`).
1974 /// Since this compares pointers it means that `Weak::new()` will equal each
1975 /// other, even though they don't point to any allocation.
1980 /// use std::sync::Arc;
1982 /// let first_rc = Arc::new(5);
1983 /// let first = Arc::downgrade(&first_rc);
1984 /// let second = Arc::downgrade(&first_rc);
1986 /// assert!(first.ptr_eq(&second));
1988 /// let third_rc = Arc::new(5);
1989 /// let third = Arc::downgrade(&third_rc);
1991 /// assert!(!first.ptr_eq(&third));
1994 /// Comparing `Weak::new`.
1997 /// use std::sync::{Arc, Weak};
1999 /// let first = Weak::new();
2000 /// let second = Weak::new();
2001 /// assert!(first.ptr_eq(&second));
2003 /// let third_rc = Arc::new(());
2004 /// let third = Arc::downgrade(&third_rc);
2005 /// assert!(!first.ptr_eq(&third));
2008 /// [`ptr::eq`]: core::ptr::eq "ptr::eq"
2011 #[stable(feature = "weak_ptr_eq", since = "1.39.0")]
2012 pub fn ptr_eq(&self, other: &Self) -> bool {
2013 self.ptr.as_ptr() == other.ptr.as_ptr()
2017 #[stable(feature = "arc_weak", since = "1.4.0")]
2018 impl<T: ?Sized> Clone for Weak<T> {
2019 /// Makes a clone of the `Weak` pointer that points to the same allocation.
2024 /// use std::sync::{Arc, Weak};
2026 /// let weak_five = Arc::downgrade(&Arc::new(5));
2028 /// let _ = Weak::clone(&weak_five);
2031 fn clone(&self) -> Weak<T> {
2032 let inner = if let Some(inner) = self.inner() {
2035 return Weak { ptr: self.ptr };
2037 // See comments in Arc::clone() for why this is relaxed. This can use a
2038 // fetch_add (ignoring the lock) because the weak count is only locked
2039 // where are *no other* weak pointers in existence. (So we can't be
2040 // running this code in that case).
2041 let old_size = inner.weak.fetch_add(1, Relaxed);
2043 // See comments in Arc::clone() for why we do this (for mem::forget).
2044 if old_size > MAX_REFCOUNT {
2048 Weak { ptr: self.ptr }
2052 #[stable(feature = "downgraded_weak", since = "1.10.0")]
2053 impl<T> Default for Weak<T> {
2054 /// Constructs a new `Weak<T>`, without allocating memory.
2055 /// Calling [`upgrade`] on the return value always
2058 /// [`upgrade`]: Weak::upgrade
2063 /// use std::sync::Weak;
2065 /// let empty: Weak<i64> = Default::default();
2066 /// assert!(empty.upgrade().is_none());
2068 fn default() -> Weak<T> {
2073 #[stable(feature = "arc_weak", since = "1.4.0")]
2074 unsafe impl<#[may_dangle] T: ?Sized> Drop for Weak<T> {
2075 /// Drops the `Weak` pointer.
2080 /// use std::sync::{Arc, Weak};
2084 /// impl Drop for Foo {
2085 /// fn drop(&mut self) {
2086 /// println!("dropped!");
2090 /// let foo = Arc::new(Foo);
2091 /// let weak_foo = Arc::downgrade(&foo);
2092 /// let other_weak_foo = Weak::clone(&weak_foo);
2094 /// drop(weak_foo); // Doesn't print anything
2095 /// drop(foo); // Prints "dropped!"
2097 /// assert!(other_weak_foo.upgrade().is_none());
2099 fn drop(&mut self) {
2100 // If we find out that we were the last weak pointer, then its time to
2101 // deallocate the data entirely. See the discussion in Arc::drop() about
2102 // the memory orderings
2104 // It's not necessary to check for the locked state here, because the
2105 // weak count can only be locked if there was precisely one weak ref,
2106 // meaning that drop could only subsequently run ON that remaining weak
2107 // ref, which can only happen after the lock is released.
2108 let inner = if let Some(inner) = self.inner() { inner } else { return };
2110 if inner.weak.fetch_sub(1, Release) == 1 {
2111 acquire!(inner.weak);
2112 unsafe { Global.deallocate(self.ptr.cast(), Layout::for_value_raw(self.ptr.as_ptr())) }
2117 #[stable(feature = "rust1", since = "1.0.0")]
2118 trait ArcEqIdent<T: ?Sized + PartialEq> {
2119 fn eq(&self, other: &Arc<T>) -> bool;
2120 fn ne(&self, other: &Arc<T>) -> bool;
2123 #[stable(feature = "rust1", since = "1.0.0")]
2124 impl<T: ?Sized + PartialEq> ArcEqIdent<T> for Arc<T> {
2126 default fn eq(&self, other: &Arc<T>) -> bool {
2130 default fn ne(&self, other: &Arc<T>) -> bool {
2135 /// We're doing this specialization here, and not as a more general optimization on `&T`, because it
2136 /// would otherwise add a cost to all equality checks on refs. We assume that `Arc`s are used to
2137 /// store large values, that are slow to clone, but also heavy to check for equality, causing this
2138 /// cost to pay off more easily. It's also more likely to have two `Arc` clones, that point to
2139 /// the same value, than two `&T`s.
2141 /// We can only do this when `T: Eq` as a `PartialEq` might be deliberately irreflexive.
2142 #[stable(feature = "rust1", since = "1.0.0")]
2143 impl<T: ?Sized + crate::rc::MarkerEq> ArcEqIdent<T> for Arc<T> {
2145 fn eq(&self, other: &Arc<T>) -> bool {
2146 Arc::ptr_eq(self, other) || **self == **other
2150 fn ne(&self, other: &Arc<T>) -> bool {
2151 !Arc::ptr_eq(self, other) && **self != **other
2155 #[stable(feature = "rust1", since = "1.0.0")]
2156 impl<T: ?Sized + PartialEq> PartialEq for Arc<T> {
2157 /// Equality for two `Arc`s.
2159 /// Two `Arc`s are equal if their inner values are equal, even if they are
2160 /// stored in different allocation.
2162 /// If `T` also implements `Eq` (implying reflexivity of equality),
2163 /// two `Arc`s that point to the same allocation are always equal.
2168 /// use std::sync::Arc;
2170 /// let five = Arc::new(5);
2172 /// assert!(five == Arc::new(5));
2175 fn eq(&self, other: &Arc<T>) -> bool {
2176 ArcEqIdent::eq(self, other)
2179 /// Inequality for two `Arc`s.
2181 /// Two `Arc`s are unequal if their inner values are unequal.
2183 /// If `T` also implements `Eq` (implying reflexivity of equality),
2184 /// two `Arc`s that point to the same value are never unequal.
2189 /// use std::sync::Arc;
2191 /// let five = Arc::new(5);
2193 /// assert!(five != Arc::new(6));
2196 fn ne(&self, other: &Arc<T>) -> bool {
2197 ArcEqIdent::ne(self, other)
2201 #[stable(feature = "rust1", since = "1.0.0")]
2202 impl<T: ?Sized + PartialOrd> PartialOrd for Arc<T> {
2203 /// Partial comparison for two `Arc`s.
2205 /// The two are compared by calling `partial_cmp()` on their inner values.
2210 /// use std::sync::Arc;
2211 /// use std::cmp::Ordering;
2213 /// let five = Arc::new(5);
2215 /// assert_eq!(Some(Ordering::Less), five.partial_cmp(&Arc::new(6)));
2217 fn partial_cmp(&self, other: &Arc<T>) -> Option<Ordering> {
2218 (**self).partial_cmp(&**other)
2221 /// Less-than comparison for two `Arc`s.
2223 /// The two are compared by calling `<` on their inner values.
2228 /// use std::sync::Arc;
2230 /// let five = Arc::new(5);
2232 /// assert!(five < Arc::new(6));
2234 fn lt(&self, other: &Arc<T>) -> bool {
2235 *(*self) < *(*other)
2238 /// 'Less than or equal to' comparison for two `Arc`s.
2240 /// The two are compared by calling `<=` on their inner values.
2245 /// use std::sync::Arc;
2247 /// let five = Arc::new(5);
2249 /// assert!(five <= Arc::new(5));
2251 fn le(&self, other: &Arc<T>) -> bool {
2252 *(*self) <= *(*other)
2255 /// Greater-than comparison for two `Arc`s.
2257 /// The two are compared by calling `>` on their inner values.
2262 /// use std::sync::Arc;
2264 /// let five = Arc::new(5);
2266 /// assert!(five > Arc::new(4));
2268 fn gt(&self, other: &Arc<T>) -> bool {
2269 *(*self) > *(*other)
2272 /// 'Greater than or equal to' comparison for two `Arc`s.
2274 /// The two are compared by calling `>=` on their inner values.
2279 /// use std::sync::Arc;
2281 /// let five = Arc::new(5);
2283 /// assert!(five >= Arc::new(5));
2285 fn ge(&self, other: &Arc<T>) -> bool {
2286 *(*self) >= *(*other)
2289 #[stable(feature = "rust1", since = "1.0.0")]
2290 impl<T: ?Sized + Ord> Ord for Arc<T> {
2291 /// Comparison for two `Arc`s.
2293 /// The two are compared by calling `cmp()` on their inner values.
2298 /// use std::sync::Arc;
2299 /// use std::cmp::Ordering;
2301 /// let five = Arc::new(5);
2303 /// assert_eq!(Ordering::Less, five.cmp(&Arc::new(6)));
2305 fn cmp(&self, other: &Arc<T>) -> Ordering {
2306 (**self).cmp(&**other)
2309 #[stable(feature = "rust1", since = "1.0.0")]
2310 impl<T: ?Sized + Eq> Eq for Arc<T> {}
2312 #[stable(feature = "rust1", since = "1.0.0")]
2313 impl<T: ?Sized + fmt::Display> fmt::Display for Arc<T> {
2314 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
2315 fmt::Display::fmt(&**self, f)
2319 #[stable(feature = "rust1", since = "1.0.0")]
2320 impl<T: ?Sized + fmt::Debug> fmt::Debug for Arc<T> {
2321 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
2322 fmt::Debug::fmt(&**self, f)
2326 #[stable(feature = "rust1", since = "1.0.0")]
2327 impl<T: ?Sized> fmt::Pointer for Arc<T> {
2328 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
2329 fmt::Pointer::fmt(&(&**self as *const T), f)
2333 #[cfg(not(no_global_oom_handling))]
2334 #[stable(feature = "rust1", since = "1.0.0")]
2335 impl<T: Default> Default for Arc<T> {
2336 /// Creates a new `Arc<T>`, with the `Default` value for `T`.
2341 /// use std::sync::Arc;
2343 /// let x: Arc<i32> = Default::default();
2344 /// assert_eq!(*x, 0);
2346 fn default() -> Arc<T> {
2347 Arc::new(Default::default())
2351 #[stable(feature = "rust1", since = "1.0.0")]
2352 impl<T: ?Sized + Hash> Hash for Arc<T> {
2353 fn hash<H: Hasher>(&self, state: &mut H) {
2354 (**self).hash(state)
2358 #[cfg(not(no_global_oom_handling))]
2359 #[stable(feature = "from_for_ptrs", since = "1.6.0")]
2360 impl<T> From<T> for Arc<T> {
2361 /// Converts a `T` into an `Arc<T>`
2363 /// The conversion moves the value into a
2364 /// newly allocated `Arc`. It is equivalent to
2365 /// calling `Arc::new(t)`.
2369 /// # use std::sync::Arc;
2371 /// let arc = Arc::new(5);
2373 /// assert_eq!(Arc::from(x), arc);
2375 fn from(t: T) -> Self {
2380 #[cfg(not(no_global_oom_handling))]
2381 #[stable(feature = "shared_from_slice", since = "1.21.0")]
2382 impl<T: Clone> From<&[T]> for Arc<[T]> {
2383 /// Allocate a reference-counted slice and fill it by cloning `v`'s items.
2388 /// # use std::sync::Arc;
2389 /// let original: &[i32] = &[1, 2, 3];
2390 /// let shared: Arc<[i32]> = Arc::from(original);
2391 /// assert_eq!(&[1, 2, 3], &shared[..]);
2394 fn from(v: &[T]) -> Arc<[T]> {
2395 <Self as ArcFromSlice<T>>::from_slice(v)
2399 #[cfg(not(no_global_oom_handling))]
2400 #[stable(feature = "shared_from_slice", since = "1.21.0")]
2401 impl From<&str> for Arc<str> {
2402 /// Allocate a reference-counted `str` and copy `v` into it.
2407 /// # use std::sync::Arc;
2408 /// let shared: Arc<str> = Arc::from("eggplant");
2409 /// assert_eq!("eggplant", &shared[..]);
2412 fn from(v: &str) -> Arc<str> {
2413 let arc = Arc::<[u8]>::from(v.as_bytes());
2414 unsafe { Arc::from_raw(Arc::into_raw(arc) as *const str) }
2418 #[cfg(not(no_global_oom_handling))]
2419 #[stable(feature = "shared_from_slice", since = "1.21.0")]
2420 impl From<String> for Arc<str> {
2421 /// Allocate a reference-counted `str` and copy `v` into it.
2426 /// # use std::sync::Arc;
2427 /// let unique: String = "eggplant".to_owned();
2428 /// let shared: Arc<str> = Arc::from(unique);
2429 /// assert_eq!("eggplant", &shared[..]);
2432 fn from(v: String) -> Arc<str> {
2437 #[cfg(not(no_global_oom_handling))]
2438 #[stable(feature = "shared_from_slice", since = "1.21.0")]
2439 impl<T: ?Sized> From<Box<T>> for Arc<T> {
2440 /// Move a boxed object to a new, reference-counted allocation.
2445 /// # use std::sync::Arc;
2446 /// let unique: Box<str> = Box::from("eggplant");
2447 /// let shared: Arc<str> = Arc::from(unique);
2448 /// assert_eq!("eggplant", &shared[..]);
2451 fn from(v: Box<T>) -> Arc<T> {
2456 #[cfg(not(no_global_oom_handling))]
2457 #[stable(feature = "shared_from_slice", since = "1.21.0")]
2458 impl<T> From<Vec<T>> for Arc<[T]> {
2459 /// Allocate a reference-counted slice and move `v`'s items into it.
2464 /// # use std::sync::Arc;
2465 /// let unique: Vec<i32> = vec![1, 2, 3];
2466 /// let shared: Arc<[i32]> = Arc::from(unique);
2467 /// assert_eq!(&[1, 2, 3], &shared[..]);
2470 fn from(mut v: Vec<T>) -> Arc<[T]> {
2472 let arc = Arc::copy_from_slice(&v);
2474 // Allow the Vec to free its memory, but not destroy its contents
2482 #[stable(feature = "shared_from_cow", since = "1.45.0")]
2483 impl<'a, B> From<Cow<'a, B>> for Arc<B>
2485 B: ToOwned + ?Sized,
2486 Arc<B>: From<&'a B> + From<B::Owned>,
2488 /// Create an atomically reference-counted pointer from
2489 /// a clone-on-write pointer by copying its content.
2494 /// # use std::sync::Arc;
2495 /// # use std::borrow::Cow;
2496 /// let cow: Cow<str> = Cow::Borrowed("eggplant");
2497 /// let shared: Arc<str> = Arc::from(cow);
2498 /// assert_eq!("eggplant", &shared[..]);
2501 fn from(cow: Cow<'a, B>) -> Arc<B> {
2503 Cow::Borrowed(s) => Arc::from(s),
2504 Cow::Owned(s) => Arc::from(s),
2509 #[stable(feature = "boxed_slice_try_from", since = "1.43.0")]
2510 impl<T, const N: usize> TryFrom<Arc<[T]>> for Arc<[T; N]> {
2511 type Error = Arc<[T]>;
2513 fn try_from(boxed_slice: Arc<[T]>) -> Result<Self, Self::Error> {
2514 if boxed_slice.len() == N {
2515 Ok(unsafe { Arc::from_raw(Arc::into_raw(boxed_slice) as *mut [T; N]) })
2522 #[cfg(not(no_global_oom_handling))]
2523 #[stable(feature = "shared_from_iter", since = "1.37.0")]
2524 impl<T> iter::FromIterator<T> for Arc<[T]> {
2525 /// Takes each element in the `Iterator` and collects it into an `Arc<[T]>`.
2527 /// # Performance characteristics
2529 /// ## The general case
2531 /// In the general case, collecting into `Arc<[T]>` is done by first
2532 /// collecting into a `Vec<T>`. That is, when writing the following:
2535 /// # use std::sync::Arc;
2536 /// let evens: Arc<[u8]> = (0..10).filter(|&x| x % 2 == 0).collect();
2537 /// # assert_eq!(&*evens, &[0, 2, 4, 6, 8]);
2540 /// this behaves as if we wrote:
2543 /// # use std::sync::Arc;
2544 /// let evens: Arc<[u8]> = (0..10).filter(|&x| x % 2 == 0)
2545 /// .collect::<Vec<_>>() // The first set of allocations happens here.
2546 /// .into(); // A second allocation for `Arc<[T]>` happens here.
2547 /// # assert_eq!(&*evens, &[0, 2, 4, 6, 8]);
2550 /// This will allocate as many times as needed for constructing the `Vec<T>`
2551 /// and then it will allocate once for turning the `Vec<T>` into the `Arc<[T]>`.
2553 /// ## Iterators of known length
2555 /// When your `Iterator` implements `TrustedLen` and is of an exact size,
2556 /// a single allocation will be made for the `Arc<[T]>`. For example:
2559 /// # use std::sync::Arc;
2560 /// let evens: Arc<[u8]> = (0..10).collect(); // Just a single allocation happens here.
2561 /// # assert_eq!(&*evens, &*(0..10).collect::<Vec<_>>());
2563 fn from_iter<I: iter::IntoIterator<Item = T>>(iter: I) -> Self {
2564 ToArcSlice::to_arc_slice(iter.into_iter())
2568 /// Specialization trait used for collecting into `Arc<[T]>`.
2569 trait ToArcSlice<T>: Iterator<Item = T> + Sized {
2570 fn to_arc_slice(self) -> Arc<[T]>;
2573 #[cfg(not(no_global_oom_handling))]
2574 impl<T, I: Iterator<Item = T>> ToArcSlice<T> for I {
2575 default fn to_arc_slice(self) -> Arc<[T]> {
2576 self.collect::<Vec<T>>().into()
2580 #[cfg(not(no_global_oom_handling))]
2581 impl<T, I: iter::TrustedLen<Item = T>> ToArcSlice<T> for I {
2582 fn to_arc_slice(self) -> Arc<[T]> {
2583 // This is the case for a `TrustedLen` iterator.
2584 let (low, high) = self.size_hint();
2585 if let Some(high) = high {
2589 "TrustedLen iterator's size hint is not exact: {:?}",
2594 // SAFETY: We need to ensure that the iterator has an exact length and we have.
2595 Arc::from_iter_exact(self, low)
2598 // TrustedLen contract guarantees that `upper_bound == `None` implies an iterator
2599 // length exceeding `usize::MAX`.
2600 // The default implementation would collect into a vec which would panic.
2601 // Thus we panic here immediately without invoking `Vec` code.
2602 panic!("capacity overflow");
2607 #[stable(feature = "rust1", since = "1.0.0")]
2608 impl<T: ?Sized> borrow::Borrow<T> for Arc<T> {
2609 fn borrow(&self) -> &T {
2614 #[stable(since = "1.5.0", feature = "smart_ptr_as_ref")]
2615 impl<T: ?Sized> AsRef<T> for Arc<T> {
2616 fn as_ref(&self) -> &T {
2621 #[stable(feature = "pin", since = "1.33.0")]
2622 impl<T: ?Sized> Unpin for Arc<T> {}
2624 /// Get the offset within an `ArcInner` for the payload behind a pointer.
2628 /// The pointer must point to (and have valid metadata for) a previously
2629 /// valid instance of T, but the T is allowed to be dropped.
2630 unsafe fn data_offset<T: ?Sized>(ptr: *const T) -> isize {
2631 // Align the unsized value to the end of the ArcInner.
2632 // Because RcBox is repr(C), it will always be the last field in memory.
2633 // SAFETY: since the only unsized types possible are slices, trait objects,
2634 // and extern types, the input safety requirement is currently enough to
2635 // satisfy the requirements of align_of_val_raw; this is an implementation
2636 // detail of the language that must not be relied upon outside of std.
2637 unsafe { data_offset_align(align_of_val_raw(ptr)) }
2641 fn data_offset_align(align: usize) -> isize {
2642 let layout = Layout::new::<ArcInner<()>>();
2643 (layout.size() + layout.padding_needed_for(align)) as isize