1 //===-- RegisterClassInfo.cpp - Dynamic Register Class Info ---------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file implements the RegisterClassInfo class which provides dynamic
11 // information about target register classes. Callee saved and reserved
12 // registers depends on calling conventions and other dynamic information, so
13 // some things cannot be determined statically.
15 //===----------------------------------------------------------------------===//
17 #define DEBUG_TYPE "regalloc"
18 #include "llvm/CodeGen/RegisterClassInfo.h"
19 #include "llvm/CodeGen/MachineFunction.h"
20 #include "llvm/CodeGen/MachineRegisterInfo.h"
21 #include "llvm/Support/CommandLine.h"
22 #include "llvm/Support/Debug.h"
23 #include "llvm/Support/raw_ostream.h"
24 #include "llvm/Target/TargetMachine.h"
28 static cl::opt<unsigned>
29 StressRA("stress-regalloc", cl::Hidden, cl::init(0), cl::value_desc("N"),
30 cl::desc("Limit all regclasses to N registers"));
32 RegisterClassInfo::RegisterClassInfo() : Tag(0), MF(0), TRI(0), CalleeSaved(0)
35 void RegisterClassInfo::runOnMachineFunction(const MachineFunction &mf) {
39 // Allocate new array the first time we see a new target.
40 if (MF->getTarget().getRegisterInfo() != TRI) {
41 TRI = MF->getTarget().getRegisterInfo();
42 RegClass.reset(new RCInfo[TRI->getNumRegClasses()]);
46 // Does this MF have different CSRs?
47 const MCPhysReg *CSR = TRI->getCalleeSavedRegs(MF);
48 if (Update || CSR != CalleeSaved) {
49 // Build a CSRNum map. Every CSR alias gets an entry pointing to the last
52 CSRNum.resize(TRI->getNumRegs(), 0);
53 for (unsigned N = 0; unsigned Reg = CSR[N]; ++N)
54 for (MCRegAliasIterator AI(Reg, TRI, true); AI.isValid(); ++AI)
55 CSRNum[*AI] = N + 1; // 0 means no CSR, 1 means CalleeSaved[0], ...
60 // Different reserved registers?
61 const BitVector &RR = MF->getRegInfo().getReservedRegs();
62 if (Reserved.size() != RR.size() || RR != Reserved) {
67 // Invalidate cached information from previous function.
72 /// compute - Compute the preferred allocation order for RC with reserved
73 /// registers filtered out. Volatile registers come first followed by CSR
74 /// aliases ordered according to the CSR order specified by the target.
75 void RegisterClassInfo::compute(const TargetRegisterClass *RC) const {
76 RCInfo &RCI = RegClass[RC->getID()];
78 // Raw register count, including all reserved regs.
79 unsigned NumRegs = RC->getNumRegs();
82 RCI.Order.reset(new MCPhysReg[NumRegs]);
85 SmallVector<MCPhysReg, 16> CSRAlias;
87 // FIXME: Once targets reserve registers instead of removing them from the
88 // allocation order, we can simply use begin/end here.
89 ArrayRef<MCPhysReg> RawOrder = RC->getRawAllocationOrder(*MF);
90 for (unsigned i = 0; i != RawOrder.size(); ++i) {
91 unsigned PhysReg = RawOrder[i];
92 // Remove reserved registers from the allocation order.
93 if (Reserved.test(PhysReg))
96 // PhysReg aliases a CSR, save it for later.
97 CSRAlias.push_back(PhysReg);
99 RCI.Order[N++] = PhysReg;
101 RCI.NumRegs = N + CSRAlias.size();
102 assert (RCI.NumRegs <= NumRegs && "Allocation order larger than regclass");
104 // CSR aliases go after the volatile registers, preserve the target's order.
105 std::copy(CSRAlias.begin(), CSRAlias.end(), &RCI.Order[N]);
107 // Register allocator stress test. Clip register class to N registers.
108 if (StressRA && RCI.NumRegs > StressRA)
109 RCI.NumRegs = StressRA;
111 // Check if RC is a proper sub-class.
112 if (const TargetRegisterClass *Super = TRI->getLargestLegalSuperClass(RC))
113 if (Super != RC && getNumAllocatableRegs(Super) > RCI.NumRegs)
114 RCI.ProperSubClass = true;
117 dbgs() << "AllocationOrder(" << RC->getName() << ") = [";
118 for (unsigned I = 0; I != RCI.NumRegs; ++I)
119 dbgs() << ' ' << PrintReg(RCI.Order[I], TRI);
120 dbgs() << (RCI.ProperSubClass ? " ] (sub-class)\n" : " ]\n");
123 // RCI is now up-to-date.