/freebsd/contrib/llvm-project/llvm/lib/IR/ |
H A D | ConstantRange.cpp | 258 return getUnsignedMax().ule(Other.getUnsignedMin()); in icmp() 511 return Lower.ule(V) && V.ult(Upper); in contains() 512 return Lower.ule(V) || V.ult(Upper); in contains() 523 return Lower.ule(Other.getLower()) && Other.getUpper().ule(Upper); in contains() 527 return Other.getUpper().ule(Upper) || in contains() 528 Lower.ule(Other.getLower()); in contains() 530 return Other.getUpper().ule(Upper) && Lower.ule(Other.getLower()); in contains() 596 if (Upper.ule(CR.Lower)) in intersectWith() 632 if (CR.Upper.ule(Lower)) in intersectWith() 642 if (CR.Upper.ule(Lower)) in intersectWith() [all …]
|
/freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | ScalarEvolutionAliasAnalysis.cpp | 84 ASizeInt.ule(SE.getUnsignedRange(BA).getUnsignedMin()) && in alias() 99 BSizeInt.ule(SE.getUnsignedRange(AB).getUnsignedMin()) && in alias()
|
H A D | BasicAliasAnalysis.cpp | 1184 Off.ule(INT32_MAX) && (Off + VRightSize.getValue()).ule(LSize)) { in aliasGEP() 1325 return Var.Scale.ule( in aliasGEP()
|
H A D | InstructionSimplify.cpp | 2386 C->ule(X->getType()->getScalarSizeInBits())) { in simplifyOrInst() 3206 C1->ule(*C2)) || in simplifyICmpWithBinOpOnLHS() 3208 C1->ule(APInt(C2->getBitWidth(), 1) << *C2)) || in simplifyICmpWithBinOpOnLHS() 3210 (APInt(C1->getBitWidth(), 1) << *C1).ule(*C2))) { in simplifyICmpWithBinOpOnLHS()
|
H A D | ScalarEvolution.cpp | 2677 ConstAdd.ule(C1)) { in getAddExpr() 2686 ConstAdd.abs().ule(C1.abs())) { in getAddExpr() 6159 if (isa<SCEVConstant>(C) && cast<SCEVConstant>(C)->getAPInt().ule(1)) in createNodeForSelectOrPHIInstWithICmpInstCond() 11341 if (MatchBinaryAddToConst(LHS, RHS, C1, C2, SCEV::FlagNUW) && C1.ule(C2)) in isKnownPredicateViaNoOverflow() 12839 return getUnsignedRangeMax(applyLoopGuards(RHS, L)).ule(Limit); in howManyLessThans()
|
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/ |
H A D | APInt.h | 1130 bool ule(const APInt &RHS) const { return compare(RHS) <= 0; } in ule() function 1138 bool ule(uint64_t RHS) const { return !ugt(RHS); } in ule() function 1162 bool ugt(const APInt &RHS) const { return !ule(RHS); } in ugt()
|
H A D | APSInt.h | 176 return IsUnsigned ? ule(RHS) : sle(RHS);
|
/freebsd/contrib/llvm-project/llvm/include/llvm/Support/ |
H A D | KnownBits.h | 430 static std::optional<bool> ule(const KnownBits &LHS, const KnownBits &RHS);
|
/freebsd/contrib/llvm-project/llvm/lib/Target/Mips/ |
H A D | MicroMipsInstrFPU.td | 341 def C_ULE_#NAME#_MM : MMRel, C_COND_FT<"ule", TypeStr, RC, itin>, 343 let BaseOpcode = "c.ule."#NAME;
|
H A D | MipsInstrFPU.td | 318 def C_ULE_#NAME : MMRel, C_COND_FT<"ule", TypeStr, RC, itin>, 320 let BaseOpcode = "c.ule."#NAME; 883 def : MipsInstAlias<!strconcat("c.ule.", TypeStr, " $fs, $ft"),
|
H A D | Mips32r6InstrInfo.td | 264 CMP_CONDN_DESC_BASE<"ule", Typestr, FGROpnd, Itin, 266 MipsR6Arch<!strconcat("cmp.ule.", Typestr)>,
|
H A D | MicroMips32r6InstrInfo.td | 976 !strconcat("cmp.ule.", Typestr), format, FIELD_CMP_COND_ULE>, 977 CMP_CONDN_DESC_BASE<"ule", Typestr, FGROpnd, Itin, setule>, HARDFLOAT,
|
H A D | MipsSEISelLowering.cpp | 767 if ((Val - Floor).ule(Ceil - Val)) { in shouldTransformMulToShiftsAddsSubs() 815 if ((C - Floor).ule(Ceil - C)) { in genConstMult()
|
/freebsd/contrib/llvm-project/llvm/lib/Support/ |
H A D | KnownBits.cpp | 504 if (LHS.getMaxValue().ule(RHS.getMinValue())) in ugt() 522 std::optional<bool> KnownBits::ule(const KnownBits &LHS, const KnownBits &RHS) { in ule() function in KnownBits
|
H A D | APInt.cpp | 1212 if (i >= nbits || this->ule(testy)) { in sqrt() 1220 if (x_old.ule(x_new)) in sqrt() 1235 assert(this->ule(nextSquare) && "Error in APInt::sqrt computation"); in sqrt()
|
/freebsd/contrib/llvm-project/llvm/lib/AsmParser/ |
H A D | LLLexer.cpp | 699 KEYWORD(sge); KEYWORD(ult); KEYWORD(ugt); KEYWORD(ule); KEYWORD(uge); in LexIdentifier()
|
/freebsd/contrib/llvm-project/llvm/lib/Transforms/InstCombine/ |
H A D | InstCombineCompares.cpp | 4038 if (Pred == ICmpInst::ICMP_ULT && C.uge(1) && C.ule(BitWidth)) { in foldICmpIntrinsicWithConstant() 4060 if (Pred == ICmpInst::ICMP_ULT && C.uge(1) && C.ule(BitWidth)) { in foldICmpIntrinsicWithConstant() 4623 if (NewShAmtSplat && NewShAmtSplat->getUniqueInteger().ule(MinLeadZero)) in foldShiftIntoShiftInAnotherHandOfAndInICmp() 4637 if (AdjNewShAmt.ule(MinLeadZero)) in foldShiftIntoShiftInAnotherHandOfAndInICmp() 5117 A, C3, "", Op0HasNUW && Diff.ule(*AP1), Op0HasNSW); in foldICmpBinOp() 5123 C, C3, "", Op1HasNUW && Diff.ule(*AP2), Op1HasNSW); in foldICmpBinOp() 6626 if (Op0Max.ule(Op1Min)) // A >u B -> false if max(A) <= max(B) in foldICmpUsingKnownBits() 6673 if (Op0Max.ule(Op1Min)) // A <=u B -> true if max(A) <= min(B) in foldICmpUsingKnownBits()
|
H A D | InstCombineSimplifyDemanded.cpp | 428 C->ule(DemandedMask.countl_zero())) { in SimplifyDemandedUseBits()
|
H A D | InstCombineAndOrXor.cpp | 1129 Shift->ule(NumOriginalBits - NumExtractedBits)) in matchIntPart() 3013 ZextLowShlAmt->ule(Width - LowSize) && "Invalid concat"); in convertOrOfShiftsToFunnelShift()
|
H A D | InstCombineMulDivRem.cpp | 1377 if (match(A, m_APInt(C1)) && match(B, m_APInt(C2)) && C2->ule(*C1)) in commonIDivTransforms()
|
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | CorrelatedValuePropagation.cpp | 1198 if (!LRange.getUnsignedMax().ule(*RHS)) in processAnd()
|
/freebsd/contrib/llvm-project/llvm/lib/ExecutionEngine/Interpreter/ |
H A D | Execution.cpp | 280 IMPLEMENT_INTEGER_ICMP(ule,Ty); in executeICMP_ULE() 281 IMPLEMENT_VECTOR_INTEGER_ICMP(ule,Ty); in executeICMP_ULE()
|
/freebsd/contrib/llvm-project/llvm/lib/Target/Sparc/ |
H A D | SparcInstrAliases.td | 375 defm : fp_cond_alias<"ule", 0b1110>;
|
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/ |
H A D | Utils.cpp | 1047 return APInt(/*numBits=*/1, LHSCst->ule(*RHSCst)); in ConstantFoldICmp()
|
/freebsd/contrib/llvm-project/clang/lib/AST/ |
H A D | MicrosoftMangle.cpp | 1002 else if (Value.uge(1) && Value.ule(10)) in mangleBits()
|