dbf-halloween2015

annotate libs/zlib/adler32.c @ 1:c3f5c32cb210

find changesets by author, revision, files, or words in the commit message
barfed all the libraries in the source tree to make porting easier
author John Tsiombikas <nuclear@member.fsf.org>
date Sun, 01 Nov 2015 00:36:56 +0200
parents
children
rev   line source
nuclear@1 1 /* adler32.c -- compute the Adler-32 checksum of a data stream
nuclear@1 2 * Copyright (C) 1995-2004 Mark Adler
nuclear@1 3 * For conditions of distribution and use, see copyright notice in zlib.h
nuclear@1 4 */
nuclear@1 5
nuclear@1 6 /* @(#) $Id$ */
nuclear@1 7
nuclear@1 8 #define ZLIB_INTERNAL
nuclear@1 9 #include "zlib.h"
nuclear@1 10
nuclear@1 11 #define BASE 65521UL /* largest prime smaller than 65536 */
nuclear@1 12 #define NMAX 5552
nuclear@1 13 /* NMAX is the largest n such that 255n(n+1)/2 + (n+1)(BASE-1) <= 2^32-1 */
nuclear@1 14
nuclear@1 15 #define DO1(buf,i) {adler += (buf)[i]; sum2 += adler;}
nuclear@1 16 #define DO2(buf,i) DO1(buf,i); DO1(buf,i+1);
nuclear@1 17 #define DO4(buf,i) DO2(buf,i); DO2(buf,i+2);
nuclear@1 18 #define DO8(buf,i) DO4(buf,i); DO4(buf,i+4);
nuclear@1 19 #define DO16(buf) DO8(buf,0); DO8(buf,8);
nuclear@1 20
nuclear@1 21 /* use NO_DIVIDE if your processor does not do division in hardware */
nuclear@1 22 #ifdef NO_DIVIDE
nuclear@1 23 # define MOD(a) \
nuclear@1 24 do { \
nuclear@1 25 if (a >= (BASE << 16)) a -= (BASE << 16); \
nuclear@1 26 if (a >= (BASE << 15)) a -= (BASE << 15); \
nuclear@1 27 if (a >= (BASE << 14)) a -= (BASE << 14); \
nuclear@1 28 if (a >= (BASE << 13)) a -= (BASE << 13); \
nuclear@1 29 if (a >= (BASE << 12)) a -= (BASE << 12); \
nuclear@1 30 if (a >= (BASE << 11)) a -= (BASE << 11); \
nuclear@1 31 if (a >= (BASE << 10)) a -= (BASE << 10); \
nuclear@1 32 if (a >= (BASE << 9)) a -= (BASE << 9); \
nuclear@1 33 if (a >= (BASE << 8)) a -= (BASE << 8); \
nuclear@1 34 if (a >= (BASE << 7)) a -= (BASE << 7); \
nuclear@1 35 if (a >= (BASE << 6)) a -= (BASE << 6); \
nuclear@1 36 if (a >= (BASE << 5)) a -= (BASE << 5); \
nuclear@1 37 if (a >= (BASE << 4)) a -= (BASE << 4); \
nuclear@1 38 if (a >= (BASE << 3)) a -= (BASE << 3); \
nuclear@1 39 if (a >= (BASE << 2)) a -= (BASE << 2); \
nuclear@1 40 if (a >= (BASE << 1)) a -= (BASE << 1); \
nuclear@1 41 if (a >= BASE) a -= BASE; \
nuclear@1 42 } while (0)
nuclear@1 43 # define MOD4(a) \
nuclear@1 44 do { \
nuclear@1 45 if (a >= (BASE << 4)) a -= (BASE << 4); \
nuclear@1 46 if (a >= (BASE << 3)) a -= (BASE << 3); \
nuclear@1 47 if (a >= (BASE << 2)) a -= (BASE << 2); \
nuclear@1 48 if (a >= (BASE << 1)) a -= (BASE << 1); \
nuclear@1 49 if (a >= BASE) a -= BASE; \
nuclear@1 50 } while (0)
nuclear@1 51 #else
nuclear@1 52 # define MOD(a) a %= BASE
nuclear@1 53 # define MOD4(a) a %= BASE
nuclear@1 54 #endif
nuclear@1 55
nuclear@1 56 /* ========================================================================= */
nuclear@1 57 uLong ZEXPORT adler32(adler, buf, len)
nuclear@1 58 uLong adler;
nuclear@1 59 const Bytef *buf;
nuclear@1 60 uInt len;
nuclear@1 61 {
nuclear@1 62 unsigned long sum2;
nuclear@1 63 unsigned n;
nuclear@1 64
nuclear@1 65 /* split Adler-32 into component sums */
nuclear@1 66 sum2 = (adler >> 16) & 0xffff;
nuclear@1 67 adler &= 0xffff;
nuclear@1 68
nuclear@1 69 /* in case user likes doing a byte at a time, keep it fast */
nuclear@1 70 if (len == 1) {
nuclear@1 71 adler += buf[0];
nuclear@1 72 if (adler >= BASE)
nuclear@1 73 adler -= BASE;
nuclear@1 74 sum2 += adler;
nuclear@1 75 if (sum2 >= BASE)
nuclear@1 76 sum2 -= BASE;
nuclear@1 77 return adler | (sum2 << 16);
nuclear@1 78 }
nuclear@1 79
nuclear@1 80 /* initial Adler-32 value (deferred check for len == 1 speed) */
nuclear@1 81 if (buf == Z_NULL)
nuclear@1 82 return 1L;
nuclear@1 83
nuclear@1 84 /* in case short lengths are provided, keep it somewhat fast */
nuclear@1 85 if (len < 16) {
nuclear@1 86 while (len--) {
nuclear@1 87 adler += *buf++;
nuclear@1 88 sum2 += adler;
nuclear@1 89 }
nuclear@1 90 if (adler >= BASE)
nuclear@1 91 adler -= BASE;
nuclear@1 92 MOD4(sum2); /* only added so many BASE's */
nuclear@1 93 return adler | (sum2 << 16);
nuclear@1 94 }
nuclear@1 95
nuclear@1 96 /* do length NMAX blocks -- requires just one modulo operation */
nuclear@1 97 while (len >= NMAX) {
nuclear@1 98 len -= NMAX;
nuclear@1 99 n = NMAX / 16; /* NMAX is divisible by 16 */
nuclear@1 100 do {
nuclear@1 101 DO16(buf); /* 16 sums unrolled */
nuclear@1 102 buf += 16;
nuclear@1 103 } while (--n);
nuclear@1 104 MOD(adler);
nuclear@1 105 MOD(sum2);
nuclear@1 106 }
nuclear@1 107
nuclear@1 108 /* do remaining bytes (less than NMAX, still just one modulo) */
nuclear@1 109 if (len) { /* avoid modulos if none remaining */
nuclear@1 110 while (len >= 16) {
nuclear@1 111 len -= 16;
nuclear@1 112 DO16(buf);
nuclear@1 113 buf += 16;
nuclear@1 114 }
nuclear@1 115 while (len--) {
nuclear@1 116 adler += *buf++;
nuclear@1 117 sum2 += adler;
nuclear@1 118 }
nuclear@1 119 MOD(adler);
nuclear@1 120 MOD(sum2);
nuclear@1 121 }
nuclear@1 122
nuclear@1 123 /* return recombined sums */
nuclear@1 124 return adler | (sum2 << 16);
nuclear@1 125 }
nuclear@1 126
nuclear@1 127 /* ========================================================================= */
nuclear@1 128 uLong ZEXPORT adler32_combine(adler1, adler2, len2)
nuclear@1 129 uLong adler1;
nuclear@1 130 uLong adler2;
nuclear@1 131 z_off_t len2;
nuclear@1 132 {
nuclear@1 133 unsigned long sum1;
nuclear@1 134 unsigned long sum2;
nuclear@1 135 unsigned rem;
nuclear@1 136
nuclear@1 137 /* the derivation of this formula is left as an exercise for the reader */
nuclear@1 138 rem = (unsigned)(len2 % BASE);
nuclear@1 139 sum1 = adler1 & 0xffff;
nuclear@1 140 sum2 = rem * sum1;
nuclear@1 141 MOD(sum2);
nuclear@1 142 sum1 += (adler2 & 0xffff) + BASE - 1;
nuclear@1 143 sum2 += ((adler1 >> 16) & 0xffff) + ((adler2 >> 16) & 0xffff) + BASE - rem;
nuclear@1 144 if (sum1 > BASE) sum1 -= BASE;
nuclear@1 145 if (sum1 > BASE) sum1 -= BASE;
nuclear@1 146 if (sum2 > (BASE << 1)) sum2 -= (BASE << 1);
nuclear@1 147 if (sum2 > BASE) sum2 -= BASE;
nuclear@1 148 return sum1 | (sum2 << 16);
nuclear@1 149 }