Lines Matching full:divisor
1071 integerPart *lhsSignificand, *dividend, *divisor;
1086 divisor = dividend + partsCount;
1088 /* Copy the dividend and divisor as they will be modified in-place. */
1091 divisor[i] = rhsSignificand[i];
1099 /* Normalize the divisor. */
1100 bit = precision - APInt::tcMSB(divisor, partsCount) - 1;
1103 APInt::tcShiftLeft(divisor, partsCount, bit);
1113 /* Ensure the dividend >= divisor initially for the loop below.
1116 if (APInt::tcCompare(dividend, divisor, partsCount) < 0) {
1119 assert(APInt::tcCompare(dividend, divisor, partsCount) >= 0);
1124 if (APInt::tcCompare(dividend, divisor, partsCount) >= 0) {
1125 APInt::tcSubtract(dividend, divisor, 0, partsCount);
1133 int cmp = APInt::tcCompare(dividend, divisor, partsCount);
3506 APInt divisor(significand.getBitWidth(), 1);
3510 divisor *= powten;
3516 significand = significand.udiv(divisor);
