Specifies the memory ordering semantics of an atomic operation.
Exchange exchangeWith with the memory referenced by here. This operation is both lock-free and atomic.
Inserts a full load/store memory fence (on platforms that need it). This ensures that all loads and stores before a call to this function are executed before any loads and stores after the call.
Atomically adds mod to the value referenced by val and returns the value val held previously. This operation is both lock-free and atomic.
Atomically performs and AND operation between mod and the value referenced by val and returns the value val held previously. This operation is both lock-free and atomic.
Atomically performs and OR operation between mod and the value referenced by val and returns the value val held previously. This operation is both lock-free and atomic.
Atomically subtracts mod from the value referenced by val and returns the value val held previously. This operation is both lock-free and atomic.
Atomically performs and XOR operation between mod and the value referenced by val and returns the value val held previously. This operation is both lock-free and atomic.
Loads 'val' from memory and returns it. The memory barrier specified by 'ms' is applied to the operation, which is fully sequenced by default. Valid memory orders are MemoryOrder.raw, MemoryOrder.acq, and MemoryOrder.seq.
Performs the binary operation 'op' on val using 'mod' as the modifier.
Writes 'newval' into 'val'. The memory barrier specified by 'ms' is applied to the operation, which is fully sequenced by default. Valid memory orders are MemoryOrder.raw, MemoryOrder.rel, and MemoryOrder.seq.
Stores 'writeThis' to the memory referenced by 'here' if the value referenced by 'here' is equal to 'ifThis'. The 'weak' version of cas may spuriously fail. It is recommended to use casWeak only when cas would be used in a loop. This operation is both lock-free and atomic.
Stores 'writeThis' to the memory referenced by 'here' if the value referenced by 'here' is equal to the value referenced by 'ifThis'. The prior value referenced by 'here' is written to ifThis and returned to the user. The 'weak' version of cas may spuriously fail. It is recommended to use casWeak only when cas would be used in a loop. This operation is both lock-free and atomic.
Gives a hint to the processor that the calling thread is in a 'spin-wait' loop, allowing to more efficiently allocate resources.
///////////////////////////////////////////////////////////////////////////// /////////////////////////////////////////////////////////////////////////////
///////////////////////////////////////////////////////////////////////////// /////////////////////////////////////////////////////////////////////////////
///////////////////////////////////////////////////////////////////////////// /////////////////////////////////////////////////////////////////////////////
///////////////////////////////////////////////////////////////////////////// /////////////////////////////////////////////////////////////////////////////
This is a D version of a partial implementation of the std::atomic template found in C++ STL. https://en.cppreference.com/w/cpp/atomic/atomic
Performs either compare-and-set or compare-and-swap (or exchange).
int y = 2; shared int x = y; // OK //x++; // read modify write error x.atomicOp!"+="(1); // OK //y = x; // read error with preview flag y = x.atomicLoad(); // OK assert(y == 3); //x = 5; // write error with preview flag x.atomicStore(5); // OK assert(x.atomicLoad() == 5);
Copyright Sean Kelly 2005 - 2016.
The atomic module provides basic support for lock-free concurrent programming.