| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | DependenceAnalysis.cpp | 1083 return SE->isKnownNonNegative(Delta); in isKnownPredicate()
1128 bool DependenceInfo::isKnownNonNegative(const SCEV *S, const Value *Ptr) const { in isKnownNonNegative() function in DependenceInfo
1137 if (SE->isKnownNonNegative(AddRec->getStart()) && in isKnownNonNegative()
1138 SE->isKnownNonNegative(AddRec->getOperand(1))) in isKnownNonNegative()
1144 return SE->isKnownNonNegative(S); in isKnownNonNegative()
1254 SE->isKnownNonNegative(Delta) ? Delta : SE->getNegativeSCEV(Delta); in strongSIVtest()
1256 SE->isKnownNonNegative(Coeff) ? Coeff : SE->getNegativeSCEV(Coeff); in strongSIVtest()
1315 bool DeltaMaybeNegative = !SE->isKnownNonNegative(Delta); in strongSIVtest()
1317 bool CoeffMaybeNegative = !SE->isKnownNonNegative(Coeff); in strongSIVtest()
2130 if (SE->isKnownNonNegative(A1)) { in symbolicRDIVtest()
[all …]
|
| H A D | ScalarEvolution.cpp | 2123 if (isKnownNonNegative(Op)) in getSignExtendExprImpl()
2443 return SE->isKnownNonNegative(S); in StrengthenNoWrapFlags()
3812 (NW.hasNoUnsignedSignedWrap() && isKnownNonNegative(Offset)); in getGEPExpr()
4710 if (RHSIsNotMinSigned || isKnownNonNegative(LHS)) { in getMinusSCEV()
5895 (NW.hasNoUnsignedSignedWrap() && isKnownNonNegative(Accum))) in createAddRecFromPHI()
6742 if (!isKnownNonNegative(AddRec->getOperand(i))) in getRangeRef()
8060 if (isKnownNonNegative(getSCEV(U->getOperand(0))) && in createSCEV()
8061 isKnownNonNegative(getSCEV(U->getOperand(1)))) in createSCEV()
8067 if (isKnownNonNegative(getSCEV(U->getOperand(0))) && in createSCEV()
8068 isKnownNonNegative(getSCEV(U->getOperand(1)))) in createSCEV()
[all …]
|
| H A D | ValueTracking.cpp | 284 bool llvm::isKnownNonNegative(const Value *V, const SimplifyQuery &SQ, in isKnownNonNegative() function in llvm
382 bool isKnownNonNegative = false; in computeKnownBitsMul() local
387 isKnownNonNegative = true; in computeKnownBitsMul()
394 isKnownNonNegative = (isKnownNegativeOp1 && isKnownNegativeOp0) || in computeKnownBitsMul()
398 if (!isKnownNonNegative) in computeKnownBitsMul()
417 if (isKnownNonNegative && !Known.isNegative()) in computeKnownBitsMul()
|
| H A D | LoopAccessAnalysis.cpp | 2066 if (SE.isKnownNonNegative(Dist)) { in isDependent()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | SimplifyIndVar.cpp | 281 SE->isKnownNonNegative(S) && SE->isKnownNonNegative(X)) { in eliminateIVComparison()
309 if (SE->isKnownNonNegative(N) && SE->isKnownNonNegative(D)) { in eliminateSDiv()
383 bool IsNumeratorNonNegative = !IsSigned || SE->isKnownNonNegative(N); in simplifyIVRemainder()
409 if (!IsSigned || !SE->isKnownNonNegative(D)) in simplifyIVRemainder()
552 return SE->isKnownNonNegative(SCEVOP1) && SE->isKnownNonNegative(SCEVOP2); in eliminateTrunc()
|
| H A D | LoopUtils.cpp | 1848 if (!SE.isKnownNonNegative( in expandBounds()
|
| H A D | ScalarEvolutionExpander.cpp | 1350 SE.isKnownNonNegative(S->getOperand())); in visitZeroExtendExpr()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | NaryReassociate.cpp | 368 if (isKnownNonNegative(ZExt->getOperand(0), SQ)) in tryReassociateGEPAtIndex()
405 if (isKnownNonNegative(LHS, SimplifyQuery(*DL, DT, AC, GEP)) && in tryReassociateGEPAtIndex()
|
| H A D | ConstraintElimination.cpp | 465 if (!isKnownNonNegative(Index, DL)) in decomposeGEP()
570 if (!isKnownNonNegative(Op0, DL)) in decompose()
573 if (!isKnownNonNegative(Op1, DL)) in decompose()
767 isKnownNonNegative(Op0, DL, /*Depth=*/MaxAnalysisRecursionDepth - 1) && in getConstraintForSolving()
768 isKnownNonNegative(Op1, DL, /*Depth=*/MaxAnalysisRecursionDepth - 1)) in getConstraintForSolving()
841 isKnownNonNegative(V, DL, /*Depth=*/MaxAnalysisRecursionDepth - 1); in transferToOtherSystem()
|
| H A D | GuardWidening.cpp | 826 if (!isKnownNonNegative(Check.getLength(), DL)) in parseRangeChecks()
|
| H A D | SeparateConstOffsetFromGEP.cpp | 996 return isKnownNonNegative(V, *DL); in reorderGEP()
|
| H A D | Reassociate.cpp | 541 Flags.AllKnownNonNegative &= isKnownNonNegative(V, SimplifyQuery(DL)); in LinearizeExprTree()
549 Flags.AllKnownNonNegative &= isKnownNonNegative(V, SimplifyQuery(DL)); in LinearizeExprTree()
|
| H A D | LoopIdiomRecognize.cpp | 1863 if (DefX->getOpcode() == Instruction::AShr && !isKnownNonNegative(InitX, DL)) in detectShiftUntilZeroIdiom()
2879 !isMustProgress(CurLoop) && !SE->isKnownNonNegative(SE->getSCEV(Val))) { in detectShiftUntilZeroIdiom()
|
| H A D | LICM.cpp | 2514 return isKnownNonNegative(V, SimplifyQuery(DL, DT, AC, GEP)); in hoistGEP()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | DependenceAnalysis.h | 591 /// isKnownNonNegative - Compare to see if S is known not to be negative
594 bool isKnownNonNegative(const SCEV *S, const Value *Ptr) const;
|
| H A D | ValueTracking.h | 153 bool isKnownNonNegative(const Value *V, const SimplifyQuery &SQ,
|
| H A D | ScalarEvolution.h | 1023 bool isKnownNonNegative(const SCEV *S);
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/InstCombine/ |
| H A D | InstCombineCasts.cpp | 1285 if (isKnownNonNegative(Src, SQ.getWithInstruction(&Zext))) { in visitZExt()
1443 if (isKnownNonNegative(Src, SQ.getWithInstruction(&Sext))) { in visitSExt()
1990 if (!CI.hasNonNeg() && isKnownNonNegative(CI.getOperand(0), SQ)) { in visitUIToFP()
2000 if (isKnownNonNegative(CI.getOperand(0), SQ)) { in visitSIToFP()
2075 isKnownNonNegative(Offset, SQ.getWithInstruction(&CI)))) in visitPtrToInt()
|
| H A D | InstructionCombining.cpp | 3006 return GEP.isInBounds() && AddIsNSW && isKnownNonNegative(Idx1, Q) && in visitGetElementPtrInst()
3007 isKnownNonNegative(Idx2, Q); in visitGetElementPtrInst()
|
| H A D | InstCombineCalls.cpp | 1248 isKnownNonNegative(C0, SQ) && isKnownNonNegative(C1, SQ))) in reassociateMinMaxWithConstants()
|
| H A D | InstCombineCompares.cpp | 4355 (match(M, m_NonNegative()) || isKnownNonNegative(M, Q)); in foldICmpWithLowBitMaskedVal()
5386 if (isKnownNonNegative(Z, SQ.getWithInstruction(&I)) && in foldICmpWithMinMax()
5387 isKnownNonNegative(MinMax, SQ.getWithInstruction(&I))) { in foldICmpWithMinMax()
|
| H A D | InstCombineMulDivRem.cpp | 1686 if (isKnownNonNegative(Op1, SQ.getWithInstruction(&I))) { in visitSDiv()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
| H A D | SLPVectorizer.cpp | 8719 bool IsSigned = !isKnownNonNegative(V, SimplifyQuery(*R.DL)); in createShuffle()
11633 V, Ty, !isKnownNonNegative(Scalar, SimplifyQuery(*DL))); in gather()
11773 V2, V1->getType(), !isKnownNonNegative(V2, SimplifyQuery(DL))); in createShuffleVector()
11776 V1, V2->getType(), !isKnownNonNegative(V1, SimplifyQuery(DL))); in createShuffleVector()
11861 IsSigned.value_or(!isKnownNonNegative(V, SimplifyQuery(*R.DL)))); in castToScalarTyElem()
12021 return !isKnownNonNegative( in add()
12027 return !isKnownNonNegative( in add()
12038 return !isKnownNonNegative( in add()
12819 return !isKnownNonNegative(R, SimplifyQuery(*DL)); in vectorizeTree()
13802 !isKnownNonNegative(E in vectorizeTree()
[all...] |