// the University of Illinois Open Source License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
-///
-/// \class BasicBlock
-///
-/// This file contains the declaration of the BasicBlock class, which represents
-/// a single basic block in the VM.
-///
-/// Note that basic blocks themselves are Value's, because they are referenced
-/// by instructions like branches and can go in switch tables and stuff...
-///
+//
+//
+// This file contains the declaration of the BasicBlock class, which represents
+// a single basic block in the VM.
+//
+// Note that basic blocks themselves are Value's, because they are referenced
+// by instructions like branches and can go in switch tables and stuff...
+//
///===---------------------------------------------------------------------===//
-///
-/// 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.
-///
-/// This code allows malformed basic blocks to occur, because it may be useful
-/// in the intermediate stage modification to a program.
-///
+//
+// 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.
+//
+// This code allows malformed basic blocks to occur, because it may be useful
+// in the intermediate stage modification to a program.
+//
//===----------------------------------------------------------------------===//
#ifndef LLVM_BASICBLOCK_H
#include "llvm/SymbolTableListTraits.h"
#include "Support/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> {
public:
/// Instruction iterators...
- typedef InstListType::iterator iterator;
- typedef InstListType::const_iterator const_iterator;
+ 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;
/// BasicBlock ctor - If the function parameter is specified, the basic block
- /// is automatically inserted at the end of the function.
+ /// is automatically inserted at either the end of the function (if
+ /// InsertBefore is null), or before the specified basic block.
///
- BasicBlock(const std::string &Name = "", Function *Parent = 0);
-
- /// BasicBlock ctor - If the InsertBefore parameter is specified, the basic
- /// block is automatically inserted right before the specified block.
- BasicBlock(const std::string &Name, BasicBlock *InsertBefore);
+ BasicBlock(const std::string &Name = "", Function *Parent = 0,
+ BasicBlock *InsertBefore = 0);
~BasicBlock();
// Specialize setName to take care of symbol table majik
inline reverse_iterator rend () { return InstList.rend(); }
inline const_reverse_iterator rend () const { return InstList.rend(); }
- inline unsigned size() const { return InstList.size(); }
+ inline unsigned 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.
return V->getValueType() == Value::BasicBlockVal;
}
- /// hasConstantReferences() - This predicate is true if there is a
- /// reference to this basic block in the constant pool for this method. For
- /// example, if a block is reached through a switch table, that table resides
- /// in the constant pool, and the basic block is reference from it.
- ///
- bool hasConstantReferences() const;
-
/// dropAllReferences() - This function causes all the subinstructions to "let
/// go" of all references that they are maintaining. This allows one to
/// 'delete' a whole class at a time, even though there may be circular
BasicBlock *splitBasicBlock(iterator I, const std::string &BBName = "");
};
+} // End llvm namespace
+
#endif