mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2025-02-08 21:32:39 +00:00
Use the new TRI->getLargestLegalSuperClass hook to constrain register class inflation.
This has two effects: 1. We never inflate to a larger register class than what the sub-target can handle. 2. Completely unconstrained virtual registers get the largest possible register class. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@130229 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
parent
c9e5015dec
commit
1394e6d925
@ -40,14 +40,14 @@ namespace llvm {
|
||||
/// VirtRegAuxInfo - Calculate auxiliary information for a virtual
|
||||
/// register such as its spill weight and allocation hint.
|
||||
class VirtRegAuxInfo {
|
||||
MachineFunction &mf_;
|
||||
LiveIntervals &lis_;
|
||||
const MachineLoopInfo &loops_;
|
||||
DenseMap<unsigned, float> hint_;
|
||||
MachineFunction &MF;
|
||||
LiveIntervals &LIS;
|
||||
const MachineLoopInfo &Loops;
|
||||
DenseMap<unsigned, float> Hint;
|
||||
public:
|
||||
VirtRegAuxInfo(MachineFunction &mf, LiveIntervals &lis,
|
||||
const MachineLoopInfo &loops) :
|
||||
mf_(mf), lis_(lis), loops_(loops) {}
|
||||
MF(mf), LIS(lis), Loops(loops) {}
|
||||
|
||||
/// CalculateRegClass - recompute the register class for reg from its uses.
|
||||
/// Since the register class can affect the allocation hint, this function
|
||||
|
@ -87,8 +87,8 @@ static unsigned copyHint(const MachineInstr *mi, unsigned reg,
|
||||
}
|
||||
|
||||
void VirtRegAuxInfo::CalculateWeightAndHint(LiveInterval &li) {
|
||||
MachineRegisterInfo &mri = mf_.getRegInfo();
|
||||
const TargetRegisterInfo &tri = *mf_.getTarget().getRegisterInfo();
|
||||
MachineRegisterInfo &mri = MF.getRegInfo();
|
||||
const TargetRegisterInfo &tri = *MF.getTarget().getRegisterInfo();
|
||||
MachineBasicBlock *mbb = 0;
|
||||
MachineLoop *loop = 0;
|
||||
unsigned loopDepth = 0;
|
||||
@ -118,7 +118,7 @@ void VirtRegAuxInfo::CalculateWeightAndHint(LiveInterval &li) {
|
||||
// Get loop info for mi.
|
||||
if (mi->getParent() != mbb) {
|
||||
mbb = mi->getParent();
|
||||
loop = loops_.getLoopFor(mbb);
|
||||
loop = Loops.getLoopFor(mbb);
|
||||
loopDepth = loop ? loop->getLoopDepth() : 0;
|
||||
isExiting = loop ? loop->isLoopExiting(mbb) : false;
|
||||
}
|
||||
@ -129,7 +129,7 @@ void VirtRegAuxInfo::CalculateWeightAndHint(LiveInterval &li) {
|
||||
weight = LiveIntervals::getSpillWeight(writes, reads, loopDepth);
|
||||
|
||||
// Give extra weight to what looks like a loop induction variable update.
|
||||
if (writes && isExiting && lis_.isLiveOutOfMBB(li, mbb))
|
||||
if (writes && isExiting && LIS.isLiveOutOfMBB(li, mbb))
|
||||
weight *= 3;
|
||||
|
||||
totalWeight += weight;
|
||||
@ -141,9 +141,9 @@ void VirtRegAuxInfo::CalculateWeightAndHint(LiveInterval &li) {
|
||||
unsigned hint = copyHint(mi, li.reg, tri, mri);
|
||||
if (!hint)
|
||||
continue;
|
||||
float hweight = hint_[hint] += weight;
|
||||
float hweight = Hint[hint] += weight;
|
||||
if (TargetRegisterInfo::isPhysicalRegister(hint)) {
|
||||
if (hweight > bestPhys && lis_.isAllocatable(hint))
|
||||
if (hweight > bestPhys && LIS.isAllocatable(hint))
|
||||
bestPhys = hweight, hintPhys = hint;
|
||||
} else {
|
||||
if (hweight > bestVirt)
|
||||
@ -151,7 +151,7 @@ void VirtRegAuxInfo::CalculateWeightAndHint(LiveInterval &li) {
|
||||
}
|
||||
}
|
||||
|
||||
hint_.clear();
|
||||
Hint.clear();
|
||||
|
||||
// Always prefer the physreg hint.
|
||||
if (unsigned hint = hintPhys ? hintPhys : hintVirt) {
|
||||
@ -176,7 +176,7 @@ void VirtRegAuxInfo::CalculateWeightAndHint(LiveInterval &li) {
|
||||
// FIXME: this gets much more complicated once we support non-trivial
|
||||
// re-materialization.
|
||||
bool isLoad = false;
|
||||
if (lis_.isReMaterializable(li, 0, isLoad)) {
|
||||
if (LIS.isReMaterializable(li, 0, isLoad)) {
|
||||
if (isLoad)
|
||||
totalWeight *= 0.9F;
|
||||
else
|
||||
@ -187,50 +187,29 @@ void VirtRegAuxInfo::CalculateWeightAndHint(LiveInterval &li) {
|
||||
}
|
||||
|
||||
void VirtRegAuxInfo::CalculateRegClass(unsigned reg) {
|
||||
MachineRegisterInfo &mri = mf_.getRegInfo();
|
||||
const TargetRegisterInfo *tri = mf_.getTarget().getRegisterInfo();
|
||||
const TargetRegisterClass *orc = mri.getRegClass(reg);
|
||||
SmallPtrSet<const TargetRegisterClass*,8> rcs;
|
||||
MachineRegisterInfo &MRI = MF.getRegInfo();
|
||||
const TargetRegisterInfo *TRI = MF.getTarget().getRegisterInfo();
|
||||
const TargetRegisterClass *OldRC = MRI.getRegClass(reg);
|
||||
const TargetRegisterClass *NewRC = TRI->getLargestLegalSuperClass(OldRC);
|
||||
|
||||
for (MachineRegisterInfo::reg_nodbg_iterator I = mri.reg_nodbg_begin(reg),
|
||||
E = mri.reg_nodbg_end(); I != E; ++I) {
|
||||
// The targets don't have accurate enough regclass descriptions that we can
|
||||
// handle subregs. We need something similar to
|
||||
// TRI::getMatchingSuperRegClass, but returning a super class instead of a
|
||||
// sub class.
|
||||
if (I.getOperand().getSubReg()) {
|
||||
DEBUG(dbgs() << "Cannot handle subregs: " << I.getOperand() << '\n');
|
||||
// Stop early if there is no room to grow.
|
||||
if (NewRC == OldRC)
|
||||
return;
|
||||
|
||||
// Accumulate constraints from all uses.
|
||||
for (MachineRegisterInfo::reg_nodbg_iterator I = MRI.reg_nodbg_begin(reg),
|
||||
E = MRI.reg_nodbg_end(); I != E; ++I) {
|
||||
// TRI doesn't have accurate enough information to model this yet.
|
||||
if (I.getOperand().getSubReg())
|
||||
return;
|
||||
const TargetRegisterClass *OpRC =
|
||||
I->getDesc().getRegClass(I.getOperandNo(), TRI);
|
||||
if (OpRC)
|
||||
NewRC = getCommonSubClass(NewRC, OpRC);
|
||||
if (!NewRC || NewRC == OldRC)
|
||||
return;
|
||||
}
|
||||
if (const TargetRegisterClass *rc =
|
||||
I->getDesc().getRegClass(I.getOperandNo(), tri))
|
||||
rcs.insert(rc);
|
||||
}
|
||||
|
||||
// If we found no regclass constraints, just leave reg as is.
|
||||
// In theory, we could inflate to the largest superclass of reg's existing
|
||||
// class, but that might not be legal for the current cpu setting.
|
||||
// This could happen if reg is only used by COPY instructions, so we may need
|
||||
// to improve on this.
|
||||
if (rcs.empty()) {
|
||||
return;
|
||||
}
|
||||
|
||||
// Compute the intersection of all classes in rcs.
|
||||
// This ought to be independent of iteration order, but if the target register
|
||||
// classes don't form a proper algebra, it is possible to get different
|
||||
// results. The solution is to make sure the intersection of any two register
|
||||
// classes is also a register class or the null set.
|
||||
const TargetRegisterClass *rc = 0;
|
||||
for (SmallPtrSet<const TargetRegisterClass*,8>::iterator I = rcs.begin(),
|
||||
E = rcs.end(); I != E; ++I) {
|
||||
rc = rc ? getCommonSubClass(rc, *I) : *I;
|
||||
assert(rc && "Incompatible regclass constraints found");
|
||||
}
|
||||
|
||||
if (rc == orc)
|
||||
return;
|
||||
DEBUG(dbgs() << "Inflating " << orc->getName() << ':' << PrintReg(reg)
|
||||
<< " to " << rc->getName() <<".\n");
|
||||
mri.setRegClass(reg, rc);
|
||||
DEBUG(dbgs() << "Inflating " << OldRC->getName() << ':' << PrintReg(reg)
|
||||
<< " to " << NewRC->getName() <<".\n");
|
||||
MRI.setRegClass(reg, NewRC);
|
||||
}
|
||||
|
Loading…
x
Reference in New Issue
Block a user