Searched refs:BackedgeTakenCount (Results 1 - 3 of 3) sorted by relevance
/external/llvm/lib/Transforms/Scalar/ |
H A D | IndVarSimplify.cpp | 116 Value *LinearFunctionTestReplace(Loop *L, const SCEV *BackedgeTakenCount, 1227 // BackedgeTakenCount. They may already exist in program code, and if not, 1262 const SCEV *BackedgeTakenCount = SE->getBackedgeTakenCount(L); local 1263 if (isa<SCEVCouldNotCompute>(BackedgeTakenCount) || 1264 BackedgeTakenCount->isZero()) 1276 if (isHighCostExpansion(BackedgeTakenCount, BI, Processed, SE)) 1613 const SCEV *BackedgeTakenCount, 1620 const SCEV *IVCount = BackedgeTakenCount; 1628 // truncated to BackedgeTakenCount->getType(). 1629 IVCount = SE->getAddExpr(BackedgeTakenCount, 1612 LinearFunctionTestReplace(Loop *L, const SCEV *BackedgeTakenCount, PHINode *IndVar, SCEVExpander &Rewriter) argument 1828 const SCEV *BackedgeTakenCount = SE->getBackedgeTakenCount(L); local [all...] |
H A D | LoopStrengthReduce.cpp | 1822 const SCEV *BackedgeTakenCount = SE.getBackedgeTakenCount(L); local 1823 if (isa<SCEVCouldNotCompute>(BackedgeTakenCount)) 2002 const SCEV *BackedgeTakenCount = SE.getBackedgeTakenCount(L); local 2003 if (isa<SCEVCouldNotCompute>(BackedgeTakenCount)) 2005 const SCEV *One = SE.getConstant(BackedgeTakenCount->getType(), 1); 2008 const SCEV *IterationCount = SE.getAddExpr(One, BackedgeTakenCount); 2016 if (const SCEVSMaxExpr *S = dyn_cast<SCEVSMaxExpr>(BackedgeTakenCount)) {
|
/external/llvm/lib/Analysis/ |
H A D | ScalarEvolution.cpp | 5378 const SCEV *BackedgeTakenCount = getBackedgeTakenCount(LI); 5380 dyn_cast<SCEVConstant>(BackedgeTakenCount)) { 5523 const SCEV *BackedgeTakenCount = getBackedgeTakenCount(AddRec->getLoop()); 5524 if (BackedgeTakenCount == getCouldNotCompute()) return AddRec; 5527 return AddRec->evaluateAtIteration(BackedgeTakenCount, *this);
|
Completed in 125 milliseconds