1 //===-- llvm/CodeGen/MachineBasicBlock.h ------------------------*- 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 //===----------------------------------------------------------------------===//
10 // Collect the sequence of machine instructions for a basic block.
12 //===----------------------------------------------------------------------===//
14 #ifndef LLVM_CODEGEN_MACHINEBASICBLOCK_H
15 #define LLVM_CODEGEN_MACHINEBASICBLOCK_H
17 #include "llvm/CodeGen/MachineInstr.h"
18 #include "Support/GraphTraits.h"
19 #include "Support/ilist"
23 class MachineFunction;
27 class ilist_traits<MachineInstr> {
28 // this is only set by the MachineBasicBlock owning the ilist
29 friend class MachineBasicBlock;
30 MachineBasicBlock* parent;
33 ilist_traits<MachineInstr>() : parent(0) { }
35 static MachineInstr* getPrev(MachineInstr* N) { return N->prev; }
36 static MachineInstr* getNext(MachineInstr* N) { return N->next; }
38 static const MachineInstr*
39 getPrev(const MachineInstr* N) { return N->prev; }
41 static const MachineInstr*
42 getNext(const MachineInstr* N) { return N->next; }
44 static void setPrev(MachineInstr* N, MachineInstr* prev) { N->prev = prev; }
45 static void setNext(MachineInstr* N, MachineInstr* next) { N->next = next; }
47 static MachineInstr* createNode();
48 void addNodeToList(MachineInstr* N);
49 void removeNodeFromList(MachineInstr* N);
50 void transferNodesFromList(
51 iplist<MachineInstr, ilist_traits<MachineInstr> >& toList,
52 ilist_iterator<MachineInstr> first,
53 ilist_iterator<MachineInstr> last);
58 class MachineBasicBlock {
60 typedef ilist<MachineInstr> Instructions;
62 MachineBasicBlock *Prev, *Next;
64 std::vector<MachineBasicBlock *> Predecessors;
65 std::vector<MachineBasicBlock *> Successors;
67 MachineFunction *Parent;
70 MachineBasicBlock(const BasicBlock *bb = 0) : Prev(0), Next(0), BB(bb),
71 Number(-1), Parent(0) {
77 /// getBasicBlock - Return the LLVM basic block that this instance
78 /// corresponded to originally.
80 const BasicBlock *getBasicBlock() const { return BB; }
82 /// getParent - Return the MachineFunction containing this basic block.
84 const MachineFunction *getParent() const { return Parent; }
85 MachineFunction *getParent() { return Parent; }
87 typedef ilist<MachineInstr>::iterator iterator;
88 typedef ilist<MachineInstr>::const_iterator const_iterator;
89 typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
90 typedef std::reverse_iterator<iterator> reverse_iterator;
92 unsigned size() const { return Insts.size(); }
93 bool empty() const { return Insts.empty(); }
95 MachineInstr& front() { return Insts.front(); }
96 MachineInstr& back() { return Insts.back(); }
98 iterator begin() { return Insts.begin(); }
99 const_iterator begin() const { return Insts.begin(); }
100 iterator end() { return Insts.end(); }
101 const_iterator end() const { return Insts.end(); }
102 reverse_iterator rbegin() { return Insts.rbegin(); }
103 const_reverse_iterator rbegin() const { return Insts.rbegin(); }
104 reverse_iterator rend () { return Insts.rend(); }
105 const_reverse_iterator rend () const { return Insts.rend(); }
107 // Machine-CFG iterators
108 typedef std::vector<MachineBasicBlock *>::iterator pred_iterator;
109 typedef std::vector<MachineBasicBlock *>::const_iterator const_pred_iterator;
110 typedef std::vector<MachineBasicBlock *>::iterator succ_iterator;
111 typedef std::vector<MachineBasicBlock *>::const_iterator const_succ_iterator;
113 pred_iterator pred_begin() { return Predecessors.begin (); }
114 const_pred_iterator pred_begin() const { return Predecessors.begin (); }
115 pred_iterator pred_end() { return Predecessors.end (); }
116 const_pred_iterator pred_end() const { return Predecessors.end (); }
117 unsigned pred_size() const { return Predecessors.size (); }
118 bool pred_empty() const { return Predecessors.empty(); }
119 succ_iterator succ_begin() { return Successors.begin (); }
120 const_succ_iterator succ_begin() const { return Successors.begin (); }
121 succ_iterator succ_end() { return Successors.end (); }
122 const_succ_iterator succ_end() const { return Successors.end (); }
123 unsigned succ_size() const { return Successors.size (); }
124 bool succ_empty() const { return Successors.empty(); }
126 // Machine-CFG mutators
128 /// addSuccessor - Add succ as a successor of this MachineBasicBlock.
129 /// The Predecessors list of succ is automatically updated.
131 void addSuccessor(MachineBasicBlock *succ) {
132 Successors.push_back(succ);
133 succ->addPredecessor(this);
136 /// removeSuccessor - Remove successor from the successors list of this
137 /// MachineBasicBlock. The Predecessors list of succ is automatically updated.
139 void removeSuccessor(MachineBasicBlock *succ) {
140 succ->removePredecessor(this);
141 succ_iterator I = std::find(Successors.begin(), Successors.end(), succ);
142 assert(I != Successors.end() && "Not a current successor!");
146 /// removeSuccessor - Remove specified successor from the successors list of
147 /// this MachineBasicBlock. The Predecessors list of succ is automatically
150 void removeSuccessor(succ_iterator I) {
151 assert(I != Successors.end() && "Not a current successor!");
152 (*I)->removePredecessor(this);
156 /// getFirstTerminator - returns an iterator to the first terminator
157 /// instruction of this basic block. If a terminator does not exist,
159 iterator getFirstTerminator();
161 void pop_front() { Insts.pop_front(); }
162 void push_back(MachineInstr *MI) { Insts.push_back(MI); }
163 template<typename IT>
164 void insert(iterator I, IT S, IT E) { Insts.insert(I, S, E); }
165 iterator insert(iterator I, MachineInstr *M) { return Insts.insert(I, M); }
167 // erase - Remove the specified element or range from the instruction list.
168 // These functions delete any instructions removed.
170 iterator erase(iterator I) { return Insts.erase(I); }
171 iterator erase(iterator I, iterator E) { return Insts.erase(I, E); }
172 MachineInstr *remove(MachineInstr *I) { return Insts.remove(I); }
173 void clear() { Insts.clear(); }
175 // Debugging methods.
177 void print(std::ostream &OS) const;
179 /// getNumber - MachineBasicBlocks are uniquely numbered at the function
180 /// level, unless they're not in a MachineFunction yet, in which case this
183 int getNumber() const { return Number; }
185 private: // Methods used to maintain doubly linked list of blocks...
186 friend class ilist_traits<MachineBasicBlock>;
188 MachineBasicBlock *getPrev() const { return Prev; }
189 MachineBasicBlock *getNext() const { return Next; }
190 void setPrev(MachineBasicBlock *P) { Prev = P; }
191 void setNext(MachineBasicBlock *N) { Next = N; }
193 // Machine-CFG mutators
195 /// addPredecessor - Remove pred as a predecessor of this MachineBasicBlock.
196 /// Don't do this unless you know what you're doing, because it doesn't
197 /// update pred's successors list. Use pred->addSuccessor instead.
199 void addPredecessor (MachineBasicBlock *pred) {
200 Predecessors.push_back (pred);
203 /// removePredecessor - Remove pred as a predecessor of this
204 /// MachineBasicBlock. Don't do this unless you know what you're
205 /// doing, because it doesn't update pred's successors list. Use
206 /// pred->removeSuccessor instead.
208 void removePredecessor (MachineBasicBlock *pred) {
209 std::vector<MachineBasicBlock *>::iterator goner =
210 std::find (Predecessors.begin(), Predecessors.end (), pred);
211 Predecessors.erase (goner);
216 //===--------------------------------------------------------------------===//
217 // GraphTraits specializations for machine basic block graphs (machine-CFGs)
218 //===--------------------------------------------------------------------===//
220 // Provide specializations of GraphTraits to be able to treat a
221 // MachineFunction as a graph of MachineBasicBlocks...
224 template <> struct GraphTraits<MachineBasicBlock *> {
225 typedef MachineBasicBlock NodeType;
226 typedef MachineBasicBlock::succ_iterator ChildIteratorType;
228 static NodeType *getEntryNode(MachineBasicBlock *BB) { return BB; }
229 static inline ChildIteratorType child_begin(NodeType *N) {
230 return N->succ_begin();
232 static inline ChildIteratorType child_end(NodeType *N) {
233 return N->succ_end();
237 template <> struct GraphTraits<const MachineBasicBlock *> {
238 typedef const MachineBasicBlock NodeType;
239 typedef MachineBasicBlock::const_succ_iterator ChildIteratorType;
241 static NodeType *getEntryNode(const MachineBasicBlock *BB) { return BB; }
242 static inline ChildIteratorType child_begin(NodeType *N) {
243 return N->succ_begin();
245 static inline ChildIteratorType child_end(NodeType *N) {
246 return N->succ_end();
250 // Provide specializations of GraphTraits to be able to treat a
251 // MachineFunction as a graph of MachineBasicBlocks... and to walk it
252 // in inverse order. Inverse order for a function is considered
253 // to be when traversing the predecessor edges of a MBB
254 // instead of the successor edges.
256 template <> struct GraphTraits<Inverse<MachineBasicBlock*> > {
257 typedef MachineBasicBlock NodeType;
258 typedef MachineBasicBlock::pred_iterator ChildIteratorType;
259 static NodeType *getEntryNode(Inverse<MachineBasicBlock *> G) {
262 static inline ChildIteratorType child_begin(NodeType *N) {
263 return N->pred_begin();
265 static inline ChildIteratorType child_end(NodeType *N) {
266 return N->pred_end();
270 template <> struct GraphTraits<Inverse<const MachineBasicBlock*> > {
271 typedef const MachineBasicBlock NodeType;
272 typedef MachineBasicBlock::const_pred_iterator ChildIteratorType;
273 static NodeType *getEntryNode(Inverse<const MachineBasicBlock*> G) {
276 static inline ChildIteratorType child_begin(NodeType *N) {
277 return N->pred_begin();
279 static inline ChildIteratorType child_end(NodeType *N) {
280 return N->pred_end();
284 } // End llvm namespace