1 /* adler32.c -- compute the Adler-32 checksum of a data stream
2 * Copyright (C) 1995-2011, 2016 Mark Adler
3 * For conditions of distribution and use, see copyright notice in zlib.h
10 #define BASE 65521U /* largest prime smaller than 65536 */
12 /* NMAX is the largest n such that 255n(n+1)/2 + (n+1)(BASE-1) <= 2^32-1 */
14 #define DO1(buf,i) {adler += (buf)[i]; sum2 += adler;}
15 #define DO2(buf,i) DO1(buf,i); DO1(buf,i+1);
16 #define DO4(buf,i) DO2(buf,i); DO2(buf,i+2);
17 #define DO8(buf,i) DO4(buf,i); DO4(buf,i+4);
18 #define DO16(buf) DO8(buf,0); DO8(buf,8);
20 /* use NO_DIVIDE if your processor does not do division in hardware --
21 try it both ways to see which is faster */
23 /* note that this assumes BASE is 65521, where 65536 % 65521 == 15
24 (thank you to John Reiser for pointing this out) */
27 unsigned long tmp = a >> 16; \
29 a += (tmp << 4) - tmp; \
34 if (a >= BASE) a -= BASE; \
42 do { /* this assumes a is not negative */ \
43 z_off64_t tmp = a >> 32; \
45 a += (tmp << 8) - (tmp << 5) + tmp; \
48 a += (tmp << 4) - tmp; \
51 a += (tmp << 4) - tmp; \
52 if (a >= BASE) a -= BASE; \
55 # define MOD(a) a %= BASE
56 # define MOD28(a) a %= BASE
57 # define MOD63(a) a %= BASE
60 /* ========================================================================= */
61 uLong ZEXPORT adler32_z(uLong adler, const Bytef *buf, z_size_t len) {
65 /* split Adler-32 into component sums */
66 sum2 = (adler >> 16) & 0xffff;
69 /* in case user likes doing a byte at a time, keep it fast */
77 return adler | (sum2 << 16);
80 /* initial Adler-32 value (deferred check for len == 1 speed) */
84 /* in case short lengths are provided, keep it somewhat fast */
92 MOD28(sum2); /* only added so many BASE's */
93 return adler | (sum2 << 16);
96 /* do length NMAX blocks -- requires just one modulo operation */
99 n = NMAX / 16; /* NMAX is divisible by 16 */
101 DO16(buf); /* 16 sums unrolled */
108 /* do remaining bytes (less than NMAX, still just one modulo) */
109 if (len) { /* avoid modulos if none remaining */
123 /* return recombined sums */
124 return adler | (sum2 << 16);
127 /* ========================================================================= */
128 uLong ZEXPORT adler32(uLong adler, const Bytef *buf, uInt len) {
129 return adler32_z(adler, buf, len);
132 /* ========================================================================= */
133 local uLong adler32_combine_(uLong adler1, uLong adler2, z_off64_t len2) {
138 /* for negative len, return invalid adler32 as a clue for debugging */
142 /* the derivation of this formula is left as an exercise for the reader */
143 MOD63(len2); /* assumes len2 >= 0 */
144 rem = (unsigned)len2;
145 sum1 = adler1 & 0xffff;
148 sum1 += (adler2 & 0xffff) + BASE - 1;
149 sum2 += ((adler1 >> 16) & 0xffff) + ((adler2 >> 16) & 0xffff) + BASE - rem;
150 if (sum1 >= BASE) sum1 -= BASE;
151 if (sum1 >= BASE) sum1 -= BASE;
152 if (sum2 >= ((unsigned long)BASE << 1)) sum2 -= ((unsigned long)BASE << 1);
153 if (sum2 >= BASE) sum2 -= BASE;
154 return sum1 | (sum2 << 16);
157 /* ========================================================================= */
158 uLong ZEXPORT adler32_combine(uLong adler1, uLong adler2, z_off_t len2) {
159 return adler32_combine_(adler1, adler2, len2);
162 uLong ZEXPORT adler32_combine64(uLong adler1, uLong adler2, z_off64_t len2) {
163 return adler32_combine_(adler1, adler2, len2);