Given an array, an offset in machine words, the expected old value, and the new value, perform an atomic compare and swap i.e. write the new value if the current value matches the provided old value. Returns the value of the element before the operation. Implies a full memory barrier.
Moduleatomic-primops-0.8.8Haskell2010
Data.Atomics.Internal
This module provides only the raw primops (and necessary types) for atomic operations.
- 1 type
- 6 values
- Packageatomic-primops-0.8.8
- Exports7
- LanguageHaskell2010
- LicenceBSD-3-Clause
- SourceInternal.hs
Given an array, and offset in machine words, and a value to add, atomically add the value to the element. Returns the value of the element before the operation. Implies a full memory barrier.
Unsafe, machine-level atomic compare and swap on an element within an Array.
When performing compare-and-swaps, the ticket encapsulates proof that a thread observed a specific previous value of a mutable variable. It is provided in lieu of the "old" value to compare-and-swap.
Design note: Tickets exist to hide objects from the GHC compiler, which can normally perform many optimizations that change pointer equality. A Ticket, on the other hand, is a first-class object that can be handled by the user, but will not have its pointer identity changed by compiler optimizations (but will of course, change addresses during garbage collection).