File: _HashNode%2BUnsafeHandle.swift

package info (click to toggle)
swiftlang 6.0.3-2
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 2,519,992 kB
  • sloc: cpp: 9,107,863; ansic: 2,040,022; asm: 1,135,751; python: 296,500; objc: 82,456; f90: 60,502; lisp: 34,951; pascal: 19,946; sh: 18,133; perl: 7,482; ml: 4,937; javascript: 4,117; makefile: 3,840; awk: 3,535; xml: 914; fortran: 619; cs: 573; ruby: 573
file content (295 lines) | stat: -rw-r--r-- 7,480 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
//===----------------------------------------------------------------------===//
//
// This source file is part of the Swift Collections open source project
//
// Copyright (c) 2022 - 2024 Apple Inc. and the Swift project authors
// Licensed under Apache License v2.0 with Runtime Library Exception
//
// See https://swift.org/LICENSE.txt for license information
//
//===----------------------------------------------------------------------===//

extension _HashNode {
  /// An unsafe view of the data stored inside a node in the hash tree, hiding
  /// the mechanics of accessing storage from the code that uses it.
  ///
  /// Handles do not own the storage they access -- it is the client's
  /// responsibility to ensure that handles (and any pointer values generated
  /// by them) do not escape the closure call that received them.
  ///
  /// A handle can be either read-only or mutable, depending on the method used
  /// to access it. In debug builds, methods that modify data trap at runtime if
  /// they're called on a read-only view.
  @usableFromInline
  @frozen
  internal struct UnsafeHandle {
    @usableFromInline
    internal typealias Element = (key: Key, value: Value)

    @usableFromInline
    internal let _header: UnsafeMutablePointer<_HashNodeHeader>

    @usableFromInline
    internal let _memory: UnsafeMutableRawPointer

    #if DEBUG
    @usableFromInline
    internal let _isMutable: Bool
    #endif

    @inlinable
    internal init(
      _ header: UnsafeMutablePointer<_HashNodeHeader>,
      _ memory: UnsafeMutableRawPointer,
      isMutable: Bool
    ) {
      self._header = header
      self._memory = memory
      #if DEBUG
      self._isMutable = isMutable
      #endif
    }
  }
}

extension _HashNode.UnsafeHandle {
  @inlinable
  @inline(__always)
  func assertMutable() {
#if DEBUG
    assert(_isMutable)
#endif
  }
}

extension _HashNode.UnsafeHandle {
  @inlinable @inline(__always)
  static func read<R>(
    _ node: _UnmanagedHashNode,
    _ body: (Self) throws -> R
  ) rethrows -> R {
    try node.ref._withUnsafeGuaranteedRef { storage in
      try storage.withUnsafeMutablePointers { header, elements in
        try body(Self(header, UnsafeMutableRawPointer(elements), isMutable: false))
      }
    }
  }

  @inlinable @inline(__always)
  static func read<R>(
    _ storage: _RawHashStorage,
    _ body: (Self) throws -> R
  ) rethrows -> R {
    try storage.withUnsafeMutablePointers { header, elements in
      try body(Self(header, UnsafeMutableRawPointer(elements), isMutable: false))
    }
  }

  @inlinable @inline(__always)
  static func update<R>(
    _ node: _UnmanagedHashNode,
    _ body: (Self) throws -> R
  ) rethrows -> R {
    try node.ref._withUnsafeGuaranteedRef { storage in
      try storage.withUnsafeMutablePointers { header, elements in
        try body(Self(header, UnsafeMutableRawPointer(elements), isMutable: true))
      }
    }
  }

  @inlinable @inline(__always)
  static func update<R>(
    _ storage: _RawHashStorage,
    _ body: (Self) throws -> R
  ) rethrows -> R {
    try storage.withUnsafeMutablePointers { header, elements in
      try body(Self(header, UnsafeMutableRawPointer(elements), isMutable: true))
    }
  }
}

extension _HashNode.UnsafeHandle {
  @inlinable @inline(__always)
  internal var itemMap: _Bitmap {
    get {
      _header.pointee.itemMap
    }
    nonmutating set {
      assertMutable()
      _header.pointee.itemMap = newValue
    }
  }

  @inlinable @inline(__always)
  internal var childMap: _Bitmap {
    get {
      _header.pointee.childMap
    }
    nonmutating set {
      assertMutable()
      _header.pointee.childMap = newValue
    }
  }

