pub struct AtomicF16 { /* private fields */ }float and portable_atomic_unstable_f16 only.Expand description
A floating point type which can be safely shared between threads.
This type has the same in-memory representation as the underlying floating point type,
f16.
Implementations§
Source§impl AtomicF16
impl AtomicF16
Sourcepub const unsafe fn from_ptr<'a>(ptr: *mut f16) -> &'a Self
pub const unsafe fn from_ptr<'a>(ptr: *mut f16) -> &'a Self
Creates a new reference to an atomic float from a pointer.
This is const fn on Rust 1.83+.
§Safety
ptrmust be aligned toalign_of::<AtomicF16>()(note that on some platforms this can be bigger thanalign_of::<f16>()).ptrmust be valid for both reads and writes for the whole lifetime'a.- If this atomic type is lock-free, non-atomic accesses to the value
behind
ptrmust have a happens-before relationship with atomic accesses via the returned value (or vice-versa).- In other words, time periods where the value is accessed atomically may not overlap with periods where the value is accessed non-atomically.
- This requirement is trivially satisfied if
ptris never used non-atomically for the duration of lifetime'a. Most use cases should be able to follow this guideline. - This requirement is also trivially satisfied if all accesses (atomic or not) are done from the same thread.
- If this atomic type is not lock-free:
- Any accesses to the value behind
ptrmust have a happens-before relationship with accesses via the returned value (or vice-versa). - Any concurrent accesses to the value behind
ptrfor the duration of lifetime'amust be compatible with operations performed by this atomic type.
- Any accesses to the value behind
- This method must not be used to create overlapping or mixed-size atomic accesses, as these are not supported by the memory model.
Sourcepub fn is_lock_free() -> bool
pub fn is_lock_free() -> bool
Returns true if operations on values of this type are lock-free.
If the compiler or the platform doesn’t support the necessary atomic instructions, global locks for every potentially concurrent atomic operation will be used.
Sourcepub const fn is_always_lock_free() -> bool
pub const fn is_always_lock_free() -> bool
Returns true if operations on values of this type are lock-free.
If the compiler or the platform doesn’t support the necessary atomic instructions, global locks for every potentially concurrent atomic operation will be used.
Note: If the atomic operation relies on dynamic CPU feature detection, this type may be lock-free even if the function returns false.
Sourcepub const fn get_mut(&mut self) -> &mut f16
pub const fn get_mut(&mut self) -> &mut f16
Returns a mutable reference to the underlying float.
This is safe because the mutable reference guarantees that no other threads are concurrently accessing the atomic data.
This is const fn on Rust 1.83+.
Sourcepub const fn into_inner(self) -> f16
pub const fn into_inner(self) -> f16
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.
This is const fn on Rust 1.56+.
Sourcepub fn swap(&self, val: f16, order: Ordering) -> f16
pub fn swap(&self, val: f16, order: Ordering) -> f16
Stores a value into the atomic float, 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: f16,
new: f16,
success: Ordering,
failure: Ordering,
) -> Result<f16, f16>
pub fn compare_exchange( &self, current: f16, new: f16, success: Ordering, failure: Ordering, ) -> Result<f16, f16>
Stores a value into the atomic float 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.
§Panics
Sourcepub fn compare_exchange_weak(
&self,
current: f16,
new: f16,
success: Ordering,
failure: Ordering,
) -> Result<f16, f16>
pub fn compare_exchange_weak( &self, current: f16, new: f16, success: Ordering, failure: Ordering, ) -> Result<f16, f16>
Stores a value into the atomic float 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.
§Panics
Sourcepub fn fetch_add(&self, val: f16, order: Ordering) -> f16
pub fn fetch_add(&self, val: f16, order: Ordering) -> f16
Adds to the current value, returning the previous value.
This operation wraps around on overflow.
fetch_add 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 fetch_sub(&self, val: f16, order: Ordering) -> f16
pub fn fetch_sub(&self, val: f16, order: Ordering) -> f16
Subtracts from the current value, returning the previous value.
This operation wraps around on overflow.
fetch_sub 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 fetch_update<F>(
&self,
set_order: Ordering,
fetch_order: Ordering,
f: F,
) -> Result<f16, f16>
pub fn fetch_update<F>( &self, set_order: Ordering, fetch_order: Ordering, f: F, ) -> Result<f16, f16>
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.
§Panics
Panics if fetch_order is Release, AcqRel.
§Considerations
This method is not magic; it is not provided by the hardware.
It is implemented in terms of compare_exchange_weak,
and suffers from the same drawbacks.
In particular, this method will not circumvent the ABA Problem.
Sourcepub fn fetch_max(&self, val: f16, order: Ordering) -> f16
pub fn fetch_max(&self, val: f16, order: Ordering) -> f16
Maximum with the current value.
Finds the maximum of the current value and the argument val, and
sets the new value to the result.
Returns the previous value.
fetch_max 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 fetch_min(&self, val: f16, order: Ordering) -> f16
pub fn fetch_min(&self, val: f16, order: Ordering) -> f16
Minimum with the current value.
Finds the minimum of the current value and the argument val, and
sets the new value to the result.
Returns the previous value.
fetch_min 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 fetch_neg(&self, order: Ordering) -> f16
pub fn fetch_neg(&self, order: Ordering) -> f16
Negates the current value, and sets the new value to the result.
Returns the previous value.
fetch_neg 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 fetch_abs(&self, order: Ordering) -> f16
pub fn fetch_abs(&self, order: Ordering) -> f16
Computes the absolute value of the current value, and sets the new value to the result.
Returns the previous value.
fetch_abs 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 const fn as_bits(&self) -> &AtomicU16
pub const fn as_bits(&self) -> &AtomicU16
Raw transmutation to &AtomicU16.
See f16::from_bits for some discussion of the
portability of this operation (there are almost no issues).
This is const fn on Rust 1.58+.
Sourcepub const fn as_ptr(&self) -> *mut f16
pub const fn as_ptr(&self) -> *mut f16
Returns a mutable pointer to the underlying float.
Returning an *mut pointer from a shared reference to this atomic is
safe because the atomic types work with interior mutability. Any use of
the returned raw pointer requires an unsafe block and has to uphold
the safety requirements. If there is concurrent access, note the following
additional safety requirements:
- If this atomic type is lock-free, any concurrent operations on it must be atomic.
- Otherwise, any concurrent operations on it must be compatible with operations performed by this atomic type.
This is const fn on Rust 1.58+.