Files
swift-mirror/lib/SILGen/Cleanup.h
John McCall a05fef5122 Implement parameter arity reabstraction.
This is largely a matter of changing the main loop over subst
params in TranslateArguments to use the generators I added,
then plugging back into the general reabstraction infrastructure.

Because we don't have pack coroutines, we're kind of stuck in
the code generation for pack reabstraction: we have to write
+1 r-values into a temporary tuple and then write those tuple
element addresses into the output pack.  It's not great.  We
also have lifetime problems with things like non-escaping
closures --- we have that problem outside of reabstraction
thunks, too.

Other than that glaring problem, I'm feeling relatively good
about the code here.  It's missing some peepholes, but it should
work.  But that that's not to say that arity reabstraction works
in general; my attempts to test it have been exposing some
problems elsewhere, and in particular the closure case crashes,
which is really bad.  But this gets a few more things working,
and this PR is quite large already.
2023-03-20 20:06:08 -04:00

367 lines
12 KiB
C++

//===--- Cleanup.h - Declarations for SIL Cleanup Generation ----*- C++ -*-===//
//
// This source file is part of the Swift.org open source project
//
// Copyright (c) 2014 - 2017 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
//
//===----------------------------------------------------------------------===//
//
// This file defines the Cleanup and CleanupManager classes.
//
//===----------------------------------------------------------------------===//
#ifndef SWIFT_SILGEN_CLEANUP_H
#define SWIFT_SILGEN_CLEANUP_H
#include "swift/Basic/Debug.h"
#include "swift/Basic/DiverseStack.h"
#include "swift/SIL/SILLocation.h"
#include "swift/SIL/SILValue.h"
#include "llvm/ADT/SmallVector.h"
namespace swift {
class SILBasicBlock;
class SILFunction;
class SILValue;
namespace Lowering {
class RValue;
class JumpDest;
class SILGenFunction;
class SILGenBuilder;
class ManagedValue;
class Scope;
class SharedBorrowFormalAccess;
class FormalEvaluationScope;
/// Is a cleanup being executed as a result of some sort of forced
/// unwinding, such as an error being thrown, or are we just cleaning up
/// after some operation?
///
/// Most cleanups don't care, but the cleanups tied to l-value accesses do:
/// the access will be aborted rather than ended normally, which may cause
/// e.g. writebacks to be skipped. It is also important that no actions
/// be undertaken by an unwind cleanup that might change control flow,
/// such as throwing an error. In contrast, non-unwinding cleanups are
/// permitted to change control flow.
enum ForUnwind_t : bool {
NotForUnwind,
IsForUnwind
};
/// The valid states that a cleanup can be in.
enum class CleanupState {
/// The cleanup is inactive but may be activated later.
Dormant,
/// The cleanup is inactive and will not be activated later.
Dead,
// Only active states after this point
/// The cleanup is currently active.
Active,
/// The cleanup is currently active. When it's forwarded, it should
/// be placed in a dormant state, not a dead state.
PersistentlyActive
};
llvm::raw_ostream &operator<<(raw_ostream &os, CleanupState state);
class LLVM_LIBRARY_VISIBILITY Cleanup {
friend class CleanupManager;
friend class CleanupCloner;
protected:
// A set of flags that categorize the type of cleanup such that it can be
// recreated via SILGenFunction methods based on the type of argument input.
//
// Example: Distinguishing in between @owned cleanups with a writeback buffer
// (ExclusiveBorrowCleanup) or ones that involve formal access cleanups.
enum Flags : uint8_t {
None = 0,
FormalAccessCleanup = 1,
};
private:
CleanupState state;
unsigned allocatedSize : 24;
Flags flags : 8;
protected:
Cleanup() : flags(Flags::None) {}
virtual ~Cleanup() {}
public:
/// Return the allocated size of this object. This is required by
/// DiverseStack for iteration.
size_t allocated_size() const { return allocatedSize; }
CleanupState getState() const { return state; }
virtual void setState(SILGenFunction &SGF, CleanupState newState) {
state = newState;
}
bool isActive() const { return state >= CleanupState::Active; }
bool isDead() const { return state == CleanupState::Dead; }
virtual void emit(SILGenFunction &SGF, CleanupLocation loc,
ForUnwind_t forUnwind) = 0;
virtual void dump(SILGenFunction &SGF) const = 0;
protected:
Flags getFlags() const { return flags; }
/// Call func passing in the SILValue address that this cleanup will write
/// back to if supported and any flags associated with the cleanup. Returns
/// false otherwise.
virtual bool getWritebackBuffer(function_ref<void(SILValue)> func) {
return false;
}
bool isFormalAccess() const {
return getFlags() & Flags::FormalAccessCleanup;
}
void setIsFormalAccess() {
flags = Flags(flags | Flags::FormalAccessCleanup);
}
};
struct EndBorrowCleanup final : Cleanup {
SILValue borrowedValue;
EndBorrowCleanup(SILValue borrowedValue);
void emit(SILGenFunction &SGF, CleanupLocation l,
ForUnwind_t forUnwind) override;
void dump(SILGenFunction &) const override;
};
/// A cleanup depth is generally used to denote the set of cleanups
/// between the given cleanup (and not including it) and the top of
/// the stack.
///
/// Cleanup depths can be the stack's stable_end(), but generally
/// cannot be invalid.
typedef DiverseStackImpl<Cleanup>::stable_iterator CleanupsDepth;
/// A cleanup handle is a stable pointer to a single cleanup.
///
/// Cleanup handles can be invalid() (if no cleanup was required), but
/// generally cannot be the stack's stable_end().
typedef DiverseStackImpl<Cleanup>::stable_iterator CleanupHandle;
class LLVM_LIBRARY_VISIBILITY CleanupManager {
friend class Scope;
friend class CleanupCloner;
SILGenFunction &SGF;
/// Stack - Currently active cleanups in this scope tree.
DiverseStack<Cleanup, 128> stack;
/// The shallowest depth held by an active Scope object.
///
/// Generally, the rule is that a CleanupHandle is invalidated as
/// soon as the underlying cleanup is marked dead, meaning that
/// further uses of that handle are free to misbehave, and therefore
/// that we're free to actually pop the cleanup. But doing so might
/// break any outstanding CleanupsDepths we've vended, of which we
/// only really care about those held by the Scope RAII objects. So
/// we can only reap the cleanup stack up to the innermost depth
/// that we've handed out as a Scope.
Scope *innermostScope = nullptr;
FormalEvaluationScope *innermostFormalScope = nullptr;
void popTopDeadCleanups();
void emitCleanups(CleanupsDepth depth, CleanupLocation l,
ForUnwind_t forUnwind, bool popCleanups);
void endScope(CleanupsDepth depth, CleanupLocation l);
Cleanup &initCleanup(Cleanup &cleanup, size_t allocSize, CleanupState state);
void setCleanupState(Cleanup &cleanup, CleanupState state);
friend class CleanupStateRestorationScope;
friend class SharedBorrowFormalEvaluation;
friend class FormalEvaluationScope;
public:
CleanupManager(SILGenFunction &SGF)
: SGF(SGF) {}
/// Return a stable reference to the last cleanup pushed.
CleanupsDepth getCleanupsDepth() const { return stack.stable_begin(); }
/// Return a stable reference to the last cleanup pushed.
CleanupHandle getTopCleanup() const {
assert(!stack.empty());
return stack.stable_begin();
}
Cleanup &getCleanup(CleanupHandle iter) {
return *stack.find(iter);
}
Cleanup &findAndAdvance(CleanupsDepth &iter) {
return stack.findAndAdvance(iter);
}
/// Emit a branch to the given jump destination,
/// threading out through any cleanups we need to run. This does not pop the
/// cleanup stack.
///
/// \param dest The destination scope and block.
/// \param branchLoc The location of the branch instruction.
/// \param args Arguments to pass to the destination block.
void emitBranchAndCleanups(JumpDest dest, SILLocation branchLoc,
ArrayRef<SILValue> args = {},
ForUnwind_t forUnwind = NotForUnwind);
/// emitCleanupsForReturn - Emit the top-level cleanups needed prior to a
/// return from the function.
void emitCleanupsForReturn(CleanupLocation loc, ForUnwind_t forUnwind);
/// Emit a new block that jumps to the specified location and runs necessary
/// cleanups based on its level. If there are no cleanups to run, this just
/// returns the dest block.
SILBasicBlock *emitBlockForCleanups(JumpDest dest, SILLocation branchLoc,
ArrayRef<SILValue> args = {},
ForUnwind_t forUnwind = NotForUnwind);
/// pushCleanup - Push a new cleanup.
template<class T, class... A>
T &pushCleanupInState(CleanupState state,
A &&... args) {
assert(state != CleanupState::Dead);
#ifndef NDEBUG
CleanupsDepth oldTop = stack.stable_begin();
#endif
T &cleanup = stack.push<T, A...>(::std::forward<A>(args)...);
T &result = static_cast<T&>(initCleanup(cleanup, sizeof(T), state));
#ifndef NDEBUG
auto newTop = stack.begin();
++newTop;
assert(newTop == stack.find(oldTop));
#endif
return result;
}
template<class T, class... A>
T &pushCleanup(A &&... args) {
return pushCleanupInState<T, A...>(CleanupState::Active,
::std::forward<A>(args)...);
}
/// Emit the given active cleanup now and transition it to being inactive.
void popAndEmitCleanup(CleanupHandle handle, CleanupLocation loc,
ForUnwind_t forUnwind);
/// Transition the given active cleanup to the corresponding
/// inactive state: Active becomes Dead and PersistentlyActive
/// becomes Dormant.
void forwardCleanup(CleanupHandle depth);
/// Set the state of the cleanup at the given depth.
/// The transition must be non-trivial and legal.
void setCleanupState(CleanupHandle depth, CleanupState state);
/// True if there are any active cleanups in the scope between the two
/// cleanup handles.
bool hasAnyActiveCleanups(CleanupsDepth from, CleanupsDepth to);
/// True if there are any active cleanups in the scope between the specified
/// cleanup handle and the current top of stack.
bool hasAnyActiveCleanups(CleanupsDepth from);
/// Dump the output of each cleanup on this stack.
SWIFT_DEBUG_DUMP;
/// Dump the given cleanup handle if it is on the current stack.
void dump(CleanupHandle handle) const;
/// Verify that the given cleanup handle is valid.
void checkIterator(CleanupHandle handle) const;
private:
// Look up the flags and optionally the writeback address associated with the
// cleanup at \p depth. If
std::tuple<Cleanup::Flags, Optional<SILValue>>
getFlagsAndWritebackBuffer(CleanupHandle depth);
};
/// An RAII object that allows the state of a cleanup to be
/// temporarily modified.
class CleanupStateRestorationScope {
CleanupManager &cleanups;
SmallVector<std::pair<CleanupHandle, CleanupState>, 4> savedStates;
CleanupStateRestorationScope(const CleanupStateRestorationScope &) = delete;
CleanupStateRestorationScope &
operator=(const CleanupStateRestorationScope &) = delete;
public:
CleanupStateRestorationScope(CleanupManager &cleanups) : cleanups(cleanups) {}
/// Set the state of the given cleanup and remember what we set it to.
void pushCleanupState(CleanupHandle handle, CleanupState newState);
/// Just remember whatever the current state of the given cleanup is.
void pushCurrentCleanupState(CleanupHandle handle);
void pop() &&;
~CleanupStateRestorationScope() { popImpl(); }
private:
void popImpl();
};
/// Extract enough information from a managed value to reliably clone its
/// cleanup (if it has any) on a newly computed type. This includes modeling
/// writeback buffers.
class CleanupCloner {
SILGenFunction &SGF;
Optional<SILValue> writebackBuffer;
bool hasCleanup;
bool isLValue;
bool isFormalAccess;
public:
CleanupCloner(SILGenFunction &SGF, const ManagedValue &mv);
CleanupCloner(SILGenBuilder &builder, const ManagedValue &mv);
ManagedValue clone(SILValue value) const;
ManagedValue cloneForTuplePackExpansionComponent(SILValue value,
CanPackType inducedPackType,
unsigned componentIndex) const;
ManagedValue cloneForPackPackExpansionComponent(SILValue packAddr,
CanPackType formalPackType,
unsigned componentIndex) const;
ManagedValue cloneForRemainingPackComponents(SILValue packAddr,
CanPackType formalPackType,
unsigned firstComponentIndex) const;
static void
getClonersForRValue(SILGenFunction &SGF, const RValue &rvalue,
SmallVectorImpl<CleanupCloner> &resultingCloners);
static void
getClonersForRValue(SILGenBuilder &builder, const RValue &rvalue,
SmallVectorImpl<CleanupCloner> &resultingCloners);
};
} // end namespace Lowering
} // end namespace swift
#endif