uint64_t x = W[1];
unsigned i;
+ assert(x != 0 && "This is really a 64-bit division");
+
// This long division algorithm automatically saturates on overflow.
for (i = 0; i < 64 && x; ++i) {
- uint32_t t = (int)x >> 31;
+ uint32_t t = -((x >> 31) & 1); // Splat bit 31 to bits 0-31.
x = (x << 1) | (y >> 63);
y = y << 1;
if ((x | t) >= D) {
uint64_t MulRes = (MulHi << 32) + MulLo;
// If the product fits in 64 bits, just use built-in division.
- if (MulHi <= UINT32_MAX && MulRes <= MulLo) {
+ if (MulHi <= UINT32_MAX && MulRes >= MulLo) {
Frequency = MulRes / D;
return;
}