Lines Matching refs:sign

117    appropriate sign.  */
600 sign = rhs.sign;
623 sign = Negative;
696 sign = rhs.sign;
785 sign != rhs.sign)
799 sign = 0;
810 sign = false;
1223 (rounding_mode == rmTowardPositive && !sign) ||
1224 (rounding_mode == rmTowardNegative && sign)) {
1272 return !sign;
1275 return sign;
1407 // We need to be sure to flip the sign here for subtraction because we
1409 sign = rhs.sign ^ subtract;
1417 sign = rhs.sign ^ subtract;
1422 sign = rhs.sign ^ subtract;
1432 if (((sign ^ rhs.sign)!=0) != subtract) {
1454 subtract ^= static_cast<bool>(sign ^ rhs.sign);
1481 sign = !sign;
1528 sign = false;
1534 sign = false;
1577 sign = false;
1621 sign = false;
1639 /* Change sign. */
1644 sign = !sign;
1651 sign = 0;
1658 sign = rhs.sign;
1685 if (rhs.category != fcZero || (sign == rhs.sign) == subtract)
1686 sign = (rounding_mode == rmTowardNegative);
1712 sign ^= rhs.sign;
1731 sign ^= rhs.sign;
1750 unsigned int origSign = sign;
1775 sign = origSign; // IEEE754 requires this
1790 unsigned int origSign = sign;
1815 sign = origSign; // IEEE754 requires this
1829 /* Post-multiplication sign, before addition. */
1830 sign ^= multiplicand.sign;
1847 if (category == fcZero && !(fs & opUnderflow) && sign != addend.sign)
1848 sign = (rounding_mode == rmTowardNegative);
1892 // Preserve the input sign so that we can handle 0.0/-0.0 cases correctly.
1901 // Restore the input sign.
1933 if (sign)
1941 if (rhs.sign)
1947 if (sign == rhs.sign)
1949 else if (sign)
1961 /* Two normal numbers. Do they have the same sign? */
1962 if (sign != rhs.sign) {
1963 if (sign)
1971 if (sign) {
2117 *isExact = !sign;
2169 if (sign) {
2176 We lose a bit for the sign, but care is needed as the
2225 else if (sign)
2231 if (sign && isSigned)
2256 rounding according to ROUNDING_MODE. The sign of the floating
2297 sign = false;
2299 sign = true;
2308 integer is signed, in which case it must be sign-extended. */
2322 sign = true;
2329 sign = false;
2345 sign = false;
2347 sign = true;
2460 APFloat decSig = APFloat::getZero(calcSemantics, sign);
2671 /* Handle a leading minus sign. */
2674 sign = *p == '-' ? 1 : 0;
2721 if (sign)
2869 // NaN has no sign, fix it at zero.
2870 Arg.isNaN() ? (uint8_t)0 : (uint8_t)Arg.sign,
2874 return hash_combine((uint8_t)Arg.category, (uint8_t)Arg.sign,
2917 words[1] = ((uint64_t)(sign & 1) << 15) |
3002 words[1] = ((uint64_t)(sign & 1) << 63) |
3034 return APInt(64, ((((uint64_t)(sign & 1) << 63) |
3064 return APInt(32, (((sign&1) << 31) | ((myexponent&0xff) << 23) |
3093 return APInt(16, (((sign&1) << 15) | ((myexponent&0x1f) << 10) |
3161 sign = static_cast<unsigned int>(i2>>15);
3222 sign = static_cast<unsigned int>(i2>>63);
3260 sign = static_cast<unsigned int>(i>>63);
3293 sign = i >> 31;
3301 // sign, exponent, significand meaningless
3326 sign = i >> 15;
3334 // sign, exponent, significand meaningless
3400 // sign = {Negative}
3404 sign = Negative;
3425 // sign = {Negative}
3429 sign = Negative;
3437 // sign = {Negative}
3447 // sign = {Negative}
3459 // sign = {Negative}
3465 Val.sign = Negative;
3813 /// appropriate sign switching before/after the computation.
3815 // If we are performing nextDown, swap sign so we have -x.
3837 // For consistency, propagate the sign of the sNaN to the qNaN.
3923 // If we are performing nextDown, swap sign so we have -nextUp(-x)
3933 sign = Negative;
3941 sign = Negative;