1 //===-- llvm/BasicBlock.h - Represent a basic block in the VM ----*- C++ -*--=//
5 /// This file contains the declaration of the BasicBlock class, which represents
6 /// a single basic block in the VM.
8 /// Note that basic blocks themselves are Value's, because they are referenced
9 /// by instructions like branches and can go in switch tables and stuff...
11 ///===---------------------------------------------------------------------===//
13 /// Note that well formed basic blocks are formed of a list of instructions
14 /// followed by a single TerminatorInst instruction. TerminatorInst's may not
15 /// occur in the middle of basic blocks, and must terminate the blocks.
17 /// This code allows malformed basic blocks to occur, because it may be useful
18 /// in the intermediate stage modification to a program.
20 //===----------------------------------------------------------------------===//
22 #ifndef LLVM_BASICBLOCK_H
23 #define LLVM_BASICBLOCK_H
25 #include "llvm/Instruction.h"
26 #include "llvm/SymbolTableListTraits.h"
27 #include "Support/ilist"
30 template <class _Term, class _BB> class SuccIterator; // Successor Iterator
31 template <class _Ptr, class _USE_iterator> class PredIterator;
33 template<> struct ilist_traits<Instruction>
34 : public SymbolTableListTraits<Instruction, BasicBlock, Function> {
35 // createNode is used to create a node that marks the end of the list...
36 static Instruction *createNode();
37 static iplist<Instruction> &getList(BasicBlock *BB);
40 class BasicBlock : public Value { // Basic blocks are data objects also
42 typedef iplist<Instruction> InstListType;
44 InstListType InstList;
45 BasicBlock *Prev, *Next; // Next and Prev links for our intrusive linked list
47 void setParent(Function *parent) { InstList.setParent(parent); }
48 void setNext(BasicBlock *N) { Next = N; }
49 void setPrev(BasicBlock *N) { Prev = N; }
50 friend class SymbolTableListTraits<BasicBlock, Function, Function>;
52 BasicBlock(const BasicBlock &); // Do not implement
53 void operator=(const BasicBlock &); // Do not implement
56 // Instruction iterators...
57 typedef InstListType::iterator iterator;
58 typedef InstListType::const_iterator const_iterator;
59 typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
60 typedef std::reverse_iterator<iterator> reverse_iterator;
63 BasicBlock(const std::string &Name = "", Function *Parent = 0);
66 // Specialize setName to take care of symbol table majik
67 virtual void setName(const std::string &name, SymbolTable *ST = 0);
69 // getParent - Return the enclosing method, or null if none
70 const Function *getParent() const { return InstList.getParent(); }
71 Function *getParent() { return InstList.getParent(); }
73 // getNext/Prev - Return the next or previous basic block in the list.
74 BasicBlock *getNext() { return Next; }
75 const BasicBlock *getNext() const { return Next; }
76 BasicBlock *getPrev() { return Prev; }
77 const BasicBlock *getPrev() const { return Prev; }
79 /// getTerminator() - If this is a well formed basic block, then this returns
80 /// a pointer to the terminator instruction. If it is not, then you get a
81 /// null pointer back.
83 TerminatorInst *getTerminator();
84 const TerminatorInst *const getTerminator() const;
86 // Provide a scoped predecessor and successor iterator
87 typedef PredIterator<BasicBlock, Value::use_iterator> pred_iterator;
88 typedef PredIterator<const BasicBlock,
89 Value::use_const_iterator> pred_const_iterator;
91 typedef SuccIterator<TerminatorInst*, BasicBlock> succ_iterator;
92 typedef SuccIterator<const TerminatorInst*,
93 const BasicBlock> succ_const_iterator;
96 //===--------------------------------------------------------------------===//
97 // Instruction iterator methods
99 inline iterator begin() { return InstList.begin(); }
100 inline const_iterator begin() const { return InstList.begin(); }
101 inline iterator end () { return InstList.end(); }
102 inline const_iterator end () const { return InstList.end(); }
104 inline reverse_iterator rbegin() { return InstList.rbegin(); }
105 inline const_reverse_iterator rbegin() const { return InstList.rbegin(); }
106 inline reverse_iterator rend () { return InstList.rend(); }
107 inline const_reverse_iterator rend () const { return InstList.rend(); }
109 inline unsigned size() const { return InstList.size(); }
110 inline bool empty() const { return InstList.empty(); }
111 inline const Instruction &front() const { return InstList.front(); }
112 inline Instruction &front() { return InstList.front(); }
113 inline const Instruction &back() const { return InstList.back(); }
114 inline Instruction &back() { return InstList.back(); }
116 /// getInstList() - Return the underlying instruction list container. You
117 /// need to access it directly if you want to modify it currently.
119 const InstListType &getInstList() const { return InstList; }
120 InstListType &getInstList() { return InstList; }
122 virtual void print(std::ostream &OS) const;
124 /// Methods for support type inquiry through isa, cast, and dyn_cast:
125 static inline bool classof(const BasicBlock *BB) { return true; }
126 static inline bool classof(const Value *V) {
127 return V->getValueType() == Value::BasicBlockVal;
130 /// hasConstantReferences() - This predicate is true if there is a
131 /// reference to this basic block in the constant pool for this method. For
132 /// example, if a block is reached through a switch table, that table resides
133 /// in the constant pool, and the basic block is reference from it.
135 bool hasConstantReferences() const;
137 /// dropAllReferences() - This function causes all the subinstructions to "let
138 /// go" of all references that they are maintaining. This allows one to
139 /// 'delete' a whole class at a time, even though there may be circular
140 /// references... first all references are dropped, and all use counts go to
141 /// zero. Then everything is delete'd for real. Note that no operations are
142 /// valid on an object that has "dropped all references", except operator
145 void dropAllReferences();
147 /// removePredecessor - This method is used to notify a BasicBlock that the
148 /// specified Predecessor of the block is no longer able to reach it. This is
149 /// actually not used to update the Predecessor list, but is actually used to
150 /// update the PHI nodes that reside in the block. Note that this should be
151 /// called while the predecessor still refers to this block.
153 void removePredecessor(BasicBlock *Pred);
155 /// splitBasicBlock - This splits a basic block into two at the specified
156 /// instruction. Note that all instructions BEFORE the specified iterator
157 /// stay as part of the original basic block, an unconditional branch is added
158 /// to the new BB, and the rest of the instructions in the BB are moved to the
159 /// new BB, including the old terminator. The newly formed BasicBlock is
160 /// returned. This function invalidates the specified iterator.
162 /// Note that this only works on well formed basic blocks (must have a
163 /// terminator), and 'I' must not be the end of instruction list (which would
164 /// cause a degenerate basic block to be formed, having a terminator inside of
165 /// the basic block).
167 BasicBlock *splitBasicBlock(iterator I);