Open Search
#include <atomictypes.h>
Atomic float template. Since floating point loads and stores are not atomic the template uses integers loads and stores and then safely reinterprets them as floats.
Public Types | |
| using | ValueType = T |
| using | IntT = typename IntType< SIZEOF(T)>::type |
| using | AtomicType = typename std::conditional< SIZEOF(T)==4, Atomic32< Int32 >, Atomic64< Int64 > >::type |
Public Member Functions | |
| MAXON_IMPLICIT | AtomicFloatType (T value=T()) |
| T | Get () const |
| void | Set (T newValue) |
| T | Load () const |
| void | Store (T newValue) |
| T | LoadRelaxed () const |
| void | StoreRelaxed (T newValue) |
| T | LoadAcquire () const |
| void | StoreRelease (T &newValue) |
| Bool | TryCompareAndSwap (const T &newValue, const T &compare) |
| T | Swap (T &newValue) |
| T | SwapAdd (T add) |
Private Member Functions | |
| MAXON_DISALLOW_COPY_AND_ASSIGN (AtomicFloatType) | |
Private Attributes | |
| AtomicType | _value |
| using ValueType = T |
| using AtomicType = typename std::conditional<SIZEOF(T) == 4, Atomic32<Int32>, Atomic64<Int64> >::type |
| MAXON_IMPLICIT AtomicFloatType | ( | T | value = T() | ) |
|
private |
| T Get | ( | ) | const |
Default routine to get an atomic value. It is identical to Load() with sequentially consistent memory order. Other routines might deliver improved performance.
| void Set | ( | T | newValue | ) |
Default routine to set an atomic value. It is identical to Store() with sequentially consistent memory order. Other routines might deliver improved performance.
| [in] | newValue | Value to be stored. |
| T Load | ( | ) | const |
Atomic load with sequentially consistent memory order.
| void Store | ( | T | newValue | ) |
Atomic store with sequentially consistent memory order.
| [in] | newValue | Value to be stored. |
| T LoadRelaxed | ( | ) | const |
Atomic load with relaxed memory order. This load is completely unordered (might be prefetched). You should only use it within the same thread when guarded with preceding acquire load or a fence. Fences are implicitly created by TryCompareAndSwap, Swap, SwapAdd, SwapIncrement, SwapDecrement and by locks.
| void StoreRelaxed | ( | T | newValue | ) |
Atomic store with relaxed memory order. This store is completely unordered. You should only use it within the same thread when guarded by a following release store or a fence.
| [in] | newValue | Value to be stored. |
| T LoadAcquire | ( | ) | const |
Atomic load with acquire memory order. If another thread has released a store on this location it is guaranteed that after a load with acquire memory order all following loads will see the (relaxed) stores that preceded the release. Furthermore subsequent loads or stores will not be speculatively executed before this load. This is equivalent to a relaxed load followed by a MemoryFenceAcquire().
| void StoreRelease | ( | T & | newValue | ) |
Atomic store with release memory order. As soon as another thread reads on this location using LoadAcquire() and obtains the stored value it is guaranteed that all prior (relaxed) stores are visible to it. This is equivalent to a MemoryFenceRelease() followed by a relaxed store.
| [in] | newValue | Value to be stored. |
| Bool TryCompareAndSwap | ( | const T & | newValue, |
| const T & | compare | ||
| ) |
Atomic compare and swap with sequentially consistent memory order. If the previous memory location value equals compare newValue is written to the memory location and true is returned. If the memory location contained a different value it is not changed and false will be returned. If the value is exchanged this call enforces a sequentially consistent memory order which means that it might require potentially expensive synchronization between the CPUs.
| [in] | newValue | Value to be stored if memory location contains compare. |
| [in] | compare | Value to compare with memory location. |
| T Swap | ( | T & | newValue | ) |
Atomic swap with sequentially consistent memory order. Exchanges the value of the memory location with newValue and returns the previous value. This call enforces a sequentially consistent memory order which means that it might require potentially expensive synchronization between the CPUs.
| [in] | newValue | Value to be stored. |
| T SwapAdd | ( | T | add | ) |
Atomic add with sequentially consistent memory order. Adds the specified value to the memory location and returns the previous value. This call enforces a sequentially consistent memory order which means that it might require potentially expensive synchronization between the CPUs.
| [in] | add | Value to be added. |
|
private |