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 * This program is free software; you can redistribute it and/or modify
17 * it under the terms of the GNU General Public License as published by
18 * the Free Software Foundation; either version 2 of the License, or
19 * (at your option) any later version.
21 * This program is distributed in the hope that it will be useful,
22 * but WITHOUT ANY WARRANTY; without even the implied warranty of
23 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
24 * General Public License for more details.
26 * You should have received a copy of the GNU General Public License
27 * along with this program; if not, write to the Free Software
28 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
32 /* These defines are very important for BusyBox. Without these,
33 * huge chunks of ram are pre-allocated making the BusyBox bss
34 * size Freaking Huge(tm), which is a bad thing.*/
43 #include <sys/types.h>
47 #include <sys/types.h>
54 #define memzero(s, n) memset ((void *)(s), 0, (n))
57 # define RETSIGTYPE void
60 typedef unsigned char uch;
61 typedef unsigned short ush;
62 typedef unsigned long ulg;
64 /* Return codes from gzip */
69 /* Compression methods (see algorithm.doc) */
70 /* Only STORED and DEFLATED are supported by this BusyBox module */
72 /* methods 4 to 7 reserved */
75 /* To save memory for 16 bit systems, some arrays are overlaid between
76 * the various modules:
77 * deflate: prev+head window d_buf l_buf outbuf
78 * unlzw: tab_prefix tab_suffix stack inbuf outbuf
79 * For compression, input is done in window[]. For decompression, output
80 * is done in window except for unlzw.
85 # define INBUFSIZ 0x2000 /* input buffer size */
87 # define INBUFSIZ 0x8000 /* input buffer size */
90 #define INBUF_EXTRA 64 /* required by unlzw() */
94 # define OUTBUFSIZ 8192 /* output buffer size */
96 # define OUTBUFSIZ 16384 /* output buffer size */
99 #define OUTBUF_EXTRA 2048 /* required by unlzw() */
103 # define DIST_BUFSIZE 0x2000 /* buffer for distances, see trees.c */
105 # define DIST_BUFSIZE 0x8000 /* buffer for distances, see trees.c */
110 # define DECLARE(type, array, size) static type * array
111 # define ALLOC(type, array, size) { \
112 array = (type*)xcalloc((size_t)(((size)+1L)/2), 2*sizeof(type)); \
114 # define FREE(array) {free(array), array=NULL;}
116 # define DECLARE(type, array, size) static type array[size]
117 # define ALLOC(type, array, size)
121 #define tab_suffix window
122 #define tab_prefix prev /* hash link (see deflate.c) */
123 #define head (prev+WSIZE) /* hash head (see deflate.c) */
125 static long bytes_in; /* number of input bytes */
127 #define isize bytes_in
128 /* for compatibility with old zip sources (to be cleaned) */
130 typedef int file_t; /* Do not use stdio */
132 #define NO_FILE (-1) /* in memory compression */
135 #define PACK_MAGIC "\037\036" /* Magic header for packed files */
136 #define GZIP_MAGIC "\037\213" /* Magic header for gzip files, 1F 8B */
137 #define OLD_GZIP_MAGIC "\037\236" /* Magic header for gzip 0.5 = freeze 1.x */
138 #define LZH_MAGIC "\037\240" /* Magic header for SCO LZH Compress files */
139 #define PKZIP_MAGIC "\120\113\003\004" /* Magic header for pkzip files */
142 #define ASCII_FLAG 0x01 /* bit 0 set: file probably ascii text */
143 #define CONTINUATION 0x02 /* bit 1 set: continuation of multi-part gzip file */
144 #define EXTRA_FIELD 0x04 /* bit 2 set: extra field present */
145 #define ORIG_NAME 0x08 /* bit 3 set: original file name present */
146 #define COMMENT 0x10 /* bit 4 set: file comment present */
147 #define RESERVED 0xC0 /* bit 6,7: reserved */
149 /* internal file attribute */
150 #define UNKNOWN 0xffff
155 # define WSIZE 0x8000 /* window size--must be a power of two, and */
156 #endif /* at least 32K for zip's deflate method */
159 #define MAX_MATCH 258
160 /* The minimum and maximum match lengths */
162 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
163 /* Minimum amount of lookahead, except at the end of the input file.
164 * See deflate.c for comments about the MIN_MATCH+1.
167 #define MAX_DIST (WSIZE-MIN_LOOKAHEAD)
168 /* In order to simplify the code, particularly on 16 bit machines, match
169 * distances are limited to MAX_DIST instead of WSIZE.
172 /* put_byte is used for the compressed output */
173 #define put_byte(c) {outbuf[outcnt++]=(uch)(c); if (outcnt==OUTBUFSIZ)\
177 /* Output a 32 bit value to the bit stream, lsb first */
179 #define put_long(n) { \
180 put_short((n) & 0xffff); \
181 put_short(((ulg)(n)) >> 16); \
185 #define seekable() 0 /* force sequential output */
186 #define translate_eol 0 /* no option -a yet */
188 /* Diagnostic functions */
190 # define Assert(cond,msg) {if(!(cond)) bb_error_msg(msg);}
191 # define Trace(x) fprintf x
192 # define Tracev(x) {if (verbose) fprintf x ;}
193 # define Tracevv(x) {if (verbose>1) fprintf x ;}
194 # define Tracec(c,x) {if (verbose && (c)) fprintf x ;}
195 # define Tracecv(c,x) {if (verbose>1 && (c)) fprintf x ;}
197 # define Assert(cond,msg)
202 # define Tracecv(c,x)
205 #define WARN(msg) {if (!quiet) fprintf msg ; \
206 if (exit_code == OK) exit_code = WARNING;}
209 # define MAX_PATH_LEN 1024 /* max pathname length */
214 static int zip(int in, int out);
215 static int file_read(char *buf, unsigned size);
218 static RETSIGTYPE abort_gzip(void);
221 static void lm_init(ush * flags);
222 static ulg deflate(void);
225 static void ct_init(ush * attr, int *methodp);
226 static int ct_tally(int dist, int lc);
227 static ulg flush_block(char *buf, ulg stored_len, int eof);
230 static void bi_init(file_t zipfile);
231 static void send_bits(int value, int length);
232 static unsigned bi_reverse(unsigned value, int length);
233 static void bi_windup(void);
234 static void copy_block(char *buf, unsigned len, int header);
235 static int (*read_buf) (char *buf, unsigned size);
238 static void flush_outbuf(void);
240 /* lzw.h -- define the lzw functions.
241 * Copyright (C) 1992-1993 Jean-loup Gailly.
242 * This is free software; you can redistribute it and/or modify it under the
243 * terms of the GNU General Public License, see the file COPYING.
246 #if !defined(OF) && defined(lint)
253 #define INIT_BITS 9 /* Initial number of bits per code */
255 #define BIT_MASK 0x1f /* Mask for 'number of compression bits' */
256 /* Mask 0x20 is reserved to mean a fourth header byte, and 0x40 is free.
257 * It's a pity that old uncompress does not check bit 0x20. That makes
258 * extension of the format actually undesirable because old compress
259 * would just crash on the new format instead of giving a meaningful
260 * error message. It does check the number of bits, but it's more
261 * helpful to say "unsupported format, get a new version" than
262 * "can only handle 16 bits".
265 /* tailor.h -- target dependent definitions
266 * Copyright (C) 1992-1993 Jean-loup Gailly.
267 * This is free software; you can redistribute it and/or modify it under the
268 * terms of the GNU General Public License, see the file COPYING.
271 /* The target dependent definitions should be defined here only.
272 * The target dependent functions should be defined in tailor.c.
276 /* Common defaults */
279 # define OS_CODE 0x03 /* assume Unix */
283 # define PATH_SEP '/'
287 # define OPTIONS_VAR "GZIP"
291 # define Z_SUFFIX ".gz"
295 # define MAX_SUFFIX MAX_EXT_CHARS
297 # define MAX_SUFFIX 30
302 DECLARE(uch, inbuf, INBUFSIZ + INBUF_EXTRA);
303 DECLARE(uch, outbuf, OUTBUFSIZ + OUTBUF_EXTRA);
304 DECLARE(ush, d_buf, DIST_BUFSIZE);
305 DECLARE(uch, window, 2L * WSIZE);
306 DECLARE(ush, tab_prefix, 1L << BITS);
308 static int crc_table_empty = 1;
310 static int foreground; /* set if program run in foreground */
311 static int method = DEFLATED; /* compression method */
312 static int exit_code = OK; /* program exit code */
313 static int part_nb; /* number of parts in .gz file */
314 static long time_stamp; /* original time stamp (modification time) */
315 static long ifile_size; /* input file size, -1 for devices (debug only) */
316 static char z_suffix[MAX_SUFFIX + 1]; /* default suffix (can be set with --suffix) */
317 static int z_len; /* strlen(z_suffix) */
319 static int ifd; /* input file descriptor */
320 static int ofd; /* output file descriptor */
321 static unsigned insize; /* valid bytes in inbuf */
322 static unsigned outcnt; /* bytes in output buffer */
325 /* Output a 16 bit value, lsb first */
326 static void put_short(ush w)
328 if (outcnt < OUTBUFSIZ - 2) {
329 outbuf[outcnt++] = (uch) ((w) & 0xff);
330 outbuf[outcnt++] = (uch) ((ush) (w) >> 8);
332 put_byte((uch) ((w) & 0xff));
333 put_byte((uch) ((ush) (w) >> 8));
337 /* ========================================================================
338 * Signal and error handler.
340 static void abort_gzip()
345 /* ===========================================================================
346 * Clear input and output buffers
348 static void clear_bufs(void)
355 static void write_bb_error_msg(void)
362 /* ===========================================================================
363 * Does the same as write(), but also handles partial pipe writes and checks
366 static void write_buf(int fd, void *buf, unsigned cnt)
370 while ((n = write(fd, buf, cnt)) != cnt) {
371 if (n == (unsigned) (-1)) {
372 write_bb_error_msg();
375 buf = (void *) ((char *) buf + n);
379 /* ===========================================================================
380 * Run a set of bytes through the crc shift register. If s is a NULL
381 * pointer, then initialize the crc shift register contents instead.
382 * Return the current crc in either case.
384 static ulg updcrc(uch * s, unsigned n)
386 static ulg crc = (ulg) 0xffffffffL; /* shift register contents */
387 register ulg c; /* temporary variable */
388 static unsigned long crc_32_tab[256];
390 if (crc_table_empty) {
391 unsigned long csr; /* crc shift register */
392 const unsigned long e = 0xedb88320L; /* polynomial exclusive-or pattern */
393 int i; /* counter for all possible eight bit values */
394 int k; /* byte being shifted into crc apparatus */
396 /* Compute table of CRC's. */
397 crc_32_tab[0] = 0x00000000L;
398 for (i = 1; i < 256; i++) {
400 /* The idea to initialize the register with the byte instead of
401 * zero was stolen from Haruhiko Okumura's ar002
404 csr = csr & 1 ? (csr >> 1) ^ e : csr >> 1;
415 c = crc_32_tab[((int) c ^ (*s++)) & 0xff] ^ (c >> 8);
419 return c ^ 0xffffffffL; /* (instead of ~c for 64-bit machines) */
422 /* bits.c -- output variable-length bit strings
423 * Copyright (C) 1992-1993 Jean-loup Gailly
424 * This is free software; you can redistribute it and/or modify it under the
425 * terms of the GNU General Public License, see the file COPYING.
432 * Output variable-length bit strings. Compression can be done
433 * to a file or to memory. (The latter is not supported in this version.)
437 * The PKZIP "deflate" file format interprets compressed file data
438 * as a sequence of bits. Multi-bit strings in the file may cross
439 * byte boundaries without restriction.
441 * The first bit of each byte is the low-order bit.
443 * The routines in this file allow a variable-length bit value to
444 * be output right-to-left (useful for literal values). For
445 * left-to-right output (useful for code strings from the tree routines),
446 * the bits must have been reversed first with bi_reverse().
448 * For in-memory compression, the compressed bit stream goes directly
449 * into the requested output buffer. The input data is read in blocks
450 * by the mem_read() function. The buffer is limited to 64K on 16 bit
455 * void bi_init (FILE *zipfile)
456 * Initialize the bit string routines.
458 * void send_bits (int value, int length)
459 * Write out a bit string, taking the source bits right to
462 * int bi_reverse (int value, int length)
463 * Reverse the bits of a bit string, taking the source bits left to
464 * right and emitting them right to left.
466 * void bi_windup (void)
467 * Write out any remaining bits in an incomplete byte.
469 * void copy_block(char *buf, unsigned len, int header)
470 * Copy a stored block to the zip file, storing first the length and
471 * its one's complement if requested.
475 /* ===========================================================================
476 * Local data used by the "bit string" routines.
479 static file_t zfile; /* output gzip file */
481 static unsigned short bi_buf;
483 /* Output buffer. bits are inserted starting at the bottom (least significant
487 #define Buf_size (8 * 2*sizeof(char))
488 /* Number of bits used within bi_buf. (bi_buf might be implemented on
489 * more than 16 bits on some systems.)
494 /* Current input function. Set to mem_read for in-memory compression */
497 ulg bits_sent; /* bit length of the compressed data */
500 /* ===========================================================================
501 * Initialize the bit string routines.
503 static void bi_init(file_t zipfile)
512 /* Set the defaults for file compression. They are set by memcompress
513 * for in-memory compression.
515 if (zfile != NO_FILE) {
516 read_buf = file_read;
520 /* ===========================================================================
521 * Send a value on a given number of bits.
522 * IN assertion: length <= 16 and value fits in length bits.
524 static void send_bits(int value, int length)
527 Tracev((stderr, " l %2d v %4x ", length, value));
528 Assert(length > 0 && length <= 15, "invalid length");
529 bits_sent += (ulg) length;
531 /* If not enough room in bi_buf, use (valid) bits from bi_buf and
532 * (16 - bi_valid) bits from value, leaving (width - (16-bi_valid))
533 * unused bits in value.
535 if (bi_valid > (int) Buf_size - length) {
536 bi_buf |= (value << bi_valid);
538 bi_buf = (ush) value >> (Buf_size - bi_valid);
539 bi_valid += length - Buf_size;
541 bi_buf |= value << bi_valid;
546 /* ===========================================================================
547 * Reverse the first len bits of a code, using straightforward code (a faster
548 * method would use a table)
549 * IN assertion: 1 <= len <= 15
551 static unsigned bi_reverse(unsigned code, int len)
553 register unsigned res = 0;
557 code >>= 1, res <<= 1;
562 /* ===========================================================================
563 * Write out any remaining bits in an incomplete byte.
565 static void bi_windup()
569 } else if (bi_valid > 0) {
575 bits_sent = (bits_sent + 7) & ~7;
579 /* ===========================================================================
580 * Copy a stored block to the zip file, storing first the length and its
581 * one's complement if requested.
583 static void copy_block(char *buf, unsigned len, int header)
585 bi_windup(); /* align on byte boundary */
588 put_short((ush) len);
589 put_short((ush) ~ len);
595 bits_sent += (ulg) len << 3;
602 /* deflate.c -- compress data using the deflation algorithm
603 * Copyright (C) 1992-1993 Jean-loup Gailly
604 * This is free software; you can redistribute it and/or modify it under the
605 * terms of the GNU General Public License, see the file COPYING.
611 * Identify new text as repetitions of old text within a fixed-
612 * length sliding window trailing behind the new text.
616 * The "deflation" process depends on being able to identify portions
617 * of the input text which are identical to earlier input (within a
618 * sliding window trailing behind the input currently being processed).
620 * The most straightforward technique turns out to be the fastest for
621 * most input files: try all possible matches and select the longest.
622 * The key feature of this algorithm is that insertions into the string
623 * dictionary are very simple and thus fast, and deletions are avoided
624 * completely. Insertions are performed at each input character, whereas
625 * string matches are performed only when the previous match ends. So it
626 * is preferable to spend more time in matches to allow very fast string
627 * insertions and avoid deletions. The matching algorithm for small
628 * strings is inspired from that of Rabin & Karp. A brute force approach
629 * is used to find longer strings when a small match has been found.
630 * A similar algorithm is used in comic (by Jan-Mark Wams) and freeze
631 * (by Leonid Broukhis).
632 * A previous version of this file used a more sophisticated algorithm
633 * (by Fiala and Greene) which is guaranteed to run in linear amortized
634 * time, but has a larger average cost, uses more memory and is patented.
635 * However the F&G algorithm may be faster for some highly redundant
636 * files if the parameter max_chain_length (described below) is too large.
640 * The idea of lazy evaluation of matches is due to Jan-Mark Wams, and
641 * I found it in 'freeze' written by Leonid Broukhis.
642 * Thanks to many info-zippers for bug reports and testing.
646 * APPNOTE.TXT documentation file in PKZIP 1.93a distribution.
648 * A description of the Rabin and Karp algorithm is given in the book
649 * "Algorithms" by R. Sedgewick, Addison-Wesley, p252.
651 * Fiala,E.R., and Greene,D.H.
652 * Data Compression with Finite Windows, Comm.ACM, 32,4 (1989) 490-595
656 * void lm_init (int pack_level, ush *flags)
657 * Initialize the "longest match" routines for a new file
660 * Processes a new input file and return its compressed length. Sets
661 * the compressed length, crc, deflate flags and internal file
666 /* ===========================================================================
667 * Configuration parameters
670 /* Compile with MEDIUM_MEM to reduce the memory requirements or
671 * with SMALL_MEM to use as little memory as possible. Use BIG_MEM if the
672 * entire input file can be held in memory (not possible on 16 bit systems).
673 * Warning: defining these symbols affects HASH_BITS (see below) and thus
674 * affects the compression ratio. The compressed output
675 * is still correct, and might even be smaller in some cases.
679 # define HASH_BITS 13 /* Number of bits used to hash strings */
682 # define HASH_BITS 14
685 # define HASH_BITS 15
686 /* For portability to 16 bit machines, do not use values above 15. */
689 /* To save space (see unlzw.c), we overlay prev+head with tab_prefix and
690 * window with tab_suffix. Check that we can do this:
692 #if (WSIZE<<1) > (1<<BITS)
693 # error cannot overlay window with tab_suffix and prev with tab_prefix0
695 #if HASH_BITS > BITS-1
696 # error cannot overlay head with tab_prefix1
698 #define HASH_SIZE (unsigned)(1<<HASH_BITS)
699 #define HASH_MASK (HASH_SIZE-1)
700 #define WMASK (WSIZE-1)
701 /* HASH_SIZE and WSIZE must be powers of two */
703 /* Tail of hash chains */
706 /* speed options for the general purpose bit flag */
708 # define TOO_FAR 4096
710 /* Matches of length 3 are discarded if their distance exceeds TOO_FAR */
711 /* ===========================================================================
712 * Local data used by the "longest match" routines.
715 typedef unsigned IPos;
717 /* A Pos is an index in the character window. We use short instead of int to
718 * save space in the various tables. IPos is used only for parameter passing.
721 /* DECLARE(uch, window, 2L*WSIZE); */
722 /* Sliding window. Input bytes are read into the second half of the window,
723 * and move to the first half later to keep a dictionary of at least WSIZE
724 * bytes. With this organization, matches are limited to a distance of
725 * WSIZE-MAX_MATCH bytes, but this ensures that IO is always
726 * performed with a length multiple of the block size. Also, it limits
727 * the window size to 64K, which is quite useful on MSDOS.
728 * To do: limit the window size to WSIZE+BSZ if SMALL_MEM (the code would
729 * be less efficient).
732 /* DECLARE(Pos, prev, WSIZE); */
733 /* Link to older string with same hash index. To limit the size of this
734 * array to 64K, this link is maintained only for the last 32K strings.
735 * An index in this array is thus a window index modulo 32K.
738 /* DECLARE(Pos, head, 1<<HASH_BITS); */
739 /* Heads of the hash chains or NIL. */
741 static const ulg window_size = (ulg) 2 * WSIZE;
743 /* window size, 2*WSIZE except for MMAP or BIG_MEM, where it is the
744 * input file length plus MIN_LOOKAHEAD.
747 static long block_start;
749 /* window position at the beginning of the current output block. Gets
750 * negative when the window is moved backwards.
753 static unsigned ins_h; /* hash index of string to be inserted */
755 #define H_SHIFT ((HASH_BITS+MIN_MATCH-1)/MIN_MATCH)
756 /* Number of bits by which ins_h and del_h must be shifted at each
757 * input step. It must be such that after MIN_MATCH steps, the oldest
758 * byte no longer takes part in the hash key, that is:
759 * H_SHIFT * MIN_MATCH >= HASH_BITS
762 static unsigned int prev_length;
764 /* Length of the best match at previous step. Matches not greater than this
765 * are discarded. This is used in the lazy match evaluation.
768 static unsigned strstart; /* start of string to insert */
769 static unsigned match_start; /* start of matching string */
770 static int eofile; /* flag set at end of input file */
771 static unsigned lookahead; /* number of valid bytes ahead in window */
773 static const unsigned max_chain_length = 4096;
775 /* To speed up deflation, hash chains are never searched beyond this length.
776 * A higher limit improves compression ratio but degrades the speed.
779 static const unsigned int max_lazy_match = 258;
781 /* Attempt to find a better match only when the current match is strictly
782 * smaller than this value. This mechanism is used only for compression
785 #define max_insert_length max_lazy_match
786 /* Insert new strings in the hash table only if the match length
787 * is not greater than this length. This saves time but degrades compression.
788 * max_insert_length is used only for compression levels <= 3.
791 static const unsigned good_match = 32;
793 /* Use a faster search when the previous match is longer than this */
796 /* Values for max_lazy_match, good_match and max_chain_length, depending on
797 * the desired pack level (0..9). The values given below have been tuned to
798 * exclude worst case performance for pathological files. Better values may be
799 * found for specific files.
802 static const int nice_match = 258; /* Stop searching when current match exceeds this */
804 /* Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4
805 * For deflate_fast() (levels <= 3) good is ignored and lazy has a different
810 /* result of memcmp for equal strings */
812 /* ===========================================================================
813 * Prototypes for local functions.
815 static void fill_window(void);
817 static int longest_match(IPos cur_match);
820 static void check_match(IPos start, IPos match, int length);
823 /* ===========================================================================
824 * Update a hash value with the given input byte
825 * IN assertion: all calls to to UPDATE_HASH are made with consecutive
826 * input characters, so that a running hash key can be computed from the
827 * previous key instead of complete recalculation each time.
829 #define UPDATE_HASH(h,c) (h = (((h)<<H_SHIFT) ^ (c)) & HASH_MASK)
831 /* ===========================================================================
832 * Insert string s in the dictionary and set match_head to the previous head
833 * of the hash chain (the most recent string with same hash key). Return
834 * the previous length of the hash chain.
835 * IN assertion: all calls to to INSERT_STRING are made with consecutive
836 * input characters and the first MIN_MATCH bytes of s are valid
837 * (except for the last MIN_MATCH-1 bytes of the input file).
839 #define INSERT_STRING(s, match_head) \
840 (UPDATE_HASH(ins_h, window[(s) + MIN_MATCH-1]), \
841 prev[(s) & WMASK] = match_head = head[ins_h], \
844 /* ===========================================================================
845 * Initialize the "longest match" routines for a new file
847 static void lm_init(ush * flags)
851 /* Initialize the hash table. */
852 memzero((char *) head, HASH_SIZE * sizeof(*head));
853 /* prev will be initialized on the fly */
856 /* ??? reduce max_chain_length for binary files */
861 lookahead = read_buf((char *) window,
862 sizeof(int) <= 2 ? (unsigned) WSIZE : 2 * WSIZE);
864 if (lookahead == 0 || lookahead == (unsigned) EOF) {
865 eofile = 1, lookahead = 0;
869 /* Make sure that we always have enough lookahead. This is important
870 * if input comes from a device such as a tty.
872 while (lookahead < MIN_LOOKAHEAD && !eofile)
876 for (j = 0; j < MIN_MATCH - 1; j++)
877 UPDATE_HASH(ins_h, window[j]);
878 /* If lookahead < MIN_MATCH, ins_h is garbage, but this is
879 * not important since only literal bytes will be emitted.
883 /* ===========================================================================
884 * Set match_start to the longest match starting at the given string and
885 * return its length. Matches shorter or equal to prev_length are discarded,
886 * in which case the result is equal to prev_length and match_start is
888 * IN assertions: cur_match is the head of the hash chain for the current
889 * string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1
892 /* For MSDOS, OS/2 and 386 Unix, an optimized version is in match.asm or
893 * match.s. The code is functionally equivalent, so you can use the C version
896 static int longest_match(IPos cur_match)
898 unsigned chain_length = max_chain_length; /* max hash chain length */
899 register uch *scan = window + strstart; /* current string */
900 register uch *match; /* matched string */
901 register int len; /* length of current match */
902 int best_len = prev_length; /* best match length so far */
904 strstart > (IPos) MAX_DIST ? strstart - (IPos) MAX_DIST : NIL;
905 /* Stop when cur_match becomes <= limit. To simplify the code,
906 * we prevent matches with the string of window index 0.
909 /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.
910 * It is easy to get rid of this optimization if necessary.
912 #if HASH_BITS < 8 || MAX_MATCH != 258
913 # error Code too clever
915 register uch *strend = window + strstart + MAX_MATCH;
916 register uch scan_end1 = scan[best_len - 1];
917 register uch scan_end = scan[best_len];
919 /* Do not waste too much time if we already have a good match: */
920 if (prev_length >= good_match) {
923 Assert(strstart <= window_size - MIN_LOOKAHEAD, "insufficient lookahead");
926 Assert(cur_match < strstart, "no future");
927 match = window + cur_match;
929 /* Skip to next match if the match length cannot increase
930 * or if the match length is less than 2:
932 if (match[best_len] != scan_end ||
933 match[best_len - 1] != scan_end1 ||
934 *match != *scan || *++match != scan[1])
937 /* The check at best_len-1 can be removed because it will be made
938 * again later. (This heuristic is not always a win.)
939 * It is not necessary to compare scan[2] and match[2] since they
940 * are always equal when the other bytes match, given that
941 * the hash keys are equal and that HASH_BITS >= 8.
945 /* We check for insufficient lookahead only every 8th comparison;
946 * the 256th check will be made at strstart+258.
949 } while (*++scan == *++match && *++scan == *++match &&
950 *++scan == *++match && *++scan == *++match &&
951 *++scan == *++match && *++scan == *++match &&
952 *++scan == *++match && *++scan == *++match && scan < strend);
954 len = MAX_MATCH - (int) (strend - scan);
955 scan = strend - MAX_MATCH;
957 if (len > best_len) {
958 match_start = cur_match;
960 if (len >= nice_match)
962 scan_end1 = scan[best_len - 1];
963 scan_end = scan[best_len];
965 } while ((cur_match = prev[cur_match & WMASK]) > limit
966 && --chain_length != 0);
972 /* ===========================================================================
973 * Check that the match at match_start is indeed a match.
975 static void check_match(IPos start, IPos match, int length)
977 /* check that the match is indeed a match */
978 if (memcmp((char *) window + match,
979 (char *) window + start, length) != EQUAL) {
980 bb_error_msg(" start %d, match %d, length %d", start, match, length);
981 bb_error_msg("invalid match");
984 bb_error_msg("\\[%d,%d]", start - match, length);
986 putc(window[start++], stderr);
987 } while (--length != 0);
991 # define check_match(start, match, length)
994 /* ===========================================================================
995 * Fill the window when the lookahead becomes insufficient.
996 * Updates strstart and lookahead, and sets eofile if end of input file.
997 * IN assertion: lookahead < MIN_LOOKAHEAD && strstart + lookahead > 0
998 * OUT assertions: at least one byte has been read, or eofile is set;
999 * file reads are performed for at least two bytes (required for the
1000 * translate_eol option).
1002 static void fill_window()
1004 register unsigned n, m;
1006 (unsigned) (window_size - (ulg) lookahead - (ulg) strstart);
1007 /* Amount of free space at the end of the window. */
1009 /* If the window is almost full and there is insufficient lookahead,
1010 * move the upper half to the lower one to make room in the upper half.
1012 if (more == (unsigned) EOF) {
1013 /* Very unlikely, but possible on 16 bit machine if strstart == 0
1014 * and lookahead == 1 (input done one byte at time)
1017 } else if (strstart >= WSIZE + MAX_DIST) {
1018 /* By the IN assertion, the window is not empty so we can't confuse
1019 * more == 0 with more == 64K on a 16 bit machine.
1021 Assert(window_size == (ulg) 2 * WSIZE, "no sliding with BIG_MEM");
1023 memcpy((char *) window, (char *) window + WSIZE, (unsigned) WSIZE);
1024 match_start -= WSIZE;
1025 strstart -= WSIZE; /* we now have strstart >= MAX_DIST: */
1027 block_start -= (long) WSIZE;
1029 for (n = 0; n < HASH_SIZE; n++) {
1031 head[n] = (Pos) (m >= WSIZE ? m - WSIZE : NIL);
1033 for (n = 0; n < WSIZE; n++) {
1035 prev[n] = (Pos) (m >= WSIZE ? m - WSIZE : NIL);
1036 /* If n is not on any hash chain, prev[n] is garbage but
1037 * its value will never be used.
1042 /* At this point, more >= 2 */
1044 n = read_buf((char *) window + strstart + lookahead, more);
1045 if (n == 0 || n == (unsigned) EOF) {
1053 /* ===========================================================================
1054 * Flush the current block, with given end-of-file flag.
1055 * IN assertion: strstart is set to the end of the current match.
1057 #define FLUSH_BLOCK(eof) \
1058 flush_block(block_start >= 0L ? (char*)&window[(unsigned)block_start] : \
1059 (char*)NULL, (long)strstart - block_start, (eof))
1061 /* ===========================================================================
1062 * Same as above, but achieves better compression. We use a lazy
1063 * evaluation for matches: a match is finally adopted only if there is
1064 * no better match at the next window position.
1066 static ulg deflate()
1068 IPos hash_head; /* head of hash chain */
1069 IPos prev_match; /* previous match */
1070 int flush; /* set if current block must be flushed */
1071 int match_available = 0; /* set if previous match exists */
1072 register unsigned match_length = MIN_MATCH - 1; /* length of best match */
1074 /* Process the input block. */
1075 while (lookahead != 0) {
1076 /* Insert the string window[strstart .. strstart+2] in the
1077 * dictionary, and set hash_head to the head of the hash chain:
1079 INSERT_STRING(strstart, hash_head);
1081 /* Find the longest match, discarding those <= prev_length.
1083 prev_length = match_length, prev_match = match_start;
1084 match_length = MIN_MATCH - 1;
1086 if (hash_head != NIL && prev_length < max_lazy_match &&
1087 strstart - hash_head <= MAX_DIST) {
1088 /* To simplify the code, we prevent matches with the string
1089 * of window index 0 (in particular we have to avoid a match
1090 * of the string with itself at the start of the input file).
1092 match_length = longest_match(hash_head);
1093 /* longest_match() sets match_start */
1094 if (match_length > lookahead)
1095 match_length = lookahead;
1097 /* Ignore a length 3 match if it is too distant: */
1098 if (match_length == MIN_MATCH && strstart - match_start > TOO_FAR) {
1099 /* If prev_match is also MIN_MATCH, match_start is garbage
1100 * but we will ignore the current match anyway.
1105 /* If there was a match at the previous step and the current
1106 * match is not better, output the previous match:
1108 if (prev_length >= MIN_MATCH && match_length <= prev_length) {
1110 check_match(strstart - 1, prev_match, prev_length);
1113 ct_tally(strstart - 1 - prev_match, prev_length - MIN_MATCH);
1115 /* Insert in hash table all strings up to the end of the match.
1116 * strstart-1 and strstart are already inserted.
1118 lookahead -= prev_length - 1;
1122 INSERT_STRING(strstart, hash_head);
1123 /* strstart never exceeds WSIZE-MAX_MATCH, so there are
1124 * always MIN_MATCH bytes ahead. If lookahead < MIN_MATCH
1125 * these bytes are garbage, but it does not matter since the
1126 * next lookahead bytes will always be emitted as literals.
1128 } while (--prev_length != 0);
1129 match_available = 0;
1130 match_length = MIN_MATCH - 1;
1133 FLUSH_BLOCK(0), block_start = strstart;
1135 } else if (match_available) {
1136 /* If there was no match at the previous position, output a
1137 * single literal. If there was a match but the current match
1138 * is longer, truncate the previous match to a single literal.
1140 Tracevv((stderr, "%c", window[strstart - 1]));
1141 if (ct_tally(0, window[strstart - 1])) {
1142 FLUSH_BLOCK(0), block_start = strstart;
1147 /* There is no previous match to compare with, wait for
1148 * the next step to decide.
1150 match_available = 1;
1154 Assert(strstart <= isize && lookahead <= isize, "a bit too far");
1156 /* Make sure that we always have enough lookahead, except
1157 * at the end of the input file. We need MAX_MATCH bytes
1158 * for the next match, plus MIN_MATCH bytes to insert the
1159 * string following the next match.
1161 while (lookahead < MIN_LOOKAHEAD && !eofile)
1164 if (match_available)
1165 ct_tally(0, window[strstart - 1]);
1167 return FLUSH_BLOCK(1); /* eof */
1170 /* gzip (GNU zip) -- compress files with zip algorithm and 'compress' interface
1171 * Copyright (C) 1992-1993 Jean-loup Gailly
1172 * The unzip code was written and put in the public domain by Mark Adler.
1173 * Portions of the lzw code are derived from the public domain 'compress'
1174 * written by Spencer Thomas, Joe Orost, James Woods, Jim McKie, Steve Davies,
1175 * Ken Turkowski, Dave Mack and Peter Jannesen.
1177 * See the license_msg below and the file COPYING for the software license.
1178 * See the file algorithm.doc for the compression algorithms and file formats.
1181 /* Compress files with zip algorithm and 'compress' interface.
1182 * See usage() and help() functions below for all options.
1184 * file.gz: compressed file with same mode, owner, and utimes
1185 * or stdout with -c option or if stdin used as input.
1186 * If the output file name had to be truncated, the original name is kept
1187 * in the compressed file.
1192 typedef struct dirent dir_type;
1194 typedef RETSIGTYPE(*sig_type) (int);
1196 /* ======================================================================== */
1197 int gzip_main(int argc, char **argv)
1202 struct stat statBuf;
1208 while ((opt = getopt(argc, argv, "cf123456789dq")) != -1) {
1216 /* Ignore 1-9 (compression level) options */
1229 #ifdef CONFIG_GUNZIP
1232 return gunzip_main(argc, argv);
1239 foreground = signal(SIGINT, SIG_IGN) != SIG_IGN;
1241 (void) signal(SIGINT, (sig_type) abort_gzip);
1244 if (signal(SIGTERM, SIG_IGN) != SIG_IGN) {
1245 (void) signal(SIGTERM, (sig_type) abort_gzip);
1249 if (signal(SIGHUP, SIG_IGN) != SIG_IGN) {
1250 (void) signal(SIGHUP, (sig_type) abort_gzip);
1254 strncpy(z_suffix, Z_SUFFIX, sizeof(z_suffix) - 1);
1255 z_len = strlen(z_suffix);
1257 /* Allocate all global buffers (for DYN_ALLOC option) */
1258 ALLOC(uch, inbuf, INBUFSIZ + INBUF_EXTRA);
1259 ALLOC(uch, outbuf, OUTBUFSIZ + OUTBUF_EXTRA);
1260 ALLOC(ush, d_buf, DIST_BUFSIZE);
1261 ALLOC(uch, window, 2L * WSIZE);
1262 ALLOC(ush, tab_prefix, 1L << BITS);
1267 if (optind == argc) {
1270 zip(STDIN_FILENO, STDOUT_FILENO);
1274 for (i = optind; i < argc; i++) {
1277 if (strcmp(argv[i], "-") == 0) {
1280 inFileNum = STDIN_FILENO;
1281 outFileNum = STDOUT_FILENO;
1283 inFileNum = open(argv[i], O_RDONLY);
1284 if (inFileNum < 0 || fstat(inFileNum, &statBuf) < 0)
1285 bb_perror_msg_and_die("%s", argv[i]);
1286 time_stamp = statBuf.st_ctime;
1287 ifile_size = statBuf.st_size;
1290 path = xmalloc(strlen(argv[i]) + 4);
1291 strcpy(path, argv[i]);
1292 strcat(path, ".gz");
1294 /* Open output file */
1295 #if (__GLIBC__ >= 2) && (__GLIBC_MINOR__ >= 1)
1297 open(path, O_RDWR | O_CREAT | O_EXCL | O_NOFOLLOW);
1299 outFileNum = open(path, O_RDWR | O_CREAT | O_EXCL);
1301 if (outFileNum < 0) {
1302 bb_perror_msg("%s", path);
1307 /* Set permissions on the file */
1308 fchmod(outFileNum, statBuf.st_mode);
1310 outFileNum = STDOUT_FILENO;
1313 if (path == NULL && isatty(outFileNum) && force == 0) {
1315 ("compressed data not written to a terminal. Use -f to force compression.");
1320 result = zip(inFileNum, outFileNum);
1326 /* Delete the original file */
1328 delFileName = argv[i];
1332 if (unlink(delFileName) < 0)
1333 bb_perror_msg("%s", delFileName);
1343 /* trees.c -- output deflated data using Huffman coding
1344 * Copyright (C) 1992-1993 Jean-loup Gailly
1345 * This is free software; you can redistribute it and/or modify it under the
1346 * terms of the GNU General Public License, see the file COPYING.
1352 * Encode various sets of source values using variable-length
1353 * binary code trees.
1357 * The PKZIP "deflation" process uses several Huffman trees. The more
1358 * common source values are represented by shorter bit sequences.
1360 * Each code tree is stored in the ZIP file in a compressed form
1361 * which is itself a Huffman encoding of the lengths of
1362 * all the code strings (in ascending order by source values).
1363 * The actual code strings are reconstructed from the lengths in
1364 * the UNZIP process, as described in the "application note"
1365 * (APPNOTE.TXT) distributed as part of PKWARE's PKZIP program.
1370 * Data Compression: Techniques and Applications, pp. 53-55.
1371 * Lifetime Learning Publications, 1985. ISBN 0-534-03418-7.
1374 * Data Compression: Methods and Theory, pp. 49-50.
1375 * Computer Science Press, 1988. ISBN 0-7167-8156-5.
1379 * Addison-Wesley, 1983. ISBN 0-201-06672-6.
1383 * void ct_init (ush *attr, int *methodp)
1384 * Allocate the match buffer, initialize the various tables and save
1385 * the location of the internal file attribute (ascii/binary) and
1386 * method (DEFLATE/STORE)
1388 * void ct_tally (int dist, int lc);
1389 * Save the match info and tally the frequency counts.
1391 * long flush_block (char *buf, ulg stored_len, int eof)
1392 * Determine the best encoding for the current block: dynamic trees,
1393 * static trees or store, and output the encoded block to the zip
1394 * file. Returns the total compressed length for the file so far.
1398 /* ===========================================================================
1403 /* All codes must not exceed MAX_BITS bits */
1405 #define MAX_BL_BITS 7
1406 /* Bit length codes must not exceed MAX_BL_BITS bits */
1408 #define LENGTH_CODES 29
1409 /* number of length codes, not counting the special END_BLOCK code */
1411 #define LITERALS 256
1412 /* number of literal bytes 0..255 */
1414 #define END_BLOCK 256
1415 /* end of block literal code */
1417 #define L_CODES (LITERALS+1+LENGTH_CODES)
1418 /* number of Literal or Length codes, including the END_BLOCK code */
1421 /* number of distance codes */
1424 /* number of codes used to transfer the bit lengths */
1426 typedef uch extra_bits_t;
1428 /* extra bits for each length code */
1429 static const extra_bits_t extra_lbits[LENGTH_CODES]
1430 = { 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4,
1434 /* extra bits for each distance code */
1435 static const extra_bits_t extra_dbits[D_CODES]
1436 = { 0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9,
1437 10, 10, 11, 11, 12, 12, 13, 13
1440 /* extra bits for each bit length code */
1441 static const extra_bits_t extra_blbits[BL_CODES]
1442 = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3, 7 };
1444 #define STORED_BLOCK 0
1445 #define STATIC_TREES 1
1447 /* The three kinds of block type */
1451 # define LIT_BUFSIZE 0x2000
1454 # define LIT_BUFSIZE 0x4000
1456 # define LIT_BUFSIZE 0x8000
1460 #ifndef DIST_BUFSIZE
1461 # define DIST_BUFSIZE LIT_BUFSIZE
1463 /* Sizes of match buffers for literals/lengths and distances. There are
1464 * 4 reasons for limiting LIT_BUFSIZE to 64K:
1465 * - frequencies can be kept in 16 bit counters
1466 * - if compression is not successful for the first block, all input data is
1467 * still in the window so we can still emit a stored block even when input
1468 * comes from standard input. (This can also be done for all blocks if
1469 * LIT_BUFSIZE is not greater than 32K.)
1470 * - if compression is not successful for a file smaller than 64K, we can
1471 * even emit a stored file instead of a stored block (saving 5 bytes).
1472 * - creating new Huffman trees less frequently may not provide fast
1473 * adaptation to changes in the input data statistics. (Take for
1474 * example a binary file with poorly compressible code followed by
1475 * a highly compressible string table.) Smaller buffer sizes give
1476 * fast adaptation but have of course the overhead of transmitting trees
1478 * - I can't count above 4
1479 * The current code is general and allows DIST_BUFSIZE < LIT_BUFSIZE (to save
1480 * memory at the expense of compression). Some optimizations would be possible
1481 * if we rely on DIST_BUFSIZE == LIT_BUFSIZE.
1483 #if LIT_BUFSIZE > INBUFSIZ
1484 #error cannot overlay l_buf and inbuf
1487 /* repeat previous bit length 3-6 times (2 bits of repeat count) */
1488 #define REPZ_3_10 17
1489 /* repeat a zero length 3-10 times (3 bits of repeat count) */
1490 #define REPZ_11_138 18
1491 /* repeat a zero length 11-138 times (7 bits of repeat count) */
1493 /* ===========================================================================
1497 /* Data structure describing a single value and its code string. */
1498 typedef struct ct_data {
1500 ush freq; /* frequency count */
1501 ush code; /* bit string */
1504 ush dad; /* father node in Huffman tree */
1505 ush len; /* length of bit string */
1509 #define Freq fc.freq
1510 #define Code fc.code
1514 #define HEAP_SIZE (2*L_CODES+1)
1515 /* maximum heap size */
1517 static ct_data dyn_ltree[HEAP_SIZE]; /* literal and length tree */
1518 static ct_data dyn_dtree[2 * D_CODES + 1]; /* distance tree */
1520 static ct_data static_ltree[L_CODES + 2];
1522 /* The static literal tree. Since the bit lengths are imposed, there is no
1523 * need for the L_CODES extra codes used during heap construction. However
1524 * The codes 286 and 287 are needed to build a canonical tree (see ct_init
1528 static ct_data static_dtree[D_CODES];
1530 /* The static distance tree. (Actually a trivial tree since all codes use
1534 static ct_data bl_tree[2 * BL_CODES + 1];
1536 /* Huffman tree for the bit lengths */
1538 typedef struct tree_desc {
1539 ct_data *dyn_tree; /* the dynamic tree */
1540 ct_data *static_tree; /* corresponding static tree or NULL */
1541 const extra_bits_t *extra_bits; /* extra bits for each code or NULL */
1542 int extra_base; /* base index for extra_bits */
1543 int elems; /* max number of elements in the tree */
1544 int max_length; /* max bit length for the codes */
1545 int max_code; /* largest code with non zero frequency */
1548 static tree_desc l_desc =
1549 { dyn_ltree, static_ltree, extra_lbits, LITERALS + 1, L_CODES,
1553 static tree_desc d_desc =
1554 { dyn_dtree, static_dtree, extra_dbits, 0, D_CODES, MAX_BITS, 0 };
1556 static tree_desc bl_desc =
1557 { bl_tree, (ct_data *) 0, extra_blbits, 0, BL_CODES, MAX_BL_BITS,
1562 static ush bl_count[MAX_BITS + 1];
1564 /* number of codes at each bit length for an optimal tree */
1566 static const uch bl_order[BL_CODES]
1567 = { 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 };
1569 /* The lengths of the bit length codes are sent in order of decreasing
1570 * probability, to avoid transmitting the lengths for unused bit length codes.
1573 static int heap[2 * L_CODES + 1]; /* heap used to build the Huffman trees */
1574 static int heap_len; /* number of elements in the heap */
1575 static int heap_max; /* element of largest frequency */
1577 /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.
1578 * The same heap array is used to build all trees.
1581 static uch depth[2 * L_CODES + 1];
1583 /* Depth of each subtree used as tie breaker for trees of equal frequency */
1585 static uch length_code[MAX_MATCH - MIN_MATCH + 1];
1587 /* length code for each normalized match length (0 == MIN_MATCH) */
1589 static uch dist_code[512];
1591 /* distance codes. The first 256 values correspond to the distances
1592 * 3 .. 258, the last 256 values correspond to the top 8 bits of
1593 * the 15 bit distances.
1596 static int base_length[LENGTH_CODES];
1598 /* First normalized length for each code (0 = MIN_MATCH) */
1600 static int base_dist[D_CODES];
1602 /* First normalized distance for each code (0 = distance of 1) */
1605 /* DECLARE(uch, l_buf, LIT_BUFSIZE); buffer for literals or lengths */
1607 /* DECLARE(ush, d_buf, DIST_BUFSIZE); buffer for distances */
1609 static uch flag_buf[(LIT_BUFSIZE / 8)];
1611 /* flag_buf is a bit array distinguishing literals from lengths in
1612 * l_buf, thus indicating the presence or absence of a distance.
1615 static unsigned last_lit; /* running index in l_buf */
1616 static unsigned last_dist; /* running index in d_buf */
1617 static unsigned last_flags; /* running index in flag_buf */
1618 static uch flags; /* current flags not yet saved in flag_buf */
1619 static uch flag_bit; /* current bit used in flags */
1621 /* bits are filled in flags starting at bit 0 (least significant).
1622 * Note: these flags are overkill in the current code since we don't
1623 * take advantage of DIST_BUFSIZE == LIT_BUFSIZE.
1626 static ulg opt_len; /* bit length of current block with optimal trees */
1627 static ulg static_len; /* bit length of current block with static trees */
1629 static ulg compressed_len; /* total bit length of compressed file */
1632 static ush *file_type; /* pointer to UNKNOWN, BINARY or ASCII */
1633 static int *file_method; /* pointer to DEFLATE or STORE */
1635 /* ===========================================================================
1636 * Local (static) routines in this file.
1639 static void init_block(void);
1640 static void pqdownheap(ct_data * tree, int k);
1641 static void gen_bitlen(tree_desc * desc);
1642 static void gen_codes(ct_data * tree, int max_code);
1643 static void build_tree(tree_desc * desc);
1644 static void scan_tree(ct_data * tree, int max_code);
1645 static void send_tree(ct_data * tree, int max_code);
1646 static int build_bl_tree(void);
1647 static void send_all_trees(int lcodes, int dcodes, int blcodes);
1648 static void compress_block(ct_data * ltree, ct_data * dtree);
1649 static void set_file_type(void);
1653 # define send_code(c, tree) send_bits(tree[c].Code, tree[c].Len)
1654 /* Send a code of the given tree. c and tree must not have side effects */
1657 # define send_code(c, tree) \
1658 { if (verbose>1) bb_error_msg("\ncd %3d ",(c)); \
1659 send_bits(tree[c].Code, tree[c].Len); }
1662 #define d_code(dist) \
1663 ((dist) < 256 ? dist_code[dist] : dist_code[256+((dist)>>7)])
1664 /* Mapping from a distance to a distance code. dist is the distance - 1 and
1665 * must not have side effects. dist_code[256] and dist_code[257] are never
1669 /* the arguments must not have side effects */
1671 /* ===========================================================================
1672 * Allocate the match buffer, initialize the various tables and save the
1673 * location of the internal file attribute (ascii/binary) and method
1676 static void ct_init(ush * attr, int *methodp)
1678 int n; /* iterates over tree elements */
1679 int bits; /* bit counter */
1680 int length; /* length value */
1681 int code; /* code value */
1682 int dist; /* distance index */
1685 file_method = methodp;
1686 compressed_len = 0L;
1688 if (static_dtree[0].Len != 0)
1689 return; /* ct_init already called */
1691 /* Initialize the mapping length (0..255) -> length code (0..28) */
1693 for (code = 0; code < LENGTH_CODES - 1; code++) {
1694 base_length[code] = length;
1695 for (n = 0; n < (1 << extra_lbits[code]); n++) {
1696 length_code[length++] = (uch) code;
1699 Assert(length == 256, "ct_init: length != 256");
1700 /* Note that the length 255 (match length 258) can be represented
1701 * in two different ways: code 284 + 5 bits or code 285, so we
1702 * overwrite length_code[255] to use the best encoding:
1704 length_code[length - 1] = (uch) code;
1706 /* Initialize the mapping dist (0..32K) -> dist code (0..29) */
1708 for (code = 0; code < 16; code++) {
1709 base_dist[code] = dist;
1710 for (n = 0; n < (1 << extra_dbits[code]); n++) {
1711 dist_code[dist++] = (uch) code;
1714 Assert(dist == 256, "ct_init: dist != 256");
1715 dist >>= 7; /* from now on, all distances are divided by 128 */
1716 for (; code < D_CODES; code++) {
1717 base_dist[code] = dist << 7;
1718 for (n = 0; n < (1 << (extra_dbits[code] - 7)); n++) {
1719 dist_code[256 + dist++] = (uch) code;
1722 Assert(dist == 256, "ct_init: 256+dist != 512");
1724 /* Construct the codes of the static literal tree */
1725 for (bits = 0; bits <= MAX_BITS; bits++)
1729 static_ltree[n++].Len = 8, bl_count[8]++;
1731 static_ltree[n++].Len = 9, bl_count[9]++;
1733 static_ltree[n++].Len = 7, bl_count[7]++;
1735 static_ltree[n++].Len = 8, bl_count[8]++;
1736 /* Codes 286 and 287 do not exist, but we must include them in the
1737 * tree construction to get a canonical Huffman tree (longest code
1740 gen_codes((ct_data *) static_ltree, L_CODES + 1);
1742 /* The static distance tree is trivial: */
1743 for (n = 0; n < D_CODES; n++) {
1744 static_dtree[n].Len = 5;
1745 static_dtree[n].Code = bi_reverse(n, 5);
1748 /* Initialize the first block of the first file: */
1752 /* ===========================================================================
1753 * Initialize a new block.
1755 static void init_block()
1757 int n; /* iterates over tree elements */
1759 /* Initialize the trees. */
1760 for (n = 0; n < L_CODES; n++)
1761 dyn_ltree[n].Freq = 0;
1762 for (n = 0; n < D_CODES; n++)
1763 dyn_dtree[n].Freq = 0;
1764 for (n = 0; n < BL_CODES; n++)
1765 bl_tree[n].Freq = 0;
1767 dyn_ltree[END_BLOCK].Freq = 1;
1768 opt_len = static_len = 0L;
1769 last_lit = last_dist = last_flags = 0;
1775 /* Index within the heap array of least frequent node in the Huffman tree */
1778 /* ===========================================================================
1779 * Remove the smallest element from the heap and recreate the heap with
1780 * one less element. Updates heap and heap_len.
1782 #define pqremove(tree, top) \
1784 top = heap[SMALLEST]; \
1785 heap[SMALLEST] = heap[heap_len--]; \
1786 pqdownheap(tree, SMALLEST); \
1789 /* ===========================================================================
1790 * Compares to subtrees, using the tree depth as tie breaker when
1791 * the subtrees have equal frequency. This minimizes the worst case length.
1793 #define smaller(tree, n, m) \
1794 (tree[n].Freq < tree[m].Freq || \
1795 (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
1797 /* ===========================================================================
1798 * Restore the heap property by moving down the tree starting at node k,
1799 * exchanging a node with the smallest of its two sons if necessary, stopping
1800 * when the heap property is re-established (each father smaller than its
1803 static void pqdownheap(ct_data * tree, int k)
1806 int j = k << 1; /* left son of k */
1808 while (j <= heap_len) {
1809 /* Set j to the smallest of the two sons: */
1810 if (j < heap_len && smaller(tree, heap[j + 1], heap[j]))
1813 /* Exit if v is smaller than both sons */
1814 if (smaller(tree, v, heap[j]))
1817 /* Exchange v with the smallest son */
1821 /* And continue down the tree, setting j to the left son of k */
1827 /* ===========================================================================
1828 * Compute the optimal bit lengths for a tree and update the total bit length
1829 * for the current block.
1830 * IN assertion: the fields freq and dad are set, heap[heap_max] and
1831 * above are the tree nodes sorted by increasing frequency.
1832 * OUT assertions: the field len is set to the optimal bit length, the
1833 * array bl_count contains the frequencies for each bit length.
1834 * The length opt_len is updated; static_len is also updated if stree is
1837 static void gen_bitlen(tree_desc * desc)
1839 ct_data *tree = desc->dyn_tree;
1840 const extra_bits_t *extra = desc->extra_bits;
1841 int base = desc->extra_base;
1842 int max_code = desc->max_code;
1843 int max_length = desc->max_length;
1844 ct_data *stree = desc->static_tree;
1845 int h; /* heap index */
1846 int n, m; /* iterate over the tree elements */
1847 int bits; /* bit length */
1848 int xbits; /* extra bits */
1849 ush f; /* frequency */
1850 int overflow = 0; /* number of elements with bit length too large */
1852 for (bits = 0; bits <= MAX_BITS; bits++)
1855 /* In a first pass, compute the optimal bit lengths (which may
1856 * overflow in the case of the bit length tree).
1858 tree[heap[heap_max]].Len = 0; /* root of the heap */
1860 for (h = heap_max + 1; h < HEAP_SIZE; h++) {
1862 bits = tree[tree[n].Dad].Len + 1;
1863 if (bits > max_length)
1864 bits = max_length, overflow++;
1865 tree[n].Len = (ush) bits;
1866 /* We overwrite tree[n].Dad which is no longer needed */
1869 continue; /* not a leaf node */
1874 xbits = extra[n - base];
1876 opt_len += (ulg) f *(bits + xbits);
1879 static_len += (ulg) f *(stree[n].Len + xbits);
1884 Trace((stderr, "\nbit length overflow\n"));
1885 /* This happens for example on obj2 and pic of the Calgary corpus */
1887 /* Find the first bit length which could increase: */
1889 bits = max_length - 1;
1890 while (bl_count[bits] == 0)
1892 bl_count[bits]--; /* move one leaf down the tree */
1893 bl_count[bits + 1] += 2; /* move one overflow item as its brother */
1894 bl_count[max_length]--;
1895 /* The brother of the overflow item also moves one step up,
1896 * but this does not affect bl_count[max_length]
1899 } while (overflow > 0);
1901 /* Now recompute all bit lengths, scanning in increasing frequency.
1902 * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all
1903 * lengths instead of fixing only the wrong ones. This idea is taken
1904 * from 'ar' written by Haruhiko Okumura.)
1906 for (bits = max_length; bits != 0; bits--) {
1912 if (tree[m].Len != (unsigned) bits) {
1913 Trace((stderr, "code %d bits %d->%d\n", m, tree[m].Len,
1916 ((long) bits - (long) tree[m].Len) * (long) tree[m].Freq;
1917 tree[m].Len = (ush) bits;
1924 /* ===========================================================================
1925 * Generate the codes for a given tree and bit counts (which need not be
1927 * IN assertion: the array bl_count contains the bit length statistics for
1928 * the given tree and the field len is set for all tree elements.
1929 * OUT assertion: the field code is set for all tree elements of non
1932 static void gen_codes(ct_data * tree, int max_code)
1934 ush next_code[MAX_BITS + 1]; /* next code value for each bit length */
1935 ush code = 0; /* running code value */
1936 int bits; /* bit index */
1937 int n; /* code index */
1939 /* The distribution counts are first used to generate the code values
1940 * without bit reversal.
1942 for (bits = 1; bits <= MAX_BITS; bits++) {
1943 next_code[bits] = code = (code + bl_count[bits - 1]) << 1;
1945 /* Check that the bit counts in bl_count are consistent. The last code
1948 Assert(code + bl_count[MAX_BITS] - 1 == (1 << MAX_BITS) - 1,
1949 "inconsistent bit counts");
1950 Tracev((stderr, "\ngen_codes: max_code %d ", max_code));
1952 for (n = 0; n <= max_code; n++) {
1953 int len = tree[n].Len;
1957 /* Now reverse the bits */
1958 tree[n].Code = bi_reverse(next_code[len]++, len);
1960 Tracec(tree != static_ltree,
1961 (stderr, "\nn %3d %c l %2d c %4x (%x) ", n,
1962 (isgraph(n) ? n : ' '), len, tree[n].Code,
1963 next_code[len] - 1));
1967 /* ===========================================================================
1968 * Construct one Huffman tree and assigns the code bit strings and lengths.
1969 * Update the total bit length for the current block.
1970 * IN assertion: the field freq is set for all tree elements.
1971 * OUT assertions: the fields len and code are set to the optimal bit length
1972 * and corresponding code. The length opt_len is updated; static_len is
1973 * also updated if stree is not null. The field max_code is set.
1975 static void build_tree(tree_desc * desc)
1977 ct_data *tree = desc->dyn_tree;
1978 ct_data *stree = desc->static_tree;
1979 int elems = desc->elems;
1980 int n, m; /* iterate over heap elements */
1981 int max_code = -1; /* largest code with non zero frequency */
1982 int node = elems; /* next internal node of the tree */
1984 /* Construct the initial heap, with least frequent element in
1985 * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].
1986 * heap[0] is not used.
1988 heap_len = 0, heap_max = HEAP_SIZE;
1990 for (n = 0; n < elems; n++) {
1991 if (tree[n].Freq != 0) {
1992 heap[++heap_len] = max_code = n;
1999 /* The pkzip format requires that at least one distance code exists,
2000 * and that at least one bit should be sent even if there is only one
2001 * possible code. So to avoid special checks later on we force at least
2002 * two codes of non zero frequency.
2004 while (heap_len < 2) {
2005 int new = heap[++heap_len] = (max_code < 2 ? ++max_code : 0);
2011 static_len -= stree[new].Len;
2012 /* new is 0 or 1 so it does not have extra bits */
2014 desc->max_code = max_code;
2016 /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree,
2017 * establish sub-heaps of increasing lengths:
2019 for (n = heap_len / 2; n >= 1; n--)
2020 pqdownheap(tree, n);
2022 /* Construct the Huffman tree by repeatedly combining the least two
2026 pqremove(tree, n); /* n = node of least frequency */
2027 m = heap[SMALLEST]; /* m = node of next least frequency */
2029 heap[--heap_max] = n; /* keep the nodes sorted by frequency */
2030 heap[--heap_max] = m;
2032 /* Create a new node father of n and m */
2033 tree[node].Freq = tree[n].Freq + tree[m].Freq;
2034 depth[node] = (uch) (MAX(depth[n], depth[m]) + 1);
2035 tree[n].Dad = tree[m].Dad = (ush) node;
2037 if (tree == bl_tree) {
2038 bb_error_msg("\nnode %d(%d), sons %d(%d) %d(%d)",
2039 node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);
2042 /* and insert the new node in the heap */
2043 heap[SMALLEST] = node++;
2044 pqdownheap(tree, SMALLEST);
2046 } while (heap_len >= 2);
2048 heap[--heap_max] = heap[SMALLEST];
2050 /* At this point, the fields freq and dad are set. We can now
2051 * generate the bit lengths.
2053 gen_bitlen((tree_desc *) desc);
2055 /* The field len is now set, we can generate the bit codes */
2056 gen_codes((ct_data *) tree, max_code);
2059 /* ===========================================================================
2060 * Scan a literal or distance tree to determine the frequencies of the codes
2061 * in the bit length tree. Updates opt_len to take into account the repeat
2062 * counts. (The contribution of the bit length codes will be added later
2063 * during the construction of bl_tree.)
2065 static void scan_tree(ct_data * tree, int max_code)
2067 int n; /* iterates over all tree elements */
2068 int prevlen = -1; /* last emitted length */
2069 int curlen; /* length of current code */
2070 int nextlen = tree[0].Len; /* length of next code */
2071 int count = 0; /* repeat count of the current code */
2072 int max_count = 7; /* max repeat count */
2073 int min_count = 4; /* min repeat count */
2076 max_count = 138, min_count = 3;
2077 tree[max_code + 1].Len = (ush) 0xffff; /* guard */
2079 for (n = 0; n <= max_code; n++) {
2081 nextlen = tree[n + 1].Len;
2082 if (++count < max_count && curlen == nextlen) {
2084 } else if (count < min_count) {
2085 bl_tree[curlen].Freq += count;
2086 } else if (curlen != 0) {
2087 if (curlen != prevlen)
2088 bl_tree[curlen].Freq++;
2089 bl_tree[REP_3_6].Freq++;
2090 } else if (count <= 10) {
2091 bl_tree[REPZ_3_10].Freq++;
2093 bl_tree[REPZ_11_138].Freq++;
2098 max_count = 138, min_count = 3;
2099 } else if (curlen == nextlen) {
2100 max_count = 6, min_count = 3;
2102 max_count = 7, min_count = 4;
2107 /* ===========================================================================
2108 * Send a literal or distance tree in compressed form, using the codes in
2111 static void send_tree(ct_data * tree, int max_code)
2113 int n; /* iterates over all tree elements */
2114 int prevlen = -1; /* last emitted length */
2115 int curlen; /* length of current code */
2116 int nextlen = tree[0].Len; /* length of next code */
2117 int count = 0; /* repeat count of the current code */
2118 int max_count = 7; /* max repeat count */
2119 int min_count = 4; /* min repeat count */
2121 /* tree[max_code+1].Len = -1; *//* guard already set */
2123 max_count = 138, min_count = 3;
2125 for (n = 0; n <= max_code; n++) {
2127 nextlen = tree[n + 1].Len;
2128 if (++count < max_count && curlen == nextlen) {
2130 } else if (count < min_count) {
2132 send_code(curlen, bl_tree);
2133 } while (--count != 0);
2135 } else if (curlen != 0) {
2136 if (curlen != prevlen) {
2137 send_code(curlen, bl_tree);
2140 Assert(count >= 3 && count <= 6, " 3_6?");
2141 send_code(REP_3_6, bl_tree);
2142 send_bits(count - 3, 2);
2144 } else if (count <= 10) {
2145 send_code(REPZ_3_10, bl_tree);
2146 send_bits(count - 3, 3);
2149 send_code(REPZ_11_138, bl_tree);
2150 send_bits(count - 11, 7);
2155 max_count = 138, min_count = 3;
2156 } else if (curlen == nextlen) {
2157 max_count = 6, min_count = 3;
2159 max_count = 7, min_count = 4;
2164 /* ===========================================================================
2165 * Construct the Huffman tree for the bit lengths and return the index in
2166 * bl_order of the last bit length code to send.
2168 static const int build_bl_tree()
2170 int max_blindex; /* index of last bit length code of non zero freq */
2172 /* Determine the bit length frequencies for literal and distance trees */
2173 scan_tree((ct_data *) dyn_ltree, l_desc.max_code);
2174 scan_tree((ct_data *) dyn_dtree, d_desc.max_code);
2176 /* Build the bit length tree: */
2177 build_tree((tree_desc *) (&bl_desc));
2178 /* opt_len now includes the length of the tree representations, except
2179 * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.
2182 /* Determine the number of bit length codes to send. The pkzip format
2183 * requires that at least 4 bit length codes be sent. (appnote.txt says
2184 * 3 but the actual value used is 4.)
2186 for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {
2187 if (bl_tree[bl_order[max_blindex]].Len != 0)
2190 /* Update opt_len to include the bit length tree and counts */
2191 opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;
2192 Tracev((stderr, "\ndyn trees: dyn %ld, stat %ld", opt_len, static_len));
2197 /* ===========================================================================
2198 * Send the header for a block using dynamic Huffman trees: the counts, the
2199 * lengths of the bit length codes, the literal tree and the distance tree.
2200 * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4.
2202 static void send_all_trees(int lcodes, int dcodes, int blcodes)
2204 int rank; /* index in bl_order */
2206 Assert(lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes");
2207 Assert(lcodes <= L_CODES && dcodes <= D_CODES
2208 && blcodes <= BL_CODES, "too many codes");
2209 Tracev((stderr, "\nbl counts: "));
2210 send_bits(lcodes - 257, 5); /* not +255 as stated in appnote.txt */
2211 send_bits(dcodes - 1, 5);
2212 send_bits(blcodes - 4, 4); /* not -3 as stated in appnote.txt */
2213 for (rank = 0; rank < blcodes; rank++) {
2214 Tracev((stderr, "\nbl code %2d ", bl_order[rank]));
2215 send_bits(bl_tree[bl_order[rank]].Len, 3);
2217 Tracev((stderr, "\nbl tree: sent %ld", bits_sent));
2219 send_tree((ct_data *) dyn_ltree, lcodes - 1); /* send the literal tree */
2220 Tracev((stderr, "\nlit tree: sent %ld", bits_sent));
2222 send_tree((ct_data *) dyn_dtree, dcodes - 1); /* send the distance tree */
2223 Tracev((stderr, "\ndist tree: sent %ld", bits_sent));
2226 /* ===========================================================================
2227 * Determine the best encoding for the current block: dynamic trees, static
2228 * trees or store, and output the encoded block to the zip file. This function
2229 * returns the total compressed length for the file so far.
2231 static ulg flush_block(char *buf, ulg stored_len, int eof)
2233 ulg opt_lenb, static_lenb; /* opt_len and static_len in bytes */
2234 int max_blindex; /* index of last bit length code of non zero freq */
2236 flag_buf[last_flags] = flags; /* Save the flags for the last 8 items */
2238 /* Check if the file is ascii or binary */
2239 if (*file_type == (ush) UNKNOWN)
2242 /* Construct the literal and distance trees */
2243 build_tree((tree_desc *) (&l_desc));
2244 Tracev((stderr, "\nlit data: dyn %ld, stat %ld", opt_len, static_len));
2246 build_tree((tree_desc *) (&d_desc));
2247 Tracev((stderr, "\ndist data: dyn %ld, stat %ld", opt_len, static_len));
2248 /* At this point, opt_len and static_len are the total bit lengths of
2249 * the compressed block data, excluding the tree representations.
2252 /* Build the bit length tree for the above two trees, and get the index
2253 * in bl_order of the last bit length code to send.
2255 max_blindex = build_bl_tree();
2257 /* Determine the best encoding. Compute first the block length in bytes */
2258 opt_lenb = (opt_len + 3 + 7) >> 3;
2259 static_lenb = (static_len + 3 + 7) >> 3;
2262 "\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u dist %u ",
2263 opt_lenb, opt_len, static_lenb, static_len, stored_len,
2264 last_lit, last_dist));
2266 if (static_lenb <= opt_lenb)
2267 opt_lenb = static_lenb;
2269 /* If compression failed and this is the first and last block,
2270 * and if the zip file can be seeked (to rewrite the local header),
2271 * the whole file is transformed into a stored file:
2273 if (stored_len <= opt_lenb && eof && compressed_len == 0L && seekable()) {
2274 /* Since LIT_BUFSIZE <= 2*WSIZE, the input data must be there: */
2275 if (buf == (char *) 0)
2276 bb_error_msg("block vanished");
2278 copy_block(buf, (unsigned) stored_len, 0); /* without header */
2279 compressed_len = stored_len << 3;
2280 *file_method = STORED;
2282 } else if (stored_len + 4 <= opt_lenb && buf != (char *) 0) {
2283 /* 4: two words for the lengths */
2284 /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.
2285 * Otherwise we can't have processed more than WSIZE input bytes since
2286 * the last block flush, because compression would have been
2287 * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to
2288 * transform a block into a stored block.
2290 send_bits((STORED_BLOCK << 1) + eof, 3); /* send block type */
2291 compressed_len = (compressed_len + 3 + 7) & ~7L;
2292 compressed_len += (stored_len + 4) << 3;
2294 copy_block(buf, (unsigned) stored_len, 1); /* with header */
2296 } else if (static_lenb == opt_lenb) {
2297 send_bits((STATIC_TREES << 1) + eof, 3);
2298 compress_block((ct_data *) static_ltree, (ct_data *) static_dtree);
2299 compressed_len += 3 + static_len;
2301 send_bits((DYN_TREES << 1) + eof, 3);
2302 send_all_trees(l_desc.max_code + 1, d_desc.max_code + 1,
2304 compress_block((ct_data *) dyn_ltree, (ct_data *) dyn_dtree);
2305 compressed_len += 3 + opt_len;
2307 Assert(compressed_len == bits_sent, "bad compressed size");
2312 compressed_len += 7; /* align on byte boundary */
2314 Tracev((stderr, "\ncomprlen %lu(%lu) ", compressed_len >> 3,
2315 compressed_len - 7 * eof));
2317 return compressed_len >> 3;
2320 /* ===========================================================================
2321 * Save the match info and tally the frequency counts. Return true if
2322 * the current block must be flushed.
2324 static int ct_tally(int dist, int lc)
2326 l_buf[last_lit++] = (uch) lc;
2328 /* lc is the unmatched char */
2329 dyn_ltree[lc].Freq++;
2331 /* Here, lc is the match length - MIN_MATCH */
2332 dist--; /* dist = match distance - 1 */
2333 Assert((ush) dist < (ush) MAX_DIST &&
2334 (ush) lc <= (ush) (MAX_MATCH - MIN_MATCH) &&
2335 (ush) d_code(dist) < (ush) D_CODES, "ct_tally: bad match");
2337 dyn_ltree[length_code[lc] + LITERALS + 1].Freq++;
2338 dyn_dtree[d_code(dist)].Freq++;
2340 d_buf[last_dist++] = (ush) dist;
2345 /* Output the flags if they fill a byte: */
2346 if ((last_lit & 7) == 0) {
2347 flag_buf[last_flags++] = flags;
2348 flags = 0, flag_bit = 1;
2350 /* Try to guess if it is profitable to stop the current block here */
2351 if ((last_lit & 0xfff) == 0) {
2352 /* Compute an upper bound for the compressed length */
2353 ulg out_length = (ulg) last_lit * 8L;
2354 ulg in_length = (ulg) strstart - block_start;
2357 for (dcode = 0; dcode < D_CODES; dcode++) {
2359 (ulg) dyn_dtree[dcode].Freq * (5L + extra_dbits[dcode]);
2363 "\nlast_lit %u, last_dist %u, in %ld, out ~%ld(%ld%%) ",
2364 last_lit, last_dist, in_length, out_length,
2365 100L - out_length * 100L / in_length));
2366 if (last_dist < last_lit / 2 && out_length < in_length / 2)
2369 return (last_lit == LIT_BUFSIZE - 1 || last_dist == DIST_BUFSIZE);
2370 /* We avoid equality with LIT_BUFSIZE because of wraparound at 64K
2371 * on 16 bit machines and because stored blocks are restricted to
2376 /* ===========================================================================
2377 * Send the block data compressed using the given Huffman trees
2379 static void compress_block(ct_data * ltree, ct_data * dtree)
2381 unsigned dist; /* distance of matched string */
2382 int lc; /* match length or unmatched char (if dist == 0) */
2383 unsigned lx = 0; /* running index in l_buf */
2384 unsigned dx = 0; /* running index in d_buf */
2385 unsigned fx = 0; /* running index in flag_buf */
2386 uch flag = 0; /* current flags */
2387 unsigned code; /* the code to send */
2388 int extra; /* number of extra bits to send */
2393 flag = flag_buf[fx++];
2395 if ((flag & 1) == 0) {
2396 send_code(lc, ltree); /* send a literal byte */
2397 Tracecv(isgraph(lc), (stderr, " '%c' ", lc));
2399 /* Here, lc is the match length - MIN_MATCH */
2400 code = length_code[lc];
2401 send_code(code + LITERALS + 1, ltree); /* send the length code */
2402 extra = extra_lbits[code];
2404 lc -= base_length[code];
2405 send_bits(lc, extra); /* send the extra length bits */
2408 /* Here, dist is the match distance - 1 */
2409 code = d_code(dist);
2410 Assert(code < D_CODES, "bad d_code");
2412 send_code(code, dtree); /* send the distance code */
2413 extra = extra_dbits[code];
2415 dist -= base_dist[code];
2416 send_bits(dist, extra); /* send the extra distance bits */
2418 } /* literal or match pair ? */
2420 } while (lx < last_lit);
2422 send_code(END_BLOCK, ltree);
2425 /* ===========================================================================
2426 * Set the file type to ASCII or BINARY, using a crude approximation:
2427 * binary if more than 20% of the bytes are <= 6 or >= 128, ascii otherwise.
2428 * IN assertion: the fields freq of dyn_ltree are set and the total of all
2429 * frequencies does not exceed 64K (to fit in an int on 16 bit machines).
2431 static void set_file_type()
2434 unsigned ascii_freq = 0;
2435 unsigned bin_freq = 0;
2438 bin_freq += dyn_ltree[n++].Freq;
2440 ascii_freq += dyn_ltree[n++].Freq;
2441 while (n < LITERALS)
2442 bin_freq += dyn_ltree[n++].Freq;
2443 *file_type = bin_freq > (ascii_freq >> 2) ? BINARY : ASCII;
2444 if (*file_type == BINARY && translate_eol) {
2445 bb_error_msg("-l used on binary file");
2449 /* zip.c -- compress files to the gzip or pkzip format
2450 * Copyright (C) 1992-1993 Jean-loup Gailly
2451 * This is free software; you can redistribute it and/or modify it under the
2452 * terms of the GNU General Public License, see the file COPYING.
2456 static ulg crc; /* crc on uncompressed file data */
2457 static long header_bytes; /* number of bytes in gzip header */
2459 static void put_long(ulg n)
2461 put_short((n) & 0xffff);
2462 put_short(((ulg) (n)) >> 16);
2465 /* put_header_byte is used for the compressed output
2466 * - for the initial 4 bytes that can't overflow the buffer.
2468 #define put_header_byte(c) {outbuf[outcnt++]=(uch)(c);}
2470 /* ===========================================================================
2471 * Deflate in to out.
2472 * IN assertions: the input and output buffers are cleared.
2473 * The variables time_stamp and save_orig_name are initialized.
2475 static int zip(int in, int out)
2477 uch my_flags = 0; /* general purpose bit flags */
2478 ush attr = 0; /* ascii/binary flag */
2479 ush deflate_flags = 0; /* pkzip -es, -en or -ex equivalent */
2485 /* Write the header to the gzip file. See algorithm.doc for the format */
2489 put_header_byte(GZIP_MAGIC[0]); /* magic header */
2490 put_header_byte(GZIP_MAGIC[1]);
2491 put_header_byte(DEFLATED); /* compression method */
2493 put_header_byte(my_flags); /* general flags */
2494 put_long(time_stamp);
2496 /* Write deflated file to zip file */
2500 ct_init(&attr, &method);
2501 lm_init(&deflate_flags);
2503 put_byte((uch) deflate_flags); /* extra flags */
2504 put_byte(OS_CODE); /* OS identifier */
2506 header_bytes = (long) outcnt;
2510 /* Write the crc and uncompressed size */
2513 header_bytes += 2 * sizeof(long);
2520 /* ===========================================================================
2521 * Read a new buffer from the current input file, perform end-of-line
2522 * translation, and update the crc and input file size.
2523 * IN assertion: size >= 2 (for end-of-line translation)
2525 static int file_read(char *buf, unsigned size)
2529 Assert(insize == 0, "inbuf not empty");
2531 len = read(ifd, buf, size);
2532 if (len == (unsigned) (-1) || len == 0)
2535 crc = updcrc((uch *) buf, len);
2540 /* ===========================================================================
2541 * Write the output buffer outbuf[0..outcnt-1] and update bytes_out.
2542 * (used for the compressed data only)
2544 static void flush_outbuf()
2549 write_buf(ofd, (char *) outbuf, outcnt);