mirror of
https://github.com/apple/swift.git
synced 2025-12-21 12:14:44 +01:00
4d20423e00
The new implementation has several benefits compared to the old C++ implementation: * It is significantly simpler. It optimizes each load separately instead of all at once with bit-field based dataflow. * It's using alias analysis more accurately which enables more loads to be optimized * It avoids inserting additional copies in OSSA The algorithm is a data flow analysis which starts at the original load and searches for preceding stores or loads by following the control flow in backward direction. The preceding stores and loads provide the "available values" with which the original load can be replaced.
77 lines
2.8 KiB
Swift
77 lines
2.8 KiB
Swift
// RUN: %target-swift-frontend -O -sil-verify-all -emit-sil -Xllvm '-sil-inline-never-functions=$sSa6appendyy' -Xllvm -sil-inline-never-function='$sSa6append10contentsOfyqd__n_t7ElementQyd__RszSTRd__lFSi_SaySiGTg5' %s | %FileCheck %s
|
|
// REQUIRES: swift_stdlib_no_asserts,optimized_stdlib
|
|
|
|
// This is an end-to-end test of the Array.append(contentsOf:) ->
|
|
// Array.append(Element) optimization.
|
|
//
|
|
// To check that the optimization produces the expected
|
|
// Array.append(Element) calls, the CHECK lines match those call
|
|
// sites. The optimizer may subsequently inline Array.append(Element),
|
|
// which is good, but to keep the test simple and specific to the
|
|
// optimization, the RUN line prevents inlining Array.append(Element).
|
|
// Likewise, negative tests check for the existence of
|
|
// Array.append(contentsOf:), so don't inline those either.
|
|
|
|
// CHECK-LABEL: sil {{.*}}@{{.*}}testInt
|
|
// CHECK-NOT: apply
|
|
// CHECK: [[F:%[0-9]+]] = function_ref @$sSa6appendyyxnFSi_Tg5
|
|
// CHECK-NOT: apply
|
|
// CHECK: apply [[F]]
|
|
// CHECK-NEXT: tuple
|
|
// CHECK-NEXT: return
|
|
public func testInt(_ a: inout [Int]) {
|
|
a += [1]
|
|
}
|
|
|
|
// CHECK-LABEL: sil {{.*}}@{{.*}}testThreeInts
|
|
// CHECK-DAG: [[F:%[0-9]+]] = function_ref @$sSa6appendyyxnFSi_Tg5
|
|
// CHECK-DAG: apply [[F]]
|
|
// CHECK-DAG: apply [[F]]
|
|
// CHECK-DAG: apply [[F]]
|
|
// CHECK: } // end sil function '{{.*}}testThreeInts{{.*}}'
|
|
public func testThreeInts(_ a: inout [Int]) {
|
|
a += [1, 2, 3]
|
|
}
|
|
|
|
// CHECK-LABEL: sil {{.*}}@{{.*}}testTooManyInts
|
|
// CHECK-NOT: apply
|
|
// CHECK: [[F:%[0-9]+]] = function_ref @${{.*append.*contentsOf.*}}
|
|
// CHECK-NOT: apply
|
|
// CHECK: apply [[F]]
|
|
// CHECK-NOT: apply
|
|
// CHECK: return
|
|
public func testTooManyInts(_ a: inout [Int]) {
|
|
a += [1, 2, 3, 4, 5, 6, 7]
|
|
}
|
|
|
|
// CHECK-LABEL: sil {{.*}}@{{.*}}testString
|
|
// CHECK-NOT: apply
|
|
// CHECK: [[F:%[0-9]+]] = function_ref @$sSa6appendyyxnFSS_Tg5
|
|
// CHECK-NOT: apply
|
|
// CHECK: apply [[F]]
|
|
// CHECK-NOT: apply
|
|
// CHECK: tuple
|
|
// CHECK-NEXT: return
|
|
public func testString(_ a: inout [String], s: String) {
|
|
a += [s]
|
|
}
|
|
|
|
// This is not supported yet. Just check that we don't crash on this.`
|
|
public func dontPropagateContiguousArray(_ a: inout ContiguousArray<UInt8>) {
|
|
a += [4]
|
|
}
|
|
|
|
// Check if the specialized Array.append<A>(contentsOf:) is reasonably optimized for Array<Int>.
|
|
|
|
// CHECK-LABEL: sil shared {{.*}}@$sSa6append10contentsOfyqd__n_t7ElementQyd__RszSTRd__lFSi_SaySiGTg5
|
|
|
|
// There should only be a single call to _createNewBuffer or reserveCapacityForAppend/reserveCapacityImpl.
|
|
|
|
// CHECK-NOT: apply
|
|
// CHECK: [[F:%[0-9]+]] = function_ref @{{.*(_consumeAndCreateNew|reserveCapacity).*}}
|
|
// CHECK: apply [[F]]
|
|
// CHECK-NOT: apply
|
|
|
|
// CHECK-LABEL: } // end sil function '$sSa6append10contentsOfyqd__n_t7ElementQyd__RszSTRd__lFSi_SaySiGTg5
|
|
|