1 /* vi: set sw=4 ts=4: */
3 * Gzip implementation for busybox
5 * Based on GNU gzip Copyright (C) 1992-1993 Jean-loup Gailly.
7 * Originally adjusted for busybox by Charles P. Wright <cpw@unix.asb.com>
8 * "this is a stripped down version of gzip I put into busybox, it does
9 * only standard in to standard out with -9 compression. It also requires
10 * the zcat module for some important functions."
12 * Adjusted further by Erik Andersen <andersen@lineo.com>, <andersee@debian.org>
13 * to support files as well as stdin/stdout, and to generally behave itself wrt
14 * command line handling.
16 * This program is free software; you can redistribute it and/or modify
17 * it under the terms of the GNU General Public License as published by
18 * the Free Software Foundation; either version 2 of the License, or
19 * (at your option) any later version.
21 * This program is distributed in the hope that it will be useful,
22 * but WITHOUT ANY WARRANTY; without even the implied warranty of
23 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
24 * General Public License for more details.
26 * You should have received a copy of the GNU General Public License
27 * along with this program; if not, write to the Free Software
28 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
32 /* These defines are very important for BusyBox. Without these,
33 * huge chunks of ram are pre-allocated making the BusyBox bss
34 * size Freaking Huge(tm), which is a bad thing.*/
38 /* I don't like nested includes, but the string and io functions are used
47 #define BB_DECLARE_EXTERN
48 #define bb_need_memory_exhausted
51 #define memzero(s, n) memset ((void *)(s), 0, (n))
54 # define RETSIGTYPE void
59 typedef unsigned char uch;
60 typedef unsigned short ush;
61 typedef unsigned long ulg;
63 /* Return codes from gzip */
68 /* Compression methods (see algorithm.doc) */
73 /* methods 4 to 7 reserved */
76 static int method; /* compression method */
78 /* To save memory for 16 bit systems, some arrays are overlaid between
79 * the various modules:
80 * deflate: prev+head window d_buf l_buf outbuf
81 * unlzw: tab_prefix tab_suffix stack inbuf outbuf
82 * inflate: window inbuf
83 * unpack: window inbuf prefix_len
84 * unlzh: left+right window c_table inbuf c_len
85 * For compression, input is done in window[]. For decompression, output
86 * is done in window except for unlzw.
91 # define INBUFSIZ 0x2000 /* input buffer size */
93 # define INBUFSIZ 0x8000 /* input buffer size */
96 #define INBUF_EXTRA 64 /* required by unlzw() */
100 # define OUTBUFSIZ 8192 /* output buffer size */
102 # define OUTBUFSIZ 16384 /* output buffer size */
105 #define OUTBUF_EXTRA 2048 /* required by unlzw() */
109 # define DIST_BUFSIZE 0x2000 /* buffer for distances, see trees.c */
111 # define DIST_BUFSIZE 0x8000 /* buffer for distances, see trees.c */
116 # define EXTERN(type, array) extern type * array
117 # define DECLARE(type, array, size) type * array
118 # define ALLOC(type, array, size) { \
119 array = (type*)calloc((size_t)(((size)+1L)/2), 2*sizeof(type)); \
120 if (array == NULL) error_msg(memory_exhausted); \
122 # define FREE(array) {if (array != NULL) free(array), array=NULL;}
124 # define EXTERN(type, array) extern type array[]
125 # define DECLARE(type, array, size) type array[size]
126 # define ALLOC(type, array, size)
130 EXTERN(uch, inbuf); /* input buffer */
131 EXTERN(uch, outbuf); /* output buffer */
132 EXTERN(ush, d_buf); /* buffer for distances, see trees.c */
133 EXTERN(uch, window); /* Sliding window and suffix table (unlzw) */
134 #define tab_suffix window
136 # define tab_prefix prev /* hash link (see deflate.c) */
137 # define head (prev+WSIZE) /* hash head (see deflate.c) */
138 EXTERN(ush, tab_prefix); /* prefix code (see unlzw.c) */
140 # define tab_prefix0 prev
141 # define head tab_prefix1
142 EXTERN(ush, tab_prefix0); /* prefix for even codes */
143 EXTERN(ush, tab_prefix1); /* prefix for odd codes */
146 extern unsigned insize; /* valid bytes in inbuf */
147 static unsigned inptr; /* index of next byte to be processed in inbuf */
148 extern unsigned outcnt; /* bytes in output buffer */
150 extern long bytes_in; /* number of input bytes */
151 extern long bytes_out; /* number of output bytes */
152 extern long header_bytes; /* number of bytes in gzip header */
154 #define isize bytes_in
155 /* for compatibility with old zip sources (to be cleaned) */
157 extern int ifd; /* input file descriptor */
158 extern int ofd; /* output file descriptor */
159 extern char ifname[]; /* input file name or "stdin" */
160 extern char ofname[]; /* output file name or "stdout" */
161 extern char *progname; /* program name */
163 extern long time_stamp; /* original time stamp (modification time) */
164 extern long ifile_size; /* input file size, -1 for devices (debug only) */
166 typedef int file_t; /* Do not use stdio */
168 #define NO_FILE (-1) /* in memory compression */
171 #define PACK_MAGIC "\037\036" /* Magic header for packed files */
172 #define GZIP_MAGIC "\037\213" /* Magic header for gzip files, 1F 8B */
173 #define OLD_GZIP_MAGIC "\037\236" /* Magic header for gzip 0.5 = freeze 1.x */
174 #define LZH_MAGIC "\037\240" /* Magic header for SCO LZH Compress files */
175 #define PKZIP_MAGIC "\120\113\003\004" /* Magic header for pkzip files */
178 #define ASCII_FLAG 0x01 /* bit 0 set: file probably ascii text */
179 #define CONTINUATION 0x02 /* bit 1 set: continuation of multi-part gzip file */
180 #define EXTRA_FIELD 0x04 /* bit 2 set: extra field present */
181 #define ORIG_NAME 0x08 /* bit 3 set: original file name present */
182 #define COMMENT 0x10 /* bit 4 set: file comment present */
183 #define ENCRYPTED 0x20 /* bit 5 set: file is encrypted */
184 #define RESERVED 0xC0 /* bit 6,7: reserved */
186 /* internal file attribute */
187 #define UNKNOWN 0xffff
192 # define WSIZE 0x8000 /* window size--must be a power of two, and */
193 #endif /* at least 32K for zip's deflate method */
196 #define MAX_MATCH 258
197 /* The minimum and maximum match lengths */
199 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
200 /* Minimum amount of lookahead, except at the end of the input file.
201 * See deflate.c for comments about the MIN_MATCH+1.
204 #define MAX_DIST (WSIZE-MIN_LOOKAHEAD)
205 /* In order to simplify the code, particularly on 16 bit machines, match
206 * distances are limited to MAX_DIST instead of WSIZE.
209 extern int decrypt; /* flag to turn on decryption */
210 extern int exit_code; /* program exit code */
211 extern int verbose; /* be verbose (-v) */
212 extern int quiet; /* be quiet (-q) */
213 extern int test; /* check .z file integrity */
214 extern int save_orig_name; /* set if original name must be saved */
216 #define get_byte() (inptr < insize ? inbuf[inptr++] : fill_inbuf(0))
217 #define try_byte() (inptr < insize ? inbuf[inptr++] : fill_inbuf(1))
219 /* put_byte is used for the compressed output, put_ubyte for the
220 * uncompressed output. However unlzw() uses window for its
221 * suffix table instead of its output buffer, so it does not use put_ubyte
222 * (to be cleaned up).
224 #define put_byte(c) {outbuf[outcnt++]=(uch)(c); if (outcnt==OUTBUFSIZ)\
226 #define put_ubyte(c) {window[outcnt++]=(uch)(c); if (outcnt==WSIZE)\
229 /* Output a 16 bit value, lsb first */
230 #define put_short(w) \
231 { if (outcnt < OUTBUFSIZ-2) { \
232 outbuf[outcnt++] = (uch) ((w) & 0xff); \
233 outbuf[outcnt++] = (uch) ((ush)(w) >> 8); \
235 put_byte((uch)((w) & 0xff)); \
236 put_byte((uch)((ush)(w) >> 8)); \
240 /* Output a 32 bit value to the bit stream, lsb first */
241 #define put_long(n) { \
242 put_short((n) & 0xffff); \
243 put_short(((ulg)(n)) >> 16); \
246 #define seekable() 0 /* force sequential output */
247 #define translate_eol 0 /* no option -a yet */
249 #define tolow(c) (isupper(c) ? (c)-'A'+'a' : (c)) /* force to lower case */
251 /* Macros for getting two-byte and four-byte header values */
252 #define SH(p) ((ush)(uch)((p)[0]) | ((ush)(uch)((p)[1]) << 8))
253 #define LG(p) ((ulg)(SH(p)) | ((ulg)(SH((p)+2)) << 16))
255 /* Diagnostic functions */
257 # define Assert(cond,msg) {if(!(cond)) error_msg(msg);}
258 # define Trace(x) fprintf x
259 # define Tracev(x) {if (verbose) fprintf x ;}
260 # define Tracevv(x) {if (verbose>1) fprintf x ;}
261 # define Tracec(c,x) {if (verbose && (c)) fprintf x ;}
262 # define Tracecv(c,x) {if (verbose>1 && (c)) fprintf x ;}
264 # define Assert(cond,msg)
269 # define Tracecv(c,x)
272 #define WARN(msg) {if (!quiet) fprintf msg ; \
273 if (exit_code == OK) exit_code = WARNING;}
277 extern int zip (int in, int out);
278 extern int file_read (char *buf, unsigned size);
281 extern int check_zipfile (int in);
284 extern int unpack (int in, int out);
287 extern int unlzh (int in, int out);
290 RETSIGTYPE abort_gzip (void);
293 void lm_init (ush * flags);
297 void ct_init (ush * attr, int *methodp);
298 int ct_tally (int dist, int lc);
299 ulg flush_block (char *buf, ulg stored_len, int eof);
302 void bi_init (file_t zipfile);
303 void send_bits (int value, int length);
304 unsigned bi_reverse (unsigned value, int length);
305 void bi_windup (void);
306 void copy_block (char *buf, unsigned len, int header);
307 extern int (*read_buf) (char *buf, unsigned size);
310 extern int copy (int in, int out);
311 //extern ulg updcrc (uch * s, unsigned n);
312 //extern void clear_bufs (void);
313 extern int fill_inbuf (int eof_ok);
314 extern void flush_outbuf (void);
315 extern void flush_window (void);
316 //extern void write_buf (int fd, void * buf, unsigned cnt);
317 extern char *strlwr (char *s);
318 extern char *add_envopt (int *argcp, char ***argvp, char *env);
319 //extern void read_error_msg (void);
320 //extern void write_error_msg (void);
321 extern void display_ratio (long num, long den, FILE * file);
324 extern int inflate (void);
326 /* lzw.h -- define the lzw functions.
327 * Copyright (C) 1992-1993 Jean-loup Gailly.
328 * This is free software; you can redistribute it and/or modify it under the
329 * terms of the GNU General Public License, see the file COPYING.
332 #if !defined(OF) && defined(lint)
339 #define INIT_BITS 9 /* Initial number of bits per code */
341 #define BIT_MASK 0x1f /* Mask for 'number of compression bits' */
342 /* Mask 0x20 is reserved to mean a fourth header byte, and 0x40 is free.
343 * It's a pity that old uncompress does not check bit 0x20. That makes
344 * extension of the format actually undesirable because old compress
345 * would just crash on the new format instead of giving a meaningful
346 * error message. It does check the number of bits, but it's more
347 * helpful to say "unsupported format, get a new version" than
348 * "can only handle 16 bits".
351 #define BLOCK_MODE 0x80
352 /* Block compression: if table is full and compression rate is dropping,
353 * clear the dictionary.
356 #define LZW_RESERVED 0x60 /* reserved bits */
358 #define CLEAR 256 /* flush the dictionary */
359 #define FIRST (CLEAR+1) /* first free entry */
361 extern int maxbits; /* max bits per code for LZW */
362 extern int block_mode; /* block compress mode -C compatible with 2.0 */
364 /* revision.h -- define the version number
365 * Copyright (C) 1992-1993 Jean-loup Gailly.
366 * This is free software; you can redistribute it and/or modify it under the
367 * terms of the GNU General Public License, see the file COPYING.
370 #define VERSION "1.2.4"
372 #define REVDATE "18 Aug 93"
374 /* This version does not support compression into old compress format: */
379 /* tailor.h -- target dependent definitions
380 * Copyright (C) 1992-1993 Jean-loup Gailly.
381 * This is free software; you can redistribute it and/or modify it under the
382 * terms of the GNU General Public License, see the file COPYING.
385 /* The target dependent definitions should be defined here only.
386 * The target dependent functions should be defined in tailor.c.
390 #if defined(__MSDOS__) && !defined(MSDOS)
394 #if defined(__OS2__) && !defined(OS2)
398 #if defined(OS2) && defined(MSDOS) /* MS C under OS/2 */
404 /* DJGPP version 1.09+ on MS-DOS.
405 * The DJGPP 1.09 stat() function must be upgraded before gzip will
407 * No need for DIRENT, since <unistd.h> defines POSIX_SOURCE which
421 # define HAVE_SYS_UTIME_H
425 # define PATH_SEP2 '\\'
426 # define PATH_SEP3 ':'
427 # define MAX_PATH_LEN 128
428 # define NO_MULTIPLE_DOTS
429 # define MAX_EXT_CHARS 3
430 # define Z_SUFFIX "z"
433 # define STDC_HEADERS
434 # define NO_SIZE_CHECK
435 # define casemap(c) tolow(c) /* Force file names to lower case */
437 # define OS_CODE 0x00
438 # define SET_BINARY_MODE(fd) setmode(fd, O_BINARY)
439 # if !defined(NO_ASM) && !defined(ASMV)
447 # define PATH_SEP2 '\\'
448 # define PATH_SEP3 ':'
449 # define MAX_PATH_LEN 260
451 # define NO_MULTIPLE_DOTS
452 # define MAX_EXT_CHARS 3
453 # define Z_SUFFIX "z"
454 # define casemap(c) tolow(c)
458 # define STDC_HEADERS
460 # define OS_CODE 0x06
461 # define SET_BINARY_MODE(fd) setmode(fd, O_BINARY)
463 # define HAVE_SYS_UTIME_H
470 # define HAVE_SYS_UTIME_H
473 # define EXPAND(argc,argv) \
474 {_response(&argc, &argv); _wildcard(&argc, &argv);}
483 # define EXPAND(argc,argv) \
484 {response_expand(&argc, &argv);}
488 #ifdef WIN32 /* Windows NT */
489 # define HAVE_SYS_UTIME_H
491 # define PATH_SEP2 '\\'
492 # define PATH_SEP3 ':'
493 # define MAX_PATH_LEN 260
496 # define STDC_HEADERS
497 # define SET_BINARY_MODE(fd) setmode(fd, O_BINARY)
501 # define NO_MULTIPLE_DOTS
502 # define MAX_EXT_CHARS 3
503 # define Z_SUFFIX "z"
504 # define casemap(c) tolow(c) /* Force file names to lower case */
506 # define OS_CODE 0x0b
513 /* Turbo C 2.0 does not accept static allocations of large arrays */
514 void *fcalloc(unsigned items, unsigned size);
515 void fcfree(void *ptr);
518 # define fcalloc(nitems,itemsize) halloc((long)(nitems),(itemsize))
519 # define fcfree(ptr) hfree(ptr)
523 # define fcalloc(items,size) calloc((items),(size))
525 # define fcalloc(items,size) malloc((size_t)(items)*(size_t)(size))
527 # define fcfree(ptr) free(ptr)
530 #if defined(VAXC) || defined(VMS)
531 # define PATH_SEP ']'
532 # define PATH_SEP2 ':'
533 # define SUFFIX_SEP ';'
534 # define NO_MULTIPLE_DOTS
535 # define Z_SUFFIX "-gz"
537 # define casemap(c) tolow(c)
538 # define OS_CODE 0x02
539 # define OPTIONS_VAR "GZIP_OPT"
540 # define STDC_HEADERS
542 # define EXPAND(argc,argv) vms_expand_args(&argc,&argv);
544 # define unlink delete
552 # define PATH_SEP2 ':'
553 # define STDC_HEADERS
554 # define OS_CODE 0x01
558 # define HAVE_UNISTD_H
560 # define NO_STDIN_FSTAT
565 # include <fcntl.h> /* for read() and write() */
566 # define direct dirent
567 extern void _expand_args(int *argc, char ***argv);
569 # define EXPAND(argc,argv) _expand_args(&argc,&argv);
570 # undef O_BINARY /* disable useless --ascii option */
574 #if defined(ATARI) || defined(atarist)
575 # ifndef STDC_HEADERS
576 # define STDC_HEADERS
577 # define HAVE_UNISTD_H
581 # define OS_CODE 0x05
583 # define PATH_SEP2 '\\'
584 # define PATH_SEP3 ':'
585 # define MAX_PATH_LEN 128
586 # define NO_MULTIPLE_DOTS
587 # define MAX_EXT_CHARS 3
588 # define Z_SUFFIX "z"
590 # define casemap(c) tolow(c) /* Force file names to lower case */
596 # define PATH_SEP ':'
599 # define NO_STDIN_FSTAT
602 # define chmod(file, mode) (0)
603 # define OPEN(name, flags, mode) open(name, flags)
604 # define OS_CODE 0x07
606 # define isatty(fd) ((fd) <= 2)
610 #ifdef __50SERIES /* Prime/PRIMOS */
611 # define PATH_SEP '>'
612 # define STDC_HEADERS
617 # define NO_STDIN_FSTAT
618 # define NO_SIZE_CHECK
621 # define casemap(c) tolow(c) /* Force file names to lower case */
622 # define put_char(c) put_byte((c) & 0x7F)
623 # define get_char(c) ascii2pascii(get_byte())
624 # define OS_CODE 0x0F /* temporary, subject to change */
626 # undef SIGTERM /* We don't want a signal handler for SIGTERM */
630 #if defined(pyr) && !defined(NOMEMCPY) /* Pyramid */
631 # define NOMEMCPY /* problem with overlapping copies */
635 # define OS_CODE 0x0a
639 # define NO_ST_INO /* don't rely on inode numbers */
643 /* Common defaults */
646 # define OS_CODE 0x03 /* assume Unix */
650 # define PATH_SEP '/'
654 # define casemap(c) (c)
658 # define OPTIONS_VAR "GZIP"
662 # define Z_SUFFIX ".gz"
666 # define MAX_SUFFIX MAX_EXT_CHARS
668 # define MAX_SUFFIX 30
671 #ifndef MAKE_LEGAL_NAME
672 # ifdef NO_MULTIPLE_DOTS
673 # define MAKE_LEGAL_NAME(name) make_simple_name(name)
675 # define MAKE_LEGAL_NAME(name)
681 /* keep at least MIN_PART chars between dots in a file name. */
685 # define EXPAND(argc,argv)
692 #ifndef SET_BINARY_MODE
693 # define SET_BINARY_MODE(fd)
697 # define OPEN(name, flags, mode) open(name, flags, mode)
701 # define get_char() get_byte()
705 # define put_char(c) put_byte(c)
708 int crc_table_empty = 1;
710 /* ========================================================================
711 * Signal and error handler.
718 /* ===========================================================================
719 * Clear input and output buffers
721 static void clear_bufs(void)
725 bytes_in = bytes_out = 0L;
728 static void write_error_msg()
730 fprintf(stderr, "\n");
735 /* ===========================================================================
736 * Does the same as write(), but also handles partial pipe writes and checks
739 static void write_buf(fd, buf, cnt)
746 while ((n = write(fd, buf, cnt)) != cnt) {
747 if (n == (unsigned) (-1)) {
751 buf = (void *) ((char *) buf + n);
755 /* ========================================================================
758 static void read_error_msg()
760 fprintf(stderr, "\n");
764 fprintf(stderr, "unexpected end of file\n");
769 /* ===========================================================================
770 * Run a set of bytes through the crc shift register. If s is a NULL
771 * pointer, then initialize the crc shift register contents instead.
772 * Return the current crc in either case.
774 static ulg updcrc(s, n)
775 uch *s; /* pointer to bytes to pump through */
776 unsigned n; /* number of bytes in s[] */
778 static ulg crc = (ulg) 0xffffffffL; /* shift register contents */
779 register ulg c; /* temporary variable */
780 static unsigned long crc_32_tab[256];
781 if (crc_table_empty) {
782 unsigned long csr; /* crc shift register */
783 unsigned long e; /* polynomial exclusive-or pattern */
784 int i; /* counter for all possible eight bit values */
785 int k; /* byte being shifted into crc apparatus */
787 /* terms of polynomial defining this crc (except x^32): */
788 static int p[] = {0,1,2,4,5,7,8,10,11,12,16,22,23,26};
790 /* Make exclusive-or pattern from polynomial (0xedb88320) */
792 for (i = 0; i < sizeof(p)/sizeof(int); i++)
793 e |= 1L << (31 - p[i]);
795 /* Compute and print table of CRC's, five per line */
796 crc_32_tab[0] = 0x00000000L;
797 for (i = 1; i < 256; i++) {
799 /* The idea to initialize the register with the byte instead of
800 * zero was stolen from Haruhiko Okumura's ar002
803 csr = csr & 1 ? (csr >> 1) ^ e : csr >> 1;
814 c = crc_32_tab[((int) c ^ (*s++)) & 0xff] ^ (c >> 8);
818 return c ^ 0xffffffffL; /* (instead of ~c for 64-bit machines) */
821 /* bits.c -- output variable-length bit strings
822 * Copyright (C) 1992-1993 Jean-loup Gailly
823 * This is free software; you can redistribute it and/or modify it under the
824 * terms of the GNU General Public License, see the file COPYING.
831 * Output variable-length bit strings. Compression can be done
832 * to a file or to memory. (The latter is not supported in this version.)
836 * The PKZIP "deflate" file format interprets compressed file data
837 * as a sequence of bits. Multi-bit strings in the file may cross
838 * byte boundaries without restriction.
840 * The first bit of each byte is the low-order bit.
842 * The routines in this file allow a variable-length bit value to
843 * be output right-to-left (useful for literal values). For
844 * left-to-right output (useful for code strings from the tree routines),
845 * the bits must have been reversed first with bi_reverse().
847 * For in-memory compression, the compressed bit stream goes directly
848 * into the requested output buffer. The input data is read in blocks
849 * by the mem_read() function. The buffer is limited to 64K on 16 bit
854 * void bi_init (FILE *zipfile)
855 * Initialize the bit string routines.
857 * void send_bits (int value, int length)
858 * Write out a bit string, taking the source bits right to
861 * int bi_reverse (int value, int length)
862 * Reverse the bits of a bit string, taking the source bits left to
863 * right and emitting them right to left.
865 * void bi_windup (void)
866 * Write out any remaining bits in an incomplete byte.
868 * void copy_block(char *buf, unsigned len, int header)
869 * Copy a stored block to the zip file, storing first the length and
870 * its one's complement if requested.
878 /* ===========================================================================
879 * Local data used by the "bit string" routines.
882 local file_t zfile; /* output gzip file */
884 local unsigned short bi_buf;
886 /* Output buffer. bits are inserted starting at the bottom (least significant
890 #define Buf_size (8 * 2*sizeof(char))
891 /* Number of bits used within bi_buf. (bi_buf might be implemented on
892 * more than 16 bits on some systems.)
897 /* Number of valid bits in bi_buf. All bits above the last valid bit
901 int (*read_buf) (char *buf, unsigned size);
903 /* Current input function. Set to mem_read for in-memory compression */
906 ulg bits_sent; /* bit length of the compressed data */
909 /* ===========================================================================
910 * Initialize the bit string routines.
912 void bi_init(zipfile)
913 file_t zipfile; /* output zip file, NO_FILE for in-memory compression */
922 /* Set the defaults for file compression. They are set by memcompress
923 * for in-memory compression.
925 if (zfile != NO_FILE) {
926 read_buf = file_read;
930 /* ===========================================================================
931 * Send a value on a given number of bits.
932 * IN assertion: length <= 16 and value fits in length bits.
934 void send_bits(value, length)
935 int value; /* value to send */
936 int length; /* number of bits */
939 Tracev((stderr, " l %2d v %4x ", length, value));
940 Assert(length > 0 && length <= 15, "invalid length");
941 bits_sent += (ulg) length;
943 /* If not enough room in bi_buf, use (valid) bits from bi_buf and
944 * (16 - bi_valid) bits from value, leaving (width - (16-bi_valid))
945 * unused bits in value.
947 if (bi_valid > (int) Buf_size - length) {
948 bi_buf |= (value << bi_valid);
950 bi_buf = (ush) value >> (Buf_size - bi_valid);
951 bi_valid += length - Buf_size;
953 bi_buf |= value << bi_valid;
958 /* ===========================================================================
959 * Reverse the first len bits of a code, using straightforward code (a faster
960 * method would use a table)
961 * IN assertion: 1 <= len <= 15
963 unsigned bi_reverse(code, len)
964 unsigned code; /* the value to invert */
965 int len; /* its bit length */
967 register unsigned res = 0;
971 code >>= 1, res <<= 1;
976 /* ===========================================================================
977 * Write out any remaining bits in an incomplete byte.
983 } else if (bi_valid > 0) {
989 bits_sent = (bits_sent + 7) & ~7;
993 /* ===========================================================================
994 * Copy a stored block to the zip file, storing first the length and its
995 * one's complement if requested.
997 void copy_block(buf, len, header)
998 char *buf; /* the input data */
999 unsigned len; /* its length */
1000 int header; /* true if block header must be written */
1002 bi_windup(); /* align on byte boundary */
1005 put_short((ush) len);
1006 put_short((ush) ~ len);
1008 bits_sent += 2 * 16;
1012 bits_sent += (ulg) len << 3;
1025 /* deflate.c -- compress data using the deflation algorithm
1026 * Copyright (C) 1992-1993 Jean-loup Gailly
1027 * This is free software; you can redistribute it and/or modify it under the
1028 * terms of the GNU General Public License, see the file COPYING.
1034 * Identify new text as repetitions of old text within a fixed-
1035 * length sliding window trailing behind the new text.
1039 * The "deflation" process depends on being able to identify portions
1040 * of the input text which are identical to earlier input (within a
1041 * sliding window trailing behind the input currently being processed).
1043 * The most straightforward technique turns out to be the fastest for
1044 * most input files: try all possible matches and select the longest.
1045 * The key feature of this algorithm is that insertions into the string
1046 * dictionary are very simple and thus fast, and deletions are avoided
1047 * completely. Insertions are performed at each input character, whereas
1048 * string matches are performed only when the previous match ends. So it
1049 * is preferable to spend more time in matches to allow very fast string
1050 * insertions and avoid deletions. The matching algorithm for small
1051 * strings is inspired from that of Rabin & Karp. A brute force approach
1052 * is used to find longer strings when a small match has been found.
1053 * A similar algorithm is used in comic (by Jan-Mark Wams) and freeze
1054 * (by Leonid Broukhis).
1055 * A previous version of this file used a more sophisticated algorithm
1056 * (by Fiala and Greene) which is guaranteed to run in linear amortized
1057 * time, but has a larger average cost, uses more memory and is patented.
1058 * However the F&G algorithm may be faster for some highly redundant
1059 * files if the parameter max_chain_length (described below) is too large.
1063 * The idea of lazy evaluation of matches is due to Jan-Mark Wams, and
1064 * I found it in 'freeze' written by Leonid Broukhis.
1065 * Thanks to many info-zippers for bug reports and testing.
1069 * APPNOTE.TXT documentation file in PKZIP 1.93a distribution.
1071 * A description of the Rabin and Karp algorithm is given in the book
1072 * "Algorithms" by R. Sedgewick, Addison-Wesley, p252.
1074 * Fiala,E.R., and Greene,D.H.
1075 * Data Compression with Finite Windows, Comm.ACM, 32,4 (1989) 490-595
1079 * void lm_init (int pack_level, ush *flags)
1080 * Initialize the "longest match" routines for a new file
1082 * ulg deflate (void)
1083 * Processes a new input file and return its compressed length. Sets
1084 * the compressed length, crc, deflate flags and internal file
1090 /* ===========================================================================
1091 * Configuration parameters
1094 /* Compile with MEDIUM_MEM to reduce the memory requirements or
1095 * with SMALL_MEM to use as little memory as possible. Use BIG_MEM if the
1096 * entire input file can be held in memory (not possible on 16 bit systems).
1097 * Warning: defining these symbols affects HASH_BITS (see below) and thus
1098 * affects the compression ratio. The compressed output
1099 * is still correct, and might even be smaller in some cases.
1103 # define HASH_BITS 13 /* Number of bits used to hash strings */
1106 # define HASH_BITS 14
1109 # define HASH_BITS 15
1110 /* For portability to 16 bit machines, do not use values above 15. */
1113 /* To save space (see unlzw.c), we overlay prev+head with tab_prefix and
1114 * window with tab_suffix. Check that we can do this:
1116 #if (WSIZE<<1) > (1<<BITS)
1117 error:cannot overlay window with tab_suffix and prev with tab_prefix0
1119 #if HASH_BITS > BITS-1
1120 error:cannot overlay head with tab_prefix1
1122 #define HASH_SIZE (unsigned)(1<<HASH_BITS)
1123 #define HASH_MASK (HASH_SIZE-1)
1124 #define WMASK (WSIZE-1)
1125 /* HASH_SIZE and WSIZE must be powers of two */
1127 /* Tail of hash chains */
1130 /* speed options for the general purpose bit flag */
1132 # define TOO_FAR 4096
1134 /* Matches of length 3 are discarded if their distance exceeds TOO_FAR */
1135 /* ===========================================================================
1136 * Local data used by the "longest match" routines.
1139 typedef unsigned IPos;
1141 /* A Pos is an index in the character window. We use short instead of int to
1142 * save space in the various tables. IPos is used only for parameter passing.
1145 /* DECLARE(uch, window, 2L*WSIZE); */
1146 /* Sliding window. Input bytes are read into the second half of the window,
1147 * and move to the first half later to keep a dictionary of at least WSIZE
1148 * bytes. With this organization, matches are limited to a distance of
1149 * WSIZE-MAX_MATCH bytes, but this ensures that IO is always
1150 * performed with a length multiple of the block size. Also, it limits
1151 * the window size to 64K, which is quite useful on MSDOS.
1152 * To do: limit the window size to WSIZE+BSZ if SMALL_MEM (the code would
1153 * be less efficient).
1156 /* DECLARE(Pos, prev, WSIZE); */
1157 /* Link to older string with same hash index. To limit the size of this
1158 * array to 64K, this link is maintained only for the last 32K strings.
1159 * An index in this array is thus a window index modulo 32K.
1162 /* DECLARE(Pos, head, 1<<HASH_BITS); */
1163 /* Heads of the hash chains or NIL. */
1165 ulg window_size = (ulg) 2 * WSIZE;
1167 /* window size, 2*WSIZE except for MMAP or BIG_MEM, where it is the
1168 * input file length plus MIN_LOOKAHEAD.
1173 /* window position at the beginning of the current output block. Gets
1174 * negative when the window is moved backwards.
1177 local unsigned ins_h; /* hash index of string to be inserted */
1179 #define H_SHIFT ((HASH_BITS+MIN_MATCH-1)/MIN_MATCH)
1180 /* Number of bits by which ins_h and del_h must be shifted at each
1181 * input step. It must be such that after MIN_MATCH steps, the oldest
1182 * byte no longer takes part in the hash key, that is:
1183 * H_SHIFT * MIN_MATCH >= HASH_BITS
1186 unsigned int near prev_length;
1188 /* Length of the best match at previous step. Matches not greater than this
1189 * are discarded. This is used in the lazy match evaluation.
1192 unsigned near strstart; /* start of string to insert */
1193 unsigned near match_start; /* start of matching string */
1194 local int eofile; /* flag set at end of input file */
1195 local unsigned lookahead; /* number of valid bytes ahead in window */
1197 unsigned near max_chain_length;
1199 /* To speed up deflation, hash chains are never searched beyond this length.
1200 * A higher limit improves compression ratio but degrades the speed.
1203 local unsigned int max_lazy_match;
1205 /* Attempt to find a better match only when the current match is strictly
1206 * smaller than this value. This mechanism is used only for compression
1209 #define max_insert_length max_lazy_match
1210 /* Insert new strings in the hash table only if the match length
1211 * is not greater than this length. This saves time but degrades compression.
1212 * max_insert_length is used only for compression levels <= 3.
1215 unsigned near good_match;
1217 /* Use a faster search when the previous match is longer than this */
1220 /* Values for max_lazy_match, good_match and max_chain_length, depending on
1221 * the desired pack level (0..9). The values given below have been tuned to
1222 * exclude worst case performance for pathological files. Better values may be
1223 * found for specific files.
1226 typedef struct config {
1227 ush good_length; /* reduce lazy search above this match length */
1228 ush max_lazy; /* do not perform lazy search above this match length */
1229 ush nice_length; /* quit search above this match length */
1234 # define nice_match MAX_MATCH
1236 int near nice_match; /* Stop searching when current match exceeds this */
1239 local config configuration_table =
1240 /* 9 */ { 32, 258, 258, 4096 };
1241 /* maximum compression */
1243 /* Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4
1244 * For deflate_fast() (levels <= 3) good is ignored and lazy has a different
1249 /* result of memcmp for equal strings */
1251 /* ===========================================================================
1252 * Prototypes for local functions.
1254 local void fill_window (void);
1256 int longest_match (IPos cur_match);
1259 void match_init (void); /* asm code initialization */
1263 local void check_match (IPos start, IPos match, int length);
1266 /* ===========================================================================
1267 * Update a hash value with the given input byte
1268 * IN assertion: all calls to to UPDATE_HASH are made with consecutive
1269 * input characters, so that a running hash key can be computed from the
1270 * previous key instead of complete recalculation each time.
1272 #define UPDATE_HASH(h,c) (h = (((h)<<H_SHIFT) ^ (c)) & HASH_MASK)
1274 /* ===========================================================================
1275 * Insert string s in the dictionary and set match_head to the previous head
1276 * of the hash chain (the most recent string with same hash key). Return
1277 * the previous length of the hash chain.
1278 * IN assertion: all calls to to INSERT_STRING are made with consecutive
1279 * input characters and the first MIN_MATCH bytes of s are valid
1280 * (except for the last MIN_MATCH-1 bytes of the input file).
1282 #define INSERT_STRING(s, match_head) \
1283 (UPDATE_HASH(ins_h, window[(s) + MIN_MATCH-1]), \
1284 prev[(s) & WMASK] = match_head = head[ins_h], \
1287 /* ===========================================================================
1288 * Initialize the "longest match" routines for a new file
1291 ush *flags; /* general purpose bit flag */
1293 register unsigned j;
1295 /* Initialize the hash table. */
1296 #if defined(MAXSEG_64K) && HASH_BITS == 15
1297 for (j = 0; j < HASH_SIZE; j++)
1300 memzero((char *) head, HASH_SIZE * sizeof(*head));
1302 /* prev will be initialized on the fly */
1304 /* Set the default configuration parameters:
1306 max_lazy_match = configuration_table.max_lazy;
1307 good_match = configuration_table.good_length;
1309 nice_match = configuration_table.nice_length;
1311 max_chain_length = configuration_table.max_chain;
1313 /* ??? reduce max_chain_length for binary files */
1318 match_init(); /* initialize the asm code */
1321 lookahead = read_buf((char *) window,
1322 sizeof(int) <= 2 ? (unsigned) WSIZE : 2 * WSIZE);
1324 if (lookahead == 0 || lookahead == (unsigned) EOF) {
1325 eofile = 1, lookahead = 0;
1329 /* Make sure that we always have enough lookahead. This is important
1330 * if input comes from a device such as a tty.
1332 while (lookahead < MIN_LOOKAHEAD && !eofile)
1336 for (j = 0; j < MIN_MATCH - 1; j++)
1337 UPDATE_HASH(ins_h, window[j]);
1338 /* If lookahead < MIN_MATCH, ins_h is garbage, but this is
1339 * not important since only literal bytes will be emitted.
1343 /* ===========================================================================
1344 * Set match_start to the longest match starting at the given string and
1345 * return its length. Matches shorter or equal to prev_length are discarded,
1346 * in which case the result is equal to prev_length and match_start is
1348 * IN assertions: cur_match is the head of the hash chain for the current
1349 * string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1
1352 /* For MSDOS, OS/2 and 386 Unix, an optimized version is in match.asm or
1353 * match.s. The code is functionally equivalent, so you can use the C version
1356 int longest_match(cur_match)
1357 IPos cur_match; /* current match */
1359 unsigned chain_length = max_chain_length; /* max hash chain length */
1360 register uch *scan = window + strstart; /* current string */
1361 register uch *match; /* matched string */
1362 register int len; /* length of current match */
1363 int best_len = prev_length; /* best match length so far */
1366 strstart > (IPos) MAX_DIST ? strstart - (IPos) MAX_DIST : NIL;
1367 /* Stop when cur_match becomes <= limit. To simplify the code,
1368 * we prevent matches with the string of window index 0.
1371 /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.
1372 * It is easy to get rid of this optimization if necessary.
1374 #if HASH_BITS < 8 || MAX_MATCH != 258
1375 error:Code too clever
1378 /* Compare two bytes at a time. Note: this is not always beneficial.
1379 * Try with and without -DUNALIGNED_OK to check.
1381 register uch *strend = window + strstart + MAX_MATCH - 1;
1382 register ush scan_start = *(ush *) scan;
1383 register ush scan_end = *(ush *) (scan + best_len - 1);
1385 register uch *strend = window + strstart + MAX_MATCH;
1386 register uch scan_end1 = scan[best_len - 1];
1387 register uch scan_end = scan[best_len];
1390 /* Do not waste too much time if we already have a good match: */
1391 if (prev_length >= good_match) {
1394 Assert(strstart <= window_size - MIN_LOOKAHEAD,
1395 "insufficient lookahead");
1398 Assert(cur_match < strstart, "no future");
1399 match = window + cur_match;
1401 /* Skip to next match if the match length cannot increase
1402 * or if the match length is less than 2:
1404 #if (defined(UNALIGNED_OK) && MAX_MATCH == 258)
1405 /* This code assumes sizeof(unsigned short) == 2. Do not use
1406 * UNALIGNED_OK if your compiler uses a different size.
1408 if (*(ush *) (match + best_len - 1) != scan_end ||
1409 *(ush *) match != scan_start)
1412 /* It is not necessary to compare scan[2] and match[2] since they are
1413 * always equal when the other bytes match, given that the hash keys
1414 * are equal and that HASH_BITS >= 8. Compare 2 bytes at a time at
1415 * strstart+3, +5, ... up to strstart+257. We check for insufficient
1416 * lookahead only every 4th comparison; the 128th check will be made
1417 * at strstart+257. If MAX_MATCH-2 is not a multiple of 8, it is
1418 * necessary to put more guard bytes at the end of the window, or
1419 * to check more often for insufficient lookahead.
1423 } while (*(ush *) (scan += 2) == *(ush *) (match += 2) &&
1424 *(ush *) (scan += 2) == *(ush *) (match += 2) &&
1425 *(ush *) (scan += 2) == *(ush *) (match += 2) &&
1426 *(ush *) (scan += 2) == *(ush *) (match += 2) &&
1428 /* The funny "do {}" generates better code on most compilers */
1430 /* Here, scan <= window+strstart+257 */
1431 Assert(scan <= window + (unsigned) (window_size - 1), "wild scan");
1432 if (*scan == *match)
1435 len = (MAX_MATCH - 1) - (int) (strend - scan);
1436 scan = strend - (MAX_MATCH - 1);
1438 #else /* UNALIGNED_OK */
1440 if (match[best_len] != scan_end ||
1441 match[best_len - 1] != scan_end1 ||
1442 *match != *scan || *++match != scan[1])
1445 /* The check at best_len-1 can be removed because it will be made
1446 * again later. (This heuristic is not always a win.)
1447 * It is not necessary to compare scan[2] and match[2] since they
1448 * are always equal when the other bytes match, given that
1449 * the hash keys are equal and that HASH_BITS >= 8.
1453 /* We check for insufficient lookahead only every 8th comparison;
1454 * the 256th check will be made at strstart+258.
1457 } while (*++scan == *++match && *++scan == *++match &&
1458 *++scan == *++match && *++scan == *++match &&
1459 *++scan == *++match && *++scan == *++match &&
1460 *++scan == *++match && *++scan == *++match &&
1463 len = MAX_MATCH - (int) (strend - scan);
1464 scan = strend - MAX_MATCH;
1466 #endif /* UNALIGNED_OK */
1468 if (len > best_len) {
1469 match_start = cur_match;
1471 if (len >= nice_match)
1474 scan_end = *(ush *) (scan + best_len - 1);
1476 scan_end1 = scan[best_len - 1];
1477 scan_end = scan[best_len];
1480 } while ((cur_match = prev[cur_match & WMASK]) > limit
1481 && --chain_length != 0);
1488 /* ===========================================================================
1489 * Check that the match at match_start is indeed a match.
1491 local void check_match(start, match, length)
1495 /* check that the match is indeed a match */
1496 if (memcmp((char *) window + match,
1497 (char *) window + start, length) != EQUAL) {
1499 " start %d, match %d, length %d\n", start, match, length);
1500 error_msg("invalid match");
1503 fprintf(stderr, "\\[%d,%d]", start - match, length);
1505 putc(window[start++], stderr);
1506 } while (--length != 0);
1510 # define check_match(start, match, length)
1513 /* ===========================================================================
1514 * Fill the window when the lookahead becomes insufficient.
1515 * Updates strstart and lookahead, and sets eofile if end of input file.
1516 * IN assertion: lookahead < MIN_LOOKAHEAD && strstart + lookahead > 0
1517 * OUT assertions: at least one byte has been read, or eofile is set;
1518 * file reads are performed for at least two bytes (required for the
1519 * translate_eol option).
1521 local void fill_window()
1523 register unsigned n, m;
1526 (unsigned) (window_size - (ulg) lookahead - (ulg) strstart);
1527 /* Amount of free space at the end of the window. */
1529 /* If the window is almost full and there is insufficient lookahead,
1530 * move the upper half to the lower one to make room in the upper half.
1532 if (more == (unsigned) EOF) {
1533 /* Very unlikely, but possible on 16 bit machine if strstart == 0
1534 * and lookahead == 1 (input done one byte at time)
1537 } else if (strstart >= WSIZE + MAX_DIST) {
1538 /* By the IN assertion, the window is not empty so we can't confuse
1539 * more == 0 with more == 64K on a 16 bit machine.
1541 Assert(window_size == (ulg) 2 * WSIZE, "no sliding with BIG_MEM");
1543 memcpy((char *) window, (char *) window + WSIZE, (unsigned) WSIZE);
1544 match_start -= WSIZE;
1545 strstart -= WSIZE; /* we now have strstart >= MAX_DIST: */
1547 block_start -= (long) WSIZE;
1549 for (n = 0; n < HASH_SIZE; n++) {
1551 head[n] = (Pos) (m >= WSIZE ? m - WSIZE : NIL);
1553 for (n = 0; n < WSIZE; n++) {
1555 prev[n] = (Pos) (m >= WSIZE ? m - WSIZE : NIL);
1556 /* If n is not on any hash chain, prev[n] is garbage but
1557 * its value will never be used.
1562 /* At this point, more >= 2 */
1564 n = read_buf((char *) window + strstart + lookahead, more);
1565 if (n == 0 || n == (unsigned) EOF) {
1573 /* ===========================================================================
1574 * Flush the current block, with given end-of-file flag.
1575 * IN assertion: strstart is set to the end of the current match.
1577 #define FLUSH_BLOCK(eof) \
1578 flush_block(block_start >= 0L ? (char*)&window[(unsigned)block_start] : \
1579 (char*)NULL, (long)strstart - block_start, (eof))
1581 /* ===========================================================================
1582 * Same as above, but achieves better compression. We use a lazy
1583 * evaluation for matches: a match is finally adopted only if there is
1584 * no better match at the next window position.
1588 IPos hash_head; /* head of hash chain */
1589 IPos prev_match; /* previous match */
1590 int flush; /* set if current block must be flushed */
1591 int match_available = 0; /* set if previous match exists */
1592 register unsigned match_length = MIN_MATCH - 1; /* length of best match */
1595 extern long isize; /* byte length of input file, for debug only */
1598 /* Process the input block. */
1599 while (lookahead != 0) {
1600 /* Insert the string window[strstart .. strstart+2] in the
1601 * dictionary, and set hash_head to the head of the hash chain:
1603 INSERT_STRING(strstart, hash_head);
1605 /* Find the longest match, discarding those <= prev_length.
1607 prev_length = match_length, prev_match = match_start;
1608 match_length = MIN_MATCH - 1;
1610 if (hash_head != NIL && prev_length < max_lazy_match &&
1611 strstart - hash_head <= MAX_DIST) {
1612 /* To simplify the code, we prevent matches with the string
1613 * of window index 0 (in particular we have to avoid a match
1614 * of the string with itself at the start of the input file).
1616 match_length = longest_match(hash_head);
1617 /* longest_match() sets match_start */
1618 if (match_length > lookahead)
1619 match_length = lookahead;
1621 /* Ignore a length 3 match if it is too distant: */
1622 if (match_length == MIN_MATCH
1623 && strstart - match_start > TOO_FAR) {
1624 /* If prev_match is also MIN_MATCH, match_start is garbage
1625 * but we will ignore the current match anyway.
1630 /* If there was a match at the previous step and the current
1631 * match is not better, output the previous match:
1633 if (prev_length >= MIN_MATCH && match_length <= prev_length) {
1635 check_match(strstart - 1, prev_match, prev_length);
1638 ct_tally(strstart - 1 - prev_match,
1639 prev_length - MIN_MATCH);
1641 /* Insert in hash table all strings up to the end of the match.
1642 * strstart-1 and strstart are already inserted.
1644 lookahead -= prev_length - 1;
1648 INSERT_STRING(strstart, hash_head);
1649 /* strstart never exceeds WSIZE-MAX_MATCH, so there are
1650 * always MIN_MATCH bytes ahead. If lookahead < MIN_MATCH
1651 * these bytes are garbage, but it does not matter since the
1652 * next lookahead bytes will always be emitted as literals.
1654 } while (--prev_length != 0);
1655 match_available = 0;
1656 match_length = MIN_MATCH - 1;
1659 FLUSH_BLOCK(0), block_start = strstart;
1661 } else if (match_available) {
1662 /* If there was no match at the previous position, output a
1663 * single literal. If there was a match but the current match
1664 * is longer, truncate the previous match to a single literal.
1666 Tracevv((stderr, "%c", window[strstart - 1]));
1667 if (ct_tally(0, window[strstart - 1])) {
1668 FLUSH_BLOCK(0), block_start = strstart;
1673 /* There is no previous match to compare with, wait for
1674 * the next step to decide.
1676 match_available = 1;
1680 Assert(strstart <= isize && lookahead <= isize, "a bit too far");
1682 /* Make sure that we always have enough lookahead, except
1683 * at the end of the input file. We need MAX_MATCH bytes
1684 * for the next match, plus MIN_MATCH bytes to insert the
1685 * string following the next match.
1687 while (lookahead < MIN_LOOKAHEAD && !eofile)
1690 if (match_available)
1691 ct_tally(0, window[strstart - 1]);
1693 return FLUSH_BLOCK(1); /* eof */
1696 /* gzip (GNU zip) -- compress files with zip algorithm and 'compress' interface
1697 * Copyright (C) 1992-1993 Jean-loup Gailly
1698 * The unzip code was written and put in the public domain by Mark Adler.
1699 * Portions of the lzw code are derived from the public domain 'compress'
1700 * written by Spencer Thomas, Joe Orost, James Woods, Jim McKie, Steve Davies,
1701 * Ken Turkowski, Dave Mack and Peter Jannesen.
1703 * See the license_msg below and the file COPYING for the software license.
1704 * See the file algorithm.doc for the compression algorithms and file formats.
1707 /* Compress files with zip algorithm and 'compress' interface.
1708 * See usage() and help() functions below for all options.
1710 * file.gz: compressed file with same mode, owner, and utimes
1711 * or stdout with -c option or if stdin used as input.
1712 * If the output file name had to be truncated, the original name is kept
1713 * in the compressed file.
1714 * On MSDOS, file.tmp -> file.tmz. On VMS, file.tmp -> file.tmp-gz.
1716 * Using gz on MSDOS would create too many file name conflicts. For
1717 * example, foo.txt -> foo.tgz (.tgz must be reserved as shorthand for
1718 * tar.gz). Similarly, foo.dir and foo.doc would both be mapped to foo.dgz.
1719 * I also considered 12345678.txt -> 12345txt.gz but this truncates the name
1720 * too heavily. There is no ideal solution given the MSDOS 8+3 limitation.
1722 * For the meaning of all compilation flags, see comments in Makefile.in.
1726 #include <sys/types.h>
1733 # include <sys/time.h>
1742 #ifdef HAVE_UNISTD_H
1743 # include <unistd.h>
1747 # include <dirent.h>
1748 typedef struct dirent dir_type;
1750 # define NLENGTH(dirent) ((int)strlen((dirent)->d_name))
1751 # define DIR_OPT "DIRENT"
1753 # define NLENGTH(dirent) ((dirent)->d_namlen)
1755 # include <sys/dir.h>
1756 typedef struct direct dir_type;
1758 # define DIR_OPT "SYSDIR"
1761 # include <sys/ndir.h>
1762 typedef struct direct dir_type;
1764 # define DIR_OPT "SYSNDIR"
1768 typedef struct direct dir_type;
1770 # define DIR_OPT "NDIR"
1773 # define DIR_OPT "NO_DIR"
1782 # define TIME_OPT "UTIME"
1784 # ifdef HAVE_SYS_UTIME_H
1785 # include <sys/utime.h>
1786 # define TIME_OPT "SYS_UTIME"
1793 # define TIME_OPT ""
1797 # define TIME_OPT "NO_UTIME"
1800 #if !defined(S_ISDIR) && defined(S_IFDIR)
1801 # define S_ISDIR(m) (((m) & S_IFMT) == S_IFDIR)
1803 #if !defined(S_ISREG) && defined(S_IFREG)
1804 # define S_ISREG(m) (((m) & S_IFMT) == S_IFREG)
1807 typedef RETSIGTYPE(*sig_type) (int);
1810 # define O_BINARY 0 /* creation mode for open() */
1814 /* Pure BSD system? */
1815 # include <sys/file.h>
1817 # define O_CREAT FCREAT
1820 # define O_EXCL FEXCL
1825 # define S_IRUSR 0400
1828 # define S_IWUSR 0200
1830 #define RW_USER (S_IRUSR | S_IWUSR) /* creation mode for open() */
1832 #ifndef MAX_PATH_LEN
1833 # define MAX_PATH_LEN 1024 /* max pathname length */
1842 off_t lseek (int fd, off_t offset, int whence);
1845 /* Separator for file name parts (see shorten_name()) */
1846 #ifdef NO_MULTIPLE_DOTS
1847 # define PART_SEP "-"
1849 # define PART_SEP "."
1852 /* global buffers */
1854 DECLARE(uch, inbuf, INBUFSIZ + INBUF_EXTRA);
1855 DECLARE(uch, outbuf, OUTBUFSIZ + OUTBUF_EXTRA);
1856 DECLARE(ush, d_buf, DIST_BUFSIZE);
1857 DECLARE(uch, window, 2L * WSIZE);
1859 DECLARE(ush, tab_prefix, 1L << BITS);
1861 DECLARE(ush, tab_prefix0, 1L << (BITS - 1));
1862 DECLARE(ush, tab_prefix1, 1L << (BITS - 1));
1865 /* local variables */
1867 static int foreground; /* set if program run in foreground */
1868 static int method = DEFLATED; /* compression method */
1869 static int exit_code = OK; /* program exit code */
1870 static int part_nb; /* number of parts in .gz file */
1871 static long time_stamp; /* original time stamp (modification time) */
1872 static long ifile_size; /* input file size, -1 for devices (debug only) */
1873 static char z_suffix[MAX_SUFFIX + 1]; /* default suffix (can be set with --suffix) */
1874 static int z_len; /* strlen(z_suffix) */
1876 static long bytes_in; /* number of input bytes */
1877 static long bytes_out; /* number of output bytes */
1878 static char ifname[MAX_PATH_LEN]; /* input file name */
1879 static char ofname[MAX_PATH_LEN]; /* output file name */
1880 static int ifd; /* input file descriptor */
1881 static int ofd; /* output file descriptor */
1882 static unsigned insize; /* valid bytes in inbuf */
1883 static unsigned outcnt; /* bytes in output buffer */
1885 /* local functions */
1887 #define strequ(s1, s2) (strcmp((s1),(s2)) == 0)
1889 /* ======================================================================== */
1890 // int main (argc, argv)
1893 int gzip_main(int argc, char **argv)
1898 struct stat statBuf;
1905 while ((opt = getopt(argc, argv, "cf123456789d")) != -1) {
1913 /* Ignore 1-9 (compression level) options */
1914 case '1': case '2': case '3': case '4': case '5':
1915 case '6': case '7': case '8': case '9':
1920 return gunzip_main(argc, argv);
1926 if (optind == argc) {
1931 if (isatty(fileno(stdout)) && tostdout==1 && force==0)
1932 error_msg_and_die( "compressed data not written to terminal. Use -f to force it.");
1934 foreground = signal(SIGINT, SIG_IGN) != SIG_IGN;
1936 (void) signal(SIGINT, (sig_type) abort_gzip);
1939 if (signal(SIGTERM, SIG_IGN) != SIG_IGN) {
1940 (void) signal(SIGTERM, (sig_type) abort_gzip);
1944 if (signal(SIGHUP, SIG_IGN) != SIG_IGN) {
1945 (void) signal(SIGHUP, (sig_type) abort_gzip);
1949 strncpy(z_suffix, Z_SUFFIX, sizeof(z_suffix) - 1);
1950 z_len = strlen(z_suffix);
1952 /* Allocate all global buffers (for DYN_ALLOC option) */
1953 ALLOC(uch, inbuf, INBUFSIZ + INBUF_EXTRA);
1954 ALLOC(uch, outbuf, OUTBUFSIZ + OUTBUF_EXTRA);
1955 ALLOC(ush, d_buf, DIST_BUFSIZE);
1956 ALLOC(uch, window, 2L * WSIZE);
1958 ALLOC(ush, tab_prefix, 1L << BITS);
1960 ALLOC(ush, tab_prefix0, 1L << (BITS - 1));
1961 ALLOC(ush, tab_prefix1, 1L << (BITS - 1));
1964 if (fromstdin == 1) {
1965 strcpy(ofname, "stdin");
1967 inFileNum = fileno(stdin);
1968 time_stamp = 0; /* time unknown by default */
1969 ifile_size = -1L; /* convention for unknown size */
1971 /* Open up the input file */
1972 strncpy(ifname, argv[optind], MAX_PATH_LEN);
1974 /* Open input file */
1975 inFileNum = open(ifname, O_RDONLY);
1977 perror_msg_and_die("%s", ifname);
1978 /* Get the time stamp on the input file. */
1979 if (stat(ifname, &statBuf) < 0)
1980 perror_msg_and_die("%s", ifname);
1981 time_stamp = statBuf.st_ctime;
1982 ifile_size = statBuf.st_size;
1986 if (tostdout == 1) {
1987 /* And get to work */
1988 strcpy(ofname, "stdout");
1989 outFileNum = fileno(stdout);
1990 SET_BINARY_MODE(fileno(stdout));
1992 clear_bufs(); /* clear input and output buffers */
1995 /* Actually do the compression/decompression. */
1996 zip(inFileNum, outFileNum);
2000 /* And get to work */
2001 strncpy(ofname, ifname, MAX_PATH_LEN - 4);
2002 strcat(ofname, ".gz");
2005 /* Open output fille */
2006 #if (__GLIBC__ >= 2) && (__GLIBC_MINOR__ >= 1)
2007 outFileNum = open(ofname, O_RDWR | O_CREAT | O_EXCL | O_NOFOLLOW);
2009 outFileNum = open(ofname, O_RDWR | O_CREAT | O_EXCL);
2012 perror_msg_and_die("%s", ofname);
2013 SET_BINARY_MODE(outFileNum);
2014 /* Set permissions on the file */
2015 fchmod(outFileNum, statBuf.st_mode);
2017 clear_bufs(); /* clear input and output buffers */
2020 /* Actually do the compression/decompression. */
2021 result = zip(inFileNum, outFileNum);
2024 /* Delete the original file */
2026 delFileName = ifname;
2028 delFileName = ofname;
2030 if (unlink(delFileName) < 0)
2031 perror_msg_and_die("%s", delFileName);
2037 /* trees.c -- output deflated data using Huffman coding
2038 * Copyright (C) 1992-1993 Jean-loup Gailly
2039 * This is free software; you can redistribute it and/or modify it under the
2040 * terms of the GNU General Public License, see the file COPYING.
2046 * Encode various sets of source values using variable-length
2047 * binary code trees.
2051 * The PKZIP "deflation" process uses several Huffman trees. The more
2052 * common source values are represented by shorter bit sequences.
2054 * Each code tree is stored in the ZIP file in a compressed form
2055 * which is itself a Huffman encoding of the lengths of
2056 * all the code strings (in ascending order by source values).
2057 * The actual code strings are reconstructed from the lengths in
2058 * the UNZIP process, as described in the "application note"
2059 * (APPNOTE.TXT) distributed as part of PKWARE's PKZIP program.
2064 * Data Compression: Techniques and Applications, pp. 53-55.
2065 * Lifetime Learning Publications, 1985. ISBN 0-534-03418-7.
2068 * Data Compression: Methods and Theory, pp. 49-50.
2069 * Computer Science Press, 1988. ISBN 0-7167-8156-5.
2073 * Addison-Wesley, 1983. ISBN 0-201-06672-6.
2077 * void ct_init (ush *attr, int *methodp)
2078 * Allocate the match buffer, initialize the various tables and save
2079 * the location of the internal file attribute (ascii/binary) and
2080 * method (DEFLATE/STORE)
2082 * void ct_tally (int dist, int lc);
2083 * Save the match info and tally the frequency counts.
2085 * long flush_block (char *buf, ulg stored_len, int eof)
2086 * Determine the best encoding for the current block: dynamic trees,
2087 * static trees or store, and output the encoded block to the zip
2088 * file. Returns the total compressed length for the file so far.
2094 /* ===========================================================================
2099 /* All codes must not exceed MAX_BITS bits */
2101 #define MAX_BL_BITS 7
2102 /* Bit length codes must not exceed MAX_BL_BITS bits */
2104 #define LENGTH_CODES 29
2105 /* number of length codes, not counting the special END_BLOCK code */
2107 #define LITERALS 256
2108 /* number of literal bytes 0..255 */
2110 #define END_BLOCK 256
2111 /* end of block literal code */
2113 #define L_CODES (LITERALS+1+LENGTH_CODES)
2114 /* number of Literal or Length codes, including the END_BLOCK code */
2117 /* number of distance codes */
2120 /* number of codes used to transfer the bit lengths */
2123 local int near extra_lbits[LENGTH_CODES] /* extra bits for each length code */
2124 = { 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4,
2125 4, 4, 5, 5, 5, 5, 0 };
2127 local int near extra_dbits[D_CODES] /* extra bits for each distance code */
2128 = { 0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9,
2129 10, 10, 11, 11, 12, 12, 13, 13 };
2131 local int near extra_blbits[BL_CODES] /* extra bits for each bit length code */
2132 = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3, 7 };
2134 #define STORED_BLOCK 0
2135 #define STATIC_TREES 1
2137 /* The three kinds of block type */
2141 # define LIT_BUFSIZE 0x2000
2144 # define LIT_BUFSIZE 0x4000
2146 # define LIT_BUFSIZE 0x8000
2150 #ifndef DIST_BUFSIZE
2151 # define DIST_BUFSIZE LIT_BUFSIZE
2153 /* Sizes of match buffers for literals/lengths and distances. There are
2154 * 4 reasons for limiting LIT_BUFSIZE to 64K:
2155 * - frequencies can be kept in 16 bit counters
2156 * - if compression is not successful for the first block, all input data is
2157 * still in the window so we can still emit a stored block even when input
2158 * comes from standard input. (This can also be done for all blocks if
2159 * LIT_BUFSIZE is not greater than 32K.)
2160 * - if compression is not successful for a file smaller than 64K, we can
2161 * even emit a stored file instead of a stored block (saving 5 bytes).
2162 * - creating new Huffman trees less frequently may not provide fast
2163 * adaptation to changes in the input data statistics. (Take for
2164 * example a binary file with poorly compressible code followed by
2165 * a highly compressible string table.) Smaller buffer sizes give
2166 * fast adaptation but have of course the overhead of transmitting trees
2168 * - I can't count above 4
2169 * The current code is general and allows DIST_BUFSIZE < LIT_BUFSIZE (to save
2170 * memory at the expense of compression). Some optimizations would be possible
2171 * if we rely on DIST_BUFSIZE == LIT_BUFSIZE.
2173 #if LIT_BUFSIZE > INBUFSIZ
2174 error cannot overlay l_buf and inbuf
2177 /* repeat previous bit length 3-6 times (2 bits of repeat count) */
2178 #define REPZ_3_10 17
2179 /* repeat a zero length 3-10 times (3 bits of repeat count) */
2180 #define REPZ_11_138 18
2181 /* repeat a zero length 11-138 times (7 bits of repeat count) *//* ===========================================================================
2183 *//* Data structure describing a single value and its code string. */ typedef struct ct_data {
2185 ush freq; /* frequency count */
2186 ush code; /* bit string */
2189 ush dad; /* father node in Huffman tree */
2190 ush len; /* length of bit string */
2194 #define Freq fc.freq
2195 #define Code fc.code
2199 #define HEAP_SIZE (2*L_CODES+1)
2200 /* maximum heap size */
2202 local ct_data near dyn_ltree[HEAP_SIZE]; /* literal and length tree */
2203 local ct_data near dyn_dtree[2 * D_CODES + 1]; /* distance tree */
2205 local ct_data near static_ltree[L_CODES + 2];
2207 /* The static literal tree. Since the bit lengths are imposed, there is no
2208 * need for the L_CODES extra codes used during heap construction. However
2209 * The codes 286 and 287 are needed to build a canonical tree (see ct_init
2213 local ct_data near static_dtree[D_CODES];
2215 /* The static distance tree. (Actually a trivial tree since all codes use
2219 local ct_data near bl_tree[2 * BL_CODES + 1];
2221 /* Huffman tree for the bit lengths */
2223 typedef struct tree_desc {
2224 ct_data near *dyn_tree; /* the dynamic tree */
2225 ct_data near *static_tree; /* corresponding static tree or NULL */
2226 int near *extra_bits; /* extra bits for each code or NULL */
2227 int extra_base; /* base index for extra_bits */
2228 int elems; /* max number of elements in the tree */
2229 int max_length; /* max bit length for the codes */
2230 int max_code; /* largest code with non zero frequency */
2233 local tree_desc near l_desc =
2234 { dyn_ltree, static_ltree, extra_lbits, LITERALS + 1, L_CODES,
2237 local tree_desc near d_desc =
2238 { dyn_dtree, static_dtree, extra_dbits, 0, D_CODES, MAX_BITS, 0 };
2240 local tree_desc near bl_desc =
2241 { bl_tree, (ct_data near *) 0, extra_blbits, 0, BL_CODES, MAX_BL_BITS,
2245 local ush near bl_count[MAX_BITS + 1];
2247 /* number of codes at each bit length for an optimal tree */
2249 local uch near bl_order[BL_CODES]
2250 = { 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 };
2252 /* The lengths of the bit length codes are sent in order of decreasing
2253 * probability, to avoid transmitting the lengths for unused bit length codes.
2256 local int near heap[2 * L_CODES + 1]; /* heap used to build the Huffman trees */
2257 local int heap_len; /* number of elements in the heap */
2258 local int heap_max; /* element of largest frequency */
2260 /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.
2261 * The same heap array is used to build all trees.
2264 local uch near depth[2 * L_CODES + 1];
2266 /* Depth of each subtree used as tie breaker for trees of equal frequency */
2268 local uch length_code[MAX_MATCH - MIN_MATCH + 1];
2270 /* length code for each normalized match length (0 == MIN_MATCH) */
2272 local uch dist_code[512];
2274 /* distance codes. The first 256 values correspond to the distances
2275 * 3 .. 258, the last 256 values correspond to the top 8 bits of
2276 * the 15 bit distances.
2279 local int near base_length[LENGTH_CODES];
2281 /* First normalized length for each code (0 = MIN_MATCH) */
2283 local int near base_dist[D_CODES];
2285 /* First normalized distance for each code (0 = distance of 1) */
2288 /* DECLARE(uch, l_buf, LIT_BUFSIZE); buffer for literals or lengths */
2290 /* DECLARE(ush, d_buf, DIST_BUFSIZE); buffer for distances */
2292 local uch near flag_buf[(LIT_BUFSIZE / 8)];
2294 /* flag_buf is a bit array distinguishing literals from lengths in
2295 * l_buf, thus indicating the presence or absence of a distance.
2298 local unsigned last_lit; /* running index in l_buf */
2299 local unsigned last_dist; /* running index in d_buf */
2300 local unsigned last_flags; /* running index in flag_buf */
2301 local uch flags; /* current flags not yet saved in flag_buf */
2302 local uch flag_bit; /* current bit used in flags */
2304 /* bits are filled in flags starting at bit 0 (least significant).
2305 * Note: these flags are overkill in the current code since we don't
2306 * take advantage of DIST_BUFSIZE == LIT_BUFSIZE.
2309 local ulg opt_len; /* bit length of current block with optimal trees */
2310 local ulg static_len; /* bit length of current block with static trees */
2312 local ulg compressed_len; /* total bit length of compressed file */
2314 local ulg input_len; /* total byte length of input file */
2316 /* input_len is for debugging only since we can get it by other means. */
2318 ush *file_type; /* pointer to UNKNOWN, BINARY or ASCII */
2319 int *file_method; /* pointer to DEFLATE or STORE */
2322 extern ulg bits_sent; /* bit length of the compressed data */
2323 extern long isize; /* byte length of input file */
2326 extern long block_start; /* window offset of current block */
2327 extern unsigned near strstart; /* window offset of current string */
2329 /* ===========================================================================
2330 * Local (static) routines in this file.
2333 local void init_block (void);
2334 local void pqdownheap (ct_data near * tree, int k);
2335 local void gen_bitlen (tree_desc near * desc);
2336 local void gen_codes (ct_data near * tree, int max_code);
2337 local void build_tree (tree_desc near * desc);
2338 local void scan_tree (ct_data near * tree, int max_code);
2339 local void send_tree (ct_data near * tree, int max_code);
2340 local int build_bl_tree (void);
2341 local void send_all_trees (int lcodes, int dcodes, int blcodes);
2342 local void compress_block (ct_data near * ltree, ct_data near * dtree);
2343 local void set_file_type (void);
2347 # define send_code(c, tree) send_bits(tree[c].Code, tree[c].Len)
2348 /* Send a code of the given tree. c and tree must not have side effects */
2351 # define send_code(c, tree) \
2352 { if (verbose>1) fprintf(stderr,"\ncd %3d ",(c)); \
2353 send_bits(tree[c].Code, tree[c].Len); }
2356 #define d_code(dist) \
2357 ((dist) < 256 ? dist_code[dist] : dist_code[256+((dist)>>7)])
2358 /* Mapping from a distance to a distance code. dist is the distance - 1 and
2359 * must not have side effects. dist_code[256] and dist_code[257] are never
2363 /* the arguments must not have side effects */
2365 /* ===========================================================================
2366 * Allocate the match buffer, initialize the various tables and save the
2367 * location of the internal file attribute (ascii/binary) and method
2370 void ct_init(attr, methodp)
2371 ush *attr; /* pointer to internal file attribute */
2372 int *methodp; /* pointer to compression method */
2374 int n; /* iterates over tree elements */
2375 int bits; /* bit counter */
2376 int length; /* length value */
2377 int code; /* code value */
2378 int dist; /* distance index */
2381 file_method = methodp;
2382 compressed_len = input_len = 0L;
2384 if (static_dtree[0].Len != 0)
2385 return; /* ct_init already called */
2387 /* Initialize the mapping length (0..255) -> length code (0..28) */
2389 for (code = 0; code < LENGTH_CODES - 1; code++) {
2390 base_length[code] = length;
2391 for (n = 0; n < (1 << extra_lbits[code]); n++) {
2392 length_code[length++] = (uch) code;
2395 Assert(length == 256, "ct_init: length != 256");
2396 /* Note that the length 255 (match length 258) can be represented
2397 * in two different ways: code 284 + 5 bits or code 285, so we
2398 * overwrite length_code[255] to use the best encoding:
2400 length_code[length - 1] = (uch) code;
2402 /* Initialize the mapping dist (0..32K) -> dist code (0..29) */
2404 for (code = 0; code < 16; code++) {
2405 base_dist[code] = dist;
2406 for (n = 0; n < (1 << extra_dbits[code]); n++) {
2407 dist_code[dist++] = (uch) code;
2410 Assert(dist == 256, "ct_init: dist != 256");
2411 dist >>= 7; /* from now on, all distances are divided by 128 */
2412 for (; code < D_CODES; code++) {
2413 base_dist[code] = dist << 7;
2414 for (n = 0; n < (1 << (extra_dbits[code] - 7)); n++) {
2415 dist_code[256 + dist++] = (uch) code;
2418 Assert(dist == 256, "ct_init: 256+dist != 512");
2420 /* Construct the codes of the static literal tree */
2421 for (bits = 0; bits <= MAX_BITS; bits++)
2425 static_ltree[n++].Len = 8, bl_count[8]++;
2427 static_ltree[n++].Len = 9, bl_count[9]++;
2429 static_ltree[n++].Len = 7, bl_count[7]++;
2431 static_ltree[n++].Len = 8, bl_count[8]++;
2432 /* Codes 286 and 287 do not exist, but we must include them in the
2433 * tree construction to get a canonical Huffman tree (longest code
2436 gen_codes((ct_data near *) static_ltree, L_CODES + 1);
2438 /* The static distance tree is trivial: */
2439 for (n = 0; n < D_CODES; n++) {
2440 static_dtree[n].Len = 5;
2441 static_dtree[n].Code = bi_reverse(n, 5);
2444 /* Initialize the first block of the first file: */
2448 /* ===========================================================================
2449 * Initialize a new block.
2451 local void init_block()
2453 int n; /* iterates over tree elements */
2455 /* Initialize the trees. */
2456 for (n = 0; n < L_CODES; n++)
2457 dyn_ltree[n].Freq = 0;
2458 for (n = 0; n < D_CODES; n++)
2459 dyn_dtree[n].Freq = 0;
2460 for (n = 0; n < BL_CODES; n++)
2461 bl_tree[n].Freq = 0;
2463 dyn_ltree[END_BLOCK].Freq = 1;
2464 opt_len = static_len = 0L;
2465 last_lit = last_dist = last_flags = 0;
2471 /* Index within the heap array of least frequent node in the Huffman tree */
2474 /* ===========================================================================
2475 * Remove the smallest element from the heap and recreate the heap with
2476 * one less element. Updates heap and heap_len.
2478 #define pqremove(tree, top) \
2480 top = heap[SMALLEST]; \
2481 heap[SMALLEST] = heap[heap_len--]; \
2482 pqdownheap(tree, SMALLEST); \
2485 /* ===========================================================================
2486 * Compares to subtrees, using the tree depth as tie breaker when
2487 * the subtrees have equal frequency. This minimizes the worst case length.
2489 #define smaller(tree, n, m) \
2490 (tree[n].Freq < tree[m].Freq || \
2491 (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
2493 /* ===========================================================================
2494 * Restore the heap property by moving down the tree starting at node k,
2495 * exchanging a node with the smallest of its two sons if necessary, stopping
2496 * when the heap property is re-established (each father smaller than its
2499 local void pqdownheap(tree, k)
2500 ct_data near *tree; /* the tree to restore */
2501 int k; /* node to move down */
2504 int j = k << 1; /* left son of k */
2506 while (j <= heap_len) {
2507 /* Set j to the smallest of the two sons: */
2508 if (j < heap_len && smaller(tree, heap[j + 1], heap[j]))
2511 /* Exit if v is smaller than both sons */
2512 if (smaller(tree, v, heap[j]))
2515 /* Exchange v with the smallest son */
2519 /* And continue down the tree, setting j to the left son of k */
2525 /* ===========================================================================
2526 * Compute the optimal bit lengths for a tree and update the total bit length
2527 * for the current block.
2528 * IN assertion: the fields freq and dad are set, heap[heap_max] and
2529 * above are the tree nodes sorted by increasing frequency.
2530 * OUT assertions: the field len is set to the optimal bit length, the
2531 * array bl_count contains the frequencies for each bit length.
2532 * The length opt_len is updated; static_len is also updated if stree is
2535 local void gen_bitlen(desc)
2536 tree_desc near *desc; /* the tree descriptor */
2538 ct_data near *tree = desc->dyn_tree;
2539 int near *extra = desc->extra_bits;
2540 int base = desc->extra_base;
2541 int max_code = desc->max_code;
2542 int max_length = desc->max_length;
2543 ct_data near *stree = desc->static_tree;
2544 int h; /* heap index */
2545 int n, m; /* iterate over the tree elements */
2546 int bits; /* bit length */
2547 int xbits; /* extra bits */
2548 ush f; /* frequency */
2549 int overflow = 0; /* number of elements with bit length too large */
2551 for (bits = 0; bits <= MAX_BITS; bits++)
2554 /* In a first pass, compute the optimal bit lengths (which may
2555 * overflow in the case of the bit length tree).
2557 tree[heap[heap_max]].Len = 0; /* root of the heap */
2559 for (h = heap_max + 1; h < HEAP_SIZE; h++) {
2561 bits = tree[tree[n].Dad].Len + 1;
2562 if (bits > max_length)
2563 bits = max_length, overflow++;
2564 tree[n].Len = (ush) bits;
2565 /* We overwrite tree[n].Dad which is no longer needed */
2568 continue; /* not a leaf node */
2573 xbits = extra[n - base];
2575 opt_len += (ulg) f *(bits + xbits);
2578 static_len += (ulg) f *(stree[n].Len + xbits);
2583 Trace((stderr, "\nbit length overflow\n"));
2584 /* This happens for example on obj2 and pic of the Calgary corpus */
2586 /* Find the first bit length which could increase: */
2588 bits = max_length - 1;
2589 while (bl_count[bits] == 0)
2591 bl_count[bits]--; /* move one leaf down the tree */
2592 bl_count[bits + 1] += 2; /* move one overflow item as its brother */
2593 bl_count[max_length]--;
2594 /* The brother of the overflow item also moves one step up,
2595 * but this does not affect bl_count[max_length]
2598 } while (overflow > 0);
2600 /* Now recompute all bit lengths, scanning in increasing frequency.
2601 * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all
2602 * lengths instead of fixing only the wrong ones. This idea is taken
2603 * from 'ar' written by Haruhiko Okumura.)
2605 for (bits = max_length; bits != 0; bits--) {
2611 if (tree[m].Len != (unsigned) bits) {
2613 (stderr, "code %d bits %d->%d\n", m, tree[m].Len,
2617 (long) tree[m].Len) * (long) tree[m].Freq;
2618 tree[m].Len = (ush) bits;
2625 /* ===========================================================================
2626 * Generate the codes for a given tree and bit counts (which need not be
2628 * IN assertion: the array bl_count contains the bit length statistics for
2629 * the given tree and the field len is set for all tree elements.
2630 * OUT assertion: the field code is set for all tree elements of non
2633 local void gen_codes(tree, max_code)
2634 ct_data near *tree; /* the tree to decorate */
2635 int max_code; /* largest code with non zero frequency */
2637 ush next_code[MAX_BITS + 1]; /* next code value for each bit length */
2638 ush code = 0; /* running code value */
2639 int bits; /* bit index */
2640 int n; /* code index */
2642 /* The distribution counts are first used to generate the code values
2643 * without bit reversal.
2645 for (bits = 1; bits <= MAX_BITS; bits++) {
2646 next_code[bits] = code = (code + bl_count[bits - 1]) << 1;
2648 /* Check that the bit counts in bl_count are consistent. The last code
2651 Assert(code + bl_count[MAX_BITS] - 1 == (1 << MAX_BITS) - 1,
2652 "inconsistent bit counts");
2653 Tracev((stderr, "\ngen_codes: max_code %d ", max_code));
2655 for (n = 0; n <= max_code; n++) {
2656 int len = tree[n].Len;
2660 /* Now reverse the bits */
2661 tree[n].Code = bi_reverse(next_code[len]++, len);
2663 Tracec(tree != static_ltree,
2664 (stderr, "\nn %3d %c l %2d c %4x (%x) ", n,
2665 (isgraph(n) ? n : ' '), len, tree[n].Code,
2666 next_code[len] - 1));
2670 /* ===========================================================================
2671 * Construct one Huffman tree and assigns the code bit strings and lengths.
2672 * Update the total bit length for the current block.
2673 * IN assertion: the field freq is set for all tree elements.
2674 * OUT assertions: the fields len and code are set to the optimal bit length
2675 * and corresponding code. The length opt_len is updated; static_len is
2676 * also updated if stree is not null. The field max_code is set.
2678 local void build_tree(desc)
2679 tree_desc near *desc; /* the tree descriptor */
2681 ct_data near *tree = desc->dyn_tree;
2682 ct_data near *stree = desc->static_tree;
2683 int elems = desc->elems;
2684 int n, m; /* iterate over heap elements */
2685 int max_code = -1; /* largest code with non zero frequency */
2686 int node = elems; /* next internal node of the tree */
2688 /* Construct the initial heap, with least frequent element in
2689 * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].
2690 * heap[0] is not used.
2692 heap_len = 0, heap_max = HEAP_SIZE;
2694 for (n = 0; n < elems; n++) {
2695 if (tree[n].Freq != 0) {
2696 heap[++heap_len] = max_code = n;
2703 /* The pkzip format requires that at least one distance code exists,
2704 * and that at least one bit should be sent even if there is only one
2705 * possible code. So to avoid special checks later on we force at least
2706 * two codes of non zero frequency.
2708 while (heap_len < 2) {
2709 int new = heap[++heap_len] = (max_code < 2 ? ++max_code : 0);
2715 static_len -= stree[new].Len;
2716 /* new is 0 or 1 so it does not have extra bits */
2718 desc->max_code = max_code;
2720 /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree,
2721 * establish sub-heaps of increasing lengths:
2723 for (n = heap_len / 2; n >= 1; n--)
2724 pqdownheap(tree, n);
2726 /* Construct the Huffman tree by repeatedly combining the least two
2730 pqremove(tree, n); /* n = node of least frequency */
2731 m = heap[SMALLEST]; /* m = node of next least frequency */
2733 heap[--heap_max] = n; /* keep the nodes sorted by frequency */
2734 heap[--heap_max] = m;
2736 /* Create a new node father of n and m */
2737 tree[node].Freq = tree[n].Freq + tree[m].Freq;
2738 depth[node] = (uch) (MAX(depth[n], depth[m]) + 1);
2739 tree[n].Dad = tree[m].Dad = (ush) node;
2741 if (tree == bl_tree) {
2742 fprintf(stderr, "\nnode %d(%d), sons %d(%d) %d(%d)",
2743 node, tree[node].Freq, n, tree[n].Freq, m,
2747 /* and insert the new node in the heap */
2748 heap[SMALLEST] = node++;
2749 pqdownheap(tree, SMALLEST);
2751 } while (heap_len >= 2);
2753 heap[--heap_max] = heap[SMALLEST];
2755 /* At this point, the fields freq and dad are set. We can now
2756 * generate the bit lengths.
2758 gen_bitlen((tree_desc near *) desc);
2760 /* The field len is now set, we can generate the bit codes */
2761 gen_codes((ct_data near *) tree, max_code);
2764 /* ===========================================================================
2765 * Scan a literal or distance tree to determine the frequencies of the codes
2766 * in the bit length tree. Updates opt_len to take into account the repeat
2767 * counts. (The contribution of the bit length codes will be added later
2768 * during the construction of bl_tree.)
2770 local void scan_tree(tree, max_code)
2771 ct_data near *tree; /* the tree to be scanned */
2772 int max_code; /* and its largest code of non zero frequency */
2774 int n; /* iterates over all tree elements */
2775 int prevlen = -1; /* last emitted length */
2776 int curlen; /* length of current code */
2777 int nextlen = tree[0].Len; /* length of next code */
2778 int count = 0; /* repeat count of the current code */
2779 int max_count = 7; /* max repeat count */
2780 int min_count = 4; /* min repeat count */
2783 max_count = 138, min_count = 3;
2784 tree[max_code + 1].Len = (ush) 0xffff; /* guard */
2786 for (n = 0; n <= max_code; n++) {
2788 nextlen = tree[n + 1].Len;
2789 if (++count < max_count && curlen == nextlen) {
2791 } else if (count < min_count) {
2792 bl_tree[curlen].Freq += count;
2793 } else if (curlen != 0) {
2794 if (curlen != prevlen)
2795 bl_tree[curlen].Freq++;
2796 bl_tree[REP_3_6].Freq++;
2797 } else if (count <= 10) {
2798 bl_tree[REPZ_3_10].Freq++;
2800 bl_tree[REPZ_11_138].Freq++;
2805 max_count = 138, min_count = 3;
2806 } else if (curlen == nextlen) {
2807 max_count = 6, min_count = 3;
2809 max_count = 7, min_count = 4;
2814 /* ===========================================================================
2815 * Send a literal or distance tree in compressed form, using the codes in
2818 local void send_tree(tree, max_code)
2819 ct_data near *tree; /* the tree to be scanned */
2820 int max_code; /* and its largest code of non zero frequency */
2822 int n; /* iterates over all tree elements */
2823 int prevlen = -1; /* last emitted length */
2824 int curlen; /* length of current code */
2825 int nextlen = tree[0].Len; /* length of next code */
2826 int count = 0; /* repeat count of the current code */
2827 int max_count = 7; /* max repeat count */
2828 int min_count = 4; /* min repeat count */
2830 /* tree[max_code+1].Len = -1; *//* guard already set */
2832 max_count = 138, min_count = 3;
2834 for (n = 0; n <= max_code; n++) {
2836 nextlen = tree[n + 1].Len;
2837 if (++count < max_count && curlen == nextlen) {
2839 } else if (count < min_count) {
2841 send_code(curlen, bl_tree);
2842 } while (--count != 0);
2844 } else if (curlen != 0) {
2845 if (curlen != prevlen) {
2846 send_code(curlen, bl_tree);
2849 Assert(count >= 3 && count <= 6, " 3_6?");
2850 send_code(REP_3_6, bl_tree);
2851 send_bits(count - 3, 2);
2853 } else if (count <= 10) {
2854 send_code(REPZ_3_10, bl_tree);
2855 send_bits(count - 3, 3);
2858 send_code(REPZ_11_138, bl_tree);
2859 send_bits(count - 11, 7);
2864 max_count = 138, min_count = 3;
2865 } else if (curlen == nextlen) {
2866 max_count = 6, min_count = 3;
2868 max_count = 7, min_count = 4;
2873 /* ===========================================================================
2874 * Construct the Huffman tree for the bit lengths and return the index in
2875 * bl_order of the last bit length code to send.
2877 local int build_bl_tree()
2879 int max_blindex; /* index of last bit length code of non zero freq */
2881 /* Determine the bit length frequencies for literal and distance trees */
2882 scan_tree((ct_data near *) dyn_ltree, l_desc.max_code);
2883 scan_tree((ct_data near *) dyn_dtree, d_desc.max_code);
2885 /* Build the bit length tree: */
2886 build_tree((tree_desc near *) (&bl_desc));
2887 /* opt_len now includes the length of the tree representations, except
2888 * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.
2891 /* Determine the number of bit length codes to send. The pkzip format
2892 * requires that at least 4 bit length codes be sent. (appnote.txt says
2893 * 3 but the actual value used is 4.)
2895 for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {
2896 if (bl_tree[bl_order[max_blindex]].Len != 0)
2899 /* Update opt_len to include the bit length tree and counts */
2900 opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;
2902 (stderr, "\ndyn trees: dyn %ld, stat %ld", opt_len,
2908 /* ===========================================================================
2909 * Send the header for a block using dynamic Huffman trees: the counts, the
2910 * lengths of the bit length codes, the literal tree and the distance tree.
2911 * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4.
2913 local void send_all_trees(lcodes, dcodes, blcodes)
2914 int lcodes, dcodes, blcodes; /* number of codes for each tree */
2916 int rank; /* index in bl_order */
2918 Assert(lcodes >= 257 && dcodes >= 1
2919 && blcodes >= 4, "not enough codes");
2920 Assert(lcodes <= L_CODES && dcodes <= D_CODES
2921 && blcodes <= BL_CODES, "too many codes");
2922 Tracev((stderr, "\nbl counts: "));
2923 send_bits(lcodes - 257, 5); /* not +255 as stated in appnote.txt */
2924 send_bits(dcodes - 1, 5);
2925 send_bits(blcodes - 4, 4); /* not -3 as stated in appnote.txt */
2926 for (rank = 0; rank < blcodes; rank++) {
2927 Tracev((stderr, "\nbl code %2d ", bl_order[rank]));
2928 send_bits(bl_tree[bl_order[rank]].Len, 3);
2930 Tracev((stderr, "\nbl tree: sent %ld", bits_sent));
2932 send_tree((ct_data near *) dyn_ltree, lcodes - 1); /* send the literal tree */
2933 Tracev((stderr, "\nlit tree: sent %ld", bits_sent));
2935 send_tree((ct_data near *) dyn_dtree, dcodes - 1); /* send the distance tree */
2936 Tracev((stderr, "\ndist tree: sent %ld", bits_sent));
2939 /* ===========================================================================
2940 * Determine the best encoding for the current block: dynamic trees, static
2941 * trees or store, and output the encoded block to the zip file. This function
2942 * returns the total compressed length for the file so far.
2944 ulg flush_block(buf, stored_len, eof)
2945 char *buf; /* input block, or NULL if too old */
2946 ulg stored_len; /* length of input block */
2947 int eof; /* true if this is the last block for a file */
2949 ulg opt_lenb, static_lenb; /* opt_len and static_len in bytes */
2950 int max_blindex; /* index of last bit length code of non zero freq */
2952 flag_buf[last_flags] = flags; /* Save the flags for the last 8 items */
2954 /* Check if the file is ascii or binary */
2955 if (*file_type == (ush) UNKNOWN)
2958 /* Construct the literal and distance trees */
2959 build_tree((tree_desc near *) (&l_desc));
2960 Tracev((stderr, "\nlit data: dyn %ld, stat %ld", opt_len, static_len));
2962 build_tree((tree_desc near *) (&d_desc));
2964 (stderr, "\ndist data: dyn %ld, stat %ld", opt_len,
2966 /* At this point, opt_len and static_len are the total bit lengths of
2967 * the compressed block data, excluding the tree representations.
2970 /* Build the bit length tree for the above two trees, and get the index
2971 * in bl_order of the last bit length code to send.
2973 max_blindex = build_bl_tree();
2975 /* Determine the best encoding. Compute first the block length in bytes */
2976 opt_lenb = (opt_len + 3 + 7) >> 3;
2977 static_lenb = (static_len + 3 + 7) >> 3;
2978 input_len += stored_len; /* for debugging only */
2982 "\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u dist %u ",
2983 opt_lenb, opt_len, static_lenb, static_len, stored_len,
2984 last_lit, last_dist));
2986 if (static_lenb <= opt_lenb)
2987 opt_lenb = static_lenb;
2989 /* If compression failed and this is the first and last block,
2990 * and if the zip file can be seeked (to rewrite the local header),
2991 * the whole file is transformed into a stored file:
2995 if (stored_len <= opt_lenb && eof && compressed_len == 0L
2998 /* Since LIT_BUFSIZE <= 2*WSIZE, the input data must be there: */
2999 if (buf == (char *) 0)
3000 error_msg("block vanished");
3002 copy_block(buf, (unsigned) stored_len, 0); /* without header */
3003 compressed_len = stored_len << 3;
3004 *file_method = STORED;
3008 } else if (stored_len + 4 <= opt_lenb && buf != (char *) 0) {
3009 /* 4: two words for the lengths */
3011 /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.
3012 * Otherwise we can't have processed more than WSIZE input bytes since
3013 * the last block flush, because compression would have been
3014 * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to
3015 * transform a block into a stored block.
3017 send_bits((STORED_BLOCK << 1) + eof, 3); /* send block type */
3018 compressed_len = (compressed_len + 3 + 7) & ~7L;
3019 compressed_len += (stored_len + 4) << 3;
3021 copy_block(buf, (unsigned) stored_len, 1); /* with header */
3025 } else if (static_lenb == opt_lenb) {
3027 send_bits((STATIC_TREES << 1) + eof, 3);
3028 compress_block((ct_data near *) static_ltree,
3029 (ct_data near *) static_dtree);
3030 compressed_len += 3 + static_len;
3032 send_bits((DYN_TREES << 1) + eof, 3);
3033 send_all_trees(l_desc.max_code + 1, d_desc.max_code + 1,
3035 compress_block((ct_data near *) dyn_ltree,
3036 (ct_data near *) dyn_dtree);
3037 compressed_len += 3 + opt_len;
3039 Assert(compressed_len == bits_sent, "bad compressed size");
3043 Assert(input_len == isize, "bad input size");
3045 compressed_len += 7; /* align on byte boundary */
3047 Tracev((stderr, "\ncomprlen %lu(%lu) ", compressed_len >> 3,
3048 compressed_len - 7 * eof));
3050 return compressed_len >> 3;
3053 /* ===========================================================================
3054 * Save the match info and tally the frequency counts. Return true if
3055 * the current block must be flushed.
3057 int ct_tally(dist, lc)
3058 int dist; /* distance of matched string */
3059 int lc; /* match length-MIN_MATCH or unmatched char (if dist==0) */
3061 l_buf[last_lit++] = (uch) lc;
3063 /* lc is the unmatched char */
3064 dyn_ltree[lc].Freq++;
3066 /* Here, lc is the match length - MIN_MATCH */
3067 dist--; /* dist = match distance - 1 */
3068 Assert((ush) dist < (ush) MAX_DIST &&
3069 (ush) lc <= (ush) (MAX_MATCH - MIN_MATCH) &&
3070 (ush) d_code(dist) < (ush) D_CODES, "ct_tally: bad match");
3072 dyn_ltree[length_code[lc] + LITERALS + 1].Freq++;
3073 dyn_dtree[d_code(dist)].Freq++;
3075 d_buf[last_dist++] = (ush) dist;
3080 /* Output the flags if they fill a byte: */
3081 if ((last_lit & 7) == 0) {
3082 flag_buf[last_flags++] = flags;
3083 flags = 0, flag_bit = 1;
3085 /* Try to guess if it is profitable to stop the current block here */
3086 if ((last_lit & 0xfff) == 0) {
3087 /* Compute an upper bound for the compressed length */
3088 ulg out_length = (ulg) last_lit * 8L;
3089 ulg in_length = (ulg) strstart - block_start;
3092 for (dcode = 0; dcode < D_CODES; dcode++) {
3094 (ulg) dyn_dtree[dcode].Freq * (5L + extra_dbits[dcode]);
3099 "\nlast_lit %u, last_dist %u, in %ld, out ~%ld(%ld%%) ",
3100 last_lit, last_dist, in_length, out_length,
3101 100L - out_length * 100L / in_length));
3102 if (last_dist < last_lit / 2 && out_length < in_length / 2)
3105 return (last_lit == LIT_BUFSIZE - 1 || last_dist == DIST_BUFSIZE);
3106 /* We avoid equality with LIT_BUFSIZE because of wraparound at 64K
3107 * on 16 bit machines and because stored blocks are restricted to
3112 /* ===========================================================================
3113 * Send the block data compressed using the given Huffman trees
3115 local void compress_block(ltree, dtree)
3116 ct_data near *ltree; /* literal tree */
3117 ct_data near *dtree; /* distance tree */
3119 unsigned dist; /* distance of matched string */
3120 int lc; /* match length or unmatched char (if dist == 0) */
3121 unsigned lx = 0; /* running index in l_buf */
3122 unsigned dx = 0; /* running index in d_buf */
3123 unsigned fx = 0; /* running index in flag_buf */
3124 uch flag = 0; /* current flags */
3125 unsigned code; /* the code to send */
3126 int extra; /* number of extra bits to send */
3131 flag = flag_buf[fx++];
3133 if ((flag & 1) == 0) {
3134 send_code(lc, ltree); /* send a literal byte */
3135 Tracecv(isgraph(lc), (stderr, " '%c' ", lc));
3137 /* Here, lc is the match length - MIN_MATCH */
3138 code = length_code[lc];
3139 send_code(code + LITERALS + 1, ltree); /* send the length code */
3140 extra = extra_lbits[code];
3142 lc -= base_length[code];
3143 send_bits(lc, extra); /* send the extra length bits */
3146 /* Here, dist is the match distance - 1 */
3147 code = d_code(dist);
3148 Assert(code < D_CODES, "bad d_code");
3150 send_code(code, dtree); /* send the distance code */
3151 extra = extra_dbits[code];
3153 dist -= base_dist[code];
3154 send_bits(dist, extra); /* send the extra distance bits */
3156 } /* literal or match pair ? */
3158 } while (lx < last_lit);
3160 send_code(END_BLOCK, ltree);
3163 /* ===========================================================================
3164 * Set the file type to ASCII or BINARY, using a crude approximation:
3165 * binary if more than 20% of the bytes are <= 6 or >= 128, ascii otherwise.
3166 * IN assertion: the fields freq of dyn_ltree are set and the total of all
3167 * frequencies does not exceed 64K (to fit in an int on 16 bit machines).
3169 local void set_file_type()
3172 unsigned ascii_freq = 0;
3173 unsigned bin_freq = 0;
3176 bin_freq += dyn_ltree[n++].Freq;
3178 ascii_freq += dyn_ltree[n++].Freq;
3179 while (n < LITERALS)
3180 bin_freq += dyn_ltree[n++].Freq;
3181 *file_type = bin_freq > (ascii_freq >> 2) ? BINARY : ASCII;
3182 if (*file_type == BINARY && translate_eol) {
3183 error_msg("-l used on binary file");
3187 /* util.c -- utility functions for gzip support
3188 * Copyright (C) 1992-1993 Jean-loup Gailly
3189 * This is free software; you can redistribute it and/or modify it under the
3190 * terms of the GNU General Public License, see the file COPYING.
3195 #include <sys/types.h>
3197 #ifdef HAVE_UNISTD_H
3198 # include <unistd.h>
3204 /* ===========================================================================
3205 * Copy input to output unchanged: zcat == cat with --force.
3206 * IN assertion: insize bytes have already been read in inbuf.
3209 int in, out; /* input and output file descriptors */
3212 while (insize != 0 && (int) insize != EOF) {
3213 write_buf(out, (char *) inbuf, insize);
3214 bytes_out += insize;
3215 insize = read(in, (char *) inbuf, INBUFSIZ);
3217 if ((int) insize == EOF && errno != 0) {
3220 bytes_in = bytes_out;
3224 /* ========================================================================
3225 * Put string s in lower case, return s.
3232 for (t = s; *t; t++)
3237 #if defined(NO_STRING_H) && !defined(STDC_HEADERS)
3239 /* Provide missing strspn and strcspn functions. */
3241 int strspn (const char *s, const char *accept);
3242 int strcspn (const char *s, const char *reject);
3244 /* ========================================================================
3245 * Return the length of the maximum initial segment
3246 * of s which contains only characters in accept.
3248 int strspn(s, accept)
3252 register const char *p;
3253 register const char *a;
3254 register int count = 0;
3256 for (p = s; *p != '\0'; ++p) {
3257 for (a = accept; *a != '\0'; ++a) {
3268 /* ========================================================================
3269 * Return the length of the maximum inital segment of s
3270 * which contains no characters from reject.
3272 int strcspn(s, reject)
3276 register int count = 0;
3278 while (*s != '\0') {
3279 if (strchr(reject, *s++) != NULL)
3286 #endif /* NO_STRING_H */
3288 /* ========================================================================
3289 * Add an environment variable (if any) before argv, and update argc.
3290 * Return the expanded environment variable to be freed later, or NULL
3291 * if no options were added to argv.
3293 #define SEPARATOR " \t" /* separators in env variable */
3295 char *add_envopt(argcp, argvp, env)
3296 int *argcp; /* pointer to argc */
3297 char ***argvp; /* pointer to argv */
3298 char *env; /* name of environment variable */
3300 char *p; /* running pointer through env variable */
3301 char **oargv; /* runs through old argv array */
3302 char **nargv; /* runs through new argv array */
3303 int oargc = *argcp; /* old argc */
3304 int nargc = 0; /* number of arguments in env variable */
3306 env = (char *) getenv(env);
3310 p = (char *) xmalloc(strlen(env) + 1);
3311 env = strcpy(p, env); /* keep env variable intact */
3313 for (p = env; *p; nargc++) { /* move through env */
3314 p += strspn(p, SEPARATOR); /* skip leading separators */
3318 p += strcspn(p, SEPARATOR); /* find end of word */
3320 *p++ = '\0'; /* mark it */
3327 /* Allocate the new argv array, with an extra element just in case
3328 * the original arg list did not end with a NULL.
3330 nargv = (char **) calloc(*argcp + 1, sizeof(char *));
3333 error_msg(memory_exhausted);
3337 /* Copy the program name first */
3339 error_msg("argc<=0");
3340 *(nargv++) = *(oargv++);
3342 /* Then copy the environment args */
3343 for (p = env; nargc > 0; nargc--) {
3344 p += strspn(p, SEPARATOR); /* skip separators */
3345 *(nargv++) = p; /* store start */
3346 while (*p++); /* skip over word */
3349 /* Finally copy the old args and add a NULL (usual convention) */
3351 *(nargv++) = *(oargv++);
3356 /* ========================================================================
3357 * Display compression ratio on the given stream on 6 characters.
3359 void display_ratio(num, den, file)
3364 long ratio; /* 1000 times the compression ratio */
3367 ratio = 0; /* no compression */
3368 } else if (den < 2147483L) { /* (2**31 -1)/1000 */
3369 ratio = 1000L * num / den;
3371 ratio = num / (den / 1000L);
3379 fprintf(file, "%2ld.%1ld%%", ratio / 10L, ratio % 10L);
3383 /* zip.c -- compress files to the gzip or pkzip format
3384 * Copyright (C) 1992-1993 Jean-loup Gailly
3385 * This is free software; you can redistribute it and/or modify it under the
3386 * terms of the GNU General Public License, see the file COPYING.
3390 #include <sys/types.h>
3392 #ifdef HAVE_UNISTD_H
3393 # include <unistd.h>
3399 local ulg crc; /* crc on uncompressed file data */
3400 long header_bytes; /* number of bytes in gzip header */
3402 /* ===========================================================================
3403 * Deflate in to out.
3404 * IN assertions: the input and output buffers are cleared.
3405 * The variables time_stamp and save_orig_name are initialized.
3408 int in, out; /* input and output file descriptors */
3410 uch my_flags = 0; /* general purpose bit flags */
3411 ush attr = 0; /* ascii/binary flag */
3412 ush deflate_flags = 0; /* pkzip -es, -en or -ex equivalent */
3418 /* Write the header to the gzip file. See algorithm.doc for the format */
3422 put_byte(GZIP_MAGIC[0]); /* magic header */
3423 put_byte(GZIP_MAGIC[1]);
3424 put_byte(DEFLATED); /* compression method */
3426 put_byte(my_flags); /* general flags */
3427 put_long(time_stamp);
3429 /* Write deflated file to zip file */
3433 ct_init(&attr, &method);
3434 lm_init(&deflate_flags);
3436 put_byte((uch) deflate_flags); /* extra flags */
3437 put_byte(OS_CODE); /* OS identifier */
3439 header_bytes = (long) outcnt;
3443 /* Write the crc and uncompressed size */
3446 header_bytes += 2 * sizeof(long);
3453 /* ===========================================================================
3454 * Read a new buffer from the current input file, perform end-of-line
3455 * translation, and update the crc and input file size.
3456 * IN assertion: size >= 2 (for end-of-line translation)
3458 int file_read(buf, size)
3464 Assert(insize == 0, "inbuf not empty");
3466 len = read(ifd, buf, size);
3467 if (len == (unsigned) (-1) || len == 0)
3470 crc = updcrc((uch *) buf, len);
3475 /* ===========================================================================
3476 * Write the output buffer outbuf[0..outcnt-1] and update bytes_out.
3477 * (used for the compressed data only)
3484 write_buf(ofd, (char *) outbuf, outcnt);
3485 bytes_out += (ulg) outcnt;
projects / oweals / busybox.git / blob