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 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400
|
//===--- CopyToBorrowOptimization.swift ------------------------------------==//
//
// This source file is part of the Swift.org open source project
//
// Copyright (c) 2014 - 2024 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
/// 1. replaces a `load [copy]` with a `load_borrow` if possible:
///
/// ```
/// %1 = load [copy] %0
/// // no writes to %0
/// destroy_value %1
/// ```
/// ->
/// ```
/// %1 = load_borrow %0
/// // no writes to %0
/// end_borrow %1
/// ```
///
/// 2. removes a `copy_value` where the source is a guaranteed value, if possible:
///
/// ```
/// %1 = copy_value %0 // %0 = a guaranteed value
/// // uses of %1
/// destroy_value %1 // borrow scope of %0 is still valid here
/// ```
/// ->
/// ```
/// // uses of %0
/// ```
/// The optimization can be done if:
/// * In caseof a `load`: during the (forward-extended) lifetime of the loaded value the
/// memory location is not changed.
/// * In case of a `copy_value`: the (guaranteed) lifetime of the source operand extends
/// the lifetime of the copied value.
/// * All (forward-extended) uses of the load or copy support guaranteed ownership.
/// * The (forward-extended) lifetime of the load or copy ends with `destroy_value`(s).
///
let copyToBorrowOptimization = FunctionPass(name: "copy-to-borrow-optimization") {
(function: Function, context: FunctionPassContext) in
if !function.hasOwnership {
return
}
for inst in function.instructions {
switch inst {
case let load as LoadInst:
optimize(load: load, context)
case let copy as CopyValueInst:
optimize(copy: copy, context)
default:
break
}
}
}
private func optimize(load: LoadInst, _ context: FunctionPassContext) {
if load.loadOwnership != .copy {
return
}
var collectedUses = Uses(context)
defer { collectedUses.deinitialize() }
if !collectedUses.collectUses(of: load) {
return
}
if mayWrite(toAddressOf: load,
within: collectedUses.destroys,
usersInDeadEndBlocks: collectedUses.usersInDeadEndBlocks,
context)
{
return
}
load.replaceWithLoadBorrow(collectedUses: collectedUses)
}
private func optimize(copy: CopyValueInst, _ context: FunctionPassContext) {
if copy.fromValue.ownership != .guaranteed {
return
}
var collectedUses = Uses(context)
defer { collectedUses.deinitialize() }
if !collectedUses.collectUses(of: copy) {
return
}
var liverange = InstructionRange(begin: copy, context)
defer { liverange.deinitialize() }
liverange.insert(contentsOf: collectedUses.destroys)
liverange.insert(contentsOf: collectedUses.usersInDeadEndBlocks)
if !liverange.isFullyContainedIn(borrowScopeOf: copy.fromValue.lookThroughForwardingInstructions) {
return
}
remove(copy: copy, collectedUses: collectedUses, liverange: liverange)
}
private struct Uses {
let context: FunctionPassContext
// Operand of all forwarding instructions, which - if possible - are converted from "owned" to "guaranteed"
private(set) var forwardingUses: Stack<Operand>
// All destroys of the load/copy_value and its forwarded values.
private(set) var destroys: Stack<DestroyValueInst>
// Exit blocks of the load/copy_value's liverange which don't have a destroy.
// Those are successor blocks of terminators, like `switch_enum`, which do _not_ forward the value.
// E.g. the none-case of a switch_enum of an Optional.
private(set) var nonDestroyingLiverangeExits: Stack<Instruction>
private(set) var usersInDeadEndBlocks: Stack<Instruction>
init(_ context: FunctionPassContext) {
self.context = context
self.forwardingUses = Stack(context)
self.destroys = Stack(context)
self.nonDestroyingLiverangeExits = Stack(context)
self.usersInDeadEndBlocks = Stack(context)
}
mutating func collectUses(of initialValue: SingleValueInstruction) -> Bool {
var worklist = ValueWorklist(context)
defer { worklist.deinitialize() }
// If the load/copy_value is immediately followed by a single `move_value`, use the moved value.
// Note that `move_value` is _not_ a forwarding instruction.
worklist.pushIfNotVisited(initialValue.singleMoveValueUser ?? initialValue)
while let value = worklist.pop() {
for use in value.uses.endingLifetime {
switch use.instruction {
case let destroy as DestroyValueInst:
destroys.append(destroy)
case let forwardingInst as ForwardingInstruction where forwardingInst.canChangeToGuaranteedOwnership:
forwardingUses.append(use)
findNonDestroyingLiverangeExits(of: forwardingInst)
worklist.pushIfNotVisited(contentsOf: forwardingInst.forwardedResults.lazy.filter { $0.ownership == .owned})
default:
return false
}
}
// Get potential additional uses in dead-end blocks for which a final destroy is missing.
// In such a case the dataflow would _not_ visit potential writes to the load's memory location.
// In the following example, the `load [copy]` must not be converted to a `load_borrow`:
//
// %1 = load [copy] %0
// ...
// store %2 to %0
// ...
// use of %1 // additional use: the lifetime of %1 ends here
// ... // no destroy of %1!
// unreachable
//
// TODO: we can remove this once with have completed OSSA lifetimes throughout the SIL pipeline.
findAdditionalUsesInDeadEndBlocks(of: value)
}
return true
}
private mutating func findNonDestroyingLiverangeExits(of forwardingInst: ForwardingInstruction) {
if let termInst = forwardingInst as? TermInst {
// A terminator instruction can implicitly end the lifetime of its operand in a success block,
// e.g. a `switch_enum` with a non-payload case block. Such success blocks need an `end_borrow`, though.
for succ in termInst.successors where !succ.arguments.contains(where: {$0.ownership == .owned}) {
nonDestroyingLiverangeExits.append(succ.instructions.first!)
}
} else if !forwardingInst.forwardedResults.contains(where: { $0.ownership == .owned }) {
// The forwarding instruction has no owned result, which means it ends the lifetime of its owned operand.
// This can happen with an `unchecked_enum_data` which extracts a trivial payload out of a
// non-trivial enum.
nonDestroyingLiverangeExits.append(forwardingInst.next!)
}
}
private mutating func findAdditionalUsesInDeadEndBlocks(of value: Value) {
var users = Stack<Instruction>(context)
defer { users.deinitialize() }
// Finds all uses except destroy_value.
var visitor = InteriorUseWalker(definingValue: value, ignoreEscape: true, visitInnerUses: true, context) {
let user = $0.instruction
if !(user is DestroyValueInst) {
users.append(user)
}
return .continueWalk
}
defer { visitor.deinitialize() }
_ = visitor.visitUses()
usersInDeadEndBlocks.append(contentsOf: users)
}
mutating func deinitialize() {
forwardingUses.deinitialize()
destroys.deinitialize()
nonDestroyingLiverangeExits.deinitialize()
usersInDeadEndBlocks.deinitialize()
}
}
private func mayWrite(
toAddressOf load: LoadInst,
within destroys: Stack<DestroyValueInst>,
usersInDeadEndBlocks: Stack<Instruction>,
_ context: FunctionPassContext
) -> Bool {
let aliasAnalysis = context.aliasAnalysis
var worklist = InstructionWorklist(context)
defer { worklist.deinitialize() }
for destroy in destroys {
worklist.pushPredecessors(of: destroy, ignoring: load)
}
worklist.pushIfNotVisited(contentsOf: usersInDeadEndBlocks)
// Visit all instructions starting from the destroys in backward order.
while let inst = worklist.pop() {
if inst.mayWrite(toAddress: load.address, aliasAnalysis) {
return true
}
worklist.pushPredecessors(of: inst, ignoring: load)
}
return false
}
private extension LoadInst {
func replaceWithLoadBorrow(collectedUses: Uses) {
let context = collectedUses.context
let builder = Builder(before: self, context)
let loadBorrow = builder.createLoadBorrow(fromAddress: address)
var liverange = InstructionRange(begin: self, ends: collectedUses.destroys, context)
defer { liverange.deinitialize() }
replaceMoveWithBorrow(of: self, replacedBy: loadBorrow, liverange: liverange, collectedUses: collectedUses)
createEndBorrows(for: loadBorrow, atEndOf: liverange, collectedUses: collectedUses)
uses.replaceAll(with: loadBorrow, context)
context.erase(instruction: self)
for forwardingUse in collectedUses.forwardingUses {
forwardingUse.changeOwnership(from: .owned, to: .guaranteed, context)
}
context.erase(instructions: collectedUses.destroys)
}
}
private func remove(copy: CopyValueInst, collectedUses: Uses, liverange: InstructionRange) {
let context = collectedUses.context
replaceMoveWithBorrow(of: copy, replacedBy: copy.fromValue, liverange: liverange, collectedUses: collectedUses)
copy.replace(with: copy.fromValue, context)
for forwardingUse in collectedUses.forwardingUses {
forwardingUse.changeOwnership(from: .owned, to: .guaranteed, context)
}
context.erase(instructions: collectedUses.destroys)
}
// Handle the special case if the `load` or `copy_value` is immediately followed by a single `move_value`.
// In this case we have to preserve the move's flags by inserting a `begin_borrow` with the same flags.
// For example:
//
// %1 = load [copy] %0
// %2 = move_value [lexical] %1
// ...
// destroy_value %2
// ->
// %1 = load_borrow %0
// %2 = begin_borrow [lexical] %1
// ...
// end_borrow %2
// end_borrow %1
//
private func replaceMoveWithBorrow(
of value: Value,
replacedBy newValue: Value,
liverange: InstructionRange,
collectedUses: Uses
) {
guard let moveInst = value.singleMoveValueUser else {
return
}
let context = collectedUses.context
// An inner borrow is needed to keep the flags of the `move_value`.
let builder = Builder(before: moveInst, context)
let bbi = builder.createBeginBorrow(of: newValue,
isLexical: moveInst.isLexical,
hasPointerEscape: moveInst.hasPointerEscape,
isFromVarDecl: moveInst.isFromVarDecl)
moveInst.replace(with: bbi, context)
createEndBorrows(for: bbi, atEndOf: liverange, collectedUses: collectedUses)
}
private func createEndBorrows(for beginBorrow: Value, atEndOf liverange: InstructionRange, collectedUses: Uses) {
let context = collectedUses.context
// There can be multiple destroys in a row in case of decomposing an aggregate, e.g.
// %1 = load [copy] %0
// ...
// (%2, %3) = destructure_struct %1
// destroy_value %2
// destroy_value %3 // The final destroy. Here we need to create the `end_borrow`(s)
//
var allLifetimeEndingInstructions = InstructionWorklist(context)
allLifetimeEndingInstructions.pushIfNotVisited(contentsOf: collectedUses.destroys.lazy.map { $0 })
allLifetimeEndingInstructions.pushIfNotVisited(contentsOf: collectedUses.nonDestroyingLiverangeExits)
defer {
allLifetimeEndingInstructions.deinitialize()
}
while let endInst = allLifetimeEndingInstructions.pop() {
if !liverange.contains(endInst) {
let builder = Builder(before: endInst, context)
builder.createEndBorrow(of: beginBorrow)
}
}
}
private extension InstructionRange {
func isFullyContainedIn(borrowScopeOf value: Value) -> Bool {
guard let beginBorrow = BeginBorrowValue(value.lookThroughForwardingInstructions) else {
return false
}
if case .functionArgument = beginBorrow {
// The lifetime of a guaranteed function argument spans over the whole function.
return true
}
for endOp in beginBorrow.scopeEndingOperands {
if self.contains(endOp.instruction) {
return false
}
}
return true
}
}
private extension Value {
var singleMoveValueUser: MoveValueInst? {
uses.ignoreDebugUses.singleUse?.instruction as? MoveValueInst
}
var lookThroughForwardingInstructions: Value {
if let bfi = definingInstruction as? BorrowedFromInst,
!bfi.borrowedPhi.isReborrow,
bfi.enclosingValues.count == 1
{
// Return the single forwarded enclosingValue
return bfi.enclosingValues[0]
}
if let fi = definingInstruction as? ForwardingInstruction,
let forwardedOp = fi.singleForwardedOperand
{
return forwardedOp.value.lookThroughForwardingInstructions
} else if let termResult = TerminatorResult(self),
let fi = termResult.terminator as? ForwardingInstruction,
let forwardedOp = fi.singleForwardedOperand
{
return forwardedOp.value.lookThroughForwardingInstructions
}
return self
}
}
private extension ForwardingInstruction {
var canChangeToGuaranteedOwnership: Bool {
if !preservesReferenceCounts {
return false
}
if !canForwardGuaranteedValues {
return false
}
// For simplicity only support a single owned operand. Otherwise we would have to check if the other
// owned operands stem from `load_borrow`s, too, which we can convert, etc.
let numOwnedOperands = operands.lazy.filter({ $0.value.ownership == .owned }).count
if numOwnedOperands > 1 {
return false
}
return true
}
}
|