1 /* gzip.c -- this is a stripped down version of gzip I put into busybox, it does
2 * only standard in to standard out with -9 compression. It also requires the
3 * zcat module for some important functions.
5 * Charles P. Wright <cpw@unix.asb.com>
11 //#error you need zcat to have gzip support!
14 static const char gzip_usage[] =
15 "gzip [OPTION]... [FILE]...\n\n"
16 "Compress FILEs with maximum compression.\n\n"
18 "\t-c\tWrite output on standard output\n";
21 /* gzip.h -- common declarations for all gzip modules
22 * Copyright (C) 1992-1993 Jean-loup Gailly.
23 * This is free software; you can redistribute it and/or modify it under the
24 * terms of the GNU General Public License, see the file COPYING.
27 #if defined(__STDC__) || defined(PROTO)
28 # define OF(args) args
39 /* I don't like nested includes, but the string and io functions are used
43 #if !defined(NO_STRING_H) || defined(STDC_HEADERS)
45 # if !defined(STDC_HEADERS) && !defined(NO_MEMORY_H) && !defined(__GNUC__)
48 # define memzero(s, n) memset ((voidp)(s), 0, (n))
52 # define strrchr rindex
53 # define memcpy(d, s, n) bcopy((s), (d), (n))
54 # define memcmp(s1, s2, n) bcmp((s1), (s2), (n))
55 # define memzero(s, n) bzero((s), (n))
59 # define RETSIGTYPE void
64 typedef unsigned char uch;
65 typedef unsigned short ush;
66 typedef unsigned long ulg;
68 /* Return codes from gzip */
73 /* Compression methods (see algorithm.doc) */
78 /* methods 4 to 7 reserved */
81 extern int method; /* compression method */
83 /* To save memory for 16 bit systems, some arrays are overlaid between
84 * the various modules:
85 * deflate: prev+head window d_buf l_buf outbuf
86 * unlzw: tab_prefix tab_suffix stack inbuf outbuf
87 * inflate: window inbuf
88 * unpack: window inbuf prefix_len
89 * unlzh: left+right window c_table inbuf c_len
90 * For compression, input is done in window[]. For decompression, output
91 * is done in window except for unlzw.
96 # define INBUFSIZ 0x2000 /* input buffer size */
98 # define INBUFSIZ 0x8000 /* input buffer size */
101 #define INBUF_EXTRA 64 /* required by unlzw() */
105 # define OUTBUFSIZ 8192 /* output buffer size */
107 # define OUTBUFSIZ 16384 /* output buffer size */
110 #define OUTBUF_EXTRA 2048 /* required by unlzw() */
114 # define DIST_BUFSIZE 0x2000 /* buffer for distances, see trees.c */
116 # define DIST_BUFSIZE 0x8000 /* buffer for distances, see trees.c */
121 # define EXTERN(type, array) extern type * near array
122 # define DECLARE(type, array, size) type * near array
123 # define ALLOC(type, array, size) { \
124 array = (type*)fcalloc((size_t)(((size)+1L)/2), 2*sizeof(type)); \
125 if (array == NULL) error("insufficient memory"); \
127 # define FREE(array) {if (array != NULL) fcfree(array), array=NULL;}
129 # define EXTERN(type, array) extern type array[]
130 # define DECLARE(type, array, size) type array[size]
131 # define ALLOC(type, array, size)
135 EXTERN(uch, inbuf); /* input buffer */
136 EXTERN(uch, outbuf); /* output buffer */
137 EXTERN(ush, d_buf); /* buffer for distances, see trees.c */
138 EXTERN(uch, window); /* Sliding window and suffix table (unlzw) */
139 #define tab_suffix window
141 # define tab_prefix prev /* hash link (see deflate.c) */
142 # define head (prev+WSIZE) /* hash head (see deflate.c) */
143 EXTERN(ush, tab_prefix); /* prefix code (see unlzw.c) */
145 # define tab_prefix0 prev
146 # define head tab_prefix1
147 EXTERN(ush, tab_prefix0); /* prefix for even codes */
148 EXTERN(ush, tab_prefix1); /* prefix for odd codes */
151 extern unsigned insize; /* valid bytes in inbuf */
152 extern unsigned inptr; /* index of next byte to be processed in inbuf */
153 extern unsigned outcnt; /* bytes in output buffer */
155 extern long bytes_in; /* number of input bytes */
156 extern long bytes_out; /* number of output bytes */
157 extern long header_bytes;/* number of bytes in gzip header */
159 #define isize bytes_in
160 /* for compatibility with old zip sources (to be cleaned) */
162 extern int ifd; /* input file descriptor */
163 extern int ofd; /* output file descriptor */
164 extern char ifname[]; /* input file name or "stdin" */
165 extern char ofname[]; /* output file name or "stdout" */
166 extern char *progname; /* program name */
168 extern long time_stamp; /* original time stamp (modification time) */
169 extern long ifile_size; /* input file size, -1 for devices (debug only) */
171 typedef int file_t; /* Do not use stdio */
172 #define NO_FILE (-1) /* in memory compression */
175 #define PACK_MAGIC "\037\036" /* Magic header for packed files */
176 #define GZIP_MAGIC "\037\213" /* Magic header for gzip files, 1F 8B */
177 #define OLD_GZIP_MAGIC "\037\236" /* Magic header for gzip 0.5 = freeze 1.x */
178 #define LZH_MAGIC "\037\240" /* Magic header for SCO LZH Compress files*/
179 #define PKZIP_MAGIC "\120\113\003\004" /* Magic header for pkzip files */
182 #define ASCII_FLAG 0x01 /* bit 0 set: file probably ascii text */
183 #define CONTINUATION 0x02 /* bit 1 set: continuation of multi-part gzip file */
184 #define EXTRA_FIELD 0x04 /* bit 2 set: extra field present */
185 #define ORIG_NAME 0x08 /* bit 3 set: original file name present */
186 #define COMMENT 0x10 /* bit 4 set: file comment present */
187 #define ENCRYPTED 0x20 /* bit 5 set: file is encrypted */
188 #define RESERVED 0xC0 /* bit 6,7: reserved */
190 /* internal file attribute */
191 #define UNKNOWN 0xffff
196 # define WSIZE 0x8000 /* window size--must be a power of two, and */
197 #endif /* at least 32K for zip's deflate method */
200 #define MAX_MATCH 258
201 /* The minimum and maximum match lengths */
203 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
204 /* Minimum amount of lookahead, except at the end of the input file.
205 * See deflate.c for comments about the MIN_MATCH+1.
208 #define MAX_DIST (WSIZE-MIN_LOOKAHEAD)
209 /* In order to simplify the code, particularly on 16 bit machines, match
210 * distances are limited to MAX_DIST instead of WSIZE.
213 extern int decrypt; /* flag to turn on decryption */
214 extern int exit_code; /* program exit code */
215 extern int verbose; /* be verbose (-v) */
216 extern int quiet; /* be quiet (-q) */
217 extern int test; /* check .z file integrity */
218 extern int save_orig_name; /* set if original name must be saved */
220 #define get_byte() (inptr < insize ? inbuf[inptr++] : fill_inbuf(0))
221 #define try_byte() (inptr < insize ? inbuf[inptr++] : fill_inbuf(1))
223 /* put_byte is used for the compressed output, put_ubyte for the
224 * uncompressed output. However unlzw() uses window for its
225 * suffix table instead of its output buffer, so it does not use put_ubyte
226 * (to be cleaned up).
228 #define put_byte(c) {outbuf[outcnt++]=(uch)(c); if (outcnt==OUTBUFSIZ)\
230 #define put_ubyte(c) {window[outcnt++]=(uch)(c); if (outcnt==WSIZE)\
233 /* Output a 16 bit value, lsb first */
234 #define put_short(w) \
235 { if (outcnt < OUTBUFSIZ-2) { \
236 outbuf[outcnt++] = (uch) ((w) & 0xff); \
237 outbuf[outcnt++] = (uch) ((ush)(w) >> 8); \
239 put_byte((uch)((w) & 0xff)); \
240 put_byte((uch)((ush)(w) >> 8)); \
244 /* Output a 32 bit value to the bit stream, lsb first */
245 #define put_long(n) { \
246 put_short((n) & 0xffff); \
247 put_short(((ulg)(n)) >> 16); \
250 #define seekable() 0 /* force sequential output */
251 #define translate_eol 0 /* no option -a yet */
253 #define tolow(c) (isupper(c) ? (c)-'A'+'a' : (c)) /* force to lower case */
255 /* Macros for getting two-byte and four-byte header values */
256 #define SH(p) ((ush)(uch)((p)[0]) | ((ush)(uch)((p)[1]) << 8))
257 #define LG(p) ((ulg)(SH(p)) | ((ulg)(SH((p)+2)) << 16))
259 /* Diagnostic functions */
261 # define Assert(cond,msg) {if(!(cond)) error(msg);}
262 # define Trace(x) fprintf x
263 # define Tracev(x) {if (verbose) fprintf x ;}
264 # define Tracevv(x) {if (verbose>1) fprintf x ;}
265 # define Tracec(c,x) {if (verbose && (c)) fprintf x ;}
266 # define Tracecv(c,x) {if (verbose>1 && (c)) fprintf x ;}
268 # define Assert(cond,msg)
273 # define Tracecv(c,x)
276 #define WARN(msg) {if (!quiet) fprintf msg ; \
277 if (exit_code == OK) exit_code = WARNING;}
279 local void do_exit(int exitcode) __attribute__ ((noreturn));
282 extern int zip OF((int in, int out));
283 extern int file_read OF((char *buf, unsigned size));
286 extern int unzip OF((int in, int out));
287 extern int check_zipfile OF((int in));
290 extern int unpack OF((int in, int out));
293 extern int unlzh OF((int in, int out));
296 RETSIGTYPE abort_gzip OF((void));
299 void lm_init OF((ush *flags));
300 ulg deflate OF((void));
303 void ct_init OF((ush *attr, int *method));
304 int ct_tally OF((int dist, int lc));
305 ulg flush_block OF((char *buf, ulg stored_len, int eof));
308 void bi_init OF((file_t zipfile));
309 void send_bits OF((int value, int length));
310 unsigned bi_reverse OF((unsigned value, int length));
311 void bi_windup OF((void));
312 void copy_block OF((char *buf, unsigned len, int header));
313 extern int (*read_buf) OF((char *buf, unsigned size));
316 extern int copy OF((int in, int out));
317 extern ulg updcrc OF((uch *s, unsigned n));
318 extern void clear_bufs OF((void));
319 extern int fill_inbuf OF((int eof_ok));
320 extern void flush_outbuf OF((void));
321 extern void flush_window OF((void));
322 extern void write_buf OF((int fd, voidp buf, unsigned cnt));
323 extern char *strlwr OF((char *s));
324 extern char *add_envopt OF((int *argcp, char ***argvp, char *env));
325 extern void error OF((char *m));
326 extern void warn OF((char *a, char *b));
327 extern void read_error OF((void));
328 extern void write_error OF((void));
329 extern void display_ratio OF((long num, long den, FILE *file));
330 extern voidp xmalloc OF((unsigned int size));
333 extern int inflate OF((void));
334 /* lzw.h -- define the lzw functions.
335 * Copyright (C) 1992-1993 Jean-loup Gailly.
336 * This is free software; you can redistribute it and/or modify it under the
337 * terms of the GNU General Public License, see the file COPYING.
340 #if !defined(OF) && defined(lint)
347 #define INIT_BITS 9 /* Initial number of bits per code */
349 #define BIT_MASK 0x1f /* Mask for 'number of compression bits' */
350 /* Mask 0x20 is reserved to mean a fourth header byte, and 0x40 is free.
351 * It's a pity that old uncompress does not check bit 0x20. That makes
352 * extension of the format actually undesirable because old compress
353 * would just crash on the new format instead of giving a meaningful
354 * error message. It does check the number of bits, but it's more
355 * helpful to say "unsupported format, get a new version" than
356 * "can only handle 16 bits".
359 #define BLOCK_MODE 0x80
360 /* Block compression: if table is full and compression rate is dropping,
361 * clear the dictionary.
364 #define LZW_RESERVED 0x60 /* reserved bits */
366 #define CLEAR 256 /* flush the dictionary */
367 #define FIRST (CLEAR+1) /* first free entry */
369 extern int maxbits; /* max bits per code for LZW */
370 extern int block_mode; /* block compress mode -C compatible with 2.0 */
372 /* revision.h -- define the version number
373 * Copyright (C) 1992-1993 Jean-loup Gailly.
374 * This is free software; you can redistribute it and/or modify it under the
375 * terms of the GNU General Public License, see the file COPYING.
378 #define VERSION "1.2.4"
380 #define REVDATE "18 Aug 93"
382 /* This version does not support compression into old compress format: */
387 /* tailor.h -- target dependent definitions
388 * Copyright (C) 1992-1993 Jean-loup Gailly.
389 * This is free software; you can redistribute it and/or modify it under the
390 * terms of the GNU General Public License, see the file COPYING.
393 /* The target dependent definitions should be defined here only.
394 * The target dependent functions should be defined in tailor.c.
398 #if defined(__MSDOS__) && !defined(MSDOS)
402 #if defined(__OS2__) && !defined(OS2)
406 #if defined(OS2) && defined(MSDOS) /* MS C under OS/2 */
412 /* DJGPP version 1.09+ on MS-DOS.
413 * The DJGPP 1.09 stat() function must be upgraded before gzip will
415 * No need for DIRENT, since <unistd.h> defines POSIX_SOURCE which
429 # define HAVE_SYS_UTIME_H
433 # define PATH_SEP2 '\\'
434 # define PATH_SEP3 ':'
435 # define MAX_PATH_LEN 128
436 # define NO_MULTIPLE_DOTS
437 # define MAX_EXT_CHARS 3
438 # define Z_SUFFIX "z"
441 # define STDC_HEADERS
442 # define NO_SIZE_CHECK
443 # define casemap(c) tolow(c) /* Force file names to lower case */
445 # define OS_CODE 0x00
446 # define SET_BINARY_MODE(fd) setmode(fd, O_BINARY)
447 # if !defined(NO_ASM) && !defined(ASMV)
455 # define PATH_SEP2 '\\'
456 # define PATH_SEP3 ':'
457 # define MAX_PATH_LEN 260
459 # define NO_MULTIPLE_DOTS
460 # define MAX_EXT_CHARS 3
461 # define Z_SUFFIX "z"
462 # define casemap(c) tolow(c)
466 # define STDC_HEADERS
468 # define OS_CODE 0x06
469 # define SET_BINARY_MODE(fd) setmode(fd, O_BINARY)
471 # define HAVE_SYS_UTIME_H
478 # define HAVE_SYS_UTIME_H
481 # define EXPAND(argc,argv) \
482 {_response(&argc, &argv); _wildcard(&argc, &argv);}
491 # define EXPAND(argc,argv) \
492 {response_expand(&argc, &argv);}
496 #ifdef WIN32 /* Windows NT */
497 # define HAVE_SYS_UTIME_H
499 # define PATH_SEP2 '\\'
500 # define PATH_SEP3 ':'
501 # define MAX_PATH_LEN 260
504 # define STDC_HEADERS
505 # define SET_BINARY_MODE(fd) setmode(fd, O_BINARY)
509 # define NO_MULTIPLE_DOTS
510 # define MAX_EXT_CHARS 3
511 # define Z_SUFFIX "z"
512 # define casemap(c) tolow(c) /* Force file names to lower case */
514 # define OS_CODE 0x0b
521 /* Turbo C 2.0 does not accept static allocations of large arrays */
522 void * fcalloc (unsigned items, unsigned size);
523 void fcfree (void *ptr);
526 # define fcalloc(nitems,itemsize) halloc((long)(nitems),(itemsize))
527 # define fcfree(ptr) hfree(ptr)
531 # define fcalloc(items,size) calloc((items),(size))
533 # define fcalloc(items,size) malloc((size_t)(items)*(size_t)(size))
535 # define fcfree(ptr) free(ptr)
538 #if defined(VAXC) || defined(VMS)
539 # define PATH_SEP ']'
540 # define PATH_SEP2 ':'
541 # define SUFFIX_SEP ';'
542 # define NO_MULTIPLE_DOTS
543 # define Z_SUFFIX "-gz"
545 # define casemap(c) tolow(c)
546 # define OS_CODE 0x02
547 # define OPTIONS_VAR "GZIP_OPT"
548 # define STDC_HEADERS
550 # define EXPAND(argc,argv) vms_expand_args(&argc,&argv);
552 # define unlink delete
560 # define PATH_SEP2 ':'
561 # define STDC_HEADERS
562 # define OS_CODE 0x01
566 # define HAVE_UNISTD_H
568 # define NO_STDIN_FSTAT
573 # include <fcntl.h> /* for read() and write() */
574 # define direct dirent
575 extern void _expand_args(int *argc, char ***argv);
576 # define EXPAND(argc,argv) _expand_args(&argc,&argv);
577 # undef O_BINARY /* disable useless --ascii option */
581 #if defined(ATARI) || defined(atarist)
582 # ifndef STDC_HEADERS
583 # define STDC_HEADERS
584 # define HAVE_UNISTD_H
588 # define OS_CODE 0x05
590 # define PATH_SEP2 '\\'
591 # define PATH_SEP3 ':'
592 # define MAX_PATH_LEN 128
593 # define NO_MULTIPLE_DOTS
594 # define MAX_EXT_CHARS 3
595 # define Z_SUFFIX "z"
597 # define casemap(c) tolow(c) /* Force file names to lower case */
603 # define PATH_SEP ':'
606 # define NO_STDIN_FSTAT
609 # define chmod(file, mode) (0)
610 # define OPEN(name, flags, mode) open(name, flags)
611 # define OS_CODE 0x07
613 # define isatty(fd) ((fd) <= 2)
617 #ifdef __50SERIES /* Prime/PRIMOS */
618 # define PATH_SEP '>'
619 # define STDC_HEADERS
624 # define NO_STDIN_FSTAT
625 # define NO_SIZE_CHECK
628 # define casemap(c) tolow(c) /* Force file names to lower case */
629 # define put_char(c) put_byte((c) & 0x7F)
630 # define get_char(c) ascii2pascii(get_byte())
631 # define OS_CODE 0x0F /* temporary, subject to change */
633 # undef SIGTERM /* We don't want a signal handler for SIGTERM */
637 #if defined(pyr) && !defined(NOMEMCPY) /* Pyramid */
638 # define NOMEMCPY /* problem with overlapping copies */
642 # define OS_CODE 0x0a
646 # define NO_ST_INO /* don't rely on inode numbers */
650 /* Common defaults */
653 # define OS_CODE 0x03 /* assume Unix */
657 # define PATH_SEP '/'
661 # define casemap(c) (c)
665 # define OPTIONS_VAR "GZIP"
669 # define Z_SUFFIX ".gz"
673 # define MAX_SUFFIX MAX_EXT_CHARS
675 # define MAX_SUFFIX 30
678 #ifndef MAKE_LEGAL_NAME
679 # ifdef NO_MULTIPLE_DOTS
680 # define MAKE_LEGAL_NAME(name) make_simple_name(name)
682 # define MAKE_LEGAL_NAME(name)
688 /* keep at least MIN_PART chars between dots in a file name. */
692 # define EXPAND(argc,argv)
699 #ifndef SET_BINARY_MODE
700 # define SET_BINARY_MODE(fd)
704 # define OPEN(name, flags, mode) open(name, flags, mode)
708 # define get_char() get_byte()
712 # define put_char(c) put_byte(c)
714 /* bits.c -- output variable-length bit strings
715 * Copyright (C) 1992-1993 Jean-loup Gailly
716 * This is free software; you can redistribute it and/or modify it under the
717 * terms of the GNU General Public License, see the file COPYING.
724 * Output variable-length bit strings. Compression can be done
725 * to a file or to memory. (The latter is not supported in this version.)
729 * The PKZIP "deflate" file format interprets compressed file data
730 * as a sequence of bits. Multi-bit strings in the file may cross
731 * byte boundaries without restriction.
733 * The first bit of each byte is the low-order bit.
735 * The routines in this file allow a variable-length bit value to
736 * be output right-to-left (useful for literal values). For
737 * left-to-right output (useful for code strings from the tree routines),
738 * the bits must have been reversed first with bi_reverse().
740 * For in-memory compression, the compressed bit stream goes directly
741 * into the requested output buffer. The input data is read in blocks
742 * by the mem_read() function. The buffer is limited to 64K on 16 bit
747 * void bi_init (FILE *zipfile)
748 * Initialize the bit string routines.
750 * void send_bits (int value, int length)
751 * Write out a bit string, taking the source bits right to
754 * int bi_reverse (int value, int length)
755 * Reverse the bits of a bit string, taking the source bits left to
756 * right and emitting them right to left.
758 * void bi_windup (void)
759 * Write out any remaining bits in an incomplete byte.
761 * void copy_block(char *buf, unsigned len, int header)
762 * Copy a stored block to the zip file, storing first the length and
763 * its one's complement if requested.
771 /* ===========================================================================
772 * Local data used by the "bit string" routines.
775 local file_t zfile; /* output gzip file */
777 local unsigned short bi_buf;
778 /* Output buffer. bits are inserted starting at the bottom (least significant
782 #define Buf_size (8 * 2*sizeof(char))
783 /* Number of bits used within bi_buf. (bi_buf might be implemented on
784 * more than 16 bits on some systems.)
788 /* Number of valid bits in bi_buf. All bits above the last valid bit
792 int (*read_buf) OF((char *buf, unsigned size));
793 /* Current input function. Set to mem_read for in-memory compression */
796 ulg bits_sent; /* bit length of the compressed data */
799 /* ===========================================================================
800 * Initialize the bit string routines.
802 void bi_init (zipfile)
803 file_t zipfile; /* output zip file, NO_FILE for in-memory compression */
812 /* Set the defaults for file compression. They are set by memcompress
813 * for in-memory compression.
815 if (zfile != NO_FILE) {
816 read_buf = file_read;
820 /* ===========================================================================
821 * Send a value on a given number of bits.
822 * IN assertion: length <= 16 and value fits in length bits.
824 void send_bits(value, length)
825 int value; /* value to send */
826 int length; /* number of bits */
829 Tracev((stderr," l %2d v %4x ", length, value));
830 Assert(length > 0 && length <= 15, "invalid length");
831 bits_sent += (ulg)length;
833 /* If not enough room in bi_buf, use (valid) bits from bi_buf and
834 * (16 - bi_valid) bits from value, leaving (width - (16-bi_valid))
835 * unused bits in value.
837 if (bi_valid > (int)Buf_size - length) {
838 bi_buf |= (value << bi_valid);
840 bi_buf = (ush)value >> (Buf_size - bi_valid);
841 bi_valid += length - Buf_size;
843 bi_buf |= value << bi_valid;
848 /* ===========================================================================
849 * Reverse the first len bits of a code, using straightforward code (a faster
850 * method would use a table)
851 * IN assertion: 1 <= len <= 15
853 unsigned bi_reverse(code, len)
854 unsigned code; /* the value to invert */
855 int len; /* its bit length */
857 register unsigned res = 0;
860 code >>= 1, res <<= 1;
865 /* ===========================================================================
866 * Write out any remaining bits in an incomplete byte.
872 } else if (bi_valid > 0) {
878 bits_sent = (bits_sent+7) & ~7;
882 /* ===========================================================================
883 * Copy a stored block to the zip file, storing first the length and its
884 * one's complement if requested.
886 void copy_block(buf, len, header)
887 char *buf; /* the input data */
888 unsigned len; /* its length */
889 int header; /* true if block header must be written */
891 bi_windup(); /* align on byte boundary */
895 put_short((ush)~len);
901 bits_sent += (ulg)len<<3;
906 if (key) zencode(*buf, t);
911 /* deflate.c -- compress data using the deflation algorithm
912 * Copyright (C) 1992-1993 Jean-loup Gailly
913 * This is free software; you can redistribute it and/or modify it under the
914 * terms of the GNU General Public License, see the file COPYING.
920 * Identify new text as repetitions of old text within a fixed-
921 * length sliding window trailing behind the new text.
925 * The "deflation" process depends on being able to identify portions
926 * of the input text which are identical to earlier input (within a
927 * sliding window trailing behind the input currently being processed).
929 * The most straightforward technique turns out to be the fastest for
930 * most input files: try all possible matches and select the longest.
931 * The key feature of this algorithm is that insertions into the string
932 * dictionary are very simple and thus fast, and deletions are avoided
933 * completely. Insertions are performed at each input character, whereas
934 * string matches are performed only when the previous match ends. So it
935 * is preferable to spend more time in matches to allow very fast string
936 * insertions and avoid deletions. The matching algorithm for small
937 * strings is inspired from that of Rabin & Karp. A brute force approach
938 * is used to find longer strings when a small match has been found.
939 * A similar algorithm is used in comic (by Jan-Mark Wams) and freeze
940 * (by Leonid Broukhis).
941 * A previous version of this file used a more sophisticated algorithm
942 * (by Fiala and Greene) which is guaranteed to run in linear amortized
943 * time, but has a larger average cost, uses more memory and is patented.
944 * However the F&G algorithm may be faster for some highly redundant
945 * files if the parameter max_chain_length (described below) is too large.
949 * The idea of lazy evaluation of matches is due to Jan-Mark Wams, and
950 * I found it in 'freeze' written by Leonid Broukhis.
951 * Thanks to many info-zippers for bug reports and testing.
955 * APPNOTE.TXT documentation file in PKZIP 1.93a distribution.
957 * A description of the Rabin and Karp algorithm is given in the book
958 * "Algorithms" by R. Sedgewick, Addison-Wesley, p252.
960 * Fiala,E.R., and Greene,D.H.
961 * Data Compression with Finite Windows, Comm.ACM, 32,4 (1989) 490-595
965 * void lm_init (int pack_level, ush *flags)
966 * Initialize the "longest match" routines for a new file
969 * Processes a new input file and return its compressed length. Sets
970 * the compressed length, crc, deflate flags and internal file
976 /* ===========================================================================
977 * Configuration parameters
980 /* Compile with MEDIUM_MEM to reduce the memory requirements or
981 * with SMALL_MEM to use as little memory as possible. Use BIG_MEM if the
982 * entire input file can be held in memory (not possible on 16 bit systems).
983 * Warning: defining these symbols affects HASH_BITS (see below) and thus
984 * affects the compression ratio. The compressed output
985 * is still correct, and might even be smaller in some cases.
989 # define HASH_BITS 13 /* Number of bits used to hash strings */
992 # define HASH_BITS 14
995 # define HASH_BITS 15
996 /* For portability to 16 bit machines, do not use values above 15. */
999 /* To save space (see unlzw.c), we overlay prev+head with tab_prefix and
1000 * window with tab_suffix. Check that we can do this:
1002 #if (WSIZE<<1) > (1<<BITS)
1003 error: cannot overlay window with tab_suffix and prev with tab_prefix0
1005 #if HASH_BITS > BITS-1
1006 error: cannot overlay head with tab_prefix1
1009 #define HASH_SIZE (unsigned)(1<<HASH_BITS)
1010 #define HASH_MASK (HASH_SIZE-1)
1011 #define WMASK (WSIZE-1)
1012 /* HASH_SIZE and WSIZE must be powers of two */
1015 /* Tail of hash chains */
1019 /* speed options for the general purpose bit flag */
1022 # define TOO_FAR 4096
1024 /* Matches of length 3 are discarded if their distance exceeds TOO_FAR */
1026 /* ===========================================================================
1027 * Local data used by the "longest match" routines.
1031 typedef unsigned IPos;
1032 /* A Pos is an index in the character window. We use short instead of int to
1033 * save space in the various tables. IPos is used only for parameter passing.
1036 /* DECLARE(uch, window, 2L*WSIZE); */
1037 /* Sliding window. Input bytes are read into the second half of the window,
1038 * and move to the first half later to keep a dictionary of at least WSIZE
1039 * bytes. With this organization, matches are limited to a distance of
1040 * WSIZE-MAX_MATCH bytes, but this ensures that IO is always
1041 * performed with a length multiple of the block size. Also, it limits
1042 * the window size to 64K, which is quite useful on MSDOS.
1043 * To do: limit the window size to WSIZE+BSZ if SMALL_MEM (the code would
1044 * be less efficient).
1047 /* DECLARE(Pos, prev, WSIZE); */
1048 /* Link to older string with same hash index. To limit the size of this
1049 * array to 64K, this link is maintained only for the last 32K strings.
1050 * An index in this array is thus a window index modulo 32K.
1053 /* DECLARE(Pos, head, 1<<HASH_BITS); */
1054 /* Heads of the hash chains or NIL. */
1056 ulg window_size = (ulg)2*WSIZE;
1057 /* window size, 2*WSIZE except for MMAP or BIG_MEM, where it is the
1058 * input file length plus MIN_LOOKAHEAD.
1062 /* window position at the beginning of the current output block. Gets
1063 * negative when the window is moved backwards.
1066 local unsigned ins_h; /* hash index of string to be inserted */
1068 #define H_SHIFT ((HASH_BITS+MIN_MATCH-1)/MIN_MATCH)
1069 /* Number of bits by which ins_h and del_h must be shifted at each
1070 * input step. It must be such that after MIN_MATCH steps, the oldest
1071 * byte no longer takes part in the hash key, that is:
1072 * H_SHIFT * MIN_MATCH >= HASH_BITS
1075 unsigned int near prev_length;
1076 /* Length of the best match at previous step. Matches not greater than this
1077 * are discarded. This is used in the lazy match evaluation.
1080 unsigned near strstart; /* start of string to insert */
1081 unsigned near match_start; /* start of matching string */
1082 local int eofile; /* flag set at end of input file */
1083 local unsigned lookahead; /* number of valid bytes ahead in window */
1085 unsigned near max_chain_length;
1086 /* To speed up deflation, hash chains are never searched beyond this length.
1087 * A higher limit improves compression ratio but degrades the speed.
1090 local unsigned int max_lazy_match;
1091 /* Attempt to find a better match only when the current match is strictly
1092 * smaller than this value. This mechanism is used only for compression
1095 #define max_insert_length max_lazy_match
1096 /* Insert new strings in the hash table only if the match length
1097 * is not greater than this length. This saves time but degrades compression.
1098 * max_insert_length is used only for compression levels <= 3.
1101 unsigned near good_match;
1102 /* Use a faster search when the previous match is longer than this */
1105 /* Values for max_lazy_match, good_match and max_chain_length, depending on
1106 * the desired pack level (0..9). The values given below have been tuned to
1107 * exclude worst case performance for pathological files. Better values may be
1108 * found for specific files.
1111 typedef struct config {
1112 ush good_length; /* reduce lazy search above this match length */
1113 ush max_lazy; /* do not perform lazy search above this match length */
1114 ush nice_length; /* quit search above this match length */
1119 # define nice_match MAX_MATCH
1121 int near nice_match; /* Stop searching when current match exceeds this */
1124 local config configuration_table =
1125 /* 9 */ {32, 258, 258, 4096}; /* maximum compression */
1127 /* Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4
1128 * For deflate_fast() (levels <= 3) good is ignored and lazy has a different
1133 /* result of memcmp for equal strings */
1135 /* ===========================================================================
1136 * Prototypes for local functions.
1138 local void fill_window OF((void));
1140 int longest_match OF((IPos cur_match));
1142 void match_init OF((void)); /* asm code initialization */
1146 local void check_match OF((IPos start, IPos match, int length));
1149 /* ===========================================================================
1150 * Update a hash value with the given input byte
1151 * IN assertion: all calls to to UPDATE_HASH are made with consecutive
1152 * input characters, so that a running hash key can be computed from the
1153 * previous key instead of complete recalculation each time.
1155 #define UPDATE_HASH(h,c) (h = (((h)<<H_SHIFT) ^ (c)) & HASH_MASK)
1157 /* ===========================================================================
1158 * Insert string s in the dictionary and set match_head to the previous head
1159 * of the hash chain (the most recent string with same hash key). Return
1160 * the previous length of the hash chain.
1161 * IN assertion: all calls to to INSERT_STRING are made with consecutive
1162 * input characters and the first MIN_MATCH bytes of s are valid
1163 * (except for the last MIN_MATCH-1 bytes of the input file).
1165 #define INSERT_STRING(s, match_head) \
1166 (UPDATE_HASH(ins_h, window[(s) + MIN_MATCH-1]), \
1167 prev[(s) & WMASK] = match_head = head[ins_h], \
1170 /* ===========================================================================
1171 * Initialize the "longest match" routines for a new file
1173 void lm_init (flags)
1174 ush *flags; /* general purpose bit flag */
1176 register unsigned j;
1178 /* Initialize the hash table. */
1179 #if defined(MAXSEG_64K) && HASH_BITS == 15
1180 for (j = 0; j < HASH_SIZE; j++) head[j] = NIL;
1182 memzero((char*)head, HASH_SIZE*sizeof(*head));
1184 /* prev will be initialized on the fly */
1186 /* Set the default configuration parameters:
1188 max_lazy_match = configuration_table.max_lazy;
1189 good_match = configuration_table.good_length;
1191 nice_match = configuration_table.nice_length;
1193 max_chain_length = configuration_table.max_chain;
1195 /* ??? reduce max_chain_length for binary files */
1200 match_init(); /* initialize the asm code */
1203 lookahead = read_buf((char*)window,
1204 sizeof(int) <= 2 ? (unsigned)WSIZE : 2*WSIZE);
1206 if (lookahead == 0 || lookahead == (unsigned)EOF) {
1207 eofile = 1, lookahead = 0;
1211 /* Make sure that we always have enough lookahead. This is important
1212 * if input comes from a device such as a tty.
1214 while (lookahead < MIN_LOOKAHEAD && !eofile) fill_window();
1217 for (j=0; j<MIN_MATCH-1; j++) UPDATE_HASH(ins_h, window[j]);
1218 /* If lookahead < MIN_MATCH, ins_h is garbage, but this is
1219 * not important since only literal bytes will be emitted.
1223 /* ===========================================================================
1224 * Set match_start to the longest match starting at the given string and
1225 * return its length. Matches shorter or equal to prev_length are discarded,
1226 * in which case the result is equal to prev_length and match_start is
1228 * IN assertions: cur_match is the head of the hash chain for the current
1229 * string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1
1232 /* For MSDOS, OS/2 and 386 Unix, an optimized version is in match.asm or
1233 * match.s. The code is functionally equivalent, so you can use the C version
1236 int longest_match(cur_match)
1237 IPos cur_match; /* current match */
1239 unsigned chain_length = max_chain_length; /* max hash chain length */
1240 register uch *scan = window + strstart; /* current string */
1241 register uch *match; /* matched string */
1242 register int len; /* length of current match */
1243 int best_len = prev_length; /* best match length so far */
1244 IPos limit = strstart > (IPos)MAX_DIST ? strstart - (IPos)MAX_DIST : NIL;
1245 /* Stop when cur_match becomes <= limit. To simplify the code,
1246 * we prevent matches with the string of window index 0.
1249 /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.
1250 * It is easy to get rid of this optimization if necessary.
1252 #if HASH_BITS < 8 || MAX_MATCH != 258
1253 error: Code too clever
1257 /* Compare two bytes at a time. Note: this is not always beneficial.
1258 * Try with and without -DUNALIGNED_OK to check.
1260 register uch *strend = window + strstart + MAX_MATCH - 1;
1261 register ush scan_start = *(ush*)scan;
1262 register ush scan_end = *(ush*)(scan+best_len-1);
1264 register uch *strend = window + strstart + MAX_MATCH;
1265 register uch scan_end1 = scan[best_len-1];
1266 register uch scan_end = scan[best_len];
1269 /* Do not waste too much time if we already have a good match: */
1270 if (prev_length >= good_match) {
1273 Assert(strstart <= window_size-MIN_LOOKAHEAD, "insufficient lookahead");
1276 Assert(cur_match < strstart, "no future");
1277 match = window + cur_match;
1279 /* Skip to next match if the match length cannot increase
1280 * or if the match length is less than 2:
1282 #if (defined(UNALIGNED_OK) && MAX_MATCH == 258)
1283 /* This code assumes sizeof(unsigned short) == 2. Do not use
1284 * UNALIGNED_OK if your compiler uses a different size.
1286 if (*(ush*)(match+best_len-1) != scan_end ||
1287 *(ush*)match != scan_start) continue;
1289 /* It is not necessary to compare scan[2] and match[2] since they are
1290 * always equal when the other bytes match, given that the hash keys
1291 * are equal and that HASH_BITS >= 8. Compare 2 bytes at a time at
1292 * strstart+3, +5, ... up to strstart+257. We check for insufficient
1293 * lookahead only every 4th comparison; the 128th check will be made
1294 * at strstart+257. If MAX_MATCH-2 is not a multiple of 8, it is
1295 * necessary to put more guard bytes at the end of the window, or
1296 * to check more often for insufficient lookahead.
1300 } while (*(ush*)(scan+=2) == *(ush*)(match+=2) &&
1301 *(ush*)(scan+=2) == *(ush*)(match+=2) &&
1302 *(ush*)(scan+=2) == *(ush*)(match+=2) &&
1303 *(ush*)(scan+=2) == *(ush*)(match+=2) &&
1305 /* The funny "do {}" generates better code on most compilers */
1307 /* Here, scan <= window+strstart+257 */
1308 Assert(scan <= window+(unsigned)(window_size-1), "wild scan");
1309 if (*scan == *match) scan++;
1311 len = (MAX_MATCH - 1) - (int)(strend-scan);
1312 scan = strend - (MAX_MATCH-1);
1314 #else /* UNALIGNED_OK */
1316 if (match[best_len] != scan_end ||
1317 match[best_len-1] != scan_end1 ||
1319 *++match != scan[1]) continue;
1321 /* The check at best_len-1 can be removed because it will be made
1322 * again later. (This heuristic is not always a win.)
1323 * It is not necessary to compare scan[2] and match[2] since they
1324 * are always equal when the other bytes match, given that
1325 * the hash keys are equal and that HASH_BITS >= 8.
1329 /* We check for insufficient lookahead only every 8th comparison;
1330 * the 256th check will be made at strstart+258.
1333 } while (*++scan == *++match && *++scan == *++match &&
1334 *++scan == *++match && *++scan == *++match &&
1335 *++scan == *++match && *++scan == *++match &&
1336 *++scan == *++match && *++scan == *++match &&
1339 len = MAX_MATCH - (int)(strend - scan);
1340 scan = strend - MAX_MATCH;
1342 #endif /* UNALIGNED_OK */
1344 if (len > best_len) {
1345 match_start = cur_match;
1347 if (len >= nice_match) break;
1349 scan_end = *(ush*)(scan+best_len-1);
1351 scan_end1 = scan[best_len-1];
1352 scan_end = scan[best_len];
1355 } while ((cur_match = prev[cur_match & WMASK]) > limit
1356 && --chain_length != 0);
1363 /* ===========================================================================
1364 * Check that the match at match_start is indeed a match.
1366 local void check_match(start, match, length)
1370 /* check that the match is indeed a match */
1371 if (memcmp((char*)window + match,
1372 (char*)window + start, length) != EQUAL) {
1374 " start %d, match %d, length %d\n",
1375 start, match, length);
1376 error("invalid match");
1379 fprintf(stderr,"\\[%d,%d]", start-match, length);
1380 do { putc(window[start++], stderr); } while (--length != 0);
1384 # define check_match(start, match, length)
1387 /* ===========================================================================
1388 * Fill the window when the lookahead becomes insufficient.
1389 * Updates strstart and lookahead, and sets eofile if end of input file.
1390 * IN assertion: lookahead < MIN_LOOKAHEAD && strstart + lookahead > 0
1391 * OUT assertions: at least one byte has been read, or eofile is set;
1392 * file reads are performed for at least two bytes (required for the
1393 * translate_eol option).
1395 local void fill_window()
1397 register unsigned n, m;
1398 unsigned more = (unsigned)(window_size - (ulg)lookahead - (ulg)strstart);
1399 /* Amount of free space at the end of the window. */
1401 /* If the window is almost full and there is insufficient lookahead,
1402 * move the upper half to the lower one to make room in the upper half.
1404 if (more == (unsigned)EOF) {
1405 /* Very unlikely, but possible on 16 bit machine if strstart == 0
1406 * and lookahead == 1 (input done one byte at time)
1409 } else if (strstart >= WSIZE+MAX_DIST) {
1410 /* By the IN assertion, the window is not empty so we can't confuse
1411 * more == 0 with more == 64K on a 16 bit machine.
1413 Assert(window_size == (ulg)2*WSIZE, "no sliding with BIG_MEM");
1415 memcpy((char*)window, (char*)window+WSIZE, (unsigned)WSIZE);
1416 match_start -= WSIZE;
1417 strstart -= WSIZE; /* we now have strstart >= MAX_DIST: */
1419 block_start -= (long) WSIZE;
1421 for (n = 0; n < HASH_SIZE; n++) {
1423 head[n] = (Pos)(m >= WSIZE ? m-WSIZE : NIL);
1425 for (n = 0; n < WSIZE; n++) {
1427 prev[n] = (Pos)(m >= WSIZE ? m-WSIZE : NIL);
1428 /* If n is not on any hash chain, prev[n] is garbage but
1429 * its value will never be used.
1434 /* At this point, more >= 2 */
1436 n = read_buf((char*)window+strstart+lookahead, more);
1437 if (n == 0 || n == (unsigned)EOF) {
1445 /* ===========================================================================
1446 * Flush the current block, with given end-of-file flag.
1447 * IN assertion: strstart is set to the end of the current match.
1449 #define FLUSH_BLOCK(eof) \
1450 flush_block(block_start >= 0L ? (char*)&window[(unsigned)block_start] : \
1451 (char*)NULL, (long)strstart - block_start, (eof))
1453 /* ===========================================================================
1454 * Same as above, but achieves better compression. We use a lazy
1455 * evaluation for matches: a match is finally adopted only if there is
1456 * no better match at the next window position.
1460 IPos hash_head; /* head of hash chain */
1461 IPos prev_match; /* previous match */
1462 int flush; /* set if current block must be flushed */
1463 int match_available = 0; /* set if previous match exists */
1464 register unsigned match_length = MIN_MATCH-1; /* length of best match */
1466 extern long isize; /* byte length of input file, for debug only */
1469 /* Process the input block. */
1470 while (lookahead != 0) {
1471 /* Insert the string window[strstart .. strstart+2] in the
1472 * dictionary, and set hash_head to the head of the hash chain:
1474 INSERT_STRING(strstart, hash_head);
1476 /* Find the longest match, discarding those <= prev_length.
1478 prev_length = match_length, prev_match = match_start;
1479 match_length = MIN_MATCH-1;
1481 if (hash_head != NIL && prev_length < max_lazy_match &&
1482 strstart - hash_head <= MAX_DIST) {
1483 /* To simplify the code, we prevent matches with the string
1484 * of window index 0 (in particular we have to avoid a match
1485 * of the string with itself at the start of the input file).
1487 match_length = longest_match (hash_head);
1488 /* longest_match() sets match_start */
1489 if (match_length > lookahead) match_length = lookahead;
1491 /* Ignore a length 3 match if it is too distant: */
1492 if (match_length == MIN_MATCH && strstart-match_start > TOO_FAR){
1493 /* If prev_match is also MIN_MATCH, match_start is garbage
1494 * but we will ignore the current match anyway.
1499 /* If there was a match at the previous step and the current
1500 * match is not better, output the previous match:
1502 if (prev_length >= MIN_MATCH && match_length <= prev_length) {
1504 check_match(strstart-1, prev_match, prev_length);
1506 flush = ct_tally(strstart-1-prev_match, prev_length - MIN_MATCH);
1508 /* Insert in hash table all strings up to the end of the match.
1509 * strstart-1 and strstart are already inserted.
1511 lookahead -= prev_length-1;
1515 INSERT_STRING(strstart, hash_head);
1516 /* strstart never exceeds WSIZE-MAX_MATCH, so there are
1517 * always MIN_MATCH bytes ahead. If lookahead < MIN_MATCH
1518 * these bytes are garbage, but it does not matter since the
1519 * next lookahead bytes will always be emitted as literals.
1521 } while (--prev_length != 0);
1522 match_available = 0;
1523 match_length = MIN_MATCH-1;
1525 if (flush) FLUSH_BLOCK(0), block_start = strstart;
1527 } else if (match_available) {
1528 /* If there was no match at the previous position, output a
1529 * single literal. If there was a match but the current match
1530 * is longer, truncate the previous match to a single literal.
1532 Tracevv((stderr,"%c",window[strstart-1]));
1533 if (ct_tally (0, window[strstart-1])) {
1534 FLUSH_BLOCK(0), block_start = strstart;
1539 /* There is no previous match to compare with, wait for
1540 * the next step to decide.
1542 match_available = 1;
1546 Assert (strstart <= isize && lookahead <= isize, "a bit too far");
1548 /* Make sure that we always have enough lookahead, except
1549 * at the end of the input file. We need MAX_MATCH bytes
1550 * for the next match, plus MIN_MATCH bytes to insert the
1551 * string following the next match.
1553 while (lookahead < MIN_LOOKAHEAD && !eofile) fill_window();
1555 if (match_available) ct_tally (0, window[strstart-1]);
1557 return FLUSH_BLOCK(1); /* eof */
1559 /* gzip (GNU zip) -- compress files with zip algorithm and 'compress' interface
1560 * Copyright (C) 1992-1993 Jean-loup Gailly
1561 * The unzip code was written and put in the public domain by Mark Adler.
1562 * Portions of the lzw code are derived from the public domain 'compress'
1563 * written by Spencer Thomas, Joe Orost, James Woods, Jim McKie, Steve Davies,
1564 * Ken Turkowski, Dave Mack and Peter Jannesen.
1566 * See the license_msg below and the file COPYING for the software license.
1567 * See the file algorithm.doc for the compression algorithms and file formats.
1570 /* Compress files with zip algorithm and 'compress' interface.
1571 * See usage() and help() functions below for all options.
1573 * file.gz: compressed file with same mode, owner, and utimes
1574 * or stdout with -c option or if stdin used as input.
1575 * If the output file name had to be truncated, the original name is kept
1576 * in the compressed file.
1577 * On MSDOS, file.tmp -> file.tmz. On VMS, file.tmp -> file.tmp-gz.
1579 * Using gz on MSDOS would create too many file name conflicts. For
1580 * example, foo.txt -> foo.tgz (.tgz must be reserved as shorthand for
1581 * tar.gz). Similarly, foo.dir and foo.doc would both be mapped to foo.dgz.
1582 * I also considered 12345678.txt -> 12345txt.gz but this truncates the name
1583 * too heavily. There is no ideal solution given the MSDOS 8+3 limitation.
1585 * For the meaning of all compilation flags, see comments in Makefile.in.
1589 #include <sys/types.h>
1591 #include <sys/stat.h>
1597 # include <sys/time.h>
1606 #ifdef HAVE_UNISTD_H
1607 # include <unistd.h>
1610 #if defined(STDC_HEADERS) || !defined(NO_STDLIB_H)
1611 # include <stdlib.h>
1617 # include <dirent.h>
1618 typedef struct dirent dir_type;
1619 # define NLENGTH(dirent) ((int)strlen((dirent)->d_name))
1620 # define DIR_OPT "DIRENT"
1622 # define NLENGTH(dirent) ((dirent)->d_namlen)
1624 # include <sys/dir.h>
1625 typedef struct direct dir_type;
1626 # define DIR_OPT "SYSDIR"
1629 # include <sys/ndir.h>
1630 typedef struct direct dir_type;
1631 # define DIR_OPT "SYSNDIR"
1635 typedef struct direct dir_type;
1636 # define DIR_OPT "NDIR"
1639 # define DIR_OPT "NO_DIR"
1648 # define TIME_OPT "UTIME"
1650 # ifdef HAVE_SYS_UTIME_H
1651 # include <sys/utime.h>
1652 # define TIME_OPT "SYS_UTIME"
1658 # define TIME_OPT ""
1662 # define TIME_OPT "NO_UTIME"
1665 #if !defined(S_ISDIR) && defined(S_IFDIR)
1666 # define S_ISDIR(m) (((m) & S_IFMT) == S_IFDIR)
1668 #if !defined(S_ISREG) && defined(S_IFREG)
1669 # define S_ISREG(m) (((m) & S_IFMT) == S_IFREG)
1672 typedef RETSIGTYPE (*sig_type) OF((int));
1675 # define O_BINARY 0 /* creation mode for open() */
1679 /* Pure BSD system? */
1680 # include <sys/file.h>
1682 # define O_CREAT FCREAT
1685 # define O_EXCL FEXCL
1690 # define S_IRUSR 0400
1693 # define S_IWUSR 0200
1695 #define RW_USER (S_IRUSR | S_IWUSR) /* creation mode for open() */
1697 #ifndef MAX_PATH_LEN
1698 # define MAX_PATH_LEN 1024 /* max pathname length */
1707 off_t lseek OF((int fd, off_t offset, int whence));
1710 /* Separator for file name parts (see shorten_name()) */
1711 #ifdef NO_MULTIPLE_DOTS
1712 # define PART_SEP "-"
1714 # define PART_SEP "."
1717 /* global buffers */
1719 DECLARE(uch, inbuf, INBUFSIZ +INBUF_EXTRA);
1720 DECLARE(uch, outbuf, OUTBUFSIZ+OUTBUF_EXTRA);
1721 DECLARE(ush, d_buf, DIST_BUFSIZE);
1722 DECLARE(uch, window, 2L*WSIZE);
1724 DECLARE(ush, tab_prefix, 1L<<BITS);
1726 DECLARE(ush, tab_prefix0, 1L<<(BITS-1));
1727 DECLARE(ush, tab_prefix1, 1L<<(BITS-1));
1730 /* local variables */
1732 int ascii = 0; /* convert end-of-lines to local OS conventions */
1733 int decompress = 0; /* decompress (-d) */
1734 int tostdout = 0; /* uncompress to stdout (-c) */
1735 int no_name = -1; /* don't save or restore the original file name */
1736 int no_time = -1; /* don't save or restore the original file time */
1737 int foreground; /* set if program run in foreground */
1738 char *progname; /* program name */
1739 static int method = DEFLATED;/* compression method */
1740 static int exit_code = OK; /* program exit code */
1741 int save_orig_name; /* set if original name must be saved */
1742 int last_member; /* set for .zip and .Z files */
1743 int part_nb; /* number of parts in .gz file */
1744 long time_stamp; /* original time stamp (modification time) */
1745 long ifile_size; /* input file size, -1 for devices (debug only) */
1746 char *env; /* contents of GZIP env variable */
1747 char **args = NULL; /* argv pointer if GZIP env variable defined */
1748 char z_suffix[MAX_SUFFIX+1]; /* default suffix (can be set with --suffix) */
1749 int z_len; /* strlen(z_suffix) */
1751 long bytes_in; /* number of input bytes */
1752 long bytes_out; /* number of output bytes */
1753 char ifname[MAX_PATH_LEN]; /* input file name */
1754 char ofname[MAX_PATH_LEN]; /* output file name */
1755 int remove_ofname = 0; /* remove output file on error */
1756 struct stat istat; /* status for input file */
1757 int ifd; /* input file descriptor */
1758 int ofd; /* output file descriptor */
1759 unsigned insize; /* valid bytes in inbuf */
1760 unsigned inptr; /* index of next byte to be processed in inbuf */
1761 unsigned outcnt; /* bytes in output buffer */
1763 /* local functions */
1765 #define strequ(s1, s2) (strcmp((s1),(s2)) == 0)
1767 /* ======================================================================== */
1768 // int main (argc, argv)
1771 int gzip_main(int argc, char ** argv)
1777 /* Parse any options */
1778 while (--argc > 0 && **(++argv) == '-') {
1779 while (*(++(*argv))) {
1790 foreground = signal(SIGINT, SIG_IGN) != SIG_IGN;
1792 (void) signal (SIGINT, (sig_type)abort_gzip);
1795 if (signal(SIGTERM, SIG_IGN) != SIG_IGN) {
1796 (void) signal(SIGTERM, (sig_type)abort_gzip);
1800 if (signal(SIGHUP, SIG_IGN) != SIG_IGN) {
1801 (void) signal(SIGHUP, (sig_type)abort_gzip);
1805 strncpy(z_suffix, Z_SUFFIX, sizeof(z_suffix)-1);
1806 z_len = strlen(z_suffix);
1808 /* Allocate all global buffers (for DYN_ALLOC option) */
1809 ALLOC(uch, inbuf, INBUFSIZ +INBUF_EXTRA);
1810 ALLOC(uch, outbuf, OUTBUFSIZ+OUTBUF_EXTRA);
1811 ALLOC(ush, d_buf, DIST_BUFSIZE);
1812 ALLOC(uch, window, 2L*WSIZE);
1814 ALLOC(ush, tab_prefix, 1L<<BITS);
1816 ALLOC(ush, tab_prefix0, 1L<<(BITS-1));
1817 ALLOC(ush, tab_prefix1, 1L<<(BITS-1));
1821 /* And get to work */
1822 SET_BINARY_MODE(fileno(stdout));
1823 strcpy(ifname, "stdin");
1824 strcpy(ofname, "stdout");
1825 inFileNum=fileno(stdin);
1826 outFileNum=fileno(stdout);
1828 /* Get the time stamp on the input file. */
1829 time_stamp = 0; /* time unknown by default */
1831 ifile_size = -1L; /* convention for unknown size */
1833 clear_bufs(); /* clear input and output buffers */
1836 /* Actually do the compression/decompression. */
1837 zip(inFileNum, outFileNum);
1841 struct stat statBuf;
1843 /* And get to work */
1846 strncpy(ifname, *argv, MAX_PATH_LEN);
1847 strncpy(ofname, *argv, MAX_PATH_LEN-4);
1848 strcat(ofname, ".gz");
1850 inFileNum=open( ifname, O_RDONLY);
1851 if (inFileNum < 0) {
1855 result = stat(ifname, &statBuf);
1861 outFileNum=open( ofname, O_RDONLY);
1862 if (outFileNum < 0) {
1866 SET_BINARY_MODE(outFileNum);
1868 /* Get the time stamp on the input file. */
1869 time_stamp = statBuf.st_ctime; /* time unknown by default */
1871 ifile_size = statBuf.st_size; /* convention for unknown size */
1873 clear_bufs(); /* clear input and output buffers */
1876 /* Actually do the compression/decompression. */
1877 zip(inFileNum, outFileNum);
1883 /* ========================================================================
1884 * Free all dynamically allocated variables and exit with the given code.
1886 local void do_exit(int exitcode)
1888 static int in_exit = 0;
1890 if (in_exit) exit(exitcode);
1892 if (env != NULL) free(env), env = NULL;
1893 if (args != NULL) free((char*)args), args = NULL;
1906 /* trees.c -- output deflated data using Huffman coding
1907 * Copyright (C) 1992-1993 Jean-loup Gailly
1908 * This is free software; you can redistribute it and/or modify it under the
1909 * terms of the GNU General Public License, see the file COPYING.
1915 * Encode various sets of source values using variable-length
1916 * binary code trees.
1920 * The PKZIP "deflation" process uses several Huffman trees. The more
1921 * common source values are represented by shorter bit sequences.
1923 * Each code tree is stored in the ZIP file in a compressed form
1924 * which is itself a Huffman encoding of the lengths of
1925 * all the code strings (in ascending order by source values).
1926 * The actual code strings are reconstructed from the lengths in
1927 * the UNZIP process, as described in the "application note"
1928 * (APPNOTE.TXT) distributed as part of PKWARE's PKZIP program.
1933 * Data Compression: Techniques and Applications, pp. 53-55.
1934 * Lifetime Learning Publications, 1985. ISBN 0-534-03418-7.
1937 * Data Compression: Methods and Theory, pp. 49-50.
1938 * Computer Science Press, 1988. ISBN 0-7167-8156-5.
1942 * Addison-Wesley, 1983. ISBN 0-201-06672-6.
1946 * void ct_init (ush *attr, int *methodp)
1947 * Allocate the match buffer, initialize the various tables and save
1948 * the location of the internal file attribute (ascii/binary) and
1949 * method (DEFLATE/STORE)
1951 * void ct_tally (int dist, int lc);
1952 * Save the match info and tally the frequency counts.
1954 * long flush_block (char *buf, ulg stored_len, int eof)
1955 * Determine the best encoding for the current block: dynamic trees,
1956 * static trees or store, and output the encoded block to the zip
1957 * file. Returns the total compressed length for the file so far.
1963 /* ===========================================================================
1968 /* All codes must not exceed MAX_BITS bits */
1970 #define MAX_BL_BITS 7
1971 /* Bit length codes must not exceed MAX_BL_BITS bits */
1973 #define LENGTH_CODES 29
1974 /* number of length codes, not counting the special END_BLOCK code */
1976 #define LITERALS 256
1977 /* number of literal bytes 0..255 */
1979 #define END_BLOCK 256
1980 /* end of block literal code */
1982 #define L_CODES (LITERALS+1+LENGTH_CODES)
1983 /* number of Literal or Length codes, including the END_BLOCK code */
1986 /* number of distance codes */
1989 /* number of codes used to transfer the bit lengths */
1992 local int near extra_lbits[LENGTH_CODES] /* extra bits for each length code */
1993 = {0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0};
1995 local int near extra_dbits[D_CODES] /* extra bits for each distance code */
1996 = {0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13};
1998 local int near extra_blbits[BL_CODES]/* extra bits for each bit length code */
1999 = {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7};
2001 #define STORED_BLOCK 0
2002 #define STATIC_TREES 1
2004 /* The three kinds of block type */
2008 # define LIT_BUFSIZE 0x2000
2011 # define LIT_BUFSIZE 0x4000
2013 # define LIT_BUFSIZE 0x8000
2017 #ifndef DIST_BUFSIZE
2018 # define DIST_BUFSIZE LIT_BUFSIZE
2020 /* Sizes of match buffers for literals/lengths and distances. There are
2021 * 4 reasons for limiting LIT_BUFSIZE to 64K:
2022 * - frequencies can be kept in 16 bit counters
2023 * - if compression is not successful for the first block, all input data is
2024 * still in the window so we can still emit a stored block even when input
2025 * comes from standard input. (This can also be done for all blocks if
2026 * LIT_BUFSIZE is not greater than 32K.)
2027 * - if compression is not successful for a file smaller than 64K, we can
2028 * even emit a stored file instead of a stored block (saving 5 bytes).
2029 * - creating new Huffman trees less frequently may not provide fast
2030 * adaptation to changes in the input data statistics. (Take for
2031 * example a binary file with poorly compressible code followed by
2032 * a highly compressible string table.) Smaller buffer sizes give
2033 * fast adaptation but have of course the overhead of transmitting trees
2035 * - I can't count above 4
2036 * The current code is general and allows DIST_BUFSIZE < LIT_BUFSIZE (to save
2037 * memory at the expense of compression). Some optimizations would be possible
2038 * if we rely on DIST_BUFSIZE == LIT_BUFSIZE.
2040 #if LIT_BUFSIZE > INBUFSIZ
2041 error cannot overlay l_buf and inbuf
2045 /* repeat previous bit length 3-6 times (2 bits of repeat count) */
2047 #define REPZ_3_10 17
2048 /* repeat a zero length 3-10 times (3 bits of repeat count) */
2050 #define REPZ_11_138 18
2051 /* repeat a zero length 11-138 times (7 bits of repeat count) */
2053 /* ===========================================================================
2057 /* Data structure describing a single value and its code string. */
2058 typedef struct ct_data {
2060 ush freq; /* frequency count */
2061 ush code; /* bit string */
2064 ush dad; /* father node in Huffman tree */
2065 ush len; /* length of bit string */
2069 #define Freq fc.freq
2070 #define Code fc.code
2074 #define HEAP_SIZE (2*L_CODES+1)
2075 /* maximum heap size */
2077 local ct_data near dyn_ltree[HEAP_SIZE]; /* literal and length tree */
2078 local ct_data near dyn_dtree[2*D_CODES+1]; /* distance tree */
2080 local ct_data near static_ltree[L_CODES+2];
2081 /* The static literal tree. Since the bit lengths are imposed, there is no
2082 * need for the L_CODES extra codes used during heap construction. However
2083 * The codes 286 and 287 are needed to build a canonical tree (see ct_init
2087 local ct_data near static_dtree[D_CODES];
2088 /* The static distance tree. (Actually a trivial tree since all codes use
2092 local ct_data near bl_tree[2*BL_CODES+1];
2093 /* Huffman tree for the bit lengths */
2095 typedef struct tree_desc {
2096 ct_data near *dyn_tree; /* the dynamic tree */
2097 ct_data near *static_tree; /* corresponding static tree or NULL */
2098 int near *extra_bits; /* extra bits for each code or NULL */
2099 int extra_base; /* base index for extra_bits */
2100 int elems; /* max number of elements in the tree */
2101 int max_length; /* max bit length for the codes */
2102 int max_code; /* largest code with non zero frequency */
2105 local tree_desc near l_desc =
2106 {dyn_ltree, static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS, 0};
2108 local tree_desc near d_desc =
2109 {dyn_dtree, static_dtree, extra_dbits, 0, D_CODES, MAX_BITS, 0};
2111 local tree_desc near bl_desc =
2112 {bl_tree, (ct_data near *)0, extra_blbits, 0, BL_CODES, MAX_BL_BITS, 0};
2115 local ush near bl_count[MAX_BITS+1];
2116 /* number of codes at each bit length for an optimal tree */
2118 local uch near bl_order[BL_CODES]
2119 = {16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15};
2120 /* The lengths of the bit length codes are sent in order of decreasing
2121 * probability, to avoid transmitting the lengths for unused bit length codes.
2124 local int near heap[2*L_CODES+1]; /* heap used to build the Huffman trees */
2125 local int heap_len; /* number of elements in the heap */
2126 local int heap_max; /* element of largest frequency */
2127 /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.
2128 * The same heap array is used to build all trees.
2131 local uch near depth[2*L_CODES+1];
2132 /* Depth of each subtree used as tie breaker for trees of equal frequency */
2134 local uch length_code[MAX_MATCH-MIN_MATCH+1];
2135 /* length code for each normalized match length (0 == MIN_MATCH) */
2137 local uch dist_code[512];
2138 /* distance codes. The first 256 values correspond to the distances
2139 * 3 .. 258, the last 256 values correspond to the top 8 bits of
2140 * the 15 bit distances.
2143 local int near base_length[LENGTH_CODES];
2144 /* First normalized length for each code (0 = MIN_MATCH) */
2146 local int near base_dist[D_CODES];
2147 /* First normalized distance for each code (0 = distance of 1) */
2150 /* DECLARE(uch, l_buf, LIT_BUFSIZE); buffer for literals or lengths */
2152 /* DECLARE(ush, d_buf, DIST_BUFSIZE); buffer for distances */
2154 local uch near flag_buf[(LIT_BUFSIZE/8)];
2155 /* flag_buf is a bit array distinguishing literals from lengths in
2156 * l_buf, thus indicating the presence or absence of a distance.
2159 local unsigned last_lit; /* running index in l_buf */
2160 local unsigned last_dist; /* running index in d_buf */
2161 local unsigned last_flags; /* running index in flag_buf */
2162 local uch flags; /* current flags not yet saved in flag_buf */
2163 local uch flag_bit; /* current bit used in flags */
2164 /* bits are filled in flags starting at bit 0 (least significant).
2165 * Note: these flags are overkill in the current code since we don't
2166 * take advantage of DIST_BUFSIZE == LIT_BUFSIZE.
2169 local ulg opt_len; /* bit length of current block with optimal trees */
2170 local ulg static_len; /* bit length of current block with static trees */
2172 local ulg compressed_len; /* total bit length of compressed file */
2174 local ulg input_len; /* total byte length of input file */
2175 /* input_len is for debugging only since we can get it by other means. */
2177 ush *file_type; /* pointer to UNKNOWN, BINARY or ASCII */
2178 int *file_method; /* pointer to DEFLATE or STORE */
2181 extern ulg bits_sent; /* bit length of the compressed data */
2182 extern long isize; /* byte length of input file */
2185 extern long block_start; /* window offset of current block */
2186 extern unsigned near strstart; /* window offset of current string */
2188 /* ===========================================================================
2189 * Local (static) routines in this file.
2192 local void init_block OF((void));
2193 local void pqdownheap OF((ct_data near *tree, int k));
2194 local void gen_bitlen OF((tree_desc near *desc));
2195 local void gen_codes OF((ct_data near *tree, int max_code));
2196 local void build_tree OF((tree_desc near *desc));
2197 local void scan_tree OF((ct_data near *tree, int max_code));
2198 local void send_tree OF((ct_data near *tree, int max_code));
2199 local int build_bl_tree OF((void));
2200 local void send_all_trees OF((int lcodes, int dcodes, int blcodes));
2201 local void compress_block OF((ct_data near *ltree, ct_data near *dtree));
2202 local void set_file_type OF((void));
2206 # define send_code(c, tree) send_bits(tree[c].Code, tree[c].Len)
2207 /* Send a code of the given tree. c and tree must not have side effects */
2210 # define send_code(c, tree) \
2211 { if (verbose>1) fprintf(stderr,"\ncd %3d ",(c)); \
2212 send_bits(tree[c].Code, tree[c].Len); }
2215 #define d_code(dist) \
2216 ((dist) < 256 ? dist_code[dist] : dist_code[256+((dist)>>7)])
2217 /* Mapping from a distance to a distance code. dist is the distance - 1 and
2218 * must not have side effects. dist_code[256] and dist_code[257] are never
2222 #define MAX(a,b) (a >= b ? a : b)
2223 /* the arguments must not have side effects */
2225 /* ===========================================================================
2226 * Allocate the match buffer, initialize the various tables and save the
2227 * location of the internal file attribute (ascii/binary) and method
2230 void ct_init(attr, methodp)
2231 ush *attr; /* pointer to internal file attribute */
2232 int *methodp; /* pointer to compression method */
2234 int n; /* iterates over tree elements */
2235 int bits; /* bit counter */
2236 int length; /* length value */
2237 int code; /* code value */
2238 int dist; /* distance index */
2241 file_method = methodp;
2242 compressed_len = input_len = 0L;
2244 if (static_dtree[0].Len != 0) return; /* ct_init already called */
2246 /* Initialize the mapping length (0..255) -> length code (0..28) */
2248 for (code = 0; code < LENGTH_CODES-1; code++) {
2249 base_length[code] = length;
2250 for (n = 0; n < (1<<extra_lbits[code]); n++) {
2251 length_code[length++] = (uch)code;
2254 Assert (length == 256, "ct_init: length != 256");
2255 /* Note that the length 255 (match length 258) can be represented
2256 * in two different ways: code 284 + 5 bits or code 285, so we
2257 * overwrite length_code[255] to use the best encoding:
2259 length_code[length-1] = (uch)code;
2261 /* Initialize the mapping dist (0..32K) -> dist code (0..29) */
2263 for (code = 0 ; code < 16; code++) {
2264 base_dist[code] = dist;
2265 for (n = 0; n < (1<<extra_dbits[code]); n++) {
2266 dist_code[dist++] = (uch)code;
2269 Assert (dist == 256, "ct_init: dist != 256");
2270 dist >>= 7; /* from now on, all distances are divided by 128 */
2271 for ( ; code < D_CODES; code++) {
2272 base_dist[code] = dist << 7;
2273 for (n = 0; n < (1<<(extra_dbits[code]-7)); n++) {
2274 dist_code[256 + dist++] = (uch)code;
2277 Assert (dist == 256, "ct_init: 256+dist != 512");
2279 /* Construct the codes of the static literal tree */
2280 for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0;
2282 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++;
2283 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++;
2284 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++;
2285 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++;
2286 /* Codes 286 and 287 do not exist, but we must include them in the
2287 * tree construction to get a canonical Huffman tree (longest code
2290 gen_codes((ct_data near *)static_ltree, L_CODES+1);
2292 /* The static distance tree is trivial: */
2293 for (n = 0; n < D_CODES; n++) {
2294 static_dtree[n].Len = 5;
2295 static_dtree[n].Code = bi_reverse(n, 5);
2298 /* Initialize the first block of the first file: */
2302 /* ===========================================================================
2303 * Initialize a new block.
2305 local void init_block()
2307 int n; /* iterates over tree elements */
2309 /* Initialize the trees. */
2310 for (n = 0; n < L_CODES; n++) dyn_ltree[n].Freq = 0;
2311 for (n = 0; n < D_CODES; n++) dyn_dtree[n].Freq = 0;
2312 for (n = 0; n < BL_CODES; n++) bl_tree[n].Freq = 0;
2314 dyn_ltree[END_BLOCK].Freq = 1;
2315 opt_len = static_len = 0L;
2316 last_lit = last_dist = last_flags = 0;
2317 flags = 0; flag_bit = 1;
2321 /* Index within the heap array of least frequent node in the Huffman tree */
2324 /* ===========================================================================
2325 * Remove the smallest element from the heap and recreate the heap with
2326 * one less element. Updates heap and heap_len.
2328 #define pqremove(tree, top) \
2330 top = heap[SMALLEST]; \
2331 heap[SMALLEST] = heap[heap_len--]; \
2332 pqdownheap(tree, SMALLEST); \
2335 /* ===========================================================================
2336 * Compares to subtrees, using the tree depth as tie breaker when
2337 * the subtrees have equal frequency. This minimizes the worst case length.
2339 #define smaller(tree, n, m) \
2340 (tree[n].Freq < tree[m].Freq || \
2341 (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
2343 /* ===========================================================================
2344 * Restore the heap property by moving down the tree starting at node k,
2345 * exchanging a node with the smallest of its two sons if necessary, stopping
2346 * when the heap property is re-established (each father smaller than its
2349 local void pqdownheap(tree, k)
2350 ct_data near *tree; /* the tree to restore */
2351 int k; /* node to move down */
2354 int j = k << 1; /* left son of k */
2355 while (j <= heap_len) {
2356 /* Set j to the smallest of the two sons: */
2357 if (j < heap_len && smaller(tree, heap[j+1], heap[j])) j++;
2359 /* Exit if v is smaller than both sons */
2360 if (smaller(tree, v, heap[j])) break;
2362 /* Exchange v with the smallest son */
2363 heap[k] = heap[j]; k = j;
2365 /* And continue down the tree, setting j to the left son of k */
2371 /* ===========================================================================
2372 * Compute the optimal bit lengths for a tree and update the total bit length
2373 * for the current block.
2374 * IN assertion: the fields freq and dad are set, heap[heap_max] and
2375 * above are the tree nodes sorted by increasing frequency.
2376 * OUT assertions: the field len is set to the optimal bit length, the
2377 * array bl_count contains the frequencies for each bit length.
2378 * The length opt_len is updated; static_len is also updated if stree is
2381 local void gen_bitlen(desc)
2382 tree_desc near *desc; /* the tree descriptor */
2384 ct_data near *tree = desc->dyn_tree;
2385 int near *extra = desc->extra_bits;
2386 int base = desc->extra_base;
2387 int max_code = desc->max_code;
2388 int max_length = desc->max_length;
2389 ct_data near *stree = desc->static_tree;
2390 int h; /* heap index */
2391 int n, m; /* iterate over the tree elements */
2392 int bits; /* bit length */
2393 int xbits; /* extra bits */
2394 ush f; /* frequency */
2395 int overflow = 0; /* number of elements with bit length too large */
2397 for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0;
2399 /* In a first pass, compute the optimal bit lengths (which may
2400 * overflow in the case of the bit length tree).
2402 tree[heap[heap_max]].Len = 0; /* root of the heap */
2404 for (h = heap_max+1; h < HEAP_SIZE; h++) {
2406 bits = tree[tree[n].Dad].Len + 1;
2407 if (bits > max_length) bits = max_length, overflow++;
2408 tree[n].Len = (ush)bits;
2409 /* We overwrite tree[n].Dad which is no longer needed */
2411 if (n > max_code) continue; /* not a leaf node */
2415 if (n >= base) xbits = extra[n-base];
2417 opt_len += (ulg)f * (bits + xbits);
2418 if (stree) static_len += (ulg)f * (stree[n].Len + xbits);
2420 if (overflow == 0) return;
2422 Trace((stderr,"\nbit length overflow\n"));
2423 /* This happens for example on obj2 and pic of the Calgary corpus */
2425 /* Find the first bit length which could increase: */
2427 bits = max_length-1;
2428 while (bl_count[bits] == 0) bits--;
2429 bl_count[bits]--; /* move one leaf down the tree */
2430 bl_count[bits+1] += 2; /* move one overflow item as its brother */
2431 bl_count[max_length]--;
2432 /* The brother of the overflow item also moves one step up,
2433 * but this does not affect bl_count[max_length]
2436 } while (overflow > 0);
2438 /* Now recompute all bit lengths, scanning in increasing frequency.
2439 * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all
2440 * lengths instead of fixing only the wrong ones. This idea is taken
2441 * from 'ar' written by Haruhiko Okumura.)
2443 for (bits = max_length; bits != 0; bits--) {
2447 if (m > max_code) continue;
2448 if (tree[m].Len != (unsigned) bits) {
2449 Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits));
2450 opt_len += ((long)bits-(long)tree[m].Len)*(long)tree[m].Freq;
2451 tree[m].Len = (ush)bits;
2458 /* ===========================================================================
2459 * Generate the codes for a given tree and bit counts (which need not be
2461 * IN assertion: the array bl_count contains the bit length statistics for
2462 * the given tree and the field len is set for all tree elements.
2463 * OUT assertion: the field code is set for all tree elements of non
2466 local void gen_codes (tree, max_code)
2467 ct_data near *tree; /* the tree to decorate */
2468 int max_code; /* largest code with non zero frequency */
2470 ush next_code[MAX_BITS+1]; /* next code value for each bit length */
2471 ush code = 0; /* running code value */
2472 int bits; /* bit index */
2473 int n; /* code index */
2475 /* The distribution counts are first used to generate the code values
2476 * without bit reversal.
2478 for (bits = 1; bits <= MAX_BITS; bits++) {
2479 next_code[bits] = code = (code + bl_count[bits-1]) << 1;
2481 /* Check that the bit counts in bl_count are consistent. The last code
2484 Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1,
2485 "inconsistent bit counts");
2486 Tracev((stderr,"\ngen_codes: max_code %d ", max_code));
2488 for (n = 0; n <= max_code; n++) {
2489 int len = tree[n].Len;
2490 if (len == 0) continue;
2491 /* Now reverse the bits */
2492 tree[n].Code = bi_reverse(next_code[len]++, len);
2494 Tracec(tree != static_ltree, (stderr,"\nn %3d %c l %2d c %4x (%x) ",
2495 n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));
2499 /* ===========================================================================
2500 * Construct one Huffman tree and assigns the code bit strings and lengths.
2501 * Update the total bit length for the current block.
2502 * IN assertion: the field freq is set for all tree elements.
2503 * OUT assertions: the fields len and code are set to the optimal bit length
2504 * and corresponding code. The length opt_len is updated; static_len is
2505 * also updated if stree is not null. The field max_code is set.
2507 local void build_tree(desc)
2508 tree_desc near *desc; /* the tree descriptor */
2510 ct_data near *tree = desc->dyn_tree;
2511 ct_data near *stree = desc->static_tree;
2512 int elems = desc->elems;
2513 int n, m; /* iterate over heap elements */
2514 int max_code = -1; /* largest code with non zero frequency */
2515 int node = elems; /* next internal node of the tree */
2517 /* Construct the initial heap, with least frequent element in
2518 * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].
2519 * heap[0] is not used.
2521 heap_len = 0, heap_max = HEAP_SIZE;
2523 for (n = 0; n < elems; n++) {
2524 if (tree[n].Freq != 0) {
2525 heap[++heap_len] = max_code = n;
2532 /* The pkzip format requires that at least one distance code exists,
2533 * and that at least one bit should be sent even if there is only one
2534 * possible code. So to avoid special checks later on we force at least
2535 * two codes of non zero frequency.
2537 while (heap_len < 2) {
2538 int new = heap[++heap_len] = (max_code < 2 ? ++max_code : 0);
2541 opt_len--; if (stree) static_len -= stree[new].Len;
2542 /* new is 0 or 1 so it does not have extra bits */
2544 desc->max_code = max_code;
2546 /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree,
2547 * establish sub-heaps of increasing lengths:
2549 for (n = heap_len/2; n >= 1; n--) pqdownheap(tree, n);
2551 /* Construct the Huffman tree by repeatedly combining the least two
2555 pqremove(tree, n); /* n = node of least frequency */
2556 m = heap[SMALLEST]; /* m = node of next least frequency */
2558 heap[--heap_max] = n; /* keep the nodes sorted by frequency */
2559 heap[--heap_max] = m;
2561 /* Create a new node father of n and m */
2562 tree[node].Freq = tree[n].Freq + tree[m].Freq;
2563 depth[node] = (uch) (MAX(depth[n], depth[m]) + 1);
2564 tree[n].Dad = tree[m].Dad = (ush)node;
2566 if (tree == bl_tree) {
2567 fprintf(stderr,"\nnode %d(%d), sons %d(%d) %d(%d)",
2568 node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);
2571 /* and insert the new node in the heap */
2572 heap[SMALLEST] = node++;
2573 pqdownheap(tree, SMALLEST);
2575 } while (heap_len >= 2);
2577 heap[--heap_max] = heap[SMALLEST];
2579 /* At this point, the fields freq and dad are set. We can now
2580 * generate the bit lengths.
2582 gen_bitlen((tree_desc near *)desc);
2584 /* The field len is now set, we can generate the bit codes */
2585 gen_codes ((ct_data near *)tree, max_code);
2588 /* ===========================================================================
2589 * Scan a literal or distance tree to determine the frequencies of the codes
2590 * in the bit length tree. Updates opt_len to take into account the repeat
2591 * counts. (The contribution of the bit length codes will be added later
2592 * during the construction of bl_tree.)
2594 local void scan_tree (tree, max_code)
2595 ct_data near *tree; /* the tree to be scanned */
2596 int max_code; /* and its largest code of non zero frequency */
2598 int n; /* iterates over all tree elements */
2599 int prevlen = -1; /* last emitted length */
2600 int curlen; /* length of current code */
2601 int nextlen = tree[0].Len; /* length of next code */
2602 int count = 0; /* repeat count of the current code */
2603 int max_count = 7; /* max repeat count */
2604 int min_count = 4; /* min repeat count */
2606 if (nextlen == 0) max_count = 138, min_count = 3;
2607 tree[max_code+1].Len = (ush)0xffff; /* guard */
2609 for (n = 0; n <= max_code; n++) {
2610 curlen = nextlen; nextlen = tree[n+1].Len;
2611 if (++count < max_count && curlen == nextlen) {
2613 } else if (count < min_count) {
2614 bl_tree[curlen].Freq += count;
2615 } else if (curlen != 0) {
2616 if (curlen != prevlen) bl_tree[curlen].Freq++;
2617 bl_tree[REP_3_6].Freq++;
2618 } else if (count <= 10) {
2619 bl_tree[REPZ_3_10].Freq++;
2621 bl_tree[REPZ_11_138].Freq++;
2623 count = 0; prevlen = curlen;
2625 max_count = 138, min_count = 3;
2626 } else if (curlen == nextlen) {
2627 max_count = 6, min_count = 3;
2629 max_count = 7, min_count = 4;
2634 /* ===========================================================================
2635 * Send a literal or distance tree in compressed form, using the codes in
2638 local void send_tree (tree, max_code)
2639 ct_data near *tree; /* the tree to be scanned */
2640 int max_code; /* and its largest code of non zero frequency */
2642 int n; /* iterates over all tree elements */
2643 int prevlen = -1; /* last emitted length */
2644 int curlen; /* length of current code */
2645 int nextlen = tree[0].Len; /* length of next code */
2646 int count = 0; /* repeat count of the current code */
2647 int max_count = 7; /* max repeat count */
2648 int min_count = 4; /* min repeat count */
2650 /* tree[max_code+1].Len = -1; */ /* guard already set */
2651 if (nextlen == 0) max_count = 138, min_count = 3;
2653 for (n = 0; n <= max_code; n++) {
2654 curlen = nextlen; nextlen = tree[n+1].Len;
2655 if (++count < max_count && curlen == nextlen) {
2657 } else if (count < min_count) {
2658 do { send_code(curlen, bl_tree); } while (--count != 0);
2660 } else if (curlen != 0) {
2661 if (curlen != prevlen) {
2662 send_code(curlen, bl_tree); count--;
2664 Assert(count >= 3 && count <= 6, " 3_6?");
2665 send_code(REP_3_6, bl_tree); send_bits(count-3, 2);
2667 } else if (count <= 10) {
2668 send_code(REPZ_3_10, bl_tree); send_bits(count-3, 3);
2671 send_code(REPZ_11_138, bl_tree); send_bits(count-11, 7);
2673 count = 0; prevlen = curlen;
2675 max_count = 138, min_count = 3;
2676 } else if (curlen == nextlen) {
2677 max_count = 6, min_count = 3;
2679 max_count = 7, min_count = 4;
2684 /* ===========================================================================
2685 * Construct the Huffman tree for the bit lengths and return the index in
2686 * bl_order of the last bit length code to send.
2688 local int build_bl_tree()
2690 int max_blindex; /* index of last bit length code of non zero freq */
2692 /* Determine the bit length frequencies for literal and distance trees */
2693 scan_tree((ct_data near *)dyn_ltree, l_desc.max_code);
2694 scan_tree((ct_data near *)dyn_dtree, d_desc.max_code);
2696 /* Build the bit length tree: */
2697 build_tree((tree_desc near *)(&bl_desc));
2698 /* opt_len now includes the length of the tree representations, except
2699 * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.
2702 /* Determine the number of bit length codes to send. The pkzip format
2703 * requires that at least 4 bit length codes be sent. (appnote.txt says
2704 * 3 but the actual value used is 4.)
2706 for (max_blindex = BL_CODES-1; max_blindex >= 3; max_blindex--) {
2707 if (bl_tree[bl_order[max_blindex]].Len != 0) break;
2709 /* Update opt_len to include the bit length tree and counts */
2710 opt_len += 3*(max_blindex+1) + 5+5+4;
2711 Tracev((stderr, "\ndyn trees: dyn %ld, stat %ld", opt_len, static_len));
2716 /* ===========================================================================
2717 * Send the header for a block using dynamic Huffman trees: the counts, the
2718 * lengths of the bit length codes, the literal tree and the distance tree.
2719 * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4.
2721 local void send_all_trees(lcodes, dcodes, blcodes)
2722 int lcodes, dcodes, blcodes; /* number of codes for each tree */
2724 int rank; /* index in bl_order */
2726 Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes");
2727 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
2729 Tracev((stderr, "\nbl counts: "));
2730 send_bits(lcodes-257, 5); /* not +255 as stated in appnote.txt */
2731 send_bits(dcodes-1, 5);
2732 send_bits(blcodes-4, 4); /* not -3 as stated in appnote.txt */
2733 for (rank = 0; rank < blcodes; rank++) {
2734 Tracev((stderr, "\nbl code %2d ", bl_order[rank]));
2735 send_bits(bl_tree[bl_order[rank]].Len, 3);
2737 Tracev((stderr, "\nbl tree: sent %ld", bits_sent));
2739 send_tree((ct_data near *)dyn_ltree, lcodes-1); /* send the literal tree */
2740 Tracev((stderr, "\nlit tree: sent %ld", bits_sent));
2742 send_tree((ct_data near *)dyn_dtree, dcodes-1); /* send the distance tree */
2743 Tracev((stderr, "\ndist tree: sent %ld", bits_sent));
2746 /* ===========================================================================
2747 * Determine the best encoding for the current block: dynamic trees, static
2748 * trees or store, and output the encoded block to the zip file. This function
2749 * returns the total compressed length for the file so far.
2751 ulg flush_block(buf, stored_len, eof)
2752 char *buf; /* input block, or NULL if too old */
2753 ulg stored_len; /* length of input block */
2754 int eof; /* true if this is the last block for a file */
2756 ulg opt_lenb, static_lenb; /* opt_len and static_len in bytes */
2757 int max_blindex; /* index of last bit length code of non zero freq */
2759 flag_buf[last_flags] = flags; /* Save the flags for the last 8 items */
2761 /* Check if the file is ascii or binary */
2762 if (*file_type == (ush)UNKNOWN) set_file_type();
2764 /* Construct the literal and distance trees */
2765 build_tree((tree_desc near *)(&l_desc));
2766 Tracev((stderr, "\nlit data: dyn %ld, stat %ld", opt_len, static_len));
2768 build_tree((tree_desc near *)(&d_desc));
2769 Tracev((stderr, "\ndist data: dyn %ld, stat %ld", opt_len, static_len));
2770 /* At this point, opt_len and static_len are the total bit lengths of
2771 * the compressed block data, excluding the tree representations.
2774 /* Build the bit length tree for the above two trees, and get the index
2775 * in bl_order of the last bit length code to send.
2777 max_blindex = build_bl_tree();
2779 /* Determine the best encoding. Compute first the block length in bytes */
2780 opt_lenb = (opt_len+3+7)>>3;
2781 static_lenb = (static_len+3+7)>>3;
2782 input_len += stored_len; /* for debugging only */
2784 Trace((stderr, "\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u dist %u ",
2785 opt_lenb, opt_len, static_lenb, static_len, stored_len,
2786 last_lit, last_dist));
2788 if (static_lenb <= opt_lenb) opt_lenb = static_lenb;
2790 /* If compression failed and this is the first and last block,
2791 * and if the zip file can be seeked (to rewrite the local header),
2792 * the whole file is transformed into a stored file:
2796 if (stored_len <= opt_lenb && eof && compressed_len == 0L && seekable()) {
2798 /* Since LIT_BUFSIZE <= 2*WSIZE, the input data must be there: */
2799 if (buf == (char*)0) error ("block vanished");
2801 copy_block(buf, (unsigned)stored_len, 0); /* without header */
2802 compressed_len = stored_len << 3;
2803 *file_method = STORED;
2807 } else if (stored_len+4 <= opt_lenb && buf != (char*)0) {
2808 /* 4: two words for the lengths */
2810 /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.
2811 * Otherwise we can't have processed more than WSIZE input bytes since
2812 * the last block flush, because compression would have been
2813 * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to
2814 * transform a block into a stored block.
2816 send_bits((STORED_BLOCK<<1)+eof, 3); /* send block type */
2817 compressed_len = (compressed_len + 3 + 7) & ~7L;
2818 compressed_len += (stored_len + 4) << 3;
2820 copy_block(buf, (unsigned)stored_len, 1); /* with header */
2824 } else if (static_lenb == opt_lenb) {
2826 send_bits((STATIC_TREES<<1)+eof, 3);
2827 compress_block((ct_data near *)static_ltree, (ct_data near *)static_dtree);
2828 compressed_len += 3 + static_len;
2830 send_bits((DYN_TREES<<1)+eof, 3);
2831 send_all_trees(l_desc.max_code+1, d_desc.max_code+1, max_blindex+1);
2832 compress_block((ct_data near *)dyn_ltree, (ct_data near *)dyn_dtree);
2833 compressed_len += 3 + opt_len;
2835 Assert (compressed_len == bits_sent, "bad compressed size");
2839 Assert (input_len == isize, "bad input size");
2841 compressed_len += 7; /* align on byte boundary */
2843 Tracev((stderr,"\ncomprlen %lu(%lu) ", compressed_len>>3,
2844 compressed_len-7*eof));
2846 return compressed_len >> 3;
2849 /* ===========================================================================
2850 * Save the match info and tally the frequency counts. Return true if
2851 * the current block must be flushed.
2853 int ct_tally (dist, lc)
2854 int dist; /* distance of matched string */
2855 int lc; /* match length-MIN_MATCH or unmatched char (if dist==0) */
2857 l_buf[last_lit++] = (uch)lc;
2859 /* lc is the unmatched char */
2860 dyn_ltree[lc].Freq++;
2862 /* Here, lc is the match length - MIN_MATCH */
2863 dist--; /* dist = match distance - 1 */
2864 Assert((ush)dist < (ush)MAX_DIST &&
2865 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
2866 (ush)d_code(dist) < (ush)D_CODES, "ct_tally: bad match");
2868 dyn_ltree[length_code[lc]+LITERALS+1].Freq++;
2869 dyn_dtree[d_code(dist)].Freq++;
2871 d_buf[last_dist++] = (ush)dist;
2876 /* Output the flags if they fill a byte: */
2877 if ((last_lit & 7) == 0) {
2878 flag_buf[last_flags++] = flags;
2879 flags = 0, flag_bit = 1;
2881 /* Try to guess if it is profitable to stop the current block here */
2882 if ((last_lit & 0xfff) == 0) {
2883 /* Compute an upper bound for the compressed length */
2884 ulg out_length = (ulg)last_lit*8L;
2885 ulg in_length = (ulg)strstart-block_start;
2887 for (dcode = 0; dcode < D_CODES; dcode++) {
2888 out_length += (ulg)dyn_dtree[dcode].Freq*(5L+extra_dbits[dcode]);
2891 Trace((stderr,"\nlast_lit %u, last_dist %u, in %ld, out ~%ld(%ld%%) ",
2892 last_lit, last_dist, in_length, out_length,
2893 100L - out_length*100L/in_length));
2894 if (last_dist < last_lit/2 && out_length < in_length/2) return 1;
2896 return (last_lit == LIT_BUFSIZE-1 || last_dist == DIST_BUFSIZE);
2897 /* We avoid equality with LIT_BUFSIZE because of wraparound at 64K
2898 * on 16 bit machines and because stored blocks are restricted to
2903 /* ===========================================================================
2904 * Send the block data compressed using the given Huffman trees
2906 local void compress_block(ltree, dtree)
2907 ct_data near *ltree; /* literal tree */
2908 ct_data near *dtree; /* distance tree */
2910 unsigned dist; /* distance of matched string */
2911 int lc; /* match length or unmatched char (if dist == 0) */
2912 unsigned lx = 0; /* running index in l_buf */
2913 unsigned dx = 0; /* running index in d_buf */
2914 unsigned fx = 0; /* running index in flag_buf */
2915 uch flag = 0; /* current flags */
2916 unsigned code; /* the code to send */
2917 int extra; /* number of extra bits to send */
2919 if (last_lit != 0) do {
2920 if ((lx & 7) == 0) flag = flag_buf[fx++];
2922 if ((flag & 1) == 0) {
2923 send_code(lc, ltree); /* send a literal byte */
2924 Tracecv(isgraph(lc), (stderr," '%c' ", lc));
2926 /* Here, lc is the match length - MIN_MATCH */
2927 code = length_code[lc];
2928 send_code(code+LITERALS+1, ltree); /* send the length code */
2929 extra = extra_lbits[code];
2931 lc -= base_length[code];
2932 send_bits(lc, extra); /* send the extra length bits */
2935 /* Here, dist is the match distance - 1 */
2936 code = d_code(dist);
2937 Assert (code < D_CODES, "bad d_code");
2939 send_code(code, dtree); /* send the distance code */
2940 extra = extra_dbits[code];
2942 dist -= base_dist[code];
2943 send_bits(dist, extra); /* send the extra distance bits */
2945 } /* literal or match pair ? */
2947 } while (lx < last_lit);
2949 send_code(END_BLOCK, ltree);
2952 /* ===========================================================================
2953 * Set the file type to ASCII or BINARY, using a crude approximation:
2954 * binary if more than 20% of the bytes are <= 6 or >= 128, ascii otherwise.
2955 * IN assertion: the fields freq of dyn_ltree are set and the total of all
2956 * frequencies does not exceed 64K (to fit in an int on 16 bit machines).
2958 local void set_file_type()
2961 unsigned ascii_freq = 0;
2962 unsigned bin_freq = 0;
2963 while (n < 7) bin_freq += dyn_ltree[n++].Freq;
2964 while (n < 128) ascii_freq += dyn_ltree[n++].Freq;
2965 while (n < LITERALS) bin_freq += dyn_ltree[n++].Freq;
2966 *file_type = bin_freq > (ascii_freq >> 2) ? BINARY : ASCII;
2967 if (*file_type == BINARY && translate_eol) {
2968 warn("-l used on binary file", "");
2971 /* util.c -- utility functions for gzip support
2972 * Copyright (C) 1992-1993 Jean-loup Gailly
2973 * This is free software; you can redistribute it and/or modify it under the
2974 * terms of the GNU General Public License, see the file COPYING.
2979 #include <sys/types.h>
2981 #ifdef HAVE_UNISTD_H
2982 # include <unistd.h>
2988 #if defined(STDC_HEADERS) || !defined(NO_STDLIB_H)
2989 # include <stdlib.h>
2994 /* ===========================================================================
2995 * Copy input to output unchanged: zcat == cat with --force.
2996 * IN assertion: insize bytes have already been read in inbuf.
2999 int in, out; /* input and output file descriptors */
3002 while (insize != 0 && (int)insize != EOF) {
3003 write_buf(out, (char*)inbuf, insize);
3004 bytes_out += insize;
3005 insize = read(in, (char*)inbuf, INBUFSIZ);
3007 if ((int)insize == EOF && errno != 0) {
3010 bytes_in = bytes_out;
3014 /* ========================================================================
3015 * Put string s in lower case, return s.
3021 for (t = s; *t; t++) *t = tolow(*t);
3025 #if defined(NO_STRING_H) && !defined(STDC_HEADERS)
3027 /* Provide missing strspn and strcspn functions. */
3033 int strspn OF((const char *s, const char *accept));
3034 int strcspn OF((const char *s, const char *reject));
3036 /* ========================================================================
3037 * Return the length of the maximum initial segment
3038 * of s which contains only characters in accept.
3040 int strspn(s, accept)
3044 register const char *p;
3045 register const char *a;
3046 register int count = 0;
3048 for (p = s; *p != '\0'; ++p) {
3049 for (a = accept; *a != '\0'; ++a) {
3050 if (*p == *a) break;
3052 if (*a == '\0') return count;
3058 /* ========================================================================
3059 * Return the length of the maximum inital segment of s
3060 * which contains no characters from reject.
3062 int strcspn(s, reject)
3066 register int count = 0;
3068 while (*s != '\0') {
3069 if (strchr(reject, *s++) != NULL) return count;
3075 #endif /* NO_STRING_H */
3077 /* ========================================================================
3078 * Add an environment variable (if any) before argv, and update argc.
3079 * Return the expanded environment variable to be freed later, or NULL
3080 * if no options were added to argv.
3082 #define SEPARATOR " \t" /* separators in env variable */
3084 char *add_envopt(argcp, argvp, env)
3085 int *argcp; /* pointer to argc */
3086 char ***argvp; /* pointer to argv */
3087 char *env; /* name of environment variable */
3089 char *p; /* running pointer through env variable */
3090 char **oargv; /* runs through old argv array */
3091 char **nargv; /* runs through new argv array */
3092 int oargc = *argcp; /* old argc */
3093 int nargc = 0; /* number of arguments in env variable */
3095 env = (char*)getenv(env);
3096 if (env == NULL) return NULL;
3098 p = (char*)xmalloc(strlen(env)+1);
3099 env = strcpy(p, env); /* keep env variable intact */
3101 for (p = env; *p; nargc++ ) { /* move through env */
3102 p += strspn(p, SEPARATOR); /* skip leading separators */
3103 if (*p == '\0') break;
3105 p += strcspn(p, SEPARATOR); /* find end of word */
3106 if (*p) *p++ = '\0'; /* mark it */
3113 /* Allocate the new argv array, with an extra element just in case
3114 * the original arg list did not end with a NULL.
3116 nargv = (char**)calloc(*argcp+1, sizeof(char *));
3117 if (nargv == NULL) error("out of memory");
3121 /* Copy the program name first */
3122 if (oargc-- < 0) error("argc<=0");
3123 *(nargv++) = *(oargv++);
3125 /* Then copy the environment args */
3126 for (p = env; nargc > 0; nargc--) {
3127 p += strspn(p, SEPARATOR); /* skip separators */
3128 *(nargv++) = p; /* store start */
3129 while (*p++) ; /* skip over word */
3132 /* Finally copy the old args and add a NULL (usual convention) */
3133 while (oargc--) *(nargv++) = *(oargv++);
3137 /* ========================================================================
3138 * Display compression ratio on the given stream on 6 characters.
3140 void display_ratio(num, den, file)
3145 long ratio; /* 1000 times the compression ratio */
3148 ratio = 0; /* no compression */
3149 } else if (den < 2147483L) { /* (2**31 -1)/1000 */
3150 ratio = 1000L*num/den;
3152 ratio = num/(den/1000L);
3160 fprintf(file, "%2ld.%1ld%%", ratio / 10L, ratio % 10L);
3164 /* zip.c -- compress files to the gzip or pkzip format
3165 * Copyright (C) 1992-1993 Jean-loup Gailly
3166 * This is free software; you can redistribute it and/or modify it under the
3167 * terms of the GNU General Public License, see the file COPYING.
3171 #include <sys/types.h>
3173 #ifdef HAVE_UNISTD_H
3174 # include <unistd.h>
3180 local ulg crc; /* crc on uncompressed file data */
3181 long header_bytes; /* number of bytes in gzip header */
3183 /* ===========================================================================
3184 * Deflate in to out.
3185 * IN assertions: the input and output buffers are cleared.
3186 * The variables time_stamp and save_orig_name are initialized.
3189 int in, out; /* input and output file descriptors */
3191 uch flags = 0; /* general purpose bit flags */
3192 ush attr = 0; /* ascii/binary flag */
3193 ush deflate_flags = 0; /* pkzip -es, -en or -ex equivalent */
3199 /* Write the header to the gzip file. See algorithm.doc for the format */
3202 put_byte(GZIP_MAGIC[0]); /* magic header */
3203 put_byte(GZIP_MAGIC[1]);
3204 put_byte(DEFLATED); /* compression method */
3206 put_byte(flags); /* general flags */
3207 put_long(time_stamp);
3209 /* Write deflated file to zip file */
3213 ct_init(&attr, &method);
3214 lm_init(&deflate_flags);
3216 put_byte((uch)deflate_flags); /* extra flags */
3217 put_byte(OS_CODE); /* OS identifier */
3219 header_bytes = (long)outcnt;
3223 /* Write the crc and uncompressed size */
3226 header_bytes += 2*sizeof(long);
3233 /* ===========================================================================
3234 * Read a new buffer from the current input file, perform end-of-line
3235 * translation, and update the crc and input file size.
3236 * IN assertion: size >= 2 (for end-of-line translation)
3238 int file_read(buf, size)
3244 Assert(insize == 0, "inbuf not empty");
3246 len = read(ifd, buf, size);
3247 if (len == (unsigned)(-1) || len == 0) return (int)len;
3249 crc = updcrc((uch*)buf, len);