| /freebsd-14.2/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | DependenceAnalysis.cpp | 554 Prod1 = SE->getMulExpr(X->getC(), Y->getB()); in intersectConstraints() 555 Prod2 = SE->getMulExpr(X->getB(), Y->getC()); in intersectConstraints() 1431 const SCEV *ML = SE->getMulExpr(SE->getMulExpr(ConstCoeff, UpperBound), in weakCrossingSIVtest() 2135 const SCEV *A1N1 = SE->getMulExpr(A1, N1); in symbolicRDIVtest() 2144 const SCEV *A2N2 = SE->getMulExpr(A2, N2); in symbolicRDIVtest() 2156 const SCEV *A1N1 = SE->getMulExpr(A1, N1); in symbolicRDIVtest() 2157 const SCEV *A2N2 = SE->getMulExpr(A2, N2); in symbolicRDIVtest() 2177 const SCEV *A1N1 = SE->getMulExpr(A1, N1); in symbolicRDIVtest() 2178 const SCEV *A2N2 = SE->getMulExpr(A2, N2); in symbolicRDIVtest() 3261 Src = SE->getMulExpr(Src, A); in propagateLine() [all …]
|
| H A D | Delinearization.cpp | 153 Terms.push_back(SE.getMulExpr(Operands)); in follow() 212 Step = SE.getMulExpr(Qs); in findArrayDimensionsRec() 271 return SE.getMulExpr(Factors); in removeConstantFactors()
|
| H A D | LoopCacheAnalysis.cpp | 301 const SCEV *Numerator = SE.getMulExpr(Stride, TripCount); in computeRefCost() 326 RefCost = SE.getMulExpr(SE.getNoopOrZeroExtend(RefCost, WiderType), in computeRefCost() 488 Stride = SE.getMulExpr(SE.getNoopOrSignExtend(Coeff, WiderType), in isConsecutive()
|
| H A D | ScalarEvolution.cpp | 951 Dividend = SE.getMulExpr(Dividend, in BinomialCoefficient() 1194 return getMulExpr(Operands); in getTruncateExpr() 1844 return getMulExpr( in getZeroExtendExprImpl() 2773 Ops.push_back(getMulExpr( in getAddExpr() 3519 return getMulExpr(Operands); in getUDivExpr() 3608 return getMulExpr(Operands); in getUDivExactExpr() 3623 LHS = getMulExpr(Operands); in getUDivExactExpr() 3637 return getMulExpr(Operands); in getUDivExactExpr() 4404 Res = getMulExpr(Res, getVScale(IntTy)); in getSizeOfExpr() 7752 return getMulExpr(MulOps); in createSCEV() [all …]
|
| H A D | ScalarEvolutionDivision.cpp | 212 Quotient = SE.getMulExpr(Qs); in visitMulExpr()
|
| H A D | LoopAccessAnalysis.cpp | 964 const SCEV *Scaled1 = SE->getMulExpr( in findForkedSCEVs() 966 const SCEV *Scaled2 = SE->getMulExpr( in findForkedSCEVs() 1843 const SCEV *Product = SE.getMulExpr(&BackedgeTakenCount, Step); in isSafeDependenceDistance()
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | InductiveRangeCheckElimination.cpp | 783 return SE.getMulExpr(OverflowCheck, UnderflowCheck); in computeSafeIterationSpace() 820 SE.getMulExpr(SCEVCheckNonNegative(REnd), EndWillNotOverflow); in computeSafeIterationSpace() 821 const SCEV *Begin = SE.getMulExpr(ClampedSubtract(Zero, M), RuntimeChecks); in computeSafeIterationSpace() 822 const SCEV *End = SE.getMulExpr(ClampedSubtract(REnd, M), RuntimeChecks); in computeSafeIterationSpace()
|
| H A D | LoopDataPrefetch.cpp | 395 const SCEV *NextLSCEV = SE->getAddExpr(P.LSCEVAddRec, SE->getMulExpr( in runOnLoop()
|
| H A D | LoopStrengthReduce.cpp | 454 const SCEV *NewMul = SE.getMulExpr(Ops); in DoInitialMatch() 462 Good.push_back(SE.getMulExpr(NegOne, S)); in DoInitialMatch() 464 Bad.push_back(SE.getMulExpr(NegOne, S)); in DoInitialMatch() 712 return SE.getMulExpr(LHS, RC); in getExactSDiv() 790 return Found ? SE.getMulExpr(Ops) : nullptr; in getExactSDiv() 3613 Ops.push_back(C ? SE.getMulExpr(C, Remainder) : Remainder); in CollectSubexprs() 3626 Ops.push_back(C ? SE.getMulExpr(C, Remainder) : Remainder); in CollectSubexprs() 3644 C = C ? cast<SCEVConstant>(SE.getMulExpr(C, Op0)) : Op0; in CollectSubexprs() 3648 Ops.push_back(SE.getMulExpr(C, Remainder)); in CollectSubexprs() 4041 F.BaseRegs[i] = SE.getMulExpr(F.BaseRegs[i], FactorS); in GenerateICmpZeroScales() [all …]
|
| H A D | LoopRerollPass.cpp | 878 if (ADR->getStepRecurrence(*SE) != SE->getMulExpr(StepSCEV, ScaleSCEV)) in validateRootSet() 1447 auto ScaledTripCount = SE->getMulExpr( in replace()
|
| H A D | NaryReassociate.cpp | 546 return SE->getMulExpr(LHS, RHS); in getBinarySCEV()
|
| H A D | LoopIdiomRecognize.cpp | 976 Index = SE->getMulExpr(Index, in getStartForNegStride() 993 return SE->getMulExpr(TripCountSCEV, in getNumBytes()
|
| /freebsd-14.2/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | ScalarEvolution.h | 596 const SCEV *getMulExpr(SmallVectorImpl<const SCEV *> &Ops, 599 const SCEV *getMulExpr(const SCEV *LHS, const SCEV *RHS, 603 return getMulExpr(Ops, Flags, Depth); 605 const SCEV *getMulExpr(const SCEV *Op0, const SCEV *Op1, const SCEV *Op2, 609 return getMulExpr(Ops, Flags, Depth);
|
| H A D | ScalarEvolutionExpressions.h | 818 return !Changed ? Expr : SE.getMulExpr(Operands); in visitMulExpr()
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Target/ARM/ |
| H A D | MVETailPredication.cpp | 328 SE->getAddExpr(SE->getMulExpr(Ceil, VW), SE->getNegativeSCEV(VW), in IsSafeActiveMask()
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
| H A D | LoopVectorizationLegality.cpp | 519 auto *NewStep = SE.getMulExpr(Step, SE.getConstant(Ty, StepMultiplier)); in visitAddRecExpr() 520 auto *ScaledOffset = SE.getMulExpr(Step, SE.getConstant(Ty, Offset)); in visitAddRecExpr()
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | SimplifyIndVar.cpp | 167 if (UseInst->isExact() && LHS != SE->getMulExpr(FoldedExpr, RHS)) in foldIVUser() 1363 return SE->getMulExpr(LHS, RHS); in getSCEVByOpCode()
|
| H A D | ScalarEvolutionExpander.cpp | 1255 SE.getMulExpr(SE.getUnknown(CanonicalIV), in visitAddRecExpr()
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
| H A D | HexagonLoopIdiomRecognition.cpp | 2164 NumBytesS = SE->getMulExpr(NumBytesS, SE->getConstant(IntPtrTy, StoreSize), in processCopyingStore()
|