core.atomic

Members

Enums

MemoryOrder

enum MemoryOrder

Specifies the memory ordering semantics of an atomic operation.

Functions

atomicExchange

T atomicExchange(T* here, V exchangeWith)

TailShared!T atomicExchange(shared(T)* here, V exchangeWith)

shared(T) atomicExchange(shared(T)* here, shared(V) exchangeWith)

Exchange exchangeWith with the memory referenced by here. This operation is both lock-free and atomic.

atomicFence

void atomicFence()

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.

atomicFetchAdd

T atomicFetchAdd(ref T val, size_t mod)

T atomicFetchAdd(ref shared T val, size_t mod)

Atomically adds mod to the value referenced by val and returns the value val held previously. This operation is both lock-free and atomic.

atomicFetchSub

T atomicFetchSub(ref T val, size_t mod)

T atomicFetchSub(ref shared T val, size_t mod)

Atomically subtracts mod from the value referenced by val and returns the value val held previously. This operation is both lock-free and atomic.

atomicLoad

T atomicLoad(ref const T val)

T atomicLoad(ref shared const T val)

TailShared!T atomicLoad(ref shared const T val)

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.

atomicOp

TailShared!T atomicOp(ref shared T val, V1 mod)

Performs the binary operation 'op' on val using 'mod' as the modifier.

atomicStore

void atomicStore(ref T val, V newval)

void atomicStore(ref shared T val, V newval)

void atomicStore(ref shared T val, shared V newval)

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.

cas

bool cas(T* here, V1 ifThis, V2 writeThis)

bool cas(shared(T)* here, V1 ifThis, V2 writeThis)

bool cas(shared(T)* here, shared(V1) ifThis, shared(V2) writeThis)

Stores 'writeThis' to the memory referenced by 'here' if the value referenced by 'here' is equal to 'ifThis'. This operation is both lock-free and atomic.

cas

bool cas(T* here, T* ifThis, V writeThis)

bool cas(shared(T)* here, V1* ifThis, V2 writeThis)

bool cas(shared(T)* here, shared(T)* ifThis, shared(V) writeThis)

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. This operation is both lock-free and atomic.

casWeak

bool casWeak(T* here, V1 ifThis, V2 writeThis)

bool casWeak(shared(T)* here, V1 ifThis, V2 writeThis)

bool casWeak(shared(T)* here, shared(V1) ifThis, shared(V2) writeThis)

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. *

casWeak

bool casWeak(T* here, T* ifThis, V writeThis)

bool casWeak(shared(T)* here, V1* ifThis, V2 writeThis)

bool casWeak(shared(T)* here, shared(T)* ifThis, shared(V) writeThis)

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. *

pause

void pause()

Gives a hint to the processor that the calling thread is in a 'spin-wait' loop, allowing to more efficiently allocate resources.

testXCHG

void testXCHG(T val)

/////////////////////////////////////////////////////////////////////////////

• atomic