A massively spiffy yet delicately unobtrusive compression library. (grpc依赖)
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

49 lines
1.2 KiB

13 years ago
/* adler32.c -- compute the Adler-32 checksum of a data stream
13 years ago
* Copyright (C) 1995-2003 Mark Adler
13 years ago
* For conditions of distribution and use, see copyright notice in zlib.h
*/
13 years ago
/* @(#) $Id$ */
13 years ago
13 years ago
#include "zlib.h"
13 years ago
13 years ago
#define BASE 65521L /* largest prime smaller than 65536 */
13 years ago
#define NMAX 5552
/* NMAX is the largest n such that 255n(n+1)/2 + (n+1)(BASE-1) <= 2^32-1 */
13 years ago
#define DO1(buf,i) {s1 += buf[i]; s2 += s1;}
#define DO2(buf,i) DO1(buf,i); DO1(buf,i+1);
#define DO4(buf,i) DO2(buf,i); DO2(buf,i+2);
#define DO8(buf,i) DO4(buf,i); DO4(buf,i+4);
#define DO16(buf) DO8(buf,0); DO8(buf,8);
13 years ago
/* ========================================================================= */
13 years ago
uLong ZEXPORT adler32(adler, buf, len)
13 years ago
uLong adler;
13 years ago
const Bytef *buf;
13 years ago
uInt len;
{
unsigned long s1 = adler & 0xffff;
unsigned long s2 = (adler >> 16) & 0xffff;
int k;
if (buf == Z_NULL) return 1L;
while (len > 0) {
13 years ago
k = len < NMAX ? (int)len : NMAX;
13 years ago
len -= k;
while (k >= 16) {
DO16(buf);
13 years ago
buf += 16;
13 years ago
k -= 16;
}
if (k != 0) do {
13 years ago
s1 += *buf++;
13 years ago
s2 += s1;
13 years ago
} while (--k);
s1 %= BASE;
s2 %= BASE;
13 years ago
}
return (s2 << 16) | s1;
}