MachineBasicBlock.h revision 3153b35a520f40954c2bded460e0b055f15727b9
1//===-- llvm/CodeGen/MachineBasicBlock.h ------------------------*- C++ -*-===// 2// 3// Collect the sequence of machine instructions for a basic block. 4// 5//===----------------------------------------------------------------------===// 6 7#ifndef LLVM_CODEGEN_MACHINEBASICBLOCK_H 8#define LLVM_CODEGEN_MACHINEBASICBLOCK_H 9 10#include <vector> 11class BasicBlock; 12class MachineInstr; 13template <typename T> struct ilist_traits; 14 15class MachineBasicBlock { 16 std::vector<MachineInstr*> Insts; 17 MachineBasicBlock *Prev, *Next; 18 BasicBlock *BB; 19public: 20 MachineBasicBlock(BasicBlock *bb = 0) : Prev(0), Next(0), BB(bb) {} 21 ~MachineBasicBlock() {} 22 23 /// getBasicBlock - Return the LLVM basic block that this instance 24 /// corresponded to originally. 25 /// 26 BasicBlock *getBasicBlock() const { return BB; } 27 28 typedef std::vector<MachineInstr*>::iterator iterator; 29 typedef std::vector<MachineInstr*>::const_iterator const_iterator; 30 typedef std::reverse_iterator<const_iterator> const_reverse_iterator; 31 typedef std::reverse_iterator<iterator> reverse_iterator; 32 33 unsigned size() const { return Insts.size(); } 34 bool empty() const { return Insts.empty(); } 35 36 MachineInstr * operator[](unsigned i) const { return Insts[i]; } 37 MachineInstr *&operator[](unsigned i) { return Insts[i]; } 38 39 MachineInstr *front() const { return Insts.front(); } 40 MachineInstr *back() const { return Insts.back(); } 41 42 iterator begin() { return Insts.begin(); } 43 const_iterator begin() const { return Insts.begin(); } 44 iterator end() { return Insts.end(); } 45 const_iterator end() const { return Insts.end(); } 46 reverse_iterator rbegin() { return Insts.rbegin(); } 47 const_reverse_iterator rbegin() const { return Insts.rbegin(); } 48 reverse_iterator rend () { return Insts.rend(); } 49 const_reverse_iterator rend () const { return Insts.rend(); } 50 51 void push_back(MachineInstr *MI) { Insts.push_back(MI); } 52 template<typename IT> 53 void insert(iterator I, IT S, IT E) { Insts.insert(I, S, E); } 54 iterator insert(iterator I, MachineInstr *M) { return Insts.insert(I, M); } 55 56 // erase - Remove the specified element or range from the instruction list. 57 // These functions do not delete any instructions removed. 58 // 59 iterator erase(iterator I) { return Insts.erase(I); } 60 iterator erase(iterator I, iterator E) { return Insts.erase(I, E); } 61 62 MachineInstr *pop_back() { 63 MachineInstr *R = back(); 64 Insts.pop_back(); 65 return R; 66 } 67 68private: // Methods used to maintain doubly linked list of blocks... 69 friend class ilist_traits<MachineBasicBlock>; 70 71 MachineBasicBlock *getPrev() const { return Prev; } 72 MachineBasicBlock *getNext() const { return Next; } 73 void setPrev(MachineBasicBlock *P) { Prev = P; } 74 void setNext(MachineBasicBlock *N) { Next = N; } 75}; 76 77 78#endif 79