mirror of
https://github.com/apple/swift.git
synced 2025-12-14 20:36:38 +01:00
This should help to optimize the range check in isValidSubscript to a single unsigned integer comparison. But this is not done yet, because it also needs an optimization in llvm, which I'm currently working on. Together with the llvm change there will be an performance improvement for array benchmarks, where the range check cannot be hoisted out of a loop. E.g. ~ +30% on QuickSort. Swift SVN r23583
85 lines
2.6 KiB
Swift
85 lines
2.6 KiB
Swift
//===--- ArrayBody.swift - Data needed once per array ---------------------===//
|
|
//
|
|
// This source file is part of the Swift.org open source project
|
|
//
|
|
// Copyright (c) 2014 - 2015 Apple Inc. and the Swift project authors
|
|
// Licensed under Apache License v2.0 with Runtime Library Exception
|
|
//
|
|
// See http://swift.org/LICENSE.txt for license information
|
|
// See http://swift.org/CONTRIBUTORS.txt for the list of Swift project authors
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// Array storage begins with a Body and ends with a sequence of
|
|
// contiguous Elements. This struct describes the Body part.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
import SwiftShims
|
|
|
|
internal struct _ArrayBody {
|
|
var _storage: _SwiftArrayBodyStorage
|
|
|
|
init(count: Int, capacity: Int, elementTypeIsBridgedVerbatim: Bool = false) {
|
|
_sanityCheck(count >= 0)
|
|
_sanityCheck(capacity >= 0)
|
|
|
|
_storage = _SwiftArrayBodyStorage(
|
|
count: count,
|
|
_capacityAndFlags:
|
|
(UInt(capacity) << 1) | (elementTypeIsBridgedVerbatim ? 1 : 0))
|
|
}
|
|
|
|
/// In principle CountAndCapacity shouldn't need to be default
|
|
/// constructed, but since we want to claim all the allocated
|
|
/// capacity after a new buffer is allocated, it's typical to want
|
|
/// to update it immediately after construction.
|
|
init() {
|
|
_storage = _SwiftArrayBodyStorage(count: 0, _capacityAndFlags: 0)
|
|
}
|
|
|
|
/// The number of elements stored in this Array
|
|
var count: Int {
|
|
get {
|
|
return _assumeNonNegative(_storage.count)
|
|
}
|
|
set(newCount) {
|
|
_storage.count = newCount
|
|
}
|
|
}
|
|
|
|
/// The number of elements that can be stored in this Array without
|
|
/// reallocation.
|
|
var capacity: Int {
|
|
return Int(_capacityAndFlags >> 1)
|
|
}
|
|
|
|
/// Is the Element type bitwise-compatible with some Objective-C
|
|
/// class? The answer is---in principle---statically-knowable, but
|
|
/// I don't expect to be able to get this information to the
|
|
/// optimizer before 1.0 ships, so we store it in a bit here to
|
|
/// avoid the cost of calls into the runtime that compute the
|
|
/// answer.
|
|
var elementTypeIsBridgedVerbatim: Bool {
|
|
get {
|
|
return (_capacityAndFlags & 0x1) != 0
|
|
}
|
|
set {
|
|
_capacityAndFlags
|
|
= newValue ? _capacityAndFlags | 1 : _capacityAndFlags & ~1
|
|
}
|
|
}
|
|
|
|
/// Storage optimization: compresses capacity and
|
|
/// elementTypeIsBridgedVerbatim together.
|
|
var _capacityAndFlags: UInt {
|
|
get {
|
|
return _storage._capacityAndFlags
|
|
}
|
|
set {
|
|
_storage._capacityAndFlags = newValue
|
|
}
|
|
}
|
|
}
|
|
|