diff options
author | hizzlekizzle | 2019-03-26 11:36:51 -0500 |
---|---|---|
committer | GitHub | 2019-03-26 11:36:51 -0500 |
commit | d9176559431d6ffcb29ffb247eced5be0003ac32 (patch) | |
tree | 0f95cb8937b3aeb658fde24ef8a560adf8214448 /deps/adler32.c | |
parent | e2a9a9a58dd4cff8a56f035e3380dd76785f6c45 (diff) | |
parent | bab9a272f3873513faeddc6aceb99c5627aa31d8 (diff) | |
download | pcsx_rearmed-d9176559431d6ffcb29ffb247eced5be0003ac32.tar.gz pcsx_rearmed-d9176559431d6ffcb29ffb247eced5be0003ac32.tar.bz2 pcsx_rearmed-d9176559431d6ffcb29ffb247eced5be0003ac32.zip |
Merge pull request #259 from retro-wertz/fix_zlib
Fix missing embedded zlib, remove unneeded zlib files
Diffstat (limited to 'deps/adler32.c')
-rw-r--r-- | deps/adler32.c | 75 |
1 files changed, 0 insertions, 75 deletions
diff --git a/deps/adler32.c b/deps/adler32.c deleted file mode 100644 index cccb3a2..0000000 --- a/deps/adler32.c +++ /dev/null @@ -1,75 +0,0 @@ -/* adler32.c -- compute the Adler-32 checksum of a data stream - * Copyright (C) 1995-2003 Mark Adler - * For conditions of distribution and use, see copyright notice in zlib.h - */ - -/* @(#) $Id$ */ - -#define ZLIB_INTERNAL -#include <stdint.h> -#include <stddef.h> -#include "zutil.h" - -#define BASE 65521UL /* largest prime smaller than 65536 */ -#define NMAX 5552 -/* NMAX is the largest n such that 255n(n+1)/2 + (n+1)(BASE-1) <= 2^32-1 */ - -#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); - -#ifdef NO_DIVIDE -# define MOD(a) \ - do { \ - if (a >= (BASE << 16)) a -= (BASE << 16); \ - if (a >= (BASE << 15)) a -= (BASE << 15); \ - if (a >= (BASE << 14)) a -= (BASE << 14); \ - if (a >= (BASE << 13)) a -= (BASE << 13); \ - if (a >= (BASE << 12)) a -= (BASE << 12); \ - if (a >= (BASE << 11)) a -= (BASE << 11); \ - if (a >= (BASE << 10)) a -= (BASE << 10); \ - if (a >= (BASE << 9)) a -= (BASE << 9); \ - if (a >= (BASE << 8)) a -= (BASE << 8); \ - if (a >= (BASE << 7)) a -= (BASE << 7); \ - if (a >= (BASE << 6)) a -= (BASE << 6); \ - if (a >= (BASE << 5)) a -= (BASE << 5); \ - if (a >= (BASE << 4)) a -= (BASE << 4); \ - if (a >= (BASE << 3)) a -= (BASE << 3); \ - if (a >= (BASE << 2)) a -= (BASE << 2); \ - if (a >= (BASE << 1)) a -= (BASE << 1); \ - if (a >= BASE) a -= BASE; \ - } while (0) -#else -# define MOD(a) a %= BASE -#endif - -/* ========================================================================= */ -uLong adler32(uLong adler, const Bytef *buf, uInt len) -{ - uint32_t s1 = adler & 0xffff; - uint32_t s2 = (adler >> 16) & 0xffff; - int k; - - if (buf == NULL) - return 1L; - - while (len > 0) { - k = len < NMAX ? (int)len : NMAX; - len -= k; - while (k >= 16) { - DO16(buf); - buf += 16; - k -= 16; - } - if (k != 0) do { - s1 += *buf++; - s2 += s1; - } while (--k); - MOD(s1); - MOD(s2); - } - return (s2 << 16) | s1; -} - |