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;
69 MachineBasicBlock(const BasicBlock *bb = 0) : Prev(0), Next(0), BB(bb),
73 ~MachineBasicBlock() {}
75 /// getBasicBlock - Return the LLVM basic block that this instance
76 /// corresponded to originally.
78 const BasicBlock *getBasicBlock() const { return BB; }
80 /// getParent - Return the MachineFunction containing this basic block.
82 const MachineFunction *getParent() const;
83 MachineFunction *getParent();
85 typedef ilist<MachineInstr>::iterator iterator;
86 typedef ilist<MachineInstr>::const_iterator const_iterator;
87 typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
88 typedef std::reverse_iterator<iterator> reverse_iterator;
90 unsigned size() const { return Insts.size(); }
91 bool empty() const { return Insts.empty(); }
93 MachineInstr& front() { return Insts.front(); }
94 MachineInstr& back() { return Insts.back(); }
96 iterator begin() { return Insts.begin(); }
97 const_iterator begin() const { return Insts.begin(); }
98 iterator end() { return Insts.end(); }
99 const_iterator end() const { return Insts.end(); }
100 reverse_iterator rbegin() { return Insts.rbegin(); }
101 const_reverse_iterator rbegin() const { return Insts.rbegin(); }
102 reverse_iterator rend () { return Insts.rend(); }
103 const_reverse_iterator rend () const { return Insts.rend(); }
105 // Machine-CFG iterators
106 typedef std::vector<MachineBasicBlock *>::iterator pred_iterator;
107 typedef std::vector<MachineBasicBlock *>::const_iterator const_pred_iterator;
108 typedef std::vector<MachineBasicBlock *>::iterator succ_iterator;
109 typedef std::vector<MachineBasicBlock *>::const_iterator const_succ_iterator;
111 pred_iterator pred_begin() { return Predecessors.begin (); }
112 const_pred_iterator pred_begin() const { return Predecessors.begin (); }
113 pred_iterator pred_end() { return Predecessors.end (); }
114 const_pred_iterator pred_end() const { return Predecessors.end (); }
115 unsigned pred_size() const { return Predecessors.size (); }
116 succ_iterator succ_begin() { return Successors.begin (); }
117 const_succ_iterator succ_begin() const { return Successors.begin (); }
118 succ_iterator succ_end() { return Successors.end (); }
119 const_succ_iterator succ_end() const { return Successors.end (); }
120 unsigned succ_size() const { return Successors.size (); }
122 // Machine-CFG mutators
124 /// addSuccessor - Add succ as a successor of this MachineBasicBlock.
125 /// The Predecessors list of succ is automatically updated.
127 void addSuccessor (MachineBasicBlock *succ) {
128 Successors.push_back (succ);
129 succ->addPredecessor (this);
132 /// removeSuccessor - Remove succ from the successors list of this
133 /// MachineBasicBlock. The Predecessors list of succ is automatically updated.
135 void removeSuccessor (MachineBasicBlock *succ) {
136 succ->removePredecessor (this);
137 std::vector<MachineBasicBlock *>::iterator goner =
138 std::find (Successors.begin(), Successors.end (), succ);
139 Successors.erase (goner);
142 /// getFirstTerminator - returns an iterator to the first terminator
143 /// instruction of this basic block. If a terminator does not exist,
145 iterator getFirstTerminator();
147 void push_back(MachineInstr *MI) { Insts.push_back(MI); }
148 template<typename IT>
149 void insert(iterator I, IT S, IT E) { Insts.insert(I, S, E); }
150 iterator insert(iterator I, MachineInstr *M) { return Insts.insert(I, M); }
152 // erase - Remove the specified element or range from the instruction list.
153 // These functions delete any instructions removed.
155 iterator erase(iterator I) { return Insts.erase(I); }
156 iterator erase(iterator I, iterator E) { return Insts.erase(I, E); }
157 MachineInstr *remove(MachineInstr *I) { return Insts.remove(I); }
158 void clear() { Insts.clear(); }
160 // Debugging methods.
162 void print(std::ostream &OS) const;
164 /// getNumber - MachineBasicBlocks are uniquely numbered at the function
165 /// level, unless they're not in a MachineFunction yet, in which case this
168 int getNumber() const { return Number; }
170 private: // Methods used to maintain doubly linked list of blocks...
171 friend class ilist_traits<MachineBasicBlock>;
173 MachineBasicBlock *getPrev() const { return Prev; }
174 MachineBasicBlock *getNext() const { return Next; }
175 void setPrev(MachineBasicBlock *P) { Prev = P; }
176 void setNext(MachineBasicBlock *N) { Next = N; }
178 // Machine-CFG mutators
180 /// addPredecessor - Remove pred as a predecessor of this MachineBasicBlock.
181 /// Don't do this unless you know what you're doing, because it doesn't
182 /// update pred's successors list. Use pred->addSuccessor instead.
184 void addPredecessor (MachineBasicBlock *pred) {
185 Predecessors.push_back (pred);
188 /// removePredecessor - Remove pred as a predecessor of this
189 /// MachineBasicBlock. Don't do this unless you know what you're
190 /// doing, because it doesn't update pred's successors list. Use
191 /// pred->removeSuccessor instead.
193 void removePredecessor (MachineBasicBlock *pred) {
194 std::vector<MachineBasicBlock *>::iterator goner =
195 std::find (Predecessors.begin(), Predecessors.end (), pred);
196 Predecessors.erase (goner);
201 //===--------------------------------------------------------------------===//
202 // GraphTraits specializations for machine basic block graphs (machine-CFGs)
203 //===--------------------------------------------------------------------===//
205 // Provide specializations of GraphTraits to be able to treat a
206 // MachineFunction as a graph of MachineBasicBlocks...
209 template <> struct GraphTraits<MachineBasicBlock *> {
210 typedef MachineBasicBlock NodeType;
211 typedef MachineBasicBlock::succ_iterator ChildIteratorType;
213 static NodeType *getEntryNode(MachineBasicBlock *BB) { return BB; }
214 static inline ChildIteratorType child_begin(NodeType *N) {
215 return N->succ_begin();
217 static inline ChildIteratorType child_end(NodeType *N) {
218 return N->succ_end();
222 template <> struct GraphTraits<const MachineBasicBlock *> {
223 typedef const MachineBasicBlock NodeType;
224 typedef MachineBasicBlock::const_succ_iterator ChildIteratorType;
226 static NodeType *getEntryNode(const MachineBasicBlock *BB) { return BB; }
227 static inline ChildIteratorType child_begin(NodeType *N) {
228 return N->succ_begin();
230 static inline ChildIteratorType child_end(NodeType *N) {
231 return N->succ_end();
235 // Provide specializations of GraphTraits to be able to treat a
236 // MachineFunction as a graph of MachineBasicBlocks... and to walk it
237 // in inverse order. Inverse order for a function is considered
238 // to be when traversing the predecessor edges of a MBB
239 // instead of the successor edges.
241 template <> struct GraphTraits<Inverse<MachineBasicBlock*> > {
242 typedef MachineBasicBlock NodeType;
243 typedef MachineBasicBlock::pred_iterator ChildIteratorType;
244 static NodeType *getEntryNode(Inverse<MachineBasicBlock *> G) {
247 static inline ChildIteratorType child_begin(NodeType *N) {
248 return N->pred_begin();
250 static inline ChildIteratorType child_end(NodeType *N) {
251 return N->pred_end();
255 template <> struct GraphTraits<Inverse<const MachineBasicBlock*> > {
256 typedef const MachineBasicBlock NodeType;
257 typedef MachineBasicBlock::const_pred_iterator ChildIteratorType;
258 static NodeType *getEntryNode(Inverse<const MachineBasicBlock*> G) {
261 static inline ChildIteratorType child_begin(NodeType *N) {
262 return N->pred_begin();
264 static inline ChildIteratorType child_end(NodeType *N) {
265 return N->pred_end();
269 } // End llvm namespace