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 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663
|
//===--- OSSALifetimeCompletion.cpp ---------------------------------------===//
//
// This source file is part of the Swift.org open source project
//
// Copyright (c) 2014 - 2023 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
//
//===----------------------------------------------------------------------===//
///
/// OSSA lifetime completion adds lifetime ending instructions to make
/// linear lifetimes complete.
///
/// Interior liveness handles the following cases naturally:
///
/// When completing the lifetime of the initial value, %v1, transitively
/// include all uses of dominated reborrows as, such as %phi1 in this example:
///
/// %v1 = ...
/// cond_br bb1, bb2
/// bb1:
/// %b1 = begin_borrow %v1
/// br bb3(%b1)
/// bb2:
/// %b2 = begin_borrow %v1
/// br bb3(%b2)
/// bb3(%phi1):
/// %u1 = %phi1
/// end_borrow %phi1
/// %k1 = destroy_value %v1 // must be below end_borrow %phi1
///
/// When completing the lifetime for a phi (%phi2) transitively include all
/// uses of inner adjacent reborrows, such as %phi1 in this example:
///
/// bb1:
/// %v1 = ...
/// %b1 = begin_borrow %v1
/// br bb3(%b1, %v1)
/// bb2:
/// %v2 = ...
/// %b2 = begin_borrow %v2
/// br bb3(%b2, %v2)
/// bb3(%phi1, %phi2):
/// %u1 = %phi1
/// end_borrow %phi1
/// %k1 = destroy_value %phi1
///
//===----------------------------------------------------------------------===//
#include "swift/SIL/OSSALifetimeCompletion.h"
#include "swift/Basic/Assertions.h"
#include "swift/SIL/AddressWalker.h"
#include "swift/SIL/BasicBlockUtils.h"
#include "swift/SIL/SILBuilder.h"
#include "swift/SIL/SILFunction.h"
#include "swift/SIL/SILInstruction.h"
#include "swift/SIL/Test.h"
#include "llvm/ADT/STLExtras.h"
using namespace swift;
// FIXME: remove this option after fixing:
// rdar://145994924 (Mem2Reg calls lifetime completion without checking for
// pointer escapes)
llvm::cl::opt<bool> VerifyLifetimeCompletion(
"verify-lifetime-completion", llvm::cl::init(false),
llvm::cl::desc("."));
static SILInstruction *endOSSALifetime(SILValue value,
OSSALifetimeCompletion::LifetimeEnd end,
SILBuilder &builder,
DeadEndBlocks &deb) {
auto loc =
RegularLocation::getAutoGeneratedLocation(builder.getInsertionPointLoc());
if (end == OSSALifetimeCompletion::LifetimeEnd::Loop) {
return builder.createExtendLifetime(loc, value);
}
auto isDeadEnd = IsDeadEnd_t(deb.isDeadEnd(builder.getInsertionBB()));
if (value->getOwnershipKind() == OwnershipKind::Owned) {
if (value->getType().is<SILBoxType>()) {
return builder.createDeallocBox(loc, value, isDeadEnd);
}
return builder.createDestroyValue(loc, value, DontPoisonRefs, isDeadEnd);
}
if (auto scopedAddress = ScopedAddressValue(value)) {
return scopedAddress.createScopeEnd(builder.getInsertionPoint(), loc);
}
if (value->getOwnershipKind() == OwnershipKind::None) {
return builder.createExtendLifetime(loc, value);
}
return builder.createEndBorrow(loc, lookThroughBorrowedFromUser(value));
}
static bool endLifetimeAtLivenessBoundary(SILValue value,
const SSAPrunedLiveness &liveness,
DeadEndBlocks &deb) {
PrunedLivenessBoundary boundary;
liveness.computeBoundary(boundary);
bool changed = false;
for (SILInstruction *lastUser : boundary.lastUsers) {
if (liveness.isInterestingUser(lastUser)
!= PrunedLiveness::LifetimeEndingUse) {
changed = true;
SILBuilderWithScope::insertAfter(lastUser, [value,
&deb](SILBuilder &builder) {
endOSSALifetime(value, OSSALifetimeCompletion::LifetimeEnd::Boundary,
builder, deb);
});
}
}
for (SILBasicBlock *edge : boundary.boundaryEdges) {
changed = true;
SILBuilderWithScope builder(edge->begin());
endOSSALifetime(value, OSSALifetimeCompletion::LifetimeEnd::Boundary,
builder, deb);
}
for (SILNode *deadDef : boundary.deadDefs) {
SILInstruction *next = nullptr;
if (auto *deadInst = dyn_cast<SILInstruction>(deadDef)) {
next = deadInst->getNextInstruction();
} else {
next = cast<ValueBase>(deadDef)->getNextInstruction();
}
changed = true;
SILBuilderWithScope builder(next);
endOSSALifetime(value, OSSALifetimeCompletion::LifetimeEnd::Boundary,
builder, deb);
}
return changed;
}
static void visitUsersOutsideLinearLivenessBoundary(
SILValue value, const SSAPrunedLiveness &liveness,
llvm::function_ref<void(SILInstruction *)> visitor) {
if (value->getOwnershipKind() == OwnershipKind::None) {
return;
}
LinearLiveness linearLiveness(value);
linearLiveness.compute();
for (auto pair : liveness.getAllUsers()) {
if (pair.second.isEnding() || isa<ExtendLifetimeInst>(pair.first)) {
continue;
}
auto *user = pair.first;
if (linearLiveness.getLiveness().isWithinBoundary(
user, /*deadEndBlocks=*/nullptr)) {
continue;
}
visitor(user);
}
}
namespace swift::test {
// Arguments:
// - SILValue: value
// Dumps:
// - the instructions outside the liveness boundary
static FunctionTest LivenessPartialBoundaryOutsideUsersTest(
"liveness_partial_boundary_outside_users",
[](auto &function, auto &arguments, auto &test) {
SILValue value = arguments.takeValue();
InteriorLiveness liveness(value);
liveness.compute(test.getDominanceInfo());
visitUsersOutsideLinearLivenessBoundary(
value, liveness.getLiveness(),
[](auto *inst) { inst->print(llvm::outs()); });
});
} // end namespace swift::test
namespace {
/// Visits the latest instructions at which `value` is available.
///
/// Together with visitUsersOutsideLinearLivenessBoundary, implements
/// OSSALifetimeCompletion::visitAvailabilityBoundary.
///
/// Finding these positions is a three step process:
/// 1) computeRegion: Forward CFG walk from non-lifetime-ending boundary to find
/// the dead-end region in which the value might be available.
/// 2) propagateAvailability: Forward iterative dataflow within the region to
/// determine which blocks the value is available in.
/// 3) visitAvailabilityBoundary: Visits the final blocks in the region where
/// the value is available--these are the blocks
/// without successors or with at least one
/// unavailable successor.
class AvailabilityBoundaryVisitor {
/// The value whose dead-end block lifetime ends are to be visited.
SILValue value;
/// The non-lifetime-ending boundary of `value`.
BasicBlockSet starts;
/// The region between (inclusive) the `starts` and the unreachable blocks.
BasicBlockSetVector region;
public:
AvailabilityBoundaryVisitor(SILValue value)
: value(value), starts(value->getFunction()),
region(value->getFunction()) {}
using Visit = llvm::function_ref<void(SILInstruction *,
OSSALifetimeCompletion::LifetimeEnd)>;
struct Result;
/// Do all three steps at once.
void visit(const SSAPrunedLiveness &liveness, Result &result, Visit visit);
private:
/// Region discovery.
///
/// Forward CFG walk from non-lifetime-ending boundary to unreachable
/// instructions.
void computeRegion(const SSAPrunedLiveness &liveness);
/// Iterative dataflow to determine availability for each block in `region`.
void propagateAvailablity(Result &result);
/// Visit the terminators of blocks on the boundary of availability.
void visitAvailabilityBoundary(Result const &result, Visit visit);
struct State {
enum Value : uint8_t {
Unavailable = 0,
Available,
Unknown,
};
Value value;
State(Value value) : value(value){};
operator Value() const { return value; }
State meet(State const other) const {
return *this < other ? *this : other;
}
};
public:
struct Result {
BasicBlockBitfield states;
Result(SILFunction *function) : states(function, 2) {}
State getState(SILBasicBlock *block) const {
return {(State::Value)states.get(block)};
}
void setState(SILBasicBlock *block, State newState) {
states.set(block, (unsigned)newState.value);
}
/// Propagate predecessors' state into `block`.
///
/// states[block] ∧= state[predecessor_1] ∧ ... ∧ state[predecessor_n]
bool updateState(SILBasicBlock *block) {
auto oldState = getState(block);
auto state = oldState;
for (auto *predecessor : block->getPredecessorBlocks()) {
state = state.meet(getState(predecessor));
}
setState(block, state);
return state != oldState;
}
};
};
void AvailabilityBoundaryVisitor::visit(const SSAPrunedLiveness &liveness,
Result &result, Visit visit) {
computeRegion(liveness);
propagateAvailablity(result);
visitAvailabilityBoundary(result, visit);
}
void AvailabilityBoundaryVisitor::computeRegion(
const SSAPrunedLiveness &liveness) {
// (1) Compute the complete liveness boundary.
PrunedLivenessBlockBoundary boundary;
liveness.computeBoundary(boundary);
BasicBlockSet consumingBlocks(value->getFunction());
liveness.visitUsers(
[&consumingBlocks](auto *instruction, auto lifetimeEnding) {
if (lifetimeEnding.isEnding()) {
consumingBlocks.insert(instruction->getParent());
}
});
// Used in the forward walk below (3).
BasicBlockWorklist regionWorklist(value->getFunction());
// (2) Collect the non-lifetime-ending liveness boundary. This is the
// portion of `boundary` consisting of:
// - non-lifetime-ending instructions (their parent blocks)
// - boundary edges
// - dead defs (their parent blocks)
auto collect = [&](SILBasicBlock *block) {
// `region` consists of the non-lifetime-ending boundary and all its
// iterative successors.
region.insert(block);
// `starts` just consists of the blocks in the non-lifetime-ending
// boundary.
starts.insert(block);
// The forward walk begins from the non-lifetime-ending boundary.
regionWorklist.push(block);
};
// Trivial values that correspond to local variables (as opposed to
// ScopedAddresses) are available only up to their last extend_lifetime on
// non-dead-end paths. They cannot be consumed, but are only "available" up to
// the end of their scope.
if (value->getOwnershipKind() != OwnershipKind::None
|| ScopedAddressValue(value)) {
for (auto *endBlock : boundary.endBlocks) {
if (!consumingBlocks.contains(endBlock)) {
collect(endBlock);
}
}
}
for (SILBasicBlock *edge : boundary.boundaryEdges) {
collect(edge);
}
// (3) Forward walk to find the region in which `value` might be available.
while (auto *block = regionWorklist.pop()) {
if (block->succ_empty()) {
// This is a function-exiting block.
//
// In valid-but-lifetime-incomplete OSSA there must be a lifetime-ending
// instruction on each path from the def that exits the function normally.
// Thus finding a value available at the end of such a block means that
// the block does _not_ must not exits the function normally; in other
// words its terminator must be an UnreachableInst.
assert(isa<UnreachableInst>(block->getTerminator()));
}
for (auto *successor : block->getSuccessorBlocks()) {
regionWorklist.pushIfNotVisited(successor);
region.insert(successor);
}
}
}
void AvailabilityBoundaryVisitor::propagateAvailablity(Result &result) {
// Initialize per-block state.
// - all blocks outside of the region are ::Unavailable (automatically
// initialized)
// - non-initial in-region blocks are Unknown
// - start blocks are ::Available
for (auto *block : region) {
if (starts.contains(block))
result.setState(block, State::Available);
else
result.setState(block, State::Unknown);
}
BasicBlockWorklist worklist(value->getFunction());
// Initialize worklist with all participating blocks.
//
// Only perform dataflow in the non-initial region. Every initial block is
// by definition ::Available.
for (auto *block : region) {
if (starts.contains(block))
continue;
worklist.push(block);
}
// Iterate over blocks which are successors of blocks whose state changed.
while (auto *block = worklist.popAndForget()) {
// Only propagate availability in non-initial, in-region blocks.
if (!region.contains(block) || starts.contains(block))
continue;
auto changed = result.updateState(block);
if (!changed) {
continue;
}
// The state has changed. Propagate the new state into successors.
for (auto *successor : block->getSuccessorBlocks()) {
worklist.pushIfNotVisited(successor);
}
}
}
void AvailabilityBoundaryVisitor::visitAvailabilityBoundary(
Result const &result,
llvm::function_ref<void(SILInstruction *,
OSSALifetimeCompletion::LifetimeEnd end)>
visit) {
for (auto *block : region) {
auto available = result.getState(block) == State::Available;
if (!available) {
continue;
}
auto hasUnavailableSuccessor = [&]() {
// Use a lambda to avoid checking if possible.
return llvm::any_of(block->getSuccessorBlocks(), [&result](auto *block) {
return result.getState(block) == State::Unavailable;
});
};
if (!block->succ_empty() && !hasUnavailableSuccessor()) {
continue;
}
assert(hasUnavailableSuccessor() ||
isa<UnreachableInst>(block->getTerminator()));
visit(block->getTerminator(),
OSSALifetimeCompletion::LifetimeEnd::Boundary);
}
}
} // end anonymous namespace
void OSSALifetimeCompletion::visitAvailabilityBoundary(
SILValue value, const SSAPrunedLiveness &liveness,
llvm::function_ref<void(SILInstruction *, LifetimeEnd end)> visit) {
AvailabilityBoundaryVisitor visitor(value);
AvailabilityBoundaryVisitor::Result result(value->getFunction());
visitor.visit(liveness, result, visit);
visitUsersOutsideLinearLivenessBoundary(
value, liveness, [&](auto *instruction) {
instruction->visitSubsequentInstructions([&](auto *next) {
visit(next, LifetimeEnd::Loop);
return true;
});
});
}
static bool endLifetimeAtAvailabilityBoundary(SILValue value,
const SSAPrunedLiveness &liveness,
DeadEndBlocks &deb) {
bool changed = false;
OSSALifetimeCompletion::visitAvailabilityBoundary(
value, liveness, [&](auto *unreachable, auto end) {
SILBuilderWithScope builder(unreachable);
endOSSALifetime(value, end, builder, deb);
changed = true;
});
return changed;
}
static bool endLifetimeAtBoundary(SILValue value,
SSAPrunedLiveness const &liveness,
OSSALifetimeCompletion::Boundary boundary,
DeadEndBlocks &deadEndBlocks) {
bool changed = false;
switch (boundary) {
case OSSALifetimeCompletion::Boundary::Liveness:
changed |= endLifetimeAtLivenessBoundary(value, liveness, deadEndBlocks);
break;
case OSSALifetimeCompletion::Boundary::Availability:
changed |=
endLifetimeAtAvailabilityBoundary(value, liveness, deadEndBlocks);
break;
}
return changed;
}
bool OSSALifetimeCompletion::analyzeAndUpdateLifetime(
ScopedAddressValue scopedAddress, Boundary boundary) {
SmallVector<SILBasicBlock *, 8> discoveredBlocks;
SSAPrunedLiveness liveness(scopedAddress->getFunction(), &discoveredBlocks);
liveness.initializeDef(scopedAddress.value);
struct Walker : TransitiveAddressWalker<Walker> {
OSSALifetimeCompletion &completion;
ScopedAddressValue scopedAddress;
Boundary boundary;
SSAPrunedLiveness &liveness;
Walker(OSSALifetimeCompletion &completion, ScopedAddressValue scopedAddress,
Boundary boundary, SSAPrunedLiveness &liveness)
: completion(completion), scopedAddress(scopedAddress),
boundary(boundary), liveness(liveness) {}
bool visitUse(Operand *use) {
auto *user = use->getUser();
if (scopedAddress.isScopeEndingUse(use)) {
liveness.updateForUse(user, /*lifetimeEnding=*/true);
return true;
}
liveness.updateForUse(user, /*lifetimeEnding=*/false);
for (auto result : user->getResults()) {
auto shouldComplete =
(bool)BorrowedValue(result) || (bool)ScopedAddressValue(result);
if (!shouldComplete)
continue;
auto completed = completion.completeOSSALifetime(result, boundary);
switch (completed) {
case LifetimeCompletion::NoLifetime:
break;
case LifetimeCompletion::AlreadyComplete:
case LifetimeCompletion::WasCompleted:
for (auto *consume : result->getConsumingUses()) {
liveness.updateForUse(consume->getUser(), /*lifetimeEnding=*/false);
}
break;
}
}
return true;
}
};
Walker walker(*this, scopedAddress, boundary, liveness);
AddressUseKind result = walker.walk(scopedAddress.value);
if ((VerifyLifetimeCompletion || ForceLivenessVerification) &&
boundary != Boundary::Availability &&
result != AddressUseKind::NonEscaping) {
llvm::errs() << "Incomplete liveness for:\n" << scopedAddress.value;
if (auto *escapingUse = walker.getEscapingUse()) {
llvm::errs() << " escapes at:\n";
escapingUse->getUser()->printInContext(llvm::errs());
}
ASSERT(false && "caller must check for pointer escapes");
}
return endLifetimeAtBoundary(scopedAddress.value, liveness, boundary,
deadEndBlocks);
}
/// End the lifetime of \p value at unreachable instructions.
///
/// Returns true if any new instructions were created to complete the lifetime.
bool OSSALifetimeCompletion::analyzeAndUpdateLifetime(SILValue value,
Boundary boundary) {
if (auto scopedAddress = ScopedAddressValue(value)) {
return analyzeAndUpdateLifetime(scopedAddress, boundary);
}
// Called for inner borrows, inner adjacent reborrows, inner reborrows, and
// scoped addresses.
auto handleInnerScope = [this, boundary](SILValue innerBorrowedValue) {
completeOSSALifetime(innerBorrowedValue, boundary);
};
if (value->getOwnershipKind() == OwnershipKind::None) {
// Trivial variable lifetimes are only relevant up to the extend_lifetime
// instructions emitted by SILGen. Their other uses have no meaning with
// respect to lifetime. The only purpose of "completing" their lifetime is
// to insert extend_lifetime on dead-end blocks.
LinearLiveness liveness(value);
liveness.compute();
return endLifetimeAtBoundary(value, liveness.getLiveness(), boundary,
deadEndBlocks);
}
InteriorLiveness liveness(value);
liveness.compute(domInfo, handleInnerScope);
if (VerifyLifetimeCompletion && boundary != Boundary::Availability
&& liveness.getAddressUseKind() != AddressUseKind::NonEscaping) {
llvm::errs() << "Incomplete liveness for: " << value;
if (auto *escapingUse = liveness.escapingUse) {
llvm::errs() << " escapes at:\n";
escapingUse->getUser()->printInContext(llvm::errs());
}
ASSERT(false && "caller must check for pointer escapes");
}
return endLifetimeAtBoundary(value, liveness.getLiveness(), boundary,
deadEndBlocks);
}
namespace swift::test {
// Arguments:
// - SILValue: value
// - string: either "liveness" or "availability"
// Dumps:
// - function
static FunctionTest OSSALifetimeCompletionTest(
"ossa_lifetime_completion",
[](auto &function, auto &arguments, auto &test) {
SILValue value = arguments.takeValue();
OSSALifetimeCompletion::Boundary kind =
llvm::StringSwitch<OSSALifetimeCompletion::Boundary>(
arguments.takeString())
.Case("liveness", OSSALifetimeCompletion::Boundary::Liveness)
.Case("availability",
OSSALifetimeCompletion::Boundary::Availability);
auto *deb = test.getDeadEndBlocks();
llvm::outs() << "OSSA lifetime completion on " << kind
<< " boundary: " << value;
OSSALifetimeCompletion completion(&function, /*domInfo*/ nullptr, *deb);
completion.completeOSSALifetime(value, kind);
function.print(llvm::outs());
});
} // end namespace swift::test
// TODO: create a fast check for 'mayEndLifetime(SILInstruction *)'. Verify that
// it returns true for every instruction that has a lifetime-ending operand.
void UnreachableLifetimeCompletion::visitUnreachableInst(
SILInstruction *instruction) {
auto *block = instruction->getParent();
bool inReachableBlock = !unreachableBlocks.contains(block);
// If this instruction's block is already marked unreachable, and
// updatingLifetimes is not yet set, then this instruction will be visited
// again later when propagating unreachable blocks.
if (!inReachableBlock && !updatingLifetimes)
return;
for (Operand &operand : instruction->getAllOperands()) {
if (!operand.isLifetimeEnding())
continue;
SILValue value = operand.get();
SILBasicBlock *defBlock = value->getParentBlock();
if (unreachableBlocks.contains(defBlock))
continue;
auto *def = value->getDefiningInstruction();
if (def && unreachableInsts.contains(def))
continue;
// The operand's definition is still reachable and its lifetime ends on a
// newly unreachable path.
//
// Note: The arguments of a no-return try_apply may still appear reachable
// here because the try_apply itself is never visited as unreachable, hence
// its successor blocks are not marked . But it
// seems harmless to recompute their lifetimes.
// Insert this unreachable instruction in unreachableInsts if its parent
// block is not already marked unreachable.
if (inReachableBlock) {
unreachableInsts.insert(instruction);
}
incompleteValues.insert(value);
// Add unreachable successors to the forward traversal worklist.
if (auto *term = dyn_cast<TermInst>(instruction)) {
for (auto *succBlock : term->getSuccessorBlocks()) {
if (llvm::all_of(succBlock->getPredecessorBlocks(),
[&](SILBasicBlock *predBlock) {
if (predBlock == block)
return true;
return unreachableBlocks.contains(predBlock);
})) {
unreachableBlocks.insert(succBlock);
}
}
}
}
}
bool UnreachableLifetimeCompletion::completeLifetimes() {
assert(!updatingLifetimes && "don't call this more than once");
updatingLifetimes = true;
// Now that all unreachable terminator instructions have been visited,
// propagate unreachable blocks.
for (auto blockIt = unreachableBlocks.begin();
blockIt != unreachableBlocks.end(); ++blockIt) {
auto *block = *blockIt;
for (auto &instruction : *block) {
visitUnreachableInst(&instruction);
}
}
OSSALifetimeCompletion completion(function, domInfo, deadEndBlocks);
bool changed = false;
for (auto value : incompleteValues) {
if (completion.completeOSSALifetime(
value, OSSALifetimeCompletion::Boundary::Availability) ==
LifetimeCompletion::WasCompleted) {
changed = true;
}
}
return changed;
}
|