summaryrefslogtreecommitdiff
path: root/deps/zlib/inftrees.h
diff options
context:
space:
mode:
Diffstat (limited to 'deps/zlib/inftrees.h')
-rw-r--r--deps/zlib/inftrees.h18
1 files changed, 9 insertions, 9 deletions
diff --git a/deps/zlib/inftrees.h b/deps/zlib/inftrees.h
index f11f29c076..baa53a0b1a 100644
--- a/deps/zlib/inftrees.h
+++ b/deps/zlib/inftrees.h
@@ -36,17 +36,17 @@ typedef struct {
*/
/* Maximum size of the dynamic table. The maximum number of code structures is
- 1924, which is the sum of 1332 for literal/length codes and 592 for distance
+ 1444, which is the sum of 852 for literal/length codes and 592 for distance
codes. These values were found by exhaustive searches using the program
- examples/enough.c found in the zlib distribution. The arguments to that
+ examples/enough.c found in the zlib distribtution. The arguments to that
program are the number of symbols, the initial root table size, and the
- maximum bit length of a code. "enough 286 10 15" for literal/length codes
- returns returns 1332, and "enough 30 9 15" for distance codes returns 592.
- The initial root table size (10 or 9) is found in the fifth argument of the
+ maximum bit length of a code. "enough 286 9 15" for literal/length codes
+ returns returns 852, and "enough 30 6 15" for distance codes returns 592.
+ The initial root table size (9 or 6) is found in the fifth argument of the
inflate_table() calls in inflate.c and infback.c. If the root table size is
changed, then these maximum sizes would be need to be recalculated and
updated. */
-#define ENOUGH_LENS 1332
+#define ENOUGH_LENS 852
#define ENOUGH_DISTS 592
#define ENOUGH (ENOUGH_LENS+ENOUGH_DISTS)
@@ -57,6 +57,6 @@ typedef enum {
DISTS
} codetype;
-int ZLIB_INTERNAL inflate_table(codetype type, unsigned short FAR *lens,
- unsigned codes, code FAR * FAR *table,
- unsigned FAR *bits, unsigned short FAR *work);
+int ZLIB_INTERNAL inflate_table OF((codetype type, unsigned short FAR *lens,
+ unsigned codes, code FAR * FAR *table,
+ unsigned FAR *bits, unsigned short FAR *work));