Lines Matching refs:BASE
11 #define BASE 65521UL /* largest prime smaller than 65536 */
13 /* NMAX is the largest n such that 255n(n+1)/2 + (n+1)(BASE-1) <= 2^32-1 */
25 if (a >= (BASE << 16)) a -= (BASE << 16); \
26 if (a >= (BASE << 15)) a -= (BASE << 15); \
27 if (a >= (BASE << 14)) a -= (BASE << 14); \
28 if (a >= (BASE << 13)) a -= (BASE << 13); \
29 if (a >= (BASE << 12)) a -= (BASE << 12); \
30 if (a >= (BASE << 11)) a -= (BASE << 11); \
31 if (a >= (BASE << 10)) a -= (BASE << 10); \
32 if (a >= (BASE << 9)) a -= (BASE << 9); \
33 if (a >= (BASE << 8)) a -= (BASE << 8); \
34 if (a >= (BASE << 7)) a -= (BASE << 7); \
35 if (a >= (BASE << 6)) a -= (BASE << 6); \
36 if (a >= (BASE << 5)) a -= (BASE << 5); \
37 if (a >= (BASE << 4)) a -= (BASE << 4); \
38 if (a >= (BASE << 3)) a -= (BASE << 3); \
39 if (a >= (BASE << 2)) a -= (BASE << 2); \
40 if (a >= (BASE << 1)) a -= (BASE << 1); \
41 if (a >= BASE) a -= BASE; \
45 if (a >= (BASE << 4)) a -= (BASE << 4); \
46 if (a >= (BASE << 3)) a -= (BASE << 3); \
47 if (a >= (BASE << 2)) a -= (BASE << 2); \
48 if (a >= (BASE << 1)) a -= (BASE << 1); \
49 if (a >= BASE) a -= BASE; \
52 # define MOD(a) a %= BASE
53 # define MOD4(a) a %= BASE
64 low = (low + buf[j]) % BASE;
65 high = (high + low) % BASE;
69 Both 16-bit halves of the checksum are between 0 and BASE-1 (inclusive).
71 ((BASE-1) << 16) | (BASE-1). Applications may have reserved values
94 *max = ((BASE-1) << 16) | (BASE-1);
112 if (adler >= BASE)
113 adler -= BASE;
115 if (sum2 >= BASE)
116 sum2 -= BASE;
130 if (adler >= BASE)
131 adler -= BASE;
132 MOD4(sum2); /* only added so many BASE's */
178 rem = (unsigned)(len2 % BASE);
182 sum1 += (adler2 & 0xffff) + BASE - 1;
183 sum2 += ((adler1 >> 16) & 0xffff) + ((adler2 >> 16) & 0xffff) + BASE - rem;
184 if (sum1 >= BASE) sum1 -= BASE;
185 if (sum1 >= BASE) sum1 -= BASE;
186 if (sum2 >= (BASE << 1)) sum2 -= (BASE << 1);
187 if (sum2 >= BASE) sum2 -= BASE;
