Lines Matching full:sign
115 appropriate sign. */
598 sign = rhs.sign;
621 sign = Negative;
760 sign != rhs.sign)
780 sign = 0;
791 sign = false;
1165 /* Handle overflow. Sign is preserved. We either become infinity or
1173 (rounding_mode == rmTowardPositive && !sign) ||
1174 (rounding_mode == rmTowardNegative && sign)) {
1222 return sign == false;
1225 return sign == true;
1357 sign = false;
1365 sign = rhs.sign ^ subtract;
1370 sign = rhs.sign ^ subtract;
1374 /* Sign depends on rounding mode; handled by caller. */
1380 if (((sign ^ rhs.sign)!=0) != subtract) {
1402 subtract ^= (sign ^ rhs.sign) ? true : false;
1429 sign = !sign;
1476 sign = false;
1482 sign = false;
1525 sign = false;
1569 sign = false;
1587 /* Change sign. */
1592 sign = !sign;
1599 sign = 0;
1606 sign = rhs.sign;
1633 if (rhs.category != fcZero || (sign == rhs.sign) == subtract)
1634 sign = (rounding_mode == rmTowardNegative);
1660 sign ^= rhs.sign;
1679 sign ^= rhs.sign;
1698 unsigned int origSign = sign;
1723 sign = origSign; // IEEE754 requires this
1738 unsigned int origSign = sign;
1763 sign = origSign; // IEEE754 requires this
1777 /* Post-multiplication sign, before addition. */
1778 sign ^= multiplicand.sign;
1795 if (category == fcZero && sign != addend.sign)
1796 sign = (rounding_mode == rmTowardNegative);
1840 // Preserve the input sign so that we can handle 0.0/-0.0 cases correctly.
1849 // Restore the input sign.
1881 if (sign)
1889 if (rhs.sign)
1895 if (sign == rhs.sign)
1897 else if (sign)
1909 /* Two normal numbers. Do they have the same sign? */
1910 if (sign != rhs.sign) {
1911 if (sign)
1919 if (sign) {
2065 *isExact = !sign;
2117 if (sign) {
2124 We lose a bit for the sign, but care is needed as the
2173 else if (sign)
2179 if (sign && isSigned)
2204 rounding according to ROUNDING_MODE. The sign of the floating
2245 sign
2247 sign = true;
2256 integer is signed, in which case it must be sign-extended. */
2270 sign = true;
2277 sign = false;
2293 sign = false;
2295 sign = true;
2408 APFloat decSig = APFloat::getZero(calcSemantics, sign);
2619 /* Handle a leading minus sign. */
2622 sign = *p == '-' ? 1 : 0;
2669 if (sign)
2817 // NaN has no sign, fix it at zero.
2818 Arg.isNaN() ? (uint8_t)0 : (uint8_t)Arg.sign,
2822 return hash_combine((uint8_t)Arg.category, (uint8_t)Arg.sign,
2865 words[1] = ((uint64_t)(sign & 1) << 15) |
2950 words[1] = ((uint64_t)(sign & 1) << 63) |
2982 return APInt(64, ((((uint64_t)(sign & 1) << 63) |
3012 return APInt(32, (((sign&1) << 31) | ((myexponent&0xff) << 23) |
3041 return APInt(16, (((sign&1) << 15) | ((myexponent&0x1f) << 10) |
3109 sign = static_cast<unsigned int>(i2>>15);
3170 sign = static_cast<unsigned int>(i2>>63);
3208 sign = static_cast<unsigned int>(i>>63);
3241 sign = i >> 31;
3249 // sign, exponent, significand meaningless
3274 sign = i >> 15;
3282 // sign, exponent, significand meaningless
3344 // sign = {Negative}
3348 sign = Negative;
3367 // sign = {Negative}
3371 sign = Negative;
3379 // sign = {Negative}
3389 // sign = {Negative}
3401 // sign = {Negative}
3407 Val.sign = Negative;
3752 /// appropriate sign switching before/after the computation.
3754 // If we are performing nextDown, swap sign so we have -x.
3776 // For consistency, propogate the sign of the sNaN to the qNaN.
3862 // If we are performing nextDown, swap sign so we have -nextUp(-x)
3872 sign = Negative;
3880 sign = Negative;
