Lines Matching refs:BASE

48 #define BASE 65521UL    /* largest prime smaller than 65536 */
50 /* NMAX is the largest n such that 255n(n+1)/2 + (n+1)(BASE-1) <= 2^32-1 */
62 if (a >= (BASE << 16)) a -= (BASE << 16); \
63 if (a >= (BASE << 15)) a -= (BASE << 15); \
64 if (a >= (BASE << 14)) a -= (BASE << 14); \
65 if (a >= (BASE << 13)) a -= (BASE << 13); \
66 if (a >= (BASE << 12)) a -= (BASE << 12); \
67 if (a >= (BASE << 11)) a -= (BASE << 11); \
68 if (a >= (BASE << 10)) a -= (BASE << 10); \
69 if (a >= (BASE << 9)) a -= (BASE << 9); \
70 if (a >= (BASE << 8)) a -= (BASE << 8); \
71 if (a >= (BASE << 7)) a -= (BASE << 7); \
72 if (a >= (BASE << 6)) a -= (BASE << 6); \
73 if (a >= (BASE << 5)) a -= (BASE << 5); \
74 if (a >= (BASE << 4)) a -= (BASE << 4); \
75 if (a >= (BASE << 3)) a -= (BASE << 3); \
76 if (a >= (BASE << 2)) a -= (BASE << 2); \
77 if (a >= (BASE << 1)) a -= (BASE << 1); \
78 if (a >= BASE) a -= BASE; \
82 if (a >= (BASE << 4)) a -= (BASE << 4); \
83 if (a >= (BASE << 3)) a -= (BASE << 3); \
84 if (a >= (BASE << 2)) a -= (BASE << 2); \
85 if (a >= (BASE << 1)) a -= (BASE << 1); \
86 if (a >= BASE) a -= BASE; \
89 # define MOD(a) a %= BASE
90 # define MOD4(a) a %= BASE
109 if (adler >= BASE)
110 adler -= BASE;
112 if (sum2 >= BASE)
113 sum2 -= BASE;
127 if (adler >= BASE)
128 adler -= BASE;
129 MOD4(sum2); /* only added so many BASE's */
141 if (adler >= BASE) adler -= BASE;
142 MOD4(sum2); /* only added so many BASE's */
192 rem = (unsigned)(len2 % BASE);
196 sum1 += (adler2 & 0xffff) + BASE - 1;
197 sum2 += ((adler1 >> 16) & 0xffff) + ((adler2 >> 16) & 0xffff) + BASE - rem;
198 if (sum1 > BASE) sum1 -= BASE;
199 if (sum1 > BASE) sum1 -= BASE;
200 if (sum2 > (BASE << 1)) sum2 -= (BASE << 1);
201 if (sum2 > BASE) sum2 -= BASE;