Home
last modified time | relevance | path

Searched refs:result_low (Results 1 – 3 of 3) sorted by relevance

/freebsd-12-stable/contrib/ntp/libparse/
Dmfp_mul.c102 u_long result_low, result_high; in mfp_mul() local
110 result_low = (u_long)a[i] * (u_long)b[j]; /* partial product */ in mfp_mul()
114 result_high = result_low >> (FRACTION_PREC/2); in mfp_mul()
115 result_low <<= FRACTION_PREC/2; in mfp_mul()
124 if (((c[low_index] >> 1) + (result_low >> 1) + ((c[low_index] & result_low & carry) != 0)) & in mfp_mul()
129 c[low_index] += result_low; /* add up partial products */ in mfp_mul()
/freebsd-12-stable/contrib/gcc/
Dtree-vect-generic.c151 tree low_bits, high_bits, a_low, b_low, result_low, signs; in do_plus_minus() local
171 result_low = gimplify_build2 (bsi, code, word_type, a_low, b_low); in do_plus_minus()
172 return gimplify_build2 (bsi, BIT_XOR_EXPR, word_type, result_low, signs); in do_plus_minus()
183 tree low_bits, high_bits, b_low, result_low, signs; in do_negate() local
194 result_low = gimplify_build2 (bsi, MINUS_EXPR, word_type, high_bits, b_low); in do_negate()
195 return gimplify_build2 (bsi, BIT_XOR_EXPR, word_type, result_low, signs); in do_negate()
Drtlanal.c3632 int result_low = 0; in nonzero_bits1() local
3638 result_low = MIN (low0, low1); in nonzero_bits1()
3641 result_low = MIN (low0, low1); in nonzero_bits1()
3645 result_low = low0 + low1; in nonzero_bits1()
3663 result_low = MIN (low0, low1); in nonzero_bits1()
3669 result_low = MIN (low0, low1); in nonzero_bits1()
3678 if (result_low > 0) in nonzero_bits1()
3679 nonzero &= ~(((HOST_WIDE_INT) 1 << result_low) - 1); in nonzero_bits1()