mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2025-02-28 09:31:03 +00:00
pull a simple method out of LICM into a new
Loop::hasLoopInvariantOperands method. Remove a useless and confusing Loop::isLoopInvariant(Instruction) method, which didn't do what you thought it did. No functionality change. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@113133 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
parent
03d1063d32
commit
adc799112d
@ -523,10 +523,9 @@ public:
|
||||
///
|
||||
bool isLoopInvariant(Value *V) const;
|
||||
|
||||
/// isLoopInvariant - Return true if the specified instruction is
|
||||
/// loop-invariant.
|
||||
///
|
||||
bool isLoopInvariant(Instruction *I) const;
|
||||
/// hasLoopInvariantOperands - Return true if all the operands of the
|
||||
/// specified instruction are loop invariant.
|
||||
bool hasLoopInvariantOperands(Instruction *I) const;
|
||||
|
||||
/// makeLoopInvariant - If the given value is an instruction inside of the
|
||||
/// loop and it can be hoisted, do so to make it trivially loop-invariant.
|
||||
|
@ -48,15 +48,18 @@ INITIALIZE_PASS(LoopInfo, "loops", "Natural Loop Information", true, true);
|
||||
///
|
||||
bool Loop::isLoopInvariant(Value *V) const {
|
||||
if (Instruction *I = dyn_cast<Instruction>(V))
|
||||
return isLoopInvariant(I);
|
||||
return !contains(I);
|
||||
return true; // All non-instructions are loop invariant
|
||||
}
|
||||
|
||||
/// isLoopInvariant - Return true if the specified instruction is
|
||||
/// loop-invariant.
|
||||
///
|
||||
bool Loop::isLoopInvariant(Instruction *I) const {
|
||||
return !contains(I);
|
||||
/// hasLoopInvariantOperands - Return true if all the operands of the
|
||||
/// specified instruction are loop invariant.
|
||||
bool Loop::hasLoopInvariantOperands(Instruction *I) const {
|
||||
for (unsigned i = 0, e = I->getNumOperands(); i != e; ++i)
|
||||
if (!isLoopInvariant(I->getOperand(i)))
|
||||
return false;
|
||||
|
||||
return true;
|
||||
}
|
||||
|
||||
/// makeLoopInvariant - If the given value is an instruciton inside of the
|
||||
@ -105,6 +108,7 @@ bool Loop::makeLoopInvariant(Instruction *I, bool &Changed,
|
||||
for (unsigned i = 0, e = I->getNumOperands(); i != e; ++i)
|
||||
if (!makeLoopInvariant(I->getOperand(i), Changed, InsertPt))
|
||||
return false;
|
||||
|
||||
// Hoist.
|
||||
I->moveBefore(InsertPt);
|
||||
Changed = true;
|
||||
|
@ -193,7 +193,6 @@ namespace {
|
||||
}
|
||||
|
||||
bool canSinkOrHoistInst(Instruction &I);
|
||||
bool isLoopInvariantInst(Instruction &I);
|
||||
bool isNotUsedInLoop(Instruction &I);
|
||||
|
||||
void PromoteAliasSet(AliasSet &AS);
|
||||
@ -369,7 +368,7 @@ void LICM::HoistRegion(DomTreeNode *N) {
|
||||
// if all of the operands of the instruction are loop invariant and if it
|
||||
// is safe to hoist the instruction.
|
||||
//
|
||||
if (isLoopInvariantInst(I) && canSinkOrHoistInst(I) &&
|
||||
if (CurLoop->hasLoopInvariantOperands(&I) && canSinkOrHoistInst(I) &&
|
||||
isSafeToExecuteUnconditionally(I))
|
||||
hoist(I);
|
||||
}
|
||||
@ -452,20 +451,6 @@ bool LICM::isNotUsedInLoop(Instruction &I) {
|
||||
}
|
||||
|
||||
|
||||
/// isLoopInvariantInst - Return true if all operands of this instruction are
|
||||
/// loop invariant. We also filter out non-hoistable instructions here just for
|
||||
/// efficiency.
|
||||
///
|
||||
bool LICM::isLoopInvariantInst(Instruction &I) {
|
||||
// The instruction is loop invariant if all of its operands are loop-invariant
|
||||
for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i)
|
||||
if (!CurLoop->isLoopInvariant(I.getOperand(i)))
|
||||
return false;
|
||||
|
||||
// If we got this far, the instruction is loop invariant!
|
||||
return true;
|
||||
}
|
||||
|
||||
/// sink - When an instruction is found to only be used outside of the loop,
|
||||
/// this function moves it to the exit blocks and patches up SSA form as needed.
|
||||
/// This method is guaranteed to remove the original instruction from its
|
||||
|
Loading…
x
Reference in New Issue
Block a user