Searched refs:getNegativeSCEV (Results 1 – 11 of 11) sorted by relevance
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| H A D | LoopCacheAnalysis.cpp | 100 StepRec = SE.getNegativeSCEV(StepRec); in isOneDimensionalArray() 298 Stride = SE.getNegativeSCEV(Stride); in computeRefCost() 374 SE.getNegativeSCEV(StepRec), in delinearize() 424 Stride = SE.isKnownNegative(Stride) ? SE.getNegativeSCEV(Stride) : Stride; in isConsecutive()
|
| H A D | DependenceAnalysis.cpp | 364 return SE->getNegativeSCEV(C); in getD() 396 B = SE->getNegativeSCEV(A); in setDistance() 397 C = SE->getNegativeSCEV(D); in setDistance() 1169 SE->isKnownNonNegative(Delta) ? Delta : SE->getNegativeSCEV(Delta); in strongSIVtest() 1171 SE->isKnownNonNegative(Coeff) ? Coeff : SE->getNegativeSCEV(Coeff); in strongSIVtest() 1223 SE->getNegativeSCEV(Coeff), in strongSIVtest() 1224 SE->getNegativeSCEV(Delta), CurLoop); in strongSIVtest() 1313 ConstCoeff = dyn_cast<SCEVConstant>(SE->getNegativeSCEV(ConstCoeff)); in weakCrossingSIVtest() 1316 Delta = SE->getNegativeSCEV(Delta); in weakCrossingSIVtest() 1497 NewConstraint.setLine(SrcCoeff, SE->getNegativeSCEV(DstCoeff), Delta, in exactSIVtest() [all …]
|
| H A D | ScalarEvolution.cpp | 3516 return getSMaxExpr(Op, getNegativeSCEV(Op, Flags)); in getAbsExpr() 3940 const SCEV *ScalarEvolution::getNegativeSCEV(const SCEV *V, in getNegativeSCEV() function in ScalarEvolution 4030 return getAddExpr(LHS, getNegativeSCEV(RHS, NegFlags), AddFlags, Depth); in getMinusSCEV() 6164 const SCEV *StepAbs = getUMinExpr(Step, getNegativeSCEV(Step)); in getRangeForAffineNoSelfWrappingAR() 6550 AddOps.push_back(getNegativeSCEV(getSCEV(BO->RHS))); in createSCEV() 9226 const SCEV *Distance = CountDown ? Start : getNegativeSCEV(Start); in howFarToZero() 9264 getUDivExpr(Distance, CountDown ? getNegativeSCEV(Step) : Step); in howFarToZero() 9279 getNegativeSCEV(Start), *this); in howFarToZero() 9833 auto *MinusOne = getNegativeSCEV(One); in getLoopInvariantExitCondDuringFirstIterations() 11457 const SCEV *Stride = getNegativeSCEV(IV->getStepRecurrence(*this)); in howManyGreaterThans() [all …]
|
| H A D | LoopAccessAnalysis.cpp | 1408 const SCEV *NegDist = SE.getNegativeSCEV(CastedDist); in isSafeDependenceDistance()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/ARM/ |
| H A D | MVETailPredication.cpp | 299 SE->getNegativeSCEV(VW)), in IsSafeActiveMask()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/PowerPC/ |
| H A D | PPCLoopInstrFormPrep.cpp | 438 E.Offset = cast<SCEVConstant>(SE->getNegativeSCEV(Offset)); in prepareBaseForDispFormChain() 483 E.Offset = cast<SCEVConstant>(SE->getNegativeSCEV(Offset)); in prepareBaseForUpdateFormChain()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/ |
| H A D | ScalarEvolutionExpander.cpp | 784 Value *W = expandCodeForImpl(SE.getNegativeSCEV(Op), Ty, false); in visitAddExpr() 1159 SE.getNegativeSCEV(Requested)) == Phi) { in canBeCheaplyTransformed() 1334 Step = SE.getNegativeSCEV(Step); in getAddRecExprPHILiterally() 1488 Step = SE.getNegativeSCEV(Step); in expandAddRecExprLiterally() 2515 expandCodeForImpl(SE.getNegativeSCEV(Step), Ty, Loc, false); in generateOverflowCheck() 2545 const SCEV *NegMulS = SE.getNegativeSCEV(MulS); in generateOverflowCheck()
|
| H A D | SimplifyIndVar.cpp | 1613 SE->getNegativeSCEV(RHS), CtxI); in widenWithVariantUse()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/ |
| H A D | InductiveRangeCheckElimination.cpp | 870 const SCEV *Addend = SE.getNegativeSCEV(IndVarBase->getStepRecurrence(SE)); in parseLoopStructure() 1688 const SCEV *NegOne = SE.getNegativeSCEV(One); in computeSafeIterationSpace()
|
| H A D | LoopIdiomRecognize.cpp | 1010 SE->getNegativeSCEV(SE->getOne(BECount->getType())))) { in getNumBytes() 2479 ExtraOffsetExpr = SE->getNegativeSCEV(SE->getSCEV(ExtraOffset)); in detectShiftUntilZeroIdiom()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/ |
| H A D | ScalarEvolution.h | 618 const SCEV *getNegativeSCEV(const SCEV *V,
|