Lines Matching refs:BASE
14 #define BASE 65521UL /* largest prime smaller than 65536 */
16 /* NMAX is the largest n such that 255n(n+1)/2 + (n+1)(BASE-1) <= 2^32-1 */
28 if (a >= (BASE << 16)) a -= (BASE << 16); \
29 if (a >= (BASE << 15)) a -= (BASE << 15); \
30 if (a >= (BASE << 14)) a -= (BASE << 14); \
31 if (a >= (BASE << 13)) a -= (BASE << 13); \
32 if (a >= (BASE << 12)) a -= (BASE << 12); \
33 if (a >= (BASE << 11)) a -= (BASE << 11); \
34 if (a >= (BASE << 10)) a -= (BASE << 10); \
35 if (a >= (BASE << 9)) a -= (BASE << 9); \
36 if (a >= (BASE << 8)) a -= (BASE << 8); \
37 if (a >= (BASE << 7)) a -= (BASE << 7); \
38 if (a >= (BASE << 6)) a -= (BASE << 6); \
39 if (a >= (BASE << 5)) a -= (BASE << 5); \
40 if (a >= (BASE << 4)) a -= (BASE << 4); \
41 if (a >= (BASE << 3)) a -= (BASE << 3); \
42 if (a >= (BASE << 2)) a -= (BASE << 2); \
43 if (a >= (BASE << 1)) a -= (BASE << 1); \
44 if (a >= BASE) a -= BASE; \
48 if (a >= (BASE << 4)) a -= (BASE << 4); \
49 if (a >= (BASE << 3)) a -= (BASE << 3); \
50 if (a >= (BASE << 2)) a -= (BASE << 2); \
51 if (a >= (BASE << 1)) a -= (BASE << 1); \
52 if (a >= BASE) a -= BASE; \
55 # define MOD(a) a %= BASE
56 # define MOD4(a) a %= BASE
75 if (adler >= BASE)
76 adler -= BASE;
78 if (sum2 >= BASE)
79 sum2 -= BASE;
93 if (adler >= BASE)
94 adler -= BASE;
95 MOD4(sum2); /* only added so many BASE's */
141 rem = (unsigned)(len2 % BASE);
145 sum1 += (adler2 & 0xffff) + BASE - 1;
146 sum2 += ((adler1 >> 16) & 0xffff) + ((adler2 >> 16) & 0xffff) + BASE - rem;
147 if (sum1 >= BASE) sum1 -= BASE;
148 if (sum1 >= BASE) sum1 -= BASE;
149 if (sum2 >= (BASE << 1)) sum2 -= (BASE << 1);
150 if (sum2 >= BASE) sum2 -= BASE;
