#define BIT (1ul << (ULONG_BITS - 1))
if (n) {
i = ULONG_BITS;
- while (!(n & BIT)) { n <<= 1; i--; }
+ while (!(n&BIT)) { n <<= 1; i--; }
mul_r(prefix, x, x); n <<= 1; i--;
- while (i--) { sqr(x, x); if (n & BIT) mul_r(prefix, x, x); n <<= 1; }
+ while (i--) { sqr(x, x); if (n&BIT) mul_r(prefix, x, x); n <<= 1; }
}
#undef BIT
mul(x, prefix->u.P.h, x);
/* Convert this mess back into 32-bit words. We lose the top two bits,
* but that's fine.
*/
- h0 = (h0 >> 0) | ((h1 & 0x0000003f) << 26);
- h1 = (h1 >> 6) | ((h2 & 0x00000fff) << 20);
- h2 = (h2 >> 12) | ((h3 & 0x0003ffff) << 14);
- h3 = (h3 >> 18) | ((h4 & 0x00ffffff) << 8);
+ h0 = (h0 >> 0) | ((h1&0x0000003f) << 26);
+ h1 = (h1 >> 6) | ((h2&0x00000fff) << 20);
+ h2 = (h2 >> 12) | ((h3&0x0003ffff) << 14);
+ h3 = (h3 >> 18) | ((h4&0x00ffffff) << 8);
/* All done. */
STORE32_L(p + 0, h0); STORE32_L(p + 4, h1);