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
|
//===--- IndexPathTest.swift ----------------------------------------------===//
//
// This source file is part of the Swift.org open source project
//
// Copyright (c) 2020 - 2021 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
// See https://swift.org/CONTRIBUTORS.txt for the list of Swift project authors
//
//===----------------------------------------------------------------------===//
import Foundation
import TestsUtils
let size = 200
let increasingIndexPath = indexPath(size)
let decreasingIndexPath = indexPath(size, reversed: true)
let increasingMaxMiddleIndexPath = indexPath(size, middle: size + 1)
let increasingMinMiddleIndexPath = indexPath(size, middle: -1)
let tags: [BenchmarkCategory] = [.validation, .api, .IndexPath]
public let benchmarks = [
BenchmarkInfo(
name: "IndexPath.Subscript.Mutation",
runFunction: run_IndexPathSubscriptMutation,
tags: tags,
setUpFunction: { blackHole(increasingIndexPath) }),
BenchmarkInfo(
name: "IndexPath.Subscript.Range.Mutation",
runFunction: run_IndexPathSubscriptRangeMutation,
tags: tags,
setUpFunction: { blackHole(increasingIndexPath) }),
BenchmarkInfo(
name: "IndexPath.Max",
runFunction: run_IndexPathMax,
tags: tags,
setUpFunction: {
blackHole(decreasingIndexPath)
blackHole(increasingMaxMiddleIndexPath)
blackHole(increasingIndexPath)
}),
BenchmarkInfo(
name: "IndexPath.Min",
runFunction: run_IndexPathMin,
tags: tags,
setUpFunction: {
blackHole(increasingIndexPath)
blackHole(increasingMinMiddleIndexPath)
blackHole(decreasingIndexPath)
}),
]
func indexPath(_ size: Int, reversed: Bool = false) -> IndexPath {
let indexes = Array(0..<size)
return IndexPath(indexes: reversed ? indexes.reversed() : indexes)
}
func indexPath(_ size: Int, middle: Int) -> IndexPath {
var indexes = Array(0..<size)
indexes.insert(middle, at: (indexes.count - 1) / 2)
return IndexPath(indexes: indexes)
}
// Subscript Mutations
@inline(__always)
func subscriptMutation(
n: Int,
mutations: Int,
indexPath: IndexPath,
mutate: (inout IndexPath, Int) -> Void
) {
for _ in 0..<n {
for i in 0..<mutations {
var ip = indexPath
mutate(&ip, i)
}
}
}
@inline(never)
public func run_IndexPathSubscriptMutation(_ n: Int) {
subscriptMutation(
n: n * 10, mutations: size, indexPath: increasingIndexPath,
mutate: { ip, i in
ip[i % 4] += 1
})
}
@inline(never)
public func run_IndexPathSubscriptRangeMutation(_ n: Int) {
subscriptMutation(
n: n, mutations: size, indexPath: increasingIndexPath,
mutate: { ip, i in
ip[0..<i] += [i]
})
}
// Max
@inline(never)
public func run_IndexPathMax(_ n: Int) {
for _ in 0..<n * 10 {
var val: Int?
// Beginning max
val = decreasingIndexPath.max()
blackHole(val)
// Middle max
val = increasingMaxMiddleIndexPath.max()
blackHole(val)
// End max
val = increasingIndexPath.max()
blackHole(val)
}
}
// Min
@inline(never)
public func run_IndexPathMin(_ n: Int) {
for _ in 0..<n * 10 {
var val: Int?
// Beginning min
val = increasingIndexPath.min()
blackHole(val)
// Middle min
val = increasingMinMiddleIndexPath.min()
blackHole(val)
// End min
val = decreasingIndexPath.min()
blackHole(val)
}
}
|
