dist/zlib/adler32.c

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