X-Git-Url: http://demsky.eecs.uci.edu/git/?a=blobdiff_plain;f=lib%2FCodeGen%2FAllocationOrder.h;h=2aee3a63a2b1e5498d983318f3401e5b91e59871;hb=00552e3875ee5f382db6c98286a241a7d0efe1b8;hp=862a3ee1923fde00570da34c2b3a886d2b84ec35;hpb=39b5c0c049a19c7a7feffc9506da07923cc136e4;p=oota-llvm.git diff --git a/lib/CodeGen/AllocationOrder.h b/lib/CodeGen/AllocationOrder.h index 862a3ee1923..2aee3a63a2b 100644 --- a/lib/CodeGen/AllocationOrder.h +++ b/lib/CodeGen/AllocationOrder.h @@ -14,59 +14,74 @@ // //===----------------------------------------------------------------------===// -#ifndef LLVM_CODEGEN_ALLOCATIONORDER_H -#define LLVM_CODEGEN_ALLOCATIONORDER_H +#ifndef LLVM_LIB_CODEGEN_ALLOCATIONORDER_H +#define LLVM_LIB_CODEGEN_ALLOCATIONORDER_H +#include "llvm/ADT/ArrayRef.h" #include "llvm/MC/MCRegisterInfo.h" namespace llvm { class RegisterClassInfo; class VirtRegMap; +class LiveRegMatrix; -class AllocationOrder { - const MCPhysReg *Begin; - const MCPhysReg *End; - const MCPhysReg *Pos; - const RegisterClassInfo &RCI; - unsigned Hint; - bool OwnedBegin; -public: +class LLVM_LIBRARY_VISIBILITY AllocationOrder { + SmallVector Hints; + ArrayRef Order; + int Pos; - /// AllocationOrder - Create a new AllocationOrder for VirtReg. +public: + /// Create a new AllocationOrder for VirtReg. /// @param VirtReg Virtual register to allocate for. /// @param VRM Virtual register map for function. /// @param RegClassInfo Information about reserved and allocatable registers. AllocationOrder(unsigned VirtReg, const VirtRegMap &VRM, - const RegisterClassInfo &RegClassInfo); + const RegisterClassInfo &RegClassInfo, + const LiveRegMatrix *Matrix); - ~AllocationOrder(); + /// Get the allocation order without reordered hints. + ArrayRef getOrder() const { return Order; } - /// next - Return the next physical register in the allocation order, or 0. - /// It is safe to call next again after it returned 0. - /// It will keep returning 0 until rewind() is called. - unsigned next() { - // First take the hint. - if (!Pos) { - Pos = Begin; - if (Hint) - return Hint; - } - // Then look at the order from TRI. - while (Pos != End) { - unsigned Reg = *Pos++; - if (Reg != Hint) + /// Return the next physical register in the allocation order, or 0. + /// It is safe to call next() again after it returned 0, it will keep + /// returning 0 until rewind() is called. + unsigned next(unsigned Limit = 0) { + if (Pos < 0) + return Hints.end()[Pos++]; + if (!Limit) + Limit = Order.size(); + while (Pos < int(Limit)) { + unsigned Reg = Order[Pos++]; + if (!isHint(Reg)) return Reg; } return 0; } - /// rewind - Start over from the beginning. - void rewind() { Pos = 0; } + /// As next(), but allow duplicates to be returned, and stop before the + /// Limit'th register in the RegisterClassInfo allocation order. + /// + /// This can produce more than Limit registers if there are hints. + unsigned nextWithDups(unsigned Limit) { + if (Pos < 0) + return Hints.end()[Pos++]; + if (Pos < int(Limit)) + return Order[Pos++]; + return 0; + } + + /// Start over from the beginning. + void rewind() { Pos = -int(Hints.size()); } - /// isHint - Return true if PhysReg is a preferred register. - bool isHint(unsigned PhysReg) const { return PhysReg == Hint; } + /// Return true if the last register returned from next() was a preferred register. + bool isHint() const { return Pos <= 0; } + + /// Return true if PhysReg is a preferred register. + bool isHint(unsigned PhysReg) const { + return std::find(Hints.begin(), Hints.end(), PhysReg) != Hints.end(); + } }; } // end namespace llvm