Lines Matching full:divisor
969 integerPart *lhsSignificand, *dividend, *divisor;
984 divisor = dividend + partsCount;
986 /* Copy the dividend and divisor as they will be modified in-place. */
989 divisor[i] = rhsSignificand[i];
997 /* Normalize the divisor. */
998 bit = precision - APInt::tcMSB(divisor, partsCount) - 1;
1001 APInt::tcShiftLeft(divisor, partsCount, bit);
1011 /* Ensure the dividend >= divisor initially for the loop below.
1014 if (APInt::tcCompare(dividend, divisor, partsCount) < 0) {
1017 assert(APInt::tcCompare(dividend, divisor, partsCount) >= 0);
1022 if (APInt::tcCompare(dividend, divisor, partsCount) >= 0) {
1023 APInt::tcSubtract(dividend, divisor, 0, partsCount);
1031 int cmp = APInt::tcCompare(dividend, divisor, partsCount);
3324 APInt divisor(significand.getBitWidth(), 1);
3328 divisor *= powten;
3334 significand = significand.udiv(divisor);
