Lines Matching defs:remainder
86 /* The remainder and quotient of our power of 2 divided by d */
88 uint64_t remainder = initial_power_of_2 % D;
110 /* Quotient and remainder is from previous exponent; compute it for this
113 if (remainder >= D - remainder) {
114 /* Doubling remainder will wrap around D */
116 remainder = remainder * 2 - D;
120 remainder = remainder * 2;
128 (D - remainder) <= ((uint64_t)1 << (exponent + extra_shift)))
135 remainder <= ((uint64_t)1 << (exponent + extra_shift))) {
195 * which is the largest dividend whose remainder with d is d-1.