RPCS3/llvm
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm.git synced 2025-04-03 13:51:39 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Remember that the induction variable is always a PHINode and

Browse Source 
use getIncomingValueForBlock instead of
LoopInfo::getCanonicalInductionVariableIncrement.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@108865 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Dan Gohman 2010-07-20 17:18:52 +00:00
parent e8950977a5
commit 43ef3fbae1
1 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
lib/Transforms/Scalar/IndVarSimplify.cpp
View File

@ -102,7 +102,7 @@ namespace {
void RewriteNonIntegerIVs(Loop *L); void RewriteNonIntegerIVs(Loop *L);
ICmpInst *LinearFunctionTestReplace(Loop *L, const SCEV *BackedgeTakenCount, ICmpInst *LinearFunctionTestReplace(Loop *L, const SCEV *BackedgeTakenCount,
Value *IndVar, PHINode *IndVar,
BasicBlock *ExitingBlock, BasicBlock *ExitingBlock,
BranchInst *BI, BranchInst *BI,
SCEVExpander &Rewriter); SCEVExpander &Rewriter);
@ -131,7 +131,7 @@ Pass *llvm::createIndVarSimplifyPass() {
/// is actually a much broader range than just linear tests. /// is actually a much broader range than just linear tests.
ICmpInst *IndVarSimplify::LinearFunctionTestReplace(Loop *L, ICmpInst *IndVarSimplify::LinearFunctionTestReplace(Loop *L,
const SCEV *BackedgeTakenCount, const SCEV *BackedgeTakenCount,
Value *IndVar, PHINode *IndVar,
BasicBlock *ExitingBlock, BasicBlock *ExitingBlock,
BranchInst *BI, BranchInst *BI,
SCEVExpander &Rewriter) { SCEVExpander &Rewriter) {
@ -181,7 +181,7 @@ ICmpInst *IndVarSimplify::LinearFunctionTestReplace(Loop *L,
// The BackedgeTaken expression contains the number of times that the // The BackedgeTaken expression contains the number of times that the
// backedge branches to the loop header. This is one less than the // backedge branches to the loop header. This is one less than the
// number of times the loop executes, so use the incremented indvar. // number of times the loop executes, so use the incremented indvar.
CmpIndVar = L->getCanonicalInductionVariableIncrement(); CmpIndVar = IndVar->getIncomingValueForBlock(ExitingBlock);
} else { } else {
// We have to use the preincremented value... // We have to use the preincremented value...
RHS = SE->getTruncateOrZeroExtend(BackedgeTakenCount, RHS = SE->getTruncateOrZeroExtend(BackedgeTakenCount,
@ -534,7 +534,7 @@ bool IndVarSimplify::runOnLoop(Loop *L, LPPassManager &LPM) {
// Now that we know the largest of the induction variable expressions // Now that we know the largest of the induction variable expressions
// in this loop, insert a canonical induction variable of the largest size. // in this loop, insert a canonical induction variable of the largest size.
Value *IndVar = 0; PHINode *IndVar = 0;
if (NeedCannIV) { if (NeedCannIV) {
// Check to see if the loop already has any canonical-looking induction // Check to see if the loop already has any canonical-looking induction
// variables. If any are present and wider than the planned canonical // variables. If any are present and wider than the planned canonical