1 /* vi: set sw=4 ts=4: */
2 /* gzip.c -- this is a stripped down version of gzip I put into busybox, it does
3 * only standard in to standard out with -9 compression. It also requires the
4 * zcat module for some important functions.
6 * Charles P. Wright <cpw@unix.asb.com>
12 //#error you need zcat to have gzip support!
15 static const char gzip_usage[] =
16 "gzip [OPTION]... FILE\n\n"
17 "Compress FILE with maximum compression.\n"
18 "When FILE is -, reads standard input. Implies -c.\n\n"
21 "\t-c\tWrite output to standard output instead of FILE.gz\n";
24 /* gzip.h -- common declarations for all gzip modules
25 * Copyright (C) 1992-1993 Jean-loup Gailly.
26 * This is free software; you can redistribute it and/or modify it under the
27 * terms of the GNU General Public License, see the file COPYING.
30 #if defined(__STDC__) || defined(PROTO)
31 # define OF(args) args
42 /* I don't like nested includes, but the string and io functions are used
46 #if !defined(NO_STRING_H) || defined(STDC_HEADERS)
48 # if !defined(STDC_HEADERS) && !defined(NO_MEMORY_H) && !defined(__GNUC__)
51 # define memzero(s, n) memset ((voidp)(s), 0, (n))
55 # define strrchr rindex
56 # define memcpy(d, s, n) bcopy((s), (d), (n))
57 # define memcmp(s1, s2, n) bcmp((s1), (s2), (n))
58 # define memzero(s, n) bzero((s), (n))
62 # define RETSIGTYPE void
67 typedef unsigned char uch;
68 typedef unsigned short ush;
69 typedef unsigned long ulg;
71 /* Return codes from gzip */
76 /* Compression methods (see algorithm.doc) */
81 /* methods 4 to 7 reserved */
84 extern int method; /* compression method */
86 /* To save memory for 16 bit systems, some arrays are overlaid between
87 * the various modules:
88 * deflate: prev+head window d_buf l_buf outbuf
89 * unlzw: tab_prefix tab_suffix stack inbuf outbuf
90 * inflate: window inbuf
91 * unpack: window inbuf prefix_len
92 * unlzh: left+right window c_table inbuf c_len
93 * For compression, input is done in window[]. For decompression, output
94 * is done in window except for unlzw.
99 # define INBUFSIZ 0x2000 /* input buffer size */
101 # define INBUFSIZ 0x8000 /* input buffer size */
104 #define INBUF_EXTRA 64 /* required by unlzw() */
108 # define OUTBUFSIZ 8192 /* output buffer size */
110 # define OUTBUFSIZ 16384 /* output buffer size */
113 #define OUTBUF_EXTRA 2048 /* required by unlzw() */
117 # define DIST_BUFSIZE 0x2000 /* buffer for distances, see trees.c */
119 # define DIST_BUFSIZE 0x8000 /* buffer for distances, see trees.c */
124 # define EXTERN(type, array) extern type * near array
125 # define DECLARE(type, array, size) type * near array
126 # define ALLOC(type, array, size) { \
127 array = (type*)fcalloc((size_t)(((size)+1L)/2), 2*sizeof(type)); \
128 if (array == NULL) errorMsg("insufficient memory"); \
130 # define FREE(array) {if (array != NULL) fcfree(array), array=NULL;}
132 # define EXTERN(type, array) extern type array[]
133 # define DECLARE(type, array, size) type array[size]
134 # define ALLOC(type, array, size)
138 EXTERN(uch, inbuf); /* input buffer */
139 EXTERN(uch, outbuf); /* output buffer */
140 EXTERN(ush, d_buf); /* buffer for distances, see trees.c */
141 EXTERN(uch, window); /* Sliding window and suffix table (unlzw) */
142 #define tab_suffix window
144 # define tab_prefix prev /* hash link (see deflate.c) */
145 # define head (prev+WSIZE) /* hash head (see deflate.c) */
146 EXTERN(ush, tab_prefix); /* prefix code (see unlzw.c) */
148 # define tab_prefix0 prev
149 # define head tab_prefix1
150 EXTERN(ush, tab_prefix0); /* prefix for even codes */
151 EXTERN(ush, tab_prefix1); /* prefix for odd codes */
154 extern unsigned insize; /* valid bytes in inbuf */
155 extern unsigned inptr; /* index of next byte to be processed in inbuf */
156 extern unsigned outcnt; /* bytes in output buffer */
158 extern long bytes_in; /* number of input bytes */
159 extern long bytes_out; /* number of output bytes */
160 extern long header_bytes; /* number of bytes in gzip header */
162 #define isize bytes_in
163 /* for compatibility with old zip sources (to be cleaned) */
165 extern int ifd; /* input file descriptor */
166 extern int ofd; /* output file descriptor */
167 extern char ifname[]; /* input file name or "stdin" */
168 extern char ofname[]; /* output file name or "stdout" */
169 extern char *progname; /* program name */
171 extern long time_stamp; /* original time stamp (modification time) */
172 extern long ifile_size; /* input file size, -1 for devices (debug only) */
174 typedef int file_t; /* Do not use stdio */
176 #define NO_FILE (-1) /* in memory compression */
179 #define PACK_MAGIC "\037\036" /* Magic header for packed files */
180 #define GZIP_MAGIC "\037\213" /* Magic header for gzip files, 1F 8B */
181 #define OLD_GZIP_MAGIC "\037\236" /* Magic header for gzip 0.5 = freeze 1.x */
182 #define LZH_MAGIC "\037\240" /* Magic header for SCO LZH Compress files */
183 #define PKZIP_MAGIC "\120\113\003\004" /* Magic header for pkzip files */
186 #define ASCII_FLAG 0x01 /* bit 0 set: file probably ascii text */
187 #define CONTINUATION 0x02 /* bit 1 set: continuation of multi-part gzip file */
188 #define EXTRA_FIELD 0x04 /* bit 2 set: extra field present */
189 #define ORIG_NAME 0x08 /* bit 3 set: original file name present */
190 #define COMMENT 0x10 /* bit 4 set: file comment present */
191 #define ENCRYPTED 0x20 /* bit 5 set: file is encrypted */
192 #define RESERVED 0xC0 /* bit 6,7: reserved */
194 /* internal file attribute */
195 #define UNKNOWN 0xffff
200 # define WSIZE 0x8000 /* window size--must be a power of two, and */
201 #endif /* at least 32K for zip's deflate method */
204 #define MAX_MATCH 258
205 /* The minimum and maximum match lengths */
207 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
208 /* Minimum amount of lookahead, except at the end of the input file.
209 * See deflate.c for comments about the MIN_MATCH+1.
212 #define MAX_DIST (WSIZE-MIN_LOOKAHEAD)
213 /* In order to simplify the code, particularly on 16 bit machines, match
214 * distances are limited to MAX_DIST instead of WSIZE.
217 extern int decrypt; /* flag to turn on decryption */
218 extern int exit_code; /* program exit code */
219 extern int verbose; /* be verbose (-v) */
220 extern int quiet; /* be quiet (-q) */
221 extern int test; /* check .z file integrity */
222 extern int save_orig_name; /* set if original name must be saved */
224 #define get_byte() (inptr < insize ? inbuf[inptr++] : fill_inbuf(0))
225 #define try_byte() (inptr < insize ? inbuf[inptr++] : fill_inbuf(1))
227 /* put_byte is used for the compressed output, put_ubyte for the
228 * uncompressed output. However unlzw() uses window for its
229 * suffix table instead of its output buffer, so it does not use put_ubyte
230 * (to be cleaned up).
232 #define put_byte(c) {outbuf[outcnt++]=(uch)(c); if (outcnt==OUTBUFSIZ)\
234 #define put_ubyte(c) {window[outcnt++]=(uch)(c); if (outcnt==WSIZE)\
237 /* Output a 16 bit value, lsb first */
238 #define put_short(w) \
239 { if (outcnt < OUTBUFSIZ-2) { \
240 outbuf[outcnt++] = (uch) ((w) & 0xff); \
241 outbuf[outcnt++] = (uch) ((ush)(w) >> 8); \
243 put_byte((uch)((w) & 0xff)); \
244 put_byte((uch)((ush)(w) >> 8)); \
248 /* Output a 32 bit value to the bit stream, lsb first */
249 #define put_long(n) { \
250 put_short((n) & 0xffff); \
251 put_short(((ulg)(n)) >> 16); \
254 #define seekable() 0 /* force sequential output */
255 #define translate_eol 0 /* no option -a yet */
257 #define tolow(c) (isupper(c) ? (c)-'A'+'a' : (c)) /* force to lower case */
259 /* Macros for getting two-byte and four-byte header values */
260 #define SH(p) ((ush)(uch)((p)[0]) | ((ush)(uch)((p)[1]) << 8))
261 #define LG(p) ((ulg)(SH(p)) | ((ulg)(SH((p)+2)) << 16))
263 /* Diagnostic functions */
265 # define Assert(cond,msg) {if(!(cond)) errorMsg(msg);}
266 # define Trace(x) fprintf x
267 # define Tracev(x) {if (verbose) fprintf x ;}
268 # define Tracevv(x) {if (verbose>1) fprintf x ;}
269 # define Tracec(c,x) {if (verbose && (c)) fprintf x ;}
270 # define Tracecv(c,x) {if (verbose>1 && (c)) fprintf x ;}
272 # define Assert(cond,msg)
277 # define Tracecv(c,x)
280 #define WARN(msg) {if (!quiet) fprintf msg ; \
281 if (exit_code == OK) exit_code = WARNING;}
283 #define do_exit(c) exit(c)
287 extern int zip OF((int in, int out));
288 extern int file_read OF((char *buf, unsigned size));
291 extern int unzip OF((int in, int out));
292 extern int check_zipfile OF((int in));
295 extern int unpack OF((int in, int out));
298 extern int unlzh OF((int in, int out));
301 RETSIGTYPE abort_gzip OF((void));
304 void lm_init OF((ush * flags));
305 ulg deflate OF((void));
308 void ct_init OF((ush * attr, int *method));
309 int ct_tally OF((int dist, int lc));
310 ulg flush_block OF((char *buf, ulg stored_len, int eof));
313 void bi_init OF((file_t zipfile));
314 void send_bits OF((int value, int length));
315 unsigned bi_reverse OF((unsigned value, int length));
316 void bi_windup OF((void));
317 void copy_block OF((char *buf, unsigned len, int header));
318 extern int (*read_buf) OF((char *buf, unsigned size));
321 extern int copy OF((int in, int out));
322 extern ulg updcrc OF((uch * s, unsigned n));
323 extern void clear_bufs OF((void));
324 extern int fill_inbuf OF((int eof_ok));
325 extern void flush_outbuf OF((void));
326 extern void flush_window OF((void));
327 extern void write_buf OF((int fd, voidp buf, unsigned cnt));
328 extern char *strlwr OF((char *s));
329 extern char *add_envopt OF((int *argcp, char ***argvp, char *env));
330 extern void read_error OF((void));
331 extern void write_error OF((void));
332 extern void display_ratio OF((long num, long den, FILE * file));
335 extern int inflate OF((void));
337 /* lzw.h -- define the lzw functions.
338 * Copyright (C) 1992-1993 Jean-loup Gailly.
339 * This is free software; you can redistribute it and/or modify it under the
340 * terms of the GNU General Public License, see the file COPYING.
343 #if !defined(OF) && defined(lint)
350 #define INIT_BITS 9 /* Initial number of bits per code */
352 #define BIT_MASK 0x1f /* Mask for 'number of compression bits' */
353 /* Mask 0x20 is reserved to mean a fourth header byte, and 0x40 is free.
354 * It's a pity that old uncompress does not check bit 0x20. That makes
355 * extension of the format actually undesirable because old compress
356 * would just crash on the new format instead of giving a meaningful
357 * error message. It does check the number of bits, but it's more
358 * helpful to say "unsupported format, get a new version" than
359 * "can only handle 16 bits".
362 #define BLOCK_MODE 0x80
363 /* Block compression: if table is full and compression rate is dropping,
364 * clear the dictionary.
367 #define LZW_RESERVED 0x60 /* reserved bits */
369 #define CLEAR 256 /* flush the dictionary */
370 #define FIRST (CLEAR+1) /* first free entry */
372 extern int maxbits; /* max bits per code for LZW */
373 extern int block_mode; /* block compress mode -C compatible with 2.0 */
375 /* revision.h -- define the version number
376 * Copyright (C) 1992-1993 Jean-loup Gailly.
377 * This is free software; you can redistribute it and/or modify it under the
378 * terms of the GNU General Public License, see the file COPYING.
381 #define VERSION "1.2.4"
383 #define REVDATE "18 Aug 93"
385 /* This version does not support compression into old compress format: */
390 /* tailor.h -- target dependent definitions
391 * Copyright (C) 1992-1993 Jean-loup Gailly.
392 * This is free software; you can redistribute it and/or modify it under the
393 * terms of the GNU General Public License, see the file COPYING.
396 /* The target dependent definitions should be defined here only.
397 * The target dependent functions should be defined in tailor.c.
401 #if defined(__MSDOS__) && !defined(MSDOS)
405 #if defined(__OS2__) && !defined(OS2)
409 #if defined(OS2) && defined(MSDOS) /* MS C under OS/2 */
415 /* DJGPP version 1.09+ on MS-DOS.
416 * The DJGPP 1.09 stat() function must be upgraded before gzip will
418 * No need for DIRENT, since <unistd.h> defines POSIX_SOURCE which
432 # define HAVE_SYS_UTIME_H
436 # define PATH_SEP2 '\\'
437 # define PATH_SEP3 ':'
438 # define MAX_PATH_LEN 128
439 # define NO_MULTIPLE_DOTS
440 # define MAX_EXT_CHARS 3
441 # define Z_SUFFIX "z"
444 # define STDC_HEADERS
445 # define NO_SIZE_CHECK
446 # define casemap(c) tolow(c) /* Force file names to lower case */
448 # define OS_CODE 0x00
449 # define SET_BINARY_MODE(fd) setmode(fd, O_BINARY)
450 # if !defined(NO_ASM) && !defined(ASMV)
458 # define PATH_SEP2 '\\'
459 # define PATH_SEP3 ':'
460 # define MAX_PATH_LEN 260
462 # define NO_MULTIPLE_DOTS
463 # define MAX_EXT_CHARS 3
464 # define Z_SUFFIX "z"
465 # define casemap(c) tolow(c)
469 # define STDC_HEADERS
471 # define OS_CODE 0x06
472 # define SET_BINARY_MODE(fd) setmode(fd, O_BINARY)
474 # define HAVE_SYS_UTIME_H
481 # define HAVE_SYS_UTIME_H
484 # define EXPAND(argc,argv) \
485 {_response(&argc, &argv); _wildcard(&argc, &argv);}
494 # define EXPAND(argc,argv) \
495 {response_expand(&argc, &argv);}
499 #ifdef WIN32 /* Windows NT */
500 # define HAVE_SYS_UTIME_H
502 # define PATH_SEP2 '\\'
503 # define PATH_SEP3 ':'
504 # define MAX_PATH_LEN 260
507 # define STDC_HEADERS
508 # define SET_BINARY_MODE(fd) setmode(fd, O_BINARY)
512 # define NO_MULTIPLE_DOTS
513 # define MAX_EXT_CHARS 3
514 # define Z_SUFFIX "z"
515 # define casemap(c) tolow(c) /* Force file names to lower case */
517 # define OS_CODE 0x0b
524 /* Turbo C 2.0 does not accept static allocations of large arrays */
525 void *fcalloc(unsigned items, unsigned size);
526 void fcfree(void *ptr);
529 # define fcalloc(nitems,itemsize) halloc((long)(nitems),(itemsize))
530 # define fcfree(ptr) hfree(ptr)
534 # define fcalloc(items,size) calloc((items),(size))
536 # define fcalloc(items,size) malloc((size_t)(items)*(size_t)(size))
538 # define fcfree(ptr) free(ptr)
541 #if defined(VAXC) || defined(VMS)
542 # define PATH_SEP ']'
543 # define PATH_SEP2 ':'
544 # define SUFFIX_SEP ';'
545 # define NO_MULTIPLE_DOTS
546 # define Z_SUFFIX "-gz"
548 # define casemap(c) tolow(c)
549 # define OS_CODE 0x02
550 # define OPTIONS_VAR "GZIP_OPT"
551 # define STDC_HEADERS
553 # define EXPAND(argc,argv) vms_expand_args(&argc,&argv);
555 # define unlink delete
563 # define PATH_SEP2 ':'
564 # define STDC_HEADERS
565 # define OS_CODE 0x01
569 # define HAVE_UNISTD_H
571 # define NO_STDIN_FSTAT
576 # include <fcntl.h> /* for read() and write() */
577 # define direct dirent
578 extern void _expand_args(int *argc, char ***argv);
580 # define EXPAND(argc,argv) _expand_args(&argc,&argv);
581 # undef O_BINARY /* disable useless --ascii option */
585 #if defined(ATARI) || defined(atarist)
586 # ifndef STDC_HEADERS
587 # define STDC_HEADERS
588 # define HAVE_UNISTD_H
592 # define OS_CODE 0x05
594 # define PATH_SEP2 '\\'
595 # define PATH_SEP3 ':'
596 # define MAX_PATH_LEN 128
597 # define NO_MULTIPLE_DOTS
598 # define MAX_EXT_CHARS 3
599 # define Z_SUFFIX "z"
601 # define casemap(c) tolow(c) /* Force file names to lower case */
607 # define PATH_SEP ':'
610 # define NO_STDIN_FSTAT
613 # define chmod(file, mode) (0)
614 # define OPEN(name, flags, mode) open(name, flags)
615 # define OS_CODE 0x07
617 # define isatty(fd) ((fd) <= 2)
621 #ifdef __50SERIES /* Prime/PRIMOS */
622 # define PATH_SEP '>'
623 # define STDC_HEADERS
628 # define NO_STDIN_FSTAT
629 # define NO_SIZE_CHECK
632 # define casemap(c) tolow(c) /* Force file names to lower case */
633 # define put_char(c) put_byte((c) & 0x7F)
634 # define get_char(c) ascii2pascii(get_byte())
635 # define OS_CODE 0x0F /* temporary, subject to change */
637 # undef SIGTERM /* We don't want a signal handler for SIGTERM */
641 #if defined(pyr) && !defined(NOMEMCPY) /* Pyramid */
642 # define NOMEMCPY /* problem with overlapping copies */
646 # define OS_CODE 0x0a
650 # define NO_ST_INO /* don't rely on inode numbers */
654 /* Common defaults */
657 # define OS_CODE 0x03 /* assume Unix */
661 # define PATH_SEP '/'
665 # define casemap(c) (c)
669 # define OPTIONS_VAR "GZIP"
673 # define Z_SUFFIX ".gz"
677 # define MAX_SUFFIX MAX_EXT_CHARS
679 # define MAX_SUFFIX 30
682 #ifndef MAKE_LEGAL_NAME
683 # ifdef NO_MULTIPLE_DOTS
684 # define MAKE_LEGAL_NAME(name) make_simple_name(name)
686 # define MAKE_LEGAL_NAME(name)
692 /* keep at least MIN_PART chars between dots in a file name. */
696 # define EXPAND(argc,argv)
703 #ifndef SET_BINARY_MODE
704 # define SET_BINARY_MODE(fd)
708 # define OPEN(name, flags, mode) open(name, flags, mode)
712 # define get_char() get_byte()
716 # define put_char(c) put_byte(c)
718 /* bits.c -- output variable-length bit strings
719 * Copyright (C) 1992-1993 Jean-loup Gailly
720 * This is free software; you can redistribute it and/or modify it under the
721 * terms of the GNU General Public License, see the file COPYING.
728 * Output variable-length bit strings. Compression can be done
729 * to a file or to memory. (The latter is not supported in this version.)
733 * The PKZIP "deflate" file format interprets compressed file data
734 * as a sequence of bits. Multi-bit strings in the file may cross
735 * byte boundaries without restriction.
737 * The first bit of each byte is the low-order bit.
739 * The routines in this file allow a variable-length bit value to
740 * be output right-to-left (useful for literal values). For
741 * left-to-right output (useful for code strings from the tree routines),
742 * the bits must have been reversed first with bi_reverse().
744 * For in-memory compression, the compressed bit stream goes directly
745 * into the requested output buffer. The input data is read in blocks
746 * by the mem_read() function. The buffer is limited to 64K on 16 bit
751 * void bi_init (FILE *zipfile)
752 * Initialize the bit string routines.
754 * void send_bits (int value, int length)
755 * Write out a bit string, taking the source bits right to
758 * int bi_reverse (int value, int length)
759 * Reverse the bits of a bit string, taking the source bits left to
760 * right and emitting them right to left.
762 * void bi_windup (void)
763 * Write out any remaining bits in an incomplete byte.
765 * void copy_block(char *buf, unsigned len, int header)
766 * Copy a stored block to the zip file, storing first the length and
767 * its one's complement if requested.
775 /* ===========================================================================
776 * Local data used by the "bit string" routines.
779 local file_t zfile; /* output gzip file */
781 local unsigned short bi_buf;
783 /* Output buffer. bits are inserted starting at the bottom (least significant
787 #define Buf_size (8 * 2*sizeof(char))
788 /* Number of bits used within bi_buf. (bi_buf might be implemented on
789 * more than 16 bits on some systems.)
794 /* Number of valid bits in bi_buf. All bits above the last valid bit
798 int (*read_buf) OF((char *buf, unsigned size));
800 /* Current input function. Set to mem_read for in-memory compression */
803 ulg bits_sent; /* bit length of the compressed data */
806 /* ===========================================================================
807 * Initialize the bit string routines.
809 void bi_init(zipfile)
810 file_t zipfile; /* output zip file, NO_FILE for in-memory compression */
819 /* Set the defaults for file compression. They are set by memcompress
820 * for in-memory compression.
822 if (zfile != NO_FILE) {
823 read_buf = file_read;
827 /* ===========================================================================
828 * Send a value on a given number of bits.
829 * IN assertion: length <= 16 and value fits in length bits.
831 void send_bits(value, length)
832 int value; /* value to send */
833 int length; /* number of bits */
836 Tracev((stderr, " l %2d v %4x ", length, value));
837 Assert(length > 0 && length <= 15, "invalid length");
838 bits_sent += (ulg) length;
840 /* If not enough room in bi_buf, use (valid) bits from bi_buf and
841 * (16 - bi_valid) bits from value, leaving (width - (16-bi_valid))
842 * unused bits in value.
844 if (bi_valid > (int) Buf_size - length) {
845 bi_buf |= (value << bi_valid);
847 bi_buf = (ush) value >> (Buf_size - bi_valid);
848 bi_valid += length - Buf_size;
850 bi_buf |= value << bi_valid;
855 /* ===========================================================================
856 * Reverse the first len bits of a code, using straightforward code (a faster
857 * method would use a table)
858 * IN assertion: 1 <= len <= 15
860 unsigned bi_reverse(code, len)
861 unsigned code; /* the value to invert */
862 int len; /* its bit length */
864 register unsigned res = 0;
868 code >>= 1, res <<= 1;
873 /* ===========================================================================
874 * Write out any remaining bits in an incomplete byte.
880 } else if (bi_valid > 0) {
886 bits_sent = (bits_sent + 7) & ~7;
890 /* ===========================================================================
891 * Copy a stored block to the zip file, storing first the length and its
892 * one's complement if requested.
894 void copy_block(buf, len, header)
895 char *buf; /* the input data */
896 unsigned len; /* its length */
897 int header; /* true if block header must be written */
899 bi_windup(); /* align on byte boundary */
902 put_short((ush) len);
903 put_short((ush) ~ len);
909 bits_sent += (ulg) len << 3;
922 /* deflate.c -- compress data using the deflation algorithm
923 * Copyright (C) 1992-1993 Jean-loup Gailly
924 * This is free software; you can redistribute it and/or modify it under the
925 * terms of the GNU General Public License, see the file COPYING.
931 * Identify new text as repetitions of old text within a fixed-
932 * length sliding window trailing behind the new text.
936 * The "deflation" process depends on being able to identify portions
937 * of the input text which are identical to earlier input (within a
938 * sliding window trailing behind the input currently being processed).
940 * The most straightforward technique turns out to be the fastest for
941 * most input files: try all possible matches and select the longest.
942 * The key feature of this algorithm is that insertions into the string
943 * dictionary are very simple and thus fast, and deletions are avoided
944 * completely. Insertions are performed at each input character, whereas
945 * string matches are performed only when the previous match ends. So it
946 * is preferable to spend more time in matches to allow very fast string
947 * insertions and avoid deletions. The matching algorithm for small
948 * strings is inspired from that of Rabin & Karp. A brute force approach
949 * is used to find longer strings when a small match has been found.
950 * A similar algorithm is used in comic (by Jan-Mark Wams) and freeze
951 * (by Leonid Broukhis).
952 * A previous version of this file used a more sophisticated algorithm
953 * (by Fiala and Greene) which is guaranteed to run in linear amortized
954 * time, but has a larger average cost, uses more memory and is patented.
955 * However the F&G algorithm may be faster for some highly redundant
956 * files if the parameter max_chain_length (described below) is too large.
960 * The idea of lazy evaluation of matches is due to Jan-Mark Wams, and
961 * I found it in 'freeze' written by Leonid Broukhis.
962 * Thanks to many info-zippers for bug reports and testing.
966 * APPNOTE.TXT documentation file in PKZIP 1.93a distribution.
968 * A description of the Rabin and Karp algorithm is given in the book
969 * "Algorithms" by R. Sedgewick, Addison-Wesley, p252.
971 * Fiala,E.R., and Greene,D.H.
972 * Data Compression with Finite Windows, Comm.ACM, 32,4 (1989) 490-595
976 * void lm_init (int pack_level, ush *flags)
977 * Initialize the "longest match" routines for a new file
980 * Processes a new input file and return its compressed length. Sets
981 * the compressed length, crc, deflate flags and internal file
987 /* ===========================================================================
988 * Configuration parameters
991 /* Compile with MEDIUM_MEM to reduce the memory requirements or
992 * with SMALL_MEM to use as little memory as possible. Use BIG_MEM if the
993 * entire input file can be held in memory (not possible on 16 bit systems).
994 * Warning: defining these symbols affects HASH_BITS (see below) and thus
995 * affects the compression ratio. The compressed output
996 * is still correct, and might even be smaller in some cases.
1000 # define HASH_BITS 13 /* Number of bits used to hash strings */
1003 # define HASH_BITS 14
1006 # define HASH_BITS 15
1007 /* For portability to 16 bit machines, do not use values above 15. */
1010 /* To save space (see unlzw.c), we overlay prev+head with tab_prefix and
1011 * window with tab_suffix. Check that we can do this:
1013 #if (WSIZE<<1) > (1<<BITS)
1014 error:cannot overlay window with tab_suffix and prev with tab_prefix0
1016 #if HASH_BITS > BITS-1
1017 error:cannot overlay head with tab_prefix1
1019 #define HASH_SIZE (unsigned)(1<<HASH_BITS)
1020 #define HASH_MASK (HASH_SIZE-1)
1021 #define WMASK (WSIZE-1)
1022 /* HASH_SIZE and WSIZE must be powers of two */
1024 /* Tail of hash chains */
1027 /* speed options for the general purpose bit flag */
1029 # define TOO_FAR 4096
1031 /* Matches of length 3 are discarded if their distance exceeds TOO_FAR */
1032 /* ===========================================================================
1033 * Local data used by the "longest match" routines.
1036 typedef unsigned IPos;
1038 /* A Pos is an index in the character window. We use short instead of int to
1039 * save space in the various tables. IPos is used only for parameter passing.
1042 /* DECLARE(uch, window, 2L*WSIZE); */
1043 /* Sliding window. Input bytes are read into the second half of the window,
1044 * and move to the first half later to keep a dictionary of at least WSIZE
1045 * bytes. With this organization, matches are limited to a distance of
1046 * WSIZE-MAX_MATCH bytes, but this ensures that IO is always
1047 * performed with a length multiple of the block size. Also, it limits
1048 * the window size to 64K, which is quite useful on MSDOS.
1049 * To do: limit the window size to WSIZE+BSZ if SMALL_MEM (the code would
1050 * be less efficient).
1053 /* DECLARE(Pos, prev, WSIZE); */
1054 /* Link to older string with same hash index. To limit the size of this
1055 * array to 64K, this link is maintained only for the last 32K strings.
1056 * An index in this array is thus a window index modulo 32K.
1059 /* DECLARE(Pos, head, 1<<HASH_BITS); */
1060 /* Heads of the hash chains or NIL. */
1062 ulg window_size = (ulg) 2 * WSIZE;
1064 /* window size, 2*WSIZE except for MMAP or BIG_MEM, where it is the
1065 * input file length plus MIN_LOOKAHEAD.
1070 /* window position at the beginning of the current output block. Gets
1071 * negative when the window is moved backwards.
1074 local unsigned ins_h; /* hash index of string to be inserted */
1076 #define H_SHIFT ((HASH_BITS+MIN_MATCH-1)/MIN_MATCH)
1077 /* Number of bits by which ins_h and del_h must be shifted at each
1078 * input step. It must be such that after MIN_MATCH steps, the oldest
1079 * byte no longer takes part in the hash key, that is:
1080 * H_SHIFT * MIN_MATCH >= HASH_BITS
1083 unsigned int near prev_length;
1085 /* Length of the best match at previous step. Matches not greater than this
1086 * are discarded. This is used in the lazy match evaluation.
1089 unsigned near strstart; /* start of string to insert */
1090 unsigned near match_start; /* start of matching string */
1091 local int eofile; /* flag set at end of input file */
1092 local unsigned lookahead; /* number of valid bytes ahead in window */
1094 unsigned near max_chain_length;
1096 /* To speed up deflation, hash chains are never searched beyond this length.
1097 * A higher limit improves compression ratio but degrades the speed.
1100 local unsigned int max_lazy_match;
1102 /* Attempt to find a better match only when the current match is strictly
1103 * smaller than this value. This mechanism is used only for compression
1106 #define max_insert_length max_lazy_match
1107 /* Insert new strings in the hash table only if the match length
1108 * is not greater than this length. This saves time but degrades compression.
1109 * max_insert_length is used only for compression levels <= 3.
1112 unsigned near good_match;
1114 /* Use a faster search when the previous match is longer than this */
1117 /* Values for max_lazy_match, good_match and max_chain_length, depending on
1118 * the desired pack level (0..9). The values given below have been tuned to
1119 * exclude worst case performance for pathological files. Better values may be
1120 * found for specific files.
1123 typedef struct config {
1124 ush good_length; /* reduce lazy search above this match length */
1125 ush max_lazy; /* do not perform lazy search above this match length */
1126 ush nice_length; /* quit search above this match length */
1131 # define nice_match MAX_MATCH
1133 int near nice_match; /* Stop searching when current match exceeds this */
1136 local config configuration_table =
1137 /* 9 */ { 32, 258, 258, 4096 };
1138 /* maximum compression */
1140 /* Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4
1141 * For deflate_fast() (levels <= 3) good is ignored and lazy has a different
1146 /* result of memcmp for equal strings */
1148 /* ===========================================================================
1149 * Prototypes for local functions.
1151 local void fill_window OF((void));
1153 int longest_match OF((IPos cur_match));
1156 void match_init OF((void)); /* asm code initialization */
1160 local void check_match OF((IPos start, IPos match, int length));
1163 /* ===========================================================================
1164 * Update a hash value with the given input byte
1165 * IN assertion: all calls to to UPDATE_HASH are made with consecutive
1166 * input characters, so that a running hash key can be computed from the
1167 * previous key instead of complete recalculation each time.
1169 #define UPDATE_HASH(h,c) (h = (((h)<<H_SHIFT) ^ (c)) & HASH_MASK)
1171 /* ===========================================================================
1172 * Insert string s in the dictionary and set match_head to the previous head
1173 * of the hash chain (the most recent string with same hash key). Return
1174 * the previous length of the hash chain.
1175 * IN assertion: all calls to to INSERT_STRING are made with consecutive
1176 * input characters and the first MIN_MATCH bytes of s are valid
1177 * (except for the last MIN_MATCH-1 bytes of the input file).
1179 #define INSERT_STRING(s, match_head) \
1180 (UPDATE_HASH(ins_h, window[(s) + MIN_MATCH-1]), \
1181 prev[(s) & WMASK] = match_head = head[ins_h], \
1184 /* ===========================================================================
1185 * Initialize the "longest match" routines for a new file
1188 ush *flags; /* general purpose bit flag */
1190 register unsigned j;
1192 /* Initialize the hash table. */
1193 #if defined(MAXSEG_64K) && HASH_BITS == 15
1194 for (j = 0; j < HASH_SIZE; j++)
1197 memzero((char *) head, HASH_SIZE * sizeof(*head));
1199 /* prev will be initialized on the fly */
1201 /* Set the default configuration parameters:
1203 max_lazy_match = configuration_table.max_lazy;
1204 good_match = configuration_table.good_length;
1206 nice_match = configuration_table.nice_length;
1208 max_chain_length = configuration_table.max_chain;
1210 /* ??? reduce max_chain_length for binary files */
1215 match_init(); /* initialize the asm code */
1218 lookahead = read_buf((char *) window,
1219 sizeof(int) <= 2 ? (unsigned) WSIZE : 2 * WSIZE);
1221 if (lookahead == 0 || lookahead == (unsigned) EOF) {
1222 eofile = 1, lookahead = 0;
1226 /* Make sure that we always have enough lookahead. This is important
1227 * if input comes from a device such as a tty.
1229 while (lookahead < MIN_LOOKAHEAD && !eofile)
1233 for (j = 0; j < MIN_MATCH - 1; j++)
1234 UPDATE_HASH(ins_h, window[j]);
1235 /* If lookahead < MIN_MATCH, ins_h is garbage, but this is
1236 * not important since only literal bytes will be emitted.
1240 /* ===========================================================================
1241 * Set match_start to the longest match starting at the given string and
1242 * return its length. Matches shorter or equal to prev_length are discarded,
1243 * in which case the result is equal to prev_length and match_start is
1245 * IN assertions: cur_match is the head of the hash chain for the current
1246 * string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1
1249 /* For MSDOS, OS/2 and 386 Unix, an optimized version is in match.asm or
1250 * match.s. The code is functionally equivalent, so you can use the C version
1253 int longest_match(cur_match)
1254 IPos cur_match; /* current match */
1256 unsigned chain_length = max_chain_length; /* max hash chain length */
1257 register uch *scan = window + strstart; /* current string */
1258 register uch *match; /* matched string */
1259 register int len; /* length of current match */
1260 int best_len = prev_length; /* best match length so far */
1263 strstart > (IPos) MAX_DIST ? strstart - (IPos) MAX_DIST : NIL;
1264 /* Stop when cur_match becomes <= limit. To simplify the code,
1265 * we prevent matches with the string of window index 0.
1268 /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.
1269 * It is easy to get rid of this optimization if necessary.
1271 #if HASH_BITS < 8 || MAX_MATCH != 258
1272 error:Code too clever
1275 /* Compare two bytes at a time. Note: this is not always beneficial.
1276 * Try with and without -DUNALIGNED_OK to check.
1278 register uch *strend = window + strstart + MAX_MATCH - 1;
1279 register ush scan_start = *(ush *) scan;
1280 register ush scan_end = *(ush *) (scan + best_len - 1);
1282 register uch *strend = window + strstart + MAX_MATCH;
1283 register uch scan_end1 = scan[best_len - 1];
1284 register uch scan_end = scan[best_len];
1287 /* Do not waste too much time if we already have a good match: */
1288 if (prev_length >= good_match) {
1291 Assert(strstart <= window_size - MIN_LOOKAHEAD,
1292 "insufficient lookahead");
1295 Assert(cur_match < strstart, "no future");
1296 match = window + cur_match;
1298 /* Skip to next match if the match length cannot increase
1299 * or if the match length is less than 2:
1301 #if (defined(UNALIGNED_OK) && MAX_MATCH == 258)
1302 /* This code assumes sizeof(unsigned short) == 2. Do not use
1303 * UNALIGNED_OK if your compiler uses a different size.
1305 if (*(ush *) (match + best_len - 1) != scan_end ||
1306 *(ush *) match != scan_start)
1309 /* It is not necessary to compare scan[2] and match[2] since they are
1310 * always equal when the other bytes match, given that the hash keys
1311 * are equal and that HASH_BITS >= 8. Compare 2 bytes at a time at
1312 * strstart+3, +5, ... up to strstart+257. We check for insufficient
1313 * lookahead only every 4th comparison; the 128th check will be made
1314 * at strstart+257. If MAX_MATCH-2 is not a multiple of 8, it is
1315 * necessary to put more guard bytes at the end of the window, or
1316 * to check more often for insufficient lookahead.
1320 } while (*(ush *) (scan += 2) == *(ush *) (match += 2) &&
1321 *(ush *) (scan += 2) == *(ush *) (match += 2) &&
1322 *(ush *) (scan += 2) == *(ush *) (match += 2) &&
1323 *(ush *) (scan += 2) == *(ush *) (match += 2) &&
1325 /* The funny "do {}" generates better code on most compilers */
1327 /* Here, scan <= window+strstart+257 */
1328 Assert(scan <= window + (unsigned) (window_size - 1), "wild scan");
1329 if (*scan == *match)
1332 len = (MAX_MATCH - 1) - (int) (strend - scan);
1333 scan = strend - (MAX_MATCH - 1);
1335 #else /* UNALIGNED_OK */
1337 if (match[best_len] != scan_end ||
1338 match[best_len - 1] != scan_end1 ||
1339 *match != *scan || *++match != scan[1])
1342 /* The check at best_len-1 can be removed because it will be made
1343 * again later. (This heuristic is not always a win.)
1344 * It is not necessary to compare scan[2] and match[2] since they
1345 * are always equal when the other bytes match, given that
1346 * the hash keys are equal and that HASH_BITS >= 8.
1350 /* We check for insufficient lookahead only every 8th comparison;
1351 * the 256th check will be made at strstart+258.
1354 } while (*++scan == *++match && *++scan == *++match &&
1355 *++scan == *++match && *++scan == *++match &&
1356 *++scan == *++match && *++scan == *++match &&
1357 *++scan == *++match && *++scan == *++match &&
1360 len = MAX_MATCH - (int) (strend - scan);
1361 scan = strend - MAX_MATCH;
1363 #endif /* UNALIGNED_OK */
1365 if (len > best_len) {
1366 match_start = cur_match;
1368 if (len >= nice_match)
1371 scan_end = *(ush *) (scan + best_len - 1);
1373 scan_end1 = scan[best_len - 1];
1374 scan_end = scan[best_len];
1377 } while ((cur_match = prev[cur_match & WMASK]) > limit
1378 && --chain_length != 0);
1385 /* ===========================================================================
1386 * Check that the match at match_start is indeed a match.
1388 local void check_match(start, match, length)
1392 /* check that the match is indeed a match */
1393 if (memcmp((char *) window + match,
1394 (char *) window + start, length) != EQUAL) {
1396 " start %d, match %d, length %d\n", start, match, length);
1397 errorMsg("invalid match");
1400 fprintf(stderr, "\\[%d,%d]", start - match, length);
1402 putc(window[start++], stderr);
1403 } while (--length != 0);
1407 # define check_match(start, match, length)
1410 /* ===========================================================================
1411 * Fill the window when the lookahead becomes insufficient.
1412 * Updates strstart and lookahead, and sets eofile if end of input file.
1413 * IN assertion: lookahead < MIN_LOOKAHEAD && strstart + lookahead > 0
1414 * OUT assertions: at least one byte has been read, or eofile is set;
1415 * file reads are performed for at least two bytes (required for the
1416 * translate_eol option).
1418 local void fill_window()
1420 register unsigned n, m;
1423 (unsigned) (window_size - (ulg) lookahead - (ulg) strstart);
1424 /* Amount of free space at the end of the window. */
1426 /* If the window is almost full and there is insufficient lookahead,
1427 * move the upper half to the lower one to make room in the upper half.
1429 if (more == (unsigned) EOF) {
1430 /* Very unlikely, but possible on 16 bit machine if strstart == 0
1431 * and lookahead == 1 (input done one byte at time)
1434 } else if (strstart >= WSIZE + MAX_DIST) {
1435 /* By the IN assertion, the window is not empty so we can't confuse
1436 * more == 0 with more == 64K on a 16 bit machine.
1438 Assert(window_size == (ulg) 2 * WSIZE, "no sliding with BIG_MEM");
1440 memcpy((char *) window, (char *) window + WSIZE, (unsigned) WSIZE);
1441 match_start -= WSIZE;
1442 strstart -= WSIZE; /* we now have strstart >= MAX_DIST: */
1444 block_start -= (long) WSIZE;
1446 for (n = 0; n < HASH_SIZE; n++) {
1448 head[n] = (Pos) (m >= WSIZE ? m - WSIZE : NIL);
1450 for (n = 0; n < WSIZE; n++) {
1452 prev[n] = (Pos) (m >= WSIZE ? m - WSIZE : NIL);
1453 /* If n is not on any hash chain, prev[n] is garbage but
1454 * its value will never be used.
1459 /* At this point, more >= 2 */
1461 n = read_buf((char *) window + strstart + lookahead, more);
1462 if (n == 0 || n == (unsigned) EOF) {
1470 /* ===========================================================================
1471 * Flush the current block, with given end-of-file flag.
1472 * IN assertion: strstart is set to the end of the current match.
1474 #define FLUSH_BLOCK(eof) \
1475 flush_block(block_start >= 0L ? (char*)&window[(unsigned)block_start] : \
1476 (char*)NULL, (long)strstart - block_start, (eof))
1478 /* ===========================================================================
1479 * Same as above, but achieves better compression. We use a lazy
1480 * evaluation for matches: a match is finally adopted only if there is
1481 * no better match at the next window position.
1485 IPos hash_head; /* head of hash chain */
1486 IPos prev_match; /* previous match */
1487 int flush; /* set if current block must be flushed */
1488 int match_available = 0; /* set if previous match exists */
1489 register unsigned match_length = MIN_MATCH - 1; /* length of best match */
1492 extern long isize; /* byte length of input file, for debug only */
1495 /* Process the input block. */
1496 while (lookahead != 0) {
1497 /* Insert the string window[strstart .. strstart+2] in the
1498 * dictionary, and set hash_head to the head of the hash chain:
1500 INSERT_STRING(strstart, hash_head);
1502 /* Find the longest match, discarding those <= prev_length.
1504 prev_length = match_length, prev_match = match_start;
1505 match_length = MIN_MATCH - 1;
1507 if (hash_head != NIL && prev_length < max_lazy_match &&
1508 strstart - hash_head <= MAX_DIST) {
1509 /* To simplify the code, we prevent matches with the string
1510 * of window index 0 (in particular we have to avoid a match
1511 * of the string with itself at the start of the input file).
1513 match_length = longest_match(hash_head);
1514 /* longest_match() sets match_start */
1515 if (match_length > lookahead)
1516 match_length = lookahead;
1518 /* Ignore a length 3 match if it is too distant: */
1519 if (match_length == MIN_MATCH
1520 && strstart - match_start > TOO_FAR) {
1521 /* If prev_match is also MIN_MATCH, match_start is garbage
1522 * but we will ignore the current match anyway.
1527 /* If there was a match at the previous step and the current
1528 * match is not better, output the previous match:
1530 if (prev_length >= MIN_MATCH && match_length <= prev_length) {
1532 check_match(strstart - 1, prev_match, prev_length);
1535 ct_tally(strstart - 1 - prev_match,
1536 prev_length - MIN_MATCH);
1538 /* Insert in hash table all strings up to the end of the match.
1539 * strstart-1 and strstart are already inserted.
1541 lookahead -= prev_length - 1;
1545 INSERT_STRING(strstart, hash_head);
1546 /* strstart never exceeds WSIZE-MAX_MATCH, so there are
1547 * always MIN_MATCH bytes ahead. If lookahead < MIN_MATCH
1548 * these bytes are garbage, but it does not matter since the
1549 * next lookahead bytes will always be emitted as literals.
1551 } while (--prev_length != 0);
1552 match_available = 0;
1553 match_length = MIN_MATCH - 1;
1556 FLUSH_BLOCK(0), block_start = strstart;
1558 } else if (match_available) {
1559 /* If there was no match at the previous position, output a
1560 * single literal. If there was a match but the current match
1561 * is longer, truncate the previous match to a single literal.
1563 Tracevv((stderr, "%c", window[strstart - 1]));
1564 if (ct_tally(0, window[strstart - 1])) {
1565 FLUSH_BLOCK(0), block_start = strstart;
1570 /* There is no previous match to compare with, wait for
1571 * the next step to decide.
1573 match_available = 1;
1577 Assert(strstart <= isize && lookahead <= isize, "a bit too far");
1579 /* Make sure that we always have enough lookahead, except
1580 * at the end of the input file. We need MAX_MATCH bytes
1581 * for the next match, plus MIN_MATCH bytes to insert the
1582 * string following the next match.
1584 while (lookahead < MIN_LOOKAHEAD && !eofile)
1587 if (match_available)
1588 ct_tally(0, window[strstart - 1]);
1590 return FLUSH_BLOCK(1); /* eof */
1593 /* gzip (GNU zip) -- compress files with zip algorithm and 'compress' interface
1594 * Copyright (C) 1992-1993 Jean-loup Gailly
1595 * The unzip code was written and put in the public domain by Mark Adler.
1596 * Portions of the lzw code are derived from the public domain 'compress'
1597 * written by Spencer Thomas, Joe Orost, James Woods, Jim McKie, Steve Davies,
1598 * Ken Turkowski, Dave Mack and Peter Jannesen.
1600 * See the license_msg below and the file COPYING for the software license.
1601 * See the file algorithm.doc for the compression algorithms and file formats.
1604 /* Compress files with zip algorithm and 'compress' interface.
1605 * See usage() and help() functions below for all options.
1607 * file.gz: compressed file with same mode, owner, and utimes
1608 * or stdout with -c option or if stdin used as input.
1609 * If the output file name had to be truncated, the original name is kept
1610 * in the compressed file.
1611 * On MSDOS, file.tmp -> file.tmz. On VMS, file.tmp -> file.tmp-gz.
1613 * Using gz on MSDOS would create too many file name conflicts. For
1614 * example, foo.txt -> foo.tgz (.tgz must be reserved as shorthand for
1615 * tar.gz). Similarly, foo.dir and foo.doc would both be mapped to foo.dgz.
1616 * I also considered 12345678.txt -> 12345txt.gz but this truncates the name
1617 * too heavily. There is no ideal solution given the MSDOS 8+3 limitation.
1619 * For the meaning of all compilation flags, see comments in Makefile.in.
1623 #include <sys/types.h>
1625 #include <sys/stat.h>
1631 # include <sys/time.h>
1640 #ifdef HAVE_UNISTD_H
1641 # include <unistd.h>
1644 #if defined(STDC_HEADERS) || !defined(NO_STDLIB_H)
1645 # include <stdlib.h>
1651 # include <dirent.h>
1652 typedef struct dirent dir_type;
1654 # define NLENGTH(dirent) ((int)strlen((dirent)->d_name))
1655 # define DIR_OPT "DIRENT"
1657 # define NLENGTH(dirent) ((dirent)->d_namlen)
1659 # include <sys/dir.h>
1660 typedef struct direct dir_type;
1662 # define DIR_OPT "SYSDIR"
1665 # include <sys/ndir.h>
1666 typedef struct direct dir_type;
1668 # define DIR_OPT "SYSNDIR"
1672 typedef struct direct dir_type;
1674 # define DIR_OPT "NDIR"
1677 # define DIR_OPT "NO_DIR"
1686 # define TIME_OPT "UTIME"
1688 # ifdef HAVE_SYS_UTIME_H
1689 # include <sys/utime.h>
1690 # define TIME_OPT "SYS_UTIME"
1697 # define TIME_OPT ""
1701 # define TIME_OPT "NO_UTIME"
1704 #if !defined(S_ISDIR) && defined(S_IFDIR)
1705 # define S_ISDIR(m) (((m) & S_IFMT) == S_IFDIR)
1707 #if !defined(S_ISREG) && defined(S_IFREG)
1708 # define S_ISREG(m) (((m) & S_IFMT) == S_IFREG)
1711 typedef RETSIGTYPE(*sig_type) OF((int));
1714 # define O_BINARY 0 /* creation mode for open() */
1718 /* Pure BSD system? */
1719 # include <sys/file.h>
1721 # define O_CREAT FCREAT
1724 # define O_EXCL FEXCL
1729 # define S_IRUSR 0400
1732 # define S_IWUSR 0200
1734 #define RW_USER (S_IRUSR | S_IWUSR) /* creation mode for open() */
1736 #ifndef MAX_PATH_LEN
1737 # define MAX_PATH_LEN 1024 /* max pathname length */
1746 off_t lseek OF((int fd, off_t offset, int whence));
1749 /* Separator for file name parts (see shorten_name()) */
1750 #ifdef NO_MULTIPLE_DOTS
1751 # define PART_SEP "-"
1753 # define PART_SEP "."
1756 /* global buffers */
1758 DECLARE(uch, inbuf, INBUFSIZ + INBUF_EXTRA);
1759 DECLARE(uch, outbuf, OUTBUFSIZ + OUTBUF_EXTRA);
1760 DECLARE(ush, d_buf, DIST_BUFSIZE);
1761 DECLARE(uch, window, 2L * WSIZE);
1763 DECLARE(ush, tab_prefix, 1L << BITS);
1765 DECLARE(ush, tab_prefix0, 1L << (BITS - 1));
1766 DECLARE(ush, tab_prefix1, 1L << (BITS - 1));
1769 /* local variables */
1771 int ascii = 0; /* convert end-of-lines to local OS conventions */
1772 int decompress = 0; /* decompress (-d) */
1773 int no_name = -1; /* don't save or restore the original file name */
1774 int no_time = -1; /* don't save or restore the original file time */
1775 int foreground; /* set if program run in foreground */
1776 char *progname; /* program name */
1777 static int method = DEFLATED; /* compression method */
1778 static int exit_code = OK; /* program exit code */
1779 int save_orig_name; /* set if original name must be saved */
1780 int last_member; /* set for .zip and .Z files */
1781 int part_nb; /* number of parts in .gz file */
1782 long time_stamp; /* original time stamp (modification time) */
1783 long ifile_size; /* input file size, -1 for devices (debug only) */
1784 char *env; /* contents of GZIP env variable */
1785 char **args = NULL; /* argv pointer if GZIP env variable defined */
1786 char z_suffix[MAX_SUFFIX + 1]; /* default suffix (can be set with --suffix) */
1787 int z_len; /* strlen(z_suffix) */
1789 long bytes_in; /* number of input bytes */
1790 long bytes_out; /* number of output bytes */
1791 char ifname[MAX_PATH_LEN]; /* input file name */
1792 char ofname[MAX_PATH_LEN]; /* output file name */
1793 int remove_ofname = 0; /* remove output file on error */
1794 struct stat istat; /* status for input file */
1795 int ifd; /* input file descriptor */
1796 int ofd; /* output file descriptor */
1797 unsigned insize; /* valid bytes in inbuf */
1798 unsigned inptr; /* index of next byte to be processed in inbuf */
1799 unsigned outcnt; /* bytes in output buffer */
1801 /* local functions */
1803 #define strequ(s1, s2) (strcmp((s1),(s2)) == 0)
1805 /* ======================================================================== */
1806 // int main (argc, argv)
1809 int gzip_main(int argc, char **argv)
1814 struct stat statBuf;
1822 /* Parse any options */
1823 while (--argc > 0 && **(++argv) == '-') {
1824 if (*((*argv) + 1) == '\0') {
1828 while (*(++(*argv))) {
1839 foreground = signal(SIGINT, SIG_IGN) != SIG_IGN;
1841 (void) signal(SIGINT, (sig_type) abort_gzip);
1844 if (signal(SIGTERM, SIG_IGN) != SIG_IGN) {
1845 (void) signal(SIGTERM, (sig_type) abort_gzip);
1849 if (signal(SIGHUP, SIG_IGN) != SIG_IGN) {
1850 (void) signal(SIGHUP, (sig_type) abort_gzip);
1854 strncpy(z_suffix, Z_SUFFIX, sizeof(z_suffix) - 1);
1855 z_len = strlen(z_suffix);
1857 /* Allocate all global buffers (for DYN_ALLOC option) */
1858 ALLOC(uch, inbuf, INBUFSIZ + INBUF_EXTRA);
1859 ALLOC(uch, outbuf, OUTBUFSIZ + OUTBUF_EXTRA);
1860 ALLOC(ush, d_buf, DIST_BUFSIZE);
1861 ALLOC(uch, window, 2L * WSIZE);
1863 ALLOC(ush, tab_prefix, 1L << BITS);
1865 ALLOC(ush, tab_prefix0, 1L << (BITS - 1));
1866 ALLOC(ush, tab_prefix1, 1L << (BITS - 1));
1869 if (fromstdin == 1) {
1870 strcpy(ofname, "stdin");
1872 inFileNum = fileno(stdin);
1873 time_stamp = 0; /* time unknown by default */
1874 ifile_size = -1L; /* convention for unknown size */
1876 /* Open up the input file */
1879 strncpy(ifname, *argv, MAX_PATH_LEN);
1881 /* Open input fille */
1882 inFileNum = open(ifname, O_RDONLY);
1883 if (inFileNum < 0) {
1887 /* Get the time stamp on the input file. */
1888 result = stat(ifname, &statBuf);
1893 time_stamp = statBuf.st_ctime;
1894 ifile_size = statBuf.st_size;
1898 if (tostdout == 1) {
1899 /* And get to work */
1900 strcpy(ofname, "stdout");
1901 outFileNum = fileno(stdout);
1902 SET_BINARY_MODE(fileno(stdout));
1904 clear_bufs(); /* clear input and output buffers */
1907 /* Actually do the compression/decompression. */
1908 zip(inFileNum, outFileNum);
1912 /* And get to work */
1913 strncpy(ofname, ifname, MAX_PATH_LEN - 4);
1914 strcat(ofname, ".gz");
1917 /* Open output fille */
1918 #if (__GLIBC__ >= 2) && (__GLIBC_MINOR__ >= 1)
1919 outFileNum = open(ofname, O_RDWR | O_CREAT | O_EXCL | O_NOFOLLOW);
1921 outFileNum = open(ofname, O_RDWR | O_CREAT | O_EXCL);
1923 if (outFileNum < 0) {
1927 SET_BINARY_MODE(outFileNum);
1928 /* Set permissions on the file */
1929 fchmod(outFileNum, statBuf.st_mode);
1931 clear_bufs(); /* clear input and output buffers */
1934 /* Actually do the compression/decompression. */
1935 result = zip(inFileNum, outFileNum);
1938 /* Delete the original file */
1940 delFileName = ifname;
1942 delFileName = ofname;
1944 if (unlink(delFileName) < 0) {
1945 perror(delFileName);
1953 /* trees.c -- output deflated data using Huffman coding
1954 * Copyright (C) 1992-1993 Jean-loup Gailly
1955 * This is free software; you can redistribute it and/or modify it under the
1956 * terms of the GNU General Public License, see the file COPYING.
1962 * Encode various sets of source values using variable-length
1963 * binary code trees.
1967 * The PKZIP "deflation" process uses several Huffman trees. The more
1968 * common source values are represented by shorter bit sequences.
1970 * Each code tree is stored in the ZIP file in a compressed form
1971 * which is itself a Huffman encoding of the lengths of
1972 * all the code strings (in ascending order by source values).
1973 * The actual code strings are reconstructed from the lengths in
1974 * the UNZIP process, as described in the "application note"
1975 * (APPNOTE.TXT) distributed as part of PKWARE's PKZIP program.
1980 * Data Compression: Techniques and Applications, pp. 53-55.
1981 * Lifetime Learning Publications, 1985. ISBN 0-534-03418-7.
1984 * Data Compression: Methods and Theory, pp. 49-50.
1985 * Computer Science Press, 1988. ISBN 0-7167-8156-5.
1989 * Addison-Wesley, 1983. ISBN 0-201-06672-6.
1993 * void ct_init (ush *attr, int *methodp)
1994 * Allocate the match buffer, initialize the various tables and save
1995 * the location of the internal file attribute (ascii/binary) and
1996 * method (DEFLATE/STORE)
1998 * void ct_tally (int dist, int lc);
1999 * Save the match info and tally the frequency counts.
2001 * long flush_block (char *buf, ulg stored_len, int eof)
2002 * Determine the best encoding for the current block: dynamic trees,
2003 * static trees or store, and output the encoded block to the zip
2004 * file. Returns the total compressed length for the file so far.
2010 /* ===========================================================================
2015 /* All codes must not exceed MAX_BITS bits */
2017 #define MAX_BL_BITS 7
2018 /* Bit length codes must not exceed MAX_BL_BITS bits */
2020 #define LENGTH_CODES 29
2021 /* number of length codes, not counting the special END_BLOCK code */
2023 #define LITERALS 256
2024 /* number of literal bytes 0..255 */
2026 #define END_BLOCK 256
2027 /* end of block literal code */
2029 #define L_CODES (LITERALS+1+LENGTH_CODES)
2030 /* number of Literal or Length codes, including the END_BLOCK code */
2033 /* number of distance codes */
2036 /* number of codes used to transfer the bit lengths */
2039 local int near extra_lbits[LENGTH_CODES] /* extra bits for each length code */
2040 = { 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4,
2041 4, 4, 5, 5, 5, 5, 0 };
2043 local int near extra_dbits[D_CODES] /* extra bits for each distance code */
2044 = { 0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9,
2045 10, 10, 11, 11, 12, 12, 13, 13 };
2047 local int near extra_blbits[BL_CODES] /* extra bits for each bit length code */
2048 = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3, 7 };
2050 #define STORED_BLOCK 0
2051 #define STATIC_TREES 1
2053 /* The three kinds of block type */
2057 # define LIT_BUFSIZE 0x2000
2060 # define LIT_BUFSIZE 0x4000
2062 # define LIT_BUFSIZE 0x8000
2066 #ifndef DIST_BUFSIZE
2067 # define DIST_BUFSIZE LIT_BUFSIZE
2069 /* Sizes of match buffers for literals/lengths and distances. There are
2070 * 4 reasons for limiting LIT_BUFSIZE to 64K:
2071 * - frequencies can be kept in 16 bit counters
2072 * - if compression is not successful for the first block, all input data is
2073 * still in the window so we can still emit a stored block even when input
2074 * comes from standard input. (This can also be done for all blocks if
2075 * LIT_BUFSIZE is not greater than 32K.)
2076 * - if compression is not successful for a file smaller than 64K, we can
2077 * even emit a stored file instead of a stored block (saving 5 bytes).
2078 * - creating new Huffman trees less frequently may not provide fast
2079 * adaptation to changes in the input data statistics. (Take for
2080 * example a binary file with poorly compressible code followed by
2081 * a highly compressible string table.) Smaller buffer sizes give
2082 * fast adaptation but have of course the overhead of transmitting trees
2084 * - I can't count above 4
2085 * The current code is general and allows DIST_BUFSIZE < LIT_BUFSIZE (to save
2086 * memory at the expense of compression). Some optimizations would be possible
2087 * if we rely on DIST_BUFSIZE == LIT_BUFSIZE.
2089 #if LIT_BUFSIZE > INBUFSIZ
2090 error cannot overlay l_buf and inbuf
2093 /* repeat previous bit length 3-6 times (2 bits of repeat count) */
2094 #define REPZ_3_10 17
2095 /* repeat a zero length 3-10 times (3 bits of repeat count) */
2096 #define REPZ_11_138 18
2097 /* repeat a zero length 11-138 times (7 bits of repeat count) *//* ===========================================================================
2099 *//* Data structure describing a single value and its code string. */ typedef struct ct_data {
2101 ush freq; /* frequency count */
2102 ush code; /* bit string */
2105 ush dad; /* father node in Huffman tree */
2106 ush len; /* length of bit string */
2110 #define Freq fc.freq
2111 #define Code fc.code
2115 #define HEAP_SIZE (2*L_CODES+1)
2116 /* maximum heap size */
2118 local ct_data near dyn_ltree[HEAP_SIZE]; /* literal and length tree */
2119 local ct_data near dyn_dtree[2 * D_CODES + 1]; /* distance tree */
2121 local ct_data near static_ltree[L_CODES + 2];
2123 /* The static literal tree. Since the bit lengths are imposed, there is no
2124 * need for the L_CODES extra codes used during heap construction. However
2125 * The codes 286 and 287 are needed to build a canonical tree (see ct_init
2129 local ct_data near static_dtree[D_CODES];
2131 /* The static distance tree. (Actually a trivial tree since all codes use
2135 local ct_data near bl_tree[2 * BL_CODES + 1];
2137 /* Huffman tree for the bit lengths */
2139 typedef struct tree_desc {
2140 ct_data near *dyn_tree; /* the dynamic tree */
2141 ct_data near *static_tree; /* corresponding static tree or NULL */
2142 int near *extra_bits; /* extra bits for each code or NULL */
2143 int extra_base; /* base index for extra_bits */
2144 int elems; /* max number of elements in the tree */
2145 int max_length; /* max bit length for the codes */
2146 int max_code; /* largest code with non zero frequency */
2149 local tree_desc near l_desc =
2150 { dyn_ltree, static_ltree, extra_lbits, LITERALS + 1, L_CODES,
2153 local tree_desc near d_desc =
2154 { dyn_dtree, static_dtree, extra_dbits, 0, D_CODES, MAX_BITS, 0 };
2156 local tree_desc near bl_desc =
2157 { bl_tree, (ct_data near *) 0, extra_blbits, 0, BL_CODES, MAX_BL_BITS,
2161 local ush near bl_count[MAX_BITS + 1];
2163 /* number of codes at each bit length for an optimal tree */
2165 local uch near bl_order[BL_CODES]
2166 = { 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 };
2168 /* The lengths of the bit length codes are sent in order of decreasing
2169 * probability, to avoid transmitting the lengths for unused bit length codes.
2172 local int near heap[2 * L_CODES + 1]; /* heap used to build the Huffman trees */
2173 local int heap_len; /* number of elements in the heap */
2174 local int heap_max; /* element of largest frequency */
2176 /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.
2177 * The same heap array is used to build all trees.
2180 local uch near depth[2 * L_CODES + 1];
2182 /* Depth of each subtree used as tie breaker for trees of equal frequency */
2184 local uch length_code[MAX_MATCH - MIN_MATCH + 1];
2186 /* length code for each normalized match length (0 == MIN_MATCH) */
2188 local uch dist_code[512];
2190 /* distance codes. The first 256 values correspond to the distances
2191 * 3 .. 258, the last 256 values correspond to the top 8 bits of
2192 * the 15 bit distances.
2195 local int near base_length[LENGTH_CODES];
2197 /* First normalized length for each code (0 = MIN_MATCH) */
2199 local int near base_dist[D_CODES];
2201 /* First normalized distance for each code (0 = distance of 1) */
2204 /* DECLARE(uch, l_buf, LIT_BUFSIZE); buffer for literals or lengths */
2206 /* DECLARE(ush, d_buf, DIST_BUFSIZE); buffer for distances */
2208 local uch near flag_buf[(LIT_BUFSIZE / 8)];
2210 /* flag_buf is a bit array distinguishing literals from lengths in
2211 * l_buf, thus indicating the presence or absence of a distance.
2214 local unsigned last_lit; /* running index in l_buf */
2215 local unsigned last_dist; /* running index in d_buf */
2216 local unsigned last_flags; /* running index in flag_buf */
2217 local uch flags; /* current flags not yet saved in flag_buf */
2218 local uch flag_bit; /* current bit used in flags */
2220 /* bits are filled in flags starting at bit 0 (least significant).
2221 * Note: these flags are overkill in the current code since we don't
2222 * take advantage of DIST_BUFSIZE == LIT_BUFSIZE.
2225 local ulg opt_len; /* bit length of current block with optimal trees */
2226 local ulg static_len; /* bit length of current block with static trees */
2228 local ulg compressed_len; /* total bit length of compressed file */
2230 local ulg input_len; /* total byte length of input file */
2232 /* input_len is for debugging only since we can get it by other means. */
2234 ush *file_type; /* pointer to UNKNOWN, BINARY or ASCII */
2235 int *file_method; /* pointer to DEFLATE or STORE */
2238 extern ulg bits_sent; /* bit length of the compressed data */
2239 extern long isize; /* byte length of input file */
2242 extern long block_start; /* window offset of current block */
2243 extern unsigned near strstart; /* window offset of current string */
2245 /* ===========================================================================
2246 * Local (static) routines in this file.
2249 local void init_block OF((void));
2250 local void pqdownheap OF((ct_data near * tree, int k));
2251 local void gen_bitlen OF((tree_desc near * desc));
2252 local void gen_codes OF((ct_data near * tree, int max_code));
2253 local void build_tree OF((tree_desc near * desc));
2254 local void scan_tree OF((ct_data near * tree, int max_code));
2255 local void send_tree OF((ct_data near * tree, int max_code));
2256 local int build_bl_tree OF((void));
2257 local void send_all_trees OF((int lcodes, int dcodes, int blcodes));
2258 local void compress_block OF((ct_data near * ltree, ct_data near * dtree));
2259 local void set_file_type OF((void));
2263 # define send_code(c, tree) send_bits(tree[c].Code, tree[c].Len)
2264 /* Send a code of the given tree. c and tree must not have side effects */
2267 # define send_code(c, tree) \
2268 { if (verbose>1) fprintf(stderr,"\ncd %3d ",(c)); \
2269 send_bits(tree[c].Code, tree[c].Len); }
2272 #define d_code(dist) \
2273 ((dist) < 256 ? dist_code[dist] : dist_code[256+((dist)>>7)])
2274 /* Mapping from a distance to a distance code. dist is the distance - 1 and
2275 * must not have side effects. dist_code[256] and dist_code[257] are never
2279 #define MAX(a,b) (a >= b ? a : b)
2280 /* the arguments must not have side effects */
2282 /* ===========================================================================
2283 * Allocate the match buffer, initialize the various tables and save the
2284 * location of the internal file attribute (ascii/binary) and method
2287 void ct_init(attr, methodp)
2288 ush *attr; /* pointer to internal file attribute */
2289 int *methodp; /* pointer to compression method */
2291 int n; /* iterates over tree elements */
2292 int bits; /* bit counter */
2293 int length; /* length value */
2294 int code; /* code value */
2295 int dist; /* distance index */
2298 file_method = methodp;
2299 compressed_len = input_len = 0L;
2301 if (static_dtree[0].Len != 0)
2302 return; /* ct_init already called */
2304 /* Initialize the mapping length (0..255) -> length code (0..28) */
2306 for (code = 0; code < LENGTH_CODES - 1; code++) {
2307 base_length[code] = length;
2308 for (n = 0; n < (1 << extra_lbits[code]); n++) {
2309 length_code[length++] = (uch) code;
2312 Assert(length == 256, "ct_init: length != 256");
2313 /* Note that the length 255 (match length 258) can be represented
2314 * in two different ways: code 284 + 5 bits or code 285, so we
2315 * overwrite length_code[255] to use the best encoding:
2317 length_code[length - 1] = (uch) code;
2319 /* Initialize the mapping dist (0..32K) -> dist code (0..29) */
2321 for (code = 0; code < 16; code++) {
2322 base_dist[code] = dist;
2323 for (n = 0; n < (1 << extra_dbits[code]); n++) {
2324 dist_code[dist++] = (uch) code;
2327 Assert(dist == 256, "ct_init: dist != 256");
2328 dist >>= 7; /* from now on, all distances are divided by 128 */
2329 for (; code < D_CODES; code++) {
2330 base_dist[code] = dist << 7;
2331 for (n = 0; n < (1 << (extra_dbits[code] - 7)); n++) {
2332 dist_code[256 + dist++] = (uch) code;
2335 Assert(dist == 256, "ct_init: 256+dist != 512");
2337 /* Construct the codes of the static literal tree */
2338 for (bits = 0; bits <= MAX_BITS; bits++)
2342 static_ltree[n++].Len = 8, bl_count[8]++;
2344 static_ltree[n++].Len = 9, bl_count[9]++;
2346 static_ltree[n++].Len = 7, bl_count[7]++;
2348 static_ltree[n++].Len = 8, bl_count[8]++;
2349 /* Codes 286 and 287 do not exist, but we must include them in the
2350 * tree construction to get a canonical Huffman tree (longest code
2353 gen_codes((ct_data near *) static_ltree, L_CODES + 1);
2355 /* The static distance tree is trivial: */
2356 for (n = 0; n < D_CODES; n++) {
2357 static_dtree[n].Len = 5;
2358 static_dtree[n].Code = bi_reverse(n, 5);
2361 /* Initialize the first block of the first file: */
2365 /* ===========================================================================
2366 * Initialize a new block.
2368 local void init_block()
2370 int n; /* iterates over tree elements */
2372 /* Initialize the trees. */
2373 for (n = 0; n < L_CODES; n++)
2374 dyn_ltree[n].Freq = 0;
2375 for (n = 0; n < D_CODES; n++)
2376 dyn_dtree[n].Freq = 0;
2377 for (n = 0; n < BL_CODES; n++)
2378 bl_tree[n].Freq = 0;
2380 dyn_ltree[END_BLOCK].Freq = 1;
2381 opt_len = static_len = 0L;
2382 last_lit = last_dist = last_flags = 0;
2388 /* Index within the heap array of least frequent node in the Huffman tree */
2391 /* ===========================================================================
2392 * Remove the smallest element from the heap and recreate the heap with
2393 * one less element. Updates heap and heap_len.
2395 #define pqremove(tree, top) \
2397 top = heap[SMALLEST]; \
2398 heap[SMALLEST] = heap[heap_len--]; \
2399 pqdownheap(tree, SMALLEST); \
2402 /* ===========================================================================
2403 * Compares to subtrees, using the tree depth as tie breaker when
2404 * the subtrees have equal frequency. This minimizes the worst case length.
2406 #define smaller(tree, n, m) \
2407 (tree[n].Freq < tree[m].Freq || \
2408 (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
2410 /* ===========================================================================
2411 * Restore the heap property by moving down the tree starting at node k,
2412 * exchanging a node with the smallest of its two sons if necessary, stopping
2413 * when the heap property is re-established (each father smaller than its
2416 local void pqdownheap(tree, k)
2417 ct_data near *tree; /* the tree to restore */
2418 int k; /* node to move down */
2421 int j = k << 1; /* left son of k */
2423 while (j <= heap_len) {
2424 /* Set j to the smallest of the two sons: */
2425 if (j < heap_len && smaller(tree, heap[j + 1], heap[j]))
2428 /* Exit if v is smaller than both sons */
2429 if (smaller(tree, v, heap[j]))
2432 /* Exchange v with the smallest son */
2436 /* And continue down the tree, setting j to the left son of k */
2442 /* ===========================================================================
2443 * Compute the optimal bit lengths for a tree and update the total bit length
2444 * for the current block.
2445 * IN assertion: the fields freq and dad are set, heap[heap_max] and
2446 * above are the tree nodes sorted by increasing frequency.
2447 * OUT assertions: the field len is set to the optimal bit length, the
2448 * array bl_count contains the frequencies for each bit length.
2449 * The length opt_len is updated; static_len is also updated if stree is
2452 local void gen_bitlen(desc)
2453 tree_desc near *desc; /* the tree descriptor */
2455 ct_data near *tree = desc->dyn_tree;
2456 int near *extra = desc->extra_bits;
2457 int base = desc->extra_base;
2458 int max_code = desc->max_code;
2459 int max_length = desc->max_length;
2460 ct_data near *stree = desc->static_tree;
2461 int h; /* heap index */
2462 int n, m; /* iterate over the tree elements */
2463 int bits; /* bit length */
2464 int xbits; /* extra bits */
2465 ush f; /* frequency */
2466 int overflow = 0; /* number of elements with bit length too large */
2468 for (bits = 0; bits <= MAX_BITS; bits++)
2471 /* In a first pass, compute the optimal bit lengths (which may
2472 * overflow in the case of the bit length tree).
2474 tree[heap[heap_max]].Len = 0; /* root of the heap */
2476 for (h = heap_max + 1; h < HEAP_SIZE; h++) {
2478 bits = tree[tree[n].Dad].Len + 1;
2479 if (bits > max_length)
2480 bits = max_length, overflow++;
2481 tree[n].Len = (ush) bits;
2482 /* We overwrite tree[n].Dad which is no longer needed */
2485 continue; /* not a leaf node */
2490 xbits = extra[n - base];
2492 opt_len += (ulg) f *(bits + xbits);
2495 static_len += (ulg) f *(stree[n].Len + xbits);
2500 Trace((stderr, "\nbit length overflow\n"));
2501 /* This happens for example on obj2 and pic of the Calgary corpus */
2503 /* Find the first bit length which could increase: */
2505 bits = max_length - 1;
2506 while (bl_count[bits] == 0)
2508 bl_count[bits]--; /* move one leaf down the tree */
2509 bl_count[bits + 1] += 2; /* move one overflow item as its brother */
2510 bl_count[max_length]--;
2511 /* The brother of the overflow item also moves one step up,
2512 * but this does not affect bl_count[max_length]
2515 } while (overflow > 0);
2517 /* Now recompute all bit lengths, scanning in increasing frequency.
2518 * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all
2519 * lengths instead of fixing only the wrong ones. This idea is taken
2520 * from 'ar' written by Haruhiko Okumura.)
2522 for (bits = max_length; bits != 0; bits--) {
2528 if (tree[m].Len != (unsigned) bits) {
2530 (stderr, "code %d bits %d->%d\n", m, tree[m].Len,
2534 (long) tree[m].Len) * (long) tree[m].Freq;
2535 tree[m].Len = (ush) bits;
2542 /* ===========================================================================
2543 * Generate the codes for a given tree and bit counts (which need not be
2545 * IN assertion: the array bl_count contains the bit length statistics for
2546 * the given tree and the field len is set for all tree elements.
2547 * OUT assertion: the field code is set for all tree elements of non
2550 local void gen_codes(tree, max_code)
2551 ct_data near *tree; /* the tree to decorate */
2552 int max_code; /* largest code with non zero frequency */
2554 ush next_code[MAX_BITS + 1]; /* next code value for each bit length */
2555 ush code = 0; /* running code value */
2556 int bits; /* bit index */
2557 int n; /* code index */
2559 /* The distribution counts are first used to generate the code values
2560 * without bit reversal.
2562 for (bits = 1; bits <= MAX_BITS; bits++) {
2563 next_code[bits] = code = (code + bl_count[bits - 1]) << 1;
2565 /* Check that the bit counts in bl_count are consistent. The last code
2568 Assert(code + bl_count[MAX_BITS] - 1 == (1 << MAX_BITS) - 1,
2569 "inconsistent bit counts");
2570 Tracev((stderr, "\ngen_codes: max_code %d ", max_code));
2572 for (n = 0; n <= max_code; n++) {
2573 int len = tree[n].Len;
2577 /* Now reverse the bits */
2578 tree[n].Code = bi_reverse(next_code[len]++, len);
2580 Tracec(tree != static_ltree,
2581 (stderr, "\nn %3d %c l %2d c %4x (%x) ", n,
2582 (isgraph(n) ? n : ' '), len, tree[n].Code,
2583 next_code[len] - 1));
2587 /* ===========================================================================
2588 * Construct one Huffman tree and assigns the code bit strings and lengths.
2589 * Update the total bit length for the current block.
2590 * IN assertion: the field freq is set for all tree elements.
2591 * OUT assertions: the fields len and code are set to the optimal bit length
2592 * and corresponding code. The length opt_len is updated; static_len is
2593 * also updated if stree is not null. The field max_code is set.
2595 local void build_tree(desc)
2596 tree_desc near *desc; /* the tree descriptor */
2598 ct_data near *tree = desc->dyn_tree;
2599 ct_data near *stree = desc->static_tree;
2600 int elems = desc->elems;
2601 int n, m; /* iterate over heap elements */
2602 int max_code = -1; /* largest code with non zero frequency */
2603 int node = elems; /* next internal node of the tree */
2605 /* Construct the initial heap, with least frequent element in
2606 * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].
2607 * heap[0] is not used.
2609 heap_len = 0, heap_max = HEAP_SIZE;
2611 for (n = 0; n < elems; n++) {
2612 if (tree[n].Freq != 0) {
2613 heap[++heap_len] = max_code = n;
2620 /* The pkzip format requires that at least one distance code exists,
2621 * and that at least one bit should be sent even if there is only one
2622 * possible code. So to avoid special checks later on we force at least
2623 * two codes of non zero frequency.
2625 while (heap_len < 2) {
2626 int new = heap[++heap_len] = (max_code < 2 ? ++max_code : 0);
2632 static_len -= stree[new].Len;
2633 /* new is 0 or 1 so it does not have extra bits */
2635 desc->max_code = max_code;
2637 /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree,
2638 * establish sub-heaps of increasing lengths:
2640 for (n = heap_len / 2; n >= 1; n--)
2641 pqdownheap(tree, n);
2643 /* Construct the Huffman tree by repeatedly combining the least two
2647 pqremove(tree, n); /* n = node of least frequency */
2648 m = heap[SMALLEST]; /* m = node of next least frequency */
2650 heap[--heap_max] = n; /* keep the nodes sorted by frequency */
2651 heap[--heap_max] = m;
2653 /* Create a new node father of n and m */
2654 tree[node].Freq = tree[n].Freq + tree[m].Freq;
2655 depth[node] = (uch) (MAX(depth[n], depth[m]) + 1);
2656 tree[n].Dad = tree[m].Dad = (ush) node;
2658 if (tree == bl_tree) {
2659 fprintf(stderr, "\nnode %d(%d), sons %d(%d) %d(%d)",
2660 node, tree[node].Freq, n, tree[n].Freq, m,
2664 /* and insert the new node in the heap */
2665 heap[SMALLEST] = node++;
2666 pqdownheap(tree, SMALLEST);
2668 } while (heap_len >= 2);
2670 heap[--heap_max] = heap[SMALLEST];
2672 /* At this point, the fields freq and dad are set. We can now
2673 * generate the bit lengths.
2675 gen_bitlen((tree_desc near *) desc);
2677 /* The field len is now set, we can generate the bit codes */
2678 gen_codes((ct_data near *) tree, max_code);
2681 /* ===========================================================================
2682 * Scan a literal or distance tree to determine the frequencies of the codes
2683 * in the bit length tree. Updates opt_len to take into account the repeat
2684 * counts. (The contribution of the bit length codes will be added later
2685 * during the construction of bl_tree.)
2687 local void scan_tree(tree, max_code)
2688 ct_data near *tree; /* the tree to be scanned */
2689 int max_code; /* and its largest code of non zero frequency */
2691 int n; /* iterates over all tree elements */
2692 int prevlen = -1; /* last emitted length */
2693 int curlen; /* length of current code */
2694 int nextlen = tree[0].Len; /* length of next code */
2695 int count = 0; /* repeat count of the current code */
2696 int max_count = 7; /* max repeat count */
2697 int min_count = 4; /* min repeat count */
2700 max_count = 138, min_count = 3;
2701 tree[max_code + 1].Len = (ush) 0xffff; /* guard */
2703 for (n = 0; n <= max_code; n++) {
2705 nextlen = tree[n + 1].Len;
2706 if (++count < max_count && curlen == nextlen) {
2708 } else if (count < min_count) {
2709 bl_tree[curlen].Freq += count;
2710 } else if (curlen != 0) {
2711 if (curlen != prevlen)
2712 bl_tree[curlen].Freq++;
2713 bl_tree[REP_3_6].Freq++;
2714 } else if (count <= 10) {
2715 bl_tree[REPZ_3_10].Freq++;
2717 bl_tree[REPZ_11_138].Freq++;
2722 max_count = 138, min_count = 3;
2723 } else if (curlen == nextlen) {
2724 max_count = 6, min_count = 3;
2726 max_count = 7, min_count = 4;
2731 /* ===========================================================================
2732 * Send a literal or distance tree in compressed form, using the codes in
2735 local void send_tree(tree, max_code)
2736 ct_data near *tree; /* the tree to be scanned */
2737 int max_code; /* and its largest code of non zero frequency */
2739 int n; /* iterates over all tree elements */
2740 int prevlen = -1; /* last emitted length */
2741 int curlen; /* length of current code */
2742 int nextlen = tree[0].Len; /* length of next code */
2743 int count = 0; /* repeat count of the current code */
2744 int max_count = 7; /* max repeat count */
2745 int min_count = 4; /* min repeat count */
2747 /* tree[max_code+1].Len = -1; *//* guard already set */
2749 max_count = 138, min_count = 3;
2751 for (n = 0; n <= max_code; n++) {
2753 nextlen = tree[n + 1].Len;
2754 if (++count < max_count && curlen == nextlen) {
2756 } else if (count < min_count) {
2758 send_code(curlen, bl_tree);
2759 } while (--count != 0);
2761 } else if (curlen != 0) {
2762 if (curlen != prevlen) {
2763 send_code(curlen, bl_tree);
2766 Assert(count >= 3 && count <= 6, " 3_6?");
2767 send_code(REP_3_6, bl_tree);
2768 send_bits(count - 3, 2);
2770 } else if (count <= 10) {
2771 send_code(REPZ_3_10, bl_tree);
2772 send_bits(count - 3, 3);
2775 send_code(REPZ_11_138, bl_tree);
2776 send_bits(count - 11, 7);
2781 max_count = 138, min_count = 3;
2782 } else if (curlen == nextlen) {
2783 max_count = 6, min_count = 3;
2785 max_count = 7, min_count = 4;
2790 /* ===========================================================================
2791 * Construct the Huffman tree for the bit lengths and return the index in
2792 * bl_order of the last bit length code to send.
2794 local int build_bl_tree()
2796 int max_blindex; /* index of last bit length code of non zero freq */
2798 /* Determine the bit length frequencies for literal and distance trees */
2799 scan_tree((ct_data near *) dyn_ltree, l_desc.max_code);
2800 scan_tree((ct_data near *) dyn_dtree, d_desc.max_code);
2802 /* Build the bit length tree: */
2803 build_tree((tree_desc near *) (&bl_desc));
2804 /* opt_len now includes the length of the tree representations, except
2805 * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.
2808 /* Determine the number of bit length codes to send. The pkzip format
2809 * requires that at least 4 bit length codes be sent. (appnote.txt says
2810 * 3 but the actual value used is 4.)
2812 for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {
2813 if (bl_tree[bl_order[max_blindex]].Len != 0)
2816 /* Update opt_len to include the bit length tree and counts */
2817 opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;
2819 (stderr, "\ndyn trees: dyn %ld, stat %ld", opt_len,
2825 /* ===========================================================================
2826 * Send the header for a block using dynamic Huffman trees: the counts, the
2827 * lengths of the bit length codes, the literal tree and the distance tree.
2828 * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4.
2830 local void send_all_trees(lcodes, dcodes, blcodes)
2831 int lcodes, dcodes, blcodes; /* number of codes for each tree */
2833 int rank; /* index in bl_order */
2835 Assert(lcodes >= 257 && dcodes >= 1
2836 && blcodes >= 4, "not enough codes");
2837 Assert(lcodes <= L_CODES && dcodes <= D_CODES
2838 && blcodes <= BL_CODES, "too many codes");
2839 Tracev((stderr, "\nbl counts: "));
2840 send_bits(lcodes - 257, 5); /* not +255 as stated in appnote.txt */
2841 send_bits(dcodes - 1, 5);
2842 send_bits(blcodes - 4, 4); /* not -3 as stated in appnote.txt */
2843 for (rank = 0; rank < blcodes; rank++) {
2844 Tracev((stderr, "\nbl code %2d ", bl_order[rank]));
2845 send_bits(bl_tree[bl_order[rank]].Len, 3);
2847 Tracev((stderr, "\nbl tree: sent %ld", bits_sent));
2849 send_tree((ct_data near *) dyn_ltree, lcodes - 1); /* send the literal tree */
2850 Tracev((stderr, "\nlit tree: sent %ld", bits_sent));
2852 send_tree((ct_data near *) dyn_dtree, dcodes - 1); /* send the distance tree */
2853 Tracev((stderr, "\ndist tree: sent %ld", bits_sent));
2856 /* ===========================================================================
2857 * Determine the best encoding for the current block: dynamic trees, static
2858 * trees or store, and output the encoded block to the zip file. This function
2859 * returns the total compressed length for the file so far.
2861 ulg flush_block(buf, stored_len, eof)
2862 char *buf; /* input block, or NULL if too old */
2863 ulg stored_len; /* length of input block */
2864 int eof; /* true if this is the last block for a file */
2866 ulg opt_lenb, static_lenb; /* opt_len and static_len in bytes */
2867 int max_blindex; /* index of last bit length code of non zero freq */
2869 flag_buf[last_flags] = flags; /* Save the flags for the last 8 items */
2871 /* Check if the file is ascii or binary */
2872 if (*file_type == (ush) UNKNOWN)
2875 /* Construct the literal and distance trees */
2876 build_tree((tree_desc near *) (&l_desc));
2877 Tracev((stderr, "\nlit data: dyn %ld, stat %ld", opt_len, static_len));
2879 build_tree((tree_desc near *) (&d_desc));
2881 (stderr, "\ndist data: dyn %ld, stat %ld", opt_len,
2883 /* At this point, opt_len and static_len are the total bit lengths of
2884 * the compressed block data, excluding the tree representations.
2887 /* Build the bit length tree for the above two trees, and get the index
2888 * in bl_order of the last bit length code to send.
2890 max_blindex = build_bl_tree();
2892 /* Determine the best encoding. Compute first the block length in bytes */
2893 opt_lenb = (opt_len + 3 + 7) >> 3;
2894 static_lenb = (static_len + 3 + 7) >> 3;
2895 input_len += stored_len; /* for debugging only */
2899 "\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u dist %u ",
2900 opt_lenb, opt_len, static_lenb, static_len, stored_len,
2901 last_lit, last_dist));
2903 if (static_lenb <= opt_lenb)
2904 opt_lenb = static_lenb;
2906 /* If compression failed and this is the first and last block,
2907 * and if the zip file can be seeked (to rewrite the local header),
2908 * the whole file is transformed into a stored file:
2912 if (stored_len <= opt_lenb && eof && compressed_len == 0L
2915 /* Since LIT_BUFSIZE <= 2*WSIZE, the input data must be there: */
2916 if (buf == (char *) 0)
2917 errorMsg("block vanished");
2919 copy_block(buf, (unsigned) stored_len, 0); /* without header */
2920 compressed_len = stored_len << 3;
2921 *file_method = STORED;
2925 } else if (stored_len + 4 <= opt_lenb && buf != (char *) 0) {
2926 /* 4: two words for the lengths */
2928 /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.
2929 * Otherwise we can't have processed more than WSIZE input bytes since
2930 * the last block flush, because compression would have been
2931 * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to
2932 * transform a block into a stored block.
2934 send_bits((STORED_BLOCK << 1) + eof, 3); /* send block type */
2935 compressed_len = (compressed_len + 3 + 7) & ~7L;
2936 compressed_len += (stored_len + 4) << 3;
2938 copy_block(buf, (unsigned) stored_len, 1); /* with header */
2942 } else if (static_lenb == opt_lenb) {
2944 send_bits((STATIC_TREES << 1) + eof, 3);
2945 compress_block((ct_data near *) static_ltree,
2946 (ct_data near *) static_dtree);
2947 compressed_len += 3 + static_len;
2949 send_bits((DYN_TREES << 1) + eof, 3);
2950 send_all_trees(l_desc.max_code + 1, d_desc.max_code + 1,
2952 compress_block((ct_data near *) dyn_ltree,
2953 (ct_data near *) dyn_dtree);
2954 compressed_len += 3 + opt_len;
2956 Assert(compressed_len == bits_sent, "bad compressed size");
2960 Assert(input_len == isize, "bad input size");
2962 compressed_len += 7; /* align on byte boundary */
2964 Tracev((stderr, "\ncomprlen %lu(%lu) ", compressed_len >> 3,
2965 compressed_len - 7 * eof));
2967 return compressed_len >> 3;
2970 /* ===========================================================================
2971 * Save the match info and tally the frequency counts. Return true if
2972 * the current block must be flushed.
2974 int ct_tally(dist, lc)
2975 int dist; /* distance of matched string */
2976 int lc; /* match length-MIN_MATCH or unmatched char (if dist==0) */
2978 l_buf[last_lit++] = (uch) lc;
2980 /* lc is the unmatched char */
2981 dyn_ltree[lc].Freq++;
2983 /* Here, lc is the match length - MIN_MATCH */
2984 dist--; /* dist = match distance - 1 */
2985 Assert((ush) dist < (ush) MAX_DIST &&
2986 (ush) lc <= (ush) (MAX_MATCH - MIN_MATCH) &&
2987 (ush) d_code(dist) < (ush) D_CODES, "ct_tally: bad match");
2989 dyn_ltree[length_code[lc] + LITERALS + 1].Freq++;
2990 dyn_dtree[d_code(dist)].Freq++;
2992 d_buf[last_dist++] = (ush) dist;
2997 /* Output the flags if they fill a byte: */
2998 if ((last_lit & 7) == 0) {
2999 flag_buf[last_flags++] = flags;
3000 flags = 0, flag_bit = 1;
3002 /* Try to guess if it is profitable to stop the current block here */
3003 if ((last_lit & 0xfff) == 0) {
3004 /* Compute an upper bound for the compressed length */
3005 ulg out_length = (ulg) last_lit * 8L;
3006 ulg in_length = (ulg) strstart - block_start;
3009 for (dcode = 0; dcode < D_CODES; dcode++) {
3011 (ulg) dyn_dtree[dcode].Freq * (5L + extra_dbits[dcode]);
3016 "\nlast_lit %u, last_dist %u, in %ld, out ~%ld(%ld%%) ",
3017 last_lit, last_dist, in_length, out_length,
3018 100L - out_length * 100L / in_length));
3019 if (last_dist < last_lit / 2 && out_length < in_length / 2)
3022 return (last_lit == LIT_BUFSIZE - 1 || last_dist == DIST_BUFSIZE);
3023 /* We avoid equality with LIT_BUFSIZE because of wraparound at 64K
3024 * on 16 bit machines and because stored blocks are restricted to
3029 /* ===========================================================================
3030 * Send the block data compressed using the given Huffman trees
3032 local void compress_block(ltree, dtree)
3033 ct_data near *ltree; /* literal tree */
3034 ct_data near *dtree; /* distance tree */
3036 unsigned dist; /* distance of matched string */
3037 int lc; /* match length or unmatched char (if dist == 0) */
3038 unsigned lx = 0; /* running index in l_buf */
3039 unsigned dx = 0; /* running index in d_buf */
3040 unsigned fx = 0; /* running index in flag_buf */
3041 uch flag = 0; /* current flags */
3042 unsigned code; /* the code to send */
3043 int extra; /* number of extra bits to send */
3048 flag = flag_buf[fx++];
3050 if ((flag & 1) == 0) {
3051 send_code(lc, ltree); /* send a literal byte */
3052 Tracecv(isgraph(lc), (stderr, " '%c' ", lc));
3054 /* Here, lc is the match length - MIN_MATCH */
3055 code = length_code[lc];
3056 send_code(code + LITERALS + 1, ltree); /* send the length code */
3057 extra = extra_lbits[code];
3059 lc -= base_length[code];
3060 send_bits(lc, extra); /* send the extra length bits */
3063 /* Here, dist is the match distance - 1 */
3064 code = d_code(dist);
3065 Assert(code < D_CODES, "bad d_code");
3067 send_code(code, dtree); /* send the distance code */
3068 extra = extra_dbits[code];
3070 dist -= base_dist[code];
3071 send_bits(dist, extra); /* send the extra distance bits */
3073 } /* literal or match pair ? */
3075 } while (lx < last_lit);
3077 send_code(END_BLOCK, ltree);
3080 /* ===========================================================================
3081 * Set the file type to ASCII or BINARY, using a crude approximation:
3082 * binary if more than 20% of the bytes are <= 6 or >= 128, ascii otherwise.
3083 * IN assertion: the fields freq of dyn_ltree are set and the total of all
3084 * frequencies does not exceed 64K (to fit in an int on 16 bit machines).
3086 local void set_file_type()
3089 unsigned ascii_freq = 0;
3090 unsigned bin_freq = 0;
3093 bin_freq += dyn_ltree[n++].Freq;
3095 ascii_freq += dyn_ltree[n++].Freq;
3096 while (n < LITERALS)
3097 bin_freq += dyn_ltree[n++].Freq;
3098 *file_type = bin_freq > (ascii_freq >> 2) ? BINARY : ASCII;
3099 if (*file_type == BINARY && translate_eol) {
3100 errorMsg("-l used on binary file");
3104 /* util.c -- utility functions for gzip support
3105 * Copyright (C) 1992-1993 Jean-loup Gailly
3106 * This is free software; you can redistribute it and/or modify it under the
3107 * terms of the GNU General Public License, see the file COPYING.
3112 #include <sys/types.h>
3114 #ifdef HAVE_UNISTD_H
3115 # include <unistd.h>
3121 #if defined(STDC_HEADERS) || !defined(NO_STDLIB_H)
3122 # include <stdlib.h>
3127 /* ===========================================================================
3128 * Copy input to output unchanged: zcat == cat with --force.
3129 * IN assertion: insize bytes have already been read in inbuf.
3132 int in, out; /* input and output file descriptors */
3135 while (insize != 0 && (int) insize != EOF) {
3136 write_buf(out, (char *) inbuf, insize);
3137 bytes_out += insize;
3138 insize = read(in, (char *) inbuf, INBUFSIZ);
3140 if ((int) insize == EOF && errno != 0) {
3143 bytes_in = bytes_out;
3147 /* ========================================================================
3148 * Put string s in lower case, return s.
3155 for (t = s; *t; t++)
3160 #if defined(NO_STRING_H) && !defined(STDC_HEADERS)
3162 /* Provide missing strspn and strcspn functions. */
3168 int strspn OF((const char *s, const char *accept));
3169 int strcspn OF((const char *s, const char *reject));
3171 /* ========================================================================
3172 * Return the length of the maximum initial segment
3173 * of s which contains only characters in accept.
3175 int strspn(s, accept)
3179 register const char *p;
3180 register const char *a;
3181 register int count = 0;
3183 for (p = s; *p != '\0'; ++p) {
3184 for (a = accept; *a != '\0'; ++a) {
3195 /* ========================================================================
3196 * Return the length of the maximum inital segment of s
3197 * which contains no characters from reject.
3199 int strcspn(s, reject)
3203 register int count = 0;
3205 while (*s != '\0') {
3206 if (strchr(reject, *s++) != NULL)
3213 #endif /* NO_STRING_H */
3215 /* ========================================================================
3216 * Add an environment variable (if any) before argv, and update argc.
3217 * Return the expanded environment variable to be freed later, or NULL
3218 * if no options were added to argv.
3220 #define SEPARATOR " \t" /* separators in env variable */
3222 char *add_envopt(argcp, argvp, env)
3223 int *argcp; /* pointer to argc */
3224 char ***argvp; /* pointer to argv */
3225 char *env; /* name of environment variable */
3227 char *p; /* running pointer through env variable */
3228 char **oargv; /* runs through old argv array */
3229 char **nargv; /* runs through new argv array */
3230 int oargc = *argcp; /* old argc */
3231 int nargc = 0; /* number of arguments in env variable */
3233 env = (char *) getenv(env);
3237 p = (char *) xmalloc(strlen(env) + 1);
3238 env = strcpy(p, env); /* keep env variable intact */
3240 for (p = env; *p; nargc++) { /* move through env */
3241 p += strspn(p, SEPARATOR); /* skip leading separators */
3245 p += strcspn(p, SEPARATOR); /* find end of word */
3247 *p++ = '\0'; /* mark it */
3254 /* Allocate the new argv array, with an extra element just in case
3255 * the original arg list did not end with a NULL.
3257 nargv = (char **) calloc(*argcp + 1, sizeof(char *));
3260 errorMsg("out of memory");
3264 /* Copy the program name first */
3266 errorMsg("argc<=0");
3267 *(nargv++) = *(oargv++);
3269 /* Then copy the environment args */
3270 for (p = env; nargc > 0; nargc--) {
3271 p += strspn(p, SEPARATOR); /* skip separators */
3272 *(nargv++) = p; /* store start */
3273 while (*p++); /* skip over word */
3276 /* Finally copy the old args and add a NULL (usual convention) */
3278 *(nargv++) = *(oargv++);
3283 /* ========================================================================
3284 * Display compression ratio on the given stream on 6 characters.
3286 void display_ratio(num, den, file)
3291 long ratio; /* 1000 times the compression ratio */
3294 ratio = 0; /* no compression */
3295 } else if (den < 2147483L) { /* (2**31 -1)/1000 */
3296 ratio = 1000L * num / den;
3298 ratio = num / (den / 1000L);
3306 fprintf(file, "%2ld.%1ld%%", ratio / 10L, ratio % 10L);
3310 /* zip.c -- compress files to the gzip or pkzip format
3311 * Copyright (C) 1992-1993 Jean-loup Gailly
3312 * This is free software; you can redistribute it and/or modify it under the
3313 * terms of the GNU General Public License, see the file COPYING.
3317 #include <sys/types.h>
3319 #ifdef HAVE_UNISTD_H
3320 # include <unistd.h>
3326 local ulg crc; /* crc on uncompressed file data */
3327 long header_bytes; /* number of bytes in gzip header */
3329 /* ===========================================================================
3330 * Deflate in to out.
3331 * IN assertions: the input and output buffers are cleared.
3332 * The variables time_stamp and save_orig_name are initialized.
3335 int in, out; /* input and output file descriptors */
3337 uch flags = 0; /* general purpose bit flags */
3338 ush attr = 0; /* ascii/binary flag */
3339 ush deflate_flags = 0; /* pkzip -es, -en or -ex equivalent */
3345 /* Write the header to the gzip file. See algorithm.doc for the format */
3349 put_byte(GZIP_MAGIC[0]); /* magic header */
3350 put_byte(GZIP_MAGIC[1]);
3351 put_byte(DEFLATED); /* compression method */
3353 put_byte(flags); /* general flags */
3354 put_long(time_stamp);
3356 /* Write deflated file to zip file */
3360 ct_init(&attr, &method);
3361 lm_init(&deflate_flags);
3363 put_byte((uch) deflate_flags); /* extra flags */
3364 put_byte(OS_CODE); /* OS identifier */
3366 header_bytes = (long) outcnt;
3370 /* Write the crc and uncompressed size */
3373 header_bytes += 2 * sizeof(long);
3380 /* ===========================================================================
3381 * Read a new buffer from the current input file, perform end-of-line
3382 * translation, and update the crc and input file size.
3383 * IN assertion: size >= 2 (for end-of-line translation)
3385 int file_read(buf, size)
3391 Assert(insize == 0, "inbuf not empty");
3393 len = read(ifd, buf, size);
3394 if (len == (unsigned) (-1) || len == 0)
3397 crc = updcrc((uch *) buf, len);
projects / oweals / busybox.git / blob