| /llvm-project-15.0.7/llvm/lib/Analysis/ |
| H A D | DependenceAnalysis.cpp | 1013 const SCEV *Delta = SE->getMinusSCEV(X, Y); in isKnownPredicate() 1047 const SCEV *Bound = SE->getMinusSCEV(S, Size); in isKnownLessThan() 1182 const SCEV *Delta = SE->getMinusSCEV(SrcConst, DstConst); in strongSIVtest() 1315 const SCEV *Delta = SE->getMinusSCEV(DstConst, SrcConst); in weakCrossingSIVtest() 2063 const SCEV *C2_C1 = SE->getMinusSCEV(C2, C1); in symbolicRDIVtest() 2064 const SCEV *C1_C2 = SE->getMinusSCEV(C1, C2); in symbolicRDIVtest() 2481 Delta = SE->getMinusSCEV(SrcCoeff, DstCoeff); in gcdMIVtest() 2554 const SCEV *Delta = SE->getMinusSCEV(B0, A0); in banerjeeMIVtest() 2852 const SCEV *Iter_1 = SE->getMinusSCEV( in findBoundsLT() 2896 const SCEV *Iter_1 = SE->getMinusSCEV( in findBoundsGT() [all …]
|
| H A D | ScalarEvolutionAliasAnalysis.cpp | 64 const SCEV *BA = SE.getMinusSCEV(BS, AS); in alias() 79 const SCEV *AB = SE.getMinusSCEV(AS, BS); in alias()
|
| H A D | ScalarEvolutionNormalization.cpp | 91 Operands[i] = SE.getMinusSCEV(Operands[i], Operands[i + 1]); in visitAddRecExpr()
|
| H A D | LoopUnrollAnalyzer.cpp | 62 dyn_cast<SCEVConstant>(SE.getMinusSCEV(ValueAtIteration, Base)); in simplifyInstWithSCEV()
|
| H A D | ScalarEvolution.cpp | 2298 Operation = &ScalarEvolution::getMinusSCEV; in willNotOverflow() 3343 return getMinusSCEV(LHS, Mult, SCEV::FlagNUW); in getURemExpr() 4480 return getMinusSCEV(getMinusOne(Ty), V); in getNotSCEV() 6020 const SCEV *LDiff = getMinusSCEV(LA, LS); in createNodeForSelectOrPHIInstWithICmpInstCond() 6021 const SCEV *RDiff = getMinusSCEV(RA, RS); in createNodeForSelectOrPHIInstWithICmpInstCond() 6025 LDiff = getMinusSCEV(LA, RS); in createNodeForSelectOrPHIInstWithICmpInstCond() 6026 RDiff = getMinusSCEV(RA, LS); in createNodeForSelectOrPHIInstWithICmpInstCond() 7543 return getMinusSCEV(LHS, RHS, Flags); in createSCEV() 10865 auto *Diff = getMinusSCEV(LHS, RHS); in isKnownPredicateViaConstantRanges() 12662 getMinusSCEV(getAddExpr(RHS, MinusOne), getMinusSCEV(Start, Stride)); in howManyLessThans() [all …]
|
| H A D | ScalarEvolutionDivision.cpp | 229 const SCEV *Diff = SE.getMinusSCEV(Numerator, Remainder); in visitMulExpr()
|
| H A D | LoopCacheAnalysis.cpp | 192 SE.getMinusSCEV(LastSubscript, OtherLastSubscript)); in hasSpacialReuse() 398 AccessFn = SE.getMinusSCEV(AccessFn, BasePointer); in delinearize()
|
| H A D | LoopAccessAnalysis.cpp | 369 const SCEV *Diff = SE->getMinusSCEV(J, I); in getMinFromExprs() 1478 dyn_cast<SCEVConstant>(SE.getMinusSCEV(PtrSCEVB, PtrSCEVA)); in getPointersDiff() 1725 const SCEV *Minus = SE.getMinusSCEV(CastedDist, CastedProduct); in isSafeDependenceDistance() 1732 Minus = SE.getMinusSCEV(NegDist, CastedProduct); in isSafeDependenceDistance() 1816 const SCEV *Dist = PSE.getSE()->getMinusSCEV(Sink, Src); in isDependent() 2545 const SCEV *StrideMinusBETaken = SE->getMinusSCEV(CastedStride, CastedBECount); in collectStridedAccess()
|
| H A D | StackSafetyAnalysis.cpp | 278 const SCEV *Diff = SE.getMinusSCEV(AddrExp, BaseExp); in offsetFrom() 372 const SCEV *Diff = SE.getMinusSCEV(AddrExp, BaseExp); in isSafeAccess() 383 const SCEV *Max = SE.getMinusSCEV(ToDiffTy(SE.getConstant(Size.getUpper())), in isSafeAccess()
|
| H A D | Delinearization.cpp | 602 AccessFn = SE->getMinusSCEV(AccessFn, BasePointer); in printDelinearization()
|
| H A D | VectorUtils.cpp | 1301 PSE.getSE()->getMinusSCEV(DesA.Scev, DesB.Scev)); in analyzeInterleaving()
|
| /llvm-project-15.0.7/llvm/lib/Transforms/Scalar/ |
| H A D | InductiveRangeCheckElimination.cpp | 695 const SCEV *Limit = SE.getMinusSCEV(SE.getConstant(Min), StepPlusOne); in isSafeDecreasingBound() 698 SE.getMinusSCEV(BoundSCEV, SE.getOne(BoundSCEV->getType())); in isSafeDecreasingBound() 739 SE.getMinusSCEV(Step, SE.getOne(Step->getType())); in isSafeIncreasingBound() 905 RightSCEV = SE.getMinusSCEV(RightSCEV, in parseLoopStructure() 910 RightSCEV = SE.getMinusSCEV(RightSCEV, in parseLoopStructure() 1009 SE.getMinusSCEV(RightSCEV, SE.getOne(RightSCEV->getType())); in parseLoopStructure() 1095 GreatestSeen = SE.getMinusSCEV(End, One); in calculateSubRanges() 1656 const SCEV *XMinusSIntMax = SE.getMinusSCEV(X, SIntMax); in computeSafeIterationSpace() 1657 return SE.getMinusSCEV(X, SE.getSMaxExpr(Y, XMinusSIntMax), in computeSafeIterationSpace() 1670 return SE.getMinusSCEV(X, SE.getSMinExpr(X, Y), SCEV::FlagNUW); in computeSafeIterationSpace() [all …]
|
| H A D | LoopRerollPass.cpp | 908 const SCEV *StepSCEV = SE->getMinusSCEV(SE->getSCEV(DRS.Roots[0]), ADR); in validateRootSet() 917 const SCEV *NewStepSCEV = SE->getMinusSCEV(SE->getSCEV(DRS.Roots[i]), in validateRootSet() 1450 IncrExprs.push_back(SE->getMinusSCEV(SE->getSCEV(DRS.Roots[0]), IVSCEV)); in replace() 1481 auto ScaledBECount = SE->getMinusSCEV(ScaledTripCount, One); in replace()
|
| H A D | AlignmentFromAssumptions.cpp | 134 const SCEV *DiffSCEV = SE->getMinusSCEV(PtrSCEV, AASCEV); in getNewAlignment()
|
| H A D | LoopDataPrefetch.cpp | 358 const SCEV *PtrDiff = SE->getMinusSCEV(LSCEVAddRec, Pref.LSCEVAddRec); in runOnLoop()
|
| H A D | LoopPredication.cpp | 603 SE->getAddExpr(SE->getMinusSCEV(GuardLimit, GuardStart), in widenICmpRangeCheckIncrementingLoop() 604 SE->getMinusSCEV(LatchStart, SE->getOne(Ty))); in widenICmpRangeCheckIncrementingLoop()
|
| H A D | LoopLoadElimination.cpp | 123 PSE.getSE()->getMinusSCEV(StorePtrSCEV, LoadPtrSCEV)); in isDependenceDistanceOfOne()
|
| H A D | LoopStrengthReduce.cpp | 2853 if (isa<SCEVConstant>(SE.getMinusSCEV(OperExpr, HeadExpr))) in isProfitableIncrement() 2982 const SCEV *IncExpr = SE.getMinusSCEV(OperExpr, PrevExpr); in ChainInstruction() 3343 S = SE.getMinusSCEV(N, S); in CollectFixupsAndInitialFormulae() 3357 S = SE.getMinusSCEV(N, S); in CollectFixupsAndInitialFormulae()
|
| H A D | IndVarSimplify.cpp | 1410 MaxIter = SE->getMinusSCEV(MaxIter, One); in optimizeLoopExitWithUnknownExitCount()
|
| /llvm-project-15.0.7/llvm/lib/Target/PowerPC/ |
| H A D | PPCLoopInstrFormPrep.cpp | 465 if (SE->getMinusSCEV(CBucket.Elements[j].Offset, in prepareBasesForCommoningChains() 514 SE->getMinusSCEV(CBucket.Elements[i + j * CBucket.ChainSize].Offset, in prepareBasesForCommoningChains() 598 BaseElemIdx ? SE->getMinusSCEV(Bucket.Elements[Idx].Offset, in rewriteLoadStoresForCommoningChains() 691 BasePtrStartSCEV = SE->getMinusSCEV(BasePtrSCEV->getStart(), in rewriteForBase() 841 const SCEV *Diff = SE->getMinusSCEV(LSCEV, B.BaseSCEV); in addOneCandidate() 955 E.Offset = cast<SCEVConstant>(SE->getMinusSCEV(E.Offset, Offset)); in prepareBaseForDispFormChain() 1000 E.Offset = cast<SCEVConstant>(SE->getMinusSCEV(E.Offset, Offset)); in prepareBaseForUpdateFormChain() 1261 SE->getMinusSCEV(PHIBasePtrSCEV->getStart(), BasePtrStartSCEV)); in alreadyPrepared()
|
| /llvm-project-15.0.7/llvm/lib/Target/ARM/ |
| H A D | MVETailPredication.cpp | 298 SE->getMinusSCEV(SE->getBackedgeTakenCount(L), in IsSafeActiveMask()
|
| /llvm-project-15.0.7/llvm/lib/Transforms/Utils/ |
| H A D | SimplifyIndVar.cpp | 413 const auto *NLessOne = SE->getMinusSCEV(N, SE->getOne(T)); in simplifyIVRemainder() 1341 return SE->getMinusSCEV(LHS, RHS); in getSCEVByOpCode()
|
| /llvm-project-15.0.7/polly/lib/Analysis/ |
| H A D | ScopBuilder.cpp | 1597 DestAccFunc = SE.getMinusSCEV(DestAccFunc, DestPtrSCEV); in buildAccessMemIntrinsic() 1619 SrcAccFunc = SE.getMinusSCEV(SrcAccFunc, SrcPtrSCEV); in buildAccessMemIntrinsic() 1700 AccessFunction = SE.getMinusSCEV(AccessFunction, BasePointer); in buildAccessSingleDim()
|
| /llvm-project-15.0.7/llvm/lib/Transforms/Vectorize/ |
| H A D | LoadStoreVectorizer.cpp | 376 const SCEV *Dist = SE.getMinusSCEV(PtrSCEVB, PtrSCEVA); in areConsecutivePointers()
|
| /llvm-project-15.0.7/llvm/include/llvm/Analysis/ |
| H A D | ScalarEvolution.h | 682 const SCEV *getMinusSCEV(const SCEV *LHS, const SCEV *RHS,
|