| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | DependenceAnalysis.cpp | 594 dyn_cast<SCEVConstant>(SE->getMinusSCEV(C1A2, C2A1)); in intersectConstraints() 596 dyn_cast<SCEVConstant>(SE->getMinusSCEV(C1B2, C2B1)); in intersectConstraints() 598 dyn_cast<SCEVConstant>(SE->getMinusSCEV(A1B2, A2B1)); in intersectConstraints() 600 dyn_cast<SCEVConstant>(SE->getMinusSCEV(A2B1, A1B2)); in intersectConstraints() 1095 const SCEV *Delta = SE->getMinusSCEV(X, Y); in isKnownPredicate() 1129 const SCEV *Bound = SE->getMinusSCEV(S, Size); in isKnownLessThan() 1143 SE->getMinusSCEV(S, SE->getSMaxExpr(Size, SE->getOne(Size->getType()))); in isKnownLessThan() 1264 const SCEV *Delta = SE->getMinusSCEV(SrcConst, DstConst); in strongSIVtest() 1397 const SCEV *Delta = SE->getMinusSCEV(DstConst, SrcConst); in weakCrossingSIVtest() 1599 const SCEV *Delta = SE->getMinusSCEV(DstConst, SrcConst); in exactSIVtest() [all …]
|
| H A D | ScalarEvolutionAliasAnalysis.cpp | 78 const SCEV *BA = SE.getMinusSCEV(BS, AS); in alias() 93 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 | ScalarEvolution.cpp | 958 const SCEV *S = SE.getMinusSCEV(It, SE.getConstant(It->getType(), i)); in BinomialCoefficient() 2315 Operation = &ScalarEvolution::getMinusSCEV; in willNotOverflow() 3384 return getMinusSCEV(LHS, Mult, SCEV::FlagNUW); in getURemExpr() 4610 return getMinusSCEV(getMinusOne(Ty), V); in getNotSCEV() 4643 const SCEV *ScalarEvolution::getMinusSCEV(const SCEV *LHS, const SCEV *RHS, in getMinusSCEV() function in ScalarEvolution 5032 return SE.getMinusSCEV(Expr, Expr->getStepRecurrence(SE)); in visitAddRecExpr() 6146 const SCEV *LDiff = getMinusSCEV(LA, LS); in createNodeForSelectOrPHIInstWithICmpInstCond() 6147 const SCEV *RDiff = getMinusSCEV(RA, RS); in createNodeForSelectOrPHIInstWithICmpInstCond() 6151 LDiff = getMinusSCEV(LA, RS); in createNodeForSelectOrPHIInstWithICmpInstCond() 6152 RDiff = getMinusSCEV(RA, LS); in createNodeForSelectOrPHIInstWithICmpInstCond() [all …]
|
| H A D | ScalarEvolutionDivision.cpp | 233 const SCEV *Diff = SE.getMinusSCEV(Numerator, Remainder); in visitMulExpr()
|
| H A D | LoopCacheAnalysis.cpp | 192 SE.getMinusSCEV(LastSubscript, OtherLastSubscript)); in hasSpacialReuse() 408 AccessFn = SE.getMinusSCEV(AccessFn, BasePointer); in delinearize()
|
| H A D | LoopAccessAnalysis.cpp | 240 SE.getMinusSCEV(AR->getStart(), StartPtr), WiderTy); in evaluatePtrAddRecAtMaxBTCWillNotWrap() 1070 return SE->getMinusSCEV(L, R); in findForkedSCEVs() 1912 const SCEV *Minus = SE.getMinusSCEV(CastedDist, CastedProduct); in isSafeDependenceDistance() 1919 Minus = SE.getMinusSCEV(NegDist, CastedProduct); in isSafeDependenceDistance() 2028 const SCEV *Dist = SE.getMinusSCEV(Sink, Src); in getDependenceDistanceStrideAndSize() 2982 const SCEV *StrideMinusBETaken = SE->getMinusSCEV(CastedStride, CastedBECount); in collectStridedAccess()
|
| H A D | StackSafetyAnalysis.cpp | 302 const SCEV *Diff = SE.getMinusSCEV(AddrExp, BaseExp); in offsetFrom() 394 const SCEV *Diff = SE.getMinusSCEV(AddrExp, BaseExp); in isSafeAccess() 405 const SCEV *Max = SE.getMinusSCEV(ToDiffTy(SE.getConstant(Size.getUpper())), in isSafeAccess()
|
| H A D | Delinearization.cpp | 581 AccessFn = SE->getMinusSCEV(AccessFn, BasePointer); in printDelinearization()
|
| H A D | Loads.cpp | 351 const SCEV *PtrDiff = SE.getMinusSCEV(AccessEnd, AccessStart); in isDereferenceableAndAlignedInLoop()
|
| H A D | VectorUtils.cpp | 1609 PSE.getSE()->getMinusSCEV(DesA.Scev, DesB.Scev)); in analyzeInterleaving()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/ARM/ |
| H A D | MVETailPredication.cpp | 331 const SCEV *Sub = SE->getMinusSCEV(SE->getBackedgeTakenCount(L), Div); in IsSafeActiveMask() 352 return SE->getMinusSCEV(EC, BaseC); in IsSafeActiveMask() 359 return SE->getMinusSCEV(EC, BaseV); in IsSafeActiveMask() 363 return SE->getMinusSCEV(EC, BaseC); in IsSafeActiveMask() 366 return SE->getMinusSCEV(EC, BaseC); in IsSafeActiveMask()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | InductiveRangeCheckElimination.cpp | 436 Operation = &ScalarEvolution::getMinusSCEV; in reassociateSubLHS() 616 GreatestSeen = SE.getMinusSCEV(End, One); in calculateSubRanges() 749 const SCEV *XMinusSIntMax = SE.getMinusSCEV(X, SIntMax); in computeSafeIterationSpace() 750 return SE.getMinusSCEV(X, SE.getSMaxExpr(Y, XMinusSIntMax), in computeSafeIterationSpace() 763 return SE.getMinusSCEV(X, SE.getSMinExpr(X, Y), SCEV::FlagNUW); in computeSafeIterationSpace() 765 const SCEV *M = SE.getMinusSCEV(C, A); in computeSafeIterationSpace() 791 SCEVCheckNonNegative(SE.getMinusSCEV(SIntMaxExt, X)); in computeSafeIterationSpace() 797 SCEVCheckNonNegative(SE.getMinusSCEV(X, SIntMinExt)); in computeSafeIterationSpace() 1047 cast<SCEVAddRecExpr>(SE.getMinusSCEV(SE.getSCEV(LS.IndVarBase), SE.getSCEV(LS.IndVarStep))); in run()
|
| H A D | AlignmentFromAssumptions.cpp | 87 const SCEV *DiffSCEV = SE->getMinusSCEV(PtrSCEV, AASCEV); in getNewAlignment()
|
| H A D | LoopDataPrefetch.cpp | 357 const SCEV *PtrDiff = SE->getMinusSCEV(LSCEVAddRec, Pref.LSCEVAddRec); in runOnLoop()
|
| H A D | LoopPredication.cpp | 571 SE->getAddExpr(SE->getMinusSCEV(GuardLimit, GuardStart), in widenICmpRangeCheckIncrementingLoop() 572 SE->getMinusSCEV(LatchStart, SE->getOne(Ty))); in widenICmpRangeCheckIncrementingLoop()
|
| H A D | LoopLoadElimination.cpp | 128 PSE.getSE()->getMinusSCEV(StorePtrSCEV, LoadPtrSCEV)); in isDependenceDistanceOfOne()
|
| H A D | IndVarSimplify.cpp | 1279 Elements.push_back(SE->getMinusSCEV(Op, SE->getOne(Op->getType()))); in createReplacement() 1282 MaxIter = SE->getMinusSCEV(MaxIter, SE->getOne(MaxIter->getType())); in createReplacement()
|
| H A D | LoopStrengthReduce.cpp | 3036 if (isa<SCEVConstant>(SE.getMinusSCEV(OperExpr, HeadExpr))) in isProfitableIncrement() 3165 const SCEV *IncExpr = SE.getMinusSCEV(OperExpr, PrevExpr); in ChainInstruction() 3438 const SCEV *Remainder = SE.getMinusSCEV(Accum, MapScev); in GenerateIVChain() 3570 S = SE.getMinusSCEV(N, S); in CollectFixupsAndInitialFormulae() 3586 S = SE.getMinusSCEV(N, S); in CollectFixupsAndInitialFormulae()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | LoopConstrainer.cpp | 57 const SCEV *Limit = SE.getMinusSCEV(SE.getConstant(Min), StepPlusOne); in isSafeDecreasingBound() 60 SE.getMinusSCEV(BoundLG, SE.getOne(BoundLG->getType())); in isSafeDecreasingBound() 100 const SCEV *StepMinusOne = SE.getMinusSCEV(Step, SE.getOne(Step->getType())); in isSafeIncreasingBound() 104 const SCEV *Limit = SE.getMinusSCEV(SE.getConstant(Max), StepMinusOne); in isSafeIncreasingBound() 288 SE.getMinusSCEV(RightSCEV, SE.getOne(RightSCEV->getType())); in parseLoopStructure() 293 SE.getMinusSCEV(RightSCEV, SE.getOne(RightSCEV->getType())); in parseLoopStructure() 391 SE.getMinusSCEV(RightSCEV, SE.getOne(RightSCEV->getType())); in parseLoopStructure()
|
| H A D | SimplifyIndVar.cpp | 402 const SCEV *NLessOne = SE->getMinusSCEV(N, SE->getOne(T)); in simplifyIVRemainder() 1391 return SE->getMinusSCEV(LHS, RHS); in getSCEVByOpCode()
|
| H A D | LoopPeel.cpp | 382 SE.getMinusSCEV(BTC, SE.getOne(BTC->getType())), SE); in shouldPeelLastIteration()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/PowerPC/ |
| H A D | PPCLoopInstrFormPrep.cpp | 457 if (SE->getMinusSCEV(CBucket.Elements[j].Offset, in prepareBasesForCommoningChains() 506 SE->getMinusSCEV(CBucket.Elements[i + j * CBucket.ChainSize].Offset, in prepareBasesForCommoningChains() 590 BaseElemIdx ? SE->getMinusSCEV(Bucket.Elements[Idx].Offset, in rewriteLoadStoresForCommoningChains() 683 BasePtrStartSCEV = SE->getMinusSCEV(BasePtrSCEV->getStart(), in rewriteForBase() 838 const SCEV *Diff = SE->getMinusSCEV(LSCEV, B.BaseSCEV); in addOneCandidate() 952 E.Offset = cast<SCEVConstant>(SE->getMinusSCEV(E.Offset, Offset)); in prepareBaseForDispFormChain() 997 E.Offset = cast<SCEVConstant>(SE->getMinusSCEV(E.Offset, Offset)); in prepareBaseForUpdateFormChain() 1259 SE->getMinusSCEV(PHIBasePtrSCEV->getStart(), BasePtrStartSCEV)); in alreadyPrepared()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
| H A D | LoadStoreVectorizer.cpp | 1227 const SCEV *IdxDiffSCEV = SE.getMinusSCEV(OffsetSCEVB, OffsetSCEVA); in getConstantOffsetComplexAddrs() 1627 const SCEV *DistScev = SE.getMinusSCEV(SE.getSCEV(PtrB), SE.getSCEV(PtrA)); in getConstantOffset()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | ScalarEvolution.h | 704 LLVM_ABI const SCEV *getMinusSCEV(const SCEV *LHS, const SCEV *RHS,
|