#[repr(C, align(1))]pub struct AtomicBool { /* private fields */ }Expand description
A boolean type which can be safely shared between threads.
This type has the same in-memory representation as a bool.
Note: This type is only available on platforms that support atomic
loads and stores of u8.
Implementations
impl AtomicBool
source
impl AtomicBool
sourcepub const fn new(v: bool) -> AtomicBool
const: 1.24.0 · source
pub const fn new(v: bool) -> AtomicBool
const: 1.24.0 · sourcepub fn get_mut(&mut self) -> &mut bool
1.15.0 · source
pub fn get_mut(&mut self) -> &mut bool
1.15.0 · sourceReturns a mutable reference to the underlying bool.
This is safe because the mutable reference guarantees that no other threads are concurrently accessing the atomic data.
Examples
use std::sync::atomic::{AtomicBool, Ordering};
let mut some_bool = AtomicBool::new(true);
assert_eq!(*some_bool.get_mut(), true);
*some_bool.get_mut() = false;
assert_eq!(some_bool.load(Ordering::SeqCst), false);Runpub fn get_mut_slice(this: &mut [Self]) -> &mut [bool]
source
pub fn get_mut_slice(this: &mut [Self]) -> &mut [bool]
sourceGet non-atomic access to a &mut [AtomicBool] slice.
This is safe because the mutable reference guarantees that no other threads are concurrently accessing the atomic data.
Examples
#![feature(atomic_from_mut, inline_const, scoped_threads)]
use std::sync::atomic::{AtomicBool, Ordering};
let mut some_bools = [const { AtomicBool::new(false) }; 10];
let view: &mut [bool] = AtomicBool::get_mut_slice(&mut some_bools);
assert_eq!(view, [false; 10]);
view[..5].copy_from_slice(&[true; 5]);
std::thread::scope(|s| {
for t in &some_bools[..5] {
s.spawn(move || assert_eq!(t.load(Ordering::Relaxed), true));
}
for f in &some_bools[5..] {
s.spawn(move || assert_eq!(f.load(Ordering::Relaxed), false));
}
});Runpub fn from_mut_slice(v: &mut [bool]) -> &mut [Self]
source
pub fn from_mut_slice(v: &mut [bool]) -> &mut [Self]
sourceGet atomic access to a &mut [bool] slice.
Examples
#![feature(atomic_from_mut, scoped_threads)]
use std::sync::atomic::{AtomicBool, Ordering};
let mut some_bools = [false; 10];
let a = &*AtomicBool::from_mut_slice(&mut some_bools);
std::thread::scope(|s| {
for i in 0..a.len() {
s.spawn(move || a[i].store(true, Ordering::Relaxed));
}
});
assert_eq!(some_bools, [true; 10]);Runpub fn into_inner(self) -> bool
1.15.0 (const: unstable) · source
pub fn into_inner(self) -> bool
1.15.0 (const: unstable) · sourceConsumes 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.
Examples
use std::sync::atomic::AtomicBool;
let some_bool = AtomicBool::new(true);
assert_eq!(some_bool.into_inner(), true);Runpub fn load(&self, order: Ordering) -> bool
source
pub fn load(&self, order: Ordering) -> bool
sourceLoads a value from the bool.
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.
Examples
use std::sync::atomic::{AtomicBool, Ordering};
let some_bool = AtomicBool::new(true);
assert_eq!(some_bool.load(Ordering::Relaxed), true);Runpub fn store(&self, val: bool, order: Ordering)
source
pub fn store(&self, val: bool, order: Ordering)
sourceStores a value into the bool.
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.
Examples
use std::sync::atomic::{AtomicBool, Ordering};
let some_bool = AtomicBool::new(true);
some_bool.store(false, Ordering::Relaxed);
assert_eq!(some_bool.load(Ordering::Relaxed), false);Runpub fn swap(&self, val: bool, order: Ordering) -> bool
source
pub fn swap(&self, val: bool, order: Ordering) -> bool
sourceStores a value into the bool, 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.
Note: This method is only available on platforms that support atomic
operations on u8.
Examples
use std::sync::atomic::{AtomicBool, Ordering};
let some_bool = AtomicBool::new(true);
assert_eq!(some_bool.swap(false, Ordering::Relaxed), true);
assert_eq!(some_bool.load(Ordering::Relaxed), false);Runpub fn compare_and_swap(
&self,
current: bool,
new: bool,
order: Ordering
) -> bool
source 👎 Deprecated since 1.50.0: Use compare_exchange or compare_exchange_weak instead
pub fn compare_and_swap(
&self,
current: bool,
new: bool,
order: Ordering
) -> bool
sourceUse compare_exchange or compare_exchange_weak instead
Stores a value into the bool if the current value is the same as the current value.
The return value is always the previous value. If it is equal to current, then the value
was updated.
compare_and_swap also takes an Ordering argument which describes the memory
ordering of this operation. Notice that even when using AcqRel, the operation
might fail and hence just perform an Acquire load, but not have Release semantics.
Using Acquire makes the store part of this operation Relaxed if it
happens, and using Release makes the load part Relaxed.
Note: This method is only available on platforms that support atomic
operations on u8.
Migrating to compare_exchange and compare_exchange_weak
compare_and_swap is equivalent to compare_exchange with the following mapping for
memory orderings:
| Original | Success | Failure |
|---|---|---|
| Relaxed | Relaxed | Relaxed |
| Acquire | Acquire | Acquire |
| Release | Release | Relaxed |
| AcqRel | AcqRel | Acquire |
| SeqCst | SeqCst | SeqCst |
compare_exchange_weak is allowed to fail spuriously even when the comparison succeeds,
which allows the compiler to generate better assembly code when the compare and swap
is used in a loop.
Examples
use std::sync::atomic::{AtomicBool, Ordering};
let some_bool = AtomicBool::new(true);
assert_eq!(some_bool.compare_and_swap(true, false, Ordering::Relaxed), true);
assert_eq!(some_bool.load(Ordering::Relaxed), false);
assert_eq!(some_bool.compare_and_swap(true, true, Ordering::Relaxed), false);
assert_eq!(some_bool.load(Ordering::Relaxed), false);Runpub fn compare_exchange(
&self,
current: bool,
new: bool,
success: Ordering,
failure: Ordering
) -> Result<bool, bool>
1.10.0 · source
pub fn compare_exchange(
&self,
current: bool,
new: bool,
success: Ordering,
failure: Ordering
) -> Result<bool, bool>
1.10.0 · sourceStores a value into the bool 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
and must be equivalent to or weaker than the success ordering.
Note: This method is only available on platforms that support atomic
operations on u8.
Examples
use std::sync::atomic::{AtomicBool, Ordering};
let some_bool = AtomicBool::new(true);
assert_eq!(some_bool.compare_exchange(true,
false,
Ordering::Acquire,
Ordering::Relaxed),
Ok(true));
assert_eq!(some_bool.load(Ordering::Relaxed), false);
assert_eq!(some_bool.compare_exchange(true, true,
Ordering::SeqCst,
Ordering::Acquire),
Err(false));
assert_eq!(some_bool.load(Ordering::Relaxed), false);Runpub fn compare_exchange_weak(
&self,
current: bool,
new: bool,
success: Ordering,
failure: Ordering
) -> Result<bool, bool>
1.10.0 · source
pub fn compare_exchange_weak(
&self,
current: bool,
new: bool,
success: Ordering,
failure: Ordering
) -> Result<bool, bool>
1.10.0 · sourceStores a value into the bool if the current value is the same as the current value.
Unlike AtomicBool::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
and must be equivalent to or weaker than the success ordering.
Note: This method is only available on platforms that support atomic
operations on u8.
Examples
use std::sync::atomic::{AtomicBool, Ordering};
let val = AtomicBool::new(false);
let new = true;
let mut old = val.load(Ordering::Relaxed);
loop {
match val.compare_exchange_weak(old, new, Ordering::SeqCst, Ordering::Relaxed) {
Ok(_) => break,
Err(x) => old = x,
}
}Runpub fn fetch_and(&self, val: bool, order: Ordering) -> bool
source
pub fn fetch_and(&self, val: bool, order: Ordering) -> bool
sourceLogical “and” with a boolean value.
Performs a logical “and” operation on the current value and the argument val, and sets
the new value to the result.
Returns the previous value.
fetch_and 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.
Note: This method is only available on platforms that support atomic
operations on u8.
Examples
use std::sync::atomic::{AtomicBool, Ordering};
let foo = AtomicBool::new(true);
assert_eq!(foo.fetch_and(false, Ordering::SeqCst), true);
assert_eq!(foo.load(Ordering::SeqCst), false);
let foo = AtomicBool::new(true);
assert_eq!(foo.fetch_and(true, Ordering::SeqCst), true);
assert_eq!(foo.load(Ordering::SeqCst), true);
let foo = AtomicBool::new(false);
assert_eq!(foo.fetch_and(false, Ordering::SeqCst), false);
assert_eq!(foo.load(Ordering::SeqCst), false);Runpub fn fetch_nand(&self, val: bool, order: Ordering) -> bool
source
pub fn fetch_nand(&self, val: bool, order: Ordering) -> bool
sourceLogical “nand” with a boolean value.
Performs a logical “nand” operation on the current value and the argument val, and sets
the new value to the result.
Returns the previous value.
fetch_nand 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.
Note: This method is only available on platforms that support atomic
operations on u8.
Examples
use std::sync::atomic::{AtomicBool, Ordering};
let foo = AtomicBool::new(true);
assert_eq!(foo.fetch_nand(false, Ordering::SeqCst), true);
assert_eq!(foo.load(Ordering::SeqCst), true);
let foo = AtomicBool::new(true);
assert_eq!(foo.fetch_nand(true, Ordering::SeqCst), true);
assert_eq!(foo.load(Ordering::SeqCst) as usize, 0);
assert_eq!(foo.load(Ordering::SeqCst), false);
let foo = AtomicBool::new(false);
assert_eq!(foo.fetch_nand(false, Ordering::SeqCst), false);
assert_eq!(foo.load(Ordering::SeqCst), true);Runpub fn fetch_or(&self, val: bool, order: Ordering) -> bool
source
pub fn fetch_or(&self, val: bool, order: Ordering) -> bool
sourceLogical “or” with a boolean value.
Performs a logical “or” operation on the current value and the argument val, and sets the
new value to the result.
Returns the previous value.
fetch_or 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.
Note: This method is only available on platforms that support atomic
operations on u8.
Examples
use std::sync::atomic::{AtomicBool, Ordering};
let foo = AtomicBool::new(true);
assert_eq!(foo.fetch_or(false, Ordering::SeqCst), true);
assert_eq!(foo.load(Ordering::SeqCst), true);
let foo = AtomicBool::new(true);
assert_eq!(foo.fetch_or(true, Ordering::SeqCst), true);
assert_eq!(foo.load(Ordering::SeqCst), true);
let foo = AtomicBool::new(false);
assert_eq!(foo.fetch_or(false, Ordering::SeqCst), false);
assert_eq!(foo.load(Ordering::SeqCst), false);Runpub fn fetch_xor(&self, val: bool, order: Ordering) -> bool
source
pub fn fetch_xor(&self, val: bool, order: Ordering) -> bool
sourceLogical “xor” with a boolean value.
Performs a logical “xor” operation on the current value and the argument val, and sets
the new value to the result.
Returns the previous value.
fetch_xor 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.
Note: This method is only available on platforms that support atomic
operations on u8.
Examples
use std::sync::atomic::{AtomicBool, Ordering};
let foo = AtomicBool::new(true);
assert_eq!(foo.fetch_xor(false, Ordering::SeqCst), true);
assert_eq!(foo.load(Ordering::SeqCst), true);
let foo = AtomicBool::new(true);
assert_eq!(foo.fetch_xor(true, Ordering::SeqCst), true);
assert_eq!(foo.load(Ordering::SeqCst), false);
let foo = AtomicBool::new(false);
assert_eq!(foo.fetch_xor(false, Ordering::SeqCst), false);
assert_eq!(foo.load(Ordering::SeqCst), false);Runpub fn as_mut_ptr(&self) -> *mut bool
source
pub fn as_mut_ptr(&self) -> *mut bool
sourceReturns a mutable pointer to the underlying bool.
Doing non-atomic reads and writes on the resulting integer can be a data race.
This method is mostly useful for FFI, where the function signature may use
*mut bool instead of &AtomicBool.
Returning an *mut pointer from a shared reference to this atomic is safe because the
atomic types work with interior mutability. All modifications of an atomic change the value
through a shared reference, and can do so safely as long as they use atomic operations. Any
use of the returned raw pointer requires an unsafe block and still has to uphold the same
restriction: operations on it must be atomic.
Examples
use std::sync::atomic::AtomicBool;
extern "C" {
fn my_atomic_op(arg: *mut bool);
}
let mut atomic = AtomicBool::new(true);
unsafe {
my_atomic_op(atomic.as_mut_ptr());
}Runpub fn fetch_update<F>(
&self,
set_order: Ordering,
fetch_order: Ordering,
f: F
) -> Result<bool, bool> where
F: FnMut(bool) -> Option<bool>,
1.53.0 · source
pub fn fetch_update<F>(
&self,
set_order: Ordering,
fetch_order: Ordering,
f: F
) -> Result<bool, bool> where
F: FnMut(bool) -> Option<bool>,
1.53.0 · sourceFetches 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 AtomicBool::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 and must be equivalent to or weaker than the
success ordering.
Note: This method is only available on platforms that support atomic
operations on u8.
Examples
use std::sync::atomic::{AtomicBool, Ordering};
let x = AtomicBool::new(false);
assert_eq!(x.fetch_update(Ordering::SeqCst, Ordering::SeqCst, |_| None), Err(false));
assert_eq!(x.fetch_update(Ordering::SeqCst, Ordering::SeqCst, |x| Some(!x)), Ok(false));
assert_eq!(x.fetch_update(Ordering::SeqCst, Ordering::SeqCst, |x| Some(!x)), Ok(true));
assert_eq!(x.load(Ordering::SeqCst), false);RunTrait Implementations
impl Debug for AtomicBool
1.3.0 · source
impl Debug for AtomicBool
1.3.0 · sourceimpl Default for AtomicBool
const: unstable · source
impl Default for AtomicBool
const: unstable · sourceimpl From<bool> for AtomicBool
1.24.0 (const: unstable) · source
impl From<bool> for AtomicBool
1.24.0 (const: unstable) · sourceimpl RefUnwindSafe for AtomicBool
1.14.0 · sourceimpl Sync for AtomicBool
sourceAuto Trait Implementations
Blanket Implementations
impl<T> BorrowMut<T> for T where
T: ?Sized,
source
impl<T> BorrowMut<T> for T where
T: ?Sized,
sourcefn borrow_mut(&mut self) -> &mut T
const: unstable · source
fn borrow_mut(&mut self) -> &mut T
const: unstable · sourceMutably borrows from an owned value. Read more