Lines Matching full:divisor
1415 /// the divisor not be 0, 1, or -1. Taken from "Hacker's Delight", Henry S.
1457 /// Requires that the divisor not be 0. Taken from "Hacker's Delight", Henry
1512 assert(v && "Must provide divisor");
1708 // Initialize the divisor
1722 // the divisor. m is the number of words by which the dividend exceeds the
1723 // divisor (i.e. m+n is the length of the dividend). These sizes must not
1732 // If we're left with only a single word for the divisor, Knuth doesn't work
1740 unsigned divisor = V[0];
1747 } else if (partial_dividend < divisor) {
1750 } else if (partial_dividend == divisor) {
1754 Q[i] = (unsigned)(partial_dividend / divisor);
1755 remainder = (unsigned)(partial_dividend - (Q[i] * divisor));
1949 // Get some size facts about the dividend and divisor
2245 APInt divisor(Radix == 10? 4 : 8, Radix);
2249 divide(Tmp, Tmp.getNumWords(), divisor, divisor.getNumWords(), &tmp2,
