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
|
//===--- Set.swift - sets for basic blocks, values and instructions -------===//
//
// This source file is part of the Swift.org open source project
//
// Copyright (c) 2014 - 2022 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 SIL
import OptimizerBridging
protocol IntrusiveSet : CustomStringConvertible, NoReflectionChildren {
associatedtype Element
init(_ context: some Context)
mutating func insert(_ element: Element) -> Bool
mutating func erase(_ element: Element)
func contains(_ element: Element) -> Bool
mutating func deinitialize()
}
/// A set of basic blocks.
///
/// This is an extremely efficient implementation which does not need memory
/// allocations or hash lookups.
///
/// This type should be a move-only type, but unfortunately we don't have move-only
/// types yet. Therefore it's needed to call `deinitialize()` explicitly to
/// destruct this data structure, e.g. in a `defer {}` block.
struct BasicBlockSet : IntrusiveSet {
private let context: BridgedPassContext
private let bridged: BridgedBasicBlockSet
init(_ context: some Context) {
self.context = context._bridged
self.bridged = self.context.allocBasicBlockSet()
}
func contains(_ block: BasicBlock) -> Bool {
bridged.contains(block.bridged)
}
/// Returns true if `block` was not contained in the set before inserting.
@discardableResult
mutating func insert(_ block: BasicBlock) -> Bool {
bridged.insert(block.bridged)
}
mutating func erase(_ block: BasicBlock) {
bridged.erase(block.bridged)
}
var description: String {
let function = bridged.getFunction().function
let blockNames = function.blocks.enumerated().filter { contains($0.1) }
.map { "bb\($0.0)"}
return "{" + blockNames.joined(separator: ", ") + "}"
}
/// TODO: once we have move-only types, make this a real deinit.
mutating func deinitialize() {
context.freeBasicBlockSet(bridged)
}
}
/// A set of values.
///
/// This is an extremely efficient implementation which does not need memory
/// allocations or hash lookups.
///
/// This type should be a move-only type, but unfortunately we don't have move-only
/// types yet. Therefore it's needed to call `deinitialize()` explicitly to
/// destruct this data structure, e.g. in a `defer {}` block.
struct ValueSet : IntrusiveSet {
private let context: BridgedPassContext
private let bridged: BridgedNodeSet
init(_ context: some Context) {
self.context = context._bridged
self.bridged = self.context.allocNodeSet()
}
func contains(_ value: Value) -> Bool {
bridged.containsValue(value.bridged)
}
/// Returns true if `value` was not contained in the set before inserting.
@discardableResult
mutating func insert(_ value: Value) -> Bool {
bridged.insertValue(value.bridged)
}
mutating func erase(_ value: Value) {
bridged.eraseValue(value.bridged)
}
var description: String {
let function = bridged.getFunction().function
var d = "{\n"
for block in function.blocks {
for arg in block.arguments {
if contains(arg) {
d += arg.description
}
}
for inst in block.instructions {
for result in inst.results {
if contains(result) {
d += result.description
}
}
}
}
d += "}\n"
return d
}
/// TODO: once we have move-only types, make this a real deinit.
mutating func deinitialize() {
context.freeNodeSet(bridged)
}
}
/// A set of instructions.
///
/// This is an extremely efficient implementation which does not need memory
/// allocations or hash lookups.
///
/// This type should be a move-only type, but unfortunately we don't have move-only
/// types yet. Therefore it's needed to call `deinitialize()` explicitly to
/// destruct this data structure, e.g. in a `defer {}` block.
struct InstructionSet : IntrusiveSet {
private let context: BridgedPassContext
private let bridged: BridgedNodeSet
init(_ context: some Context) {
self.context = context._bridged
self.bridged = self.context.allocNodeSet()
}
func contains(_ inst: Instruction) -> Bool {
bridged.containsInstruction(inst.bridged)
}
/// Returns true if `inst` was not contained in the set before inserting.
@discardableResult
mutating func insert(_ inst: Instruction) -> Bool {
bridged.insertInstruction(inst.bridged)
}
mutating func erase(_ inst: Instruction) {
bridged.eraseInstruction(inst.bridged)
}
var description: String {
let function = bridged.getFunction().function
var d = "{\n"
for inst in function.instructions {
if contains(inst) {
d += inst.description
}
}
d += "}\n"
return d
}
/// TODO: once we have move-only types, make this a real deinit.
mutating func deinitialize() {
context.freeNodeSet(bridged)
}
}
|
