1 /* vi: set sw=4 ts=4: */
3 * Gzip implementation for busybox
5 * Based on GNU gzip Copyright (C) 1992-1993 Jean-loup Gailly.
7 * Originally adjusted for busybox by Charles P. Wright <cpw@unix.asb.com>
8 * "this is a stripped down version of gzip I put into busybox, it does
9 * only standard in to standard out with -9 compression. It also requires
10 * the zcat module for some important functions."
12 * Adjusted further by Erik Andersen <andersen@codepoet.org> to support
13 * files as well as stdin/stdout, and to generally behave itself wrt
14 * command line handling.
16 * Licensed under GPLv2 or later, see file LICENSE in this source tree.
18 /* TODO: full support for -v for DESKTOP
19 * "/usr/bin/gzip -v a bogus aa" should say:
20 a: 85.1% -- replaced with a.gz
21 gzip: bogus: No such file or directory
22 aa: 85.1% -- replaced with aa.gz
25 //config: bool "gzip (19 kb)"
28 //config: gzip is used to compress files.
29 //config: It's probably the most widely used UNIX compression program.
31 //config:config FEATURE_GZIP_LONG_OPTIONS
32 //config: bool "Enable long options"
34 //config: depends on GZIP && LONG_OPTS
36 //config:config GZIP_FAST
37 //config: int "Trade memory for speed (0:small,slow - 2:fast,big)"
40 //config: depends on GZIP
42 //config: Enable big memory options for gzip.
43 //config: 0: small buffers, small hash-tables
44 //config: 1: larger buffers, larger hash-tables
45 //config: 2: larger buffers, largest hash-tables
46 //config: Larger models may give slightly better compression
48 //config:config FEATURE_GZIP_LEVELS
49 //config: bool "Enable compression levels"
51 //config: depends on GZIP
53 //config: Enable support for compression levels 4-9. The default level
54 //config: is 6. If levels 1-3 are specified, 4 is used.
55 //config: If this option is not selected, -N options are ignored and -9
58 //config:config FEATURE_GZIP_DECOMPRESS
59 //config: bool "Enable decompression"
61 //config: depends on GZIP || GUNZIP || ZCAT
63 //config: Enable -d (--decompress) and -t (--test) options for gzip.
64 //config: This will be automatically selected if gunzip or zcat is
67 //applet:IF_GZIP(APPLET(gzip, BB_DIR_BIN, BB_SUID_DROP))
69 //kbuild:lib-$(CONFIG_GZIP) += gzip.o
71 //usage:#define gzip_trivial_usage
72 //usage: "[-cfk" IF_FEATURE_GZIP_DECOMPRESS("dt") IF_FEATURE_GZIP_LEVELS("123456789") "] [FILE]..."
73 //usage:#define gzip_full_usage "\n\n"
74 //usage: "Compress FILEs (or stdin)\n"
75 //usage: IF_FEATURE_GZIP_LEVELS(
76 //usage: "\n -1..9 Compression level"
78 //usage: IF_FEATURE_GZIP_DECOMPRESS(
79 //usage: "\n -d Decompress"
80 //usage: "\n -t Test file integrity"
82 //usage: "\n -c Write to stdout"
83 //usage: "\n -f Force"
84 //usage: "\n -k Keep input files"
86 //usage:#define gzip_example_usage
87 //usage: "$ ls -la /tmp/busybox*\n"
88 //usage: "-rw-rw-r-- 1 andersen andersen 1761280 Apr 14 17:47 /tmp/busybox.tar\n"
89 //usage: "$ gzip /tmp/busybox.tar\n"
90 //usage: "$ ls -la /tmp/busybox*\n"
91 //usage: "-rw-rw-r-- 1 andersen andersen 554058 Apr 14 17:49 /tmp/busybox.tar.gz\n"
94 #include "bb_archive.h"
97 /* ===========================================================================
100 /* Diagnostic functions */
103 # define Assert(cond,msg) { if (!(cond)) bb_error_msg(msg); }
104 # define Trace(x) fprintf x
105 # define Tracev(x) {if (verbose) fprintf x; }
106 # define Tracevv(x) {if (verbose > 1) fprintf x; }
107 # define Tracec(c,x) {if (verbose && (c)) fprintf x; }
108 # define Tracecv(c,x) {if (verbose > 1 && (c)) fprintf x; }
110 # define Assert(cond,msg)
115 # define Tracecv(c,x)
119 /* ===========================================================================
121 #if CONFIG_GZIP_FAST == 0
123 #elif CONFIG_GZIP_FAST == 1
125 #elif CONFIG_GZIP_FAST == 2
128 # error "Invalid CONFIG_GZIP_FAST value"
133 # define INBUFSIZ 0x2000 /* input buffer size */
135 # define INBUFSIZ 0x8000 /* input buffer size */
141 # define OUTBUFSIZ 8192 /* output buffer size */
143 # define OUTBUFSIZ 16384 /* output buffer size */
149 # define DIST_BUFSIZE 0x2000 /* buffer for distances, see trees.c */
151 # define DIST_BUFSIZE 0x8000 /* buffer for distances, see trees.c */
156 #define ASCII_FLAG 0x01 /* bit 0 set: file probably ascii text */
157 #define CONTINUATION 0x02 /* bit 1 set: continuation of multi-part gzip file */
158 #define EXTRA_FIELD 0x04 /* bit 2 set: extra field present */
159 #define ORIG_NAME 0x08 /* bit 3 set: original file name present */
160 #define COMMENT 0x10 /* bit 4 set: file comment present */
161 #define RESERVED 0xC0 /* bit 6,7: reserved */
163 /* internal file attribute */
164 #define UNKNOWN 0xffff
169 # define WSIZE 0x8000 /* window size--must be a power of two, and */
170 #endif /* at least 32K for zip's deflate method */
173 #define MAX_MATCH 258
174 /* The minimum and maximum match lengths */
176 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
177 /* Minimum amount of lookahead, except at the end of the input file.
178 * See deflate.c for comments about the MIN_MATCH+1.
181 #define MAX_DIST (WSIZE-MIN_LOOKAHEAD)
182 /* In order to simplify the code, particularly on 16 bit machines, match
183 * distances are limited to MAX_DIST instead of WSIZE.
187 # define MAX_PATH_LEN 1024 /* max pathname length */
190 #define seekable() 0 /* force sequential output */
191 #define translate_eol 0 /* no option -a yet */
196 #define INIT_BITS 9 /* Initial number of bits per code */
198 #define BIT_MASK 0x1f /* Mask for 'number of compression bits' */
199 /* Mask 0x20 is reserved to mean a fourth header byte, and 0x40 is free.
200 * It's a pity that old uncompress does not check bit 0x20. That makes
201 * extension of the format actually undesirable because old compress
202 * would just crash on the new format instead of giving a meaningful
203 * error message. It does check the number of bits, but it's more
204 * helpful to say "unsupported format, get a new version" than
205 * "can only handle 16 bits".
209 # define MAX_SUFFIX MAX_EXT_CHARS
211 # define MAX_SUFFIX 30
215 /* ===========================================================================
216 * Compile with MEDIUM_MEM to reduce the memory requirements or
217 * with SMALL_MEM to use as little memory as possible. Use BIG_MEM if the
218 * entire input file can be held in memory (not possible on 16 bit systems).
219 * Warning: defining these symbols affects HASH_BITS (see below) and thus
220 * affects the compression ratio. The compressed output
221 * is still correct, and might even be smaller in some cases.
225 # define HASH_BITS 13 /* Number of bits used to hash strings */
228 # define HASH_BITS 14
231 # define HASH_BITS 15
232 /* For portability to 16 bit machines, do not use values above 15. */
235 #define HASH_SIZE (unsigned)(1<<HASH_BITS)
236 #define HASH_MASK (HASH_SIZE-1)
237 #define WMASK (WSIZE-1)
238 /* HASH_SIZE and WSIZE must be powers of two */
240 # define TOO_FAR 4096
242 /* Matches of length 3 are discarded if their distance exceeds TOO_FAR */
245 /* ===========================================================================
246 * These types are not really 'char', 'short' and 'long'
249 typedef uint16_t ush;
250 typedef uint32_t ulg;
254 typedef unsigned IPos;
255 /* A Pos is an index in the character window. We use short instead of int to
256 * save space in the various tables. IPos is used only for parameter passing.
260 WINDOW_SIZE = 2 * WSIZE,
261 /* window size, 2*WSIZE except for MMAP or BIG_MEM, where it is the
262 * input file length plus MIN_LOOKAHEAD.
265 #if !ENABLE_FEATURE_GZIP_LEVELS
267 max_chain_length = 4096,
268 /* To speed up deflation, hash chains are never searched beyond this length.
269 * A higher limit improves compression ratio but degrades the speed.
272 max_lazy_match = 258,
273 /* Attempt to find a better match only when the current match is strictly
274 * smaller than this value. This mechanism is used only for compression
278 max_insert_length = max_lazy_match,
279 /* Insert new strings in the hash table only if the match length
280 * is not greater than this length. This saves time but degrades compression.
281 * max_insert_length is used only for compression levels <= 3.
285 /* Use a faster search when the previous match is longer than this */
287 /* Values for max_lazy_match, good_match and max_chain_length, depending on
288 * the desired pack level (0..9). The values given below have been tuned to
289 * exclude worst case performance for pathological files. Better values may be
290 * found for specific files.
293 nice_match = 258, /* Stop searching when current match exceeds this */
294 /* Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4
295 * For deflate_fast() (levels <= 3) good is ignored and lazy has a different
298 #endif /* ENABLE_FEATURE_GZIP_LEVELS */
303 /* =========================================================================== */
304 /* global buffers, allocated once */
306 #define DECLARE(type, array, size) \
308 #define ALLOC(type, array, size) \
309 array = xzalloc((size_t)(((size)+1L)/2) * 2*sizeof(type))
310 #define FREE(array) \
311 do { free(array); array = NULL; } while (0)
313 /* buffer for literals or lengths */
314 /* DECLARE(uch, l_buf, LIT_BUFSIZE); */
315 DECLARE(uch, l_buf, INBUFSIZ);
317 DECLARE(ush, d_buf, DIST_BUFSIZE);
318 DECLARE(uch, outbuf, OUTBUFSIZ);
320 /* Sliding window. Input bytes are read into the second half of the window,
321 * and move to the first half later to keep a dictionary of at least WSIZE
322 * bytes. With this organization, matches are limited to a distance of
323 * WSIZE-MAX_MATCH bytes, but this ensures that IO is always
324 * performed with a length multiple of the block size. Also, it limits
325 * the window size to 64K, which is quite useful on MSDOS.
326 * To do: limit the window size to WSIZE+BSZ if SMALL_MEM (the code would
327 * be less efficient).
329 DECLARE(uch, window, 2L * WSIZE);
331 /* Link to older string with same hash index. To limit the size of this
332 * array to 64K, this link is maintained only for the last 32K strings.
333 * An index in this array is thus a window index modulo 32K.
335 /* DECLARE(Pos, prev, WSIZE); */
336 DECLARE(ush, prev, 1L << BITS);
338 /* Heads of the hash chains or 0. */
339 /* DECLARE(Pos, head, 1<<HASH_BITS); */
340 #define head (G1.prev + WSIZE) /* hash head (see deflate.c) */
342 /* =========================================================================== */
343 /* all members below are zeroed out in pack_gzip() for each next file */
345 uint32_t crc; /* shift register contents */
346 /*uint32_t *crc_32_tab;*/
348 #if ENABLE_FEATURE_GZIP_LEVELS
349 unsigned max_chain_length;
350 unsigned max_lazy_match;
353 #define max_chain_length (G1.max_chain_length)
354 #define max_lazy_match (G1.max_lazy_match)
355 #define good_match (G1.good_match)
356 #define nice_match (G1.nice_match)
359 /* window position at the beginning of the current output block. Gets
360 * negative when the window is moved backwards.
364 unsigned ins_h; /* hash index of string to be inserted */
366 /* Number of bits by which ins_h and del_h must be shifted at each
367 * input step. It must be such that after MIN_MATCH steps, the oldest
368 * byte no longer takes part in the hash key, that is:
369 * H_SHIFT * MIN_MATCH >= HASH_BITS
371 #define H_SHIFT ((HASH_BITS+MIN_MATCH-1) / MIN_MATCH)
373 /* Length of the best match at previous step. Matches not greater than this
374 * are discarded. This is used in the lazy match evaluation.
376 unsigned prev_length;
378 unsigned strstart; /* start of string to insert */
379 unsigned match_start; /* start of matching string */
380 unsigned lookahead; /* number of valid bytes ahead in window */
382 /* number of input bytes */
383 ulg isize; /* only 32 bits stored in .gz file */
385 /* bbox always use stdin/stdout */
386 #define ifd STDIN_FILENO /* input file descriptor */
387 #define ofd STDOUT_FILENO /* output file descriptor */
390 unsigned insize; /* valid bytes in l_buf */
392 unsigned outcnt; /* bytes in output buffer */
393 smallint eofile; /* flag set at end of input file */
395 /* ===========================================================================
396 * Local data used by the "bit string" routines.
399 /* Output buffer. bits are inserted starting at the bottom (least significant
402 unsigned bi_buf; /* was unsigned short */
405 #define BUF_SIZE (int)(8 * sizeof(G1.bi_buf))
407 /* Number of bits used within bi_buf. (bi_buf might be implemented on
408 * more than 16 bits on some systems.)
413 ulg bits_sent; /* bit length of the compressed data */
417 #define G1 (*(ptr_to_globals - 1))
420 /* ===========================================================================
421 * Write the output buffer outbuf[0..outcnt-1] and update bytes_out.
422 * (used for the compressed data only)
424 static void flush_outbuf(void)
429 xwrite(ofd, (char *) G1.outbuf, G1.outcnt);
434 /* ===========================================================================
436 /* put_8bit is used for the compressed output */
437 #define put_8bit(c) \
439 G1.outbuf[G1.outcnt++] = (c); \
440 if (G1.outcnt == OUTBUFSIZ) \
444 /* Output a 16 bit value, lsb first */
445 static void put_16bit(ush w)
447 /* GCC 4.2.1 won't optimize out redundant loads of G1.outcnt
448 * (probably because of fear of aliasing with G1.outbuf[]
449 * stores), do it explicitly:
451 unsigned outcnt = G1.outcnt;
452 uch *dst = &G1.outbuf[outcnt];
454 #if BB_UNALIGNED_MEMACCESS_OK && BB_LITTLE_ENDIAN
455 if (outcnt < OUTBUFSIZ-2) {
457 ush *dst16 = (void*) dst;
458 *dst16 = w; /* unaligned LSB 16-bit store */
459 G1.outcnt = outcnt + 2;
464 G1.outcnt = ++outcnt;
468 if (outcnt < OUTBUFSIZ-2) {
471 G1.outcnt = outcnt + 2;
474 G1.outcnt = ++outcnt;
477 /* Slowpath: we will need to do flush_outbuf() */
478 if (outcnt == OUTBUFSIZ)
479 flush_outbuf(); /* here */
480 put_8bit(w); /* or here */
483 #define OPTIMIZED_PUT_32BIT (CONFIG_GZIP_FAST > 0 && BB_UNALIGNED_MEMACCESS_OK && BB_LITTLE_ENDIAN)
484 static void put_32bit(ulg n)
486 #if OPTIMIZED_PUT_32BIT
487 unsigned outcnt = G1.outcnt;
488 if (outcnt < OUTBUFSIZ-4) {
490 ulg *dst32 = (void*) &G1.outbuf[outcnt];
491 *dst32 = n; /* unaligned LSB 32-bit store */
492 G1.outcnt = outcnt + 4;
500 /* ===========================================================================
501 * Run a set of bytes through the crc shift register. If s is a NULL
502 * pointer, then initialize the crc shift register contents instead.
503 * Return the current crc in either case.
505 static void updcrc(uch * s, unsigned n)
507 G1.crc = crc32_block_endian0(G1.crc, s, n, global_crc32_table /*G1.crc_32_tab*/);
511 /* ===========================================================================
512 * Read a new buffer from the current input file, perform end-of-line
513 * translation, and update the crc and input file size.
514 * IN assertion: size >= 2 (for end-of-line translation)
516 static unsigned file_read(void *buf, unsigned size)
520 Assert(G1.insize == 0, "l_buf not empty");
522 len = safe_read(ifd, buf, size);
523 if (len == (unsigned)(-1) || len == 0)
532 /* ===========================================================================
533 * Send a value on a given number of bits.
534 * IN assertion: length <= 16 and value fits in length bits.
536 static void send_bits(unsigned value, unsigned length)
541 Tracev((stderr, " l %2d v %4x ", length, value));
542 Assert(length > 0 && length <= 15, "invalid length");
543 G1.bits_sent += length;
545 BUILD_BUG_ON(BUF_SIZE != 32 && BUF_SIZE != 16);
547 new_buf = G1.bi_buf | (value << G1.bi_valid);
548 /* NB: the above may sometimes do "<< 32" shift (undefined)
549 * if check below is changed to "length > BUF_SIZE" instead of >= */
550 length += G1.bi_valid;
552 /* If bi_buf is full */
553 if (length >= BUF_SIZE) {
554 /* ...use (valid) bits from bi_buf and
555 * (BUF_SIZE - bi_valid) bits from value,
556 * leaving (width - (BUF_SIZE-bi_valid)) unused bits in value.
558 value >>= (BUF_SIZE - G1.bi_valid);
559 if (BUF_SIZE == 32) {
568 G1.bi_valid = length;
572 /* ===========================================================================
573 * Reverse the first len bits of a code, using straightforward code (a faster
574 * method would use a table)
575 * IN assertion: 1 <= len <= 15
577 static unsigned bi_reverse(unsigned code, int len)
583 if (--len <= 0) return res;
590 /* ===========================================================================
591 * Write out any remaining bits in an incomplete byte.
593 static void bi_windup(void)
595 unsigned bits = G1.bi_buf;
596 int cnt = G1.bi_valid;
606 G1.bits_sent = (G1.bits_sent + 7) & ~7;
611 /* ===========================================================================
612 * Copy a stored block to the zip file, storing first the length and its
613 * one's complement if requested.
615 static void copy_block(char *buf, unsigned len, int header)
617 bi_windup(); /* align on byte boundary */
620 unsigned v = ((uint16_t)len) | ((~len) << 16);
623 G1.bits_sent += 2 * 16;
627 G1.bits_sent += (ulg) len << 3;
635 /* ===========================================================================
636 * Fill the window when the lookahead becomes insufficient.
637 * Updates strstart and lookahead, and sets eofile if end of input file.
638 * IN assertion: lookahead < MIN_LOOKAHEAD && strstart + lookahead > 0
639 * OUT assertions: at least one byte has been read, or eofile is set;
640 * file reads are performed for at least two bytes (required for the
641 * translate_eol option).
643 static void fill_window(void)
646 unsigned more = WINDOW_SIZE - G1.lookahead - G1.strstart;
647 /* Amount of free space at the end of the window. */
649 /* If the window is almost full and there is insufficient lookahead,
650 * move the upper half to the lower one to make room in the upper half.
652 if (more == (unsigned) -1) {
653 /* Very unlikely, but possible on 16 bit machine if strstart == 0
654 * and lookahead == 1 (input done one byte at time)
657 } else if (G1.strstart >= WSIZE + MAX_DIST) {
658 /* By the IN assertion, the window is not empty so we can't confuse
659 * more == 0 with more == 64K on a 16 bit machine.
661 Assert(WINDOW_SIZE == 2 * WSIZE, "no sliding with BIG_MEM");
663 memcpy(G1.window, G1.window + WSIZE, WSIZE);
664 G1.match_start -= WSIZE;
665 G1.strstart -= WSIZE; /* we now have strstart >= MAX_DIST: */
667 G1.block_start -= WSIZE;
669 for (n = 0; n < HASH_SIZE; n++) {
671 head[n] = (Pos) (m >= WSIZE ? m - WSIZE : 0);
673 for (n = 0; n < WSIZE; n++) {
675 G1.prev[n] = (Pos) (m >= WSIZE ? m - WSIZE : 0);
676 /* If n is not on any hash chain, prev[n] is garbage but
677 * its value will never be used.
682 /* At this point, more >= 2 */
684 n = file_read(G1.window + G1.strstart + G1.lookahead, more);
685 if (n == 0 || n == (unsigned) -1) {
692 /* Both users fill window with the same loop: */
693 static void fill_window_if_needed(void)
695 while (G1.lookahead < MIN_LOOKAHEAD && !G1.eofile)
700 /* ===========================================================================
701 * Set match_start to the longest match starting at the given string and
702 * return its length. Matches shorter or equal to prev_length are discarded,
703 * in which case the result is equal to prev_length and match_start is
705 * IN assertions: cur_match is the head of the hash chain for the current
706 * string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1
709 /* For MSDOS, OS/2 and 386 Unix, an optimized version is in match.asm or
710 * match.s. The code is functionally equivalent, so you can use the C version
713 static int longest_match(IPos cur_match)
715 unsigned chain_length = max_chain_length; /* max hash chain length */
716 uch *scan = G1.window + G1.strstart; /* current string */
717 uch *match; /* matched string */
718 int len; /* length of current match */
719 int best_len = G1.prev_length; /* best match length so far */
720 IPos limit = G1.strstart > (IPos) MAX_DIST ? G1.strstart - (IPos) MAX_DIST : 0;
721 /* Stop when cur_match becomes <= limit. To simplify the code,
722 * we prevent matches with the string of window index 0.
725 /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.
726 * It is easy to get rid of this optimization if necessary.
728 #if HASH_BITS < 8 || MAX_MATCH != 258
729 # error Code too clever
731 uch *strend = G1.window + G1.strstart + MAX_MATCH;
732 uch scan_end1 = scan[best_len - 1];
733 uch scan_end = scan[best_len];
735 /* Do not waste too much time if we already have a good match: */
736 if (G1.prev_length >= good_match) {
739 Assert(G1.strstart <= WINDOW_SIZE - MIN_LOOKAHEAD, "insufficient lookahead");
742 Assert(cur_match < G1.strstart, "no future");
743 match = G1.window + cur_match;
745 /* Skip to next match if the match length cannot increase
746 * or if the match length is less than 2:
748 if (match[best_len] != scan_end
749 || match[best_len - 1] != scan_end1
750 || *match != *scan || *++match != scan[1]
755 /* The check at best_len-1 can be removed because it will be made
756 * again later. (This heuristic is not always a win.)
757 * It is not necessary to compare scan[2] and match[2] since they
758 * are always equal when the other bytes match, given that
759 * the hash keys are equal and that HASH_BITS >= 8.
763 /* We check for insufficient lookahead only every 8th comparison;
764 * the 256th check will be made at strstart+258.
767 } while (*++scan == *++match && *++scan == *++match &&
768 *++scan == *++match && *++scan == *++match &&
769 *++scan == *++match && *++scan == *++match &&
770 *++scan == *++match && *++scan == *++match && scan < strend);
772 len = MAX_MATCH - (int) (strend - scan);
773 scan = strend - MAX_MATCH;
775 if (len > best_len) {
776 G1.match_start = cur_match;
778 if (len >= nice_match)
780 scan_end1 = scan[best_len - 1];
781 scan_end = scan[best_len];
783 } while ((cur_match = G1.prev[cur_match & WMASK]) > limit
784 && --chain_length != 0);
791 /* ===========================================================================
792 * Check that the match at match_start is indeed a match.
794 static void check_match(IPos start, IPos match, int length)
796 /* check that the match is indeed a match */
797 if (memcmp(G1.window + match, G1.window + start, length) != 0) {
798 bb_error_msg(" start %d, match %d, length %d", start, match, length);
799 bb_error_msg("invalid match");
802 bb_error_msg("\\[%d,%d]", start - match, length);
804 bb_putchar_stderr(G1.window[start++]);
805 } while (--length != 0);
809 # define check_match(start, match, length) ((void)0)
813 /* trees.c -- output deflated data using Huffman coding
814 * Copyright (C) 1992-1993 Jean-loup Gailly
815 * This is free software; you can redistribute it and/or modify it under the
816 * terms of the GNU General Public License, see the file COPYING.
820 * Encode various sets of source values using variable-length
824 * The PKZIP "deflation" process uses several Huffman trees. The more
825 * common source values are represented by shorter bit sequences.
827 * Each code tree is stored in the ZIP file in a compressed form
828 * which is itself a Huffman encoding of the lengths of
829 * all the code strings (in ascending order by source values).
830 * The actual code strings are reconstructed from the lengths in
831 * the UNZIP process, as described in the "application note"
832 * (APPNOTE.TXT) distributed as part of PKWARE's PKZIP program.
836 * Data Compression: Techniques and Applications, pp. 53-55.
837 * Lifetime Learning Publications, 1985. ISBN 0-534-03418-7.
840 * Data Compression: Methods and Theory, pp. 49-50.
841 * Computer Science Press, 1988. ISBN 0-7167-8156-5.
845 * Addison-Wesley, 1983. ISBN 0-201-06672-6.
849 * Allocate the match buffer, initialize the various tables [and save
850 * the location of the internal file attribute (ascii/binary) and
851 * method (DEFLATE/STORE) -- deleted in bbox]
853 * void ct_tally(int dist, int lc);
854 * Save the match info and tally the frequency counts.
856 * ulg flush_block(char *buf, ulg stored_len, int eof)
857 * Determine the best encoding for the current block: dynamic trees,
858 * static trees or store, and output the encoded block to the zip
859 * file. Returns the total compressed length for the file so far.
863 /* All codes must not exceed MAX_BITS bits */
865 #define MAX_BL_BITS 7
866 /* Bit length codes must not exceed MAX_BL_BITS bits */
868 #define LENGTH_CODES 29
869 /* number of length codes, not counting the special END_BLOCK code */
872 /* number of literal bytes 0..255 */
874 #define END_BLOCK 256
875 /* end of block literal code */
877 #define L_CODES (LITERALS+1+LENGTH_CODES)
878 /* number of Literal or Length codes, including the END_BLOCK code */
881 /* number of distance codes */
884 /* number of codes used to transfer the bit lengths */
886 /* extra bits for each length code */
887 static const uint8_t extra_lbits[LENGTH_CODES] ALIGN1 = {
888 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4,
892 /* extra bits for each distance code */
893 static const uint8_t extra_dbits[D_CODES] ALIGN1 = {
894 0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9,
895 10, 10, 11, 11, 12, 12, 13, 13
898 /* extra bits for each bit length code */
899 static const uint8_t extra_blbits[BL_CODES] ALIGN1 = {
900 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3, 7 };
902 /* number of codes at each bit length for an optimal tree */
903 static const uint8_t bl_order[BL_CODES] ALIGN1 = {
904 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 };
906 #define STORED_BLOCK 0
907 #define STATIC_TREES 1
909 /* The three kinds of block type */
913 # define LIT_BUFSIZE 0x2000
916 # define LIT_BUFSIZE 0x4000
918 # define LIT_BUFSIZE 0x8000
923 # define DIST_BUFSIZE LIT_BUFSIZE
925 /* Sizes of match buffers for literals/lengths and distances. There are
926 * 4 reasons for limiting LIT_BUFSIZE to 64K:
927 * - frequencies can be kept in 16 bit counters
928 * - if compression is not successful for the first block, all input data is
929 * still in the window so we can still emit a stored block even when input
930 * comes from standard input. (This can also be done for all blocks if
931 * LIT_BUFSIZE is not greater than 32K.)
932 * - if compression is not successful for a file smaller than 64K, we can
933 * even emit a stored file instead of a stored block (saving 5 bytes).
934 * - creating new Huffman trees less frequently may not provide fast
935 * adaptation to changes in the input data statistics. (Take for
936 * example a binary file with poorly compressible code followed by
937 * a highly compressible string table.) Smaller buffer sizes give
938 * fast adaptation but have of course the overhead of transmitting trees
940 * - I can't count above 4
941 * The current code is general and allows DIST_BUFSIZE < LIT_BUFSIZE (to save
942 * memory at the expense of compression). Some optimizations would be possible
943 * if we rely on DIST_BUFSIZE == LIT_BUFSIZE.
946 /* repeat previous bit length 3-6 times (2 bits of repeat count) */
948 /* repeat a zero length 3-10 times (3 bits of repeat count) */
949 #define REPZ_11_138 18
950 /* repeat a zero length 11-138 times (7 bits of repeat count) */
952 /* ===========================================================================
954 /* Data structure describing a single value and its code string. */
955 typedef struct ct_data {
957 ush freq; /* frequency count */
958 ush code; /* bit string */
961 ush dad; /* father node in Huffman tree */
962 ush len; /* length of bit string */
971 #define HEAP_SIZE (2*L_CODES + 1)
972 /* maximum heap size */
974 typedef struct tree_desc {
975 ct_data *dyn_tree; /* the dynamic tree */
976 ct_data *static_tree; /* corresponding static tree or NULL */
977 const uint8_t *extra_bits; /* extra bits for each code or NULL */
978 int extra_base; /* base index for extra_bits */
979 int elems; /* max number of elements in the tree */
980 int max_length; /* max bit length for the codes */
981 int max_code; /* largest code with non zero frequency */
986 ush heap[HEAP_SIZE]; /* heap used to build the Huffman trees */
987 int heap_len; /* number of elements in the heap */
988 int heap_max; /* element of largest frequency */
990 /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.
991 * The same heap array is used to build all trees.
994 ct_data dyn_ltree[HEAP_SIZE]; /* literal and length tree */
995 ct_data dyn_dtree[2 * D_CODES + 1]; /* distance tree */
997 ct_data static_ltree[L_CODES + 2];
999 /* The static literal tree. Since the bit lengths are imposed, there is no
1000 * need for the L_CODES extra codes used during heap construction. However
1001 * The codes 286 and 287 are needed to build a canonical tree (see ct_init
1005 ct_data static_dtree[D_CODES];
1007 /* The static distance tree. (Actually a trivial tree since all codes use
1011 ct_data bl_tree[2 * BL_CODES + 1];
1013 /* Huffman tree for the bit lengths */
1019 ush bl_count[MAX_BITS + 1];
1021 /* The lengths of the bit length codes are sent in order of decreasing
1022 * probability, to avoid transmitting the lengths for unused bit length codes.
1025 uch depth[2 * L_CODES + 1];
1027 /* Depth of each subtree used as tie breaker for trees of equal frequency */
1029 uch length_code[MAX_MATCH - MIN_MATCH + 1];
1031 /* length code for each normalized match length (0 == MIN_MATCH) */
1035 /* distance codes. The first 256 values correspond to the distances
1036 * 3 .. 258, the last 256 values correspond to the top 8 bits of
1037 * the 15 bit distances.
1040 int base_length[LENGTH_CODES];
1042 /* First normalized length for each code (0 = MIN_MATCH) */
1044 int base_dist[D_CODES];
1046 /* First normalized distance for each code (0 = distance of 1) */
1048 uch flag_buf[LIT_BUFSIZE / 8];
1050 /* flag_buf is a bit array distinguishing literals from lengths in
1051 * l_buf, thus indicating the presence or absence of a distance.
1054 unsigned last_lit; /* running index in l_buf */
1055 unsigned last_dist; /* running index in d_buf */
1056 unsigned last_flags; /* running index in flag_buf */
1057 uch flags; /* current flags not yet saved in flag_buf */
1058 uch flag_bit; /* current bit used in flags */
1060 /* bits are filled in flags starting at bit 0 (least significant).
1061 * Note: these flags are overkill in the current code since we don't
1062 * take advantage of DIST_BUFSIZE == LIT_BUFSIZE.
1065 ulg opt_len; /* bit length of current block with optimal trees */
1066 ulg static_len; /* bit length of current block with static trees */
1068 ulg compressed_len; /* total bit length of compressed file */
1071 #define G2ptr ((struct globals2*)(ptr_to_globals))
1075 /* ===========================================================================
1077 static void gen_codes(ct_data * tree, int max_code);
1078 static void build_tree(tree_desc * desc);
1079 static void scan_tree(ct_data * tree, int max_code);
1080 static void send_tree(ct_data * tree, int max_code);
1081 static int build_bl_tree(void);
1082 static void send_all_trees(int lcodes, int dcodes, int blcodes);
1083 static void compress_block(ct_data * ltree, ct_data * dtree);
1087 /* Send a code of the given tree. c and tree must not have side effects */
1088 # define SEND_CODE(c, tree) send_bits(tree[c].Code, tree[c].Len)
1090 # define SEND_CODE(c, tree) \
1092 if (verbose > 1) bb_error_msg("\ncd %3d ", (c)); \
1093 send_bits(tree[c].Code, tree[c].Len); \
1097 #define D_CODE(dist) \
1098 ((dist) < 256 ? G2.dist_code[dist] : G2.dist_code[256 + ((dist)>>7)])
1099 /* Mapping from a distance to a distance code. dist is the distance - 1 and
1100 * must not have side effects. dist_code[256] and dist_code[257] are never
1102 * The arguments must not have side effects.
1106 /* ===========================================================================
1107 * Initialize a new block.
1109 static void init_block(void)
1111 int n; /* iterates over tree elements */
1113 /* Initialize the trees. */
1114 for (n = 0; n < L_CODES; n++)
1115 G2.dyn_ltree[n].Freq = 0;
1116 for (n = 0; n < D_CODES; n++)
1117 G2.dyn_dtree[n].Freq = 0;
1118 for (n = 0; n < BL_CODES; n++)
1119 G2.bl_tree[n].Freq = 0;
1121 G2.dyn_ltree[END_BLOCK].Freq = 1;
1122 G2.opt_len = G2.static_len = 0;
1123 G2.last_lit = G2.last_dist = G2.last_flags = 0;
1129 /* ===========================================================================
1130 * Restore the heap property by moving down the tree starting at node k,
1131 * exchanging a node with the smallest of its two sons if necessary, stopping
1132 * when the heap property is re-established (each father smaller than its
1136 /* Compares to subtrees, using the tree depth as tie breaker when
1137 * the subtrees have equal frequency. This minimizes the worst case length. */
1138 #define SMALLER(tree, n, m) \
1139 (tree[n].Freq < tree[m].Freq \
1140 || (tree[n].Freq == tree[m].Freq && G2.depth[n] <= G2.depth[m]))
1142 static void pqdownheap(ct_data * tree, int k)
1145 int j = k << 1; /* left son of k */
1147 while (j <= G2.heap_len) {
1148 /* Set j to the smallest of the two sons: */
1149 if (j < G2.heap_len && SMALLER(tree, G2.heap[j + 1], G2.heap[j]))
1152 /* Exit if v is smaller than both sons */
1153 if (SMALLER(tree, v, G2.heap[j]))
1156 /* Exchange v with the smallest son */
1157 G2.heap[k] = G2.heap[j];
1160 /* And continue down the tree, setting j to the left son of k */
1167 /* ===========================================================================
1168 * Compute the optimal bit lengths for a tree and update the total bit length
1169 * for the current block.
1170 * IN assertion: the fields freq and dad are set, heap[heap_max] and
1171 * above are the tree nodes sorted by increasing frequency.
1172 * OUT assertions: the field len is set to the optimal bit length, the
1173 * array bl_count contains the frequencies for each bit length.
1174 * The length opt_len is updated; static_len is also updated if stree is
1177 static void gen_bitlen(tree_desc * desc)
1179 ct_data *tree = desc->dyn_tree;
1180 const uint8_t *extra = desc->extra_bits;
1181 int base = desc->extra_base;
1182 int max_code = desc->max_code;
1183 int max_length = desc->max_length;
1184 ct_data *stree = desc->static_tree;
1185 int h; /* heap index */
1186 int n, m; /* iterate over the tree elements */
1187 int bits; /* bit length */
1188 int xbits; /* extra bits */
1189 ush f; /* frequency */
1190 int overflow = 0; /* number of elements with bit length too large */
1192 for (bits = 0; bits <= MAX_BITS; bits++)
1193 G2.bl_count[bits] = 0;
1195 /* In a first pass, compute the optimal bit lengths (which may
1196 * overflow in the case of the bit length tree).
1198 tree[G2.heap[G2.heap_max]].Len = 0; /* root of the heap */
1200 for (h = G2.heap_max + 1; h < HEAP_SIZE; h++) {
1202 bits = tree[tree[n].Dad].Len + 1;
1203 if (bits > max_length) {
1207 tree[n].Len = (ush) bits;
1208 /* We overwrite tree[n].Dad which is no longer needed */
1211 continue; /* not a leaf node */
1213 G2.bl_count[bits]++;
1216 xbits = extra[n - base];
1218 G2.opt_len += (ulg) f *(bits + xbits);
1221 G2.static_len += (ulg) f * (stree[n].Len + xbits);
1226 Trace((stderr, "\nbit length overflow\n"));
1227 /* This happens for example on obj2 and pic of the Calgary corpus */
1229 /* Find the first bit length which could increase: */
1231 bits = max_length - 1;
1232 while (G2.bl_count[bits] == 0)
1234 G2.bl_count[bits]--; /* move one leaf down the tree */
1235 G2.bl_count[bits + 1] += 2; /* move one overflow item as its brother */
1236 G2.bl_count[max_length]--;
1237 /* The brother of the overflow item also moves one step up,
1238 * but this does not affect bl_count[max_length]
1241 } while (overflow > 0);
1243 /* Now recompute all bit lengths, scanning in increasing frequency.
1244 * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all
1245 * lengths instead of fixing only the wrong ones. This idea is taken
1246 * from 'ar' written by Haruhiko Okumura.)
1248 for (bits = max_length; bits != 0; bits--) {
1249 n = G2.bl_count[bits];
1254 if (tree[m].Len != (unsigned) bits) {
1255 Trace((stderr, "code %d bits %d->%d\n", m, tree[m].Len, bits));
1256 G2.opt_len += ((int32_t) bits - tree[m].Len) * tree[m].Freq;
1265 /* ===========================================================================
1266 * Generate the codes for a given tree and bit counts (which need not be
1268 * IN assertion: the array bl_count contains the bit length statistics for
1269 * the given tree and the field len is set for all tree elements.
1270 * OUT assertion: the field code is set for all tree elements of non
1273 static void gen_codes(ct_data * tree, int max_code)
1275 ush next_code[MAX_BITS + 1]; /* next code value for each bit length */
1276 ush code = 0; /* running code value */
1277 int bits; /* bit index */
1278 int n; /* code index */
1280 /* The distribution counts are first used to generate the code values
1281 * without bit reversal.
1283 for (bits = 1; bits <= MAX_BITS; bits++) {
1284 next_code[bits] = code = (code + G2.bl_count[bits - 1]) << 1;
1286 /* Check that the bit counts in bl_count are consistent. The last code
1289 Assert(code + G2.bl_count[MAX_BITS] - 1 == (1 << MAX_BITS) - 1,
1290 "inconsistent bit counts");
1291 Tracev((stderr, "\ngen_codes: max_code %d ", max_code));
1293 for (n = 0; n <= max_code; n++) {
1294 int len = tree[n].Len;
1298 /* Now reverse the bits */
1299 tree[n].Code = bi_reverse(next_code[len]++, len);
1301 Tracec(tree != G2.static_ltree,
1302 (stderr, "\nn %3d %c l %2d c %4x (%x) ", n,
1303 (n > ' ' ? n : ' '), len, tree[n].Code,
1304 next_code[len] - 1));
1309 /* ===========================================================================
1310 * Construct one Huffman tree and assigns the code bit strings and lengths.
1311 * Update the total bit length for the current block.
1312 * IN assertion: the field freq is set for all tree elements.
1313 * OUT assertions: the fields len and code are set to the optimal bit length
1314 * and corresponding code. The length opt_len is updated; static_len is
1315 * also updated if stree is not null. The field max_code is set.
1318 /* Remove the smallest element from the heap and recreate the heap with
1319 * one less element. Updates heap and heap_len. */
1322 /* Index within the heap array of least frequent node in the Huffman tree */
1324 #define PQREMOVE(tree, top) \
1326 top = G2.heap[SMALLEST]; \
1327 G2.heap[SMALLEST] = G2.heap[G2.heap_len--]; \
1328 pqdownheap(tree, SMALLEST); \
1331 static void build_tree(tree_desc * desc)
1333 ct_data *tree = desc->dyn_tree;
1334 ct_data *stree = desc->static_tree;
1335 int elems = desc->elems;
1336 int n, m; /* iterate over heap elements */
1337 int max_code = -1; /* largest code with non zero frequency */
1338 int node = elems; /* next internal node of the tree */
1340 /* Construct the initial heap, with least frequent element in
1341 * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].
1342 * heap[0] is not used.
1345 G2.heap_max = HEAP_SIZE;
1347 for (n = 0; n < elems; n++) {
1348 if (tree[n].Freq != 0) {
1349 G2.heap[++G2.heap_len] = max_code = n;
1356 /* The pkzip format requires that at least one distance code exists,
1357 * and that at least one bit should be sent even if there is only one
1358 * possible code. So to avoid special checks later on we force at least
1359 * two codes of non zero frequency.
1361 while (G2.heap_len < 2) {
1362 int new = G2.heap[++G2.heap_len] = (max_code < 2 ? ++max_code : 0);
1368 G2.static_len -= stree[new].Len;
1369 /* new is 0 or 1 so it does not have extra bits */
1371 desc->max_code = max_code;
1373 /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree,
1374 * establish sub-heaps of increasing lengths:
1376 for (n = G2.heap_len / 2; n >= 1; n--)
1377 pqdownheap(tree, n);
1379 /* Construct the Huffman tree by repeatedly combining the least two
1383 PQREMOVE(tree, n); /* n = node of least frequency */
1384 m = G2.heap[SMALLEST]; /* m = node of next least frequency */
1386 G2.heap[--G2.heap_max] = n; /* keep the nodes sorted by frequency */
1387 G2.heap[--G2.heap_max] = m;
1389 /* Create a new node father of n and m */
1390 tree[node].Freq = tree[n].Freq + tree[m].Freq;
1391 G2.depth[node] = MAX(G2.depth[n], G2.depth[m]) + 1;
1392 tree[n].Dad = tree[m].Dad = (ush) node;
1394 if (tree == G2.bl_tree) {
1395 bb_error_msg("\nnode %d(%d), sons %d(%d) %d(%d)",
1396 node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);
1399 /* and insert the new node in the heap */
1400 G2.heap[SMALLEST] = node++;
1401 pqdownheap(tree, SMALLEST);
1402 } while (G2.heap_len >= 2);
1404 G2.heap[--G2.heap_max] = G2.heap[SMALLEST];
1406 /* At this point, the fields freq and dad are set. We can now
1407 * generate the bit lengths.
1409 gen_bitlen((tree_desc *) desc);
1411 /* The field len is now set, we can generate the bit codes */
1412 gen_codes((ct_data *) tree, max_code);
1416 /* ===========================================================================
1417 * Scan a literal or distance tree to determine the frequencies of the codes
1418 * in the bit length tree. Updates opt_len to take into account the repeat
1419 * counts. (The contribution of the bit length codes will be added later
1420 * during the construction of bl_tree.)
1422 static void scan_tree(ct_data * tree, int max_code)
1424 int n; /* iterates over all tree elements */
1425 int prevlen = -1; /* last emitted length */
1426 int curlen; /* length of current code */
1427 int nextlen = tree[0].Len; /* length of next code */
1428 int count = 0; /* repeat count of the current code */
1429 int max_count = 7; /* max repeat count */
1430 int min_count = 4; /* min repeat count */
1436 tree[max_code + 1].Len = 0xffff; /* guard */
1438 for (n = 0; n <= max_code; n++) {
1440 nextlen = tree[n + 1].Len;
1441 if (++count < max_count && curlen == nextlen)
1444 if (count < min_count) {
1445 G2.bl_tree[curlen].Freq += count;
1446 } else if (curlen != 0) {
1447 if (curlen != prevlen)
1448 G2.bl_tree[curlen].Freq++;
1449 G2.bl_tree[REP_3_6].Freq++;
1450 } else if (count <= 10) {
1451 G2.bl_tree[REPZ_3_10].Freq++;
1453 G2.bl_tree[REPZ_11_138].Freq++;
1463 } else if (curlen == nextlen) {
1471 /* ===========================================================================
1472 * Send a literal or distance tree in compressed form, using the codes in
1475 static void send_tree(ct_data * tree, int max_code)
1477 int n; /* iterates over all tree elements */
1478 int prevlen = -1; /* last emitted length */
1479 int curlen; /* length of current code */
1480 int nextlen = tree[0].Len; /* length of next code */
1481 int count = 0; /* repeat count of the current code */
1482 int max_count = 7; /* max repeat count */
1483 int min_count = 4; /* min repeat count */
1485 /* tree[max_code+1].Len = -1; *//* guard already set */
1487 max_count = 138, min_count = 3;
1489 for (n = 0; n <= max_code; n++) {
1491 nextlen = tree[n + 1].Len;
1492 if (++count < max_count && curlen == nextlen) {
1494 } else if (count < min_count) {
1496 SEND_CODE(curlen, G2.bl_tree);
1498 } else if (curlen != 0) {
1499 if (curlen != prevlen) {
1500 SEND_CODE(curlen, G2.bl_tree);
1503 Assert(count >= 3 && count <= 6, " 3_6?");
1504 SEND_CODE(REP_3_6, G2.bl_tree);
1505 send_bits(count - 3, 2);
1506 } else if (count <= 10) {
1507 SEND_CODE(REPZ_3_10, G2.bl_tree);
1508 send_bits(count - 3, 3);
1510 SEND_CODE(REPZ_11_138, G2.bl_tree);
1511 send_bits(count - 11, 7);
1518 } else if (curlen == nextlen) {
1529 /* ===========================================================================
1530 * Construct the Huffman tree for the bit lengths and return the index in
1531 * bl_order of the last bit length code to send.
1533 static int build_bl_tree(void)
1535 int max_blindex; /* index of last bit length code of non zero freq */
1537 /* Determine the bit length frequencies for literal and distance trees */
1538 scan_tree(G2.dyn_ltree, G2.l_desc.max_code);
1539 scan_tree(G2.dyn_dtree, G2.d_desc.max_code);
1541 /* Build the bit length tree: */
1542 build_tree(&G2.bl_desc);
1543 /* opt_len now includes the length of the tree representations, except
1544 * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.
1547 /* Determine the number of bit length codes to send. The pkzip format
1548 * requires that at least 4 bit length codes be sent. (appnote.txt says
1549 * 3 but the actual value used is 4.)
1551 for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {
1552 if (G2.bl_tree[bl_order[max_blindex]].Len != 0)
1555 /* Update opt_len to include the bit length tree and counts */
1556 G2.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;
1557 Tracev((stderr, "\ndyn trees: dyn %ld, stat %ld", (long)G2.opt_len, (long)G2.static_len));
1563 /* ===========================================================================
1564 * Send the header for a block using dynamic Huffman trees: the counts, the
1565 * lengths of the bit length codes, the literal tree and the distance tree.
1566 * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4.
1568 static void send_all_trees(int lcodes, int dcodes, int blcodes)
1570 int rank; /* index in bl_order */
1572 Assert(lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes");
1573 Assert(lcodes <= L_CODES && dcodes <= D_CODES
1574 && blcodes <= BL_CODES, "too many codes");
1575 Tracev((stderr, "\nbl counts: "));
1576 send_bits(lcodes - 257, 5); /* not +255 as stated in appnote.txt */
1577 send_bits(dcodes - 1, 5);
1578 send_bits(blcodes - 4, 4); /* not -3 as stated in appnote.txt */
1579 for (rank = 0; rank < blcodes; rank++) {
1580 Tracev((stderr, "\nbl code %2d ", bl_order[rank]));
1581 send_bits(G2.bl_tree[bl_order[rank]].Len, 3);
1583 Tracev((stderr, "\nbl tree: sent %ld", (long)G1.bits_sent));
1585 send_tree((ct_data *) G2.dyn_ltree, lcodes - 1); /* send the literal tree */
1586 Tracev((stderr, "\nlit tree: sent %ld", (long)G1.bits_sent));
1588 send_tree((ct_data *) G2.dyn_dtree, dcodes - 1); /* send the distance tree */
1589 Tracev((stderr, "\ndist tree: sent %ld", (long)G1.bits_sent));
1593 /* ===========================================================================
1594 * Save the match info and tally the frequency counts. Return true if
1595 * the current block must be flushed.
1597 static int ct_tally(int dist, int lc)
1599 G1.l_buf[G2.last_lit++] = lc;
1601 /* lc is the unmatched char */
1602 G2.dyn_ltree[lc].Freq++;
1604 /* Here, lc is the match length - MIN_MATCH */
1605 dist--; /* dist = match distance - 1 */
1606 Assert((ush) dist < (ush) MAX_DIST
1607 && (ush) lc <= (ush) (MAX_MATCH - MIN_MATCH)
1608 && (ush) D_CODE(dist) < (ush) D_CODES, "ct_tally: bad match"
1611 G2.dyn_ltree[G2.length_code[lc] + LITERALS + 1].Freq++;
1612 G2.dyn_dtree[D_CODE(dist)].Freq++;
1614 G1.d_buf[G2.last_dist++] = dist;
1615 G2.flags |= G2.flag_bit;
1619 /* Output the flags if they fill a byte: */
1620 if ((G2.last_lit & 7) == 0) {
1621 G2.flag_buf[G2.last_flags++] = G2.flags;
1625 /* Try to guess if it is profitable to stop the current block here */
1626 if ((G2.last_lit & 0xfff) == 0) {
1627 /* Compute an upper bound for the compressed length */
1628 ulg out_length = G2.last_lit * 8L;
1629 ulg in_length = (ulg) G1.strstart - G1.block_start;
1632 for (dcode = 0; dcode < D_CODES; dcode++) {
1633 out_length += G2.dyn_dtree[dcode].Freq * (5L + extra_dbits[dcode]);
1637 "\nlast_lit %u, last_dist %u, in %ld, out ~%ld(%ld%%) ",
1638 G2.last_lit, G2.last_dist,
1639 (long)in_length, (long)out_length,
1640 100L - out_length * 100L / in_length));
1641 if (G2.last_dist < G2.last_lit / 2 && out_length < in_length / 2)
1644 return (G2.last_lit == LIT_BUFSIZE - 1 || G2.last_dist == DIST_BUFSIZE);
1645 /* We avoid equality with LIT_BUFSIZE because of wraparound at 64K
1646 * on 16 bit machines and because stored blocks are restricted to
1651 /* ===========================================================================
1652 * Send the block data compressed using the given Huffman trees
1654 static void compress_block(ct_data * ltree, ct_data * dtree)
1656 unsigned dist; /* distance of matched string */
1657 int lc; /* match length or unmatched char (if dist == 0) */
1658 unsigned lx = 0; /* running index in l_buf */
1659 unsigned dx = 0; /* running index in d_buf */
1660 unsigned fx = 0; /* running index in flag_buf */
1661 uch flag = 0; /* current flags */
1662 unsigned code; /* the code to send */
1663 int extra; /* number of extra bits to send */
1665 if (G2.last_lit != 0) do {
1667 flag = G2.flag_buf[fx++];
1668 lc = G1.l_buf[lx++];
1669 if ((flag & 1) == 0) {
1670 SEND_CODE(lc, ltree); /* send a literal byte */
1671 Tracecv(lc > ' ', (stderr, " '%c' ", lc));
1673 /* Here, lc is the match length - MIN_MATCH */
1674 code = G2.length_code[lc];
1675 SEND_CODE(code + LITERALS + 1, ltree); /* send the length code */
1676 extra = extra_lbits[code];
1678 lc -= G2.base_length[code];
1679 send_bits(lc, extra); /* send the extra length bits */
1681 dist = G1.d_buf[dx++];
1682 /* Here, dist is the match distance - 1 */
1683 code = D_CODE(dist);
1684 Assert(code < D_CODES, "bad d_code");
1686 SEND_CODE(code, dtree); /* send the distance code */
1687 extra = extra_dbits[code];
1689 dist -= G2.base_dist[code];
1690 send_bits(dist, extra); /* send the extra distance bits */
1692 } /* literal or match pair ? */
1694 } while (lx < G2.last_lit);
1696 SEND_CODE(END_BLOCK, ltree);
1700 /* ===========================================================================
1701 * Determine the best encoding for the current block: dynamic trees, static
1702 * trees or store, and output the encoded block to the zip file. This function
1703 * returns the total compressed length for the file so far.
1705 static ulg flush_block(char *buf, ulg stored_len, int eof)
1707 ulg opt_lenb, static_lenb; /* opt_len and static_len in bytes */
1708 int max_blindex; /* index of last bit length code of non zero freq */
1710 G2.flag_buf[G2.last_flags] = G2.flags; /* Save the flags for the last 8 items */
1712 /* Construct the literal and distance trees */
1713 build_tree(&G2.l_desc);
1714 Tracev((stderr, "\nlit data: dyn %ld, stat %ld", (long)G2.opt_len, (long)G2.static_len));
1716 build_tree(&G2.d_desc);
1717 Tracev((stderr, "\ndist data: dyn %ld, stat %ld", (long)G2.opt_len, (long)G2.static_len));
1718 /* At this point, opt_len and static_len are the total bit lengths of
1719 * the compressed block data, excluding the tree representations.
1722 /* Build the bit length tree for the above two trees, and get the index
1723 * in bl_order of the last bit length code to send.
1725 max_blindex = build_bl_tree();
1727 /* Determine the best encoding. Compute first the block length in bytes */
1728 opt_lenb = (G2.opt_len + 3 + 7) >> 3;
1729 static_lenb = (G2.static_len + 3 + 7) >> 3;
1732 "\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u dist %u ",
1733 (unsigned long)opt_lenb, (unsigned long)G2.opt_len,
1734 (unsigned long)static_lenb, (unsigned long)G2.static_len,
1735 (unsigned long)stored_len,
1736 G2.last_lit, G2.last_dist));
1738 if (static_lenb <= opt_lenb)
1739 opt_lenb = static_lenb;
1741 /* If compression failed and this is the first and last block,
1742 * and if the zip file can be seeked (to rewrite the local header),
1743 * the whole file is transformed into a stored file:
1745 if (stored_len <= opt_lenb && eof && G2.compressed_len == 0L && seekable()) {
1746 /* Since LIT_BUFSIZE <= 2*WSIZE, the input data must be there: */
1748 bb_error_msg("block vanished");
1750 G2.compressed_len = stored_len << 3;
1751 copy_block(buf, (unsigned) stored_len, 0); /* without header */
1752 } else if (stored_len + 4 <= opt_lenb && buf != NULL) {
1753 /* 4: two words for the lengths */
1754 /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.
1755 * Otherwise we can't have processed more than WSIZE input bytes since
1756 * the last block flush, because compression would have been
1757 * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to
1758 * transform a block into a stored block.
1760 send_bits((STORED_BLOCK << 1) + eof, 3); /* send block type */
1761 G2.compressed_len = ((G2.compressed_len + 3 + 7) & ~7L)
1762 + ((stored_len + 4) << 3);
1763 copy_block(buf, (unsigned) stored_len, 1); /* with header */
1764 } else if (static_lenb == opt_lenb) {
1765 send_bits((STATIC_TREES << 1) + eof, 3);
1766 compress_block((ct_data *) G2.static_ltree, (ct_data *) G2.static_dtree);
1767 G2.compressed_len += 3 + G2.static_len;
1769 send_bits((DYN_TREES << 1) + eof, 3);
1770 send_all_trees(G2.l_desc.max_code + 1, G2.d_desc.max_code + 1,
1772 compress_block((ct_data *) G2.dyn_ltree, (ct_data *) G2.dyn_dtree);
1773 G2.compressed_len += 3 + G2.opt_len;
1775 Assert(G2.compressed_len == G1.bits_sent, "bad compressed size");
1780 G2.compressed_len += 7; /* align on byte boundary */
1782 Tracev((stderr, "\ncomprlen %lu(%lu) ",
1783 (unsigned long)G2.compressed_len >> 3,
1784 (unsigned long)G2.compressed_len - 7 * eof));
1786 return G2.compressed_len >> 3;
1790 /* ===========================================================================
1791 * Update a hash value with the given input byte
1792 * IN assertion: all calls to UPDATE_HASH are made with consecutive
1793 * input characters, so that a running hash key can be computed from the
1794 * previous key instead of complete recalculation each time.
1796 #define UPDATE_HASH(h, c) (h = (((h)<<H_SHIFT) ^ (c)) & HASH_MASK)
1799 /* ===========================================================================
1800 * Same as above, but achieves better compression. We use a lazy
1801 * evaluation for matches: a match is finally adopted only if there is
1802 * no better match at the next window position.
1804 * Processes a new input file and return its compressed length. Sets
1805 * the compressed length, crc, deflate flags and internal file
1809 /* Flush the current block, with given end-of-file flag.
1810 * IN assertion: strstart is set to the end of the current match. */
1811 #define FLUSH_BLOCK(eof) \
1813 G1.block_start >= 0L \
1814 ? (char*)&G1.window[(unsigned)G1.block_start] \
1816 (ulg)G1.strstart - G1.block_start, \
1820 /* Insert string s in the dictionary and set match_head to the previous head
1821 * of the hash chain (the most recent string with same hash key). Return
1822 * the previous length of the hash chain.
1823 * IN assertion: all calls to INSERT_STRING are made with consecutive
1824 * input characters and the first MIN_MATCH bytes of s are valid
1825 * (except for the last MIN_MATCH-1 bytes of the input file). */
1826 #define INSERT_STRING(s, match_head) \
1828 UPDATE_HASH(G1.ins_h, G1.window[(s) + MIN_MATCH-1]); \
1829 G1.prev[(s) & WMASK] = match_head = head[G1.ins_h]; \
1830 head[G1.ins_h] = (s); \
1833 static NOINLINE ulg deflate(void)
1835 IPos hash_head; /* head of hash chain */
1836 IPos prev_match; /* previous match */
1837 int flush; /* set if current block must be flushed */
1838 int match_available = 0; /* set if previous match exists */
1839 unsigned match_length = MIN_MATCH - 1; /* length of best match */
1841 /* Process the input block. */
1842 while (G1.lookahead != 0) {
1843 /* Insert the string window[strstart .. strstart+2] in the
1844 * dictionary, and set hash_head to the head of the hash chain:
1846 INSERT_STRING(G1.strstart, hash_head);
1848 /* Find the longest match, discarding those <= prev_length.
1850 G1.prev_length = match_length;
1851 prev_match = G1.match_start;
1852 match_length = MIN_MATCH - 1;
1854 if (hash_head != 0 && G1.prev_length < max_lazy_match
1855 && G1.strstart - hash_head <= MAX_DIST
1857 /* To simplify the code, we prevent matches with the string
1858 * of window index 0 (in particular we have to avoid a match
1859 * of the string with itself at the start of the input file).
1861 match_length = longest_match(hash_head);
1862 /* longest_match() sets match_start */
1863 if (match_length > G1.lookahead)
1864 match_length = G1.lookahead;
1866 /* Ignore a length 3 match if it is too distant: */
1867 if (match_length == MIN_MATCH && G1.strstart - G1.match_start > TOO_FAR) {
1868 /* If prev_match is also MIN_MATCH, G1.match_start is garbage
1869 * but we will ignore the current match anyway.
1874 /* If there was a match at the previous step and the current
1875 * match is not better, output the previous match:
1877 if (G1.prev_length >= MIN_MATCH && match_length <= G1.prev_length) {
1878 check_match(G1.strstart - 1, prev_match, G1.prev_length);
1879 flush = ct_tally(G1.strstart - 1 - prev_match, G1.prev_length - MIN_MATCH);
1881 /* Insert in hash table all strings up to the end of the match.
1882 * strstart-1 and strstart are already inserted.
1884 G1.lookahead -= G1.prev_length - 1;
1885 G1.prev_length -= 2;
1888 INSERT_STRING(G1.strstart, hash_head);
1889 /* strstart never exceeds WSIZE-MAX_MATCH, so there are
1890 * always MIN_MATCH bytes ahead. If lookahead < MIN_MATCH
1891 * these bytes are garbage, but it does not matter since the
1892 * next lookahead bytes will always be emitted as literals.
1894 } while (--G1.prev_length != 0);
1895 match_available = 0;
1896 match_length = MIN_MATCH - 1;
1900 G1.block_start = G1.strstart;
1902 } else if (match_available) {
1903 /* If there was no match at the previous position, output a
1904 * single literal. If there was a match but the current match
1905 * is longer, truncate the previous match to a single literal.
1907 Tracevv((stderr, "%c", G1.window[G1.strstart - 1]));
1908 if (ct_tally(0, G1.window[G1.strstart - 1])) {
1910 G1.block_start = G1.strstart;
1915 /* There is no previous match to compare with, wait for
1916 * the next step to decide.
1918 match_available = 1;
1922 Assert(G1.strstart <= G1.isize && G1.lookahead <= G1.isize, "a bit too far");
1924 /* Make sure that we always have enough lookahead, except
1925 * at the end of the input file. We need MAX_MATCH bytes
1926 * for the next match, plus MIN_MATCH bytes to insert the
1927 * string following the next match.
1929 fill_window_if_needed();
1931 if (match_available)
1932 ct_tally(0, G1.window[G1.strstart - 1]);
1934 return FLUSH_BLOCK(1); /* eof */
1938 /* ===========================================================================
1939 * Initialize the bit string routines.
1941 static void bi_init(void)
1943 //G1.bi_buf = 0; // globals are zeroed in pack_gzip()
1944 //G1.bi_valid = 0; // globals are zeroed in pack_gzip()
1946 //G1.bits_sent = 0L; // globals are zeroed in pack_gzip()
1951 /* ===========================================================================
1952 * Initialize the "longest match" routines for a new file
1954 static void lm_init(unsigned *flags16p)
1958 /* Initialize the hash table. */
1959 memset(head, 0, HASH_SIZE * sizeof(*head));
1960 /* prev will be initialized on the fly */
1962 /* speed options for the general purpose bit flag */
1963 *flags16p |= 2; /* FAST 4, SLOW 2 */
1964 /* ??? reduce max_chain_length for binary files */
1966 //G1.strstart = 0; // globals are zeroed in pack_gzip()
1967 //G1.block_start = 0L; // globals are zeroed in pack_gzip()
1969 G1.lookahead = file_read(G1.window,
1970 sizeof(int) <= 2 ? (unsigned) WSIZE : 2 * WSIZE);
1972 if (G1.lookahead == 0 || G1.lookahead == (unsigned) -1) {
1977 //G1.eofile = 0; // globals are zeroed in pack_gzip()
1979 /* Make sure that we always have enough lookahead. This is important
1980 * if input comes from a device such as a tty.
1982 fill_window_if_needed();
1984 //G1.ins_h = 0; // globals are zeroed in pack_gzip()
1985 for (j = 0; j < MIN_MATCH - 1; j++)
1986 UPDATE_HASH(G1.ins_h, G1.window[j]);
1987 /* If lookahead < MIN_MATCH, ins_h is garbage, but this is
1988 * not important since only literal bytes will be emitted.
1993 /* ===========================================================================
1994 * Allocate the match buffer, initialize the various tables and save the
1995 * location of the internal file attribute (ascii/binary) and method
1997 * One callsite in zip()
1999 static void ct_init(void)
2001 int n; /* iterates over tree elements */
2002 int length; /* length value */
2003 int code; /* code value */
2004 int dist; /* distance index */
2006 //G2.compressed_len = 0L; // globals are zeroed in pack_gzip()
2009 if (G2.static_dtree[0].Len != 0)
2010 return; /* ct_init already called */
2013 /* Initialize the mapping length (0..255) -> length code (0..28) */
2015 for (code = 0; code < LENGTH_CODES - 1; code++) {
2016 G2.base_length[code] = length;
2017 for (n = 0; n < (1 << extra_lbits[code]); n++) {
2018 G2.length_code[length++] = code;
2021 Assert(length == 256, "ct_init: length != 256");
2022 /* Note that the length 255 (match length 258) can be represented
2023 * in two different ways: code 284 + 5 bits or code 285, so we
2024 * overwrite length_code[255] to use the best encoding:
2026 G2.length_code[length - 1] = code;
2028 /* Initialize the mapping dist (0..32K) -> dist code (0..29) */
2030 for (code = 0; code < 16; code++) {
2031 G2.base_dist[code] = dist;
2032 for (n = 0; n < (1 << extra_dbits[code]); n++) {
2033 G2.dist_code[dist++] = code;
2036 Assert(dist == 256, "ct_init: dist != 256");
2037 dist >>= 7; /* from now on, all distances are divided by 128 */
2038 for (; code < D_CODES; code++) {
2039 G2.base_dist[code] = dist << 7;
2040 for (n = 0; n < (1 << (extra_dbits[code] - 7)); n++) {
2041 G2.dist_code[256 + dist++] = code;
2044 Assert(dist == 256, "ct_init: 256+dist != 512");
2046 /* Construct the codes of the static literal tree */
2047 //for (n = 0; n <= MAX_BITS; n++) // globals are zeroed in pack_gzip()
2048 // G2.bl_count[n] = 0;
2052 G2.static_ltree[n++].Len = 8;
2055 //G2.bl_count[8] = 143 + 1;
2057 G2.static_ltree[n++].Len = 9;
2060 //G2.bl_count[9] = 255 - 143;
2062 G2.static_ltree[n++].Len = 7;
2065 //G2.bl_count[7] = 279 - 255;
2067 G2.static_ltree[n++].Len = 8;
2070 //G2.bl_count[8] += 287 - 279;
2071 G2.bl_count[7] = 279 - 255;
2072 G2.bl_count[8] = (143 + 1) + (287 - 279);
2073 G2.bl_count[9] = 255 - 143;
2074 /* Codes 286 and 287 do not exist, but we must include them in the
2075 * tree construction to get a canonical Huffman tree (longest code
2078 gen_codes((ct_data *) G2.static_ltree, L_CODES + 1);
2080 /* The static distance tree is trivial: */
2081 for (n = 0; n < D_CODES; n++) {
2082 G2.static_dtree[n].Len = 5;
2083 G2.static_dtree[n].Code = bi_reverse(n, 5);
2086 /* Initialize the first block of the first file: */
2091 /* ===========================================================================
2092 * Deflate in to out.
2093 * IN assertions: the input and output buffers are cleared.
2095 static void zip(void)
2097 unsigned deflate_flags;
2099 //G1.outcnt = 0; // globals are zeroed in pack_gzip()
2101 /* Write the header to the gzip file. See algorithm.doc for the format */
2102 /* magic header for gzip files: 1F 8B */
2103 /* compression method: 8 (DEFLATED) */
2104 /* general flags: 0 */
2105 put_32bit(0x00088b1f);
2106 put_32bit(0); /* Unix timestamp */
2108 /* Write deflated file to zip file */
2113 deflate_flags = 0; /* pkzip -es, -en or -ex equivalent */
2114 lm_init(&deflate_flags);
2116 put_16bit(deflate_flags | 0x300); /* extra flags. OS id = 3 (Unix) */
2118 #if OPTIMIZED_PUT_32BIT
2119 /* put_32bit() performs 32bit stores. If we use it in send_bits()... */
2121 /* then all stores are misaligned, unless we flush the buffer now */
2127 /* Write the crc and uncompressed size */
2129 put_32bit(G1.isize);
2135 /* ======================================================================== */
2137 IF_DESKTOP(long long) int FAST_FUNC pack_gzip(transformer_state_t *xstate UNUSED_PARAM)
2139 /* Reinit G1.xxx except pointers to allocated buffers, and entire G2 */
2140 memset(&G1.crc, 0, (sizeof(G1) - offsetof(struct globals, crc)) + sizeof(G2));
2142 /* Clear input and output buffers */
2150 G2.l_desc.dyn_tree = G2.dyn_ltree;
2151 G2.l_desc.static_tree = G2.static_ltree;
2152 G2.l_desc.extra_bits = extra_lbits;
2153 G2.l_desc.extra_base = LITERALS + 1;
2154 G2.l_desc.elems = L_CODES;
2155 G2.l_desc.max_length = MAX_BITS;
2156 //G2.l_desc.max_code = 0;
2157 G2.d_desc.dyn_tree = G2.dyn_dtree;
2158 G2.d_desc.static_tree = G2.static_dtree;
2159 G2.d_desc.extra_bits = extra_dbits;
2160 //G2.d_desc.extra_base = 0;
2161 G2.d_desc.elems = D_CODES;
2162 G2.d_desc.max_length = MAX_BITS;
2163 //G2.d_desc.max_code = 0;
2164 G2.bl_desc.dyn_tree = G2.bl_tree;
2165 //G2.bl_desc.static_tree = NULL;
2166 G2.bl_desc.extra_bits = extra_blbits,
2167 //G2.bl_desc.extra_base = 0;
2168 G2.bl_desc.elems = BL_CODES;
2169 G2.bl_desc.max_length = MAX_BL_BITS;
2170 //G2.bl_desc.max_code = 0;
2173 /* Saving of timestamp is disabled. Why?
2174 * - it is not Y2038-safe.
2175 * - some people want deterministic results
2176 * (normally they'd use -n, but our -n is a nop).
2178 * Per RFC 1952, gzfile.time=0 is "no timestamp".
2179 * If users will demand this to be reinstated,
2180 * implement -n "don't save timestamp".
2184 fstat(STDIN_FILENO, &s);
2192 #if ENABLE_FEATURE_GZIP_LONG_OPTIONS
2193 static const char gzip_longopts[] ALIGN1 =
2194 "stdout\0" No_argument "c"
2195 "to-stdout\0" No_argument "c"
2196 "force\0" No_argument "f"
2197 "verbose\0" No_argument "v"
2198 #if ENABLE_FEATURE_GZIP_DECOMPRESS
2199 "decompress\0" No_argument "d"
2200 "uncompress\0" No_argument "d"
2201 "test\0" No_argument "t"
2203 "quiet\0" No_argument "q"
2204 "fast\0" No_argument "1"
2205 "best\0" No_argument "9"
2206 "no-name\0" No_argument "n"
2211 * Linux kernel build uses gzip -d -n. We accept and ignore -n.
2214 * gzip: do not save the original file name and time stamp.
2215 * (The original name is always saved if the name had to be truncated.)
2216 * gunzip: do not restore the original file name/time even if present
2217 * (remove only the gzip suffix from the compressed file name).
2218 * This option is the default when decompressing.
2220 * gzip: always save the original file name and time stamp (this is the default)
2221 * gunzip: restore the original file name and time stamp if present.
2224 int gzip_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
2225 #if ENABLE_FEATURE_GZIP_DECOMPRESS
2226 int gzip_main(int argc, char **argv)
2228 int gzip_main(int argc UNUSED_PARAM, char **argv)
2232 #if ENABLE_FEATURE_GZIP_LEVELS
2233 static const struct {
2235 uint8_t chain_shift;
2238 } gzip_level_config[6] = {
2239 {4, 4, 4/2, 16/2}, /* Level 4 */
2240 {8, 5, 16/2, 32/2}, /* Level 5 */
2241 {8, 7, 16/2, 128/2}, /* Level 6 */
2242 {8, 8, 32/2, 128/2}, /* Level 7 */
2243 {32, 10, 128/2, 258/2}, /* Level 8 */
2244 {32, 12, 258/2, 258/2}, /* Level 9 */
2248 SET_PTR_TO_GLOBALS((char *)xzalloc(sizeof(struct globals)+sizeof(struct globals2))
2249 + sizeof(struct globals));
2251 /* Must match bbunzip's constants OPT_STDOUT, OPT_FORCE! */
2252 #if ENABLE_FEATURE_GZIP_LONG_OPTIONS
2253 opt = getopt32long(argv, "cfkv" IF_FEATURE_GZIP_DECOMPRESS("dt") "qn123456789", gzip_longopts);
2255 opt = getopt32(argv, "cfkv" IF_FEATURE_GZIP_DECOMPRESS("dt") "qn123456789");
2257 #if ENABLE_FEATURE_GZIP_DECOMPRESS /* gunzip_main may not be visible... */
2258 if (opt & 0x30) // -d and/or -t
2259 return gunzip_main(argc, argv);
2261 #if ENABLE_FEATURE_GZIP_LEVELS
2262 opt >>= ENABLE_FEATURE_GZIP_DECOMPRESS ? 8 : 6; /* drop cfkv[dt]qn bits */
2264 opt = 1 << 6; /* default: 6 */
2265 opt = ffs(opt >> 4); /* Maps -1..-4 to [0], -5 to [1] ... -9 to [5] */
2266 max_chain_length = 1 << gzip_level_config[opt].chain_shift;
2267 good_match = gzip_level_config[opt].good;
2268 max_lazy_match = gzip_level_config[opt].lazy2 * 2;
2269 nice_match = gzip_level_config[opt].nice2 * 2;
2271 option_mask32 &= 0xf; /* retain only -cfkv */
2273 /* Allocate all global buffers (for DYN_ALLOC option) */
2274 ALLOC(uch, G1.l_buf, INBUFSIZ);
2275 ALLOC(uch, G1.outbuf, OUTBUFSIZ);
2276 ALLOC(ush, G1.d_buf, DIST_BUFSIZE);
2277 ALLOC(uch, G1.window, 2L * WSIZE);
2278 ALLOC(ush, G1.prev, 1L << BITS);
2280 /* Initialize the CRC32 table */
2281 global_crc32_table = crc32_filltable(NULL, 0);
2284 return bbunpack(argv, pack_gzip, append_ext, "gz");