Home
last modified time | relevance | path

Searched refs:IsKnownNonNegative (Results 1 – 4 of 4) sorted by relevance

/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DConstraintElimination.cpp335 bool IsKnownNonNegative; member
338 bool IsKnownNonNegative = false) in DecompEntry()
340 IsKnownNonNegative(IsKnownNonNegative) {} in DecompEntry()
349 Decomposition(Value *V, bool IsKnownNonNegative = false) { in Decomposition()
350 Vars.emplace_back(1, V, IsKnownNonNegative); in Decomposition()
521 bool IsKnownNonNegative = false; in decompose() local
536 IsKnownNonNegative = true; in decompose()
545 return {V, IsKnownNonNegative}; in decompose()
553 return {V, IsKnownNonNegative}; in decompose()
561 return {V, IsKnownNonNegative}; in decompose()
[all …]
H A DSeparateConstOffsetFromGEP.cpp1025 auto IsKnownNonNegative = [this](Value *V) { in reorderGEP() local
1028 IsChainInBounds &= all_of(GEP->indices(), IsKnownNonNegative); in reorderGEP()
1030 IsChainInBounds &= all_of(PtrGEP->indices(), IsKnownNonNegative); in reorderGEP()
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DLoopAccessAnalysis.cpp228 bool IsKnownNonNegative = SE.isKnownNonNegative(Step); in evaluatePtrAddRecAtMaxBTCWillNotWrap() local
229 if (!IsKnownNonNegative && !SE.isKnownNegative(Step)) in evaluatePtrAddRecAtMaxBTCWillNotWrap()
252 if (IsKnownNonNegative) { in evaluatePtrAddRecAtMaxBTCWillNotWrap()
H A DScalarEvolution.cpp2445 auto IsKnownNonNegative = [&](const SCEV *S) { in StrengthenNoWrapFlags() local
2449 if (SignOrUnsignWrap == SCEV::FlagNSW && all_of(Ops, IsKnownNonNegative)) in StrengthenNoWrapFlags()
2493 Ops[0]->isZero() && IsKnownNonNegative(Ops[1])) in StrengthenNoWrapFlags()