Lines Matching refs:RHS

22     const KnownBits &LHS, const KnownBits &RHS,  in computeForAddCarry()  argument
27 APInt PossibleSumZero = LHS.getMaxValue() + RHS.getMaxValue() + !CarryZero; in computeForAddCarry()
28 APInt PossibleSumOne = LHS.getMinValue() + RHS.getMinValue() + CarryOne; in computeForAddCarry()
31 APInt CarryKnownZero = ~(PossibleSumZero ^ LHS.Zero ^ RHS.Zero); in computeForAddCarry()
32 APInt CarryKnownOne = PossibleSumOne ^ LHS.One ^ RHS.One; in computeForAddCarry()
36 APInt RHSKnownUnion = RHS.Zero | RHS.One; in computeForAddCarry()
51 const KnownBits &LHS, const KnownBits &RHS, const KnownBits &Carry) { in computeForAddCarry() argument
54 LHS, RHS, Carry.Zero.getBoolValue(), Carry.One.getBoolValue()); in computeForAddCarry()
58 const KnownBits &LHS, KnownBits RHS) { in computeForAddSub() argument
63 LHS, RHS, /*CarryZero*/true, /*CarryOne*/false); in computeForAddSub()
66 std::swap(RHS.Zero, RHS.One); in computeForAddSub()
68 LHS, RHS, /*CarryZero*/false, /*CarryOne*/true); in computeForAddSub()
76 if (LHS.isNonNegative() && RHS.isNonNegative()) in computeForAddSub()
80 else if (LHS.isNegative() && RHS.isNegative()) in computeForAddSub()
88 KnownBits KnownBits::computeForSubBorrow(const KnownBits &LHS, KnownBits RHS, in computeForSubBorrow() argument
94 std::swap(RHS.Zero, RHS.One); in computeForSubBorrow()
95 return ::computeForAddCarry(LHS, RHS, in computeForSubBorrow()
129 KnownBits KnownBits::umax(const KnownBits &LHS, const KnownBits &RHS) { in umax() argument
134 if (LHS.getMinValue().uge(RHS.getMaxValue())) in umax()
136 if (RHS.getMinValue().uge(LHS.getMaxValue())) in umax()
137 return RHS; in umax()
142 KnownBits L = LHS.makeGE(RHS.getMinValue()); in umax()
143 KnownBits R = RHS.makeGE(LHS.getMinValue()); in umax()
147 KnownBits KnownBits::umin(const KnownBits &LHS, const KnownBits &RHS) { in umin() argument
150 return Flip(umax(Flip(LHS), Flip(RHS))); in umin()
153 KnownBits KnownBits::smax(const KnownBits &LHS, const KnownBits &RHS) { in smax() argument
163 return Flip(umax(Flip(LHS), Flip(RHS))); in smax()
166 KnownBits KnownBits::smin(const KnownBits &LHS, const KnownBits &RHS) { in smin() argument
176 return Flip(umax(Flip(LHS), Flip(RHS))); in smin()
186 KnownBits KnownBits::shl(const KnownBits &LHS, const KnownBits &RHS, bool NUW, in shl() argument
212 unsigned MinShiftAmount = RHS.getMinValue().getLimitedValue(BitWidth); in shl()
223 APInt MaxValue = RHS.getMaxValue(); in shl()
250 unsigned ShiftAmtZeroMask = RHS.Zero.zextOrTrunc(32).getZExtValue(); in shl()
251 unsigned ShiftAmtOneMask = RHS.One.zextOrTrunc(32).getZExtValue(); in shl()
271 KnownBits KnownBits::lshr(const KnownBits &LHS, const KnownBits &RHS, in lshr() argument
285 unsigned MinShiftAmount = RHS.getMinValue().getLimitedValue(BitWidth); in lshr()
294 APInt MaxValue = RHS.getMaxValue(); in lshr()
296 unsigned ShiftAmtZeroMask = RHS.Zero.zextOrTrunc(32).getZExtValue(); in lshr()
297 unsigned ShiftAmtOneMask = RHS.One.zextOrTrunc(32).getZExtValue(); in lshr()
317 KnownBits KnownBits::ashr(const KnownBits &LHS, const KnownBits &RHS, in ashr() argument
329 unsigned MinShiftAmount = RHS.getMinValue().getLimitedValue(BitWidth); in ashr()
342 APInt MaxValue = RHS.getMaxValue(); in ashr()
344 unsigned ShiftAmtZeroMask = RHS.Zero.zextOrTrunc(32).getZExtValue(); in ashr()
345 unsigned ShiftAmtOneMask = RHS.One.zextOrTrunc(32).getZExtValue(); in ashr()
365 std::optional<bool> KnownBits::eq(const KnownBits &LHS, const KnownBits &RHS) { in eq() argument
366 if (LHS.isConstant() && RHS.isConstant()) in eq()
367 return std::optional<bool>(LHS.getConstant() == RHS.getConstant()); in eq()
368 if (LHS.One.intersects(RHS.Zero) || RHS.One.intersects(LHS.Zero)) in eq()
373 std::optional<bool> KnownBits::ne(const KnownBits &LHS, const KnownBits &RHS) { in ne() argument
374 if (std::optional<bool> KnownEQ = eq(LHS, RHS)) in ne()
379 std::optional<bool> KnownBits::ugt(const KnownBits &LHS, const KnownBits &RHS) { in ugt() argument
381 if (LHS.getMaxValue().ule(RHS.getMinValue())) in ugt()
384 if (LHS.getMinValue().ugt(RHS.getMaxValue())) in ugt()
389 std::optional<bool> KnownBits::uge(const KnownBits &LHS, const KnownBits &RHS) { in uge() argument
390 if (std::optional<bool> IsUGT = ugt(RHS, LHS)) in uge()
395 std::optional<bool> KnownBits::ult(const KnownBits &LHS, const KnownBits &RHS) { in ult() argument
396 return ugt(RHS, LHS); in ult()
399 std::optional<bool> KnownBits::ule(const KnownBits &LHS, const KnownBits &RHS) { in ule() argument
400 return uge(RHS, LHS); in ule()
403 std::optional<bool> KnownBits::sgt(const KnownBits &LHS, const KnownBits &RHS) { in sgt() argument
405 if (LHS.getSignedMaxValue().sle(RHS.getSignedMinValue())) in sgt()
408 if (LHS.getSignedMinValue().sgt(RHS.getSignedMaxValue())) in sgt()
413 std::optional<bool> KnownBits::sge(const KnownBits &LHS, const KnownBits &RHS) { in sge() argument
414 if (std::optional<bool> KnownSGT = sgt(RHS, LHS)) in sge()
419 std::optional<bool> KnownBits::slt(const KnownBits &LHS, const KnownBits &RHS) { in slt() argument
420 return sgt(RHS, LHS); in slt()
423 std::optional<bool> KnownBits::sle(const KnownBits &LHS, const KnownBits &RHS) { in sle() argument
424 return sge(RHS, LHS); in sle()
488 const KnownBits &RHS) { in computeForSatAddSub() argument
489 assert(!LHS.hasConflict() && !RHS.hasConflict() && "Bad inputs"); in computeForSatAddSub()
492 KnownBits Res = KnownBits::computeForAddSub(Add, /*NSW*/ false, LHS, RHS); in computeForSatAddSub()
502 if (SignBitKnown(LHS) && SignBitKnown(RHS) && SignBitKnown(Res)) { in computeForSatAddSub()
505 Overflow = (LHS.isNonNegative() == RHS.isNonNegative() && in computeForSatAddSub()
509 Overflow = (LHS.isNonNegative() != RHS.isNonNegative() && in computeForSatAddSub()
516 (void)LHS.getMaxValue().uadd_ov(RHS.getMaxValue(), Of); in computeForSatAddSub()
520 (void)LHS.getMinValue().uadd_ov(RHS.getMinValue(), Of); in computeForSatAddSub()
527 (void)LHS.getMinValue().usub_ov(RHS.getMaxValue(), Of); in computeForSatAddSub()
531 (void)LHS.getMaxValue().usub_ov(RHS.getMinValue(), Of); in computeForSatAddSub()
539 if (LHS.isNonNegative() && RHS.isNonNegative()) { in computeForSatAddSub()
544 if (LHS.isNegative() && RHS.isNegative()) { in computeForSatAddSub()
550 if (LHS.isNegative() && RHS.isNonNegative()) { in computeForSatAddSub()
554 } else if (LHS.isNonNegative() && RHS.isNegative()) { in computeForSatAddSub()
567 std::max(LHS.countMinLeadingOnes(), RHS.countMinLeadingOnes()); in computeForSatAddSub()
570 std::max(LHS.countMinLeadingZeros(), RHS.countMinLeadingOnes()); in computeForSatAddSub()
634 KnownBits KnownBits::sadd_sat(const KnownBits &LHS, const KnownBits &RHS) { in sadd_sat() argument
635 return computeForSatAddSub(/*Add*/ true, /*Signed*/ true, LHS, RHS); in sadd_sat()
637 KnownBits KnownBits::ssub_sat(const KnownBits &LHS, const KnownBits &RHS) { in ssub_sat() argument
638 return computeForSatAddSub(/*Add*/ false, /*Signed*/ true, LHS, RHS); in ssub_sat()
640 KnownBits KnownBits::uadd_sat(const KnownBits &LHS, const KnownBits &RHS) { in uadd_sat() argument
641 return computeForSatAddSub(/*Add*/ true, /*Signed*/ false, LHS, RHS); in uadd_sat()
643 KnownBits KnownBits::usub_sat(const KnownBits &LHS, const KnownBits &RHS) { in usub_sat() argument
644 return computeForSatAddSub(/*Add*/ false, /*Signed*/ false, LHS, RHS); in usub_sat()
647 KnownBits KnownBits::mul(const KnownBits &LHS, const KnownBits &RHS, in mul() argument
650 assert(BitWidth == RHS.getBitWidth() && !LHS.hasConflict() && in mul()
651 !RHS.hasConflict() && "Operand mismatch"); in mul()
652 assert((!NoUndefSelfMultiply || LHS == RHS) && in mul()
661 APInt UMaxRHS = RHS.getMaxValue(); in mul()
712 const APInt &Bottom1 = RHS.One; in mul()
717 unsigned TrailBitsKnown1 = (RHS.Zero | RHS.One).countr_one(); in mul()
719 unsigned TrailZero1 = RHS.countMinTrailingZeros(); in mul()
745 KnownBits KnownBits::mulhs(const KnownBits &LHS, const KnownBits &RHS) { in mulhs() argument
747 assert(BitWidth == RHS.getBitWidth() && !LHS.hasConflict() && in mulhs()
748 !RHS.hasConflict() && "Operand mismatch"); in mulhs()
750 KnownBits WideRHS = RHS.sext(2 * BitWidth); in mulhs()
754 KnownBits KnownBits::mulhu(const KnownBits &LHS, const KnownBits &RHS) { in mulhu() argument
756 assert(BitWidth == RHS.getBitWidth() && !LHS.hasConflict() && in mulhu()
757 !RHS.hasConflict() && "Operand mismatch"); in mulhu()
759 KnownBits WideRHS = RHS.zext(2 * BitWidth); in mulhu()
764 const KnownBits &RHS, bool Exact) { in divComputeLowBit() argument
776 (int)LHS.countMinTrailingZeros() - (int)RHS.countMaxTrailingZeros(); in divComputeLowBit()
778 (int)LHS.countMaxTrailingZeros() - (int)RHS.countMinTrailingZeros(); in divComputeLowBit()
799 KnownBits KnownBits::sdiv(const KnownBits &LHS, const KnownBits &RHS, in sdiv() argument
802 if (LHS.isNonNegative() && RHS.isNonNegative()) in sdiv()
803 return udiv(LHS, RHS, Exact); in sdiv()
806 assert(!LHS.hasConflict() && !RHS.hasConflict() && "Bad inputs"); in sdiv()
809 if (LHS.isZero() || RHS.isZero()) { in sdiv()
817 if (LHS.isNegative() && RHS.isNegative()) { in sdiv()
819 APInt Denom = RHS.getSignedMaxValue(); in sdiv()
826 } else if (LHS.isNegative() && RHS.isNonNegative()) { in sdiv()
828 if (Exact || (-LHS.getSignedMaxValue()).uge(RHS.getSignedMaxValue())) { in sdiv()
829 APInt Denom = RHS.getSignedMinValue(); in sdiv()
833 } else if (LHS.isStrictlyPositive() && RHS.isNegative()) { in sdiv()
835 if (Exact || LHS.getSignedMinValue().uge(-RHS.getSignedMinValue())) { in sdiv()
836 APInt Denom = RHS.getSignedMaxValue(); in sdiv()
852 Known = divComputeLowBit(Known, LHS, RHS, Exact); in sdiv()
858 KnownBits KnownBits::udiv(const KnownBits &LHS, const KnownBits &RHS, in udiv() argument
861 assert(!LHS.hasConflict() && !RHS.hasConflict()); in udiv()
864 if (LHS.isZero() || RHS.isZero()) { in udiv()
874 APInt MinDenom = RHS.getMinValue(); in udiv()
881 Known = divComputeLowBit(Known, LHS, RHS, Exact); in udiv()
887 KnownBits KnownBits::remGetLowBits(const KnownBits &LHS, const KnownBits &RHS) { in remGetLowBits() argument
889 if (!RHS.isZero() && RHS.Zero[0]) { in remGetLowBits()
891 unsigned RHSZeros = RHS.countMinTrailingZeros(); in remGetLowBits()
900 KnownBits KnownBits::urem(const KnownBits &LHS, const KnownBits &RHS) { in urem() argument
901 assert(!LHS.hasConflict() && !RHS.hasConflict()); in urem()
903 KnownBits Known = remGetLowBits(LHS, RHS); in urem()
904 if (RHS.isConstant() && RHS.getConstant().isPowerOf2()) { in urem()
906 APInt HighBits = ~(RHS.getConstant() - 1); in urem()
914 std::max(LHS.countMinLeadingZeros(), RHS.countMinLeadingZeros()); in urem()
919 KnownBits KnownBits::srem(const KnownBits &LHS, const KnownBits &RHS) { in srem() argument
920 assert(!LHS.hasConflict() && !RHS.hasConflict()); in srem()
922 KnownBits Known = remGetLowBits(LHS, RHS); in srem()
923 if (RHS.isConstant() && RHS.getConstant().isPowerOf2()) { in srem()
925 APInt LowBits = RHS.getConstant() - 1; in srem()
946 KnownBits &KnownBits::operator&=(const KnownBits &RHS) { in operator &=() argument
948 Zero |= RHS.Zero; in operator &=()
950 One &= RHS.One; in operator &=()
954 KnownBits &KnownBits::operator|=(const KnownBits &RHS) { in operator |=() argument
956 Zero &= RHS.Zero; in operator |=()
958 One |= RHS.One; in operator |=()
962 KnownBits &KnownBits::operator^=(const KnownBits &RHS) { in operator ^=() argument
964 APInt Z = (Zero & RHS.Zero) | (One & RHS.One); in operator ^=()
966 One = (Zero & RHS.One) | (One & RHS.Zero); in operator ^=()