Lines Matching refs:divisor
1393 /// the divisor not be 0, 1, or -1. Taken from "Hacker's Delight", Henry S.
1435 /// Requires that the divisor not be 0. Taken from "Hacker's Delight", Henry
1490 assert(v && "Must provide divisor");
1713 // Initialize the divisor
1727 // the divisor. m is the number of words by which the dividend exceeds the
1728 // divisor (i.e. m+n is the length of the dividend). These sizes must not
1737 // If we're left with only a single word for the divisor, Knuth doesn't work
1745 unsigned divisor = V[0];
1752 } else if (partial_dividend < divisor) {
1755 } else if (partial_dividend == divisor) {
1759 Q[i] = (unsigned)(partial_dividend / divisor);
1760 remainder = (unsigned)(partial_dividend - (Q[i] * divisor));
1940 // Get some size facts about the dividend and divisor
2226 APInt divisor(Radix == 10? 4 : 8, Radix);
2230 divide(Tmp, Tmp.getNumWords(), divisor, divisor.getNumWords(), &tmp2,
