| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| H A D | DependenceAnalysis.cpp | 484 const SCEV *Prod1 = SE->getMulExpr(X->getA(), Y->getB()); in intersectConstraints()
485 const SCEV *Prod2 = SE->getMulExpr(X->getB(), Y->getA()); in intersectConstraints()
489 Prod1 = SE->getMulExpr(X->getC(), Y->getB()); in intersectConstraints()
490 Prod2 = SE->getMulExpr(X->getB(), Y->getC()); in intersectConstraints()
503 const SCEV *C1B2 = SE->getMulExpr(X->getC(), Y->getB()); in intersectConstraints()
504 const SCEV *C1A2 = SE->getMulExpr(X->getC(), Y->getA()); in intersectConstraints()
505 const SCEV *C2B1 = SE->getMulExpr(Y->getC(), X->getB()); in intersectConstraints()
506 const SCEV *C2A1 = SE->getMulExpr(Y->getC(), X->getA()); in intersectConstraints()
507 const SCEV *A1B2 = SE->getMulExpr(X->getA(), Y->getB()); in intersectConstraints()
508 const SCEV *A2B1 = SE->getMulExpr(Y->getA(), X->getB()); in intersectConstraints()
[all …]
|
| H A D | ScalarEvolution.cpp | 1005 Dividend = SE.getMulExpr(Dividend, in BinomialCoefficient()
1014 return SE.getMulExpr(SE.getConstant(MultiplyFactor), in BinomialCoefficient()
1037 Result = SE.getAddExpr(Result, SE.getMulExpr(getOperand(i), Coeff)); in evaluateAtIteration()
1148 return !Changed ? Expr : SE.getMulExpr(Operands, Expr->getNoWrapFlags()); in getLosslessPtrToIntExpr()
1236 return getMulExpr(Operands); in getTruncateExpr()
1655 const SCEV *ZMul = getMulExpr(CastedMaxBECount, Step, in getZeroExtendExpr()
1666 getMulExpr(WideMaxBECount, in getZeroExtendExpr()
1684 getMulExpr(WideMaxBECount, in getZeroExtendExpr()
1827 return getMulExpr(Ops, SCEV::FlagNUW, Depth + 1); in getZeroExtendExpr()
1849 return getMulExpr( in getZeroExtendExpr()
[all …]
|
| H A D | LoopCacheAnalysis.cpp | 294 const SCEV *Stride = SE.getMulExpr(Coeff, ElemSize); in computeRefCost()
301 const SCEV *Numerator = SE.getMulExpr(Stride, TripCount); in computeRefCost()
421 const SCEV *Stride = SE.getMulExpr(Coeff, ElemSize); in isConsecutive()
|
| H A D | ScalarEvolutionDivision.cpp | 210 Quotient = SE.getMulExpr(Qs); in visitMulExpr()
|
| H A D | LoopAccessAnalysis.cpp | 1385 const SCEV *Product = SE.getMulExpr(&BackedgeTakenCount, Step); in isSafeDependenceDistance()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/ |
| H A D | ScalarEvolution.h | 536 const SCEV *getMulExpr(SmallVectorImpl<const SCEV *> &Ops,
539 const SCEV *getMulExpr(const SCEV *LHS, const SCEV *RHS,
543 return getMulExpr(Ops, Flags, Depth);
545 const SCEV *getMulExpr(const SCEV *Op0, const SCEV *Op1, const SCEV *Op2,
549 return getMulExpr(Ops, Flags, Depth);
|
| H A D | ScalarEvolutionExpressions.h | 778 return !Changed ? Expr : SE.getMulExpr(Operands); in visitMulExpr()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/ARM/ |
| H A D | MVETailPredication.cpp | 298 SE->getUDivExpr(SE->getAddExpr(SE->getMulExpr(Ceil, VW), in IsSafeActiveMask()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/ |
| H A D | LoopStrengthReduce.cpp | 438 const SCEV *NewMul = SE.getMulExpr(Ops); in DoInitialMatch()
446 Good.push_back(SE.getMulExpr(NegOne, S)); in DoInitialMatch()
448 Bad.push_back(SE.getMulExpr(NegOne, S)); in DoInitialMatch()
685 return SE.getMulExpr(LHS, RC); in getExactSDiv()
747 return Found ? SE.getMulExpr(Ops) : nullptr; in getExactSDiv()
3516 Ops.push_back(C ? SE.getMulExpr(C, Remainder) : Remainder); in CollectSubexprs()
3529 Ops.push_back(C ? SE.getMulExpr(C, Remainder) : Remainder); in CollectSubexprs()
3547 C = C ? cast<SCEVConstant>(SE.getMulExpr(C, Op0)) : Op0; in CollectSubexprs()
3551 Ops.push_back(SE.getMulExpr(C, Remainder)); in CollectSubexprs()
3940 F.BaseRegs[i] = SE.getMulExpr(F.BaseRegs[i], FactorS); in GenerateICmpZeroScales()
[all …]
|
| H A D | LoopDataPrefetch.cpp | 385 const SCEV *NextLSCEV = SE->getAddExpr(P.LSCEVAddRec, SE->getMulExpr( in runOnLoop()
|
| H A D | LoopRerollPass.cpp | 915 if (ADR->getStepRecurrence(*SE) != SE->getMulExpr(StepSCEV, ScaleSCEV)) in validateRootSet()
1486 auto ScaledTripCount = SE->getMulExpr( in replace()
|
| H A D | NaryReassociate.cpp | 541 return SE->getMulExpr(LHS, RHS); in getBinarySCEV()
|
| H A D | InductiveRangeCheckElimination.cpp | 1702 const SCEV *Begin = SE.getMulExpr(ClampedSubtract(Zero, M), EndIsNonNegative); in computeSafeIterationSpace()
1703 const SCEV *End = SE.getMulExpr(ClampedSubtract(REnd, M), EndIsNonNegative); in computeSafeIterationSpace()
|
| H A D | LoopIdiomRecognize.cpp | 987 Index = SE->getMulExpr(Index, SE->getConstant(IntPtr, StoreSize), in getStartForNegStride()
1021 NumBytesS = SE->getMulExpr(NumBytesS, SE->getConstant(IntPtr, StoreSize), in getNumBytes()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/ |
| H A D | SimplifyIndVar.cpp | 168 SE->getSCEV(IVSrc) != SE->getMulExpr(FoldedExpr, SE->getSCEV(D))) in foldIVUser()
439 Operation = &ScalarEvolution::getMulExpr; in willNotOverflow()
1339 return SE->getMulExpr(LHS, RHS); in getSCEVByOpCode()
|
| H A D | ScalarEvolutionExpander.cpp | 331 S = SE.getMulExpr(NewMulOps); in FactorOutConstant()
1668 SE.getMulExpr(SE.getUnknown(CanonicalIV), in visitAddRecExpr()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/ |
| H A D | HexagonLoopIdiomRecognition.cpp | 2170 NumBytesS = SE->getMulExpr(NumBytesS, SE->getConstant(IntPtrTy, StoreSize), in processCopyingStore()
|