Lines Matching refs:divisor
28 du_int vn1, vn0; // Norm. divisor digits
36 // Normalize the divisor.
46 // Break divisor up into two 32-bit digits.
104 utwords divisor;
105 divisor.all = b;
108 if (divisor.all > dividend.all) {
113 // When the divisor fits in 64 bits, we can use an optimized path.
114 if (divisor.s.high == 0) {
116 if (dividend.s.high < divisor.s.low) {
119 divisor.s.low, &remainder.s.low);
123 // After that dividend.s.high < divisor.s.low.
124 quotient.s.high = dividend.s.high / divisor.s.low;
125 dividend.s.high = dividend.s.high % divisor.s.low;
127 divisor.s.low, &remainder.s.low);
135 __builtin_clzll(divisor.s.high) - __builtin_clzll(dividend.s.high);
136 divisor.all <<= shift;
142 // if (dividend.all >= divisor.all)
144 // dividend.all -= divisor.all;
148 (ti_int)(divisor.all - dividend.all - 1) >> (n_utword_bits - 1);
150 dividend.all -= divisor.all & s;
151 divisor.all >>= 1;