|
| 1 | +# ``Atomics`` |
| 2 | + |
| 3 | +An atomics library for Swift. |
| 4 | + |
| 5 | +## Overview |
| 6 | + |
| 7 | +This package implements an atomics library for Swift, providing atomic operations for a variety of Swift types, including integers and pointer values. The goal is to enable intrepid developers to start building synchronization constructs directly in Swift. |
| 8 | + |
| 9 | +Atomic operations aren't subject to the usual exclusivity rules. The same memory location may be safely read and updated from multiple concurrent threads of execution, as long as all such access is done through atomic operations. For example, here is a trivial atomic counter: |
| 10 | + |
| 11 | +``` swift |
| 12 | +import Atomics |
| 13 | +import Dispatch |
| 14 | + |
| 15 | +let counter = ManagedAtomic<Int>(0) |
| 16 | + |
| 17 | +DispatchQueue.concurrentPerform(iterations: 10) { _ in |
| 18 | +for _ in 0 ..< 1_000_000 { |
| 19 | +counter.wrappingIncrement(ordering: .relaxed) |
| 20 | +} |
| 21 | +} |
| 22 | +counter.load(ordering: .relaxed) // ⟹ 10_000_000 |
| 23 | +``` |
| 24 | + |
| 25 | +The only way to access the counter value is to use one of the methods provided by `ManagedAtomic`, each of which implement a particular atomic operation, and each of which require an explicit ordering value. (Swift supports a subset of the C/C++ memory orderings.) |
| 26 | + |
| 27 | +## Features |
| 28 | + |
| 29 | +The package implements atomic operations for the following Swift constructs, all of which conform to the public `AtomicValue` protocol: |
| 30 | + |
| 31 | +- Standard signed integer types (`Int`, `Int64`, `Int32`, `Int16`, `Int8`) |
| 32 | +- Standard unsigned integer types (`UInt`, `UInt64`, `UInt32`, `UInt16`, `UInt8`) |
| 33 | +- Booleans (`Bool`) |
| 34 | +- Standard pointer types (`UnsafeRawPointer`, `UnsafeMutableRawPointer`, `UnsafePointer<T>`, `UnsafeMutablePointer<T>`), along with their optional-wrapped forms (such as `Optional<UnsafePointer<T>>`) |
| 35 | +- Unmanaged references (`Unmanaged<T>`, `Optional<Unmanaged<T>>`) |
| 36 | +- A special `DoubleWord` type that consists of two `UInt` values, `low` and `high`, providing double-wide atomic primitives |
| 37 | +- Any `RawRepresentable` type whose `RawValue` is in turn an atomic type (such as simple custom enum types) |
| 38 | +- Strong references to class instances that opted into atomic use (by conforming to the `AtomicReference` protocol) |
| 39 | + |
| 40 | +Of particular note is full support for atomic strong references. This provides a convenient memory reclamation solution for concurrent data structures that fits perfectly with Swift's reference counting memory management model. (Atomic strong references are implemented in terms of `DoubleWord` operations.) However, accessing an atomic strong reference is (relatively) expensive, so we also provide a separate set of efficient constructs (`ManagedAtomicLazyReference` and `UnsafeAtomicLazyReference`) for the common case of a lazily initialized (but otherwise constant) atomic strong reference. |
| 41 | + |
| 42 | +### Lock-Free vs Wait-Free Operations |
| 43 | + |
| 44 | +All atomic operations exposed by this package are guaranteed to have lock-free implementations. However, we do not guarantee wait-free operation -- depending on the capabilities of the target platform, some of the exposed operations may be implemented by compare-and-exchange loops. That said, all atomic operations map directly to dedicated CPU instructions where available -- to the extent supported by llvm & Clang. |
| 45 | + |
| 46 | +### Memory Management |
| 47 | + |
| 48 | +Atomic access is implemented in terms of dedicated atomic storage representations that are kept distinct from the corresponding regular (non-atomic) type. (E.g., the actual integer value underlying the counter above isn't directly accessible.) This has several advantages: |
| 49 | + |
| 50 | +- it helps prevent accidental non-atomic access to atomic variables, |
| 51 | +- it enables custom storage representations (such as the one used by atomic strong references), and |
| 52 | +- it is a better fit with the standard C atomics library that we use to implement the actual operations (as enabled by [SE-0282]). |
| 53 | + |
| 54 | +[SE-0282]: https://github.com/apple/swift-evolution/blob/master/proposals/0282-atomics.md |
| 55 | + |
| 56 | +While the underlying pointer-based atomic operations are exposed as static methods on the corresponding `AtomicStorage` types, we strongly recommend the use of higher-level atomic wrappers to manage the details of preparing/disposing atomic storage. This version of the library provides two wrapper types: |
| 57 | + |
| 58 | +- an easy to use, memory-safe `ManagedAtomic<T>` generic class and |
| 59 | +- a less convenient, but more flexible `UnsafeAtomic<T>` generic struct. |
| 60 | + |
| 61 | +Both constructs provide the following operations on all `AtomicValue` types: |
| 62 | + |
| 63 | +```swift |
| 64 | +func load(ordering: AtomicLoadOrdering) -> Value |
| 65 | +func store(_ desired: Value, ordering: AtomicStoreOrdering) |
| 66 | +func exchange(_ desired: Value, ordering: AtomicUpdateOrdering) -> Value |
| 67 | + |
| 68 | +func compareExchange( |
| 69 | +expected: Value, |
| 70 | +desired: Value, |
| 71 | +ordering: AtomicUpdateOrdering |
| 72 | +) -> (exchanged: Bool, original: Value) |
| 73 | + |
| 74 | +func compareExchange( |
| 75 | +expected: Value, |
| 76 | +desired: Value, |
| 77 | +successOrdering: AtomicUpdateOrdering, |
| 78 | +failureOrdering: AtomicLoadOrdering |
| 79 | +) -> (exchanged: Bool, original: Value) |
| 80 | + |
| 81 | +func weakCompareExchange( |
| 82 | +expected: Value, |
| 83 | +desired: Value, |
| 84 | +successOrdering: AtomicUpdateOrdering, |
| 85 | +failureOrdering: AtomicLoadOrdering |
| 86 | +) -> (exchanged: Bool, original: Value) |
| 87 | +``` |
| 88 | + |
| 89 | +Integer types come with additional atomic operations for incrementing or decrementing values and bitwise logical operations. `Bool` provides select additional boolean operations along the same vein. |
| 90 | + |
| 91 | +For an introduction to the APIs provided by this package, for now please see the [first version of SE-0282][SE-0282r0]. |
| 92 | + |
| 93 | +Note that when/if Swift gains support for non-copiable types, we expect to replace both `ManagedAtomic` and `UnsafeAtomic` with a single move-only atomic struct that combines the performance and versatility of `UnsafeAtomic` with the ease-of-use and memory safety of `ManagedAtomic`. |
| 94 | + |
| 95 | +The current version of the `Atomics` module does not implement APIs for tagged atomics (see [issue #1](https://github.com/apple/swift-atomics/issues/1)), although it does expose a `DoubleWord` type that can be used to implement them. (Atomic strong references are already implemented in terms of `DoubleWord`, although in their current form they do not expose any user-customizable bits.) |
| 96 | + |
| 97 | + |
| 98 | +## Topics |
| 99 | + |
| 100 | +### Atomic Container Types |
| 101 | + |
| 102 | +- ``ManagedAtomic`` |
| 103 | +- ``UnsafeAtomic`` |
| 104 | +- ``ManagedAtomicLazyReference`` |
| 105 | +- ``UnsafeAtomicLazyReference`` |
| 106 | + |
| 107 | +### Memory Orderings |
| 108 | + |
| 109 | +- ``AtomicLoadOrdering`` |
| 110 | +- ``AtomicStoreOrdering`` |
| 111 | +- ``AtomicUpdateOrdering`` |
| 112 | + |
| 113 | +### Atomic Value Protocols |
| 114 | + |
| 115 | +- ``AtomicValue`` |
| 116 | +- ``AtomicInteger`` |
| 117 | +- ``AtomicReference`` |
| 118 | +- ``AtomicOptionalWrappable`` |
| 119 | + |
| 120 | +### Atomic Storage Representations |
| 121 | + |
| 122 | +- ``AtomicStorage`` |
| 123 | +- ``AtomicIntegerStorage`` |
| 124 | +- ``AtomicRawRepresentableStorage`` |
| 125 | +- ``AtomicReferenceStorage`` |
| 126 | +- ``AtomicOptionalReferenceStorage`` |
| 127 | + |
| 128 | +### Fences |
| 129 | + |
| 130 | +- ``atomicMemoryFence(ordering:)`` |
| 131 | + |
| 132 | +### Value Types |
| 133 | + |
| 134 | +- ``DoubleWord`` |
0 commit comments