1 //===-- llvm/BasicBlock.h - Represent a basic block in the VM ---*- C++ -*-===//
3 // The LLVM Compiler Infrastructure
5 // This file was developed by the LLVM research group and is distributed under
6 // the University of Illinois Open Source License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
11 // This file contains the declaration of the BasicBlock class, which represents
12 // a single basic block in the VM.
14 // Note that basic blocks themselves are Value's, because they are referenced
15 // by instructions like branches and can go in switch tables and stuff...
17 ///===---------------------------------------------------------------------===//
19 // Note that well formed basic blocks are formed of a list of instructions
20 // followed by a single TerminatorInst instruction. TerminatorInst's may not
21 // occur in the middle of basic blocks, and must terminate the blocks.
23 // This code allows malformed basic blocks to occur, because it may be useful
24 // in the intermediate stage modification to a program.
26 //===----------------------------------------------------------------------===//
28 #ifndef LLVM_BASICBLOCK_H
29 #define LLVM_BASICBLOCK_H
31 #include "llvm/Instruction.h"
32 #include "llvm/SymbolTableListTraits.h"
33 #include "llvm/ADT/ilist"
38 template <class Term, class BB> class SuccIterator; // Successor Iterator
39 template <class Ptr, class USE_iterator> class PredIterator;
41 template<> struct ilist_traits<Instruction>
42 : public SymbolTableListTraits<Instruction, BasicBlock, Function> {
43 // createNode is used to create a node that marks the end of the list...
44 static Instruction *createNode();
45 static iplist<Instruction> &getList(BasicBlock *BB);
48 class BasicBlock : public Value { // Basic blocks are data objects also
50 typedef iplist<Instruction> InstListType;
52 InstListType InstList;
53 BasicBlock *Prev, *Next; // Next and Prev links for our intrusive linked list
55 void setParent(Function *parent);
56 void setNext(BasicBlock *N) { Next = N; }
57 void setPrev(BasicBlock *N) { Prev = N; }
58 friend class SymbolTableListTraits<BasicBlock, Function, Function>;
60 BasicBlock(const BasicBlock &); // Do not implement
61 void operator=(const BasicBlock &); // Do not implement
64 /// Instruction iterators...
65 typedef InstListType::iterator iterator;
66 typedef InstListType::const_iterator const_iterator;
67 typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
68 typedef std::reverse_iterator<iterator> reverse_iterator;
70 /// BasicBlock ctor - If the function parameter is specified, the basic block
71 /// is automatically inserted at either the end of the function (if
72 /// InsertBefore is null), or before the specified basic block.
74 BasicBlock(const std::string &Name = "", Function *Parent = 0,
75 BasicBlock *InsertBefore = 0);
78 // Specialize setName to take care of symbol table majik
79 virtual void setName(const std::string &name, SymbolTable *ST = 0);
81 /// getParent - Return the enclosing method, or null if none
83 const Function *getParent() const { return InstList.getParent(); }
84 Function *getParent() { return InstList.getParent(); }
86 // getNext/Prev - Return the next or previous basic block in the list.
87 BasicBlock *getNext() { return Next; }
88 const BasicBlock *getNext() const { return Next; }
89 BasicBlock *getPrev() { return Prev; }
90 const BasicBlock *getPrev() const { return Prev; }
92 /// getTerminator() - If this is a well formed basic block, then this returns
93 /// a pointer to the terminator instruction. If it is not, then you get a
94 /// null pointer back.
96 TerminatorInst *getTerminator();
97 const TerminatorInst *const getTerminator() const;
99 /// removeFromParent - This method unlinks 'this' from the containing
100 /// function, but does not delete it.
102 void removeFromParent();
104 /// eraseFromParent - This method unlinks 'this' from the containing function
107 void eraseFromParent();
111 //===--------------------------------------------------------------------===//
112 /// Instruction iterator methods
114 inline iterator begin() { return InstList.begin(); }
115 inline const_iterator begin() const { return InstList.begin(); }
116 inline iterator end () { return InstList.end(); }
117 inline const_iterator end () const { return InstList.end(); }
119 inline reverse_iterator rbegin() { return InstList.rbegin(); }
120 inline const_reverse_iterator rbegin() const { return InstList.rbegin(); }
121 inline reverse_iterator rend () { return InstList.rend(); }
122 inline const_reverse_iterator rend () const { return InstList.rend(); }
124 inline size_t size() const { return InstList.size(); }
125 inline bool empty() const { return InstList.empty(); }
126 inline const Instruction &front() const { return InstList.front(); }
127 inline Instruction &front() { return InstList.front(); }
128 inline const Instruction &back() const { return InstList.back(); }
129 inline Instruction &back() { return InstList.back(); }
131 /// getInstList() - Return the underlying instruction list container. You
132 /// need to access it directly if you want to modify it currently.
134 const InstListType &getInstList() const { return InstList; }
135 InstListType &getInstList() { return InstList; }
137 virtual void print(std::ostream &OS) const { print(OS, 0); }
138 void print(std::ostream &OS, AssemblyAnnotationWriter *AAW) const;
140 /// Methods for support type inquiry through isa, cast, and dyn_cast:
141 static inline bool classof(const BasicBlock *BB) { return true; }
142 static inline bool classof(const Value *V) {
143 return V->getValueType() == Value::BasicBlockVal;
146 /// dropAllReferences() - This function causes all the subinstructions to "let
147 /// go" of all references that they are maintaining. This allows one to
148 /// 'delete' a whole class at a time, even though there may be circular
149 /// references... first all references are dropped, and all use counts go to
150 /// zero. Then everything is delete'd for real. Note that no operations are
151 /// valid on an object that has "dropped all references", except operator
154 void dropAllReferences();
156 /// removePredecessor - This method is used to notify a BasicBlock that the
157 /// specified Predecessor of the block is no longer able to reach it. This is
158 /// actually not used to update the Predecessor list, but is actually used to
159 /// update the PHI nodes that reside in the block. Note that this should be
160 /// called while the predecessor still refers to this block.
162 void removePredecessor(BasicBlock *Pred);
164 /// splitBasicBlock - This splits a basic block into two at the specified
165 /// instruction. Note that all instructions BEFORE the specified iterator
166 /// stay as part of the original basic block, an unconditional branch is added
167 /// to the new BB, and the rest of the instructions in the BB are moved to the
168 /// new BB, including the old terminator. The newly formed BasicBlock is
169 /// returned. This function invalidates the specified iterator.
171 /// Note that this only works on well formed basic blocks (must have a
172 /// terminator), and 'I' must not be the end of instruction list (which would
173 /// cause a degenerate basic block to be formed, having a terminator inside of
174 /// the basic block).
176 BasicBlock *splitBasicBlock(iterator I, const std::string &BBName = "");
179 } // End llvm namespace