Lines Matching refs:Overflow
903 // Return infinity for exponent overflow
1538 // overflow. Note that this can require an extra word in u so that u must
2009 APInt APInt::sadd_ov(const APInt &RHS, bool &Overflow) const {
2011 Overflow = isNonNegative() == RHS.isNonNegative() &&
2016 APInt APInt::uadd_ov(const APInt &RHS, bool &Overflow) const {
2018 Overflow = Res.ult(RHS);
2022 APInt APInt::ssub_ov(const APInt &RHS, bool &Overflow) const {
2024 Overflow = isNonNegative() != RHS.isNonNegative() &&
2029 APInt APInt::usub_ov(const APInt &RHS, bool &Overflow) const {
2031 Overflow = Res.ugt(*this);
2035 APInt APInt::sdiv_ov(const APInt &RHS, bool &Overflow) const {
2036 // MININT/-1 --> overflow.
2037 Overflow = isMinSignedValue() && RHS.isAllOnesValue();
2041 APInt APInt::smul_ov(const APInt &RHS, bool &Overflow) const {
2045 Overflow = Res.sdiv(RHS) != *this || Res.sdiv(*this) != RHS;
2047 Overflow = false;
2051 APInt APInt::umul_ov(const APInt &RHS, bool &Overflow) const {
2055 Overflow = Res.udiv(RHS) != *this || Res.udiv(*this) != RHS;
2057 Overflow = false;
2061 APInt APInt::sshl_ov(const APInt &ShAmt, bool &Overflow) const {
2062 Overflow = ShAmt.uge(getBitWidth());
2063 if (Overflow)
2067 Overflow = ShAmt.uge(countLeadingZeros());
2069 Overflow = ShAmt.uge(countLeadingOnes());
2074 APInt APInt::ushl_ov(const APInt &ShAmt, bool &Overflow) const {
2075 Overflow = ShAmt.uge(getBitWidth());
2076 if (Overflow)
2079 Overflow = ShAmt.ugt(countLeadingZeros());
2539 If DSTPARTS == SRCPARTS + 1 no overflow occurs and zero is
2542 parts were zero return zero, otherwise overflow occurred and
2564 This cannot overflow, because
2611 /* Full multiplication, there is no overflow. */
2620 /* We would overflow if any significant unwritten parts would be
2635 one if overflow occurred, otherwise zero. DST must be disjoint
2642 int overflow;
2646 overflow = 0;
2650 overflow |= tcMultiplyPart(&dst[i], lhs, rhs[i], 0, parts,
2653 return overflow;
2657 operands. No overflow occurs. DST must be disjoint from both
