Searched refs:isKnownNegative (Results 1 – 16 of 16) sorted by relevance
100 if (StepRec && SE.isKnownNegative(StepRec)) in isOneDimensionalArray()438 if (StepRec && SE.isKnownNegative(StepRec)) in delinearize()503 Stride = SE.isKnownNegative(Stride) ? SE.getNegativeSCEV(Stride) : Stride; in isConsecutive()
1108 return SE->isKnownNegative(Delta); in isKnownPredicate()1135 if (SE->isKnownNegative(Limit)) in isKnownLessThan()1144 return SE->isKnownNegative(LimitedBound); in isKnownLessThan()1416 if (SE->isKnownNegative(ConstCoeff)) { in weakCrossingSIVtest()1438 if (SE->isKnownNegative(Delta)) { in weakCrossingSIVtest()1811 SE->isKnownNegative(ConstCoeff) ? in weakZeroSrcSIVtest()1814 SE->isKnownNegative(ConstCoeff) ? SE->getNegativeSCEV(Delta) : Delta; in weakZeroSrcSIVtest()1839 if (SE->isKnownNegative(NewDelta)) { in weakZeroSrcSIVtest()1920 SE->isKnownNegative(ConstCoeff) ? in weakZeroDstSIVtest()1923 SE->isKnownNegative(ConstCoeff) ? SE->getNegativeSCEV(Delta) : Delta; in weakZeroDstSIVtest()[all …]
281 if (SE.isKnownNegative(StepRecur)) in getDirection()
229 if (!IsKnownNonNegative && !SE.isKnownNegative(Step)) in evaluatePtrAddRecAtMaxBTCWillNotWrap()266 assert(SE.isKnownNegative(Step) && "must be known negative"); in evaluatePtrAddRecAtMaxBTCWillNotWrap()
1247 if (SE->isKnownNegative(Step)) { in getSignedOverflowLimitForStep()1729 if (isKnownNegative(Step)) { in getZeroExtendExprImpl()7122 if (isKnownNegative(Step) && in getRangeForAffineNoSelfWrappingAR()10575 bool CountDown = isKnownNegative(StepWLG); in howFarToZero()10930 bool ScalarEvolution::isKnownNegative(const SCEV *S) { in isKnownNegative() function in ScalarEvolution11937 (isKnownNegative(FoundLHS) && isKnownNegative(FoundRHS))) in isImpliedCondBalancedTypes()11962 if (ICmpInst::isUnsigned(CanonicalPred) && isKnownNegative(CanonicalRHS)) in isImpliedCondBalancedTypes()12723 if (isKnownNegative(RHS) && in isImpliedViaOperations()12920 if (IsSigned && isKnownNegative(Stride)) in computeMaxBECountForLT()13176 if (isKnownNegative(RHSStride) && in howManyLessThans()
725 if ((isFindFirstIVRecurrenceKind(Kind) && !SE.isKnownNegative(Step)) || in isFindIVPattern()
296 bool llvm::isKnownNegative(const Value *V, const SimplifyQuery &SQ, in isKnownNegative() function in llvm379 bool isKnownNegative = false; in computeKnownBitsMul() local404 isKnownNegative = in computeKnownBitsMul()424 else if (isKnownNegative && !Known.isNonNegative()) in computeKnownBitsMul()
179 LLVM_ABI bool isKnownNegative(const Value *V, const SimplifyQuery &SQ,
1044 LLVM_ABI bool isKnownNegative(const SCEV *S);
30 assert(SE.isKnownNegative(Step) && "expecting negative step"); in isSafeDecreasingBound()
537 else if (SE.isKnownNegative(Step)) in countToEliminateCompares()
2166 bool NeedPosCheck = !SE.isKnownNegative(Step); in generateOverflowCheck()
1757 if (!SE->isKnownNegative(RHS)) in widenWithVariantUse()
4767 isKnownNegative(X, SQ.getWithInstruction(NotVal))) in foldNot()
5035 if (isKnownNegative(Op1, IC.getSimplifyQuery().getWithInstruction(&I))) in foldICmpAndXX()
20162 {"_ZN4llvm15ScalarEvolution15isKnownNegativeEPKNS_4SCEVE", "llvm::ScalarEvolution::isKnownNegative(…