Lines Matching defs:BASE
35 #define BASE 65521UL /* largest prime smaller than 65536 */
37 /* NMAX is the largest n such that 255n(n+1)/2 + (n+1)(BASE-1) <= 2^32-1 */
49 if (a >= (BASE << 16)) a -= (BASE << 16); \
50 if (a >= (BASE << 15)) a -= (BASE << 15); \
51 if (a >= (BASE << 14)) a -= (BASE << 14); \
52 if (a >= (BASE << 13)) a -= (BASE << 13); \
53 if (a >= (BASE << 12)) a -= (BASE << 12); \
54 if (a >= (BASE << 11)) a -= (BASE << 11); \
55 if (a >= (BASE << 10)) a -= (BASE << 10); \
56 if (a >= (BASE << 9)) a -= (BASE << 9); \
57 if (a >= (BASE << 8)) a -= (BASE << 8); \
58 if (a >= (BASE << 7)) a -= (BASE << 7); \
59 if (a >= (BASE << 6)) a -= (BASE << 6); \
60 if (a >= (BASE << 5)) a -= (BASE << 5); \
61 if (a >= (BASE << 4)) a -= (BASE << 4); \
62 if (a >= (BASE << 3)) a -= (BASE << 3); \
63 if (a >= (BASE << 2)) a -= (BASE << 2); \
64 if (a >= (BASE << 1)) a -= (BASE << 1); \
65 if (a >= BASE) a -= BASE; \
69 if (a >= (BASE << 4)) a -= (BASE << 4); \
70 if (a >= (BASE << 3)) a -= (BASE << 3); \
71 if (a >= (BASE << 2)) a -= (BASE << 2); \
72 if (a >= (BASE << 1)) a -= (BASE << 1); \
73 if (a >= BASE) a -= BASE; \
76 # define MOD(a) a %= BASE
77 # define MOD4(a) a %= BASE
96 if (adler >= BASE)
97 adler -= BASE;
99 if (sum2 >= BASE)
100 sum2 -= BASE;
114 if (adler >= BASE)
115 adler -= BASE;
116 MOD4(sum2); /* only added so many BASE's */
162 rem = (unsigned)(len2 % BASE);
166 sum1 += (adler2 & 0xffff) + BASE - 1;
167 sum2 += ((adler1 >> 16) & 0xffff) + ((adler2 >> 16) & 0xffff) + BASE - rem;
168 if (sum1 > BASE) sum1 -= BASE;
169 if (sum1 > BASE) sum1 -= BASE;
170 if (sum2 > (BASE << 1)) sum2 -= (BASE << 1);
171 if (sum2 > BASE) sum2 -= BASE;