pub struct Atomic<T> { /* private fields */ }Expand description
Generic atomic which allows any T to be used as lock-free atomic integer.
This atomic allows only types whose size and alignment is compatible with u8, u16, u32, u64.
With exception of fetch_* methods, all atomic methods are implemented for generic T
fetch_* makes sense only to integers, hence they are implemented as specialized methods.
All methods require atomic support, if target has no atomics of required size, then it will fail to compile using particular methods.
Implementations§
Source§impl<T: Copy> Atomic<T>
impl<T: Copy> Atomic<T>
Sourcepub fn get_mut(&mut self) -> &mut T
pub fn get_mut(&mut self) -> &mut T
Returns a mutable reference to the underlying type.
This is safe because the mutable reference guarantees that no other threads are concurrently accessing the atomic data.
Sourcepub fn into_inner(self) -> T
pub fn into_inner(self) -> T
Consumes the atomic and returns the contained value.
This is safe because passing self by value guarantees that no other threads are concurrently accessing the atomic data.
Sourcepub fn load(&self, order: Ordering) -> T
pub fn load(&self, order: Ordering) -> T
Loads a value from the atomic integer.
load takes an Ordering argument which describes the memory ordering of this operation. Possible values are SeqCst, Acquire and Relaxed.
§Panics
Panics if order is Release or AcqRel.
Sourcepub fn store(&self, val: T, order: Ordering)
pub fn store(&self, val: T, order: Ordering)
Stores a value into the atomic integer.
store takes an Ordering argument which describes the memory ordering of this operation.
Possible values are SeqCst, Release and Relaxed.
§Panics
Panics if order is Acquire or AcqRel.
Sourcepub fn swap(&self, val: T, order: Ordering) -> T
pub fn swap(&self, val: T, order: Ordering) -> T
Stores a value into the atomic integer, returning the previous value.
swap takes an Ordering argument which describes the memory ordering of this operation.
All ordering modes are possible.
Note that using Acquire makes the store part of this operation Relaxed, and using Release makes the load part Relaxed.
Sourcepub fn compare_exchange(
&self,
current: T,
new: T,
success: Ordering,
failure: Ordering,
) -> Result<T, T>
pub fn compare_exchange( &self, current: T, new: T, success: Ordering, failure: Ordering, ) -> Result<T, T>
Stores a value into the atomic if the current value is the same as the current value.
The return value is a result indicating whether the new value was written and containing the previous value. On success this value is guaranteed to be equal to current.
compare_exchange takes two Ordering arguments to describe the memory ordering of this operation. success describes the required ordering for the read-modify-write operation that takes place if the comparison with current succeeds. failure describes the required ordering for the load operation that takes place when the comparison fails. Using Acquire as success ordering makes the store part of this operation Relaxed, and using Release makes the successful load Relaxed. The failure ordering can only be SeqCst, Acquire or Relaxed.
Sourcepub fn compare_exchange_weak(
&self,
current: T,
new: T,
success: Ordering,
failure: Ordering,
) -> Result<T, T>
pub fn compare_exchange_weak( &self, current: T, new: T, success: Ordering, failure: Ordering, ) -> Result<T, T>
Stores a value into the atomic if the current value is the same as the current value.
Unlike compare_exchange, this function is allowed to spuriously fail even when the comparison succeeds, which can result in more efficient code on some platforms. The return value is a result indicating whether the new value was written and containing the previous value.
compare_exchange_weak takes two Ordering arguments to describe the memory ordering of this operation. success describes the required ordering for the read-modify-write operation that takes place if the comparison with current succeeds. failure describes the required ordering for the load operation that takes place when the comparison fails. Using Acquire as success ordering makes the store part of this operation Relaxed, and using Release makes the successful load Relaxed. The failure ordering can only be SeqCst, Acquire or Relaxed.
Sourcepub fn fetch_update<F: FnMut(T) -> Option<T>>(
&self,
set_order: Ordering,
fetch_order: Ordering,
cb: F,
) -> Result<T, T>
pub fn fetch_update<F: FnMut(T) -> Option<T>>( &self, set_order: Ordering, fetch_order: Ordering, cb: F, ) -> Result<T, T>
Fetches the value, and applies a function to it that returns an optional new value.
Returns a Result of Ok(previous_value) if the function returned Some(_), else Err(previous_value).
Note: This may call the function multiple times if the value has been changed from other threads in the meantime, as long as the function returns Some(_), but the function will have been applied only once to the stored value.
fetch_update takes two Ordering arguments to describe the memory ordering of this operation.
The first describes the required ordering for when the operation finally succeeds while the second describes the required ordering for loads.
These correspond to the success and failure orderings of compare_exchange respectively.
Using Acquire as success ordering makes the store part of this operation Relaxed, and using Release makes the final successful load Relaxed.
The (failed) load ordering can only be SeqCst, Acquire or Relaxed.
Source§impl Atomic<i8>
impl Atomic<i8>
Sourcepub fn fetch_and(&self, val: i8, order: Ordering) -> i8
pub fn fetch_and(&self, val: i8, order: Ordering) -> i8
Bitwise and with the current value, returning the previous value.
Sourcepub fn fetch_nand(&self, val: i8, order: Ordering) -> i8
pub fn fetch_nand(&self, val: i8, order: Ordering) -> i8
Bitwise nand with the current value.
Source§impl Atomic<u8>
impl Atomic<u8>
Sourcepub fn fetch_and(&self, val: u8, order: Ordering) -> u8
pub fn fetch_and(&self, val: u8, order: Ordering) -> u8
Bitwise and with the current value, returning the previous value.
Sourcepub fn fetch_nand(&self, val: u8, order: Ordering) -> u8
pub fn fetch_nand(&self, val: u8, order: Ordering) -> u8
Bitwise nand with the current value.
Source§impl Atomic<bool>
impl Atomic<bool>
Sourcepub fn fetch_and(&self, val: bool, order: Ordering) -> bool
pub fn fetch_and(&self, val: bool, order: Ordering) -> bool
Bitwise and with the current value, returning the previous value.
Sourcepub fn fetch_nand(&self, val: bool, order: Ordering) -> bool
pub fn fetch_nand(&self, val: bool, order: Ordering) -> bool
Bitwise nand with the current value.
Source§impl Atomic<i16>
impl Atomic<i16>
Sourcepub fn fetch_and(&self, val: i16, order: Ordering) -> i16
pub fn fetch_and(&self, val: i16, order: Ordering) -> i16
Bitwise and with the current value, returning the previous value.
Sourcepub fn fetch_nand(&self, val: i16, order: Ordering) -> i16
pub fn fetch_nand(&self, val: i16, order: Ordering) -> i16
Bitwise nand with the current value.
Source§impl Atomic<u16>
impl Atomic<u16>
Sourcepub fn fetch_and(&self, val: u16, order: Ordering) -> u16
pub fn fetch_and(&self, val: u16, order: Ordering) -> u16
Bitwise and with the current value, returning the previous value.
Sourcepub fn fetch_nand(&self, val: u16, order: Ordering) -> u16
pub fn fetch_nand(&self, val: u16, order: Ordering) -> u16
Bitwise nand with the current value.
Source§impl Atomic<i32>
impl Atomic<i32>
Sourcepub fn fetch_and(&self, val: i32, order: Ordering) -> i32
pub fn fetch_and(&self, val: i32, order: Ordering) -> i32
Bitwise and with the current value, returning the previous value.
Sourcepub fn fetch_nand(&self, val: i32, order: Ordering) -> i32
pub fn fetch_nand(&self, val: i32, order: Ordering) -> i32
Bitwise nand with the current value.
Source§impl Atomic<u32>
impl Atomic<u32>
Sourcepub fn fetch_and(&self, val: u32, order: Ordering) -> u32
pub fn fetch_and(&self, val: u32, order: Ordering) -> u32
Bitwise and with the current value, returning the previous value.
Sourcepub fn fetch_nand(&self, val: u32, order: Ordering) -> u32
pub fn fetch_nand(&self, val: u32, order: Ordering) -> u32
Bitwise nand with the current value.
Source§impl Atomic<i64>
impl Atomic<i64>
Sourcepub fn fetch_and(&self, val: i64, order: Ordering) -> i64
pub fn fetch_and(&self, val: i64, order: Ordering) -> i64
Bitwise and with the current value, returning the previous value.
Sourcepub fn fetch_nand(&self, val: i64, order: Ordering) -> i64
pub fn fetch_nand(&self, val: i64, order: Ordering) -> i64
Bitwise nand with the current value.
Source§impl Atomic<u64>
impl Atomic<u64>
Sourcepub fn fetch_and(&self, val: u64, order: Ordering) -> u64
pub fn fetch_and(&self, val: u64, order: Ordering) -> u64
Bitwise and with the current value, returning the previous value.
Sourcepub fn fetch_nand(&self, val: u64, order: Ordering) -> u64
pub fn fetch_nand(&self, val: u64, order: Ordering) -> u64
Bitwise nand with the current value.
Source§impl Atomic<isize>
impl Atomic<isize>
Sourcepub fn fetch_and(&self, val: isize, order: Ordering) -> isize
pub fn fetch_and(&self, val: isize, order: Ordering) -> isize
Bitwise and with the current value, returning the previous value.
Sourcepub fn fetch_nand(&self, val: isize, order: Ordering) -> isize
pub fn fetch_nand(&self, val: isize, order: Ordering) -> isize
Bitwise nand with the current value.
Source§impl Atomic<usize>
impl Atomic<usize>
Sourcepub fn fetch_and(&self, val: usize, order: Ordering) -> usize
pub fn fetch_and(&self, val: usize, order: Ordering) -> usize
Bitwise and with the current value, returning the previous value.
Sourcepub fn fetch_nand(&self, val: usize, order: Ordering) -> usize
pub fn fetch_nand(&self, val: usize, order: Ordering) -> usize
Bitwise nand with the current value.