Lines Matching refs:low
38 #define num_zerop(num) ((num.low | num.high) == 0)
39 #define num_eq(num1, num2) (num1.low == num2.low && num1.high == num2.high)
852 result.low = 0; in cpp_interpret_integer()
862 result.low = p[0] - '0'; in cpp_interpret_integer()
905 if (result.low < max) in cpp_interpret_integer()
906 result.low = result.low * base + c; in cpp_interpret_integer()
982 result.low = num.low << shift; in append_digit()
983 result.high |= num.low >> (PART_PRECISION - shift); in append_digit()
988 add_low = num.low << 1; in append_digit()
989 add_high = (num.high << 1) + (num.low >> (PART_PRECISION - 1)); in append_digit()
998 if (result.low + add_low < result.low) in append_digit()
1003 result.low += add_low; in append_digit()
1009 num.low = result.low; in append_digit()
1089 result.low = node && _cpp_defined_macro_p (node); in parse_defined()
1131 result.high = result.low = 0; in eval_token()
1144 result.low = cc; in eval_token()
1149 result.low |= ~(~(cpp_num_part) 0 in eval_token()
1165 result.low = (token->val.node.node == pfile->spec_nodes.n_true); in eval_token()
1170 result.low = 0; in eval_token()
1193 result.low = temp; in eval_token()
1535 top->value.low = (!num_zerop (top->value) in reduce()
1547 top->value.low = (!num_zerop (top->value) in reduce()
1658 num.low &= ((cpp_num_part) 1 << precision) - 1; in num_trim()
1675 return (num.low & (cpp_num_part) 1 << (precision - 1)) == 0; in num_positive()
1692 else if (num.low & (cpp_num_part) 1 << (precision - 1)) in cpp_num_sign_extend()
1695 num.low |= ~(~(cpp_num_part) 0 >> (PART_PRECISION - precision)); in cpp_num_sign_extend()
1711 num.low = ~num.low; in num_negate()
1712 if (++num.low == 0) in num_negate()
1740 return (pa.high > pb.high) || (pa.high == pb.high && pa.low >= pb.low); in num_greater_eq()
1755 lhs.low &= rhs.low; in num_bitwise_op()
1760 lhs.low |= rhs.low; in num_bitwise_op()
1765 lhs.low ^= rhs.low; in num_bitwise_op()
1780 lhs.low = gte; in num_inequality_op()
1782 lhs.low = !gte; in num_inequality_op()
1784 lhs.low = gte && !num_eq (lhs, rhs); in num_inequality_op()
1786 lhs.low = !gte || num_eq (lhs, rhs); in num_inequality_op()
1803 lhs.low = eq; in num_equality_op()
1823 num.high = num.low = sign_mask; in num_rshift()
1828 num.high = sign_mask, num.low |= sign_mask << precision; in num_rshift()
1835 num.low = num.high; in num_rshift()
1841 num.low = (num.low >> n) | (num.high << (PART_PRECISION - n)); in num_rshift()
1858 num.high = num.low = 0; in num_lshift()
1869 num.high = num.low; in num_lshift()
1870 num.low = 0; in num_lshift()
1874 num.high = (num.high << m) | (num.low >> (PART_PRECISION - m)); in num_lshift()
1875 num.low <<= m; in num_lshift()
1910 num.low = ~num.low; in num_unary_op()
1916 num.low = num_zerop (num); in num_unary_op()
1951 n = rhs.low; in num_binary_op()
1960 result.low = lhs.low - rhs.low; in num_binary_op()
1962 if (result.low > lhs.low) in num_binary_op()
1977 result.low = lhs.low + rhs.low; in num_binary_op()
1979 if (result.low < lhs.low) in num_binary_op()
2014 result.low = LOW_PART (lhs) * LOW_PART (rhs); in num_part_mul()
2020 temp = result.low; in num_part_mul()
2021 result.low += LOW_PART (middle[0]) << (PART_PRECISION / 2); in num_part_mul()
2022 if (result.low < temp) in num_part_mul()
2025 temp = result.low; in num_part_mul()
2026 result.low += LOW_PART (middle[1]) << (PART_PRECISION / 2); in num_part_mul()
2027 if (result.low < temp) in num_part_mul()
2057 result = num_part_mul (lhs.low, rhs.low); in num_mul()
2059 temp = num_part_mul (lhs.high, rhs.low); in num_mul()
2060 result.high += temp.low; in num_mul()
2064 temp = num_part_mul (lhs.low, rhs.high); in num_mul()
2065 result.high += temp.low; in num_mul()
2069 temp.low = result.low, temp.high = result.high; in num_mul()
2119 else if (rhs.low) in num_div_op()
2127 if (rhs.low & mask) in num_div_op()
2148 result.high = result.low = 0; in num_div_op()
2157 result.low |= (cpp_num_part) 1 << i; in num_div_op()
2161 sub.low = (sub.low >> 1) | (sub.high << (PART_PRECISION - 1)); in num_div_op()