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 "llvm/ADT/GraphTraits.h"
19 #include "llvm/ADT/ilist"
23 class MachineFunction;
27 struct ilist_traits<MachineInstr> {
29 // this is only set by the MachineBasicBlock owning the ilist
30 friend class MachineBasicBlock;
31 MachineBasicBlock* parent;
34 ilist_traits<MachineInstr>() : parent(0) { }
36 static MachineInstr* getPrev(MachineInstr* N) { return N->prev; }
37 static MachineInstr* getNext(MachineInstr* N) { return N->next; }
39 static const MachineInstr*
40 getPrev(const MachineInstr* N) { return N->prev; }
42 static const MachineInstr*
43 getNext(const MachineInstr* N) { return N->next; }
45 static void setPrev(MachineInstr* N, MachineInstr* prev) { N->prev = prev; }
46 static void setNext(MachineInstr* N, MachineInstr* next) { N->next = next; }
48 static MachineInstr* createNode();
49 void addNodeToList(MachineInstr* N);
50 void removeNodeFromList(MachineInstr* N);
51 void transferNodesFromList(
52 iplist<MachineInstr, ilist_traits<MachineInstr> >& toList,
53 ilist_iterator<MachineInstr> first,
54 ilist_iterator<MachineInstr> last);
59 class MachineBasicBlock {
61 typedef ilist<MachineInstr> Instructions;
63 MachineBasicBlock *Prev, *Next;
65 std::vector<MachineBasicBlock *> Predecessors;
66 std::vector<MachineBasicBlock *> Successors;
68 MachineFunction *Parent;
71 MachineBasicBlock(const BasicBlock *bb = 0) : Prev(0), Next(0), BB(bb),
72 Number(-1), Parent(0) {
78 /// getBasicBlock - Return the LLVM basic block that this instance
79 /// corresponded to originally.
81 const BasicBlock *getBasicBlock() const { return BB; }
83 /// getParent - Return the MachineFunction containing this basic block.
85 const MachineFunction *getParent() const { return Parent; }
86 MachineFunction *getParent() { return Parent; }
88 typedef ilist<MachineInstr>::iterator iterator;
89 typedef ilist<MachineInstr>::const_iterator const_iterator;
90 typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
91 typedef std::reverse_iterator<iterator> reverse_iterator;
93 unsigned size() const { return Insts.size(); }
94 bool empty() const { return Insts.empty(); }
96 MachineInstr& front() { return Insts.front(); }
97 MachineInstr& back() { return Insts.back(); }
99 iterator begin() { return Insts.begin(); }
100 const_iterator begin() const { return Insts.begin(); }
101 iterator end() { return Insts.end(); }
102 const_iterator end() const { return Insts.end(); }
103 reverse_iterator rbegin() { return Insts.rbegin(); }
104 const_reverse_iterator rbegin() const { return Insts.rbegin(); }
105 reverse_iterator rend () { return Insts.rend(); }
106 const_reverse_iterator rend () const { return Insts.rend(); }
108 // Machine-CFG iterators
109 typedef std::vector<MachineBasicBlock *>::iterator pred_iterator;
110 typedef std::vector<MachineBasicBlock *>::const_iterator const_pred_iterator;
111 typedef std::vector<MachineBasicBlock *>::iterator succ_iterator;
112 typedef std::vector<MachineBasicBlock *>::const_iterator const_succ_iterator;
114 pred_iterator pred_begin() { return Predecessors.begin (); }
115 const_pred_iterator pred_begin() const { return Predecessors.begin (); }
116 pred_iterator pred_end() { return Predecessors.end (); }
117 const_pred_iterator pred_end() const { return Predecessors.end (); }
118 unsigned pred_size() const { return Predecessors.size (); }
119 bool pred_empty() const { return Predecessors.empty(); }
120 succ_iterator succ_begin() { return Successors.begin (); }
121 const_succ_iterator succ_begin() const { return Successors.begin (); }
122 succ_iterator succ_end() { return Successors.end (); }
123 const_succ_iterator succ_end() const { return Successors.end (); }
124 unsigned succ_size() const { return Successors.size (); }
125 bool succ_empty() const { return Successors.empty(); }
127 // Machine-CFG mutators
129 /// addSuccessor - Add succ as a successor of this MachineBasicBlock.
130 /// The Predecessors list of succ is automatically updated.
132 void addSuccessor(MachineBasicBlock *succ);
134 /// removeSuccessor - Remove successor from the successors list of this
135 /// MachineBasicBlock. The Predecessors list of succ is automatically updated.
137 void removeSuccessor(MachineBasicBlock *succ);
139 /// removeSuccessor - Remove specified successor from the successors list of
140 /// this MachineBasicBlock. The Predecessors list of succ is automatically
143 void removeSuccessor(succ_iterator I);
145 /// getFirstTerminator - returns an iterator to the first terminator
146 /// instruction of this basic block. If a terminator does not exist,
148 iterator getFirstTerminator();
150 void pop_front() { Insts.pop_front(); }
151 void pop_back() { Insts.pop_back(); }
152 void push_back(MachineInstr *MI) { Insts.push_back(MI); }
153 template<typename IT>
154 void insert(iterator I, IT S, IT E) { Insts.insert(I, S, E); }
155 iterator insert(iterator I, MachineInstr *M) { return Insts.insert(I, M); }
157 // erase - Remove the specified element or range from the instruction list.
158 // These functions delete any instructions removed.
160 iterator erase(iterator I) { return Insts.erase(I); }
161 iterator erase(iterator I, iterator E) { return Insts.erase(I, E); }
162 MachineInstr *remove(MachineInstr *I) { return Insts.remove(I); }
163 void clear() { Insts.clear(); }
165 /// splice - Take a block of instructions from MBB 'Other' in the range [From,
166 /// To), and insert them into this MBB right before 'where'.
167 void splice(iterator where, MachineBasicBlock *Other, iterator From,
169 Insts.splice(where, Other->Insts, From, To);
172 // Debugging methods.
174 void print(std::ostream &OS) const;
176 /// getNumber - MachineBasicBlocks are uniquely numbered at the function
177 /// level, unless they're not in a MachineFunction yet, in which case this
180 int getNumber() const { return Number; }
182 private: // Methods used to maintain doubly linked list of blocks...
183 friend struct ilist_traits<MachineBasicBlock>;
185 MachineBasicBlock *getPrev() const { return Prev; }
186 MachineBasicBlock *getNext() const { return Next; }
187 void setPrev(MachineBasicBlock *P) { Prev = P; }
188 void setNext(MachineBasicBlock *N) { Next = N; }
190 // Machine-CFG mutators
192 /// addPredecessor - Remove pred as a predecessor of this MachineBasicBlock.
193 /// Don't do this unless you know what you're doing, because it doesn't
194 /// update pred's successors list. Use pred->addSuccessor instead.
196 void addPredecessor(MachineBasicBlock *pred);
198 /// removePredecessor - Remove pred as a predecessor of this
199 /// MachineBasicBlock. Don't do this unless you know what you're
200 /// doing, because it doesn't update pred's successors list. Use
201 /// pred->removeSuccessor instead.
203 void removePredecessor(MachineBasicBlock *pred);
208 //===--------------------------------------------------------------------===//
209 // GraphTraits specializations for machine basic block graphs (machine-CFGs)
210 //===--------------------------------------------------------------------===//
212 // Provide specializations of GraphTraits to be able to treat a
213 // MachineFunction as a graph of MachineBasicBlocks...
216 template <> struct GraphTraits<MachineBasicBlock *> {
217 typedef MachineBasicBlock NodeType;
218 typedef MachineBasicBlock::succ_iterator ChildIteratorType;
220 static NodeType *getEntryNode(MachineBasicBlock *BB) { return BB; }
221 static inline ChildIteratorType child_begin(NodeType *N) {
222 return N->succ_begin();
224 static inline ChildIteratorType child_end(NodeType *N) {
225 return N->succ_end();
229 template <> struct GraphTraits<const MachineBasicBlock *> {
230 typedef const MachineBasicBlock NodeType;
231 typedef MachineBasicBlock::const_succ_iterator ChildIteratorType;
233 static NodeType *getEntryNode(const MachineBasicBlock *BB) { return BB; }
234 static inline ChildIteratorType child_begin(NodeType *N) {
235 return N->succ_begin();
237 static inline ChildIteratorType child_end(NodeType *N) {
238 return N->succ_end();
242 // Provide specializations of GraphTraits to be able to treat a
243 // MachineFunction as a graph of MachineBasicBlocks... and to walk it
244 // in inverse order. Inverse order for a function is considered
245 // to be when traversing the predecessor edges of a MBB
246 // instead of the successor edges.
248 template <> struct GraphTraits<Inverse<MachineBasicBlock*> > {
249 typedef MachineBasicBlock NodeType;
250 typedef MachineBasicBlock::pred_iterator ChildIteratorType;
251 static NodeType *getEntryNode(Inverse<MachineBasicBlock *> G) {
254 static inline ChildIteratorType child_begin(NodeType *N) {
255 return N->pred_begin();
257 static inline ChildIteratorType child_end(NodeType *N) {
258 return N->pred_end();
262 template <> struct GraphTraits<Inverse<const MachineBasicBlock*> > {
263 typedef const MachineBasicBlock NodeType;
264 typedef MachineBasicBlock::const_pred_iterator ChildIteratorType;
265 static NodeType *getEntryNode(Inverse<const MachineBasicBlock*> G) {
268 static inline ChildIteratorType child_begin(NodeType *N) {
269 return N->pred_begin();
271 static inline ChildIteratorType child_end(NodeType *N) {
272 return N->pred_end();
276 } // End llvm namespace