//===-- llvm/CodeGen/MachineBasicBlock.h ------------------------*- C++ -*-===// // // Collect the sequence of machine instructions for a basic block. // //===----------------------------------------------------------------------===// #ifndef LLVM_CODEGEN_MACHINEBASICBLOCK_H #define LLVM_CODEGEN_MACHINEBASICBLOCK_H #include class BasicBlock; class MachineInstr; template struct ilist_traits; class MachineBasicBlock { std::vector Insts; MachineBasicBlock *Prev, *Next; BasicBlock *BB; public: MachineBasicBlock(BasicBlock *bb = 0) : Prev(0), Next(0), BB(bb) {} ~MachineBasicBlock() {} /// getBasicBlock - Return the LLVM basic block that this instance /// corresponded to originally. /// BasicBlock *getBasicBlock() const { return BB; } typedef std::vector::iterator iterator; typedef std::vector::const_iterator const_iterator; typedef std::reverse_iterator const_reverse_iterator; typedef std::reverse_iterator reverse_iterator; unsigned size() const { return Insts.size(); } bool empty() const { return Insts.empty(); } MachineInstr * operator[](unsigned i) const { return Insts[i]; } MachineInstr *&operator[](unsigned i) { return Insts[i]; } MachineInstr *front() const { return Insts.front(); } MachineInstr *back() const { return Insts.back(); } iterator begin() { return Insts.begin(); } const_iterator begin() const { return Insts.begin(); } iterator end() { return Insts.end(); } const_iterator end() const { return Insts.end(); } reverse_iterator rbegin() { return Insts.rbegin(); } const_reverse_iterator rbegin() const { return Insts.rbegin(); } reverse_iterator rend () { return Insts.rend(); } const_reverse_iterator rend () const { return Insts.rend(); } void push_back(MachineInstr *MI) { Insts.push_back(MI); } template void insert(iterator I, IT S, IT E) { Insts.insert(I, S, E); } iterator insert(iterator I, MachineInstr *M) { return Insts.insert(I, M); } // erase - Remove the specified element or range from the instruction list. // These functions do not delete any instructions removed. // iterator erase(iterator I) { return Insts.erase(I); } iterator erase(iterator I, iterator E) { return Insts.erase(I, E); } MachineInstr *pop_back() { MachineInstr *R = back(); Insts.pop_back(); return R; } private: // Methods used to maintain doubly linked list of blocks... friend class ilist_traits; MachineBasicBlock *getPrev() const { return Prev; } MachineBasicBlock *getNext() const { return Next; } void setPrev(MachineBasicBlock *P) { Prev = P; } void setNext(MachineBasicBlock *N) { Next = N; } }; #endif