Lines Matching full:sign
51 cmp = a->sign < b->sign;
175 inc = p->sign ? 0 : round_mask;
176 overflow_norm = p->sign;
179 inc = p->sign ? round_mask : 0;
180 overflow_norm = !p->sign;
343 bool b_sign = b->sign ^ subtract;
346 if (a->sign != b_sign) {
352 /* Subtract was exact, fall through to set sign. */
357 a->sign = s->float_rounding_mode == float_round_down;
408 b->sign = b_sign;
424 bool sign = a->sign ^ b->sign;
438 a->sign = sign;
456 a->sign = sign;
462 a->sign = sign;
474 * negation is that negating externally will flip the sign bit on NaNs.)
499 c->sign ^= 1;
502 /* Compute the sign of the product into A. */
503 a->sign ^= b->sign;
505 a->sign ^= 1;
515 if (c->cls == float_class_inf && a->sign != c->sign) {
528 if (a->sign != c->sign) {
537 a->sign = c->sign;
542 p_widen.sign = a->sign;
556 if (a->sign == c->sign) {
565 a->sign = p_widen.sign;
574 a->sign ^= 1;
579 a->sign = s->float_rounding_mode == float_round_down;
602 bool sign = a->sign ^ b->sign;
605 a->sign = sign;
625 a->sign = sign;
719 if (unlikely(a->sign)) {
728 if (unlikely(a->sign)) {
935 one = !a->sign;
938 one = a->sign;
996 inc = a->sign ? 0 : rnd_mask;
999 inc = a->sign ? rnd_mask : 0;
1058 * conversion overflows, the largest integer with the same sign as `a'
1079 r = p->sign ? min : max;
1096 if (p->sign) {
1146 r = p->sign ? 0 : max;
1162 if (p->sign) {
1231 overflow = !p->sign || p->frac_hi != DECOMPOSED_IMPLICIT_BIT;
1247 if (p->sign) {
1286 p->sign = true;
1398 * Take the sign into account.
1402 if (a->sign != b->sign) {
1404 cmp = a->sign ? -1 : 1;
1405 } else if (a->sign) {
1428 if (a->sign != b->sign) {
1438 if (a->sign) {
1464 if (a->sign == b->sign) {
1474 return a->sign ? float_relation_less : float_relation_greater;
1476 return b->sign ? float_relation_greater : float_relation_less;
1519 a->sign = 1;
1522 if (unlikely(a->sign)) {
1531 if (unlikely(a->sign)) {