//===-- llvm/BasicBlock.h - Represent a basic block in the VM ---*- C++ -*-===//
-//
+//
// The LLVM Compiler Infrastructure
//
// This file was developed by the LLVM research group and is distributed under
// the University of Illinois Open Source License. See LICENSE.TXT for details.
-//
+//
//===----------------------------------------------------------------------===//
//
//
//
///===---------------------------------------------------------------------===//
//
-// Note that well formed basic blocks are formed of a list of instructions
+// Note that well formed basic blocks are formed of a list of instructions
// followed by a single TerminatorInst instruction. TerminatorInst's may not
// occur in the middle of basic blocks, and must terminate the blocks.
//
#include "llvm/Instruction.h"
#include "llvm/SymbolTableListTraits.h"
-#include "Support/ilist"
+#include "llvm/ADT/ilist"
namespace llvm {
class TerminatorInst;
-template <class _Term, class _BB> class SuccIterator; // Successor Iterator
-template <class _Ptr, class _USE_iterator> class PredIterator;
+template <class Term, class BB> class SuccIterator; // Successor Iterator
+template <class Ptr, class USE_iterator> class PredIterator;
template<> struct ilist_traits<Instruction>
: public SymbolTableListTraits<Instruction, BasicBlock, Function> {
- // createNode is used to create a node that marks the end of the list...
- static Instruction *createNode();
+ // createSentinel is used to create a node that marks the end of the list...
+ static Instruction *createSentinel();
+ static void destroySentinel(Instruction *I) { delete I; }
static iplist<Instruction> &getList(BasicBlock *BB);
};
-struct BasicBlock : public Value { // Basic blocks are data objects also
+class BasicBlock : public Value { // Basic blocks are data objects also
+public:
typedef iplist<Instruction> InstListType;
private :
InstListType InstList;
public:
/// Instruction iterators...
- typedef InstListType::iterator iterator;
- typedef InstListType::const_iterator const_iterator;
- typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
- typedef std::reverse_iterator<iterator> reverse_iterator;
+ typedef InstListType::iterator iterator;
+ typedef InstListType::const_iterator const_iterator;
/// BasicBlock ctor - If the function parameter is specified, the basic block
/// is automatically inserted at either the end of the function (if
/// InsertBefore is null), or before the specified basic block.
///
- /// BasicBlock ctor - If the InsertBefore parameter is specified, the basic
- /// block is automatically inserted right before the specified block.
- ///
BasicBlock(const std::string &Name = "", Function *Parent = 0,
BasicBlock *InsertBefore = 0);
~BasicBlock();
- // Specialize setName to take care of symbol table majik
- virtual void setName(const std::string &name, SymbolTable *ST = 0);
-
/// getParent - Return the enclosing method, or null if none
///
const Function *getParent() const { return InstList.getParent(); }
///
TerminatorInst *getTerminator();
const TerminatorInst *const getTerminator() const;
+
+ /// removeFromParent - This method unlinks 'this' from the containing
+ /// function, but does not delete it.
+ ///
+ void removeFromParent();
+
+ /// eraseFromParent - This method unlinks 'this' from the containing function
+ /// and deletes it.
+ ///
+ void eraseFromParent();
+ /// moveBefore - Unlink this instruction from its current function and
+ /// insert it into the function that MovePos lives in, right before
+ /// MovePos.
+ void moveBefore(BasicBlock *MovePos);
+
+ /// getSinglePredecessor - If this basic block has a single predecessor block,
+ /// return the block, otherwise return a null pointer.
+ BasicBlock *getSinglePredecessor();
+ const BasicBlock *getSinglePredecessor() const {
+ return const_cast<BasicBlock*>(this)->getSinglePredecessor();
+ }
+
//===--------------------------------------------------------------------===//
/// Instruction iterator methods
///
inline iterator end () { return InstList.end(); }
inline const_iterator end () const { return InstList.end(); }
- inline reverse_iterator rbegin() { return InstList.rbegin(); }
- inline const_reverse_iterator rbegin() const { return InstList.rbegin(); }
- inline reverse_iterator rend () { return InstList.rend(); }
- inline const_reverse_iterator rend () const { return InstList.rend(); }
-
- inline unsigned size() const { return InstList.size(); }
+ inline size_t size() const { return InstList.size(); }
inline bool empty() const { return InstList.empty(); }
inline const Instruction &front() const { return InstList.front(); }
inline Instruction &front() { return InstList.front(); }
- inline const Instruction &back() const { return InstList.back(); }
- inline Instruction &back() { return InstList.back(); }
+ inline const Instruction &back() const { return InstList.back(); }
+ inline Instruction &back() { return InstList.back(); }
/// getInstList() - Return the underlying instruction list container. You
/// need to access it directly if you want to modify it currently.
void print(std::ostream &OS, AssemblyAnnotationWriter *AAW) const;
/// Methods for support type inquiry through isa, cast, and dyn_cast:
- static inline bool classof(const BasicBlock *BB) { return true; }
+ static inline bool classof(const BasicBlock *) { return true; }
static inline bool classof(const Value *V) {
return V->getValueType() == Value::BasicBlockVal;
}
/// 'delete' a whole class at a time, even though there may be circular
/// references... first all references are dropped, and all use counts go to
/// zero. Then everything is delete'd for real. Note that no operations are
- /// valid on an object that has "dropped all references", except operator
+ /// valid on an object that has "dropped all references", except operator
/// delete.
///
void dropAllReferences();
/// removePredecessor - This method is used to notify a BasicBlock that the
/// specified Predecessor of the block is no longer able to reach it. This is
- /// actually not used to update the Predecessor list, but is actually used to
+ /// actually not used to update the Predecessor list, but is actually used to
/// update the PHI nodes that reside in the block. Note that this should be
/// called while the predecessor still refers to this block.
///
- void removePredecessor(BasicBlock *Pred);
+ void removePredecessor(BasicBlock *Pred, bool DontDeleteUselessPHIs = false);
/// splitBasicBlock - This splits a basic block into two at the specified
/// instruction. Note that all instructions BEFORE the specified iterator
/// stay as part of the original basic block, an unconditional branch is added
- /// to the new BB, and the rest of the instructions in the BB are moved to the
- /// new BB, including the old terminator. The newly formed BasicBlock is
- /// returned. This function invalidates the specified iterator.
+ /// to the original BB, and the rest of the instructions in the BB are moved
+ /// to the new BB, including the old terminator. The newly formed BasicBlock
+ /// is returned. This function invalidates the specified iterator.
///
- /// Note that this only works on well formed basic blocks (must have a
+ /// Note that this only works on well formed basic blocks (must have a
/// terminator), and 'I' must not be the end of instruction list (which would
/// cause a degenerate basic block to be formed, having a terminator inside of
/// the basic block).