Lines Matching refs:b_divisor
1646 unsigned HOST_HALF_WIDE_INT *b_divisor, in divmod_internal_2() argument
1667 b_quotient[j] = (k * b + b_dividend[j])/b_divisor[0]; in divmod_internal_2()
1670 * (unsigned HOST_WIDE_INT)b_divisor[0])); in divmod_internal_2()
1676 s = clz_hwi (b_divisor[n-1]) - HOST_BITS_PER_HALF_WIDE_INT; /* CHECK clz */ in divmod_internal_2()
1684 b_divisor[i] = (b_divisor[i] << s) in divmod_internal_2()
1685 | (b_divisor[i-1] >> (HOST_BITS_PER_HALF_WIDE_INT - s)); in divmod_internal_2()
1686 b_divisor[0] = b_divisor[0] << s; in divmod_internal_2()
1698 qhat = (b_dividend[j+n] * b + b_dividend[j+n-1]) / b_divisor[n-1]; in divmod_internal_2()
1699 rhat = (b_dividend[j+n] * b + b_dividend[j+n-1]) - qhat * b_divisor[n-1]; in divmod_internal_2()
1701 if (qhat >= b || qhat * b_divisor[n-2] > b * rhat + b_dividend[j+n-2]) in divmod_internal_2()
1704 rhat += b_divisor[n-1]; in divmod_internal_2()
1713 p = qhat * b_divisor[i]; in divmod_internal_2()
1729 t = (HOST_WIDE_INT)b_dividend[i+j] + b_divisor[i] + k; in divmod_internal_2()
1771 b_divisor[4 * MAX_BITSIZE_MODE_ANY_INT / HOST_BITS_PER_HALF_WIDE_INT]; in divmod_internal() local
1892 wi_unpack (b_divisor, divisor.get_val (), divisor.get_len (), in divmod_internal()
1901 while (n > 1 && b_divisor[n - 1] == 0) in divmod_internal()
1906 divmod_internal_2 (b_quotient, b_remainder, b_dividend, b_divisor, m, n); in divmod_internal()