Files
swift-mirror/include/swift/SIL/SILBasicBlock.h
2014-03-13 21:29:56 +00:00

245 lines
8.4 KiB
C++

//===--- SILBasicBlock.h - Basic blocks for SIL -----------------*- C++ -*-===//
//
// This source file is part of the Swift.org open source project
//
// Copyright (c) 2014 - 2015 Apple Inc. and the Swift project authors
// Licensed under Apache License v2.0 with Runtime Library Exception
//
// See http://swift.org/LICENSE.txt for license information
// See http://swift.org/CONTRIBUTORS.txt for the list of Swift project authors
//
//===----------------------------------------------------------------------===//
//
// This file defines the high-level BasicBlocks used for Swift SIL code.
//
//===----------------------------------------------------------------------===//
#ifndef SWIFT_SIL_BASICBLOCK_H
#define SWIFT_SIL_BASICBLOCK_H
#include "swift/SIL/SILInstruction.h"
namespace llvm {
template <class T> struct GraphTraits;
};
namespace swift {
class SILFunction;
class SILArgument;
class SILBasicBlock :
public llvm::ilist_node<SILBasicBlock>, public SILAllocated<SILBasicBlock> {
friend class SILSuccessor;
public:
typedef llvm::iplist<SILInstruction> InstListType;
private:
/// A backreference to the containing SILFunction.
SILFunction * const Parent;
/// PrevList - This is a list of all of the terminator operands that are
/// branching to this block, forming the predecessor list. This is
/// automatically managed by the SILSuccessor class.
SILSuccessor *PredList;
/// BBArgList - This is the list of basic block arguments for this block.
std::vector<SILArgument*> BBArgList;
/// The ordered set of instructions in the SILBasicBlock.
InstListType InstList;
friend struct llvm::ilist_sentinel_traits<SILBasicBlock>;
SILBasicBlock() : Parent(0) {}
void operator=(const SILBasicBlock &) = delete;
void operator delete(void *Ptr, size_t) = delete;
public:
SILBasicBlock(SILFunction *F);
~SILBasicBlock();
SILFunction *getParent() { return Parent; }
const SILFunction *getParent() const { return Parent; }
SILModule &getModule() const;
/// eraseFromParent - This method unlinks 'self' from the containing
/// SILFunction and deletes it.
///
void eraseFromParent();
//===--------------------------------------------------------------------===//
// SILInstruction List Inspection and Manipulation
//===--------------------------------------------------------------------===//
InstListType &getInstList() { return InstList; }
const InstListType &getInstList() const { return InstList; }
typedef InstListType::iterator iterator;
typedef InstListType::const_iterator const_iterator;
typedef InstListType::reverse_iterator reverse_iterator;
typedef InstListType::const_reverse_iterator const_reverse_iterator;
bool empty() const { return InstList.empty(); }
iterator begin() { return InstList.begin(); }
iterator end() { return InstList.end(); }
const_iterator begin() const { return InstList.begin(); }
const_iterator end() const { return InstList.end(); }
reverse_iterator rbegin() { return InstList.rbegin(); }
reverse_iterator rend() { return InstList.rend(); }
const_reverse_iterator rbegin() const { return InstList.rbegin(); }
const_reverse_iterator rend() const { return InstList.rend(); }
TermInst *getTerminator() {
assert(!InstList.empty() && "Can't get successors for malformed block");
return cast<TermInst>(&InstList.back());
}
const TermInst *getTerminator() const {
return const_cast<SILBasicBlock*>(this)->getTerminator();
}
/// \brief Splits a basic block into two at the specified instruction.
///
/// Note that all the instructions BEFORE the specified iterator
/// stay as part of the original basic block. The old basic block is left
/// without a terminator.
SILBasicBlock *splitBasicBlock(iterator I);
/// \brief Splits a basic block into two at the specified instruction and
/// inserts an unconditional branch from the old basic block to the new basic
/// block.
///
/// \sa splitBasicBlock
SILBasicBlock *splitBasicBlockAndBranch(iterator I, SILLocation BranchLoc);
//===--------------------------------------------------------------------===//
// SILBasicBlock Argument List Inspection and Manipulation
//===--------------------------------------------------------------------===//
typedef std::vector<SILArgument*>::iterator bbarg_iterator;
typedef std::vector<SILArgument*>::const_iterator const_bbarg_iterator;
bool bbarg_empty() const { return BBArgList.empty(); }
size_t bbarg_size() const { return BBArgList.size(); }
bbarg_iterator bbarg_begin() { return BBArgList.begin(); }
bbarg_iterator bbarg_end() { return BBArgList.end(); }
const_bbarg_iterator bbarg_begin() const { return BBArgList.begin(); }
const_bbarg_iterator bbarg_end() const { return BBArgList.end(); }
ArrayRef<SILArgument*> getBBArgs() const { return BBArgList; }
unsigned getNumBBArg() const { return BBArgList.size(); }
const SILArgument *getBBArg(unsigned i) const { return BBArgList[i]; }
SILArgument *getBBArg(unsigned i) { return BBArgList[i]; }
/// \brief Remove all block arguments.
void dropAllArgs() { BBArgList.clear(); }
//===--------------------------------------------------------------------===//
// Predecessors and Successors
//===--------------------------------------------------------------------===//
typedef ArrayRef<SILSuccessor> Successors;
/// The successors of a SILBasicBlock are defined either explicitly as
/// a single successor as the branch targets of the terminator instruction.
Successors getSuccs() const {
return getTerminator()->getSuccessors();
}
typedef Successors::const_iterator const_succ_iterator;
typedef Successors::iterator succ_iterator;
bool succ_empty() const { return getSuccs().empty(); }
succ_iterator succ_begin() { return getSuccs().begin(); }
succ_iterator succ_end() { return getSuccs().end(); }
const_succ_iterator succ_begin() const { return getSuccs().begin(); }
const_succ_iterator succ_end() const { return getSuccs().end(); }
typedef SILSuccessorIterator pred_iterator;
bool pred_empty() const { return PredList == nullptr; }
pred_iterator pred_begin() const { return pred_iterator(PredList); }
pred_iterator pred_end() const { return pred_iterator(); }
Range<pred_iterator> getPreds() const { return {pred_begin(), pred_end() }; }
SILBasicBlock *getSinglePredecessor() {
if (pred_empty() || std::next(pred_begin()) != pred_end())
return 0;
return *pred_begin();
}
SILBasicBlock *getSingleSuccessor() {
if (succ_empty() || std::next(succ_begin()) != succ_end())
return 0;
return *succ_begin();
}
const SILBasicBlock *getSinglePredecessor() const {
return const_cast<SILBasicBlock*>(this)->getSinglePredecessor();
}
/// Pretty-print the SILBasicBlock.
void dump() const;
/// Pretty-print the SILBasicBlock with the designated stream.
void print(llvm::raw_ostream &OS) const;
void printAsOperand(raw_ostream &OS, bool PrintType = true);
/// getSublistAccess() - returns pointer to member of instruction list
static InstListType SILBasicBlock::*getSublistAccess() {
return &SILBasicBlock::InstList;
}
/// Erase a specific argument from the arg list.
void eraseArgument(int idx) { BBArgList.erase(BBArgList.begin() + idx); }
private:
friend class SILArgument;
/// BBArgument's ctor adds it to the argument list of this block.
void addArgument(SILArgument *Arg) { BBArgList.push_back(Arg); }
};
inline llvm::raw_ostream &operator<<(llvm::raw_ostream &OS,
const SILBasicBlock &BB) {
BB.print(OS);
return OS;
}
} // end swift namespace
namespace llvm {
//===----------------------------------------------------------------------===//
// ilist_traits for SILBasicBlock
//===----------------------------------------------------------------------===//
template <>
struct ilist_traits<::swift::SILBasicBlock> :
public ilist_default_traits<::swift::SILBasicBlock> {
typedef ::swift::SILBasicBlock SILBasicBlock;
private:
mutable ilist_half_node<SILBasicBlock> Sentinel;
public:
SILBasicBlock *createSentinel() const {
return static_cast<SILBasicBlock*>(&Sentinel);
}
void destroySentinel(SILBasicBlock *) const {}
SILBasicBlock *provideInitialHead() const { return createSentinel(); }
SILBasicBlock *ensureHead(SILBasicBlock*) const { return createSentinel(); }
static void noteHead(SILBasicBlock*, SILBasicBlock*) {}
static void deleteNode(SILBasicBlock *V) { V->~SILBasicBlock(); }
private:
void createNode(const SILBasicBlock &);
};
} // end llvm namespace
#endif