mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-12-14 11:32:34 +00:00
Refactor the code for unfolding a load into a separate function.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@85515 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
parent
a33ac6a4c1
commit
5c95230f25
@ -105,6 +105,12 @@ namespace {
|
||||
///
|
||||
void HoistRegion(MachineDomTreeNode *N);
|
||||
|
||||
/// ExtractHoistableLoad - Unfold a load from the given machineinstr if
|
||||
/// the load itself could be hoisted. Return the unfolded and hoistable
|
||||
/// load, or null if the load couldn't be unfolded or if it wouldn't
|
||||
/// be hoistable.
|
||||
MachineInstr *ExtractHoistableLoad(MachineInstr *MI);
|
||||
|
||||
/// Hoist - When an instruction is found to only use loop invariant operands
|
||||
/// that is safe to hoist, this instruction is called to do the dirty work.
|
||||
///
|
||||
@ -369,35 +375,30 @@ static const MachineInstr *LookForDuplicate(const MachineInstr *MI,
|
||||
return 0;
|
||||
}
|
||||
|
||||
/// Hoist - When an instruction is found to use only loop invariant operands
|
||||
/// that are safe to hoist, this instruction is called to do the dirty work.
|
||||
///
|
||||
void MachineLICM::Hoist(MachineInstr *MI) {
|
||||
// First check whether we should hoist this instruction.
|
||||
if (!IsLoopInvariantInst(*MI) || !IsProfitableToHoist(*MI)) {
|
||||
MachineInstr *MachineLICM::ExtractHoistableLoad(MachineInstr *MI) {
|
||||
// If not, we may be able to unfold a load and hoist that.
|
||||
// First test whether the instruction is loading from an amenable
|
||||
// memory location.
|
||||
if (!MI->getDesc().mayLoad()) return;
|
||||
if (!MI->hasOneMemOperand()) return;
|
||||
if (!MI->getDesc().mayLoad()) return 0;
|
||||
if (!MI->hasOneMemOperand()) return 0;
|
||||
MachineMemOperand *MMO = *MI->memoperands_begin();
|
||||
if (MMO->isVolatile()) return;
|
||||
if (MMO->isVolatile()) return 0;
|
||||
MachineFunction &MF = *MI->getParent()->getParent();
|
||||
if (!MMO->getValue()) return;
|
||||
if (!MMO->getValue()) return 0;
|
||||
if (const PseudoSourceValue *PSV =
|
||||
dyn_cast<PseudoSourceValue>(MMO->getValue())) {
|
||||
if (!PSV->isConstant(MF.getFrameInfo())) return;
|
||||
if (!PSV->isConstant(MF.getFrameInfo())) return 0;
|
||||
} else {
|
||||
if (!AA->pointsToConstantMemory(MMO->getValue())) return;
|
||||
if (!AA->pointsToConstantMemory(MMO->getValue())) return 0;
|
||||
}
|
||||
// Next determine the register class for a temporary register.
|
||||
unsigned NewOpc =
|
||||
TII->getOpcodeAfterMemoryUnfold(MI->getOpcode(),
|
||||
/*UnfoldLoad=*/true,
|
||||
/*UnfoldStore=*/false);
|
||||
if (NewOpc == 0) return;
|
||||
if (NewOpc == 0) return 0;
|
||||
const TargetInstrDesc &TID = TII->get(NewOpc);
|
||||
if (TID.getNumDefs() != 1) return;
|
||||
if (TID.getNumDefs() != 1) return 0;
|
||||
const TargetRegisterClass *RC = TID.OpInfo[0].getRegClass(TRI);
|
||||
// Ok, we're unfolding. Create a temporary register and do the unfold.
|
||||
unsigned Reg = RegInfo->createVirtualRegister(RC);
|
||||
@ -420,11 +421,22 @@ void MachineLICM::Hoist(MachineInstr *MI) {
|
||||
if (!IsLoopInvariantInst(*NewMIs[0]) || !IsProfitableToHoist(*NewMIs[0])) {
|
||||
NewMIs[0]->eraseFromParent();
|
||||
NewMIs[1]->eraseFromParent();
|
||||
return;
|
||||
return 0;
|
||||
}
|
||||
// Otherwise we successfully unfolded a load that we can hoist.
|
||||
MI->eraseFromParent();
|
||||
MI = NewMIs[0];
|
||||
return NewMIs[0];
|
||||
}
|
||||
|
||||
/// Hoist - When an instruction is found to use only loop invariant operands
|
||||
/// that are safe to hoist, this instruction is called to do the dirty work.
|
||||
///
|
||||
void MachineLICM::Hoist(MachineInstr *MI) {
|
||||
// First check whether we should hoist this instruction.
|
||||
if (!IsLoopInvariantInst(*MI) || !IsProfitableToHoist(*MI)) {
|
||||
// If not, try unfolding a hoistable load.
|
||||
MI = ExtractHoistableLoad(MI);
|
||||
if (!MI) return;
|
||||
}
|
||||
|
||||
// Now move the instructions to the predecessor, inserting it before any
|
||||
|
Loading…
Reference in New Issue
Block a user