author | zautrix <zautrix> | 2004-10-19 20:16:14 (UTC) |
---|---|---|
committer | zautrix <zautrix> | 2004-10-19 20:16:14 (UTC) |
commit | eca49bb06a71980ef61d078904573f25890fc7f2 (patch) (unidiff) | |
tree | c5338e3b12430248979a9ac2c1c7e6646ea9ecdf /pwmanager/libcrypt/zlib/adler32.c | |
parent | 53cc32b6e7b1f672bf91b2baf2df6c1e8baf3e0a (diff) | |
download | kdepimpi-eca49bb06a71980ef61d078904573f25890fc7f2.zip kdepimpi-eca49bb06a71980ef61d078904573f25890fc7f2.tar.gz kdepimpi-eca49bb06a71980ef61d078904573f25890fc7f2.tar.bz2 |
Initial revision
Diffstat (limited to 'pwmanager/libcrypt/zlib/adler32.c') (more/less context) (ignore whitespace changes)
-rw-r--r-- | pwmanager/libcrypt/zlib/adler32.c | 48 |
1 files changed, 48 insertions, 0 deletions
diff --git a/pwmanager/libcrypt/zlib/adler32.c b/pwmanager/libcrypt/zlib/adler32.c new file mode 100644 index 0000000..fae88b6 --- a/dev/null +++ b/pwmanager/libcrypt/zlib/adler32.c | |||
@@ -0,0 +1,48 @@ | |||
1 | /* adler32.c -- compute the Adler-32 checksum of a data stream | ||
2 | * Copyright (C) 1995-2002 Mark Adler | ||
3 | * For conditions of distribution and use, see copyright notice in zlib.h | ||
4 | */ | ||
5 | |||
6 | /* @(#) $Id$ */ | ||
7 | |||
8 | #include "zlib.h" | ||
9 | |||
10 | #define BASE 65521L /* 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 */ | ||
13 | |||
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); | ||
19 | |||
20 | /* ========================================================================= */ | ||
21 | uLong ZEXPORT adler32(adler, buf, len) | ||
22 | uLong adler; | ||
23 | const Bytef *buf; | ||
24 | uInt len; | ||
25 | { | ||
26 | unsigned long s1 = adler & 0xffff; | ||
27 | unsigned long s2 = (adler >> 16) & 0xffff; | ||
28 | int k; | ||
29 | |||
30 | if (buf == Z_NULL) return 1L; | ||
31 | |||
32 | while (len > 0) { | ||
33 | k = len < NMAX ? len : NMAX; | ||
34 | len -= k; | ||
35 | while (k >= 16) { | ||
36 | DO16(buf); | ||
37 | buf += 16; | ||
38 | k -= 16; | ||
39 | } | ||
40 | if (k != 0) do { | ||
41 | s1 += *buf++; | ||
42 | s2 += s1; | ||
43 | } while (--k); | ||
44 | s1 %= BASE; | ||
45 | s2 %= BASE; | ||
46 | } | ||
47 | return (s2 << 16) | s1; | ||
48 | } | ||