Lines Matching full:divisor
1492 /// the divisor not be 0, 1, or -1. Taken from "Hacker's Delight", Henry S.
1534 /// Requires that the divisor not be 0. Taken from "Hacker's Delight", Henry
1589 assert(v && "Must provide divisor");
1812 // Initialize the divisor
1826 // the divisor. m is the number of words by which the dividend exceeds the
1827 // divisor (i.e. m+n is the length of the dividend). These sizes must not
1836 // If we're left with only a single word for the divisor, Knuth doesn't work
1844 unsigned divisor = V[0];
1851 } else if (partial_dividend < divisor) {
1854 } else if (partial_dividend == divisor) {
1858 Q[i] = (unsigned)(partial_dividend / divisor);
1859 remainder = (unsigned)(partial_dividend - (Q[i] * divisor));
2017 // Get some size facts about the dividend and divisor
2281 APInt divisor(Radix == 10? 4 : 8, Radix);
2285 divide(Tmp, Tmp.getNumWords(), divisor, divisor.getNumWords(), &tmp2,
