Adding upstream version 3.20.
[syslinux-debian/hramrach.git] / com32 / lib / zlib / adler32.c
blob296e45fd8a5d579420a91cec4e2803003aad1896
1 /* adler32.c -- compute the Adler-32 checksum of a data stream
2 * Copyright (C) 1995-2003 Mark Adler
3 * For conditions of distribution and use, see copyright notice in zlib.h
4 */
7 #define ZLIB_INTERNAL
8 #include "zlib.h"
10 #define BASE 65521UL /* largest prime smaller than 65536 */
11 #define NMAX 5552
12 /* NMAX is the largest n such that 255n(n+1)/2 + (n+1)(BASE-1) <= 2^32-1 */
14 #define DO1(buf,i) {s1 += buf[i]; s2 += s1;}
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 #ifdef NO_DIVIDE
21 # define MOD(a) \
22 do { \
23 if (a >= (BASE << 16)) a -= (BASE << 16); \
24 if (a >= (BASE << 15)) a -= (BASE << 15); \
25 if (a >= (BASE << 14)) a -= (BASE << 14); \
26 if (a >= (BASE << 13)) a -= (BASE << 13); \
27 if (a >= (BASE << 12)) a -= (BASE << 12); \
28 if (a >= (BASE << 11)) a -= (BASE << 11); \
29 if (a >= (BASE << 10)) a -= (BASE << 10); \
30 if (a >= (BASE << 9)) a -= (BASE << 9); \
31 if (a >= (BASE << 8)) a -= (BASE << 8); \
32 if (a >= (BASE << 7)) a -= (BASE << 7); \
33 if (a >= (BASE << 6)) a -= (BASE << 6); \
34 if (a >= (BASE << 5)) a -= (BASE << 5); \
35 if (a >= (BASE << 4)) a -= (BASE << 4); \
36 if (a >= (BASE << 3)) a -= (BASE << 3); \
37 if (a >= (BASE << 2)) a -= (BASE << 2); \
38 if (a >= (BASE << 1)) a -= (BASE << 1); \
39 if (a >= BASE) a -= BASE; \
40 } while (0)
41 #else
42 # define MOD(a) a %= BASE
43 #endif
45 /* ========================================================================= */
46 uLong ZEXPORT adler32(adler, buf, len)
47 uLong adler;
48 const Bytef *buf;
49 uInt len;
51 unsigned long s1 = adler & 0xffff;
52 unsigned long s2 = (adler >> 16) & 0xffff;
53 int k;
55 if (buf == Z_NULL) return 1L;
57 while (len > 0) {
58 k = len < NMAX ? (int)len : NMAX;
59 len -= k;
60 while (k >= 16) {
61 DO16(buf);
62 buf += 16;
63 k -= 16;
65 if (k != 0) do {
66 s1 += *buf++;
67 s2 += s1;
68 } while (--k);
69 MOD(s1);
70 MOD(s2);
72 return (s2 << 16) | s1;