/freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | DependenceAnalysis.cpp | 549 const SCEV *Prod1 = SE->getMulExpr(X->getA(), Y->getB()); in intersectConstraints() 550 const SCEV *Prod2 = SE->getMulExpr(X->getB(), Y->getA()); in intersectConstraints() 554 Prod1 = SE->getMulExpr(X->getC(), Y->getB()); in intersectConstraints() 555 Prod2 = SE->getMulExpr(X->getB(), Y->getC()); in intersectConstraints() 568 const SCEV *C1B2 = SE->getMulExpr(X->getC(), Y->getB()); in intersectConstraints() 569 const SCEV *C1A2 = SE->getMulExpr(X->getC(), Y->getA()); in intersectConstraints() 570 const SCEV *C2B1 = SE->getMulExpr(Y->getC(), X->getB()); in intersectConstraints() 571 const SCEV *C2A1 = SE->getMulExpr(Y->getC(), X->getA()); in intersectConstraints() 572 const SCEV *A1B2 = SE->getMulExpr(X->getA(), Y->getB()); in intersectConstraints() 573 const SCEV *A2B1 = SE->getMulExpr(Y->getA(), X->getB()); in intersectConstraints() [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() 331 RefCost = SE.getMulExpr(SE.getNoopOrZeroExtend(RefCost, WiderType), in computeRefCost() 493 Stride = SE.getMulExpr(SE.getNoopOrSignExtend(Coeff, WiderType), in isConsecutive()
|
H A D | ScalarEvolution.cpp | 515 Res = getMulExpr(Res, getVScale(Ty)); in getElementCount() 953 Dividend = SE.getMulExpr(Dividend, in BinomialCoefficient() 962 return SE.getMulExpr(SE.getConstant(MultiplyFactor), in BinomialCoefficient() 992 Result = SE.getAddExpr(Result, SE.getMulExpr(Operands[i], Coeff)); in evaluateAtIteration() 1107 return !Changed ? Expr : SE.getMulExpr(Operands, Expr->getNoWrapFlags()); in getLosslessPtrToIntExpr() 1196 return getMulExpr(Operands); in getTruncateExpr() 1655 const SCEV *ZMul = getMulExpr(CastedMaxBECount, Step, in getZeroExtendExprImpl() 1666 getMulExpr(WideMaxBECount, in getZeroExtendExprImpl() 1683 getMulExpr(WideMaxBECount, in getZeroExtendExprImpl() 1824 return getMulExpr(Ops, SCEV::FlagNUW, Depth + 1); in getZeroExtendExprImpl() [all …]
|
H A D | ScalarEvolutionDivision.cpp | 212 Quotient = SE.getMulExpr(Qs); in visitMulExpr()
|
H A D | LoopAccessAnalysis.cpp | 962 const SCEV *Scaled1 = SE->getMulExpr( in findForkedSCEVs() 964 const SCEV *Scaled2 = SE->getMulExpr( in findForkedSCEVs() 1834 const SCEV *Product = SE.getMulExpr(&MaxBTC, Step); in isSafeDependenceDistance()
|
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | ScalarEvolution.h | 597 const SCEV *getMulExpr(SmallVectorImpl<const SCEV *> &Ops, 600 const SCEV *getMulExpr(const SCEV *LHS, const SCEV *RHS, 604 return getMulExpr(Ops, Flags, Depth); 606 const SCEV *getMulExpr(const SCEV *Op0, const SCEV *Op1, const SCEV *Op2, 610 return getMulExpr(Ops, Flags, Depth);
|
H A D | ScalarEvolutionExpressions.h | 818 return !Changed ? Expr : SE.getMulExpr(Operands); in visitMulExpr()
|
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | LoopStrengthReduce.cpp | 332 S = SE.getMulExpr(S, SE.getVScale(S->getType())); in getSCEV() 339 NegS = SE.getMulExpr(NegS, SE.getVScale(NegS->getType())); in getNegativeSCEV() 346 SU = SE.getMulExpr(SU, SE.getVScale(SU->getType())); in getUnknownSCEV() 582 const SCEV *NewMul = SE.getMulExpr(Ops); in DoInitialMatch() 590 Good.push_back(SE.getMulExpr(NegOne, S)); in DoInitialMatch() 592 Bad.push_back(SE.getMulExpr(NegOne, S)); in DoInitialMatch() 840 return SE.getMulExpr(LHS, RC); in getExactSDiv() 918 return Found ? SE.getMulExpr(Ops) : nullptr; in getExactSDiv() 3848 Ops.push_back(C ? SE.getMulExpr(C, Remainder) : Remainder); in CollectSubexprs() 3861 Ops.push_back(C ? SE.getMulExpr(C, Remainder) : Remainder); in CollectSubexprs() [all …]
|
H A D | LoopDataPrefetch.cpp | 395 const SCEV *NextLSCEV = SE->getAddExpr(P.LSCEVAddRec, SE->getMulExpr( in runOnLoop()
|
H A D | InductiveRangeCheckElimination.cpp | 783 return SE.getMulExpr(OverflowCheck, UnderflowCheck); 820 SE.getMulExpr(SCEVCheckNonNegative(REnd), EndWillNotOverflow); in isSafeDecreasingBound() 821 const SCEV *Begin = SE.getMulExpr(ClampedSubtract(Zero, M), RuntimeChecks); in isSafeDecreasingBound() 822 const SCEV *End = SE.getMulExpr(ClampedSubtract(REnd, M), RuntimeChecks); in isSafeDecreasingBound()
|
H A D | NaryReassociate.cpp | 547 return SE->getMulExpr(LHS, RHS); in getBinarySCEV()
|
H A D | LoopIdiomRecognize.cpp | 981 Index = SE->getMulExpr(Index, in getStartForNegStride() 998 return SE->getMulExpr(TripCountSCEV, in getNumBytes()
|
/freebsd/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/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()
|
H A D | SLPVectorizer.cpp | 4508 SE.getMulExpr(Stride, SC))) in calculateRtStride()
|
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | SimplifyIndVar.cpp | 175 if (UseInst->isExact() && LHS != SE->getMulExpr(FoldedExpr, RHS)) in foldIVUser() 1393 return SE->getMulExpr(LHS, RHS); in getSCEVByOpCode()
|
H A D | ScalarEvolutionExpander.cpp | 1312 SE.getMulExpr(SE.getUnknown(CanonicalIV), in visitAddRecExpr()
|
/freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
H A D | HexagonLoopIdiomRecognition.cpp | 2158 NumBytesS = SE->getMulExpr(NumBytesS, SE->getConstant(IntPtrTy, StoreSize), in processCopyingStore()
|