//===--- SILInstruction.h - Instructions for SIL code -----------*- 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 high-level SILInstruction class used for SIL code. // //===----------------------------------------------------------------------===// #ifndef SWIFT_SIL_INSTRUCTION_H #define SWIFT_SIL_INSTRUCTION_H #include "swift/AST/AutoDiff.h" #include "swift/AST/Builtins.h" #include "swift/AST/Decl.h" #include "swift/AST/GenericSignature.h" #include "swift/AST/ProtocolConformanceRef.h" #include "swift/AST/SubstitutionMap.h" #include "swift/AST/TypeAlignments.h" #include "swift/Basic/Compiler.h" #include "swift/Basic/NullablePtr.h" #include "swift/Basic/ProfileCounter.h" #include "swift/Basic/Range.h" #include "swift/SIL/Consumption.h" #include "swift/SIL/SILAllocated.h" #include "swift/SIL/SILArgumentArrayRef.h" #include "swift/SIL/SILDeclRef.h" #include "swift/SIL/SILFunctionConventions.h" #include "swift/SIL/SILLocation.h" #include "swift/SIL/SILSuccessor.h" #include "swift/SIL/SILValue.h" #include "swift/SIL/ValueUtils.h" #include "swift/Strings.h" #include "llvm/ADT/APFloat.h" #include "llvm/ADT/APInt.h" #include "llvm/ADT/ilist.h" #include "llvm/ADT/ilist_node.h" #include "llvm/Support/TrailingObjects.h" #include namespace swift { class AllocationInst; class DeclRefExpr; class FloatLiteralExpr; class FuncDecl; class IntegerLiteralExpr; class SingleValueInstruction; class MultipleValueInstruction; class MultipleValueInstructionResult; class DestructureTupleInst; class DestructureStructInst; class NonValueInstruction; class SILBasicBlock; class SILBuilder; class SILDebugLocation; class SILDebugScope; class SILDifferentiabilityWitness; class SILFunction; class SILGlobalVariable; class SILInstructionResultArray; class SILOpenedArchetypesState; class SILType; class SILArgument; class SILPhiArgument; class SILUndef; class Stmt; class StringLiteralExpr; class ValueDecl; class VarDecl; class FunctionRefBaseInst; template class SILClonerWithScopes; // An enum class for SILInstructions that enables exhaustive switches over // instructions. enum class SILInstructionKind : std::underlying_type::type { #define INST(ID, PARENT) \ ID = unsigned(SILNodeKind::ID), #define INST_RANGE(ID, FIRST, LAST) \ First_##ID = unsigned(SILNodeKind::First_##ID), \ Last_##ID = unsigned(SILNodeKind::Last_##ID), #include "SILNodes.def" }; /// Return a range which can be used to easily iterate over all /// SILInstructionKinds. inline IntRange allSILInstructionKinds() { return IntRange( SILInstructionKind(SILNodeKind::First_SILInstruction), SILInstructionKind(unsigned(SILNodeKind::Last_SILInstruction) + 1)); } /// Map SILInstruction's mnemonic name to its SILInstructionKind. SILInstructionKind getSILInstructionKind(StringRef InstName); /// Map SILInstructionKind to a corresponding SILInstruction name. StringRef getSILInstructionName(SILInstructionKind Kind); /// A formal SIL reference to a list of values, suitable for use as the result /// of a SILInstruction. /// /// *NOTE* Most multiple value instructions will not have many results, so if we /// want we can cache up to 3 bytes in the lower bits of the value. /// /// *NOTE* Most of this defined out of line further down in the file to work /// around forward declaration issues. /// /// *NOTE* The reason why this does not store the size of the stored element is /// that just from the number of elements we can infer the size of each element /// due to the restricted problem space. Specificially: /// /// 1. Size == 0 implies nothing is stored and thus element size is irrelevent. /// 2. Size == 1 implies we either had a single value instruction or a multiple /// value instruction, but no matter what instruction we had, we are going to /// store the results at the same starting location so element size is /// irrelevent. /// 3. Size > 1 implies we must be storing multiple value instruction results /// implying that the size of each stored element must be /// sizeof(MultipleValueInstructionResult). /// /// If we ever allow for subclasses of MultipleValueInstructionResult of /// different sizes, we will need to store a stride into /// SILInstructionResultArray. We always assume all results are the same /// subclass of MultipleValueInstructionResult. class SILInstructionResultArray { friend class MultipleValueInstruction; /// Byte pointer to our data. nullptr for empty arrays. const uint8_t *Pointer; /// The number of stored elements. unsigned Size; public: SILInstructionResultArray() : Pointer(nullptr), Size(0) {} SILInstructionResultArray(const SingleValueInstruction *SVI); SILInstructionResultArray(ArrayRef results); template SILInstructionResultArray(ArrayRef results); SILInstructionResultArray(const SILInstructionResultArray &Other) = default; SILInstructionResultArray & operator=(const SILInstructionResultArray &Other) = default; SILInstructionResultArray(SILInstructionResultArray &&Other) = default; SILInstructionResultArray & operator=(SILInstructionResultArray &&Other) = default; SILValue operator[](size_t Index) const; bool empty() const { return Size == 0; } size_t size() const { return Size; } class iterator; friend bool operator==(iterator, iterator); friend bool operator!=(iterator, iterator); iterator begin() const; iterator end() const; using reverse_iterator = std::reverse_iterator; reverse_iterator rbegin() const; reverse_iterator rend() const; using range = iterator_range; range getValues() const; using reverse_range = iterator_range; reverse_range getReversedValues() const; using type_range = iterator_range< llvm::mapped_iterator>; type_range getTypes() const; bool operator==(const SILInstructionResultArray &rhs); bool operator!=(const SILInstructionResultArray &other) { return !(*this == other); } /// Returns true if both this and \p rhs have the same result types. /// /// *NOTE* This does not imply that the actual return SILValues are the /// same. Just that the types are the same. bool hasSameTypes(const SILInstructionResultArray &rhs); private: /// Return the first element of the array. Asserts if the array is empty. /// /// Please do not use this outside of this class. It is only meant to speedup /// MultipleValueInstruction::getIndexOfResult(SILValue). const ValueBase *front() const; /// Return the last element of the array. Asserts if the array is empty. /// /// Please do not use this outside of this class. It is only meant to speedup /// MultipleValueInstruction::getIndexOfResult(SILValue). const ValueBase *back() const; }; class SILInstructionResultArray::iterator { /// Our "parent" array. /// /// This is actually a value type reference into a SILInstruction of some /// sort. So we can just have our own copy. This also allows us to not worry /// about our underlying array having too short of a lifetime. SILInstructionResultArray Parent; /// The index into the parent array. unsigned Index; public: using difference_type = int; using value_type = SILValue; using pointer = void; using reference = SILValue; using iterator_category = std::bidirectional_iterator_tag; iterator() = default; iterator(const SILInstructionResultArray &Parent, unsigned Index = 0) : Parent(Parent), Index(Index) {} SILValue operator*() const { return Parent[Index]; } SILValue operator->() const { return operator*(); } iterator &operator++() { ++Index; return *this; } iterator operator++(int) { iterator copy = *this; ++Index; return copy; } iterator &operator--() { --Index; return *this; } iterator operator--(int) { iterator copy = *this; --Index; return copy; } friend bool operator==(iterator lhs, iterator rhs) { assert(lhs.Parent.Pointer == rhs.Parent.Pointer); return lhs.Index == rhs.Index; } friend bool operator!=(iterator lhs, iterator rhs) { return !(lhs == rhs); } }; inline SILInstructionResultArray::iterator SILInstructionResultArray::begin() const { return iterator(*this, 0); } inline SILInstructionResultArray::iterator SILInstructionResultArray::end() const { return iterator(*this, size()); } inline SILInstructionResultArray::reverse_iterator SILInstructionResultArray::rbegin() const { return llvm::make_reverse_iterator(end()); } inline SILInstructionResultArray::reverse_iterator SILInstructionResultArray::rend() const { return llvm::make_reverse_iterator(begin()); } inline SILInstructionResultArray::range SILInstructionResultArray::getValues() const { return {begin(), end()}; } inline SILInstructionResultArray::reverse_range SILInstructionResultArray::getReversedValues() const { return {rbegin(), rend()}; } /// This is the root class for all instructions that can be used as the /// contents of a Swift SILBasicBlock. /// /// Most instructions are defined in terms of two basic kinds of /// structure: a list of operand values upon which the instruction depends /// and a list of result values upon which other instructions can depend. /// /// The operands can be divided into two sets: /// - the formal operands of the instruction, which reflect its /// direct value dependencies, and /// - the type-dependent operands, which reflect dependencies that are /// not captured by the formal operands; currently, these dependencies /// only arise due to certain instructions (e.g. open_existential_addr) /// that bind new archetypes in the local context. class SILInstruction : public SILNode, public llvm::ilist_node { friend llvm::ilist_traits; friend llvm::ilist_traits; friend SILBasicBlock; /// A backreference to the containing basic block. This is maintained by /// ilist_traits. SILBasicBlock *ParentBB; /// This instruction's containing lexical scope and source location /// used for debug info and diagnostics. SILDebugLocation Location; SILInstruction() = delete; void operator=(const SILInstruction &) = delete; void operator delete(void *Ptr, size_t) = delete; /// Check any special state of instructions that are not represented in the /// instructions operands/type. bool hasIdenticalState(const SILInstruction *RHS) const; /// Update this instruction's SILDebugScope. This function should /// never be called directly. Use SILBuilder, SILBuilderWithScope or /// SILClonerWithScope instead. void setDebugScope(const SILDebugScope *DS); /// Total number of created and deleted SILInstructions. /// It is used only for collecting the compiler statistics. static int NumCreatedInstructions; static int NumDeletedInstructions; // Helper functions used by the ArrayRefViews below. static SILValue projectValueBaseAsSILValue(const ValueBase &value) { return &value; } static SILType projectValueBaseType(const ValueBase &value) { return value.getType(); } /// An internal method which retrieves the result values of the /// instruction as an array of ValueBase objects. SILInstructionResultArray getResultsImpl() const; protected: SILInstruction(SILInstructionKind kind, SILDebugLocation DebugLoc) : SILNode(SILNodeKind(kind), SILNodeStorageLocation::Instruction, IsRepresentative::Yes), ParentBB(nullptr), Location(DebugLoc) { NumCreatedInstructions++; } ~SILInstruction() { NumDeletedInstructions++; } public: /// Instructions should be allocated using a dedicated instruction allocation /// function from the ContextTy. template void *operator new(size_t Bytes, const ContextTy &C, size_t Alignment = alignof(ValueBase)) { return C.allocateInst(Bytes, Alignment); } enum class MemoryBehavior { None, /// The instruction may read memory. MayRead, /// The instruction may write to memory. MayWrite, /// The instruction may read or write memory. MayReadWrite, /// The instruction may have side effects not captured /// solely by its users. Specifically, it can return, /// release memory, or store. Note, alloc is not considered /// to have side effects because its result/users represent /// its effect. MayHaveSideEffects, }; /// Enumeration representing whether the execution of an instruction can /// result in memory being released. enum class ReleasingBehavior { DoesNotRelease, MayRelease, }; LLVM_ATTRIBUTE_ALWAYS_INLINE SILInstructionKind getKind() const { return SILInstructionKind(SILNode::getKind()); } const SILBasicBlock *getParent() const { return ParentBB; } SILBasicBlock *getParent() { return ParentBB; } SILFunction *getFunction(); const SILFunction *getFunction() const; /// Is this instruction part of a static initializer of a SILGlobalVariable? bool isStaticInitializerInst() const { return getFunction() == nullptr; } SILModule &getModule() const; /// This instruction's source location (AST node). SILLocation getLoc() const; const SILDebugScope *getDebugScope() const; SILDebugLocation getDebugLocation() const { return Location; } /// Sets the debug location. /// Note: Usually it should not be needed to use this function as the location /// is already set in when creating an instruction. void setDebugLocation(SILDebugLocation Loc) { Location = Loc; } /// This method unlinks 'self' from the containing basic block and deletes it. void eraseFromParent(); /// Unlink this instruction from its current basic block and insert the /// instruction such that it is the first instruction of \p Block. void moveFront(SILBasicBlock *Block); /// Unlink this instruction from its current basic block and insert it into /// the basic block that Later lives in, right before Later. void moveBefore(SILInstruction *Later); /// Unlink this instruction from its current basic block and insert it into /// the basic block that Earlier lives in, right after Earlier. void moveAfter(SILInstruction *Earlier); /// Drops all uses that belong to this instruction. void dropAllReferences(); /// Replace all uses of all results of this instruction with undef. void replaceAllUsesOfAllResultsWithUndef(); /// Replace all uses of all results of this instruction /// with the parwise-corresponding results of the given instruction. void replaceAllUsesPairwiseWith(SILInstruction *other); /// Replace all uses of all results of this instruction with the /// parwise-corresponding results of the passed in array. void replaceAllUsesPairwiseWith(const llvm::SmallVectorImpl &NewValues); /// Are there uses of any of the results of this instruction? bool hasUsesOfAnyResult() const { for (auto result : getResults()) { if (!result->use_empty()) return true; } return false; } /// Return the array of operands for this instruction. ArrayRef getAllOperands() const; /// Return the array of type dependent operands for this instruction. /// /// Type dependent operands are hidden operands, i.e. not part of the SIL /// syntax (although they are printed as "type-defs" in comments). /// Their purpose is to establish a def-use relationship between /// -) an instruction/argument which defines a type, e.g. open_existential /// and /// -) this instruction, which uses the type, but doesn't use the defining /// instruction as value-operand, e.g. a type in the substitution list. /// /// Currently there are two kinds of type dependent operands: /// /// 1. for opened archetypes: /// %o = open_existential_addr %0 : $*P to $*@opened("UUID") P /// %w = witness_method $@opened("UUID") P, ... // type-defs: %o /// /// 2. for the dynamic self argument: /// sil @foo : $@convention(method) (@thick X.Type) { /// bb0(%0 : $@thick X.Type): /// %a = apply %f<@dynamic_self X>() ... // type-defs: %0 /// /// The type dependent operands are just there to let optimizations know that /// there is a dependency between the instruction/argument which defines the /// type and the instruction which uses the type. ArrayRef getTypeDependentOperands() const; /// Return the array of mutable operands for this instruction. MutableArrayRef getAllOperands(); /// Return the array of mutable type dependent operands for this instruction. MutableArrayRef getTypeDependentOperands(); unsigned getNumOperands() const { return getAllOperands().size(); } unsigned getNumTypeDependentOperands() const { return getTypeDependentOperands().size(); } bool isTypeDependentOperand(unsigned i) const { return i >= getNumOperands() - getNumTypeDependentOperands(); } bool isTypeDependentOperand(const Operand &Op) const { assert(Op.getUser() == this && "Operand does not belong to a SILInstruction"); return isTypeDependentOperand(Op.getOperandNumber()); } private: /// Predicate used to filter OperandValueRange. struct OperandToValue; public: using OperandValueRange = OptionalTransformRange, OperandToValue>; OperandValueRange getOperandValues(bool skipTypeDependentOperands = false) const; SILValue getOperand(unsigned Num) const { return getAllOperands()[Num].get(); } void setOperand(unsigned Num, SILValue V) { getAllOperands()[Num].set(V); } void swapOperands(unsigned Num1, unsigned Num2) { getAllOperands()[Num1].swap(getAllOperands()[Num2]); } private: /// Predicate used to filter OperandTypeRange. struct OperandToType; public: using OperandTypeRange = OptionalTransformRange, OperandToType>; // NOTE: We always skip type dependent operands. OperandTypeRange getOperandTypes() const; /// Return the list of results produced by this instruction. bool hasResults() const { return !getResults().empty(); } SILInstructionResultArray getResults() const { return getResultsImpl(); } unsigned getNumResults() const { return getResults().size(); } SILValue getResult(unsigned index) const { return getResults()[index]; } /// Return the types of the results produced by this instruction. SILInstructionResultArray::type_range getResultTypes() const { return getResultsImpl().getTypes(); } MemoryBehavior getMemoryBehavior() const; ReleasingBehavior getReleasingBehavior() const; /// Returns true if the instruction may release any object. bool mayRelease() const; /// Returns true if the instruction may release or may read the reference /// count of any object. bool mayReleaseOrReadRefCount() const; /// Can this instruction abort the program in some manner? bool mayTrap() const; /// Returns true if the given instruction is completely identical to RHS. bool isIdenticalTo(const SILInstruction *RHS) const { return isIdenticalTo(RHS, [](const SILValue &Op1, const SILValue &Op2) -> bool { return Op1 == Op2; }); } /// Returns true if the given instruction is completely identical to RHS, /// using \p opEqual to compare operands. /// template bool isIdenticalTo(const SILInstruction *RHS, OpCmp &&opEqual) const { // Quick check if both instructions have the same kind, number of operands, // and types. This should filter out most cases. if (getKind() != RHS->getKind() || getNumOperands() != RHS->getNumOperands()) { return false; } if (!getResults().hasSameTypes(RHS->getResults())) return false; // Check operands. for (unsigned i = 0, e = getNumOperands(); i != e; ++i) if (!opEqual(getOperand(i), RHS->getOperand(i))) return false; // Check any special state of instructions that are not represented in the // instructions operands/type. return hasIdenticalState(RHS); } /// Returns true if the instruction may have side effects. /// /// Instructions that store into memory or change retain counts as well as /// calls and deallocation instructions are considered to have side effects /// that are not visible by merely examining their uses. bool mayHaveSideEffects() const; /// Returns true if the instruction may write to memory. bool mayWriteToMemory() const { MemoryBehavior B = getMemoryBehavior(); return B == MemoryBehavior::MayWrite || B == MemoryBehavior::MayReadWrite || B == MemoryBehavior::MayHaveSideEffects; } /// Returns true if the instruction may read from memory. bool mayReadFromMemory() const { MemoryBehavior B = getMemoryBehavior(); return B == MemoryBehavior::MayRead || B == MemoryBehavior::MayReadWrite || B == MemoryBehavior::MayHaveSideEffects; } /// Returns true if the instruction may read from or write to memory. bool mayReadOrWriteMemory() const { return getMemoryBehavior() != MemoryBehavior::None; } /// Return true if the instruction is "pure" in the sense that it may execute /// multiple times without affecting behavior. This implies that it can be /// trivially cloned at multiple use sites without preserving path /// equivalence. bool isPure() const { return !mayReadOrWriteMemory() && !mayTrap() && !isa(this) && !isa(this); } /// Returns true if the result of this instruction is a pointer to stack /// allocated memory. In this case there must be an adjacent deallocating /// instruction. bool isAllocatingStack() const; /// Returns true if this is the deallocation of a stack allocating instruction. /// The first operand must be the allocating instruction. bool isDeallocatingStack() const; /// Create a new copy of this instruction, which retains all of the operands /// and other information of this one. If an insertion point is specified, /// then the new instruction is inserted before the specified point, otherwise /// the new instruction is returned without a parent. SILInstruction *clone(SILInstruction *InsertPt = nullptr); /// Invoke an Instruction's destructor. This dispatches to the appropriate /// leaf class destructor for the type of the instruction. This does not /// deallocate the instruction. static void destroy(SILInstruction *I); /// Returns true if the instruction can be duplicated without any special /// additional handling. It is important to know this information when /// you perform such optimizations like e.g. jump-threading. bool isTriviallyDuplicatable() const; /// Returns true if the instruction is only relevant for debug /// informations and has no other impact on program semantics. bool isDebugInstruction() const { return getKind() == SILInstructionKind::DebugValueInst || getKind() == SILInstructionKind::DebugValueAddrInst; } /// Returns true if the instruction is a meta instruction which is /// relevant for debug information and does not get lowered to a real /// instruction. bool isMetaInstruction() const; /// Verify that all operands of this instruction have compatible ownership /// with this instruction. void verifyOperandOwnership() const; /// Get the number of created SILInstructions. static int getNumCreatedInstructions() { return NumCreatedInstructions; } /// Get the number of deleted SILInstructions. static int getNumDeletedInstructions() { return NumDeletedInstructions; } /// Pretty-print the value. void dump() const; void print(raw_ostream &OS) const; /// Pretty-print the value in context, preceded by its operands (if the /// value represents the result of an instruction) and followed by its /// users. void dumpInContext() const; void printInContext(raw_ostream &OS) const; static bool classof(const SILNode *N) { return N->getKind() >= SILNodeKind::First_SILInstruction && N->getKind() <= SILNodeKind::Last_SILInstruction; } static bool classof(const SILInstruction *I) { return true; } /// This is supportable but usually suggests a logic mistake. static bool classof(const ValueBase *) = delete; }; struct SILInstruction::OperandToValue { const SILInstruction &i; bool skipTypeDependentOps; OperandToValue(const SILInstruction &i, bool skipTypeDependentOps) : i(i), skipTypeDependentOps(skipTypeDependentOps) {} Optional operator()(const Operand &use) const { if (skipTypeDependentOps && i.isTypeDependentOperand(use)) return None; return use.get(); } }; inline auto SILInstruction::getOperandValues(bool skipTypeDependentOperands) const -> OperandValueRange { return OperandValueRange(getAllOperands(), OperandToValue(*this, skipTypeDependentOperands)); } struct SILInstruction::OperandToType { const SILInstruction &i; OperandToType(const SILInstruction &i) : i(i) {} Optional operator()(const Operand &use) const { if (i.isTypeDependentOperand(use)) return None; return use.get()->getType(); } }; inline auto SILInstruction::getOperandTypes() const -> OperandTypeRange { return OperandTypeRange(getAllOperands(), OperandToType(*this)); } inline llvm::raw_ostream &operator<<(llvm::raw_ostream &OS, const SILInstruction &I) { I.print(OS); return OS; } /// Returns the combined behavior of \p B1 and \p B2. inline SILInstruction::MemoryBehavior combineMemoryBehavior(SILInstruction::MemoryBehavior B1, SILInstruction::MemoryBehavior B2) { // Basically the combined behavior is the maximum of both operands. auto Result = std::max(B1, B2); // With one exception: MayRead, MayWrite -> MayReadWrite. if (Result == SILInstruction::MemoryBehavior::MayWrite && (B1 == SILInstruction::MemoryBehavior::MayRead || B2 == SILInstruction::MemoryBehavior::MayRead)) return SILInstruction::MemoryBehavior::MayReadWrite; return Result; } /// Pretty-print the MemoryBehavior. llvm::raw_ostream &operator<<(llvm::raw_ostream &OS, SILInstruction::MemoryBehavior B); /// Pretty-print the ReleasingBehavior. llvm::raw_ostream &operator<<(llvm::raw_ostream &OS, SILInstruction::ReleasingBehavior B); /// An instruction which always produces a single value. /// /// Because this instruction is both a SILInstruction and a ValueBase, /// both of which inherit from SILNode, it introduces the need for /// some care when working with SILNodes. See the comment on SILNode. class SingleValueInstruction : public SILInstruction, public ValueBase { static bool isSingleValueInstKind(SILNodeKind kind) { return kind >= SILNodeKind::First_SingleValueInstruction && kind <= SILNodeKind::Last_SingleValueInstruction; } friend class SILInstruction; SILInstructionResultArray getResultsImpl() const { return SILInstructionResultArray(this); } public: SingleValueInstruction(SILInstructionKind kind, SILDebugLocation loc, SILType type) : SILInstruction(kind, loc), ValueBase(ValueKind(kind), type, IsRepresentative::No) {} using SILInstruction::operator new; using SILInstruction::dumpInContext; using SILInstruction::print; using SILInstruction::printInContext; // Redeclare because lldb currently doesn't know about using-declarations void dump() const; SILFunction *getFunction() { return SILInstruction::getFunction(); } const SILFunction *getFunction() const { return SILInstruction::getFunction(); } SILModule &getModule() const { return SILInstruction::getModule(); } SILInstructionKind getKind() const { return SILInstruction::getKind(); } void operator delete(void *Ptr, size_t) = delete; ValueKind getValueKind() const { return ValueBase::getKind(); } SingleValueInstruction *clone(SILInstruction *insertPt = nullptr) { return cast(SILInstruction::clone(insertPt)); } /// Override this to reflect the more efficient access pattern. SILInstructionResultArray getResults() const { return getResultsImpl(); } static bool classof(const SILNode *node) { return isSingleValueInstKind(node->getKind()); } }; // Resolve ambiguities. inline llvm::raw_ostream &operator<<(llvm::raw_ostream &OS, const SingleValueInstruction &I) { I.print(OS); return OS; } inline SingleValueInstruction *SILNode::castToSingleValueInstruction() { assert(isa(this)); // We do reference static_casts to convince the host compiler to do // null-unchecked conversions. // If we're in the value slot, cast through ValueBase. if (getStorageLoc() == SILNodeStorageLocation::Value) { return &static_cast( static_cast(*this)); // Otherwise, cast through SILInstruction. } else { return &static_cast( static_cast(*this)); } } #define DEFINE_ABSTRACT_SINGLE_VALUE_INST_BOILERPLATE(ID) \ static bool classof(const SILNode *node) { \ return node->getKind() >= SILNodeKind::First_##ID && \ node->getKind() <= SILNodeKind::Last_##ID; \ } \ static bool classof(const SingleValueInstruction *inst) { \ return inst->getKind() >= SILInstructionKind::First_##ID && \ inst->getKind() <= SILInstructionKind::Last_##ID; \ } /// A single value inst that forwards a static ownership from one (or all) of /// its operands. /// /// The ownership kind is set on construction and afterwards must be changed /// explicitly using setOwnershipKind(). class OwnershipForwardingSingleValueInst : public SingleValueInstruction { ValueOwnershipKind ownershipKind; protected: OwnershipForwardingSingleValueInst(SILInstructionKind kind, SILDebugLocation debugLoc, SILType ty, ValueOwnershipKind ownershipKind) : SingleValueInstruction(kind, debugLoc, ty), ownershipKind(ownershipKind) {} public: ValueOwnershipKind getOwnershipKind() const { return ownershipKind; } void setOwnershipKind(ValueOwnershipKind newOwnershipKind) { ownershipKind = newOwnershipKind; } }; /// A value base result of a multiple value instruction. /// /// *NOTE* We want this to be a pure abstract class that does not add /any/ size /// to subclasses. class MultipleValueInstructionResult : public ValueBase { public: /// Create a new multiple value instruction result. /// /// \arg subclassDeltaOffset This is the delta offset in our parent object's /// layout in between the end of the MultipleValueInstruction object and the /// end of the specific subclass object. /// /// *NOTE* subclassDeltaOffset must be use only 5 bits. This gives us to /// support subclasses up to 32 bytes in size. We can scavange up to 6 more /// bits from ValueBase if this is not large enough. MultipleValueInstructionResult(ValueKind valueKind, unsigned index, SILType type, ValueOwnershipKind ownershipKind); /// Return the parent instruction of this result. MultipleValueInstruction *getParent(); const MultipleValueInstruction *getParent() const { return const_cast(this)->getParent(); } unsigned getIndex() const { return Bits.MultipleValueInstructionResult.Index; } /// Get the ownership kind assigned to this result by its parent. /// /// This is stored in the bottom 3 bits of ValueBase's subclass data. ValueOwnershipKind getOwnershipKind() const; /// Set the ownership kind assigned to this result. /// /// This is stored in SILNode in the subclass data. void setOwnershipKind(ValueOwnershipKind Kind); static bool classof(const SILInstruction *) = delete; static bool classof(const SILUndef *) = delete; static bool classof(const SILArgument *) = delete; static bool classof(const MultipleValueInstructionResult *) { return true; } static bool classof(const SILNode *node) { // This is an abstract class without anything implementing it right now, so // just return false. This will be fixed in a subsequent commit. SILNodeKind kind = node->getKind(); return kind >= SILNodeKind::First_MultipleValueInstructionResult && kind <= SILNodeKind::Last_MultipleValueInstructionResult; } protected: /// Set the index of this result. void setIndex(unsigned NewIndex); }; template SILInstructionResultArray::SILInstructionResultArray(ArrayRef results) : SILInstructionResultArray( ArrayRef(results.data(), results.size())) { static_assert(sizeof(Result) == sizeof(MultipleValueInstructionResult), "MultipleValueInstructionResult subclass has wrong size"); } /// An instruction that may produce an arbitrary number of values. class MultipleValueInstruction : public SILInstruction { friend class SILInstruction; friend class SILInstructionResultArray; protected: MultipleValueInstruction(SILInstructionKind kind, SILDebugLocation loc) : SILInstruction(kind, loc) {} public: void operator delete(void *Ptr, size_t) = delete; MultipleValueInstruction *clone(SILInstruction *insertPt = nullptr) { return cast(SILInstruction::clone(insertPt)); } SILValue getResult(unsigned Index) const { return getResults()[Index]; } /// Return the index of \p Target if it is a result in the given /// MultipleValueInstructionResult. Otherwise, returns None. Optional getIndexOfResult(SILValue Target) const; unsigned getNumResults() const { return getResults().size(); } static bool classof(const SILNode *node) { SILNodeKind kind = node->getKind(); return kind >= SILNodeKind::First_MultipleValueInstruction && kind <= SILNodeKind::Last_MultipleValueInstruction; } }; template class InitialTrailingObjects; template class FinalTrailingObjects; /// A utility mixin class that must be used by /all/ subclasses of /// MultipleValueInstruction to store their results. /// /// The exact ordering of trailing types matters quite a lot because /// it's vital that the fields used by preceding numTrailingObjects /// implementations be initialized before this base class is (and /// conversely that this base class be initialized before any of the /// succeeding numTrailingObjects implementations are called). template , typename Final = FinalTrailingObjects<>> class MultipleValueInstructionTrailingObjects; template class MultipleValueInstructionTrailingObjects, FinalTrailingObjects> : protected llvm::TrailingObjects { static_assert(std::is_final(), "Expected DerivedResult to be final"); static_assert( std::is_base_of::value, "Expected DerivedResult to be a subclass of " "MultipleValueInstructionResult"); static_assert(sizeof(MultipleValueInstructionResult) == sizeof(DerivedResult), "Expected DerivedResult to be the same size as a " "MultipleValueInstructionResult"); protected: using TrailingObjects = llvm::TrailingObjects; friend TrailingObjects; using TrailingObjects::totalSizeToAlloc; using TrailingObjects::getTrailingObjects; unsigned NumResults; size_t numTrailingObjects(typename TrailingObjects::template OverloadToken< MultipleValueInstruction *>) const { return 1; } size_t numTrailingObjects( typename TrailingObjects::template OverloadToken) const { return NumResults; } template MultipleValueInstructionTrailingObjects( Derived *Parent, ArrayRef Types, ArrayRef OwnershipKinds, Args &&... OtherArgs) : NumResults(Types.size()) { // If we do not have any results, then we do not need to initialize even the // parent pointer since we do not have any results that will attempt to get // our parent pointer. if (!NumResults) return; auto **ParentPtr = this->TrailingObjects::template getTrailingObjects(); *ParentPtr = static_cast(Parent); auto *DataPtr = this->TrailingObjects::template getTrailingObjects(); for (unsigned i : range(NumResults)) { ::new (&DataPtr[i]) DerivedResult(i, Types[i], OwnershipKinds[i], std::forward(OtherArgs)...); assert(DataPtr[i].getParent() == Parent && "Failed to setup parent reference correctly?!"); } } // Destruct the Derived Results. ~MultipleValueInstructionTrailingObjects() { if (!NumResults) return; auto *DataPtr = this->TrailingObjects::template getTrailingObjects(); // We call the DerivedResult destructors to ensure that: // // 1. If our derived results have any stored data that need to be cleaned // up, we clean them up. *NOTE* Today, no results have this property. // 2. In ~ValueBase, we validate via an assert that a ValueBase no longer // has any uses when it is being destroyed. Rather than re-implement that in // result, we get that for free. for (unsigned i : range(NumResults)) DataPtr[i].~DerivedResult(); } public: ArrayRef getAllResultsBuffer() const { auto *ptr = this->TrailingObjects::template getTrailingObjects(); return { ptr, NumResults }; } SILInstructionResultArray getAllResults() const { // Our results start at element 1 since we stash the pointer to our parent // MultipleValueInstruction in the 0 elt slot. This allows all // MultipleValueInstructionResult to find their parent // MultipleValueInstruction by using pointer arithmetic. return SILInstructionResultArray(getAllResultsBuffer()); }; }; /// A subclass of SILInstruction which does not produce any values. class NonValueInstruction : public SILInstruction { public: NonValueInstruction(SILInstructionKind kind, SILDebugLocation loc) : SILInstruction(kind, loc) {} /// Doesn't produce any results. SILType getType() const = delete; SILInstructionResultArray getResults() const = delete; static bool classof(const ValueBase *value) = delete; static bool classof(const SILNode *N) { return N->getKind() >= SILNodeKind::First_NonValueInstruction && N->getKind() <= SILNodeKind::Last_NonValueInstruction; } static bool classof(const NonValueInstruction *) { return true; } }; #define DEFINE_ABSTRACT_NON_VALUE_INST_BOILERPLATE(ID) \ static bool classof(const ValueBase *value) = delete; \ static bool classof(const SILNode *node) { \ return node->getKind() >= SILNodeKind::First_##ID && \ node->getKind() <= SILNodeKind::Last_##ID; \ } /// A helper class for defining some basic boilerplate. template ::value> class InstructionBase; template class InstructionBase : public InstBase { protected: template InstructionBase(As &&... args) : InstBase(Kind, std::forward(args)...) {} public: /// Override to statically return the kind. static constexpr SILInstructionKind getKind() { return Kind; } static bool classof(const SILNode *node) { return node->getKind() == SILNodeKind(Kind); } static bool classof(const SingleValueInstruction *I) { // resolve ambiguities return I->getKind() == Kind; } }; template class InstructionBase : public InstBase { protected: template InstructionBase(As &&... args) : InstBase(Kind, std::forward(args)...) {} public: static constexpr SILInstructionKind getKind() { return Kind; } /// Can never dynamically succeed. static bool classof(const ValueBase *value) = delete; static bool classof(const SILNode *node) { return node->getKind() == SILNodeKind(Kind); } }; /// A template base class for instructions that take a single SILValue operand /// and has no result or a single value result. template class UnaryInstructionBase : public InstructionBase { // Space for 1 operand. FixedOperandList<1> Operands; public: template UnaryInstructionBase(SILDebugLocation loc, SILValue op, A &&... args) : InstructionBase(loc, std::forward(args)...), Operands(this, op) {} SILValue getOperand() const { return Operands[0].get(); } void setOperand(SILValue V) { Operands[0].set(V); } Operand &getOperandRef() { return Operands[0]; } ArrayRef getAllOperands() const { return Operands.asArray(); } MutableArrayRef getAllOperands() { return Operands.asArray(); } ArrayRef getTypeDependentOperands() const { return {}; } MutableArrayRef getTypeDependentOperands() { return {}; } }; /// A template base class for instructions that a variable number of SILValue /// operands, and has zero or one value results. The operands are tail allocated /// after the instruction. Further trailing data can be allocated as well if /// OtherTrailingTypes are provided. template class InstructionBaseWithTrailingOperands : public InstructionBase, protected llvm::TrailingObjects { protected: friend llvm::TrailingObjects; using TrailingObjects = llvm::TrailingObjects; using TrailingObjects::totalSizeToAlloc; public: template InstructionBaseWithTrailingOperands(ArrayRef Operands, Args &&...args) : InstructionBase(std::forward(args)...) { SILInstruction::Bits.IBWTO.NumOperands = Operands.size(); TrailingOperandsList::InitOperandsList(getAllOperands().begin(), this, Operands); } template InstructionBaseWithTrailingOperands(SILValue Operand0, ArrayRef Operands, Args &&...args) : InstructionBase(std::forward(args)...) { SILInstruction::Bits.IBWTO.NumOperands = Operands.size() + 1; TrailingOperandsList::InitOperandsList(getAllOperands().begin(), this, Operand0, Operands); } template InstructionBaseWithTrailingOperands(SILValue Operand0, SILValue Operand1, ArrayRef Operands, Args &&...args) : InstructionBase(std::forward(args)...) { SILInstruction::Bits.IBWTO.NumOperands = Operands.size() + 2; TrailingOperandsList::InitOperandsList(getAllOperands().begin(), this, Operand0, Operand1, Operands); } // Destruct tail allocated objects. ~InstructionBaseWithTrailingOperands() { Operand *Operands = TrailingObjects::template getTrailingObjects(); auto end = SILInstruction::Bits.IBWTO.NumOperands; for (unsigned i = 0; i < end; ++i) { Operands[i].~Operand(); } } size_t numTrailingObjects(typename TrailingObjects::template OverloadToken) const { return SILInstruction::Bits.IBWTO.NumOperands; } ArrayRef getAllOperands() const { return {TrailingObjects::template getTrailingObjects(), SILInstruction::Bits.IBWTO.NumOperands}; } MutableArrayRef getAllOperands() { return {TrailingObjects::template getTrailingObjects(), SILInstruction::Bits.IBWTO.NumOperands}; } }; /// A template base class for instructions that take a single regular SILValue /// operand, a set of type dependent operands and has no result /// or a single value result. The operands are tail allocated after the /// instruction. Further trailing data can be allocated as well if /// TRAILING_TYPES are provided. template class UnaryInstructionWithTypeDependentOperandsBase : public InstructionBaseWithTrailingOperands { protected: friend InstructionBaseWithTrailingOperands; using TrailingObjects = InstructionBaseWithTrailingOperands; public: template UnaryInstructionWithTypeDependentOperandsBase(SILDebugLocation debugLoc, SILValue operand, ArrayRef typeDependentOperands, Args &&...args) : InstructionBaseWithTrailingOperands( operand, typeDependentOperands, debugLoc, std::forward(args)...) {} unsigned getNumTypeDependentOperands() const { return this->getAllOperands().size() - 1; } SILValue getOperand() const { return this->getAllOperands()[0].get(); } void setOperand(SILValue V) { this->getAllOperands()[0].set(V); } Operand &getOperandRef() { return this->getAllOperands()[0]; } ArrayRef getTypeDependentOperands() const { return this->getAllOperands().slice(1); } MutableArrayRef getTypeDependentOperands() { return this->getAllOperands().slice(1); } }; /// Holds common debug information about local variables and function /// arguments that are needed by DebugValueInst, DebugValueAddrInst, /// AllocStackInst, and AllocBoxInst. struct SILDebugVariable { StringRef Name; unsigned ArgNo : 16; unsigned Constant : 1; SILDebugVariable() : ArgNo(0), Constant(false) {} SILDebugVariable(bool Constant, uint16_t ArgNo) : ArgNo(ArgNo), Constant(Constant) {} SILDebugVariable(StringRef Name, bool Constant, unsigned ArgNo) : Name(Name), ArgNo(ArgNo), Constant(Constant) {} bool operator==(const SILDebugVariable &V) { return ArgNo == V.ArgNo && Constant == V.Constant && Name == V.Name; } }; /// A DebugVariable where storage for the strings has been /// tail-allocated following the parent SILInstruction. class TailAllocatedDebugVariable { using int_type = uint32_t; union { int_type RawValue; struct { /// Whether this is a debug variable at all. int_type HasValue : 1; /// True if this is a let-binding. int_type Constant : 1; /// When this is nonzero there is a tail-allocated string storing /// variable name present. This typically only happens for /// instructions that were created from parsing SIL assembler. int_type NameLength : 14; /// The source function argument position from left to right /// starting with 1 or 0 if this is a local variable. int_type ArgNo : 16; } Data; } Bits; public: TailAllocatedDebugVariable(Optional, char *buf); TailAllocatedDebugVariable(int_type RawValue) { Bits.RawValue = RawValue; } int_type getRawValue() const { return Bits.RawValue; } unsigned getArgNo() const { return Bits.Data.ArgNo; } void setArgNo(unsigned N) { Bits.Data.ArgNo = N; } /// Returns the name of the source variable, if it is stored in the /// instruction. StringRef getName(const char *buf) const; bool isLet() const { return Bits.Data.Constant; } Optional get(VarDecl *VD, const char *buf) const { if (!Bits.Data.HasValue) return None; if (VD) return SILDebugVariable(VD->getName().empty() ? "" : VD->getName().str(), VD->isLet(), getArgNo()); else return SILDebugVariable(getName(buf), isLet(), getArgNo()); } }; static_assert(sizeof(TailAllocatedDebugVariable) == 4, "SILNode inline bitfield needs updating"); //===----------------------------------------------------------------------===// // Allocation Instructions //===----------------------------------------------------------------------===// /// Abstract base class for allocation instructions, like alloc_stack, alloc_box /// and alloc_ref, etc. class AllocationInst : public SingleValueInstruction { protected: AllocationInst(SILInstructionKind Kind, SILDebugLocation DebugLoc, SILType Ty) : SingleValueInstruction(Kind, DebugLoc, Ty) {} public: DEFINE_ABSTRACT_SINGLE_VALUE_INST_BOILERPLATE(AllocationInst) /// Return the underlying variable declaration associated with this /// allocation, or null if this allocation inst is associated with a temporary /// allocation. VarDecl *getDecl() const; }; class DeallocStackInst; /// AllocStackInst - This represents the allocation of an unboxed (i.e., no /// reference count) stack memory. The memory is provided uninitialized. class AllocStackInst final : public InstructionBase, private llvm::TrailingObjects { friend TrailingObjects; friend SILBuilder; bool dynamicLifetime = false; AllocStackInst(SILDebugLocation Loc, SILType elementType, ArrayRef TypeDependentOperands, SILFunction &F, Optional Var, bool hasDynamicLifetime); static AllocStackInst *create(SILDebugLocation Loc, SILType elementType, SILFunction &F, SILOpenedArchetypesState &OpenedArchetypes, Optional Var, bool hasDynamicLifetime); size_t numTrailingObjects(OverloadToken) const { return SILInstruction::Bits.AllocStackInst.NumOperands; } public: ~AllocStackInst() { Operand *Operands = getTrailingObjects(); size_t end = SILInstruction::Bits.AllocStackInst.NumOperands; for (unsigned i = 0; i < end; ++i) { Operands[i].~Operand(); } } /// Set to true that this alloc_stack contains a value whose lifetime can not /// be ascertained from uses. /// /// As an example if an alloc_stack is known to be only conditionally /// initialized. void setDynamicLifetime() { dynamicLifetime = true; } /// Returns true if the alloc_stack's initialization can not be ascertained /// from uses directly (so should be treated conservatively). /// /// An example of an alloc_stack with dynamic lifetime is an alloc_stack that /// is conditionally initialized. bool hasDynamicLifetime() const { return dynamicLifetime; } /// Return the debug variable information attached to this instruction. Optional getVarInfo() const { auto RawValue = SILInstruction::Bits.AllocStackInst.VarInfo; auto VI = TailAllocatedDebugVariable(RawValue); return VI.get(getDecl(), getTrailingObjects()); }; void setArgNo(unsigned N) { auto RawValue = SILInstruction::Bits.AllocStackInst.VarInfo; auto VI = TailAllocatedDebugVariable(RawValue); VI.setArgNo(N); SILInstruction::Bits.AllocStackInst.VarInfo = VI.getRawValue(); } /// getElementType - Get the type of the allocated memory (as opposed to the /// type of the instruction itself, which will be an address type). SILType getElementType() const { return getType().getObjectType(); } ArrayRef getAllOperands() const { return { getTrailingObjects(), static_cast(SILInstruction::Bits.AllocStackInst.NumOperands) }; } MutableArrayRef getAllOperands() { return { getTrailingObjects(), static_cast(SILInstruction::Bits.AllocStackInst.NumOperands) }; } ArrayRef getTypeDependentOperands() const { return getAllOperands(); } MutableArrayRef getTypeDependentOperands() { return getAllOperands(); } /// Return a single dealloc_stack user or null. DeallocStackInst *getSingleDeallocStack() const; }; /// The base class for AllocRefInst and AllocRefDynamicInst. /// /// The first NumTailTypes operands are counts for the tail allocated /// elements, the remaining operands are opened archetype operands. class AllocRefInstBase : public AllocationInst { protected: AllocRefInstBase(SILInstructionKind Kind, SILDebugLocation DebugLoc, SILType ObjectType, bool objc, bool canBeOnStack, ArrayRef ElementTypes); SILType *getTypeStorage(); const SILType *getTypeStorage() const { return const_cast(this)->getTypeStorage(); } unsigned getNumTailTypes() const { return SILInstruction::Bits.AllocRefInstBase.NumTailTypes; } public: bool canAllocOnStack() const { return SILInstruction::Bits.AllocRefInstBase.OnStack; } void setStackAllocatable(bool OnStack = true) { SILInstruction::Bits.AllocRefInstBase.OnStack = OnStack; } ArrayRef getTailAllocatedTypes() const { return {getTypeStorage(), getNumTailTypes()}; } MutableArrayRef getTailAllocatedTypes() { return {getTypeStorage(), getNumTailTypes()}; } ArrayRef getTailAllocatedCounts() const { return getAllOperands().slice(0, getNumTailTypes()); } MutableArrayRef getTailAllocatedCounts() { return getAllOperands().slice(0, getNumTailTypes()); } ArrayRef getAllOperands() const; MutableArrayRef getAllOperands(); /// Whether to use Objective-C's allocation mechanism (+allocWithZone:). bool isObjC() const { return SILInstruction::Bits.AllocRefInstBase.ObjC; } }; /// AllocRefInst - This represents the primitive allocation of an instance /// of a reference type. Aside from the reference count, the instance is /// returned uninitialized. /// Optionally, the allocated instance contains space for one or more tail- /// allocated arrays. class AllocRefInst final : public InstructionBaseWithTrailingOperands< SILInstructionKind::AllocRefInst, AllocRefInst, AllocRefInstBase, SILType> { friend AllocRefInstBase; friend SILBuilder; AllocRefInst(SILDebugLocation DebugLoc, SILFunction &F, SILType ObjectType, bool objc, bool canBeOnStack, ArrayRef ElementTypes, ArrayRef AllOperands) : InstructionBaseWithTrailingOperands(AllOperands, DebugLoc, ObjectType, objc, canBeOnStack, ElementTypes) { assert(AllOperands.size() >= ElementTypes.size()); std::uninitialized_copy(ElementTypes.begin(), ElementTypes.end(), getTrailingObjects()); } static AllocRefInst *create(SILDebugLocation DebugLoc, SILFunction &F, SILType ObjectType, bool objc, bool canBeOnStack, ArrayRef ElementTypes, ArrayRef ElementCountOperands, SILOpenedArchetypesState &OpenedArchetypes); public: ArrayRef getTypeDependentOperands() const { return getAllOperands().slice(getNumTailTypes()); } MutableArrayRef getTypeDependentOperands() { return getAllOperands().slice(getNumTailTypes()); } }; /// AllocRefDynamicInst - This represents the primitive allocation of /// an instance of a reference type whose runtime type is provided by /// the given metatype value. Aside from the reference count, the /// instance is returned uninitialized. /// Optionally, the allocated instance contains space for one or more tail- /// allocated arrays. class AllocRefDynamicInst final : public InstructionBaseWithTrailingOperands< SILInstructionKind::AllocRefDynamicInst, AllocRefDynamicInst, AllocRefInstBase, SILType> { friend AllocRefInstBase; friend SILBuilder; AllocRefDynamicInst(SILDebugLocation DebugLoc, SILType ty, bool objc, ArrayRef ElementTypes, ArrayRef AllOperands) : InstructionBaseWithTrailingOperands(AllOperands, DebugLoc, ty, objc, false, ElementTypes) { assert(AllOperands.size() >= ElementTypes.size() + 1); std::uninitialized_copy(ElementTypes.begin(), ElementTypes.end(), getTrailingObjects()); } static AllocRefDynamicInst * create(SILDebugLocation DebugLoc, SILFunction &F, SILValue metatypeOperand, SILType ty, bool objc, ArrayRef ElementTypes, ArrayRef ElementCountOperands, SILOpenedArchetypesState &OpenedArchetypes); public: SILValue getMetatypeOperand() const { return getAllOperands()[getNumTailTypes()].get(); } ArrayRef getTypeDependentOperands() const { return getAllOperands().slice(getNumTailTypes() + 1); } MutableArrayRef getTypeDependentOperands() { return getAllOperands().slice(getNumTailTypes() + 1); } }; /// AllocValueBufferInst - Allocate memory in a value buffer. class AllocValueBufferInst final : public UnaryInstructionWithTypeDependentOperandsBase< SILInstructionKind::AllocValueBufferInst, AllocValueBufferInst, AllocationInst> { friend SILBuilder; AllocValueBufferInst(SILDebugLocation DebugLoc, SILType valueType, SILValue operand, ArrayRef TypeDependentOperands); static AllocValueBufferInst * create(SILDebugLocation DebugLoc, SILType valueType, SILValue operand, SILFunction &F, SILOpenedArchetypesState &OpenedArchetypes); public: SILType getValueType() const { return getType().getObjectType(); } }; /// This represents the allocation of a heap box for a Swift value of some type. /// The instruction returns two values. The first return value is the object /// pointer with Builtin.NativeObject type. The second return value /// is an address pointing to the contained element. The contained /// element is uninitialized. class AllocBoxInst final : public InstructionBaseWithTrailingOperands< SILInstructionKind::AllocBoxInst, AllocBoxInst, AllocationInst, char> { friend SILBuilder; TailAllocatedDebugVariable VarInfo; bool dynamicLifetime = false; AllocBoxInst(SILDebugLocation DebugLoc, CanSILBoxType BoxType, ArrayRef TypeDependentOperands, SILFunction &F, Optional Var, bool hasDynamicLifetime); static AllocBoxInst *create(SILDebugLocation Loc, CanSILBoxType boxType, SILFunction &F, SILOpenedArchetypesState &OpenedArchetypes, Optional Var, bool hasDynamicLifetime); public: CanSILBoxType getBoxType() const { return getType().castTo(); } void setDynamicLifetime() { dynamicLifetime = true; } bool hasDynamicLifetime() const { return dynamicLifetime; } // Return the type of the memory stored in the alloc_box. SILType getAddressType() const; /// Return the debug variable information attached to this instruction. Optional getVarInfo() const { return VarInfo.get(getDecl(), getTrailingObjects()); }; ArrayRef getTypeDependentOperands() const { return getAllOperands(); } MutableArrayRef getTypeDependentOperands() { return getAllOperands(); } }; /// This represents the allocation of a heap box for an existential container. /// The instruction returns two values. The first return value is the owner /// pointer, which has the existential type. The second return value /// is an address pointing to the contained element. The contained /// value is uninitialized. class AllocExistentialBoxInst final : public InstructionBaseWithTrailingOperands< SILInstructionKind::AllocExistentialBoxInst, AllocExistentialBoxInst, AllocationInst> { friend SILBuilder; CanType ConcreteType; ArrayRef Conformances; AllocExistentialBoxInst(SILDebugLocation DebugLoc, SILType ExistentialType, CanType ConcreteType, ArrayRef Conformances, ArrayRef TypeDependentOperands, SILFunction *Parent) : InstructionBaseWithTrailingOperands(TypeDependentOperands, DebugLoc, ExistentialType.getObjectType()), ConcreteType(ConcreteType), Conformances(Conformances) {} static AllocExistentialBoxInst * create(SILDebugLocation DebugLoc, SILType ExistentialType, CanType ConcreteType, ArrayRef Conformances, SILFunction *Parent, SILOpenedArchetypesState &OpenedArchetypes); public: CanType getFormalConcreteType() const { return ConcreteType; } SILType getExistentialType() const { return getType(); } ArrayRef getConformances() const { return Conformances; } ArrayRef getTypeDependentOperands() const { return getAllOperands(); } MutableArrayRef getTypeDependentOperands() { return getAllOperands(); } }; /// GenericSpecializationInformation - provides information about a generic /// specialization. This meta-information is created for each generic /// specialization, which allows for tracking of dependencies between /// specialized generic functions and can be used to detect specialization loops /// during generic specialization. class GenericSpecializationInformation { /// The caller function that triggered this specialization. SILFunction *Caller; /// The original function that was specialized. SILFunction *Parent; /// Substitutions used to produce this specialization. SubstitutionMap Subs; GenericSpecializationInformation(SILFunction *Caller, SILFunction *Parent, SubstitutionMap Subs); public: static const GenericSpecializationInformation *create(SILFunction *Caller, SILFunction *Parent, SubstitutionMap Subs); static const GenericSpecializationInformation *create(SILInstruction *Inst, SILBuilder &B); const SILFunction *getCaller() const { return Caller; } const SILFunction *getParent() const { return Parent; } SubstitutionMap getSubstitutions() const { return Subs; } }; class PartialApplyInst; // There's no good reason for the OverloadToken type to be internal // or protected, and it makes it very difficult to write our CRTP classes // if it is, so pull it out. TODO: just fix LLVM. struct TerribleOverloadTokenHack : llvm::trailing_objects_internal::TrailingObjectsBase { template using Hack = OverloadToken; }; template using OverloadToken = TerribleOverloadTokenHack::Hack; /// ApplyInstBase - An abstract class for different kinds of function /// application. template ::value> class ApplyInstBase; // The partial specialization for non-full applies. Note that the // partial specialization for full applies inherits from this. template class ApplyInstBase : public Base { enum { Callee, NumStaticOperands }; /// The type of the callee with our substitutions applied. SILType SubstCalleeType; /// Information about specialization and inlining of this apply. /// This is only != nullptr if the apply was inlined. And in this case it /// points to the specialization info of the inlined function. const GenericSpecializationInformation *SpecializationInfo; /// Used for apply_inst instructions: true if the called function has an /// error result but is not actually throwing. unsigned NonThrowing: 1; /// The number of call arguments as required by the callee. unsigned NumCallArguments : 31; /// The total number of type-dependent operands. unsigned NumTypeDependentOperands; /// The substitutions being applied to the callee. SubstitutionMap Substitutions; Impl &asImpl() { return static_cast(*this); } const Impl &asImpl() const { return static_cast(*this); } protected: template ApplyInstBase(SILInstructionKind kind, SILDebugLocation DebugLoc, SILValue callee, SILType substCalleeType, SubstitutionMap subs, ArrayRef args, ArrayRef typeDependentOperands, const GenericSpecializationInformation *specializationInfo, As... baseArgs) : Base(kind, DebugLoc, baseArgs...), SubstCalleeType(substCalleeType), SpecializationInfo(specializationInfo), NonThrowing(false), NumCallArguments(args.size()), NumTypeDependentOperands(typeDependentOperands.size()), Substitutions(subs) { // Initialize the operands. auto allOperands = getAllOperands(); new (&allOperands[Callee]) Operand(this, callee); for (size_t i : indices(args)) { new (&allOperands[NumStaticOperands + i]) Operand(this, args[i]); } for (size_t i : indices(typeDependentOperands)) { new (&allOperands[NumStaticOperands + args.size() + i]) Operand(this, typeDependentOperands[i]); } } ~ApplyInstBase() { for (auto &operand : getAllOperands()) operand.~Operand(); } template friend class llvm::TrailingObjects; unsigned numTrailingObjects(OverloadToken) const { return getNumAllOperands(); } static size_t getNumAllOperands(ArrayRef args, ArrayRef typeDependentOperands) { return NumStaticOperands + args.size() + typeDependentOperands.size(); } void setNonThrowing(bool isNonThrowing) { NonThrowing = isNonThrowing; } bool isNonThrowingApply() const { return NonThrowing; } public: /// The operand number of the first argument. static unsigned getArgumentOperandNumber() { return NumStaticOperands; } Operand *getCalleeOperand() { return &getAllOperands()[Callee]; } const Operand *getCalleeOperand() const { return &getAllOperands()[Callee]; } SILValue getCallee() const { return getCalleeOperand()->get(); } /// Gets the origin of the callee by looking through function type conversions /// until we find a function_ref, partial_apply, or unrecognized value. /// /// This is defined out of line to work around incomplete definition /// issues. It is at the bottom of the file. SILValue getCalleeOrigin() const; /// Gets the referenced function by looking through partial apply, /// convert_function, and thin to thick function until we find a function_ref. /// /// This is defined out of line to work around incomplete definition /// issues. It is at the bottom of the file. SILFunction *getCalleeFunction() const; bool isCalleeDynamicallyReplaceable() const; /// Gets the referenced function if the callee is a function_ref instruction. /// Returns null if the callee is dynamic or a (prev_)dynamic_function_ref /// instruction. SILFunction *getReferencedFunctionOrNull() const { if (auto *FRI = dyn_cast(getCallee())) return FRI->getReferencedFunctionOrNull(); return nullptr; } /// Return the referenced function if the callee is a function_ref like /// instruction. /// /// WARNING: This not necessarily the function that will be called at runtime. /// If the callee is a (prev_)dynamic_function_ref the actual function called /// might be different because it could be dynamically replaced at runtime. /// /// If the client of this API wants to look at the content of the returned SIL /// function it should call getReferencedFunctionOrNull() instead. SILFunction *getInitiallyReferencedFunction() const { if (auto *FRI = dyn_cast(getCallee())) return FRI->getInitiallyReferencedFunction(); return nullptr; } /// Get the type of the callee without the applied substitutions. CanSILFunctionType getOrigCalleeType() const { return getCallee()->getType().template castTo(); } SILFunctionConventions getOrigCalleeConv() const { return SILFunctionConventions(getOrigCalleeType(), this->getModule()); } /// Get the type of the callee with the applied substitutions. CanSILFunctionType getSubstCalleeType() const { return SubstCalleeType.castTo(); } SILType getSubstCalleeSILType() const { return SubstCalleeType; } void setSubstCalleeType(CanSILFunctionType t) { SubstCalleeType = SILType::getPrimitiveObjectType(t); } SILFunctionConventions getSubstCalleeConv() const { return SILFunctionConventions(getSubstCalleeType(), this->getModule()); } bool isCalleeNoReturn() const { return getSubstCalleeSILType().isNoReturnFunction(this->getModule()); } bool isCalleeThin() const { auto Rep = getSubstCalleeType()->getRepresentation(); return Rep == FunctionType::Representation::Thin; } /// Returns true if the callee function is annotated with /// @_semantics("programtermination_point") bool isCalleeKnownProgramTerminationPoint() const { auto calleeFn = getCalleeFunction(); if (!calleeFn) return false; return calleeFn->hasSemanticsAttr(SEMANTICS_PROGRAMTERMINATION_POINT); } /// True if this application has generic substitutions. bool hasSubstitutions() const { return Substitutions.hasAnySubstitutableParams(); } /// The substitutions used to bind the generic arguments of this function. SubstitutionMap getSubstitutionMap() const { return Substitutions; } /// Return the total number of operands of this instruction. unsigned getNumAllOperands() const { return NumStaticOperands + NumCallArguments + NumTypeDependentOperands; } /// Return all the operands of this instruction, which are (in order): /// - the callee /// - the formal arguments /// - the type-dependency arguments MutableArrayRef getAllOperands() { return { asImpl().template getTrailingObjects(), getNumAllOperands() }; } ArrayRef getAllOperands() const { return { asImpl().template getTrailingObjects(), getNumAllOperands() }; } /// Check whether the given operand index is a call-argument index /// and, if so, return that index. Optional getArgumentIndexForOperandIndex(unsigned index) { assert(index < getNumAllOperands()); if (index < NumStaticOperands) return None; index -= NumStaticOperands; if (index >= NumCallArguments) return None; return index; } /// The arguments passed to this instruction. MutableArrayRef getArgumentOperands() { return getAllOperands().slice(NumStaticOperands, NumCallArguments); } ArrayRef getArgumentOperands() const { return getAllOperands().slice(NumStaticOperands, NumCallArguments); } /// The arguments passed to this instruction. OperandValueArrayRef getArguments() const { return OperandValueArrayRef(getArgumentOperands()); } /// Returns the number of arguments being passed by this apply. /// If this is a partial_apply, it can be less than the number of /// parameters. unsigned getNumArguments() const { return NumCallArguments; } Operand &getArgumentRef(unsigned i) { return getArgumentOperands()[i]; } /// Return the ith argument passed to this instruction. SILValue getArgument(unsigned i) const { return getArguments()[i]; } /// Set the ith argument of this instruction. void setArgument(unsigned i, SILValue V) { return getArgumentOperands()[i].set(V); } ArrayRef getTypeDependentOperands() const { return getAllOperands().slice(NumStaticOperands + NumCallArguments); } MutableArrayRef getTypeDependentOperands() { return getAllOperands().slice(NumStaticOperands + NumCallArguments); } const GenericSpecializationInformation *getSpecializationInfo() const { return SpecializationInfo; } }; /// Given the callee operand of an apply or try_apply instruction, /// does it have the given semantics? bool doesApplyCalleeHaveSemantics(SILValue callee, StringRef semantics); /// Predicate used to filter InoutArgumentRange. struct OperandToInoutArgument { ArrayRef paramInfos; OperandValueArrayRef arguments; OperandToInoutArgument(ArrayRef paramInfos, OperandValueArrayRef arguments) : paramInfos(paramInfos), arguments(arguments) { assert(paramInfos.size() == arguments.size()); } Optional operator()(size_t i) const { if (paramInfos[i].isIndirectMutating()) return arguments[i]; return None; } }; using InoutArgumentRange = OptionalTransformRange, OperandToInoutArgument>; /// The partial specialization of ApplyInstBase for full applications. /// Adds some methods relating to 'self' and to result types that don't /// make sense for partial applications. template class ApplyInstBase : public ApplyInstBase { using super = ApplyInstBase; protected: template ApplyInstBase(As &&...args) : ApplyInstBase(std::forward(args)...) {} private: const Impl &asImpl() const { return static_cast(*this); } public: using super::getCallee; using super::getSubstCalleeType; using super::getSubstCalleeConv; using super::hasSubstitutions; using super::getNumArguments; using super::getArgument; using super::getArguments; using super::getArgumentOperands; /// The collection of following routines wrap the representation difference in /// between the self substitution being first, but the self parameter of a /// function being last. /// /// The hope is that this will prevent any future bugs from coming up related /// to this. /// /// Self is always the last parameter, but self substitutions are always /// first. The reason to add this method is to wrap that dichotomy to reduce /// errors. /// /// FIXME: Could this be standardized? It has and will lead to bugs. IMHO. SILValue getSelfArgument() const { assert(hasSelfArgument() && "Must have a self argument"); assert(getNumArguments() && "Should only be called when Callee has " "arguments."); return getArgument(getNumArguments()-1); } Operand &getSelfArgumentOperand() { assert(hasSelfArgument() && "Must have a self argument"); assert(getNumArguments() && "Should only be called when Callee has " "arguments."); return getArgumentOperands()[getNumArguments()-1]; } void setSelfArgument(SILValue V) { assert(hasSelfArgument() && "Must have a self argument"); assert(getNumArguments() && "Should only be called when Callee has " "arguments."); getArgumentOperands()[getNumArguments() - 1].set(V); } OperandValueArrayRef getArgumentsWithoutSelf() const { assert(hasSelfArgument() && "Must have a self argument"); assert(getNumArguments() && "Should only be called when Callee has " "at least a self parameter."); ArrayRef ops = this->getArgumentOperands(); ArrayRef opsWithoutSelf = ArrayRef(&ops[0], ops.size()-1); return OperandValueArrayRef(opsWithoutSelf); } Optional getSingleResult() const { auto SubstCallee = getSubstCalleeType(); if (SubstCallee->getNumAllResults() != 1) return None; return SubstCallee->getSingleResult(); } bool hasIndirectResults() const { return getSubstCalleeConv().hasIndirectSILResults(); } unsigned getNumIndirectResults() const { return getSubstCalleeConv().getNumIndirectSILResults(); } bool hasSelfArgument() const { return getSubstCalleeType()->hasSelfParam(); } bool hasGuaranteedSelfArgument() const { auto C = getSubstCalleeType()->getSelfParameter().getConvention(); return C == ParameterConvention::Direct_Guaranteed; } OperandValueArrayRef getIndirectSILResults() const { return getArguments().slice(0, getNumIndirectResults()); } OperandValueArrayRef getArgumentsWithoutIndirectResults() const { return getArguments().slice(getNumIndirectResults()); } /// Returns all `@inout` and `@inout_aliasable` arguments passed to the /// instruction. InoutArgumentRange getInoutArguments() const { auto &impl = asImpl(); return InoutArgumentRange( indices(getArgumentsWithoutIndirectResults()), OperandToInoutArgument(impl.getSubstCalleeConv().getParameters(), impl.getArgumentsWithoutIndirectResults())); } bool hasSemantics(StringRef semanticsString) const { return doesApplyCalleeHaveSemantics(getCallee(), semanticsString); } }; /// ApplyInst - Represents the full application of a function value. class ApplyInst final : public InstructionBase>, public llvm::TrailingObjects { friend SILBuilder; ApplyInst(SILDebugLocation DebugLoc, SILValue Callee, SILType SubstCalleeType, SILType ReturnType, SubstitutionMap Substitutions, ArrayRef Args, ArrayRef TypeDependentOperands, bool isNonThrowing, const GenericSpecializationInformation *SpecializationInfo); static ApplyInst * create(SILDebugLocation DebugLoc, SILValue Callee, SubstitutionMap Substitutions, ArrayRef Args, bool isNonThrowing, Optional ModuleConventions, SILFunction &F, SILOpenedArchetypesState &OpenedArchetypes, const GenericSpecializationInformation *SpecializationInfo); public: /// Returns true if the called function has an error result but is not actually /// throwing an error. bool isNonThrowing() const { return isNonThrowingApply(); } }; /// PartialApplyInst - Represents the creation of a closure object by partial /// application of a function value. class PartialApplyInst final : public InstructionBase>, public llvm::TrailingObjects { friend SILBuilder; public: enum OnStackKind { NotOnStack, OnStack }; private: PartialApplyInst(SILDebugLocation DebugLoc, SILValue Callee, SILType SubstCalleeType, SubstitutionMap Substitutions, ArrayRef Args, ArrayRef TypeDependentOperands, SILType ClosureType, const GenericSpecializationInformation *SpecializationInfo); static PartialApplyInst * create(SILDebugLocation DebugLoc, SILValue Callee, ArrayRef Args, SubstitutionMap Substitutions, ParameterConvention CalleeConvention, SILFunction &F, SILOpenedArchetypesState &OpenedArchetypes, const GenericSpecializationInformation *SpecializationInfo, OnStackKind onStack); public: /// Return the result function type of this partial apply. CanSILFunctionType getFunctionType() const { return getType().castTo(); } bool hasCalleeGuaranteedContext() const { return getType().castTo()->isCalleeGuaranteed(); } OnStackKind isOnStack() const { return getFunctionType()->isNoEscape() ? OnStack : NotOnStack; } }; class BeginApplyInst; class BeginApplyResult final : public MultipleValueInstructionResult { public: BeginApplyResult(unsigned index, SILType type, ValueOwnershipKind ownershipKind) : MultipleValueInstructionResult(ValueKind::BeginApplyResult, index, type, ownershipKind) {} BeginApplyInst *getParent(); // inline below const BeginApplyInst *getParent() const { return const_cast(this)->getParent(); } /// Is this result the token result of the begin_apply, which abstracts /// over the implicit coroutine state? bool isTokenResult() const; // inline below static bool classof(const SILNode *N) { return N->getKind() == SILNodeKind::BeginApplyResult; } }; class EndApplyInst; class AbortApplyInst; /// BeginApplyInst - Represents the beginning of the full application of /// a yield_once coroutine (up until the coroutine yields a value back). class BeginApplyInst final : public InstructionBase>, public MultipleValueInstructionTrailingObjects< BeginApplyInst, BeginApplyResult, // These must be earlier trailing objects because their // count fields are initialized by an earlier base class. InitialTrailingObjects> { friend SILBuilder; template friend class llvm::TrailingObjects; using InstructionBase::numTrailingObjects; using MultipleValueInstructionTrailingObjects::numTrailingObjects; friend class ApplyInstBase; using MultipleValueInstructionTrailingObjects::getTrailingObjects; BeginApplyInst(SILDebugLocation debugLoc, SILValue callee, SILType substCalleeType, ArrayRef allResultTypes, ArrayRef allResultOwnerships, SubstitutionMap substitutions, ArrayRef args, ArrayRef typeDependentOperands, bool isNonThrowing, const GenericSpecializationInformation *specializationInfo); static BeginApplyInst * create(SILDebugLocation debugLoc, SILValue Callee, SubstitutionMap substitutions, ArrayRef args, bool isNonThrowing, Optional moduleConventions, SILFunction &F, SILOpenedArchetypesState &openedArchetypes, const GenericSpecializationInformation *specializationInfo); public: using MultipleValueInstructionTrailingObjects::totalSizeToAlloc; SILValue getTokenResult() const { return &getAllResultsBuffer().back(); } SILInstructionResultArray getYieldedValues() const { return getAllResultsBuffer().drop_back(); } /// Returns true if the called coroutine has an error result but is not /// actually throwing an error. bool isNonThrowing() const { return isNonThrowingApply(); } void getCoroutineEndPoints( SmallVectorImpl &endApplyInsts, SmallVectorImpl &abortApplyInsts) const; void getCoroutineEndPoints(SmallVectorImpl &endApplyInsts, SmallVectorImpl &abortApplyInsts) const; }; inline BeginApplyInst *BeginApplyResult::getParent() { auto *Parent = MultipleValueInstructionResult::getParent(); return cast(Parent); } inline bool BeginApplyResult::isTokenResult() const { return getIndex() == getParent()->getNumResults() - 1; } /// AbortApplyInst - Unwind the full application of a yield_once coroutine. class AbortApplyInst : public UnaryInstructionBase { friend SILBuilder; AbortApplyInst(SILDebugLocation debugLoc, SILValue beginApplyToken) : UnaryInstructionBase(debugLoc, beginApplyToken) { assert(isa(beginApplyToken) && cast(beginApplyToken)->isTokenResult()); } public: BeginApplyInst *getBeginApply() const { return cast(getOperand())->getParent(); } }; /// EndApplyInst - Resume the full application of a yield_once coroutine /// normally. class EndApplyInst : public UnaryInstructionBase { friend SILBuilder; EndApplyInst(SILDebugLocation debugLoc, SILValue beginApplyToken) : UnaryInstructionBase(debugLoc, beginApplyToken) { assert(isa(beginApplyToken) && cast(beginApplyToken)->isTokenResult()); } public: BeginApplyInst *getBeginApply() const { return cast(getOperand())->getParent(); } }; //===----------------------------------------------------------------------===// // Literal instructions. //===----------------------------------------------------------------------===// /// Abstract base class for literal instructions. class LiteralInst : public SingleValueInstruction { protected: LiteralInst(SILInstructionKind Kind, SILDebugLocation DebugLoc, SILType Ty) : SingleValueInstruction(Kind, DebugLoc, Ty) {} public: DEFINE_ABSTRACT_SINGLE_VALUE_INST_BOILERPLATE(LiteralInst) }; class FunctionRefBaseInst : public LiteralInst { SILFunction *f; protected: FunctionRefBaseInst(SILInstructionKind Kind, SILDebugLocation DebugLoc, SILFunction *F, TypeExpansionContext context); public: ~FunctionRefBaseInst(); /// Return the referenced function if this is a function_ref instruction and /// therefore a client can rely on the dynamically called function being equal /// to the returned value and null otherwise. SILFunction *getReferencedFunctionOrNull() const { auto kind = getKind(); if (kind == SILInstructionKind::FunctionRefInst) return f; assert(kind == SILInstructionKind::DynamicFunctionRefInst || kind == SILInstructionKind::PreviousDynamicFunctionRefInst); return nullptr; } /// Return the initially referenced function. /// /// WARNING: This not necessarily the function that will be called at runtime. /// If the callee is a (prev_)dynamic_function_ref the actual function called /// might be different because it could be dynamically replaced at runtime. /// /// If the client of this API wants to look at the content of the returned SIL /// function it should call getReferencedFunctionOrNull() instead. SILFunction *getInitiallyReferencedFunction() const { return f; } void dropReferencedFunction(); CanSILFunctionType getFunctionType() const { return getType().castTo(); } SILFunctionConventions getConventions() const { return SILFunctionConventions(getFunctionType(), getModule()); } ArrayRef getAllOperands() const { return {}; } MutableArrayRef getAllOperands() { return {}; } static bool classof(const SILNode *node) { return (node->getKind() == SILNodeKind::FunctionRefInst || node->getKind() == SILNodeKind::DynamicFunctionRefInst || node->getKind() == SILNodeKind::PreviousDynamicFunctionRefInst); } static bool classof(const SingleValueInstruction *node) { return (node->getKind() == SILInstructionKind::FunctionRefInst || node->getKind() == SILInstructionKind::DynamicFunctionRefInst || node->getKind() == SILInstructionKind::PreviousDynamicFunctionRefInst); } }; /// FunctionRefInst - Represents a reference to a SIL function. class FunctionRefInst : public FunctionRefBaseInst { friend SILBuilder; /// Construct a FunctionRefInst. /// /// \param DebugLoc The location of the reference. /// \param F The function being referenced. /// \param context The type expansion context of the function reference. FunctionRefInst(SILDebugLocation DebugLoc, SILFunction *F, TypeExpansionContext context); public: static bool classof(const SILNode *node) { return node->getKind() == SILNodeKind::FunctionRefInst; } static bool classof(const SingleValueInstruction *node) { return node->getKind() == SILInstructionKind::FunctionRefInst; } }; class DynamicFunctionRefInst : public FunctionRefBaseInst { friend SILBuilder; /// Construct a DynamicFunctionRefInst. /// /// \param DebugLoc The location of the reference. /// \param F The function being referenced. /// \param context The type expansion context of the function reference. DynamicFunctionRefInst(SILDebugLocation DebugLoc, SILFunction *F, TypeExpansionContext context); public: static bool classof(const SILNode *node) { return node->getKind() == SILNodeKind::DynamicFunctionRefInst; } static bool classof(const SingleValueInstruction *node) { return node->getKind() == SILInstructionKind::DynamicFunctionRefInst; } }; class PreviousDynamicFunctionRefInst : public FunctionRefBaseInst { friend SILBuilder; /// Construct a PreviousDynamicFunctionRefInst. /// /// \param DebugLoc The location of the reference. /// \param F The function being referenced. /// \param context The type expansion context of the function reference. PreviousDynamicFunctionRefInst(SILDebugLocation DebugLoc, SILFunction *F, TypeExpansionContext context); public: static bool classof(const SILNode *node) { return node->getKind() == SILNodeKind::PreviousDynamicFunctionRefInst; } static bool classof(const SingleValueInstruction *node) { return node->getKind() == SILInstructionKind::PreviousDynamicFunctionRefInst; } }; /// Component of a KeyPathInst. class KeyPathPatternComponent { public: /// Computed property components require an identifier so they can be stably /// identified at runtime. This has to correspond to the ABI of the property-- /// whether a reabstracted stored property, a property dispatched through a /// vtable or witness table, or a computed property. class ComputedPropertyId { friend KeyPathPatternComponent; public: enum KindType { Property, Function, DeclRef, }; private: union ValueType { AbstractStorageDecl *Property; SILFunction *Function; SILDeclRef DeclRef; ValueType() : Property(nullptr) {} ValueType(AbstractStorageDecl *p) : Property(p) {} ValueType(SILFunction *f) : Function(f) {} ValueType(SILDeclRef d) : DeclRef(d) {} } Value; KindType Kind; explicit ComputedPropertyId(ValueType Value, KindType Kind) : Value(Value), Kind(Kind) {} public: ComputedPropertyId() : Value(), Kind(Property) {} /*implicit*/ ComputedPropertyId(VarDecl *property) : Value{property}, Kind{Property} { } /*implicit*/ ComputedPropertyId(SILFunction *function) : Value{function}, Kind{Function} {} /*implicit*/ ComputedPropertyId(SILDeclRef declRef) : Value{declRef}, Kind{DeclRef} {} KindType getKind() const { return Kind; } VarDecl *getProperty() const { assert(getKind() == Property); return cast(Value.Property); } SILFunction *getFunction() const { assert(getKind() == Function); return Value.Function; } SILDeclRef getDeclRef() const { assert(getKind() == DeclRef); return Value.DeclRef; } }; enum class Kind: unsigned { StoredProperty, GettableProperty, SettableProperty, TupleElement, OptionalChain, OptionalForce, OptionalWrap, }; // Description of a captured index value and its Hashable conformance for a // subscript keypath. struct Index { unsigned Operand; CanType FormalType; SILType LoweredType; ProtocolConformanceRef Hashable; }; private: enum PackedKind: unsigned { PackedStored, PackedComputed, Unpacked, }; static const unsigned KindPackingBits = 2; static unsigned getPackedKind(Kind k) { switch (k) { case Kind::StoredProperty: case Kind::TupleElement: return PackedStored; case Kind::GettableProperty: case Kind::SettableProperty: return PackedComputed; case Kind::OptionalChain: case Kind::OptionalForce: case Kind::OptionalWrap: return Unpacked; } } // Value is the VarDecl* for StoredProperty, the SILFunction* of the // Getter for computed properties, or the Kind for other kinds llvm::PointerIntPair ValueAndKind; llvm::PointerIntPair SetterAndIdKind; // If this component refers to a tuple element then TupleIndex is the // 1-based index of the element in the tuple, in order to allow the // discrimination of the TupleElement Kind from the StoredProperty Kind union { unsigned TupleIndex = 0; ComputedPropertyId::ValueType IdValue; }; ArrayRef Indices; struct { SILFunction *Equal; SILFunction *Hash; } IndexEquality; CanType ComponentType; AbstractStorageDecl *ExternalStorage; SubstitutionMap ExternalSubstitutions; /// Constructor for stored components KeyPathPatternComponent(VarDecl *storedProp, CanType ComponentType) : ValueAndKind(storedProp, PackedStored), ComponentType(ComponentType) {} /// Constructor for computed components KeyPathPatternComponent(ComputedPropertyId id, SILFunction *getter, SILFunction *setter, ArrayRef indices, SILFunction *indicesEqual, SILFunction *indicesHash, AbstractStorageDecl *externalStorage, SubstitutionMap externalSubstitutions, CanType ComponentType) : ValueAndKind(getter, PackedComputed), SetterAndIdKind{setter, id.Kind}, IdValue{id.Value}, Indices(indices), IndexEquality{indicesEqual, indicesHash}, ComponentType(ComponentType), ExternalStorage(externalStorage), ExternalSubstitutions(externalSubstitutions) { } /// Constructor for optional components. KeyPathPatternComponent(Kind kind, CanType componentType) : ValueAndKind((void*)((uintptr_t)kind << KindPackingBits), Unpacked), ComponentType(componentType) { assert((unsigned)kind >= (unsigned)Kind::OptionalChain && "not an optional component"); } /// Constructor for tuple element. KeyPathPatternComponent(unsigned tupleIndex, CanType componentType) : ValueAndKind((void*)((uintptr_t)Kind::TupleElement << KindPackingBits), PackedStored), TupleIndex(tupleIndex + 1), ComponentType(componentType) { } public: KeyPathPatternComponent() : ValueAndKind(nullptr, 0) {} bool isNull() const { return ValueAndKind.getPointer() == nullptr; } Kind getKind() const { auto packedKind = ValueAndKind.getInt(); switch ((PackedKind)packedKind) { case PackedStored: return TupleIndex ? Kind::TupleElement : Kind::StoredProperty; case PackedComputed: return SetterAndIdKind.getPointer() ? Kind::SettableProperty : Kind::GettableProperty; case Unpacked: return (Kind)((uintptr_t)ValueAndKind.getPointer() >> KindPackingBits); } llvm_unreachable("unhandled kind"); } CanType getComponentType() const { return ComponentType; } VarDecl *getStoredPropertyDecl() const { switch (getKind()) { case Kind::StoredProperty: return static_cast(ValueAndKind.getPointer()); case Kind::GettableProperty: case Kind::SettableProperty: case Kind::OptionalChain: case Kind::OptionalForce: case Kind::OptionalWrap: case Kind::TupleElement: llvm_unreachable("not a stored property"); } llvm_unreachable("unhandled kind"); } ComputedPropertyId getComputedPropertyId() const { switch (getKind()) { case Kind::StoredProperty: case Kind::OptionalChain: case Kind::OptionalForce: case Kind::OptionalWrap: case Kind::TupleElement: llvm_unreachable("not a computed property"); case Kind::GettableProperty: case Kind::SettableProperty: return ComputedPropertyId(IdValue, SetterAndIdKind.getInt()); } llvm_unreachable("unhandled kind"); } SILFunction *getComputedPropertyGetter() const { switch (getKind()) { case Kind::StoredProperty: case Kind::OptionalChain: case Kind::OptionalForce: case Kind::OptionalWrap: case Kind::TupleElement: llvm_unreachable("not a computed property"); case Kind::GettableProperty: case Kind::SettableProperty: return static_cast(ValueAndKind.getPointer()); } llvm_unreachable("unhandled kind"); } SILFunction *getComputedPropertySetter() const { switch (getKind()) { case Kind::StoredProperty: case Kind::GettableProperty: case Kind::OptionalChain: case Kind::OptionalForce: case Kind::OptionalWrap: case Kind::TupleElement: llvm_unreachable("not a settable computed property"); case Kind::SettableProperty: return SetterAndIdKind.getPointer(); } llvm_unreachable("unhandled kind"); } ArrayRef getSubscriptIndices() const { switch (getKind()) { case Kind::StoredProperty: case Kind::OptionalChain: case Kind::OptionalForce: case Kind::OptionalWrap: case Kind::TupleElement: return {}; case Kind::GettableProperty: case Kind::SettableProperty: return Indices; } llvm_unreachable("unhandled kind"); } SILFunction *getSubscriptIndexEquals() const { switch (getKind()) { case Kind::StoredProperty: case Kind::OptionalChain: case Kind::OptionalForce: case Kind::OptionalWrap: case Kind::TupleElement: llvm_unreachable("not a computed property"); case Kind::GettableProperty: case Kind::SettableProperty: return IndexEquality.Equal; } llvm_unreachable("unhandled kind"); } SILFunction *getSubscriptIndexHash() const { switch (getKind()) { case Kind::StoredProperty: case Kind::OptionalChain: case Kind::OptionalForce: case Kind::OptionalWrap: case Kind::TupleElement: llvm_unreachable("not a computed property"); case Kind::GettableProperty: case Kind::SettableProperty: return IndexEquality.Hash; } llvm_unreachable("unhandled kind"); } bool isComputedSettablePropertyMutating() const; static KeyPathPatternComponent forStoredProperty(VarDecl *property, CanType ty) { return KeyPathPatternComponent(property, ty); } AbstractStorageDecl *getExternalDecl() const { switch (getKind()) { case Kind::StoredProperty: case Kind::OptionalChain: case Kind::OptionalForce: case Kind::OptionalWrap: case Kind::TupleElement: llvm_unreachable("not a computed property"); case Kind::GettableProperty: case Kind::SettableProperty: return ExternalStorage; } llvm_unreachable("unhandled kind"); } SubstitutionMap getExternalSubstitutions() const { switch (getKind()) { case Kind::StoredProperty: case Kind::OptionalChain: case Kind::OptionalForce: case Kind::OptionalWrap: case Kind::TupleElement: llvm_unreachable("not a computed property"); case Kind::GettableProperty: case Kind::SettableProperty: return ExternalSubstitutions; } llvm_unreachable("unhandled kind"); } unsigned getTupleIndex() const { switch (getKind()) { case Kind::StoredProperty: case Kind::OptionalChain: case Kind::OptionalForce: case Kind::OptionalWrap: case Kind::GettableProperty: case Kind::SettableProperty: llvm_unreachable("not a tuple element"); case Kind::TupleElement: return TupleIndex - 1; } llvm_unreachable("unhandled kind"); } static KeyPathPatternComponent forComputedGettableProperty(ComputedPropertyId identifier, SILFunction *getter, ArrayRef indices, SILFunction *indicesEquals, SILFunction *indicesHash, AbstractStorageDecl *externalDecl, SubstitutionMap externalSubs, CanType ty) { return KeyPathPatternComponent(identifier, getter, nullptr, indices, indicesEquals, indicesHash, externalDecl, externalSubs, ty); } static KeyPathPatternComponent forComputedSettableProperty(ComputedPropertyId identifier, SILFunction *getter, SILFunction *setter, ArrayRef indices, SILFunction *indicesEquals, SILFunction *indicesHash, AbstractStorageDecl *externalDecl, SubstitutionMap externalSubs, CanType ty) { return KeyPathPatternComponent(identifier, getter, setter, indices, indicesEquals, indicesHash, externalDecl, externalSubs, ty); } static KeyPathPatternComponent forOptional(Kind kind, CanType ty) { switch (kind) { case Kind::OptionalChain: case Kind::OptionalForce: break; case Kind::OptionalWrap: assert(ty->getOptionalObjectType() && "optional wrap didn't form optional?!"); break; case Kind::StoredProperty: case Kind::GettableProperty: case Kind::SettableProperty: case Kind::TupleElement: llvm_unreachable("not an optional kind"); } return KeyPathPatternComponent(kind, ty); } static KeyPathPatternComponent forTupleElement(unsigned tupleIndex, CanType ty) { return KeyPathPatternComponent(tupleIndex, ty); } void visitReferencedFunctionsAndMethods( std::function functionCallBack, std::function methodCallBack) const; void incrementRefCounts() const; void decrementRefCounts() const; void Profile(llvm::FoldingSetNodeID &ID); }; /// An abstract description of a key path pattern. class KeyPathPattern final : public llvm::FoldingSetNode, private llvm::TrailingObjects { friend TrailingObjects; unsigned NumOperands, NumComponents; CanGenericSignature Signature; CanType RootType, ValueType; StringRef ObjCString; KeyPathPattern(CanGenericSignature signature, CanType rootType, CanType valueType, ArrayRef components, StringRef ObjCString, unsigned numOperands); static KeyPathPattern *create(SILModule &M, CanGenericSignature signature, CanType rootType, CanType valueType, ArrayRef components, StringRef ObjCString, unsigned numOperands); public: CanGenericSignature getGenericSignature() const { return Signature; } CanType getRootType() const { return RootType; } CanType getValueType() const { return ValueType; } unsigned getNumOperands() const { return NumOperands; } StringRef getObjCString() const { return ObjCString; } ArrayRef getComponents() const; void visitReferencedFunctionsAndMethods( std::function functionCallBack, std::function methodCallBack) { for (auto &component : getComponents()) { component.visitReferencedFunctionsAndMethods(functionCallBack, methodCallBack); } } static KeyPathPattern *get(SILModule &M, CanGenericSignature signature, CanType rootType, CanType valueType, ArrayRef components, StringRef ObjCString); static void Profile(llvm::FoldingSetNodeID &ID, CanGenericSignature signature, CanType rootType, CanType valueType, ArrayRef components, StringRef ObjCString); void Profile(llvm::FoldingSetNodeID &ID) { Profile(ID, getGenericSignature(), getRootType(), getValueType(), getComponents(), getObjCString()); } }; /// Instantiates a key path object. class KeyPathInst final : public InstructionBase, private llvm::TrailingObjects { friend SILBuilder; friend TrailingObjects; KeyPathPattern *Pattern; unsigned NumOperands; SubstitutionMap Substitutions; static KeyPathInst *create(SILDebugLocation Loc, KeyPathPattern *Pattern, SubstitutionMap Subs, ArrayRef Args, SILType Ty, SILFunction &F); KeyPathInst(SILDebugLocation Loc, KeyPathPattern *Pattern, SubstitutionMap Subs, ArrayRef Args, SILType Ty); size_t numTrailingObjects(OverloadToken) const { return NumOperands; } public: KeyPathPattern *getPattern() const; bool hasPattern() const { return (bool)Pattern; } ArrayRef getAllOperands() const { return const_cast(this)->getAllOperands(); } MutableArrayRef getAllOperands(); SubstitutionMap getSubstitutions() const { return Substitutions; } void dropReferencedPattern(); ~KeyPathInst(); }; /// Represents an invocation of builtin functionality provided by the code /// generator. class BuiltinInst final : public InstructionBaseWithTrailingOperands< SILInstructionKind::BuiltinInst, BuiltinInst, SingleValueInstruction> { friend SILBuilder; /// The name of the builtin to invoke. Identifier Name; /// The substitutions. SubstitutionMap Substitutions; BuiltinInst(SILDebugLocation DebugLoc, Identifier Name, SILType ReturnType, SubstitutionMap Substitutions, ArrayRef Args); static BuiltinInst *create(SILDebugLocation DebugLoc, Identifier Name, SILType ReturnType, SubstitutionMap Substitutions, ArrayRef Args, SILModule &M); public: /// Return the name of the builtin operation. Identifier getName() const { return Name; } void setName(Identifier I) { Name = I; } /// Looks up the llvm intrinsic ID and type for the builtin function. /// /// \returns Returns llvm::Intrinsic::not_intrinsic if the function is not an /// intrinsic. The particular intrinsic functions which correspond to the /// returned value are defined in llvm/Intrinsics.h. const IntrinsicInfo &getIntrinsicInfo() const; /// Looks up the lazily cached identification for the builtin function. const BuiltinInfo &getBuiltinInfo() const; /// Looks up the llvm intrinsic ID of this builtin. Returns None if /// this is not an intrinsic. llvm::Optional getIntrinsicID() const { auto I = getIntrinsicInfo(); if (I.ID == llvm::Intrinsic::not_intrinsic) return None; return I.ID; } /// Looks up the BuiltinKind of this builtin. Returns None if this is /// not a builtin. Optional getBuiltinKind() const { auto I = getBuiltinInfo(); if (I.ID == BuiltinValueKind::None) return None; return I.ID; } /// True if this builtin application has substitutions, which represent type /// parameters to the builtin. bool hasSubstitutions() const { return Substitutions.hasAnySubstitutableParams(); } /// Return the type parameters to the builtin. SubstitutionMap getSubstitutions() const { return Substitutions; } /// The arguments to the builtin. OperandValueArrayRef getArguments() const { return OperandValueArrayRef(getAllOperands()); } }; /// Initializes a SIL global variable. Only valid once, before any /// usages of the global via GlobalAddrInst. class AllocGlobalInst : public InstructionBase { friend SILBuilder; SILGlobalVariable *Global; AllocGlobalInst(SILDebugLocation DebugLoc, SILGlobalVariable *Global); public: /// Return the referenced global variable. SILGlobalVariable *getReferencedGlobal() const { return Global; } void setReferencedGlobal(SILGlobalVariable *v) { Global = v; } ArrayRef getAllOperands() const { return {}; } MutableArrayRef getAllOperands() { return {}; } }; /// The base class for global_addr and global_value. class GlobalAccessInst : public LiteralInst { SILGlobalVariable *Global; protected: GlobalAccessInst(SILInstructionKind kind, SILDebugLocation loc, SILType ty, SILGlobalVariable *global) : LiteralInst(kind, loc, ty), Global(global) { } public: /// Return the referenced global variable. SILGlobalVariable *getReferencedGlobal() const { return Global; } void setReferencedGlobal(SILGlobalVariable *v) { Global = v; } ArrayRef getAllOperands() const { return {}; } MutableArrayRef getAllOperands() { return {}; } }; /// Gives the address of a SIL global variable. Only valid after an /// AllocGlobalInst. class GlobalAddrInst : public InstructionBase { friend SILBuilder; GlobalAddrInst(SILDebugLocation DebugLoc, SILGlobalVariable *Global, TypeExpansionContext context); public: // FIXME: This constructor should be private but is currently used // in the SILParser. /// Create a placeholder instruction with an unset global reference. GlobalAddrInst(SILDebugLocation DebugLoc, SILType Ty) : InstructionBase(DebugLoc, Ty, nullptr) {} }; /// Gives the value of a global variable. /// /// The referenced global variable must be a statically initialized object. /// TODO: in future we might support global variables in general. class GlobalValueInst : public InstructionBase { friend SILBuilder; GlobalValueInst(SILDebugLocation DebugLoc, SILGlobalVariable *Global, TypeExpansionContext context); }; /// IntegerLiteralInst - Encapsulates an integer constant, as defined originally /// by an IntegerLiteralExpr. class IntegerLiteralInst final : public InstructionBase, private llvm::TrailingObjects { friend TrailingObjects; friend SILBuilder; IntegerLiteralInst(SILDebugLocation Loc, SILType Ty, const APInt &Value); static IntegerLiteralInst *create(IntegerLiteralExpr *E, SILDebugLocation Loc, SILModule &M); static IntegerLiteralInst *create(SILDebugLocation Loc, SILType Ty, intmax_t Value, SILModule &M); static IntegerLiteralInst *create(SILDebugLocation Loc, SILType Ty, const APInt &Value, SILModule &M); public: /// getValue - Return the APInt for the underlying integer literal. APInt getValue() const; ArrayRef getAllOperands() const { return {}; } MutableArrayRef getAllOperands() { return {}; } }; /// FloatLiteralInst - Encapsulates a floating point constant, as defined /// originally by a FloatLiteralExpr. class FloatLiteralInst final : public InstructionBase, private llvm::TrailingObjects { friend TrailingObjects; friend SILBuilder; FloatLiteralInst(SILDebugLocation Loc, SILType Ty, const APInt &Bits); static FloatLiteralInst *create(FloatLiteralExpr *E, SILDebugLocation Loc, SILModule &M); static FloatLiteralInst *create(SILDebugLocation Loc, SILType Ty, const APFloat &Value, SILModule &M); public: /// Return the APFloat for the underlying FP literal. APFloat getValue() const; /// Return the bitcast representation of the FP literal as an APInt. APInt getBits() const; ArrayRef getAllOperands() const { return {}; } MutableArrayRef getAllOperands() { return {}; } }; /// StringLiteralInst - Encapsulates a string constant, as defined originally by /// a StringLiteralExpr. This produces the address of the string data as a /// Builtin.RawPointer. class StringLiteralInst final : public InstructionBase, private llvm::TrailingObjects { friend TrailingObjects; friend SILBuilder; public: enum class Encoding { Bytes, UTF8, UTF16, /// UTF-8 encoding of an Objective-C selector. ObjCSelector, }; private: StringLiteralInst(SILDebugLocation DebugLoc, StringRef text, Encoding encoding, SILType ty); static StringLiteralInst *create(SILDebugLocation DebugLoc, StringRef Text, Encoding encoding, SILModule &M); public: /// getValue - Return the string data for the literal, in UTF-8. StringRef getValue() const { return {getTrailingObjects(), SILInstruction::Bits.StringLiteralInst.Length}; } /// getEncoding - Return the desired encoding of the text. Encoding getEncoding() const { return Encoding(SILInstruction::Bits.StringLiteralInst.TheEncoding); } /// getCodeUnitCount - Return encoding-based length of the string /// literal in code units. uint64_t getCodeUnitCount(); ArrayRef getAllOperands() const { return {}; } MutableArrayRef getAllOperands() { return {}; } }; //===----------------------------------------------------------------------===// // Memory instructions. //===----------------------------------------------------------------------===// /// StringLiteralInst::Encoding hashes to its underlying integer representation. static inline llvm::hash_code hash_value(StringLiteralInst::Encoding E) { return llvm::hash_value(size_t(E)); } // *NOTE* When serializing, we can only represent up to 4 values here. If more // qualifiers are added, SIL serialization must be updated. enum class LoadOwnershipQualifier { Unqualified, Take, Copy, Trivial }; static_assert(2 == SILNode::NumLoadOwnershipQualifierBits, "Size mismatch"); /// LoadInst - Represents a load from a memory location. class LoadInst : public UnaryInstructionBase { friend SILBuilder; /// Constructs a LoadInst. /// /// \param DebugLoc The location of the expression that caused the load. /// /// \param LValue The SILValue representing the lvalue (address) to /// use for the load. LoadInst(SILDebugLocation DebugLoc, SILValue LValue, LoadOwnershipQualifier Q = LoadOwnershipQualifier::Unqualified) : UnaryInstructionBase(DebugLoc, LValue, LValue->getType().getObjectType()) { SILInstruction::Bits.LoadInst.OwnershipQualifier = unsigned(Q); } public: LoadOwnershipQualifier getOwnershipQualifier() const { return LoadOwnershipQualifier( SILInstruction::Bits.LoadInst.OwnershipQualifier); } void setOwnershipQualifier(LoadOwnershipQualifier qualifier) { SILInstruction::Bits.LoadInst.OwnershipQualifier = unsigned(qualifier); } }; // *NOTE* When serializing, we can only represent up to 4 values here. If more // qualifiers are added, SIL serialization must be updated. enum class StoreOwnershipQualifier { Unqualified, Init, Assign, Trivial }; static_assert(2 == SILNode::NumStoreOwnershipQualifierBits, "Size mismatch"); /// StoreInst - Represents a store from a memory location. class StoreInst : public InstructionBase { friend SILBuilder; private: FixedOperandList<2> Operands; StoreInst(SILDebugLocation DebugLoc, SILValue Src, SILValue Dest, StoreOwnershipQualifier Qualifier); public: enum { /// the value being stored Src, /// the lvalue being stored to Dest }; SILValue getSrc() const { return Operands[Src].get(); } SILValue getDest() const { return Operands[Dest].get(); } ArrayRef getAllOperands() const { return Operands.asArray(); } MutableArrayRef getAllOperands() { return Operands.asArray(); } StoreOwnershipQualifier getOwnershipQualifier() const { return StoreOwnershipQualifier( SILInstruction::Bits.StoreInst.OwnershipQualifier); } void setOwnershipQualifier(StoreOwnershipQualifier qualifier) { SILInstruction::Bits.StoreInst.OwnershipQualifier = unsigned(qualifier); } }; class EndBorrowInst; /// Represents a load of a borrowed value. Must be paired with an end_borrow /// instruction in its use-def list. class LoadBorrowInst : public UnaryInstructionBase { friend class SILBuilder; public: LoadBorrowInst(SILDebugLocation DebugLoc, SILValue LValue) : UnaryInstructionBase(DebugLoc, LValue, LValue->getType().getObjectType()) {} using EndBorrowRange = decltype(std::declval().getUsersOfType()); /// Return a range over all EndBorrow instructions for this BeginBorrow. EndBorrowRange getEndBorrows() const; }; inline auto LoadBorrowInst::getEndBorrows() const -> EndBorrowRange { return getUsersOfType(); } /// Represents the begin scope of a borrowed value. Must be paired with an /// end_borrow instruction in its use-def list. class BeginBorrowInst : public UnaryInstructionBase { friend class SILBuilder; BeginBorrowInst(SILDebugLocation DebugLoc, SILValue LValue) : UnaryInstructionBase(DebugLoc, LValue, LValue->getType().getObjectType()) {} public: using EndBorrowRange = decltype(std::declval().getUsersOfType()); /// Return a range over all EndBorrow instructions for this BeginBorrow. EndBorrowRange getEndBorrows() const; /// Return the single use of this BeginBorrowInst, not including any /// EndBorrowInst uses, or return nullptr if the borrow is dead or has /// multiple uses. /// /// Useful for matching common SILGen patterns that emit one borrow per use, /// and simplifying pass logic. Operand *getSingleNonEndingUse() const; }; inline auto BeginBorrowInst::getEndBorrows() const -> EndBorrowRange { return getUsersOfType(); } /// Represents a store of a borrowed value into an address. Returns the borrowed /// address. Must be paired with an end_borrow in its use-def list. class StoreBorrowInst : public InstructionBase { friend class SILBuilder; public: enum { /// The source of the value being borrowed. Src, /// The destination of the borrowed value. Dest }; private: FixedOperandList<2> Operands; StoreBorrowInst(SILDebugLocation DebugLoc, SILValue Src, SILValue Dest); public: SILValue getSrc() const { return Operands[Src].get(); } SILValue getDest() const { return Operands[Dest].get(); } ArrayRef getAllOperands() const { return Operands.asArray(); } MutableArrayRef getAllOperands() { return Operands.asArray(); } }; /// Represents the end of a borrow scope of a value %val from a /// value or address %src. /// /// While %val is "live" in a region then, /// /// 1. If %src is an object, it is undefined behavior for %src to be /// destroyed. This is enforced by the ownership verifier. /// /// 2. If %src is an address, it is undefined behavior for %src to be /// destroyed or written to. class EndBorrowInst : public UnaryInstructionBase { friend class SILBuilder; EndBorrowInst(SILDebugLocation debugLoc, SILValue borrowedValue) : UnaryInstructionBase(debugLoc, borrowedValue) {} public: /// Return the value that this end_borrow is ending the borrow of if we are /// borrowing a single value. SILValue getSingleOriginalValue() const { SILValue v = getOperand(); if (auto *bbi = dyn_cast(v)) return bbi->getOperand(); if (auto *lbi = dyn_cast(v)) return lbi->getOperand(); return SILValue(); } /// Return the set of guaranteed values that have scopes ended by this /// end_borrow. /// /// Discussion: We can only have multiple values associated with an end_borrow /// in the case of having Phi arguments with guaranteed inputs. This is /// necessary to represent certain conditional operations such as: /// /// class Klass { /// let k1: Klass /// let k2: Klass /// } /// /// func useKlass(k: Klass) { ... } /// var boolValue : Bool { ... } /// /// func f(k: Klass) { /// useKlass(boolValue ? k.k1 : k.k2) /// } /// /// Today, when we SILGen such code, we copy k.k1 and k.k2 before the Phi when /// it could potentially be avoided. So today this just appends /// getSingleOriginalValue() to originalValues. /// /// TODO: Once this changes, this code must be update. void getOriginalValues(SmallVectorImpl &originalValues) const { SILValue value = getSingleOriginalValue(); assert(value && "Guaranteed phi arguments are not supported now"); originalValues.emplace_back(value); } }; /// Different kinds of access. enum class SILAccessKind : uint8_t { /// An access which takes uninitialized memory and initializes it. Init, /// An access which reads the value of initialized memory, but doesn't /// modify it. Read, /// An access which changes the value of initialized memory. Modify, /// An access which takes initialized memory and leaves it uninitialized. Deinit, // This enum is encoded. Last = Deinit, }; enum { NumSILAccessKindBits = 2 }; StringRef getSILAccessKindName(SILAccessKind kind); /// Different kinds of exclusivity enforcement for accesses. enum class SILAccessEnforcement : uint8_t { /// The access's enforcement has not yet been determined. Unknown, /// The access is statically known to not conflict with other accesses. Static, /// TODO: maybe add InitiallyStatic for when the access is statically /// known to not interfere with any accesses when it begins but where /// it's possible that other accesses might be started during this access. /// The access is not statically known to not conflict with anything /// and must be dynamically checked. Dynamic, /// The access is not statically known to not conflict with anything /// but dynamic checking should be suppressed, leaving it undefined /// behavior. Unsafe, // This enum is encoded. Last = Unsafe }; StringRef getSILAccessEnforcementName(SILAccessEnforcement enforcement); class EndAccessInst; /// Begins an access scope. Must be paired with an end_access instruction /// along every path. class BeginAccessInst : public UnaryInstructionBase { friend class SILBuilder; BeginAccessInst(SILDebugLocation loc, SILValue lvalue, SILAccessKind accessKind, SILAccessEnforcement enforcement, bool noNestedConflict, bool fromBuiltin) : UnaryInstructionBase(loc, lvalue, lvalue->getType()) { SILInstruction::Bits.BeginAccessInst.AccessKind = unsigned(accessKind); SILInstruction::Bits.BeginAccessInst.Enforcement = unsigned(enforcement); SILInstruction::Bits.BeginAccessInst.NoNestedConflict = unsigned(noNestedConflict); SILInstruction::Bits.BeginAccessInst.FromBuiltin = unsigned(fromBuiltin); static_assert(unsigned(SILAccessKind::Last) < (1 << 2), "reserve sufficient bits for serialized SIL"); static_assert(unsigned(SILAccessEnforcement::Last) < (1 << 2), "reserve sufficient bits for serialized SIL"); static_assert(unsigned(SILAccessKind::Last) < (1 << SILNode::NumSILAccessKindBits), "SILNode needs updating"); static_assert(unsigned(SILAccessEnforcement::Last) < (1 << SILNode::NumSILAccessEnforcementBits), "SILNode needs updating"); } public: SILAccessKind getAccessKind() const { return SILAccessKind(SILInstruction::Bits.BeginAccessInst.AccessKind); } void setAccessKind(SILAccessKind kind) { SILInstruction::Bits.BeginAccessInst.AccessKind = unsigned(kind); } SILAccessEnforcement getEnforcement() const { return SILAccessEnforcement(SILInstruction::Bits.BeginAccessInst.Enforcement); } void setEnforcement(SILAccessEnforcement enforcement) { SILInstruction::Bits.BeginAccessInst.Enforcement = unsigned(enforcement); } /// If hasNoNestedConflict is true, then it is a static guarantee against /// inner conflicts. No subsequent access between this point and the /// corresponding end_access could cause an enforcement failure. Consequently, /// the access will not need to be tracked by the runtime for the duration of /// its scope. This access may still conflict with an outer access scope; /// therefore may still require dynamic enforcement at a single point. bool hasNoNestedConflict() const { return SILInstruction::Bits.BeginAccessInst.NoNestedConflict; } void setNoNestedConflict(bool noNestedConflict) { SILInstruction::Bits.BeginAccessInst.NoNestedConflict = noNestedConflict; } /// Return true if this access marker was emitted for a user-controlled /// Builtin. Return false if this access marker was auto-generated by the /// compiler to enforce formal access that derives from the language. bool isFromBuiltin() const { return SILInstruction::Bits.BeginAccessInst.FromBuiltin; } SILValue getSource() const { return getOperand(); } using EndAccessRange = decltype(std::declval().getUsersOfType()); /// Find all the associated end_access instructions for this begin_access. EndAccessRange getEndAccesses() const; }; /// Represents the end of an access scope. class EndAccessInst : public UnaryInstructionBase { friend class SILBuilder; private: EndAccessInst(SILDebugLocation loc, SILValue access, bool aborting = false) : UnaryInstructionBase(loc, access) { SILInstruction::Bits.EndAccessInst.Aborting = aborting; } public: /// An aborted access is one that did not perform the expected /// transition described by the begin_access instruction before it /// reached this end_access. /// /// Only AccessKind::Init and AccessKind::Deinit accesses can be /// aborted. bool isAborting() const { return SILInstruction::Bits.EndAccessInst.Aborting; } void setAborting(bool aborting = true) { SILInstruction::Bits.EndAccessInst.Aborting = aborting; } BeginAccessInst *getBeginAccess() const { return cast(getOperand()); } SILValue getSource() const { return getBeginAccess()->getSource(); } }; inline auto BeginAccessInst::getEndAccesses() const -> EndAccessRange { return getUsersOfType(); } /// Begins an access without requiring a paired end_access. /// Dynamically, an end_unpaired_access does still need to be called, though. /// /// This should only be used in materializeForSet, and eventually it should /// be removed entirely. class BeginUnpairedAccessInst : public InstructionBase { friend class SILBuilder; FixedOperandList<2> Operands; BeginUnpairedAccessInst(SILDebugLocation loc, SILValue addr, SILValue buffer, SILAccessKind accessKind, SILAccessEnforcement enforcement, bool noNestedConflict, bool fromBuiltin) : InstructionBase(loc), Operands(this, addr, buffer) { SILInstruction::Bits.BeginUnpairedAccessInst.AccessKind = unsigned(accessKind); SILInstruction::Bits.BeginUnpairedAccessInst.Enforcement = unsigned(enforcement); SILInstruction::Bits.BeginUnpairedAccessInst.NoNestedConflict = unsigned(noNestedConflict); SILInstruction::Bits.BeginUnpairedAccessInst.FromBuiltin = unsigned(fromBuiltin); } public: SILAccessKind getAccessKind() const { return SILAccessKind( SILInstruction::Bits.BeginUnpairedAccessInst.AccessKind); } void setAccessKind(SILAccessKind kind) { SILInstruction::Bits.BeginUnpairedAccessInst.AccessKind = unsigned(kind); } SILAccessEnforcement getEnforcement() const { return SILAccessEnforcement( SILInstruction::Bits.BeginUnpairedAccessInst.Enforcement); } void setEnforcement(SILAccessEnforcement enforcement) { SILInstruction::Bits.BeginUnpairedAccessInst.Enforcement = unsigned(enforcement); } /// If hasNoNestedConflict is true, then it is a static guarantee against /// inner conflicts. No subsequent access between this point and the /// corresponding end_access could cause an enforcement failure. Consequently, /// the access will not need to be tracked by the runtime for the duration of /// its scope. This access may still conflict with an outer access scope; /// therefore may still require dynamic enforcement at a single point. bool hasNoNestedConflict() const { return SILInstruction::Bits.BeginUnpairedAccessInst.NoNestedConflict; } void setNoNestedConflict(bool noNestedConflict) { SILInstruction::Bits.BeginUnpairedAccessInst.NoNestedConflict = noNestedConflict; } /// Return true if this access marker was emitted for a user-controlled /// Builtin. Return false if this access marker was auto-generated by the /// compiler to enforce formal access that derives from the language. bool isFromBuiltin() const { return SILInstruction::Bits.BeginUnpairedAccessInst.FromBuiltin; } SILValue getSource() const { return Operands[0].get(); } SILValue getBuffer() const { return Operands[1].get(); } ArrayRef getAllOperands() const { return Operands.asArray(); } MutableArrayRef getAllOperands() { return Operands.asArray(); } ArrayRef getTypeDependentOperands() const { return {}; } MutableArrayRef getTypeDependentOperands() { return {}; } }; /// Ends an unpaired access. class EndUnpairedAccessInst : public UnaryInstructionBase { friend class SILBuilder; private: EndUnpairedAccessInst(SILDebugLocation loc, SILValue buffer, SILAccessEnforcement enforcement, bool aborting, bool fromBuiltin) : UnaryInstructionBase(loc, buffer) { SILInstruction::Bits.EndUnpairedAccessInst.Enforcement = unsigned(enforcement); SILInstruction::Bits.EndUnpairedAccessInst.Aborting = aborting; SILInstruction::Bits.EndUnpairedAccessInst.FromBuiltin = fromBuiltin; } public: /// An aborted access is one that did not perform the expected /// transition described by the begin_access instruction before it /// reached this end_access. /// /// Only AccessKind::Init and AccessKind::Deinit accesses can be /// aborted. bool isAborting() const { return SILInstruction::Bits.EndUnpairedAccessInst.Aborting; } void setAborting(bool aborting) { SILInstruction::Bits.EndUnpairedAccessInst.Aborting = aborting; } SILAccessEnforcement getEnforcement() const { return SILAccessEnforcement( SILInstruction::Bits.EndUnpairedAccessInst.Enforcement); } void setEnforcement(SILAccessEnforcement enforcement) { SILInstruction::Bits.EndUnpairedAccessInst.Enforcement = unsigned(enforcement); } /// Return true if this access marker was emitted for a user-controlled /// Builtin. Return false if this access marker was auto-generated by the /// compiler to enforce formal access that derives from the language. bool isFromBuiltin() const { return SILInstruction::Bits.EndUnpairedAccessInst.FromBuiltin; } SILValue getBuffer() const { return getOperand(); } }; // *NOTE* When serializing, we can only represent up to 4 values here. If more // qualifiers are added, SIL serialization must be updated. enum class AssignOwnershipQualifier { /// Unknown initialization method Unknown, /// The box contains a fully-initialized value. Reassign, /// The box contains a class instance that we own, but the instance has /// not been initialized and should be freed with a special SIL /// instruction made for this purpose. Reinit, /// The box contains an undefined value that should be ignored. Init, }; static_assert(2 == SILNode::NumAssignOwnershipQualifierBits, "Size mismatch"); template class AssignInstBase : public InstructionBase { protected: FixedOperandList Operands; template AssignInstBase(SILDebugLocation DebugLoc, T&&...args) : InstructionBase(DebugLoc), Operands(this, std::forward(args)...) { } public: enum { /// the value being stored Src, /// the lvalue being stored to Dest }; SILValue getSrc() const { return Operands[Src].get(); } SILValue getDest() const { return Operands[Dest].get(); } ArrayRef getAllOperands() const { return Operands.asArray(); } MutableArrayRef getAllOperands() { return Operands.asArray(); } }; /// AssignInst - Represents an abstract assignment to a memory location, which /// may either be an initialization or a store sequence. This is only valid in /// Raw SIL. class AssignInst : public AssignInstBase { friend SILBuilder; AssignInst(SILDebugLocation DebugLoc, SILValue Src, SILValue Dest, AssignOwnershipQualifier Qualifier = AssignOwnershipQualifier::Unknown); public: AssignOwnershipQualifier getOwnershipQualifier() const { return AssignOwnershipQualifier( SILInstruction::Bits.AssignInst.OwnershipQualifier); } void setOwnershipQualifier(AssignOwnershipQualifier qualifier) { SILInstruction::Bits.AssignInst.OwnershipQualifier = unsigned(qualifier); } }; /// AssignByWrapperInst - Represents an abstract assignment via a wrapper, /// which may either be an initialization or a store sequence. This is only /// valid in Raw SIL. class AssignByWrapperInst : public AssignInstBase { friend SILBuilder; AssignByWrapperInst(SILDebugLocation DebugLoc, SILValue Src, SILValue Dest, SILValue Initializer, SILValue Setter, AssignOwnershipQualifier Qualifier = AssignOwnershipQualifier::Unknown); public: SILValue getInitializer() { return Operands[2].get(); } SILValue getSetter() { return Operands[3].get(); } AssignOwnershipQualifier getOwnershipQualifier() const { return AssignOwnershipQualifier( SILInstruction::Bits.AssignByWrapperInst.OwnershipQualifier); } void setOwnershipQualifier(AssignOwnershipQualifier qualifier) { SILInstruction::Bits.AssignByWrapperInst.OwnershipQualifier = unsigned(qualifier); } }; /// Indicates that a memory location is uninitialized at this point and needs to /// be initialized by the end of the function and before any escape point for /// this instruction. This is only valid in Raw SIL. class MarkUninitializedInst : public UnaryInstructionBase { friend SILBuilder; public: /// This enum captures what the mark_uninitialized instruction is designating. enum Kind { /// Var designates the start of a normal variable live range. Var, /// RootSelf designates "self" in a struct, enum, or root class. RootSelf, /// CrossModuleRootSelf is the same as "RootSelf", but in a case where /// it's not really safe to treat 'self' as root because the original /// module might add more stored properties. /// /// This is only used for Swift 4 compatibility. In Swift 5, cross-module /// initializers are always DelegatingSelf. CrossModuleRootSelf, /// DerivedSelf designates "self" in a derived (non-root) class. DerivedSelf, /// DerivedSelfOnly designates "self" in a derived (non-root) /// class whose stored properties have already been initialized. DerivedSelfOnly, /// DelegatingSelf designates "self" on a struct, enum, or class /// in a delegating constructor (one that calls self.init). DelegatingSelf, /// DelegatingSelfAllocated designates "self" in a delegating class /// initializer where memory has already been allocated. DelegatingSelfAllocated, }; private: Kind ThisKind; MarkUninitializedInst(SILDebugLocation DebugLoc, SILValue Value, Kind K) : UnaryInstructionBase(DebugLoc, Value, Value->getType(), Value.getOwnershipKind()), ThisKind(K) {} public: Kind getKind() const { return ThisKind; } bool isVar() const { return ThisKind == Var; } bool isRootSelf() const { return ThisKind == RootSelf; } bool isCrossModuleRootSelf() const { return ThisKind == CrossModuleRootSelf; } bool isDerivedClassSelf() const { return ThisKind == DerivedSelf; } bool isDerivedClassSelfOnly() const { return ThisKind == DerivedSelfOnly; } bool isDelegatingSelf() const { return ThisKind == DelegatingSelf; } bool isDelegatingSelfAllocated() const { return ThisKind == DelegatingSelfAllocated; } }; /// MarkFunctionEscape - Represents the escape point of set of variables due to /// a function definition which uses the variables. This is only valid in Raw /// SIL. class MarkFunctionEscapeInst final : public InstructionBaseWithTrailingOperands< SILInstructionKind::MarkFunctionEscapeInst, MarkFunctionEscapeInst, NonValueInstruction> { friend SILBuilder; /// Private constructor. Because this is variadic, object creation goes /// through 'create()'. MarkFunctionEscapeInst(SILDebugLocation DebugLoc, ArrayRef Elements) : InstructionBaseWithTrailingOperands(Elements, DebugLoc) {} /// Construct a MarkFunctionEscapeInst. static MarkFunctionEscapeInst *create(SILDebugLocation DebugLoc, ArrayRef Elements, SILFunction &F); public: /// The elements referenced by this instruction. MutableArrayRef getElementOperands() { return getAllOperands(); } /// The elements referenced by this instruction. OperandValueArrayRef getElements() const { return OperandValueArrayRef(getAllOperands()); } }; /// Define the start or update to a symbolic variable value (for loadable /// types). class DebugValueInst final : public UnaryInstructionBase, private llvm::TrailingObjects { friend TrailingObjects; friend SILBuilder; TailAllocatedDebugVariable VarInfo; DebugValueInst(SILDebugLocation DebugLoc, SILValue Operand, SILDebugVariable Var); static DebugValueInst *create(SILDebugLocation DebugLoc, SILValue Operand, SILModule &M, SILDebugVariable Var); size_t numTrailingObjects(OverloadToken) const { return 1; } public: /// Return the underlying variable declaration that this denotes, /// or null if we don't have one. VarDecl *getDecl() const; /// Return the debug variable information attached to this instruction. Optional getVarInfo() const { return VarInfo.get(getDecl(), getTrailingObjects()); } }; /// Define the start or update to a symbolic variable value (for address-only /// types) . class DebugValueAddrInst final : public UnaryInstructionBase, private llvm::TrailingObjects { friend TrailingObjects; friend SILBuilder; TailAllocatedDebugVariable VarInfo; DebugValueAddrInst(SILDebugLocation DebugLoc, SILValue Operand, SILDebugVariable Var); static DebugValueAddrInst *create(SILDebugLocation DebugLoc, SILValue Operand, SILModule &M, SILDebugVariable Var); public: /// Return the underlying variable declaration that this denotes, /// or null if we don't have one. VarDecl *getDecl() const; /// Return the debug variable information attached to this instruction. Optional getVarInfo() const { return VarInfo.get(getDecl(), getTrailingObjects()); }; }; /// An abstract class representing a load from some kind of reference storage. template class LoadReferenceInstBase : public UnaryInstructionBase { static SILType getResultType(SILType operandTy) { assert(operandTy.isAddress() && "loading from non-address operand?"); auto refType = cast(operandTy.getASTType()); return SILType::getPrimitiveObjectType(refType.getReferentType()); } protected: LoadReferenceInstBase(SILDebugLocation loc, SILValue lvalue, IsTake_t isTake) : UnaryInstructionBase(loc, lvalue, getResultType(lvalue->getType())) { SILInstruction::Bits.LoadReferenceInstBaseT.IsTake = unsigned(isTake); } public: IsTake_t isTake() const { return IsTake_t(SILInstruction::Bits.LoadReferenceInstBaseT.IsTake); } }; /// An abstract class representing a store to some kind of reference storage. template class StoreReferenceInstBase : public InstructionBase { enum { Src, Dest }; FixedOperandList<2> Operands; protected: StoreReferenceInstBase(SILDebugLocation loc, SILValue src, SILValue dest, IsInitialization_t isInit) : InstructionBase(loc), Operands(this, src, dest) { SILInstruction::Bits.StoreReferenceInstBaseT.IsInitializationOfDest = unsigned(isInit); } public: SILValue getSrc() const { return Operands[Src].get(); } SILValue getDest() const { return Operands[Dest].get(); } IsInitialization_t isInitializationOfDest() const { return IsInitialization_t( SILInstruction::Bits.StoreReferenceInstBaseT.IsInitializationOfDest); } void setIsInitializationOfDest(IsInitialization_t I) { SILInstruction::Bits.StoreReferenceInstBaseT.IsInitializationOfDest = (bool)I; } ArrayRef getAllOperands() const { return Operands.asArray(); } MutableArrayRef getAllOperands() { return Operands.asArray(); } }; /// Represents a load from a dynamic reference storage memory location. /// This is required for address-only scenarios; for loadable references, /// it's better to use a load and a strong_retain_#name. /// /// \param loc The location of the expression that caused the load. /// \param lvalue The SILValue representing the address to /// use for the load. #define NEVER_OR_SOMETIMES_LOADABLE_CHECKED_REF_STORAGE(Name, ...) \ class Load##Name##Inst \ : public LoadReferenceInstBase { \ friend SILBuilder; \ Load##Name##Inst(SILDebugLocation loc, SILValue lvalue, IsTake_t isTake) \ : LoadReferenceInstBase(loc, lvalue, isTake) {} \ }; #include "swift/AST/ReferenceStorage.def" /// Represents a store to a dynamic reference storage memory location. /// This is only required for address-only scenarios; for loadable /// references, it's better to use a ref_to_##name and a store. #define NEVER_OR_SOMETIMES_LOADABLE_CHECKED_REF_STORAGE(Name, ...) \ class Store##Name##Inst \ : public StoreReferenceInstBase { \ friend SILBuilder; \ Store##Name##Inst(SILDebugLocation loc, SILValue src, SILValue dest, \ IsInitialization_t isInit) \ : StoreReferenceInstBase(loc, src, dest, isInit) {} \ }; #include "swift/AST/ReferenceStorage.def" /// CopyAddrInst - Represents a copy from one memory location to another. This /// is similar to: /// %1 = load %src /// store %1 to %dest /// but a copy instruction must be used for address-only types. class CopyAddrInst : public InstructionBase { friend SILBuilder; public: enum { /// The lvalue being loaded from. Src, /// The lvalue being stored to. Dest }; private: FixedOperandList<2> Operands; CopyAddrInst(SILDebugLocation DebugLoc, SILValue Src, SILValue Dest, IsTake_t isTakeOfSrc, IsInitialization_t isInitializationOfDest); public: SILValue getSrc() const { return Operands[Src].get(); } SILValue getDest() const { return Operands[Dest].get(); } void setSrc(SILValue V) { Operands[Src].set(V); } void setDest(SILValue V) { Operands[Dest].set(V); } IsTake_t isTakeOfSrc() const { return IsTake_t(SILInstruction::Bits.CopyAddrInst.IsTakeOfSrc); } IsInitialization_t isInitializationOfDest() const { return IsInitialization_t( SILInstruction::Bits.CopyAddrInst.IsInitializationOfDest); } void setIsTakeOfSrc(IsTake_t T) { SILInstruction::Bits.CopyAddrInst.IsTakeOfSrc = (bool)T; } void setIsInitializationOfDest(IsInitialization_t I) { SILInstruction::Bits.CopyAddrInst.IsInitializationOfDest = (bool)I; } ArrayRef getAllOperands() const { return Operands.asArray(); } MutableArrayRef getAllOperands() { return Operands.asArray(); } }; /// BindMemoryInst - /// "bind_memory %0 : $Builtin.RawPointer, %1 : $Builtin.Word to $T" /// Binds memory at the raw pointer %0 to type $T with enough capacity /// to hold $1 values. class BindMemoryInst final : public InstructionBaseWithTrailingOperands< SILInstructionKind::BindMemoryInst, BindMemoryInst, NonValueInstruction> { friend SILBuilder; SILType BoundType; static BindMemoryInst *create( SILDebugLocation Loc, SILValue Base, SILValue Index, SILType BoundType, SILFunction &F, SILOpenedArchetypesState &OpenedArchetypes); BindMemoryInst(SILDebugLocation Loc, SILValue Base, SILValue Index, SILType BoundType, ArrayRef TypeDependentOperands) : InstructionBaseWithTrailingOperands(Base, Index, TypeDependentOperands, Loc), BoundType(BoundType) {} public: enum { BaseOperIdx, IndexOperIdx, NumFixedOpers }; SILValue getBase() const { return getAllOperands()[BaseOperIdx].get(); } SILValue getIndex() const { return getAllOperands()[IndexOperIdx].get(); } SILType getBoundType() const { return BoundType; } ArrayRef getTypeDependentOperands() const { return getAllOperands().slice(NumFixedOpers); } MutableArrayRef getTypeDependentOperands() { return getAllOperands().slice(NumFixedOpers); } }; //===----------------------------------------------------------------------===// // Conversion instructions. //===----------------------------------------------------------------------===// /// ConversionInst - Abstract class representing instructions that convert /// values. /// class ConversionInst : public SingleValueInstruction { protected: ConversionInst(SILInstructionKind Kind, SILDebugLocation DebugLoc, SILType Ty) : SingleValueInstruction(Kind, DebugLoc, Ty) {} public: /// All conversion instructions take the converted value, whose reference /// identity is expected to be preserved through the conversion chain, as their /// first operand. Some instructions may take additional operands that do not /// affect the reference identity. SILValue getConverted() const { return getOperand(0); } DEFINE_ABSTRACT_SINGLE_VALUE_INST_BOILERPLATE(ConversionInst) }; /// A conversion inst that produces a static OwnershipKind set upon the /// instruction's construction. class OwnershipForwardingConversionInst : public ConversionInst { ValueOwnershipKind ownershipKind; protected: OwnershipForwardingConversionInst(SILInstructionKind kind, SILDebugLocation debugLoc, SILType ty, ValueOwnershipKind ownershipKind) : ConversionInst(kind, debugLoc, ty), ownershipKind(ownershipKind) {} public: ValueOwnershipKind getOwnershipKind() const { return ownershipKind; } void setOwnershipKind(ValueOwnershipKind newOwnershipKind) { ownershipKind = newOwnershipKind; } }; /// ConvertFunctionInst - Change the type of a function value without /// affecting how it will codegen. class ConvertFunctionInst final : public UnaryInstructionWithTypeDependentOperandsBase< SILInstructionKind::ConvertFunctionInst, ConvertFunctionInst, OwnershipForwardingConversionInst> { friend SILBuilder; ConvertFunctionInst(SILDebugLocation DebugLoc, SILValue Operand, ArrayRef TypeDependentOperands, SILType Ty, bool WithoutActuallyEscaping) : UnaryInstructionWithTypeDependentOperandsBase( DebugLoc, Operand, TypeDependentOperands, Ty, Operand.getOwnershipKind()) { SILInstruction::Bits.ConvertFunctionInst.WithoutActuallyEscaping = WithoutActuallyEscaping; assert((Operand->getType().castTo()->isNoEscape() == Ty.castTo()->isNoEscape() || Ty.castTo()->getRepresentation() != SILFunctionType::Representation::Thick) && "Change of escapeness is not ABI compatible"); } static ConvertFunctionInst *create(SILDebugLocation DebugLoc, SILValue Operand, SILType Ty, SILFunction &F, SILOpenedArchetypesState &OpenedArchetypes, bool WithoutActuallyEscaping); public: /// Returns `true` if this converts a non-escaping closure into an escaping /// function type. `True` must be returned whenever the closure operand has an /// unboxed capture (via @inout_aliasable) *and* the resulting function type /// is escaping. (This only happens as a result of /// withoutActuallyEscaping()). If `true` is returned, then the resulting /// function type must be escaping, but the operand's function type may or may /// not be @noescape. Note that a non-escaping closure may have unboxed /// captured even though its SIL function type is "escaping". bool withoutActuallyEscaping() const { return SILInstruction::Bits.ConvertFunctionInst.WithoutActuallyEscaping; } /// Returns `true` if the function conversion is between types with the same /// argument and return types, as well as all other attributes, after substitution, /// such as converting `$ in (A) -> B for ` to `(Int) -> String`. bool onlyConvertsSubstitutions() const; }; /// ConvertEscapeToNoEscapeInst - Change the type of a escaping function value /// to a trivial function type (@noescape T -> U). class ConvertEscapeToNoEscapeInst final : public UnaryInstructionWithTypeDependentOperandsBase< SILInstructionKind::ConvertEscapeToNoEscapeInst, ConvertEscapeToNoEscapeInst, ConversionInst> { friend SILBuilder; bool lifetimeGuaranteed; ConvertEscapeToNoEscapeInst(SILDebugLocation DebugLoc, SILValue Operand, ArrayRef TypeDependentOperands, SILType Ty, bool isLifetimeGuaranteed) : UnaryInstructionWithTypeDependentOperandsBase( DebugLoc, Operand, TypeDependentOperands, Ty), lifetimeGuaranteed(isLifetimeGuaranteed) { assert(!Operand->getType().castTo()->isNoEscape()); assert(Ty.castTo()->isNoEscape()); } static ConvertEscapeToNoEscapeInst * create(SILDebugLocation DebugLoc, SILValue Operand, SILType Ty, SILFunction &F, SILOpenedArchetypesState &OpenedArchetypes, bool lifetimeGuaranteed); public: /// Return true if we have extended the lifetime of the argument of the /// convert_escape_to_no_escape to be over all uses of the trivial type. bool isLifetimeGuaranteed() const { return lifetimeGuaranteed; } /// Mark that we have extended the lifetime of the argument of the /// convert_escape_to_no_escape to be over all uses of the trivial type. /// /// NOTE: This is a one way operation. void setLifetimeGuaranteed() { lifetimeGuaranteed = true; } }; /// ThinFunctionToPointerInst - Convert a thin function pointer to a /// Builtin.RawPointer. class ThinFunctionToPointerInst : public UnaryInstructionBase { friend SILBuilder; ThinFunctionToPointerInst(SILDebugLocation DebugLoc, SILValue operand, SILType ty) : UnaryInstructionBase(DebugLoc, operand, ty) {} }; /// PointerToThinFunctionInst - Convert a Builtin.RawPointer to a thin /// function pointer. class PointerToThinFunctionInst final : public UnaryInstructionWithTypeDependentOperandsBase< SILInstructionKind::PointerToThinFunctionInst, PointerToThinFunctionInst, ConversionInst> { friend SILBuilder; PointerToThinFunctionInst(SILDebugLocation DebugLoc, SILValue operand, ArrayRef TypeDependentOperands, SILType ty) : UnaryInstructionWithTypeDependentOperandsBase( DebugLoc, operand, TypeDependentOperands, ty) {} static PointerToThinFunctionInst * create(SILDebugLocation DebugLoc, SILValue Operand, SILType Ty, SILFunction &F, SILOpenedArchetypesState &OpenedArchetypes); }; /// UpcastInst - Perform a conversion of a class instance to a supertype. class UpcastInst final : public UnaryInstructionWithTypeDependentOperandsBase< SILInstructionKind::UpcastInst, UpcastInst, OwnershipForwardingConversionInst> { friend SILBuilder; UpcastInst(SILDebugLocation DebugLoc, SILValue Operand, ArrayRef TypeDependentOperands, SILType Ty) : UnaryInstructionWithTypeDependentOperandsBase( DebugLoc, Operand, TypeDependentOperands, Ty, Operand.getOwnershipKind()) {} static UpcastInst * create(SILDebugLocation DebugLoc, SILValue Operand, SILType Ty, SILFunction &F, SILOpenedArchetypesState &OpenedArchetypes); }; /// AddressToPointerInst - Convert a SIL address to a Builtin.RawPointer value. class AddressToPointerInst : public UnaryInstructionBase { friend SILBuilder; AddressToPointerInst(SILDebugLocation DebugLoc, SILValue Operand, SILType Ty) : UnaryInstructionBase(DebugLoc, Operand, Ty) {} }; /// PointerToAddressInst - Convert a Builtin.RawPointer value to a SIL address. class PointerToAddressInst : public UnaryInstructionBase { friend SILBuilder; PointerToAddressInst(SILDebugLocation DebugLoc, SILValue Operand, SILType Ty, bool IsStrict, bool IsInvariant) : UnaryInstructionBase(DebugLoc, Operand, Ty) { SILInstruction::Bits.PointerToAddressInst.IsStrict = IsStrict; SILInstruction::Bits.PointerToAddressInst.IsInvariant = IsInvariant; } public: /// Whether the returned address adheres to strict aliasing. /// If true, then the type of each memory access dependent on /// this address must be consistent with the memory's bound type. bool isStrict() const { return SILInstruction::Bits.PointerToAddressInst.IsStrict; } /// Whether the returned address is invariant. /// If true, then loading from an address derived from this pointer always /// produces the same value. bool isInvariant() const { return SILInstruction::Bits.PointerToAddressInst.IsInvariant; } }; /// Convert a heap object reference to a different type without any runtime /// checks. class UncheckedRefCastInst final : public UnaryInstructionWithTypeDependentOperandsBase< SILInstructionKind::UncheckedRefCastInst, UncheckedRefCastInst, OwnershipForwardingConversionInst> { friend SILBuilder; UncheckedRefCastInst(SILDebugLocation DebugLoc, SILValue Operand, ArrayRef TypeDependentOperands, SILType Ty) : UnaryInstructionWithTypeDependentOperandsBase( DebugLoc, Operand, TypeDependentOperands, Ty, Operand.getOwnershipKind()) {} static UncheckedRefCastInst * create(SILDebugLocation DebugLoc, SILValue Operand, SILType Ty, SILFunction &F, SILOpenedArchetypesState &OpenedArchetypes); }; /// Converts a heap object reference to a different type without any runtime /// checks. This is a variant of UncheckedRefCast that works on address types, /// thus encapsulates an implicit load and take of the reference followed by a /// store and initialization of a new reference. class UncheckedRefCastAddrInst : public InstructionBase { public: enum { /// the value being stored Src, /// the lvalue being stored to Dest }; private: FixedOperandList<2> Operands; CanType SourceType; CanType TargetType; public: UncheckedRefCastAddrInst(SILDebugLocation Loc, SILValue src, CanType srcType, SILValue dest, CanType targetType); SILValue getSrc() const { return Operands[Src].get(); } SILValue getDest() const { return Operands[Dest].get(); } SILType getSourceLoweredType() const { return getSrc()->getType(); } CanType getSourceFormalType() const { return SourceType; } SILType getTargetLoweredType() const { return getDest()->getType(); } CanType getTargetFormalType() const { return TargetType; } ArrayRef getAllOperands() const { return Operands.asArray(); } MutableArrayRef getAllOperands() { return Operands.asArray(); } }; class UncheckedAddrCastInst final : public UnaryInstructionWithTypeDependentOperandsBase< SILInstructionKind::UncheckedAddrCastInst, UncheckedAddrCastInst, ConversionInst> { friend SILBuilder; UncheckedAddrCastInst(SILDebugLocation DebugLoc, SILValue Operand, ArrayRef TypeDependentOperands, SILType Ty) : UnaryInstructionWithTypeDependentOperandsBase(DebugLoc, Operand, TypeDependentOperands, Ty) {} static UncheckedAddrCastInst * create(SILDebugLocation DebugLoc, SILValue Operand, SILType Ty, SILFunction &F, SILOpenedArchetypesState &OpenedArchetypes); }; /// Convert a value's binary representation to a trivial type of the same size. class UncheckedTrivialBitCastInst final : public UnaryInstructionWithTypeDependentOperandsBase< SILInstructionKind::UncheckedTrivialBitCastInst, UncheckedTrivialBitCastInst, ConversionInst> { friend SILBuilder; UncheckedTrivialBitCastInst(SILDebugLocation DebugLoc, SILValue Operand, ArrayRef TypeDependentOperands, SILType Ty) : UnaryInstructionWithTypeDependentOperandsBase(DebugLoc, Operand, TypeDependentOperands, Ty) {} static UncheckedTrivialBitCastInst * create(SILDebugLocation DebugLoc, SILValue Operand, SILType Ty, SILFunction &F, SILOpenedArchetypesState &OpenedArchetypes); }; /// Bitwise copy a value into another value of the same size or smaller. class UncheckedBitwiseCastInst final : public UnaryInstructionWithTypeDependentOperandsBase< SILInstructionKind::UncheckedBitwiseCastInst, UncheckedBitwiseCastInst, ConversionInst> { friend SILBuilder; UncheckedBitwiseCastInst(SILDebugLocation DebugLoc, SILValue Operand, ArrayRef TypeDependentOperands, SILType Ty) : UnaryInstructionWithTypeDependentOperandsBase(DebugLoc, Operand, TypeDependentOperands, Ty) {} static UncheckedBitwiseCastInst * create(SILDebugLocation DebugLoc, SILValue Operand, SILType Ty, SILFunction &F, SILOpenedArchetypesState &OpenedArchetypes); }; /// Build a Builtin.BridgeObject from a heap object reference by bitwise-or-ing /// in bits from a word. class RefToBridgeObjectInst : public InstructionBase { friend SILBuilder; FixedOperandList<2> Operands; RefToBridgeObjectInst(SILDebugLocation DebugLoc, SILValue ConvertedValue, SILValue MaskValue, SILType BridgeObjectTy) : InstructionBase(DebugLoc, BridgeObjectTy, ConvertedValue.getOwnershipKind()), Operands(this, ConvertedValue, MaskValue) {} public: SILValue getBitsOperand() const { return Operands[1].get(); } ArrayRef getAllOperands() const { return Operands.asArray(); } MutableArrayRef getAllOperands() { return Operands.asArray(); } }; /// Extract the heap object reference from a BridgeObject. class ClassifyBridgeObjectInst : public UnaryInstructionBase { friend SILBuilder; ClassifyBridgeObjectInst(SILDebugLocation DebugLoc, SILValue Operand, SILType Ty) : UnaryInstructionBase(DebugLoc, Operand, Ty) {} }; /// Extract the heap object reference from a BridgeObject. class BridgeObjectToRefInst : public UnaryInstructionBase { friend SILBuilder; BridgeObjectToRefInst(SILDebugLocation DebugLoc, SILValue Operand, SILType Ty) : UnaryInstructionBase(DebugLoc, Operand, Ty, Operand.getOwnershipKind()) {} }; /// Sets the BridgeObject to a tagged pointer representation holding its /// operands class ValueToBridgeObjectInst : public UnaryInstructionBase { friend SILBuilder; ValueToBridgeObjectInst(SILDebugLocation DebugLoc, SILValue Operand, SILType BridgeObjectTy) : UnaryInstructionBase(DebugLoc, Operand, BridgeObjectTy) {} }; /// Retrieve the bit pattern of a BridgeObject. class BridgeObjectToWordInst : public UnaryInstructionBase { friend SILBuilder; BridgeObjectToWordInst(SILDebugLocation DebugLoc, SILValue Operand, SILType Ty) : UnaryInstructionBase(DebugLoc, Operand, Ty) {} }; /// RefToRawPointer - Convert a reference type to a Builtin.RawPointer. class RefToRawPointerInst : public UnaryInstructionBase { friend SILBuilder; RefToRawPointerInst(SILDebugLocation DebugLoc, SILValue Operand, SILType Ty) : UnaryInstructionBase(DebugLoc, Operand, Ty) {} }; /// RawPointerToRefInst - Convert a Builtin.RawPointer to a reference type. class RawPointerToRefInst : public UnaryInstructionBase { friend SILBuilder; RawPointerToRefInst(SILDebugLocation DebugLoc, SILValue Operand, SILType Ty) : UnaryInstructionBase(DebugLoc, Operand, Ty) {} }; /// Transparent reference storage to underlying reference type conversion. /// This does nothing at runtime; it just changes the formal type. #define LOADABLE_REF_STORAGE(Name, ...) \ class RefTo##Name##Inst \ : public UnaryInstructionBase { \ friend SILBuilder; \ RefTo##Name##Inst(SILDebugLocation DebugLoc, SILValue Operand, SILType Ty) \ : UnaryInstructionBase(DebugLoc, Operand, Ty) {} \ }; \ class Name##ToRefInst \ : public UnaryInstructionBase { \ friend SILBuilder; \ Name##ToRefInst(SILDebugLocation DebugLoc, SILValue Operand, SILType Ty) \ : UnaryInstructionBase(DebugLoc, Operand, Ty) {} \ }; #include "swift/AST/ReferenceStorage.def" /// ThinToThickFunctionInst - Given a thin function reference, adds a null /// context to convert the value to a thick function type. class ThinToThickFunctionInst final : public UnaryInstructionWithTypeDependentOperandsBase< SILInstructionKind::ThinToThickFunctionInst, ThinToThickFunctionInst, ConversionInst> { friend SILBuilder; ThinToThickFunctionInst(SILDebugLocation DebugLoc, SILValue Operand, ArrayRef TypeDependentOperands, SILType Ty) : UnaryInstructionWithTypeDependentOperandsBase( DebugLoc, Operand, TypeDependentOperands, Ty) {} static ThinToThickFunctionInst * create(SILDebugLocation DebugLoc, SILValue Operand, SILType Ty, SILFunction &F, SILOpenedArchetypesState &OpenedArchetypes); public: /// Return the callee of the thin_to_thick_function. /// /// This is not technically necessary, but from a symmetry perspective it /// makes sense to follow the lead of partial_apply which also creates /// closures. SILValue getCallee() const { return getOperand(); } }; /// Given a thick metatype value, produces an Objective-C metatype /// value. class ThickToObjCMetatypeInst : public UnaryInstructionBase { friend SILBuilder; ThickToObjCMetatypeInst(SILDebugLocation DebugLoc, SILValue Operand, SILType Ty) : UnaryInstructionBase(DebugLoc, Operand, Ty) {} }; /// Given an Objective-C metatype value, produces a thick metatype /// value. class ObjCToThickMetatypeInst : public UnaryInstructionBase { friend SILBuilder; ObjCToThickMetatypeInst(SILDebugLocation DebugLoc, SILValue Operand, SILType Ty) : UnaryInstructionBase(DebugLoc, Operand, Ty) {} }; /// Given an Objective-C metatype value, convert it to an AnyObject value. class ObjCMetatypeToObjectInst : public UnaryInstructionBase { friend SILBuilder; ObjCMetatypeToObjectInst(SILDebugLocation DebugLoc, SILValue Operand, SILType Ty) : UnaryInstructionBase(DebugLoc, Operand, Ty) {} }; /// Given an Objective-C existential metatype value, convert it to an AnyObject /// value. class ObjCExistentialMetatypeToObjectInst : public UnaryInstructionBase { friend SILBuilder; ObjCExistentialMetatypeToObjectInst(SILDebugLocation DebugLoc, SILValue Operand, SILType Ty) : UnaryInstructionBase(DebugLoc, Operand, Ty) {} }; /// Return the Objective-C Protocol class instance for a protocol. class ObjCProtocolInst : public InstructionBase { friend SILBuilder; ProtocolDecl *Proto; ObjCProtocolInst(SILDebugLocation DebugLoc, ProtocolDecl *Proto, SILType Ty) : InstructionBase(DebugLoc, Ty), Proto(Proto) {} public: ProtocolDecl *getProtocol() const { return Proto; } ArrayRef getAllOperands() const { return {}; } MutableArrayRef getAllOperands() { return {}; } }; /// Perform an unconditional checked cast that aborts if the cast fails. class UnconditionalCheckedCastInst final : public UnaryInstructionWithTypeDependentOperandsBase< SILInstructionKind::UnconditionalCheckedCastInst, UnconditionalCheckedCastInst, OwnershipForwardingConversionInst> { CanType DestFormalTy; friend SILBuilder; UnconditionalCheckedCastInst(SILDebugLocation DebugLoc, SILValue Operand, ArrayRef TypeDependentOperands, SILType DestLoweredTy, CanType DestFormalTy) : UnaryInstructionWithTypeDependentOperandsBase( DebugLoc, Operand, TypeDependentOperands, DestLoweredTy, Operand.getOwnershipKind()), DestFormalTy(DestFormalTy) {} static UnconditionalCheckedCastInst * create(SILDebugLocation DebugLoc, SILValue Operand, SILType DestLoweredTy, CanType DestFormalTy, SILFunction &F, SILOpenedArchetypesState &OpenedArchetypes); public: SILType getSourceLoweredType() const { return getOperand()->getType(); } CanType getSourceFormalType() const { return getSourceLoweredType().getASTType(); } CanType getTargetFormalType() const { return DestFormalTy; } SILType getTargetLoweredType() const { return getType(); } }; /// Perform an unconditional checked cast that aborts if the cast fails. /// The result of the checked cast is left in the destination address. class UnconditionalCheckedCastAddrInst : public InstructionBase { friend SILBuilder; enum { /// the value being stored Src, /// the lvalue being stored to Dest }; FixedOperandList<2> Operands; CanType SourceType; CanType TargetType; UnconditionalCheckedCastAddrInst(SILDebugLocation Loc, SILValue src, CanType sourceType, SILValue dest, CanType targetType); public: SILValue getSrc() const { return Operands[Src].get(); } SILValue getDest() const { return Operands[Dest].get(); } SILType getSourceLoweredType() const { return getSrc()->getType(); } CanType getSourceFormalType() const { return SourceType; } SILType getTargetLoweredType() const { return getDest()->getType(); } CanType getTargetFormalType() const { return TargetType; } ArrayRef getAllOperands() const { return Operands.asArray(); } MutableArrayRef getAllOperands() { return Operands.asArray(); } }; /// Perform an unconditional checked cast that aborts if the cast fails. /// The result of the checked cast is left in the destination. class UnconditionalCheckedCastValueInst final : public UnaryInstructionWithTypeDependentOperandsBase< SILInstructionKind::UnconditionalCheckedCastValueInst, UnconditionalCheckedCastValueInst, ConversionInst> { CanType SourceFormalTy; CanType DestFormalTy; friend SILBuilder; UnconditionalCheckedCastValueInst(SILDebugLocation DebugLoc, SILValue Operand, CanType SourceFormalTy, ArrayRef TypeDependentOperands, SILType DestLoweredTy, CanType DestFormalTy) : UnaryInstructionWithTypeDependentOperandsBase( DebugLoc, Operand, TypeDependentOperands, DestLoweredTy), SourceFormalTy(SourceFormalTy), DestFormalTy(DestFormalTy) {} static UnconditionalCheckedCastValueInst * create(SILDebugLocation DebugLoc, SILValue Operand, CanType SourceFormalTy, SILType DestLoweredTy, CanType DestFormalTy, SILFunction &F, SILOpenedArchetypesState &OpenedArchetypes); public: SILType getSourceLoweredType() const { return getOperand()->getType(); } CanType getSourceFormalType() const { return SourceFormalTy; } SILType getTargetLoweredType() const { return getType(); } CanType getTargetFormalType() const { return DestFormalTy; } }; /// StructInst - Represents a constructed loadable struct. class StructInst final : public InstructionBaseWithTrailingOperands< SILInstructionKind::StructInst, StructInst, OwnershipForwardingSingleValueInst> { friend SILBuilder; /// Because of the storage requirements of StructInst, object /// creation goes through 'create()'. StructInst(SILDebugLocation DebugLoc, SILType Ty, ArrayRef Elements, bool HasOwnership); /// Construct a StructInst. static StructInst *create(SILDebugLocation DebugLoc, SILType Ty, ArrayRef Elements, SILModule &M, bool HasOwnership); public: /// The elements referenced by this StructInst. MutableArrayRef getElementOperands() { return getAllOperands(); } /// The elements referenced by this StructInst. OperandValueArrayRef getElements() const { return OperandValueArrayRef(getAllOperands()); } SILValue getFieldValue(const VarDecl *V) const { return getOperandForField(V)->get(); } /// Return the Operand associated with the given VarDecl. const Operand *getOperandForField(const VarDecl *V) const { return const_cast(this)->getOperandForField(V); } Operand *getOperandForField(const VarDecl *V) { // If V is null or is computed, there is no operand associated with it. assert(V && V->hasStorage() && "getOperandForField only works with stored fields"); StructDecl *S = getStructDecl(); auto Props = S->getStoredProperties(); for (unsigned I = 0, E = Props.size(); I < E; ++I) if (V == Props[I]) return &getAllOperands()[I]; // Did not find a matching VarDecl, return nullptr. return nullptr; } /// Search the operands of this struct for a unique non-trivial field. If we /// find it, return it. Otherwise return SILValue(). SILValue getUniqueNonTrivialFieldValue() { auto *F = getFunction(); ArrayRef Ops = getAllOperands(); Optional Index; // For each operand... for (unsigned i = 0, e = Ops.size(); i != e; ++i) { // If the operand is not trivial... if (!Ops[i].get()->getType().isTrivial(*F)) { // And we have not found an Index yet, set index to i and continue. if (!Index.hasValue()) { Index = i; continue; } // Otherwise, we have two values that are non-trivial. Bail. return SILValue(); } } // If we did not find an index, return an empty SILValue. if (!Index.hasValue()) return SILValue(); // Otherwise, return the value associated with index. return Ops[Index.getValue()].get(); } StructDecl *getStructDecl() const { auto s = getType().getStructOrBoundGenericStruct(); assert(s && "A struct should always have a StructDecl associated with it"); return s; } }; /// RefCountingInst - An abstract class of instructions which /// manipulate the reference count of their object operand. class RefCountingInst : public NonValueInstruction { public: /// The atomicity of a reference counting operation to be used. enum class Atomicity : bool { /// Atomic reference counting operations should be used. Atomic, /// Non-atomic reference counting operations can be used. NonAtomic, }; protected: RefCountingInst(SILInstructionKind Kind, SILDebugLocation DebugLoc) : NonValueInstruction(Kind, DebugLoc) { SILInstruction::Bits.RefCountingInst.atomicity = bool(Atomicity::Atomic); } public: void setAtomicity(Atomicity flag) { SILInstruction::Bits.RefCountingInst.atomicity = bool(flag); } void setNonAtomic() { SILInstruction::Bits.RefCountingInst.atomicity = bool(Atomicity::NonAtomic); } void setAtomic() { SILInstruction::Bits.RefCountingInst.atomicity = bool(Atomicity::Atomic); } Atomicity getAtomicity() const { return Atomicity(SILInstruction::Bits.RefCountingInst.atomicity); } bool isNonAtomic() const { return getAtomicity() == Atomicity::NonAtomic; } bool isAtomic() const { return getAtomicity() == Atomicity::Atomic; } DEFINE_ABSTRACT_NON_VALUE_INST_BOILERPLATE(RefCountingInst) }; /// RetainValueInst - Copies a loadable value. class RetainValueInst : public UnaryInstructionBase { friend SILBuilder; RetainValueInst(SILDebugLocation DebugLoc, SILValue operand, Atomicity atomicity) : UnaryInstructionBase(DebugLoc, operand) { setAtomicity(atomicity); } }; /// RetainValueAddrInst - Copies a loadable value by address. class RetainValueAddrInst : public UnaryInstructionBase { friend SILBuilder; RetainValueAddrInst(SILDebugLocation DebugLoc, SILValue operand, Atomicity atomicity) : UnaryInstructionBase(DebugLoc, operand) { setAtomicity(atomicity); } }; /// ReleaseValueInst - Destroys a loadable value. class ReleaseValueInst : public UnaryInstructionBase { friend SILBuilder; ReleaseValueInst(SILDebugLocation DebugLoc, SILValue operand, Atomicity atomicity) : UnaryInstructionBase(DebugLoc, operand) { setAtomicity(atomicity); } }; /// ReleaseValueInst - Destroys a loadable value by address. class ReleaseValueAddrInst : public UnaryInstructionBase { friend SILBuilder; ReleaseValueAddrInst(SILDebugLocation DebugLoc, SILValue operand, Atomicity atomicity) : UnaryInstructionBase(DebugLoc, operand) { setAtomicity(atomicity); } }; /// Copies a loadable value in an unmanaged, unbalanced way. Only meant for use /// in ownership qualified SIL. Please do not use this EVER unless you are /// implementing a part of the stdlib called Unmanaged. class UnmanagedRetainValueInst : public UnaryInstructionBase { friend SILBuilder; UnmanagedRetainValueInst(SILDebugLocation DebugLoc, SILValue operand, Atomicity atomicity) : UnaryInstructionBase(DebugLoc, operand) { setAtomicity(atomicity); } }; /// Destroys a loadable value in an unmanaged, unbalanced way. Only meant for /// use in ownership qualified SIL. Please do not use this EVER unless you are /// implementing a part of the stdlib called Unmanaged. class UnmanagedReleaseValueInst : public UnaryInstructionBase { friend SILBuilder; UnmanagedReleaseValueInst(SILDebugLocation DebugLoc, SILValue operand, Atomicity atomicity) : UnaryInstructionBase(DebugLoc, operand) { setAtomicity(atomicity); } }; /// Transfers ownership of a loadable value to the current autorelease /// pool. Unmanaged, so it is ignored from an ownership balancing perspective. class UnmanagedAutoreleaseValueInst : public UnaryInstructionBase { friend SILBuilder; UnmanagedAutoreleaseValueInst(SILDebugLocation DebugLoc, SILValue operand, Atomicity atomicity) : UnaryInstructionBase(DebugLoc, operand) { setAtomicity(atomicity); } }; /// Transfers ownership of a loadable value to the current autorelease pool. class AutoreleaseValueInst : public UnaryInstructionBase { friend SILBuilder; AutoreleaseValueInst(SILDebugLocation DebugLoc, SILValue operand, Atomicity atomicity) : UnaryInstructionBase(DebugLoc, operand) { setAtomicity(atomicity); } }; /// SetDeallocatingInst - Sets the operand in deallocating state. /// /// This is the same operation what's done by a strong_release immediately /// before it calls the deallocator of the object. class SetDeallocatingInst : public UnaryInstructionBase { friend SILBuilder; SetDeallocatingInst(SILDebugLocation DebugLoc, SILValue operand, Atomicity atomicity) : UnaryInstructionBase(DebugLoc, operand) { setAtomicity(atomicity); } }; /// ObjectInst - Represents a object value type. /// /// This instruction can only appear at the end of a gobal variable's /// static initializer list. class ObjectInst final : public InstructionBaseWithTrailingOperands< SILInstructionKind::ObjectInst, ObjectInst, OwnershipForwardingSingleValueInst> { friend SILBuilder; /// Because of the storage requirements of ObjectInst, object /// creation goes through 'create()'. ObjectInst(SILDebugLocation DebugLoc, SILType Ty, ArrayRef Elements, unsigned NumBaseElements, bool HasOwnership) : InstructionBaseWithTrailingOperands( Elements, DebugLoc, Ty, HasOwnership ? *mergeSILValueOwnership(Elements) : ValueOwnershipKind(ValueOwnershipKind::None)) { SILInstruction::Bits.ObjectInst.NumBaseElements = NumBaseElements; } /// Construct an ObjectInst. static ObjectInst *create(SILDebugLocation DebugLoc, SILType Ty, ArrayRef Elements, unsigned NumBaseElements, SILModule &M, bool HasOwnership); public: /// All elements referenced by this ObjectInst. MutableArrayRef getElementOperands() { return getAllOperands(); } /// All elements referenced by this ObjectInst. OperandValueArrayRef getAllElements() const { return OperandValueArrayRef(getAllOperands()); } /// The elements which initialize the stored properties of the object itself. OperandValueArrayRef getBaseElements() const { return OperandValueArrayRef(getAllOperands().slice(0, SILInstruction::Bits.ObjectInst.NumBaseElements)); } /// The elements which initialize the tail allocated elements. OperandValueArrayRef getTailElements() const { return OperandValueArrayRef(getAllOperands().slice( SILInstruction::Bits.ObjectInst.NumBaseElements)); } }; /// TupleInst - Represents a constructed loadable tuple. class TupleInst final : public InstructionBaseWithTrailingOperands< SILInstructionKind::TupleInst, TupleInst, OwnershipForwardingSingleValueInst> { friend SILBuilder; /// Because of the storage requirements of TupleInst, object /// creation goes through 'create()'. TupleInst(SILDebugLocation DebugLoc, SILType Ty, ArrayRef Elems, bool HasOwnership) : InstructionBaseWithTrailingOperands( Elems, DebugLoc, Ty, HasOwnership ? *mergeSILValueOwnership(Elems) : ValueOwnershipKind(ValueOwnershipKind::None)) {} /// Construct a TupleInst. static TupleInst *create(SILDebugLocation DebugLoc, SILType Ty, ArrayRef Elements, SILModule &M, bool HasOwnership); public: /// The elements referenced by this TupleInst. MutableArrayRef getElementOperands() { return getAllOperands(); } /// The elements referenced by this TupleInst. OperandValueArrayRef getElements() const { return OperandValueArrayRef(getAllOperands()); } /// Return the i'th value referenced by this TupleInst. SILValue getElement(unsigned i) const { return getElements()[i]; } unsigned getElementIndex(Operand *operand) { assert(operand->getUser() == this); return operand->getOperandNumber(); } TupleType *getTupleType() const { return getType().castTo(); } /// Search the operands of this tuple for a unique non-trivial elt. If we find /// it, return it. Otherwise return SILValue(). SILValue getUniqueNonTrivialElt() { auto *F = getFunction(); ArrayRef Ops = getAllOperands(); Optional Index; // For each operand... for (unsigned i = 0, e = Ops.size(); i != e; ++i) { // If the operand is not trivial... if (!Ops[i].get()->getType().isTrivial(*F)) { // And we have not found an Index yet, set index to i and continue. if (!Index.hasValue()) { Index = i; continue; } // Otherwise, we have two values that are non-trivial. Bail. return SILValue(); } } // If we did not find an index, return an empty SILValue. if (!Index.hasValue()) return SILValue(); // Otherwise, return the value associated with index. return Ops[Index.getValue()].get(); } }; /// Represents a loadable enum constructed from one of its /// elements. class EnumInst : public InstructionBase { friend SILBuilder; Optional> OptionalOperand; EnumElementDecl *Element; EnumInst(SILDebugLocation DebugLoc, SILValue Operand, EnumElementDecl *Element, SILType ResultTy) : InstructionBase(DebugLoc, ResultTy, Operand ? Operand.getOwnershipKind() : ValueOwnershipKind(ValueOwnershipKind::None)), Element(Element) { if (Operand) { OptionalOperand.emplace(this, Operand); } } public: EnumElementDecl *getElement() const { return Element; } bool hasOperand() const { return OptionalOperand.hasValue(); } SILValue getOperand() const { return OptionalOperand->asValueArray()[0]; } Operand &getOperandRef() { return OptionalOperand->asArray()[0]; } ArrayRef getAllOperands() const { return OptionalOperand ? OptionalOperand->asArray() : ArrayRef{}; } MutableArrayRef getAllOperands() { return OptionalOperand ? OptionalOperand->asArray() : MutableArrayRef{}; } }; /// Unsafely project the data for an enum case out of an enum without checking /// the tag. class UncheckedEnumDataInst : public UnaryInstructionBase { friend SILBuilder; EnumElementDecl *Element; UncheckedEnumDataInst(SILDebugLocation DebugLoc, SILValue Operand, EnumElementDecl *Element, SILType ResultTy) : UnaryInstructionBase(DebugLoc, Operand, ResultTy, Operand.getOwnershipKind()), Element(Element) {} public: EnumElementDecl *getElement() const { return Element; } EnumDecl *getEnumDecl() const { auto *E = getOperand()->getType().getEnumOrBoundGenericEnum(); assert(E && "Operand of unchecked_enum_data must be of enum type"); return E; } unsigned getElementNo() const { unsigned i = 0; for (EnumElementDecl *E : getEnumDecl()->getAllElements()) { if (E == Element) return i; ++i; } llvm_unreachable("An unchecked_enum_data's enumdecl should have at least " "on element, the element that is being extracted"); } }; /// Projects the address of the data for a case inside an uninitialized enum in /// order to initialize the payload for that case. class InitEnumDataAddrInst : public UnaryInstructionBase { friend SILBuilder; EnumElementDecl *Element; InitEnumDataAddrInst(SILDebugLocation DebugLoc, SILValue Operand, EnumElementDecl *Element, SILType ResultTy) : UnaryInstructionBase(DebugLoc, Operand, ResultTy), Element(Element) {} public: EnumElementDecl *getElement() const { return Element; } }; /// InjectEnumAddrInst - Tags an enum as containing a case. The data for /// that case, if any, must have been written into the enum first. class InjectEnumAddrInst : public UnaryInstructionBase { friend SILBuilder; EnumElementDecl *Element; InjectEnumAddrInst(SILDebugLocation DebugLoc, SILValue Operand, EnumElementDecl *Element) : UnaryInstructionBase(DebugLoc, Operand), Element(Element) {} public: EnumElementDecl *getElement() const { return Element; } }; /// Invalidate an enum value and take ownership of its payload data /// without moving it in memory. class UncheckedTakeEnumDataAddrInst : public UnaryInstructionBase { friend SILBuilder; EnumElementDecl *Element; UncheckedTakeEnumDataAddrInst(SILDebugLocation DebugLoc, SILValue Operand, EnumElementDecl *Element, SILType ResultTy) : UnaryInstructionBase(DebugLoc, Operand, ResultTy), Element(Element) {} public: EnumElementDecl *getElement() const { return Element; } EnumDecl *getEnumDecl() const { auto *E = getOperand()->getType().getEnumOrBoundGenericEnum(); assert(E && "Operand of unchecked_take_enum_data_addr must be of enum" " type"); return E; } unsigned getElementNo() const { unsigned i = 0; for (EnumElementDecl *E : getEnumDecl()->getAllElements()) { if (E == Element) return i; ++i; } llvm_unreachable( "An unchecked_enum_data_addr's enumdecl should have at least " "on element, the element that is being extracted"); } }; // Abstract base class of all select instructions like select_enum, // select_value, etc. The template parameter represents a type of case values // to be compared with the operand of a select instruction. // // Subclasses must provide tail allocated storage. // The first operand is the operand of select_xxx instruction. The rest of // the operands are the case values and results of a select instruction. template class SelectInstBase : public Base { public: template SelectInstBase(SILInstructionKind kind, SILDebugLocation Loc, SILType type, Args &&... otherArgs) : Base(kind, Loc, type, std::forward(otherArgs)...) {} SILValue getOperand() const { return getAllOperands()[0].get(); } ArrayRef getAllOperands() const { return static_cast(this)->getAllOperands(); } MutableArrayRef getAllOperands() { return static_cast(this)->getAllOperands(); } std::pair getCase(unsigned i) const { return static_cast(this)->getCase(i); } unsigned getNumCases() const { return static_cast(this)->getNumCases(); } bool hasDefault() const { return static_cast(this)->hasDefault(); } SILValue getDefaultResult() const { return static_cast(this)->getDefaultResult(); } }; /// Common base class for the select_enum and select_enum_addr instructions, /// which select one of a set of possible results based on the case of an enum. class SelectEnumInstBase : public SelectInstBase { // Tail-allocated after the operands is an array of `NumCases` // EnumElementDecl* pointers, referencing the case discriminators for each // operand. EnumElementDecl **getEnumElementDeclStorage(); EnumElementDecl * const* getEnumElementDeclStorage() const { return const_cast(this)->getEnumElementDeclStorage(); } protected: SelectEnumInstBase(SILInstructionKind kind, SILDebugLocation debugLoc, SILType type, bool defaultValue, Optional> CaseCounts, ProfileCounter DefaultCount) : SelectInstBase(kind, debugLoc, type) { SILInstruction::Bits.SelectEnumInstBase.HasDefault = defaultValue; } template static SELECT_ENUM_INST * createSelectEnum(SILDebugLocation DebugLoc, SILValue Enum, SILType Type, SILValue DefaultValue, ArrayRef> CaseValues, SILModule &M, Optional> CaseCounts, ProfileCounter DefaultCount, bool HasOwnership); public: ArrayRef getAllOperands() const; MutableArrayRef getAllOperands(); SILValue getOperand() const { return getAllOperands()[0].get(); } SILValue getEnumOperand() const { return getOperand(); } std::pair getCase(unsigned i) const { return std::make_pair(getEnumElementDeclStorage()[i], getAllOperands()[i+1].get()); } /// Return the value that will be used as the result for the specified enum /// case. SILValue getCaseResult(EnumElementDecl *D) { for (unsigned i = 0, e = getNumCases(); i != e; ++i) { auto Entry = getCase(i); if (Entry.first == D) return Entry.second; } // select_enum is required to be fully covered, so return the default if we // didn't find anything. return getDefaultResult(); } /// If the default refers to exactly one case decl, return it. NullablePtr getUniqueCaseForDefault(); bool hasDefault() const { return SILInstruction::Bits.SelectEnumInstBase.HasDefault; } SILValue getDefaultResult() const { assert(hasDefault() && "doesn't have a default"); return getAllOperands().back().get(); } unsigned getNumCases() const { return getAllOperands().size() - 1 - hasDefault(); } /// If there is a single case that returns a literal "true" value (an /// "integer_literal $Builtin.Int1, 1" value), return it. /// /// FIXME: This is used to interoperate with passes that reasoned about the /// old enum_is_tag insn. Ideally those passes would become general enough /// not to need this. NullablePtr getSingleTrueElement() const; }; /// A select enum inst that produces a static OwnershipKind. class OwnershipForwardingSelectEnumInstBase : public SelectEnumInstBase { ValueOwnershipKind ownershipKind; protected: OwnershipForwardingSelectEnumInstBase( SILInstructionKind kind, SILDebugLocation debugLoc, SILType type, bool defaultValue, Optional> caseCounts, ProfileCounter defaultCount, ValueOwnershipKind ownershipKind) : SelectEnumInstBase(kind, debugLoc, type, defaultValue, caseCounts, defaultCount), ownershipKind(ownershipKind) {} public: ValueOwnershipKind getOwnershipKind() const { return ownershipKind; } void setOwnershipKind(ValueOwnershipKind newOwnershipKind) { ownershipKind = newOwnershipKind; } }; /// Select one of a set of values based on the case of an enum. class SelectEnumInst final : public InstructionBaseWithTrailingOperands< SILInstructionKind::SelectEnumInst, SelectEnumInst, OwnershipForwardingSelectEnumInstBase, EnumElementDecl *> { friend SILBuilder; private: friend SelectEnumInstBase; SelectEnumInst(SILDebugLocation DebugLoc, SILValue Operand, SILType Type, bool DefaultValue, ArrayRef CaseValues, ArrayRef CaseDecls, Optional> CaseCounts, ProfileCounter DefaultCount, bool HasOwnership) : InstructionBaseWithTrailingOperands( Operand, CaseValues, DebugLoc, Type, bool(DefaultValue), CaseCounts, DefaultCount, HasOwnership ? *mergeSILValueOwnership(CaseValues) : ValueOwnershipKind(ValueOwnershipKind::None)) { assert(CaseValues.size() - DefaultValue == CaseDecls.size()); std::uninitialized_copy(CaseDecls.begin(), CaseDecls.end(), getTrailingObjects()); } static SelectEnumInst * create(SILDebugLocation DebugLoc, SILValue Operand, SILType Type, SILValue DefaultValue, ArrayRef> CaseValues, SILModule &M, Optional> CaseCounts, ProfileCounter DefaultCount, bool HasOwnership); }; /// Select one of a set of values based on the case of an enum. class SelectEnumAddrInst final : public InstructionBaseWithTrailingOperands< SILInstructionKind::SelectEnumAddrInst, SelectEnumAddrInst, SelectEnumInstBase, EnumElementDecl *> { friend SILBuilder; friend SelectEnumInstBase; SelectEnumAddrInst(SILDebugLocation DebugLoc, SILValue Operand, SILType Type, bool DefaultValue, ArrayRef CaseValues, ArrayRef CaseDecls, Optional> CaseCounts, ProfileCounter DefaultCount, bool HasOwnership) : InstructionBaseWithTrailingOperands(Operand, CaseValues, DebugLoc, Type, bool(DefaultValue), CaseCounts, DefaultCount) { (void)HasOwnership; assert(CaseValues.size() - DefaultValue == CaseDecls.size()); std::uninitialized_copy(CaseDecls.begin(), CaseDecls.end(), getTrailingObjects()); } static SelectEnumAddrInst * create(SILDebugLocation DebugLoc, SILValue Operand, SILType Type, SILValue DefaultValue, ArrayRef> CaseValues, SILModule &M, Optional> CaseCounts, ProfileCounter DefaultCount); }; /// Select on a value of a builtin integer type. /// /// There is 'the' operand, followed by pairs of operands for each case, /// followed by an optional default operand. class SelectValueInst final : public InstructionBaseWithTrailingOperands< SILInstructionKind::SelectValueInst, SelectValueInst, SelectInstBase> { friend SILBuilder; SelectValueInst(SILDebugLocation DebugLoc, SILValue Operand, SILType Type, SILValue DefaultResult, ArrayRef CaseValuesAndResults, bool HasOwnership); static SelectValueInst * create(SILDebugLocation DebugLoc, SILValue Operand, SILType Type, SILValue DefaultValue, ArrayRef> CaseValues, SILModule &M, bool HasOwnership); public: std::pair getCase(unsigned i) const { auto cases = getAllOperands().slice(1); return {cases[i*2].get(), cases[i*2+1].get()}; } unsigned getNumCases() const { // Ignore the first non-case operand. auto count = getAllOperands().size() - 1; // This implicitly ignore the optional default operand. return count / 2; } bool hasDefault() const { // If the operand count is even, then we have a default value. return (getAllOperands().size() & 1) == 0; } SILValue getDefaultResult() const { assert(hasDefault() && "doesn't have a default"); return getAllOperands().back().get(); } }; /// MetatypeInst - Represents the production of an instance of a given metatype /// named statically. class MetatypeInst final : public InstructionBaseWithTrailingOperands< SILInstructionKind::MetatypeInst, MetatypeInst, SingleValueInstruction> { friend SILBuilder; /// Constructs a MetatypeInst MetatypeInst(SILDebugLocation DebugLoc, SILType Metatype, ArrayRef TypeDependentOperands) : InstructionBaseWithTrailingOperands(TypeDependentOperands, DebugLoc, Metatype) {} static MetatypeInst *create(SILDebugLocation DebugLoc, SILType Metatype, SILFunction *F, SILOpenedArchetypesState &OpenedArchetypes); public: ArrayRef getTypeDependentOperands() const { return getAllOperands(); } MutableArrayRef getTypeDependentOperands() { return getAllOperands(); } }; /// Represents loading a dynamic metatype from a value. class ValueMetatypeInst : public UnaryInstructionBase { friend SILBuilder; ValueMetatypeInst(SILDebugLocation DebugLoc, SILType Metatype, SILValue Base) : UnaryInstructionBase(DebugLoc, Base, Metatype) {} }; /// ExistentialMetatype - Represents loading a dynamic metatype from an /// existential container. class ExistentialMetatypeInst : public UnaryInstructionBase { friend SILBuilder; ExistentialMetatypeInst(SILDebugLocation DebugLoc, SILType Metatype, SILValue Base) : UnaryInstructionBase(DebugLoc, Base, Metatype) {} }; /// Extract a numbered element out of a value of tuple type. class TupleExtractInst : public UnaryInstructionBase { friend SILBuilder; TupleExtractInst(SILDebugLocation DebugLoc, SILValue Operand, unsigned FieldNo, SILType ResultTy) : UnaryInstructionBase(DebugLoc, Operand, ResultTy) { SILInstruction::Bits.TupleExtractInst.FieldNo = FieldNo; } public: unsigned getFieldNo() const { return SILInstruction::Bits.TupleExtractInst.FieldNo; } TupleType *getTupleType() const { return getOperand()->getType().castTo(); } unsigned getNumTupleElts() const { return getTupleType()->getNumElements(); } /// Returns true if this is a trivial result of a tuple that is non-trivial /// and represents one RCID. bool isTrivialEltOfOneRCIDTuple() const; bool isEltOnlyNonTrivialElt() const; }; /// Derive the address of a numbered element from the address of a tuple. class TupleElementAddrInst : public UnaryInstructionBase { friend SILBuilder; TupleElementAddrInst(SILDebugLocation DebugLoc, SILValue Operand, unsigned FieldNo, SILType ResultTy) : UnaryInstructionBase(DebugLoc, Operand, ResultTy) { SILInstruction::Bits.TupleElementAddrInst.FieldNo = FieldNo; } public: unsigned getFieldNo() const { return SILInstruction::Bits.TupleElementAddrInst.FieldNo; } TupleType *getTupleType() const { return getOperand()->getType().castTo(); } }; /// A common base for instructions that require a cached field index. /// /// "Field" is a term used here to refer to the ordered, accessible stored /// properties of a class or struct. /// /// The field's ordinal value is the basis of efficiently comparing and sorting /// access paths in SIL. For example, whenever a Projection object is created, /// it stores the field index. Finding the field index initially requires /// searching the type declaration's array of all stored properties. If this /// index is not cached, it will cause widespread quadratic complexity in any /// pass that queries projections, including the SIL verifier. /// /// FIXME: This cache may not be necessary if the Decl TypeChecker instead /// caches a field index in the VarDecl itself. This solution would be superior /// because it would allow constant time lookup of either the VarDecl or the /// index from a single pointer without referring back to a projection /// instruction. class FieldIndexCacheBase : public SingleValueInstruction { enum : unsigned { InvalidFieldIndex = ~unsigned(0) }; VarDecl *field; public: FieldIndexCacheBase(SILInstructionKind kind, SILDebugLocation loc, SILType type, VarDecl *field) : SingleValueInstruction(kind, loc, type), field(field) { SILInstruction::Bits.FieldIndexCacheBase.FieldIndex = InvalidFieldIndex; // This needs to be a concrete class to hold bitfield information. However, // it should only be extended by UnaryInstructions. assert(getNumOperands() == 1); } VarDecl *getField() const { return field; } // FIXME: this should be called getFieldIndex(). unsigned getFieldNo() const { unsigned idx = SILInstruction::Bits.FieldIndexCacheBase.FieldIndex; if (idx != InvalidFieldIndex) return idx; return const_cast(this)->cacheFieldIndex(); } NominalTypeDecl *getParentDecl() const { auto s = getOperand(0)->getType().getNominalOrBoundGenericNominal(); assert(s); return s; } private: unsigned cacheFieldIndex(); }; /// Extract a physical, fragile field out of a value of struct type. class StructExtractInst : public UnaryInstructionBase { friend SILBuilder; StructExtractInst(SILDebugLocation DebugLoc, SILValue Operand, VarDecl *Field, SILType ResultTy) : UnaryInstructionBase(DebugLoc, Operand, ResultTy, Field) {} public: StructDecl *getStructDecl() const { return cast(getParentDecl()); } /// Returns true if this is a trivial result of a struct that is non-trivial /// and represents one RCID. bool isTrivialFieldOfOneRCIDStruct() const; /// Return true if we are extracting the only non-trivial field of out parent /// struct. This implies that a ref count operation on the aggregate is /// equivalent to a ref count operation on this field. bool isFieldOnlyNonTrivialField() const; }; /// Derive the address of a physical field from the address of a struct. class StructElementAddrInst : public UnaryInstructionBase { friend SILBuilder; StructElementAddrInst(SILDebugLocation DebugLoc, SILValue Operand, VarDecl *Field, SILType ResultTy) : UnaryInstructionBase(DebugLoc, Operand, ResultTy, Field) {} public: StructDecl *getStructDecl() const { return cast(getParentDecl()); } }; /// RefElementAddrInst - Derive the address of a named element in a reference /// type instance. class RefElementAddrInst : public UnaryInstructionBase { friend SILBuilder; RefElementAddrInst(SILDebugLocation DebugLoc, SILValue Operand, VarDecl *Field, SILType ResultTy) : UnaryInstructionBase(DebugLoc, Operand, ResultTy, Field) {} public: ClassDecl *getClassDecl() const { return cast(getParentDecl()); } }; /// RefTailAddrInst - Derive the address of the first element of the first /// tail-allocated array in a reference type instance. class RefTailAddrInst : public UnaryInstructionBase { friend SILBuilder; RefTailAddrInst(SILDebugLocation DebugLoc, SILValue Operand, SILType ResultTy) : UnaryInstructionBase(DebugLoc, Operand, ResultTy) {} public: ClassDecl *getClassDecl() const { auto s = getOperand()->getType().getClassOrBoundGenericClass(); assert(s); return s; } SILType getTailType() const { return getType().getObjectType(); } }; /// MethodInst - Abstract base for instructions that implement dynamic /// method lookup. class MethodInst : public SingleValueInstruction { SILDeclRef Member; public: MethodInst(SILInstructionKind Kind, SILDebugLocation DebugLoc, SILType Ty, SILDeclRef Member) : SingleValueInstruction(Kind, DebugLoc, Ty), Member(Member) { } SILDeclRef getMember() const { return Member; } DEFINE_ABSTRACT_SINGLE_VALUE_INST_BOILERPLATE(MethodInst) }; /// ClassMethodInst - Given the address of a value of class type and a method /// constant, extracts the implementation of that method for the dynamic /// instance type of the class. class ClassMethodInst : public UnaryInstructionBase { friend SILBuilder; ClassMethodInst(SILDebugLocation DebugLoc, SILValue Operand, SILDeclRef Member, SILType Ty) : UnaryInstructionBase(DebugLoc, Operand, Ty, Member) {} }; /// SuperMethodInst - Given the address of a value of class type and a method /// constant, extracts the implementation of that method for the superclass of /// the static type of the class. class SuperMethodInst : public UnaryInstructionBase { friend SILBuilder; SuperMethodInst(SILDebugLocation DebugLoc, SILValue Operand, SILDeclRef Member, SILType Ty) : UnaryInstructionBase(DebugLoc, Operand, Ty, Member) {} }; /// ObjCMethodInst - Given the address of a value of class type and a method /// constant, extracts the implementation of that method for the dynamic /// instance type of the class. class ObjCMethodInst final : public UnaryInstructionWithTypeDependentOperandsBase< SILInstructionKind::ObjCMethodInst, ObjCMethodInst, MethodInst> { friend SILBuilder; ObjCMethodInst(SILDebugLocation DebugLoc, SILValue Operand, ArrayRef TypeDependentOperands, SILDeclRef Member, SILType Ty) : UnaryInstructionWithTypeDependentOperandsBase(DebugLoc, Operand, TypeDependentOperands, Ty, Member) {} static ObjCMethodInst * create(SILDebugLocation DebugLoc, SILValue Operand, SILDeclRef Member, SILType Ty, SILFunction *F, SILOpenedArchetypesState &OpenedArchetypes); }; /// ObjCSuperMethodInst - Given the address of a value of class type and a method /// constant, extracts the implementation of that method for the superclass of /// the static type of the class. class ObjCSuperMethodInst : public UnaryInstructionBase { friend SILBuilder; ObjCSuperMethodInst(SILDebugLocation DebugLoc, SILValue Operand, SILDeclRef Member, SILType Ty) : UnaryInstructionBase(DebugLoc, Operand, Ty, Member) {} }; /// WitnessMethodInst - Given a type, a protocol conformance, /// and a protocol method constant, extracts the implementation of that method /// for the type. class WitnessMethodInst final : public InstructionBaseWithTrailingOperands< SILInstructionKind::WitnessMethodInst, WitnessMethodInst, MethodInst> { friend SILBuilder; CanType LookupType; ProtocolConformanceRef Conformance; WitnessMethodInst(SILDebugLocation DebugLoc, CanType LookupType, ProtocolConformanceRef Conformance, SILDeclRef Member, SILType Ty, ArrayRef TypeDependentOperands) : InstructionBaseWithTrailingOperands(TypeDependentOperands, DebugLoc, Ty, Member), LookupType(LookupType), Conformance(Conformance) {} /// Create a witness method call of a protocol requirement, passing in a lookup /// type and conformance. /// /// At runtime, the witness is looked up in the conformance of the lookup type /// to the protocol. /// /// The lookup type is usually an archetype, but it will be concrete if the /// witness_method instruction is inside a function body that was specialized. /// /// The conformance must exactly match the requirement; the caller must handle /// the case where the requirement is defined in a base protocol that is /// refined by the conforming protocol. static WitnessMethodInst * create(SILDebugLocation DebugLoc, CanType LookupType, ProtocolConformanceRef Conformance, SILDeclRef Member, SILType Ty, SILFunction *Parent, SILOpenedArchetypesState &OpenedArchetypes); public: CanType getLookupType() const { return LookupType; } ProtocolDecl *getLookupProtocol() const { return getMember().getDecl()->getDeclContext()->getSelfProtocolDecl(); } ProtocolConformanceRef getConformance() const { return Conformance; } ArrayRef getTypeDependentOperands() const { return getAllOperands(); } MutableArrayRef getTypeDependentOperands() { return getAllOperands(); } }; /// Access allowed to the opened value by the open_existential_addr instruction. /// Allowing mutable access to the opened existential requires a boxed /// existential value's box to be unique. enum class OpenedExistentialAccess { Immutable, Mutable }; OpenedExistentialAccess getOpenedExistentialAccessFor(AccessKind access); /// Given the address of an existential, "opens" the /// existential by returning a pointer to a fresh archetype T, which also /// captures the (dynamic) conformances. class OpenExistentialAddrInst : public UnaryInstructionBase { friend SILBuilder; OpenedExistentialAccess ForAccess; OpenExistentialAddrInst(SILDebugLocation DebugLoc, SILValue Operand, SILType SelfTy, OpenedExistentialAccess AccessKind); public: OpenedExistentialAccess getAccessKind() const { return ForAccess; } }; /// Given an opaque value referring to an existential, "opens" the /// existential by returning a pointer to a fresh archetype T, which also /// captures the (dynamic) conformances. class OpenExistentialValueInst : public UnaryInstructionBase { friend SILBuilder; OpenExistentialValueInst(SILDebugLocation DebugLoc, SILValue Operand, SILType SelfTy); }; /// Given a class existential, "opens" the /// existential by returning a pointer to a fresh archetype T, which also /// captures the (dynamic) conformances. class OpenExistentialRefInst : public UnaryInstructionBase { friend SILBuilder; OpenExistentialRefInst(SILDebugLocation DebugLoc, SILValue Operand, SILType Ty, bool HasOwnership); }; /// Given an existential metatype, /// "opens" the existential by returning a pointer to a fresh /// archetype metatype T.Type, which also captures the (dynamic) /// conformances. class OpenExistentialMetatypeInst : public UnaryInstructionBase { friend SILBuilder; OpenExistentialMetatypeInst(SILDebugLocation DebugLoc, SILValue operand, SILType ty); }; /// Given a boxed existential container, /// "opens" the existential by returning a pointer to a fresh /// archetype T, which also captures the (dynamic) conformances. class OpenExistentialBoxInst : public UnaryInstructionBase { friend SILBuilder; OpenExistentialBoxInst(SILDebugLocation DebugLoc, SILValue operand, SILType ty); }; /// Given a boxed existential container, "opens" the existential by returning a /// fresh archetype T, which also captures the (dynamic) conformances. class OpenExistentialBoxValueInst : public UnaryInstructionBase { friend SILBuilder; OpenExistentialBoxValueInst(SILDebugLocation DebugLoc, SILValue operand, SILType ty); }; /// Given an address to an uninitialized buffer of /// a protocol type, initializes its existential container to contain a concrete /// value of the given type, and returns the address of the uninitialized /// concrete value inside the existential container. class InitExistentialAddrInst final : public UnaryInstructionWithTypeDependentOperandsBase< SILInstructionKind::InitExistentialAddrInst, InitExistentialAddrInst, SingleValueInstruction> { friend SILBuilder; CanType ConcreteType; ArrayRef Conformances; InitExistentialAddrInst(SILDebugLocation DebugLoc, SILValue Existential, ArrayRef TypeDependentOperands, CanType ConcreteType, SILType ConcreteLoweredType, ArrayRef Conformances) : UnaryInstructionWithTypeDependentOperandsBase(DebugLoc, Existential, TypeDependentOperands, ConcreteLoweredType.getAddressType()), ConcreteType(ConcreteType), Conformances(Conformances) {} static InitExistentialAddrInst * create(SILDebugLocation DebugLoc, SILValue Existential, CanType ConcreteType, SILType ConcreteLoweredType, ArrayRef Conformances, SILFunction *Parent, SILOpenedArchetypesState &OpenedArchetypes); public: ArrayRef getConformances() const { return Conformances; } CanType getFormalConcreteType() const { return ConcreteType; } SILType getLoweredConcreteType() const { return getType(); } }; /// Given an uninitialized buffer of a protocol type, /// initializes its existential container to contain a concrete /// value of the given type, and returns the uninitialized /// concrete value inside the existential container. class InitExistentialValueInst final : public UnaryInstructionWithTypeDependentOperandsBase< SILInstructionKind::InitExistentialValueInst, InitExistentialValueInst, SingleValueInstruction> { friend SILBuilder; CanType ConcreteType; ArrayRef Conformances; InitExistentialValueInst(SILDebugLocation DebugLoc, SILType ExistentialType, CanType FormalConcreteType, SILValue Instance, ArrayRef TypeDependentOperands, ArrayRef Conformances) : UnaryInstructionWithTypeDependentOperandsBase( DebugLoc, Instance, TypeDependentOperands, ExistentialType), ConcreteType(FormalConcreteType), Conformances(Conformances) {} static InitExistentialValueInst * create(SILDebugLocation DebugLoc, SILType ExistentialType, CanType ConcreteType, SILValue Instance, ArrayRef Conformances, SILFunction *Parent, SILOpenedArchetypesState &OpenedArchetypes); public: CanType getFormalConcreteType() const { return ConcreteType; } ArrayRef getConformances() const { return Conformances; } }; /// InitExistentialRefInst - Given a class instance reference and a set of /// conformances, creates a class existential value referencing the /// class instance. class InitExistentialRefInst final : public UnaryInstructionWithTypeDependentOperandsBase< SILInstructionKind::InitExistentialRefInst, InitExistentialRefInst, OwnershipForwardingSingleValueInst> { friend SILBuilder; CanType ConcreteType; ArrayRef Conformances; InitExistentialRefInst(SILDebugLocation DebugLoc, SILType ExistentialType, CanType FormalConcreteType, SILValue Instance, ArrayRef TypeDependentOperands, ArrayRef Conformances) : UnaryInstructionWithTypeDependentOperandsBase( DebugLoc, Instance, TypeDependentOperands, ExistentialType, Instance.getOwnershipKind()), ConcreteType(FormalConcreteType), Conformances(Conformances) {} static InitExistentialRefInst * create(SILDebugLocation DebugLoc, SILType ExistentialType, CanType ConcreteType, SILValue Instance, ArrayRef Conformances, SILFunction *Parent, SILOpenedArchetypesState &OpenedArchetypes); public: CanType getFormalConcreteType() const { return ConcreteType; } ArrayRef getConformances() const { return Conformances; } }; /// InitExistentialMetatypeInst - Given a metatype reference and a set /// of conformances, creates an existential metatype value referencing /// the metatype. class InitExistentialMetatypeInst final : public UnaryInstructionWithTypeDependentOperandsBase< SILInstructionKind::InitExistentialMetatypeInst, InitExistentialMetatypeInst, SingleValueInstruction, ProtocolConformanceRef> { friend SILBuilder; unsigned NumConformances; InitExistentialMetatypeInst(SILDebugLocation DebugLoc, SILType existentialMetatypeType, SILValue metatype, ArrayRef TypeDependentOperands, ArrayRef conformances); static InitExistentialMetatypeInst * create(SILDebugLocation DebugLoc, SILType existentialMetatypeType, SILValue metatype, ArrayRef conformances, SILFunction *parent, SILOpenedArchetypesState &OpenedArchetypes); public: /// Return the object type which was erased. That is, if this /// instruction erases Decoder.Type.Type to Printable.Type.Type, /// this method returns Decoder. CanType getFormalErasedObjectType() const { auto exType = getType().getASTType(); auto concreteType = getOperand()->getType().getASTType(); while (auto exMetatype = dyn_cast(exType)) { exType = exMetatype.getInstanceType(); concreteType = cast(concreteType).getInstanceType(); } assert(exType.isExistentialType()); return concreteType; } ArrayRef getConformances() const; }; /// DeinitExistentialAddrInst - Given an address of an existential that has been /// partially initialized with an InitExistentialAddrInst but whose value buffer /// has not been initialized, deinitializes the existential and deallocates /// the value buffer. This should only be used for partially-initialized /// existentials; a fully-initialized existential can be destroyed with /// DestroyAddrInst and deallocated with DeallocStackInst. class DeinitExistentialAddrInst : public UnaryInstructionBase { friend SILBuilder; DeinitExistentialAddrInst(SILDebugLocation DebugLoc, SILValue Existential) : UnaryInstructionBase(DebugLoc, Existential) {} }; class DeinitExistentialValueInst : public UnaryInstructionBase { friend SILBuilder; DeinitExistentialValueInst(SILDebugLocation DebugLoc, SILValue Existential) : UnaryInstructionBase(DebugLoc, Existential) {} }; /// Projects the capture storage address from a @block_storage address. class ProjectBlockStorageInst : public UnaryInstructionBase { friend SILBuilder; ProjectBlockStorageInst(SILDebugLocation DebugLoc, SILValue Operand, SILType DestTy) : UnaryInstructionBase(DebugLoc, Operand, DestTy) {} }; /// Initializes a block header, creating a block that /// invokes a given thin cdecl function. class InitBlockStorageHeaderInst : public InstructionBase { friend SILBuilder; enum { BlockStorage, InvokeFunction }; SubstitutionMap Substitutions; FixedOperandList<2> Operands; InitBlockStorageHeaderInst(SILDebugLocation DebugLoc, SILValue BlockStorage, SILValue InvokeFunction, SILType BlockType, SubstitutionMap Subs) : InstructionBase(DebugLoc, BlockType), Substitutions(Subs), Operands(this, BlockStorage, InvokeFunction) { } static InitBlockStorageHeaderInst *create(SILFunction &F, SILDebugLocation DebugLoc, SILValue BlockStorage, SILValue InvokeFunction, SILType BlockType, SubstitutionMap Subs); public: /// Get the block storage address to be initialized. SILValue getBlockStorage() const { return Operands[BlockStorage].get(); } /// Get the invoke function to form the block around. SILValue getInvokeFunction() const { return Operands[InvokeFunction].get(); } SubstitutionMap getSubstitutions() const { return Substitutions; } ArrayRef getAllOperands() const { return Operands.asArray(); } MutableArrayRef getAllOperands() { return Operands.asArray(); } }; /// StrongRetainInst - Increase the strong reference count of an object. class StrongRetainInst : public UnaryInstructionBase { friend SILBuilder; StrongRetainInst(SILDebugLocation DebugLoc, SILValue Operand, Atomicity atomicity) : UnaryInstructionBase(DebugLoc, Operand) { setAtomicity(atomicity); } }; /// StrongReleaseInst - Decrease the strong reference count of an object. /// /// An object can be destroyed when its strong reference count is /// zero. It can be deallocated when both its strong reference and /// weak reference counts reach zero. class StrongReleaseInst : public UnaryInstructionBase { friend SILBuilder; StrongReleaseInst(SILDebugLocation DebugLoc, SILValue Operand, Atomicity atomicity) : UnaryInstructionBase(DebugLoc, Operand) { setAtomicity(atomicity); } }; /// Simple reference storage logic. /// /// StrongRetain##Name##Inst - Increase the strong reference count of an object /// and assert that it has not been deallocated. /// The operand must be of type @name. /// /// Name##RetainInst - Increase the 'name' reference count of an object. /// /// Name##ReleaseInst - Decrease the 'name' reference count of an object. #define ALWAYS_OR_SOMETIMES_LOADABLE_CHECKED_REF_STORAGE(Name, ...) \ class StrongRetain##Name##Inst \ : public UnaryInstructionBase { \ friend SILBuilder; \ StrongRetain##Name##Inst(SILDebugLocation DebugLoc, SILValue operand, \ Atomicity atomicity) \ : UnaryInstructionBase(DebugLoc, operand) { \ setAtomicity(atomicity); \ } \ }; \ class Name##RetainInst \ : public UnaryInstructionBase { \ friend SILBuilder; \ Name##RetainInst(SILDebugLocation DebugLoc, SILValue Operand, \ Atomicity atomicity) \ : UnaryInstructionBase(DebugLoc, Operand) { \ setAtomicity(atomicity); \ } \ }; \ class Name##ReleaseInst \ : public UnaryInstructionBase { \ friend SILBuilder; \ Name##ReleaseInst(SILDebugLocation DebugLoc, SILValue Operand, \ Atomicity atomicity) \ : UnaryInstructionBase(DebugLoc, Operand) { \ setAtomicity(atomicity); \ } \ }; #include "swift/AST/ReferenceStorage.def" /// FixLifetimeInst - An artificial use of a value for the purposes of ARC or /// RVO optimizations. class FixLifetimeInst : public UnaryInstructionBase { friend SILBuilder; FixLifetimeInst(SILDebugLocation DebugLoc, SILValue Operand) : UnaryInstructionBase(DebugLoc, Operand) {} }; /// EndLifetimeInst - An artificial end lifetime use of a value for the purpose /// of working around verification problems. /// /// Specifically, the signature of destroying deinit takes self at +0 and /// returns self at +1. This is an issue since a deallocating deinit takes in /// self at +1. Previously, we could rely on the deallocating bit being set in /// the object header to allow SILGen to statically balance the +1 from the /// deallocating deinit. This is because deallocating values used to be /// immortal. The runtime now asserts if we release a deallocating value, /// meaning such an approach does not work. This instruction acts as a "fake" /// lifetime ending use allowing for static verification of deallocating /// destroyers, without an actual release being emitted (avoiding the runtime /// assert). class EndLifetimeInst : public UnaryInstructionBase { friend SILBuilder; EndLifetimeInst(SILDebugLocation DebugLoc, SILValue Operand) : UnaryInstructionBase(DebugLoc, Operand) {} }; /// An unsafe conversion in between ownership kinds. /// /// This is used today in destructors where due to Objective-C legacy /// constraints, we need to be able to convert a guaranteed parameter to an owned /// parameter. class UncheckedOwnershipConversionInst : public UnaryInstructionBase { friend SILBuilder; UncheckedOwnershipConversionInst(SILDebugLocation DebugLoc, SILValue operand, ValueOwnershipKind Kind) : UnaryInstructionBase(DebugLoc, operand, operand->getType()) { SILInstruction::Bits.UncheckedOwnershipConversionInst.Kind = Kind; } public: ValueOwnershipKind getConversionOwnershipKind() const { unsigned kind = SILInstruction::Bits.UncheckedOwnershipConversionInst.Kind; return ValueOwnershipKind(kind); } }; /// Indicates that the validity of the first operand ("the value") depends on /// the value of the second operand ("the base"). Operations that would destroy /// the base must not be moved before any instructions which depend on the /// result of this instruction, exactly as if the address had been obviously /// derived from that operand (e.g. using ``ref_element_addr``). The result is /// always equal to the first operand and thus forwards ownership through the /// first operand. This is a "regular" use of the second operand (i.e. the /// second operand must be live at the use point). /// /// Example: /// /// %base = ... /// %value = ... @trivial value ... /// %value_dependent_on_base = mark_dependence %value on %base /// ... /// use(%value_dependent_on_base) (1) /// ... /// destroy_value %base (2) /// /// (2) can never move before (1). In English this is a way for the compiler /// writer to say to the optimizer: 'This subset of uses of "value" (the uses of /// result) have a dependence on "base" being alive. Do not allow for things /// that /may/ destroy base to be moved earlier than any of these uses of /// "value"'. class MarkDependenceInst : public InstructionBase { friend SILBuilder; FixedOperandList<2> Operands; MarkDependenceInst(SILDebugLocation DebugLoc, SILValue value, SILValue base) : InstructionBase(DebugLoc, value->getType(), value.getOwnershipKind()), Operands{this, value, base} {} public: enum { Value, Base }; SILValue getValue() const { return Operands[Value].get(); } SILValue getBase() const { return Operands[Base].get(); } void setValue(SILValue newVal) { Operands[Value].set(newVal); } void setBase(SILValue newVal) { Operands[Base].set(newVal); } ArrayRef getAllOperands() const { return Operands.asArray(); } MutableArrayRef getAllOperands() { return Operands.asArray(); } }; /// Promote an Objective-C block that is on the stack to the heap, or simply /// retain a block that is already on the heap. class CopyBlockInst : public UnaryInstructionBase { friend SILBuilder; CopyBlockInst(SILDebugLocation DebugLoc, SILValue operand) : UnaryInstructionBase(DebugLoc, operand, operand->getType()) {} }; class CopyBlockWithoutEscapingInst : public InstructionBase { friend SILBuilder; FixedOperandList<2> Operands; CopyBlockWithoutEscapingInst(SILDebugLocation DebugLoc, SILValue block, SILValue closure) : InstructionBase(DebugLoc, block->getType()), Operands{this, block, closure} {} public: enum { Block, Closure }; SILValue getBlock() const { return Operands[Block].get(); } SILValue getClosure() const { return Operands[Closure].get(); } void setBlock(SILValue block) { Operands[Block].set(block); } void setClosure(SILValue closure) { Operands[Closure].set(closure); } ArrayRef getAllOperands() const { return Operands.asArray(); } MutableArrayRef getAllOperands() { return Operands.asArray(); } }; class CopyValueInst : public UnaryInstructionBase { friend class SILBuilder; CopyValueInst(SILDebugLocation DebugLoc, SILValue operand) : UnaryInstructionBase(DebugLoc, operand, operand->getType()) {} }; #define UNCHECKED_REF_STORAGE(Name, ...) \ class StrongCopy##Name##ValueInst \ : public UnaryInstructionBase< \ SILInstructionKind::StrongCopy##Name##ValueInst, \ SingleValueInstruction> { \ friend class SILBuilder; \ StrongCopy##Name##ValueInst(SILDebugLocation DebugLoc, SILValue operand, \ SILType type) \ : UnaryInstructionBase(DebugLoc, operand, type) {} \ }; #define ALWAYS_OR_SOMETIMES_LOADABLE_CHECKED_REF_STORAGE(Name, ...) \ class StrongCopy##Name##ValueInst \ : public UnaryInstructionBase< \ SILInstructionKind::StrongCopy##Name##ValueInst, \ SingleValueInstruction> { \ friend class SILBuilder; \ StrongCopy##Name##ValueInst(SILDebugLocation DebugLoc, SILValue operand, \ SILType type) \ : UnaryInstructionBase(DebugLoc, operand, type) {} \ }; #include "swift/AST/ReferenceStorage.def" class DestroyValueInst : public UnaryInstructionBase { friend class SILBuilder; DestroyValueInst(SILDebugLocation DebugLoc, SILValue operand) : UnaryInstructionBase(DebugLoc, operand) {} }; /// Given an object reference, return true iff it is non-nil and refers /// to a native swift object with strong reference count of 1. class IsUniqueInst : public UnaryInstructionBase { friend SILBuilder; IsUniqueInst(SILDebugLocation DebugLoc, SILValue Operand, SILType BoolTy) : UnaryInstructionBase(DebugLoc, Operand, BoolTy) {} }; /// Given an escaping closure return true iff it has a non-nil context and the /// context has a strong reference count greater than 1. class IsEscapingClosureInst : public UnaryInstructionBase { friend SILBuilder; unsigned VerificationType; IsEscapingClosureInst(SILDebugLocation DebugLoc, SILValue Operand, SILType BoolTy, unsigned VerificationType) : UnaryInstructionBase(DebugLoc, Operand, BoolTy), VerificationType(VerificationType) {} public: enum { WithoutActuallyEscaping, ObjCEscaping }; unsigned getVerificationType() const { return VerificationType; } }; //===----------------------------------------------------------------------===// // DeallocationInsts //===----------------------------------------------------------------------===// /// DeallocationInst - An abstract parent class for Dealloc{Stack, Box, Ref}. class DeallocationInst : public NonValueInstruction { protected: DeallocationInst(SILInstructionKind Kind, SILDebugLocation DebugLoc) : NonValueInstruction(Kind, DebugLoc) {} public: DEFINE_ABSTRACT_NON_VALUE_INST_BOILERPLATE(DeallocationInst) }; /// DeallocStackInst - Deallocate stack memory allocated by alloc_stack. class DeallocStackInst : public UnaryInstructionBase { friend SILBuilder; DeallocStackInst(SILDebugLocation DebugLoc, SILValue operand) : UnaryInstructionBase(DebugLoc, operand) {} }; /// Deallocate memory for a reference type instance from a destructor or /// failure path of a constructor. /// /// This does not destroy the referenced instance; it must be destroyed /// first. /// /// It is undefined behavior if the type of the operand does not match the /// most derived type of the allocated instance. class DeallocRefInst : public UnaryInstructionBase { friend SILBuilder; private: DeallocRefInst(SILDebugLocation DebugLoc, SILValue Operand, bool canBeOnStack = false) : UnaryInstructionBase(DebugLoc, Operand) { SILInstruction::Bits.DeallocRefInst.OnStack = canBeOnStack; } public: bool canAllocOnStack() const { return SILInstruction::Bits.DeallocRefInst.OnStack; } void setStackAllocatable(bool OnStack) { SILInstruction::Bits.DeallocRefInst.OnStack = OnStack; } }; /// Deallocate memory for a reference type instance from a failure path of a /// constructor. /// /// The instance is assumed to have been partially initialized, with the /// initialized portion being all instance variables in classes that are more /// derived than the given metatype. /// /// The metatype value can either be the static self type (in a designated /// initializer) or a dynamic self type (in a convenience initializer). class DeallocPartialRefInst : public InstructionBase { friend SILBuilder; private: FixedOperandList<2> Operands; DeallocPartialRefInst(SILDebugLocation DebugLoc, SILValue Operand, SILValue Metatype) : InstructionBase(DebugLoc), Operands(this, Operand, Metatype) {} public: ArrayRef getAllOperands() const { return Operands.asArray(); } MutableArrayRef getAllOperands() { return Operands.asArray(); } SILValue getInstance() const { return getOperand(0); } SILValue getMetatype() const { return getOperand(1); } }; /// Deallocate memory allocated for an unsafe value buffer. class DeallocValueBufferInst : public UnaryInstructionBase { friend SILBuilder; SILType ValueType; DeallocValueBufferInst(SILDebugLocation DebugLoc, SILType valueType, SILValue operand) : UnaryInstructionBase(DebugLoc, operand), ValueType(valueType) {} public: SILType getValueType() const { return ValueType; } }; /// Deallocate memory allocated for a boxed value created by an AllocBoxInst. /// It is undefined behavior if the type of the boxed type does not match the /// type the box was allocated for. /// /// This does not destroy the boxed value instance; it must either be /// uninitialized or have been manually destroyed. class DeallocBoxInst : public UnaryInstructionBase { friend SILBuilder; DeallocBoxInst(SILDebugLocation DebugLoc, SILValue operand) : UnaryInstructionBase(DebugLoc, operand) {} }; /// Deallocate memory allocated for a boxed existential container created by /// AllocExistentialBox. It is undefined behavior if the given concrete type /// does not match the concrete type for which the box was allocated. /// /// This does not destroy the boxed value instance; it must either be /// uninitialized or have been manually destroyed. class DeallocExistentialBoxInst : public UnaryInstructionBase { friend SILBuilder; CanType ConcreteType; DeallocExistentialBoxInst(SILDebugLocation DebugLoc, CanType concreteType, SILValue operand) : UnaryInstructionBase(DebugLoc, operand), ConcreteType(concreteType) {} public: CanType getConcreteType() const { return ConcreteType; } }; /// Destroy the value at a memory location according to /// its SIL type. This is similar to: /// %1 = load %operand /// release_value %1 /// but a destroy instruction can be used for types that cannot be loaded, /// such as resilient value types. class DestroyAddrInst : public UnaryInstructionBase { friend SILBuilder; DestroyAddrInst(SILDebugLocation DebugLoc, SILValue Operand) : UnaryInstructionBase(DebugLoc, Operand) {} }; /// Project out the address of the value /// stored in the given Builtin.UnsafeValueBuffer. class ProjectValueBufferInst : public UnaryInstructionBase { friend SILBuilder; ProjectValueBufferInst(SILDebugLocation DebugLoc, SILType valueType, SILValue operand) : UnaryInstructionBase(DebugLoc, operand, valueType.getAddressType()) {} public: SILType getValueType() const { return getType().getObjectType(); } }; /// Project out the address of the value in a box. class ProjectBoxInst : public UnaryInstructionBase { friend SILBuilder; unsigned Index; ProjectBoxInst(SILDebugLocation DebugLoc, SILValue operand, unsigned fieldIndex, SILType fieldTy) : UnaryInstructionBase(DebugLoc, operand, fieldTy.getAddressType()), Index(fieldIndex) {} public: unsigned getFieldIndex() const { return Index; } }; /// Project out the address of the value in an existential box. class ProjectExistentialBoxInst : public UnaryInstructionBase { friend SILBuilder; ProjectExistentialBoxInst(SILDebugLocation DebugLoc, SILType valueType, SILValue operand) : UnaryInstructionBase(DebugLoc, operand, valueType.getAddressType()) {} }; //===----------------------------------------------------------------------===// // Runtime failure //===----------------------------------------------------------------------===// /// Trigger a runtime failure if the given Int1 value is true. /// /// Optionally cond_fail has a static failure message, which is displayed in the debugger in case the failure /// is triggered. class CondFailInst final : public UnaryInstructionBase, private llvm::TrailingObjects { friend TrailingObjects; friend SILBuilder; unsigned MessageSize; CondFailInst(SILDebugLocation DebugLoc, SILValue Operand, StringRef Message); static CondFailInst *create(SILDebugLocation DebugLoc, SILValue Operand, StringRef Message, SILModule &M); public: StringRef getMessage() const { return {getTrailingObjects(), MessageSize}; } }; //===----------------------------------------------------------------------===// // Pointer/address indexing instructions //===----------------------------------------------------------------------===// /// Abstract base class for indexing instructions. class IndexingInst : public SingleValueInstruction { enum { Base, Index }; FixedOperandList<2> Operands; public: IndexingInst(SILInstructionKind Kind, SILDebugLocation DebugLoc, SILType ResultTy, SILValue Operand, SILValue Index) : SingleValueInstruction(Kind, DebugLoc, ResultTy), Operands{this, Operand, Index} {} SILValue getBase() const { return Operands[Base].get(); } SILValue getIndex() const { return Operands[Index].get(); } ArrayRef getAllOperands() const { return Operands.asArray(); } MutableArrayRef getAllOperands() { return Operands.asArray(); } DEFINE_ABSTRACT_SINGLE_VALUE_INST_BOILERPLATE(IndexingInst) }; /// IndexAddrInst - "%2 : $*T = index_addr %0 : $*T, %1 : $Builtin.Word" /// This takes an address and indexes it, striding by the pointed- /// to type. This is used to index into arrays of uniform elements. class IndexAddrInst : public InstructionBase { friend SILBuilder; enum { Base, Index }; IndexAddrInst(SILDebugLocation DebugLoc, SILValue Operand, SILValue Index) : InstructionBase(DebugLoc, Operand->getType(), Operand, Index) {} }; /// TailAddrInst - like IndexingInst, but aligns-up the resulting address to a /// tail-allocated element type. class TailAddrInst : public InstructionBase { friend SILBuilder; TailAddrInst(SILDebugLocation DebugLoc, SILValue Operand, SILValue Count, SILType ResultTy) : InstructionBase(DebugLoc, ResultTy, Operand, Count) {} public: SILType getTailType() const { return getType().getObjectType(); } }; /// IndexRawPointerInst /// %2 : $Builtin.RawPointer \ /// = index_raw_pointer %0 : $Builtin.RawPointer, %1 : $Builtin.Word /// This takes an address and indexes it, striding by the pointed- /// to type. This is used to index into arrays of uniform elements. class IndexRawPointerInst : public InstructionBase { friend SILBuilder; enum { Base, Index }; IndexRawPointerInst(SILDebugLocation DebugLoc, SILValue Operand, SILValue Index) : InstructionBase(DebugLoc, Operand->getType(), Operand, Index) { } }; //===----------------------------------------------------------------------===// // Instructions representing terminators //===----------------------------------------------------------------------===// enum class TermKind { #define TERMINATOR(Id, TextualName, Parent, MemBehavior, MayRelease) \ Id = unsigned(SILInstructionKind::Id), #include "SILNodes.def" }; /// This class defines a "terminating instruction" for a SILBasicBlock. class TermInst : public NonValueInstruction { protected: TermInst(SILInstructionKind K, SILDebugLocation DebugLoc) : NonValueInstruction(K, DebugLoc) {} public: using ConstSuccessorListTy = ArrayRef; using SuccessorListTy = MutableArrayRef; /// The successor basic blocks of this terminator. SuccessorListTy getSuccessors(); ConstSuccessorListTy getSuccessors() const { return const_cast(this)->getSuccessors(); } using const_succ_iterator = ConstSuccessorListTy::const_iterator; using succ_iterator = SuccessorListTy::iterator; bool succ_empty() const { return getSuccessors().empty(); } succ_iterator succ_begin() { return getSuccessors().begin(); } succ_iterator succ_end() { return getSuccessors().end(); } const_succ_iterator succ_begin() const { return getSuccessors().begin(); } const_succ_iterator succ_end() const { return getSuccessors().end(); } unsigned getNumSuccessors() const { return getSuccessors().size(); } using succblock_iterator = TransformIterator; using const_succblock_iterator = TransformIterator< const SILSuccessor *, const SILBasicBlock *(*)(const SILSuccessor &)>; succblock_iterator succblock_begin() { return succblock_iterator(getSuccessors().begin(), [](const SILSuccessor &succ) -> SILBasicBlock * { return succ.getBB(); }); } succblock_iterator succblock_end() { return succblock_iterator(getSuccessors().end(), [](const SILSuccessor &succ) -> SILBasicBlock * { return succ.getBB(); }); } const_succblock_iterator succblock_begin() const { return const_succblock_iterator( getSuccessors().begin(), [](const SILSuccessor &succ) -> const SILBasicBlock * { return succ.getBB(); }); } const_succblock_iterator succblock_end() const { return const_succblock_iterator( getSuccessors().end(), [](const SILSuccessor &succ) -> const SILBasicBlock * { return succ.getBB(); }); } SILBasicBlock *getSingleSuccessorBlock() { if (succ_empty() || std::next(succ_begin()) != succ_end()) return nullptr; return *succ_begin(); } const SILBasicBlock *getSingleSuccessorBlock() const { return const_cast(this)->getSingleSuccessorBlock(); } /// Returns true if \p BB is a successor of this block. bool isSuccessorBlock(SILBasicBlock *BB) const { auto Range = getSuccessorBlocks(); return any_of(Range, [&BB](const SILBasicBlock *SuccBB) -> bool { return BB == SuccBB; }); } using SuccessorBlockArgumentListTy = TransformRange( const SILSuccessor &)>>; /// Return the range of Argument arrays for each successor of this /// block. SuccessorBlockArgumentListTy getSuccessorBlockArgumentLists() const; using SuccessorBlockListTy = TransformRange; using ConstSuccessorBlockListTy = TransformRange; /// Return the range of SILBasicBlocks that are successors of this block. SuccessorBlockListTy getSuccessorBlocks() { return SuccessorBlockListTy(getSuccessors(), [](const SILSuccessor &succ) -> SILBasicBlock* { return succ.getBB(); }); } /// Return the range of SILBasicBlocks that are successors of this block. ConstSuccessorBlockListTy getSuccessorBlocks() const { return ConstSuccessorBlockListTy( getSuccessors(), [](const SILSuccessor &succ) -> const SILBasicBlock * { return succ.getBB(); }); } DEFINE_ABSTRACT_NON_VALUE_INST_BOILERPLATE(TermInst) bool isBranch() const { return !getSuccessors().empty(); } /// Returns true if this terminator exits the function. bool isFunctionExiting() const; /// Returns true if this terminator terminates the program. bool isProgramTerminating() const; TermKind getTermKind() const { return TermKind(getKind()); } /// Returns true if this is a transformation terminator. bool isTransformationTerminator() const { switch (getTermKind()) { case TermKind::UnwindInst: case TermKind::UnreachableInst: case TermKind::ReturnInst: case TermKind::ThrowInst: case TermKind::YieldInst: case TermKind::TryApplyInst: case TermKind::BranchInst: case TermKind::CondBranchInst: case TermKind::SwitchValueInst: case TermKind::SwitchEnumAddrInst: case TermKind::DynamicMethodBranchInst: case TermKind::CheckedCastAddrBranchInst: case TermKind::CheckedCastValueBranchInst: return false; case TermKind::SwitchEnumInst: case TermKind::CheckedCastBranchInst: return true; } llvm_unreachable("Covered switch isn't covered."); } }; /// UnreachableInst - Position in the code which would be undefined to reach. /// These are always implicitly generated, e.g. when falling off the end of a /// function or after a no-return function call. class UnreachableInst : public InstructionBase { friend SILBuilder; UnreachableInst(SILDebugLocation DebugLoc) : InstructionBase(DebugLoc) {} public: SuccessorListTy getSuccessors() { // No Successors. return SuccessorListTy(); } ArrayRef getAllOperands() const { return {}; } MutableArrayRef getAllOperands() { return {}; } }; /// ReturnInst - Representation of a ReturnStmt. class ReturnInst : public UnaryInstructionBase { friend SILBuilder; /// Constructs a ReturnInst representing a return. /// /// \param DebugLoc The backing AST location. /// /// \param ReturnValue The value to be returned. /// ReturnInst(SILDebugLocation DebugLoc, SILValue ReturnValue) : UnaryInstructionBase(DebugLoc, ReturnValue) {} public: SuccessorListTy getSuccessors() { // No Successors. return SuccessorListTy(); } }; /// ThrowInst - Throw a typed error (which, in our system, is /// essentially just a funny kind of return). class ThrowInst : public UnaryInstructionBase { friend SILBuilder; /// Constructs a ThrowInst representing a throw out of the current /// function. /// /// \param DebugLoc The location of the throw. /// \param errorValue The value to be thrown. ThrowInst(SILDebugLocation DebugLoc, SILValue errorValue) : UnaryInstructionBase(DebugLoc, errorValue) {} public: SuccessorListTy getSuccessors() { // No successors. return SuccessorListTy(); } }; /// UnwindInst - Continue unwinding out of this function. Currently this is /// only used in coroutines as the eventual terminator of the unwind edge /// out of a 'yield'. class UnwindInst : public InstructionBase { friend SILBuilder; UnwindInst(SILDebugLocation loc) : InstructionBase(loc) {} public: SuccessorListTy getSuccessors() { // No successors. return SuccessorListTy(); } ArrayRef getAllOperands() const { return {}; } MutableArrayRef getAllOperands() { return {}; } }; /// YieldInst - Yield control temporarily to the caller of this coroutine. /// /// This is a terminator because the caller can abort the coroutine, /// e.g. if an error is thrown and an unwind is provoked. class YieldInst final : public InstructionBaseWithTrailingOperands { friend SILBuilder; std::array DestBBs; YieldInst(SILDebugLocation loc, ArrayRef yieldedValues, SILBasicBlock *normalBB, SILBasicBlock *unwindBB) : InstructionBaseWithTrailingOperands(yieldedValues, loc), DestBBs{{{this, normalBB}, {this, unwindBB}}} {} static YieldInst *create(SILDebugLocation loc, ArrayRef yieldedValues, SILBasicBlock *normalBB, SILBasicBlock *unwindBB, SILFunction &F); public: /// Return the normal resume destination of the yield, which is where the /// coroutine resumes when the caller is ready to continue normally. /// /// This must be the unique predecessor edge of the given block. /// /// Control flow along every path from this block must either loop or /// eventually terminate in a 'return', 'throw', or 'unreachable' /// instruction. In a yield_many coroutine, control is permitted to /// first reach a 'yield' instruction; this is prohibited in a /// yield_once coroutine. SILBasicBlock *getResumeBB() const { return DestBBs[0]; } /// Return the 'unwind' destination of the yield, which is where the /// coroutine resumes when the caller is unconditionally aborting the /// coroutine. /// /// This must be the unique predecessor edge of the given block. /// /// Control flow along every path from this block must either loop or /// eventually terminate in an 'unwind' or 'unreachable' instruction. /// It is not permitted to reach a 'yield' instruction. SILBasicBlock *getUnwindBB() const { return DestBBs[1]; } OperandValueArrayRef getYieldedValues() const { return OperandValueArrayRef(getAllOperands()); } SuccessorListTy getSuccessors() { return DestBBs; } SILYieldInfo getYieldInfoForOperand(const Operand &op) const; SILArgumentConvention getArgumentConventionForOperand(const Operand &op) const; }; /// BranchInst - An unconditional branch. class BranchInst final : public InstructionBaseWithTrailingOperands { friend SILBuilder; SILSuccessor DestBB; BranchInst(SILDebugLocation DebugLoc, SILBasicBlock *DestBB, ArrayRef Args) : InstructionBaseWithTrailingOperands(Args, DebugLoc), DestBB(this, DestBB) {} /// Construct a BranchInst that will branch to the specified block. /// The destination block must take no parameters. static BranchInst *create(SILDebugLocation DebugLoc, SILBasicBlock *DestBB, SILFunction &F); /// Construct a BranchInst that will branch to the specified block with /// the given parameters. static BranchInst *create(SILDebugLocation DebugLoc, SILBasicBlock *DestBB, ArrayRef Args, SILFunction &F); public: /// returns jump target for the branch. SILBasicBlock *getDestBB() const { return DestBB; } /// The arguments for the destination BB. OperandValueArrayRef getArgs() const { return OperandValueArrayRef(getAllOperands()); } SuccessorListTy getSuccessors() { return SuccessorListTy(&DestBB, 1); } unsigned getNumArgs() const { return getAllOperands().size(); } SILValue getArg(unsigned i) const { return getAllOperands()[i].get(); } /// Return the SILPhiArgument for the given operand. /// /// See SILArgument.cpp. const SILPhiArgument *getArgForOperand(const Operand *oper) const; }; /// A conditional branch. class CondBranchInst final : public InstructionBaseWithTrailingOperands< SILInstructionKind::CondBranchInst, CondBranchInst, TermInst> { friend SILBuilder; public: enum { /// The operand index of the condition value used for the branch. ConditionIdx, NumFixedOpers, }; enum { // Map branch targets to block successor indices. TrueIdx, FalseIdx }; private: std::array DestBBs; /// The number of arguments for the True branch. unsigned getNumTrueArgs() const { return SILInstruction::Bits.CondBranchInst.NumTrueArgs; } /// The number of arguments for the False branch. unsigned getNumFalseArgs() const { return getAllOperands().size() - NumFixedOpers - SILInstruction::Bits.CondBranchInst.NumTrueArgs; } CondBranchInst(SILDebugLocation DebugLoc, SILValue Condition, SILBasicBlock *TrueBB, SILBasicBlock *FalseBB, ArrayRef Args, unsigned NumTrue, unsigned NumFalse, ProfileCounter TrueBBCount, ProfileCounter FalseBBCount); /// Construct a CondBranchInst that will branch to TrueBB or FalseBB based on /// the Condition value. Both blocks must not take any arguments. static CondBranchInst *create(SILDebugLocation DebugLoc, SILValue Condition, SILBasicBlock *TrueBB, SILBasicBlock *FalseBB, ProfileCounter TrueBBCount, ProfileCounter FalseBBCount, SILFunction &F); /// Construct a CondBranchInst that will either branch to TrueBB and pass /// TrueArgs or branch to FalseBB and pass FalseArgs based on the Condition /// value. static CondBranchInst * create(SILDebugLocation DebugLoc, SILValue Condition, SILBasicBlock *TrueBB, ArrayRef TrueArgs, SILBasicBlock *FalseBB, ArrayRef FalseArgs, ProfileCounter TrueBBCount, ProfileCounter FalseBBCount, SILFunction &F); public: const Operand *getConditionOperand() const { return &getAllOperands()[ConditionIdx]; } SILValue getCondition() const { return getConditionOperand()->get(); } void setCondition(SILValue newCondition) { getAllOperands()[ConditionIdx].set(newCondition); } SuccessorListTy getSuccessors() { return DestBBs; } SILBasicBlock *getTrueBB() { return DestBBs[0]; } const SILBasicBlock *getTrueBB() const { return DestBBs[0]; } SILBasicBlock *getFalseBB() { return DestBBs[1]; } const SILBasicBlock *getFalseBB() const { return DestBBs[1]; } /// The number of times the True branch was executed. ProfileCounter getTrueBBCount() const { return DestBBs[0].getCount(); } /// The number of times the False branch was executed. ProfileCounter getFalseBBCount() const { return DestBBs[1].getCount(); } /// Get the arguments to the true BB. OperandValueArrayRef getTrueArgs() const { return OperandValueArrayRef(getTrueOperands()); } /// Get the arguments to the false BB. OperandValueArrayRef getFalseArgs() const { return OperandValueArrayRef(getFalseOperands()); } /// Get the operands to the true BB. ArrayRef getTrueOperands() const { return getAllOperands().slice(NumFixedOpers, getNumTrueArgs()); } MutableArrayRef getTrueOperands() { return getAllOperands().slice(NumFixedOpers, getNumTrueArgs()); } /// Get the operands to the false BB. ArrayRef getFalseOperands() const { // The remaining arguments are 'false' operands. return getAllOperands().slice(NumFixedOpers + getNumTrueArgs()); } MutableArrayRef getFalseOperands() { // The remaining arguments are 'false' operands. return getAllOperands().slice(NumFixedOpers + getNumTrueArgs()); } /// Returns true if \p op is mapped to the condition operand of the cond_br. bool isConditionOperand(Operand *op) const { return getConditionOperand() == op; } bool isConditionOperandIndex(unsigned OpIndex) const { assert(OpIndex < getNumOperands() && "OpIndex must be an index for an actual operand"); return OpIndex == ConditionIdx; } /// Is \p OpIndex an operand associated with the true case? bool isTrueOperandIndex(unsigned OpIndex) const { assert(OpIndex < getNumOperands() && "OpIndex must be an index for an actual operand"); if (getNumTrueArgs() == 0) return false; auto Operands = getTrueOperands(); return Operands.front().getOperandNumber() <= OpIndex && OpIndex <= Operands.back().getOperandNumber(); } /// Is \p OpIndex an operand associated with the false case? bool isFalseOperandIndex(unsigned OpIndex) const { assert(OpIndex < getNumOperands() && "OpIndex must be an index for an actual operand"); if (getNumFalseArgs() == 0) return false; auto Operands = getFalseOperands(); return Operands.front().getOperandNumber() <= OpIndex && OpIndex <= Operands.back().getOperandNumber(); } /// Returns the operand on the cond_br terminator associated with the value /// that will be passed to DestBB in A. Operand *getOperandForDestBB(const SILBasicBlock *DestBB, const SILArgument *A) const; /// Returns the operand on the cond_br terminator associated with the value /// that will be passed as the \p Index argument to DestBB. Operand *getOperandForDestBB(const SILBasicBlock *DestBB, unsigned ArgIndex) const; /// Returns the argument on the cond_br terminator that will be passed to /// DestBB in A. SILValue getArgForDestBB(const SILBasicBlock *DestBB, const SILArgument *A) const { if (auto *op = getOperandForDestBB(DestBB, A)) { return op->get(); } return SILValue(); } /// Returns the argument on the cond_br terminator that will be passed as the /// \p Index argument to DestBB. SILValue getArgForDestBB(const SILBasicBlock *DestBB, unsigned ArgIndex) const { if (auto *op = getOperandForDestBB(DestBB, ArgIndex)) { return op->get(); } return SILValue(); } /// Return the SILPhiArgument from either the true or false destination for /// the given operand. /// /// Returns nullptr for an operand with no block argument /// (i.e the branch condition). /// /// See SILArgument.cpp. const SILPhiArgument *getArgForOperand(const Operand *oper) const; void swapSuccessors(); }; /// A switch on a value of a builtin type. class SwitchValueInst final : public InstructionBaseWithTrailingOperands< SILInstructionKind::SwitchValueInst, SwitchValueInst, TermInst, SILSuccessor> { friend SILBuilder; SwitchValueInst(SILDebugLocation DebugLoc, SILValue Operand, SILBasicBlock *DefaultBB, ArrayRef Cases, ArrayRef BBs); // Tail-allocated after the SwitchValueInst record are: // - `NumCases` SILValue values, containing // the SILValue references for each case // - `NumCases + HasDefault` SILSuccessor records, referencing the // destinations for each case, ending with the default destination if // present. OperandValueArrayRef getCaseBuf() const { return OperandValueArrayRef(getAllOperands().slice(1)); } SILSuccessor *getSuccessorBuf() { return getTrailingObjects(); } const SILSuccessor *getSuccessorBuf() const { return getTrailingObjects(); } static SwitchValueInst * create(SILDebugLocation DebugLoc, SILValue Operand, SILBasicBlock *DefaultBB, ArrayRef> CaseBBs, SILFunction &F); public: /// Clean up tail-allocated successor records for the switch cases. ~SwitchValueInst(); SILValue getOperand() const { return getAllOperands()[0].get(); } SuccessorListTy getSuccessors() { return MutableArrayRef{getSuccessorBuf(), static_cast(getNumCases() + hasDefault())}; } unsigned getNumCases() const { return getAllOperands().size() - 1; } std::pair getCase(unsigned i) const { assert(i < getNumCases() && "case out of bounds"); return {getCaseBuf()[i], getSuccessorBuf()[i]}; } bool hasDefault() const { return SILInstruction::Bits.SwitchValueInst.HasDefault; } SILBasicBlock *getDefaultBB() const { assert(hasDefault() && "doesn't have a default"); return getSuccessorBuf()[getNumCases()]; } Optional getUniqueCaseForDestination(SILBasicBlock *bb) const { for (unsigned i = 0; i < getNumCases(); ++i) { if (getCase(i).second == bb) { return i + 1; } } return None; } }; /// Common implementation for the switch_enum and /// switch_enum_addr instructions. class SwitchEnumInstBase : public TermInst { FixedOperandList<1> Operands; // Tail-allocated after the SwitchEnumInst record are: // - an array of `NumCases` EnumElementDecl* pointers, referencing the case // discriminators // - `NumCases + HasDefault` SILSuccessor records, referencing the // destinations for each case, ending with the default destination if // present. // FIXME: This should use llvm::TrailingObjects, but it has subclasses // (which are empty, of course). EnumElementDecl **getCaseBuf() { return reinterpret_cast(this + 1); } EnumElementDecl * const* getCaseBuf() const { return reinterpret_cast(this + 1); } SILSuccessor *getSuccessorBuf() { return reinterpret_cast(getCaseBuf() + getNumCases()); } const SILSuccessor *getSuccessorBuf() const { return reinterpret_cast(getCaseBuf() + getNumCases()); } protected: SwitchEnumInstBase( SILInstructionKind Kind, SILDebugLocation DebugLoc, SILValue Operand, SILBasicBlock *DefaultBB, ArrayRef> CaseBBs, Optional> Counts, ProfileCounter DefaultCount); template static SWITCH_ENUM_INST *createSwitchEnum( SILDebugLocation DebugLoc, SILValue Operand, SILBasicBlock *DefaultBB, ArrayRef> CaseBBs, SILFunction &F, Optional> Counts, ProfileCounter DefaultCount); public: /// Clean up tail-allocated successor records for the switch cases. ~SwitchEnumInstBase(); SILValue getOperand() const { return Operands[0].get(); } ArrayRef getAllOperands() const { return Operands.asArray(); } MutableArrayRef getAllOperands() { return Operands.asArray(); } SuccessorListTy getSuccessors() { return MutableArrayRef{getSuccessorBuf(), static_cast(getNumCases() + hasDefault())}; } unsigned getNumCases() const { return SILInstruction::Bits.SwitchEnumInstBase.NumCases; } std::pair getCase(unsigned i) const { assert(i < getNumCases() && "case out of bounds"); return {getCaseBuf()[i], getSuccessorBuf()[i].getBB()}; } ProfileCounter getCaseCount(unsigned i) const { assert(i < getNumCases() && "case out of bounds"); return getSuccessorBuf()[i].getCount(); } // Swap the cases at indices \p i and \p j. void swapCase(unsigned i, unsigned j); /// Return the block that will be branched to on the specified enum /// case. SILBasicBlock *getCaseDestination(EnumElementDecl *D) { for (unsigned i = 0, e = getNumCases(); i != e; ++i) { auto Entry = getCase(i); if (Entry.first == D) return Entry.second; } // switch_enum is required to be fully covered, so return the default if we // didn't find anything. return getDefaultBB(); } /// If the default refers to exactly one case decl, return it. NullablePtr getUniqueCaseForDefault(); /// If the given block only has one enum element decl matched to it, /// return it. NullablePtr getUniqueCaseForDestination(SILBasicBlock *BB); bool hasDefault() const { return SILInstruction::Bits.SwitchEnumInstBase.HasDefault; } SILBasicBlock *getDefaultBB() const { assert(hasDefault() && "doesn't have a default"); return getSuccessorBuf()[getNumCases()]; } NullablePtr getDefaultBBOrNull() const; ProfileCounter getDefaultCount() const { assert(hasDefault() && "doesn't have a default"); return getSuccessorBuf()[getNumCases()].getCount(); } static bool classof(const SILInstruction *I) { return I->getKind() >= SILInstructionKind::SwitchEnumInst && I->getKind() <= SILInstructionKind::SwitchEnumAddrInst; } }; /// A switch on a loadable enum's discriminator. The data for each case is /// passed into the corresponding destination block as an argument. class SwitchEnumInst : public InstructionBase { friend SILBuilder; private: friend SwitchEnumInstBase; SwitchEnumInst( SILDebugLocation DebugLoc, SILValue Operand, SILBasicBlock *DefaultBB, ArrayRef> CaseBBs, Optional> CaseCounts, ProfileCounter DefaultCount) : InstructionBase(DebugLoc, Operand, DefaultBB, CaseBBs, CaseCounts, DefaultCount) {} static SwitchEnumInst * create(SILDebugLocation DebugLoc, SILValue Operand, SILBasicBlock *DefaultBB, ArrayRef> CaseBBs, SILFunction &F, Optional> CaseCounts, ProfileCounter DefaultCount); }; /// A switch on an enum's discriminator in memory. class SwitchEnumAddrInst : public InstructionBase { friend SILBuilder; private: friend SwitchEnumInstBase; SwitchEnumAddrInst( SILDebugLocation DebugLoc, SILValue Operand, SILBasicBlock *DefaultBB, ArrayRef> CaseBBs, Optional> CaseCounts, ProfileCounter DefaultCount) : InstructionBase(DebugLoc, Operand, DefaultBB, CaseBBs, CaseCounts, DefaultCount) {} static SwitchEnumAddrInst * create(SILDebugLocation DebugLoc, SILValue Operand, SILBasicBlock *DefaultBB, ArrayRef> CaseBBs, SILFunction &F, Optional> CaseCounts, ProfileCounter DefaultCount); }; /// Branch on the existence of an Objective-C method in the dynamic type of /// an object. /// /// If the method exists, branches to the first BB, providing it with the /// method reference; otherwise, branches to the second BB. class DynamicMethodBranchInst : public InstructionBase { friend SILBuilder; SILDeclRef Member; std::array DestBBs; /// The operand. FixedOperandList<1> Operands; DynamicMethodBranchInst(SILDebugLocation DebugLoc, SILValue Operand, SILDeclRef Member, SILBasicBlock *HasMethodBB, SILBasicBlock *NoMethodBB); /// Construct a DynamicMethodBranchInst that will branch to \c HasMethodBB or /// \c NoMethodBB based on the ability of the object operand to respond to /// a message with the same selector as the member. static DynamicMethodBranchInst * create(SILDebugLocation DebugLoc, SILValue Operand, SILDeclRef Member, SILBasicBlock *HasMethodBB, SILBasicBlock *NoMethodBB, SILFunction &F); public: SILValue getOperand() const { return Operands[0].get(); } SILDeclRef getMember() const { return Member; } SuccessorListTy getSuccessors() { return DestBBs; } SILBasicBlock *getHasMethodBB() { return DestBBs[0]; } const SILBasicBlock *getHasMethodBB() const { return DestBBs[0]; } SILBasicBlock *getNoMethodBB() { return DestBBs[1]; } const SILBasicBlock *getNoMethodBB() const { return DestBBs[1]; } ArrayRef getAllOperands() const { return Operands.asArray(); } MutableArrayRef getAllOperands() { return Operands.asArray(); } }; /// Perform a checked cast operation and branch on whether the cast succeeds. /// The success branch destination block receives the cast result as a BB /// argument. class CheckedCastBranchInst final: public UnaryInstructionWithTypeDependentOperandsBase< SILInstructionKind::CheckedCastBranchInst, CheckedCastBranchInst, TermInst> { friend SILBuilder; SILType DestLoweredTy; CanType DestFormalTy; bool IsExact; std::array DestBBs; CheckedCastBranchInst(SILDebugLocation DebugLoc, bool IsExact, SILValue Operand, ArrayRef TypeDependentOperands, SILType DestLoweredTy, CanType DestFormalTy, SILBasicBlock *SuccessBB, SILBasicBlock *FailureBB, ProfileCounter Target1Count, ProfileCounter Target2Count) : UnaryInstructionWithTypeDependentOperandsBase(DebugLoc, Operand, TypeDependentOperands), DestLoweredTy(DestLoweredTy), DestFormalTy(DestFormalTy), IsExact(IsExact), DestBBs{{{this, SuccessBB, Target1Count}, {this, FailureBB, Target2Count}}} {} static CheckedCastBranchInst * create(SILDebugLocation DebugLoc, bool IsExact, SILValue Operand, SILType DestLoweredTy, CanType DestFormalTy, SILBasicBlock *SuccessBB, SILBasicBlock *FailureBB, SILFunction &F, SILOpenedArchetypesState &OpenedArchetypes, ProfileCounter Target1Count, ProfileCounter Target2Count); public: bool isExact() const { return IsExact; } SuccessorListTy getSuccessors() { return DestBBs; } SILType getSourceLoweredType() const { return getOperand()->getType(); } CanType getSourceFormalType() const { return getSourceLoweredType().getASTType(); } SILType getTargetLoweredType() const { return DestLoweredTy; } CanType getTargetFormalType() const { return DestFormalTy; } SILBasicBlock *getSuccessBB() { return DestBBs[0]; } const SILBasicBlock *getSuccessBB() const { return DestBBs[0]; } SILBasicBlock *getFailureBB() { return DestBBs[1]; } const SILBasicBlock *getFailureBB() const { return DestBBs[1]; } /// The number of times the True branch was executed ProfileCounter getTrueBBCount() const { return DestBBs[0].getCount(); } /// The number of times the False branch was executed ProfileCounter getFalseBBCount() const { return DestBBs[1].getCount(); } }; /// Perform a checked cast operation and branch on whether the cast succeeds. /// The success branch destination block receives the cast result as a BB /// argument. class CheckedCastValueBranchInst final : public UnaryInstructionWithTypeDependentOperandsBase< SILInstructionKind::CheckedCastValueBranchInst, CheckedCastValueBranchInst, TermInst> { friend SILBuilder; CanType SourceFormalTy; SILType DestLoweredTy; CanType DestFormalTy; std::array DestBBs; CheckedCastValueBranchInst(SILDebugLocation DebugLoc, SILValue Operand, CanType SourceFormalTy, ArrayRef TypeDependentOperands, SILType DestLoweredTy, CanType DestFormalTy, SILBasicBlock *SuccessBB, SILBasicBlock *FailureBB) : UnaryInstructionWithTypeDependentOperandsBase(DebugLoc, Operand, TypeDependentOperands), SourceFormalTy(SourceFormalTy), DestLoweredTy(DestLoweredTy), DestFormalTy(DestFormalTy), DestBBs{{{this, SuccessBB}, {this, FailureBB}}} {} static CheckedCastValueBranchInst * create(SILDebugLocation DebugLoc, SILValue Operand, CanType SourceFormalTy, SILType DestLoweredTy, CanType DestFormalTy, SILBasicBlock *SuccessBB, SILBasicBlock *FailureBB, SILFunction &F, SILOpenedArchetypesState &OpenedArchetypes); public: SuccessorListTy getSuccessors() { return DestBBs; } SILType getSourceLoweredType() const { return getOperand()->getType(); } CanType getSourceFormalType() const { return SourceFormalTy; } SILType getTargetLoweredType() const { return DestLoweredTy; } CanType getTargetFormalType() const { return DestFormalTy; } SILBasicBlock *getSuccessBB() { return DestBBs[0]; } const SILBasicBlock *getSuccessBB() const { return DestBBs[0]; } SILBasicBlock *getFailureBB() { return DestBBs[1]; } const SILBasicBlock *getFailureBB() const { return DestBBs[1]; } }; /// Perform a checked cast operation and branch on whether the cast succeeds. /// The result of the checked cast is left in the destination address. class CheckedCastAddrBranchInst : public InstructionBase { friend SILBuilder; CastConsumptionKind ConsumptionKind; FixedOperandList<2> Operands; std::array DestBBs; CanType SourceType; CanType TargetType; CheckedCastAddrBranchInst(SILDebugLocation DebugLoc, CastConsumptionKind consumptionKind, SILValue src, CanType srcType, SILValue dest, CanType targetType, SILBasicBlock *successBB, SILBasicBlock *failureBB, ProfileCounter Target1Count, ProfileCounter Target2Count) : InstructionBase(DebugLoc), ConsumptionKind(consumptionKind), Operands{this, src, dest}, DestBBs{{{this, successBB, Target1Count}, {this, failureBB, Target2Count}}}, SourceType(srcType), TargetType(targetType) { assert(ConsumptionKind != CastConsumptionKind::BorrowAlways && "BorrowAlways is not supported on addresses"); } public: enum { /// the value being stored Src, /// the lvalue being stored to Dest }; CastConsumptionKind getConsumptionKind() const { return ConsumptionKind; } SILValue getSrc() const { return Operands[Src].get(); } SILValue getDest() const { return Operands[Dest].get(); } SILType getSourceLoweredType() const { return getSrc()->getType(); } CanType getSourceFormalType() const { return SourceType; } SILType getTargetLoweredType() const { return getDest()->getType(); } CanType getTargetFormalType() const { return TargetType; } ArrayRef getAllOperands() const { return Operands.asArray(); } MutableArrayRef getAllOperands() { return Operands.asArray(); } SuccessorListTy getSuccessors() { return DestBBs; } SILBasicBlock *getSuccessBB() { return DestBBs[0]; } const SILBasicBlock *getSuccessBB() const { return DestBBs[0]; } SILBasicBlock *getFailureBB() { return DestBBs[1]; } const SILBasicBlock *getFailureBB() const { return DestBBs[1]; } /// The number of times the True branch was executed. ProfileCounter getTrueBBCount() const { return DestBBs[0].getCount(); } /// The number of times the False branch was executed. ProfileCounter getFalseBBCount() const { return DestBBs[1].getCount(); } }; /// A private abstract class to store the destinations of a TryApplyInst. class TryApplyInstBase : public TermInst { public: enum { // Map branch targets to block successor indices. NormalIdx, ErrorIdx }; private: std::array DestBBs; protected: TryApplyInstBase(SILInstructionKind valueKind, SILDebugLocation Loc, SILBasicBlock *normalBB, SILBasicBlock *errorBB); public: SuccessorListTy getSuccessors() { return DestBBs; } bool isNormalSuccessorRef(SILSuccessor *successor) const { assert(successor == &DestBBs[0] || successor == &DestBBs[1]); return successor == &DestBBs[0]; } bool isErrorSuccessorRef(SILSuccessor *successor) const { assert(successor == &DestBBs[0] || successor == &DestBBs[1]); return successor == &DestBBs[1]; } SILBasicBlock *getNormalBB() { return DestBBs[NormalIdx]; } const SILBasicBlock *getNormalBB() const { return DestBBs[NormalIdx]; } SILBasicBlock *getErrorBB() { return DestBBs[ErrorIdx]; } const SILBasicBlock *getErrorBB() const { return DestBBs[ErrorIdx]; } }; /// TryApplyInst - Represents the full application of a function that /// can produce an error. class TryApplyInst final : public InstructionBase>, public llvm::TrailingObjects { friend SILBuilder; TryApplyInst(SILDebugLocation DebugLoc, SILValue callee, SILType substCalleeType, SubstitutionMap substitutions, ArrayRef args, ArrayRef TypeDependentOperands, SILBasicBlock *normalBB, SILBasicBlock *errorBB, const GenericSpecializationInformation *SpecializationInfo); static TryApplyInst * create(SILDebugLocation DebugLoc, SILValue callee, SubstitutionMap substitutions, ArrayRef args, SILBasicBlock *normalBB, SILBasicBlock *errorBB, SILFunction &F, SILOpenedArchetypesState &OpenedArchetypes, const GenericSpecializationInformation *SpecializationInfo); }; /// DifferentiableFunctionInst - creates a `@differentiable` function-typed /// value from an original function operand and derivative function operands /// (optional). The differentiation transform canonicalizes /// `differentiable_function` instructions, filling in derivative function /// operands if missing. class DifferentiableFunctionInst final : public InstructionBaseWithTrailingOperands< SILInstructionKind::DifferentiableFunctionInst, DifferentiableFunctionInst, OwnershipForwardingSingleValueInst> { private: friend SILBuilder; /// Differentiability parameter indices. IndexSubset *ParameterIndices; /// Indicates whether derivative function operands (JVP/VJP) exist. bool HasDerivativeFunctions; DifferentiableFunctionInst(SILDebugLocation DebugLoc, IndexSubset *ParameterIndices, SILValue OriginalFunction, ArrayRef DerivativeFunctions, bool HasOwnership); static SILType getDifferentiableFunctionType(SILValue OriginalFunction, IndexSubset *ParameterIndices); static ValueOwnershipKind getMergedOwnershipKind(SILValue OriginalFunction, ArrayRef DerivativeFunctions); public: static DifferentiableFunctionInst * create(SILModule &Module, SILDebugLocation Loc, IndexSubset *ParameterIndices, SILValue OriginalFunction, Optional> VJPAndJVPFunctions, bool HasOwnership); /// Returns the original function operand. SILValue getOriginalFunction() const { return getOperand(0); } /// Returns differentiability parameter indices. IndexSubset *getParameterIndices() const { return ParameterIndices; } /// Returns true if derivative functions (JVP/VJP) exist. bool hasDerivativeFunctions() const { return HasDerivativeFunctions; } /// Returns the derivative function operands if they exist. /// Otherwise, return `None`. Optional> getOptionalDerivativeFunctionPair() const { if (!HasDerivativeFunctions) return None; return std::make_pair(getOperand(1), getOperand(2)); } ArrayRef getDerivativeFunctionArray() const { return getAllOperands().drop_front(); } /// Returns the JVP function operand. SILValue getJVPFunction() const { assert(HasDerivativeFunctions); return getOperand(1); } /// Returns the VJP function operand. SILValue getVJPFunction() const { assert(HasDerivativeFunctions); return getOperand(2); } /// Returns the derivative function operand (JVP or VJP) with the given kind. SILValue getDerivativeFunction(AutoDiffDerivativeFunctionKind kind) const { switch (kind) { case AutoDiffDerivativeFunctionKind::JVP: return getJVPFunction(); case AutoDiffDerivativeFunctionKind::VJP: return getVJPFunction(); } } }; /// LinearFunctionInst - given a function, its derivative and traspose functions, /// create an `@differentiable(linear)` function that represents a bundle of these. class LinearFunctionInst final : public InstructionBaseWithTrailingOperands< SILInstructionKind::LinearFunctionInst, LinearFunctionInst, OwnershipForwardingSingleValueInst> { private: friend SILBuilder; /// Parameters to differentiate with respect to. IndexSubset *ParameterIndices; /// Indicates whether a transpose function exists. bool HasTransposeFunction; static SILType getLinearFunctionType( SILValue OriginalFunction, IndexSubset *ParameterIndices); public: LinearFunctionInst(SILDebugLocation Loc, IndexSubset *ParameterIndices, SILValue OriginalFunction, Optional TransposeFunction, bool HasOwnership); static LinearFunctionInst *create(SILModule &Module, SILDebugLocation Loc, IndexSubset *ParameterIndices, SILValue OriginalFunction, Optional TransposeFunction, bool HasOwnership); IndexSubset *getParameterIndices() const { return ParameterIndices; } bool hasTransposeFunction() const { return HasTransposeFunction; } SILValue getOriginalFunction() const { return getOperand(0); } Optional getOptionalTransposeFunction() const { return HasTransposeFunction ? Optional(getOperand(1)) : None; } SILValue getTransposeFunction() const { assert(HasTransposeFunction); return getOperand(1); } }; /// DifferentiableFunctionExtractInst - extracts either the original or /// derivative function value from a `@differentiable` function. class DifferentiableFunctionExtractInst : public UnaryInstructionBase< SILInstructionKind::DifferentiableFunctionExtractInst, SingleValueInstruction> { private: /// The extractee. NormalDifferentiableFunctionTypeComponent Extractee; /// True if the instruction has an explicit extractee type. bool HasExplicitExtracteeType; static SILType getExtracteeType(SILValue function, NormalDifferentiableFunctionTypeComponent extractee, SILModule &module); public: /// Note: explicit extractee type may be specified only in lowered SIL. explicit DifferentiableFunctionExtractInst( SILModule &module, SILDebugLocation debugLoc, NormalDifferentiableFunctionTypeComponent extractee, SILValue function, Optional extracteeType = None); NormalDifferentiableFunctionTypeComponent getExtractee() const { return Extractee; } AutoDiffDerivativeFunctionKind getDerivativeFunctionKind() const { auto kind = Extractee.getAsDerivativeFunctionKind(); assert(kind); return *kind; } bool hasExplicitExtracteeType() const { return HasExplicitExtracteeType; } }; /// LinearFunctionExtractInst - given an `@differentiable(linear)` function /// representing a bundle of the original function and the transpose function, /// extract the specified function. class LinearFunctionExtractInst : public InstructionBase< SILInstructionKind::LinearFunctionExtractInst, SingleValueInstruction> { private: /// The extractee. LinearDifferentiableFunctionTypeComponent extractee; /// The list containing the `@differentiable(linear)` function operand. FixedOperandList<1> operands; static SILType getExtracteeType(SILValue function, LinearDifferentiableFunctionTypeComponent extractee, SILModule &module); public: explicit LinearFunctionExtractInst( SILModule &module, SILDebugLocation debugLoc, LinearDifferentiableFunctionTypeComponent extractee, SILValue theFunction); LinearDifferentiableFunctionTypeComponent getExtractee() const { return extractee; } SILValue getFunctionOperand() const { return operands[0].get(); } ArrayRef getAllOperands() const { return operands.asArray(); } MutableArrayRef getAllOperands() { return operands.asArray(); } }; /// DifferentiabilityWitnessFunctionInst - Looks up a differentiability witness /// function for a given original function. class DifferentiabilityWitnessFunctionInst : public InstructionBase< SILInstructionKind::DifferentiabilityWitnessFunctionInst, SingleValueInstruction> { private: friend SILBuilder; /// The differentiability witness function kind. DifferentiabilityWitnessFunctionKind witnessKind; /// The referenced SIL differentiability witness. SILDifferentiabilityWitness *witness; /// Whether the instruction has an explicit function type. bool hasExplicitFunctionType; static SILType getDifferentiabilityWitnessType( SILModule &module, DifferentiabilityWitnessFunctionKind witnessKind, SILDifferentiabilityWitness *witness); public: /// Note: explicit function type may be specified only in lowered SIL. DifferentiabilityWitnessFunctionInst( SILModule &module, SILDebugLocation loc, DifferentiabilityWitnessFunctionKind witnessKind, SILDifferentiabilityWitness *witness, Optional FunctionType); DifferentiabilityWitnessFunctionKind getWitnessKind() const { return witnessKind; } SILDifferentiabilityWitness *getWitness() const { return witness; } bool getHasExplicitFunctionType() const { return hasExplicitFunctionType; } ArrayRef getAllOperands() const { return {}; } MutableArrayRef getAllOperands() { return {}; } }; // This is defined out of line to work around the fact that this depends on // PartialApplyInst being defined, but PartialApplyInst is a subclass of // ApplyInstBase, so we can not place ApplyInstBase after it. template SILValue ApplyInstBase::getCalleeOrigin() const { SILValue Callee = getCallee(); while (true) { if (auto *TTTFI = dyn_cast(Callee)) { Callee = TTTFI->getCallee(); continue; } if (auto *CFI = dyn_cast(Callee)) { Callee = CFI->getConverted(); continue; } if (auto *CETN = dyn_cast(Callee)) { Callee = CETN->getOperand(); continue; } return Callee; } } template bool ApplyInstBase::isCalleeDynamicallyReplaceable() const { SILValue Callee = getCalleeOrigin(); while (true) { if (isa(Callee)) return false; if (isa(Callee)) return true; if (isa(Callee)) return true; if (auto *PAI = dyn_cast(Callee)) { Callee = PAI->getCalleeOrigin(); continue; } return false; } } template SILFunction *ApplyInstBase::getCalleeFunction() const { SILValue Callee = getCalleeOrigin(); while (true) { // Intentionally don't lookup throught dynamic_function_ref and // previous_dynamic_function_ref as the target of those functions is not // statically known. if (auto *FRI = dyn_cast(Callee)) return FRI->getReferencedFunctionOrNull(); if (auto *PAI = dyn_cast(Callee)) { Callee = PAI->getCalleeOrigin(); continue; } return nullptr; } } /// A result for the destructure_struct instruction. See documentation for /// destructure_struct for more information. class DestructureStructResult final : public MultipleValueInstructionResult { public: DestructureStructResult(unsigned Index, SILType Type, ValueOwnershipKind OwnershipKind) : MultipleValueInstructionResult(ValueKind::DestructureStructResult, Index, Type, OwnershipKind) {} static bool classof(const SILNode *N) { return N->getKind() == SILNodeKind::DestructureStructResult; } DestructureStructInst *getParent(); const DestructureStructInst *getParent() const { return const_cast(this)->getParent(); } }; /// Instruction that takes in a struct value and splits the struct into the /// struct's fields. class DestructureStructInst final : public UnaryInstructionBase, public MultipleValueInstructionTrailingObjects< DestructureStructInst, DestructureStructResult> { friend TrailingObjects; DestructureStructInst(SILModule &M, SILDebugLocation Loc, SILValue Operand, ArrayRef Types, ArrayRef OwnershipKinds) : UnaryInstructionBase(Loc, Operand), MultipleValueInstructionTrailingObjects(this, Types, OwnershipKinds) {} public: static DestructureStructInst *create(const SILFunction &F, SILDebugLocation Loc, SILValue Operand); static bool classof(const SILNode *N) { return N->getKind() == SILNodeKind::DestructureStructInst; } }; // Out of line to work around forward declaration issues. inline DestructureStructInst *DestructureStructResult::getParent() { auto *Parent = MultipleValueInstructionResult::getParent(); return cast(Parent); } /// A result for the destructure_tuple instruction. See documentation for /// destructure_tuple for more information. class DestructureTupleResult final : public MultipleValueInstructionResult { public: DestructureTupleResult(unsigned Index, SILType Type, ValueOwnershipKind OwnershipKind) : MultipleValueInstructionResult(ValueKind::DestructureTupleResult, Index, Type, OwnershipKind) {} static bool classof(const SILNode *N) { return N->getKind() == SILNodeKind::DestructureTupleResult; } DestructureTupleInst *getParent(); const DestructureTupleInst *getParent() const { return const_cast(this)->getParent(); } }; /// Instruction that takes in a tuple value and splits the tuple into the /// tuples's elements. class DestructureTupleInst final : public UnaryInstructionBase, public MultipleValueInstructionTrailingObjects< DestructureTupleInst, DestructureTupleResult> { friend TrailingObjects; DestructureTupleInst(SILModule &M, SILDebugLocation Loc, SILValue Operand, ArrayRef Types, ArrayRef OwnershipKinds) : UnaryInstructionBase(Loc, Operand), MultipleValueInstructionTrailingObjects(this, Types, OwnershipKinds) {} public: static DestructureTupleInst *create(const SILFunction &F, SILDebugLocation Loc, SILValue Operand); static bool classof(const SILNode *N) { return N->getKind() == SILNodeKind::DestructureTupleInst; } }; // Out of line to work around forward declaration issues. inline DestructureTupleInst *DestructureTupleResult::getParent() { auto *Parent = MultipleValueInstructionResult::getParent(); return cast(Parent); } inline SILType *AllocRefInstBase::getTypeStorage() { // If the size of the subclasses are equal, then all of this compiles away. if (auto I = dyn_cast(this)) return I->getTrailingObjects(); if (auto I = dyn_cast(this)) return I->getTrailingObjects(); llvm_unreachable("Unhandled AllocRefInstBase subclass"); } inline ArrayRef AllocRefInstBase::getAllOperands() const { // If the size of the subclasses are equal, then all of this compiles away. if (auto I = dyn_cast(this)) return I->getAllOperands(); if (auto I = dyn_cast(this)) return I->getAllOperands(); llvm_unreachable("Unhandled AllocRefInstBase subclass"); } inline MutableArrayRef AllocRefInstBase::getAllOperands() { // If the size of the subclasses are equal, then all of this compiles away. if (auto I = dyn_cast(this)) return I->getAllOperands(); if (auto I = dyn_cast(this)) return I->getAllOperands(); llvm_unreachable("Unhandled AllocRefInstBase subclass"); } inline ArrayRef SelectEnumInstBase::getAllOperands() const { // If the size of the subclasses are equal, then all of this compiles away. if (auto I = dyn_cast(this)) return I->getAllOperands(); if (auto I = dyn_cast(this)) return I->getAllOperands(); llvm_unreachable("Unhandled SelectEnumInstBase subclass"); } inline MutableArrayRef SelectEnumInstBase::getAllOperands() { // If the size of the subclasses are equal, then all of this compiles away. if (auto I = dyn_cast(this)) return I->getAllOperands(); if (auto I = dyn_cast(this)) return I->getAllOperands(); llvm_unreachable("Unhandled SelectEnumInstBase subclass"); } inline EnumElementDecl **SelectEnumInstBase::getEnumElementDeclStorage() { // If the size of the subclasses are equal, then all of this compiles away. if (auto I = dyn_cast(this)) return I->getTrailingObjects(); if (auto I = dyn_cast(this)) return I->getTrailingObjects(); llvm_unreachable("Unhandled SelectEnumInstBase subclass"); } inline void SILSuccessor::pred_iterator::cacheBasicBlock() { if (Cur != nullptr) { Block = Cur->ContainingInst->getParent(); assert(Block != nullptr); } else { Block = nullptr; } } // Declared in SILValue.h inline bool Operand::isTypeDependent() const { return getUser()->isTypeDependentOperand(*this); } } // end swift namespace //===----------------------------------------------------------------------===// // ilist_traits for SILInstruction //===----------------------------------------------------------------------===// namespace llvm { template <> struct ilist_traits<::swift::SILInstruction> : public ilist_node_traits<::swift::SILInstruction> { using SILInstruction = ::swift::SILInstruction; private: swift::SILBasicBlock *getContainingBlock(); using instr_iterator = simple_ilist::iterator; public: static void deleteNode(SILInstruction *V) { SILInstruction::destroy(V); } void addNodeToList(SILInstruction *I); void removeNodeFromList(SILInstruction *I); void transferNodesFromList(ilist_traits &L2, instr_iterator first, instr_iterator last); private: void createNode(const SILInstruction &); }; } // end llvm namespace #endif