| /freebsd-14.2/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | DependenceAnalysis.cpp | 1083 return SE->isKnownNonNegative(Delta); in isKnownPredicate() 1137 if (SE->isKnownNonNegative(AddRec->getStart()) && in isKnownNonNegative() 1138 SE->isKnownNonNegative(AddRec->getOperand(1))) in isKnownNonNegative() 1144 return SE->isKnownNonNegative(S); in isKnownNonNegative() 1315 bool DeltaMaybeNegative = !SE->isKnownNonNegative(Delta); in strongSIVtest() 2130 if (SE->isKnownNonNegative(A1)) { in symbolicRDIVtest() 2131 if (SE->isKnownNonNegative(A2)) { in symbolicRDIVtest() 2173 if (SE->isKnownNonNegative(A2)) { in symbolicRDIVtest() 3453 if (!isKnownNonNegative(S, Ptr)) in tryDelinearizeFixedSize() 3534 if (!isKnownNonNegative(SrcSubscripts[I], SrcPtr)) in tryDelinearizeParametricSize() [all …]
|
| H A D | ScalarEvolution.cpp | 2121 if (isKnownNonNegative(Op)) in getSignExtendExprImpl() 2441 return SE->isKnownNonNegative(S); in StrengthenNoWrapFlags() 8045 isKnownNonNegative(getSCEV(U->getOperand(1)))) in createSCEV() 8052 isKnownNonNegative(getSCEV(U->getOperand(1)))) in createSCEV() 10967 if (isKnownNonNegative(Step)) in getMonotonicPredicateTypeImpl() 11052 isKnownNonNegative(RHS) && in getLoopInvariantPredicate() 11298 return isKnownNonNegative(RHS) && in isKnownPredicateViaSplitting() 11724 if ((isKnownNonNegative(FoundLHS) && isKnownNonNegative(FoundRHS)) || in isImpliedCondBalancedTypes() 12196 if (isKnownNonNegative(ShifteeS)) in isImpliedCondOperandsViaShift() 12329 if (isKnownNonNegative(FoundLHS) && isKnownNonNegative(FoundRHS)) { in isImpliedViaOperations() [all …]
|
| H A D | ValueTracking.cpp | 286 bool llvm::isKnownNonNegative(const Value *V, const SimplifyQuery &SQ, in isKnownNonNegative() function in llvm 298 return isKnownNonNegative(V, SQ, Depth) && ::isKnownNonZero(V, Depth, SQ); in isKnownPositive() 375 bool isKnownNonNegative = false; in computeKnownBitsMul() local 380 isKnownNonNegative = true; in computeKnownBitsMul() 387 isKnownNonNegative = (isKnownNegativeOp1 && isKnownNegativeOp0) || in computeKnownBitsMul() 391 if (!isKnownNonNegative) in computeKnownBitsMul() 410 if (isKnownNonNegative && !Known.isNegative()) in computeKnownBitsMul()
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | SimplifyIndVar.cpp | 272 SE->isKnownNonNegative(S) && SE->isKnownNonNegative(X)) { in eliminateIVComparison() 300 if (SE->isKnownNonNegative(N) && SE->isKnownNonNegative(D)) { in eliminateSDiv() 371 bool IsNumeratorNonNegative = !IsSigned || SE->isKnownNonNegative(N); in simplifyIVRemainder() 397 if (!IsSigned || !SE->isKnownNonNegative(D)) in simplifyIVRemainder() 538 return SE->isKnownNonNegative(SCEVOP1) && SE->isKnownNonNegative(SCEVOP2); in eliminateTrunc()
|
| H A D | LoopUtils.cpp | 1703 if (!Exp.getSE()->isKnownNonNegative(Recur)) { in expandBounds()
|
| H A D | ScalarEvolutionExpander.cpp | 1293 SE.isKnownNonNegative(S->getOperand())); in visitZeroExtendExpr()
|
| /freebsd-14.2/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 | 464 if (!isKnownNonNegative(Index, DL, /*Depth=*/MaxAnalysisRecursionDepth - 1)) in decomposeGEP() 554 if (!isKnownNonNegative(Op0, DL, /*Depth=*/MaxAnalysisRecursionDepth - 1)) in decompose() 557 if (!isKnownNonNegative(Op1, DL, /*Depth=*/MaxAnalysisRecursionDepth - 1)) in decompose() 751 isKnownNonNegative(Op0, DL, /*Depth=*/MaxAnalysisRecursionDepth - 1) && in getConstraintForSolving() 752 isKnownNonNegative(Op1, DL, /*Depth=*/MaxAnalysisRecursionDepth - 1)) in getConstraintForSolving() 825 isKnownNonNegative(V, DL, /*Depth=*/MaxAnalysisRecursionDepth - 1); in transferToOtherSystem()
|
| H A D | GuardWidening.cpp | 821 if (!isKnownNonNegative(Check.getLength(), DL)) in parseRangeChecks()
|
| H A D | LoopIdiomRecognize.cpp | 1728 if (DefX->getOpcode() == Instruction::AShr && !isKnownNonNegative(InitX, DL)) in detectShiftUntilZeroIdiom() 2662 !isMustProgress(CurLoop) && !SE->isKnownNonNegative(SE->getSCEV(Val))) { in detectShiftUntilZeroIdiom()
|
| H A D | LICM.cpp | 2499 return isKnownNonNegative(V, SimplifyQuery(DL, DT, AC, GEP)); in hoistGEP()
|
| /freebsd-14.2/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | DependenceAnalysis.h | 594 bool isKnownNonNegative(const SCEV *S, const Value *Ptr) const;
|
| H A D | ValueTracking.h | 140 bool isKnownNonNegative(const Value *V, const SimplifyQuery &SQ,
|
| H A D | ScalarEvolution.h | 1015 bool isKnownNonNegative(const SCEV *S);
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/InstCombine/ |
| H A D | InstCombineCasts.cpp | 1247 if (isKnownNonNegative(Src, SQ.getWithInstruction(&Zext))) { in visitZExt() 1405 if (isKnownNonNegative(Src, SQ.getWithInstruction(&Sext))) { in visitSExt()
|
| H A D | InstCombineMulDivRem.cpp | 1551 if (isKnownNonNegative(Op1, SQ.getWithInstruction(&I))) { in visitSDiv()
|
| H A D | InstCombineCompares.cpp | 5058 if (isKnownNonNegative(Z, SQ.getWithInstruction(&I)) && in foldICmpWithMinMax() 5059 isKnownNonNegative(MinMax, SQ.getWithInstruction(&I))) { in foldICmpWithMinMax()
|