X-Git-Url: http://plrg.eecs.uci.edu/git/?a=blobdiff_plain;f=lib%2FCodeGen%2FAllocationOrder.h;h=2aee3a63a2b1e5498d983318f3401e5b91e59871;hb=f606a6ed992d5e4e2877419b51e2a9b540b5e3f0;hp=61fd8f881a8c735de7f80c7bc2357583e4a7ec13;hpb=57f1e2cee06f9b57995727d786aeb1031c5376bd;p=oota-llvm.git diff --git a/lib/CodeGen/AllocationOrder.h b/lib/CodeGen/AllocationOrder.h index 61fd8f881a8..2aee3a63a2b 100644 --- a/lib/CodeGen/AllocationOrder.h +++ b/lib/CodeGen/AllocationOrder.h @@ -14,41 +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 BitVector; +class RegisterClassInfo; class VirtRegMap; +class LiveRegMatrix; -class AllocationOrder { - const unsigned *Begin; - const unsigned *End; - const unsigned *Pos; - const BitVector &Reserved; - unsigned Hint; -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 ReservedRegs Set of reserved registers as returned by - /// TargetRegisterInfo::getReservedRegs(). + /// @param RegClassInfo Information about reserved and allocatable registers. AllocationOrder(unsigned VirtReg, const VirtRegMap &VRM, - const BitVector &ReservedRegs); + const RegisterClassInfo &RegClassInfo, + const LiveRegMatrix *Matrix); + + /// Get the allocation order without reordered hints. + ArrayRef getOrder() const { return Order; } + + /// 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; + } + + /// 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; + } - /// 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(); + /// Start over from the beginning. + void rewind() { Pos = -int(Hints.size()); } - /// rewind - Start over from the beginning. - void rewind() { Pos = 0; } + /// Return true if the last register returned from next() was a preferred register. + bool isHint() const { return Pos <= 0; } - /// isHint - Return true if PhysReg is a preferred register. - bool isHint(unsigned PhysReg) const { return PhysReg == Hint; } + /// 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