mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2025-02-07 14:33:15 +00:00
Postra machine licm must add registers defined by loop invariants to *all* of
the live-in sets of BBs in the loop. Otherwise later pass may end up using the registers and override the invariant. rdar://7852937 No reasonablly sized test case possible. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@101626 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
parent
5c21280d8e
commit
94d1d9c219
@ -109,7 +109,7 @@ namespace {
|
|||||||
|
|
||||||
/// HoistRegionPostRA - Walk the specified region of the CFG and hoist loop
|
/// HoistRegionPostRA - Walk the specified region of the CFG and hoist loop
|
||||||
/// invariants out to the preheader.
|
/// invariants out to the preheader.
|
||||||
void HoistRegionPostRA(MachineDomTreeNode *N);
|
void HoistRegionPostRA();
|
||||||
|
|
||||||
/// HoistPostRA - When an instruction is found to only use loop invariant
|
/// HoistPostRA - When an instruction is found to only use loop invariant
|
||||||
/// operands that is safe to hoist, this instruction is called to do the
|
/// operands that is safe to hoist, this instruction is called to do the
|
||||||
@ -122,10 +122,9 @@ namespace {
|
|||||||
SmallSet<int, 32> &StoredFIs,
|
SmallSet<int, 32> &StoredFIs,
|
||||||
SmallVector<CandidateInfo, 32> &Candidates);
|
SmallVector<CandidateInfo, 32> &Candidates);
|
||||||
|
|
||||||
/// AddToLiveIns - Add 'Reg' to the livein sets of BBs in the backedge path
|
/// AddToLiveIns - Add register 'Reg' to the livein sets of BBs in the
|
||||||
/// from MBB to LoopHeader (inclusive).
|
/// current loop.
|
||||||
void AddToLiveIns(unsigned Reg,
|
void AddToLiveIns(unsigned Reg);
|
||||||
MachineBasicBlock *MBB, MachineBasicBlock *LoopHeader);
|
|
||||||
|
|
||||||
/// IsLICMCandidate - Returns true if the instruction may be a suitable
|
/// IsLICMCandidate - Returns true if the instruction may be a suitable
|
||||||
/// candidate for LICM. e.g. If the instruction is a call, then it's obviously
|
/// candidate for LICM. e.g. If the instruction is a call, then it's obviously
|
||||||
@ -239,12 +238,12 @@ bool MachineLICM::runOnMachineFunction(MachineFunction &MF) {
|
|||||||
if (!CurPreheader)
|
if (!CurPreheader)
|
||||||
continue;
|
continue;
|
||||||
|
|
||||||
|
if (!PreRegAlloc)
|
||||||
|
HoistRegionPostRA();
|
||||||
|
else {
|
||||||
// CSEMap is initialized for loop header when the first instruction is
|
// CSEMap is initialized for loop header when the first instruction is
|
||||||
// being hoisted.
|
// being hoisted.
|
||||||
MachineDomTreeNode *N = DT->getNode(CurLoop->getHeader());
|
MachineDomTreeNode *N = DT->getNode(CurLoop->getHeader());
|
||||||
if (!PreRegAlloc)
|
|
||||||
HoistRegionPostRA(N);
|
|
||||||
else {
|
|
||||||
HoistRegion(N);
|
HoistRegion(N);
|
||||||
CSEMap.clear();
|
CSEMap.clear();
|
||||||
}
|
}
|
||||||
@ -349,9 +348,7 @@ void MachineLICM::ProcessMI(MachineInstr *MI,
|
|||||||
|
|
||||||
/// HoistRegionPostRA - Walk the specified region of the CFG and hoist loop
|
/// HoistRegionPostRA - Walk the specified region of the CFG and hoist loop
|
||||||
/// invariants out to the preheader.
|
/// invariants out to the preheader.
|
||||||
void MachineLICM::HoistRegionPostRA(MachineDomTreeNode *N) {
|
void MachineLICM::HoistRegionPostRA() {
|
||||||
assert(N != 0 && "Null dominator tree node?");
|
|
||||||
|
|
||||||
unsigned NumRegs = TRI->getNumRegs();
|
unsigned NumRegs = TRI->getNumRegs();
|
||||||
unsigned *PhysRegDefs = new unsigned[NumRegs];
|
unsigned *PhysRegDefs = new unsigned[NumRegs];
|
||||||
std::fill(PhysRegDefs, PhysRegDefs + NumRegs, 0);
|
std::fill(PhysRegDefs, PhysRegDefs + NumRegs, 0);
|
||||||
@ -360,15 +357,10 @@ void MachineLICM::HoistRegionPostRA(MachineDomTreeNode *N) {
|
|||||||
SmallSet<int, 32> StoredFIs;
|
SmallSet<int, 32> StoredFIs;
|
||||||
|
|
||||||
// Walk the entire region, count number of defs for each register, and
|
// Walk the entire region, count number of defs for each register, and
|
||||||
// return potential LICM candidates.
|
// collect potential LICM candidates.
|
||||||
SmallVector<MachineDomTreeNode*, 8> WorkList;
|
const std::vector<MachineBasicBlock*> Blocks = CurLoop->getBlocks();
|
||||||
WorkList.push_back(N);
|
for (unsigned i = 0, e = Blocks.size(); i != e; ++i) {
|
||||||
do {
|
MachineBasicBlock *BB = Blocks[i];
|
||||||
N = WorkList.pop_back_val();
|
|
||||||
MachineBasicBlock *BB = N->getBlock();
|
|
||||||
|
|
||||||
if (!CurLoop->contains(MLI->getLoopFor(BB)))
|
|
||||||
continue;
|
|
||||||
// Conservatively treat live-in's as an external def.
|
// Conservatively treat live-in's as an external def.
|
||||||
// FIXME: That means a reload that're reused in successor block(s) will not
|
// FIXME: That means a reload that're reused in successor block(s) will not
|
||||||
// be LICM'ed.
|
// be LICM'ed.
|
||||||
@ -385,11 +377,7 @@ void MachineLICM::HoistRegionPostRA(MachineDomTreeNode *N) {
|
|||||||
MachineInstr *MI = &*MII;
|
MachineInstr *MI = &*MII;
|
||||||
ProcessMI(MI, PhysRegDefs, StoredFIs, Candidates);
|
ProcessMI(MI, PhysRegDefs, StoredFIs, Candidates);
|
||||||
}
|
}
|
||||||
|
}
|
||||||
const std::vector<MachineDomTreeNode*> &Children = N->getChildren();
|
|
||||||
for (unsigned I = 0, E = Children.size(); I != E; ++I)
|
|
||||||
WorkList.push_back(Children[I]);
|
|
||||||
} while (!WorkList.empty());
|
|
||||||
|
|
||||||
// Now evaluate whether the potential candidates qualify.
|
// Now evaluate whether the potential candidates qualify.
|
||||||
// 1. Check if the candidate defined register is defined by another
|
// 1. Check if the candidate defined register is defined by another
|
||||||
@ -424,23 +412,11 @@ void MachineLICM::HoistRegionPostRA(MachineDomTreeNode *N) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
/// AddToLiveIns - Add register 'Reg' to the livein sets of BBs in the
|
/// AddToLiveIns - Add register 'Reg' to the livein sets of BBs in the
|
||||||
/// backedge path from MBB to LoopHeader.
|
/// current loop.
|
||||||
void MachineLICM::AddToLiveIns(unsigned Reg, MachineBasicBlock *MBB,
|
void MachineLICM::AddToLiveIns(unsigned Reg) {
|
||||||
MachineBasicBlock *LoopHeader) {
|
const std::vector<MachineBasicBlock*> Blocks = CurLoop->getBlocks();
|
||||||
SmallPtrSet<MachineBasicBlock*, 4> Visited;
|
for (unsigned i = 0, e = Blocks.size(); i != e; ++i)
|
||||||
SmallVector<MachineBasicBlock*, 4> WorkList;
|
Blocks[i]->addLiveIn(Reg);
|
||||||
WorkList.push_back(MBB);
|
|
||||||
do {
|
|
||||||
MBB = WorkList.pop_back_val();
|
|
||||||
if (!Visited.insert(MBB))
|
|
||||||
continue;
|
|
||||||
MBB->addLiveIn(Reg);
|
|
||||||
if (MBB == LoopHeader)
|
|
||||||
continue;
|
|
||||||
for (MachineBasicBlock::pred_iterator PI = MBB->pred_begin(),
|
|
||||||
E = MBB->pred_end(); PI != E; ++PI)
|
|
||||||
WorkList.push_back(*PI);
|
|
||||||
} while (!WorkList.empty());
|
|
||||||
}
|
}
|
||||||
|
|
||||||
/// HoistPostRA - When an instruction is found to only use loop invariant
|
/// HoistPostRA - When an instruction is found to only use loop invariant
|
||||||
@ -464,11 +440,10 @@ void MachineLICM::HoistPostRA(MachineInstr *MI, unsigned Def) {
|
|||||||
MachineBasicBlock *MBB = MI->getParent();
|
MachineBasicBlock *MBB = MI->getParent();
|
||||||
CurPreheader->splice(CurPreheader->getFirstTerminator(), MBB, MI);
|
CurPreheader->splice(CurPreheader->getFirstTerminator(), MBB, MI);
|
||||||
|
|
||||||
// Add register to livein list to BBs in the path from loop header to original
|
// Add register to livein list to all the BBs in the current loop since a
|
||||||
// BB. Note, currently it's not necessary to worry about adding it to all BB's
|
// loop invariant must be kept live throughout the whole loop. This is
|
||||||
// with uses. Reload that're reused in successor block(s) are not being
|
// important to ensure later passes do not scavenge the def register.
|
||||||
// hoisted.
|
AddToLiveIns(Def);
|
||||||
AddToLiveIns(Def, MBB, CurLoop->getHeader());
|
|
||||||
|
|
||||||
++NumPostRAHoisted;
|
++NumPostRAHoisted;
|
||||||
Changed = true;
|
Changed = true;
|
||||||
|
Loading…
x
Reference in New Issue
Block a user