  @inlinable @inline(__always)
  internal var byteCapacity: Int {
    _header.pointee.byteCapacity
  }

  @inlinable @inline(__always)
  internal var bytesFree: Int {
    get { _header.pointee.bytesFree }
    nonmutating set {
      assertMutable()
      _header.pointee.bytesFree = newValue
    }
  }

  @inlinable @inline(__always)
  internal var isCollisionNode: Bool {
    _header.pointee.isCollisionNode
  }

  @inlinable @inline(__always)
  internal var collisionCount: Int {
    get { _header.pointee.collisionCount }
    nonmutating set {
      assertMutable()
      _header.pointee.collisionCount = newValue
    }
  }

  @inlinable @inline(__always)
  internal var collisionHash: _Hash {
    get {
      assert(isCollisionNode)
      return _memory.load(as: _Hash.self)
    }
    nonmutating set {
      assertMutable()
      assert(isCollisionNode)
      _memory.storeBytes(of: newValue, as: _Hash.self)
    }
  }

  @inlinable @inline(__always)
  internal var _childrenStart: UnsafeMutablePointer<_HashNode> {
    _memory.assumingMemoryBound(to: _HashNode.self)
  }

  @inlinable @inline(__always)
  internal var hasChildren: Bool {
    _header.pointee.hasChildren
  }

  @inlinable @inline(__always)
  internal var childCount: Int {
    _header.pointee.childCount
  }

  @inlinable
  internal func childBucket(at slot: _HashSlot) -> _Bucket {
    guard !isCollisionNode else { return .invalid }
    return childMap.bucket(at: slot)
  }

  @inlinable @inline(__always)
  internal var childrenEndSlot: _HashSlot {
    _header.pointee.childrenEndSlot
  }

  @inlinable
  internal var children: UnsafeMutableBufferPointer<_HashNode> {
    UnsafeMutableBufferPointer(start: _childrenStart, count: childCount)
  }

  @inlinable
  internal func childPtr(at slot: _HashSlot) -> UnsafeMutablePointer<_HashNode> {
    assert(slot.value < childCount)
    return _childrenStart + slot.value
  }

  @inlinable
  internal subscript(child slot: _HashSlot) -> _HashNode {
    unsafeAddress {
      UnsafePointer(childPtr(at: slot))
    }
    nonmutating unsafeMutableAddress {
      assertMutable()
      return childPtr(at: slot)
    }
  }

  @inlinable
  internal var _itemsEnd: UnsafeMutablePointer<Element> {
    (_memory + _header.pointee.byteCapacity)
      .assumingMemoryBound(to: Element.self)
  }

  @inlinable @inline(__always)
  internal var hasItems: Bool {
    _header.pointee.hasItems
  }

  @inlinable @inline(__always)
  internal var itemCount: Int {
    _header.pointee.itemCount
  }

  @inlinable
  internal func itemBucket(at slot: _HashSlot) -> _Bucket {
    guard !isCollisionNode else { return .invalid }
    return itemMap.bucket(at: slot)
  }

  @inlinable @inline(__always)
  internal var itemsEndSlot: _HashSlot {
    _header.pointee.itemsEndSlot
  }

  @inlinable
  internal var reverseItems: UnsafeMutableBufferPointer<Element> {
    let c = itemCount
    return UnsafeMutableBufferPointer(start: _itemsEnd - c, count: c)
  }

  @inlinable
  internal func itemPtr(at slot: _HashSlot) -> UnsafeMutablePointer<Element> {
    assert(slot.value <= itemCount)
    return _itemsEnd.advanced(by: -1 &- slot.value)
  }

  @inlinable
  internal subscript(item slot: _HashSlot) -> Element {
    unsafeAddress {
      UnsafePointer(itemPtr(at: slot))
    }
    nonmutating unsafeMutableAddress {
      assertMutable()
      return itemPtr(at: slot)
    }
  }

  @inlinable
  internal func clear() {
    assertMutable()
    _header.pointee.clear()
  }
}

extension _HashNode.UnsafeHandle {
  @inlinable
  internal var hasSingletonItem: Bool {
    _header.pointee.hasSingletonItem
  }

  @inlinable
  internal var hasSingletonChild: Bool {
    _header.pointee.hasSingletonChild
  }

  @inlinable
  internal var isAtrophiedNode: Bool {
    hasSingletonChild && self[child: .zero].isCollisionNode
  }
}