Lines Matching +full:32 +full:k

11 /* @(#) $Id: zutil.h,v 1.1 2000/01/01 03:32:23 davem Exp $ */
55 /* NMAX is the largest n such that 255n(n+1)/2 + (n+1)(BASE-1) <= 2^32-1 */
65      Update a running Adler-32 checksum with the bytes buf[0..len-1] and
68    An Adler-32 checksum is almost as reliable as a CRC32 but can be computed
84     int k;  in zlib_adler32()  local
89         k = len < NMAX ? len : NMAX;  in zlib_adler32()
90         len -= k;  in zlib_adler32()
91         while (k >= 16) {  in zlib_adler32()
94             k -= 16;  in zlib_adler32()
96         if (k != 0) do {  in zlib_adler32()
99         } while (--k);  in zlib_adler32()