std::atomic_ref<T>::wait
void wait( value_type old, std::memory_order order = std::memory_order_seq_cst ) const noexcept; |
(constexpr since C++26) | |
Performs atomic waiting operations. Behaves as if it repeatedly performs the following steps:
- Compare the value representation of this->load(order) with that of old.
- If those are equal, then blocks until *this is notified by notify_one() or notify_all(), or the thread is unblocked spuriously.
- Otherwise, returns.
These functions are guaranteed to return only if value has changed, even if underlying implementation unblocks spuriously.
If order is not std::memory_order_relaxed, std::memory_order_consume, std::memory_order_acquire or std::memory_order_seq_cst, the behavior is undefined.
Contents |
[edit] Parameters
old | - | the value to check the atomic_ref 's object no longer contains
|
order | - | memory order constraints to enforce |
[edit] Notes
This form of change-detection is often more efficient than simple polling or pure spinlocks.
Due to the ABA problem, transient changes from old to another value and back to old might be missed, and not unblock.
The comparison is bitwise (similar to std::memcmp); no comparison operator is used. Padding bits that never participate in an object's value representation are ignored.
[edit] Example
This section is incomplete Reason: no example |
[edit] See also
notifies at least one thread waiting on the atomic object (public member function) | |
notifies all threads blocked waiting on the atomic object (public member function) | |
(C++20) |
notifies a thread blocked in atomic_wait (function template) |
(C++20) |
notifies all threads blocked in atomic_wait (function template) |