Lines Matching defs:divisor
1224 uint32_t BigInt::DivideAndRemainder(uint32_t highBit, uint32_t lowBit, uint32_t divisor, uint32_t& remainder)
1226 uint32_t leadingZeros = base::CountLeadingZeros(divisor);
1228 divisor <<= leadingZeros;
1232 // highBit is the remainder of the last calculation, which must be less than or equal to the divisor,
1236 uint32_t highDivisor = divisor >> HALFDATEBITS;
1237 uint32_t lowDivisor = divisor & HALFDATEMASK;
1253 uint32_t tempLowDividend = highDividend * HALFUINT32VALUE + lowDividend1 - highQuotient * divisor;
1269 remainder = (tempLowDividend * HALFUINT32VALUE + lowDividend2 - lowQuotient * divisor) >> leadingZeros;
1377 JSHandle<BigInt> divisor,
1380 uint32_t divisorLen = divisor->GetLength();
1381 // the length of the quota is the length of the dividend minus the divisor
1388 // format the divisor and dividend so that the highest order of the divisor is
1391 uint32_t leadingZeros = base::CountLeadingZeros(divisor->GetDigit(divisorLen - 1));
1392 JSHandle<BigInt> v = FormatLeftShift(thread, leadingZeros, divisor, false);
1394 // qv is used to store the result of quotient * divisor of each round
1434 uint32_t divisor, JSMutableHandle<BigInt> &remainder)
1440 DivideAndRemainder(r, dividend->GetDigit(i), divisor, r);
1447 uint32_t q = DivideAndRemainder(r, dividend->GetDigit(i), divisor, r);
1482 // When the divisor is uint32_t, we have a faster and simpler algorithm to calculate
1510 // When the divisor is uint32_t, we have a faster and simpler algorithm to calculate