Inlineable: unsafe performance

Author: airspeedswift

stdlib/public/core/Builtin.swift

@@ -78,7 +78,7 @@ func _canBeClass<T>(_: T.Type) -> Int8 {
 ///   - type: The type to cast `x` to. `type` and the type of `x` must have the
 ///     same size of memory representation and compatible memory layout.
 /// - Returns: A new instance of type `U`, cast from `x`.
-@inlinable // FIXME(sil-serialize-all)
+@inlinable // unsafe-performance
 @_transparent
 public func unsafeBitCast<T, U>(_ x: T, to type: U.Type) -> U {
   _precondition(MemoryLayout<T>.size == MemoryLayout<U>.size,

stdlib/public/core/UnsafeBufferPointer.swift.gyb

@@ -32,7 +32,7 @@
 // FIXME: rdar://18157434 - until this is fixed, this has to be fixed layout
 // to avoid a hang in Foundation, which has the following setup:
 // struct A { struct B { let x: UnsafeMutableBufferPointer<...> } let b: B }
-@_fixed_layout
+@_fixed_layout // unsafe-performance
 public struct Unsafe${Mutable}BufferPointer<Element> {
 
   @usableFromInline
@@ -49,12 +49,12 @@ public struct Unsafe${Mutable}BufferPointer<Element> {
 extension UnsafeBufferPointer {
   /// An iterator for the elements in the buffer referenced by an
   /// `UnsafeBufferPointer` or `UnsafeMutableBufferPointer` instance.
-  @_fixed_layout
+  @_fixed_layout // unsafe-performance
   public struct Iterator {
     @usableFromInline
     internal var _position, _end: UnsafePointer<Element>?
 
-    @inlinable
+    @inlinable // unsafe-performance
     public init(_position: UnsafePointer<Element>?, _end: UnsafePointer<Element>?) {
         self._position = _position
         self._end = _end
@@ -67,7 +67,7 @@ extension UnsafeBufferPointer.Iterator: IteratorProtocol {
   /// exists.
   ///
   /// Once `nil` has been returned, all subsequent calls return `nil`.
-  @inlinable
+  @inlinable // unsafe-performance
   public mutating func next() -> Element? {
     guard let start = _position else {
       return nil
@@ -91,7 +91,7 @@ extension Unsafe${Mutable}BufferPointer: Sequence {
   /// Returns an iterator over the elements of this buffer.
   ///
   /// - Returns: An iterator over the elements of this buffer.
-  @inlinable
+  @inlinable // unsafe-performance
   public func makeIterator() -> Iterator {
     guard let start = _position else {
       return Iterator(_position: nil, _end: nil)
@@ -104,7 +104,7 @@ extension Unsafe${Mutable}BufferPointer: Sequence {
   ///
   /// - Returns: an iterator over any remaining elements of `self` and the
   ///   number of elements initialized.
-  @inlinable // FIXME(sil-serialize-all)
+  @inlinable // unsafe-performance
   public func _copyContents(
     initializing destination: UnsafeMutableBufferPointer<Element>
   ) -> (Iterator, UnsafeMutableBufferPointer<Element>.Index) {
@@ -125,18 +125,18 @@ extension Unsafe${Mutable}BufferPointer: ${Mutable}Collection, RandomAccessColle
   ///
   /// The `startIndex` property of an `Unsafe${Mutable}BufferPointer` instance
   /// is always zero.
-  @inlinable
+  @inlinable // unsafe-performance
   public var startIndex: Int { return 0 }
 
   /// The "past the end" position---that is, the position one greater than the
   /// last valid subscript argument.
   ///
   /// The `endIndex` property of an `Unsafe${Mutable}BufferPointer` instance is
   /// always identical to `count`.
-  @inlinable
+  @inlinable // unsafe-performance
   public var endIndex: Int { return count }
 
-  @inlinable
+  @inlinable // unsafe-performance
   public func index(after i: Int) -> Int {
     // NOTE: this is a manual specialization of index movement for a Strideable
     // index that is required for UnsafeBufferPointer performance. The
@@ -146,7 +146,7 @@ extension Unsafe${Mutable}BufferPointer: ${Mutable}Collection, RandomAccessColle
     return i + 1
   }
 
-  @inlinable
+  @inlinable // unsafe-performance
   public func formIndex(after i: inout Int) {
     // NOTE: this is a manual specialization of index movement for a Strideable
     // index that is required for UnsafeBufferPointer performance. The
@@ -156,7 +156,7 @@ extension Unsafe${Mutable}BufferPointer: ${Mutable}Collection, RandomAccessColle
     i += 1
   }
 
-  @inlinable
+  @inlinable // unsafe-performance
   public func index(before i: Int) -> Int {
     // NOTE: this is a manual specialization of index movement for a Strideable
     // index that is required for UnsafeBufferPointer performance. The
@@ -166,7 +166,7 @@ extension Unsafe${Mutable}BufferPointer: ${Mutable}Collection, RandomAccessColle
     return i - 1
   }
 
-  @inlinable
+  @inlinable // unsafe-performance
   public func formIndex(before i: inout Int) {
     // NOTE: this is a manual specialization of index movement for a Strideable
     // index that is required for UnsafeBufferPointer performance. The
@@ -176,7 +176,7 @@ extension Unsafe${Mutable}BufferPointer: ${Mutable}Collection, RandomAccessColle
     i -= 1
   }
 
-  @inlinable
+  @inlinable // unsafe-performance
   public func index(_ i: Int, offsetBy n: Int) -> Int {
     // NOTE: this is a manual specialization of index movement for a Strideable
     // index that is required for UnsafeBufferPointer performance. The
@@ -186,7 +186,7 @@ extension Unsafe${Mutable}BufferPointer: ${Mutable}Collection, RandomAccessColle
     return i + n
   }
 
-  @inlinable
+  @inlinable // unsafe-performance
   public func index(_ i: Int, offsetBy n: Int, limitedBy limit: Int) -> Int? {
     // NOTE: this is a manual specialization of index movement for a Strideable
     // index that is required for UnsafeBufferPointer performance. The
@@ -200,7 +200,7 @@ extension Unsafe${Mutable}BufferPointer: ${Mutable}Collection, RandomAccessColle
     return i + n
   }
 
-  @inlinable
+  @inlinable // unsafe-performance
   public func distance(from start: Int, to end: Int) -> Int {
     // NOTE: this is a manual specialization of index movement for a Strideable
     // index that is required for UnsafeBufferPointer performance. The
@@ -210,21 +210,21 @@ extension Unsafe${Mutable}BufferPointer: ${Mutable}Collection, RandomAccessColle
     return end - start
   }
 
-  @inlinable
+  @inlinable // unsafe-performance
   public func _failEarlyRangeCheck(_ index: Int, bounds: Range<Int>) {
     // NOTE: In release mode, this method is a no-op for performance reasons.
     _debugPrecondition(index >= bounds.lowerBound)
     _debugPrecondition(index < bounds.upperBound)
   }
 
-  @inlinable
+  @inlinable // unsafe-performance
   public func _failEarlyRangeCheck(_ range: Range<Int>, bounds: Range<Int>) {
     // NOTE: In release mode, this method is a no-op for performance reasons.
     _debugPrecondition(range.lowerBound >= bounds.lowerBound)
     _debugPrecondition(range.upperBound <= bounds.upperBound)
   }
 
-  @inlinable
+  @inlinable // unsafe-performance
   public var indices: Indices {
     return startIndex..<endIndex
   }
@@ -265,7 +265,7 @@ extension Unsafe${Mutable}BufferPointer: ${Mutable}Collection, RandomAccessColle
   ///
   /// - Parameter i: The position of the element to access. `i` must be in the
   ///   range `0..<count`.
-  @inlinable
+  @inlinable // unsafe-performance
   public subscript(i: Int) -> Element {
     get {
       _debugPrecondition(i >= 0)
@@ -318,7 +318,7 @@ extension Unsafe${Mutable}BufferPointer: ${Mutable}Collection, RandomAccessColle
   ///
   /// - Parameter bounds: A range of the buffer's indices. The bounds of
   ///   the range must be valid indices of the buffer.
-  @inlinable
+  @inlinable // unsafe-performance
   public subscript(bounds: Range<Int>)
     -> Slice<Unsafe${Mutable}BufferPointer<Element>>
   {
@@ -354,7 +354,7 @@ extension Unsafe${Mutable}BufferPointer: ${Mutable}Collection, RandomAccessColle
   /// - Parameters:
   ///   - i: The index of the first value to swap.
   ///   - j: The index of the second value to swap.
-  @inlinable
+  @inlinable // unsafe-performance
   public func swapAt(_ i: Int, _ j: Int) {
     guard i != j else { return }
     _debugPrecondition(i >= 0 && j >= 0)
@@ -379,7 +379,7 @@ extension Unsafe${Mutable}BufferPointer {
   ///     `MemoryLayout<Element>.alignment`.
   ///   - count: The number of instances in the buffer. `count` must not be
   ///     negative.
-  @inlinable
+  @inlinable // unsafe-performance
   public init(start: Unsafe${Mutable}Pointer<Element>?, count: Int) {
     _precondition(
       count >= 0, "Unsafe${Mutable}BufferPointer with negative count")
@@ -390,7 +390,7 @@ extension Unsafe${Mutable}BufferPointer {
     self.count = count
   }
 
-  @inlinable
+  @inlinable // unsafe-performance
   public init(_empty: ()) {
     _position = nil
     count = 0
@@ -402,7 +402,7 @@ extension Unsafe${Mutable}BufferPointer {
   /// given immutable buffer pointer.
   ///
   /// - Parameter other: The immutable buffer pointer to convert.
-  @inlinable
+  @inlinable // unsafe-performance
   public init(mutating other: UnsafeBufferPointer<Element>) {
     _position = UnsafeMutablePointer<Element>(mutating: other._position)
     count = other.count
@@ -414,7 +414,7 @@ extension Unsafe${Mutable}BufferPointer {
   /// given mutable buffer pointer.
   ///
   /// - Parameter other: The mutable buffer pointer to convert.
-  @inlinable
+  @inlinable // unsafe-performance
   public init(_ other: UnsafeMutableBufferPointer<Element>) {
     _position = UnsafePointer<Element>(other._position)
     count = other.count
@@ -443,7 +443,7 @@ extension Unsafe${Mutable}BufferPointer {
   /// - `rebased.count == slice.count`
   ///
   /// - Parameter slice: The buffer slice to rebase.
-  @inlinable
+  @inlinable // unsafe-performance
   public init(rebasing slice: Slice<UnsafeBufferPointer<Element>>) {
     self.init(start: slice.base.baseAddress! + slice.startIndex,
       count: slice.count)
@@ -470,7 +470,7 @@ extension Unsafe${Mutable}BufferPointer {
   /// - `rebased.count == slice.count`
   ///
   /// - Parameter slice: The buffer slice to rebase.
-  @inlinable
+  @inlinable // unsafe-performance
   public init(rebasing slice: Slice<UnsafeMutableBufferPointer<Element>>) {
     self.init(
       start: slice.base.baseAddress! + slice.startIndex,
@@ -485,7 +485,7 @@ extension Unsafe${Mutable}BufferPointer {
   /// `nil`, this function does nothing. Otherwise, the memory must not be initialized 
   /// or `Pointee` must be a trivial type. This buffer pointer's `count` must 
   /// be equal to the originally allocated size of the memory block.
-  @inlinable
+  @inlinable // unsafe-performance
   public func deallocate() {
     _position?.deallocate()
   }
@@ -513,7 +513,7 @@ extension Unsafe${Mutable}BufferPointer {
   ///
   /// - Parameter count: The amount of memory to allocate, counted in instances
   ///   of `Element`. 
-  @inlinable
+  @inlinable // unsafe-performance
   public static func allocate(capacity count: Int) 
     -> UnsafeMutableBufferPointer<Element> {
     let size = MemoryLayout<Element>.stride * count
@@ -531,7 +531,7 @@ extension Unsafe${Mutable}BufferPointer {
   ///
   /// - Parameters:
   ///   - repeatedValue: The instance to initialize this buffer's memory with.
-  @inlinable
+  @inlinable // unsafe-performance
   public func initialize(repeating repeatedValue: Element) {
     guard let dstBase = _position else {
       return
@@ -551,7 +551,7 @@ extension Unsafe${Mutable}BufferPointer {
   /// Warning: All buffer elements must be initialized before calling this. 
   /// Assigning to part of the buffer must be done using the `assign(repeating:count:)`` 
   /// method on the buffer’s `baseAddress`. 
-  @inlinable
+  @inlinable // unsafe-performance
   public func assign(repeating repeatedValue: Element) {
     guard let dstBase = _position else {
       return
@@ -600,7 +600,7 @@ extension Unsafe${Mutable}BufferPointer {
   ///     value is also used as the return value for the `withMemoryRebound(to:_:)` 
   ///     method.
   /// - Returns: The return value, if any, of the `body` closure parameter.
-  @inlinable
+  @inlinable // unsafe-performance
   public func withMemoryRebound<T, Result>(
     to type: T.Type, _ body: (${Self}<T>) throws -> Result
   ) rethrows -> Result {
@@ -623,7 +623,7 @@ extension Unsafe${Mutable}BufferPointer {
   ///
   /// If the `baseAddress` of this buffer is `nil`, the count is zero. However,
   /// a buffer can have a `count` of zero even with a non-`nil` base address.
-  @inlinable
+  @inlinable // unsafe-performance
   public var baseAddress: Unsafe${Mutable}Pointer<Element>? {
     return _position
   }
@@ -660,7 +660,7 @@ extension UnsafeMutableBufferPointer {
   /// - Returns: An iterator to any elements of `source` that didn't fit in the
   ///   buffer, and an index to the point in the buffer one past the last
   ///   element written.
-  @inlinable
+  @inlinable // unsafe-performance
   public func initialize<S: Sequence>(from source: S) -> (S.Iterator, Index)
     where S.Element == Element {
     return source._copyContents(initializing: self)