pub unsafe auto trait Sync { }Expand description
Types for which it is safe to share references between threads.
This trait is automatically implemented when the compiler determines it’s appropriate.
The precise definition is: a type T is Sync if and only if &T is
Send. In other words, if there is no possibility of
undefined behavior (including data races) when passing
&T references between threads.
As one would expect, primitive types like u8 and f64
are all Sync, and so are simple aggregate types containing them,
like tuples, structs and enums. More examples of basic Sync
types include “immutable” types like &T, and those with simple
inherited mutability, such as Box<T>, Vec<T> and
most other collection types. (Generic parameters need to be Sync
for their container to be Sync.)
A somewhat surprising consequence of the definition is that &mut T
is Sync (if T is Sync) even though it seems like that might
provide unsynchronized mutation. The trick is that a mutable
reference behind a shared reference (that is, & &mut T)
becomes read-only, as if it were a & &T. Hence there is no risk
of a data race.
A shorter overview of how Sync and Send relate to referencing:
&TisSendif and only ifTisSync&mut TisSendif and only ifTisSend&Tand&mut TareSyncif and only ifTisSync
Types that are not Sync are those that have “interior
mutability” in a non-thread-safe form, such as Cell
and RefCell. These types allow for mutation of
their contents even through an immutable, shared reference. For
example the set method on Cell<T> takes &self, so it requires
only a shared reference &Cell<T>. The method performs no
synchronization, thus Cell cannot be Sync.
Another example of a non-Sync type is the reference-counting
pointer Rc. Given any reference &Rc<T>, you can clone
a new Rc<T>, modifying the reference counts in a non-atomic way.
For cases when one does need thread-safe interior mutability,
Rust provides atomic data types, as well as explicit locking via
sync::Mutex and sync::RwLock. These types
ensure that any mutation cannot cause data races, hence the types
are Sync. Likewise, sync::Arc provides a thread-safe
analogue of Rc.
Any types with interior mutability must also use the
cell::UnsafeCell wrapper around the value(s) which
can be mutated through a shared reference. Failing to doing this is
undefined behavior. For example, transmute-ing
from &T to &mut T is invalid.
See the Nomicon for more details about Sync.
Implementors§
impl !Sync for Args
impl !Sync for ArgsOs
impl Sync for gstd::prelude::string::Drain<'_>
impl Sync for Waker
impl Sync for AtomicBool
impl Sync for AtomicI8
impl Sync for AtomicI16
impl Sync for AtomicI32
impl Sync for AtomicI64
impl Sync for AtomicIsize
impl Sync for AtomicU8
impl Sync for AtomicU16
impl Sync for AtomicU32
impl Sync for AtomicU64
impl Sync for AtomicUsize
impl Sync for AtomicWaker
impl Sync for Bytes
impl Sync for BytesMut
impl<'a> Sync for IoSlice<'a>
impl<'a> Sync for IoSliceMut<'a>
impl<'a, 'b, K, Q, V, S, A> Sync for OccupiedEntryRef<'a, 'b, K, Q, V, S, A>
impl<'a, T> Sync for OnceRef<'a, T>where
T: Sync,
impl<'a, T, const CAP: usize> Sync for arrayvec::arrayvec::Drain<'a, T, CAP>where
T: Sync,
impl<Dyn> Sync for DynMetadata<Dyn>where
Dyn: ?Sized,
impl<Fut> Sync for FuturesUnordered<Fut>
impl<Fut> Sync for IntoIter<Fut>
impl<Fut> Sync for IterPinMut<'_, Fut>where
Fut: Sync,
impl<Fut> Sync for IterPinRef<'_, Fut>where
Fut: Sync,
impl<K, V, S, A> Sync for gstd::prelude::collections::hash_map::OccupiedEntry<'_, K, V, S, A>
impl<K, V, S, A> Sync for RawOccupiedEntryMut<'_, K, V, S, A>
impl<M, T, O> Sync for BitRef<'_, M, T, O>where
M: Mutability,
T: BitStore + Sync,
O: BitOrder,
impl<T> !Sync for *const Twhere
T: ?Sized,
impl<T> !Sync for *mut Twhere
T: ?Sized,
impl<T> !Sync for Cell<T>where
T: ?Sized,
impl<T> !Sync for OnceCell<T>
impl<T> !Sync for RefCell<T>where
T: ?Sized,
impl<T> !Sync for UnsafeCell<T>where
T: ?Sized,
impl<T> !Sync for NonNull<T>where
T: ?Sized,
NonNull pointers are not Sync because the data they reference may be aliased.
impl<T> !Sync for Receiver<T>
impl<T> Sync for gstd::sync::Mutex<T>
impl<T> Sync for gstd::sync::RwLock<T>
impl<T> Sync for ThinBox<T>
ThinBox<T> is Sync if T is Sync because the data is owned.
impl<T> Sync for SyncUnsafeCell<T>
impl<T> Sync for gstd::prelude::collections::linked_list::Iter<'_, T>where
T: Sync,
impl<T> Sync for gstd::prelude::collections::linked_list::IterMut<'_, T>where
T: Sync,
impl<T> Sync for ChunksExactMut<'_, T>where
T: Sync,
impl<T> Sync for ChunksMut<'_, T>where
T: Sync,
impl<T> Sync for gstd::prelude::slice::Iter<'_, T>where
T: Sync,
impl<T> Sync for gstd::prelude::slice::IterMut<'_, T>where
T: Sync,
impl<T> Sync for RChunksExactMut<'_, T>where
T: Sync,
impl<T> Sync for RChunksMut<'_, T>where
T: Sync,
impl<T> Sync for AtomicPtr<T>
impl<T> Sync for Exclusive<T>where
T: ?Sized,
impl<T> Sync for Sender<T>where
T: Send,
impl<T> Sync for std::sync::mutex::Mutex<T>
impl<T> Sync for std::sync::mutex::MutexGuard<'_, T>
impl<T> Sync for OnceLock<T>
impl<T> Sync for std::sync::rwlock::RwLock<T>
impl<T> Sync for std::sync::rwlock::RwLockReadGuard<'_, T>
impl<T> Sync for std::sync::rwlock::RwLockWriteGuard<'_, T>
impl<T> Sync for JoinHandle<T>
impl<T> Sync for BiLockGuard<'_, T>
impl<T> Sync for BitSpanError<T>where
T: BitStore,
impl<T> Sync for MisalignError<T>
impl<T> Sync for Mutex<T>
impl<T> Sync for MutexGuard<'_, T>
impl<T> Sync for MutexLockFuture<'_, T>where
T: ?Sized,
impl<T> Sync for OnceBox<T>
impl<T> Sync for OwnedMutexGuard<T>
impl<T> Sync for OwnedMutexLockFuture<T>where
T: ?Sized,
impl<T, A> !Sync for Rc<T, A>
impl<T, A> !Sync for gstd::prelude::rc::Weak<T, A>
impl<T, A> Sync for gstd::prelude::collections::linked_list::Cursor<'_, T, A>
impl<T, A> Sync for gstd::prelude::collections::linked_list::CursorMut<'_, T, A>
impl<T, A> Sync for LinkedList<T, A>
impl<T, A> Sync for gstd::prelude::collections::vec_deque::Drain<'_, T, A>
impl<T, A> Sync for gstd::prelude::vec::Drain<'_, T, A>
impl<T, A> Sync for gstd::prelude::vec::IntoIter<T, A>
impl<T, A> Sync for Arc<T, A>
impl<T, A> Sync for alloc::sync::Weak<T, A>
impl<T, A> Sync for Box<T, A>
impl<T, A> Sync for Drain<'_, T, A>
impl<T, A> Sync for IntoIter<T, A>
impl<T, A> Sync for OccupiedEntry<'_, T, A>
impl<T, A> Sync for RawDrain<'_, T, A>
impl<T, A> Sync for RawIntoIter<T, A>
impl<T, A> Sync for RawTable<T, A>
impl<T, F> Sync for LazyLock<T, F>
impl<T, F> Sync for Lazy<T, F>
impl<T, O> Sync for BitBox<T, O>where
T: BitStore,
O: BitOrder,
impl<T, O> Sync for BitSlice<T, O>where
T: BitStore + Sync,
O: BitOrder,
§Bit-Slice Thread Safety
This allows bit-slice references to be moved across thread boundaries only when
the underlying T element can tolerate concurrency.
All BitSlice references, shared or exclusive, are only threadsafe if the T
element type is Send, because any given bit-slice reference may only have
partial control of a memory element that is also being shared by a bit-slice
reference on another thread. As such, this is never implemented for Cell<U>,
but always implemented for AtomicU and U for a given unsigned integer type
U.
Atomic integers safely handle concurrent writes, cells do not allow concurrency
at all, so the only missing piece is &mut BitSlice<_, U: Unsigned>. This is
handled by the aliasing system that the mutable splitters employ: a mutable
reference to an unsynchronized bit-slice can only cross threads when no other
handle is able to exist to the elements it governs. Splitting a mutable
bit-slice causes the split halves to change over to either atomics or cells, so
concurrency is either safe or impossible.