--- /dev/null
+/* adler32.c -- compute the Adler-32 checksum of a data stream\r
+ * Copyright (C) 1995-2004 Mark Adler\r
+ * For conditions of distribution and use, see copyright notice in zlib.h\r
+ */\r
+\r
+/* @(#) $Id$ */\r
+\r
+#define ZLIB_INTERNAL\r
+#include "zlib.h"\r
+\r
+#define BASE 65521UL /* largest prime smaller than 65536 */\r
+#define NMAX 5552\r
+/* NMAX is the largest n such that 255n(n+1)/2 + (n+1)(BASE-1) <= 2^32-1 */\r
+\r
+#define DO1(buf,i) {adler += (buf)[i]; sum2 += adler;}\r
+#define DO2(buf,i) DO1(buf,i); DO1(buf,i+1);\r
+#define DO4(buf,i) DO2(buf,i); DO2(buf,i+2);\r
+#define DO8(buf,i) DO4(buf,i); DO4(buf,i+4);\r
+#define DO16(buf) DO8(buf,0); DO8(buf,8);\r
+\r
+/* use NO_DIVIDE if your processor does not do division in hardware */\r
+#ifdef NO_DIVIDE\r
+# define MOD(a) \\r
+ do { \\r
+ if (a >= (BASE << 16)) a -= (BASE << 16); \\r
+ if (a >= (BASE << 15)) a -= (BASE << 15); \\r
+ if (a >= (BASE << 14)) a -= (BASE << 14); \\r
+ if (a >= (BASE << 13)) a -= (BASE << 13); \\r
+ if (a >= (BASE << 12)) a -= (BASE << 12); \\r
+ if (a >= (BASE << 11)) a -= (BASE << 11); \\r
+ if (a >= (BASE << 10)) a -= (BASE << 10); \\r
+ if (a >= (BASE << 9)) a -= (BASE << 9); \\r
+ if (a >= (BASE << 8)) a -= (BASE << 8); \\r
+ if (a >= (BASE << 7)) a -= (BASE << 7); \\r
+ if (a >= (BASE << 6)) a -= (BASE << 6); \\r
+ if (a >= (BASE << 5)) a -= (BASE << 5); \\r
+ if (a >= (BASE << 4)) a -= (BASE << 4); \\r
+ if (a >= (BASE << 3)) a -= (BASE << 3); \\r
+ if (a >= (BASE << 2)) a -= (BASE << 2); \\r
+ if (a >= (BASE << 1)) a -= (BASE << 1); \\r
+ if (a >= BASE) a -= BASE; \\r
+ } while (0)\r
+# define MOD4(a) \\r
+ do { \\r
+ if (a >= (BASE << 4)) a -= (BASE << 4); \\r
+ if (a >= (BASE << 3)) a -= (BASE << 3); \\r
+ if (a >= (BASE << 2)) a -= (BASE << 2); \\r
+ if (a >= (BASE << 1)) a -= (BASE << 1); \\r
+ if (a >= BASE) a -= BASE; \\r
+ } while (0)\r
+#else\r
+# define MOD(a) a %= BASE\r
+# define MOD4(a) a %= BASE\r
+#endif\r
+\r
+/* ========================================================================= */\r
+uLong ZEXPORT adler32(adler, buf, len)\r
+ uLong adler;\r
+ const Bytef *buf;\r
+ uInt len;\r
+{\r
+ unsigned long sum2;\r
+ unsigned n;\r
+\r
+ /* split Adler-32 into component sums */\r
+ sum2 = (adler >> 16) & 0xffff;\r
+ adler &= 0xffff;\r
+\r
+ /* in case user likes doing a byte at a time, keep it fast */\r
+ if (len == 1) {\r
+ adler += buf[0];\r
+ if (adler >= BASE)\r
+ adler -= BASE;\r
+ sum2 += adler;\r
+ if (sum2 >= BASE)\r
+ sum2 -= BASE;\r
+ return adler | (sum2 << 16);\r
+ }\r
+\r
+ /* initial Adler-32 value (deferred check for len == 1 speed) */\r
+ if (buf == Z_NULL)\r
+ return 1L;\r
+\r
+ /* in case short lengths are provided, keep it somewhat fast */\r
+ if (len < 16) {\r
+ while (len--) {\r
+ adler += *buf++;\r
+ sum2 += adler;\r
+ }\r
+ if (adler >= BASE)\r
+ adler -= BASE;\r
+ MOD4(sum2); /* only added so many BASE's */\r
+ return adler | (sum2 << 16);\r
+ }\r
+\r
+ /* do length NMAX blocks -- requires just one modulo operation */\r
+ while (len >= NMAX) {\r
+ len -= NMAX;\r
+ n = NMAX / 16; /* NMAX is divisible by 16 */\r
+ do {\r
+ DO16(buf); /* 16 sums unrolled */\r
+ buf += 16;\r
+ } while (--n);\r
+ MOD(adler);\r
+ MOD(sum2);\r
+ }\r
+\r
+ /* do remaining bytes (less than NMAX, still just one modulo) */\r
+ if (len) { /* avoid modulos if none remaining */\r
+ while (len >= 16) {\r
+ len -= 16;\r
+ DO16(buf);\r
+ buf += 16;\r
+ }\r
+ while (len--) {\r
+ adler += *buf++;\r
+ sum2 += adler;\r
+ }\r
+ MOD(adler);\r
+ MOD(sum2);\r
+ }\r
+\r
+ /* return recombined sums */\r
+ return adler | (sum2 << 16);\r
+}\r
+\r
+/* ========================================================================= */\r
+uLong ZEXPORT adler32_combine(adler1, adler2, len2)\r
+ uLong adler1;\r
+ uLong adler2;\r
+ z_off_t len2;\r
+{\r
+ unsigned long sum1;\r
+ unsigned long sum2;\r
+ unsigned rem;\r
+\r
+ /* the derivation of this formula is left as an exercise for the reader */\r
+ rem = (unsigned)(len2 % BASE);\r
+ sum1 = adler1 & 0xffff;\r
+ sum2 = rem * sum1;\r
+ MOD(sum2);\r
+ sum1 += (adler2 & 0xffff) + BASE - 1;\r
+ sum2 += ((adler1 >> 16) & 0xffff) + ((adler2 >> 16) & 0xffff) + BASE - rem;\r
+ if (sum1 > BASE) sum1 -= BASE;\r
+ if (sum1 > BASE) sum1 -= BASE;\r
+ if (sum2 > (BASE << 1)) sum2 -= (BASE << 1);\r
+ if (sum2 > BASE) sum2 -= BASE;\r
+ return sum1 | (sum2 << 16);\r
+}\r
--- /dev/null
+/* compress.c -- compress a memory buffer\r
+ * Copyright (C) 1995-2003 Jean-loup Gailly.\r
+ * For conditions of distribution and use, see copyright notice in zlib.h\r
+ */\r
+\r
+/* @(#) $Id$ */\r
+\r
+#define ZLIB_INTERNAL\r
+#include "zlib.h"\r
+\r
+/* ===========================================================================\r
+ Compresses the source buffer into the destination buffer. The level\r
+ parameter has the same meaning as in deflateInit. sourceLen is the byte\r
+ length of the source buffer. Upon entry, destLen is the total size of the\r
+ destination buffer, which must be at least 0.1% larger than sourceLen plus\r
+ 12 bytes. Upon exit, destLen is the actual size of the compressed buffer.\r
+\r
+ compress2 returns Z_OK if success, Z_MEM_ERROR if there was not enough\r
+ memory, Z_BUF_ERROR if there was not enough room in the output buffer,\r
+ Z_STREAM_ERROR if the level parameter is invalid.\r
+*/\r
+int ZEXPORT compress2 (dest, destLen, source, sourceLen, level)\r
+ Bytef *dest;\r
+ uLongf *destLen;\r
+ const Bytef *source;\r
+ uLong sourceLen;\r
+ int level;\r
+{\r
+ z_stream stream;\r
+ int err;\r
+\r
+ stream.next_in = (Bytef*)source;\r
+ stream.avail_in = (uInt)sourceLen;\r
+#ifdef MAXSEG_64K\r
+ /* Check for source > 64K on 16-bit machine: */\r
+ if ((uLong)stream.avail_in != sourceLen) return Z_BUF_ERROR;\r
+#endif\r
+ stream.next_out = dest;\r
+ stream.avail_out = (uInt)*destLen;\r
+ if ((uLong)stream.avail_out != *destLen) return Z_BUF_ERROR;\r
+\r
+ stream.zalloc = (alloc_func)0;\r
+ stream.zfree = (free_func)0;\r
+ stream.opaque = (voidpf)0;\r
+\r
+ err = deflateInit(&stream, level);\r
+ if (err != Z_OK) return err;\r
+\r
+ err = deflate(&stream, Z_FINISH);\r
+ if (err != Z_STREAM_END) {\r
+ deflateEnd(&stream);\r
+ return err == Z_OK ? Z_BUF_ERROR : err;\r
+ }\r
+ *destLen = stream.total_out;\r
+\r
+ err = deflateEnd(&stream);\r
+ return err;\r
+}\r
+\r
+/* ===========================================================================\r
+ */\r
+int ZEXPORT compress (dest, destLen, source, sourceLen)\r
+ Bytef *dest;\r
+ uLongf *destLen;\r
+ const Bytef *source;\r
+ uLong sourceLen;\r
+{\r
+ return compress2(dest, destLen, source, sourceLen, Z_DEFAULT_COMPRESSION);\r
+}\r
+\r
+/* ===========================================================================\r
+ If the default memLevel or windowBits for deflateInit() is changed, then\r
+ this function needs to be updated.\r
+ */\r
+uLong ZEXPORT compressBound (sourceLen)\r
+ uLong sourceLen;\r
+{\r
+ return sourceLen + (sourceLen >> 12) + (sourceLen >> 14) + 11;\r
+}\r
--- /dev/null
+/* crc32.c -- compute the CRC-32 of a data stream\r
+ * Copyright (C) 1995-2005 Mark Adler\r
+ * For conditions of distribution and use, see copyright notice in zlib.h\r
+ *\r
+ * Thanks to Rodney Brown <rbrown64@csc.com.au> for his contribution of faster\r
+ * CRC methods: exclusive-oring 32 bits of data at a time, and pre-computing\r
+ * tables for updating the shift register in one step with three exclusive-ors\r
+ * instead of four steps with four exclusive-ors. This results in about a\r
+ * factor of two increase in speed on a Power PC G4 (PPC7455) using gcc -O3.\r
+ */\r
+\r
+/* @(#) $Id$ */\r
+\r
+/*\r
+ Note on the use of DYNAMIC_CRC_TABLE: there is no mutex or semaphore\r
+ protection on the static variables used to control the first-use generation\r
+ of the crc tables. Therefore, if you #define DYNAMIC_CRC_TABLE, you should\r
+ first call get_crc_table() to initialize the tables before allowing more than\r
+ one thread to use crc32().\r
+ */\r
+\r
+#ifdef MAKECRCH\r
+# include <stdio.h>\r
+# ifndef DYNAMIC_CRC_TABLE\r
+# define DYNAMIC_CRC_TABLE\r
+# endif /* !DYNAMIC_CRC_TABLE */\r
+#endif /* MAKECRCH */\r
+\r
+#include "zutil.h" /* for STDC and FAR definitions */\r
+\r
+#define local static\r
+\r
+/* Find a four-byte integer type for crc32_little() and crc32_big(). */\r
+#ifndef NOBYFOUR\r
+# ifdef STDC /* need ANSI C limits.h to determine sizes */\r
+# include <limits.h>\r
+# define BYFOUR\r
+# if (UINT_MAX == 0xffffffffUL)\r
+ typedef unsigned int u4;\r
+# else\r
+# if (ULONG_MAX == 0xffffffffUL)\r
+ typedef unsigned long u4;\r
+# else\r
+# if (USHRT_MAX == 0xffffffffUL)\r
+ typedef unsigned short u4;\r
+# else\r
+# undef BYFOUR /* can't find a four-byte integer type! */\r
+# endif\r
+# endif\r
+# endif\r
+# endif /* STDC */\r
+#endif /* !NOBYFOUR */\r
+\r
+/* Definitions for doing the crc four data bytes at a time. */\r
+#ifdef BYFOUR\r
+# define REV(w) (((w)>>24)+(((w)>>8)&0xff00)+ \\r
+ (((w)&0xff00)<<8)+(((w)&0xff)<<24))\r
+ local unsigned long crc32_little OF((unsigned long,\r
+ const unsigned char FAR *, unsigned));\r
+ local unsigned long crc32_big OF((unsigned long,\r
+ const unsigned char FAR *, unsigned));\r
+# define TBLS 8\r
+#else\r
+# define TBLS 1\r
+#endif /* BYFOUR */\r
+\r
+/* Local functions for crc concatenation */\r
+local unsigned long gf2_matrix_times OF((unsigned long *mat,\r
+ unsigned long vec));\r
+local void gf2_matrix_square OF((unsigned long *square, unsigned long *mat));\r
+\r
+#ifdef DYNAMIC_CRC_TABLE\r
+\r
+local volatile int crc_table_empty = 1;\r
+local unsigned long FAR crc_table[TBLS][256];\r
+local void make_crc_table OF((void));\r
+#ifdef MAKECRCH\r
+ local void write_table OF((FILE *, const unsigned long FAR *));\r
+#endif /* MAKECRCH */\r
+/*\r
+ Generate tables for a byte-wise 32-bit CRC calculation on the polynomial:\r
+ x^32+x^26+x^23+x^22+x^16+x^12+x^11+x^10+x^8+x^7+x^5+x^4+x^2+x+1.\r
+\r
+ Polynomials over GF(2) are represented in binary, one bit per coefficient,\r
+ with the lowest powers in the most significant bit. Then adding polynomials\r
+ is just exclusive-or, and multiplying a polynomial by x is a right shift by\r
+ one. If we call the above polynomial p, and represent a byte as the\r
+ polynomial q, also with the lowest power in the most significant bit (so the\r
+ byte 0xb1 is the polynomial x^7+x^3+x+1), then the CRC is (q*x^32) mod p,\r
+ where a mod b means the remainder after dividing a by b.\r
+\r
+ This calculation is done using the shift-register method of multiplying and\r
+ taking the remainder. The register is initialized to zero, and for each\r
+ incoming bit, x^32 is added mod p to the register if the bit is a one (where\r
+ x^32 mod p is p+x^32 = x^26+...+1), and the register is multiplied mod p by\r
+ x (which is shifting right by one and adding x^32 mod p if the bit shifted\r
+ out is a one). We start with the highest power (least significant bit) of\r
+ q and repeat for all eight bits of q.\r
+\r
+ The first table is simply the CRC of all possible eight bit values. This is\r
+ all the information needed to generate CRCs on data a byte at a time for all\r
+ combinations of CRC register values and incoming bytes. The remaining tables\r
+ allow for word-at-a-time CRC calculation for both big-endian and little-\r
+ endian machines, where a word is four bytes.\r
+*/\r
+local void make_crc_table()\r
+{\r
+ unsigned long c;\r
+ int n, k;\r
+ unsigned long poly; /* polynomial exclusive-or pattern */\r
+ /* terms of polynomial defining this crc (except x^32): */\r
+ static volatile int first = 1; /* flag to limit concurrent making */\r
+ static const unsigned char p[] = {0,1,2,4,5,7,8,10,11,12,16,22,23,26};\r
+\r
+ /* See if another task is already doing this (not thread-safe, but better\r
+ than nothing -- significantly reduces duration of vulnerability in\r
+ case the advice about DYNAMIC_CRC_TABLE is ignored) */\r
+ if (first) {\r
+ first = 0;\r
+\r
+ /* make exclusive-or pattern from polynomial (0xedb88320UL) */\r
+ poly = 0UL;\r
+ for (n = 0; n < sizeof(p)/sizeof(unsigned char); n++)\r
+ poly |= 1UL << (31 - p[n]);\r
+\r
+ /* generate a crc for every 8-bit value */\r
+ for (n = 0; n < 256; n++) {\r
+ c = (unsigned long)n;\r
+ for (k = 0; k < 8; k++)\r
+ c = c & 1 ? poly ^ (c >> 1) : c >> 1;\r
+ crc_table[0][n] = c;\r
+ }\r
+\r
+#ifdef BYFOUR\r
+ /* generate crc for each value followed by one, two, and three zeros,\r
+ and then the byte reversal of those as well as the first table */\r
+ for (n = 0; n < 256; n++) {\r
+ c = crc_table[0][n];\r
+ crc_table[4][n] = REV(c);\r
+ for (k = 1; k < 4; k++) {\r
+ c = crc_table[0][c & 0xff] ^ (c >> 8);\r
+ crc_table[k][n] = c;\r
+ crc_table[k + 4][n] = REV(c);\r
+ }\r
+ }\r
+#endif /* BYFOUR */\r
+\r
+ crc_table_empty = 0;\r
+ }\r
+ else { /* not first */\r
+ /* wait for the other guy to finish (not efficient, but rare) */\r
+ while (crc_table_empty)\r
+ ;\r
+ }\r
+\r
+#ifdef MAKECRCH\r
+ /* write out CRC tables to crc32.h */\r
+ {\r
+ FILE *out;\r
+\r
+ out = fopen("crc32.h", "w");\r
+ if (out == NULL) return;\r
+ fprintf(out, "/* crc32.h -- tables for rapid CRC calculation\n");\r
+ fprintf(out, " * Generated automatically by crc32.c\n */\n\n");\r
+ fprintf(out, "local const unsigned long FAR ");\r
+ fprintf(out, "crc_table[TBLS][256] =\n{\n {\n");\r
+ write_table(out, crc_table[0]);\r
+# ifdef BYFOUR\r
+ fprintf(out, "#ifdef BYFOUR\n");\r
+ for (k = 1; k < 8; k++) {\r
+ fprintf(out, " },\n {\n");\r
+ write_table(out, crc_table[k]);\r
+ }\r
+ fprintf(out, "#endif\n");\r
+# endif /* BYFOUR */\r
+ fprintf(out, " }\n};\n");\r
+ fclose(out);\r
+ }\r
+#endif /* MAKECRCH */\r
+}\r
+\r
+#ifdef MAKECRCH\r
+local void write_table(out, table)\r
+ FILE *out;\r
+ const unsigned long FAR *table;\r
+{\r
+ int n;\r
+\r
+ for (n = 0; n < 256; n++)\r
+ fprintf(out, "%s0x%08lxUL%s", n % 5 ? "" : " ", table[n],\r
+ n == 255 ? "\n" : (n % 5 == 4 ? ",\n" : ", "));\r
+}\r
+#endif /* MAKECRCH */\r
+\r
+#else /* !DYNAMIC_CRC_TABLE */\r
+/* ========================================================================\r
+ * Tables of CRC-32s of all single-byte values, made by make_crc_table().\r
+ */\r
+#include "crc32.h"\r
+#endif /* DYNAMIC_CRC_TABLE */\r
+\r
+/* =========================================================================\r
+ * This function can be used by asm versions of crc32()\r
+ */\r
+const unsigned long FAR * ZEXPORT get_crc_table()\r
+{\r
+#ifdef DYNAMIC_CRC_TABLE\r
+ if (crc_table_empty)\r
+ make_crc_table();\r
+#endif /* DYNAMIC_CRC_TABLE */\r
+ return (const unsigned long FAR *)crc_table;\r
+}\r
+\r
+/* ========================================================================= */\r
+#define DO1 crc = crc_table[0][((int)crc ^ (*buf++)) & 0xff] ^ (crc >> 8)\r
+#define DO8 DO1; DO1; DO1; DO1; DO1; DO1; DO1; DO1\r
+\r
+/* ========================================================================= */\r
+unsigned long ZEXPORT crc32(crc, buf, len)\r
+ unsigned long crc;\r
+ const unsigned char FAR *buf;\r
+ unsigned len;\r
+{\r
+ if (buf == Z_NULL) return 0UL;\r
+\r
+#ifdef DYNAMIC_CRC_TABLE\r
+ if (crc_table_empty)\r
+ make_crc_table();\r
+#endif /* DYNAMIC_CRC_TABLE */\r
+\r
+#ifdef BYFOUR\r
+ if (sizeof(void *) == sizeof(ptrdiff_t)) {\r
+ u4 endian;\r
+\r
+ endian = 1;\r
+ if (*((unsigned char *)(&endian)))\r
+ return crc32_little(crc, buf, len);\r
+ else\r
+ return crc32_big(crc, buf, len);\r
+ }\r
+#endif /* BYFOUR */\r
+ crc = crc ^ 0xffffffffUL;\r
+ while (len >= 8) {\r
+ DO8;\r
+ len -= 8;\r
+ }\r
+ if (len) do {\r
+ DO1;\r
+ } while (--len);\r
+ return crc ^ 0xffffffffUL;\r
+}\r
+\r
+#ifdef BYFOUR\r
+\r
+/* ========================================================================= */\r
+#define DOLIT4 c ^= *buf4++; \\r
+ c = crc_table[3][c & 0xff] ^ crc_table[2][(c >> 8) & 0xff] ^ \\r
+ crc_table[1][(c >> 16) & 0xff] ^ crc_table[0][c >> 24]\r
+#define DOLIT32 DOLIT4; DOLIT4; DOLIT4; DOLIT4; DOLIT4; DOLIT4; DOLIT4; DOLIT4\r
+\r
+/* ========================================================================= */\r
+local unsigned long crc32_little(crc, buf, len)\r
+ unsigned long crc;\r
+ const unsigned char FAR *buf;\r
+ unsigned len;\r
+{\r
+ register u4 c;\r
+ register const u4 FAR *buf4;\r
+\r
+ c = (u4)crc;\r
+ c = ~c;\r
+ while (len && ((ptrdiff_t)buf & 3)) {\r
+ c = crc_table[0][(c ^ *buf++) & 0xff] ^ (c >> 8);\r
+ len--;\r
+ }\r
+\r
+ buf4 = (const u4 FAR *)(const void FAR *)buf;\r
+ while (len >= 32) {\r
+ DOLIT32;\r
+ len -= 32;\r
+ }\r
+ while (len >= 4) {\r
+ DOLIT4;\r
+ len -= 4;\r
+ }\r
+ buf = (const unsigned char FAR *)buf4;\r
+\r
+ if (len) do {\r
+ c = crc_table[0][(c ^ *buf++) & 0xff] ^ (c >> 8);\r
+ } while (--len);\r
+ c = ~c;\r
+ return (unsigned long)c;\r
+}\r
+\r
+/* ========================================================================= */\r
+#define DOBIG4 c ^= *++buf4; \\r
+ c = crc_table[4][c & 0xff] ^ crc_table[5][(c >> 8) & 0xff] ^ \\r
+ crc_table[6][(c >> 16) & 0xff] ^ crc_table[7][c >> 24]\r
+#define DOBIG32 DOBIG4; DOBIG4; DOBIG4; DOBIG4; DOBIG4; DOBIG4; DOBIG4; DOBIG4\r
+\r
+/* ========================================================================= */\r
+local unsigned long crc32_big(crc, buf, len)\r
+ unsigned long crc;\r
+ const unsigned char FAR *buf;\r
+ unsigned len;\r
+{\r
+ register u4 c;\r
+ register const u4 FAR *buf4;\r
+\r
+ c = REV((u4)crc);\r
+ c = ~c;\r
+ while (len && ((ptrdiff_t)buf & 3)) {\r
+ c = crc_table[4][(c >> 24) ^ *buf++] ^ (c << 8);\r
+ len--;\r
+ }\r
+\r
+ buf4 = (const u4 FAR *)(const void FAR *)buf;\r
+ buf4--;\r
+ while (len >= 32) {\r
+ DOBIG32;\r
+ len -= 32;\r
+ }\r
+ while (len >= 4) {\r
+ DOBIG4;\r
+ len -= 4;\r
+ }\r
+ buf4++;\r
+ buf = (const unsigned char FAR *)buf4;\r
+\r
+ if (len) do {\r
+ c = crc_table[4][(c >> 24) ^ *buf++] ^ (c << 8);\r
+ } while (--len);\r
+ c = ~c;\r
+ return (unsigned long)(REV(c));\r
+}\r
+\r
+#endif /* BYFOUR */\r
+\r
+#define GF2_DIM 32 /* dimension of GF(2) vectors (length of CRC) */\r
+\r
+/* ========================================================================= */\r
+local unsigned long gf2_matrix_times(mat, vec)\r
+ unsigned long *mat;\r
+ unsigned long vec;\r
+{\r
+ unsigned long sum;\r
+\r
+ sum = 0;\r
+ while (vec) {\r
+ if (vec & 1)\r
+ sum ^= *mat;\r
+ vec >>= 1;\r
+ mat++;\r
+ }\r
+ return sum;\r
+}\r
+\r
+/* ========================================================================= */\r
+local void gf2_matrix_square(square, mat)\r
+ unsigned long *square;\r
+ unsigned long *mat;\r
+{\r
+ int n;\r
+\r
+ for (n = 0; n < GF2_DIM; n++)\r
+ square[n] = gf2_matrix_times(mat, mat[n]);\r
+}\r
+\r
+/* ========================================================================= */\r
+uLong ZEXPORT crc32_combine(crc1, crc2, len2)\r
+ uLong crc1;\r
+ uLong crc2;\r
+ z_off_t len2;\r
+{\r
+ int n;\r
+ unsigned long row;\r
+ unsigned long even[GF2_DIM]; /* even-power-of-two zeros operator */\r
+ unsigned long odd[GF2_DIM]; /* odd-power-of-two zeros operator */\r
+\r
+ /* degenerate case */\r
+ if (len2 == 0)\r
+ return crc1;\r
+\r
+ /* put operator for one zero bit in odd */\r
+ odd[0] = 0xedb88320L; /* CRC-32 polynomial */\r
+ row = 1;\r
+ for (n = 1; n < GF2_DIM; n++) {\r
+ odd[n] = row;\r
+ row <<= 1;\r
+ }\r
+\r
+ /* put operator for two zero bits in even */\r
+ gf2_matrix_square(even, odd);\r
+\r
+ /* put operator for four zero bits in odd */\r
+ gf2_matrix_square(odd, even);\r
+\r
+ /* apply len2 zeros to crc1 (first square will put the operator for one\r
+ zero byte, eight zero bits, in even) */\r
+ do {\r
+ /* apply zeros operator for this bit of len2 */\r
+ gf2_matrix_square(even, odd);\r
+ if (len2 & 1)\r
+ crc1 = gf2_matrix_times(even, crc1);\r
+ len2 >>= 1;\r
+\r
+ /* if no more bits set, then done */\r
+ if (len2 == 0)\r
+ break;\r
+\r
+ /* another iteration of the loop with odd and even swapped */\r
+ gf2_matrix_square(odd, even);\r
+ if (len2 & 1)\r
+ crc1 = gf2_matrix_times(odd, crc1);\r
+ len2 >>= 1;\r
+\r
+ /* if no more bits set, then done */\r
+ } while (len2 != 0);\r
+\r
+ /* return combined crc */\r
+ crc1 ^= crc2;\r
+ return crc1;\r
+}\r
--- /dev/null
+/* crc32.h -- tables for rapid CRC calculation\r
+ * Generated automatically by crc32.c\r
+ */\r
+\r
+local const unsigned long FAR crc_table[TBLS][256] =\r
+{\r
+ {\r
+ 0x00000000UL, 0x77073096UL, 0xee0e612cUL, 0x990951baUL, 0x076dc419UL,\r
+ 0x706af48fUL, 0xe963a535UL, 0x9e6495a3UL, 0x0edb8832UL, 0x79dcb8a4UL,\r
+ 0xe0d5e91eUL, 0x97d2d988UL, 0x09b64c2bUL, 0x7eb17cbdUL, 0xe7b82d07UL,\r
+ 0x90bf1d91UL, 0x1db71064UL, 0x6ab020f2UL, 0xf3b97148UL, 0x84be41deUL,\r
+ 0x1adad47dUL, 0x6ddde4ebUL, 0xf4d4b551UL, 0x83d385c7UL, 0x136c9856UL,\r
+ 0x646ba8c0UL, 0xfd62f97aUL, 0x8a65c9ecUL, 0x14015c4fUL, 0x63066cd9UL,\r
+ 0xfa0f3d63UL, 0x8d080df5UL, 0x3b6e20c8UL, 0x4c69105eUL, 0xd56041e4UL,\r
+ 0xa2677172UL, 0x3c03e4d1UL, 0x4b04d447UL, 0xd20d85fdUL, 0xa50ab56bUL,\r
+ 0x35b5a8faUL, 0x42b2986cUL, 0xdbbbc9d6UL, 0xacbcf940UL, 0x32d86ce3UL,\r
+ 0x45df5c75UL, 0xdcd60dcfUL, 0xabd13d59UL, 0x26d930acUL, 0x51de003aUL,\r
+ 0xc8d75180UL, 0xbfd06116UL, 0x21b4f4b5UL, 0x56b3c423UL, 0xcfba9599UL,\r
+ 0xb8bda50fUL, 0x2802b89eUL, 0x5f058808UL, 0xc60cd9b2UL, 0xb10be924UL,\r
+ 0x2f6f7c87UL, 0x58684c11UL, 0xc1611dabUL, 0xb6662d3dUL, 0x76dc4190UL,\r
+ 0x01db7106UL, 0x98d220bcUL, 0xefd5102aUL, 0x71b18589UL, 0x06b6b51fUL,\r
+ 0x9fbfe4a5UL, 0xe8b8d433UL, 0x7807c9a2UL, 0x0f00f934UL, 0x9609a88eUL,\r
+ 0xe10e9818UL, 0x7f6a0dbbUL, 0x086d3d2dUL, 0x91646c97UL, 0xe6635c01UL,\r
+ 0x6b6b51f4UL, 0x1c6c6162UL, 0x856530d8UL, 0xf262004eUL, 0x6c0695edUL,\r
+ 0x1b01a57bUL, 0x8208f4c1UL, 0xf50fc457UL, 0x65b0d9c6UL, 0x12b7e950UL,\r
+ 0x8bbeb8eaUL, 0xfcb9887cUL, 0x62dd1ddfUL, 0x15da2d49UL, 0x8cd37cf3UL,\r
+ 0xfbd44c65UL, 0x4db26158UL, 0x3ab551ceUL, 0xa3bc0074UL, 0xd4bb30e2UL,\r
+ 0x4adfa541UL, 0x3dd895d7UL, 0xa4d1c46dUL, 0xd3d6f4fbUL, 0x4369e96aUL,\r
+ 0x346ed9fcUL, 0xad678846UL, 0xda60b8d0UL, 0x44042d73UL, 0x33031de5UL,\r
+ 0xaa0a4c5fUL, 0xdd0d7cc9UL, 0x5005713cUL, 0x270241aaUL, 0xbe0b1010UL,\r
+ 0xc90c2086UL, 0x5768b525UL, 0x206f85b3UL, 0xb966d409UL, 0xce61e49fUL,\r
+ 0x5edef90eUL, 0x29d9c998UL, 0xb0d09822UL, 0xc7d7a8b4UL, 0x59b33d17UL,\r
+ 0x2eb40d81UL, 0xb7bd5c3bUL, 0xc0ba6cadUL, 0xedb88320UL, 0x9abfb3b6UL,\r
+ 0x03b6e20cUL, 0x74b1d29aUL, 0xead54739UL, 0x9dd277afUL, 0x04db2615UL,\r
+ 0x73dc1683UL, 0xe3630b12UL, 0x94643b84UL, 0x0d6d6a3eUL, 0x7a6a5aa8UL,\r
+ 0xe40ecf0bUL, 0x9309ff9dUL, 0x0a00ae27UL, 0x7d079eb1UL, 0xf00f9344UL,\r
+ 0x8708a3d2UL, 0x1e01f268UL, 0x6906c2feUL, 0xf762575dUL, 0x806567cbUL,\r
+ 0x196c3671UL, 0x6e6b06e7UL, 0xfed41b76UL, 0x89d32be0UL, 0x10da7a5aUL,\r
+ 0x67dd4accUL, 0xf9b9df6fUL, 0x8ebeeff9UL, 0x17b7be43UL, 0x60b08ed5UL,\r
+ 0xd6d6a3e8UL, 0xa1d1937eUL, 0x38d8c2c4UL, 0x4fdff252UL, 0xd1bb67f1UL,\r
+ 0xa6bc5767UL, 0x3fb506ddUL, 0x48b2364bUL, 0xd80d2bdaUL, 0xaf0a1b4cUL,\r
+ 0x36034af6UL, 0x41047a60UL, 0xdf60efc3UL, 0xa867df55UL, 0x316e8eefUL,\r
+ 0x4669be79UL, 0xcb61b38cUL, 0xbc66831aUL, 0x256fd2a0UL, 0x5268e236UL,\r
+ 0xcc0c7795UL, 0xbb0b4703UL, 0x220216b9UL, 0x5505262fUL, 0xc5ba3bbeUL,\r
+ 0xb2bd0b28UL, 0x2bb45a92UL, 0x5cb36a04UL, 0xc2d7ffa7UL, 0xb5d0cf31UL,\r
+ 0x2cd99e8bUL, 0x5bdeae1dUL, 0x9b64c2b0UL, 0xec63f226UL, 0x756aa39cUL,\r
+ 0x026d930aUL, 0x9c0906a9UL, 0xeb0e363fUL, 0x72076785UL, 0x05005713UL,\r
+ 0x95bf4a82UL, 0xe2b87a14UL, 0x7bb12baeUL, 0x0cb61b38UL, 0x92d28e9bUL,\r
+ 0xe5d5be0dUL, 0x7cdcefb7UL, 0x0bdbdf21UL, 0x86d3d2d4UL, 0xf1d4e242UL,\r
+ 0x68ddb3f8UL, 0x1fda836eUL, 0x81be16cdUL, 0xf6b9265bUL, 0x6fb077e1UL,\r
+ 0x18b74777UL, 0x88085ae6UL, 0xff0f6a70UL, 0x66063bcaUL, 0x11010b5cUL,\r
+ 0x8f659effUL, 0xf862ae69UL, 0x616bffd3UL, 0x166ccf45UL, 0xa00ae278UL,\r
+ 0xd70dd2eeUL, 0x4e048354UL, 0x3903b3c2UL, 0xa7672661UL, 0xd06016f7UL,\r
+ 0x4969474dUL, 0x3e6e77dbUL, 0xaed16a4aUL, 0xd9d65adcUL, 0x40df0b66UL,\r
+ 0x37d83bf0UL, 0xa9bcae53UL, 0xdebb9ec5UL, 0x47b2cf7fUL, 0x30b5ffe9UL,\r
+ 0xbdbdf21cUL, 0xcabac28aUL, 0x53b39330UL, 0x24b4a3a6UL, 0xbad03605UL,\r
+ 0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL,\r
+ 0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL,\r
+ 0x2d02ef8dUL\r
+#ifdef BYFOUR\r
+ },\r
+ {\r
+ 0x00000000UL, 0x191b3141UL, 0x32366282UL, 0x2b2d53c3UL, 0x646cc504UL,\r
+ 0x7d77f445UL, 0x565aa786UL, 0x4f4196c7UL, 0xc8d98a08UL, 0xd1c2bb49UL,\r
+ 0xfaefe88aUL, 0xe3f4d9cbUL, 0xacb54f0cUL, 0xb5ae7e4dUL, 0x9e832d8eUL,\r
+ 0x87981ccfUL, 0x4ac21251UL, 0x53d92310UL, 0x78f470d3UL, 0x61ef4192UL,\r
+ 0x2eaed755UL, 0x37b5e614UL, 0x1c98b5d7UL, 0x05838496UL, 0x821b9859UL,\r
+ 0x9b00a918UL, 0xb02dfadbUL, 0xa936cb9aUL, 0xe6775d5dUL, 0xff6c6c1cUL,\r
+ 0xd4413fdfUL, 0xcd5a0e9eUL, 0x958424a2UL, 0x8c9f15e3UL, 0xa7b24620UL,\r
+ 0xbea97761UL, 0xf1e8e1a6UL, 0xe8f3d0e7UL, 0xc3de8324UL, 0xdac5b265UL,\r
+ 0x5d5daeaaUL, 0x44469febUL, 0x6f6bcc28UL, 0x7670fd69UL, 0x39316baeUL,\r
+ 0x202a5aefUL, 0x0b07092cUL, 0x121c386dUL, 0xdf4636f3UL, 0xc65d07b2UL,\r
+ 0xed705471UL, 0xf46b6530UL, 0xbb2af3f7UL, 0xa231c2b6UL, 0x891c9175UL,\r
+ 0x9007a034UL, 0x179fbcfbUL, 0x0e848dbaUL, 0x25a9de79UL, 0x3cb2ef38UL,\r
+ 0x73f379ffUL, 0x6ae848beUL, 0x41c51b7dUL, 0x58de2a3cUL, 0xf0794f05UL,\r
+ 0xe9627e44UL, 0xc24f2d87UL, 0xdb541cc6UL, 0x94158a01UL, 0x8d0ebb40UL,\r
+ 0xa623e883UL, 0xbf38d9c2UL, 0x38a0c50dUL, 0x21bbf44cUL, 0x0a96a78fUL,\r
+ 0x138d96ceUL, 0x5ccc0009UL, 0x45d73148UL, 0x6efa628bUL, 0x77e153caUL,\r
+ 0xbabb5d54UL, 0xa3a06c15UL, 0x888d3fd6UL, 0x91960e97UL, 0xded79850UL,\r
+ 0xc7cca911UL, 0xece1fad2UL, 0xf5facb93UL, 0x7262d75cUL, 0x6b79e61dUL,\r
+ 0x4054b5deUL, 0x594f849fUL, 0x160e1258UL, 0x0f152319UL, 0x243870daUL,\r
+ 0x3d23419bUL, 0x65fd6ba7UL, 0x7ce65ae6UL, 0x57cb0925UL, 0x4ed03864UL,\r
+ 0x0191aea3UL, 0x188a9fe2UL, 0x33a7cc21UL, 0x2abcfd60UL, 0xad24e1afUL,\r
+ 0xb43fd0eeUL, 0x9f12832dUL, 0x8609b26cUL, 0xc94824abUL, 0xd05315eaUL,\r
+ 0xfb7e4629UL, 0xe2657768UL, 0x2f3f79f6UL, 0x362448b7UL, 0x1d091b74UL,\r
+ 0x04122a35UL, 0x4b53bcf2UL, 0x52488db3UL, 0x7965de70UL, 0x607eef31UL,\r
+ 0xe7e6f3feUL, 0xfefdc2bfUL, 0xd5d0917cUL, 0xcccba03dUL, 0x838a36faUL,\r
+ 0x9a9107bbUL, 0xb1bc5478UL, 0xa8a76539UL, 0x3b83984bUL, 0x2298a90aUL,\r
+ 0x09b5fac9UL, 0x10aecb88UL, 0x5fef5d4fUL, 0x46f46c0eUL, 0x6dd93fcdUL,\r
+ 0x74c20e8cUL, 0xf35a1243UL, 0xea412302UL, 0xc16c70c1UL, 0xd8774180UL,\r
+ 0x9736d747UL, 0x8e2de606UL, 0xa500b5c5UL, 0xbc1b8484UL, 0x71418a1aUL,\r
+ 0x685abb5bUL, 0x4377e898UL, 0x5a6cd9d9UL, 0x152d4f1eUL, 0x0c367e5fUL,\r
+ 0x271b2d9cUL, 0x3e001cddUL, 0xb9980012UL, 0xa0833153UL, 0x8bae6290UL,\r
+ 0x92b553d1UL, 0xddf4c516UL, 0xc4eff457UL, 0xefc2a794UL, 0xf6d996d5UL,\r
+ 0xae07bce9UL, 0xb71c8da8UL, 0x9c31de6bUL, 0x852aef2aUL, 0xca6b79edUL,\r
+ 0xd37048acUL, 0xf85d1b6fUL, 0xe1462a2eUL, 0x66de36e1UL, 0x7fc507a0UL,\r
+ 0x54e85463UL, 0x4df36522UL, 0x02b2f3e5UL, 0x1ba9c2a4UL, 0x30849167UL,\r
+ 0x299fa026UL, 0xe4c5aeb8UL, 0xfdde9ff9UL, 0xd6f3cc3aUL, 0xcfe8fd7bUL,\r
+ 0x80a96bbcUL, 0x99b25afdUL, 0xb29f093eUL, 0xab84387fUL, 0x2c1c24b0UL,\r
+ 0x350715f1UL, 0x1e2a4632UL, 0x07317773UL, 0x4870e1b4UL, 0x516bd0f5UL,\r
+ 0x7a468336UL, 0x635db277UL, 0xcbfad74eUL, 0xd2e1e60fUL, 0xf9ccb5ccUL,\r
+ 0xe0d7848dUL, 0xaf96124aUL, 0xb68d230bUL, 0x9da070c8UL, 0x84bb4189UL,\r
+ 0x03235d46UL, 0x1a386c07UL, 0x31153fc4UL, 0x280e0e85UL, 0x674f9842UL,\r
+ 0x7e54a903UL, 0x5579fac0UL, 0x4c62cb81UL, 0x8138c51fUL, 0x9823f45eUL,\r
+ 0xb30ea79dUL, 0xaa1596dcUL, 0xe554001bUL, 0xfc4f315aUL, 0xd7626299UL,\r
+ 0xce7953d8UL, 0x49e14f17UL, 0x50fa7e56UL, 0x7bd72d95UL, 0x62cc1cd4UL,\r
+ 0x2d8d8a13UL, 0x3496bb52UL, 0x1fbbe891UL, 0x06a0d9d0UL, 0x5e7ef3ecUL,\r
+ 0x4765c2adUL, 0x6c48916eUL, 0x7553a02fUL, 0x3a1236e8UL, 0x230907a9UL,\r
+ 0x0824546aUL, 0x113f652bUL, 0x96a779e4UL, 0x8fbc48a5UL, 0xa4911b66UL,\r
+ 0xbd8a2a27UL, 0xf2cbbce0UL, 0xebd08da1UL, 0xc0fdde62UL, 0xd9e6ef23UL,\r
+ 0x14bce1bdUL, 0x0da7d0fcUL, 0x268a833fUL, 0x3f91b27eUL, 0x70d024b9UL,\r
+ 0x69cb15f8UL, 0x42e6463bUL, 0x5bfd777aUL, 0xdc656bb5UL, 0xc57e5af4UL,\r
+ 0xee530937UL, 0xf7483876UL, 0xb809aeb1UL, 0xa1129ff0UL, 0x8a3fcc33UL,\r
+ 0x9324fd72UL\r
+ },\r
+ {\r
+ 0x00000000UL, 0x01c26a37UL, 0x0384d46eUL, 0x0246be59UL, 0x0709a8dcUL,\r
+ 0x06cbc2ebUL, 0x048d7cb2UL, 0x054f1685UL, 0x0e1351b8UL, 0x0fd13b8fUL,\r
+ 0x0d9785d6UL, 0x0c55efe1UL, 0x091af964UL, 0x08d89353UL, 0x0a9e2d0aUL,\r
+ 0x0b5c473dUL, 0x1c26a370UL, 0x1de4c947UL, 0x1fa2771eUL, 0x1e601d29UL,\r
+ 0x1b2f0bacUL, 0x1aed619bUL, 0x18abdfc2UL, 0x1969b5f5UL, 0x1235f2c8UL,\r
+ 0x13f798ffUL, 0x11b126a6UL, 0x10734c91UL, 0x153c5a14UL, 0x14fe3023UL,\r
+ 0x16b88e7aUL, 0x177ae44dUL, 0x384d46e0UL, 0x398f2cd7UL, 0x3bc9928eUL,\r
+ 0x3a0bf8b9UL, 0x3f44ee3cUL, 0x3e86840bUL, 0x3cc03a52UL, 0x3d025065UL,\r
+ 0x365e1758UL, 0x379c7d6fUL, 0x35dac336UL, 0x3418a901UL, 0x3157bf84UL,\r
+ 0x3095d5b3UL, 0x32d36beaUL, 0x331101ddUL, 0x246be590UL, 0x25a98fa7UL,\r
+ 0x27ef31feUL, 0x262d5bc9UL, 0x23624d4cUL, 0x22a0277bUL, 0x20e69922UL,\r
+ 0x2124f315UL, 0x2a78b428UL, 0x2bbade1fUL, 0x29fc6046UL, 0x283e0a71UL,\r
+ 0x2d711cf4UL, 0x2cb376c3UL, 0x2ef5c89aUL, 0x2f37a2adUL, 0x709a8dc0UL,\r
+ 0x7158e7f7UL, 0x731e59aeUL, 0x72dc3399UL, 0x7793251cUL, 0x76514f2bUL,\r
+ 0x7417f172UL, 0x75d59b45UL, 0x7e89dc78UL, 0x7f4bb64fUL, 0x7d0d0816UL,\r
+ 0x7ccf6221UL, 0x798074a4UL, 0x78421e93UL, 0x7a04a0caUL, 0x7bc6cafdUL,\r
+ 0x6cbc2eb0UL, 0x6d7e4487UL, 0x6f38fadeUL, 0x6efa90e9UL, 0x6bb5866cUL,\r
+ 0x6a77ec5bUL, 0x68315202UL, 0x69f33835UL, 0x62af7f08UL, 0x636d153fUL,\r
+ 0x612bab66UL, 0x60e9c151UL, 0x65a6d7d4UL, 0x6464bde3UL, 0x662203baUL,\r
+ 0x67e0698dUL, 0x48d7cb20UL, 0x4915a117UL, 0x4b531f4eUL, 0x4a917579UL,\r
+ 0x4fde63fcUL, 0x4e1c09cbUL, 0x4c5ab792UL, 0x4d98dda5UL, 0x46c49a98UL,\r
+ 0x4706f0afUL, 0x45404ef6UL, 0x448224c1UL, 0x41cd3244UL, 0x400f5873UL,\r
+ 0x4249e62aUL, 0x438b8c1dUL, 0x54f16850UL, 0x55330267UL, 0x5775bc3eUL,\r
+ 0x56b7d609UL, 0x53f8c08cUL, 0x523aaabbUL, 0x507c14e2UL, 0x51be7ed5UL,\r
+ 0x5ae239e8UL, 0x5b2053dfUL, 0x5966ed86UL, 0x58a487b1UL, 0x5deb9134UL,\r
+ 0x5c29fb03UL, 0x5e6f455aUL, 0x5fad2f6dUL, 0xe1351b80UL, 0xe0f771b7UL,\r
+ 0xe2b1cfeeUL, 0xe373a5d9UL, 0xe63cb35cUL, 0xe7fed96bUL, 0xe5b86732UL,\r
+ 0xe47a0d05UL, 0xef264a38UL, 0xeee4200fUL, 0xeca29e56UL, 0xed60f461UL,\r
+ 0xe82fe2e4UL, 0xe9ed88d3UL, 0xebab368aUL, 0xea695cbdUL, 0xfd13b8f0UL,\r
+ 0xfcd1d2c7UL, 0xfe976c9eUL, 0xff5506a9UL, 0xfa1a102cUL, 0xfbd87a1bUL,\r
+ 0xf99ec442UL, 0xf85cae75UL, 0xf300e948UL, 0xf2c2837fUL, 0xf0843d26UL,\r
+ 0xf1465711UL, 0xf4094194UL, 0xf5cb2ba3UL, 0xf78d95faUL, 0xf64fffcdUL,\r
+ 0xd9785d60UL, 0xd8ba3757UL, 0xdafc890eUL, 0xdb3ee339UL, 0xde71f5bcUL,\r
+ 0xdfb39f8bUL, 0xddf521d2UL, 0xdc374be5UL, 0xd76b0cd8UL, 0xd6a966efUL,\r
+ 0xd4efd8b6UL, 0xd52db281UL, 0xd062a404UL, 0xd1a0ce33UL, 0xd3e6706aUL,\r
+ 0xd2241a5dUL, 0xc55efe10UL, 0xc49c9427UL, 0xc6da2a7eUL, 0xc7184049UL,\r
+ 0xc25756ccUL, 0xc3953cfbUL, 0xc1d382a2UL, 0xc011e895UL, 0xcb4dafa8UL,\r
+ 0xca8fc59fUL, 0xc8c97bc6UL, 0xc90b11f1UL, 0xcc440774UL, 0xcd866d43UL,\r
+ 0xcfc0d31aUL, 0xce02b92dUL, 0x91af9640UL, 0x906dfc77UL, 0x922b422eUL,\r
+ 0x93e92819UL, 0x96a63e9cUL, 0x976454abUL, 0x9522eaf2UL, 0x94e080c5UL,\r
+ 0x9fbcc7f8UL, 0x9e7eadcfUL, 0x9c381396UL, 0x9dfa79a1UL, 0x98b56f24UL,\r
+ 0x99770513UL, 0x9b31bb4aUL, 0x9af3d17dUL, 0x8d893530UL, 0x8c4b5f07UL,\r
+ 0x8e0de15eUL, 0x8fcf8b69UL, 0x8a809decUL, 0x8b42f7dbUL, 0x89044982UL,\r
+ 0x88c623b5UL, 0x839a6488UL, 0x82580ebfUL, 0x801eb0e6UL, 0x81dcdad1UL,\r
+ 0x8493cc54UL, 0x8551a663UL, 0x8717183aUL, 0x86d5720dUL, 0xa9e2d0a0UL,\r
+ 0xa820ba97UL, 0xaa6604ceUL, 0xaba46ef9UL, 0xaeeb787cUL, 0xaf29124bUL,\r
+ 0xad6fac12UL, 0xacadc625UL, 0xa7f18118UL, 0xa633eb2fUL, 0xa4755576UL,\r
+ 0xa5b73f41UL, 0xa0f829c4UL, 0xa13a43f3UL, 0xa37cfdaaUL, 0xa2be979dUL,\r
+ 0xb5c473d0UL, 0xb40619e7UL, 0xb640a7beUL, 0xb782cd89UL, 0xb2cddb0cUL,\r
+ 0xb30fb13bUL, 0xb1490f62UL, 0xb08b6555UL, 0xbbd72268UL, 0xba15485fUL,\r
+ 0xb853f606UL, 0xb9919c31UL, 0xbcde8ab4UL, 0xbd1ce083UL, 0xbf5a5edaUL,\r
+ 0xbe9834edUL\r
+ },\r
+ {\r
+ 0x00000000UL, 0xb8bc6765UL, 0xaa09c88bUL, 0x12b5afeeUL, 0x8f629757UL,\r
+ 0x37def032UL, 0x256b5fdcUL, 0x9dd738b9UL, 0xc5b428efUL, 0x7d084f8aUL,\r
+ 0x6fbde064UL, 0xd7018701UL, 0x4ad6bfb8UL, 0xf26ad8ddUL, 0xe0df7733UL,\r
+ 0x58631056UL, 0x5019579fUL, 0xe8a530faUL, 0xfa109f14UL, 0x42acf871UL,\r
+ 0xdf7bc0c8UL, 0x67c7a7adUL, 0x75720843UL, 0xcdce6f26UL, 0x95ad7f70UL,\r
+ 0x2d111815UL, 0x3fa4b7fbUL, 0x8718d09eUL, 0x1acfe827UL, 0xa2738f42UL,\r
+ 0xb0c620acUL, 0x087a47c9UL, 0xa032af3eUL, 0x188ec85bUL, 0x0a3b67b5UL,\r
+ 0xb28700d0UL, 0x2f503869UL, 0x97ec5f0cUL, 0x8559f0e2UL, 0x3de59787UL,\r
+ 0x658687d1UL, 0xdd3ae0b4UL, 0xcf8f4f5aUL, 0x7733283fUL, 0xeae41086UL,\r
+ 0x525877e3UL, 0x40edd80dUL, 0xf851bf68UL, 0xf02bf8a1UL, 0x48979fc4UL,\r
+ 0x5a22302aUL, 0xe29e574fUL, 0x7f496ff6UL, 0xc7f50893UL, 0xd540a77dUL,\r
+ 0x6dfcc018UL, 0x359fd04eUL, 0x8d23b72bUL, 0x9f9618c5UL, 0x272a7fa0UL,\r
+ 0xbafd4719UL, 0x0241207cUL, 0x10f48f92UL, 0xa848e8f7UL, 0x9b14583dUL,\r
+ 0x23a83f58UL, 0x311d90b6UL, 0x89a1f7d3UL, 0x1476cf6aUL, 0xaccaa80fUL,\r
+ 0xbe7f07e1UL, 0x06c36084UL, 0x5ea070d2UL, 0xe61c17b7UL, 0xf4a9b859UL,\r
+ 0x4c15df3cUL, 0xd1c2e785UL, 0x697e80e0UL, 0x7bcb2f0eUL, 0xc377486bUL,\r
+ 0xcb0d0fa2UL, 0x73b168c7UL, 0x6104c729UL, 0xd9b8a04cUL, 0x446f98f5UL,\r
+ 0xfcd3ff90UL, 0xee66507eUL, 0x56da371bUL, 0x0eb9274dUL, 0xb6054028UL,\r
+ 0xa4b0efc6UL, 0x1c0c88a3UL, 0x81dbb01aUL, 0x3967d77fUL, 0x2bd27891UL,\r
+ 0x936e1ff4UL, 0x3b26f703UL, 0x839a9066UL, 0x912f3f88UL, 0x299358edUL,\r
+ 0xb4446054UL, 0x0cf80731UL, 0x1e4da8dfUL, 0xa6f1cfbaUL, 0xfe92dfecUL,\r
+ 0x462eb889UL, 0x549b1767UL, 0xec277002UL, 0x71f048bbUL, 0xc94c2fdeUL,\r
+ 0xdbf98030UL, 0x6345e755UL, 0x6b3fa09cUL, 0xd383c7f9UL, 0xc1366817UL,\r
+ 0x798a0f72UL, 0xe45d37cbUL, 0x5ce150aeUL, 0x4e54ff40UL, 0xf6e89825UL,\r
+ 0xae8b8873UL, 0x1637ef16UL, 0x048240f8UL, 0xbc3e279dUL, 0x21e91f24UL,\r
+ 0x99557841UL, 0x8be0d7afUL, 0x335cb0caUL, 0xed59b63bUL, 0x55e5d15eUL,\r
+ 0x47507eb0UL, 0xffec19d5UL, 0x623b216cUL, 0xda874609UL, 0xc832e9e7UL,\r
+ 0x708e8e82UL, 0x28ed9ed4UL, 0x9051f9b1UL, 0x82e4565fUL, 0x3a58313aUL,\r
+ 0xa78f0983UL, 0x1f336ee6UL, 0x0d86c108UL, 0xb53aa66dUL, 0xbd40e1a4UL,\r
+ 0x05fc86c1UL, 0x1749292fUL, 0xaff54e4aUL, 0x322276f3UL, 0x8a9e1196UL,\r
+ 0x982bbe78UL, 0x2097d91dUL, 0x78f4c94bUL, 0xc048ae2eUL, 0xd2fd01c0UL,\r
+ 0x6a4166a5UL, 0xf7965e1cUL, 0x4f2a3979UL, 0x5d9f9697UL, 0xe523f1f2UL,\r
+ 0x4d6b1905UL, 0xf5d77e60UL, 0xe762d18eUL, 0x5fdeb6ebUL, 0xc2098e52UL,\r
+ 0x7ab5e937UL, 0x680046d9UL, 0xd0bc21bcUL, 0x88df31eaUL, 0x3063568fUL,\r
+ 0x22d6f961UL, 0x9a6a9e04UL, 0x07bda6bdUL, 0xbf01c1d8UL, 0xadb46e36UL,\r
+ 0x15080953UL, 0x1d724e9aUL, 0xa5ce29ffUL, 0xb77b8611UL, 0x0fc7e174UL,\r
+ 0x9210d9cdUL, 0x2aacbea8UL, 0x38191146UL, 0x80a57623UL, 0xd8c66675UL,\r
+ 0x607a0110UL, 0x72cfaefeUL, 0xca73c99bUL, 0x57a4f122UL, 0xef189647UL,\r
+ 0xfdad39a9UL, 0x45115eccUL, 0x764dee06UL, 0xcef18963UL, 0xdc44268dUL,\r
+ 0x64f841e8UL, 0xf92f7951UL, 0x41931e34UL, 0x5326b1daUL, 0xeb9ad6bfUL,\r
+ 0xb3f9c6e9UL, 0x0b45a18cUL, 0x19f00e62UL, 0xa14c6907UL, 0x3c9b51beUL,\r
+ 0x842736dbUL, 0x96929935UL, 0x2e2efe50UL, 0x2654b999UL, 0x9ee8defcUL,\r
+ 0x8c5d7112UL, 0x34e11677UL, 0xa9362eceUL, 0x118a49abUL, 0x033fe645UL,\r
+ 0xbb838120UL, 0xe3e09176UL, 0x5b5cf613UL, 0x49e959fdUL, 0xf1553e98UL,\r
+ 0x6c820621UL, 0xd43e6144UL, 0xc68bceaaUL, 0x7e37a9cfUL, 0xd67f4138UL,\r
+ 0x6ec3265dUL, 0x7c7689b3UL, 0xc4caeed6UL, 0x591dd66fUL, 0xe1a1b10aUL,\r
+ 0xf3141ee4UL, 0x4ba87981UL, 0x13cb69d7UL, 0xab770eb2UL, 0xb9c2a15cUL,\r
+ 0x017ec639UL, 0x9ca9fe80UL, 0x241599e5UL, 0x36a0360bUL, 0x8e1c516eUL,\r
+ 0x866616a7UL, 0x3eda71c2UL, 0x2c6fde2cUL, 0x94d3b949UL, 0x090481f0UL,\r
+ 0xb1b8e695UL, 0xa30d497bUL, 0x1bb12e1eUL, 0x43d23e48UL, 0xfb6e592dUL,\r
+ 0xe9dbf6c3UL, 0x516791a6UL, 0xccb0a91fUL, 0x740cce7aUL, 0x66b96194UL,\r
+ 0xde0506f1UL\r
+ },\r
+ {\r
+ 0x00000000UL, 0x96300777UL, 0x2c610eeeUL, 0xba510999UL, 0x19c46d07UL,\r
+ 0x8ff46a70UL, 0x35a563e9UL, 0xa395649eUL, 0x3288db0eUL, 0xa4b8dc79UL,\r
+ 0x1ee9d5e0UL, 0x88d9d297UL, 0x2b4cb609UL, 0xbd7cb17eUL, 0x072db8e7UL,\r
+ 0x911dbf90UL, 0x6410b71dUL, 0xf220b06aUL, 0x4871b9f3UL, 0xde41be84UL,\r
+ 0x7dd4da1aUL, 0xebe4dd6dUL, 0x51b5d4f4UL, 0xc785d383UL, 0x56986c13UL,\r
+ 0xc0a86b64UL, 0x7af962fdUL, 0xecc9658aUL, 0x4f5c0114UL, 0xd96c0663UL,\r
+ 0x633d0ffaUL, 0xf50d088dUL, 0xc8206e3bUL, 0x5e10694cUL, 0xe44160d5UL,\r
+ 0x727167a2UL, 0xd1e4033cUL, 0x47d4044bUL, 0xfd850dd2UL, 0x6bb50aa5UL,\r
+ 0xfaa8b535UL, 0x6c98b242UL, 0xd6c9bbdbUL, 0x40f9bcacUL, 0xe36cd832UL,\r
+ 0x755cdf45UL, 0xcf0dd6dcUL, 0x593dd1abUL, 0xac30d926UL, 0x3a00de51UL,\r
+ 0x8051d7c8UL, 0x1661d0bfUL, 0xb5f4b421UL, 0x23c4b356UL, 0x9995bacfUL,\r
+ 0x0fa5bdb8UL, 0x9eb80228UL, 0x0888055fUL, 0xb2d90cc6UL, 0x24e90bb1UL,\r
+ 0x877c6f2fUL, 0x114c6858UL, 0xab1d61c1UL, 0x3d2d66b6UL, 0x9041dc76UL,\r
+ 0x0671db01UL, 0xbc20d298UL, 0x2a10d5efUL, 0x8985b171UL, 0x1fb5b606UL,\r
+ 0xa5e4bf9fUL, 0x33d4b8e8UL, 0xa2c90778UL, 0x34f9000fUL, 0x8ea80996UL,\r
+ 0x18980ee1UL, 0xbb0d6a7fUL, 0x2d3d6d08UL, 0x976c6491UL, 0x015c63e6UL,\r
+ 0xf4516b6bUL, 0x62616c1cUL, 0xd8306585UL, 0x4e0062f2UL, 0xed95066cUL,\r
+ 0x7ba5011bUL, 0xc1f40882UL, 0x57c40ff5UL, 0xc6d9b065UL, 0x50e9b712UL,\r
+ 0xeab8be8bUL, 0x7c88b9fcUL, 0xdf1ddd62UL, 0x492dda15UL, 0xf37cd38cUL,\r
+ 0x654cd4fbUL, 0x5861b24dUL, 0xce51b53aUL, 0x7400bca3UL, 0xe230bbd4UL,\r
+ 0x41a5df4aUL, 0xd795d83dUL, 0x6dc4d1a4UL, 0xfbf4d6d3UL, 0x6ae96943UL,\r
+ 0xfcd96e34UL, 0x468867adUL, 0xd0b860daUL, 0x732d0444UL, 0xe51d0333UL,\r
+ 0x5f4c0aaaUL, 0xc97c0dddUL, 0x3c710550UL, 0xaa410227UL, 0x10100bbeUL,\r
+ 0x86200cc9UL, 0x25b56857UL, 0xb3856f20UL, 0x09d466b9UL, 0x9fe461ceUL,\r
+ 0x0ef9de5eUL, 0x98c9d929UL, 0x2298d0b0UL, 0xb4a8d7c7UL, 0x173db359UL,\r
+ 0x810db42eUL, 0x3b5cbdb7UL, 0xad6cbac0UL, 0x2083b8edUL, 0xb6b3bf9aUL,\r
+ 0x0ce2b603UL, 0x9ad2b174UL, 0x3947d5eaUL, 0xaf77d29dUL, 0x1526db04UL,\r
+ 0x8316dc73UL, 0x120b63e3UL, 0x843b6494UL, 0x3e6a6d0dUL, 0xa85a6a7aUL,\r
+ 0x0bcf0ee4UL, 0x9dff0993UL, 0x27ae000aUL, 0xb19e077dUL, 0x44930ff0UL,\r
+ 0xd2a30887UL, 0x68f2011eUL, 0xfec20669UL, 0x5d5762f7UL, 0xcb676580UL,\r
+ 0x71366c19UL, 0xe7066b6eUL, 0x761bd4feUL, 0xe02bd389UL, 0x5a7ada10UL,\r
+ 0xcc4add67UL, 0x6fdfb9f9UL, 0xf9efbe8eUL, 0x43beb717UL, 0xd58eb060UL,\r
+ 0xe8a3d6d6UL, 0x7e93d1a1UL, 0xc4c2d838UL, 0x52f2df4fUL, 0xf167bbd1UL,\r
+ 0x6757bca6UL, 0xdd06b53fUL, 0x4b36b248UL, 0xda2b0dd8UL, 0x4c1b0aafUL,\r
+ 0xf64a0336UL, 0x607a0441UL, 0xc3ef60dfUL, 0x55df67a8UL, 0xef8e6e31UL,\r
+ 0x79be6946UL, 0x8cb361cbUL, 0x1a8366bcUL, 0xa0d26f25UL, 0x36e26852UL,\r
+ 0x95770cccUL, 0x03470bbbUL, 0xb9160222UL, 0x2f260555UL, 0xbe3bbac5UL,\r
+ 0x280bbdb2UL, 0x925ab42bUL, 0x046ab35cUL, 0xa7ffd7c2UL, 0x31cfd0b5UL,\r
+ 0x8b9ed92cUL, 0x1daede5bUL, 0xb0c2649bUL, 0x26f263ecUL, 0x9ca36a75UL,\r
+ 0x0a936d02UL, 0xa906099cUL, 0x3f360eebUL, 0x85670772UL, 0x13570005UL,\r
+ 0x824abf95UL, 0x147ab8e2UL, 0xae2bb17bUL, 0x381bb60cUL, 0x9b8ed292UL,\r
+ 0x0dbed5e5UL, 0xb7efdc7cUL, 0x21dfdb0bUL, 0xd4d2d386UL, 0x42e2d4f1UL,\r
+ 0xf8b3dd68UL, 0x6e83da1fUL, 0xcd16be81UL, 0x5b26b9f6UL, 0xe177b06fUL,\r
+ 0x7747b718UL, 0xe65a0888UL, 0x706a0fffUL, 0xca3b0666UL, 0x5c0b0111UL,\r
+ 0xff9e658fUL, 0x69ae62f8UL, 0xd3ff6b61UL, 0x45cf6c16UL, 0x78e20aa0UL,\r
+ 0xeed20dd7UL, 0x5483044eUL, 0xc2b30339UL, 0x612667a7UL, 0xf71660d0UL,\r
+ 0x4d476949UL, 0xdb776e3eUL, 0x4a6ad1aeUL, 0xdc5ad6d9UL, 0x660bdf40UL,\r
+ 0xf03bd837UL, 0x53aebca9UL, 0xc59ebbdeUL, 0x7fcfb247UL, 0xe9ffb530UL,\r
+ 0x1cf2bdbdUL, 0x8ac2bacaUL, 0x3093b353UL, 0xa6a3b424UL, 0x0536d0baUL,\r
+ 0x9306d7cdUL, 0x2957de54UL, 0xbf67d923UL, 0x2e7a66b3UL, 0xb84a61c4UL,\r
+ 0x021b685dUL, 0x942b6f2aUL, 0x37be0bb4UL, 0xa18e0cc3UL, 0x1bdf055aUL,\r
+ 0x8def022dUL\r
+ },\r
+ {\r
+ 0x00000000UL, 0x41311b19UL, 0x82623632UL, 0xc3532d2bUL, 0x04c56c64UL,\r
+ 0x45f4777dUL, 0x86a75a56UL, 0xc796414fUL, 0x088ad9c8UL, 0x49bbc2d1UL,\r
+ 0x8ae8effaUL, 0xcbd9f4e3UL, 0x0c4fb5acUL, 0x4d7eaeb5UL, 0x8e2d839eUL,\r
+ 0xcf1c9887UL, 0x5112c24aUL, 0x1023d953UL, 0xd370f478UL, 0x9241ef61UL,\r
+ 0x55d7ae2eUL, 0x14e6b537UL, 0xd7b5981cUL, 0x96848305UL, 0x59981b82UL,\r
+ 0x18a9009bUL, 0xdbfa2db0UL, 0x9acb36a9UL, 0x5d5d77e6UL, 0x1c6c6cffUL,\r
+ 0xdf3f41d4UL, 0x9e0e5acdUL, 0xa2248495UL, 0xe3159f8cUL, 0x2046b2a7UL,\r
+ 0x6177a9beUL, 0xa6e1e8f1UL, 0xe7d0f3e8UL, 0x2483dec3UL, 0x65b2c5daUL,\r
+ 0xaaae5d5dUL, 0xeb9f4644UL, 0x28cc6b6fUL, 0x69fd7076UL, 0xae6b3139UL,\r
+ 0xef5a2a20UL, 0x2c09070bUL, 0x6d381c12UL, 0xf33646dfUL, 0xb2075dc6UL,\r
+ 0x715470edUL, 0x30656bf4UL, 0xf7f32abbUL, 0xb6c231a2UL, 0x75911c89UL,\r
+ 0x34a00790UL, 0xfbbc9f17UL, 0xba8d840eUL, 0x79dea925UL, 0x38efb23cUL,\r
+ 0xff79f373UL, 0xbe48e86aUL, 0x7d1bc541UL, 0x3c2ade58UL, 0x054f79f0UL,\r
+ 0x447e62e9UL, 0x872d4fc2UL, 0xc61c54dbUL, 0x018a1594UL, 0x40bb0e8dUL,\r
+ 0x83e823a6UL, 0xc2d938bfUL, 0x0dc5a038UL, 0x4cf4bb21UL, 0x8fa7960aUL,\r
+ 0xce968d13UL, 0x0900cc5cUL, 0x4831d745UL, 0x8b62fa6eUL, 0xca53e177UL,\r
+ 0x545dbbbaUL, 0x156ca0a3UL, 0xd63f8d88UL, 0x970e9691UL, 0x5098d7deUL,\r
+ 0x11a9ccc7UL, 0xd2fae1ecUL, 0x93cbfaf5UL, 0x5cd76272UL, 0x1de6796bUL,\r
+ 0xdeb55440UL, 0x9f844f59UL, 0x58120e16UL, 0x1923150fUL, 0xda703824UL,\r
+ 0x9b41233dUL, 0xa76bfd65UL, 0xe65ae67cUL, 0x2509cb57UL, 0x6438d04eUL,\r
+ 0xa3ae9101UL, 0xe29f8a18UL, 0x21cca733UL, 0x60fdbc2aUL, 0xafe124adUL,\r
+ 0xeed03fb4UL, 0x2d83129fUL, 0x6cb20986UL, 0xab2448c9UL, 0xea1553d0UL,\r
+ 0x29467efbUL, 0x687765e2UL, 0xf6793f2fUL, 0xb7482436UL, 0x741b091dUL,\r
+ 0x352a1204UL, 0xf2bc534bUL, 0xb38d4852UL, 0x70de6579UL, 0x31ef7e60UL,\r
+ 0xfef3e6e7UL, 0xbfc2fdfeUL, 0x7c91d0d5UL, 0x3da0cbccUL, 0xfa368a83UL,\r
+ 0xbb07919aUL, 0x7854bcb1UL, 0x3965a7a8UL, 0x4b98833bUL, 0x0aa99822UL,\r
+ 0xc9fab509UL, 0x88cbae10UL, 0x4f5def5fUL, 0x0e6cf446UL, 0xcd3fd96dUL,\r
+ 0x8c0ec274UL, 0x43125af3UL, 0x022341eaUL, 0xc1706cc1UL, 0x804177d8UL,\r
+ 0x47d73697UL, 0x06e62d8eUL, 0xc5b500a5UL, 0x84841bbcUL, 0x1a8a4171UL,\r
+ 0x5bbb5a68UL, 0x98e87743UL, 0xd9d96c5aUL, 0x1e4f2d15UL, 0x5f7e360cUL,\r
+ 0x9c2d1b27UL, 0xdd1c003eUL, 0x120098b9UL, 0x533183a0UL, 0x9062ae8bUL,\r
+ 0xd153b592UL, 0x16c5f4ddUL, 0x57f4efc4UL, 0x94a7c2efUL, 0xd596d9f6UL,\r
+ 0xe9bc07aeUL, 0xa88d1cb7UL, 0x6bde319cUL, 0x2aef2a85UL, 0xed796bcaUL,\r
+ 0xac4870d3UL, 0x6f1b5df8UL, 0x2e2a46e1UL, 0xe136de66UL, 0xa007c57fUL,\r
+ 0x6354e854UL, 0x2265f34dUL, 0xe5f3b202UL, 0xa4c2a91bUL, 0x67918430UL,\r
+ 0x26a09f29UL, 0xb8aec5e4UL, 0xf99fdefdUL, 0x3accf3d6UL, 0x7bfde8cfUL,\r
+ 0xbc6ba980UL, 0xfd5ab299UL, 0x3e099fb2UL, 0x7f3884abUL, 0xb0241c2cUL,\r
+ 0xf1150735UL, 0x32462a1eUL, 0x73773107UL, 0xb4e17048UL, 0xf5d06b51UL,\r
+ 0x3683467aUL, 0x77b25d63UL, 0x4ed7facbUL, 0x0fe6e1d2UL, 0xccb5ccf9UL,\r
+ 0x8d84d7e0UL, 0x4a1296afUL, 0x0b238db6UL, 0xc870a09dUL, 0x8941bb84UL,\r
+ 0x465d2303UL, 0x076c381aUL, 0xc43f1531UL, 0x850e0e28UL, 0x42984f67UL,\r
+ 0x03a9547eUL, 0xc0fa7955UL, 0x81cb624cUL, 0x1fc53881UL, 0x5ef42398UL,\r
+ 0x9da70eb3UL, 0xdc9615aaUL, 0x1b0054e5UL, 0x5a314ffcUL, 0x996262d7UL,\r
+ 0xd85379ceUL, 0x174fe149UL, 0x567efa50UL, 0x952dd77bUL, 0xd41ccc62UL,\r
+ 0x138a8d2dUL, 0x52bb9634UL, 0x91e8bb1fUL, 0xd0d9a006UL, 0xecf37e5eUL,\r
+ 0xadc26547UL, 0x6e91486cUL, 0x2fa05375UL, 0xe836123aUL, 0xa9070923UL,\r
+ 0x6a542408UL, 0x2b653f11UL, 0xe479a796UL, 0xa548bc8fUL, 0x661b91a4UL,\r
+ 0x272a8abdUL, 0xe0bccbf2UL, 0xa18dd0ebUL, 0x62defdc0UL, 0x23efe6d9UL,\r
+ 0xbde1bc14UL, 0xfcd0a70dUL, 0x3f838a26UL, 0x7eb2913fUL, 0xb924d070UL,\r
+ 0xf815cb69UL, 0x3b46e642UL, 0x7a77fd5bUL, 0xb56b65dcUL, 0xf45a7ec5UL,\r
+ 0x370953eeUL, 0x763848f7UL, 0xb1ae09b8UL, 0xf09f12a1UL, 0x33cc3f8aUL,\r
+ 0x72fd2493UL\r
+ },\r
+ {\r
+ 0x00000000UL, 0x376ac201UL, 0x6ed48403UL, 0x59be4602UL, 0xdca80907UL,\r
+ 0xebc2cb06UL, 0xb27c8d04UL, 0x85164f05UL, 0xb851130eUL, 0x8f3bd10fUL,\r
+ 0xd685970dUL, 0xe1ef550cUL, 0x64f91a09UL, 0x5393d808UL, 0x0a2d9e0aUL,\r
+ 0x3d475c0bUL, 0x70a3261cUL, 0x47c9e41dUL, 0x1e77a21fUL, 0x291d601eUL,\r
+ 0xac0b2f1bUL, 0x9b61ed1aUL, 0xc2dfab18UL, 0xf5b56919UL, 0xc8f23512UL,\r
+ 0xff98f713UL, 0xa626b111UL, 0x914c7310UL, 0x145a3c15UL, 0x2330fe14UL,\r
+ 0x7a8eb816UL, 0x4de47a17UL, 0xe0464d38UL, 0xd72c8f39UL, 0x8e92c93bUL,\r
+ 0xb9f80b3aUL, 0x3cee443fUL, 0x0b84863eUL, 0x523ac03cUL, 0x6550023dUL,\r
+ 0x58175e36UL, 0x6f7d9c37UL, 0x36c3da35UL, 0x01a91834UL, 0x84bf5731UL,\r
+ 0xb3d59530UL, 0xea6bd332UL, 0xdd011133UL, 0x90e56b24UL, 0xa78fa925UL,\r
+ 0xfe31ef27UL, 0xc95b2d26UL, 0x4c4d6223UL, 0x7b27a022UL, 0x2299e620UL,\r
+ 0x15f32421UL, 0x28b4782aUL, 0x1fdeba2bUL, 0x4660fc29UL, 0x710a3e28UL,\r
+ 0xf41c712dUL, 0xc376b32cUL, 0x9ac8f52eUL, 0xada2372fUL, 0xc08d9a70UL,\r
+ 0xf7e75871UL, 0xae591e73UL, 0x9933dc72UL, 0x1c259377UL, 0x2b4f5176UL,\r
+ 0x72f11774UL, 0x459bd575UL, 0x78dc897eUL, 0x4fb64b7fUL, 0x16080d7dUL,\r
+ 0x2162cf7cUL, 0xa4748079UL, 0x931e4278UL, 0xcaa0047aUL, 0xfdcac67bUL,\r
+ 0xb02ebc6cUL, 0x87447e6dUL, 0xdefa386fUL, 0xe990fa6eUL, 0x6c86b56bUL,\r
+ 0x5bec776aUL, 0x02523168UL, 0x3538f369UL, 0x087faf62UL, 0x3f156d63UL,\r
+ 0x66ab2b61UL, 0x51c1e960UL, 0xd4d7a665UL, 0xe3bd6464UL, 0xba032266UL,\r
+ 0x8d69e067UL, 0x20cbd748UL, 0x17a11549UL, 0x4e1f534bUL, 0x7975914aUL,\r
+ 0xfc63de4fUL, 0xcb091c4eUL, 0x92b75a4cUL, 0xa5dd984dUL, 0x989ac446UL,\r
+ 0xaff00647UL, 0xf64e4045UL, 0xc1248244UL, 0x4432cd41UL, 0x73580f40UL,\r
+ 0x2ae64942UL, 0x1d8c8b43UL, 0x5068f154UL, 0x67023355UL, 0x3ebc7557UL,\r
+ 0x09d6b756UL, 0x8cc0f853UL, 0xbbaa3a52UL, 0xe2147c50UL, 0xd57ebe51UL,\r
+ 0xe839e25aUL, 0xdf53205bUL, 0x86ed6659UL, 0xb187a458UL, 0x3491eb5dUL,\r
+ 0x03fb295cUL, 0x5a456f5eUL, 0x6d2fad5fUL, 0x801b35e1UL, 0xb771f7e0UL,\r
+ 0xeecfb1e2UL, 0xd9a573e3UL, 0x5cb33ce6UL, 0x6bd9fee7UL, 0x3267b8e5UL,\r
+ 0x050d7ae4UL, 0x384a26efUL, 0x0f20e4eeUL, 0x569ea2ecUL, 0x61f460edUL,\r
+ 0xe4e22fe8UL, 0xd388ede9UL, 0x8a36abebUL, 0xbd5c69eaUL, 0xf0b813fdUL,\r
+ 0xc7d2d1fcUL, 0x9e6c97feUL, 0xa90655ffUL, 0x2c101afaUL, 0x1b7ad8fbUL,\r
+ 0x42c49ef9UL, 0x75ae5cf8UL, 0x48e900f3UL, 0x7f83c2f2UL, 0x263d84f0UL,\r
+ 0x115746f1UL, 0x944109f4UL, 0xa32bcbf5UL, 0xfa958df7UL, 0xcdff4ff6UL,\r
+ 0x605d78d9UL, 0x5737bad8UL, 0x0e89fcdaUL, 0x39e33edbUL, 0xbcf571deUL,\r
+ 0x8b9fb3dfUL, 0xd221f5ddUL, 0xe54b37dcUL, 0xd80c6bd7UL, 0xef66a9d6UL,\r
+ 0xb6d8efd4UL, 0x81b22dd5UL, 0x04a462d0UL, 0x33cea0d1UL, 0x6a70e6d3UL,\r
+ 0x5d1a24d2UL, 0x10fe5ec5UL, 0x27949cc4UL, 0x7e2adac6UL, 0x494018c7UL,\r
+ 0xcc5657c2UL, 0xfb3c95c3UL, 0xa282d3c1UL, 0x95e811c0UL, 0xa8af4dcbUL,\r
+ 0x9fc58fcaUL, 0xc67bc9c8UL, 0xf1110bc9UL, 0x740744ccUL, 0x436d86cdUL,\r
+ 0x1ad3c0cfUL, 0x2db902ceUL, 0x4096af91UL, 0x77fc6d90UL, 0x2e422b92UL,\r
+ 0x1928e993UL, 0x9c3ea696UL, 0xab546497UL, 0xf2ea2295UL, 0xc580e094UL,\r
+ 0xf8c7bc9fUL, 0xcfad7e9eUL, 0x9613389cUL, 0xa179fa9dUL, 0x246fb598UL,\r
+ 0x13057799UL, 0x4abb319bUL, 0x7dd1f39aUL, 0x3035898dUL, 0x075f4b8cUL,\r
+ 0x5ee10d8eUL, 0x698bcf8fUL, 0xec9d808aUL, 0xdbf7428bUL, 0x82490489UL,\r
+ 0xb523c688UL, 0x88649a83UL, 0xbf0e5882UL, 0xe6b01e80UL, 0xd1dadc81UL,\r
+ 0x54cc9384UL, 0x63a65185UL, 0x3a181787UL, 0x0d72d586UL, 0xa0d0e2a9UL,\r
+ 0x97ba20a8UL, 0xce0466aaUL, 0xf96ea4abUL, 0x7c78ebaeUL, 0x4b1229afUL,\r
+ 0x12ac6fadUL, 0x25c6adacUL, 0x1881f1a7UL, 0x2feb33a6UL, 0x765575a4UL,\r
+ 0x413fb7a5UL, 0xc429f8a0UL, 0xf3433aa1UL, 0xaafd7ca3UL, 0x9d97bea2UL,\r
+ 0xd073c4b5UL, 0xe71906b4UL, 0xbea740b6UL, 0x89cd82b7UL, 0x0cdbcdb2UL,\r
+ 0x3bb10fb3UL, 0x620f49b1UL, 0x55658bb0UL, 0x6822d7bbUL, 0x5f4815baUL,\r
+ 0x06f653b8UL, 0x319c91b9UL, 0xb48adebcUL, 0x83e01cbdUL, 0xda5e5abfUL,\r
+ 0xed3498beUL\r
+ },\r
+ {\r
+ 0x00000000UL, 0x6567bcb8UL, 0x8bc809aaUL, 0xeeafb512UL, 0x5797628fUL,\r
+ 0x32f0de37UL, 0xdc5f6b25UL, 0xb938d79dUL, 0xef28b4c5UL, 0x8a4f087dUL,\r
+ 0x64e0bd6fUL, 0x018701d7UL, 0xb8bfd64aUL, 0xddd86af2UL, 0x3377dfe0UL,\r
+ 0x56106358UL, 0x9f571950UL, 0xfa30a5e8UL, 0x149f10faUL, 0x71f8ac42UL,\r
+ 0xc8c07bdfUL, 0xada7c767UL, 0x43087275UL, 0x266fcecdUL, 0x707fad95UL,\r
+ 0x1518112dUL, 0xfbb7a43fUL, 0x9ed01887UL, 0x27e8cf1aUL, 0x428f73a2UL,\r
+ 0xac20c6b0UL, 0xc9477a08UL, 0x3eaf32a0UL, 0x5bc88e18UL, 0xb5673b0aUL,\r
+ 0xd00087b2UL, 0x6938502fUL, 0x0c5fec97UL, 0xe2f05985UL, 0x8797e53dUL,\r
+ 0xd1878665UL, 0xb4e03addUL, 0x5a4f8fcfUL, 0x3f283377UL, 0x8610e4eaUL,\r
+ 0xe3775852UL, 0x0dd8ed40UL, 0x68bf51f8UL, 0xa1f82bf0UL, 0xc49f9748UL,\r
+ 0x2a30225aUL, 0x4f579ee2UL, 0xf66f497fUL, 0x9308f5c7UL, 0x7da740d5UL,\r
+ 0x18c0fc6dUL, 0x4ed09f35UL, 0x2bb7238dUL, 0xc518969fUL, 0xa07f2a27UL,\r
+ 0x1947fdbaUL, 0x7c204102UL, 0x928ff410UL, 0xf7e848a8UL, 0x3d58149bUL,\r
+ 0x583fa823UL, 0xb6901d31UL, 0xd3f7a189UL, 0x6acf7614UL, 0x0fa8caacUL,\r
+ 0xe1077fbeUL, 0x8460c306UL, 0xd270a05eUL, 0xb7171ce6UL, 0x59b8a9f4UL,\r
+ 0x3cdf154cUL, 0x85e7c2d1UL, 0xe0807e69UL, 0x0e2fcb7bUL, 0x6b4877c3UL,\r
+ 0xa20f0dcbUL, 0xc768b173UL, 0x29c70461UL, 0x4ca0b8d9UL, 0xf5986f44UL,\r
+ 0x90ffd3fcUL, 0x7e5066eeUL, 0x1b37da56UL, 0x4d27b90eUL, 0x284005b6UL,\r
+ 0xc6efb0a4UL, 0xa3880c1cUL, 0x1ab0db81UL, 0x7fd76739UL, 0x9178d22bUL,\r
+ 0xf41f6e93UL, 0x03f7263bUL, 0x66909a83UL, 0x883f2f91UL, 0xed589329UL,\r
+ 0x546044b4UL, 0x3107f80cUL, 0xdfa84d1eUL, 0xbacff1a6UL, 0xecdf92feUL,\r
+ 0x89b82e46UL, 0x67179b54UL, 0x027027ecUL, 0xbb48f071UL, 0xde2f4cc9UL,\r
+ 0x3080f9dbUL, 0x55e74563UL, 0x9ca03f6bUL, 0xf9c783d3UL, 0x176836c1UL,\r
+ 0x720f8a79UL, 0xcb375de4UL, 0xae50e15cUL, 0x40ff544eUL, 0x2598e8f6UL,\r
+ 0x73888baeUL, 0x16ef3716UL, 0xf8408204UL, 0x9d273ebcUL, 0x241fe921UL,\r
+ 0x41785599UL, 0xafd7e08bUL, 0xcab05c33UL, 0x3bb659edUL, 0x5ed1e555UL,\r
+ 0xb07e5047UL, 0xd519ecffUL, 0x6c213b62UL, 0x094687daUL, 0xe7e932c8UL,\r
+ 0x828e8e70UL, 0xd49eed28UL, 0xb1f95190UL, 0x5f56e482UL, 0x3a31583aUL,\r
+ 0x83098fa7UL, 0xe66e331fUL, 0x08c1860dUL, 0x6da63ab5UL, 0xa4e140bdUL,\r
+ 0xc186fc05UL, 0x2f294917UL, 0x4a4ef5afUL, 0xf3762232UL, 0x96119e8aUL,\r
+ 0x78be2b98UL, 0x1dd99720UL, 0x4bc9f478UL, 0x2eae48c0UL, 0xc001fdd2UL,\r
+ 0xa566416aUL, 0x1c5e96f7UL, 0x79392a4fUL, 0x97969f5dUL, 0xf2f123e5UL,\r
+ 0x05196b4dUL, 0x607ed7f5UL, 0x8ed162e7UL, 0xebb6de5fUL, 0x528e09c2UL,\r
+ 0x37e9b57aUL, 0xd9460068UL, 0xbc21bcd0UL, 0xea31df88UL, 0x8f566330UL,\r
+ 0x61f9d622UL, 0x049e6a9aUL, 0xbda6bd07UL, 0xd8c101bfUL, 0x366eb4adUL,\r
+ 0x53090815UL, 0x9a4e721dUL, 0xff29cea5UL, 0x11867bb7UL, 0x74e1c70fUL,\r
+ 0xcdd91092UL, 0xa8beac2aUL, 0x46111938UL, 0x2376a580UL, 0x7566c6d8UL,\r
+ 0x10017a60UL, 0xfeaecf72UL, 0x9bc973caUL, 0x22f1a457UL, 0x479618efUL,\r
+ 0xa939adfdUL, 0xcc5e1145UL, 0x06ee4d76UL, 0x6389f1ceUL, 0x8d2644dcUL,\r
+ 0xe841f864UL, 0x51792ff9UL, 0x341e9341UL, 0xdab12653UL, 0xbfd69aebUL,\r
+ 0xe9c6f9b3UL, 0x8ca1450bUL, 0x620ef019UL, 0x07694ca1UL, 0xbe519b3cUL,\r
+ 0xdb362784UL, 0x35999296UL, 0x50fe2e2eUL, 0x99b95426UL, 0xfcdee89eUL,\r
+ 0x12715d8cUL, 0x7716e134UL, 0xce2e36a9UL, 0xab498a11UL, 0x45e63f03UL,\r
+ 0x208183bbUL, 0x7691e0e3UL, 0x13f65c5bUL, 0xfd59e949UL, 0x983e55f1UL,\r
+ 0x2106826cUL, 0x44613ed4UL, 0xaace8bc6UL, 0xcfa9377eUL, 0x38417fd6UL,\r
+ 0x5d26c36eUL, 0xb389767cUL, 0xd6eecac4UL, 0x6fd61d59UL, 0x0ab1a1e1UL,\r
+ 0xe41e14f3UL, 0x8179a84bUL, 0xd769cb13UL, 0xb20e77abUL, 0x5ca1c2b9UL,\r
+ 0x39c67e01UL, 0x80fea99cUL, 0xe5991524UL, 0x0b36a036UL, 0x6e511c8eUL,\r
+ 0xa7166686UL, 0xc271da3eUL, 0x2cde6f2cUL, 0x49b9d394UL, 0xf0810409UL,\r
+ 0x95e6b8b1UL, 0x7b490da3UL, 0x1e2eb11bUL, 0x483ed243UL, 0x2d596efbUL,\r
+ 0xc3f6dbe9UL, 0xa6916751UL, 0x1fa9b0ccUL, 0x7ace0c74UL, 0x9461b966UL,\r
+ 0xf10605deUL\r
+#endif\r
+ }\r
+};\r
--- /dev/null
+/* deflate.c -- compress data using the deflation algorithm\r
+ * Copyright (C) 1995-2005 Jean-loup Gailly.\r
+ * For conditions of distribution and use, see copyright notice in zlib.h\r
+ */\r
+\r
+/*\r
+ * ALGORITHM\r
+ *\r
+ * The "deflation" process depends on being able to identify portions\r
+ * of the input text which are identical to earlier input (within a\r
+ * sliding window trailing behind the input currently being processed).\r
+ *\r
+ * The most straightforward technique turns out to be the fastest for\r
+ * most input files: try all possible matches and select the longest.\r
+ * The key feature of this algorithm is that insertions into the string\r
+ * dictionary are very simple and thus fast, and deletions are avoided\r
+ * completely. Insertions are performed at each input character, whereas\r
+ * string matches are performed only when the previous match ends. So it\r
+ * is preferable to spend more time in matches to allow very fast string\r
+ * insertions and avoid deletions. The matching algorithm for small\r
+ * strings is inspired from that of Rabin & Karp. A brute force approach\r
+ * is used to find longer strings when a small match has been found.\r
+ * A similar algorithm is used in comic (by Jan-Mark Wams) and freeze\r
+ * (by Leonid Broukhis).\r
+ * A previous version of this file used a more sophisticated algorithm\r
+ * (by Fiala and Greene) which is guaranteed to run in linear amortized\r
+ * time, but has a larger average cost, uses more memory and is patented.\r
+ * However the F&G algorithm may be faster for some highly redundant\r
+ * files if the parameter max_chain_length (described below) is too large.\r
+ *\r
+ * ACKNOWLEDGEMENTS\r
+ *\r
+ * The idea of lazy evaluation of matches is due to Jan-Mark Wams, and\r
+ * I found it in 'freeze' written by Leonid Broukhis.\r
+ * Thanks to many people for bug reports and testing.\r
+ *\r
+ * REFERENCES\r
+ *\r
+ * Deutsch, L.P.,"DEFLATE Compressed Data Format Specification".\r
+ * Available in http://www.ietf.org/rfc/rfc1951.txt\r
+ *\r
+ * A description of the Rabin and Karp algorithm is given in the book\r
+ * "Algorithms" by R. Sedgewick, Addison-Wesley, p252.\r
+ *\r
+ * Fiala,E.R., and Greene,D.H.\r
+ * Data Compression with Finite Windows, Comm.ACM, 32,4 (1989) 490-595\r
+ *\r
+ */\r
+\r
+/* @(#) $Id$ */\r
+\r
+#include "deflate.h"\r
+\r
+const char deflate_copyright[] =\r
+ " deflate 1.2.3 Copyright 1995-2005 Jean-loup Gailly ";\r
+/*\r
+ If you use the zlib library in a product, an acknowledgment is welcome\r
+ in the documentation of your product. If for some reason you cannot\r
+ include such an acknowledgment, I would appreciate that you keep this\r
+ copyright string in the executable of your product.\r
+ */\r
+\r
+/* ===========================================================================\r
+ * Function prototypes.\r
+ */\r
+typedef enum {\r
+ need_more, /* block not completed, need more input or more output */\r
+ block_done, /* block flush performed */\r
+ finish_started, /* finish started, need only more output at next deflate */\r
+ finish_done /* finish done, accept no more input or output */\r
+} block_state;\r
+\r
+typedef block_state (*compress_func) OF((deflate_state *s, int flush));\r
+/* Compression function. Returns the block state after the call. */\r
+\r
+local void fill_window OF((deflate_state *s));\r
+local block_state deflate_stored OF((deflate_state *s, int flush));\r
+local block_state deflate_fast OF((deflate_state *s, int flush));\r
+#ifndef FASTEST\r
+local block_state deflate_slow OF((deflate_state *s, int flush));\r
+#endif\r
+local void lm_init OF((deflate_state *s));\r
+local void putShortMSB OF((deflate_state *s, uInt b));\r
+local void flush_pending OF((z_streamp strm));\r
+local int read_buf OF((z_streamp strm, Bytef *buf, unsigned size));\r
+#ifndef FASTEST\r
+#ifdef ASMV\r
+ void match_init OF((void)); /* asm code initialization */\r
+ uInt longest_match OF((deflate_state *s, IPos cur_match));\r
+#else\r
+local uInt longest_match OF((deflate_state *s, IPos cur_match));\r
+#endif\r
+#endif\r
+local uInt longest_match_fast OF((deflate_state *s, IPos cur_match));\r
+\r
+#ifdef DEBUG\r
+local void check_match OF((deflate_state *s, IPos start, IPos match,\r
+ int length));\r
+#endif\r
+\r
+/* ===========================================================================\r
+ * Local data\r
+ */\r
+\r
+#define NIL 0\r
+/* Tail of hash chains */\r
+\r
+#ifndef TOO_FAR\r
+# define TOO_FAR 4096\r
+#endif\r
+/* Matches of length 3 are discarded if their distance exceeds TOO_FAR */\r
+\r
+#define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)\r
+/* Minimum amount of lookahead, except at the end of the input file.\r
+ * See deflate.c for comments about the MIN_MATCH+1.\r
+ */\r
+\r
+/* Values for max_lazy_match, good_match and max_chain_length, depending on\r
+ * the desired pack level (0..9). The values given below have been tuned to\r
+ * exclude worst case performance for pathological files. Better values may be\r
+ * found for specific files.\r
+ */\r
+typedef struct config_s {\r
+ ush good_length; /* reduce lazy search above this match length */\r
+ ush max_lazy; /* do not perform lazy search above this match length */\r
+ ush nice_length; /* quit search above this match length */\r
+ ush max_chain;\r
+ compress_func func;\r
+} config;\r
+\r
+#ifdef FASTEST\r
+local const config configuration_table[2] = {\r
+/* good lazy nice chain */\r
+/* 0 */ {0, 0, 0, 0, deflate_stored}, /* store only */\r
+/* 1 */ {4, 4, 8, 4, deflate_fast}}; /* max speed, no lazy matches */\r
+#else\r
+local const config configuration_table[10] = {\r
+/* good lazy nice chain */\r
+/* 0 */ {0, 0, 0, 0, deflate_stored}, /* store only */\r
+/* 1 */ {4, 4, 8, 4, deflate_fast}, /* max speed, no lazy matches */\r
+/* 2 */ {4, 5, 16, 8, deflate_fast},\r
+/* 3 */ {4, 6, 32, 32, deflate_fast},\r
+\r
+/* 4 */ {4, 4, 16, 16, deflate_slow}, /* lazy matches */\r
+/* 5 */ {8, 16, 32, 32, deflate_slow},\r
+/* 6 */ {8, 16, 128, 128, deflate_slow},\r
+/* 7 */ {8, 32, 128, 256, deflate_slow},\r
+/* 8 */ {32, 128, 258, 1024, deflate_slow},\r
+/* 9 */ {32, 258, 258, 4096, deflate_slow}}; /* max compression */\r
+#endif\r
+\r
+/* Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4\r
+ * For deflate_fast() (levels <= 3) good is ignored and lazy has a different\r
+ * meaning.\r
+ */\r
+\r
+#define EQUAL 0\r
+/* result of memcmp for equal strings */\r
+\r
+#ifndef NO_DUMMY_DECL\r
+struct static_tree_desc_s {int dummy;}; /* for buggy compilers */\r
+#endif\r
+\r
+/* ===========================================================================\r
+ * Update a hash value with the given input byte\r
+ * IN assertion: all calls to to UPDATE_HASH are made with consecutive\r
+ * input characters, so that a running hash key can be computed from the\r
+ * previous key instead of complete recalculation each time.\r
+ */\r
+#define UPDATE_HASH(s,h,c) (h = (((h)<<s->hash_shift) ^ (c)) & s->hash_mask)\r
+\r
+\r
+/* ===========================================================================\r
+ * Insert string str in the dictionary and set match_head to the previous head\r
+ * of the hash chain (the most recent string with same hash key). Return\r
+ * the previous length of the hash chain.\r
+ * If this file is compiled with -DFASTEST, the compression level is forced\r
+ * to 1, and no hash chains are maintained.\r
+ * IN assertion: all calls to to INSERT_STRING are made with consecutive\r
+ * input characters and the first MIN_MATCH bytes of str are valid\r
+ * (except for the last MIN_MATCH-1 bytes of the input file).\r
+ */\r
+#ifdef FASTEST\r
+#define INSERT_STRING(s, str, match_head) \\r
+ (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \\r
+ match_head = s->head[s->ins_h], \\r
+ s->head[s->ins_h] = (Pos)(str))\r
+#else\r
+#define INSERT_STRING(s, str, match_head) \\r
+ (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \\r
+ match_head = s->prev[(str) & s->w_mask] = s->head[s->ins_h], \\r
+ s->head[s->ins_h] = (Pos)(str))\r
+#endif\r
+\r
+/* ===========================================================================\r
+ * Initialize the hash table (avoiding 64K overflow for 16 bit systems).\r
+ * prev[] will be initialized on the fly.\r
+ */\r
+#define CLEAR_HASH(s) \\r
+ s->head[s->hash_size-1] = NIL; \\r
+ zmemzero((Bytef *)s->head, (unsigned)(s->hash_size-1)*sizeof(*s->head));\r
+\r
+/* ========================================================================= */\r
+int ZEXPORT deflateInit_(strm, level, version, stream_size)\r
+ z_streamp strm;\r
+ int level;\r
+ const char *version;\r
+ int stream_size;\r
+{\r
+ return deflateInit2_(strm, level, Z_DEFLATED, MAX_WBITS, DEF_MEM_LEVEL,\r
+ Z_DEFAULT_STRATEGY, version, stream_size);\r
+ /* To do: ignore strm->next_in if we use it as window */\r
+}\r
+\r
+/* ========================================================================= */\r
+int ZEXPORT deflateInit2_(strm, level, method, windowBits, memLevel, strategy,\r
+ version, stream_size)\r
+ z_streamp strm;\r
+ int level;\r
+ int method;\r
+ int windowBits;\r
+ int memLevel;\r
+ int strategy;\r
+ const char *version;\r
+ int stream_size;\r
+{\r
+ deflate_state *s;\r
+ int wrap = 1;\r
+ static const char my_version[] = ZLIB_VERSION;\r
+\r
+ ushf *overlay;\r
+ /* We overlay pending_buf and d_buf+l_buf. This works since the average\r
+ * output size for (length,distance) codes is <= 24 bits.\r
+ */\r
+\r
+ if (version == Z_NULL || version[0] != my_version[0] ||\r
+ stream_size != sizeof(z_stream)) {\r
+ return Z_VERSION_ERROR;\r
+ }\r
+ if (strm == Z_NULL) return Z_STREAM_ERROR;\r
+\r
+ strm->msg = Z_NULL;\r
+ if (strm->zalloc == (alloc_func)0) {\r
+ strm->zalloc = zcalloc;\r
+ strm->opaque = (voidpf)0;\r
+ }\r
+ if (strm->zfree == (free_func)0) strm->zfree = zcfree;\r
+\r
+#ifdef FASTEST\r
+ if (level != 0) level = 1;\r
+#else\r
+ if (level == Z_DEFAULT_COMPRESSION) level = 6;\r
+#endif\r
+\r
+ if (windowBits < 0) { /* suppress zlib wrapper */\r
+ wrap = 0;\r
+ windowBits = -windowBits;\r
+ }\r
+#ifdef GZIP\r
+ else if (windowBits > 15) {\r
+ wrap = 2; /* write gzip wrapper instead */\r
+ windowBits -= 16;\r
+ }\r
+#endif\r
+ if (memLevel < 1 || memLevel > MAX_MEM_LEVEL || method != Z_DEFLATED ||\r
+ windowBits < 8 || windowBits > 15 || level < 0 || level > 9 ||\r
+ strategy < 0 || strategy > Z_FIXED) {\r
+ return Z_STREAM_ERROR;\r
+ }\r
+ if (windowBits == 8) windowBits = 9; /* until 256-byte window bug fixed */\r
+ s = (deflate_state *) ZALLOC(strm, 1, sizeof(deflate_state));\r
+ if (s == Z_NULL) return Z_MEM_ERROR;\r
+ strm->state = (struct internal_state FAR *)s;\r
+ s->strm = strm;\r
+\r
+ s->wrap = wrap;\r
+ s->gzhead = Z_NULL;\r
+ s->w_bits = windowBits;\r
+ s->w_size = 1 << s->w_bits;\r
+ s->w_mask = s->w_size - 1;\r
+\r
+ s->hash_bits = memLevel + 7;\r
+ s->hash_size = 1 << s->hash_bits;\r
+ s->hash_mask = s->hash_size - 1;\r
+ s->hash_shift = ((s->hash_bits+MIN_MATCH-1)/MIN_MATCH);\r
+\r
+ s->window = (Bytef *) ZALLOC(strm, s->w_size, 2*sizeof(Byte));\r
+ s->prev = (Posf *) ZALLOC(strm, s->w_size, sizeof(Pos));\r
+ s->head = (Posf *) ZALLOC(strm, s->hash_size, sizeof(Pos));\r
+\r
+ s->lit_bufsize = 1 << (memLevel + 6); /* 16K elements by default */\r
+\r
+ overlay = (ushf *) ZALLOC(strm, s->lit_bufsize, sizeof(ush)+2);\r
+ s->pending_buf = (uchf *) overlay;\r
+ s->pending_buf_size = (ulg)s->lit_bufsize * (sizeof(ush)+2L);\r
+\r
+ if (s->window == Z_NULL || s->prev == Z_NULL || s->head == Z_NULL ||\r
+ s->pending_buf == Z_NULL) {\r
+ s->status = FINISH_STATE;\r
+ strm->msg = (char*)ERR_MSG(Z_MEM_ERROR);\r
+ deflateEnd (strm);\r
+ return Z_MEM_ERROR;\r
+ }\r
+ s->d_buf = overlay + s->lit_bufsize/sizeof(ush);\r
+ s->l_buf = s->pending_buf + (1+sizeof(ush))*s->lit_bufsize;\r
+\r
+ s->level = level;\r
+ s->strategy = strategy;\r
+ s->method = (Byte)method;\r
+\r
+ return deflateReset(strm);\r
+}\r
+\r
+/* ========================================================================= */\r
+int ZEXPORT deflateSetDictionary (strm, dictionary, dictLength)\r
+ z_streamp strm;\r
+ const Bytef *dictionary;\r
+ uInt dictLength;\r
+{\r
+ deflate_state *s;\r
+ uInt length = dictLength;\r
+ uInt n;\r
+ IPos hash_head = 0;\r
+\r
+ if (strm == Z_NULL || strm->state == Z_NULL || dictionary == Z_NULL ||\r
+ strm->state->wrap == 2 ||\r
+ (strm->state->wrap == 1 && strm->state->status != INIT_STATE))\r
+ return Z_STREAM_ERROR;\r
+\r
+ s = strm->state;\r
+ if (s->wrap)\r
+ strm->adler = adler32(strm->adler, dictionary, dictLength);\r
+\r
+ if (length < MIN_MATCH) return Z_OK;\r
+ if (length > MAX_DIST(s)) {\r
+ length = MAX_DIST(s);\r
+ dictionary += dictLength - length; /* use the tail of the dictionary */\r
+ }\r
+ zmemcpy(s->window, dictionary, length);\r
+ s->strstart = length;\r
+ s->block_start = (long)length;\r
+\r
+ /* Insert all strings in the hash table (except for the last two bytes).\r
+ * s->lookahead stays null, so s->ins_h will be recomputed at the next\r
+ * call of fill_window.\r
+ */\r
+ s->ins_h = s->window[0];\r
+ UPDATE_HASH(s, s->ins_h, s->window[1]);\r
+ for (n = 0; n <= length - MIN_MATCH; n++) {\r
+ INSERT_STRING(s, n, hash_head);\r
+ }\r
+ if (hash_head) hash_head = 0; /* to make compiler happy */\r
+ return Z_OK;\r
+}\r
+\r
+/* ========================================================================= */\r
+int ZEXPORT deflateReset (strm)\r
+ z_streamp strm;\r
+{\r
+ deflate_state *s;\r
+\r
+ if (strm == Z_NULL || strm->state == Z_NULL ||\r
+ strm->zalloc == (alloc_func)0 || strm->zfree == (free_func)0) {\r
+ return Z_STREAM_ERROR;\r
+ }\r
+\r
+ strm->total_in = strm->total_out = 0;\r
+ strm->msg = Z_NULL; /* use zfree if we ever allocate msg dynamically */\r
+ strm->data_type = Z_UNKNOWN;\r
+\r
+ s = (deflate_state *)strm->state;\r
+ s->pending = 0;\r
+ s->pending_out = s->pending_buf;\r
+\r
+ if (s->wrap < 0) {\r
+ s->wrap = -s->wrap; /* was made negative by deflate(..., Z_FINISH); */\r
+ }\r
+ s->status = s->wrap ? INIT_STATE : BUSY_STATE;\r
+ strm->adler =\r
+#ifdef GZIP\r
+ s->wrap == 2 ? crc32(0L, Z_NULL, 0) :\r
+#endif\r
+ adler32(0L, Z_NULL, 0);\r
+ s->last_flush = Z_NO_FLUSH;\r
+\r
+ _tr_init(s);\r
+ lm_init(s);\r
+\r
+ return Z_OK;\r
+}\r
+\r
+/* ========================================================================= */\r
+int ZEXPORT deflateSetHeader (strm, head)\r
+ z_streamp strm;\r
+ gz_headerp head;\r
+{\r
+ if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;\r
+ if (strm->state->wrap != 2) return Z_STREAM_ERROR;\r
+ strm->state->gzhead = head;\r
+ return Z_OK;\r
+}\r
+\r
+/* ========================================================================= */\r
+int ZEXPORT deflatePrime (strm, bits, value)\r
+ z_streamp strm;\r
+ int bits;\r
+ int value;\r
+{\r
+ if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;\r
+ strm->state->bi_valid = bits;\r
+ strm->state->bi_buf = (ush)(value & ((1 << bits) - 1));\r
+ return Z_OK;\r
+}\r
+\r
+/* ========================================================================= */\r
+int ZEXPORT deflateParams(strm, level, strategy)\r
+ z_streamp strm;\r
+ int level;\r
+ int strategy;\r
+{\r
+ deflate_state *s;\r
+ compress_func func;\r
+ int err = Z_OK;\r
+\r
+ if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;\r
+ s = strm->state;\r
+\r
+#ifdef FASTEST\r
+ if (level != 0) level = 1;\r
+#else\r
+ if (level == Z_DEFAULT_COMPRESSION) level = 6;\r
+#endif\r
+ if (level < 0 || level > 9 || strategy < 0 || strategy > Z_FIXED) {\r
+ return Z_STREAM_ERROR;\r
+ }\r
+ func = configuration_table[s->level].func;\r
+\r
+ if (func != configuration_table[level].func && strm->total_in != 0) {\r
+ /* Flush the last buffer: */\r
+ err = deflate(strm, Z_PARTIAL_FLUSH);\r
+ }\r
+ if (s->level != level) {\r
+ s->level = level;\r
+ s->max_lazy_match = configuration_table[level].max_lazy;\r
+ s->good_match = configuration_table[level].good_length;\r
+ s->nice_match = configuration_table[level].nice_length;\r
+ s->max_chain_length = configuration_table[level].max_chain;\r
+ }\r
+ s->strategy = strategy;\r
+ return err;\r
+}\r
+\r
+/* ========================================================================= */\r
+int ZEXPORT deflateTune(strm, good_length, max_lazy, nice_length, max_chain)\r
+ z_streamp strm;\r
+ int good_length;\r
+ int max_lazy;\r
+ int nice_length;\r
+ int max_chain;\r
+{\r
+ deflate_state *s;\r
+\r
+ if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;\r
+ s = strm->state;\r
+ s->good_match = good_length;\r
+ s->max_lazy_match = max_lazy;\r
+ s->nice_match = nice_length;\r
+ s->max_chain_length = max_chain;\r
+ return Z_OK;\r
+}\r
+\r
+/* =========================================================================\r
+ * For the default windowBits of 15 and memLevel of 8, this function returns\r
+ * a close to exact, as well as small, upper bound on the compressed size.\r
+ * They are coded as constants here for a reason--if the #define's are\r
+ * changed, then this function needs to be changed as well. The return\r
+ * value for 15 and 8 only works for those exact settings.\r
+ *\r
+ * For any setting other than those defaults for windowBits and memLevel,\r
+ * the value returned is a conservative worst case for the maximum expansion\r
+ * resulting from using fixed blocks instead of stored blocks, which deflate\r
+ * can emit on compressed data for some combinations of the parameters.\r
+ *\r
+ * This function could be more sophisticated to provide closer upper bounds\r
+ * for every combination of windowBits and memLevel, as well as wrap.\r
+ * But even the conservative upper bound of about 14% expansion does not\r
+ * seem onerous for output buffer allocation.\r
+ */\r
+uLong ZEXPORT deflateBound(strm, sourceLen)\r
+ z_streamp strm;\r
+ uLong sourceLen;\r
+{\r
+ deflate_state *s;\r
+ uLong destLen;\r
+\r
+ /* conservative upper bound */\r
+ destLen = sourceLen +\r
+ ((sourceLen + 7) >> 3) + ((sourceLen + 63) >> 6) + 11;\r
+\r
+ /* if can't get parameters, return conservative bound */\r
+ if (strm == Z_NULL || strm->state == Z_NULL)\r
+ return destLen;\r
+\r
+ /* if not default parameters, return conservative bound */\r
+ s = strm->state;\r
+ if (s->w_bits != 15 || s->hash_bits != 8 + 7)\r
+ return destLen;\r
+\r
+ /* default settings: return tight bound for that case */\r
+ return compressBound(sourceLen);\r
+}\r
+\r
+/* =========================================================================\r
+ * Put a short in the pending buffer. The 16-bit value is put in MSB order.\r
+ * IN assertion: the stream state is correct and there is enough room in\r
+ * pending_buf.\r
+ */\r
+local void putShortMSB (s, b)\r
+ deflate_state *s;\r
+ uInt b;\r
+{\r
+ put_byte(s, (Byte)(b >> 8));\r
+ put_byte(s, (Byte)(b & 0xff));\r
+}\r
+\r
+/* =========================================================================\r
+ * Flush as much pending output as possible. All deflate() output goes\r
+ * through this function so some applications may wish to modify it\r
+ * to avoid allocating a large strm->next_out buffer and copying into it.\r
+ * (See also read_buf()).\r
+ */\r
+local void flush_pending(strm)\r
+ z_streamp strm;\r
+{\r
+ unsigned len = strm->state->pending;\r
+\r
+ if (len > strm->avail_out) len = strm->avail_out;\r
+ if (len == 0) return;\r
+\r
+ zmemcpy(strm->next_out, strm->state->pending_out, len);\r
+ strm->next_out += len;\r
+ strm->state->pending_out += len;\r
+ strm->total_out += len;\r
+ strm->avail_out -= len;\r
+ strm->state->pending -= len;\r
+ if (strm->state->pending == 0) {\r
+ strm->state->pending_out = strm->state->pending_buf;\r
+ }\r
+}\r
+\r
+/* ========================================================================= */\r
+int ZEXPORT deflate (strm, flush)\r
+ z_streamp strm;\r
+ int flush;\r
+{\r
+ int old_flush; /* value of flush param for previous deflate call */\r
+ deflate_state *s;\r
+\r
+ if (strm == Z_NULL || strm->state == Z_NULL ||\r
+ flush > Z_FINISH || flush < 0) {\r
+ return Z_STREAM_ERROR;\r
+ }\r
+ s = strm->state;\r
+\r
+ if (strm->next_out == Z_NULL ||\r
+ (strm->next_in == Z_NULL && strm->avail_in != 0) ||\r
+ (s->status == FINISH_STATE && flush != Z_FINISH)) {\r
+ ERR_RETURN(strm, Z_STREAM_ERROR);\r
+ }\r
+ if (strm->avail_out == 0) ERR_RETURN(strm, Z_BUF_ERROR);\r
+\r
+ s->strm = strm; /* just in case */\r
+ old_flush = s->last_flush;\r
+ s->last_flush = flush;\r
+\r
+ /* Write the header */\r
+ if (s->status == INIT_STATE) {\r
+#ifdef GZIP\r
+ if (s->wrap == 2) {\r
+ strm->adler = crc32(0L, Z_NULL, 0);\r
+ put_byte(s, 31);\r
+ put_byte(s, 139);\r
+ put_byte(s, 8);\r
+ if (s->gzhead == NULL) {\r
+ put_byte(s, 0);\r
+ put_byte(s, 0);\r
+ put_byte(s, 0);\r
+ put_byte(s, 0);\r
+ put_byte(s, 0);\r
+ put_byte(s, s->level == 9 ? 2 :\r
+ (s->strategy >= Z_HUFFMAN_ONLY || s->level < 2 ?\r
+ 4 : 0));\r
+ put_byte(s, OS_CODE);\r
+ s->status = BUSY_STATE;\r
+ }\r
+ else {\r
+ put_byte(s, (s->gzhead->text ? 1 : 0) +\r
+ (s->gzhead->hcrc ? 2 : 0) +\r
+ (s->gzhead->extra == Z_NULL ? 0 : 4) +\r
+ (s->gzhead->name == Z_NULL ? 0 : 8) +\r
+ (s->gzhead->comment == Z_NULL ? 0 : 16)\r
+ );\r
+ put_byte(s, (Byte)(s->gzhead->time & 0xff));\r
+ put_byte(s, (Byte)((s->gzhead->time >> 8) & 0xff));\r
+ put_byte(s, (Byte)((s->gzhead->time >> 16) & 0xff));\r
+ put_byte(s, (Byte)((s->gzhead->time >> 24) & 0xff));\r
+ put_byte(s, s->level == 9 ? 2 :\r
+ (s->strategy >= Z_HUFFMAN_ONLY || s->level < 2 ?\r
+ 4 : 0));\r
+ put_byte(s, s->gzhead->os & 0xff);\r
+ if (s->gzhead->extra != NULL) {\r
+ put_byte(s, s->gzhead->extra_len & 0xff);\r
+ put_byte(s, (s->gzhead->extra_len >> 8) & 0xff);\r
+ }\r
+ if (s->gzhead->hcrc)\r
+ strm->adler = crc32(strm->adler, s->pending_buf,\r
+ s->pending);\r
+ s->gzindex = 0;\r
+ s->status = EXTRA_STATE;\r
+ }\r
+ }\r
+ else\r
+#endif\r
+ {\r
+ uInt header = (Z_DEFLATED + ((s->w_bits-8)<<4)) << 8;\r
+ uInt level_flags;\r
+\r
+ if (s->strategy >= Z_HUFFMAN_ONLY || s->level < 2)\r
+ level_flags = 0;\r
+ else if (s->level < 6)\r
+ level_flags = 1;\r
+ else if (s->level == 6)\r
+ level_flags = 2;\r
+ else\r
+ level_flags = 3;\r
+ header |= (level_flags << 6);\r
+ if (s->strstart != 0) header |= PRESET_DICT;\r
+ header += 31 - (header % 31);\r
+\r
+ s->status = BUSY_STATE;\r
+ putShortMSB(s, header);\r
+\r
+ /* Save the adler32 of the preset dictionary: */\r
+ if (s->strstart != 0) {\r
+ putShortMSB(s, (uInt)(strm->adler >> 16));\r
+ putShortMSB(s, (uInt)(strm->adler & 0xffff));\r
+ }\r
+ strm->adler = adler32(0L, Z_NULL, 0);\r
+ }\r
+ }\r
+#ifdef GZIP\r
+ if (s->status == EXTRA_STATE) {\r
+ if (s->gzhead->extra != NULL) {\r
+ uInt beg = s->pending; /* start of bytes to update crc */\r
+\r
+ while (s->gzindex < (s->gzhead->extra_len & 0xffff)) {\r
+ if (s->pending == s->pending_buf_size) {\r
+ if (s->gzhead->hcrc && s->pending > beg)\r
+ strm->adler = crc32(strm->adler, s->pending_buf + beg,\r
+ s->pending - beg);\r
+ flush_pending(strm);\r
+ beg = s->pending;\r
+ if (s->pending == s->pending_buf_size)\r
+ break;\r
+ }\r
+ put_byte(s, s->gzhead->extra[s->gzindex]);\r
+ s->gzindex++;\r
+ }\r
+ if (s->gzhead->hcrc && s->pending > beg)\r
+ strm->adler = crc32(strm->adler, s->pending_buf + beg,\r
+ s->pending - beg);\r
+ if (s->gzindex == s->gzhead->extra_len) {\r
+ s->gzindex = 0;\r
+ s->status = NAME_STATE;\r
+ }\r
+ }\r
+ else\r
+ s->status = NAME_STATE;\r
+ }\r
+ if (s->status == NAME_STATE) {\r
+ if (s->gzhead->name != NULL) {\r
+ uInt beg = s->pending; /* start of bytes to update crc */\r
+ int val;\r
+\r
+ do {\r
+ if (s->pending == s->pending_buf_size) {\r
+ if (s->gzhead->hcrc && s->pending > beg)\r
+ strm->adler = crc32(strm->adler, s->pending_buf + beg,\r
+ s->pending - beg);\r
+ flush_pending(strm);\r
+ beg = s->pending;\r
+ if (s->pending == s->pending_buf_size) {\r
+ val = 1;\r
+ break;\r
+ }\r
+ }\r
+ val = s->gzhead->name[s->gzindex++];\r
+ put_byte(s, val);\r
+ } while (val != 0);\r
+ if (s->gzhead->hcrc && s->pending > beg)\r
+ strm->adler = crc32(strm->adler, s->pending_buf + beg,\r
+ s->pending - beg);\r
+ if (val == 0) {\r
+ s->gzindex = 0;\r
+ s->status = COMMENT_STATE;\r
+ }\r
+ }\r
+ else\r
+ s->status = COMMENT_STATE;\r
+ }\r
+ if (s->status == COMMENT_STATE) {\r
+ if (s->gzhead->comment != NULL) {\r
+ uInt beg = s->pending; /* start of bytes to update crc */\r
+ int val;\r
+\r
+ do {\r
+ if (s->pending == s->pending_buf_size) {\r
+ if (s->gzhead->hcrc && s->pending > beg)\r
+ strm->adler = crc32(strm->adler, s->pending_buf + beg,\r
+ s->pending - beg);\r
+ flush_pending(strm);\r
+ beg = s->pending;\r
+ if (s->pending == s->pending_buf_size) {\r
+ val = 1;\r
+ break;\r
+ }\r
+ }\r
+ val = s->gzhead->comment[s->gzindex++];\r
+ put_byte(s, val);\r
+ } while (val != 0);\r
+ if (s->gzhead->hcrc && s->pending > beg)\r
+ strm->adler = crc32(strm->adler, s->pending_buf + beg,\r
+ s->pending - beg);\r
+ if (val == 0)\r
+ s->status = HCRC_STATE;\r
+ }\r
+ else\r
+ s->status = HCRC_STATE;\r
+ }\r
+ if (s->status == HCRC_STATE) {\r
+ if (s->gzhead->hcrc) {\r
+ if (s->pending + 2 > s->pending_buf_size)\r
+ flush_pending(strm);\r
+ if (s->pending + 2 <= s->pending_buf_size) {\r
+ put_byte(s, (Byte)(strm->adler & 0xff));\r
+ put_byte(s, (Byte)((strm->adler >> 8) & 0xff));\r
+ strm->adler = crc32(0L, Z_NULL, 0);\r
+ s->status = BUSY_STATE;\r
+ }\r
+ }\r
+ else\r
+ s->status = BUSY_STATE;\r
+ }\r
+#endif\r
+\r
+ /* Flush as much pending output as possible */\r
+ if (s->pending != 0) {\r
+ flush_pending(strm);\r
+ if (strm->avail_out == 0) {\r
+ /* Since avail_out is 0, deflate will be called again with\r
+ * more output space, but possibly with both pending and\r
+ * avail_in equal to zero. There won't be anything to do,\r
+ * but this is not an error situation so make sure we\r
+ * return OK instead of BUF_ERROR at next call of deflate:\r
+ */\r
+ s->last_flush = -1;\r
+ return Z_OK;\r
+ }\r
+\r
+ /* Make sure there is something to do and avoid duplicate consecutive\r
+ * flushes. For repeated and useless calls with Z_FINISH, we keep\r
+ * returning Z_STREAM_END instead of Z_BUF_ERROR.\r
+ */\r
+ } else if (strm->avail_in == 0 && flush <= old_flush &&\r
+ flush != Z_FINISH) {\r
+ ERR_RETURN(strm, Z_BUF_ERROR);\r
+ }\r
+\r
+ /* User must not provide more input after the first FINISH: */\r
+ if (s->status == FINISH_STATE && strm->avail_in != 0) {\r
+ ERR_RETURN(strm, Z_BUF_ERROR);\r
+ }\r
+\r
+ /* Start a new block or continue the current one.\r
+ */\r
+ if (strm->avail_in != 0 || s->lookahead != 0 ||\r
+ (flush != Z_NO_FLUSH && s->status != FINISH_STATE)) {\r
+ block_state bstate;\r
+\r
+ bstate = (*(configuration_table[s->level].func))(s, flush);\r
+\r
+ if (bstate == finish_started || bstate == finish_done) {\r
+ s->status = FINISH_STATE;\r
+ }\r
+ if (bstate == need_more || bstate == finish_started) {\r
+ if (strm->avail_out == 0) {\r
+ s->last_flush = -1; /* avoid BUF_ERROR next call, see above */\r
+ }\r
+ return Z_OK;\r
+ /* If flush != Z_NO_FLUSH && avail_out == 0, the next call\r
+ * of deflate should use the same flush parameter to make sure\r
+ * that the flush is complete. So we don't have to output an\r
+ * empty block here, this will be done at next call. This also\r
+ * ensures that for a very small output buffer, we emit at most\r
+ * one empty block.\r
+ */\r
+ }\r
+ if (bstate == block_done) {\r
+ if (flush == Z_PARTIAL_FLUSH) {\r
+ _tr_align(s);\r
+ } else { /* FULL_FLUSH or SYNC_FLUSH */\r
+ _tr_stored_block(s, (char*)0, 0L, 0);\r
+ /* For a full flush, this empty block will be recognized\r
+ * as a special marker by inflate_sync().\r
+ */\r
+ if (flush == Z_FULL_FLUSH) {\r
+ CLEAR_HASH(s); /* forget history */\r
+ }\r
+ }\r
+ flush_pending(strm);\r
+ if (strm->avail_out == 0) {\r
+ s->last_flush = -1; /* avoid BUF_ERROR at next call, see above */\r
+ return Z_OK;\r
+ }\r
+ }\r
+ }\r
+ Assert(strm->avail_out > 0, "bug2");\r
+\r
+ if (flush != Z_FINISH) return Z_OK;\r
+ if (s->wrap <= 0) return Z_STREAM_END;\r
+\r
+ /* Write the trailer */\r
+#ifdef GZIP\r
+ if (s->wrap == 2) {\r
+ put_byte(s, (Byte)(strm->adler & 0xff));\r
+ put_byte(s, (Byte)((strm->adler >> 8) & 0xff));\r
+ put_byte(s, (Byte)((strm->adler >> 16) & 0xff));\r
+ put_byte(s, (Byte)((strm->adler >> 24) & 0xff));\r
+ put_byte(s, (Byte)(strm->total_in & 0xff));\r
+ put_byte(s, (Byte)((strm->total_in >> 8) & 0xff));\r
+ put_byte(s, (Byte)((strm->total_in >> 16) & 0xff));\r
+ put_byte(s, (Byte)((strm->total_in >> 24) & 0xff));\r
+ }\r
+ else\r
+#endif\r
+ {\r
+ putShortMSB(s, (uInt)(strm->adler >> 16));\r
+ putShortMSB(s, (uInt)(strm->adler & 0xffff));\r
+ }\r
+ flush_pending(strm);\r
+ /* If avail_out is zero, the application will call deflate again\r
+ * to flush the rest.\r
+ */\r
+ if (s->wrap > 0) s->wrap = -s->wrap; /* write the trailer only once! */\r
+ return s->pending != 0 ? Z_OK : Z_STREAM_END;\r
+}\r
+\r
+/* ========================================================================= */\r
+int ZEXPORT deflateEnd (strm)\r
+ z_streamp strm;\r
+{\r
+ int status;\r
+\r
+ if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;\r
+\r
+ status = strm->state->status;\r
+ if (status != INIT_STATE &&\r
+ status != EXTRA_STATE &&\r
+ status != NAME_STATE &&\r
+ status != COMMENT_STATE &&\r
+ status != HCRC_STATE &&\r
+ status != BUSY_STATE &&\r
+ status != FINISH_STATE) {\r
+ return Z_STREAM_ERROR;\r
+ }\r
+\r
+ /* Deallocate in reverse order of allocations: */\r
+ TRY_FREE(strm, strm->state->pending_buf);\r
+ TRY_FREE(strm, strm->state->head);\r
+ TRY_FREE(strm, strm->state->prev);\r
+ TRY_FREE(strm, strm->state->window);\r
+\r
+ ZFREE(strm, strm->state);\r
+ strm->state = Z_NULL;\r
+\r
+ return status == BUSY_STATE ? Z_DATA_ERROR : Z_OK;\r
+}\r
+\r
+/* =========================================================================\r
+ * Copy the source state to the destination state.\r
+ * To simplify the source, this is not supported for 16-bit MSDOS (which\r
+ * doesn't have enough memory anyway to duplicate compression states).\r
+ */\r
+int ZEXPORT deflateCopy (dest, source)\r
+ z_streamp dest;\r
+ z_streamp source;\r
+{\r
+#ifdef MAXSEG_64K\r
+ return Z_STREAM_ERROR;\r
+#else\r
+ deflate_state *ds;\r
+ deflate_state *ss;\r
+ ushf *overlay;\r
+\r
+\r
+ if (source == Z_NULL || dest == Z_NULL || source->state == Z_NULL) {\r
+ return Z_STREAM_ERROR;\r
+ }\r
+\r
+ ss = source->state;\r
+\r
+ zmemcpy(dest, source, sizeof(z_stream));\r
+\r
+ ds = (deflate_state *) ZALLOC(dest, 1, sizeof(deflate_state));\r
+ if (ds == Z_NULL) return Z_MEM_ERROR;\r
+ dest->state = (struct internal_state FAR *) ds;\r
+ zmemcpy(ds, ss, sizeof(deflate_state));\r
+ ds->strm = dest;\r
+\r
+ ds->window = (Bytef *) ZALLOC(dest, ds->w_size, 2*sizeof(Byte));\r
+ ds->prev = (Posf *) ZALLOC(dest, ds->w_size, sizeof(Pos));\r
+ ds->head = (Posf *) ZALLOC(dest, ds->hash_size, sizeof(Pos));\r
+ overlay = (ushf *) ZALLOC(dest, ds->lit_bufsize, sizeof(ush)+2);\r
+ ds->pending_buf = (uchf *) overlay;\r
+\r
+ if (ds->window == Z_NULL || ds->prev == Z_NULL || ds->head == Z_NULL ||\r
+ ds->pending_buf == Z_NULL) {\r
+ deflateEnd (dest);\r
+ return Z_MEM_ERROR;\r
+ }\r
+ /* following zmemcpy do not work for 16-bit MSDOS */\r
+ zmemcpy(ds->window, ss->window, ds->w_size * 2 * sizeof(Byte));\r
+ zmemcpy(ds->prev, ss->prev, ds->w_size * sizeof(Pos));\r
+ zmemcpy(ds->head, ss->head, ds->hash_size * sizeof(Pos));\r
+ zmemcpy(ds->pending_buf, ss->pending_buf, (uInt)ds->pending_buf_size);\r
+\r
+ ds->pending_out = ds->pending_buf + (ss->pending_out - ss->pending_buf);\r
+ ds->d_buf = overlay + ds->lit_bufsize/sizeof(ush);\r
+ ds->l_buf = ds->pending_buf + (1+sizeof(ush))*ds->lit_bufsize;\r
+\r
+ ds->l_desc.dyn_tree = ds->dyn_ltree;\r
+ ds->d_desc.dyn_tree = ds->dyn_dtree;\r
+ ds->bl_desc.dyn_tree = ds->bl_tree;\r
+\r
+ return Z_OK;\r
+#endif /* MAXSEG_64K */\r
+}\r
+\r
+/* ===========================================================================\r
+ * Read a new buffer from the current input stream, update the adler32\r
+ * and total number of bytes read. All deflate() input goes through\r
+ * this function so some applications may wish to modify it to avoid\r
+ * allocating a large strm->next_in buffer and copying from it.\r
+ * (See also flush_pending()).\r
+ */\r
+local int read_buf(strm, buf, size)\r
+ z_streamp strm;\r
+ Bytef *buf;\r
+ unsigned size;\r
+{\r
+ unsigned len = strm->avail_in;\r
+\r
+ if (len > size) len = size;\r
+ if (len == 0) return 0;\r
+\r
+ strm->avail_in -= len;\r
+\r
+ if (strm->state->wrap == 1) {\r
+ strm->adler = adler32(strm->adler, strm->next_in, len);\r
+ }\r
+#ifdef GZIP\r
+ else if (strm->state->wrap == 2) {\r
+ strm->adler = crc32(strm->adler, strm->next_in, len);\r
+ }\r
+#endif\r
+ zmemcpy(buf, strm->next_in, len);\r
+ strm->next_in += len;\r
+ strm->total_in += len;\r
+\r
+ return (int)len;\r
+}\r
+\r
+/* ===========================================================================\r
+ * Initialize the "longest match" routines for a new zlib stream\r
+ */\r
+local void lm_init (s)\r
+ deflate_state *s;\r
+{\r
+ s->window_size = (ulg)2L*s->w_size;\r
+\r
+ CLEAR_HASH(s);\r
+\r
+ /* Set the default configuration parameters:\r
+ */\r
+ s->max_lazy_match = configuration_table[s->level].max_lazy;\r
+ s->good_match = configuration_table[s->level].good_length;\r
+ s->nice_match = configuration_table[s->level].nice_length;\r
+ s->max_chain_length = configuration_table[s->level].max_chain;\r
+\r
+ s->strstart = 0;\r
+ s->block_start = 0L;\r
+ s->lookahead = 0;\r
+ s->match_length = s->prev_length = MIN_MATCH-1;\r
+ s->match_available = 0;\r
+ s->ins_h = 0;\r
+#ifndef FASTEST\r
+#ifdef ASMV\r
+ match_init(); /* initialize the asm code */\r
+#endif\r
+#endif\r
+}\r
+\r
+#ifndef FASTEST\r
+/* ===========================================================================\r
+ * Set match_start to the longest match starting at the given string and\r
+ * return its length. Matches shorter or equal to prev_length are discarded,\r
+ * in which case the result is equal to prev_length and match_start is\r
+ * garbage.\r
+ * IN assertions: cur_match is the head of the hash chain for the current\r
+ * string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1\r
+ * OUT assertion: the match length is not greater than s->lookahead.\r
+ */\r
+#ifndef ASMV\r
+/* For 80x86 and 680x0, an optimized version will be provided in match.asm or\r
+ * match.S. The code will be functionally equivalent.\r
+ */\r
+local uInt longest_match(s, cur_match)\r
+ deflate_state *s;\r
+ IPos cur_match; /* current match */\r
+{\r
+ unsigned chain_length = s->max_chain_length;/* max hash chain length */\r
+ register Bytef *scan = s->window + s->strstart; /* current string */\r
+ register Bytef *match; /* matched string */\r
+ register int len; /* length of current match */\r
+ int best_len = s->prev_length; /* best match length so far */\r
+ int nice_match = s->nice_match; /* stop if match long enough */\r
+ IPos limit = s->strstart > (IPos)MAX_DIST(s) ?\r
+ s->strstart - (IPos)MAX_DIST(s) : NIL;\r
+ /* Stop when cur_match becomes <= limit. To simplify the code,\r
+ * we prevent matches with the string of window index 0.\r
+ */\r
+ Posf *prev = s->prev;\r
+ uInt wmask = s->w_mask;\r
+\r
+#ifdef UNALIGNED_OK\r
+ /* Compare two bytes at a time. Note: this is not always beneficial.\r
+ * Try with and without -DUNALIGNED_OK to check.\r
+ */\r
+ register Bytef *strend = s->window + s->strstart + MAX_MATCH - 1;\r
+ register ush scan_start = *(ushf*)scan;\r
+ register ush scan_end = *(ushf*)(scan+best_len-1);\r
+#else\r
+ register Bytef *strend = s->window + s->strstart + MAX_MATCH;\r
+ register Byte scan_end1 = scan[best_len-1];\r
+ register Byte scan_end = scan[best_len];\r
+#endif\r
+\r
+ /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.\r
+ * It is easy to get rid of this optimization if necessary.\r
+ */\r
+ Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");\r
+\r
+ /* Do not waste too much time if we already have a good match: */\r
+ if (s->prev_length >= s->good_match) {\r
+ chain_length >>= 2;\r
+ }\r
+ /* Do not look for matches beyond the end of the input. This is necessary\r
+ * to make deflate deterministic.\r
+ */\r
+ if ((uInt)nice_match > s->lookahead) nice_match = s->lookahead;\r
+\r
+ Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");\r
+\r
+ do {\r
+ Assert(cur_match < s->strstart, "no future");\r
+ match = s->window + cur_match;\r
+\r
+ /* Skip to next match if the match length cannot increase\r
+ * or if the match length is less than 2. Note that the checks below\r
+ * for insufficient lookahead only occur occasionally for performance\r
+ * reasons. Therefore uninitialized memory will be accessed, and\r
+ * conditional jumps will be made that depend on those values.\r
+ * However the length of the match is limited to the lookahead, so\r
+ * the output of deflate is not affected by the uninitialized values.\r
+ */\r
+#if (defined(UNALIGNED_OK) && MAX_MATCH == 258)\r
+ /* This code assumes sizeof(unsigned short) == 2. Do not use\r
+ * UNALIGNED_OK if your compiler uses a different size.\r
+ */\r
+ if (*(ushf*)(match+best_len-1) != scan_end ||\r
+ *(ushf*)match != scan_start) continue;\r
+\r
+ /* It is not necessary to compare scan[2] and match[2] since they are\r
+ * always equal when the other bytes match, given that the hash keys\r
+ * are equal and that HASH_BITS >= 8. Compare 2 bytes at a time at\r
+ * strstart+3, +5, ... up to strstart+257. We check for insufficient\r
+ * lookahead only every 4th comparison; the 128th check will be made\r
+ * at strstart+257. If MAX_MATCH-2 is not a multiple of 8, it is\r
+ * necessary to put more guard bytes at the end of the window, or\r
+ * to check more often for insufficient lookahead.\r
+ */\r
+ Assert(scan[2] == match[2], "scan[2]?");\r
+ scan++, match++;\r
+ do {\r
+ } while (*(ushf*)(scan+=2) == *(ushf*)(match+=2) &&\r
+ *(ushf*)(scan+=2) == *(ushf*)(match+=2) &&\r
+ *(ushf*)(scan+=2) == *(ushf*)(match+=2) &&\r
+ *(ushf*)(scan+=2) == *(ushf*)(match+=2) &&\r
+ scan < strend);\r
+ /* The funny "do {}" generates better code on most compilers */\r
+\r
+ /* Here, scan <= window+strstart+257 */\r
+ Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan");\r
+ if (*scan == *match) scan++;\r
+\r
+ len = (MAX_MATCH - 1) - (int)(strend-scan);\r
+ scan = strend - (MAX_MATCH-1);\r
+\r
+#else /* UNALIGNED_OK */\r
+\r
+ if (match[best_len] != scan_end ||\r
+ match[best_len-1] != scan_end1 ||\r
+ *match != *scan ||\r
+ *++match != scan[1]) continue;\r
+\r
+ /* The check at best_len-1 can be removed because it will be made\r
+ * again later. (This heuristic is not always a win.)\r
+ * It is not necessary to compare scan[2] and match[2] since they\r
+ * are always equal when the other bytes match, given that\r
+ * the hash keys are equal and that HASH_BITS >= 8.\r
+ */\r
+ scan += 2, match++;\r
+ Assert(*scan == *match, "match[2]?");\r
+\r
+ /* We check for insufficient lookahead only every 8th comparison;\r
+ * the 256th check will be made at strstart+258.\r
+ */\r
+ do {\r
+ } while (*++scan == *++match && *++scan == *++match &&\r
+ *++scan == *++match && *++scan == *++match &&\r
+ *++scan == *++match && *++scan == *++match &&\r
+ *++scan == *++match && *++scan == *++match &&\r
+ scan < strend);\r
+\r
+ Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan");\r
+\r
+ len = MAX_MATCH - (int)(strend - scan);\r
+ scan = strend - MAX_MATCH;\r
+\r
+#endif /* UNALIGNED_OK */\r
+\r
+ if (len > best_len) {\r
+ s->match_start = cur_match;\r
+ best_len = len;\r
+ if (len >= nice_match) break;\r
+#ifdef UNALIGNED_OK\r
+ scan_end = *(ushf*)(scan+best_len-1);\r
+#else\r
+ scan_end1 = scan[best_len-1];\r
+ scan_end = scan[best_len];\r
+#endif\r
+ }\r
+ } while ((cur_match = prev[cur_match & wmask]) > limit\r
+ && --chain_length != 0);\r
+\r
+ if ((uInt)best_len <= s->lookahead) return (uInt)best_len;\r
+ return s->lookahead;\r
+}\r
+#endif /* ASMV */\r
+#endif /* FASTEST */\r
+\r
+/* ---------------------------------------------------------------------------\r
+ * Optimized version for level == 1 or strategy == Z_RLE only\r
+ */\r
+local uInt longest_match_fast(s, cur_match)\r
+ deflate_state *s;\r
+ IPos cur_match; /* current match */\r
+{\r
+ register Bytef *scan = s->window + s->strstart; /* current string */\r
+ register Bytef *match; /* matched string */\r
+ register int len; /* length of current match */\r
+ register Bytef *strend = s->window + s->strstart + MAX_MATCH;\r
+\r
+ /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.\r
+ * It is easy to get rid of this optimization if necessary.\r
+ */\r
+ Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");\r
+\r
+ Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");\r
+\r
+ Assert(cur_match < s->strstart, "no future");\r
+\r
+ match = s->window + cur_match;\r
+\r
+ /* Return failure if the match length is less than 2:\r
+ */\r
+ if (match[0] != scan[0] || match[1] != scan[1]) return MIN_MATCH-1;\r
+\r
+ /* The check at best_len-1 can be removed because it will be made\r
+ * again later. (This heuristic is not always a win.)\r
+ * It is not necessary to compare scan[2] and match[2] since they\r
+ * are always equal when the other bytes match, given that\r
+ * the hash keys are equal and that HASH_BITS >= 8.\r
+ */\r
+ scan += 2, match += 2;\r
+ Assert(*scan == *match, "match[2]?");\r
+\r
+ /* We check for insufficient lookahead only every 8th comparison;\r
+ * the 256th check will be made at strstart+258.\r
+ */\r
+ do {\r
+ } while (*++scan == *++match && *++scan == *++match &&\r
+ *++scan == *++match && *++scan == *++match &&\r
+ *++scan == *++match && *++scan == *++match &&\r
+ *++scan == *++match && *++scan == *++match &&\r
+ scan < strend);\r
+\r
+ Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan");\r
+\r
+ len = MAX_MATCH - (int)(strend - scan);\r
+\r
+ if (len < MIN_MATCH) return MIN_MATCH - 1;\r
+\r
+ s->match_start = cur_match;\r
+ return (uInt)len <= s->lookahead ? (uInt)len : s->lookahead;\r
+}\r
+\r
+#ifdef DEBUG\r
+/* ===========================================================================\r
+ * Check that the match at match_start is indeed a match.\r
+ */\r
+local void check_match(s, start, match, length)\r
+ deflate_state *s;\r
+ IPos start, match;\r
+ int length;\r
+{\r
+ /* check that the match is indeed a match */\r
+ if (zmemcmp(s->window + match,\r
+ s->window + start, length) != EQUAL) {\r
+ fprintf(stderr, " start %u, match %u, length %d\n",\r
+ start, match, length);\r
+ do {\r
+ fprintf(stderr, "%c%c", s->window[match++], s->window[start++]);\r
+ } while (--length != 0);\r
+ z_error("invalid match");\r
+ }\r
+ if (z_verbose > 1) {\r
+ fprintf(stderr,"\\[%d,%d]", start-match, length);\r
+ do { putc(s->window[start++], stderr); } while (--length != 0);\r
+ }\r
+}\r
+#else\r
+# define check_match(s, start, match, length)\r
+#endif /* DEBUG */\r
+\r
+/* ===========================================================================\r
+ * Fill the window when the lookahead becomes insufficient.\r
+ * Updates strstart and lookahead.\r
+ *\r
+ * IN assertion: lookahead < MIN_LOOKAHEAD\r
+ * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD\r
+ * At least one byte has been read, or avail_in == 0; reads are\r
+ * performed for at least two bytes (required for the zip translate_eol\r
+ * option -- not supported here).\r
+ */\r
+local void fill_window(s)\r
+ deflate_state *s;\r
+{\r
+ register unsigned n, m;\r
+ register Posf *p;\r
+ unsigned more; /* Amount of free space at the end of the window. */\r
+ uInt wsize = s->w_size;\r
+\r
+ do {\r
+ more = (unsigned)(s->window_size -(ulg)s->lookahead -(ulg)s->strstart);\r
+\r
+ /* Deal with !@#$% 64K limit: */\r
+ if (sizeof(int) <= 2) {\r
+ if (more == 0 && s->strstart == 0 && s->lookahead == 0) {\r
+ more = wsize;\r
+\r
+ } else if (more == (unsigned)(-1)) {\r
+ /* Very unlikely, but possible on 16 bit machine if\r
+ * strstart == 0 && lookahead == 1 (input done a byte at time)\r
+ */\r
+ more--;\r
+ }\r
+ }\r
+\r
+ /* If the window is almost full and there is insufficient lookahead,\r
+ * move the upper half to the lower one to make room in the upper half.\r
+ */\r
+ if (s->strstart >= wsize+MAX_DIST(s)) {\r
+\r
+ zmemcpy(s->window, s->window+wsize, (unsigned)wsize);\r
+ s->match_start -= wsize;\r
+ s->strstart -= wsize; /* we now have strstart >= MAX_DIST */\r
+ s->block_start -= (long) wsize;\r
+\r
+ /* Slide the hash table (could be avoided with 32 bit values\r
+ at the expense of memory usage). We slide even when level == 0\r
+ to keep the hash table consistent if we switch back to level > 0\r
+ later. (Using level 0 permanently is not an optimal usage of\r
+ zlib, so we don't care about this pathological case.)\r
+ */\r
+ /* %%% avoid this when Z_RLE */\r
+ n = s->hash_size;\r
+ p = &s->head[n];\r
+ do {\r
+ m = *--p;\r
+ *p = (Pos)(m >= wsize ? m-wsize : NIL);\r
+ } while (--n);\r
+\r
+ n = wsize;\r
+#ifndef FASTEST\r
+ p = &s->prev[n];\r
+ do {\r
+ m = *--p;\r
+ *p = (Pos)(m >= wsize ? m-wsize : NIL);\r
+ /* If n is not on any hash chain, prev[n] is garbage but\r
+ * its value will never be used.\r
+ */\r
+ } while (--n);\r
+#endif\r
+ more += wsize;\r
+ }\r
+ if (s->strm->avail_in == 0) return;\r
+\r
+ /* If there was no sliding:\r
+ * strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 &&\r
+ * more == window_size - lookahead - strstart\r
+ * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1)\r
+ * => more >= window_size - 2*WSIZE + 2\r
+ * In the BIG_MEM or MMAP case (not yet supported),\r
+ * window_size == input_size + MIN_LOOKAHEAD &&\r
+ * strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD.\r
+ * Otherwise, window_size == 2*WSIZE so more >= 2.\r
+ * If there was sliding, more >= WSIZE. So in all cases, more >= 2.\r
+ */\r
+ Assert(more >= 2, "more < 2");\r
+\r
+ n = read_buf(s->strm, s->window + s->strstart + s->lookahead, more);\r
+ s->lookahead += n;\r
+\r
+ /* Initialize the hash value now that we have some input: */\r
+ if (s->lookahead >= MIN_MATCH) {\r
+ s->ins_h = s->window[s->strstart];\r
+ UPDATE_HASH(s, s->ins_h, s->window[s->strstart+1]);\r
+#if MIN_MATCH != 3\r
+ Call UPDATE_HASH() MIN_MATCH-3 more times\r
+#endif\r
+ }\r
+ /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage,\r
+ * but this is not important since only literal bytes will be emitted.\r
+ */\r
+\r
+ } while (s->lookahead < MIN_LOOKAHEAD && s->strm->avail_in != 0);\r
+}\r
+\r
+/* ===========================================================================\r
+ * Flush the current block, with given end-of-file flag.\r
+ * IN assertion: strstart is set to the end of the current match.\r
+ */\r
+#define FLUSH_BLOCK_ONLY(s, eof) { \\r
+ _tr_flush_block(s, (s->block_start >= 0L ? \\r
+ (charf *)&s->window[(unsigned)s->block_start] : \\r
+ (charf *)Z_NULL), \\r
+ (ulg)((long)s->strstart - s->block_start), \\r
+ (eof)); \\r
+ s->block_start = s->strstart; \\r
+ flush_pending(s->strm); \\r
+ Tracev((stderr,"[FLUSH]")); \\r
+}\r
+\r
+/* Same but force premature exit if necessary. */\r
+#define FLUSH_BLOCK(s, eof) { \\r
+ FLUSH_BLOCK_ONLY(s, eof); \\r
+ if (s->strm->avail_out == 0) return (eof) ? finish_started : need_more; \\r
+}\r
+\r
+/* ===========================================================================\r
+ * Copy without compression as much as possible from the input stream, return\r
+ * the current block state.\r
+ * This function does not insert new strings in the dictionary since\r
+ * uncompressible data is probably not useful. This function is used\r
+ * only for the level=0 compression option.\r
+ * NOTE: this function should be optimized to avoid extra copying from\r
+ * window to pending_buf.\r
+ */\r
+local block_state deflate_stored(s, flush)\r
+ deflate_state *s;\r
+ int flush;\r
+{\r
+ /* Stored blocks are limited to 0xffff bytes, pending_buf is limited\r
+ * to pending_buf_size, and each stored block has a 5 byte header:\r
+ */\r
+ ulg max_block_size = 0xffff;\r
+ ulg max_start;\r
+\r
+ if (max_block_size > s->pending_buf_size - 5) {\r
+ max_block_size = s->pending_buf_size - 5;\r
+ }\r
+\r
+ /* Copy as much as possible from input to output: */\r
+ for (;;) {\r
+ /* Fill the window as much as possible: */\r
+ if (s->lookahead <= 1) {\r
+\r
+ Assert(s->strstart < s->w_size+MAX_DIST(s) ||\r
+ s->block_start >= (long)s->w_size, "slide too late");\r
+\r
+ fill_window(s);\r
+ if (s->lookahead == 0 && flush == Z_NO_FLUSH) return need_more;\r
+\r
+ if (s->lookahead == 0) break; /* flush the current block */\r
+ }\r
+ Assert(s->block_start >= 0L, "block gone");\r
+\r
+ s->strstart += s->lookahead;\r
+ s->lookahead = 0;\r
+\r
+ /* Emit a stored block if pending_buf will be full: */\r
+ max_start = s->block_start + max_block_size;\r
+ if (s->strstart == 0 || (ulg)s->strstart >= max_start) {\r
+ /* strstart == 0 is possible when wraparound on 16-bit machine */\r
+ s->lookahead = (uInt)(s->strstart - max_start);\r
+ s->strstart = (uInt)max_start;\r
+ FLUSH_BLOCK(s, 0);\r
+ }\r
+ /* Flush if we may have to slide, otherwise block_start may become\r
+ * negative and the data will be gone:\r
+ */\r
+ if (s->strstart - (uInt)s->block_start >= MAX_DIST(s)) {\r
+ FLUSH_BLOCK(s, 0);\r
+ }\r
+ }\r
+ FLUSH_BLOCK(s, flush == Z_FINISH);\r
+ return flush == Z_FINISH ? finish_done : block_done;\r
+}\r
+\r
+/* ===========================================================================\r
+ * Compress as much as possible from the input stream, return the current\r
+ * block state.\r
+ * This function does not perform lazy evaluation of matches and inserts\r
+ * new strings in the dictionary only for unmatched strings or for short\r
+ * matches. It is used only for the fast compression options.\r
+ */\r
+local block_state deflate_fast(s, flush)\r
+ deflate_state *s;\r
+ int flush;\r
+{\r
+ IPos hash_head = NIL; /* head of the hash chain */\r
+ int bflush; /* set if current block must be flushed */\r
+\r
+ for (;;) {\r
+ /* Make sure that we always have enough lookahead, except\r
+ * at the end of the input file. We need MAX_MATCH bytes\r
+ * for the next match, plus MIN_MATCH bytes to insert the\r
+ * string following the next match.\r
+ */\r
+ if (s->lookahead < MIN_LOOKAHEAD) {\r
+ fill_window(s);\r
+ if (s->lookahead < MIN_LOOKAHEAD && flush == Z_NO_FLUSH) {\r
+ return need_more;\r
+ }\r
+ if (s->lookahead == 0) break; /* flush the current block */\r
+ }\r
+\r
+ /* Insert the string window[strstart .. strstart+2] in the\r
+ * dictionary, and set hash_head to the head of the hash chain:\r
+ */\r
+ if (s->lookahead >= MIN_MATCH) {\r
+ INSERT_STRING(s, s->strstart, hash_head);\r
+ }\r
+\r
+ /* Find the longest match, discarding those <= prev_length.\r
+ * At this point we have always match_length < MIN_MATCH\r
+ */\r
+ if (hash_head != NIL && s->strstart - hash_head <= MAX_DIST(s)) {\r
+ /* To simplify the code, we prevent matches with the string\r
+ * of window index 0 (in particular we have to avoid a match\r
+ * of the string with itself at the start of the input file).\r
+ */\r
+#ifdef FASTEST\r
+ if ((s->strategy != Z_HUFFMAN_ONLY && s->strategy != Z_RLE) ||\r
+ (s->strategy == Z_RLE && s->strstart - hash_head == 1)) {\r
+ s->match_length = longest_match_fast (s, hash_head);\r
+ }\r
+#else\r
+ if (s->strategy != Z_HUFFMAN_ONLY && s->strategy != Z_RLE) {\r
+ s->match_length = longest_match (s, hash_head);\r
+ } else if (s->strategy == Z_RLE && s->strstart - hash_head == 1) {\r
+ s->match_length = longest_match_fast (s, hash_head);\r
+ }\r
+#endif\r
+ /* longest_match() or longest_match_fast() sets match_start */\r
+ }\r
+ if (s->match_length >= MIN_MATCH) {\r
+ check_match(s, s->strstart, s->match_start, s->match_length);\r
+\r
+ _tr_tally_dist(s, s->strstart - s->match_start,\r
+ s->match_length - MIN_MATCH, bflush);\r
+\r
+ s->lookahead -= s->match_length;\r
+\r
+ /* Insert new strings in the hash table only if the match length\r
+ * is not too large. This saves time but degrades compression.\r
+ */\r
+#ifndef FASTEST\r
+ if (s->match_length <= s->max_insert_length &&\r
+ s->lookahead >= MIN_MATCH) {\r
+ s->match_length--; /* string at strstart already in table */\r
+ do {\r
+ s->strstart++;\r
+ INSERT_STRING(s, s->strstart, hash_head);\r
+ /* strstart never exceeds WSIZE-MAX_MATCH, so there are\r
+ * always MIN_MATCH bytes ahead.\r
+ */\r
+ } while (--s->match_length != 0);\r
+ s->strstart++;\r
+ } else\r
+#endif\r
+ {\r
+ s->strstart += s->match_length;\r
+ s->match_length = 0;\r
+ s->ins_h = s->window[s->strstart];\r
+ UPDATE_HASH(s, s->ins_h, s->window[s->strstart+1]);\r
+#if MIN_MATCH != 3\r
+ Call UPDATE_HASH() MIN_MATCH-3 more times\r
+#endif\r
+ /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not\r
+ * matter since it will be recomputed at next deflate call.\r
+ */\r
+ }\r
+ } else {\r
+ /* No match, output a literal byte */\r
+ Tracevv((stderr,"%c", s->window[s->strstart]));\r
+ _tr_tally_lit (s, s->window[s->strstart], bflush);\r
+ s->lookahead--;\r
+ s->strstart++;\r
+ }\r
+ if (bflush) FLUSH_BLOCK(s, 0);\r
+ }\r
+ FLUSH_BLOCK(s, flush == Z_FINISH);\r
+ return flush == Z_FINISH ? finish_done : block_done;\r
+}\r
+\r
+#ifndef FASTEST\r
+/* ===========================================================================\r
+ * Same as above, but achieves better compression. We use a lazy\r
+ * evaluation for matches: a match is finally adopted only if there is\r
+ * no better match at the next window position.\r
+ */\r
+local block_state deflate_slow(s, flush)\r
+ deflate_state *s;\r
+ int flush;\r
+{\r
+ IPos hash_head = NIL; /* head of hash chain */\r
+ int bflush; /* set if current block must be flushed */\r
+\r
+ /* Process the input block. */\r
+ for (;;) {\r
+ /* Make sure that we always have enough lookahead, except\r
+ * at the end of the input file. We need MAX_MATCH bytes\r
+ * for the next match, plus MIN_MATCH bytes to insert the\r
+ * string following the next match.\r
+ */\r
+ if (s->lookahead < MIN_LOOKAHEAD) {\r
+ fill_window(s);\r
+ if (s->lookahead < MIN_LOOKAHEAD && flush == Z_NO_FLUSH) {\r
+ return need_more;\r
+ }\r
+ if (s->lookahead == 0) break; /* flush the current block */\r
+ }\r
+\r
+ /* Insert the string window[strstart .. strstart+2] in the\r
+ * dictionary, and set hash_head to the head of the hash chain:\r
+ */\r
+ if (s->lookahead >= MIN_MATCH) {\r
+ INSERT_STRING(s, s->strstart, hash_head);\r
+ }\r
+\r
+ /* Find the longest match, discarding those <= prev_length.\r
+ */\r
+ s->prev_length = s->match_length, s->prev_match = s->match_start;\r
+ s->match_length = MIN_MATCH-1;\r
+\r
+ if (hash_head != NIL && s->prev_length < s->max_lazy_match &&\r
+ s->strstart - hash_head <= MAX_DIST(s)) {\r
+ /* To simplify the code, we prevent matches with the string\r
+ * of window index 0 (in particular we have to avoid a match\r
+ * of the string with itself at the start of the input file).\r
+ */\r
+ if (s->strategy != Z_HUFFMAN_ONLY && s->strategy != Z_RLE) {\r
+ s->match_length = longest_match (s, hash_head);\r
+ } else if (s->strategy == Z_RLE && s->strstart - hash_head == 1) {\r
+ s->match_length = longest_match_fast (s, hash_head);\r
+ }\r
+ /* longest_match() or longest_match_fast() sets match_start */\r
+\r
+ if (s->match_length <= 5 && (s->strategy == Z_FILTERED\r
+#if TOO_FAR <= 32767\r
+ || (s->match_length == MIN_MATCH &&\r
+ s->strstart - s->match_start > TOO_FAR)\r
+#endif\r
+ )) {\r
+\r
+ /* If prev_match is also MIN_MATCH, match_start is garbage\r
+ * but we will ignore the current match anyway.\r
+ */\r
+ s->match_length = MIN_MATCH-1;\r
+ }\r
+ }\r
+ /* If there was a match at the previous step and the current\r
+ * match is not better, output the previous match:\r
+ */\r
+ if (s->prev_length >= MIN_MATCH && s->match_length <= s->prev_length) {\r
+ uInt max_insert = s->strstart + s->lookahead - MIN_MATCH;\r
+ /* Do not insert strings in hash table beyond this. */\r
+\r
+ check_match(s, s->strstart-1, s->prev_match, s->prev_length);\r
+\r
+ _tr_tally_dist(s, s->strstart -1 - s->prev_match,\r
+ s->prev_length - MIN_MATCH, bflush);\r
+\r
+ /* Insert in hash table all strings up to the end of the match.\r
+ * strstart-1 and strstart are already inserted. If there is not\r
+ * enough lookahead, the last two strings are not inserted in\r
+ * the hash table.\r
+ */\r
+ s->lookahead -= s->prev_length-1;\r
+ s->prev_length -= 2;\r
+ do {\r
+ if (++s->strstart <= max_insert) {\r
+ INSERT_STRING(s, s->strstart, hash_head);\r
+ }\r
+ } while (--s->prev_length != 0);\r
+ s->match_available = 0;\r
+ s->match_length = MIN_MATCH-1;\r
+ s->strstart++;\r
+\r
+ if (bflush) FLUSH_BLOCK(s, 0);\r
+\r
+ } else if (s->match_available) {\r
+ /* If there was no match at the previous position, output a\r
+ * single literal. If there was a match but the current match\r
+ * is longer, truncate the previous match to a single literal.\r
+ */\r
+ Tracevv((stderr,"%c", s->window[s->strstart-1]));\r
+ _tr_tally_lit(s, s->window[s->strstart-1], bflush);\r
+ if (bflush) {\r
+ FLUSH_BLOCK_ONLY(s, 0);\r
+ }\r
+ s->strstart++;\r
+ s->lookahead--;\r
+ if (s->strm->avail_out == 0) return need_more;\r
+ } else {\r
+ /* There is no previous match to compare with, wait for\r
+ * the next step to decide.\r
+ */\r
+ s->match_available = 1;\r
+ s->strstart++;\r
+ s->lookahead--;\r
+ }\r
+ }\r
+ Assert (flush != Z_NO_FLUSH, "no flush?");\r
+ if (s->match_available) {\r
+ Tracevv((stderr,"%c", s->window[s->strstart-1]));\r
+ _tr_tally_lit(s, s->window[s->strstart-1], bflush);\r
+ s->match_available = 0;\r
+ }\r
+ FLUSH_BLOCK(s, flush == Z_FINISH);\r
+ return flush == Z_FINISH ? finish_done : block_done;\r
+}\r
+#endif /* FASTEST */\r
+\r
+#if 0\r
+/* ===========================================================================\r
+ * For Z_RLE, simply look for runs of bytes, generate matches only of distance\r
+ * one. Do not maintain a hash table. (It will be regenerated if this run of\r
+ * deflate switches away from Z_RLE.)\r
+ */\r
+local block_state deflate_rle(s, flush)\r
+ deflate_state *s;\r
+ int flush;\r
+{\r
+ int bflush; /* set if current block must be flushed */\r
+ uInt run; /* length of run */\r
+ uInt max; /* maximum length of run */\r
+ uInt prev; /* byte at distance one to match */\r
+ Bytef *scan; /* scan for end of run */\r
+\r
+ for (;;) {\r
+ /* Make sure that we always have enough lookahead, except\r
+ * at the end of the input file. We need MAX_MATCH bytes\r
+ * for the longest encodable run.\r
+ */\r
+ if (s->lookahead < MAX_MATCH) {\r
+ fill_window(s);\r
+ if (s->lookahead < MAX_MATCH && flush == Z_NO_FLUSH) {\r
+ return need_more;\r
+ }\r
+ if (s->lookahead == 0) break; /* flush the current block */\r
+ }\r
+\r
+ /* See how many times the previous byte repeats */\r
+ run = 0;\r
+ if (s->strstart > 0) { /* if there is a previous byte, that is */\r
+ max = s->lookahead < MAX_MATCH ? s->lookahead : MAX_MATCH;\r
+ scan = s->window + s->strstart - 1;\r
+ prev = *scan++;\r
+ do {\r
+ if (*scan++ != prev)\r
+ break;\r
+ } while (++run < max);\r
+ }\r
+\r
+ /* Emit match if have run of MIN_MATCH or longer, else emit literal */\r
+ if (run >= MIN_MATCH) {\r
+ check_match(s, s->strstart, s->strstart - 1, run);\r
+ _tr_tally_dist(s, 1, run - MIN_MATCH, bflush);\r
+ s->lookahead -= run;\r
+ s->strstart += run;\r
+ } else {\r
+ /* No match, output a literal byte */\r
+ Tracevv((stderr,"%c", s->window[s->strstart]));\r
+ _tr_tally_lit (s, s->window[s->strstart], bflush);\r
+ s->lookahead--;\r
+ s->strstart++;\r
+ }\r
+ if (bflush) FLUSH_BLOCK(s, 0);\r
+ }\r
+ FLUSH_BLOCK(s, flush == Z_FINISH);\r
+ return flush == Z_FINISH ? finish_done : block_done;\r
+}\r
+#endif\r
--- /dev/null
+/* deflate.h -- internal compression state\r
+ * Copyright (C) 1995-2004 Jean-loup Gailly\r
+ * For conditions of distribution and use, see copyright notice in zlib.h\r
+ */\r
+\r
+/* WARNING: this file should *not* be used by applications. It is\r
+ part of the implementation of the compression library and is\r
+ subject to change. Applications should only use zlib.h.\r
+ */\r
+\r
+/* @(#) $Id$ */\r
+\r
+#ifndef DEFLATE_H\r
+#define DEFLATE_H\r
+\r
+#include "zutil.h"\r
+\r
+/* define NO_GZIP when compiling if you want to disable gzip header and\r
+ trailer creation by deflate(). NO_GZIP would be used to avoid linking in\r
+ the crc code when it is not needed. For shared libraries, gzip encoding\r
+ should be left enabled. */\r
+#ifndef NO_GZIP\r
+# define GZIP\r
+#endif\r
+\r
+/* ===========================================================================\r
+ * Internal compression state.\r
+ */\r
+\r
+#define LENGTH_CODES 29\r
+/* number of length codes, not counting the special END_BLOCK code */\r
+\r
+#define LITERALS 256\r
+/* number of literal bytes 0..255 */\r
+\r
+#define L_CODES (LITERALS+1+LENGTH_CODES)\r
+/* number of Literal or Length codes, including the END_BLOCK code */\r
+\r
+#define D_CODES 30\r
+/* number of distance codes */\r
+\r
+#define BL_CODES 19\r
+/* number of codes used to transfer the bit lengths */\r
+\r
+#define HEAP_SIZE (2*L_CODES+1)\r
+/* maximum heap size */\r
+\r
+#define MAX_BITS 15\r
+/* All codes must not exceed MAX_BITS bits */\r
+\r
+#define INIT_STATE 42\r
+#define EXTRA_STATE 69\r
+#define NAME_STATE 73\r
+#define COMMENT_STATE 91\r
+#define HCRC_STATE 103\r
+#define BUSY_STATE 113\r
+#define FINISH_STATE 666\r
+/* Stream status */\r
+\r
+\r
+/* Data structure describing a single value and its code string. */\r
+typedef struct ct_data_s {\r
+ union {\r
+ ush freq; /* frequency count */\r
+ ush code; /* bit string */\r
+ } fc;\r
+ union {\r
+ ush dad; /* father node in Huffman tree */\r
+ ush len; /* length of bit string */\r
+ } dl;\r
+} FAR ct_data;\r
+\r
+#define Freq fc.freq\r
+#define Code fc.code\r
+#define Dad dl.dad\r
+#define Len dl.len\r
+\r
+typedef struct static_tree_desc_s static_tree_desc;\r
+\r
+typedef struct tree_desc_s {\r
+ ct_data *dyn_tree; /* the dynamic tree */\r
+ int max_code; /* largest code with non zero frequency */\r
+ static_tree_desc *stat_desc; /* the corresponding static tree */\r
+} FAR tree_desc;\r
+\r
+typedef ush Pos;\r
+typedef Pos FAR Posf;\r
+typedef unsigned IPos;\r
+\r
+/* A Pos is an index in the character window. We use short instead of int to\r
+ * save space in the various tables. IPos is used only for parameter passing.\r
+ */\r
+\r
+typedef struct internal_state {\r
+ z_streamp strm; /* pointer back to this zlib stream */\r
+ int status; /* as the name implies */\r
+ Bytef *pending_buf; /* output still pending */\r
+ ulg pending_buf_size; /* size of pending_buf */\r
+ Bytef *pending_out; /* next pending byte to output to the stream */\r
+ uInt pending; /* nb of bytes in the pending buffer */\r
+ int wrap; /* bit 0 true for zlib, bit 1 true for gzip */\r
+ gz_headerp gzhead; /* gzip header information to write */\r
+ uInt gzindex; /* where in extra, name, or comment */\r
+ Byte method; /* STORED (for zip only) or DEFLATED */\r
+ int last_flush; /* value of flush param for previous deflate call */\r
+\r
+ /* used by deflate.c: */\r
+\r
+ uInt w_size; /* LZ77 window size (32K by default) */\r
+ uInt w_bits; /* log2(w_size) (8..16) */\r
+ uInt w_mask; /* w_size - 1 */\r
+\r
+ Bytef *window;\r
+ /* Sliding window. Input bytes are read into the second half of the window,\r
+ * and move to the first half later to keep a dictionary of at least wSize\r
+ * bytes. With this organization, matches are limited to a distance of\r
+ * wSize-MAX_MATCH bytes, but this ensures that IO is always\r
+ * performed with a length multiple of the block size. Also, it limits\r
+ * the window size to 64K, which is quite useful on MSDOS.\r
+ * To do: use the user input buffer as sliding window.\r
+ */\r
+\r
+ ulg window_size;\r
+ /* Actual size of window: 2*wSize, except when the user input buffer\r
+ * is directly used as sliding window.\r
+ */\r
+\r
+ Posf *prev;\r
+ /* Link to older string with same hash index. To limit the size of this\r
+ * array to 64K, this link is maintained only for the last 32K strings.\r
+ * An index in this array is thus a window index modulo 32K.\r
+ */\r
+\r
+ Posf *head; /* Heads of the hash chains or NIL. */\r
+\r
+ uInt ins_h; /* hash index of string to be inserted */\r
+ uInt hash_size; /* number of elements in hash table */\r
+ uInt hash_bits; /* log2(hash_size) */\r
+ uInt hash_mask; /* hash_size-1 */\r
+\r
+ uInt hash_shift;\r
+ /* Number of bits by which ins_h must be shifted at each input\r
+ * step. It must be such that after MIN_MATCH steps, the oldest\r
+ * byte no longer takes part in the hash key, that is:\r
+ * hash_shift * MIN_MATCH >= hash_bits\r
+ */\r
+\r
+ long block_start;\r
+ /* Window position at the beginning of the current output block. Gets\r
+ * negative when the window is moved backwards.\r
+ */\r
+\r
+ uInt match_length; /* length of best match */\r
+ IPos prev_match; /* previous match */\r
+ int match_available; /* set if previous match exists */\r
+ uInt strstart; /* start of string to insert */\r
+ uInt match_start; /* start of matching string */\r
+ uInt lookahead; /* number of valid bytes ahead in window */\r
+\r
+ uInt prev_length;\r
+ /* Length of the best match at previous step. Matches not greater than this\r
+ * are discarded. This is used in the lazy match evaluation.\r
+ */\r
+\r
+ uInt max_chain_length;\r
+ /* To speed up deflation, hash chains are never searched beyond this\r
+ * length. A higher limit improves compression ratio but degrades the\r
+ * speed.\r
+ */\r
+\r
+ uInt max_lazy_match;\r
+ /* Attempt to find a better match only when the current match is strictly\r
+ * smaller than this value. This mechanism is used only for compression\r
+ * levels >= 4.\r
+ */\r
+# define max_insert_length max_lazy_match\r
+ /* Insert new strings in the hash table only if the match length is not\r
+ * greater than this length. This saves time but degrades compression.\r
+ * max_insert_length is used only for compression levels <= 3.\r
+ */\r
+\r
+ int level; /* compression level (1..9) */\r
+ int strategy; /* favor or force Huffman coding*/\r
+\r
+ uInt good_match;\r
+ /* Use a faster search when the previous match is longer than this */\r
+\r
+ int nice_match; /* Stop searching when current match exceeds this */\r
+\r
+ /* used by trees.c: */\r
+ /* Didn't use ct_data typedef below to supress compiler warning */\r
+ struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */\r
+ struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */\r
+ struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */\r
+\r
+ struct tree_desc_s l_desc; /* desc. for literal tree */\r
+ struct tree_desc_s d_desc; /* desc. for distance tree */\r
+ struct tree_desc_s bl_desc; /* desc. for bit length tree */\r
+\r
+ ush bl_count[MAX_BITS+1];\r
+ /* number of codes at each bit length for an optimal tree */\r
+\r
+ int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */\r
+ int heap_len; /* number of elements in the heap */\r
+ int heap_max; /* element of largest frequency */\r
+ /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.\r
+ * The same heap array is used to build all trees.\r
+ */\r
+\r
+ uch depth[2*L_CODES+1];\r
+ /* Depth of each subtree used as tie breaker for trees of equal frequency\r
+ */\r
+\r
+ uchf *l_buf; /* buffer for literals or lengths */\r
+\r
+ uInt lit_bufsize;\r
+ /* Size of match buffer for literals/lengths. There are 4 reasons for\r
+ * limiting lit_bufsize to 64K:\r
+ * - frequencies can be kept in 16 bit counters\r
+ * - if compression is not successful for the first block, all input\r
+ * data is still in the window so we can still emit a stored block even\r
+ * when input comes from standard input. (This can also be done for\r
+ * all blocks if lit_bufsize is not greater than 32K.)\r
+ * - if compression is not successful for a file smaller than 64K, we can\r
+ * even emit a stored file instead of a stored block (saving 5 bytes).\r
+ * This is applicable only for zip (not gzip or zlib).\r
+ * - creating new Huffman trees less frequently may not provide fast\r
+ * adaptation to changes in the input data statistics. (Take for\r
+ * example a binary file with poorly compressible code followed by\r
+ * a highly compressible string table.) Smaller buffer sizes give\r
+ * fast adaptation but have of course the overhead of transmitting\r
+ * trees more frequently.\r
+ * - I can't count above 4\r
+ */\r
+\r
+ uInt last_lit; /* running index in l_buf */\r
+\r
+ ushf *d_buf;\r
+ /* Buffer for distances. To simplify the code, d_buf and l_buf have\r
+ * the same number of elements. To use different lengths, an extra flag\r
+ * array would be necessary.\r
+ */\r
+\r
+ ulg opt_len; /* bit length of current block with optimal trees */\r
+ ulg static_len; /* bit length of current block with static trees */\r
+ uInt matches; /* number of string matches in current block */\r
+ int last_eob_len; /* bit length of EOB code for last block */\r
+\r
+#ifdef DEBUG\r
+ ulg compressed_len; /* total bit length of compressed file mod 2^32 */\r
+ ulg bits_sent; /* bit length of compressed data sent mod 2^32 */\r
+#endif\r
+\r
+ ush bi_buf;\r
+ /* Output buffer. bits are inserted starting at the bottom (least\r
+ * significant bits).\r
+ */\r
+ int bi_valid;\r
+ /* Number of valid bits in bi_buf. All bits above the last valid bit\r
+ * are always zero.\r
+ */\r
+\r
+} FAR deflate_state;\r
+\r
+/* Output a byte on the stream.\r
+ * IN assertion: there is enough room in pending_buf.\r
+ */\r
+#define put_byte(s, c) {s->pending_buf[s->pending++] = (c);}\r
+\r
+\r
+#define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)\r
+/* Minimum amount of lookahead, except at the end of the input file.\r
+ * See deflate.c for comments about the MIN_MATCH+1.\r
+ */\r
+\r
+#define MAX_DIST(s) ((s)->w_size-MIN_LOOKAHEAD)\r
+/* In order to simplify the code, particularly on 16 bit machines, match\r
+ * distances are limited to MAX_DIST instead of WSIZE.\r
+ */\r
+\r
+ /* in trees.c */\r
+void _tr_init OF((deflate_state *s));\r
+int _tr_tally OF((deflate_state *s, unsigned dist, unsigned lc));\r
+void _tr_flush_block OF((deflate_state *s, charf *buf, ulg stored_len,\r
+ int eof));\r
+void _tr_align OF((deflate_state *s));\r
+void _tr_stored_block OF((deflate_state *s, charf *buf, ulg stored_len,\r
+ int eof));\r
+\r
+#define d_code(dist) \\r
+ ((dist) < 256 ? _dist_code[dist] : _dist_code[256+((dist)>>7)])\r
+/* Mapping from a distance to a distance code. dist is the distance - 1 and\r
+ * must not have side effects. _dist_code[256] and _dist_code[257] are never\r
+ * used.\r
+ */\r
+\r
+#ifndef DEBUG\r
+/* Inline versions of _tr_tally for speed: */\r
+\r
+#if defined(GEN_TREES_H) || !defined(STDC)\r
+ extern uch _length_code[];\r
+ extern uch _dist_code[];\r
+#else\r
+ extern const uch _length_code[];\r
+ extern const uch _dist_code[];\r
+#endif\r
+\r
+# define _tr_tally_lit(s, c, flush) \\r
+ { uch cc = (c); \\r
+ s->d_buf[s->last_lit] = 0; \\r
+ s->l_buf[s->last_lit++] = cc; \\r
+ s->dyn_ltree[cc].Freq++; \\r
+ flush = (s->last_lit == s->lit_bufsize-1); \\r
+ }\r
+# define _tr_tally_dist(s, distance, length, flush) \\r
+ { uch len = (length); \\r
+ ush dist = (distance); \\r
+ s->d_buf[s->last_lit] = dist; \\r
+ s->l_buf[s->last_lit++] = len; \\r
+ dist--; \\r
+ s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \\r
+ s->dyn_dtree[d_code(dist)].Freq++; \\r
+ flush = (s->last_lit == s->lit_bufsize-1); \\r
+ }\r
+#else\r
+# define _tr_tally_lit(s, c, flush) flush = _tr_tally(s, 0, c)\r
+# define _tr_tally_dist(s, distance, length, flush) \\r
+ flush = _tr_tally(s, distance, length)\r
+#endif\r
+\r
+#endif /* DEFLATE_H */\r
--- /dev/null
+/* inffast.c -- fast decoding\r
+ * Copyright (C) 1995-2004 Mark Adler\r
+ * For conditions of distribution and use, see copyright notice in zlib.h\r
+ */\r
+\r
+#include "zutil.h"\r
+#include "inftrees.h"\r
+#include "inflate.h"\r
+#include "inffast.h"\r
+\r
+#ifndef ASMINF\r
+\r
+/* Allow machine dependent optimization for post-increment or pre-increment.\r
+ Based on testing to date,\r
+ Pre-increment preferred for:\r
+ - PowerPC G3 (Adler)\r
+ - MIPS R5000 (Randers-Pehrson)\r
+ Post-increment preferred for:\r
+ - none\r
+ No measurable difference:\r
+ - Pentium III (Anderson)\r
+ - M68060 (Nikl)\r
+ */\r
+#ifdef POSTINC\r
+# define OFF 0\r
+# define PUP(a) *(a)++\r
+#else\r
+# define OFF 1\r
+# define PUP(a) *++(a)\r
+#endif\r
+\r
+/*\r
+ Decode literal, length, and distance codes and write out the resulting\r
+ literal and match bytes until either not enough input or output is\r
+ available, an end-of-block is encountered, or a data error is encountered.\r
+ When large enough input and output buffers are supplied to inflate(), for\r
+ example, a 16K input buffer and a 64K output buffer, more than 95% of the\r
+ inflate execution time is spent in this routine.\r
+\r
+ Entry assumptions:\r
+\r
+ state->mode == LEN\r
+ strm->avail_in >= 6\r
+ strm->avail_out >= 258\r
+ start >= strm->avail_out\r
+ state->bits < 8\r
+\r
+ On return, state->mode is one of:\r
+\r
+ LEN -- ran out of enough output space or enough available input\r
+ TYPE -- reached end of block code, inflate() to interpret next block\r
+ BAD -- error in block data\r
+\r
+ Notes:\r
+\r
+ - The maximum input bits used by a length/distance pair is 15 bits for the\r
+ length code, 5 bits for the length extra, 15 bits for the distance code,\r
+ and 13 bits for the distance extra. This totals 48 bits, or six bytes.\r
+ Therefore if strm->avail_in >= 6, then there is enough input to avoid\r
+ checking for available input while decoding.\r
+\r
+ - The maximum bytes that a single length/distance pair can output is 258\r
+ bytes, which is the maximum length that can be coded. inflate_fast()\r
+ requires strm->avail_out >= 258 for each loop to avoid checking for\r
+ output space.\r
+ */\r
+void inflate_fast(strm, start)\r
+z_streamp strm;\r
+unsigned start; /* inflate()'s starting value for strm->avail_out */\r
+{\r
+ struct inflate_state FAR *state;\r
+ unsigned char FAR *in; /* local strm->next_in */\r
+ unsigned char FAR *last; /* while in < last, enough input available */\r
+ unsigned char FAR *out; /* local strm->next_out */\r
+ unsigned char FAR *beg; /* inflate()'s initial strm->next_out */\r
+ unsigned char FAR *end; /* while out < end, enough space available */\r
+#ifdef INFLATE_STRICT\r
+ unsigned dmax; /* maximum distance from zlib header */\r
+#endif\r
+ unsigned wsize; /* window size or zero if not using window */\r
+ unsigned whave; /* valid bytes in the window */\r
+ unsigned write; /* window write index */\r
+ unsigned char FAR *window; /* allocated sliding window, if wsize != 0 */\r
+ unsigned long hold; /* local strm->hold */\r
+ unsigned bits; /* local strm->bits */\r
+ code const FAR *lcode; /* local strm->lencode */\r
+ code const FAR *dcode; /* local strm->distcode */\r
+ unsigned lmask; /* mask for first level of length codes */\r
+ unsigned dmask; /* mask for first level of distance codes */\r
+ code this; /* retrieved table entry */\r
+ unsigned op; /* code bits, operation, extra bits, or */\r
+ /* window position, window bytes to copy */\r
+ unsigned len; /* match length, unused bytes */\r
+ unsigned dist; /* match distance */\r
+ unsigned char FAR *from; /* where to copy match from */\r
+\r
+ /* copy state to local variables */\r
+ state = (struct inflate_state FAR *)strm->state;\r
+ in = strm->next_in - OFF;\r
+ last = in + (strm->avail_in - 5);\r
+ out = strm->next_out - OFF;\r
+ beg = out - (start - strm->avail_out);\r
+ end = out + (strm->avail_out - 257);\r
+#ifdef INFLATE_STRICT\r
+ dmax = state->dmax;\r
+#endif\r
+ wsize = state->wsize;\r
+ whave = state->whave;\r
+ write = state->write;\r
+ window = state->window;\r
+ hold = state->hold;\r
+ bits = state->bits;\r
+ lcode = state->lencode;\r
+ dcode = state->distcode;\r
+ lmask = (1U << state->lenbits) - 1;\r
+ dmask = (1U << state->distbits) - 1;\r
+\r
+ /* decode literals and length/distances until end-of-block or not enough\r
+ input data or output space */\r
+ do {\r
+ if (bits < 15) {\r
+ hold += (unsigned long)(PUP(in)) << bits;\r
+ bits += 8;\r
+ hold += (unsigned long)(PUP(in)) << bits;\r
+ bits += 8;\r
+ }\r
+ this = lcode[hold & lmask];\r
+ dolen:\r
+ op = (unsigned)(this.bits);\r
+ hold >>= op;\r
+ bits -= op;\r
+ op = (unsigned)(this.op);\r
+ if (op == 0) { /* literal */\r
+ Tracevv((stderr, this.val >= 0x20 && this.val < 0x7f ?\r
+ "inflate: literal '%c'\n" :\r
+ "inflate: literal 0x%02x\n", this.val));\r
+ PUP(out) = (unsigned char)(this.val);\r
+ }\r
+ else if (op & 16) { /* length base */\r
+ len = (unsigned)(this.val);\r
+ op &= 15; /* number of extra bits */\r
+ if (op) {\r
+ if (bits < op) {\r
+ hold += (unsigned long)(PUP(in)) << bits;\r
+ bits += 8;\r
+ }\r
+ len += (unsigned)hold & ((1U << op) - 1);\r
+ hold >>= op;\r
+ bits -= op;\r
+ }\r
+ Tracevv((stderr, "inflate: length %u\n", len));\r
+ if (bits < 15) {\r
+ hold += (unsigned long)(PUP(in)) << bits;\r
+ bits += 8;\r
+ hold += (unsigned long)(PUP(in)) << bits;\r
+ bits += 8;\r
+ }\r
+ this = dcode[hold & dmask];\r
+ dodist:\r
+ op = (unsigned)(this.bits);\r
+ hold >>= op;\r
+ bits -= op;\r
+ op = (unsigned)(this.op);\r
+ if (op & 16) { /* distance base */\r
+ dist = (unsigned)(this.val);\r
+ op &= 15; /* number of extra bits */\r
+ if (bits < op) {\r
+ hold += (unsigned long)(PUP(in)) << bits;\r
+ bits += 8;\r
+ if (bits < op) {\r
+ hold += (unsigned long)(PUP(in)) << bits;\r
+ bits += 8;\r
+ }\r
+ }\r
+ dist += (unsigned)hold & ((1U << op) - 1);\r
+#ifdef INFLATE_STRICT\r
+ if (dist > dmax) {\r
+ strm->msg = (char *)"invalid distance too far back";\r
+ state->mode = BAD;\r
+ break;\r
+ }\r
+#endif\r
+ hold >>= op;\r
+ bits -= op;\r
+ Tracevv((stderr, "inflate: distance %u\n", dist));\r
+ op = (unsigned)(out - beg); /* max distance in output */\r
+ if (dist > op) { /* see if copy from window */\r
+ op = dist - op; /* distance back in window */\r
+ if (op > whave) {\r
+ strm->msg = (char *)"invalid distance too far back";\r
+ state->mode = BAD;\r
+ break;\r
+ }\r
+ from = window - OFF;\r
+ if (write == 0) { /* very common case */\r
+ from += wsize - op;\r
+ if (op < len) { /* some from window */\r
+ len -= op;\r
+ do {\r
+ PUP(out) = PUP(from);\r
+ } while (--op);\r
+ from = out - dist; /* rest from output */\r
+ }\r
+ }\r
+ else if (write < op) { /* wrap around window */\r
+ from += wsize + write - op;\r
+ op -= write;\r
+ if (op < len) { /* some from end of window */\r
+ len -= op;\r
+ do {\r
+ PUP(out) = PUP(from);\r
+ } while (--op);\r
+ from = window - OFF;\r
+ if (write < len) { /* some from start of window */\r
+ op = write;\r
+ len -= op;\r
+ do {\r
+ PUP(out) = PUP(from);\r
+ } while (--op);\r
+ from = out - dist; /* rest from output */\r
+ }\r
+ }\r
+ }\r
+ else { /* contiguous in window */\r
+ from += write - op;\r
+ if (op < len) { /* some from window */\r
+ len -= op;\r
+ do {\r
+ PUP(out) = PUP(from);\r
+ } while (--op);\r
+ from = out - dist; /* rest from output */\r
+ }\r
+ }\r
+ while (len > 2) {\r
+ PUP(out) = PUP(from);\r
+ PUP(out) = PUP(from);\r
+ PUP(out) = PUP(from);\r
+ len -= 3;\r
+ }\r
+ if (len) {\r
+ PUP(out) = PUP(from);\r
+ if (len > 1)\r
+ PUP(out) = PUP(from);\r
+ }\r
+ }\r
+ else {\r
+ from = out - dist; /* copy direct from output */\r
+ do { /* minimum length is three */\r
+ PUP(out) = PUP(from);\r
+ PUP(out) = PUP(from);\r
+ PUP(out) = PUP(from);\r
+ len -= 3;\r
+ } while (len > 2);\r
+ if (len) {\r
+ PUP(out) = PUP(from);\r
+ if (len > 1)\r
+ PUP(out) = PUP(from);\r
+ }\r
+ }\r
+ }\r
+ else if ((op & 64) == 0) { /* 2nd level distance code */\r
+ this = dcode[this.val + (hold & ((1U << op) - 1))];\r
+ goto dodist;\r
+ }\r
+ else {\r
+ strm->msg = (char *)"invalid distance code";\r
+ state->mode = BAD;\r
+ break;\r
+ }\r
+ }\r
+ else if ((op & 64) == 0) { /* 2nd level length code */\r
+ this = lcode[this.val + (hold & ((1U << op) - 1))];\r
+ goto dolen;\r
+ }\r
+ else if (op & 32) { /* end-of-block */\r
+ Tracevv((stderr, "inflate: end of block\n"));\r
+ state->mode = TYPE;\r
+ break;\r
+ }\r
+ else {\r
+ strm->msg = (char *)"invalid literal/length code";\r
+ state->mode = BAD;\r
+ break;\r
+ }\r
+ } while (in < last && out < end);\r
+\r
+ /* return unused bytes (on entry, bits < 8, so in won't go too far back) */\r
+ len = bits >> 3;\r
+ in -= len;\r
+ bits -= len << 3;\r
+ hold &= (1U << bits) - 1;\r
+\r
+ /* update state and return */\r
+ strm->next_in = in + OFF;\r
+ strm->next_out = out + OFF;\r
+ strm->avail_in = (unsigned)(in < last ? 5 + (last - in) : 5 - (in - last));\r
+ strm->avail_out = (unsigned)(out < end ?\r
+ 257 + (end - out) : 257 - (out - end));\r
+ state->hold = hold;\r
+ state->bits = bits;\r
+ return;\r
+}\r
+\r
+/*\r
+ inflate_fast() speedups that turned out slower (on a PowerPC G3 750CXe):\r
+ - Using bit fields for code structure\r
+ - Different op definition to avoid & for extra bits (do & for table bits)\r
+ - Three separate decoding do-loops for direct, window, and write == 0\r
+ - Special case for distance > 1 copies to do overlapped load and store copy\r
+ - Explicit branch predictions (based on measured branch probabilities)\r
+ - Deferring match copy and interspersed it with decoding subsequent codes\r
+ - Swapping literal/length else\r
+ - Swapping window/direct else\r
+ - Larger unrolled copy loops (three is about right)\r
+ - Moving len -= 3 statement into middle of loop\r
+ */\r
+\r
+#endif /* !ASMINF */\r
--- /dev/null
+/* inffast.h -- header to use inffast.c\r
+ * Copyright (C) 1995-2003 Mark Adler\r
+ * For conditions of distribution and use, see copyright notice in zlib.h\r
+ */\r
+\r
+/* WARNING: this file should *not* be used by applications. It is\r
+ part of the implementation of the compression library and is\r
+ subject to change. Applications should only use zlib.h.\r
+ */\r
+\r
+void inflate_fast OF((z_streamp strm, unsigned start));\r
--- /dev/null
+ /* inffixed.h -- table for decoding fixed codes\r
+ * Generated automatically by makefixed().\r
+ */\r
+\r
+ /* WARNING: this file should *not* be used by applications. It\r
+ is part of the implementation of the compression library and\r
+ is subject to change. Applications should only use zlib.h.\r
+ */\r
+\r
+ static const code lenfix[512] = {\r
+ {96,7,0},{0,8,80},{0,8,16},{20,8,115},{18,7,31},{0,8,112},{0,8,48},\r
+ {0,9,192},{16,7,10},{0,8,96},{0,8,32},{0,9,160},{0,8,0},{0,8,128},\r
+ {0,8,64},{0,9,224},{16,7,6},{0,8,88},{0,8,24},{0,9,144},{19,7,59},\r
+ {0,8,120},{0,8,56},{0,9,208},{17,7,17},{0,8,104},{0,8,40},{0,9,176},\r
+ {0,8,8},{0,8,136},{0,8,72},{0,9,240},{16,7,4},{0,8,84},{0,8,20},\r
+ {21,8,227},{19,7,43},{0,8,116},{0,8,52},{0,9,200},{17,7,13},{0,8,100},\r
+ {0,8,36},{0,9,168},{0,8,4},{0,8,132},{0,8,68},{0,9,232},{16,7,8},\r
+ {0,8,92},{0,8,28},{0,9,152},{20,7,83},{0,8,124},{0,8,60},{0,9,216},\r
+ {18,7,23},{0,8,108},{0,8,44},{0,9,184},{0,8,12},{0,8,140},{0,8,76},\r
+ {0,9,248},{16,7,3},{0,8,82},{0,8,18},{21,8,163},{19,7,35},{0,8,114},\r
+ {0,8,50},{0,9,196},{17,7,11},{0,8,98},{0,8,34},{0,9,164},{0,8,2},\r
+ {0,8,130},{0,8,66},{0,9,228},{16,7,7},{0,8,90},{0,8,26},{0,9,148},\r
+ {20,7,67},{0,8,122},{0,8,58},{0,9,212},{18,7,19},{0,8,106},{0,8,42},\r
+ {0,9,180},{0,8,10},{0,8,138},{0,8,74},{0,9,244},{16,7,5},{0,8,86},\r
+ {0,8,22},{64,8,0},{19,7,51},{0,8,118},{0,8,54},{0,9,204},{17,7,15},\r
+ {0,8,102},{0,8,38},{0,9,172},{0,8,6},{0,8,134},{0,8,70},{0,9,236},\r
+ {16,7,9},{0,8,94},{0,8,30},{0,9,156},{20,7,99},{0,8,126},{0,8,62},\r
+ {0,9,220},{18,7,27},{0,8,110},{0,8,46},{0,9,188},{0,8,14},{0,8,142},\r
+ {0,8,78},{0,9,252},{96,7,0},{0,8,81},{0,8,17},{21,8,131},{18,7,31},\r
+ {0,8,113},{0,8,49},{0,9,194},{16,7,10},{0,8,97},{0,8,33},{0,9,162},\r
+ {0,8,1},{0,8,129},{0,8,65},{0,9,226},{16,7,6},{0,8,89},{0,8,25},\r
+ {0,9,146},{19,7,59},{0,8,121},{0,8,57},{0,9,210},{17,7,17},{0,8,105},\r
+ {0,8,41},{0,9,178},{0,8,9},{0,8,137},{0,8,73},{0,9,242},{16,7,4},\r
+ {0,8,85},{0,8,21},{16,8,258},{19,7,43},{0,8,117},{0,8,53},{0,9,202},\r
+ {17,7,13},{0,8,101},{0,8,37},{0,9,170},{0,8,5},{0,8,133},{0,8,69},\r
+ {0,9,234},{16,7,8},{0,8,93},{0,8,29},{0,9,154},{20,7,83},{0,8,125},\r
+ {0,8,61},{0,9,218},{18,7,23},{0,8,109},{0,8,45},{0,9,186},{0,8,13},\r
+ {0,8,141},{0,8,77},{0,9,250},{16,7,3},{0,8,83},{0,8,19},{21,8,195},\r
+ {19,7,35},{0,8,115},{0,8,51},{0,9,198},{17,7,11},{0,8,99},{0,8,35},\r
+ {0,9,166},{0,8,3},{0,8,131},{0,8,67},{0,9,230},{16,7,7},{0,8,91},\r
+ {0,8,27},{0,9,150},{20,7,67},{0,8,123},{0,8,59},{0,9,214},{18,7,19},\r
+ {0,8,107},{0,8,43},{0,9,182},{0,8,11},{0,8,139},{0,8,75},{0,9,246},\r
+ {16,7,5},{0,8,87},{0,8,23},{64,8,0},{19,7,51},{0,8,119},{0,8,55},\r
+ {0,9,206},{17,7,15},{0,8,103},{0,8,39},{0,9,174},{0,8,7},{0,8,135},\r
+ {0,8,71},{0,9,238},{16,7,9},{0,8,95},{0,8,31},{0,9,158},{20,7,99},\r
+ {0,8,127},{0,8,63},{0,9,222},{18,7,27},{0,8,111},{0,8,47},{0,9,190},\r
+ {0,8,15},{0,8,143},{0,8,79},{0,9,254},{96,7,0},{0,8,80},{0,8,16},\r
+ {20,8,115},{18,7,31},{0,8,112},{0,8,48},{0,9,193},{16,7,10},{0,8,96},\r
+ {0,8,32},{0,9,161},{0,8,0},{0,8,128},{0,8,64},{0,9,225},{16,7,6},\r
+ {0,8,88},{0,8,24},{0,9,145},{19,7,59},{0,8,120},{0,8,56},{0,9,209},\r
+ {17,7,17},{0,8,104},{0,8,40},{0,9,177},{0,8,8},{0,8,136},{0,8,72},\r
+ {0,9,241},{16,7,4},{0,8,84},{0,8,20},{21,8,227},{19,7,43},{0,8,116},\r
+ {0,8,52},{0,9,201},{17,7,13},{0,8,100},{0,8,36},{0,9,169},{0,8,4},\r
+ {0,8,132},{0,8,68},{0,9,233},{16,7,8},{0,8,92},{0,8,28},{0,9,153},\r
+ {20,7,83},{0,8,124},{0,8,60},{0,9,217},{18,7,23},{0,8,108},{0,8,44},\r
+ {0,9,185},{0,8,12},{0,8,140},{0,8,76},{0,9,249},{16,7,3},{0,8,82},\r
+ {0,8,18},{21,8,163},{19,7,35},{0,8,114},{0,8,50},{0,9,197},{17,7,11},\r
+ {0,8,98},{0,8,34},{0,9,165},{0,8,2},{0,8,130},{0,8,66},{0,9,229},\r
+ {16,7,7},{0,8,90},{0,8,26},{0,9,149},{20,7,67},{0,8,122},{0,8,58},\r
+ {0,9,213},{18,7,19},{0,8,106},{0,8,42},{0,9,181},{0,8,10},{0,8,138},\r
+ {0,8,74},{0,9,245},{16,7,5},{0,8,86},{0,8,22},{64,8,0},{19,7,51},\r
+ {0,8,118},{0,8,54},{0,9,205},{17,7,15},{0,8,102},{0,8,38},{0,9,173},\r
+ {0,8,6},{0,8,134},{0,8,70},{0,9,237},{16,7,9},{0,8,94},{0,8,30},\r
+ {0,9,157},{20,7,99},{0,8,126},{0,8,62},{0,9,221},{18,7,27},{0,8,110},\r
+ {0,8,46},{0,9,189},{0,8,14},{0,8,142},{0,8,78},{0,9,253},{96,7,0},\r
+ {0,8,81},{0,8,17},{21,8,131},{18,7,31},{0,8,113},{0,8,49},{0,9,195},\r
+ {16,7,10},{0,8,97},{0,8,33},{0,9,163},{0,8,1},{0,8,129},{0,8,65},\r
+ {0,9,227},{16,7,6},{0,8,89},{0,8,25},{0,9,147},{19,7,59},{0,8,121},\r
+ {0,8,57},{0,9,211},{17,7,17},{0,8,105},{0,8,41},{0,9,179},{0,8,9},\r
+ {0,8,137},{0,8,73},{0,9,243},{16,7,4},{0,8,85},{0,8,21},{16,8,258},\r
+ {19,7,43},{0,8,117},{0,8,53},{0,9,203},{17,7,13},{0,8,101},{0,8,37},\r
+ {0,9,171},{0,8,5},{0,8,133},{0,8,69},{0,9,235},{16,7,8},{0,8,93},\r
+ {0,8,29},{0,9,155},{20,7,83},{0,8,125},{0,8,61},{0,9,219},{18,7,23},\r
+ {0,8,109},{0,8,45},{0,9,187},{0,8,13},{0,8,141},{0,8,77},{0,9,251},\r
+ {16,7,3},{0,8,83},{0,8,19},{21,8,195},{19,7,35},{0,8,115},{0,8,51},\r
+ {0,9,199},{17,7,11},{0,8,99},{0,8,35},{0,9,167},{0,8,3},{0,8,131},\r
+ {0,8,67},{0,9,231},{16,7,7},{0,8,91},{0,8,27},{0,9,151},{20,7,67},\r
+ {0,8,123},{0,8,59},{0,9,215},{18,7,19},{0,8,107},{0,8,43},{0,9,183},\r
+ {0,8,11},{0,8,139},{0,8,75},{0,9,247},{16,7,5},{0,8,87},{0,8,23},\r
+ {64,8,0},{19,7,51},{0,8,119},{0,8,55},{0,9,207},{17,7,15},{0,8,103},\r
+ {0,8,39},{0,9,175},{0,8,7},{0,8,135},{0,8,71},{0,9,239},{16,7,9},\r
+ {0,8,95},{0,8,31},{0,9,159},{20,7,99},{0,8,127},{0,8,63},{0,9,223},\r
+ {18,7,27},{0,8,111},{0,8,47},{0,9,191},{0,8,15},{0,8,143},{0,8,79},\r
+ {0,9,255}\r
+ };\r
+\r
+ static const code distfix[32] = {\r
+ {16,5,1},{23,5,257},{19,5,17},{27,5,4097},{17,5,5},{25,5,1025},\r
+ {21,5,65},{29,5,16385},{16,5,3},{24,5,513},{20,5,33},{28,5,8193},\r
+ {18,5,9},{26,5,2049},{22,5,129},{64,5,0},{16,5,2},{23,5,385},\r
+ {19,5,25},{27,5,6145},{17,5,7},{25,5,1537},{21,5,97},{29,5,24577},\r
+ {16,5,4},{24,5,769},{20,5,49},{28,5,12289},{18,5,13},{26,5,3073},\r
+ {22,5,193},{64,5,0}\r
+ };\r
--- /dev/null
+/* inflate.c -- zlib decompression\r
+ * Copyright (C) 1995-2005 Mark Adler\r
+ * For conditions of distribution and use, see copyright notice in zlib.h\r
+ */\r
+\r
+/*\r
+ * Change history:\r
+ *\r
+ * 1.2.beta0 24 Nov 2002\r
+ * - First version -- complete rewrite of inflate to simplify code, avoid\r
+ * creation of window when not needed, minimize use of window when it is\r
+ * needed, make inffast.c even faster, implement gzip decoding, and to\r
+ * improve code readability and style over the previous zlib inflate code\r
+ *\r
+ * 1.2.beta1 25 Nov 2002\r
+ * - Use pointers for available input and output checking in inffast.c\r
+ * - Remove input and output counters in inffast.c\r
+ * - Change inffast.c entry and loop from avail_in >= 7 to >= 6\r
+ * - Remove unnecessary second byte pull from length extra in inffast.c\r
+ * - Unroll direct copy to three copies per loop in inffast.c\r
+ *\r
+ * 1.2.beta2 4 Dec 2002\r
+ * - Change external routine names to reduce potential conflicts\r
+ * - Correct filename to inffixed.h for fixed tables in inflate.c\r
+ * - Make hbuf[] unsigned char to match parameter type in inflate.c\r
+ * - Change strm->next_out[-state->offset] to *(strm->next_out - state->offset)\r
+ * to avoid negation problem on Alphas (64 bit) in inflate.c\r
+ *\r
+ * 1.2.beta3 22 Dec 2002\r
+ * - Add comments on state->bits assertion in inffast.c\r
+ * - Add comments on op field in inftrees.h\r
+ * - Fix bug in reuse of allocated window after inflateReset()\r
+ * - Remove bit fields--back to byte structure for speed\r
+ * - Remove distance extra == 0 check in inflate_fast()--only helps for lengths\r
+ * - Change post-increments to pre-increments in inflate_fast(), PPC biased?\r
+ * - Add compile time option, POSTINC, to use post-increments instead (Intel?)\r
+ * - Make MATCH copy in inflate() much faster for when inflate_fast() not used\r
+ * - Use local copies of stream next and avail values, as well as local bit\r
+ * buffer and bit count in inflate()--for speed when inflate_fast() not used\r
+ *\r
+ * 1.2.beta4 1 Jan 2003\r
+ * - Split ptr - 257 statements in inflate_table() to avoid compiler warnings\r
+ * - Move a comment on output buffer sizes from inffast.c to inflate.c\r
+ * - Add comments in inffast.c to introduce the inflate_fast() routine\r
+ * - Rearrange window copies in inflate_fast() for speed and simplification\r
+ * - Unroll last copy for window match in inflate_fast()\r
+ * - Use local copies of window variables in inflate_fast() for speed\r
+ * - Pull out common write == 0 case for speed in inflate_fast()\r
+ * - Make op and len in inflate_fast() unsigned for consistency\r
+ * - Add FAR to lcode and dcode declarations in inflate_fast()\r
+ * - Simplified bad distance check in inflate_fast()\r
+ * - Added inflateBackInit(), inflateBack(), and inflateBackEnd() in new\r
+ * source file infback.c to provide a call-back interface to inflate for\r
+ * programs like gzip and unzip -- uses window as output buffer to avoid\r
+ * window copying\r
+ *\r
+ * 1.2.beta5 1 Jan 2003\r
+ * - Improved inflateBack() interface to allow the caller to provide initial\r
+ * input in strm.\r
+ * - Fixed stored blocks bug in inflateBack()\r
+ *\r
+ * 1.2.beta6 4 Jan 2003\r
+ * - Added comments in inffast.c on effectiveness of POSTINC\r
+ * - Typecasting all around to reduce compiler warnings\r
+ * - Changed loops from while (1) or do {} while (1) to for (;;), again to\r
+ * make compilers happy\r
+ * - Changed type of window in inflateBackInit() to unsigned char *\r
+ *\r
+ * 1.2.beta7 27 Jan 2003\r
+ * - Changed many types to unsigned or unsigned short to avoid warnings\r
+ * - Added inflateCopy() function\r
+ *\r
+ * 1.2.0 9 Mar 2003\r
+ * - Changed inflateBack() interface to provide separate opaque descriptors\r
+ * for the in() and out() functions\r
+ * - Changed inflateBack() argument and in_func typedef to swap the length\r
+ * and buffer address return values for the input function\r
+ * - Check next_in and next_out for Z_NULL on entry to inflate()\r
+ *\r
+ * The history for versions after 1.2.0 are in ChangeLog in zlib distribution.\r
+ */\r
+\r
+#include "zutil.h"\r
+#include "inftrees.h"\r
+#include "inflate.h"\r
+#include "inffast.h"\r
+\r
+#ifdef MAKEFIXED\r
+# ifndef BUILDFIXED\r
+# define BUILDFIXED\r
+# endif\r
+#endif\r
+\r
+/* function prototypes */\r
+local void fixedtables OF((struct inflate_state FAR *state));\r
+local int updatewindow OF((z_streamp strm, unsigned out));\r
+#ifdef BUILDFIXED\r
+ void makefixed OF((void));\r
+#endif\r
+local unsigned syncsearch OF((unsigned FAR *have, unsigned char FAR *buf,\r
+ unsigned len));\r
+\r
+int ZEXPORT inflateReset(strm)\r
+z_streamp strm;\r
+{\r
+ struct inflate_state FAR *state;\r
+\r
+ if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;\r
+ state = (struct inflate_state FAR *)strm->state;\r
+ strm->total_in = strm->total_out = state->total = 0;\r
+ strm->msg = Z_NULL;\r
+ strm->adler = 1; /* to support ill-conceived Java test suite */\r
+ state->mode = HEAD;\r
+ state->last = 0;\r
+ state->havedict = 0;\r
+ state->dmax = 32768U;\r
+ state->head = Z_NULL;\r
+ state->wsize = 0;\r
+ state->whave = 0;\r
+ state->write = 0;\r
+ state->hold = 0;\r
+ state->bits = 0;\r
+ state->lencode = state->distcode = state->next = state->codes;\r
+ Tracev((stderr, "inflate: reset\n"));\r
+ return Z_OK;\r
+}\r
+\r
+int ZEXPORT inflatePrime(strm, bits, value)\r
+z_streamp strm;\r
+int bits;\r
+int value;\r
+{\r
+ struct inflate_state FAR *state;\r
+\r
+ if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;\r
+ state = (struct inflate_state FAR *)strm->state;\r
+ if (bits > 16 || state->bits + bits > 32) return Z_STREAM_ERROR;\r
+ value &= (1L << bits) - 1;\r
+ state->hold += value << state->bits;\r
+ state->bits += bits;\r
+ return Z_OK;\r
+}\r
+\r
+int ZEXPORT inflateInit2_(strm, windowBits, version, stream_size)\r
+z_streamp strm;\r
+int windowBits;\r
+const char *version;\r
+int stream_size;\r
+{\r
+ struct inflate_state FAR *state;\r
+\r
+ if (version == Z_NULL || version[0] != ZLIB_VERSION[0] ||\r
+ stream_size != (int)(sizeof(z_stream)))\r
+ return Z_VERSION_ERROR;\r
+ if (strm == Z_NULL) return Z_STREAM_ERROR;\r
+ strm->msg = Z_NULL; /* in case we return an error */\r
+ if (strm->zalloc == (alloc_func)0) {\r
+ strm->zalloc = zcalloc;\r
+ strm->opaque = (voidpf)0;\r
+ }\r
+ if (strm->zfree == (free_func)0) strm->zfree = zcfree;\r
+ state = (struct inflate_state FAR *)\r
+ ZALLOC(strm, 1, sizeof(struct inflate_state));\r
+ if (state == Z_NULL) return Z_MEM_ERROR;\r
+ Tracev((stderr, "inflate: allocated\n"));\r
+ strm->state = (struct internal_state FAR *)state;\r
+ if (windowBits < 0) {\r
+ state->wrap = 0;\r
+ windowBits = -windowBits;\r
+ }\r
+ else {\r
+ state->wrap = (windowBits >> 4) + 1;\r
+#ifdef GUNZIP\r
+ if (windowBits < 48) windowBits &= 15;\r
+#endif\r
+ }\r
+ if (windowBits < 8 || windowBits > 15) {\r
+ ZFREE(strm, state);\r
+ strm->state = Z_NULL;\r
+ return Z_STREAM_ERROR;\r
+ }\r
+ state->wbits = (unsigned)windowBits;\r
+ state->window = Z_NULL;\r
+ return inflateReset(strm);\r
+}\r
+\r
+int ZEXPORT inflateInit_(strm, version, stream_size)\r
+z_streamp strm;\r
+const char *version;\r
+int stream_size;\r
+{\r
+ return inflateInit2_(strm, DEF_WBITS, version, stream_size);\r
+}\r
+\r
+/*\r
+ Return state with length and distance decoding tables and index sizes set to\r
+ fixed code decoding. Normally this returns fixed tables from inffixed.h.\r
+ If BUILDFIXED is defined, then instead this routine builds the tables the\r
+ first time it's called, and returns those tables the first time and\r
+ thereafter. This reduces the size of the code by about 2K bytes, in\r
+ exchange for a little execution time. However, BUILDFIXED should not be\r
+ used for threaded applications, since the rewriting of the tables and virgin\r
+ may not be thread-safe.\r
+ */\r
+local void fixedtables(state)\r
+struct inflate_state FAR *state;\r
+{\r
+#ifdef BUILDFIXED\r
+ static int virgin = 1;\r
+ static code *lenfix, *distfix;\r
+ static code fixed[544];\r
+\r
+ /* build fixed huffman tables if first call (may not be thread safe) */\r
+ if (virgin) {\r
+ unsigned sym, bits;\r
+ static code *next;\r
+\r
+ /* literal/length table */\r
+ sym = 0;\r
+ while (sym < 144) state->lens[sym++] = 8;\r
+ while (sym < 256) state->lens[sym++] = 9;\r
+ while (sym < 280) state->lens[sym++] = 7;\r
+ while (sym < 288) state->lens[sym++] = 8;\r
+ next = fixed;\r
+ lenfix = next;\r
+ bits = 9;\r
+ inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work);\r
+\r
+ /* distance table */\r
+ sym = 0;\r
+ while (sym < 32) state->lens[sym++] = 5;\r
+ distfix = next;\r
+ bits = 5;\r
+ inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work);\r
+\r
+ /* do this just once */\r
+ virgin = 0;\r
+ }\r
+#else /* !BUILDFIXED */\r
+# include "inffixed.h"\r
+#endif /* BUILDFIXED */\r
+ state->lencode = lenfix;\r
+ state->lenbits = 9;\r
+ state->distcode = distfix;\r
+ state->distbits = 5;\r
+}\r
+\r
+#ifdef MAKEFIXED\r
+#include <stdio.h>\r
+\r
+/*\r
+ Write out the inffixed.h that is #include'd above. Defining MAKEFIXED also\r
+ defines BUILDFIXED, so the tables are built on the fly. makefixed() writes\r
+ those tables to stdout, which would be piped to inffixed.h. A small program\r
+ can simply call makefixed to do this:\r
+\r
+ void makefixed(void);\r
+\r
+ int main(void)\r
+ {\r
+ makefixed();\r
+ return 0;\r
+ }\r
+\r
+ Then that can be linked with zlib built with MAKEFIXED defined and run:\r
+\r
+ a.out > inffixed.h\r
+ */\r
+void makefixed()\r
+{\r
+ unsigned low, size;\r
+ struct inflate_state state;\r
+\r
+ fixedtables(&state);\r
+ puts(" /* inffixed.h -- table for decoding fixed codes");\r
+ puts(" * Generated automatically by makefixed().");\r
+ puts(" */");\r
+ puts("");\r
+ puts(" /* WARNING: this file should *not* be used by applications.");\r
+ puts(" It is part of the implementation of this library and is");\r
+ puts(" subject to change. Applications should only use zlib.h.");\r
+ puts(" */");\r
+ puts("");\r
+ size = 1U << 9;\r
+ printf(" static const code lenfix[%u] = {", size);\r
+ low = 0;\r
+ for (;;) {\r
+ if ((low % 7) == 0) printf("\n ");\r
+ printf("{%u,%u,%d}", state.lencode[low].op, state.lencode[low].bits,\r
+ state.lencode[low].val);\r
+ if (++low == size) break;\r
+ putchar(',');\r
+ }\r
+ puts("\n };");\r
+ size = 1U << 5;\r
+ printf("\n static const code distfix[%u] = {", size);\r
+ low = 0;\r
+ for (;;) {\r
+ if ((low % 6) == 0) printf("\n ");\r
+ printf("{%u,%u,%d}", state.distcode[low].op, state.distcode[low].bits,\r
+ state.distcode[low].val);\r
+ if (++low == size) break;\r
+ putchar(',');\r
+ }\r
+ puts("\n };");\r
+}\r
+#endif /* MAKEFIXED */\r
+\r
+/*\r
+ Update the window with the last wsize (normally 32K) bytes written before\r
+ returning. If window does not exist yet, create it. This is only called\r
+ when a window is already in use, or when output has been written during this\r
+ inflate call, but the end of the deflate stream has not been reached yet.\r
+ It is also called to create a window for dictionary data when a dictionary\r
+ is loaded.\r
+\r
+ Providing output buffers larger than 32K to inflate() should provide a speed\r
+ advantage, since only the last 32K of output is copied to the sliding window\r
+ upon return from inflate(), and since all distances after the first 32K of\r
+ output will fall in the output data, making match copies simpler and faster.\r
+ The advantage may be dependent on the size of the processor's data caches.\r
+ */\r
+local int updatewindow(strm, out)\r
+z_streamp strm;\r
+unsigned out;\r
+{\r
+ struct inflate_state FAR *state;\r
+ unsigned copy, dist;\r
+\r
+ state = (struct inflate_state FAR *)strm->state;\r
+\r
+ /* if it hasn't been done already, allocate space for the window */\r
+ if (state->window == Z_NULL) {\r
+ state->window = (unsigned char FAR *)\r
+ ZALLOC(strm, 1U << state->wbits,\r
+ sizeof(unsigned char));\r
+ if (state->window == Z_NULL) return 1;\r
+ }\r
+\r
+ /* if window not in use yet, initialize */\r
+ if (state->wsize == 0) {\r
+ state->wsize = 1U << state->wbits;\r
+ state->write = 0;\r
+ state->whave = 0;\r
+ }\r
+\r
+ /* copy state->wsize or less output bytes into the circular window */\r
+ copy = out - strm->avail_out;\r
+ if (copy >= state->wsize) {\r
+ zmemcpy(state->window, strm->next_out - state->wsize, state->wsize);\r
+ state->write = 0;\r
+ state->whave = state->wsize;\r
+ }\r
+ else {\r
+ dist = state->wsize - state->write;\r
+ if (dist > copy) dist = copy;\r
+ zmemcpy(state->window + state->write, strm->next_out - copy, dist);\r
+ copy -= dist;\r
+ if (copy) {\r
+ zmemcpy(state->window, strm->next_out - copy, copy);\r
+ state->write = copy;\r
+ state->whave = state->wsize;\r
+ }\r
+ else {\r
+ state->write += dist;\r
+ if (state->write == state->wsize) state->write = 0;\r
+ if (state->whave < state->wsize) state->whave += dist;\r
+ }\r
+ }\r
+ return 0;\r
+}\r
+\r
+/* Macros for inflate(): */\r
+\r
+/* check function to use adler32() for zlib or crc32() for gzip */\r
+#ifdef GUNZIP\r
+# define UPDATE(check, buf, len) \\r
+ (state->flags ? crc32(check, buf, len) : adler32(check, buf, len))\r
+#else\r
+# define UPDATE(check, buf, len) adler32(check, buf, len)\r
+#endif\r
+\r
+/* check macros for header crc */\r
+#ifdef GUNZIP\r
+# define CRC2(check, word) \\r
+ do { \\r
+ hbuf[0] = (unsigned char)(word); \\r
+ hbuf[1] = (unsigned char)((word) >> 8); \\r
+ check = crc32(check, hbuf, 2); \\r
+ } while (0)\r
+\r
+# define CRC4(check, word) \\r
+ do { \\r
+ hbuf[0] = (unsigned char)(word); \\r
+ hbuf[1] = (unsigned char)((word) >> 8); \\r
+ hbuf[2] = (unsigned char)((word) >> 16); \\r
+ hbuf[3] = (unsigned char)((word) >> 24); \\r
+ check = crc32(check, hbuf, 4); \\r
+ } while (0)\r
+#endif\r
+\r
+/* Load registers with state in inflate() for speed */\r
+#define LOAD() \\r
+ do { \\r
+ put = strm->next_out; \\r
+ left = strm->avail_out; \\r
+ next = strm->next_in; \\r
+ have = strm->avail_in; \\r
+ hold = state->hold; \\r
+ bits = state->bits; \\r
+ } while (0)\r
+\r
+/* Restore state from registers in inflate() */\r
+#define RESTORE() \\r
+ do { \\r
+ strm->next_out = put; \\r
+ strm->avail_out = left; \\r
+ strm->next_in = next; \\r
+ strm->avail_in = have; \\r
+ state->hold = hold; \\r
+ state->bits = bits; \\r
+ } while (0)\r
+\r
+/* Clear the input bit accumulator */\r
+#define INITBITS() \\r
+ do { \\r
+ hold = 0; \\r
+ bits = 0; \\r
+ } while (0)\r
+\r
+/* Get a byte of input into the bit accumulator, or return from inflate()\r
+ if there is no input available. */\r
+#define PULLBYTE() \\r
+ do { \\r
+ if (have == 0) goto inf_leave; \\r
+ have--; \\r
+ hold += (unsigned long)(*next++) << bits; \\r
+ bits += 8; \\r
+ } while (0)\r
+\r
+/* Assure that there are at least n bits in the bit accumulator. If there is\r
+ not enough available input to do that, then return from inflate(). */\r
+#define NEEDBITS(n) \\r
+ do { \\r
+ while (bits < (unsigned)(n)) \\r
+ PULLBYTE(); \\r
+ } while (0)\r
+\r
+/* Return the low n bits of the bit accumulator (n < 16) */\r
+#define BITS(n) \\r
+ ((unsigned)hold & ((1U << (n)) - 1))\r
+\r
+/* Remove n bits from the bit accumulator */\r
+#define DROPBITS(n) \\r
+ do { \\r
+ hold >>= (n); \\r
+ bits -= (unsigned)(n); \\r
+ } while (0)\r
+\r
+/* Remove zero to seven bits as needed to go to a byte boundary */\r
+#define BYTEBITS() \\r
+ do { \\r
+ hold >>= bits & 7; \\r
+ bits -= bits & 7; \\r
+ } while (0)\r
+\r
+/* Reverse the bytes in a 32-bit value */\r
+#define REVERSE(q) \\r
+ ((((q) >> 24) & 0xff) + (((q) >> 8) & 0xff00) + \\r
+ (((q) & 0xff00) << 8) + (((q) & 0xff) << 24))\r
+\r
+/*\r
+ inflate() uses a state machine to process as much input data and generate as\r
+ much output data as possible before returning. The state machine is\r
+ structured roughly as follows:\r
+\r
+ for (;;) switch (state) {\r
+ ...\r
+ case STATEn:\r
+ if (not enough input data or output space to make progress)\r
+ return;\r
+ ... make progress ...\r
+ state = STATEm;\r
+ break;\r
+ ...\r
+ }\r
+\r
+ so when inflate() is called again, the same case is attempted again, and\r
+ if the appropriate resources are provided, the machine proceeds to the\r
+ next state. The NEEDBITS() macro is usually the way the state evaluates\r
+ whether it can proceed or should return. NEEDBITS() does the return if\r
+ the requested bits are not available. The typical use of the BITS macros\r
+ is:\r
+\r
+ NEEDBITS(n);\r
+ ... do something with BITS(n) ...\r
+ DROPBITS(n);\r
+\r
+ where NEEDBITS(n) either returns from inflate() if there isn't enough\r
+ input left to load n bits into the accumulator, or it continues. BITS(n)\r
+ gives the low n bits in the accumulator. When done, DROPBITS(n) drops\r
+ the low n bits off the accumulator. INITBITS() clears the accumulator\r
+ and sets the number of available bits to zero. BYTEBITS() discards just\r
+ enough bits to put the accumulator on a byte boundary. After BYTEBITS()\r
+ and a NEEDBITS(8), then BITS(8) would return the next byte in the stream.\r
+\r
+ NEEDBITS(n) uses PULLBYTE() to get an available byte of input, or to return\r
+ if there is no input available. The decoding of variable length codes uses\r
+ PULLBYTE() directly in order to pull just enough bytes to decode the next\r
+ code, and no more.\r
+\r
+ Some states loop until they get enough input, making sure that enough\r
+ state information is maintained to continue the loop where it left off\r
+ if NEEDBITS() returns in the loop. For example, want, need, and keep\r
+ would all have to actually be part of the saved state in case NEEDBITS()\r
+ returns:\r
+\r
+ case STATEw:\r
+ while (want < need) {\r
+ NEEDBITS(n);\r
+ keep[want++] = BITS(n);\r
+ DROPBITS(n);\r
+ }\r
+ state = STATEx;\r
+ case STATEx:\r
+\r
+ As shown above, if the next state is also the next case, then the break\r
+ is omitted.\r
+\r
+ A state may also return if there is not enough output space available to\r
+ complete that state. Those states are copying stored data, writing a\r
+ literal byte, and copying a matching string.\r
+\r
+ When returning, a "goto inf_leave" is used to update the total counters,\r
+ update the check value, and determine whether any progress has been made\r
+ during that inflate() call in order to return the proper return code.\r
+ Progress is defined as a change in either strm->avail_in or strm->avail_out.\r
+ When there is a window, goto inf_leave will update the window with the last\r
+ output written. If a goto inf_leave occurs in the middle of decompression\r
+ and there is no window currently, goto inf_leave will create one and copy\r
+ output to the window for the next call of inflate().\r
+\r
+ In this implementation, the flush parameter of inflate() only affects the\r
+ return code (per zlib.h). inflate() always writes as much as possible to\r
+ strm->next_out, given the space available and the provided input--the effect\r
+ documented in zlib.h of Z_SYNC_FLUSH. Furthermore, inflate() always defers\r
+ the allocation of and copying into a sliding window until necessary, which\r
+ provides the effect documented in zlib.h for Z_FINISH when the entire input\r
+ stream available. So the only thing the flush parameter actually does is:\r
+ when flush is set to Z_FINISH, inflate() cannot return Z_OK. Instead it\r
+ will return Z_BUF_ERROR if it has not reached the end of the stream.\r
+ */\r
+\r
+int ZEXPORT inflate(strm, flush)\r
+z_streamp strm;\r
+int flush;\r
+{\r
+ struct inflate_state FAR *state;\r
+ unsigned char FAR *next; /* next input */\r
+ unsigned char FAR *put; /* next output */\r
+ unsigned have, left; /* available input and output */\r
+ unsigned long hold; /* bit buffer */\r
+ unsigned bits; /* bits in bit buffer */\r
+ unsigned in, out; /* save starting available input and output */\r
+ unsigned copy; /* number of stored or match bytes to copy */\r
+ unsigned char FAR *from; /* where to copy match bytes from */\r
+ code this; /* current decoding table entry */\r
+ code last; /* parent table entry */\r
+ unsigned len; /* length to copy for repeats, bits to drop */\r
+ int ret; /* return code */\r
+#ifdef GUNZIP\r
+ unsigned char hbuf[4]; /* buffer for gzip header crc calculation */\r
+#endif\r
+ static const unsigned short order[19] = /* permutation of code lengths */\r
+ {16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15};\r
+\r
+ if (strm == Z_NULL || strm->state == Z_NULL || strm->next_out == Z_NULL ||\r
+ (strm->next_in == Z_NULL && strm->avail_in != 0))\r
+ return Z_STREAM_ERROR;\r
+\r
+ state = (struct inflate_state FAR *)strm->state;\r
+ if (state->mode == TYPE) state->mode = TYPEDO; /* skip check */\r
+ LOAD();\r
+ in = have;\r
+ out = left;\r
+ ret = Z_OK;\r
+ for (;;)\r
+ switch (state->mode) {\r
+ case HEAD:\r
+ if (state->wrap == 0) {\r
+ state->mode = TYPEDO;\r
+ break;\r
+ }\r
+ NEEDBITS(16);\r
+#ifdef GUNZIP\r
+ if ((state->wrap & 2) && hold == 0x8b1f) { /* gzip header */\r
+ state->check = crc32(0L, Z_NULL, 0);\r
+ CRC2(state->check, hold);\r
+ INITBITS();\r
+ state->mode = FLAGS;\r
+ break;\r
+ }\r
+ state->flags = 0; /* expect zlib header */\r
+ if (state->head != Z_NULL)\r
+ state->head->done = -1;\r
+ if (!(state->wrap & 1) || /* check if zlib header allowed */\r
+#else\r
+ if (\r
+#endif\r
+ ((BITS(8) << 8) + (hold >> 8)) % 31) {\r
+ strm->msg = (char *)"incorrect header check";\r
+ state->mode = BAD;\r
+ break;\r
+ }\r
+ if (BITS(4) != Z_DEFLATED) {\r
+ strm->msg = (char *)"unknown compression method";\r
+ state->mode = BAD;\r
+ break;\r
+ }\r
+ DROPBITS(4);\r
+ len = BITS(4) + 8;\r
+ if (len > state->wbits) {\r
+ strm->msg = (char *)"invalid window size";\r
+ state->mode = BAD;\r
+ break;\r
+ }\r
+ state->dmax = 1U << len;\r
+ Tracev((stderr, "inflate: zlib header ok\n"));\r
+ strm->adler = state->check = adler32(0L, Z_NULL, 0);\r
+ state->mode = hold & 0x200 ? DICTID : TYPE;\r
+ INITBITS();\r
+ break;\r
+#ifdef GUNZIP\r
+ case FLAGS:\r
+ NEEDBITS(16);\r
+ state->flags = (int)(hold);\r
+ if ((state->flags & 0xff) != Z_DEFLATED) {\r
+ strm->msg = (char *)"unknown compression method";\r
+ state->mode = BAD;\r
+ break;\r
+ }\r
+ if (state->flags & 0xe000) {\r
+ strm->msg = (char *)"unknown header flags set";\r
+ state->mode = BAD;\r
+ break;\r
+ }\r
+ if (state->head != Z_NULL)\r
+ state->head->text = (int)((hold >> 8) & 1);\r
+ if (state->flags & 0x0200) CRC2(state->check, hold);\r
+ INITBITS();\r
+ state->mode = TIME;\r
+ case TIME:\r
+ NEEDBITS(32);\r
+ if (state->head != Z_NULL)\r
+ state->head->time = hold;\r
+ if (state->flags & 0x0200) CRC4(state->check, hold);\r
+ INITBITS();\r
+ state->mode = OS;\r
+ case OS:\r
+ NEEDBITS(16);\r
+ if (state->head != Z_NULL) {\r
+ state->head->xflags = (int)(hold & 0xff);\r
+ state->head->os = (int)(hold >> 8);\r
+ }\r
+ if (state->flags & 0x0200) CRC2(state->check, hold);\r
+ INITBITS();\r
+ state->mode = EXLEN;\r
+ case EXLEN:\r
+ if (state->flags & 0x0400) {\r
+ NEEDBITS(16);\r
+ state->length = (unsigned)(hold);\r
+ if (state->head != Z_NULL)\r
+ state->head->extra_len = (unsigned)hold;\r
+ if (state->flags & 0x0200) CRC2(state->check, hold);\r
+ INITBITS();\r
+ }\r
+ else if (state->head != Z_NULL)\r
+ state->head->extra = Z_NULL;\r
+ state->mode = EXTRA;\r
+ case EXTRA:\r
+ if (state->flags & 0x0400) {\r
+ copy = state->length;\r
+ if (copy > have) copy = have;\r
+ if (copy) {\r
+ if (state->head != Z_NULL &&\r
+ state->head->extra != Z_NULL) {\r
+ len = state->head->extra_len - state->length;\r
+ zmemcpy(state->head->extra + len, next,\r
+ len + copy > state->head->extra_max ?\r
+ state->head->extra_max - len : copy);\r
+ }\r
+ if (state->flags & 0x0200)\r
+ state->check = crc32(state->check, next, copy);\r
+ have -= copy;\r
+ next += copy;\r
+ state->length -= copy;\r
+ }\r
+ if (state->length) goto inf_leave;\r
+ }\r
+ state->length = 0;\r
+ state->mode = NAME;\r
+ case NAME:\r
+ if (state->flags & 0x0800) {\r
+ if (have == 0) goto inf_leave;\r
+ copy = 0;\r
+ do {\r
+ len = (unsigned)(next[copy++]);\r
+ if (state->head != Z_NULL &&\r
+ state->head->name != Z_NULL &&\r
+ state->length < state->head->name_max)\r
+ state->head->name[state->length++] = len;\r
+ } while (len && copy < have);\r
+ if (state->flags & 0x0200)\r
+ state->check = crc32(state->check, next, copy);\r
+ have -= copy;\r
+ next += copy;\r
+ if (len) goto inf_leave;\r
+ }\r
+ else if (state->head != Z_NULL)\r
+ state->head->name = Z_NULL;\r
+ state->length = 0;\r
+ state->mode = COMMENT;\r
+ case COMMENT:\r
+ if (state->flags & 0x1000) {\r
+ if (have == 0) goto inf_leave;\r
+ copy = 0;\r
+ do {\r
+ len = (unsigned)(next[copy++]);\r
+ if (state->head != Z_NULL &&\r
+ state->head->comment != Z_NULL &&\r
+ state->length < state->head->comm_max)\r
+ state->head->comment[state->length++] = len;\r
+ } while (len && copy < have);\r
+ if (state->flags & 0x0200)\r
+ state->check = crc32(state->check, next, copy);\r
+ have -= copy;\r
+ next += copy;\r
+ if (len) goto inf_leave;\r
+ }\r
+ else if (state->head != Z_NULL)\r
+ state->head->comment = Z_NULL;\r
+ state->mode = HCRC;\r
+ case HCRC:\r
+ if (state->flags & 0x0200) {\r
+ NEEDBITS(16);\r
+ if (hold != (state->check & 0xffff)) {\r
+ strm->msg = (char *)"header crc mismatch";\r
+ state->mode = BAD;\r
+ break;\r
+ }\r
+ INITBITS();\r
+ }\r
+ if (state->head != Z_NULL) {\r
+ state->head->hcrc = (int)((state->flags >> 9) & 1);\r
+ state->head->done = 1;\r
+ }\r
+ strm->adler = state->check = crc32(0L, Z_NULL, 0);\r
+ state->mode = TYPE;\r
+ break;\r
+#endif\r
+ case DICTID:\r
+ NEEDBITS(32);\r
+ strm->adler = state->check = REVERSE(hold);\r
+ INITBITS();\r
+ state->mode = DICT;\r
+ case DICT:\r
+ if (state->havedict == 0) {\r
+ RESTORE();\r
+ return Z_NEED_DICT;\r
+ }\r
+ strm->adler = state->check = adler32(0L, Z_NULL, 0);\r
+ state->mode = TYPE;\r
+ case TYPE:\r
+ if (flush == Z_BLOCK) goto inf_leave;\r
+ case TYPEDO:\r
+ if (state->last) {\r
+ BYTEBITS();\r
+ state->mode = CHECK;\r
+ break;\r
+ }\r
+ NEEDBITS(3);\r
+ state->last = BITS(1);\r
+ DROPBITS(1);\r
+ switch (BITS(2)) {\r
+ case 0: /* stored block */\r
+ Tracev((stderr, "inflate: stored block%s\n",\r
+ state->last ? " (last)" : ""));\r
+ state->mode = STORED;\r
+ break;\r
+ case 1: /* fixed block */\r
+ fixedtables(state);\r
+ Tracev((stderr, "inflate: fixed codes block%s\n",\r
+ state->last ? " (last)" : ""));\r
+ state->mode = LEN; /* decode codes */\r
+ break;\r
+ case 2: /* dynamic block */\r
+ Tracev((stderr, "inflate: dynamic codes block%s\n",\r
+ state->last ? " (last)" : ""));\r
+ state->mode = TABLE;\r
+ break;\r
+ case 3:\r
+ strm->msg = (char *)"invalid block type";\r
+ state->mode = BAD;\r
+ }\r
+ DROPBITS(2);\r
+ break;\r
+ case STORED:\r
+ BYTEBITS(); /* go to byte boundary */\r
+ NEEDBITS(32);\r
+ if ((hold & 0xffff) != ((hold >> 16) ^ 0xffff)) {\r
+ strm->msg = (char *)"invalid stored block lengths";\r
+ state->mode = BAD;\r
+ break;\r
+ }\r
+ state->length = (unsigned)hold & 0xffff;\r
+ Tracev((stderr, "inflate: stored length %u\n",\r
+ state->length));\r
+ INITBITS();\r
+ state->mode = COPY;\r
+ case COPY:\r
+ copy = state->length;\r
+ if (copy) {\r
+ if (copy > have) copy = have;\r
+ if (copy > left) copy = left;\r
+ if (copy == 0) goto inf_leave;\r
+ zmemcpy(put, next, copy);\r
+ have -= copy;\r
+ next += copy;\r
+ left -= copy;\r
+ put += copy;\r
+ state->length -= copy;\r
+ break;\r
+ }\r
+ Tracev((stderr, "inflate: stored end\n"));\r
+ state->mode = TYPE;\r
+ break;\r
+ case TABLE:\r
+ NEEDBITS(14);\r
+ state->nlen = BITS(5) + 257;\r
+ DROPBITS(5);\r
+ state->ndist = BITS(5) + 1;\r
+ DROPBITS(5);\r
+ state->ncode = BITS(4) + 4;\r
+ DROPBITS(4);\r
+#ifndef PKZIP_BUG_WORKAROUND\r
+ if (state->nlen > 286 || state->ndist > 30) {\r
+ strm->msg = (char *)"too many length or distance symbols";\r
+ state->mode = BAD;\r
+ break;\r
+ }\r
+#endif\r
+ Tracev((stderr, "inflate: table sizes ok\n"));\r
+ state->have = 0;\r
+ state->mode = LENLENS;\r
+ case LENLENS:\r
+ while (state->have < state->ncode) {\r
+ NEEDBITS(3);\r
+ state->lens[order[state->have++]] = (unsigned short)BITS(3);\r
+ DROPBITS(3);\r
+ }\r
+ while (state->have < 19)\r
+ state->lens[order[state->have++]] = 0;\r
+ state->next = state->codes;\r
+ state->lencode = (code const FAR *)(state->next);\r
+ state->lenbits = 7;\r
+ ret = inflate_table(CODES, state->lens, 19, &(state->next),\r
+ &(state->lenbits), state->work);\r
+ if (ret) {\r
+ strm->msg = (char *)"invalid code lengths set";\r
+ state->mode = BAD;\r
+ break;\r
+ }\r
+ Tracev((stderr, "inflate: code lengths ok\n"));\r
+ state->have = 0;\r
+ state->mode = CODELENS;\r
+ case CODELENS:\r
+ while (state->have < state->nlen + state->ndist) {\r
+ for (;;) {\r
+ this = state->lencode[BITS(state->lenbits)];\r
+ if ((unsigned)(this.bits) <= bits) break;\r
+ PULLBYTE();\r
+ }\r
+ if (this.val < 16) {\r
+ NEEDBITS(this.bits);\r
+ DROPBITS(this.bits);\r
+ state->lens[state->have++] = this.val;\r
+ }\r
+ else {\r
+ if (this.val == 16) {\r
+ NEEDBITS(this.bits + 2);\r
+ DROPBITS(this.bits);\r
+ if (state->have == 0) {\r
+ strm->msg = (char *)"invalid bit length repeat";\r
+ state->mode = BAD;\r
+ break;\r
+ }\r
+ len = state->lens[state->have - 1];\r
+ copy = 3 + BITS(2);\r
+ DROPBITS(2);\r
+ }\r
+ else if (this.val == 17) {\r
+ NEEDBITS(this.bits + 3);\r
+ DROPBITS(this.bits);\r
+ len = 0;\r
+ copy = 3 + BITS(3);\r
+ DROPBITS(3);\r
+ }\r
+ else {\r
+ NEEDBITS(this.bits + 7);\r
+ DROPBITS(this.bits);\r
+ len = 0;\r
+ copy = 11 + BITS(7);\r
+ DROPBITS(7);\r
+ }\r
+ if (state->have + copy > state->nlen + state->ndist) {\r
+ strm->msg = (char *)"invalid bit length repeat";\r
+ state->mode = BAD;\r
+ break;\r
+ }\r
+ while (copy--)\r
+ state->lens[state->have++] = (unsigned short)len;\r
+ }\r
+ }\r
+\r
+ /* handle error breaks in while */\r
+ if (state->mode == BAD) break;\r
+\r
+ /* build code tables */\r
+ state->next = state->codes;\r
+ state->lencode = (code const FAR *)(state->next);\r
+ state->lenbits = 9;\r
+ ret = inflate_table(LENS, state->lens, state->nlen, &(state->next),\r
+ &(state->lenbits), state->work);\r
+ if (ret) {\r
+ strm->msg = (char *)"invalid literal/lengths set";\r
+ state->mode = BAD;\r
+ break;\r
+ }\r
+ state->distcode = (code const FAR *)(state->next);\r
+ state->distbits = 6;\r
+ ret = inflate_table(DISTS, state->lens + state->nlen, state->ndist,\r
+ &(state->next), &(state->distbits), state->work);\r
+ if (ret) {\r
+ strm->msg = (char *)"invalid distances set";\r
+ state->mode = BAD;\r
+ break;\r
+ }\r
+ Tracev((stderr, "inflate: codes ok\n"));\r
+ state->mode = LEN;\r
+ case LEN:\r
+ if (have >= 6 && left >= 258) {\r
+ RESTORE();\r
+ inflate_fast(strm, out);\r
+ LOAD();\r
+ break;\r
+ }\r
+ for (;;) {\r
+ this = state->lencode[BITS(state->lenbits)];\r
+ if ((unsigned)(this.bits) <= bits) break;\r
+ PULLBYTE();\r
+ }\r
+ if (this.op && (this.op & 0xf0) == 0) {\r
+ last = this;\r
+ for (;;) {\r
+ this = state->lencode[last.val +\r
+ (BITS(last.bits + last.op) >> last.bits)];\r
+ if ((unsigned)(last.bits + this.bits) <= bits) break;\r
+ PULLBYTE();\r
+ }\r
+ DROPBITS(last.bits);\r
+ }\r
+ DROPBITS(this.bits);\r
+ state->length = (unsigned)this.val;\r
+ if ((int)(this.op) == 0) {\r
+ Tracevv((stderr, this.val >= 0x20 && this.val < 0x7f ?\r
+ "inflate: literal '%c'\n" :\r
+ "inflate: literal 0x%02x\n", this.val));\r
+ state->mode = LIT;\r
+ break;\r
+ }\r
+ if (this.op & 32) {\r
+ Tracevv((stderr, "inflate: end of block\n"));\r
+ state->mode = TYPE;\r
+ break;\r
+ }\r
+ if (this.op & 64) {\r
+ strm->msg = (char *)"invalid literal/length code";\r
+ state->mode = BAD;\r
+ break;\r
+ }\r
+ state->extra = (unsigned)(this.op) & 15;\r
+ state->mode = LENEXT;\r
+ case LENEXT:\r
+ if (state->extra) {\r
+ NEEDBITS(state->extra);\r
+ state->length += BITS(state->extra);\r
+ DROPBITS(state->extra);\r
+ }\r
+ Tracevv((stderr, "inflate: length %u\n", state->length));\r
+ state->mode = DIST;\r
+ case DIST:\r
+ for (;;) {\r
+ this = state->distcode[BITS(state->distbits)];\r
+ if ((unsigned)(this.bits) <= bits) break;\r
+ PULLBYTE();\r
+ }\r
+ if ((this.op & 0xf0) == 0) {\r
+ last = this;\r
+ for (;;) {\r
+ this = state->distcode[last.val +\r
+ (BITS(last.bits + last.op) >> last.bits)];\r
+ if ((unsigned)(last.bits + this.bits) <= bits) break;\r
+ PULLBYTE();\r
+ }\r
+ DROPBITS(last.bits);\r
+ }\r
+ DROPBITS(this.bits);\r
+ if (this.op & 64) {\r
+ strm->msg = (char *)"invalid distance code";\r
+ state->mode = BAD;\r
+ break;\r
+ }\r
+ state->offset = (unsigned)this.val;\r
+ state->extra = (unsigned)(this.op) & 15;\r
+ state->mode = DISTEXT;\r
+ case DISTEXT:\r
+ if (state->extra) {\r
+ NEEDBITS(state->extra);\r
+ state->offset += BITS(state->extra);\r
+ DROPBITS(state->extra);\r
+ }\r
+#ifdef INFLATE_STRICT\r
+ if (state->offset > state->dmax) {\r
+ strm->msg = (char *)"invalid distance too far back";\r
+ state->mode = BAD;\r
+ break;\r
+ }\r
+#endif\r
+ if (state->offset > state->whave + out - left) {\r
+ strm->msg = (char *)"invalid distance too far back";\r
+ state->mode = BAD;\r
+ break;\r
+ }\r
+ Tracevv((stderr, "inflate: distance %u\n", state->offset));\r
+ state->mode = MATCH;\r
+ case MATCH:\r
+ if (left == 0) goto inf_leave;\r
+ copy = out - left;\r
+ if (state->offset > copy) { /* copy from window */\r
+ copy = state->offset - copy;\r
+ if (copy > state->write) {\r
+ copy -= state->write;\r
+ from = state->window + (state->wsize - copy);\r
+ }\r
+ else\r
+ from = state->window + (state->write - copy);\r
+ if (copy > state->length) copy = state->length;\r
+ }\r
+ else { /* copy from output */\r
+ from = put - state->offset;\r
+ copy = state->length;\r
+ }\r
+ if (copy > left) copy = left;\r
+ left -= copy;\r
+ state->length -= copy;\r
+ do {\r
+ *put++ = *from++;\r
+ } while (--copy);\r
+ if (state->length == 0) state->mode = LEN;\r
+ break;\r
+ case LIT:\r
+ if (left == 0) goto inf_leave;\r
+ *put++ = (unsigned char)(state->length);\r
+ left--;\r
+ state->mode = LEN;\r
+ break;\r
+ case CHECK:\r
+ if (state->wrap) {\r
+ NEEDBITS(32);\r
+ out -= left;\r
+ strm->total_out += out;\r
+ state->total += out;\r
+ if (out)\r
+ strm->adler = state->check =\r
+ UPDATE(state->check, put - out, out);\r
+ out = left;\r
+ if ((\r
+#ifdef GUNZIP\r
+ state->flags ? hold :\r
+#endif\r
+ REVERSE(hold)) != state->check) {\r
+ strm->msg = (char *)"incorrect data check";\r
+ state->mode = BAD;\r
+ break;\r
+ }\r
+ INITBITS();\r
+ Tracev((stderr, "inflate: check matches trailer\n"));\r
+ }\r
+#ifdef GUNZIP\r
+ state->mode = LENGTH;\r
+ case LENGTH:\r
+ if (state->wrap && state->flags) {\r
+ NEEDBITS(32);\r
+ if (hold != (state->total & 0xffffffffUL)) {\r
+ strm->msg = (char *)"incorrect length check";\r
+ state->mode = BAD;\r
+ break;\r
+ }\r
+ INITBITS();\r
+ Tracev((stderr, "inflate: length matches trailer\n"));\r
+ }\r
+#endif\r
+ state->mode = DONE;\r
+ case DONE:\r
+ ret = Z_STREAM_END;\r
+ goto inf_leave;\r
+ case BAD:\r
+ ret = Z_DATA_ERROR;\r
+ goto inf_leave;\r
+ case MEM:\r
+ return Z_MEM_ERROR;\r
+ case SYNC:\r
+ default:\r
+ return Z_STREAM_ERROR;\r
+ }\r
+\r
+ /*\r
+ Return from inflate(), updating the total counts and the check value.\r
+ If there was no progress during the inflate() call, return a buffer\r
+ error. Call updatewindow() to create and/or update the window state.\r
+ Note: a memory error from inflate() is non-recoverable.\r
+ */\r
+ inf_leave:\r
+ RESTORE();\r
+ if (state->wsize || (state->mode < CHECK && out != strm->avail_out))\r
+ if (updatewindow(strm, out)) {\r
+ state->mode = MEM;\r
+ return Z_MEM_ERROR;\r
+ }\r
+ in -= strm->avail_in;\r
+ out -= strm->avail_out;\r
+ strm->total_in += in;\r
+ strm->total_out += out;\r
+ state->total += out;\r
+ if (state->wrap && out)\r
+ strm->adler = state->check =\r
+ UPDATE(state->check, strm->next_out - out, out);\r
+ strm->data_type = state->bits + (state->last ? 64 : 0) +\r
+ (state->mode == TYPE ? 128 : 0);\r
+ if (((in == 0 && out == 0) || flush == Z_FINISH) && ret == Z_OK)\r
+ ret = Z_BUF_ERROR;\r
+ return ret;\r
+}\r
+\r
+int ZEXPORT inflateEnd(strm)\r
+z_streamp strm;\r
+{\r
+ struct inflate_state FAR *state;\r
+ if (strm == Z_NULL || strm->state == Z_NULL || strm->zfree == (free_func)0)\r
+ return Z_STREAM_ERROR;\r
+ state = (struct inflate_state FAR *)strm->state;\r
+ if (state->window != Z_NULL) ZFREE(strm, state->window);\r
+ ZFREE(strm, strm->state);\r
+ strm->state = Z_NULL;\r
+ Tracev((stderr, "inflate: end\n"));\r
+ return Z_OK;\r
+}\r
+\r
+int ZEXPORT inflateSetDictionary(strm, dictionary, dictLength)\r
+z_streamp strm;\r
+const Bytef *dictionary;\r
+uInt dictLength;\r
+{\r
+ struct inflate_state FAR *state;\r
+ unsigned long id;\r
+\r
+ /* check state */\r
+ if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;\r
+ state = (struct inflate_state FAR *)strm->state;\r
+ if (state->wrap != 0 && state->mode != DICT)\r
+ return Z_STREAM_ERROR;\r
+\r
+ /* check for correct dictionary id */\r
+ if (state->mode == DICT) {\r
+ id = adler32(0L, Z_NULL, 0);\r
+ id = adler32(id, dictionary, dictLength);\r
+ if (id != state->check)\r
+ return Z_DATA_ERROR;\r
+ }\r
+\r
+ /* copy dictionary to window */\r
+ if (updatewindow(strm, strm->avail_out)) {\r
+ state->mode = MEM;\r
+ return Z_MEM_ERROR;\r
+ }\r
+ if (dictLength > state->wsize) {\r
+ zmemcpy(state->window, dictionary + dictLength - state->wsize,\r
+ state->wsize);\r
+ state->whave = state->wsize;\r
+ }\r
+ else {\r
+ zmemcpy(state->window + state->wsize - dictLength, dictionary,\r
+ dictLength);\r
+ state->whave = dictLength;\r
+ }\r
+ state->havedict = 1;\r
+ Tracev((stderr, "inflate: dictionary set\n"));\r
+ return Z_OK;\r
+}\r
+\r
+int ZEXPORT inflateGetHeader(strm, head)\r
+z_streamp strm;\r
+gz_headerp head;\r
+{\r
+ struct inflate_state FAR *state;\r
+\r
+ /* check state */\r
+ if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;\r
+ state = (struct inflate_state FAR *)strm->state;\r
+ if ((state->wrap & 2) == 0) return Z_STREAM_ERROR;\r
+\r
+ /* save header structure */\r
+ state->head = head;\r
+ head->done = 0;\r
+ return Z_OK;\r
+}\r
+\r
+/*\r
+ Search buf[0..len-1] for the pattern: 0, 0, 0xff, 0xff. Return when found\r
+ or when out of input. When called, *have is the number of pattern bytes\r
+ found in order so far, in 0..3. On return *have is updated to the new\r
+ state. If on return *have equals four, then the pattern was found and the\r
+ return value is how many bytes were read including the last byte of the\r
+ pattern. If *have is less than four, then the pattern has not been found\r
+ yet and the return value is len. In the latter case, syncsearch() can be\r
+ called again with more data and the *have state. *have is initialized to\r
+ zero for the first call.\r
+ */\r
+local unsigned syncsearch(have, buf, len)\r
+unsigned FAR *have;\r
+unsigned char FAR *buf;\r
+unsigned len;\r
+{\r
+ unsigned got;\r
+ unsigned next;\r
+\r
+ got = *have;\r
+ next = 0;\r
+ while (next < len && got < 4) {\r
+ if ((int)(buf[next]) == (got < 2 ? 0 : 0xff))\r
+ got++;\r
+ else if (buf[next])\r
+ got = 0;\r
+ else\r
+ got = 4 - got;\r
+ next++;\r
+ }\r
+ *have = got;\r
+ return next;\r
+}\r
+\r
+int ZEXPORT inflateSync(strm)\r
+z_streamp strm;\r
+{\r
+ unsigned len; /* number of bytes to look at or looked at */\r
+ unsigned long in, out; /* temporary to save total_in and total_out */\r
+ unsigned char buf[4]; /* to restore bit buffer to byte string */\r
+ struct inflate_state FAR *state;\r
+\r
+ /* check parameters */\r
+ if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;\r
+ state = (struct inflate_state FAR *)strm->state;\r
+ if (strm->avail_in == 0 && state->bits < 8) return Z_BUF_ERROR;\r
+\r
+ /* if first time, start search in bit buffer */\r
+ if (state->mode != SYNC) {\r
+ state->mode = SYNC;\r
+ state->hold <<= state->bits & 7;\r
+ state->bits -= state->bits & 7;\r
+ len = 0;\r
+ while (state->bits >= 8) {\r
+ buf[len++] = (unsigned char)(state->hold);\r
+ state->hold >>= 8;\r
+ state->bits -= 8;\r
+ }\r
+ state->have = 0;\r
+ syncsearch(&(state->have), buf, len);\r
+ }\r
+\r
+ /* search available input */\r
+ len = syncsearch(&(state->have), strm->next_in, strm->avail_in);\r
+ strm->avail_in -= len;\r
+ strm->next_in += len;\r
+ strm->total_in += len;\r
+\r
+ /* return no joy or set up to restart inflate() on a new block */\r
+ if (state->have != 4) return Z_DATA_ERROR;\r
+ in = strm->total_in; out = strm->total_out;\r
+ inflateReset(strm);\r
+ strm->total_in = in; strm->total_out = out;\r
+ state->mode = TYPE;\r
+ return Z_OK;\r
+}\r
+\r
+/*\r
+ Returns true if inflate is currently at the end of a block generated by\r
+ Z_SYNC_FLUSH or Z_FULL_FLUSH. This function is used by one PPP\r
+ implementation to provide an additional safety check. PPP uses\r
+ Z_SYNC_FLUSH but removes the length bytes of the resulting empty stored\r
+ block. When decompressing, PPP checks that at the end of input packet,\r
+ inflate is waiting for these length bytes.\r
+ */\r
+int ZEXPORT inflateSyncPoint(strm)\r
+z_streamp strm;\r
+{\r
+ struct inflate_state FAR *state;\r
+\r
+ if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;\r
+ state = (struct inflate_state FAR *)strm->state;\r
+ return state->mode == STORED && state->bits == 0;\r
+}\r
+\r
+int ZEXPORT inflateCopy(dest, source)\r
+z_streamp dest;\r
+z_streamp source;\r
+{\r
+ struct inflate_state FAR *state;\r
+ struct inflate_state FAR *copy;\r
+ unsigned char FAR *window;\r
+ unsigned wsize;\r
+\r
+ /* check input */\r
+ if (dest == Z_NULL || source == Z_NULL || source->state == Z_NULL ||\r
+ source->zalloc == (alloc_func)0 || source->zfree == (free_func)0)\r
+ return Z_STREAM_ERROR;\r
+ state = (struct inflate_state FAR *)source->state;\r
+\r
+ /* allocate space */\r
+ copy = (struct inflate_state FAR *)\r
+ ZALLOC(source, 1, sizeof(struct inflate_state));\r
+ if (copy == Z_NULL) return Z_MEM_ERROR;\r
+ window = Z_NULL;\r
+ if (state->window != Z_NULL) {\r
+ window = (unsigned char FAR *)\r
+ ZALLOC(source, 1U << state->wbits, sizeof(unsigned char));\r
+ if (window == Z_NULL) {\r
+ ZFREE(source, copy);\r
+ return Z_MEM_ERROR;\r
+ }\r
+ }\r
+\r
+ /* copy state */\r
+ zmemcpy(dest, source, sizeof(z_stream));\r
+ zmemcpy(copy, state, sizeof(struct inflate_state));\r
+ if (state->lencode >= state->codes &&\r
+ state->lencode <= state->codes + ENOUGH - 1) {\r
+ copy->lencode = copy->codes + (state->lencode - state->codes);\r
+ copy->distcode = copy->codes + (state->distcode - state->codes);\r
+ }\r
+ copy->next = copy->codes + (state->next - state->codes);\r
+ if (window != Z_NULL) {\r
+ wsize = 1U << state->wbits;\r
+ zmemcpy(window, state->window, wsize);\r
+ }\r
+ copy->window = window;\r
+ dest->state = (struct internal_state FAR *)copy;\r
+ return Z_OK;\r
+}\r
--- /dev/null
+/* inflate.h -- internal inflate state definition\r
+ * Copyright (C) 1995-2004 Mark Adler\r
+ * For conditions of distribution and use, see copyright notice in zlib.h\r
+ */\r
+\r
+/* WARNING: this file should *not* be used by applications. It is\r
+ part of the implementation of the compression library and is\r
+ subject to change. Applications should only use zlib.h.\r
+ */\r
+\r
+/* define NO_GZIP when compiling if you want to disable gzip header and\r
+ trailer decoding by inflate(). NO_GZIP would be used to avoid linking in\r
+ the crc code when it is not needed. For shared libraries, gzip decoding\r
+ should be left enabled. */\r
+#ifndef NO_GZIP\r
+# define GUNZIP\r
+#endif\r
+\r
+/* Possible inflate modes between inflate() calls */\r
+typedef enum {\r
+ HEAD, /* i: waiting for magic header */\r
+ FLAGS, /* i: waiting for method and flags (gzip) */\r
+ TIME, /* i: waiting for modification time (gzip) */\r
+ OS, /* i: waiting for extra flags and operating system (gzip) */\r
+ EXLEN, /* i: waiting for extra length (gzip) */\r
+ EXTRA, /* i: waiting for extra bytes (gzip) */\r
+ NAME, /* i: waiting for end of file name (gzip) */\r
+ COMMENT, /* i: waiting for end of comment (gzip) */\r
+ HCRC, /* i: waiting for header crc (gzip) */\r
+ DICTID, /* i: waiting for dictionary check value */\r
+ DICT, /* waiting for inflateSetDictionary() call */\r
+ TYPE, /* i: waiting for type bits, including last-flag bit */\r
+ TYPEDO, /* i: same, but skip check to exit inflate on new block */\r
+ STORED, /* i: waiting for stored size (length and complement) */\r
+ COPY, /* i/o: waiting for input or output to copy stored block */\r
+ TABLE, /* i: waiting for dynamic block table lengths */\r
+ LENLENS, /* i: waiting for code length code lengths */\r
+ CODELENS, /* i: waiting for length/lit and distance code lengths */\r
+ LEN, /* i: waiting for length/lit code */\r
+ LENEXT, /* i: waiting for length extra bits */\r
+ DIST, /* i: waiting for distance code */\r
+ DISTEXT, /* i: waiting for distance extra bits */\r
+ MATCH, /* o: waiting for output space to copy string */\r
+ LIT, /* o: waiting for output space to write literal */\r
+ CHECK, /* i: waiting for 32-bit check value */\r
+ LENGTH, /* i: waiting for 32-bit length (gzip) */\r
+ DONE, /* finished check, done -- remain here until reset */\r
+ BAD, /* got a data error -- remain here until reset */\r
+ MEM, /* got an inflate() memory error -- remain here until reset */\r
+ SYNC /* looking for synchronization bytes to restart inflate() */\r
+} inflate_mode;\r
+\r
+/*\r
+ State transitions between above modes -\r
+\r
+ (most modes can go to the BAD or MEM mode -- not shown for clarity)\r
+\r
+ Process header:\r
+ HEAD -> (gzip) or (zlib)\r
+ (gzip) -> FLAGS -> TIME -> OS -> EXLEN -> EXTRA -> NAME\r
+ NAME -> COMMENT -> HCRC -> TYPE\r
+ (zlib) -> DICTID or TYPE\r
+ DICTID -> DICT -> TYPE\r
+ Read deflate blocks:\r
+ TYPE -> STORED or TABLE or LEN or CHECK\r
+ STORED -> COPY -> TYPE\r
+ TABLE -> LENLENS -> CODELENS -> LEN\r
+ Read deflate codes:\r
+ LEN -> LENEXT or LIT or TYPE\r
+ LENEXT -> DIST -> DISTEXT -> MATCH -> LEN\r
+ LIT -> LEN\r
+ Process trailer:\r
+ CHECK -> LENGTH -> DONE\r
+ */\r
+\r
+/* state maintained between inflate() calls. Approximately 7K bytes. */\r
+struct inflate_state {\r
+ inflate_mode mode; /* current inflate mode */\r
+ int last; /* true if processing last block */\r
+ int wrap; /* bit 0 true for zlib, bit 1 true for gzip */\r
+ int havedict; /* true if dictionary provided */\r
+ int flags; /* gzip header method and flags (0 if zlib) */\r
+ unsigned dmax; /* zlib header max distance (INFLATE_STRICT) */\r
+ unsigned long check; /* protected copy of check value */\r
+ unsigned long total; /* protected copy of output count */\r
+ gz_headerp head; /* where to save gzip header information */\r
+ /* sliding window */\r
+ unsigned wbits; /* log base 2 of requested window size */\r
+ unsigned wsize; /* window size or zero if not using window */\r
+ unsigned whave; /* valid bytes in the window */\r
+ unsigned write; /* window write index */\r
+ unsigned char FAR *window; /* allocated sliding window, if needed */\r
+ /* bit accumulator */\r
+ unsigned long hold; /* input bit accumulator */\r
+ unsigned bits; /* number of bits in "in" */\r
+ /* for string and stored block copying */\r
+ unsigned length; /* literal or length of data to copy */\r
+ unsigned offset; /* distance back to copy string from */\r
+ /* for table and code decoding */\r
+ unsigned extra; /* extra bits needed */\r
+ /* fixed and dynamic code tables */\r
+ code const FAR *lencode; /* starting table for length/literal codes */\r
+ code const FAR *distcode; /* starting table for distance codes */\r
+ unsigned lenbits; /* index bits for lencode */\r
+ unsigned distbits; /* index bits for distcode */\r
+ /* dynamic table building */\r
+ unsigned ncode; /* number of code length code lengths */\r
+ unsigned nlen; /* number of length code lengths */\r
+ unsigned ndist; /* number of distance code lengths */\r
+ unsigned have; /* number of code lengths in lens[] */\r
+ code FAR *next; /* next available space in codes[] */\r
+ unsigned short lens[320]; /* temporary storage for code lengths */\r
+ unsigned short work[288]; /* work area for code table building */\r
+ code codes[ENOUGH]; /* space for code tables */\r
+};\r
--- /dev/null
+/* inftrees.c -- generate Huffman trees for efficient decoding\r
+ * Copyright (C) 1995-2005 Mark Adler\r
+ * For conditions of distribution and use, see copyright notice in zlib.h\r
+ */\r
+\r
+#include "zutil.h"\r
+#include "inftrees.h"\r
+\r
+#define MAXBITS 15\r
+\r
+const char inflate_copyright[] =\r
+ " inflate 1.2.3 Copyright 1995-2005 Mark Adler ";\r
+/*\r
+ If you use the zlib library in a product, an acknowledgment is welcome\r
+ in the documentation of your product. If for some reason you cannot\r
+ include such an acknowledgment, I would appreciate that you keep this\r
+ copyright string in the executable of your product.\r
+ */\r
+\r
+/*\r
+ Build a set of tables to decode the provided canonical Huffman code.\r
+ The code lengths are lens[0..codes-1]. The result starts at *table,\r
+ whose indices are 0..2^bits-1. work is a writable array of at least\r
+ lens shorts, which is used as a work area. type is the type of code\r
+ to be generated, CODES, LENS, or DISTS. On return, zero is success,\r
+ -1 is an invalid code, and +1 means that ENOUGH isn't enough. table\r
+ on return points to the next available entry's address. bits is the\r
+ requested root table index bits, and on return it is the actual root\r
+ table index bits. It will differ if the request is greater than the\r
+ longest code or if it is less than the shortest code.\r
+ */\r
+int inflate_table(type, lens, codes, table, bits, work)\r
+codetype type;\r
+unsigned short FAR *lens;\r
+unsigned codes;\r
+code FAR * FAR *table;\r
+unsigned FAR *bits;\r
+unsigned short FAR *work;\r
+{\r
+ unsigned len; /* a code's length in bits */\r
+ unsigned sym; /* index of code symbols */\r
+ unsigned min, max; /* minimum and maximum code lengths */\r
+ unsigned root; /* number of index bits for root table */\r
+ unsigned curr; /* number of index bits for current table */\r
+ unsigned drop; /* code bits to drop for sub-table */\r
+ int left; /* number of prefix codes available */\r
+ unsigned used; /* code entries in table used */\r
+ unsigned huff; /* Huffman code */\r
+ unsigned incr; /* for incrementing code, index */\r
+ unsigned fill; /* index for replicating entries */\r
+ unsigned low; /* low bits for current root entry */\r
+ unsigned mask; /* mask for low root bits */\r
+ code this; /* table entry for duplication */\r
+ code FAR *next; /* next available space in table */\r
+ const unsigned short FAR *base; /* base value table to use */\r
+ const unsigned short FAR *extra; /* extra bits table to use */\r
+ int end; /* use base and extra for symbol > end */\r
+ unsigned short count[MAXBITS+1]; /* number of codes of each length */\r
+ unsigned short offs[MAXBITS+1]; /* offsets in table for each length */\r
+ static const unsigned short lbase[31] = { /* Length codes 257..285 base */\r
+ 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31,\r
+ 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0};\r
+ static const unsigned short lext[31] = { /* Length codes 257..285 extra */\r
+ 16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18,\r
+ 19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 201, 196};\r
+ static const unsigned short dbase[32] = { /* Distance codes 0..29 base */\r
+ 1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193,\r
+ 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145,\r
+ 8193, 12289, 16385, 24577, 0, 0};\r
+ static const unsigned short dext[32] = { /* Distance codes 0..29 extra */\r
+ 16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22,\r
+ 23, 23, 24, 24, 25, 25, 26, 26, 27, 27,\r
+ 28, 28, 29, 29, 64, 64};\r
+\r
+ /*\r
+ Process a set of code lengths to create a canonical Huffman code. The\r
+ code lengths are lens[0..codes-1]. Each length corresponds to the\r
+ symbols 0..codes-1. The Huffman code is generated by first sorting the\r
+ symbols by length from short to long, and retaining the symbol order\r
+ for codes with equal lengths. Then the code starts with all zero bits\r
+ for the first code of the shortest length, and the codes are integer\r
+ increments for the same length, and zeros are appended as the length\r
+ increases. For the deflate format, these bits are stored backwards\r
+ from their more natural integer increment ordering, and so when the\r
+ decoding tables are built in the large loop below, the integer codes\r
+ are incremented backwards.\r
+\r
+ This routine assumes, but does not check, that all of the entries in\r
+ lens[] are in the range 0..MAXBITS. The caller must assure this.\r
+ 1..MAXBITS is interpreted as that code length. zero means that that\r
+ symbol does not occur in this code.\r
+\r
+ The codes are sorted by computing a count of codes for each length,\r
+ creating from that a table of starting indices for each length in the\r
+ sorted table, and then entering the symbols in order in the sorted\r
+ table. The sorted table is work[], with that space being provided by\r
+ the caller.\r
+\r
+ The length counts are used for other purposes as well, i.e. finding\r
+ the minimum and maximum length codes, determining if there are any\r
+ codes at all, checking for a valid set of lengths, and looking ahead\r
+ at length counts to determine sub-table sizes when building the\r
+ decoding tables.\r
+ */\r
+\r
+ /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */\r
+ for (len = 0; len <= MAXBITS; len++)\r
+ count[len] = 0;\r
+ for (sym = 0; sym < codes; sym++)\r
+ count[lens[sym]]++;\r
+\r
+ /* bound code lengths, force root to be within code lengths */\r
+ root = *bits;\r
+ for (max = MAXBITS; max >= 1; max--)\r
+ if (count[max] != 0) break;\r
+ if (root > max) root = max;\r
+ if (max == 0) { /* no symbols to code at all */\r
+ this.op = (unsigned char)64; /* invalid code marker */\r
+ this.bits = (unsigned char)1;\r
+ this.val = (unsigned short)0;\r
+ *(*table)++ = this; /* make a table to force an error */\r
+ *(*table)++ = this;\r
+ *bits = 1;\r
+ return 0; /* no symbols, but wait for decoding to report error */\r
+ }\r
+ for (min = 1; min <= MAXBITS; min++)\r
+ if (count[min] != 0) break;\r
+ if (root < min) root = min;\r
+\r
+ /* check for an over-subscribed or incomplete set of lengths */\r
+ left = 1;\r
+ for (len = 1; len <= MAXBITS; len++) {\r
+ left <<= 1;\r
+ left -= count[len];\r
+ if (left < 0) return -1; /* over-subscribed */\r
+ }\r
+ if (left > 0 && (type == CODES || max != 1))\r
+ return -1; /* incomplete set */\r
+\r
+ /* generate offsets into symbol table for each length for sorting */\r
+ offs[1] = 0;\r
+ for (len = 1; len < MAXBITS; len++)\r
+ offs[len + 1] = offs[len] + count[len];\r
+\r
+ /* sort symbols by length, by symbol order within each length */\r
+ for (sym = 0; sym < codes; sym++)\r
+ if (lens[sym] != 0) work[offs[lens[sym]]++] = (unsigned short)sym;\r
+\r
+ /*\r
+ Create and fill in decoding tables. In this loop, the table being\r
+ filled is at next and has curr index bits. The code being used is huff\r
+ with length len. That code is converted to an index by dropping drop\r
+ bits off of the bottom. For codes where len is less than drop + curr,\r
+ those top drop + curr - len bits are incremented through all values to\r
+ fill the table with replicated entries.\r
+\r
+ root is the number of index bits for the root table. When len exceeds\r
+ root, sub-tables are created pointed to by the root entry with an index\r
+ of the low root bits of huff. This is saved in low to check for when a\r
+ new sub-table should be started. drop is zero when the root table is\r
+ being filled, and drop is root when sub-tables are being filled.\r
+\r
+ When a new sub-table is needed, it is necessary to look ahead in the\r
+ code lengths to determine what size sub-table is needed. The length\r
+ counts are used for this, and so count[] is decremented as codes are\r
+ entered in the tables.\r
+\r
+ used keeps track of how many table entries have been allocated from the\r
+ provided *table space. It is checked when a LENS table is being made\r
+ against the space in *table, ENOUGH, minus the maximum space needed by\r
+ the worst case distance code, MAXD. This should never happen, but the\r
+ sufficiency of ENOUGH has not been proven exhaustively, hence the check.\r
+ This assumes that when type == LENS, bits == 9.\r
+\r
+ sym increments through all symbols, and the loop terminates when\r
+ all codes of length max, i.e. all codes, have been processed. This\r
+ routine permits incomplete codes, so another loop after this one fills\r
+ in the rest of the decoding tables with invalid code markers.\r
+ */\r
+\r
+ /* set up for code type */\r
+ switch (type) {\r
+ case CODES:\r
+ base = extra = work; /* dummy value--not used */\r
+ end = 19;\r
+ break;\r
+ case LENS:\r
+ base = lbase;\r
+ base -= 257;\r
+ extra = lext;\r
+ extra -= 257;\r
+ end = 256;\r
+ break;\r
+ default: /* DISTS */\r
+ base = dbase;\r
+ extra = dext;\r
+ end = -1;\r
+ }\r
+\r
+ /* initialize state for loop */\r
+ huff = 0; /* starting code */\r
+ sym = 0; /* starting code symbol */\r
+ len = min; /* starting code length */\r
+ next = *table; /* current table to fill in */\r
+ curr = root; /* current table index bits */\r
+ drop = 0; /* current bits to drop from code for index */\r
+ low = (unsigned)(-1); /* trigger new sub-table when len > root */\r
+ used = 1U << root; /* use root table entries */\r
+ mask = used - 1; /* mask for comparing low */\r
+\r
+ /* check available table space */\r
+ if (type == LENS && used >= ENOUGH - MAXD)\r
+ return 1;\r
+\r
+ /* process all codes and make table entries */\r
+ for (;;) {\r
+ /* create table entry */\r
+ this.bits = (unsigned char)(len - drop);\r
+ if ((int)(work[sym]) < end) {\r
+ this.op = (unsigned char)0;\r
+ this.val = work[sym];\r
+ }\r
+ else if ((int)(work[sym]) > end) {\r
+ this.op = (unsigned char)(extra[work[sym]]);\r
+ this.val = base[work[sym]];\r
+ }\r
+ else {\r
+ this.op = (unsigned char)(32 + 64); /* end of block */\r
+ this.val = 0;\r
+ }\r
+\r
+ /* replicate for those indices with low len bits equal to huff */\r
+ incr = 1U << (len - drop);\r
+ fill = 1U << curr;\r
+ min = fill; /* save offset to next table */\r
+ do {\r
+ fill -= incr;\r
+ next[(huff >> drop) + fill] = this;\r
+ } while (fill != 0);\r
+\r
+ /* backwards increment the len-bit code huff */\r
+ incr = 1U << (len - 1);\r
+ while (huff & incr)\r
+ incr >>= 1;\r
+ if (incr != 0) {\r
+ huff &= incr - 1;\r
+ huff += incr;\r
+ }\r
+ else\r
+ huff = 0;\r
+\r
+ /* go to next symbol, update count, len */\r
+ sym++;\r
+ if (--(count[len]) == 0) {\r
+ if (len == max) break;\r
+ len = lens[work[sym]];\r
+ }\r
+\r
+ /* create new sub-table if needed */\r
+ if (len > root && (huff & mask) != low) {\r
+ /* if first time, transition to sub-tables */\r
+ if (drop == 0)\r
+ drop = root;\r
+\r
+ /* increment past last table */\r
+ next += min; /* here min is 1 << curr */\r
+\r
+ /* determine length of next table */\r
+ curr = len - drop;\r
+ left = (int)(1 << curr);\r
+ while (curr + drop < max) {\r
+ left -= count[curr + drop];\r
+ if (left <= 0) break;\r
+ curr++;\r
+ left <<= 1;\r
+ }\r
+\r
+ /* check for enough space */\r
+ used += 1U << curr;\r
+ if (type == LENS && used >= ENOUGH - MAXD)\r
+ return 1;\r
+\r
+ /* point entry in root table to sub-table */\r
+ low = huff & mask;\r
+ (*table)[low].op = (unsigned char)curr;\r
+ (*table)[low].bits = (unsigned char)root;\r
+ (*table)[low].val = (unsigned short)(next - *table);\r
+ }\r
+ }\r
+\r
+ /*\r
+ Fill in rest of table for incomplete codes. This loop is similar to the\r
+ loop above in incrementing huff for table indices. It is assumed that\r
+ len is equal to curr + drop, so there is no loop needed to increment\r
+ through high index bits. When the current sub-table is filled, the loop\r
+ drops back to the root table to fill in any remaining entries there.\r
+ */\r
+ this.op = (unsigned char)64; /* invalid code marker */\r
+ this.bits = (unsigned char)(len - drop);\r
+ this.val = (unsigned short)0;\r
+ while (huff != 0) {\r
+ /* when done with sub-table, drop back to root table */\r
+ if (drop != 0 && (huff & mask) != low) {\r
+ drop = 0;\r
+ len = root;\r
+ next = *table;\r
+ this.bits = (unsigned char)len;\r
+ }\r
+\r
+ /* put invalid code marker in table */\r
+ next[huff >> drop] = this;\r
+\r
+ /* backwards increment the len-bit code huff */\r
+ incr = 1U << (len - 1);\r
+ while (huff & incr)\r
+ incr >>= 1;\r
+ if (incr != 0) {\r
+ huff &= incr - 1;\r
+ huff += incr;\r
+ }\r
+ else\r
+ huff = 0;\r
+ }\r
+\r
+ /* set return parameters */\r
+ *table += used;\r
+ *bits = root;\r
+ return 0;\r
+}\r
--- /dev/null
+/* inftrees.h -- header to use inftrees.c\r
+ * Copyright (C) 1995-2005 Mark Adler\r
+ * For conditions of distribution and use, see copyright notice in zlib.h\r
+ */\r
+\r
+/* WARNING: this file should *not* be used by applications. It is\r
+ part of the implementation of the compression library and is\r
+ subject to change. Applications should only use zlib.h.\r
+ */\r
+\r
+/* Structure for decoding tables. Each entry provides either the\r
+ information needed to do the operation requested by the code that\r
+ indexed that table entry, or it provides a pointer to another\r
+ table that indexes more bits of the code. op indicates whether\r
+ the entry is a pointer to another table, a literal, a length or\r
+ distance, an end-of-block, or an invalid code. For a table\r
+ pointer, the low four bits of op is the number of index bits of\r
+ that table. For a length or distance, the low four bits of op\r
+ is the number of extra bits to get after the code. bits is\r
+ the number of bits in this code or part of the code to drop off\r
+ of the bit buffer. val is the actual byte to output in the case\r
+ of a literal, the base length or distance, or the offset from\r
+ the current table to the next table. Each entry is four bytes. */\r
+typedef struct {\r
+ unsigned char op; /* operation, extra bits, table bits */\r
+ unsigned char bits; /* bits in this part of the code */\r
+ unsigned short val; /* offset in table or code value */\r
+} code;\r
+\r
+/* op values as set by inflate_table():\r
+ 00000000 - literal\r
+ 0000tttt - table link, tttt != 0 is the number of table index bits\r
+ 0001eeee - length or distance, eeee is the number of extra bits\r
+ 01100000 - end of block\r
+ 01000000 - invalid code\r
+ */\r
+\r
+/* Maximum size of dynamic tree. The maximum found in a long but non-\r
+ exhaustive search was 1444 code structures (852 for length/literals\r
+ and 592 for distances, the latter actually the result of an\r
+ exhaustive search). The true maximum is not known, but the value\r
+ below is more than safe. */\r
+#define ENOUGH 2048\r
+#define MAXD 592\r
+\r
+/* Type of code to build for inftable() */\r
+typedef enum {\r
+ CODES,\r
+ LENS,\r
+ DISTS\r
+} codetype;\r
+\r
+extern int inflate_table OF((codetype type, unsigned short FAR *lens,\r
+ unsigned codes, code FAR * FAR *table,\r
+ unsigned FAR *bits, unsigned short FAR *work));\r
--- /dev/null
+/* trees.c -- output deflated data using Huffman coding\r
+ * Copyright (C) 1995-2005 Jean-loup Gailly\r
+ * For conditions of distribution and use, see copyright notice in zlib.h\r
+ */\r
+\r
+/*\r
+ * ALGORITHM\r
+ *\r
+ * The "deflation" process uses several Huffman trees. The more\r
+ * common source values are represented by shorter bit sequences.\r
+ *\r
+ * Each code tree is stored in a compressed form which is itself\r
+ * a Huffman encoding of the lengths of all the code strings (in\r
+ * ascending order by source values). The actual code strings are\r
+ * reconstructed from the lengths in the inflate process, as described\r
+ * in the deflate specification.\r
+ *\r
+ * REFERENCES\r
+ *\r
+ * Deutsch, L.P.,"'Deflate' Compressed Data Format Specification".\r
+ * Available in ftp.uu.net:/pub/archiving/zip/doc/deflate-1.1.doc\r
+ *\r
+ * Storer, James A.\r
+ * Data Compression: Methods and Theory, pp. 49-50.\r
+ * Computer Science Press, 1988. ISBN 0-7167-8156-5.\r
+ *\r
+ * Sedgewick, R.\r
+ * Algorithms, p290.\r
+ * Addison-Wesley, 1983. ISBN 0-201-06672-6.\r
+ */\r
+\r
+/* @(#) $Id$ */\r
+\r
+/* #define GEN_TREES_H */\r
+\r
+#include "deflate.h"\r
+\r
+#ifdef DEBUG\r
+# include <ctype.h>\r
+#endif\r
+\r
+/* ===========================================================================\r
+ * Constants\r
+ */\r
+\r
+#define MAX_BL_BITS 7\r
+/* Bit length codes must not exceed MAX_BL_BITS bits */\r
+\r
+#define END_BLOCK 256\r
+/* end of block literal code */\r
+\r
+#define REP_3_6 16\r
+/* repeat previous bit length 3-6 times (2 bits of repeat count) */\r
+\r
+#define REPZ_3_10 17\r
+/* repeat a zero length 3-10 times (3 bits of repeat count) */\r
+\r
+#define REPZ_11_138 18\r
+/* repeat a zero length 11-138 times (7 bits of repeat count) */\r
+\r
+local const int extra_lbits[LENGTH_CODES] /* extra bits for each length code */\r
+ = {0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0};\r
+\r
+local const int extra_dbits[D_CODES] /* extra bits for each distance code */\r
+ = {0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13};\r
+\r
+local const int extra_blbits[BL_CODES]/* extra bits for each bit length code */\r
+ = {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7};\r
+\r
+local const uch bl_order[BL_CODES]\r
+ = {16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15};\r
+/* The lengths of the bit length codes are sent in order of decreasing\r
+ * probability, to avoid transmitting the lengths for unused bit length codes.\r
+ */\r
+\r
+#define Buf_size (8 * 2*sizeof(char))\r
+/* Number of bits used within bi_buf. (bi_buf might be implemented on\r
+ * more than 16 bits on some systems.)\r
+ */\r
+\r
+/* ===========================================================================\r
+ * Local data. These are initialized only once.\r
+ */\r
+\r
+#define DIST_CODE_LEN 512 /* see definition of array dist_code below */\r
+\r
+#if defined(GEN_TREES_H) || !defined(STDC)\r
+/* non ANSI compilers may not accept trees.h */\r
+\r
+local ct_data static_ltree[L_CODES+2];\r
+/* The static literal tree. Since the bit lengths are imposed, there is no\r
+ * need for the L_CODES extra codes used during heap construction. However\r
+ * The codes 286 and 287 are needed to build a canonical tree (see _tr_init\r
+ * below).\r
+ */\r
+\r
+local ct_data static_dtree[D_CODES];\r
+/* The static distance tree. (Actually a trivial tree since all codes use\r
+ * 5 bits.)\r
+ */\r
+\r
+uch _dist_code[DIST_CODE_LEN];\r
+/* Distance codes. The first 256 values correspond to the distances\r
+ * 3 .. 258, the last 256 values correspond to the top 8 bits of\r
+ * the 15 bit distances.\r
+ */\r
+\r
+uch _length_code[MAX_MATCH-MIN_MATCH+1];\r
+/* length code for each normalized match length (0 == MIN_MATCH) */\r
+\r
+local int base_length[LENGTH_CODES];\r
+/* First normalized length for each code (0 = MIN_MATCH) */\r
+\r
+local int base_dist[D_CODES];\r
+/* First normalized distance for each code (0 = distance of 1) */\r
+\r
+#else\r
+# include "trees.h"\r
+#endif /* GEN_TREES_H */\r
+\r
+struct static_tree_desc_s {\r
+ const ct_data *static_tree; /* static tree or NULL */\r
+ const intf *extra_bits; /* extra bits for each code or NULL */\r
+ int extra_base; /* base index for extra_bits */\r
+ int elems; /* max number of elements in the tree */\r
+ int max_length; /* max bit length for the codes */\r
+};\r
+\r
+local static_tree_desc static_l_desc =\r
+{static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS};\r
+\r
+local static_tree_desc static_d_desc =\r
+{static_dtree, extra_dbits, 0, D_CODES, MAX_BITS};\r
+\r
+local static_tree_desc static_bl_desc =\r
+{(const ct_data *)0, extra_blbits, 0, BL_CODES, MAX_BL_BITS};\r
+\r
+/* ===========================================================================\r
+ * Local (static) routines in this file.\r
+ */\r
+\r
+local void tr_static_init OF((void));\r
+local void init_block OF((deflate_state *s));\r
+local void pqdownheap OF((deflate_state *s, ct_data *tree, int k));\r
+local void gen_bitlen OF((deflate_state *s, tree_desc *desc));\r
+local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count));\r
+local void build_tree OF((deflate_state *s, tree_desc *desc));\r
+local void scan_tree OF((deflate_state *s, ct_data *tree, int max_code));\r
+local void send_tree OF((deflate_state *s, ct_data *tree, int max_code));\r
+local int build_bl_tree OF((deflate_state *s));\r
+local void send_all_trees OF((deflate_state *s, int lcodes, int dcodes,\r
+ int blcodes));\r
+local void compress_block OF((deflate_state *s, ct_data *ltree,\r
+ ct_data *dtree));\r
+local void set_data_type OF((deflate_state *s));\r
+local unsigned bi_reverse OF((unsigned value, int length));\r
+local void bi_windup OF((deflate_state *s));\r
+local void bi_flush OF((deflate_state *s));\r
+local void copy_block OF((deflate_state *s, charf *buf, unsigned len,\r
+ int header));\r
+\r
+#ifdef GEN_TREES_H\r
+local void gen_trees_header OF((void));\r
+#endif\r
+\r
+#ifndef DEBUG\r
+# define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)\r
+ /* Send a code of the given tree. c and tree must not have side effects */\r
+\r
+#else /* DEBUG */\r
+# define send_code(s, c, tree) \\r
+ { if (z_verbose>2) fprintf(stderr,"\ncd %3d ",(c)); \\r
+ send_bits(s, tree[c].Code, tree[c].Len); }\r
+#endif\r
+\r
+/* ===========================================================================\r
+ * Output a short LSB first on the stream.\r
+ * IN assertion: there is enough room in pendingBuf.\r
+ */\r
+#define put_short(s, w) { \\r
+ put_byte(s, (uch)((w) & 0xff)); \\r
+ put_byte(s, (uch)((ush)(w) >> 8)); \\r
+}\r
+\r
+/* ===========================================================================\r
+ * Send a value on a given number of bits.\r
+ * IN assertion: length <= 16 and value fits in length bits.\r
+ */\r
+#ifdef DEBUG\r
+local void send_bits OF((deflate_state *s, int value, int length));\r
+\r
+local void send_bits(s, value, length)\r
+ deflate_state *s;\r
+ int value; /* value to send */\r
+ int length; /* number of bits */\r
+{\r
+ Tracevv((stderr," l %2d v %4x ", length, value));\r
+ Assert(length > 0 && length <= 15, "invalid length");\r
+ s->bits_sent += (ulg)length;\r
+\r
+ /* If not enough room in bi_buf, use (valid) bits from bi_buf and\r
+ * (16 - bi_valid) bits from value, leaving (width - (16-bi_valid))\r
+ * unused bits in value.\r
+ */\r
+ if (s->bi_valid > (int)Buf_size - length) {\r
+ s->bi_buf |= (value << s->bi_valid);\r
+ put_short(s, s->bi_buf);\r
+ s->bi_buf = (ush)value >> (Buf_size - s->bi_valid);\r
+ s->bi_valid += length - Buf_size;\r
+ } else {\r
+ s->bi_buf |= value << s->bi_valid;\r
+ s->bi_valid += length;\r
+ }\r
+}\r
+#else /* !DEBUG */\r
+\r
+#define send_bits(s, value, length) \\r
+{ int len = length;\\r
+ if (s->bi_valid > (int)Buf_size - len) {\\r
+ int val = value;\\r
+ s->bi_buf |= (val << s->bi_valid);\\r
+ put_short(s, s->bi_buf);\\r
+ s->bi_buf = (ush)val >> (Buf_size - s->bi_valid);\\r
+ s->bi_valid += len - Buf_size;\\r
+ } else {\\r
+ s->bi_buf |= (value) << s->bi_valid;\\r
+ s->bi_valid += len;\\r
+ }\\r
+}\r
+#endif /* DEBUG */\r
+\r
+\r
+/* the arguments must not have side effects */\r
+\r
+/* ===========================================================================\r
+ * Initialize the various 'constant' tables.\r
+ */\r
+local void tr_static_init()\r
+{\r
+#if defined(GEN_TREES_H) || !defined(STDC)\r
+ static int static_init_done = 0;\r
+ int n; /* iterates over tree elements */\r
+ int bits; /* bit counter */\r
+ int length; /* length value */\r
+ int code; /* code value */\r
+ int dist; /* distance index */\r
+ ush bl_count[MAX_BITS+1];\r
+ /* number of codes at each bit length for an optimal tree */\r
+\r
+ if (static_init_done) return;\r
+\r
+ /* For some embedded targets, global variables are not initialized: */\r
+ static_l_desc.static_tree = static_ltree;\r
+ static_l_desc.extra_bits = extra_lbits;\r
+ static_d_desc.static_tree = static_dtree;\r
+ static_d_desc.extra_bits = extra_dbits;\r
+ static_bl_desc.extra_bits = extra_blbits;\r
+\r
+ /* Initialize the mapping length (0..255) -> length code (0..28) */\r
+ length = 0;\r
+ for (code = 0; code < LENGTH_CODES-1; code++) {\r
+ base_length[code] = length;\r
+ for (n = 0; n < (1<<extra_lbits[code]); n++) {\r
+ _length_code[length++] = (uch)code;\r
+ }\r
+ }\r
+ Assert (length == 256, "tr_static_init: length != 256");\r
+ /* Note that the length 255 (match length 258) can be represented\r
+ * in two different ways: code 284 + 5 bits or code 285, so we\r
+ * overwrite length_code[255] to use the best encoding:\r
+ */\r
+ _length_code[length-1] = (uch)code;\r
+\r
+ /* Initialize the mapping dist (0..32K) -> dist code (0..29) */\r
+ dist = 0;\r
+ for (code = 0 ; code < 16; code++) {\r
+ base_dist[code] = dist;\r
+ for (n = 0; n < (1<<extra_dbits[code]); n++) {\r
+ _dist_code[dist++] = (uch)code;\r
+ }\r
+ }\r
+ Assert (dist == 256, "tr_static_init: dist != 256");\r
+ dist >>= 7; /* from now on, all distances are divided by 128 */\r
+ for ( ; code < D_CODES; code++) {\r
+ base_dist[code] = dist << 7;\r
+ for (n = 0; n < (1<<(extra_dbits[code]-7)); n++) {\r
+ _dist_code[256 + dist++] = (uch)code;\r
+ }\r
+ }\r
+ Assert (dist == 256, "tr_static_init: 256+dist != 512");\r
+\r
+ /* Construct the codes of the static literal tree */\r
+ for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0;\r
+ n = 0;\r
+ while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++;\r
+ while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++;\r
+ while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++;\r
+ while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++;\r
+ /* Codes 286 and 287 do not exist, but we must include them in the\r
+ * tree construction to get a canonical Huffman tree (longest code\r
+ * all ones)\r
+ */\r
+ gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);\r
+\r
+ /* The static distance tree is trivial: */\r
+ for (n = 0; n < D_CODES; n++) {\r
+ static_dtree[n].Len = 5;\r
+ static_dtree[n].Code = bi_reverse((unsigned)n, 5);\r
+ }\r
+ static_init_done = 1;\r
+\r
+# ifdef GEN_TREES_H\r
+ gen_trees_header();\r
+# endif\r
+#endif /* defined(GEN_TREES_H) || !defined(STDC) */\r
+}\r
+\r
+/* ===========================================================================\r
+ * Genererate the file trees.h describing the static trees.\r
+ */\r
+#ifdef GEN_TREES_H\r
+# ifndef DEBUG\r
+# include <stdio.h>\r
+# endif\r
+\r
+# define SEPARATOR(i, last, width) \\r
+ ((i) == (last)? "\n};\n\n" : \\r
+ ((i) % (width) == (width)-1 ? ",\n" : ", "))\r
+\r
+void gen_trees_header()\r
+{\r
+ FILE *header = fopen("trees.h", "w");\r
+ int i;\r
+\r
+ Assert (header != NULL, "Can't open trees.h");\r
+ fprintf(header,\r
+ "/* header created automatically with -DGEN_TREES_H */\n\n");\r
+\r
+ fprintf(header, "local const ct_data static_ltree[L_CODES+2] = {\n");\r
+ for (i = 0; i < L_CODES+2; i++) {\r
+ fprintf(header, "{{%3u},{%3u}}%s", static_ltree[i].Code,\r
+ static_ltree[i].Len, SEPARATOR(i, L_CODES+1, 5));\r
+ }\r
+\r
+ fprintf(header, "local const ct_data static_dtree[D_CODES] = {\n");\r
+ for (i = 0; i < D_CODES; i++) {\r
+ fprintf(header, "{{%2u},{%2u}}%s", static_dtree[i].Code,\r
+ static_dtree[i].Len, SEPARATOR(i, D_CODES-1, 5));\r
+ }\r
+\r
+ fprintf(header, "const uch _dist_code[DIST_CODE_LEN] = {\n");\r
+ for (i = 0; i < DIST_CODE_LEN; i++) {\r
+ fprintf(header, "%2u%s", _dist_code[i],\r
+ SEPARATOR(i, DIST_CODE_LEN-1, 20));\r
+ }\r
+\r
+ fprintf(header, "const uch _length_code[MAX_MATCH-MIN_MATCH+1]= {\n");\r
+ for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) {\r
+ fprintf(header, "%2u%s", _length_code[i],\r
+ SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20));\r
+ }\r
+\r
+ fprintf(header, "local const int base_length[LENGTH_CODES] = {\n");\r
+ for (i = 0; i < LENGTH_CODES; i++) {\r
+ fprintf(header, "%1u%s", base_length[i],\r
+ SEPARATOR(i, LENGTH_CODES-1, 20));\r
+ }\r
+\r
+ fprintf(header, "local const int base_dist[D_CODES] = {\n");\r
+ for (i = 0; i < D_CODES; i++) {\r
+ fprintf(header, "%5u%s", base_dist[i],\r
+ SEPARATOR(i, D_CODES-1, 10));\r
+ }\r
+\r
+ fclose(header);\r
+}\r
+#endif /* GEN_TREES_H */\r
+\r
+/* ===========================================================================\r
+ * Initialize the tree data structures for a new zlib stream.\r
+ */\r
+void _tr_init(s)\r
+ deflate_state *s;\r
+{\r
+ tr_static_init();\r
+\r
+ s->l_desc.dyn_tree = s->dyn_ltree;\r
+ s->l_desc.stat_desc = &static_l_desc;\r
+\r
+ s->d_desc.dyn_tree = s->dyn_dtree;\r
+ s->d_desc.stat_desc = &static_d_desc;\r
+\r
+ s->bl_desc.dyn_tree = s->bl_tree;\r
+ s->bl_desc.stat_desc = &static_bl_desc;\r
+\r
+ s->bi_buf = 0;\r
+ s->bi_valid = 0;\r
+ s->last_eob_len = 8; /* enough lookahead for inflate */\r
+#ifdef DEBUG\r
+ s->compressed_len = 0L;\r
+ s->bits_sent = 0L;\r
+#endif\r
+\r
+ /* Initialize the first block of the first file: */\r
+ init_block(s);\r
+}\r
+\r
+/* ===========================================================================\r
+ * Initialize a new block.\r
+ */\r
+local void init_block(s)\r
+ deflate_state *s;\r
+{\r
+ int n; /* iterates over tree elements */\r
+\r
+ /* Initialize the trees. */\r
+ for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;\r
+ for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;\r
+ for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;\r
+\r
+ s->dyn_ltree[END_BLOCK].Freq = 1;\r
+ s->opt_len = s->static_len = 0L;\r
+ s->last_lit = s->matches = 0;\r
+}\r
+\r
+#define SMALLEST 1\r
+/* Index within the heap array of least frequent node in the Huffman tree */\r
+\r
+\r
+/* ===========================================================================\r
+ * Remove the smallest element from the heap and recreate the heap with\r
+ * one less element. Updates heap and heap_len.\r
+ */\r
+#define pqremove(s, tree, top) \\r
+{\\r
+ top = s->heap[SMALLEST]; \\r
+ s->heap[SMALLEST] = s->heap[s->heap_len--]; \\r
+ pqdownheap(s, tree, SMALLEST); \\r
+}\r
+\r
+/* ===========================================================================\r
+ * Compares to subtrees, using the tree depth as tie breaker when\r
+ * the subtrees have equal frequency. This minimizes the worst case length.\r
+ */\r
+#define smaller(tree, n, m, depth) \\r
+ (tree[n].Freq < tree[m].Freq || \\r
+ (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))\r
+\r
+/* ===========================================================================\r
+ * Restore the heap property by moving down the tree starting at node k,\r
+ * exchanging a node with the smallest of its two sons if necessary, stopping\r
+ * when the heap property is re-established (each father smaller than its\r
+ * two sons).\r
+ */\r
+local void pqdownheap(s, tree, k)\r
+ deflate_state *s;\r
+ ct_data *tree; /* the tree to restore */\r
+ int k; /* node to move down */\r
+{\r
+ int v = s->heap[k];\r
+ int j = k << 1; /* left son of k */\r
+ while (j <= s->heap_len) {\r
+ /* Set j to the smallest of the two sons: */\r
+ if (j < s->heap_len &&\r
+ smaller(tree, s->heap[j+1], s->heap[j], s->depth)) {\r
+ j++;\r
+ }\r
+ /* Exit if v is smaller than both sons */\r
+ if (smaller(tree, v, s->heap[j], s->depth)) break;\r
+\r
+ /* Exchange v with the smallest son */\r
+ s->heap[k] = s->heap[j]; k = j;\r
+\r
+ /* And continue down the tree, setting j to the left son of k */\r
+ j <<= 1;\r
+ }\r
+ s->heap[k] = v;\r
+}\r
+\r
+/* ===========================================================================\r
+ * Compute the optimal bit lengths for a tree and update the total bit length\r
+ * for the current block.\r
+ * IN assertion: the fields freq and dad are set, heap[heap_max] and\r
+ * above are the tree nodes sorted by increasing frequency.\r
+ * OUT assertions: the field len is set to the optimal bit length, the\r
+ * array bl_count contains the frequencies for each bit length.\r
+ * The length opt_len is updated; static_len is also updated if stree is\r
+ * not null.\r
+ */\r
+local void gen_bitlen(s, desc)\r
+ deflate_state *s;\r
+ tree_desc *desc; /* the tree descriptor */\r
+{\r
+ ct_data *tree = desc->dyn_tree;\r
+ int max_code = desc->max_code;\r
+ const ct_data *stree = desc->stat_desc->static_tree;\r
+ const intf *extra = desc->stat_desc->extra_bits;\r
+ int base = desc->stat_desc->extra_base;\r
+ int max_length = desc->stat_desc->max_length;\r
+ int h; /* heap index */\r
+ int n, m; /* iterate over the tree elements */\r
+ int bits; /* bit length */\r
+ int xbits; /* extra bits */\r
+ ush f; /* frequency */\r
+ int overflow = 0; /* number of elements with bit length too large */\r
+\r
+ for (bits = 0; bits <= MAX_BITS; bits++) s->bl_count[bits] = 0;\r
+\r
+ /* In a first pass, compute the optimal bit lengths (which may\r
+ * overflow in the case of the bit length tree).\r
+ */\r
+ tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */\r
+\r
+ for (h = s->heap_max+1; h < HEAP_SIZE; h++) {\r
+ n = s->heap[h];\r
+ bits = tree[tree[n].Dad].Len + 1;\r
+ if (bits > max_length) bits = max_length, overflow++;\r
+ tree[n].Len = (ush)bits;\r
+ /* We overwrite tree[n].Dad which is no longer needed */\r
+\r
+ if (n > max_code) continue; /* not a leaf node */\r
+\r
+ s->bl_count[bits]++;\r
+ xbits = 0;\r
+ if (n >= base) xbits = extra[n-base];\r
+ f = tree[n].Freq;\r
+ s->opt_len += (ulg)f * (bits + xbits);\r
+ if (stree) s->static_len += (ulg)f * (stree[n].Len + xbits);\r
+ }\r
+ if (overflow == 0) return;\r
+\r
+ Trace((stderr,"\nbit length overflow\n"));\r
+ /* This happens for example on obj2 and pic of the Calgary corpus */\r
+\r
+ /* Find the first bit length which could increase: */\r
+ do {\r
+ bits = max_length-1;\r
+ while (s->bl_count[bits] == 0) bits--;\r
+ s->bl_count[bits]--; /* move one leaf down the tree */\r
+ s->bl_count[bits+1] += 2; /* move one overflow item as its brother */\r
+ s->bl_count[max_length]--;\r
+ /* The brother of the overflow item also moves one step up,\r
+ * but this does not affect bl_count[max_length]\r
+ */\r
+ overflow -= 2;\r
+ } while (overflow > 0);\r
+\r
+ /* Now recompute all bit lengths, scanning in increasing frequency.\r
+ * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all\r
+ * lengths instead of fixing only the wrong ones. This idea is taken\r
+ * from 'ar' written by Haruhiko Okumura.)\r
+ */\r
+ for (bits = max_length; bits != 0; bits--) {\r
+ n = s->bl_count[bits];\r
+ while (n != 0) {\r
+ m = s->heap[--h];\r
+ if (m > max_code) continue;\r
+ if ((unsigned) tree[m].Len != (unsigned) bits) {\r
+ Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits));\r
+ s->opt_len += ((long)bits - (long)tree[m].Len)\r
+ *(long)tree[m].Freq;\r
+ tree[m].Len = (ush)bits;\r
+ }\r
+ n--;\r
+ }\r
+ }\r
+}\r
+\r
+/* ===========================================================================\r
+ * Generate the codes for a given tree and bit counts (which need not be\r
+ * optimal).\r
+ * IN assertion: the array bl_count contains the bit length statistics for\r
+ * the given tree and the field len is set for all tree elements.\r
+ * OUT assertion: the field code is set for all tree elements of non\r
+ * zero code length.\r
+ */\r
+local void gen_codes (tree, max_code, bl_count)\r
+ ct_data *tree; /* the tree to decorate */\r
+ int max_code; /* largest code with non zero frequency */\r
+ ushf *bl_count; /* number of codes at each bit length */\r
+{\r
+ ush next_code[MAX_BITS+1]; /* next code value for each bit length */\r
+ ush code = 0; /* running code value */\r
+ int bits; /* bit index */\r
+ int n; /* code index */\r
+\r
+ /* The distribution counts are first used to generate the code values\r
+ * without bit reversal.\r
+ */\r
+ for (bits = 1; bits <= MAX_BITS; bits++) {\r
+ next_code[bits] = code = (code + bl_count[bits-1]) << 1;\r
+ }\r
+ /* Check that the bit counts in bl_count are consistent. The last code\r
+ * must be all ones.\r
+ */\r
+ Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1,\r
+ "inconsistent bit counts");\r
+ Tracev((stderr,"\ngen_codes: max_code %d ", max_code));\r
+\r
+ for (n = 0; n <= max_code; n++) {\r
+ int len = tree[n].Len;\r
+ if (len == 0) continue;\r
+ /* Now reverse the bits */\r
+ tree[n].Code = bi_reverse(next_code[len]++, len);\r
+\r
+ Tracecv(tree != static_ltree, (stderr,"\nn %3d %c l %2d c %4x (%x) ",\r
+ n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));\r
+ }\r
+}\r
+\r
+/* ===========================================================================\r
+ * Construct one Huffman tree and assigns the code bit strings and lengths.\r
+ * Update the total bit length for the current block.\r
+ * IN assertion: the field freq is set for all tree elements.\r
+ * OUT assertions: the fields len and code are set to the optimal bit length\r
+ * and corresponding code. The length opt_len is updated; static_len is\r
+ * also updated if stree is not null. The field max_code is set.\r
+ */\r
+local void build_tree(s, desc)\r
+ deflate_state *s;\r
+ tree_desc *desc; /* the tree descriptor */\r
+{\r
+ ct_data *tree = desc->dyn_tree;\r
+ const ct_data *stree = desc->stat_desc->static_tree;\r
+ int elems = desc->stat_desc->elems;\r
+ int n, m; /* iterate over heap elements */\r
+ int max_code = -1; /* largest code with non zero frequency */\r
+ int node; /* new node being created */\r
+\r
+ /* Construct the initial heap, with least frequent element in\r
+ * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].\r
+ * heap[0] is not used.\r
+ */\r
+ s->heap_len = 0, s->heap_max = HEAP_SIZE;\r
+\r
+ for (n = 0; n < elems; n++) {\r
+ if (tree[n].Freq != 0) {\r
+ s->heap[++(s->heap_len)] = max_code = n;\r
+ s->depth[n] = 0;\r
+ } else {\r
+ tree[n].Len = 0;\r
+ }\r
+ }\r
+\r
+ /* The pkzip format requires that at least one distance code exists,\r
+ * and that at least one bit should be sent even if there is only one\r
+ * possible code. So to avoid special checks later on we force at least\r
+ * two codes of non zero frequency.\r
+ */\r
+ while (s->heap_len < 2) {\r
+ node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);\r
+ tree[node].Freq = 1;\r
+ s->depth[node] = 0;\r
+ s->opt_len--; if (stree) s->static_len -= stree[node].Len;\r
+ /* node is 0 or 1 so it does not have extra bits */\r
+ }\r
+ desc->max_code = max_code;\r
+\r
+ /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree,\r
+ * establish sub-heaps of increasing lengths:\r
+ */\r
+ for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n);\r
+\r
+ /* Construct the Huffman tree by repeatedly combining the least two\r
+ * frequent nodes.\r
+ */\r
+ node = elems; /* next internal node of the tree */\r
+ do {\r
+ pqremove(s, tree, n); /* n = node of least frequency */\r
+ m = s->heap[SMALLEST]; /* m = node of next least frequency */\r
+\r
+ s->heap[--(s->heap_max)] = n; /* keep the nodes sorted by frequency */\r
+ s->heap[--(s->heap_max)] = m;\r
+\r
+ /* Create a new node father of n and m */\r
+ tree[node].Freq = tree[n].Freq + tree[m].Freq;\r
+ s->depth[node] = (uch)((s->depth[n] >= s->depth[m] ?\r
+ s->depth[n] : s->depth[m]) + 1);\r
+ tree[n].Dad = tree[m].Dad = (ush)node;\r
+#ifdef DUMP_BL_TREE\r
+ if (tree == s->bl_tree) {\r
+ fprintf(stderr,"\nnode %d(%d), sons %d(%d) %d(%d)",\r
+ node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);\r
+ }\r
+#endif\r
+ /* and insert the new node in the heap */\r
+ s->heap[SMALLEST] = node++;\r
+ pqdownheap(s, tree, SMALLEST);\r
+\r
+ } while (s->heap_len >= 2);\r
+\r
+ s->heap[--(s->heap_max)] = s->heap[SMALLEST];\r
+\r
+ /* At this point, the fields freq and dad are set. We can now\r
+ * generate the bit lengths.\r
+ */\r
+ gen_bitlen(s, (tree_desc *)desc);\r
+\r
+ /* The field len is now set, we can generate the bit codes */\r
+ gen_codes ((ct_data *)tree, max_code, s->bl_count);\r
+}\r
+\r
+/* ===========================================================================\r
+ * Scan a literal or distance tree to determine the frequencies of the codes\r
+ * in the bit length tree.\r
+ */\r
+local void scan_tree (s, tree, max_code)\r
+ deflate_state *s;\r
+ ct_data *tree; /* the tree to be scanned */\r
+ int max_code; /* and its largest code of non zero frequency */\r
+{\r
+ int n; /* iterates over all tree elements */\r
+ int prevlen = -1; /* last emitted length */\r
+ int curlen; /* length of current code */\r
+ int nextlen = tree[0].Len; /* length of next code */\r
+ int count = 0; /* repeat count of the current code */\r
+ int max_count = 7; /* max repeat count */\r
+ int min_count = 4; /* min repeat count */\r
+\r
+ if (nextlen == 0) max_count = 138, min_count = 3;\r
+ tree[max_code+1].Len = (ush)0xffff; /* guard */\r
+\r
+ for (n = 0; n <= max_code; n++) {\r
+ curlen = nextlen; nextlen = tree[n+1].Len;\r
+ if (++count < max_count && curlen == nextlen) {\r
+ continue;\r
+ } else if (count < min_count) {\r
+ s->bl_tree[curlen].Freq += count;\r
+ } else if (curlen != 0) {\r
+ if (curlen != prevlen) s->bl_tree[curlen].Freq++;\r
+ s->bl_tree[REP_3_6].Freq++;\r
+ } else if (count <= 10) {\r
+ s->bl_tree[REPZ_3_10].Freq++;\r
+ } else {\r
+ s->bl_tree[REPZ_11_138].Freq++;\r
+ }\r
+ count = 0; prevlen = curlen;\r
+ if (nextlen == 0) {\r
+ max_count = 138, min_count = 3;\r
+ } else if (curlen == nextlen) {\r
+ max_count = 6, min_count = 3;\r
+ } else {\r
+ max_count = 7, min_count = 4;\r
+ }\r
+ }\r
+}\r
+\r
+/* ===========================================================================\r
+ * Send a literal or distance tree in compressed form, using the codes in\r
+ * bl_tree.\r
+ */\r
+local void send_tree (s, tree, max_code)\r
+ deflate_state *s;\r
+ ct_data *tree; /* the tree to be scanned */\r
+ int max_code; /* and its largest code of non zero frequency */\r
+{\r
+ int n; /* iterates over all tree elements */\r
+ int prevlen = -1; /* last emitted length */\r
+ int curlen; /* length of current code */\r
+ int nextlen = tree[0].Len; /* length of next code */\r
+ int count = 0; /* repeat count of the current code */\r
+ int max_count = 7; /* max repeat count */\r
+ int min_count = 4; /* min repeat count */\r
+\r
+ /* tree[max_code+1].Len = -1; */ /* guard already set */\r
+ if (nextlen == 0) max_count = 138, min_count = 3;\r
+\r
+ for (n = 0; n <= max_code; n++) {\r
+ curlen = nextlen; nextlen = tree[n+1].Len;\r
+ if (++count < max_count && curlen == nextlen) {\r
+ continue;\r
+ } else if (count < min_count) {\r
+ do { send_code(s, curlen, s->bl_tree); } while (--count != 0);\r
+\r
+ } else if (curlen != 0) {\r
+ if (curlen != prevlen) {\r
+ send_code(s, curlen, s->bl_tree); count--;\r
+ }\r
+ Assert(count >= 3 && count <= 6, " 3_6?");\r
+ send_code(s, REP_3_6, s->bl_tree); send_bits(s, count-3, 2);\r
+\r
+ } else if (count <= 10) {\r
+ send_code(s, REPZ_3_10, s->bl_tree); send_bits(s, count-3, 3);\r
+\r
+ } else {\r
+ send_code(s, REPZ_11_138, s->bl_tree); send_bits(s, count-11, 7);\r
+ }\r
+ count = 0; prevlen = curlen;\r
+ if (nextlen == 0) {\r
+ max_count = 138, min_count = 3;\r
+ } else if (curlen == nextlen) {\r
+ max_count = 6, min_count = 3;\r
+ } else {\r
+ max_count = 7, min_count = 4;\r
+ }\r
+ }\r
+}\r
+\r
+/* ===========================================================================\r
+ * Construct the Huffman tree for the bit lengths and return the index in\r
+ * bl_order of the last bit length code to send.\r
+ */\r
+local int build_bl_tree(s)\r
+ deflate_state *s;\r
+{\r
+ int max_blindex; /* index of last bit length code of non zero freq */\r
+\r
+ /* Determine the bit length frequencies for literal and distance trees */\r
+ scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);\r
+ scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);\r
+\r
+ /* Build the bit length tree: */\r
+ build_tree(s, (tree_desc *)(&(s->bl_desc)));\r
+ /* opt_len now includes the length of the tree representations, except\r
+ * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\r
+ */\r
+\r
+ /* Determine the number of bit length codes to send. The pkzip format\r
+ * requires that at least 4 bit length codes be sent. (appnote.txt says\r
+ * 3 but the actual value used is 4.)\r
+ */\r
+ for (max_blindex = BL_CODES-1; max_blindex >= 3; max_blindex--) {\r
+ if (s->bl_tree[bl_order[max_blindex]].Len != 0) break;\r
+ }\r
+ /* Update opt_len to include the bit length tree and counts */\r
+ s->opt_len += 3*(max_blindex+1) + 5+5+4;\r
+ Tracev((stderr, "\ndyn trees: dyn %ld, stat %ld",\r
+ s->opt_len, s->static_len));\r
+\r
+ return max_blindex;\r
+}\r
+\r
+/* ===========================================================================\r
+ * Send the header for a block using dynamic Huffman trees: the counts, the\r
+ * lengths of the bit length codes, the literal tree and the distance tree.\r
+ * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4.\r
+ */\r
+local void send_all_trees(s, lcodes, dcodes, blcodes)\r
+ deflate_state *s;\r
+ int lcodes, dcodes, blcodes; /* number of codes for each tree */\r
+{\r
+ int rank; /* index in bl_order */\r
+\r
+ Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes");\r
+ Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\r
+ "too many codes");\r
+ Tracev((stderr, "\nbl counts: "));\r
+ send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */\r
+ send_bits(s, dcodes-1, 5);\r
+ send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */\r
+ for (rank = 0; rank < blcodes; rank++) {\r
+ Tracev((stderr, "\nbl code %2d ", bl_order[rank]));\r
+ send_bits(s, s->bl_tree[bl_order[rank]].Len, 3);\r
+ }\r
+ Tracev((stderr, "\nbl tree: sent %ld", s->bits_sent));\r
+\r
+ send_tree(s, (ct_data *)s->dyn_ltree, lcodes-1); /* literal tree */\r
+ Tracev((stderr, "\nlit tree: sent %ld", s->bits_sent));\r
+\r
+ send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */\r
+ Tracev((stderr, "\ndist tree: sent %ld", s->bits_sent));\r
+}\r
+\r
+/* ===========================================================================\r
+ * Send a stored block\r
+ */\r
+void _tr_stored_block(s, buf, stored_len, eof)\r
+ deflate_state *s;\r
+ charf *buf; /* input block */\r
+ ulg stored_len; /* length of input block */\r
+ int eof; /* true if this is the last block for a file */\r
+{\r
+ send_bits(s, (STORED_BLOCK<<1)+eof, 3); /* send block type */\r
+#ifdef DEBUG\r
+ s->compressed_len = (s->compressed_len + 3 + 7) & (ulg)~7L;\r
+ s->compressed_len += (stored_len + 4) << 3;\r
+#endif\r
+ copy_block(s, buf, (unsigned)stored_len, 1); /* with header */\r
+}\r
+\r
+/* ===========================================================================\r
+ * Send one empty static block to give enough lookahead for inflate.\r
+ * This takes 10 bits, of which 7 may remain in the bit buffer.\r
+ * The current inflate code requires 9 bits of lookahead. If the\r
+ * last two codes for the previous block (real code plus EOB) were coded\r
+ * on 5 bits or less, inflate may have only 5+3 bits of lookahead to decode\r
+ * the last real code. In this case we send two empty static blocks instead\r
+ * of one. (There are no problems if the previous block is stored or fixed.)\r
+ * To simplify the code, we assume the worst case of last real code encoded\r
+ * on one bit only.\r
+ */\r
+void _tr_align(s)\r
+ deflate_state *s;\r
+{\r
+ send_bits(s, STATIC_TREES<<1, 3);\r
+ send_code(s, END_BLOCK, static_ltree);\r
+#ifdef DEBUG\r
+ s->compressed_len += 10L; /* 3 for block type, 7 for EOB */\r
+#endif\r
+ bi_flush(s);\r
+ /* Of the 10 bits for the empty block, we have already sent\r
+ * (10 - bi_valid) bits. The lookahead for the last real code (before\r
+ * the EOB of the previous block) was thus at least one plus the length\r
+ * of the EOB plus what we have just sent of the empty static block.\r
+ */\r
+ if (1 + s->last_eob_len + 10 - s->bi_valid < 9) {\r
+ send_bits(s, STATIC_TREES<<1, 3);\r
+ send_code(s, END_BLOCK, static_ltree);\r
+#ifdef DEBUG\r
+ s->compressed_len += 10L;\r
+#endif\r
+ bi_flush(s);\r
+ }\r
+ s->last_eob_len = 7;\r
+}\r
+\r
+/* ===========================================================================\r
+ * Determine the best encoding for the current block: dynamic trees, static\r
+ * trees or store, and output the encoded block to the zip file.\r
+ */\r
+void _tr_flush_block(s, buf, stored_len, eof)\r
+ deflate_state *s;\r
+ charf *buf; /* input block, or NULL if too old */\r
+ ulg stored_len; /* length of input block */\r
+ int eof; /* true if this is the last block for a file */\r
+{\r
+ ulg opt_lenb, static_lenb; /* opt_len and static_len in bytes */\r
+ int max_blindex = 0; /* index of last bit length code of non zero freq */\r
+\r
+ /* Build the Huffman trees unless a stored block is forced */\r
+ if (s->level > 0) {\r
+\r
+ /* Check if the file is binary or text */\r
+ if (stored_len > 0 && s->strm->data_type == Z_UNKNOWN)\r
+ set_data_type(s);\r
+\r
+ /* Construct the literal and distance trees */\r
+ build_tree(s, (tree_desc *)(&(s->l_desc)));\r
+ Tracev((stderr, "\nlit data: dyn %ld, stat %ld", s->opt_len,\r
+ s->static_len));\r
+\r
+ build_tree(s, (tree_desc *)(&(s->d_desc)));\r
+ Tracev((stderr, "\ndist data: dyn %ld, stat %ld", s->opt_len,\r
+ s->static_len));\r
+ /* At this point, opt_len and static_len are the total bit lengths of\r
+ * the compressed block data, excluding the tree representations.\r
+ */\r
+\r
+ /* Build the bit length tree for the above two trees, and get the index\r
+ * in bl_order of the last bit length code to send.\r
+ */\r
+ max_blindex = build_bl_tree(s);\r
+\r
+ /* Determine the best encoding. Compute the block lengths in bytes. */\r
+ opt_lenb = (s->opt_len+3+7)>>3;\r
+ static_lenb = (s->static_len+3+7)>>3;\r
+\r
+ Tracev((stderr, "\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u ",\r
+ opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\r
+ s->last_lit));\r
+\r
+ if (static_lenb <= opt_lenb) opt_lenb = static_lenb;\r
+\r
+ } else {\r
+ Assert(buf != (char*)0, "lost buf");\r
+ opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\r
+ }\r
+\r
+#ifdef FORCE_STORED\r
+ if (buf != (char*)0) { /* force stored block */\r
+#else\r
+ if (stored_len+4 <= opt_lenb && buf != (char*)0) {\r
+ /* 4: two words for the lengths */\r
+#endif\r
+ /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\r
+ * Otherwise we can't have processed more than WSIZE input bytes since\r
+ * the last block flush, because compression would have been\r
+ * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\r
+ * transform a block into a stored block.\r
+ */\r
+ _tr_stored_block(s, buf, stored_len, eof);\r
+\r
+#ifdef FORCE_STATIC\r
+ } else if (static_lenb >= 0) { /* force static trees */\r
+#else\r
+ } else if (s->strategy == Z_FIXED || static_lenb == opt_lenb) {\r
+#endif\r
+ send_bits(s, (STATIC_TREES<<1)+eof, 3);\r
+ compress_block(s, (ct_data *)static_ltree, (ct_data *)static_dtree);\r
+#ifdef DEBUG\r
+ s->compressed_len += 3 + s->static_len;\r
+#endif\r
+ } else {\r
+ send_bits(s, (DYN_TREES<<1)+eof, 3);\r
+ send_all_trees(s, s->l_desc.max_code+1, s->d_desc.max_code+1,\r
+ max_blindex+1);\r
+ compress_block(s, (ct_data *)s->dyn_ltree, (ct_data *)s->dyn_dtree);\r
+#ifdef DEBUG\r
+ s->compressed_len += 3 + s->opt_len;\r
+#endif\r
+ }\r
+ Assert (s->compressed_len == s->bits_sent, "bad compressed size");\r
+ /* The above check is made mod 2^32, for files larger than 512 MB\r
+ * and uLong implemented on 32 bits.\r
+ */\r
+ init_block(s);\r
+\r
+ if (eof) {\r
+ bi_windup(s);\r
+#ifdef DEBUG\r
+ s->compressed_len += 7; /* align on byte boundary */\r
+#endif\r
+ }\r
+ Tracev((stderr,"\ncomprlen %lu(%lu) ", s->compressed_len>>3,\r
+ s->compressed_len-7*eof));\r
+}\r
+\r
+/* ===========================================================================\r
+ * Save the match info and tally the frequency counts. Return true if\r
+ * the current block must be flushed.\r
+ */\r
+int _tr_tally (s, dist, lc)\r
+ deflate_state *s;\r
+ unsigned dist; /* distance of matched string */\r
+ unsigned lc; /* match length-MIN_MATCH or unmatched char (if dist==0) */\r
+{\r
+ s->d_buf[s->last_lit] = (ush)dist;\r
+ s->l_buf[s->last_lit++] = (uch)lc;\r
+ if (dist == 0) {\r
+ /* lc is the unmatched char */\r
+ s->dyn_ltree[lc].Freq++;\r
+ } else {\r
+ s->matches++;\r
+ /* Here, lc is the match length - MIN_MATCH */\r
+ dist--; /* dist = match distance - 1 */\r
+ Assert((ush)dist < (ush)MAX_DIST(s) &&\r
+ (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&\r
+ (ush)d_code(dist) < (ush)D_CODES, "_tr_tally: bad match");\r
+\r
+ s->dyn_ltree[_length_code[lc]+LITERALS+1].Freq++;\r
+ s->dyn_dtree[d_code(dist)].Freq++;\r
+ }\r
+\r
+#ifdef TRUNCATE_BLOCK\r
+ /* Try to guess if it is profitable to stop the current block here */\r
+ if ((s->last_lit & 0x1fff) == 0 && s->level > 2) {\r
+ /* Compute an upper bound for the compressed length */\r
+ ulg out_length = (ulg)s->last_lit*8L;\r
+ ulg in_length = (ulg)((long)s->strstart - s->block_start);\r
+ int dcode;\r
+ for (dcode = 0; dcode < D_CODES; dcode++) {\r
+ out_length += (ulg)s->dyn_dtree[dcode].Freq *\r
+ (5L+extra_dbits[dcode]);\r
+ }\r
+ out_length >>= 3;\r
+ Tracev((stderr,"\nlast_lit %u, in %ld, out ~%ld(%ld%%) ",\r
+ s->last_lit, in_length, out_length,\r
+ 100L - out_length*100L/in_length));\r
+ if (s->matches < s->last_lit/2 && out_length < in_length/2) return 1;\r
+ }\r
+#endif\r
+ return (s->last_lit == s->lit_bufsize-1);\r
+ /* We avoid equality with lit_bufsize because of wraparound at 64K\r
+ * on 16 bit machines and because stored blocks are restricted to\r
+ * 64K-1 bytes.\r
+ */\r
+}\r
+\r
+/* ===========================================================================\r
+ * Send the block data compressed using the given Huffman trees\r
+ */\r
+local void compress_block(s, ltree, dtree)\r
+ deflate_state *s;\r
+ ct_data *ltree; /* literal tree */\r
+ ct_data *dtree; /* distance tree */\r
+{\r
+ unsigned dist; /* distance of matched string */\r
+ int lc; /* match length or unmatched char (if dist == 0) */\r
+ unsigned lx = 0; /* running index in l_buf */\r
+ unsigned code; /* the code to send */\r
+ int extra; /* number of extra bits to send */\r
+\r
+ if (s->last_lit != 0) do {\r
+ dist = s->d_buf[lx];\r
+ lc = s->l_buf[lx++];\r
+ if (dist == 0) {\r
+ send_code(s, lc, ltree); /* send a literal byte */\r
+ Tracecv(isgraph(lc), (stderr," '%c' ", lc));\r
+ } else {\r
+ /* Here, lc is the match length - MIN_MATCH */\r
+ code = _length_code[lc];\r
+ send_code(s, code+LITERALS+1, ltree); /* send the length code */\r
+ extra = extra_lbits[code];\r
+ if (extra != 0) {\r
+ lc -= base_length[code];\r
+ send_bits(s, lc, extra); /* send the extra length bits */\r
+ }\r
+ dist--; /* dist is now the match distance - 1 */\r
+ code = d_code(dist);\r
+ Assert (code < D_CODES, "bad d_code");\r
+\r
+ send_code(s, code, dtree); /* send the distance code */\r
+ extra = extra_dbits[code];\r
+ if (extra != 0) {\r
+ dist -= base_dist[code];\r
+ send_bits(s, dist, extra); /* send the extra distance bits */\r
+ }\r
+ } /* literal or match pair ? */\r
+\r
+ /* Check that the overlay between pending_buf and d_buf+l_buf is ok: */\r
+ Assert((uInt)(s->pending) < s->lit_bufsize + 2*lx,\r
+ "pendingBuf overflow");\r
+\r
+ } while (lx < s->last_lit);\r
+\r
+ send_code(s, END_BLOCK, ltree);\r
+ s->last_eob_len = ltree[END_BLOCK].Len;\r
+}\r
+\r
+/* ===========================================================================\r
+ * Set the data type to BINARY or TEXT, using a crude approximation:\r
+ * set it to Z_TEXT if all symbols are either printable characters (33 to 255)\r
+ * or white spaces (9 to 13, or 32); or set it to Z_BINARY otherwise.\r
+ * IN assertion: the fields Freq of dyn_ltree are set.\r
+ */\r
+local void set_data_type(s)\r
+ deflate_state *s;\r
+{\r
+ int n;\r
+\r
+ for (n = 0; n < 9; n++)\r
+ if (s->dyn_ltree[n].Freq != 0)\r
+ break;\r
+ if (n == 9)\r
+ for (n = 14; n < 32; n++)\r
+ if (s->dyn_ltree[n].Freq != 0)\r
+ break;\r
+ s->strm->data_type = (n == 32) ? Z_TEXT : Z_BINARY;\r
+}\r
+\r
+/* ===========================================================================\r
+ * Reverse the first len bits of a code, using straightforward code (a faster\r
+ * method would use a table)\r
+ * IN assertion: 1 <= len <= 15\r
+ */\r
+local unsigned bi_reverse(code, len)\r
+ unsigned code; /* the value to invert */\r
+ int len; /* its bit length */\r
+{\r
+ register unsigned res = 0;\r
+ do {\r
+ res |= code & 1;\r
+ code >>= 1, res <<= 1;\r
+ } while (--len > 0);\r
+ return res >> 1;\r
+}\r
+\r
+/* ===========================================================================\r
+ * Flush the bit buffer, keeping at most 7 bits in it.\r
+ */\r
+local void bi_flush(s)\r
+ deflate_state *s;\r
+{\r
+ if (s->bi_valid == 16) {\r
+ put_short(s, s->bi_buf);\r
+ s->bi_buf = 0;\r
+ s->bi_valid = 0;\r
+ } else if (s->bi_valid >= 8) {\r
+ put_byte(s, (Byte)s->bi_buf);\r
+ s->bi_buf >>= 8;\r
+ s->bi_valid -= 8;\r
+ }\r
+}\r
+\r
+/* ===========================================================================\r
+ * Flush the bit buffer and align the output on a byte boundary\r
+ */\r
+local void bi_windup(s)\r
+ deflate_state *s;\r
+{\r
+ if (s->bi_valid > 8) {\r
+ put_short(s, s->bi_buf);\r
+ } else if (s->bi_valid > 0) {\r
+ put_byte(s, (Byte)s->bi_buf);\r
+ }\r
+ s->bi_buf = 0;\r
+ s->bi_valid = 0;\r
+#ifdef DEBUG\r
+ s->bits_sent = (s->bits_sent+7) & ~7;\r
+#endif\r
+}\r
+\r
+/* ===========================================================================\r
+ * Copy a stored block, storing first the length and its\r
+ * one's complement if requested.\r
+ */\r
+local void copy_block(s, buf, len, header)\r
+ deflate_state *s;\r
+ charf *buf; /* the input data */\r
+ unsigned len; /* its length */\r
+ int header; /* true if block header must be written */\r
+{\r
+ bi_windup(s); /* align on byte boundary */\r
+ s->last_eob_len = 8; /* enough lookahead for inflate */\r
+\r
+ if (header) {\r
+ put_short(s, (ush)len);\r
+ put_short(s, (ush)~len);\r
+#ifdef DEBUG\r
+ s->bits_sent += 2*16;\r
+#endif\r
+ }\r
+#ifdef DEBUG\r
+ s->bits_sent += (ulg)len<<3;\r
+#endif\r
+ while (len--) {\r
+ put_byte(s, *buf++);\r
+ }\r
+}\r
--- /dev/null
+/* header created automatically with -DGEN_TREES_H */\r
+\r
+local const ct_data static_ltree[L_CODES+2] = {\r
+{{ 12},{ 8}}, {{140},{ 8}}, {{ 76},{ 8}}, {{204},{ 8}}, {{ 44},{ 8}},\r
+{{172},{ 8}}, {{108},{ 8}}, {{236},{ 8}}, {{ 28},{ 8}}, {{156},{ 8}},\r
+{{ 92},{ 8}}, {{220},{ 8}}, {{ 60},{ 8}}, {{188},{ 8}}, {{124},{ 8}},\r
+{{252},{ 8}}, {{ 2},{ 8}}, {{130},{ 8}}, {{ 66},{ 8}}, {{194},{ 8}},\r
+{{ 34},{ 8}}, {{162},{ 8}}, {{ 98},{ 8}}, {{226},{ 8}}, {{ 18},{ 8}},\r
+{{146},{ 8}}, {{ 82},{ 8}}, {{210},{ 8}}, {{ 50},{ 8}}, {{178},{ 8}},\r
+{{114},{ 8}}, {{242},{ 8}}, {{ 10},{ 8}}, {{138},{ 8}}, {{ 74},{ 8}},\r
+{{202},{ 8}}, {{ 42},{ 8}}, {{170},{ 8}}, {{106},{ 8}}, {{234},{ 8}},\r
+{{ 26},{ 8}}, {{154},{ 8}}, {{ 90},{ 8}}, {{218},{ 8}}, {{ 58},{ 8}},\r
+{{186},{ 8}}, {{122},{ 8}}, {{250},{ 8}}, {{ 6},{ 8}}, {{134},{ 8}},\r
+{{ 70},{ 8}}, {{198},{ 8}}, {{ 38},{ 8}}, {{166},{ 8}}, {{102},{ 8}},\r
+{{230},{ 8}}, {{ 22},{ 8}}, {{150},{ 8}}, {{ 86},{ 8}}, {{214},{ 8}},\r
+{{ 54},{ 8}}, {{182},{ 8}}, {{118},{ 8}}, {{246},{ 8}}, {{ 14},{ 8}},\r
+{{142},{ 8}}, {{ 78},{ 8}}, {{206},{ 8}}, {{ 46},{ 8}}, {{174},{ 8}},\r
+{{110},{ 8}}, {{238},{ 8}}, {{ 30},{ 8}}, {{158},{ 8}}, {{ 94},{ 8}},\r
+{{222},{ 8}}, {{ 62},{ 8}}, {{190},{ 8}}, {{126},{ 8}}, {{254},{ 8}},\r
+{{ 1},{ 8}}, {{129},{ 8}}, {{ 65},{ 8}}, {{193},{ 8}}, {{ 33},{ 8}},\r
+{{161},{ 8}}, {{ 97},{ 8}}, {{225},{ 8}}, {{ 17},{ 8}}, {{145},{ 8}},\r
+{{ 81},{ 8}}, {{209},{ 8}}, {{ 49},{ 8}}, {{177},{ 8}}, {{113},{ 8}},\r
+{{241},{ 8}}, {{ 9},{ 8}}, {{137},{ 8}}, {{ 73},{ 8}}, {{201},{ 8}},\r
+{{ 41},{ 8}}, {{169},{ 8}}, {{105},{ 8}}, {{233},{ 8}}, {{ 25},{ 8}},\r
+{{153},{ 8}}, {{ 89},{ 8}}, {{217},{ 8}}, {{ 57},{ 8}}, {{185},{ 8}},\r
+{{121},{ 8}}, {{249},{ 8}}, {{ 5},{ 8}}, {{133},{ 8}}, {{ 69},{ 8}},\r
+{{197},{ 8}}, {{ 37},{ 8}}, {{165},{ 8}}, {{101},{ 8}}, {{229},{ 8}},\r
+{{ 21},{ 8}}, {{149},{ 8}}, {{ 85},{ 8}}, {{213},{ 8}}, {{ 53},{ 8}},\r
+{{181},{ 8}}, {{117},{ 8}}, {{245},{ 8}}, {{ 13},{ 8}}, {{141},{ 8}},\r
+{{ 77},{ 8}}, {{205},{ 8}}, {{ 45},{ 8}}, {{173},{ 8}}, {{109},{ 8}},\r
+{{237},{ 8}}, {{ 29},{ 8}}, {{157},{ 8}}, {{ 93},{ 8}}, {{221},{ 8}},\r
+{{ 61},{ 8}}, {{189},{ 8}}, {{125},{ 8}}, {{253},{ 8}}, {{ 19},{ 9}},\r
+{{275},{ 9}}, {{147},{ 9}}, {{403},{ 9}}, {{ 83},{ 9}}, {{339},{ 9}},\r
+{{211},{ 9}}, {{467},{ 9}}, {{ 51},{ 9}}, {{307},{ 9}}, {{179},{ 9}},\r
+{{435},{ 9}}, {{115},{ 9}}, {{371},{ 9}}, {{243},{ 9}}, {{499},{ 9}},\r
+{{ 11},{ 9}}, {{267},{ 9}}, {{139},{ 9}}, {{395},{ 9}}, {{ 75},{ 9}},\r
+{{331},{ 9}}, {{203},{ 9}}, {{459},{ 9}}, {{ 43},{ 9}}, {{299},{ 9}},\r
+{{171},{ 9}}, {{427},{ 9}}, {{107},{ 9}}, {{363},{ 9}}, {{235},{ 9}},\r
+{{491},{ 9}}, {{ 27},{ 9}}, {{283},{ 9}}, {{155},{ 9}}, {{411},{ 9}},\r
+{{ 91},{ 9}}, {{347},{ 9}}, {{219},{ 9}}, {{475},{ 9}}, {{ 59},{ 9}},\r
+{{315},{ 9}}, {{187},{ 9}}, {{443},{ 9}}, {{123},{ 9}}, {{379},{ 9}},\r
+{{251},{ 9}}, {{507},{ 9}}, {{ 7},{ 9}}, {{263},{ 9}}, {{135},{ 9}},\r
+{{391},{ 9}}, {{ 71},{ 9}}, {{327},{ 9}}, {{199},{ 9}}, {{455},{ 9}},\r
+{{ 39},{ 9}}, {{295},{ 9}}, {{167},{ 9}}, {{423},{ 9}}, {{103},{ 9}},\r
+{{359},{ 9}}, {{231},{ 9}}, {{487},{ 9}}, {{ 23},{ 9}}, {{279},{ 9}},\r
+{{151},{ 9}}, {{407},{ 9}}, {{ 87},{ 9}}, {{343},{ 9}}, {{215},{ 9}},\r
+{{471},{ 9}}, {{ 55},{ 9}}, {{311},{ 9}}, {{183},{ 9}}, {{439},{ 9}},\r
+{{119},{ 9}}, {{375},{ 9}}, {{247},{ 9}}, {{503},{ 9}}, {{ 15},{ 9}},\r
+{{271},{ 9}}, {{143},{ 9}}, {{399},{ 9}}, {{ 79},{ 9}}, {{335},{ 9}},\r
+{{207},{ 9}}, {{463},{ 9}}, {{ 47},{ 9}}, {{303},{ 9}}, {{175},{ 9}},\r
+{{431},{ 9}}, {{111},{ 9}}, {{367},{ 9}}, {{239},{ 9}}, {{495},{ 9}},\r
+{{ 31},{ 9}}, {{287},{ 9}}, {{159},{ 9}}, {{415},{ 9}}, {{ 95},{ 9}},\r
+{{351},{ 9}}, {{223},{ 9}}, {{479},{ 9}}, {{ 63},{ 9}}, {{319},{ 9}},\r
+{{191},{ 9}}, {{447},{ 9}}, {{127},{ 9}}, {{383},{ 9}}, {{255},{ 9}},\r
+{{511},{ 9}}, {{ 0},{ 7}}, {{ 64},{ 7}}, {{ 32},{ 7}}, {{ 96},{ 7}},\r
+{{ 16},{ 7}}, {{ 80},{ 7}}, {{ 48},{ 7}}, {{112},{ 7}}, {{ 8},{ 7}},\r
+{{ 72},{ 7}}, {{ 40},{ 7}}, {{104},{ 7}}, {{ 24},{ 7}}, {{ 88},{ 7}},\r
+{{ 56},{ 7}}, {{120},{ 7}}, {{ 4},{ 7}}, {{ 68},{ 7}}, {{ 36},{ 7}},\r
+{{100},{ 7}}, {{ 20},{ 7}}, {{ 84},{ 7}}, {{ 52},{ 7}}, {{116},{ 7}},\r
+{{ 3},{ 8}}, {{131},{ 8}}, {{ 67},{ 8}}, {{195},{ 8}}, {{ 35},{ 8}},\r
+{{163},{ 8}}, {{ 99},{ 8}}, {{227},{ 8}}\r
+};\r
+\r
+local const ct_data static_dtree[D_CODES] = {\r
+{{ 0},{ 5}}, {{16},{ 5}}, {{ 8},{ 5}}, {{24},{ 5}}, {{ 4},{ 5}},\r
+{{20},{ 5}}, {{12},{ 5}}, {{28},{ 5}}, {{ 2},{ 5}}, {{18},{ 5}},\r
+{{10},{ 5}}, {{26},{ 5}}, {{ 6},{ 5}}, {{22},{ 5}}, {{14},{ 5}},\r
+{{30},{ 5}}, {{ 1},{ 5}}, {{17},{ 5}}, {{ 9},{ 5}}, {{25},{ 5}},\r
+{{ 5},{ 5}}, {{21},{ 5}}, {{13},{ 5}}, {{29},{ 5}}, {{ 3},{ 5}},\r
+{{19},{ 5}}, {{11},{ 5}}, {{27},{ 5}}, {{ 7},{ 5}}, {{23},{ 5}}\r
+};\r
+\r
+const uch _dist_code[DIST_CODE_LEN] = {\r
+ 0, 1, 2, 3, 4, 4, 5, 5, 6, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8, 8,\r
+ 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10,\r
+10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11,\r
+11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12,\r
+12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13,\r
+13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13,\r
+13, 13, 13, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14,\r
+14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14,\r
+14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14,\r
+14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 15, 15, 15, 15, 15, 15, 15, 15,\r
+15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15,\r
+15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15,\r
+15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 0, 0, 16, 17,\r
+18, 18, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 22, 22, 22, 22, 22, 22, 22, 22,\r
+23, 23, 23, 23, 23, 23, 23, 23, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,\r
+24, 24, 24, 24, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25,\r
+26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26,\r
+26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 27, 27, 27, 27, 27, 27, 27, 27,\r
+27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27,\r
+27, 27, 27, 27, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28,\r
+28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28,\r
+28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28,\r
+28, 28, 28, 28, 28, 28, 28, 28, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29,\r
+29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29,\r
+29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29,\r
+29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29\r
+};\r
+\r
+const uch _length_code[MAX_MATCH-MIN_MATCH+1]= {\r
+ 0, 1, 2, 3, 4, 5, 6, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 12, 12,\r
+13, 13, 13, 13, 14, 14, 14, 14, 15, 15, 15, 15, 16, 16, 16, 16, 16, 16, 16, 16,\r
+17, 17, 17, 17, 17, 17, 17, 17, 18, 18, 18, 18, 18, 18, 18, 18, 19, 19, 19, 19,\r
+19, 19, 19, 19, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20,\r
+21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 22, 22, 22, 22,\r
+22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 23, 23, 23, 23, 23, 23, 23, 23,\r
+23, 23, 23, 23, 23, 23, 23, 23, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,\r
+24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,\r
+25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25,\r
+25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 26, 26, 26, 26, 26, 26, 26, 26,\r
+26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26,\r
+26, 26, 26, 26, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27,\r
+27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 28\r
+};\r
+\r
+local const int base_length[LENGTH_CODES] = {\r
+0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 16, 20, 24, 28, 32, 40, 48, 56,\r
+64, 80, 96, 112, 128, 160, 192, 224, 0\r
+};\r
+\r
+local const int base_dist[D_CODES] = {\r
+ 0, 1, 2, 3, 4, 6, 8, 12, 16, 24,\r
+ 32, 48, 64, 96, 128, 192, 256, 384, 512, 768,\r
+ 1024, 1536, 2048, 3072, 4096, 6144, 8192, 12288, 16384, 24576\r
+};\r
+\r
--- /dev/null
+/* zconf.h -- configuration of the zlib compression library\r
+ * Copyright (C) 1995-2005 Jean-loup Gailly.\r
+ * For conditions of distribution and use, see copyright notice in zlib.h\r
+ */\r
+\r
+/* @(#) $Id$ */\r
+\r
+#ifndef ZCONF_H\r
+#define ZCONF_H\r
+\r
+/*\r
+ * If you *really* need a unique prefix for all types and library functions,\r
+ * compile with -DZ_PREFIX. The "standard" zlib should be compiled without it.\r
+ */\r
+#ifdef Z_PREFIX\r
+# define deflateInit_ z_deflateInit_\r
+# define deflate z_deflate\r
+# define deflateEnd z_deflateEnd\r
+# define inflateInit_ z_inflateInit_\r
+# define inflate z_inflate\r
+# define inflateEnd z_inflateEnd\r
+# define deflateInit2_ z_deflateInit2_\r
+# define deflateSetDictionary z_deflateSetDictionary\r
+# define deflateCopy z_deflateCopy\r
+# define deflateReset z_deflateReset\r
+# define deflateParams z_deflateParams\r
+# define deflateBound z_deflateBound\r
+# define deflatePrime z_deflatePrime\r
+# define inflateInit2_ z_inflateInit2_\r
+# define inflateSetDictionary z_inflateSetDictionary\r
+# define inflateSync z_inflateSync\r
+# define inflateSyncPoint z_inflateSyncPoint\r
+# define inflateCopy z_inflateCopy\r
+# define inflateReset z_inflateReset\r
+# define inflateBack z_inflateBack\r
+# define inflateBackEnd z_inflateBackEnd\r
+# define compress z_compress\r
+# define compress2 z_compress2\r
+# define compressBound z_compressBound\r
+# define uncompress z_uncompress\r
+# define adler32 z_adler32\r
+# define crc32 z_crc32\r
+# define get_crc_table z_get_crc_table\r
+# define zError z_zError\r
+\r
+# define alloc_func z_alloc_func\r
+# define free_func z_free_func\r
+# define in_func z_in_func\r
+# define out_func z_out_func\r
+# define Byte z_Byte\r
+# define uInt z_uInt\r
+# define uLong z_uLong\r
+# define Bytef z_Bytef\r
+# define charf z_charf\r
+# define intf z_intf\r
+# define uIntf z_uIntf\r
+# define uLongf z_uLongf\r
+# define voidpf z_voidpf\r
+# define voidp z_voidp\r
+#endif\r
+\r
+#if defined(__MSDOS__) && !defined(MSDOS)\r
+# define MSDOS\r
+#endif\r
+#if (defined(OS_2) || defined(__OS2__)) && !defined(OS2)\r
+# define OS2\r
+#endif\r
+#if defined(_WINDOWS) && !defined(WINDOWS)\r
+# define WINDOWS\r
+#endif\r
+#if defined(_WIN32) || defined(_WIN32_WCE) || defined(__WIN32__)\r
+# ifndef WIN32\r
+# define WIN32\r
+# endif\r
+#endif\r
+#if (defined(MSDOS) || defined(OS2) || defined(WINDOWS)) && !defined(WIN32)\r
+# if !defined(__GNUC__) && !defined(__FLAT__) && !defined(__386__)\r
+# ifndef SYS16BIT\r
+# define SYS16BIT\r
+# endif\r
+# endif\r
+#endif\r
+\r
+/*\r
+ * Compile with -DMAXSEG_64K if the alloc function cannot allocate more\r
+ * than 64k bytes at a time (needed on systems with 16-bit int).\r
+ */\r
+#ifdef SYS16BIT\r
+# define MAXSEG_64K\r
+#endif\r
+#ifdef MSDOS\r
+# define UNALIGNED_OK\r
+#endif\r
+\r
+#ifdef __STDC_VERSION__\r
+# ifndef STDC\r
+# define STDC\r
+# endif\r
+# if __STDC_VERSION__ >= 199901L\r
+# ifndef STDC99\r
+# define STDC99\r
+# endif\r
+# endif\r
+#endif\r
+#if !defined(STDC) && (defined(__STDC__) || defined(__cplusplus))\r
+# define STDC\r
+#endif\r
+#if !defined(STDC) && (defined(__GNUC__) || defined(__BORLANDC__))\r
+# define STDC\r
+#endif\r
+#if !defined(STDC) && (defined(MSDOS) || defined(WINDOWS) || defined(WIN32))\r
+# define STDC\r
+#endif\r
+#if !defined(STDC) && (defined(OS2) || defined(__HOS_AIX__))\r
+# define STDC\r
+#endif\r
+\r
+#if defined(__OS400__) && !defined(STDC) /* iSeries (formerly AS/400). */\r
+# define STDC\r
+#endif\r
+\r
+#ifndef STDC\r
+# ifndef const /* cannot use !defined(STDC) && !defined(const) on Mac */\r
+# define const /* note: need a more gentle solution here */\r
+# endif\r
+#endif\r
+\r
+/* Some Mac compilers merge all .h files incorrectly: */\r
+#if defined(__MWERKS__)||defined(applec)||defined(THINK_C)||defined(__SC__)\r
+# define NO_DUMMY_DECL\r
+#endif\r
+\r
+/* Maximum value for memLevel in deflateInit2 */\r
+#ifndef MAX_MEM_LEVEL\r
+# ifdef MAXSEG_64K\r
+# define MAX_MEM_LEVEL 8\r
+# else\r
+# define MAX_MEM_LEVEL 9\r
+# endif\r
+#endif\r
+\r
+/* Maximum value for windowBits in deflateInit2 and inflateInit2.\r
+ * WARNING: reducing MAX_WBITS makes minigzip unable to extract .gz files\r
+ * created by gzip. (Files created by minigzip can still be extracted by\r
+ * gzip.)\r
+ */\r
+#ifndef MAX_WBITS\r
+# define MAX_WBITS 15 /* 32K LZ77 window */\r
+#endif\r
+\r
+/* The memory requirements for deflate are (in bytes):\r
+ (1 << (windowBits+2)) + (1 << (memLevel+9))\r
+ that is: 128K for windowBits=15 + 128K for memLevel = 8 (default values)\r
+ plus a few kilobytes for small objects. For example, if you want to reduce\r
+ the default memory requirements from 256K to 128K, compile with\r
+ make CFLAGS="-O -DMAX_WBITS=14 -DMAX_MEM_LEVEL=7"\r
+ Of course this will generally degrade compression (there's no free lunch).\r
+\r
+ The memory requirements for inflate are (in bytes) 1 << windowBits\r
+ that is, 32K for windowBits=15 (default value) plus a few kilobytes\r
+ for small objects.\r
+*/\r
+\r
+ /* Type declarations */\r
+\r
+#ifndef OF /* function prototypes */\r
+# ifdef STDC\r
+# define OF(args) args\r
+# else\r
+# define OF(args) ()\r
+# endif\r
+#endif\r
+\r
+/* The following definitions for FAR are needed only for MSDOS mixed\r
+ * model programming (small or medium model with some far allocations).\r
+ * This was tested only with MSC; for other MSDOS compilers you may have\r
+ * to define NO_MEMCPY in zutil.h. If you don't need the mixed model,\r
+ * just define FAR to be empty.\r
+ */\r
+#ifdef SYS16BIT\r
+# if defined(M_I86SM) || defined(M_I86MM)\r
+ /* MSC small or medium model */\r
+# define SMALL_MEDIUM\r
+# ifdef _MSC_VER\r
+# define FAR _far\r
+# else\r
+# define FAR far\r
+# endif\r
+# endif\r
+# if (defined(__SMALL__) || defined(__MEDIUM__))\r
+ /* Turbo C small or medium model */\r
+# define SMALL_MEDIUM\r
+# ifdef __BORLANDC__\r
+# define FAR _far\r
+# else\r
+# define FAR far\r
+# endif\r
+# endif\r
+#endif\r
+\r
+#if defined(WINDOWS) || defined(WIN32)\r
+ /* If building or using zlib as a DLL, define ZLIB_DLL.\r
+ * This is not mandatory, but it offers a little performance increase.\r
+ */\r
+# ifdef ZLIB_DLL\r
+# if defined(WIN32) && (!defined(__BORLANDC__) || (__BORLANDC__ >= 0x500))\r
+# ifdef ZLIB_INTERNAL\r
+# define ZEXTERN extern __declspec(dllexport)\r
+# else\r
+# define ZEXTERN extern __declspec(dllimport)\r
+# endif\r
+# endif\r
+# endif /* ZLIB_DLL */\r
+ /* If building or using zlib with the WINAPI/WINAPIV calling convention,\r
+ * define ZLIB_WINAPI.\r
+ * Caution: the standard ZLIB1.DLL is NOT compiled using ZLIB_WINAPI.\r
+ */\r
+# ifdef ZLIB_WINAPI\r
+# ifdef FAR\r
+# undef FAR\r
+# endif\r
+# include <windows.h>\r
+ /* No need for _export, use ZLIB.DEF instead. */\r
+ /* For complete Windows compatibility, use WINAPI, not __stdcall. */\r
+# define ZEXPORT WINAPI\r
+# ifdef WIN32\r
+# define ZEXPORTVA WINAPIV\r
+# else\r
+# define ZEXPORTVA FAR CDECL\r
+# endif\r
+# endif\r
+#endif\r
+\r
+#if defined (__BEOS__)\r
+# ifdef ZLIB_DLL\r
+# ifdef ZLIB_INTERNAL\r
+# define ZEXPORT __declspec(dllexport)\r
+# define ZEXPORTVA __declspec(dllexport)\r
+# else\r
+# define ZEXPORT __declspec(dllimport)\r
+# define ZEXPORTVA __declspec(dllimport)\r
+# endif\r
+# endif\r
+#endif\r
+\r
+#ifndef ZEXTERN\r
+# define ZEXTERN extern\r
+#endif\r
+#ifndef ZEXPORT\r
+# define ZEXPORT\r
+#endif\r
+#ifndef ZEXPORTVA\r
+# define ZEXPORTVA\r
+#endif\r
+\r
+#ifndef FAR\r
+# define FAR\r
+#endif\r
+\r
+#if !defined(__MACTYPES__)\r
+typedef unsigned char Byte; /* 8 bits */\r
+#endif\r
+typedef unsigned int uInt; /* 16 bits or more */\r
+typedef unsigned long uLong; /* 32 bits or more */\r
+\r
+#ifdef SMALL_MEDIUM\r
+ /* Borland C/C++ and some old MSC versions ignore FAR inside typedef */\r
+# define Bytef Byte FAR\r
+#else\r
+ typedef Byte FAR Bytef;\r
+#endif\r
+typedef char FAR charf;\r
+typedef int FAR intf;\r
+typedef uInt FAR uIntf;\r
+typedef uLong FAR uLongf;\r
+\r
+#ifdef STDC\r
+ typedef void const *voidpc;\r
+ typedef void FAR *voidpf;\r
+ typedef void *voidp;\r
+#else\r
+ typedef Byte const *voidpc;\r
+ typedef Byte FAR *voidpf;\r
+ typedef Byte *voidp;\r
+#endif\r
+\r
+#if 0 /* HAVE_UNISTD_H -- this line is updated by ./configure */\r
+# include <sys/types.h> /* for off_t */\r
+# include <unistd.h> /* for SEEK_* and off_t */\r
+# ifdef VMS\r
+# include <unixio.h> /* for off_t */\r
+# endif\r
+# define z_off_t off_t\r
+#endif\r
+#ifndef SEEK_SET\r
+# define SEEK_SET 0 /* Seek from beginning of file. */\r
+# define SEEK_CUR 1 /* Seek from current position. */\r
+# define SEEK_END 2 /* Set file pointer to EOF plus "offset" */\r
+#endif\r
+#ifndef z_off_t\r
+# define z_off_t long\r
+#endif\r
+\r
+#if defined(__OS400__)\r
+# define NO_vsnprintf\r
+#endif\r
+\r
+#if defined(__MVS__)\r
+# define NO_vsnprintf\r
+# ifdef FAR\r
+# undef FAR\r
+# endif\r
+#endif\r
+\r
+/* MVS linker does not support external names larger than 8 bytes */\r
+#if defined(__MVS__)\r
+# pragma map(deflateInit_,"DEIN")\r
+# pragma map(deflateInit2_,"DEIN2")\r
+# pragma map(deflateEnd,"DEEND")\r
+# pragma map(deflateBound,"DEBND")\r
+# pragma map(inflateInit_,"ININ")\r
+# pragma map(inflateInit2_,"ININ2")\r
+# pragma map(inflateEnd,"INEND")\r
+# pragma map(inflateSync,"INSY")\r
+# pragma map(inflateSetDictionary,"INSEDI")\r
+# pragma map(compressBound,"CMBND")\r
+# pragma map(inflate_table,"INTABL")\r
+# pragma map(inflate_fast,"INFA")\r
+# pragma map(inflate_copyright,"INCOPY")\r
+#endif\r
+\r
+#endif /* ZCONF_H */\r
--- /dev/null
+/* zlib.h -- interface of the 'zlib' general purpose compression library\r
+ version 1.2.3, July 18th, 2005\r
+\r
+ Copyright (C) 1995-2005 Jean-loup Gailly and Mark Adler\r
+\r
+ This software is provided 'as-is', without any express or implied\r
+ warranty. In no event will the authors be held liable for any damages\r
+ arising from the use of this software.\r
+\r
+ Permission is granted to anyone to use this software for any purpose,\r
+ including commercial applications, and to alter it and redistribute it\r
+ freely, subject to the following restrictions:\r
+\r
+ 1. The origin of this software must not be misrepresented; you must not\r
+ claim that you wrote the original software. If you use this software\r
+ in a product, an acknowledgment in the product documentation would be\r
+ appreciated but is not required.\r
+ 2. Altered source versions must be plainly marked as such, and must not be\r
+ misrepresented as being the original software.\r
+ 3. This notice may not be removed or altered from any source distribution.\r
+\r
+ Jean-loup Gailly Mark Adler\r
+ jloup@gzip.org madler@alumni.caltech.edu\r
+\r
+\r
+ The data format used by the zlib library is described by RFCs (Request for\r
+ Comments) 1950 to 1952 in the files http://www.ietf.org/rfc/rfc1950.txt\r
+ (zlib format), rfc1951.txt (deflate format) and rfc1952.txt (gzip format).\r
+*/\r
+\r
+#ifndef ZLIB_H\r
+#define ZLIB_H\r
+\r
+#include "zconf.h"\r
+\r
+#ifdef __cplusplus\r
+extern "C" {\r
+#endif\r
+\r
+#define ZLIB_VERSION "1.2.3"\r
+#define ZLIB_VERNUM 0x1230\r
+\r
+/*\r
+ The 'zlib' compression library provides in-memory compression and\r
+ decompression functions, including integrity checks of the uncompressed\r
+ data. This version of the library supports only one compression method\r
+ (deflation) but other algorithms will be added later and will have the same\r
+ stream interface.\r
+\r
+ Compression can be done in a single step if the buffers are large\r
+ enough (for example if an input file is mmap'ed), or can be done by\r
+ repeated calls of the compression function. In the latter case, the\r
+ application must provide more input and/or consume the output\r
+ (providing more output space) before each call.\r
+\r
+ The compressed data format used by default by the in-memory functions is\r
+ the zlib format, which is a zlib wrapper documented in RFC 1950, wrapped\r
+ around a deflate stream, which is itself documented in RFC 1951.\r
+\r
+ The library also supports reading and writing files in gzip (.gz) format\r
+ with an interface similar to that of stdio using the functions that start\r
+ with "gz". The gzip format is different from the zlib format. gzip is a\r
+ gzip wrapper, documented in RFC 1952, wrapped around a deflate stream.\r
+\r
+ This library can optionally read and write gzip streams in memory as well.\r
+\r
+ The zlib format was designed to be compact and fast for use in memory\r
+ and on communications channels. The gzip format was designed for single-\r
+ file compression on file systems, has a larger header than zlib to maintain\r
+ directory information, and uses a different, slower check method than zlib.\r
+\r
+ The library does not install any signal handler. The decoder checks\r
+ the consistency of the compressed data, so the library should never\r
+ crash even in case of corrupted input.\r
+*/\r
+\r
+typedef voidpf (*alloc_func) OF((voidpf opaque, uInt items, uInt size));\r
+typedef void (*free_func) OF((voidpf opaque, voidpf address));\r
+\r
+struct internal_state;\r
+\r
+typedef struct z_stream_s {\r
+ Bytef *next_in; /* next input byte */\r
+ uInt avail_in; /* number of bytes available at next_in */\r
+ uLong total_in; /* total nb of input bytes read so far */\r
+\r
+ Bytef *next_out; /* next output byte should be put there */\r
+ uInt avail_out; /* remaining free space at next_out */\r
+ uLong total_out; /* total nb of bytes output so far */\r
+\r
+ char *msg; /* last error message, NULL if no error */\r
+ struct internal_state FAR *state; /* not visible by applications */\r
+\r
+ alloc_func zalloc; /* used to allocate the internal state */\r
+ free_func zfree; /* used to free the internal state */\r
+ voidpf opaque; /* private data object passed to zalloc and zfree */\r
+\r
+ int data_type; /* best guess about the data type: binary or text */\r
+ uLong adler; /* adler32 value of the uncompressed data */\r
+ uLong reserved; /* reserved for future use */\r
+} z_stream;\r
+\r
+typedef z_stream FAR *z_streamp;\r
+\r
+/*\r
+ gzip header information passed to and from zlib routines. See RFC 1952\r
+ for more details on the meanings of these fields.\r
+*/\r
+typedef struct gz_header_s {\r
+ int text; /* true if compressed data believed to be text */\r
+ uLong time; /* modification time */\r
+ int xflags; /* extra flags (not used when writing a gzip file) */\r
+ int os; /* operating system */\r
+ Bytef *extra; /* pointer to extra field or Z_NULL if none */\r
+ uInt extra_len; /* extra field length (valid if extra != Z_NULL) */\r
+ uInt extra_max; /* space at extra (only when reading header) */\r
+ Bytef *name; /* pointer to zero-terminated file name or Z_NULL */\r
+ uInt name_max; /* space at name (only when reading header) */\r
+ Bytef *comment; /* pointer to zero-terminated comment or Z_NULL */\r
+ uInt comm_max; /* space at comment (only when reading header) */\r
+ int hcrc; /* true if there was or will be a header crc */\r
+ int done; /* true when done reading gzip header (not used\r
+ when writing a gzip file) */\r
+} gz_header;\r
+\r
+typedef gz_header FAR *gz_headerp;\r
+\r
+/*\r
+ The application must update next_in and avail_in when avail_in has\r
+ dropped to zero. It must update next_out and avail_out when avail_out\r
+ has dropped to zero. The application must initialize zalloc, zfree and\r
+ opaque before calling the init function. All other fields are set by the\r
+ compression library and must not be updated by the application.\r
+\r
+ The opaque value provided by the application will be passed as the first\r
+ parameter for calls of zalloc and zfree. This can be useful for custom\r
+ memory management. The compression library attaches no meaning to the\r
+ opaque value.\r
+\r
+ zalloc must return Z_NULL if there is not enough memory for the object.\r
+ If zlib is used in a multi-threaded application, zalloc and zfree must be\r
+ thread safe.\r
+\r
+ On 16-bit systems, the functions zalloc and zfree must be able to allocate\r
+ exactly 65536 bytes, but will not be required to allocate more than this\r
+ if the symbol MAXSEG_64K is defined (see zconf.h). WARNING: On MSDOS,\r
+ pointers returned by zalloc for objects of exactly 65536 bytes *must*\r
+ have their offset normalized to zero. The default allocation function\r
+ provided by this library ensures this (see zutil.c). To reduce memory\r
+ requirements and avoid any allocation of 64K objects, at the expense of\r
+ compression ratio, compile the library with -DMAX_WBITS=14 (see zconf.h).\r
+\r
+ The fields total_in and total_out can be used for statistics or\r
+ progress reports. After compression, total_in holds the total size of\r
+ the uncompressed data and may be saved for use in the decompressor\r
+ (particularly if the decompressor wants to decompress everything in\r
+ a single step).\r
+*/\r
+\r
+ /* constants */\r
+\r
+#define Z_NO_FLUSH 0\r
+#define Z_PARTIAL_FLUSH 1 /* will be removed, use Z_SYNC_FLUSH instead */\r
+#define Z_SYNC_FLUSH 2\r
+#define Z_FULL_FLUSH 3\r
+#define Z_FINISH 4\r
+#define Z_BLOCK 5\r
+/* Allowed flush values; see deflate() and inflate() below for details */\r
+\r
+#define Z_OK 0\r
+#define Z_STREAM_END 1\r
+#define Z_NEED_DICT 2\r
+#define Z_ERRNO (-1)\r
+#define Z_STREAM_ERROR (-2)\r
+#define Z_DATA_ERROR (-3)\r
+#define Z_MEM_ERROR (-4)\r
+#define Z_BUF_ERROR (-5)\r
+#define Z_VERSION_ERROR (-6)\r
+/* Return codes for the compression/decompression functions. Negative\r
+ * values are errors, positive values are used for special but normal events.\r
+ */\r
+\r
+#define Z_NO_COMPRESSION 0\r
+#define Z_BEST_SPEED 1\r
+#define Z_BEST_COMPRESSION 9\r
+#define Z_DEFAULT_COMPRESSION (-1)\r
+/* compression levels */\r
+\r
+#define Z_FILTERED 1\r
+#define Z_HUFFMAN_ONLY 2\r
+#define Z_RLE 3\r
+#define Z_FIXED 4\r
+#define Z_DEFAULT_STRATEGY 0\r
+/* compression strategy; see deflateInit2() below for details */\r
+\r
+#define Z_BINARY 0\r
+#define Z_TEXT 1\r
+#define Z_ASCII Z_TEXT /* for compatibility with 1.2.2 and earlier */\r
+#define Z_UNKNOWN 2\r
+/* Possible values of the data_type field (though see inflate()) */\r
+\r
+#define Z_DEFLATED 8\r
+/* The deflate compression method (the only one supported in this version) */\r
+\r
+#define Z_NULL 0 /* for initializing zalloc, zfree, opaque */\r
+\r
+#define zlib_version zlibVersion()\r
+/* for compatibility with versions < 1.0.2 */\r
+\r
+ /* basic functions */\r
+\r
+ZEXTERN const char * ZEXPORT zlibVersion OF((void));\r
+/* The application can compare zlibVersion and ZLIB_VERSION for consistency.\r
+ If the first character differs, the library code actually used is\r
+ not compatible with the zlib.h header file used by the application.\r
+ This check is automatically made by deflateInit and inflateInit.\r
+ */\r
+\r
+/*\r
+ZEXTERN int ZEXPORT deflateInit OF((z_streamp strm, int level));\r
+\r
+ Initializes the internal stream state for compression. The fields\r
+ zalloc, zfree and opaque must be initialized before by the caller.\r
+ If zalloc and zfree are set to Z_NULL, deflateInit updates them to\r
+ use default allocation functions.\r
+\r
+ The compression level must be Z_DEFAULT_COMPRESSION, or between 0 and 9:\r
+ 1 gives best speed, 9 gives best compression, 0 gives no compression at\r
+ all (the input data is simply copied a block at a time).\r
+ Z_DEFAULT_COMPRESSION requests a default compromise between speed and\r
+ compression (currently equivalent to level 6).\r
+\r
+ deflateInit returns Z_OK if success, Z_MEM_ERROR if there was not\r
+ enough memory, Z_STREAM_ERROR if level is not a valid compression level,\r
+ Z_VERSION_ERROR if the zlib library version (zlib_version) is incompatible\r
+ with the version assumed by the caller (ZLIB_VERSION).\r
+ msg is set to null if there is no error message. deflateInit does not\r
+ perform any compression: this will be done by deflate().\r
+*/\r
+\r
+\r
+ZEXTERN int ZEXPORT deflate OF((z_streamp strm, int flush));\r
+/*\r
+ deflate compresses as much data as possible, and stops when the input\r
+ buffer becomes empty or the output buffer becomes full. It may introduce some\r
+ output latency (reading input without producing any output) except when\r
+ forced to flush.\r
+\r
+ The detailed semantics are as follows. deflate performs one or both of the\r
+ following actions:\r
+\r
+ - Compress more input starting at next_in and update next_in and avail_in\r
+ accordingly. If not all input can be processed (because there is not\r
+ enough room in the output buffer), next_in and avail_in are updated and\r
+ processing will resume at this point for the next call of deflate().\r
+\r
+ - Provide more output starting at next_out and update next_out and avail_out\r
+ accordingly. This action is forced if the parameter flush is non zero.\r
+ Forcing flush frequently degrades the compression ratio, so this parameter\r
+ should be set only when necessary (in interactive applications).\r
+ Some output may be provided even if flush is not set.\r
+\r
+ Before the call of deflate(), the application should ensure that at least\r
+ one of the actions is possible, by providing more input and/or consuming\r
+ more output, and updating avail_in or avail_out accordingly; avail_out\r
+ should never be zero before the call. The application can consume the\r
+ compressed output when it wants, for example when the output buffer is full\r
+ (avail_out == 0), or after each call of deflate(). If deflate returns Z_OK\r
+ and with zero avail_out, it must be called again after making room in the\r
+ output buffer because there might be more output pending.\r
+\r
+ Normally the parameter flush is set to Z_NO_FLUSH, which allows deflate to\r
+ decide how much data to accumualte before producing output, in order to\r
+ maximize compression.\r
+\r
+ If the parameter flush is set to Z_SYNC_FLUSH, all pending output is\r
+ flushed to the output buffer and the output is aligned on a byte boundary, so\r
+ that the decompressor can get all input data available so far. (In particular\r
+ avail_in is zero after the call if enough output space has been provided\r
+ before the call.) Flushing may degrade compression for some compression\r
+ algorithms and so it should be used only when necessary.\r
+\r
+ If flush is set to Z_FULL_FLUSH, all output is flushed as with\r
+ Z_SYNC_FLUSH, and the compression state is reset so that decompression can\r
+ restart from this point if previous compressed data has been damaged or if\r
+ random access is desired. Using Z_FULL_FLUSH too often can seriously degrade\r
+ compression.\r
+\r
+ If deflate returns with avail_out == 0, this function must be called again\r
+ with the same value of the flush parameter and more output space (updated\r
+ avail_out), until the flush is complete (deflate returns with non-zero\r
+ avail_out). In the case of a Z_FULL_FLUSH or Z_SYNC_FLUSH, make sure that\r
+ avail_out is greater than six to avoid repeated flush markers due to\r
+ avail_out == 0 on return.\r
+\r
+ If the parameter flush is set to Z_FINISH, pending input is processed,\r
+ pending output is flushed and deflate returns with Z_STREAM_END if there\r
+ was enough output space; if deflate returns with Z_OK, this function must be\r
+ called again with Z_FINISH and more output space (updated avail_out) but no\r
+ more input data, until it returns with Z_STREAM_END or an error. After\r
+ deflate has returned Z_STREAM_END, the only possible operations on the\r
+ stream are deflateReset or deflateEnd.\r
+\r
+ Z_FINISH can be used immediately after deflateInit if all the compression\r
+ is to be done in a single step. In this case, avail_out must be at least\r
+ the value returned by deflateBound (see below). If deflate does not return\r
+ Z_STREAM_END, then it must be called again as described above.\r
+\r
+ deflate() sets strm->adler to the adler32 checksum of all input read\r
+ so far (that is, total_in bytes).\r
+\r
+ deflate() may update strm->data_type if it can make a good guess about\r
+ the input data type (Z_BINARY or Z_TEXT). In doubt, the data is considered\r
+ binary. This field is only for information purposes and does not affect\r
+ the compression algorithm in any manner.\r
+\r
+ deflate() returns Z_OK if some progress has been made (more input\r
+ processed or more output produced), Z_STREAM_END if all input has been\r
+ consumed and all output has been produced (only when flush is set to\r
+ Z_FINISH), Z_STREAM_ERROR if the stream state was inconsistent (for example\r
+ if next_in or next_out was NULL), Z_BUF_ERROR if no progress is possible\r
+ (for example avail_in or avail_out was zero). Note that Z_BUF_ERROR is not\r
+ fatal, and deflate() can be called again with more input and more output\r
+ space to continue compressing.\r
+*/\r
+\r
+\r
+ZEXTERN int ZEXPORT deflateEnd OF((z_streamp strm));\r
+/*\r
+ All dynamically allocated data structures for this stream are freed.\r
+ This function discards any unprocessed input and does not flush any\r
+ pending output.\r
+\r
+ deflateEnd returns Z_OK if success, Z_STREAM_ERROR if the\r
+ stream state was inconsistent, Z_DATA_ERROR if the stream was freed\r
+ prematurely (some input or output was discarded). In the error case,\r
+ msg may be set but then points to a static string (which must not be\r
+ deallocated).\r
+*/\r
+\r
+\r
+/*\r
+ZEXTERN int ZEXPORT inflateInit OF((z_streamp strm));\r
+\r
+ Initializes the internal stream state for decompression. The fields\r
+ next_in, avail_in, zalloc, zfree and opaque must be initialized before by\r
+ the caller. If next_in is not Z_NULL and avail_in is large enough (the exact\r
+ value depends on the compression method), inflateInit determines the\r
+ compression method from the zlib header and allocates all data structures\r
+ accordingly; otherwise the allocation will be deferred to the first call of\r
+ inflate. If zalloc and zfree are set to Z_NULL, inflateInit updates them to\r
+ use default allocation functions.\r
+\r
+ inflateInit returns Z_OK if success, Z_MEM_ERROR if there was not enough\r
+ memory, Z_VERSION_ERROR if the zlib library version is incompatible with the\r
+ version assumed by the caller. msg is set to null if there is no error\r
+ message. inflateInit does not perform any decompression apart from reading\r
+ the zlib header if present: this will be done by inflate(). (So next_in and\r
+ avail_in may be modified, but next_out and avail_out are unchanged.)\r
+*/\r
+\r
+\r
+ZEXTERN int ZEXPORT inflate OF((z_streamp strm, int flush));\r
+/*\r
+ inflate decompresses as much data as possible, and stops when the input\r
+ buffer becomes empty or the output buffer becomes full. It may introduce\r
+ some output latency (reading input without producing any output) except when\r
+ forced to flush.\r
+\r
+ The detailed semantics are as follows. inflate performs one or both of the\r
+ following actions:\r
+\r
+ - Decompress more input starting at next_in and update next_in and avail_in\r
+ accordingly. If not all input can be processed (because there is not\r
+ enough room in the output buffer), next_in is updated and processing\r
+ will resume at this point for the next call of inflate().\r
+\r
+ - Provide more output starting at next_out and update next_out and avail_out\r
+ accordingly. inflate() provides as much output as possible, until there\r
+ is no more input data or no more space in the output buffer (see below\r
+ about the flush parameter).\r
+\r
+ Before the call of inflate(), the application should ensure that at least\r
+ one of the actions is possible, by providing more input and/or consuming\r
+ more output, and updating the next_* and avail_* values accordingly.\r
+ The application can consume the uncompressed output when it wants, for\r
+ example when the output buffer is full (avail_out == 0), or after each\r
+ call of inflate(). If inflate returns Z_OK and with zero avail_out, it\r
+ must be called again after making room in the output buffer because there\r
+ might be more output pending.\r
+\r
+ The flush parameter of inflate() can be Z_NO_FLUSH, Z_SYNC_FLUSH,\r
+ Z_FINISH, or Z_BLOCK. Z_SYNC_FLUSH requests that inflate() flush as much\r
+ output as possible to the output buffer. Z_BLOCK requests that inflate() stop\r
+ if and when it gets to the next deflate block boundary. When decoding the\r
+ zlib or gzip format, this will cause inflate() to return immediately after\r
+ the header and before the first block. When doing a raw inflate, inflate()\r
+ will go ahead and process the first block, and will return when it gets to\r
+ the end of that block, or when it runs out of data.\r
+\r
+ The Z_BLOCK option assists in appending to or combining deflate streams.\r
+ Also to assist in this, on return inflate() will set strm->data_type to the\r
+ number of unused bits in the last byte taken from strm->next_in, plus 64\r
+ if inflate() is currently decoding the last block in the deflate stream,\r
+ plus 128 if inflate() returned immediately after decoding an end-of-block\r
+ code or decoding the complete header up to just before the first byte of the\r
+ deflate stream. The end-of-block will not be indicated until all of the\r
+ uncompressed data from that block has been written to strm->next_out. The\r
+ number of unused bits may in general be greater than seven, except when\r
+ bit 7 of data_type is set, in which case the number of unused bits will be\r
+ less than eight.\r
+\r
+ inflate() should normally be called until it returns Z_STREAM_END or an\r
+ error. However if all decompression is to be performed in a single step\r
+ (a single call of inflate), the parameter flush should be set to\r
+ Z_FINISH. In this case all pending input is processed and all pending\r
+ output is flushed; avail_out must be large enough to hold all the\r
+ uncompressed data. (The size of the uncompressed data may have been saved\r
+ by the compressor for this purpose.) The next operation on this stream must\r
+ be inflateEnd to deallocate the decompression state. The use of Z_FINISH\r
+ is never required, but can be used to inform inflate that a faster approach\r
+ may be used for the single inflate() call.\r
+\r
+ In this implementation, inflate() always flushes as much output as\r
+ possible to the output buffer, and always uses the faster approach on the\r
+ first call. So the only effect of the flush parameter in this implementation\r
+ is on the return value of inflate(), as noted below, or when it returns early\r
+ because Z_BLOCK is used.\r
+\r
+ If a preset dictionary is needed after this call (see inflateSetDictionary\r
+ below), inflate sets strm->adler to the adler32 checksum of the dictionary\r
+ chosen by the compressor and returns Z_NEED_DICT; otherwise it sets\r
+ strm->adler to the adler32 checksum of all output produced so far (that is,\r
+ total_out bytes) and returns Z_OK, Z_STREAM_END or an error code as described\r
+ below. At the end of the stream, inflate() checks that its computed adler32\r
+ checksum is equal to that saved by the compressor and returns Z_STREAM_END\r
+ only if the checksum is correct.\r
+\r
+ inflate() will decompress and check either zlib-wrapped or gzip-wrapped\r
+ deflate data. The header type is detected automatically. Any information\r
+ contained in the gzip header is not retained, so applications that need that\r
+ information should instead use raw inflate, see inflateInit2() below, or\r
+ inflateBack() and perform their own processing of the gzip header and\r
+ trailer.\r
+\r
+ inflate() returns Z_OK if some progress has been made (more input processed\r
+ or more output produced), Z_STREAM_END if the end of the compressed data has\r
+ been reached and all uncompressed output has been produced, Z_NEED_DICT if a\r
+ preset dictionary is needed at this point, Z_DATA_ERROR if the input data was\r
+ corrupted (input stream not conforming to the zlib format or incorrect check\r
+ value), Z_STREAM_ERROR if the stream structure was inconsistent (for example\r
+ if next_in or next_out was NULL), Z_MEM_ERROR if there was not enough memory,\r
+ Z_BUF_ERROR if no progress is possible or if there was not enough room in the\r
+ output buffer when Z_FINISH is used. Note that Z_BUF_ERROR is not fatal, and\r
+ inflate() can be called again with more input and more output space to\r
+ continue decompressing. If Z_DATA_ERROR is returned, the application may then\r
+ call inflateSync() to look for a good compression block if a partial recovery\r
+ of the data is desired.\r
+*/\r
+\r
+\r
+ZEXTERN int ZEXPORT inflateEnd OF((z_streamp strm));\r
+/*\r
+ All dynamically allocated data structures for this stream are freed.\r
+ This function discards any unprocessed input and does not flush any\r
+ pending output.\r
+\r
+ inflateEnd returns Z_OK if success, Z_STREAM_ERROR if the stream state\r
+ was inconsistent. In the error case, msg may be set but then points to a\r
+ static string (which must not be deallocated).\r
+*/\r
+\r
+ /* Advanced functions */\r
+\r
+/*\r
+ The following functions are needed only in some special applications.\r
+*/\r
+\r
+/*\r
+ZEXTERN int ZEXPORT deflateInit2 OF((z_streamp strm,\r
+ int level,\r
+ int method,\r
+ int windowBits,\r
+ int memLevel,\r
+ int strategy));\r
+\r
+ This is another version of deflateInit with more compression options. The\r
+ fields next_in, zalloc, zfree and opaque must be initialized before by\r
+ the caller.\r
+\r
+ The method parameter is the compression method. It must be Z_DEFLATED in\r
+ this version of the library.\r
+\r
+ The windowBits parameter is the base two logarithm of the window size\r
+ (the size of the history buffer). It should be in the range 8..15 for this\r
+ version of the library. Larger values of this parameter result in better\r
+ compression at the expense of memory usage. The default value is 15 if\r
+ deflateInit is used instead.\r
+\r
+ windowBits can also be -8..-15 for raw deflate. In this case, -windowBits\r
+ determines the window size. deflate() will then generate raw deflate data\r
+ with no zlib header or trailer, and will not compute an adler32 check value.\r
+\r
+ windowBits can also be greater than 15 for optional gzip encoding. Add\r
+ 16 to windowBits to write a simple gzip header and trailer around the\r
+ compressed data instead of a zlib wrapper. The gzip header will have no\r
+ file name, no extra data, no comment, no modification time (set to zero),\r
+ no header crc, and the operating system will be set to 255 (unknown). If a\r
+ gzip stream is being written, strm->adler is a crc32 instead of an adler32.\r
+\r
+ The memLevel parameter specifies how much memory should be allocated\r
+ for the internal compression state. memLevel=1 uses minimum memory but\r
+ is slow and reduces compression ratio; memLevel=9 uses maximum memory\r
+ for optimal speed. The default value is 8. See zconf.h for total memory\r
+ usage as a function of windowBits and memLevel.\r
+\r
+ The strategy parameter is used to tune the compression algorithm. Use the\r
+ value Z_DEFAULT_STRATEGY for normal data, Z_FILTERED for data produced by a\r
+ filter (or predictor), Z_HUFFMAN_ONLY to force Huffman encoding only (no\r
+ string match), or Z_RLE to limit match distances to one (run-length\r
+ encoding). Filtered data consists mostly of small values with a somewhat\r
+ random distribution. In this case, the compression algorithm is tuned to\r
+ compress them better. The effect of Z_FILTERED is to force more Huffman\r
+ coding and less string matching; it is somewhat intermediate between\r
+ Z_DEFAULT and Z_HUFFMAN_ONLY. Z_RLE is designed to be almost as fast as\r
+ Z_HUFFMAN_ONLY, but give better compression for PNG image data. The strategy\r
+ parameter only affects the compression ratio but not the correctness of the\r
+ compressed output even if it is not set appropriately. Z_FIXED prevents the\r
+ use of dynamic Huffman codes, allowing for a simpler decoder for special\r
+ applications.\r
+\r
+ deflateInit2 returns Z_OK if success, Z_MEM_ERROR if there was not enough\r
+ memory, Z_STREAM_ERROR if a parameter is invalid (such as an invalid\r
+ method). msg is set to null if there is no error message. deflateInit2 does\r
+ not perform any compression: this will be done by deflate().\r
+*/\r
+\r
+ZEXTERN int ZEXPORT deflateSetDictionary OF((z_streamp strm,\r
+ const Bytef *dictionary,\r
+ uInt dictLength));\r
+/*\r
+ Initializes the compression dictionary from the given byte sequence\r
+ without producing any compressed output. This function must be called\r
+ immediately after deflateInit, deflateInit2 or deflateReset, before any\r
+ call of deflate. The compressor and decompressor must use exactly the same\r
+ dictionary (see inflateSetDictionary).\r
+\r
+ The dictionary should consist of strings (byte sequences) that are likely\r
+ to be encountered later in the data to be compressed, with the most commonly\r
+ used strings preferably put towards the end of the dictionary. Using a\r
+ dictionary is most useful when the data to be compressed is short and can be\r
+ predicted with good accuracy; the data can then be compressed better than\r
+ with the default empty dictionary.\r
+\r
+ Depending on the size of the compression data structures selected by\r
+ deflateInit or deflateInit2, a part of the dictionary may in effect be\r
+ discarded, for example if the dictionary is larger than the window size in\r
+ deflate or deflate2. Thus the strings most likely to be useful should be\r
+ put at the end of the dictionary, not at the front. In addition, the\r
+ current implementation of deflate will use at most the window size minus\r
+ 262 bytes of the provided dictionary.\r
+\r
+ Upon return of this function, strm->adler is set to the adler32 value\r
+ of the dictionary; the decompressor may later use this value to determine\r
+ which dictionary has been used by the compressor. (The adler32 value\r
+ applies to the whole dictionary even if only a subset of the dictionary is\r
+ actually used by the compressor.) If a raw deflate was requested, then the\r
+ adler32 value is not computed and strm->adler is not set.\r
+\r
+ deflateSetDictionary returns Z_OK if success, or Z_STREAM_ERROR if a\r
+ parameter is invalid (such as NULL dictionary) or the stream state is\r
+ inconsistent (for example if deflate has already been called for this stream\r
+ or if the compression method is bsort). deflateSetDictionary does not\r
+ perform any compression: this will be done by deflate().\r
+*/\r
+\r
+ZEXTERN int ZEXPORT deflateCopy OF((z_streamp dest,\r
+ z_streamp source));\r
+/*\r
+ Sets the destination stream as a complete copy of the source stream.\r
+\r
+ This function can be useful when several compression strategies will be\r
+ tried, for example when there are several ways of pre-processing the input\r
+ data with a filter. The streams that will be discarded should then be freed\r
+ by calling deflateEnd. Note that deflateCopy duplicates the internal\r
+ compression state which can be quite large, so this strategy is slow and\r
+ can consume lots of memory.\r
+\r
+ deflateCopy returns Z_OK if success, Z_MEM_ERROR if there was not\r
+ enough memory, Z_STREAM_ERROR if the source stream state was inconsistent\r
+ (such as zalloc being NULL). msg is left unchanged in both source and\r
+ destination.\r
+*/\r
+\r
+ZEXTERN int ZEXPORT deflateReset OF((z_streamp strm));\r
+/*\r
+ This function is equivalent to deflateEnd followed by deflateInit,\r
+ but does not free and reallocate all the internal compression state.\r
+ The stream will keep the same compression level and any other attributes\r
+ that may have been set by deflateInit2.\r
+\r
+ deflateReset returns Z_OK if success, or Z_STREAM_ERROR if the source\r
+ stream state was inconsistent (such as zalloc or state being NULL).\r
+*/\r
+\r
+ZEXTERN int ZEXPORT deflateParams OF((z_streamp strm,\r
+ int level,\r
+ int strategy));\r
+/*\r
+ Dynamically update the compression level and compression strategy. The\r
+ interpretation of level and strategy is as in deflateInit2. This can be\r
+ used to switch between compression and straight copy of the input data, or\r
+ to switch to a different kind of input data requiring a different\r
+ strategy. If the compression level is changed, the input available so far\r
+ is compressed with the old level (and may be flushed); the new level will\r
+ take effect only at the next call of deflate().\r
+\r
+ Before the call of deflateParams, the stream state must be set as for\r
+ a call of deflate(), since the currently available input may have to\r
+ be compressed and flushed. In particular, strm->avail_out must be non-zero.\r
+\r
+ deflateParams returns Z_OK if success, Z_STREAM_ERROR if the source\r
+ stream state was inconsistent or if a parameter was invalid, Z_BUF_ERROR\r
+ if strm->avail_out was zero.\r
+*/\r
+\r
+ZEXTERN int ZEXPORT deflateTune OF((z_streamp strm,\r
+ int good_length,\r
+ int max_lazy,\r
+ int nice_length,\r
+ int max_chain));\r
+/*\r
+ Fine tune deflate's internal compression parameters. This should only be\r
+ used by someone who understands the algorithm used by zlib's deflate for\r
+ searching for the best matching string, and even then only by the most\r
+ fanatic optimizer trying to squeeze out the last compressed bit for their\r
+ specific input data. Read the deflate.c source code for the meaning of the\r
+ max_lazy, good_length, nice_length, and max_chain parameters.\r
+\r
+ deflateTune() can be called after deflateInit() or deflateInit2(), and\r
+ returns Z_OK on success, or Z_STREAM_ERROR for an invalid deflate stream.\r
+ */\r
+\r
+ZEXTERN uLong ZEXPORT deflateBound OF((z_streamp strm,\r
+ uLong sourceLen));\r
+/*\r
+ deflateBound() returns an upper bound on the compressed size after\r
+ deflation of sourceLen bytes. It must be called after deflateInit()\r
+ or deflateInit2(). This would be used to allocate an output buffer\r
+ for deflation in a single pass, and so would be called before deflate().\r
+*/\r
+\r
+ZEXTERN int ZEXPORT deflatePrime OF((z_streamp strm,\r
+ int bits,\r
+ int value));\r
+/*\r
+ deflatePrime() inserts bits in the deflate output stream. The intent\r
+ is that this function is used to start off the deflate output with the\r
+ bits leftover from a previous deflate stream when appending to it. As such,\r
+ this function can only be used for raw deflate, and must be used before the\r
+ first deflate() call after a deflateInit2() or deflateReset(). bits must be\r
+ less than or equal to 16, and that many of the least significant bits of\r
+ value will be inserted in the output.\r
+\r
+ deflatePrime returns Z_OK if success, or Z_STREAM_ERROR if the source\r
+ stream state was inconsistent.\r
+*/\r
+\r
+ZEXTERN int ZEXPORT deflateSetHeader OF((z_streamp strm,\r
+ gz_headerp head));\r
+/*\r
+ deflateSetHeader() provides gzip header information for when a gzip\r
+ stream is requested by deflateInit2(). deflateSetHeader() may be called\r
+ after deflateInit2() or deflateReset() and before the first call of\r
+ deflate(). The text, time, os, extra field, name, and comment information\r
+ in the provided gz_header structure are written to the gzip header (xflag is\r
+ ignored -- the extra flags are set according to the compression level). The\r
+ caller must assure that, if not Z_NULL, name and comment are terminated with\r
+ a zero byte, and that if extra is not Z_NULL, that extra_len bytes are\r
+ available there. If hcrc is true, a gzip header crc is included. Note that\r
+ the current versions of the command-line version of gzip (up through version\r
+ 1.3.x) do not support header crc's, and will report that it is a "multi-part\r
+ gzip file" and give up.\r
+\r
+ If deflateSetHeader is not used, the default gzip header has text false,\r
+ the time set to zero, and os set to 255, with no extra, name, or comment\r
+ fields. The gzip header is returned to the default state by deflateReset().\r
+\r
+ deflateSetHeader returns Z_OK if success, or Z_STREAM_ERROR if the source\r
+ stream state was inconsistent.\r
+*/\r
+\r
+/*\r
+ZEXTERN int ZEXPORT inflateInit2 OF((z_streamp strm,\r
+ int windowBits));\r
+\r
+ This is another version of inflateInit with an extra parameter. The\r
+ fields next_in, avail_in, zalloc, zfree and opaque must be initialized\r
+ before by the caller.\r
+\r
+ The windowBits parameter is the base two logarithm of the maximum window\r
+ size (the size of the history buffer). It should be in the range 8..15 for\r
+ this version of the library. The default value is 15 if inflateInit is used\r
+ instead. windowBits must be greater than or equal to the windowBits value\r
+ provided to deflateInit2() while compressing, or it must be equal to 15 if\r
+ deflateInit2() was not used. If a compressed stream with a larger window\r
+ size is given as input, inflate() will return with the error code\r
+ Z_DATA_ERROR instead of trying to allocate a larger window.\r
+\r
+ windowBits can also be -8..-15 for raw inflate. In this case, -windowBits\r
+ determines the window size. inflate() will then process raw deflate data,\r
+ not looking for a zlib or gzip header, not generating a check value, and not\r
+ looking for any check values for comparison at the end of the stream. This\r
+ is for use with other formats that use the deflate compressed data format\r
+ such as zip. Those formats provide their own check values. If a custom\r
+ format is developed using the raw deflate format for compressed data, it is\r
+ recommended that a check value such as an adler32 or a crc32 be applied to\r
+ the uncompressed data as is done in the zlib, gzip, and zip formats. For\r
+ most applications, the zlib format should be used as is. Note that comments\r
+ above on the use in deflateInit2() applies to the magnitude of windowBits.\r
+\r
+ windowBits can also be greater than 15 for optional gzip decoding. Add\r
+ 32 to windowBits to enable zlib and gzip decoding with automatic header\r
+ detection, or add 16 to decode only the gzip format (the zlib format will\r
+ return a Z_DATA_ERROR). If a gzip stream is being decoded, strm->adler is\r
+ a crc32 instead of an adler32.\r
+\r
+ inflateInit2 returns Z_OK if success, Z_MEM_ERROR if there was not enough\r
+ memory, Z_STREAM_ERROR if a parameter is invalid (such as a null strm). msg\r
+ is set to null if there is no error message. inflateInit2 does not perform\r
+ any decompression apart from reading the zlib header if present: this will\r
+ be done by inflate(). (So next_in and avail_in may be modified, but next_out\r
+ and avail_out are unchanged.)\r
+*/\r
+\r
+ZEXTERN int ZEXPORT inflateSetDictionary OF((z_streamp strm,\r
+ const Bytef *dictionary,\r
+ uInt dictLength));\r
+/*\r
+ Initializes the decompression dictionary from the given uncompressed byte\r
+ sequence. This function must be called immediately after a call of inflate,\r
+ if that call returned Z_NEED_DICT. The dictionary chosen by the compressor\r
+ can be determined from the adler32 value returned by that call of inflate.\r
+ The compressor and decompressor must use exactly the same dictionary (see\r
+ deflateSetDictionary). For raw inflate, this function can be called\r
+ immediately after inflateInit2() or inflateReset() and before any call of\r
+ inflate() to set the dictionary. The application must insure that the\r
+ dictionary that was used for compression is provided.\r
+\r
+ inflateSetDictionary returns Z_OK if success, Z_STREAM_ERROR if a\r
+ parameter is invalid (such as NULL dictionary) or the stream state is\r
+ inconsistent, Z_DATA_ERROR if the given dictionary doesn't match the\r
+ expected one (incorrect adler32 value). inflateSetDictionary does not\r
+ perform any decompression: this will be done by subsequent calls of\r
+ inflate().\r
+*/\r
+\r
+ZEXTERN int ZEXPORT inflateSync OF((z_streamp strm));\r
+/*\r
+ Skips invalid compressed data until a full flush point (see above the\r
+ description of deflate with Z_FULL_FLUSH) can be found, or until all\r
+ available input is skipped. No output is provided.\r
+\r
+ inflateSync returns Z_OK if a full flush point has been found, Z_BUF_ERROR\r
+ if no more input was provided, Z_DATA_ERROR if no flush point has been found,\r
+ or Z_STREAM_ERROR if the stream structure was inconsistent. In the success\r
+ case, the application may save the current current value of total_in which\r
+ indicates where valid compressed data was found. In the error case, the\r
+ application may repeatedly call inflateSync, providing more input each time,\r
+ until success or end of the input data.\r
+*/\r
+\r
+ZEXTERN int ZEXPORT inflateCopy OF((z_streamp dest,\r
+ z_streamp source));\r
+/*\r
+ Sets the destination stream as a complete copy of the source stream.\r
+\r
+ This function can be useful when randomly accessing a large stream. The\r
+ first pass through the stream can periodically record the inflate state,\r
+ allowing restarting inflate at those points when randomly accessing the\r
+ stream.\r
+\r
+ inflateCopy returns Z_OK if success, Z_MEM_ERROR if there was not\r
+ enough memory, Z_STREAM_ERROR if the source stream state was inconsistent\r
+ (such as zalloc being NULL). msg is left unchanged in both source and\r
+ destination.\r
+*/\r
+\r
+ZEXTERN int ZEXPORT inflateReset OF((z_streamp strm));\r
+/*\r
+ This function is equivalent to inflateEnd followed by inflateInit,\r
+ but does not free and reallocate all the internal decompression state.\r
+ The stream will keep attributes that may have been set by inflateInit2.\r
+\r
+ inflateReset returns Z_OK if success, or Z_STREAM_ERROR if the source\r
+ stream state was inconsistent (such as zalloc or state being NULL).\r
+*/\r
+\r
+ZEXTERN int ZEXPORT inflatePrime OF((z_streamp strm,\r
+ int bits,\r
+ int value));\r
+/*\r
+ This function inserts bits in the inflate input stream. The intent is\r
+ that this function is used to start inflating at a bit position in the\r
+ middle of a byte. The provided bits will be used before any bytes are used\r
+ from next_in. This function should only be used with raw inflate, and\r
+ should be used before the first inflate() call after inflateInit2() or\r
+ inflateReset(). bits must be less than or equal to 16, and that many of the\r
+ least significant bits of value will be inserted in the input.\r
+\r
+ inflatePrime returns Z_OK if success, or Z_STREAM_ERROR if the source\r
+ stream state was inconsistent.\r
+*/\r
+\r
+ZEXTERN int ZEXPORT inflateGetHeader OF((z_streamp strm,\r
+ gz_headerp head));\r
+/*\r
+ inflateGetHeader() requests that gzip header information be stored in the\r
+ provided gz_header structure. inflateGetHeader() may be called after\r
+ inflateInit2() or inflateReset(), and before the first call of inflate().\r
+ As inflate() processes the gzip stream, head->done is zero until the header\r
+ is completed, at which time head->done is set to one. If a zlib stream is\r
+ being decoded, then head->done is set to -1 to indicate that there will be\r
+ no gzip header information forthcoming. Note that Z_BLOCK can be used to\r
+ force inflate() to return immediately after header processing is complete\r
+ and before any actual data is decompressed.\r
+\r
+ The text, time, xflags, and os fields are filled in with the gzip header\r
+ contents. hcrc is set to true if there is a header CRC. (The header CRC\r
+ was valid if done is set to one.) If extra is not Z_NULL, then extra_max\r
+ contains the maximum number of bytes to write to extra. Once done is true,\r
+ extra_len contains the actual extra field length, and extra contains the\r
+ extra field, or that field truncated if extra_max is less than extra_len.\r
+ If name is not Z_NULL, then up to name_max characters are written there,\r
+ terminated with a zero unless the length is greater than name_max. If\r
+ comment is not Z_NULL, then up to comm_max characters are written there,\r
+ terminated with a zero unless the length is greater than comm_max. When\r
+ any of extra, name, or comment are not Z_NULL and the respective field is\r
+ not present in the header, then that field is set to Z_NULL to signal its\r
+ absence. This allows the use of deflateSetHeader() with the returned\r
+ structure to duplicate the header. However if those fields are set to\r
+ allocated memory, then the application will need to save those pointers\r
+ elsewhere so that they can be eventually freed.\r
+\r
+ If inflateGetHeader is not used, then the header information is simply\r
+ discarded. The header is always checked for validity, including the header\r
+ CRC if present. inflateReset() will reset the process to discard the header\r
+ information. The application would need to call inflateGetHeader() again to\r
+ retrieve the header from the next gzip stream.\r
+\r
+ inflateGetHeader returns Z_OK if success, or Z_STREAM_ERROR if the source\r
+ stream state was inconsistent.\r
+*/\r
+\r
+/*\r
+ZEXTERN int ZEXPORT inflateBackInit OF((z_streamp strm, int windowBits,\r
+ unsigned char FAR *window));\r
+\r
+ Initialize the internal stream state for decompression using inflateBack()\r
+ calls. The fields zalloc, zfree and opaque in strm must be initialized\r
+ before the call. If zalloc and zfree are Z_NULL, then the default library-\r
+ derived memory allocation routines are used. windowBits is the base two\r
+ logarithm of the window size, in the range 8..15. window is a caller\r
+ supplied buffer of that size. Except for special applications where it is\r
+ assured that deflate was used with small window sizes, windowBits must be 15\r
+ and a 32K byte window must be supplied to be able to decompress general\r
+ deflate streams.\r
+\r
+ See inflateBack() for the usage of these routines.\r
+\r
+ inflateBackInit will return Z_OK on success, Z_STREAM_ERROR if any of\r
+ the paramaters are invalid, Z_MEM_ERROR if the internal state could not\r
+ be allocated, or Z_VERSION_ERROR if the version of the library does not\r
+ match the version of the header file.\r
+*/\r
+\r
+typedef unsigned (*in_func) OF((void FAR *, unsigned char FAR * FAR *));\r
+typedef int (*out_func) OF((void FAR *, unsigned char FAR *, unsigned));\r
+\r
+ZEXTERN int ZEXPORT inflateBack OF((z_streamp strm,\r
+ in_func in, void FAR *in_desc,\r
+ out_func out, void FAR *out_desc));\r
+/*\r
+ inflateBack() does a raw inflate with a single call using a call-back\r
+ interface for input and output. This is more efficient than inflate() for\r
+ file i/o applications in that it avoids copying between the output and the\r
+ sliding window by simply making the window itself the output buffer. This\r
+ function trusts the application to not change the output buffer passed by\r
+ the output function, at least until inflateBack() returns.\r
+\r
+ inflateBackInit() must be called first to allocate the internal state\r
+ and to initialize the state with the user-provided window buffer.\r
+ inflateBack() may then be used multiple times to inflate a complete, raw\r
+ deflate stream with each call. inflateBackEnd() is then called to free\r
+ the allocated state.\r
+\r
+ A raw deflate stream is one with no zlib or gzip header or trailer.\r
+ This routine would normally be used in a utility that reads zip or gzip\r
+ files and writes out uncompressed files. The utility would decode the\r
+ header and process the trailer on its own, hence this routine expects\r
+ only the raw deflate stream to decompress. This is different from the\r
+ normal behavior of inflate(), which expects either a zlib or gzip header and\r
+ trailer around the deflate stream.\r
+\r
+ inflateBack() uses two subroutines supplied by the caller that are then\r
+ called by inflateBack() for input and output. inflateBack() calls those\r
+ routines until it reads a complete deflate stream and writes out all of the\r
+ uncompressed data, or until it encounters an error. The function's\r
+ parameters and return types are defined above in the in_func and out_func\r
+ typedefs. inflateBack() will call in(in_desc, &buf) which should return the\r
+ number of bytes of provided input, and a pointer to that input in buf. If\r
+ there is no input available, in() must return zero--buf is ignored in that\r
+ case--and inflateBack() will return a buffer error. inflateBack() will call\r
+ out(out_desc, buf, len) to write the uncompressed data buf[0..len-1]. out()\r
+ should return zero on success, or non-zero on failure. If out() returns\r
+ non-zero, inflateBack() will return with an error. Neither in() nor out()\r
+ are permitted to change the contents of the window provided to\r
+ inflateBackInit(), which is also the buffer that out() uses to write from.\r
+ The length written by out() will be at most the window size. Any non-zero\r
+ amount of input may be provided by in().\r
+\r
+ For convenience, inflateBack() can be provided input on the first call by\r
+ setting strm->next_in and strm->avail_in. If that input is exhausted, then\r
+ in() will be called. Therefore strm->next_in must be initialized before\r
+ calling inflateBack(). If strm->next_in is Z_NULL, then in() will be called\r
+ immediately for input. If strm->next_in is not Z_NULL, then strm->avail_in\r
+ must also be initialized, and then if strm->avail_in is not zero, input will\r
+ initially be taken from strm->next_in[0 .. strm->avail_in - 1].\r
+\r
+ The in_desc and out_desc parameters of inflateBack() is passed as the\r
+ first parameter of in() and out() respectively when they are called. These\r
+ descriptors can be optionally used to pass any information that the caller-\r
+ supplied in() and out() functions need to do their job.\r
+\r
+ On return, inflateBack() will set strm->next_in and strm->avail_in to\r
+ pass back any unused input that was provided by the last in() call. The\r
+ return values of inflateBack() can be Z_STREAM_END on success, Z_BUF_ERROR\r
+ if in() or out() returned an error, Z_DATA_ERROR if there was a format\r
+ error in the deflate stream (in which case strm->msg is set to indicate the\r
+ nature of the error), or Z_STREAM_ERROR if the stream was not properly\r
+ initialized. In the case of Z_BUF_ERROR, an input or output error can be\r
+ distinguished using strm->next_in which will be Z_NULL only if in() returned\r
+ an error. If strm->next is not Z_NULL, then the Z_BUF_ERROR was due to\r
+ out() returning non-zero. (in() will always be called before out(), so\r
+ strm->next_in is assured to be defined if out() returns non-zero.) Note\r
+ that inflateBack() cannot return Z_OK.\r
+*/\r
+\r
+ZEXTERN int ZEXPORT inflateBackEnd OF((z_streamp strm));\r
+/*\r
+ All memory allocated by inflateBackInit() is freed.\r
+\r
+ inflateBackEnd() returns Z_OK on success, or Z_STREAM_ERROR if the stream\r
+ state was inconsistent.\r
+*/\r
+\r
+ZEXTERN uLong ZEXPORT zlibCompileFlags OF((void));\r
+/* Return flags indicating compile-time options.\r
+\r
+ Type sizes, two bits each, 00 = 16 bits, 01 = 32, 10 = 64, 11 = other:\r
+ 1.0: size of uInt\r
+ 3.2: size of uLong\r
+ 5.4: size of voidpf (pointer)\r
+ 7.6: size of z_off_t\r
+\r
+ Compiler, assembler, and debug options:\r
+ 8: DEBUG\r
+ 9: ASMV or ASMINF -- use ASM code\r
+ 10: ZLIB_WINAPI -- exported functions use the WINAPI calling convention\r
+ 11: 0 (reserved)\r
+\r
+ One-time table building (smaller code, but not thread-safe if true):\r
+ 12: BUILDFIXED -- build static block decoding tables when needed\r
+ 13: DYNAMIC_CRC_TABLE -- build CRC calculation tables when needed\r
+ 14,15: 0 (reserved)\r
+\r
+ Library content (indicates missing functionality):\r
+ 16: NO_GZCOMPRESS -- gz* functions cannot compress (to avoid linking\r
+ deflate code when not needed)\r
+ 17: NO_GZIP -- deflate can't write gzip streams, and inflate can't detect\r
+ and decode gzip streams (to avoid linking crc code)\r
+ 18-19: 0 (reserved)\r
+\r
+ Operation variations (changes in library functionality):\r
+ 20: PKZIP_BUG_WORKAROUND -- slightly more permissive inflate\r
+ 21: FASTEST -- deflate algorithm with only one, lowest compression level\r
+ 22,23: 0 (reserved)\r
+\r
+ The sprintf variant used by gzprintf (zero is best):\r
+ 24: 0 = vs*, 1 = s* -- 1 means limited to 20 arguments after the format\r
+ 25: 0 = *nprintf, 1 = *printf -- 1 means gzprintf() not secure!\r
+ 26: 0 = returns value, 1 = void -- 1 means inferred string length returned\r
+\r
+ Remainder:\r
+ 27-31: 0 (reserved)\r
+ */\r
+\r
+\r
+ /* utility functions */\r
+\r
+/*\r
+ The following utility functions are implemented on top of the\r
+ basic stream-oriented functions. To simplify the interface, some\r
+ default options are assumed (compression level and memory usage,\r
+ standard memory allocation functions). The source code of these\r
+ utility functions can easily be modified if you need special options.\r
+*/\r
+\r
+ZEXTERN int ZEXPORT compress OF((Bytef *dest, uLongf *destLen,\r
+ const Bytef *source, uLong sourceLen));\r
+/*\r
+ Compresses the source buffer into the destination buffer. sourceLen is\r
+ the byte length of the source buffer. Upon entry, destLen is the total\r
+ size of the destination buffer, which must be at least the value returned\r
+ by compressBound(sourceLen). Upon exit, destLen is the actual size of the\r
+ compressed buffer.\r
+ This function can be used to compress a whole file at once if the\r
+ input file is mmap'ed.\r
+ compress returns Z_OK if success, Z_MEM_ERROR if there was not\r
+ enough memory, Z_BUF_ERROR if there was not enough room in the output\r
+ buffer.\r
+*/\r
+\r
+ZEXTERN int ZEXPORT compress2 OF((Bytef *dest, uLongf *destLen,\r
+ const Bytef *source, uLong sourceLen,\r
+ int level));\r
+/*\r
+ Compresses the source buffer into the destination buffer. The level\r
+ parameter has the same meaning as in deflateInit. sourceLen is the byte\r
+ length of the source buffer. Upon entry, destLen is the total size of the\r
+ destination buffer, which must be at least the value returned by\r
+ compressBound(sourceLen). Upon exit, destLen is the actual size of the\r
+ compressed buffer.\r
+\r
+ compress2 returns Z_OK if success, Z_MEM_ERROR if there was not enough\r
+ memory, Z_BUF_ERROR if there was not enough room in the output buffer,\r
+ Z_STREAM_ERROR if the level parameter is invalid.\r
+*/\r
+\r
+ZEXTERN uLong ZEXPORT compressBound OF((uLong sourceLen));\r
+/*\r
+ compressBound() returns an upper bound on the compressed size after\r
+ compress() or compress2() on sourceLen bytes. It would be used before\r
+ a compress() or compress2() call to allocate the destination buffer.\r
+*/\r
+\r
+ZEXTERN int ZEXPORT uncompress OF((Bytef *dest, uLongf *destLen,\r
+ const Bytef *source, uLong sourceLen));\r
+/*\r
+ Decompresses the source buffer into the destination buffer. sourceLen is\r
+ the byte length of the source buffer. Upon entry, destLen is the total\r
+ size of the destination buffer, which must be large enough to hold the\r
+ entire uncompressed data. (The size of the uncompressed data must have\r
+ been saved previously by the compressor and transmitted to the decompressor\r
+ by some mechanism outside the scope of this compression library.)\r
+ Upon exit, destLen is the actual size of the compressed buffer.\r
+ This function can be used to decompress a whole file at once if the\r
+ input file is mmap'ed.\r
+\r
+ uncompress returns Z_OK if success, Z_MEM_ERROR if there was not\r
+ enough memory, Z_BUF_ERROR if there was not enough room in the output\r
+ buffer, or Z_DATA_ERROR if the input data was corrupted or incomplete.\r
+*/\r
+\r
+\r
+typedef voidp gzFile;\r
+\r
+ZEXTERN gzFile ZEXPORT gzopen OF((const char *path, const char *mode));\r
+/*\r
+ Opens a gzip (.gz) file for reading or writing. The mode parameter\r
+ is as in fopen ("rb" or "wb") but can also include a compression level\r
+ ("wb9") or a strategy: 'f' for filtered data as in "wb6f", 'h' for\r
+ Huffman only compression as in "wb1h", or 'R' for run-length encoding\r
+ as in "wb1R". (See the description of deflateInit2 for more information\r
+ about the strategy parameter.)\r
+\r
+ gzopen can be used to read a file which is not in gzip format; in this\r
+ case gzread will directly read from the file without decompression.\r
+\r
+ gzopen returns NULL if the file could not be opened or if there was\r
+ insufficient memory to allocate the (de)compression state; errno\r
+ can be checked to distinguish the two cases (if errno is zero, the\r
+ zlib error is Z_MEM_ERROR). */\r
+\r
+ZEXTERN gzFile ZEXPORT gzdopen OF((int fd, const char *mode));\r
+/*\r
+ gzdopen() associates a gzFile with the file descriptor fd. File\r
+ descriptors are obtained from calls like open, dup, creat, pipe or\r
+ fileno (in the file has been previously opened with fopen).\r
+ The mode parameter is as in gzopen.\r
+ The next call of gzclose on the returned gzFile will also close the\r
+ file descriptor fd, just like fclose(fdopen(fd), mode) closes the file\r
+ descriptor fd. If you want to keep fd open, use gzdopen(dup(fd), mode).\r
+ gzdopen returns NULL if there was insufficient memory to allocate\r
+ the (de)compression state.\r
+*/\r
+\r
+ZEXTERN int ZEXPORT gzsetparams OF((gzFile file, int level, int strategy));\r
+/*\r
+ Dynamically update the compression level or strategy. See the description\r
+ of deflateInit2 for the meaning of these parameters.\r
+ gzsetparams returns Z_OK if success, or Z_STREAM_ERROR if the file was not\r
+ opened for writing.\r
+*/\r
+\r
+ZEXTERN int ZEXPORT gzread OF((gzFile file, voidp buf, unsigned len));\r
+/*\r
+ Reads the given number of uncompressed bytes from the compressed file.\r
+ If the input file was not in gzip format, gzread copies the given number\r
+ of bytes into the buffer.\r
+ gzread returns the number of uncompressed bytes actually read (0 for\r
+ end of file, -1 for error). */\r
+\r
+ZEXTERN int ZEXPORT gzwrite OF((gzFile file,\r
+ voidpc buf, unsigned len));\r
+/*\r
+ Writes the given number of uncompressed bytes into the compressed file.\r
+ gzwrite returns the number of uncompressed bytes actually written\r
+ (0 in case of error).\r
+*/\r
+\r
+ZEXTERN int ZEXPORTVA gzprintf OF((gzFile file, const char *format, ...));\r
+/*\r
+ Converts, formats, and writes the args to the compressed file under\r
+ control of the format string, as in fprintf. gzprintf returns the number of\r
+ uncompressed bytes actually written (0 in case of error). The number of\r
+ uncompressed bytes written is limited to 4095. The caller should assure that\r
+ this limit is not exceeded. If it is exceeded, then gzprintf() will return\r
+ return an error (0) with nothing written. In this case, there may also be a\r
+ buffer overflow with unpredictable consequences, which is possible only if\r
+ zlib was compiled with the insecure functions sprintf() or vsprintf()\r
+ because the secure snprintf() or vsnprintf() functions were not available.\r
+*/\r
+\r
+ZEXTERN int ZEXPORT gzputs OF((gzFile file, const char *s));\r
+/*\r
+ Writes the given null-terminated string to the compressed file, excluding\r
+ the terminating null character.\r
+ gzputs returns the number of characters written, or -1 in case of error.\r
+*/\r
+\r
+ZEXTERN char * ZEXPORT gzgets OF((gzFile file, char *buf, int len));\r
+/*\r
+ Reads bytes from the compressed file until len-1 characters are read, or\r
+ a newline character is read and transferred to buf, or an end-of-file\r
+ condition is encountered. The string is then terminated with a null\r
+ character.\r
+ gzgets returns buf, or Z_NULL in case of error.\r
+*/\r
+\r
+ZEXTERN int ZEXPORT gzputc OF((gzFile file, int c));\r
+/*\r
+ Writes c, converted to an unsigned char, into the compressed file.\r
+ gzputc returns the value that was written, or -1 in case of error.\r
+*/\r
+\r
+ZEXTERN int ZEXPORT gzgetc OF((gzFile file));\r
+/*\r
+ Reads one byte from the compressed file. gzgetc returns this byte\r
+ or -1 in case of end of file or error.\r
+*/\r
+\r
+ZEXTERN int ZEXPORT gzungetc OF((int c, gzFile file));\r
+/*\r
+ Push one character back onto the stream to be read again later.\r
+ Only one character of push-back is allowed. gzungetc() returns the\r
+ character pushed, or -1 on failure. gzungetc() will fail if a\r
+ character has been pushed but not read yet, or if c is -1. The pushed\r
+ character will be discarded if the stream is repositioned with gzseek()\r
+ or gzrewind().\r
+*/\r
+\r
+ZEXTERN int ZEXPORT gzflush OF((gzFile file, int flush));\r
+/*\r
+ Flushes all pending output into the compressed file. The parameter\r
+ flush is as in the deflate() function. The return value is the zlib\r
+ error number (see function gzerror below). gzflush returns Z_OK if\r
+ the flush parameter is Z_FINISH and all output could be flushed.\r
+ gzflush should be called only when strictly necessary because it can\r
+ degrade compression.\r
+*/\r
+\r
+ZEXTERN z_off_t ZEXPORT gzseek OF((gzFile file,\r
+ z_off_t offset, int whence));\r
+/*\r
+ Sets the starting position for the next gzread or gzwrite on the\r
+ given compressed file. The offset represents a number of bytes in the\r
+ uncompressed data stream. The whence parameter is defined as in lseek(2);\r
+ the value SEEK_END is not supported.\r
+ If the file is opened for reading, this function is emulated but can be\r
+ extremely slow. If the file is opened for writing, only forward seeks are\r
+ supported; gzseek then compresses a sequence of zeroes up to the new\r
+ starting position.\r
+\r
+ gzseek returns the resulting offset location as measured in bytes from\r
+ the beginning of the uncompressed stream, or -1 in case of error, in\r
+ particular if the file is opened for writing and the new starting position\r
+ would be before the current position.\r
+*/\r
+\r
+ZEXTERN int ZEXPORT gzrewind OF((gzFile file));\r
+/*\r
+ Rewinds the given file. This function is supported only for reading.\r
+\r
+ gzrewind(file) is equivalent to (int)gzseek(file, 0L, SEEK_SET)\r
+*/\r
+\r
+ZEXTERN z_off_t ZEXPORT gztell OF((gzFile file));\r
+/*\r
+ Returns the starting position for the next gzread or gzwrite on the\r
+ given compressed file. This position represents a number of bytes in the\r
+ uncompressed data stream.\r
+\r
+ gztell(file) is equivalent to gzseek(file, 0L, SEEK_CUR)\r
+*/\r
+\r
+ZEXTERN int ZEXPORT gzeof OF((gzFile file));\r
+/*\r
+ Returns 1 when EOF has previously been detected reading the given\r
+ input stream, otherwise zero.\r
+*/\r
+\r
+ZEXTERN int ZEXPORT gzdirect OF((gzFile file));\r
+/*\r
+ Returns 1 if file is being read directly without decompression, otherwise\r
+ zero.\r
+*/\r
+\r
+ZEXTERN int ZEXPORT gzclose OF((gzFile file));\r
+/*\r
+ Flushes all pending output if necessary, closes the compressed file\r
+ and deallocates all the (de)compression state. The return value is the zlib\r
+ error number (see function gzerror below).\r
+*/\r
+\r
+ZEXTERN const char * ZEXPORT gzerror OF((gzFile file, int *errnum));\r
+/*\r
+ Returns the error message for the last error which occurred on the\r
+ given compressed file. errnum is set to zlib error number. If an\r
+ error occurred in the file system and not in the compression library,\r
+ errnum is set to Z_ERRNO and the application may consult errno\r
+ to get the exact error code.\r
+*/\r
+\r
+ZEXTERN void ZEXPORT gzclearerr OF((gzFile file));\r
+/*\r
+ Clears the error and end-of-file flags for file. This is analogous to the\r
+ clearerr() function in stdio. This is useful for continuing to read a gzip\r
+ file that is being written concurrently.\r
+*/\r
+\r
+ /* checksum functions */\r
+\r
+/*\r
+ These functions are not related to compression but are exported\r
+ anyway because they might be useful in applications using the\r
+ compression library.\r
+*/\r
+\r
+ZEXTERN uLong ZEXPORT adler32 OF((uLong adler, const Bytef *buf, uInt len));\r
+/*\r
+ Update a running Adler-32 checksum with the bytes buf[0..len-1] and\r
+ return the updated checksum. If buf is NULL, this function returns\r
+ the required initial value for the checksum.\r
+ An Adler-32 checksum is almost as reliable as a CRC32 but can be computed\r
+ much faster. Usage example:\r
+\r
+ uLong adler = adler32(0L, Z_NULL, 0);\r
+\r
+ while (read_buffer(buffer, length) != EOF) {\r
+ adler = adler32(adler, buffer, length);\r
+ }\r
+ if (adler != original_adler) error();\r
+*/\r
+\r
+ZEXTERN uLong ZEXPORT adler32_combine OF((uLong adler1, uLong adler2,\r
+ z_off_t len2));\r
+/*\r
+ Combine two Adler-32 checksums into one. For two sequences of bytes, seq1\r
+ and seq2 with lengths len1 and len2, Adler-32 checksums were calculated for\r
+ each, adler1 and adler2. adler32_combine() returns the Adler-32 checksum of\r
+ seq1 and seq2 concatenated, requiring only adler1, adler2, and len2.\r
+*/\r
+\r
+ZEXTERN uLong ZEXPORT crc32 OF((uLong crc, const Bytef *buf, uInt len));\r
+/*\r
+ Update a running CRC-32 with the bytes buf[0..len-1] and return the\r
+ updated CRC-32. If buf is NULL, this function returns the required initial\r
+ value for the for the crc. Pre- and post-conditioning (one's complement) is\r
+ performed within this function so it shouldn't be done by the application.\r
+ Usage example:\r
+\r
+ uLong crc = crc32(0L, Z_NULL, 0);\r
+\r
+ while (read_buffer(buffer, length) != EOF) {\r
+ crc = crc32(crc, buffer, length);\r
+ }\r
+ if (crc != original_crc) error();\r
+*/\r
+\r
+ZEXTERN uLong ZEXPORT crc32_combine OF((uLong crc1, uLong crc2, z_off_t len2));\r
+\r
+/*\r
+ Combine two CRC-32 check values into one. For two sequences of bytes,\r
+ seq1 and seq2 with lengths len1 and len2, CRC-32 check values were\r
+ calculated for each, crc1 and crc2. crc32_combine() returns the CRC-32\r
+ check value of seq1 and seq2 concatenated, requiring only crc1, crc2, and\r
+ len2.\r
+*/\r
+\r
+\r
+ /* various hacks, don't look :) */\r
+\r
+/* deflateInit and inflateInit are macros to allow checking the zlib version\r
+ * and the compiler's view of z_stream:\r
+ */\r
+ZEXTERN int ZEXPORT deflateInit_ OF((z_streamp strm, int level,\r
+ const char *version, int stream_size));\r
+ZEXTERN int ZEXPORT inflateInit_ OF((z_streamp strm,\r
+ const char *version, int stream_size));\r
+ZEXTERN int ZEXPORT deflateInit2_ OF((z_streamp strm, int level, int method,\r
+ int windowBits, int memLevel,\r
+ int strategy, const char *version,\r
+ int stream_size));\r
+ZEXTERN int ZEXPORT inflateInit2_ OF((z_streamp strm, int windowBits,\r
+ const char *version, int stream_size));\r
+ZEXTERN int ZEXPORT inflateBackInit_ OF((z_streamp strm, int windowBits,\r
+ unsigned char FAR *window,\r
+ const char *version,\r
+ int stream_size));\r
+#define deflateInit(strm, level) \\r
+ deflateInit_((strm), (level), ZLIB_VERSION, sizeof(z_stream))\r
+#define inflateInit(strm) \\r
+ inflateInit_((strm), ZLIB_VERSION, sizeof(z_stream))\r
+#define deflateInit2(strm, level, method, windowBits, memLevel, strategy) \\r
+ deflateInit2_((strm),(level),(method),(windowBits),(memLevel),\\r
+ (strategy), ZLIB_VERSION, sizeof(z_stream))\r
+#define inflateInit2(strm, windowBits) \\r
+ inflateInit2_((strm), (windowBits), ZLIB_VERSION, sizeof(z_stream))\r
+#define inflateBackInit(strm, windowBits, window) \\r
+ inflateBackInit_((strm), (windowBits), (window), \\r
+ ZLIB_VERSION, sizeof(z_stream))\r
+\r
+\r
+#if !defined(ZUTIL_H) && !defined(NO_DUMMY_DECL)\r
+ struct internal_state {int dummy;}; /* hack for buggy compilers */\r
+#endif\r
+\r
+ZEXTERN const char * ZEXPORT zError OF((int));\r
+ZEXTERN int ZEXPORT inflateSyncPoint OF((z_streamp z));\r
+ZEXTERN const uLongf * ZEXPORT get_crc_table OF((void));\r
+\r
+#ifdef __cplusplus\r
+}\r
+#endif\r
+\r
+#endif /* ZLIB_H */\r
--- /dev/null
+/* zutil.c -- target dependent utility functions for the compression library\r
+ * Copyright (C) 1995-2005 Jean-loup Gailly.\r
+ * For conditions of distribution and use, see copyright notice in zlib.h\r
+ */\r
+\r
+/* @(#) $Id$ */\r
+\r
+#include "zutil.h"\r
+\r
+#ifndef NO_DUMMY_DECL\r
+struct internal_state {int dummy;}; /* for buggy compilers */\r
+#endif\r
+\r
+const char * const z_errmsg[10] = {\r
+"need dictionary", /* Z_NEED_DICT 2 */\r
+"stream end", /* Z_STREAM_END 1 */\r
+"", /* Z_OK 0 */\r
+"file error", /* Z_ERRNO (-1) */\r
+"stream error", /* Z_STREAM_ERROR (-2) */\r
+"data error", /* Z_DATA_ERROR (-3) */\r
+"insufficient memory", /* Z_MEM_ERROR (-4) */\r
+"buffer error", /* Z_BUF_ERROR (-5) */\r
+"incompatible version",/* Z_VERSION_ERROR (-6) */\r
+""};\r
+\r
+\r
+const char * ZEXPORT zlibVersion()\r
+{\r
+ return ZLIB_VERSION;\r
+}\r
+\r
+uLong ZEXPORT zlibCompileFlags()\r
+{\r
+ uLong flags;\r
+\r
+ flags = 0;\r
+ switch (sizeof(uInt)) {\r
+ case 2: break;\r
+ case 4: flags += 1; break;\r
+ case 8: flags += 2; break;\r
+ default: flags += 3;\r
+ }\r
+ switch (sizeof(uLong)) {\r
+ case 2: break;\r
+ case 4: flags += 1 << 2; break;\r
+ case 8: flags += 2 << 2; break;\r
+ default: flags += 3 << 2;\r
+ }\r
+ switch (sizeof(voidpf)) {\r
+ case 2: break;\r
+ case 4: flags += 1 << 4; break;\r
+ case 8: flags += 2 << 4; break;\r
+ default: flags += 3 << 4;\r
+ }\r
+ switch (sizeof(z_off_t)) {\r
+ case 2: break;\r
+ case 4: flags += 1 << 6; break;\r
+ case 8: flags += 2 << 6; break;\r
+ default: flags += 3 << 6;\r
+ }\r
+#ifdef DEBUG\r
+ flags += 1 << 8;\r
+#endif\r
+#if defined(ASMV) || defined(ASMINF)\r
+ flags += 1 << 9;\r
+#endif\r
+#ifdef ZLIB_WINAPI\r
+ flags += 1 << 10;\r
+#endif\r
+#ifdef BUILDFIXED\r
+ flags += 1 << 12;\r
+#endif\r
+#ifdef DYNAMIC_CRC_TABLE\r
+ flags += 1 << 13;\r
+#endif\r
+#ifdef NO_GZCOMPRESS\r
+ flags += 1L << 16;\r
+#endif\r
+#ifdef NO_GZIP\r
+ flags += 1L << 17;\r
+#endif\r
+#ifdef PKZIP_BUG_WORKAROUND\r
+ flags += 1L << 20;\r
+#endif\r
+#ifdef FASTEST\r
+ flags += 1L << 21;\r
+#endif\r
+#ifdef STDC\r
+# ifdef NO_vsnprintf\r
+ flags += 1L << 25;\r
+# ifdef HAS_vsprintf_void\r
+ flags += 1L << 26;\r
+# endif\r
+# else\r
+# ifdef HAS_vsnprintf_void\r
+ flags += 1L << 26;\r
+# endif\r
+# endif\r
+#else\r
+ flags += 1L << 24;\r
+# ifdef NO_snprintf\r
+ flags += 1L << 25;\r
+# ifdef HAS_sprintf_void\r
+ flags += 1L << 26;\r
+# endif\r
+# else\r
+# ifdef HAS_snprintf_void\r
+ flags += 1L << 26;\r
+# endif\r
+# endif\r
+#endif\r
+ return flags;\r
+}\r
+\r
+#ifdef DEBUG\r
+\r
+# ifndef verbose\r
+# define verbose 0\r
+# endif\r
+int z_verbose = verbose;\r
+\r
+void z_error (m)\r
+ char *m;\r
+{\r
+ fprintf(stderr, "%s\n", m);\r
+ exit(1);\r
+}\r
+#endif\r
+\r
+/* exported to allow conversion of error code to string for compress() and\r
+ * uncompress()\r
+ */\r
+const char * ZEXPORT zError(err)\r
+ int err;\r
+{\r
+ return ERR_MSG(err);\r
+}\r
+\r
+#if defined(_WIN32_WCE)\r
+ /* The Microsoft C Run-Time Library for Windows CE doesn't have\r
+ * errno. We define it as a global variable to simplify porting.\r
+ * Its value is always 0 and should not be used.\r
+ */\r
+ int errno = 0;\r
+#endif\r
+\r
+#ifndef HAVE_MEMCPY\r
+\r
+void zmemcpy(dest, source, len)\r
+ Bytef* dest;\r
+ const Bytef* source;\r
+ uInt len;\r
+{\r
+ if (len == 0) return;\r
+ do {\r
+ *dest++ = *source++; /* ??? to be unrolled */\r
+ } while (--len != 0);\r
+}\r
+\r
+int zmemcmp(s1, s2, len)\r
+ const Bytef* s1;\r
+ const Bytef* s2;\r
+ uInt len;\r
+{\r
+ uInt j;\r
+\r
+ for (j = 0; j < len; j++) {\r
+ if (s1[j] != s2[j]) return 2*(s1[j] > s2[j])-1;\r
+ }\r
+ return 0;\r
+}\r
+\r
+void zmemzero(dest, len)\r
+ Bytef* dest;\r
+ uInt len;\r
+{\r
+ if (len == 0) return;\r
+ do {\r
+ *dest++ = 0; /* ??? to be unrolled */\r
+ } while (--len != 0);\r
+}\r
+#endif\r
+\r
+\r
+#ifdef SYS16BIT\r
+\r
+#ifdef __TURBOC__\r
+/* Turbo C in 16-bit mode */\r
+\r
+# define MY_ZCALLOC\r
+\r
+/* Turbo C malloc() does not allow dynamic allocation of 64K bytes\r
+ * and farmalloc(64K) returns a pointer with an offset of 8, so we\r
+ * must fix the pointer. Warning: the pointer must be put back to its\r
+ * original form in order to free it, use zcfree().\r
+ */\r
+\r
+#define MAX_PTR 10\r
+/* 10*64K = 640K */\r
+\r
+local int next_ptr = 0;\r
+\r
+typedef struct ptr_table_s {\r
+ voidpf org_ptr;\r
+ voidpf new_ptr;\r
+} ptr_table;\r
+\r
+local ptr_table table[MAX_PTR];\r
+/* This table is used to remember the original form of pointers\r
+ * to large buffers (64K). Such pointers are normalized with a zero offset.\r
+ * Since MSDOS is not a preemptive multitasking OS, this table is not\r
+ * protected from concurrent access. This hack doesn't work anyway on\r
+ * a protected system like OS/2. Use Microsoft C instead.\r
+ */\r
+\r
+voidpf zcalloc (voidpf opaque, unsigned items, unsigned size)\r
+{\r
+ voidpf buf = opaque; /* just to make some compilers happy */\r
+ ulg bsize = (ulg)items*size;\r
+\r
+ /* If we allocate less than 65520 bytes, we assume that farmalloc\r
+ * will return a usable pointer which doesn't have to be normalized.\r
+ */\r
+ if (bsize < 65520L) {\r
+ buf = farmalloc(bsize);\r
+ if (*(ush*)&buf != 0) return buf;\r
+ } else {\r
+ buf = farmalloc(bsize + 16L);\r
+ }\r
+ if (buf == NULL || next_ptr >= MAX_PTR) return NULL;\r
+ table[next_ptr].org_ptr = buf;\r
+\r
+ /* Normalize the pointer to seg:0 */\r
+ *((ush*)&buf+1) += ((ush)((uch*)buf-0) + 15) >> 4;\r
+ *(ush*)&buf = 0;\r
+ table[next_ptr++].new_ptr = buf;\r
+ return buf;\r
+}\r
+\r
+void zcfree (voidpf opaque, voidpf ptr)\r
+{\r
+ int n;\r
+ if (*(ush*)&ptr != 0) { /* object < 64K */\r
+ farfree(ptr);\r
+ return;\r
+ }\r
+ /* Find the original pointer */\r
+ for (n = 0; n < next_ptr; n++) {\r
+ if (ptr != table[n].new_ptr) continue;\r
+\r
+ farfree(table[n].org_ptr);\r
+ while (++n < next_ptr) {\r
+ table[n-1] = table[n];\r
+ }\r
+ next_ptr--;\r
+ return;\r
+ }\r
+ ptr = opaque; /* just to make some compilers happy */\r
+ Assert(0, "zcfree: ptr not found");\r
+}\r
+\r
+#endif /* __TURBOC__ */\r
+\r
+\r
+#ifdef M_I86\r
+/* Microsoft C in 16-bit mode */\r
+\r
+# define MY_ZCALLOC\r
+\r
+#if (!defined(_MSC_VER) || (_MSC_VER <= 600))\r
+# define _halloc halloc\r
+# define _hfree hfree\r
+#endif\r
+\r
+voidpf zcalloc (voidpf opaque, unsigned items, unsigned size)\r
+{\r
+ if (opaque) opaque = 0; /* to make compiler happy */\r
+ return _halloc((long)items, size);\r
+}\r
+\r
+void zcfree (voidpf opaque, voidpf ptr)\r
+{\r
+ if (opaque) opaque = 0; /* to make compiler happy */\r
+ _hfree(ptr);\r
+}\r
+\r
+#endif /* M_I86 */\r
+\r
+#endif /* SYS16BIT */\r
+\r
+\r
+#ifndef MY_ZCALLOC /* Any system without a special alloc function */\r
+\r
+#ifndef STDC\r
+extern voidp malloc OF((uInt size));\r
+extern voidp calloc OF((uInt items, uInt size));\r
+extern void free OF((voidpf ptr));\r
+#endif\r
+\r
+voidpf zcalloc (opaque, items, size)\r
+ voidpf opaque;\r
+ unsigned items;\r
+ unsigned size;\r
+{\r
+ if (opaque) items += size - size; /* make compiler happy */\r
+ return sizeof(uInt) > 2 ? (voidpf)malloc(items * size) :\r
+ (voidpf)calloc(items, size);\r
+}\r
+\r
+void zcfree (opaque, ptr)\r
+ voidpf opaque;\r
+ voidpf ptr;\r
+{\r
+ free(ptr);\r
+ if (opaque) return; /* make compiler happy */\r
+}\r
+\r
+#endif /* MY_ZCALLOC */\r
--- /dev/null
+/* zutil.h -- internal interface and configuration of the compression library\r
+ * Copyright (C) 1995-2005 Jean-loup Gailly.\r
+ * For conditions of distribution and use, see copyright notice in zlib.h\r
+ */\r
+\r
+/* WARNING: this file should *not* be used by applications. It is\r
+ part of the implementation of the compression library and is\r
+ subject to change. Applications should only use zlib.h.\r
+ */\r
+\r
+/* @(#) $Id$ */\r
+\r
+#ifndef ZUTIL_H\r
+#define ZUTIL_H\r
+\r
+#define ZLIB_INTERNAL\r
+#include "zlib.h"\r
+\r
+#ifdef STDC\r
+# ifndef _WIN32_WCE\r
+# include <stddef.h>\r
+# endif\r
+# include <string.h>\r
+# include <stdlib.h>\r
+#endif\r
+#ifdef NO_ERRNO_H\r
+# ifdef _WIN32_WCE\r
+ /* The Microsoft C Run-Time Library for Windows CE doesn't have\r
+ * errno. We define it as a global variable to simplify porting.\r
+ * Its value is always 0 and should not be used. We rename it to\r
+ * avoid conflict with other libraries that use the same workaround.\r
+ */\r
+# define errno z_errno\r
+# endif\r
+ extern int errno;\r
+#else\r
+# ifndef _WIN32_WCE\r
+# include <errno.h>\r
+# endif\r
+#endif\r
+\r
+#ifndef local\r
+# define local static\r
+#endif\r
+/* compile with -Dlocal if your debugger can't find static symbols */\r
+\r
+typedef unsigned char uch;\r
+typedef uch FAR uchf;\r
+typedef unsigned short ush;\r
+typedef ush FAR ushf;\r
+typedef unsigned long ulg;\r
+\r
+extern const char * const z_errmsg[10]; /* indexed by 2-zlib_error */\r
+/* (size given to avoid silly warnings with Visual C++) */\r
+\r
+#define ERR_MSG(err) z_errmsg[Z_NEED_DICT-(err)]\r
+\r
+#define ERR_RETURN(strm,err) \\r
+ return (strm->msg = (char*)ERR_MSG(err), (err))\r
+/* To be used only when the state is known to be valid */\r
+\r
+ /* common constants */\r
+\r
+#ifndef DEF_WBITS\r
+# define DEF_WBITS MAX_WBITS\r
+#endif\r
+/* default windowBits for decompression. MAX_WBITS is for compression only */\r
+\r
+#if MAX_MEM_LEVEL >= 8\r
+# define DEF_MEM_LEVEL 8\r
+#else\r
+# define DEF_MEM_LEVEL MAX_MEM_LEVEL\r
+#endif\r
+/* default memLevel */\r
+\r
+#define STORED_BLOCK 0\r
+#define STATIC_TREES 1\r
+#define DYN_TREES 2\r
+/* The three kinds of block type */\r
+\r
+#define MIN_MATCH 3\r
+#define MAX_MATCH 258\r
+/* The minimum and maximum match lengths */\r
+\r
+#define PRESET_DICT 0x20 /* preset dictionary flag in zlib header */\r
+\r
+ /* target dependencies */\r
+\r
+#if defined(MSDOS) || (defined(WINDOWS) && !defined(WIN32))\r
+# define OS_CODE 0x00\r
+# if defined(__TURBOC__) || defined(__BORLANDC__)\r
+# if(__STDC__ == 1) && (defined(__LARGE__) || defined(__COMPACT__))\r
+ /* Allow compilation with ANSI keywords only enabled */\r
+ void _Cdecl farfree( void *block );\r
+ void *_Cdecl farmalloc( unsigned long nbytes );\r
+# else\r
+# include <alloc.h>\r
+# endif\r
+# else /* MSC or DJGPP */\r
+# include <malloc.h>\r
+# endif\r
+#endif\r
+\r
+#ifdef AMIGA\r
+# define OS_CODE 0x01\r
+#endif\r
+\r
+#if defined(VAXC) || defined(VMS)\r
+# define OS_CODE 0x02\r
+# define F_OPEN(name, mode) \\r
+ fopen((name), (mode), "mbc=60", "ctx=stm", "rfm=fix", "mrs=512")\r
+#endif\r
+\r
+#if defined(ATARI) || defined(atarist)\r
+# define OS_CODE 0x05\r
+#endif\r
+\r
+#ifdef OS2\r
+# define OS_CODE 0x06\r
+# ifdef M_I86\r
+ #include <malloc.h>\r
+# endif\r
+#endif\r
+\r
+#if defined(MACOS) || defined(TARGET_OS_MAC)\r
+# define OS_CODE 0x07\r
+# if defined(__MWERKS__) && __dest_os != __be_os && __dest_os != __win32_os\r
+# include <unix.h> /* for fdopen */\r
+# else\r
+# ifndef fdopen\r
+# define fdopen(fd,mode) NULL /* No fdopen() */\r
+# endif\r
+# endif\r
+#endif\r
+\r
+#ifdef TOPS20\r
+# define OS_CODE 0x0a\r
+#endif\r
+\r
+#ifdef WIN32\r
+# ifndef __CYGWIN__ /* Cygwin is Unix, not Win32 */\r
+# define OS_CODE 0x0b\r
+# endif\r
+#endif\r
+\r
+#ifdef __50SERIES /* Prime/PRIMOS */\r
+# define OS_CODE 0x0f\r
+#endif\r
+\r
+#if defined(_BEOS_) || defined(RISCOS)\r
+# define fdopen(fd,mode) NULL /* No fdopen() */\r
+#endif\r
+\r
+#if (defined(_MSC_VER) && (_MSC_VER > 600))\r
+# if defined(_WIN32_WCE)\r
+# define fdopen(fd,mode) NULL /* No fdopen() */\r
+# ifndef _PTRDIFF_T_DEFINED\r
+ typedef int ptrdiff_t;\r
+# define _PTRDIFF_T_DEFINED\r
+# endif\r
+# else\r
+# define fdopen(fd,type) _fdopen(fd,type)\r
+# endif\r
+#endif\r
+\r
+ /* common defaults */\r
+\r
+#ifndef OS_CODE\r
+# define OS_CODE 0x03 /* assume Unix */\r
+#endif\r
+\r
+#ifndef F_OPEN\r
+# define F_OPEN(name, mode) fopen((name), (mode))\r
+#endif\r
+\r
+ /* functions */\r
+\r
+#if defined(STDC99) || (defined(__TURBOC__) && __TURBOC__ >= 0x550)\r
+# ifndef HAVE_VSNPRINTF\r
+# define HAVE_VSNPRINTF\r
+# endif\r
+#endif\r
+#if defined(__CYGWIN__)\r
+# ifndef HAVE_VSNPRINTF\r
+# define HAVE_VSNPRINTF\r
+# endif\r
+#endif\r
+#ifndef HAVE_VSNPRINTF\r
+# ifdef MSDOS\r
+ /* vsnprintf may exist on some MS-DOS compilers (DJGPP?),\r
+ but for now we just assume it doesn't. */\r
+# define NO_vsnprintf\r
+# endif\r
+# ifdef __TURBOC__\r
+# define NO_vsnprintf\r
+# endif\r
+# ifdef WIN32\r
+ /* In Win32, vsnprintf is available as the "non-ANSI" _vsnprintf. */\r
+# if !defined(vsnprintf) && !defined(NO_vsnprintf)\r
+# define vsnprintf _vsnprintf\r
+# endif\r
+# endif\r
+# ifdef __SASC\r
+# define NO_vsnprintf\r
+# endif\r
+#endif\r
+#ifdef VMS\r
+# define NO_vsnprintf\r
+#endif\r
+\r
+#if defined(pyr)\r
+# define NO_MEMCPY\r
+#endif\r
+#if defined(SMALL_MEDIUM) && !defined(_MSC_VER) && !defined(__SC__)\r
+ /* Use our own functions for small and medium model with MSC <= 5.0.\r
+ * You may have to use the same strategy for Borland C (untested).\r
+ * The __SC__ check is for Symantec.\r
+ */\r
+# define NO_MEMCPY\r
+#endif\r
+#if defined(STDC) && !defined(HAVE_MEMCPY) && !defined(NO_MEMCPY)\r
+# define HAVE_MEMCPY\r
+#endif\r
+#ifdef HAVE_MEMCPY\r
+# ifdef SMALL_MEDIUM /* MSDOS small or medium model */\r
+# define zmemcpy _fmemcpy\r
+# define zmemcmp _fmemcmp\r
+# define zmemzero(dest, len) _fmemset(dest, 0, len)\r
+# else\r
+# define zmemcpy memcpy\r
+# define zmemcmp memcmp\r
+# define zmemzero(dest, len) memset(dest, 0, len)\r
+# endif\r
+#else\r
+ extern void zmemcpy OF((Bytef* dest, const Bytef* source, uInt len));\r
+ extern int zmemcmp OF((const Bytef* s1, const Bytef* s2, uInt len));\r
+ extern void zmemzero OF((Bytef* dest, uInt len));\r
+#endif\r
+\r
+/* Diagnostic functions */\r
+#ifdef DEBUG\r
+# include <stdio.h>\r
+ extern int z_verbose;\r
+ extern void z_error OF((char *m));\r
+# define Assert(cond,msg) {if(!(cond)) z_error(msg);}\r
+# define Trace(x) {if (z_verbose>=0) fprintf x ;}\r
+# define Tracev(x) {if (z_verbose>0) fprintf x ;}\r
+# define Tracevv(x) {if (z_verbose>1) fprintf x ;}\r
+# define Tracec(c,x) {if (z_verbose>0 && (c)) fprintf x ;}\r
+# define Tracecv(c,x) {if (z_verbose>1 && (c)) fprintf x ;}\r
+#else\r
+# define Assert(cond,msg)\r
+# define Trace(x)\r
+# define Tracev(x)\r
+# define Tracevv(x)\r
+# define Tracec(c,x)\r
+# define Tracecv(c,x)\r
+#endif\r
+\r
+\r
+voidpf zcalloc OF((voidpf opaque, unsigned items, unsigned size));\r
+void zcfree OF((voidpf opaque, voidpf ptr));\r
+\r
+#define ZALLOC(strm, items, size) \\r
+ (*((strm)->zalloc))((strm)->opaque, (items), (size))\r
+#define ZFREE(strm, addr) (*((strm)->zfree))((strm)->opaque, (voidpf)(addr))\r
+#define TRY_FREE(s, p) {if (p) ZFREE(s, p);}\r
+\r
+#endif /* ZUTIL_H */\r
projects / shibboleth / cpp-opensaml.git / commitdiff