MachineBasicBlock.h revision 17fb34bf8cd10a798c9206eeef3bff151b4d3688
1//===-- llvm/CodeGen/MachineBasicBlock.h ------------------------*- C++ -*-===// 2// 3// The LLVM Compiler Infrastructure 4// 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. 7// 8//===----------------------------------------------------------------------===// 9// 10// Collect the sequence of machine instructions for a basic block. 11// 12//===----------------------------------------------------------------------===// 13 14#ifndef LLVM_CODEGEN_MACHINEBASICBLOCK_H 15#define LLVM_CODEGEN_MACHINEBASICBLOCK_H 16 17#include "llvm/CodeGen/MachineInstr.h" 18#include "Support/GraphTraits.h" 19#include "Support/ilist" 20#include <iosfwd> 21 22namespace llvm { 23 class MachineFunction; 24 25// ilist_traits 26template <> 27class ilist_traits<MachineInstr> { 28 // this is only set by the MachineBasicBlock owning the ilist 29 friend class MachineBasicBlock; 30 MachineBasicBlock* parent; 31 32public: 33 ilist_traits<MachineInstr>() : parent(0) { } 34 35 static MachineInstr* getPrev(MachineInstr* N) { return N->prev; } 36 static MachineInstr* getNext(MachineInstr* N) { return N->next; } 37 38 static const MachineInstr* 39 getPrev(const MachineInstr* N) { return N->prev; } 40 41 static const MachineInstr* 42 getNext(const MachineInstr* N) { return N->next; } 43 44 static void setPrev(MachineInstr* N, MachineInstr* prev) { N->prev = prev; } 45 static void setNext(MachineInstr* N, MachineInstr* next) { N->next = next; } 46 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); 54}; 55 56class BasicBlock; 57 58class MachineBasicBlock { 59public: 60 typedef ilist<MachineInstr> Instructions; 61 Instructions Insts; 62 MachineBasicBlock *Prev, *Next; 63 const BasicBlock *BB; 64 std::vector<MachineBasicBlock *> Predecessors; 65 std::vector<MachineBasicBlock *> Successors; 66 int Number; 67 MachineFunction *Parent; 68 69public: 70 MachineBasicBlock(const BasicBlock *bb = 0) : Prev(0), Next(0), BB(bb), 71 Number(-1), Parent(0) { 72 Insts.parent = this; 73 } 74 75 ~MachineBasicBlock(); 76 77 /// getBasicBlock - Return the LLVM basic block that this instance 78 /// corresponded to originally. 79 /// 80 const BasicBlock *getBasicBlock() const { return BB; } 81 82 /// getParent - Return the MachineFunction containing this basic block. 83 /// 84 const MachineFunction *getParent() const { return Parent; } 85 MachineFunction *getParent() { return Parent; } 86 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; 91 92 unsigned size() const { return Insts.size(); } 93 bool empty() const { return Insts.empty(); } 94 95 MachineInstr& front() { return Insts.front(); } 96 MachineInstr& back() { return Insts.back(); } 97 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(); } 106 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; 112 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 succ_iterator succ_begin() { return Successors.begin (); } 119 const_succ_iterator succ_begin() const { return Successors.begin (); } 120 succ_iterator succ_end() { return Successors.end (); } 121 const_succ_iterator succ_end() const { return Successors.end (); } 122 unsigned succ_size() const { return Successors.size (); } 123 124 // Machine-CFG mutators 125 126 /// addSuccessor - Add succ as a successor of this MachineBasicBlock. 127 /// The Predecessors list of succ is automatically updated. 128 /// 129 void addSuccessor (MachineBasicBlock *succ) { 130 Successors.push_back (succ); 131 succ->addPredecessor (this); 132 } 133 134 /// removeSuccessor - Remove succ from the successors list of this 135 /// MachineBasicBlock. The Predecessors list of succ is automatically updated. 136 /// 137 void removeSuccessor (MachineBasicBlock *succ) { 138 succ->removePredecessor (this); 139 std::vector<MachineBasicBlock *>::iterator goner = 140 std::find (Successors.begin(), Successors.end (), succ); 141 Successors.erase (goner); 142 } 143 144 /// getFirstTerminator - returns an iterator to the first terminator 145 /// instruction of this basic block. If a terminator does not exist, 146 /// it returns end() 147 iterator getFirstTerminator(); 148 149 void push_back(MachineInstr *MI) { Insts.push_back(MI); } 150 template<typename IT> 151 void insert(iterator I, IT S, IT E) { Insts.insert(I, S, E); } 152 iterator insert(iterator I, MachineInstr *M) { return Insts.insert(I, M); } 153 154 // erase - Remove the specified element or range from the instruction list. 155 // These functions delete any instructions removed. 156 // 157 iterator erase(iterator I) { return Insts.erase(I); } 158 iterator erase(iterator I, iterator E) { return Insts.erase(I, E); } 159 MachineInstr *remove(MachineInstr *I) { return Insts.remove(I); } 160 void clear() { Insts.clear(); } 161 162 // Debugging methods. 163 void dump() const; 164 void print(std::ostream &OS) const; 165 166 /// getNumber - MachineBasicBlocks are uniquely numbered at the function 167 /// level, unless they're not in a MachineFunction yet, in which case this 168 /// will return -1. 169 /// 170 int getNumber() const { return Number; } 171 172private: // Methods used to maintain doubly linked list of blocks... 173 friend class ilist_traits<MachineBasicBlock>; 174 175 MachineBasicBlock *getPrev() const { return Prev; } 176 MachineBasicBlock *getNext() const { return Next; } 177 void setPrev(MachineBasicBlock *P) { Prev = P; } 178 void setNext(MachineBasicBlock *N) { Next = N; } 179 180 // Machine-CFG mutators 181 182 /// addPredecessor - Remove pred as a predecessor of this MachineBasicBlock. 183 /// Don't do this unless you know what you're doing, because it doesn't 184 /// update pred's successors list. Use pred->addSuccessor instead. 185 /// 186 void addPredecessor (MachineBasicBlock *pred) { 187 Predecessors.push_back (pred); 188 } 189 190 /// removePredecessor - Remove pred as a predecessor of this 191 /// MachineBasicBlock. Don't do this unless you know what you're 192 /// doing, because it doesn't update pred's successors list. Use 193 /// pred->removeSuccessor instead. 194 /// 195 void removePredecessor (MachineBasicBlock *pred) { 196 std::vector<MachineBasicBlock *>::iterator goner = 197 std::find (Predecessors.begin(), Predecessors.end (), pred); 198 Predecessors.erase (goner); 199 } 200}; 201 202 203//===--------------------------------------------------------------------===// 204// GraphTraits specializations for machine basic block graphs (machine-CFGs) 205//===--------------------------------------------------------------------===// 206 207// Provide specializations of GraphTraits to be able to treat a 208// MachineFunction as a graph of MachineBasicBlocks... 209// 210 211template <> struct GraphTraits<MachineBasicBlock *> { 212 typedef MachineBasicBlock NodeType; 213 typedef MachineBasicBlock::succ_iterator ChildIteratorType; 214 215 static NodeType *getEntryNode(MachineBasicBlock *BB) { return BB; } 216 static inline ChildIteratorType child_begin(NodeType *N) { 217 return N->succ_begin(); 218 } 219 static inline ChildIteratorType child_end(NodeType *N) { 220 return N->succ_end(); 221 } 222}; 223 224template <> struct GraphTraits<const MachineBasicBlock *> { 225 typedef const MachineBasicBlock NodeType; 226 typedef MachineBasicBlock::const_succ_iterator ChildIteratorType; 227 228 static NodeType *getEntryNode(const MachineBasicBlock *BB) { return BB; } 229 static inline ChildIteratorType child_begin(NodeType *N) { 230 return N->succ_begin(); 231 } 232 static inline ChildIteratorType child_end(NodeType *N) { 233 return N->succ_end(); 234 } 235}; 236 237// Provide specializations of GraphTraits to be able to treat a 238// MachineFunction as a graph of MachineBasicBlocks... and to walk it 239// in inverse order. Inverse order for a function is considered 240// to be when traversing the predecessor edges of a MBB 241// instead of the successor edges. 242// 243template <> struct GraphTraits<Inverse<MachineBasicBlock*> > { 244 typedef MachineBasicBlock NodeType; 245 typedef MachineBasicBlock::pred_iterator ChildIteratorType; 246 static NodeType *getEntryNode(Inverse<MachineBasicBlock *> G) { 247 return G.Graph; 248 } 249 static inline ChildIteratorType child_begin(NodeType *N) { 250 return N->pred_begin(); 251 } 252 static inline ChildIteratorType child_end(NodeType *N) { 253 return N->pred_end(); 254 } 255}; 256 257template <> struct GraphTraits<Inverse<const MachineBasicBlock*> > { 258 typedef const MachineBasicBlock NodeType; 259 typedef MachineBasicBlock::const_pred_iterator ChildIteratorType; 260 static NodeType *getEntryNode(Inverse<const MachineBasicBlock*> G) { 261 return G.Graph; 262 } 263 static inline ChildIteratorType child_begin(NodeType *N) { 264 return N->pred_begin(); 265 } 266 static inline ChildIteratorType child_end(NodeType *N) { 267 return N->pred_end(); 268 } 269}; 270 271} // End llvm namespace 272 273#endif 274