blob: c4c59272903bc3eb27ac1d6dff47f844a228103e [file] [log] [blame]
Erik Andersene49d5ec2000-02-08 19:58:47 +00001/* vi: set sw=4 ts=4: */
Erik Andersen61677fe2000-04-13 01:18:56 +00002/*
3 * Gzip implementation for busybox
Eric Andersencc8ed391999-10-05 16:24:54 +00004 *
Erik Andersen61677fe2000-04-13 01:18:56 +00005 * Based on GNU gzip Copyright (C) 1992-1993 Jean-loup Gailly.
6 *
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."
11 *
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.
15 *
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.
20 *
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.
25 *
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
29 *
Eric Andersencc8ed391999-10-05 16:24:54 +000030 */
Eric Andersencc8ed391999-10-05 16:24:54 +000031
Erik Andersen61677fe2000-04-13 01:18:56 +000032/* 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.*/
35#define SMALL_MEM
36#define DYN_ALLOC
37
Eric Andersencc8ed391999-10-05 16:24:54 +000038/* I don't like nested includes, but the string and io functions are used
39 * too often
40 */
Eric Andersencbe31da2001-02-20 06:14:08 +000041#include <stdlib.h>
Eric Andersencc8ed391999-10-05 16:24:54 +000042#include <stdio.h>
Erik Andersen61677fe2000-04-13 01:18:56 +000043#include <string.h>
Eric Andersened3ef502001-01-27 08:24:39 +000044#include <unistd.h>
Glenn L McGrathf58efb52001-03-28 05:35:16 +000045#include <errno.h>
Eric Andersencbe31da2001-02-20 06:14:08 +000046#include "busybox.h"
Eric Andersencbe31da2001-02-20 06:14:08 +000047
Erik Andersen61677fe2000-04-13 01:18:56 +000048#define memzero(s, n) memset ((void *)(s), 0, (n))
Eric Andersencc8ed391999-10-05 16:24:54 +000049
50#ifndef RETSIGTYPE
51# define RETSIGTYPE void
52#endif
53
54#define local static
55
Erik Andersene49d5ec2000-02-08 19:58:47 +000056typedef unsigned char uch;
Eric Andersencc8ed391999-10-05 16:24:54 +000057typedef unsigned short ush;
Erik Andersene49d5ec2000-02-08 19:58:47 +000058typedef unsigned long ulg;
Eric Andersencc8ed391999-10-05 16:24:54 +000059
60/* Return codes from gzip */
61#define OK 0
62#define ERROR 1
63#define WARNING 2
64
65/* Compression methods (see algorithm.doc) */
66#define STORED 0
67#define COMPRESSED 1
68#define PACKED 2
69#define LZHED 3
70/* methods 4 to 7 reserved */
71#define DEFLATED 8
72#define MAX_METHODS 9
Glenn L McGrathf58efb52001-03-28 05:35:16 +000073static int method; /* compression method */
Eric Andersencc8ed391999-10-05 16:24:54 +000074
75/* To save memory for 16 bit systems, some arrays are overlaid between
76 * the various modules:
77 * deflate: prev+head window d_buf l_buf outbuf
78 * unlzw: tab_prefix tab_suffix stack inbuf outbuf
79 * inflate: window inbuf
80 * unpack: window inbuf prefix_len
81 * unlzh: left+right window c_table inbuf c_len
82 * For compression, input is done in window[]. For decompression, output
83 * is done in window except for unlzw.
84 */
85
86#ifndef INBUFSIZ
87# ifdef SMALL_MEM
Erik Andersene49d5ec2000-02-08 19:58:47 +000088# define INBUFSIZ 0x2000 /* input buffer size */
Eric Andersencc8ed391999-10-05 16:24:54 +000089# else
Erik Andersene49d5ec2000-02-08 19:58:47 +000090# define INBUFSIZ 0x8000 /* input buffer size */
Eric Andersencc8ed391999-10-05 16:24:54 +000091# endif
92#endif
Erik Andersene49d5ec2000-02-08 19:58:47 +000093#define INBUF_EXTRA 64 /* required by unlzw() */
Eric Andersencc8ed391999-10-05 16:24:54 +000094
95#ifndef OUTBUFSIZ
96# ifdef SMALL_MEM
Erik Andersene49d5ec2000-02-08 19:58:47 +000097# define OUTBUFSIZ 8192 /* output buffer size */
Eric Andersencc8ed391999-10-05 16:24:54 +000098# else
Erik Andersene49d5ec2000-02-08 19:58:47 +000099# define OUTBUFSIZ 16384 /* output buffer size */
Eric Andersencc8ed391999-10-05 16:24:54 +0000100# endif
101#endif
Erik Andersene49d5ec2000-02-08 19:58:47 +0000102#define OUTBUF_EXTRA 2048 /* required by unlzw() */
Eric Andersencc8ed391999-10-05 16:24:54 +0000103
104#ifndef DIST_BUFSIZE
105# ifdef SMALL_MEM
Erik Andersene49d5ec2000-02-08 19:58:47 +0000106# define DIST_BUFSIZE 0x2000 /* buffer for distances, see trees.c */
Eric Andersencc8ed391999-10-05 16:24:54 +0000107# else
Erik Andersene49d5ec2000-02-08 19:58:47 +0000108# define DIST_BUFSIZE 0x8000 /* buffer for distances, see trees.c */
Eric Andersencc8ed391999-10-05 16:24:54 +0000109# endif
110#endif
111
112#ifdef DYN_ALLOC
Erik Andersen61677fe2000-04-13 01:18:56 +0000113# define EXTERN(type, array) extern type * array
114# define DECLARE(type, array, size) type * array
Eric Andersencc8ed391999-10-05 16:24:54 +0000115# define ALLOC(type, array, size) { \
Erik Andersen61677fe2000-04-13 01:18:56 +0000116 array = (type*)calloc((size_t)(((size)+1L)/2), 2*sizeof(type)); \
Mark Whitleyf57c9442000-12-07 19:56:48 +0000117 if (array == NULL) error_msg(memory_exhausted); \
Eric Andersencc8ed391999-10-05 16:24:54 +0000118 }
Erik Andersen61677fe2000-04-13 01:18:56 +0000119# define FREE(array) {if (array != NULL) free(array), array=NULL;}
Eric Andersencc8ed391999-10-05 16:24:54 +0000120#else
121# define EXTERN(type, array) extern type array[]
122# define DECLARE(type, array, size) type array[size]
123# define ALLOC(type, array, size)
124# define FREE(array)
125#endif
126
Erik Andersene49d5ec2000-02-08 19:58:47 +0000127EXTERN(uch, inbuf); /* input buffer */
128EXTERN(uch, outbuf); /* output buffer */
129EXTERN(ush, d_buf); /* buffer for distances, see trees.c */
130EXTERN(uch, window); /* Sliding window and suffix table (unlzw) */
Eric Andersencc8ed391999-10-05 16:24:54 +0000131#define tab_suffix window
132#ifndef MAXSEG_64K
Erik Andersene49d5ec2000-02-08 19:58:47 +0000133# define tab_prefix prev /* hash link (see deflate.c) */
134# define head (prev+WSIZE) /* hash head (see deflate.c) */
135EXTERN(ush, tab_prefix); /* prefix code (see unlzw.c) */
Eric Andersencc8ed391999-10-05 16:24:54 +0000136#else
137# define tab_prefix0 prev
138# define head tab_prefix1
Erik Andersene49d5ec2000-02-08 19:58:47 +0000139EXTERN(ush, tab_prefix0); /* prefix for even codes */
140EXTERN(ush, tab_prefix1); /* prefix for odd codes */
Eric Andersencc8ed391999-10-05 16:24:54 +0000141#endif
142
Erik Andersene49d5ec2000-02-08 19:58:47 +0000143extern unsigned insize; /* valid bytes in inbuf */
Glenn L McGrathf58efb52001-03-28 05:35:16 +0000144static unsigned inptr; /* index of next byte to be processed in inbuf */
Erik Andersene49d5ec2000-02-08 19:58:47 +0000145extern unsigned outcnt; /* bytes in output buffer */
Eric Andersencc8ed391999-10-05 16:24:54 +0000146
Erik Andersene49d5ec2000-02-08 19:58:47 +0000147extern long bytes_in; /* number of input bytes */
148extern long bytes_out; /* number of output bytes */
149extern long header_bytes; /* number of bytes in gzip header */
Eric Andersencc8ed391999-10-05 16:24:54 +0000150
151#define isize bytes_in
152/* for compatibility with old zip sources (to be cleaned) */
153
Erik Andersene49d5ec2000-02-08 19:58:47 +0000154extern int ifd; /* input file descriptor */
155extern int ofd; /* output file descriptor */
156extern char ifname[]; /* input file name or "stdin" */
157extern char ofname[]; /* output file name or "stdout" */
158extern char *progname; /* program name */
Eric Andersencc8ed391999-10-05 16:24:54 +0000159
Erik Andersene49d5ec2000-02-08 19:58:47 +0000160extern long time_stamp; /* original time stamp (modification time) */
161extern long ifile_size; /* input file size, -1 for devices (debug only) */
Eric Andersencc8ed391999-10-05 16:24:54 +0000162
Erik Andersene49d5ec2000-02-08 19:58:47 +0000163typedef int file_t; /* Do not use stdio */
164
165#define NO_FILE (-1) /* in memory compression */
Eric Andersencc8ed391999-10-05 16:24:54 +0000166
167
Erik Andersene49d5ec2000-02-08 19:58:47 +0000168#define PACK_MAGIC "\037\036" /* Magic header for packed files */
169#define GZIP_MAGIC "\037\213" /* Magic header for gzip files, 1F 8B */
170#define OLD_GZIP_MAGIC "\037\236" /* Magic header for gzip 0.5 = freeze 1.x */
171#define LZH_MAGIC "\037\240" /* Magic header for SCO LZH Compress files */
172#define PKZIP_MAGIC "\120\113\003\004" /* Magic header for pkzip files */
Eric Andersencc8ed391999-10-05 16:24:54 +0000173
174/* gzip flag byte */
Erik Andersene49d5ec2000-02-08 19:58:47 +0000175#define ASCII_FLAG 0x01 /* bit 0 set: file probably ascii text */
176#define CONTINUATION 0x02 /* bit 1 set: continuation of multi-part gzip file */
177#define EXTRA_FIELD 0x04 /* bit 2 set: extra field present */
178#define ORIG_NAME 0x08 /* bit 3 set: original file name present */
179#define COMMENT 0x10 /* bit 4 set: file comment present */
180#define ENCRYPTED 0x20 /* bit 5 set: file is encrypted */
181#define RESERVED 0xC0 /* bit 6,7: reserved */
Eric Andersencc8ed391999-10-05 16:24:54 +0000182
183/* internal file attribute */
184#define UNKNOWN 0xffff
185#define BINARY 0
186#define ASCII 1
187
188#ifndef WSIZE
Erik Andersene49d5ec2000-02-08 19:58:47 +0000189# define WSIZE 0x8000 /* window size--must be a power of two, and */
190#endif /* at least 32K for zip's deflate method */
Eric Andersencc8ed391999-10-05 16:24:54 +0000191
192#define MIN_MATCH 3
193#define MAX_MATCH 258
194/* The minimum and maximum match lengths */
195
196#define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
197/* Minimum amount of lookahead, except at the end of the input file.
198 * See deflate.c for comments about the MIN_MATCH+1.
199 */
200
201#define MAX_DIST (WSIZE-MIN_LOOKAHEAD)
202/* In order to simplify the code, particularly on 16 bit machines, match
203 * distances are limited to MAX_DIST instead of WSIZE.
204 */
205
Erik Andersene49d5ec2000-02-08 19:58:47 +0000206extern int decrypt; /* flag to turn on decryption */
207extern int exit_code; /* program exit code */
208extern int verbose; /* be verbose (-v) */
209extern int quiet; /* be quiet (-q) */
210extern int test; /* check .z file integrity */
211extern int save_orig_name; /* set if original name must be saved */
Eric Andersencc8ed391999-10-05 16:24:54 +0000212
213#define get_byte() (inptr < insize ? inbuf[inptr++] : fill_inbuf(0))
214#define try_byte() (inptr < insize ? inbuf[inptr++] : fill_inbuf(1))
215
216/* put_byte is used for the compressed output, put_ubyte for the
217 * uncompressed output. However unlzw() uses window for its
218 * suffix table instead of its output buffer, so it does not use put_ubyte
219 * (to be cleaned up).
220 */
221#define put_byte(c) {outbuf[outcnt++]=(uch)(c); if (outcnt==OUTBUFSIZ)\
222 flush_outbuf();}
223#define put_ubyte(c) {window[outcnt++]=(uch)(c); if (outcnt==WSIZE)\
224 flush_window();}
225
226/* Output a 16 bit value, lsb first */
227#define put_short(w) \
228{ if (outcnt < OUTBUFSIZ-2) { \
229 outbuf[outcnt++] = (uch) ((w) & 0xff); \
230 outbuf[outcnt++] = (uch) ((ush)(w) >> 8); \
231 } else { \
232 put_byte((uch)((w) & 0xff)); \
233 put_byte((uch)((ush)(w) >> 8)); \
234 } \
235}
236
237/* Output a 32 bit value to the bit stream, lsb first */
238#define put_long(n) { \
239 put_short((n) & 0xffff); \
240 put_short(((ulg)(n)) >> 16); \
241}
242
Erik Andersene49d5ec2000-02-08 19:58:47 +0000243#define seekable() 0 /* force sequential output */
244#define translate_eol 0 /* no option -a yet */
Eric Andersencc8ed391999-10-05 16:24:54 +0000245
Erik Andersene49d5ec2000-02-08 19:58:47 +0000246#define tolow(c) (isupper(c) ? (c)-'A'+'a' : (c)) /* force to lower case */
Eric Andersencc8ed391999-10-05 16:24:54 +0000247
248/* Macros for getting two-byte and four-byte header values */
249#define SH(p) ((ush)(uch)((p)[0]) | ((ush)(uch)((p)[1]) << 8))
250#define LG(p) ((ulg)(SH(p)) | ((ulg)(SH((p)+2)) << 16))
251
252/* Diagnostic functions */
253#ifdef DEBUG
Mark Whitleyf57c9442000-12-07 19:56:48 +0000254# define Assert(cond,msg) {if(!(cond)) error_msg(msg);}
Eric Andersencc8ed391999-10-05 16:24:54 +0000255# define Trace(x) fprintf x
256# define Tracev(x) {if (verbose) fprintf x ;}
257# define Tracevv(x) {if (verbose>1) fprintf x ;}
258# define Tracec(c,x) {if (verbose && (c)) fprintf x ;}
259# define Tracecv(c,x) {if (verbose>1 && (c)) fprintf x ;}
260#else
261# define Assert(cond,msg)
262# define Trace(x)
263# define Tracev(x)
264# define Tracevv(x)
265# define Tracec(c,x)
266# define Tracecv(c,x)
267#endif
268
269#define WARN(msg) {if (!quiet) fprintf msg ; \
270 if (exit_code == OK) exit_code = WARNING;}
271
Eric Andersencc8ed391999-10-05 16:24:54 +0000272
273 /* in zip.c: */
Erik Andersen61677fe2000-04-13 01:18:56 +0000274extern int zip (int in, int out);
275extern int file_read (char *buf, unsigned size);
Eric Andersencc8ed391999-10-05 16:24:54 +0000276
277 /* in unzip.c */
Erik Andersen61677fe2000-04-13 01:18:56 +0000278extern int check_zipfile (int in);
Eric Andersencc8ed391999-10-05 16:24:54 +0000279
280 /* in unpack.c */
Erik Andersen61677fe2000-04-13 01:18:56 +0000281extern int unpack (int in, int out);
Eric Andersencc8ed391999-10-05 16:24:54 +0000282
283 /* in unlzh.c */
Erik Andersen61677fe2000-04-13 01:18:56 +0000284extern int unlzh (int in, int out);
Eric Andersencc8ed391999-10-05 16:24:54 +0000285
286 /* in gzip.c */
Erik Andersen61677fe2000-04-13 01:18:56 +0000287RETSIGTYPE abort_gzip (void);
Eric Andersencc8ed391999-10-05 16:24:54 +0000288
Erik Andersene49d5ec2000-02-08 19:58:47 +0000289 /* in deflate.c */
Erik Andersen61677fe2000-04-13 01:18:56 +0000290void lm_init (ush * flags);
291ulg deflate (void);
Eric Andersencc8ed391999-10-05 16:24:54 +0000292
Erik Andersene49d5ec2000-02-08 19:58:47 +0000293 /* in trees.c */
Eric Andersen851895a2001-03-21 21:52:25 +0000294void ct_init (ush * attr, int *methodp);
Erik Andersen61677fe2000-04-13 01:18:56 +0000295int ct_tally (int dist, int lc);
296ulg flush_block (char *buf, ulg stored_len, int eof);
Eric Andersencc8ed391999-10-05 16:24:54 +0000297
Erik Andersene49d5ec2000-02-08 19:58:47 +0000298 /* in bits.c */
Erik Andersen61677fe2000-04-13 01:18:56 +0000299void bi_init (file_t zipfile);
300void send_bits (int value, int length);
301unsigned bi_reverse (unsigned value, int length);
302void bi_windup (void);
303void copy_block (char *buf, unsigned len, int header);
304extern int (*read_buf) (char *buf, unsigned size);
Eric Andersencc8ed391999-10-05 16:24:54 +0000305
306 /* in util.c: */
Erik Andersen61677fe2000-04-13 01:18:56 +0000307extern int copy (int in, int out);
Glenn L McGrathf58efb52001-03-28 05:35:16 +0000308//extern ulg updcrc (uch * s, unsigned n);
309//extern void clear_bufs (void);
Erik Andersen61677fe2000-04-13 01:18:56 +0000310extern int fill_inbuf (int eof_ok);
311extern void flush_outbuf (void);
312extern void flush_window (void);
Glenn L McGrathf58efb52001-03-28 05:35:16 +0000313//extern void write_buf (int fd, void * buf, unsigned cnt);
Erik Andersen61677fe2000-04-13 01:18:56 +0000314extern char *strlwr (char *s);
315extern char *add_envopt (int *argcp, char ***argvp, char *env);
Glenn L McGrathf58efb52001-03-28 05:35:16 +0000316//extern void read_error_msg (void);
317//extern void write_error_msg (void);
Erik Andersen61677fe2000-04-13 01:18:56 +0000318extern void display_ratio (long num, long den, FILE * file);
Eric Andersencc8ed391999-10-05 16:24:54 +0000319
320 /* in inflate.c */
Erik Andersen61677fe2000-04-13 01:18:56 +0000321extern int inflate (void);
Erik Andersene49d5ec2000-02-08 19:58:47 +0000322
Eric Andersencc8ed391999-10-05 16:24:54 +0000323/* lzw.h -- define the lzw functions.
324 * Copyright (C) 1992-1993 Jean-loup Gailly.
325 * This is free software; you can redistribute it and/or modify it under the
326 * terms of the GNU General Public License, see the file COPYING.
327 */
328
329#if !defined(OF) && defined(lint)
330# include "gzip.h"
331#endif
332
333#ifndef BITS
334# define BITS 16
335#endif
Erik Andersene49d5ec2000-02-08 19:58:47 +0000336#define INIT_BITS 9 /* Initial number of bits per code */
Eric Andersencc8ed391999-10-05 16:24:54 +0000337
Erik Andersene49d5ec2000-02-08 19:58:47 +0000338#define BIT_MASK 0x1f /* Mask for 'number of compression bits' */
Eric Andersencc8ed391999-10-05 16:24:54 +0000339/* Mask 0x20 is reserved to mean a fourth header byte, and 0x40 is free.
340 * It's a pity that old uncompress does not check bit 0x20. That makes
341 * extension of the format actually undesirable because old compress
342 * would just crash on the new format instead of giving a meaningful
343 * error message. It does check the number of bits, but it's more
344 * helpful to say "unsupported format, get a new version" than
345 * "can only handle 16 bits".
346 */
347
348#define BLOCK_MODE 0x80
349/* Block compression: if table is full and compression rate is dropping,
350 * clear the dictionary.
351 */
352
Erik Andersene49d5ec2000-02-08 19:58:47 +0000353#define LZW_RESERVED 0x60 /* reserved bits */
Eric Andersencc8ed391999-10-05 16:24:54 +0000354
Erik Andersene49d5ec2000-02-08 19:58:47 +0000355#define CLEAR 256 /* flush the dictionary */
356#define FIRST (CLEAR+1) /* first free entry */
Eric Andersencc8ed391999-10-05 16:24:54 +0000357
Erik Andersene49d5ec2000-02-08 19:58:47 +0000358extern int maxbits; /* max bits per code for LZW */
359extern int block_mode; /* block compress mode -C compatible with 2.0 */
Eric Andersencc8ed391999-10-05 16:24:54 +0000360
361/* revision.h -- define the version number
362 * Copyright (C) 1992-1993 Jean-loup Gailly.
363 * This is free software; you can redistribute it and/or modify it under the
364 * terms of the GNU General Public License, see the file COPYING.
365 */
366
367#define VERSION "1.2.4"
368#define PATCHLEVEL 0
369#define REVDATE "18 Aug 93"
370
371/* This version does not support compression into old compress format: */
372#ifdef LZW
373# undef LZW
374#endif
375
Eric Andersencc8ed391999-10-05 16:24:54 +0000376/* tailor.h -- target dependent definitions
377 * Copyright (C) 1992-1993 Jean-loup Gailly.
378 * This is free software; you can redistribute it and/or modify it under the
379 * terms of the GNU General Public License, see the file COPYING.
380 */
381
382/* The target dependent definitions should be defined here only.
383 * The target dependent functions should be defined in tailor.c.
384 */
385
Eric Andersencc8ed391999-10-05 16:24:54 +0000386
387#if defined(__MSDOS__) && !defined(MSDOS)
388# define MSDOS
389#endif
390
391#if defined(__OS2__) && !defined(OS2)
392# define OS2
393#endif
394
Erik Andersene49d5ec2000-02-08 19:58:47 +0000395#if defined(OS2) && defined(MSDOS) /* MS C under OS/2 */
Eric Andersencc8ed391999-10-05 16:24:54 +0000396# undef MSDOS
397#endif
398
399#ifdef MSDOS
400# ifdef __GNUC__
Erik Andersene49d5ec2000-02-08 19:58:47 +0000401 /* DJGPP version 1.09+ on MS-DOS.
402 * The DJGPP 1.09 stat() function must be upgraded before gzip will
403 * fully work.
404 * No need for DIRENT, since <unistd.h> defines POSIX_SOURCE which
405 * implies DIRENT.
406 */
Eric Andersencc8ed391999-10-05 16:24:54 +0000407# define near
408# else
409# define MAXSEG_64K
410# ifdef __TURBOC__
411# define NO_OFF_T
412# ifdef __BORLANDC__
413# define DIRENT
414# else
415# define NO_UTIME
416# endif
Erik Andersene49d5ec2000-02-08 19:58:47 +0000417# else /* MSC */
Eric Andersencc8ed391999-10-05 16:24:54 +0000418# define HAVE_SYS_UTIME_H
419# define NO_UTIME_H
420# endif
421# endif
422# define PATH_SEP2 '\\'
423# define PATH_SEP3 ':'
424# define MAX_PATH_LEN 128
425# define NO_MULTIPLE_DOTS
426# define MAX_EXT_CHARS 3
427# define Z_SUFFIX "z"
428# define NO_CHOWN
429# define PROTO
430# define STDC_HEADERS
431# define NO_SIZE_CHECK
Erik Andersene49d5ec2000-02-08 19:58:47 +0000432# define casemap(c) tolow(c) /* Force file names to lower case */
Eric Andersencc8ed391999-10-05 16:24:54 +0000433# include <io.h>
434# define OS_CODE 0x00
435# define SET_BINARY_MODE(fd) setmode(fd, O_BINARY)
436# if !defined(NO_ASM) && !defined(ASMV)
437# define ASMV
438# endif
439#else
440# define near
441#endif
442
443#ifdef OS2
444# define PATH_SEP2 '\\'
445# define PATH_SEP3 ':'
446# define MAX_PATH_LEN 260
447# ifdef OS2FAT
448# define NO_MULTIPLE_DOTS
449# define MAX_EXT_CHARS 3
450# define Z_SUFFIX "z"
451# define casemap(c) tolow(c)
452# endif
453# define NO_CHOWN
454# define PROTO
455# define STDC_HEADERS
456# include <io.h>
457# define OS_CODE 0x06
458# define SET_BINARY_MODE(fd) setmode(fd, O_BINARY)
459# ifdef _MSC_VER
460# define HAVE_SYS_UTIME_H
461# define NO_UTIME_H
462# define MAXSEG_64K
463# undef near
464# define near _near
465# endif
466# ifdef __EMX__
467# define HAVE_SYS_UTIME_H
468# define NO_UTIME_H
469# define DIRENT
470# define EXPAND(argc,argv) \
471 {_response(&argc, &argv); _wildcard(&argc, &argv);}
472# endif
473# ifdef __BORLANDC__
474# define DIRENT
475# endif
476# ifdef __ZTC__
477# define NO_DIR
478# define NO_UTIME_H
479# include <dos.h>
480# define EXPAND(argc,argv) \
481 {response_expand(&argc, &argv);}
482# endif
483#endif
484
Erik Andersene49d5ec2000-02-08 19:58:47 +0000485#ifdef WIN32 /* Windows NT */
Eric Andersencc8ed391999-10-05 16:24:54 +0000486# define HAVE_SYS_UTIME_H
487# define NO_UTIME_H
488# define PATH_SEP2 '\\'
489# define PATH_SEP3 ':'
490# define MAX_PATH_LEN 260
491# define NO_CHOWN
492# define PROTO
493# define STDC_HEADERS
494# define SET_BINARY_MODE(fd) setmode(fd, O_BINARY)
495# include <io.h>
496# include <malloc.h>
497# ifdef NTFAT
498# define NO_MULTIPLE_DOTS
499# define MAX_EXT_CHARS 3
500# define Z_SUFFIX "z"
Erik Andersene49d5ec2000-02-08 19:58:47 +0000501# define casemap(c) tolow(c) /* Force file names to lower case */
Eric Andersencc8ed391999-10-05 16:24:54 +0000502# endif
503# define OS_CODE 0x0b
504#endif
505
506#ifdef MSDOS
507# ifdef __TURBOC__
508# include <alloc.h>
509# define DYN_ALLOC
Erik Andersene49d5ec2000-02-08 19:58:47 +0000510 /* Turbo C 2.0 does not accept static allocations of large arrays */
511void *fcalloc(unsigned items, unsigned size);
512void fcfree(void *ptr);
513# else /* MSC */
Eric Andersencc8ed391999-10-05 16:24:54 +0000514# include <malloc.h>
515# define fcalloc(nitems,itemsize) halloc((long)(nitems),(itemsize))
516# define fcfree(ptr) hfree(ptr)
517# endif
518#else
519# ifdef MAXSEG_64K
520# define fcalloc(items,size) calloc((items),(size))
521# else
522# define fcalloc(items,size) malloc((size_t)(items)*(size_t)(size))
523# endif
524# define fcfree(ptr) free(ptr)
525#endif
526
527#if defined(VAXC) || defined(VMS)
528# define PATH_SEP ']'
529# define PATH_SEP2 ':'
530# define SUFFIX_SEP ';'
531# define NO_MULTIPLE_DOTS
532# define Z_SUFFIX "-gz"
533# define RECORD_IO 1
534# define casemap(c) tolow(c)
535# define OS_CODE 0x02
536# define OPTIONS_VAR "GZIP_OPT"
537# define STDC_HEADERS
538# define NO_UTIME
539# define EXPAND(argc,argv) vms_expand_args(&argc,&argv);
540# include <file.h>
541# define unlink delete
542# ifdef VAXC
543# define NO_FCNTL_H
544# include <unixio.h>
545# endif
546#endif
547
548#ifdef AMIGA
549# define PATH_SEP2 ':'
550# define STDC_HEADERS
551# define OS_CODE 0x01
552# define ASMV
553# ifdef __GNUC__
554# define DIRENT
555# define HAVE_UNISTD_H
Erik Andersene49d5ec2000-02-08 19:58:47 +0000556# else /* SASC */
Eric Andersencc8ed391999-10-05 16:24:54 +0000557# define NO_STDIN_FSTAT
558# define SYSDIR
559# define NO_SYMLINK
560# define NO_CHOWN
561# define NO_FCNTL_H
Erik Andersene49d5ec2000-02-08 19:58:47 +0000562# include <fcntl.h> /* for read() and write() */
Eric Andersencc8ed391999-10-05 16:24:54 +0000563# define direct dirent
Erik Andersene49d5ec2000-02-08 19:58:47 +0000564extern void _expand_args(int *argc, char ***argv);
565
Eric Andersencc8ed391999-10-05 16:24:54 +0000566# define EXPAND(argc,argv) _expand_args(&argc,&argv);
Erik Andersene49d5ec2000-02-08 19:58:47 +0000567# undef O_BINARY /* disable useless --ascii option */
Eric Andersencc8ed391999-10-05 16:24:54 +0000568# endif
569#endif
570
571#if defined(ATARI) || defined(atarist)
572# ifndef STDC_HEADERS
573# define STDC_HEADERS
574# define HAVE_UNISTD_H
575# define DIRENT
576# endif
577# define ASMV
578# define OS_CODE 0x05
579# ifdef TOSFS
580# define PATH_SEP2 '\\'
581# define PATH_SEP3 ':'
582# define MAX_PATH_LEN 128
583# define NO_MULTIPLE_DOTS
584# define MAX_EXT_CHARS 3
585# define Z_SUFFIX "z"
586# define NO_CHOWN
Erik Andersene49d5ec2000-02-08 19:58:47 +0000587# define casemap(c) tolow(c) /* Force file names to lower case */
Eric Andersencc8ed391999-10-05 16:24:54 +0000588# define NO_SYMLINK
589# endif
590#endif
591
592#ifdef MACOS
593# define PATH_SEP ':'
594# define DYN_ALLOC
595# define PROTO
596# define NO_STDIN_FSTAT
597# define NO_CHOWN
598# define NO_UTIME
599# define chmod(file, mode) (0)
600# define OPEN(name, flags, mode) open(name, flags)
601# define OS_CODE 0x07
602# ifdef MPW
603# define isatty(fd) ((fd) <= 2)
604# endif
605#endif
606
Erik Andersene49d5ec2000-02-08 19:58:47 +0000607#ifdef __50SERIES /* Prime/PRIMOS */
Eric Andersencc8ed391999-10-05 16:24:54 +0000608# define PATH_SEP '>'
609# define STDC_HEADERS
610# define NO_MEMORY_H
611# define NO_UTIME_H
612# define NO_UTIME
Erik Andersene49d5ec2000-02-08 19:58:47 +0000613# define NO_CHOWN
614# define NO_STDIN_FSTAT
615# define NO_SIZE_CHECK
Eric Andersencc8ed391999-10-05 16:24:54 +0000616# define NO_SYMLINK
617# define RECORD_IO 1
Erik Andersene49d5ec2000-02-08 19:58:47 +0000618# define casemap(c) tolow(c) /* Force file names to lower case */
Eric Andersencc8ed391999-10-05 16:24:54 +0000619# define put_char(c) put_byte((c) & 0x7F)
620# define get_char(c) ascii2pascii(get_byte())
Erik Andersene49d5ec2000-02-08 19:58:47 +0000621# define OS_CODE 0x0F /* temporary, subject to change */
Eric Andersencc8ed391999-10-05 16:24:54 +0000622# ifdef SIGTERM
Erik Andersene49d5ec2000-02-08 19:58:47 +0000623# undef SIGTERM /* We don't want a signal handler for SIGTERM */
Eric Andersencc8ed391999-10-05 16:24:54 +0000624# endif
625#endif
626
Erik Andersene49d5ec2000-02-08 19:58:47 +0000627#if defined(pyr) && !defined(NOMEMCPY) /* Pyramid */
628# define NOMEMCPY /* problem with overlapping copies */
Eric Andersencc8ed391999-10-05 16:24:54 +0000629#endif
630
631#ifdef TOPS20
632# define OS_CODE 0x0a
633#endif
634
635#ifndef unix
Erik Andersene49d5ec2000-02-08 19:58:47 +0000636# define NO_ST_INO /* don't rely on inode numbers */
Eric Andersencc8ed391999-10-05 16:24:54 +0000637#endif
638
639
640 /* Common defaults */
641
642#ifndef OS_CODE
Erik Andersene49d5ec2000-02-08 19:58:47 +0000643# define OS_CODE 0x03 /* assume Unix */
Eric Andersencc8ed391999-10-05 16:24:54 +0000644#endif
645
646#ifndef PATH_SEP
647# define PATH_SEP '/'
648#endif
649
650#ifndef casemap
651# define casemap(c) (c)
652#endif
653
654#ifndef OPTIONS_VAR
655# define OPTIONS_VAR "GZIP"
656#endif
657
658#ifndef Z_SUFFIX
659# define Z_SUFFIX ".gz"
660#endif
661
662#ifdef MAX_EXT_CHARS
663# define MAX_SUFFIX MAX_EXT_CHARS
664#else
665# define MAX_SUFFIX 30
666#endif
667
668#ifndef MAKE_LEGAL_NAME
669# ifdef NO_MULTIPLE_DOTS
670# define MAKE_LEGAL_NAME(name) make_simple_name(name)
671# else
672# define MAKE_LEGAL_NAME(name)
673# endif
674#endif
675
676#ifndef MIN_PART
677# define MIN_PART 3
678 /* keep at least MIN_PART chars between dots in a file name. */
679#endif
680
681#ifndef EXPAND
682# define EXPAND(argc,argv)
683#endif
684
685#ifndef RECORD_IO
686# define RECORD_IO 0
687#endif
688
689#ifndef SET_BINARY_MODE
690# define SET_BINARY_MODE(fd)
691#endif
692
693#ifndef OPEN
694# define OPEN(name, flags, mode) open(name, flags, mode)
695#endif
696
697#ifndef get_char
698# define get_char() get_byte()
699#endif
700
701#ifndef put_char
702# define put_char(c) put_byte(c)
703#endif
Glenn L McGrathf58efb52001-03-28 05:35:16 +0000704
705int crc_table_empty = 1;
706
707/* ========================================================================
708 * Signal and error handler.
709 */
710void abort_gzip()
711{
712 exit(ERROR);
713}
714
715/* ===========================================================================
716 * Clear input and output buffers
717 */
718static void clear_bufs(void)
719{
720 outcnt = 0;
721 insize = inptr = 0;
722 bytes_in = bytes_out = 0L;
723}
724
725static void write_error_msg()
726{
727 fprintf(stderr, "\n");
728 perror("");
729 abort_gzip();
730}
731
732/* ===========================================================================
733 * Does the same as write(), but also handles partial pipe writes and checks
734 * for error return.
735 */
736static void write_buf(fd, buf, cnt)
737int fd;
738void * buf;
739unsigned cnt;
740{
741 unsigned n;
742
743 while ((n = write(fd, buf, cnt)) != cnt) {
744 if (n == (unsigned) (-1)) {
745 write_error_msg();
746 }
747 cnt -= n;
748 buf = (void *) ((char *) buf + n);
749 }
750}
751
752/* ========================================================================
753 * Error handlers.
754 */
755static void read_error_msg()
756{
757 fprintf(stderr, "\n");
758 if (errno != 0) {
759 perror("");
760 } else {
761 fprintf(stderr, "unexpected end of file\n");
762 }
763 abort_gzip();
764}
765
766/* ===========================================================================
767 * Run a set of bytes through the crc shift register. If s is a NULL
768 * pointer, then initialize the crc shift register contents instead.
769 * Return the current crc in either case.
770 */
771static ulg updcrc(s, n)
772uch *s; /* pointer to bytes to pump through */
773unsigned n; /* number of bytes in s[] */
774{
775 static ulg crc = (ulg) 0xffffffffL; /* shift register contents */
776 register ulg c; /* temporary variable */
777 static unsigned long crc_32_tab[256];
778 if (crc_table_empty) {
779 unsigned long csr; /* crc shift register */
780 unsigned long e; /* polynomial exclusive-or pattern */
781 int i; /* counter for all possible eight bit values */
782 int k; /* byte being shifted into crc apparatus */
783
784 /* terms of polynomial defining this crc (except x^32): */
785 static int p[] = {0,1,2,4,5,7,8,10,11,12,16,22,23,26};
786
787 /* Make exclusive-or pattern from polynomial (0xedb88320) */
788 e = 0;
789 for (i = 0; i < sizeof(p)/sizeof(int); i++)
790 e |= 1L << (31 - p[i]);
791
792 /* Compute and print table of CRC's, five per line */
793 crc_32_tab[0] = 0x00000000L;
794 for (i = 1; i < 256; i++) {
795 csr = i;
796 /* The idea to initialize the register with the byte instead of
797 * zero was stolen from Haruhiko Okumura's ar002
798 */
799 for (k = 8; k; k--)
800 csr = csr & 1 ? (csr >> 1) ^ e : csr >> 1;
801 crc_32_tab[i]=csr;
802 }
803 }
804
805 if (s == NULL) {
806 c = 0xffffffffL;
807 } else {
808 c = crc;
809 if (n)
810 do {
811 c = crc_32_tab[((int) c ^ (*s++)) & 0xff] ^ (c >> 8);
812 } while (--n);
813 }
814 crc = c;
815 return c ^ 0xffffffffL; /* (instead of ~c for 64-bit machines) */
816}
817
Eric Andersencc8ed391999-10-05 16:24:54 +0000818/* bits.c -- output variable-length bit strings
819 * Copyright (C) 1992-1993 Jean-loup Gailly
820 * This is free software; you can redistribute it and/or modify it under the
821 * terms of the GNU General Public License, see the file COPYING.
822 */
823
824
825/*
826 * PURPOSE
827 *
828 * Output variable-length bit strings. Compression can be done
829 * to a file or to memory. (The latter is not supported in this version.)
830 *
831 * DISCUSSION
832 *
833 * The PKZIP "deflate" file format interprets compressed file data
834 * as a sequence of bits. Multi-bit strings in the file may cross
835 * byte boundaries without restriction.
836 *
837 * The first bit of each byte is the low-order bit.
838 *
839 * The routines in this file allow a variable-length bit value to
840 * be output right-to-left (useful for literal values). For
841 * left-to-right output (useful for code strings from the tree routines),
842 * the bits must have been reversed first with bi_reverse().
843 *
844 * For in-memory compression, the compressed bit stream goes directly
845 * into the requested output buffer. The input data is read in blocks
846 * by the mem_read() function. The buffer is limited to 64K on 16 bit
847 * machines.
848 *
849 * INTERFACE
850 *
851 * void bi_init (FILE *zipfile)
852 * Initialize the bit string routines.
853 *
854 * void send_bits (int value, int length)
855 * Write out a bit string, taking the source bits right to
856 * left.
857 *
858 * int bi_reverse (int value, int length)
859 * Reverse the bits of a bit string, taking the source bits left to
860 * right and emitting them right to left.
861 *
862 * void bi_windup (void)
863 * Write out any remaining bits in an incomplete byte.
864 *
865 * void copy_block(char *buf, unsigned len, int header)
866 * Copy a stored block to the zip file, storing first the length and
867 * its one's complement if requested.
868 *
869 */
870
871#ifdef DEBUG
872# include <stdio.h>
873#endif
874
Eric Andersencc8ed391999-10-05 16:24:54 +0000875/* ===========================================================================
876 * Local data used by the "bit string" routines.
877 */
878
Erik Andersene49d5ec2000-02-08 19:58:47 +0000879local file_t zfile; /* output gzip file */
Eric Andersencc8ed391999-10-05 16:24:54 +0000880
881local unsigned short bi_buf;
Erik Andersene49d5ec2000-02-08 19:58:47 +0000882
Eric Andersencc8ed391999-10-05 16:24:54 +0000883/* Output buffer. bits are inserted starting at the bottom (least significant
884 * bits).
885 */
886
887#define Buf_size (8 * 2*sizeof(char))
888/* Number of bits used within bi_buf. (bi_buf might be implemented on
889 * more than 16 bits on some systems.)
890 */
891
892local int bi_valid;
Erik Andersene49d5ec2000-02-08 19:58:47 +0000893
Eric Andersencc8ed391999-10-05 16:24:54 +0000894/* Number of valid bits in bi_buf. All bits above the last valid bit
895 * are always zero.
896 */
897
Erik Andersen61677fe2000-04-13 01:18:56 +0000898int (*read_buf) (char *buf, unsigned size);
Erik Andersene49d5ec2000-02-08 19:58:47 +0000899
Eric Andersencc8ed391999-10-05 16:24:54 +0000900/* Current input function. Set to mem_read for in-memory compression */
901
902#ifdef DEBUG
Erik Andersene49d5ec2000-02-08 19:58:47 +0000903ulg bits_sent; /* bit length of the compressed data */
Eric Andersencc8ed391999-10-05 16:24:54 +0000904#endif
905
906/* ===========================================================================
907 * Initialize the bit string routines.
908 */
Erik Andersene49d5ec2000-02-08 19:58:47 +0000909void bi_init(zipfile)
910file_t zipfile; /* output zip file, NO_FILE for in-memory compression */
Eric Andersencc8ed391999-10-05 16:24:54 +0000911{
Erik Andersene49d5ec2000-02-08 19:58:47 +0000912 zfile = zipfile;
913 bi_buf = 0;
914 bi_valid = 0;
Eric Andersencc8ed391999-10-05 16:24:54 +0000915#ifdef DEBUG
Erik Andersene49d5ec2000-02-08 19:58:47 +0000916 bits_sent = 0L;
Eric Andersencc8ed391999-10-05 16:24:54 +0000917#endif
918
Erik Andersene49d5ec2000-02-08 19:58:47 +0000919 /* Set the defaults for file compression. They are set by memcompress
920 * for in-memory compression.
921 */
922 if (zfile != NO_FILE) {
923 read_buf = file_read;
924 }
Eric Andersencc8ed391999-10-05 16:24:54 +0000925}
926
927/* ===========================================================================
928 * Send a value on a given number of bits.
929 * IN assertion: length <= 16 and value fits in length bits.
930 */
931void send_bits(value, length)
Erik Andersene49d5ec2000-02-08 19:58:47 +0000932int value; /* value to send */
933int length; /* number of bits */
Eric Andersencc8ed391999-10-05 16:24:54 +0000934{
935#ifdef DEBUG
Erik Andersene49d5ec2000-02-08 19:58:47 +0000936 Tracev((stderr, " l %2d v %4x ", length, value));
937 Assert(length > 0 && length <= 15, "invalid length");
938 bits_sent += (ulg) length;
Eric Andersencc8ed391999-10-05 16:24:54 +0000939#endif
Erik Andersene49d5ec2000-02-08 19:58:47 +0000940 /* If not enough room in bi_buf, use (valid) bits from bi_buf and
941 * (16 - bi_valid) bits from value, leaving (width - (16-bi_valid))
942 * unused bits in value.
943 */
944 if (bi_valid > (int) Buf_size - length) {
945 bi_buf |= (value << bi_valid);
946 put_short(bi_buf);
947 bi_buf = (ush) value >> (Buf_size - bi_valid);
948 bi_valid += length - Buf_size;
949 } else {
950 bi_buf |= value << bi_valid;
951 bi_valid += length;
952 }
Eric Andersencc8ed391999-10-05 16:24:54 +0000953}
954
955/* ===========================================================================
956 * Reverse the first len bits of a code, using straightforward code (a faster
957 * method would use a table)
958 * IN assertion: 1 <= len <= 15
959 */
960unsigned bi_reverse(code, len)
Erik Andersene49d5ec2000-02-08 19:58:47 +0000961unsigned code; /* the value to invert */
962int len; /* its bit length */
Eric Andersencc8ed391999-10-05 16:24:54 +0000963{
Erik Andersene49d5ec2000-02-08 19:58:47 +0000964 register unsigned res = 0;
965
966 do {
967 res |= code & 1;
968 code >>= 1, res <<= 1;
969 } while (--len > 0);
970 return res >> 1;
Eric Andersencc8ed391999-10-05 16:24:54 +0000971}
972
973/* ===========================================================================
974 * Write out any remaining bits in an incomplete byte.
975 */
976void bi_windup()
977{
Erik Andersene49d5ec2000-02-08 19:58:47 +0000978 if (bi_valid > 8) {
979 put_short(bi_buf);
980 } else if (bi_valid > 0) {
981 put_byte(bi_buf);
982 }
983 bi_buf = 0;
984 bi_valid = 0;
Eric Andersencc8ed391999-10-05 16:24:54 +0000985#ifdef DEBUG
Erik Andersene49d5ec2000-02-08 19:58:47 +0000986 bits_sent = (bits_sent + 7) & ~7;
Eric Andersencc8ed391999-10-05 16:24:54 +0000987#endif
988}
989
990/* ===========================================================================
991 * Copy a stored block to the zip file, storing first the length and its
992 * one's complement if requested.
993 */
994void copy_block(buf, len, header)
Erik Andersene49d5ec2000-02-08 19:58:47 +0000995char *buf; /* the input data */
996unsigned len; /* its length */
997int header; /* true if block header must be written */
Eric Andersencc8ed391999-10-05 16:24:54 +0000998{
Erik Andersene49d5ec2000-02-08 19:58:47 +0000999 bi_windup(); /* align on byte boundary */
Eric Andersencc8ed391999-10-05 16:24:54 +00001000
Erik Andersene49d5ec2000-02-08 19:58:47 +00001001 if (header) {
1002 put_short((ush) len);
1003 put_short((ush) ~ len);
Eric Andersencc8ed391999-10-05 16:24:54 +00001004#ifdef DEBUG
Erik Andersene49d5ec2000-02-08 19:58:47 +00001005 bits_sent += 2 * 16;
Eric Andersencc8ed391999-10-05 16:24:54 +00001006#endif
Erik Andersene49d5ec2000-02-08 19:58:47 +00001007 }
Eric Andersencc8ed391999-10-05 16:24:54 +00001008#ifdef DEBUG
Erik Andersene49d5ec2000-02-08 19:58:47 +00001009 bits_sent += (ulg) len << 3;
Eric Andersencc8ed391999-10-05 16:24:54 +00001010#endif
Erik Andersene49d5ec2000-02-08 19:58:47 +00001011 while (len--) {
Eric Andersencc8ed391999-10-05 16:24:54 +00001012#ifdef CRYPT
Erik Andersene49d5ec2000-02-08 19:58:47 +00001013 int t;
1014
1015 if (key)
1016 zencode(*buf, t);
Eric Andersencc8ed391999-10-05 16:24:54 +00001017#endif
Erik Andersene49d5ec2000-02-08 19:58:47 +00001018 put_byte(*buf++);
1019 }
Eric Andersencc8ed391999-10-05 16:24:54 +00001020}
Erik Andersene49d5ec2000-02-08 19:58:47 +00001021
Eric Andersencc8ed391999-10-05 16:24:54 +00001022/* deflate.c -- compress data using the deflation algorithm
1023 * Copyright (C) 1992-1993 Jean-loup Gailly
1024 * This is free software; you can redistribute it and/or modify it under the
1025 * terms of the GNU General Public License, see the file COPYING.
1026 */
1027
1028/*
1029 * PURPOSE
1030 *
1031 * Identify new text as repetitions of old text within a fixed-
1032 * length sliding window trailing behind the new text.
1033 *
1034 * DISCUSSION
1035 *
1036 * The "deflation" process depends on being able to identify portions
1037 * of the input text which are identical to earlier input (within a
1038 * sliding window trailing behind the input currently being processed).
1039 *
1040 * The most straightforward technique turns out to be the fastest for
1041 * most input files: try all possible matches and select the longest.
1042 * The key feature of this algorithm is that insertions into the string
1043 * dictionary are very simple and thus fast, and deletions are avoided
1044 * completely. Insertions are performed at each input character, whereas
1045 * string matches are performed only when the previous match ends. So it
1046 * is preferable to spend more time in matches to allow very fast string
1047 * insertions and avoid deletions. The matching algorithm for small
1048 * strings is inspired from that of Rabin & Karp. A brute force approach
1049 * is used to find longer strings when a small match has been found.
1050 * A similar algorithm is used in comic (by Jan-Mark Wams) and freeze
1051 * (by Leonid Broukhis).
1052 * A previous version of this file used a more sophisticated algorithm
1053 * (by Fiala and Greene) which is guaranteed to run in linear amortized
1054 * time, but has a larger average cost, uses more memory and is patented.
1055 * However the F&G algorithm may be faster for some highly redundant
1056 * files if the parameter max_chain_length (described below) is too large.
1057 *
1058 * ACKNOWLEDGEMENTS
1059 *
1060 * The idea of lazy evaluation of matches is due to Jan-Mark Wams, and
1061 * I found it in 'freeze' written by Leonid Broukhis.
1062 * Thanks to many info-zippers for bug reports and testing.
1063 *
1064 * REFERENCES
1065 *
1066 * APPNOTE.TXT documentation file in PKZIP 1.93a distribution.
1067 *
1068 * A description of the Rabin and Karp algorithm is given in the book
1069 * "Algorithms" by R. Sedgewick, Addison-Wesley, p252.
1070 *
1071 * Fiala,E.R., and Greene,D.H.
1072 * Data Compression with Finite Windows, Comm.ACM, 32,4 (1989) 490-595
1073 *
1074 * INTERFACE
1075 *
1076 * void lm_init (int pack_level, ush *flags)
1077 * Initialize the "longest match" routines for a new file
1078 *
1079 * ulg deflate (void)
1080 * Processes a new input file and return its compressed length. Sets
1081 * the compressed length, crc, deflate flags and internal file
1082 * attributes.
1083 */
1084
1085#include <stdio.h>
1086
Eric Andersencc8ed391999-10-05 16:24:54 +00001087/* ===========================================================================
1088 * Configuration parameters
1089 */
1090
1091/* Compile with MEDIUM_MEM to reduce the memory requirements or
1092 * with SMALL_MEM to use as little memory as possible. Use BIG_MEM if the
1093 * entire input file can be held in memory (not possible on 16 bit systems).
1094 * Warning: defining these symbols affects HASH_BITS (see below) and thus
1095 * affects the compression ratio. The compressed output
1096 * is still correct, and might even be smaller in some cases.
1097 */
1098
1099#ifdef SMALL_MEM
Erik Andersene49d5ec2000-02-08 19:58:47 +00001100# define HASH_BITS 13 /* Number of bits used to hash strings */
Eric Andersencc8ed391999-10-05 16:24:54 +00001101#endif
1102#ifdef MEDIUM_MEM
1103# define HASH_BITS 14
1104#endif
1105#ifndef HASH_BITS
1106# define HASH_BITS 15
1107 /* For portability to 16 bit machines, do not use values above 15. */
1108#endif
1109
1110/* To save space (see unlzw.c), we overlay prev+head with tab_prefix and
1111 * window with tab_suffix. Check that we can do this:
1112 */
1113#if (WSIZE<<1) > (1<<BITS)
Erik Andersene49d5ec2000-02-08 19:58:47 +00001114error:cannot overlay window with tab_suffix and prev with tab_prefix0
Eric Andersencc8ed391999-10-05 16:24:54 +00001115#endif
1116#if HASH_BITS > BITS-1
Erik Andersene49d5ec2000-02-08 19:58:47 +00001117error:cannot overlay head with tab_prefix1
Eric Andersencc8ed391999-10-05 16:24:54 +00001118#endif
Eric Andersencc8ed391999-10-05 16:24:54 +00001119#define HASH_SIZE (unsigned)(1<<HASH_BITS)
1120#define HASH_MASK (HASH_SIZE-1)
1121#define WMASK (WSIZE-1)
1122/* HASH_SIZE and WSIZE must be powers of two */
Eric Andersencc8ed391999-10-05 16:24:54 +00001123#define NIL 0
1124/* Tail of hash chains */
Eric Andersencc8ed391999-10-05 16:24:54 +00001125#define FAST 4
1126#define SLOW 2
1127/* speed options for the general purpose bit flag */
Eric Andersencc8ed391999-10-05 16:24:54 +00001128#ifndef TOO_FAR
1129# define TOO_FAR 4096
1130#endif
1131/* Matches of length 3 are discarded if their distance exceeds TOO_FAR */
Eric Andersencc8ed391999-10-05 16:24:54 +00001132/* ===========================================================================
1133 * Local data used by the "longest match" routines.
1134 */
Eric Andersencc8ed391999-10-05 16:24:54 +00001135typedef ush Pos;
1136typedef unsigned IPos;
Erik Andersene49d5ec2000-02-08 19:58:47 +00001137
Eric Andersencc8ed391999-10-05 16:24:54 +00001138/* A Pos is an index in the character window. We use short instead of int to
1139 * save space in the various tables. IPos is used only for parameter passing.
1140 */
1141
1142/* DECLARE(uch, window, 2L*WSIZE); */
1143/* Sliding window. Input bytes are read into the second half of the window,
1144 * and move to the first half later to keep a dictionary of at least WSIZE
1145 * bytes. With this organization, matches are limited to a distance of
1146 * WSIZE-MAX_MATCH bytes, but this ensures that IO is always
1147 * performed with a length multiple of the block size. Also, it limits
1148 * the window size to 64K, which is quite useful on MSDOS.
1149 * To do: limit the window size to WSIZE+BSZ if SMALL_MEM (the code would
1150 * be less efficient).
1151 */
1152
1153/* DECLARE(Pos, prev, WSIZE); */
1154/* Link to older string with same hash index. To limit the size of this
1155 * array to 64K, this link is maintained only for the last 32K strings.
1156 * An index in this array is thus a window index modulo 32K.
1157 */
1158
1159/* DECLARE(Pos, head, 1<<HASH_BITS); */
1160/* Heads of the hash chains or NIL. */
1161
Erik Andersene49d5ec2000-02-08 19:58:47 +00001162ulg window_size = (ulg) 2 * WSIZE;
1163
Eric Andersencc8ed391999-10-05 16:24:54 +00001164/* window size, 2*WSIZE except for MMAP or BIG_MEM, where it is the
1165 * input file length plus MIN_LOOKAHEAD.
1166 */
1167
1168long block_start;
Erik Andersene49d5ec2000-02-08 19:58:47 +00001169
Eric Andersencc8ed391999-10-05 16:24:54 +00001170/* window position at the beginning of the current output block. Gets
1171 * negative when the window is moved backwards.
1172 */
1173
Erik Andersene49d5ec2000-02-08 19:58:47 +00001174local unsigned ins_h; /* hash index of string to be inserted */
Eric Andersencc8ed391999-10-05 16:24:54 +00001175
1176#define H_SHIFT ((HASH_BITS+MIN_MATCH-1)/MIN_MATCH)
1177/* Number of bits by which ins_h and del_h must be shifted at each
1178 * input step. It must be such that after MIN_MATCH steps, the oldest
1179 * byte no longer takes part in the hash key, that is:
1180 * H_SHIFT * MIN_MATCH >= HASH_BITS
1181 */
1182
1183unsigned int near prev_length;
Erik Andersene49d5ec2000-02-08 19:58:47 +00001184
Eric Andersencc8ed391999-10-05 16:24:54 +00001185/* Length of the best match at previous step. Matches not greater than this
1186 * are discarded. This is used in the lazy match evaluation.
1187 */
1188
Erik Andersene49d5ec2000-02-08 19:58:47 +00001189unsigned near strstart; /* start of string to insert */
1190unsigned near match_start; /* start of matching string */
1191local int eofile; /* flag set at end of input file */
1192local unsigned lookahead; /* number of valid bytes ahead in window */
Eric Andersencc8ed391999-10-05 16:24:54 +00001193
1194unsigned near max_chain_length;
Erik Andersene49d5ec2000-02-08 19:58:47 +00001195
Eric Andersencc8ed391999-10-05 16:24:54 +00001196/* To speed up deflation, hash chains are never searched beyond this length.
1197 * A higher limit improves compression ratio but degrades the speed.
1198 */
1199
1200local unsigned int max_lazy_match;
Erik Andersene49d5ec2000-02-08 19:58:47 +00001201
Eric Andersencc8ed391999-10-05 16:24:54 +00001202/* Attempt to find a better match only when the current match is strictly
1203 * smaller than this value. This mechanism is used only for compression
1204 * levels >= 4.
1205 */
1206#define max_insert_length max_lazy_match
1207/* Insert new strings in the hash table only if the match length
1208 * is not greater than this length. This saves time but degrades compression.
1209 * max_insert_length is used only for compression levels <= 3.
1210 */
1211
1212unsigned near good_match;
Erik Andersene49d5ec2000-02-08 19:58:47 +00001213
Eric Andersencc8ed391999-10-05 16:24:54 +00001214/* Use a faster search when the previous match is longer than this */
1215
1216
1217/* Values for max_lazy_match, good_match and max_chain_length, depending on
1218 * the desired pack level (0..9). The values given below have been tuned to
1219 * exclude worst case performance for pathological files. Better values may be
1220 * found for specific files.
1221 */
1222
1223typedef struct config {
Erik Andersene49d5ec2000-02-08 19:58:47 +00001224 ush good_length; /* reduce lazy search above this match length */
1225 ush max_lazy; /* do not perform lazy search above this match length */
1226 ush nice_length; /* quit search above this match length */
1227 ush max_chain;
Eric Andersencc8ed391999-10-05 16:24:54 +00001228} config;
1229
1230#ifdef FULL_SEARCH
1231# define nice_match MAX_MATCH
1232#else
Erik Andersene49d5ec2000-02-08 19:58:47 +00001233int near nice_match; /* Stop searching when current match exceeds this */
Eric Andersencc8ed391999-10-05 16:24:54 +00001234#endif
1235
Erik Andersene49d5ec2000-02-08 19:58:47 +00001236local config configuration_table =
1237 /* 9 */ { 32, 258, 258, 4096 };
1238 /* maximum compression */
Eric Andersencc8ed391999-10-05 16:24:54 +00001239
1240/* Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4
1241 * For deflate_fast() (levels <= 3) good is ignored and lazy has a different
1242 * meaning.
1243 */
1244
1245#define EQUAL 0
1246/* result of memcmp for equal strings */
1247
1248/* ===========================================================================
1249 * Prototypes for local functions.
1250 */
Erik Andersen61677fe2000-04-13 01:18:56 +00001251local void fill_window (void);
Eric Andersencc8ed391999-10-05 16:24:54 +00001252
Erik Andersen61677fe2000-04-13 01:18:56 +00001253int longest_match (IPos cur_match);
Erik Andersene49d5ec2000-02-08 19:58:47 +00001254
Eric Andersencc8ed391999-10-05 16:24:54 +00001255#ifdef ASMV
Erik Andersen61677fe2000-04-13 01:18:56 +00001256void match_init (void); /* asm code initialization */
Eric Andersencc8ed391999-10-05 16:24:54 +00001257#endif
1258
1259#ifdef DEBUG
Erik Andersen61677fe2000-04-13 01:18:56 +00001260local void check_match (IPos start, IPos match, int length);
Eric Andersencc8ed391999-10-05 16:24:54 +00001261#endif
1262
1263/* ===========================================================================
1264 * Update a hash value with the given input byte
1265 * IN assertion: all calls to to UPDATE_HASH are made with consecutive
1266 * input characters, so that a running hash key can be computed from the
1267 * previous key instead of complete recalculation each time.
1268 */
1269#define UPDATE_HASH(h,c) (h = (((h)<<H_SHIFT) ^ (c)) & HASH_MASK)
1270
1271/* ===========================================================================
1272 * Insert string s in the dictionary and set match_head to the previous head
1273 * of the hash chain (the most recent string with same hash key). Return
1274 * the previous length of the hash chain.
1275 * IN assertion: all calls to to INSERT_STRING are made with consecutive
1276 * input characters and the first MIN_MATCH bytes of s are valid
1277 * (except for the last MIN_MATCH-1 bytes of the input file).
1278 */
1279#define INSERT_STRING(s, match_head) \
1280 (UPDATE_HASH(ins_h, window[(s) + MIN_MATCH-1]), \
1281 prev[(s) & WMASK] = match_head = head[ins_h], \
1282 head[ins_h] = (s))
1283
1284/* ===========================================================================
1285 * Initialize the "longest match" routines for a new file
1286 */
Erik Andersene49d5ec2000-02-08 19:58:47 +00001287void lm_init(flags)
1288ush *flags; /* general purpose bit flag */
Eric Andersencc8ed391999-10-05 16:24:54 +00001289{
Erik Andersene49d5ec2000-02-08 19:58:47 +00001290 register unsigned j;
Eric Andersencc8ed391999-10-05 16:24:54 +00001291
Erik Andersene49d5ec2000-02-08 19:58:47 +00001292 /* Initialize the hash table. */
Eric Andersencc8ed391999-10-05 16:24:54 +00001293#if defined(MAXSEG_64K) && HASH_BITS == 15
Erik Andersene49d5ec2000-02-08 19:58:47 +00001294 for (j = 0; j < HASH_SIZE; j++)
1295 head[j] = NIL;
Eric Andersencc8ed391999-10-05 16:24:54 +00001296#else
Erik Andersene49d5ec2000-02-08 19:58:47 +00001297 memzero((char *) head, HASH_SIZE * sizeof(*head));
Eric Andersencc8ed391999-10-05 16:24:54 +00001298#endif
Erik Andersene49d5ec2000-02-08 19:58:47 +00001299 /* prev will be initialized on the fly */
Eric Andersencc8ed391999-10-05 16:24:54 +00001300
Erik Andersene49d5ec2000-02-08 19:58:47 +00001301 /* Set the default configuration parameters:
1302 */
1303 max_lazy_match = configuration_table.max_lazy;
1304 good_match = configuration_table.good_length;
Eric Andersencc8ed391999-10-05 16:24:54 +00001305#ifndef FULL_SEARCH
Erik Andersene49d5ec2000-02-08 19:58:47 +00001306 nice_match = configuration_table.nice_length;
Eric Andersencc8ed391999-10-05 16:24:54 +00001307#endif
Erik Andersene49d5ec2000-02-08 19:58:47 +00001308 max_chain_length = configuration_table.max_chain;
1309 *flags |= SLOW;
1310 /* ??? reduce max_chain_length for binary files */
Eric Andersencc8ed391999-10-05 16:24:54 +00001311
Erik Andersene49d5ec2000-02-08 19:58:47 +00001312 strstart = 0;
1313 block_start = 0L;
Eric Andersencc8ed391999-10-05 16:24:54 +00001314#ifdef ASMV
Erik Andersene49d5ec2000-02-08 19:58:47 +00001315 match_init(); /* initialize the asm code */
Eric Andersencc8ed391999-10-05 16:24:54 +00001316#endif
1317
Erik Andersene49d5ec2000-02-08 19:58:47 +00001318 lookahead = read_buf((char *) window,
1319 sizeof(int) <= 2 ? (unsigned) WSIZE : 2 * WSIZE);
Eric Andersencc8ed391999-10-05 16:24:54 +00001320
Erik Andersene49d5ec2000-02-08 19:58:47 +00001321 if (lookahead == 0 || lookahead == (unsigned) EOF) {
1322 eofile = 1, lookahead = 0;
1323 return;
1324 }
1325 eofile = 0;
1326 /* Make sure that we always have enough lookahead. This is important
1327 * if input comes from a device such as a tty.
1328 */
1329 while (lookahead < MIN_LOOKAHEAD && !eofile)
1330 fill_window();
Eric Andersencc8ed391999-10-05 16:24:54 +00001331
Erik Andersene49d5ec2000-02-08 19:58:47 +00001332 ins_h = 0;
1333 for (j = 0; j < MIN_MATCH - 1; j++)
1334 UPDATE_HASH(ins_h, window[j]);
1335 /* If lookahead < MIN_MATCH, ins_h is garbage, but this is
1336 * not important since only literal bytes will be emitted.
1337 */
Eric Andersencc8ed391999-10-05 16:24:54 +00001338}
1339
1340/* ===========================================================================
1341 * Set match_start to the longest match starting at the given string and
1342 * return its length. Matches shorter or equal to prev_length are discarded,
1343 * in which case the result is equal to prev_length and match_start is
1344 * garbage.
1345 * IN assertions: cur_match is the head of the hash chain for the current
1346 * string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1
1347 */
1348#ifndef ASMV
1349/* For MSDOS, OS/2 and 386 Unix, an optimized version is in match.asm or
1350 * match.s. The code is functionally equivalent, so you can use the C version
1351 * if desired.
1352 */
1353int longest_match(cur_match)
Erik Andersene49d5ec2000-02-08 19:58:47 +00001354IPos cur_match; /* current match */
Eric Andersencc8ed391999-10-05 16:24:54 +00001355{
Erik Andersene49d5ec2000-02-08 19:58:47 +00001356 unsigned chain_length = max_chain_length; /* max hash chain length */
1357 register uch *scan = window + strstart; /* current string */
1358 register uch *match; /* matched string */
1359 register int len; /* length of current match */
1360 int best_len = prev_length; /* best match length so far */
1361 IPos limit =
1362
1363 strstart > (IPos) MAX_DIST ? strstart - (IPos) MAX_DIST : NIL;
1364 /* Stop when cur_match becomes <= limit. To simplify the code,
1365 * we prevent matches with the string of window index 0.
1366 */
Eric Andersencc8ed391999-10-05 16:24:54 +00001367
1368/* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.
1369 * It is easy to get rid of this optimization if necessary.
1370 */
1371#if HASH_BITS < 8 || MAX_MATCH != 258
Erik Andersene49d5ec2000-02-08 19:58:47 +00001372 error:Code too clever
Eric Andersencc8ed391999-10-05 16:24:54 +00001373#endif
Eric Andersencc8ed391999-10-05 16:24:54 +00001374#ifdef UNALIGNED_OK
Erik Andersene49d5ec2000-02-08 19:58:47 +00001375 /* Compare two bytes at a time. Note: this is not always beneficial.
1376 * Try with and without -DUNALIGNED_OK to check.
1377 */
1378 register uch *strend = window + strstart + MAX_MATCH - 1;
1379 register ush scan_start = *(ush *) scan;
1380 register ush scan_end = *(ush *) (scan + best_len - 1);
Eric Andersencc8ed391999-10-05 16:24:54 +00001381#else
Erik Andersene49d5ec2000-02-08 19:58:47 +00001382 register uch *strend = window + strstart + MAX_MATCH;
1383 register uch scan_end1 = scan[best_len - 1];
1384 register uch scan_end = scan[best_len];
Eric Andersencc8ed391999-10-05 16:24:54 +00001385#endif
1386
Erik Andersene49d5ec2000-02-08 19:58:47 +00001387 /* Do not waste too much time if we already have a good match: */
1388 if (prev_length >= good_match) {
1389 chain_length >>= 2;
1390 }
1391 Assert(strstart <= window_size - MIN_LOOKAHEAD,
1392 "insufficient lookahead");
Eric Andersencc8ed391999-10-05 16:24:54 +00001393
Erik Andersene49d5ec2000-02-08 19:58:47 +00001394 do {
1395 Assert(cur_match < strstart, "no future");
1396 match = window + cur_match;
Eric Andersencc8ed391999-10-05 16:24:54 +00001397
Erik Andersene49d5ec2000-02-08 19:58:47 +00001398 /* Skip to next match if the match length cannot increase
1399 * or if the match length is less than 2:
1400 */
Eric Andersencc8ed391999-10-05 16:24:54 +00001401#if (defined(UNALIGNED_OK) && MAX_MATCH == 258)
Erik Andersene49d5ec2000-02-08 19:58:47 +00001402 /* This code assumes sizeof(unsigned short) == 2. Do not use
1403 * UNALIGNED_OK if your compiler uses a different size.
1404 */
1405 if (*(ush *) (match + best_len - 1) != scan_end ||
1406 *(ush *) match != scan_start)
1407 continue;
Eric Andersencc8ed391999-10-05 16:24:54 +00001408
Erik Andersene49d5ec2000-02-08 19:58:47 +00001409 /* It is not necessary to compare scan[2] and match[2] since they are
1410 * always equal when the other bytes match, given that the hash keys
1411 * are equal and that HASH_BITS >= 8. Compare 2 bytes at a time at
1412 * strstart+3, +5, ... up to strstart+257. We check for insufficient
1413 * lookahead only every 4th comparison; the 128th check will be made
1414 * at strstart+257. If MAX_MATCH-2 is not a multiple of 8, it is
1415 * necessary to put more guard bytes at the end of the window, or
1416 * to check more often for insufficient lookahead.
1417 */
1418 scan++, match++;
1419 do {
1420 } while (*(ush *) (scan += 2) == *(ush *) (match += 2) &&
1421 *(ush *) (scan += 2) == *(ush *) (match += 2) &&
1422 *(ush *) (scan += 2) == *(ush *) (match += 2) &&
1423 *(ush *) (scan += 2) == *(ush *) (match += 2) &&
1424 scan < strend);
1425 /* The funny "do {}" generates better code on most compilers */
Eric Andersencc8ed391999-10-05 16:24:54 +00001426
Erik Andersene49d5ec2000-02-08 19:58:47 +00001427 /* Here, scan <= window+strstart+257 */
1428 Assert(scan <= window + (unsigned) (window_size - 1), "wild scan");
1429 if (*scan == *match)
1430 scan++;
Eric Andersencc8ed391999-10-05 16:24:54 +00001431
Erik Andersene49d5ec2000-02-08 19:58:47 +00001432 len = (MAX_MATCH - 1) - (int) (strend - scan);
1433 scan = strend - (MAX_MATCH - 1);
Eric Andersencc8ed391999-10-05 16:24:54 +00001434
Erik Andersene49d5ec2000-02-08 19:58:47 +00001435#else /* UNALIGNED_OK */
Eric Andersencc8ed391999-10-05 16:24:54 +00001436
Erik Andersene49d5ec2000-02-08 19:58:47 +00001437 if (match[best_len] != scan_end ||
1438 match[best_len - 1] != scan_end1 ||
1439 *match != *scan || *++match != scan[1])
1440 continue;
Eric Andersencc8ed391999-10-05 16:24:54 +00001441
Erik Andersene49d5ec2000-02-08 19:58:47 +00001442 /* The check at best_len-1 can be removed because it will be made
1443 * again later. (This heuristic is not always a win.)
1444 * It is not necessary to compare scan[2] and match[2] since they
1445 * are always equal when the other bytes match, given that
1446 * the hash keys are equal and that HASH_BITS >= 8.
1447 */
1448 scan += 2, match++;
Eric Andersencc8ed391999-10-05 16:24:54 +00001449
Erik Andersene49d5ec2000-02-08 19:58:47 +00001450 /* We check for insufficient lookahead only every 8th comparison;
1451 * the 256th check will be made at strstart+258.
1452 */
1453 do {
1454 } while (*++scan == *++match && *++scan == *++match &&
1455 *++scan == *++match && *++scan == *++match &&
1456 *++scan == *++match && *++scan == *++match &&
1457 *++scan == *++match && *++scan == *++match &&
1458 scan < strend);
Eric Andersencc8ed391999-10-05 16:24:54 +00001459
Erik Andersene49d5ec2000-02-08 19:58:47 +00001460 len = MAX_MATCH - (int) (strend - scan);
1461 scan = strend - MAX_MATCH;
Eric Andersencc8ed391999-10-05 16:24:54 +00001462
Erik Andersene49d5ec2000-02-08 19:58:47 +00001463#endif /* UNALIGNED_OK */
Eric Andersencc8ed391999-10-05 16:24:54 +00001464
Erik Andersene49d5ec2000-02-08 19:58:47 +00001465 if (len > best_len) {
1466 match_start = cur_match;
1467 best_len = len;
1468 if (len >= nice_match)
1469 break;
Eric Andersencc8ed391999-10-05 16:24:54 +00001470#ifdef UNALIGNED_OK
Erik Andersene49d5ec2000-02-08 19:58:47 +00001471 scan_end = *(ush *) (scan + best_len - 1);
Eric Andersencc8ed391999-10-05 16:24:54 +00001472#else
Erik Andersene49d5ec2000-02-08 19:58:47 +00001473 scan_end1 = scan[best_len - 1];
1474 scan_end = scan[best_len];
Eric Andersencc8ed391999-10-05 16:24:54 +00001475#endif
Erik Andersene49d5ec2000-02-08 19:58:47 +00001476 }
1477 } while ((cur_match = prev[cur_match & WMASK]) > limit
1478 && --chain_length != 0);
Eric Andersencc8ed391999-10-05 16:24:54 +00001479
Erik Andersene49d5ec2000-02-08 19:58:47 +00001480 return best_len;
Eric Andersencc8ed391999-10-05 16:24:54 +00001481}
Erik Andersene49d5ec2000-02-08 19:58:47 +00001482#endif /* ASMV */
Eric Andersencc8ed391999-10-05 16:24:54 +00001483
1484#ifdef DEBUG
1485/* ===========================================================================
1486 * Check that the match at match_start is indeed a match.
1487 */
1488local void check_match(start, match, length)
Erik Andersene49d5ec2000-02-08 19:58:47 +00001489IPos start, match;
1490int length;
Eric Andersencc8ed391999-10-05 16:24:54 +00001491{
Erik Andersene49d5ec2000-02-08 19:58:47 +00001492 /* check that the match is indeed a match */
1493 if (memcmp((char *) window + match,
1494 (char *) window + start, length) != EQUAL) {
1495 fprintf(stderr,
1496 " start %d, match %d, length %d\n", start, match, length);
Matt Kraaidd19c692001-01-31 19:00:21 +00001497 error_msg("invalid match");
Erik Andersene49d5ec2000-02-08 19:58:47 +00001498 }
1499 if (verbose > 1) {
1500 fprintf(stderr, "\\[%d,%d]", start - match, length);
1501 do {
1502 putc(window[start++], stderr);
1503 } while (--length != 0);
1504 }
Eric Andersencc8ed391999-10-05 16:24:54 +00001505}
1506#else
1507# define check_match(start, match, length)
1508#endif
1509
1510/* ===========================================================================
1511 * Fill the window when the lookahead becomes insufficient.
1512 * Updates strstart and lookahead, and sets eofile if end of input file.
1513 * IN assertion: lookahead < MIN_LOOKAHEAD && strstart + lookahead > 0
1514 * OUT assertions: at least one byte has been read, or eofile is set;
1515 * file reads are performed for at least two bytes (required for the
1516 * translate_eol option).
1517 */
1518local void fill_window()
1519{
Erik Andersene49d5ec2000-02-08 19:58:47 +00001520 register unsigned n, m;
1521 unsigned more =
Eric Andersencc8ed391999-10-05 16:24:54 +00001522
Erik Andersene49d5ec2000-02-08 19:58:47 +00001523 (unsigned) (window_size - (ulg) lookahead - (ulg) strstart);
1524 /* Amount of free space at the end of the window. */
Eric Andersencc8ed391999-10-05 16:24:54 +00001525
Erik Andersene49d5ec2000-02-08 19:58:47 +00001526 /* If the window is almost full and there is insufficient lookahead,
1527 * move the upper half to the lower one to make room in the upper half.
1528 */
1529 if (more == (unsigned) EOF) {
1530 /* Very unlikely, but possible on 16 bit machine if strstart == 0
1531 * and lookahead == 1 (input done one byte at time)
1532 */
1533 more--;
1534 } else if (strstart >= WSIZE + MAX_DIST) {
1535 /* By the IN assertion, the window is not empty so we can't confuse
1536 * more == 0 with more == 64K on a 16 bit machine.
1537 */
1538 Assert(window_size == (ulg) 2 * WSIZE, "no sliding with BIG_MEM");
Eric Andersencc8ed391999-10-05 16:24:54 +00001539
Erik Andersene49d5ec2000-02-08 19:58:47 +00001540 memcpy((char *) window, (char *) window + WSIZE, (unsigned) WSIZE);
1541 match_start -= WSIZE;
1542 strstart -= WSIZE; /* we now have strstart >= MAX_DIST: */
Eric Andersencc8ed391999-10-05 16:24:54 +00001543
Erik Andersene49d5ec2000-02-08 19:58:47 +00001544 block_start -= (long) WSIZE;
1545
1546 for (n = 0; n < HASH_SIZE; n++) {
1547 m = head[n];
1548 head[n] = (Pos) (m >= WSIZE ? m - WSIZE : NIL);
1549 }
1550 for (n = 0; n < WSIZE; n++) {
1551 m = prev[n];
1552 prev[n] = (Pos) (m >= WSIZE ? m - WSIZE : NIL);
1553 /* If n is not on any hash chain, prev[n] is garbage but
1554 * its value will never be used.
1555 */
1556 }
1557 more += WSIZE;
1558 }
1559 /* At this point, more >= 2 */
1560 if (!eofile) {
1561 n = read_buf((char *) window + strstart + lookahead, more);
1562 if (n == 0 || n == (unsigned) EOF) {
1563 eofile = 1;
1564 } else {
1565 lookahead += n;
1566 }
1567 }
Eric Andersencc8ed391999-10-05 16:24:54 +00001568}
1569
1570/* ===========================================================================
1571 * Flush the current block, with given end-of-file flag.
1572 * IN assertion: strstart is set to the end of the current match.
1573 */
1574#define FLUSH_BLOCK(eof) \
1575 flush_block(block_start >= 0L ? (char*)&window[(unsigned)block_start] : \
1576 (char*)NULL, (long)strstart - block_start, (eof))
1577
1578/* ===========================================================================
1579 * Same as above, but achieves better compression. We use a lazy
1580 * evaluation for matches: a match is finally adopted only if there is
1581 * no better match at the next window position.
1582 */
1583ulg deflate()
1584{
Erik Andersene49d5ec2000-02-08 19:58:47 +00001585 IPos hash_head; /* head of hash chain */
1586 IPos prev_match; /* previous match */
1587 int flush; /* set if current block must be flushed */
1588 int match_available = 0; /* set if previous match exists */
1589 register unsigned match_length = MIN_MATCH - 1; /* length of best match */
1590
Eric Andersencc8ed391999-10-05 16:24:54 +00001591#ifdef DEBUG
Erik Andersene49d5ec2000-02-08 19:58:47 +00001592 extern long isize; /* byte length of input file, for debug only */
Eric Andersencc8ed391999-10-05 16:24:54 +00001593#endif
1594
Erik Andersene49d5ec2000-02-08 19:58:47 +00001595 /* Process the input block. */
1596 while (lookahead != 0) {
1597 /* Insert the string window[strstart .. strstart+2] in the
1598 * dictionary, and set hash_head to the head of the hash chain:
1599 */
1600 INSERT_STRING(strstart, hash_head);
Eric Andersencc8ed391999-10-05 16:24:54 +00001601
Erik Andersene49d5ec2000-02-08 19:58:47 +00001602 /* Find the longest match, discarding those <= prev_length.
1603 */
1604 prev_length = match_length, prev_match = match_start;
1605 match_length = MIN_MATCH - 1;
Eric Andersencc8ed391999-10-05 16:24:54 +00001606
Erik Andersene49d5ec2000-02-08 19:58:47 +00001607 if (hash_head != NIL && prev_length < max_lazy_match &&
1608 strstart - hash_head <= MAX_DIST) {
1609 /* To simplify the code, we prevent matches with the string
1610 * of window index 0 (in particular we have to avoid a match
1611 * of the string with itself at the start of the input file).
1612 */
1613 match_length = longest_match(hash_head);
1614 /* longest_match() sets match_start */
1615 if (match_length > lookahead)
1616 match_length = lookahead;
Eric Andersencc8ed391999-10-05 16:24:54 +00001617
Erik Andersene49d5ec2000-02-08 19:58:47 +00001618 /* Ignore a length 3 match if it is too distant: */
1619 if (match_length == MIN_MATCH
1620 && strstart - match_start > TOO_FAR) {
1621 /* If prev_match is also MIN_MATCH, match_start is garbage
1622 * but we will ignore the current match anyway.
1623 */
1624 match_length--;
1625 }
1626 }
1627 /* If there was a match at the previous step and the current
1628 * match is not better, output the previous match:
1629 */
1630 if (prev_length >= MIN_MATCH && match_length <= prev_length) {
Eric Andersencc8ed391999-10-05 16:24:54 +00001631
Erik Andersene49d5ec2000-02-08 19:58:47 +00001632 check_match(strstart - 1, prev_match, prev_length);
Eric Andersencc8ed391999-10-05 16:24:54 +00001633
Erik Andersene49d5ec2000-02-08 19:58:47 +00001634 flush =
1635 ct_tally(strstart - 1 - prev_match,
1636 prev_length - MIN_MATCH);
Eric Andersencc8ed391999-10-05 16:24:54 +00001637
Erik Andersene49d5ec2000-02-08 19:58:47 +00001638 /* Insert in hash table all strings up to the end of the match.
1639 * strstart-1 and strstart are already inserted.
1640 */
1641 lookahead -= prev_length - 1;
1642 prev_length -= 2;
1643 do {
1644 strstart++;
1645 INSERT_STRING(strstart, hash_head);
1646 /* strstart never exceeds WSIZE-MAX_MATCH, so there are
1647 * always MIN_MATCH bytes ahead. If lookahead < MIN_MATCH
1648 * these bytes are garbage, but it does not matter since the
1649 * next lookahead bytes will always be emitted as literals.
1650 */
1651 } while (--prev_length != 0);
1652 match_available = 0;
1653 match_length = MIN_MATCH - 1;
1654 strstart++;
1655 if (flush)
1656 FLUSH_BLOCK(0), block_start = strstart;
Eric Andersencc8ed391999-10-05 16:24:54 +00001657
Erik Andersene49d5ec2000-02-08 19:58:47 +00001658 } else if (match_available) {
1659 /* If there was no match at the previous position, output a
1660 * single literal. If there was a match but the current match
1661 * is longer, truncate the previous match to a single literal.
1662 */
1663 Tracevv((stderr, "%c", window[strstart - 1]));
1664 if (ct_tally(0, window[strstart - 1])) {
1665 FLUSH_BLOCK(0), block_start = strstart;
1666 }
1667 strstart++;
1668 lookahead--;
1669 } else {
1670 /* There is no previous match to compare with, wait for
1671 * the next step to decide.
1672 */
1673 match_available = 1;
1674 strstart++;
1675 lookahead--;
1676 }
1677 Assert(strstart <= isize && lookahead <= isize, "a bit too far");
Eric Andersencc8ed391999-10-05 16:24:54 +00001678
Erik Andersene49d5ec2000-02-08 19:58:47 +00001679 /* Make sure that we always have enough lookahead, except
1680 * at the end of the input file. We need MAX_MATCH bytes
1681 * for the next match, plus MIN_MATCH bytes to insert the
1682 * string following the next match.
1683 */
1684 while (lookahead < MIN_LOOKAHEAD && !eofile)
1685 fill_window();
1686 }
1687 if (match_available)
1688 ct_tally(0, window[strstart - 1]);
Eric Andersencc8ed391999-10-05 16:24:54 +00001689
Erik Andersene49d5ec2000-02-08 19:58:47 +00001690 return FLUSH_BLOCK(1); /* eof */
Eric Andersencc8ed391999-10-05 16:24:54 +00001691}
Erik Andersene49d5ec2000-02-08 19:58:47 +00001692
Eric Andersencc8ed391999-10-05 16:24:54 +00001693/* gzip (GNU zip) -- compress files with zip algorithm and 'compress' interface
1694 * Copyright (C) 1992-1993 Jean-loup Gailly
1695 * The unzip code was written and put in the public domain by Mark Adler.
1696 * Portions of the lzw code are derived from the public domain 'compress'
1697 * written by Spencer Thomas, Joe Orost, James Woods, Jim McKie, Steve Davies,
1698 * Ken Turkowski, Dave Mack and Peter Jannesen.
1699 *
1700 * See the license_msg below and the file COPYING for the software license.
1701 * See the file algorithm.doc for the compression algorithms and file formats.
1702 */
1703
1704/* Compress files with zip algorithm and 'compress' interface.
1705 * See usage() and help() functions below for all options.
1706 * Outputs:
1707 * file.gz: compressed file with same mode, owner, and utimes
1708 * or stdout with -c option or if stdin used as input.
1709 * If the output file name had to be truncated, the original name is kept
1710 * in the compressed file.
1711 * On MSDOS, file.tmp -> file.tmz. On VMS, file.tmp -> file.tmp-gz.
1712 *
1713 * Using gz on MSDOS would create too many file name conflicts. For
1714 * example, foo.txt -> foo.tgz (.tgz must be reserved as shorthand for
1715 * tar.gz). Similarly, foo.dir and foo.doc would both be mapped to foo.dgz.
1716 * I also considered 12345678.txt -> 12345txt.gz but this truncates the name
1717 * too heavily. There is no ideal solution given the MSDOS 8+3 limitation.
1718 *
1719 * For the meaning of all compilation flags, see comments in Makefile.in.
1720 */
1721
Eric Andersencc8ed391999-10-05 16:24:54 +00001722#include <ctype.h>
1723#include <sys/types.h>
1724#include <signal.h>
Eric Andersencc8ed391999-10-05 16:24:54 +00001725#include <errno.h>
1726
1727 /* configuration */
1728
1729#ifdef NO_TIME_H
1730# include <sys/time.h>
1731#else
1732# include <time.h>
1733#endif
1734
1735#ifndef NO_FCNTL_H
1736# include <fcntl.h>
1737#endif
1738
1739#ifdef HAVE_UNISTD_H
1740# include <unistd.h>
1741#endif
1742
Eric Andersencc8ed391999-10-05 16:24:54 +00001743#if defined(DIRENT)
1744# include <dirent.h>
Erik Andersene49d5ec2000-02-08 19:58:47 +00001745typedef struct dirent dir_type;
1746
Eric Andersencc8ed391999-10-05 16:24:54 +00001747# define NLENGTH(dirent) ((int)strlen((dirent)->d_name))
1748# define DIR_OPT "DIRENT"
1749#else
1750# define NLENGTH(dirent) ((dirent)->d_namlen)
1751# ifdef SYSDIR
1752# include <sys/dir.h>
Erik Andersene49d5ec2000-02-08 19:58:47 +00001753typedef struct direct dir_type;
1754
Eric Andersencc8ed391999-10-05 16:24:54 +00001755# define DIR_OPT "SYSDIR"
1756# else
1757# ifdef SYSNDIR
1758# include <sys/ndir.h>
Erik Andersene49d5ec2000-02-08 19:58:47 +00001759typedef struct direct dir_type;
1760
Eric Andersencc8ed391999-10-05 16:24:54 +00001761# define DIR_OPT "SYSNDIR"
1762# else
1763# ifdef NDIR
1764# include <ndir.h>
Erik Andersene49d5ec2000-02-08 19:58:47 +00001765typedef struct direct dir_type;
1766
Eric Andersencc8ed391999-10-05 16:24:54 +00001767# define DIR_OPT "NDIR"
1768# else
1769# define NO_DIR
1770# define DIR_OPT "NO_DIR"
1771# endif
1772# endif
1773# endif
1774#endif
1775
1776#ifndef NO_UTIME
1777# ifndef NO_UTIME_H
1778# include <utime.h>
1779# define TIME_OPT "UTIME"
1780# else
1781# ifdef HAVE_SYS_UTIME_H
1782# include <sys/utime.h>
1783# define TIME_OPT "SYS_UTIME"
1784# else
Erik Andersene49d5ec2000-02-08 19:58:47 +00001785struct utimbuf {
1786 time_t actime;
1787 time_t modtime;
1788};
1789
Eric Andersencc8ed391999-10-05 16:24:54 +00001790# define TIME_OPT ""
1791# endif
1792# endif
1793#else
1794# define TIME_OPT "NO_UTIME"
1795#endif
1796
1797#if !defined(S_ISDIR) && defined(S_IFDIR)
1798# define S_ISDIR(m) (((m) & S_IFMT) == S_IFDIR)
1799#endif
1800#if !defined(S_ISREG) && defined(S_IFREG)
1801# define S_ISREG(m) (((m) & S_IFMT) == S_IFREG)
1802#endif
1803
Erik Andersen61677fe2000-04-13 01:18:56 +00001804typedef RETSIGTYPE(*sig_type) (int);
Eric Andersencc8ed391999-10-05 16:24:54 +00001805
1806#ifndef O_BINARY
Erik Andersene49d5ec2000-02-08 19:58:47 +00001807# define O_BINARY 0 /* creation mode for open() */
Eric Andersencc8ed391999-10-05 16:24:54 +00001808#endif
1809
1810#ifndef O_CREAT
1811 /* Pure BSD system? */
1812# include <sys/file.h>
1813# ifndef O_CREAT
1814# define O_CREAT FCREAT
1815# endif
1816# ifndef O_EXCL
1817# define O_EXCL FEXCL
1818# endif
1819#endif
1820
1821#ifndef S_IRUSR
1822# define S_IRUSR 0400
1823#endif
1824#ifndef S_IWUSR
1825# define S_IWUSR 0200
1826#endif
Erik Andersene49d5ec2000-02-08 19:58:47 +00001827#define RW_USER (S_IRUSR | S_IWUSR) /* creation mode for open() */
Eric Andersencc8ed391999-10-05 16:24:54 +00001828
1829#ifndef MAX_PATH_LEN
Erik Andersene49d5ec2000-02-08 19:58:47 +00001830# define MAX_PATH_LEN 1024 /* max pathname length */
Eric Andersencc8ed391999-10-05 16:24:54 +00001831#endif
1832
1833#ifndef SEEK_END
1834# define SEEK_END 2
1835#endif
1836
1837#ifdef NO_OFF_T
Erik Andersene49d5ec2000-02-08 19:58:47 +00001838typedef long off_t;
Erik Andersen61677fe2000-04-13 01:18:56 +00001839off_t lseek (int fd, off_t offset, int whence);
Eric Andersencc8ed391999-10-05 16:24:54 +00001840#endif
1841
1842/* Separator for file name parts (see shorten_name()) */
1843#ifdef NO_MULTIPLE_DOTS
1844# define PART_SEP "-"
1845#else
1846# define PART_SEP "."
1847#endif
1848
1849 /* global buffers */
1850
Erik Andersene49d5ec2000-02-08 19:58:47 +00001851DECLARE(uch, inbuf, INBUFSIZ + INBUF_EXTRA);
1852DECLARE(uch, outbuf, OUTBUFSIZ + OUTBUF_EXTRA);
1853DECLARE(ush, d_buf, DIST_BUFSIZE);
1854DECLARE(uch, window, 2L * WSIZE);
Eric Andersencc8ed391999-10-05 16:24:54 +00001855#ifndef MAXSEG_64K
Erik Andersene49d5ec2000-02-08 19:58:47 +00001856DECLARE(ush, tab_prefix, 1L << BITS);
Eric Andersencc8ed391999-10-05 16:24:54 +00001857#else
Erik Andersene49d5ec2000-02-08 19:58:47 +00001858DECLARE(ush, tab_prefix0, 1L << (BITS - 1));
1859DECLARE(ush, tab_prefix1, 1L << (BITS - 1));
Eric Andersencc8ed391999-10-05 16:24:54 +00001860#endif
1861
1862 /* local variables */
1863
Eric Andersen63a86222000-11-07 06:52:13 +00001864static int foreground; /* set if program run in foreground */
Erik Andersene49d5ec2000-02-08 19:58:47 +00001865static int method = DEFLATED; /* compression method */
1866static int exit_code = OK; /* program exit code */
Eric Andersen63a86222000-11-07 06:52:13 +00001867static int part_nb; /* number of parts in .gz file */
1868static long time_stamp; /* original time stamp (modification time) */
1869static long ifile_size; /* input file size, -1 for devices (debug only) */
1870static char z_suffix[MAX_SUFFIX + 1]; /* default suffix (can be set with --suffix) */
1871static int z_len; /* strlen(z_suffix) */
Eric Andersencc8ed391999-10-05 16:24:54 +00001872
Eric Andersen63a86222000-11-07 06:52:13 +00001873static long bytes_in; /* number of input bytes */
1874static long bytes_out; /* number of output bytes */
1875static char ifname[MAX_PATH_LEN]; /* input file name */
1876static char ofname[MAX_PATH_LEN]; /* output file name */
1877static int ifd; /* input file descriptor */
1878static int ofd; /* output file descriptor */
1879static unsigned insize; /* valid bytes in inbuf */
1880static unsigned outcnt; /* bytes in output buffer */
Eric Andersencc8ed391999-10-05 16:24:54 +00001881
1882/* local functions */
1883
Eric Andersencc8ed391999-10-05 16:24:54 +00001884#define strequ(s1, s2) (strcmp((s1),(s2)) == 0)
1885
1886/* ======================================================================== */
1887// int main (argc, argv)
1888// int argc;
1889// char **argv;
Erik Andersene49d5ec2000-02-08 19:58:47 +00001890int gzip_main(int argc, char **argv)
Eric Andersencc8ed391999-10-05 16:24:54 +00001891{
Erik Andersene49d5ec2000-02-08 19:58:47 +00001892 int result;
1893 int inFileNum;
1894 int outFileNum;
1895 struct stat statBuf;
1896 char *delFileName;
1897 int tostdout = 0;
1898 int fromstdin = 0;
Eric Andersenea824fb2000-07-21 22:17:39 +00001899 int force = 0;
Matt Kraai53265542001-04-18 16:05:34 +00001900 int opt;
Eric Andersen96bcfd31999-11-12 01:30:18 +00001901
Glenn L McGrath5bcfc9b2001-05-07 12:01:58 +00001902 while ((opt = getopt(argc, argv, "cf123456789dq")) != -1) {
Matt Kraai53265542001-04-18 16:05:34 +00001903 switch (opt) {
1904 case 'c':
Erik Andersene49d5ec2000-02-08 19:58:47 +00001905 tostdout = 1;
Matt Kraai53265542001-04-18 16:05:34 +00001906 break;
1907 case 'f':
1908 force = 1;
1909 break;
1910 /* Ignore 1-9 (compression level) options */
1911 case '1': case '2': case '3': case '4': case '5':
1912 case '6': case '7': case '8': case '9':
1913 break;
Glenn L McGrath5bcfc9b2001-05-07 12:01:58 +00001914 case 'q':
1915 break;
Glenn L McGrath528ef502001-04-11 03:45:37 +00001916#ifdef BB_GUNZIP
Matt Kraai53265542001-04-18 16:05:34 +00001917 case 'd':
1918 optind = 1;
1919 return gunzip_main(argc, argv);
Glenn L McGrath528ef502001-04-11 03:45:37 +00001920#endif
Matt Kraai53265542001-04-18 16:05:34 +00001921 default:
1922 show_usage();
Erik Andersene49d5ec2000-02-08 19:58:47 +00001923 }
1924 }
Matt Kraai53265542001-04-18 16:05:34 +00001925 if (optind == argc) {
Eric Andersenea824fb2000-07-21 22:17:39 +00001926 fromstdin = 1;
Eric Andersen5eb59122000-09-01 00:33:06 +00001927 tostdout = 1;
1928 }
Eric Andersenea824fb2000-07-21 22:17:39 +00001929
Eric Andersenea824fb2000-07-21 22:17:39 +00001930 if (isatty(fileno(stdout)) && tostdout==1 && force==0)
Matt Kraai53265542001-04-18 16:05:34 +00001931 error_msg_and_die( "compressed data not written to terminal. Use -f to force it.");
Erik Andersene49d5ec2000-02-08 19:58:47 +00001932
1933 foreground = signal(SIGINT, SIG_IGN) != SIG_IGN;
1934 if (foreground) {
1935 (void) signal(SIGINT, (sig_type) abort_gzip);
1936 }
Eric Andersencc8ed391999-10-05 16:24:54 +00001937#ifdef SIGTERM
Erik Andersene49d5ec2000-02-08 19:58:47 +00001938 if (signal(SIGTERM, SIG_IGN) != SIG_IGN) {
1939 (void) signal(SIGTERM, (sig_type) abort_gzip);
1940 }
Eric Andersencc8ed391999-10-05 16:24:54 +00001941#endif
1942#ifdef SIGHUP
Erik Andersene49d5ec2000-02-08 19:58:47 +00001943 if (signal(SIGHUP, SIG_IGN) != SIG_IGN) {
1944 (void) signal(SIGHUP, (sig_type) abort_gzip);
1945 }
Eric Andersencc8ed391999-10-05 16:24:54 +00001946#endif
1947
Erik Andersene49d5ec2000-02-08 19:58:47 +00001948 strncpy(z_suffix, Z_SUFFIX, sizeof(z_suffix) - 1);
1949 z_len = strlen(z_suffix);
Eric Andersencc8ed391999-10-05 16:24:54 +00001950
Erik Andersene49d5ec2000-02-08 19:58:47 +00001951 /* Allocate all global buffers (for DYN_ALLOC option) */
1952 ALLOC(uch, inbuf, INBUFSIZ + INBUF_EXTRA);
1953 ALLOC(uch, outbuf, OUTBUFSIZ + OUTBUF_EXTRA);
1954 ALLOC(ush, d_buf, DIST_BUFSIZE);
1955 ALLOC(uch, window, 2L * WSIZE);
Eric Andersencc8ed391999-10-05 16:24:54 +00001956#ifndef MAXSEG_64K
Erik Andersene49d5ec2000-02-08 19:58:47 +00001957 ALLOC(ush, tab_prefix, 1L << BITS);
Eric Andersencc8ed391999-10-05 16:24:54 +00001958#else
Erik Andersene49d5ec2000-02-08 19:58:47 +00001959 ALLOC(ush, tab_prefix0, 1L << (BITS - 1));
1960 ALLOC(ush, tab_prefix1, 1L << (BITS - 1));
Eric Andersencc8ed391999-10-05 16:24:54 +00001961#endif
1962
Erik Andersene49d5ec2000-02-08 19:58:47 +00001963 if (fromstdin == 1) {
1964 strcpy(ofname, "stdin");
Eric Andersen96bcfd31999-11-12 01:30:18 +00001965
Erik Andersene49d5ec2000-02-08 19:58:47 +00001966 inFileNum = fileno(stdin);
1967 time_stamp = 0; /* time unknown by default */
1968 ifile_size = -1L; /* convention for unknown size */
1969 } else {
1970 /* Open up the input file */
Matt Kraai53265542001-04-18 16:05:34 +00001971 strncpy(ifname, argv[optind], MAX_PATH_LEN);
Eric Andersen96bcfd31999-11-12 01:30:18 +00001972
Matt Kraaia9819b22000-12-22 01:48:07 +00001973 /* Open input file */
Erik Andersene49d5ec2000-02-08 19:58:47 +00001974 inFileNum = open(ifname, O_RDONLY);
Matt Kraaia9819b22000-12-22 01:48:07 +00001975 if (inFileNum < 0)
1976 perror_msg_and_die("%s", ifname);
Erik Andersene49d5ec2000-02-08 19:58:47 +00001977 /* Get the time stamp on the input file. */
Matt Kraaia9819b22000-12-22 01:48:07 +00001978 if (stat(ifname, &statBuf) < 0)
1979 perror_msg_and_die("%s", ifname);
Erik Andersene49d5ec2000-02-08 19:58:47 +00001980 time_stamp = statBuf.st_ctime;
1981 ifile_size = statBuf.st_size;
Eric Andersen96bcfd31999-11-12 01:30:18 +00001982 }
Eric Andersen96bcfd31999-11-12 01:30:18 +00001983
1984
Erik Andersene49d5ec2000-02-08 19:58:47 +00001985 if (tostdout == 1) {
1986 /* And get to work */
1987 strcpy(ofname, "stdout");
1988 outFileNum = fileno(stdout);
1989 SET_BINARY_MODE(fileno(stdout));
Eric Andersen0dfac6b1999-11-11 05:46:32 +00001990
Erik Andersene49d5ec2000-02-08 19:58:47 +00001991 clear_bufs(); /* clear input and output buffers */
1992 part_nb = 0;
Eric Andersen0dfac6b1999-11-11 05:46:32 +00001993
Erik Andersene49d5ec2000-02-08 19:58:47 +00001994 /* Actually do the compression/decompression. */
1995 zip(inFileNum, outFileNum);
Eric Andersen0dfac6b1999-11-11 05:46:32 +00001996
Erik Andersene49d5ec2000-02-08 19:58:47 +00001997 } else {
Eric Andersen0dfac6b1999-11-11 05:46:32 +00001998
Erik Andersene49d5ec2000-02-08 19:58:47 +00001999 /* And get to work */
2000 strncpy(ofname, ifname, MAX_PATH_LEN - 4);
2001 strcat(ofname, ".gz");
Eric Andersen0dfac6b1999-11-11 05:46:32 +00002002
Eric Andersen0dfac6b1999-11-11 05:46:32 +00002003
Erik Andersene49d5ec2000-02-08 19:58:47 +00002004 /* Open output fille */
Erik Andersen4d1d0111999-12-17 18:44:15 +00002005#if (__GLIBC__ >= 2) && (__GLIBC_MINOR__ >= 1)
Erik Andersene49d5ec2000-02-08 19:58:47 +00002006 outFileNum = open(ofname, O_RDWR | O_CREAT | O_EXCL | O_NOFOLLOW);
Erik Andersen4d1d0111999-12-17 18:44:15 +00002007#else
Erik Andersene49d5ec2000-02-08 19:58:47 +00002008 outFileNum = open(ofname, O_RDWR | O_CREAT | O_EXCL);
Erik Andersen4d1d0111999-12-17 18:44:15 +00002009#endif
Matt Kraaia9819b22000-12-22 01:48:07 +00002010 if (outFileNum < 0)
2011 perror_msg_and_die("%s", ofname);
Erik Andersene49d5ec2000-02-08 19:58:47 +00002012 SET_BINARY_MODE(outFileNum);
2013 /* Set permissions on the file */
2014 fchmod(outFileNum, statBuf.st_mode);
2015
2016 clear_bufs(); /* clear input and output buffers */
2017 part_nb = 0;
2018
2019 /* Actually do the compression/decompression. */
2020 result = zip(inFileNum, outFileNum);
2021 close(outFileNum);
2022 close(inFileNum);
2023 /* Delete the original file */
2024 if (result == OK)
2025 delFileName = ifname;
2026 else
2027 delFileName = ofname;
2028
Matt Kraaia9819b22000-12-22 01:48:07 +00002029 if (unlink(delFileName) < 0)
2030 perror_msg_and_die("%s", delFileName);
Eric Andersen0dfac6b1999-11-11 05:46:32 +00002031 }
Eric Andersen0dfac6b1999-11-11 05:46:32 +00002032
Eric Andersenb6106152000-06-19 17:25:40 +00002033 return(exit_code);
Eric Andersencc8ed391999-10-05 16:24:54 +00002034}
2035
Eric Andersencc8ed391999-10-05 16:24:54 +00002036/* trees.c -- output deflated data using Huffman coding
2037 * Copyright (C) 1992-1993 Jean-loup Gailly
2038 * This is free software; you can redistribute it and/or modify it under the
2039 * terms of the GNU General Public License, see the file COPYING.
2040 */
2041
2042/*
2043 * PURPOSE
2044 *
2045 * Encode various sets of source values using variable-length
2046 * binary code trees.
2047 *
2048 * DISCUSSION
2049 *
2050 * The PKZIP "deflation" process uses several Huffman trees. The more
2051 * common source values are represented by shorter bit sequences.
2052 *
2053 * Each code tree is stored in the ZIP file in a compressed form
2054 * which is itself a Huffman encoding of the lengths of
2055 * all the code strings (in ascending order by source values).
2056 * The actual code strings are reconstructed from the lengths in
2057 * the UNZIP process, as described in the "application note"
2058 * (APPNOTE.TXT) distributed as part of PKWARE's PKZIP program.
2059 *
2060 * REFERENCES
2061 *
2062 * Lynch, Thomas J.
2063 * Data Compression: Techniques and Applications, pp. 53-55.
2064 * Lifetime Learning Publications, 1985. ISBN 0-534-03418-7.
2065 *
2066 * Storer, James A.
2067 * Data Compression: Methods and Theory, pp. 49-50.
2068 * Computer Science Press, 1988. ISBN 0-7167-8156-5.
2069 *
2070 * Sedgewick, R.
2071 * Algorithms, p290.
2072 * Addison-Wesley, 1983. ISBN 0-201-06672-6.
2073 *
2074 * INTERFACE
2075 *
2076 * void ct_init (ush *attr, int *methodp)
2077 * Allocate the match buffer, initialize the various tables and save
2078 * the location of the internal file attribute (ascii/binary) and
2079 * method (DEFLATE/STORE)
2080 *
2081 * void ct_tally (int dist, int lc);
2082 * Save the match info and tally the frequency counts.
2083 *
2084 * long flush_block (char *buf, ulg stored_len, int eof)
2085 * Determine the best encoding for the current block: dynamic trees,
2086 * static trees or store, and output the encoded block to the zip
2087 * file. Returns the total compressed length for the file so far.
2088 *
2089 */
2090
2091#include <ctype.h>
2092
Eric Andersencc8ed391999-10-05 16:24:54 +00002093/* ===========================================================================
2094 * Constants
2095 */
2096
2097#define MAX_BITS 15
2098/* All codes must not exceed MAX_BITS bits */
2099
2100#define MAX_BL_BITS 7
2101/* Bit length codes must not exceed MAX_BL_BITS bits */
2102
2103#define LENGTH_CODES 29
2104/* number of length codes, not counting the special END_BLOCK code */
2105
2106#define LITERALS 256
2107/* number of literal bytes 0..255 */
2108
2109#define END_BLOCK 256
2110/* end of block literal code */
2111
2112#define L_CODES (LITERALS+1+LENGTH_CODES)
2113/* number of Literal or Length codes, including the END_BLOCK code */
2114
2115#define D_CODES 30
2116/* number of distance codes */
2117
2118#define BL_CODES 19
2119/* number of codes used to transfer the bit lengths */
2120
2121
Erik Andersene49d5ec2000-02-08 19:58:47 +00002122local int near extra_lbits[LENGTH_CODES] /* extra bits for each length code */
2123 = { 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4,
2124 4, 4, 5, 5, 5, 5, 0 };
Eric Andersencc8ed391999-10-05 16:24:54 +00002125
Erik Andersene49d5ec2000-02-08 19:58:47 +00002126local int near extra_dbits[D_CODES] /* extra bits for each distance code */
2127 = { 0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9,
2128 10, 10, 11, 11, 12, 12, 13, 13 };
Eric Andersencc8ed391999-10-05 16:24:54 +00002129
Erik Andersene49d5ec2000-02-08 19:58:47 +00002130local int near extra_blbits[BL_CODES] /* extra bits for each bit length code */
2131= { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3, 7 };
Eric Andersencc8ed391999-10-05 16:24:54 +00002132
2133#define STORED_BLOCK 0
2134#define STATIC_TREES 1
2135#define DYN_TREES 2
2136/* The three kinds of block type */
2137
2138#ifndef LIT_BUFSIZE
2139# ifdef SMALL_MEM
2140# define LIT_BUFSIZE 0x2000
2141# else
2142# ifdef MEDIUM_MEM
2143# define LIT_BUFSIZE 0x4000
2144# else
2145# define LIT_BUFSIZE 0x8000
2146# endif
2147# endif
2148#endif
2149#ifndef DIST_BUFSIZE
2150# define DIST_BUFSIZE LIT_BUFSIZE
2151#endif
2152/* Sizes of match buffers for literals/lengths and distances. There are
2153 * 4 reasons for limiting LIT_BUFSIZE to 64K:
2154 * - frequencies can be kept in 16 bit counters
2155 * - if compression is not successful for the first block, all input data is
2156 * still in the window so we can still emit a stored block even when input
2157 * comes from standard input. (This can also be done for all blocks if
2158 * LIT_BUFSIZE is not greater than 32K.)
2159 * - if compression is not successful for a file smaller than 64K, we can
2160 * even emit a stored file instead of a stored block (saving 5 bytes).
2161 * - creating new Huffman trees less frequently may not provide fast
2162 * adaptation to changes in the input data statistics. (Take for
2163 * example a binary file with poorly compressible code followed by
2164 * a highly compressible string table.) Smaller buffer sizes give
2165 * fast adaptation but have of course the overhead of transmitting trees
2166 * more frequently.
2167 * - I can't count above 4
2168 * The current code is general and allows DIST_BUFSIZE < LIT_BUFSIZE (to save
2169 * memory at the expense of compression). Some optimizations would be possible
2170 * if we rely on DIST_BUFSIZE == LIT_BUFSIZE.
2171 */
2172#if LIT_BUFSIZE > INBUFSIZ
Erik Andersene49d5ec2000-02-08 19:58:47 +00002173error cannot overlay l_buf and inbuf
Eric Andersencc8ed391999-10-05 16:24:54 +00002174#endif
Eric Andersencc8ed391999-10-05 16:24:54 +00002175#define REP_3_6 16
2176/* repeat previous bit length 3-6 times (2 bits of repeat count) */
Eric Andersencc8ed391999-10-05 16:24:54 +00002177#define REPZ_3_10 17
2178/* repeat a zero length 3-10 times (3 bits of repeat count) */
Eric Andersencc8ed391999-10-05 16:24:54 +00002179#define REPZ_11_138 18
Erik Andersene49d5ec2000-02-08 19:58:47 +00002180/* repeat a zero length 11-138 times (7 bits of repeat count) *//* ===========================================================================
Eric Andersencc8ed391999-10-05 16:24:54 +00002181 * Local data
Erik Andersene49d5ec2000-02-08 19:58:47 +00002182 *//* Data structure describing a single value and its code string. */ typedef struct ct_data {
2183 union {
2184 ush freq; /* frequency count */
2185 ush code; /* bit string */
2186 } fc;
2187 union {
2188 ush dad; /* father node in Huffman tree */
2189 ush len; /* length of bit string */
2190 } dl;
Eric Andersencc8ed391999-10-05 16:24:54 +00002191} ct_data;
2192
2193#define Freq fc.freq
2194#define Code fc.code
2195#define Dad dl.dad
2196#define Len dl.len
2197
2198#define HEAP_SIZE (2*L_CODES+1)
2199/* maximum heap size */
2200
Erik Andersene49d5ec2000-02-08 19:58:47 +00002201local ct_data near dyn_ltree[HEAP_SIZE]; /* literal and length tree */
2202local ct_data near dyn_dtree[2 * D_CODES + 1]; /* distance tree */
Eric Andersencc8ed391999-10-05 16:24:54 +00002203
Erik Andersene49d5ec2000-02-08 19:58:47 +00002204local ct_data near static_ltree[L_CODES + 2];
2205
Eric Andersencc8ed391999-10-05 16:24:54 +00002206/* The static literal tree. Since the bit lengths are imposed, there is no
2207 * need for the L_CODES extra codes used during heap construction. However
2208 * The codes 286 and 287 are needed to build a canonical tree (see ct_init
2209 * below).
2210 */
2211
2212local ct_data near static_dtree[D_CODES];
Erik Andersene49d5ec2000-02-08 19:58:47 +00002213
Eric Andersencc8ed391999-10-05 16:24:54 +00002214/* The static distance tree. (Actually a trivial tree since all codes use
2215 * 5 bits.)
2216 */
2217
Erik Andersene49d5ec2000-02-08 19:58:47 +00002218local ct_data near bl_tree[2 * BL_CODES + 1];
2219
Eric Andersencc8ed391999-10-05 16:24:54 +00002220/* Huffman tree for the bit lengths */
2221
2222typedef struct tree_desc {
Erik Andersene49d5ec2000-02-08 19:58:47 +00002223 ct_data near *dyn_tree; /* the dynamic tree */
2224 ct_data near *static_tree; /* corresponding static tree or NULL */
2225 int near *extra_bits; /* extra bits for each code or NULL */
2226 int extra_base; /* base index for extra_bits */
2227 int elems; /* max number of elements in the tree */
2228 int max_length; /* max bit length for the codes */
2229 int max_code; /* largest code with non zero frequency */
Eric Andersencc8ed391999-10-05 16:24:54 +00002230} tree_desc;
2231
2232local tree_desc near l_desc =
Erik Andersene49d5ec2000-02-08 19:58:47 +00002233 { dyn_ltree, static_ltree, extra_lbits, LITERALS + 1, L_CODES,
2234 MAX_BITS, 0 };
Eric Andersencc8ed391999-10-05 16:24:54 +00002235
2236local tree_desc near d_desc =
Erik Andersene49d5ec2000-02-08 19:58:47 +00002237 { dyn_dtree, static_dtree, extra_dbits, 0, D_CODES, MAX_BITS, 0 };
Eric Andersencc8ed391999-10-05 16:24:54 +00002238
2239local tree_desc near bl_desc =
Erik Andersene49d5ec2000-02-08 19:58:47 +00002240 { bl_tree, (ct_data near *) 0, extra_blbits, 0, BL_CODES, MAX_BL_BITS,
2241 0 };
Eric Andersencc8ed391999-10-05 16:24:54 +00002242
2243
Erik Andersene49d5ec2000-02-08 19:58:47 +00002244local ush near bl_count[MAX_BITS + 1];
2245
Eric Andersencc8ed391999-10-05 16:24:54 +00002246/* number of codes at each bit length for an optimal tree */
2247
2248local uch near bl_order[BL_CODES]
Erik Andersene49d5ec2000-02-08 19:58:47 +00002249= { 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 };
2250
Eric Andersencc8ed391999-10-05 16:24:54 +00002251/* The lengths of the bit length codes are sent in order of decreasing
2252 * probability, to avoid transmitting the lengths for unused bit length codes.
2253 */
2254
Erik Andersene49d5ec2000-02-08 19:58:47 +00002255local int near heap[2 * L_CODES + 1]; /* heap used to build the Huffman trees */
2256local int heap_len; /* number of elements in the heap */
2257local int heap_max; /* element of largest frequency */
2258
Eric Andersencc8ed391999-10-05 16:24:54 +00002259/* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.
2260 * The same heap array is used to build all trees.
2261 */
2262
Erik Andersene49d5ec2000-02-08 19:58:47 +00002263local uch near depth[2 * L_CODES + 1];
2264
Eric Andersencc8ed391999-10-05 16:24:54 +00002265/* Depth of each subtree used as tie breaker for trees of equal frequency */
2266
Erik Andersene49d5ec2000-02-08 19:58:47 +00002267local uch length_code[MAX_MATCH - MIN_MATCH + 1];
2268
Eric Andersencc8ed391999-10-05 16:24:54 +00002269/* length code for each normalized match length (0 == MIN_MATCH) */
2270
2271local uch dist_code[512];
Erik Andersene49d5ec2000-02-08 19:58:47 +00002272
Eric Andersencc8ed391999-10-05 16:24:54 +00002273/* distance codes. The first 256 values correspond to the distances
2274 * 3 .. 258, the last 256 values correspond to the top 8 bits of
2275 * the 15 bit distances.
2276 */
2277
2278local int near base_length[LENGTH_CODES];
Erik Andersene49d5ec2000-02-08 19:58:47 +00002279
Eric Andersencc8ed391999-10-05 16:24:54 +00002280/* First normalized length for each code (0 = MIN_MATCH) */
2281
2282local int near base_dist[D_CODES];
Erik Andersene49d5ec2000-02-08 19:58:47 +00002283
Eric Andersencc8ed391999-10-05 16:24:54 +00002284/* First normalized distance for each code (0 = distance of 1) */
2285
2286#define l_buf inbuf
2287/* DECLARE(uch, l_buf, LIT_BUFSIZE); buffer for literals or lengths */
2288
2289/* DECLARE(ush, d_buf, DIST_BUFSIZE); buffer for distances */
2290
Erik Andersene49d5ec2000-02-08 19:58:47 +00002291local uch near flag_buf[(LIT_BUFSIZE / 8)];
2292
Eric Andersencc8ed391999-10-05 16:24:54 +00002293/* flag_buf is a bit array distinguishing literals from lengths in
2294 * l_buf, thus indicating the presence or absence of a distance.
2295 */
2296
Erik Andersene49d5ec2000-02-08 19:58:47 +00002297local unsigned last_lit; /* running index in l_buf */
2298local unsigned last_dist; /* running index in d_buf */
2299local unsigned last_flags; /* running index in flag_buf */
2300local uch flags; /* current flags not yet saved in flag_buf */
2301local uch flag_bit; /* current bit used in flags */
2302
Eric Andersencc8ed391999-10-05 16:24:54 +00002303/* bits are filled in flags starting at bit 0 (least significant).
2304 * Note: these flags are overkill in the current code since we don't
2305 * take advantage of DIST_BUFSIZE == LIT_BUFSIZE.
2306 */
2307
Erik Andersene49d5ec2000-02-08 19:58:47 +00002308local ulg opt_len; /* bit length of current block with optimal trees */
2309local ulg static_len; /* bit length of current block with static trees */
Eric Andersencc8ed391999-10-05 16:24:54 +00002310
Erik Andersene49d5ec2000-02-08 19:58:47 +00002311local ulg compressed_len; /* total bit length of compressed file */
Eric Andersencc8ed391999-10-05 16:24:54 +00002312
Erik Andersene49d5ec2000-02-08 19:58:47 +00002313local ulg input_len; /* total byte length of input file */
2314
Eric Andersencc8ed391999-10-05 16:24:54 +00002315/* input_len is for debugging only since we can get it by other means. */
2316
Erik Andersene49d5ec2000-02-08 19:58:47 +00002317ush *file_type; /* pointer to UNKNOWN, BINARY or ASCII */
2318int *file_method; /* pointer to DEFLATE or STORE */
Eric Andersencc8ed391999-10-05 16:24:54 +00002319
2320#ifdef DEBUG
Erik Andersene49d5ec2000-02-08 19:58:47 +00002321extern ulg bits_sent; /* bit length of the compressed data */
2322extern long isize; /* byte length of input file */
Eric Andersencc8ed391999-10-05 16:24:54 +00002323#endif
2324
Erik Andersene49d5ec2000-02-08 19:58:47 +00002325extern long block_start; /* window offset of current block */
2326extern unsigned near strstart; /* window offset of current string */
Eric Andersencc8ed391999-10-05 16:24:54 +00002327
2328/* ===========================================================================
2329 * Local (static) routines in this file.
2330 */
2331
Erik Andersen61677fe2000-04-13 01:18:56 +00002332local void init_block (void);
2333local void pqdownheap (ct_data near * tree, int k);
2334local void gen_bitlen (tree_desc near * desc);
2335local void gen_codes (ct_data near * tree, int max_code);
2336local void build_tree (tree_desc near * desc);
2337local void scan_tree (ct_data near * tree, int max_code);
2338local void send_tree (ct_data near * tree, int max_code);
2339local int build_bl_tree (void);
2340local void send_all_trees (int lcodes, int dcodes, int blcodes);
2341local void compress_block (ct_data near * ltree, ct_data near * dtree);
2342local void set_file_type (void);
Eric Andersencc8ed391999-10-05 16:24:54 +00002343
2344
2345#ifndef DEBUG
2346# define send_code(c, tree) send_bits(tree[c].Code, tree[c].Len)
2347 /* Send a code of the given tree. c and tree must not have side effects */
2348
Erik Andersene49d5ec2000-02-08 19:58:47 +00002349#else /* DEBUG */
Eric Andersencc8ed391999-10-05 16:24:54 +00002350# define send_code(c, tree) \
2351 { if (verbose>1) fprintf(stderr,"\ncd %3d ",(c)); \
2352 send_bits(tree[c].Code, tree[c].Len); }
2353#endif
2354
2355#define d_code(dist) \
2356 ((dist) < 256 ? dist_code[dist] : dist_code[256+((dist)>>7)])
2357/* Mapping from a distance to a distance code. dist is the distance - 1 and
2358 * must not have side effects. dist_code[256] and dist_code[257] are never
2359 * used.
2360 */
2361
Eric Andersencc8ed391999-10-05 16:24:54 +00002362/* the arguments must not have side effects */
2363
2364/* ===========================================================================
2365 * Allocate the match buffer, initialize the various tables and save the
2366 * location of the internal file attribute (ascii/binary) and method
2367 * (DEFLATE/STORE).
2368 */
2369void ct_init(attr, methodp)
Erik Andersene49d5ec2000-02-08 19:58:47 +00002370ush *attr; /* pointer to internal file attribute */
2371int *methodp; /* pointer to compression method */
Eric Andersencc8ed391999-10-05 16:24:54 +00002372{
Erik Andersene49d5ec2000-02-08 19:58:47 +00002373 int n; /* iterates over tree elements */
2374 int bits; /* bit counter */
2375 int length; /* length value */
2376 int code; /* code value */
2377 int dist; /* distance index */
Eric Andersencc8ed391999-10-05 16:24:54 +00002378
Erik Andersene49d5ec2000-02-08 19:58:47 +00002379 file_type = attr;
2380 file_method = methodp;
2381 compressed_len = input_len = 0L;
Eric Andersencc8ed391999-10-05 16:24:54 +00002382
Erik Andersene49d5ec2000-02-08 19:58:47 +00002383 if (static_dtree[0].Len != 0)
2384 return; /* ct_init already called */
Eric Andersencc8ed391999-10-05 16:24:54 +00002385
Erik Andersene49d5ec2000-02-08 19:58:47 +00002386 /* Initialize the mapping length (0..255) -> length code (0..28) */
2387 length = 0;
2388 for (code = 0; code < LENGTH_CODES - 1; code++) {
2389 base_length[code] = length;
2390 for (n = 0; n < (1 << extra_lbits[code]); n++) {
2391 length_code[length++] = (uch) code;
2392 }
2393 }
2394 Assert(length == 256, "ct_init: length != 256");
2395 /* Note that the length 255 (match length 258) can be represented
2396 * in two different ways: code 284 + 5 bits or code 285, so we
2397 * overwrite length_code[255] to use the best encoding:
2398 */
2399 length_code[length - 1] = (uch) code;
Eric Andersencc8ed391999-10-05 16:24:54 +00002400
Erik Andersene49d5ec2000-02-08 19:58:47 +00002401 /* Initialize the mapping dist (0..32K) -> dist code (0..29) */
2402 dist = 0;
2403 for (code = 0; code < 16; code++) {
2404 base_dist[code] = dist;
2405 for (n = 0; n < (1 << extra_dbits[code]); n++) {
2406 dist_code[dist++] = (uch) code;
2407 }
2408 }
2409 Assert(dist == 256, "ct_init: dist != 256");
2410 dist >>= 7; /* from now on, all distances are divided by 128 */
2411 for (; code < D_CODES; code++) {
2412 base_dist[code] = dist << 7;
2413 for (n = 0; n < (1 << (extra_dbits[code] - 7)); n++) {
2414 dist_code[256 + dist++] = (uch) code;
2415 }
2416 }
2417 Assert(dist == 256, "ct_init: 256+dist != 512");
Eric Andersencc8ed391999-10-05 16:24:54 +00002418
Erik Andersene49d5ec2000-02-08 19:58:47 +00002419 /* Construct the codes of the static literal tree */
2420 for (bits = 0; bits <= MAX_BITS; bits++)
2421 bl_count[bits] = 0;
2422 n = 0;
2423 while (n <= 143)
2424 static_ltree[n++].Len = 8, bl_count[8]++;
2425 while (n <= 255)
2426 static_ltree[n++].Len = 9, bl_count[9]++;
2427 while (n <= 279)
2428 static_ltree[n++].Len = 7, bl_count[7]++;
2429 while (n <= 287)
2430 static_ltree[n++].Len = 8, bl_count[8]++;
2431 /* Codes 286 and 287 do not exist, but we must include them in the
2432 * tree construction to get a canonical Huffman tree (longest code
2433 * all ones)
2434 */
2435 gen_codes((ct_data near *) static_ltree, L_CODES + 1);
Eric Andersencc8ed391999-10-05 16:24:54 +00002436
Erik Andersene49d5ec2000-02-08 19:58:47 +00002437 /* The static distance tree is trivial: */
2438 for (n = 0; n < D_CODES; n++) {
2439 static_dtree[n].Len = 5;
2440 static_dtree[n].Code = bi_reverse(n, 5);
2441 }
2442
2443 /* Initialize the first block of the first file: */
2444 init_block();
Eric Andersencc8ed391999-10-05 16:24:54 +00002445}
2446
2447/* ===========================================================================
2448 * Initialize a new block.
2449 */
2450local void init_block()
2451{
Erik Andersene49d5ec2000-02-08 19:58:47 +00002452 int n; /* iterates over tree elements */
Eric Andersencc8ed391999-10-05 16:24:54 +00002453
Erik Andersene49d5ec2000-02-08 19:58:47 +00002454 /* Initialize the trees. */
2455 for (n = 0; n < L_CODES; n++)
2456 dyn_ltree[n].Freq = 0;
2457 for (n = 0; n < D_CODES; n++)
2458 dyn_dtree[n].Freq = 0;
2459 for (n = 0; n < BL_CODES; n++)
2460 bl_tree[n].Freq = 0;
Eric Andersencc8ed391999-10-05 16:24:54 +00002461
Erik Andersene49d5ec2000-02-08 19:58:47 +00002462 dyn_ltree[END_BLOCK].Freq = 1;
2463 opt_len = static_len = 0L;
2464 last_lit = last_dist = last_flags = 0;
2465 flags = 0;
2466 flag_bit = 1;
Eric Andersencc8ed391999-10-05 16:24:54 +00002467}
2468
2469#define SMALLEST 1
2470/* Index within the heap array of least frequent node in the Huffman tree */
2471
2472
2473/* ===========================================================================
2474 * Remove the smallest element from the heap and recreate the heap with
2475 * one less element. Updates heap and heap_len.
2476 */
2477#define pqremove(tree, top) \
2478{\
2479 top = heap[SMALLEST]; \
2480 heap[SMALLEST] = heap[heap_len--]; \
2481 pqdownheap(tree, SMALLEST); \
2482}
2483
2484/* ===========================================================================
2485 * Compares to subtrees, using the tree depth as tie breaker when
2486 * the subtrees have equal frequency. This minimizes the worst case length.
2487 */
2488#define smaller(tree, n, m) \
2489 (tree[n].Freq < tree[m].Freq || \
2490 (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
2491
2492/* ===========================================================================
2493 * Restore the heap property by moving down the tree starting at node k,
2494 * exchanging a node with the smallest of its two sons if necessary, stopping
2495 * when the heap property is re-established (each father smaller than its
2496 * two sons).
2497 */
2498local void pqdownheap(tree, k)
Erik Andersene49d5ec2000-02-08 19:58:47 +00002499ct_data near *tree; /* the tree to restore */
2500int k; /* node to move down */
Eric Andersencc8ed391999-10-05 16:24:54 +00002501{
Erik Andersene49d5ec2000-02-08 19:58:47 +00002502 int v = heap[k];
2503 int j = k << 1; /* left son of k */
Eric Andersencc8ed391999-10-05 16:24:54 +00002504
Erik Andersene49d5ec2000-02-08 19:58:47 +00002505 while (j <= heap_len) {
2506 /* Set j to the smallest of the two sons: */
2507 if (j < heap_len && smaller(tree, heap[j + 1], heap[j]))
2508 j++;
Eric Andersencc8ed391999-10-05 16:24:54 +00002509
Erik Andersene49d5ec2000-02-08 19:58:47 +00002510 /* Exit if v is smaller than both sons */
2511 if (smaller(tree, v, heap[j]))
2512 break;
Eric Andersencc8ed391999-10-05 16:24:54 +00002513
Erik Andersene49d5ec2000-02-08 19:58:47 +00002514 /* Exchange v with the smallest son */
2515 heap[k] = heap[j];
2516 k = j;
2517
2518 /* And continue down the tree, setting j to the left son of k */
2519 j <<= 1;
2520 }
2521 heap[k] = v;
Eric Andersencc8ed391999-10-05 16:24:54 +00002522}
2523
2524/* ===========================================================================
2525 * Compute the optimal bit lengths for a tree and update the total bit length
2526 * for the current block.
2527 * IN assertion: the fields freq and dad are set, heap[heap_max] and
2528 * above are the tree nodes sorted by increasing frequency.
2529 * OUT assertions: the field len is set to the optimal bit length, the
2530 * array bl_count contains the frequencies for each bit length.
2531 * The length opt_len is updated; static_len is also updated if stree is
2532 * not null.
2533 */
2534local void gen_bitlen(desc)
Erik Andersene49d5ec2000-02-08 19:58:47 +00002535tree_desc near *desc; /* the tree descriptor */
Eric Andersencc8ed391999-10-05 16:24:54 +00002536{
Erik Andersene49d5ec2000-02-08 19:58:47 +00002537 ct_data near *tree = desc->dyn_tree;
2538 int near *extra = desc->extra_bits;
2539 int base = desc->extra_base;
2540 int max_code = desc->max_code;
2541 int max_length = desc->max_length;
2542 ct_data near *stree = desc->static_tree;
2543 int h; /* heap index */
2544 int n, m; /* iterate over the tree elements */
2545 int bits; /* bit length */
2546 int xbits; /* extra bits */
2547 ush f; /* frequency */
2548 int overflow = 0; /* number of elements with bit length too large */
Eric Andersencc8ed391999-10-05 16:24:54 +00002549
Erik Andersene49d5ec2000-02-08 19:58:47 +00002550 for (bits = 0; bits <= MAX_BITS; bits++)
2551 bl_count[bits] = 0;
Eric Andersencc8ed391999-10-05 16:24:54 +00002552
Erik Andersene49d5ec2000-02-08 19:58:47 +00002553 /* In a first pass, compute the optimal bit lengths (which may
2554 * overflow in the case of the bit length tree).
2555 */
2556 tree[heap[heap_max]].Len = 0; /* root of the heap */
Eric Andersencc8ed391999-10-05 16:24:54 +00002557
Erik Andersene49d5ec2000-02-08 19:58:47 +00002558 for (h = heap_max + 1; h < HEAP_SIZE; h++) {
2559 n = heap[h];
2560 bits = tree[tree[n].Dad].Len + 1;
2561 if (bits > max_length)
2562 bits = max_length, overflow++;
2563 tree[n].Len = (ush) bits;
2564 /* We overwrite tree[n].Dad which is no longer needed */
Eric Andersencc8ed391999-10-05 16:24:54 +00002565
Erik Andersene49d5ec2000-02-08 19:58:47 +00002566 if (n > max_code)
2567 continue; /* not a leaf node */
Eric Andersencc8ed391999-10-05 16:24:54 +00002568
Erik Andersene49d5ec2000-02-08 19:58:47 +00002569 bl_count[bits]++;
2570 xbits = 0;
2571 if (n >= base)
2572 xbits = extra[n - base];
2573 f = tree[n].Freq;
2574 opt_len += (ulg) f *(bits + xbits);
Eric Andersencc8ed391999-10-05 16:24:54 +00002575
Erik Andersene49d5ec2000-02-08 19:58:47 +00002576 if (stree)
2577 static_len += (ulg) f *(stree[n].Len + xbits);
2578 }
2579 if (overflow == 0)
2580 return;
Eric Andersencc8ed391999-10-05 16:24:54 +00002581
Erik Andersene49d5ec2000-02-08 19:58:47 +00002582 Trace((stderr, "\nbit length overflow\n"));
2583 /* This happens for example on obj2 and pic of the Calgary corpus */
Eric Andersencc8ed391999-10-05 16:24:54 +00002584
Erik Andersene49d5ec2000-02-08 19:58:47 +00002585 /* Find the first bit length which could increase: */
2586 do {
2587 bits = max_length - 1;
2588 while (bl_count[bits] == 0)
2589 bits--;
2590 bl_count[bits]--; /* move one leaf down the tree */
2591 bl_count[bits + 1] += 2; /* move one overflow item as its brother */
2592 bl_count[max_length]--;
2593 /* The brother of the overflow item also moves one step up,
2594 * but this does not affect bl_count[max_length]
2595 */
2596 overflow -= 2;
2597 } while (overflow > 0);
2598
2599 /* Now recompute all bit lengths, scanning in increasing frequency.
2600 * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all
2601 * lengths instead of fixing only the wrong ones. This idea is taken
2602 * from 'ar' written by Haruhiko Okumura.)
2603 */
2604 for (bits = max_length; bits != 0; bits--) {
2605 n = bl_count[bits];
2606 while (n != 0) {
2607 m = heap[--h];
2608 if (m > max_code)
2609 continue;
2610 if (tree[m].Len != (unsigned) bits) {
2611 Trace(
2612 (stderr, "code %d bits %d->%d\n", m, tree[m].Len,
2613 bits));
2614 opt_len +=
2615 ((long) bits -
2616 (long) tree[m].Len) * (long) tree[m].Freq;
2617 tree[m].Len = (ush) bits;
2618 }
2619 n--;
2620 }
2621 }
Eric Andersencc8ed391999-10-05 16:24:54 +00002622}
2623
2624/* ===========================================================================
2625 * Generate the codes for a given tree and bit counts (which need not be
2626 * optimal).
2627 * IN assertion: the array bl_count contains the bit length statistics for
2628 * the given tree and the field len is set for all tree elements.
2629 * OUT assertion: the field code is set for all tree elements of non
2630 * zero code length.
2631 */
Erik Andersene49d5ec2000-02-08 19:58:47 +00002632local void gen_codes(tree, max_code)
2633ct_data near *tree; /* the tree to decorate */
2634int max_code; /* largest code with non zero frequency */
Eric Andersencc8ed391999-10-05 16:24:54 +00002635{
Erik Andersene49d5ec2000-02-08 19:58:47 +00002636 ush next_code[MAX_BITS + 1]; /* next code value for each bit length */
2637 ush code = 0; /* running code value */
2638 int bits; /* bit index */
2639 int n; /* code index */
Eric Andersencc8ed391999-10-05 16:24:54 +00002640
Erik Andersene49d5ec2000-02-08 19:58:47 +00002641 /* The distribution counts are first used to generate the code values
2642 * without bit reversal.
2643 */
2644 for (bits = 1; bits <= MAX_BITS; bits++) {
2645 next_code[bits] = code = (code + bl_count[bits - 1]) << 1;
2646 }
2647 /* Check that the bit counts in bl_count are consistent. The last code
2648 * must be all ones.
2649 */
2650 Assert(code + bl_count[MAX_BITS] - 1 == (1 << MAX_BITS) - 1,
2651 "inconsistent bit counts");
2652 Tracev((stderr, "\ngen_codes: max_code %d ", max_code));
Eric Andersencc8ed391999-10-05 16:24:54 +00002653
Erik Andersene49d5ec2000-02-08 19:58:47 +00002654 for (n = 0; n <= max_code; n++) {
2655 int len = tree[n].Len;
Eric Andersencc8ed391999-10-05 16:24:54 +00002656
Erik Andersene49d5ec2000-02-08 19:58:47 +00002657 if (len == 0)
2658 continue;
2659 /* Now reverse the bits */
2660 tree[n].Code = bi_reverse(next_code[len]++, len);
2661
2662 Tracec(tree != static_ltree,
2663 (stderr, "\nn %3d %c l %2d c %4x (%x) ", n,
2664 (isgraph(n) ? n : ' '), len, tree[n].Code,
2665 next_code[len] - 1));
2666 }
Eric Andersencc8ed391999-10-05 16:24:54 +00002667}
2668
2669/* ===========================================================================
2670 * Construct one Huffman tree and assigns the code bit strings and lengths.
2671 * Update the total bit length for the current block.
2672 * IN assertion: the field freq is set for all tree elements.
2673 * OUT assertions: the fields len and code are set to the optimal bit length
2674 * and corresponding code. The length opt_len is updated; static_len is
2675 * also updated if stree is not null. The field max_code is set.
2676 */
2677local void build_tree(desc)
Erik Andersene49d5ec2000-02-08 19:58:47 +00002678tree_desc near *desc; /* the tree descriptor */
Eric Andersencc8ed391999-10-05 16:24:54 +00002679{
Erik Andersene49d5ec2000-02-08 19:58:47 +00002680 ct_data near *tree = desc->dyn_tree;
2681 ct_data near *stree = desc->static_tree;
2682 int elems = desc->elems;
2683 int n, m; /* iterate over heap elements */
2684 int max_code = -1; /* largest code with non zero frequency */
2685 int node = elems; /* next internal node of the tree */
Eric Andersencc8ed391999-10-05 16:24:54 +00002686
Erik Andersene49d5ec2000-02-08 19:58:47 +00002687 /* Construct the initial heap, with least frequent element in
2688 * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].
2689 * heap[0] is not used.
2690 */
2691 heap_len = 0, heap_max = HEAP_SIZE;
Eric Andersencc8ed391999-10-05 16:24:54 +00002692
Erik Andersene49d5ec2000-02-08 19:58:47 +00002693 for (n = 0; n < elems; n++) {
2694 if (tree[n].Freq != 0) {
2695 heap[++heap_len] = max_code = n;
2696 depth[n] = 0;
2697 } else {
2698 tree[n].Len = 0;
2699 }
2700 }
Eric Andersencc8ed391999-10-05 16:24:54 +00002701
Erik Andersene49d5ec2000-02-08 19:58:47 +00002702 /* The pkzip format requires that at least one distance code exists,
2703 * and that at least one bit should be sent even if there is only one
2704 * possible code. So to avoid special checks later on we force at least
2705 * two codes of non zero frequency.
2706 */
2707 while (heap_len < 2) {
2708 int new = heap[++heap_len] = (max_code < 2 ? ++max_code : 0);
Eric Andersencc8ed391999-10-05 16:24:54 +00002709
Erik Andersene49d5ec2000-02-08 19:58:47 +00002710 tree[new].Freq = 1;
2711 depth[new] = 0;
2712 opt_len--;
2713 if (stree)
2714 static_len -= stree[new].Len;
2715 /* new is 0 or 1 so it does not have extra bits */
2716 }
2717 desc->max_code = max_code;
Eric Andersencc8ed391999-10-05 16:24:54 +00002718
Erik Andersene49d5ec2000-02-08 19:58:47 +00002719 /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree,
2720 * establish sub-heaps of increasing lengths:
2721 */
2722 for (n = heap_len / 2; n >= 1; n--)
2723 pqdownheap(tree, n);
Eric Andersencc8ed391999-10-05 16:24:54 +00002724
Erik Andersene49d5ec2000-02-08 19:58:47 +00002725 /* Construct the Huffman tree by repeatedly combining the least two
2726 * frequent nodes.
2727 */
2728 do {
2729 pqremove(tree, n); /* n = node of least frequency */
2730 m = heap[SMALLEST]; /* m = node of next least frequency */
Eric Andersencc8ed391999-10-05 16:24:54 +00002731
Erik Andersene49d5ec2000-02-08 19:58:47 +00002732 heap[--heap_max] = n; /* keep the nodes sorted by frequency */
2733 heap[--heap_max] = m;
2734
2735 /* Create a new node father of n and m */
2736 tree[node].Freq = tree[n].Freq + tree[m].Freq;
2737 depth[node] = (uch) (MAX(depth[n], depth[m]) + 1);
2738 tree[n].Dad = tree[m].Dad = (ush) node;
Eric Andersencc8ed391999-10-05 16:24:54 +00002739#ifdef DUMP_BL_TREE
Erik Andersene49d5ec2000-02-08 19:58:47 +00002740 if (tree == bl_tree) {
2741 fprintf(stderr, "\nnode %d(%d), sons %d(%d) %d(%d)",
2742 node, tree[node].Freq, n, tree[n].Freq, m,
2743 tree[m].Freq);
2744 }
Eric Andersencc8ed391999-10-05 16:24:54 +00002745#endif
Erik Andersene49d5ec2000-02-08 19:58:47 +00002746 /* and insert the new node in the heap */
2747 heap[SMALLEST] = node++;
2748 pqdownheap(tree, SMALLEST);
Eric Andersencc8ed391999-10-05 16:24:54 +00002749
Erik Andersene49d5ec2000-02-08 19:58:47 +00002750 } while (heap_len >= 2);
Eric Andersencc8ed391999-10-05 16:24:54 +00002751
Erik Andersene49d5ec2000-02-08 19:58:47 +00002752 heap[--heap_max] = heap[SMALLEST];
Eric Andersencc8ed391999-10-05 16:24:54 +00002753
Erik Andersene49d5ec2000-02-08 19:58:47 +00002754 /* At this point, the fields freq and dad are set. We can now
2755 * generate the bit lengths.
2756 */
2757 gen_bitlen((tree_desc near *) desc);
Eric Andersencc8ed391999-10-05 16:24:54 +00002758
Erik Andersene49d5ec2000-02-08 19:58:47 +00002759 /* The field len is now set, we can generate the bit codes */
2760 gen_codes((ct_data near *) tree, max_code);
Eric Andersencc8ed391999-10-05 16:24:54 +00002761}
2762
2763/* ===========================================================================
2764 * Scan a literal or distance tree to determine the frequencies of the codes
2765 * in the bit length tree. Updates opt_len to take into account the repeat
2766 * counts. (The contribution of the bit length codes will be added later
2767 * during the construction of bl_tree.)
2768 */
Erik Andersene49d5ec2000-02-08 19:58:47 +00002769local void scan_tree(tree, max_code)
2770ct_data near *tree; /* the tree to be scanned */
2771int max_code; /* and its largest code of non zero frequency */
Eric Andersencc8ed391999-10-05 16:24:54 +00002772{
Erik Andersene49d5ec2000-02-08 19:58:47 +00002773 int n; /* iterates over all tree elements */
2774 int prevlen = -1; /* last emitted length */
2775 int curlen; /* length of current code */
2776 int nextlen = tree[0].Len; /* length of next code */
2777 int count = 0; /* repeat count of the current code */
2778 int max_count = 7; /* max repeat count */
2779 int min_count = 4; /* min repeat count */
Eric Andersencc8ed391999-10-05 16:24:54 +00002780
Erik Andersene49d5ec2000-02-08 19:58:47 +00002781 if (nextlen == 0)
2782 max_count = 138, min_count = 3;
2783 tree[max_code + 1].Len = (ush) 0xffff; /* guard */
Eric Andersencc8ed391999-10-05 16:24:54 +00002784
Erik Andersene49d5ec2000-02-08 19:58:47 +00002785 for (n = 0; n <= max_code; n++) {
2786 curlen = nextlen;
2787 nextlen = tree[n + 1].Len;
2788 if (++count < max_count && curlen == nextlen) {
2789 continue;
2790 } else if (count < min_count) {
2791 bl_tree[curlen].Freq += count;
2792 } else if (curlen != 0) {
2793 if (curlen != prevlen)
2794 bl_tree[curlen].Freq++;
2795 bl_tree[REP_3_6].Freq++;
2796 } else if (count <= 10) {
2797 bl_tree[REPZ_3_10].Freq++;
2798 } else {
2799 bl_tree[REPZ_11_138].Freq++;
2800 }
2801 count = 0;
2802 prevlen = curlen;
2803 if (nextlen == 0) {
2804 max_count = 138, min_count = 3;
2805 } else if (curlen == nextlen) {
2806 max_count = 6, min_count = 3;
2807 } else {
2808 max_count = 7, min_count = 4;
2809 }
2810 }
Eric Andersencc8ed391999-10-05 16:24:54 +00002811}
2812
2813/* ===========================================================================
2814 * Send a literal or distance tree in compressed form, using the codes in
2815 * bl_tree.
2816 */
Erik Andersene49d5ec2000-02-08 19:58:47 +00002817local void send_tree(tree, max_code)
2818ct_data near *tree; /* the tree to be scanned */
2819int max_code; /* and its largest code of non zero frequency */
Eric Andersencc8ed391999-10-05 16:24:54 +00002820{
Erik Andersene49d5ec2000-02-08 19:58:47 +00002821 int n; /* iterates over all tree elements */
2822 int prevlen = -1; /* last emitted length */
2823 int curlen; /* length of current code */
2824 int nextlen = tree[0].Len; /* length of next code */
2825 int count = 0; /* repeat count of the current code */
2826 int max_count = 7; /* max repeat count */
2827 int min_count = 4; /* min repeat count */
Eric Andersencc8ed391999-10-05 16:24:54 +00002828
Erik Andersene49d5ec2000-02-08 19:58:47 +00002829/* tree[max_code+1].Len = -1; *//* guard already set */
2830 if (nextlen == 0)
2831 max_count = 138, min_count = 3;
Eric Andersencc8ed391999-10-05 16:24:54 +00002832
Erik Andersene49d5ec2000-02-08 19:58:47 +00002833 for (n = 0; n <= max_code; n++) {
2834 curlen = nextlen;
2835 nextlen = tree[n + 1].Len;
2836 if (++count < max_count && curlen == nextlen) {
2837 continue;
2838 } else if (count < min_count) {
2839 do {
2840 send_code(curlen, bl_tree);
2841 } while (--count != 0);
Eric Andersencc8ed391999-10-05 16:24:54 +00002842
Erik Andersene49d5ec2000-02-08 19:58:47 +00002843 } else if (curlen != 0) {
2844 if (curlen != prevlen) {
2845 send_code(curlen, bl_tree);
2846 count--;
2847 }
2848 Assert(count >= 3 && count <= 6, " 3_6?");
2849 send_code(REP_3_6, bl_tree);
2850 send_bits(count - 3, 2);
Eric Andersencc8ed391999-10-05 16:24:54 +00002851
Erik Andersene49d5ec2000-02-08 19:58:47 +00002852 } else if (count <= 10) {
2853 send_code(REPZ_3_10, bl_tree);
2854 send_bits(count - 3, 3);
Eric Andersencc8ed391999-10-05 16:24:54 +00002855
Erik Andersene49d5ec2000-02-08 19:58:47 +00002856 } else {
2857 send_code(REPZ_11_138, bl_tree);
2858 send_bits(count - 11, 7);
2859 }
2860 count = 0;
2861 prevlen = curlen;
2862 if (nextlen == 0) {
2863 max_count = 138, min_count = 3;
2864 } else if (curlen == nextlen) {
2865 max_count = 6, min_count = 3;
2866 } else {
2867 max_count = 7, min_count = 4;
2868 }
2869 }
Eric Andersencc8ed391999-10-05 16:24:54 +00002870}
2871
2872/* ===========================================================================
2873 * Construct the Huffman tree for the bit lengths and return the index in
2874 * bl_order of the last bit length code to send.
2875 */
2876local int build_bl_tree()
2877{
Erik Andersene49d5ec2000-02-08 19:58:47 +00002878 int max_blindex; /* index of last bit length code of non zero freq */
Eric Andersencc8ed391999-10-05 16:24:54 +00002879
Erik Andersene49d5ec2000-02-08 19:58:47 +00002880 /* Determine the bit length frequencies for literal and distance trees */
2881 scan_tree((ct_data near *) dyn_ltree, l_desc.max_code);
2882 scan_tree((ct_data near *) dyn_dtree, d_desc.max_code);
Eric Andersencc8ed391999-10-05 16:24:54 +00002883
Erik Andersene49d5ec2000-02-08 19:58:47 +00002884 /* Build the bit length tree: */
2885 build_tree((tree_desc near *) (&bl_desc));
2886 /* opt_len now includes the length of the tree representations, except
2887 * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.
2888 */
Eric Andersencc8ed391999-10-05 16:24:54 +00002889
Erik Andersene49d5ec2000-02-08 19:58:47 +00002890 /* Determine the number of bit length codes to send. The pkzip format
2891 * requires that at least 4 bit length codes be sent. (appnote.txt says
2892 * 3 but the actual value used is 4.)
2893 */
2894 for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {
2895 if (bl_tree[bl_order[max_blindex]].Len != 0)
2896 break;
2897 }
2898 /* Update opt_len to include the bit length tree and counts */
2899 opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;
2900 Tracev(
2901 (stderr, "\ndyn trees: dyn %ld, stat %ld", opt_len,
2902 static_len));
Eric Andersencc8ed391999-10-05 16:24:54 +00002903
Erik Andersene49d5ec2000-02-08 19:58:47 +00002904 return max_blindex;
Eric Andersencc8ed391999-10-05 16:24:54 +00002905}
2906
2907/* ===========================================================================
2908 * Send the header for a block using dynamic Huffman trees: the counts, the
2909 * lengths of the bit length codes, the literal tree and the distance tree.
2910 * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4.
2911 */
2912local void send_all_trees(lcodes, dcodes, blcodes)
Erik Andersene49d5ec2000-02-08 19:58:47 +00002913int lcodes, dcodes, blcodes; /* number of codes for each tree */
Eric Andersencc8ed391999-10-05 16:24:54 +00002914{
Erik Andersene49d5ec2000-02-08 19:58:47 +00002915 int rank; /* index in bl_order */
Eric Andersencc8ed391999-10-05 16:24:54 +00002916
Erik Andersene49d5ec2000-02-08 19:58:47 +00002917 Assert(lcodes >= 257 && dcodes >= 1
2918 && blcodes >= 4, "not enough codes");
2919 Assert(lcodes <= L_CODES && dcodes <= D_CODES
2920 && blcodes <= BL_CODES, "too many codes");
2921 Tracev((stderr, "\nbl counts: "));
2922 send_bits(lcodes - 257, 5); /* not +255 as stated in appnote.txt */
2923 send_bits(dcodes - 1, 5);
2924 send_bits(blcodes - 4, 4); /* not -3 as stated in appnote.txt */
2925 for (rank = 0; rank < blcodes; rank++) {
2926 Tracev((stderr, "\nbl code %2d ", bl_order[rank]));
2927 send_bits(bl_tree[bl_order[rank]].Len, 3);
2928 }
2929 Tracev((stderr, "\nbl tree: sent %ld", bits_sent));
Eric Andersencc8ed391999-10-05 16:24:54 +00002930
Erik Andersene49d5ec2000-02-08 19:58:47 +00002931 send_tree((ct_data near *) dyn_ltree, lcodes - 1); /* send the literal tree */
2932 Tracev((stderr, "\nlit tree: sent %ld", bits_sent));
Eric Andersencc8ed391999-10-05 16:24:54 +00002933
Erik Andersene49d5ec2000-02-08 19:58:47 +00002934 send_tree((ct_data near *) dyn_dtree, dcodes - 1); /* send the distance tree */
2935 Tracev((stderr, "\ndist tree: sent %ld", bits_sent));
Eric Andersencc8ed391999-10-05 16:24:54 +00002936}
2937
2938/* ===========================================================================
2939 * Determine the best encoding for the current block: dynamic trees, static
2940 * trees or store, and output the encoded block to the zip file. This function
2941 * returns the total compressed length for the file so far.
2942 */
2943ulg flush_block(buf, stored_len, eof)
Erik Andersene49d5ec2000-02-08 19:58:47 +00002944char *buf; /* input block, or NULL if too old */
2945ulg stored_len; /* length of input block */
2946int eof; /* true if this is the last block for a file */
Eric Andersencc8ed391999-10-05 16:24:54 +00002947{
Erik Andersene49d5ec2000-02-08 19:58:47 +00002948 ulg opt_lenb, static_lenb; /* opt_len and static_len in bytes */
2949 int max_blindex; /* index of last bit length code of non zero freq */
Eric Andersencc8ed391999-10-05 16:24:54 +00002950
Erik Andersene49d5ec2000-02-08 19:58:47 +00002951 flag_buf[last_flags] = flags; /* Save the flags for the last 8 items */
Eric Andersencc8ed391999-10-05 16:24:54 +00002952
Erik Andersene49d5ec2000-02-08 19:58:47 +00002953 /* Check if the file is ascii or binary */
2954 if (*file_type == (ush) UNKNOWN)
2955 set_file_type();
Eric Andersencc8ed391999-10-05 16:24:54 +00002956
Erik Andersene49d5ec2000-02-08 19:58:47 +00002957 /* Construct the literal and distance trees */
2958 build_tree((tree_desc near *) (&l_desc));
2959 Tracev((stderr, "\nlit data: dyn %ld, stat %ld", opt_len, static_len));
Eric Andersencc8ed391999-10-05 16:24:54 +00002960
Erik Andersene49d5ec2000-02-08 19:58:47 +00002961 build_tree((tree_desc near *) (&d_desc));
2962 Tracev(
2963 (stderr, "\ndist data: dyn %ld, stat %ld", opt_len,
2964 static_len));
2965 /* At this point, opt_len and static_len are the total bit lengths of
2966 * the compressed block data, excluding the tree representations.
2967 */
Eric Andersencc8ed391999-10-05 16:24:54 +00002968
Erik Andersene49d5ec2000-02-08 19:58:47 +00002969 /* Build the bit length tree for the above two trees, and get the index
2970 * in bl_order of the last bit length code to send.
2971 */
2972 max_blindex = build_bl_tree();
Eric Andersencc8ed391999-10-05 16:24:54 +00002973
Erik Andersene49d5ec2000-02-08 19:58:47 +00002974 /* Determine the best encoding. Compute first the block length in bytes */
2975 opt_lenb = (opt_len + 3 + 7) >> 3;
2976 static_lenb = (static_len + 3 + 7) >> 3;
2977 input_len += stored_len; /* for debugging only */
Eric Andersencc8ed391999-10-05 16:24:54 +00002978
Erik Andersene49d5ec2000-02-08 19:58:47 +00002979 Trace(
2980 (stderr,
2981 "\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u dist %u ",
2982 opt_lenb, opt_len, static_lenb, static_len, stored_len,
2983 last_lit, last_dist));
Eric Andersencc8ed391999-10-05 16:24:54 +00002984
Erik Andersene49d5ec2000-02-08 19:58:47 +00002985 if (static_lenb <= opt_lenb)
2986 opt_lenb = static_lenb;
Eric Andersencc8ed391999-10-05 16:24:54 +00002987
Erik Andersene49d5ec2000-02-08 19:58:47 +00002988 /* If compression failed and this is the first and last block,
2989 * and if the zip file can be seeked (to rewrite the local header),
2990 * the whole file is transformed into a stored file:
2991 */
Eric Andersencc8ed391999-10-05 16:24:54 +00002992#ifdef FORCE_METHOD
2993#else
Erik Andersene49d5ec2000-02-08 19:58:47 +00002994 if (stored_len <= opt_lenb && eof && compressed_len == 0L
2995 && seekable()) {
Eric Andersencc8ed391999-10-05 16:24:54 +00002996#endif
Erik Andersene49d5ec2000-02-08 19:58:47 +00002997 /* Since LIT_BUFSIZE <= 2*WSIZE, the input data must be there: */
2998 if (buf == (char *) 0)
Matt Kraaidd19c692001-01-31 19:00:21 +00002999 error_msg("block vanished");
Eric Andersencc8ed391999-10-05 16:24:54 +00003000
Erik Andersene49d5ec2000-02-08 19:58:47 +00003001 copy_block(buf, (unsigned) stored_len, 0); /* without header */
3002 compressed_len = stored_len << 3;
3003 *file_method = STORED;
Eric Andersencc8ed391999-10-05 16:24:54 +00003004
3005#ifdef FORCE_METHOD
3006#else
Erik Andersene49d5ec2000-02-08 19:58:47 +00003007 } else if (stored_len + 4 <= opt_lenb && buf != (char *) 0) {
3008 /* 4: two words for the lengths */
Eric Andersencc8ed391999-10-05 16:24:54 +00003009#endif
Erik Andersene49d5ec2000-02-08 19:58:47 +00003010 /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.
3011 * Otherwise we can't have processed more than WSIZE input bytes since
3012 * the last block flush, because compression would have been
3013 * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to
3014 * transform a block into a stored block.
3015 */
3016 send_bits((STORED_BLOCK << 1) + eof, 3); /* send block type */
3017 compressed_len = (compressed_len + 3 + 7) & ~7L;
3018 compressed_len += (stored_len + 4) << 3;
Eric Andersencc8ed391999-10-05 16:24:54 +00003019
Erik Andersene49d5ec2000-02-08 19:58:47 +00003020 copy_block(buf, (unsigned) stored_len, 1); /* with header */
Eric Andersencc8ed391999-10-05 16:24:54 +00003021
3022#ifdef FORCE_METHOD
3023#else
Erik Andersene49d5ec2000-02-08 19:58:47 +00003024 } else if (static_lenb == opt_lenb) {
Eric Andersencc8ed391999-10-05 16:24:54 +00003025#endif
Erik Andersene49d5ec2000-02-08 19:58:47 +00003026 send_bits((STATIC_TREES << 1) + eof, 3);
3027 compress_block((ct_data near *) static_ltree,
3028 (ct_data near *) static_dtree);
3029 compressed_len += 3 + static_len;
3030 } else {
3031 send_bits((DYN_TREES << 1) + eof, 3);
3032 send_all_trees(l_desc.max_code + 1, d_desc.max_code + 1,
3033 max_blindex + 1);
3034 compress_block((ct_data near *) dyn_ltree,
3035 (ct_data near *) dyn_dtree);
3036 compressed_len += 3 + opt_len;
3037 }
3038 Assert(compressed_len == bits_sent, "bad compressed size");
3039 init_block();
Eric Andersencc8ed391999-10-05 16:24:54 +00003040
Erik Andersene49d5ec2000-02-08 19:58:47 +00003041 if (eof) {
3042 Assert(input_len == isize, "bad input size");
3043 bi_windup();
3044 compressed_len += 7; /* align on byte boundary */
3045 }
3046 Tracev((stderr, "\ncomprlen %lu(%lu) ", compressed_len >> 3,
3047 compressed_len - 7 * eof));
Eric Andersencc8ed391999-10-05 16:24:54 +00003048
Erik Andersene49d5ec2000-02-08 19:58:47 +00003049 return compressed_len >> 3;
Eric Andersencc8ed391999-10-05 16:24:54 +00003050}
3051
3052/* ===========================================================================
3053 * Save the match info and tally the frequency counts. Return true if
3054 * the current block must be flushed.
3055 */
Erik Andersene49d5ec2000-02-08 19:58:47 +00003056int ct_tally(dist, lc)
3057int dist; /* distance of matched string */
3058int lc; /* match length-MIN_MATCH or unmatched char (if dist==0) */
Eric Andersencc8ed391999-10-05 16:24:54 +00003059{
Erik Andersene49d5ec2000-02-08 19:58:47 +00003060 l_buf[last_lit++] = (uch) lc;
3061 if (dist == 0) {
3062 /* lc is the unmatched char */
3063 dyn_ltree[lc].Freq++;
3064 } else {
3065 /* Here, lc is the match length - MIN_MATCH */
3066 dist--; /* dist = match distance - 1 */
3067 Assert((ush) dist < (ush) MAX_DIST &&
3068 (ush) lc <= (ush) (MAX_MATCH - MIN_MATCH) &&
3069 (ush) d_code(dist) < (ush) D_CODES, "ct_tally: bad match");
Eric Andersencc8ed391999-10-05 16:24:54 +00003070
Erik Andersene49d5ec2000-02-08 19:58:47 +00003071 dyn_ltree[length_code[lc] + LITERALS + 1].Freq++;
3072 dyn_dtree[d_code(dist)].Freq++;
Eric Andersencc8ed391999-10-05 16:24:54 +00003073
Erik Andersene49d5ec2000-02-08 19:58:47 +00003074 d_buf[last_dist++] = (ush) dist;
3075 flags |= flag_bit;
3076 }
3077 flag_bit <<= 1;
Eric Andersencc8ed391999-10-05 16:24:54 +00003078
Erik Andersene49d5ec2000-02-08 19:58:47 +00003079 /* Output the flags if they fill a byte: */
3080 if ((last_lit & 7) == 0) {
3081 flag_buf[last_flags++] = flags;
3082 flags = 0, flag_bit = 1;
3083 }
3084 /* Try to guess if it is profitable to stop the current block here */
3085 if ((last_lit & 0xfff) == 0) {
3086 /* Compute an upper bound for the compressed length */
3087 ulg out_length = (ulg) last_lit * 8L;
3088 ulg in_length = (ulg) strstart - block_start;
3089 int dcode;
3090
3091 for (dcode = 0; dcode < D_CODES; dcode++) {
3092 out_length +=
3093 (ulg) dyn_dtree[dcode].Freq * (5L + extra_dbits[dcode]);
3094 }
3095 out_length >>= 3;
3096 Trace(
3097 (stderr,
3098 "\nlast_lit %u, last_dist %u, in %ld, out ~%ld(%ld%%) ",
3099 last_lit, last_dist, in_length, out_length,
3100 100L - out_length * 100L / in_length));
3101 if (last_dist < last_lit / 2 && out_length < in_length / 2)
3102 return 1;
3103 }
3104 return (last_lit == LIT_BUFSIZE - 1 || last_dist == DIST_BUFSIZE);
3105 /* We avoid equality with LIT_BUFSIZE because of wraparound at 64K
3106 * on 16 bit machines and because stored blocks are restricted to
3107 * 64K-1 bytes.
3108 */
Eric Andersencc8ed391999-10-05 16:24:54 +00003109}
3110
3111/* ===========================================================================
3112 * Send the block data compressed using the given Huffman trees
3113 */
3114local void compress_block(ltree, dtree)
Erik Andersene49d5ec2000-02-08 19:58:47 +00003115ct_data near *ltree; /* literal tree */
3116ct_data near *dtree; /* distance tree */
Eric Andersencc8ed391999-10-05 16:24:54 +00003117{
Erik Andersene49d5ec2000-02-08 19:58:47 +00003118 unsigned dist; /* distance of matched string */
3119 int lc; /* match length or unmatched char (if dist == 0) */
3120 unsigned lx = 0; /* running index in l_buf */
3121 unsigned dx = 0; /* running index in d_buf */
3122 unsigned fx = 0; /* running index in flag_buf */
3123 uch flag = 0; /* current flags */
3124 unsigned code; /* the code to send */
3125 int extra; /* number of extra bits to send */
Eric Andersencc8ed391999-10-05 16:24:54 +00003126
Erik Andersene49d5ec2000-02-08 19:58:47 +00003127 if (last_lit != 0)
3128 do {
3129 if ((lx & 7) == 0)
3130 flag = flag_buf[fx++];
3131 lc = l_buf[lx++];
3132 if ((flag & 1) == 0) {
3133 send_code(lc, ltree); /* send a literal byte */
3134 Tracecv(isgraph(lc), (stderr, " '%c' ", lc));
3135 } else {
3136 /* Here, lc is the match length - MIN_MATCH */
3137 code = length_code[lc];
3138 send_code(code + LITERALS + 1, ltree); /* send the length code */
3139 extra = extra_lbits[code];
3140 if (extra != 0) {
3141 lc -= base_length[code];
3142 send_bits(lc, extra); /* send the extra length bits */
3143 }
3144 dist = d_buf[dx++];
3145 /* Here, dist is the match distance - 1 */
3146 code = d_code(dist);
3147 Assert(code < D_CODES, "bad d_code");
Eric Andersencc8ed391999-10-05 16:24:54 +00003148
Erik Andersene49d5ec2000-02-08 19:58:47 +00003149 send_code(code, dtree); /* send the distance code */
3150 extra = extra_dbits[code];
3151 if (extra != 0) {
3152 dist -= base_dist[code];
3153 send_bits(dist, extra); /* send the extra distance bits */
3154 }
3155 } /* literal or match pair ? */
3156 flag >>= 1;
3157 } while (lx < last_lit);
Eric Andersencc8ed391999-10-05 16:24:54 +00003158
Erik Andersene49d5ec2000-02-08 19:58:47 +00003159 send_code(END_BLOCK, ltree);
Eric Andersencc8ed391999-10-05 16:24:54 +00003160}
3161
3162/* ===========================================================================
3163 * Set the file type to ASCII or BINARY, using a crude approximation:
3164 * binary if more than 20% of the bytes are <= 6 or >= 128, ascii otherwise.
3165 * IN assertion: the fields freq of dyn_ltree are set and the total of all
3166 * frequencies does not exceed 64K (to fit in an int on 16 bit machines).
3167 */
3168local void set_file_type()
3169{
Erik Andersene49d5ec2000-02-08 19:58:47 +00003170 int n = 0;
3171 unsigned ascii_freq = 0;
3172 unsigned bin_freq = 0;
3173
3174 while (n < 7)
3175 bin_freq += dyn_ltree[n++].Freq;
3176 while (n < 128)
3177 ascii_freq += dyn_ltree[n++].Freq;
3178 while (n < LITERALS)
3179 bin_freq += dyn_ltree[n++].Freq;
3180 *file_type = bin_freq > (ascii_freq >> 2) ? BINARY : ASCII;
3181 if (*file_type == BINARY && translate_eol) {
Matt Kraaidd19c692001-01-31 19:00:21 +00003182 error_msg("-l used on binary file");
Erik Andersene49d5ec2000-02-08 19:58:47 +00003183 }
Eric Andersencc8ed391999-10-05 16:24:54 +00003184}
Erik Andersene49d5ec2000-02-08 19:58:47 +00003185
Eric Andersencc8ed391999-10-05 16:24:54 +00003186/* util.c -- utility functions for gzip support
3187 * Copyright (C) 1992-1993 Jean-loup Gailly
3188 * This is free software; you can redistribute it and/or modify it under the
3189 * terms of the GNU General Public License, see the file COPYING.
3190 */
3191
Eric Andersencc8ed391999-10-05 16:24:54 +00003192#include <ctype.h>
3193#include <errno.h>
3194#include <sys/types.h>
3195
3196#ifdef HAVE_UNISTD_H
3197# include <unistd.h>
3198#endif
3199#ifndef NO_FCNTL_H
3200# include <fcntl.h>
3201#endif
3202
Eric Andersencc8ed391999-10-05 16:24:54 +00003203/* ===========================================================================
3204 * Copy input to output unchanged: zcat == cat with --force.
3205 * IN assertion: insize bytes have already been read in inbuf.
3206 */
3207int copy(in, out)
Erik Andersene49d5ec2000-02-08 19:58:47 +00003208int in, out; /* input and output file descriptors */
Eric Andersencc8ed391999-10-05 16:24:54 +00003209{
Erik Andersene49d5ec2000-02-08 19:58:47 +00003210 errno = 0;
3211 while (insize != 0 && (int) insize != EOF) {
3212 write_buf(out, (char *) inbuf, insize);
3213 bytes_out += insize;
3214 insize = read(in, (char *) inbuf, INBUFSIZ);
3215 }
3216 if ((int) insize == EOF && errno != 0) {
Erik Andersen330fd2b2000-05-19 05:35:19 +00003217 read_error_msg();
Erik Andersene49d5ec2000-02-08 19:58:47 +00003218 }
3219 bytes_in = bytes_out;
3220 return OK;
Eric Andersencc8ed391999-10-05 16:24:54 +00003221}
3222
3223/* ========================================================================
3224 * Put string s in lower case, return s.
3225 */
3226char *strlwr(s)
Erik Andersene49d5ec2000-02-08 19:58:47 +00003227char *s;
Eric Andersencc8ed391999-10-05 16:24:54 +00003228{
Erik Andersene49d5ec2000-02-08 19:58:47 +00003229 char *t;
3230
3231 for (t = s; *t; t++)
3232 *t = tolow(*t);
3233 return s;
Eric Andersencc8ed391999-10-05 16:24:54 +00003234}
3235
3236#if defined(NO_STRING_H) && !defined(STDC_HEADERS)
3237
3238/* Provide missing strspn and strcspn functions. */
3239
Erik Andersen61677fe2000-04-13 01:18:56 +00003240int strspn (const char *s, const char *accept);
3241int strcspn (const char *s, const char *reject);
Eric Andersencc8ed391999-10-05 16:24:54 +00003242
3243/* ========================================================================
3244 * Return the length of the maximum initial segment
3245 * of s which contains only characters in accept.
3246 */
3247int strspn(s, accept)
Erik Andersene49d5ec2000-02-08 19:58:47 +00003248const char *s;
3249const char *accept;
Eric Andersencc8ed391999-10-05 16:24:54 +00003250{
Erik Andersene49d5ec2000-02-08 19:58:47 +00003251 register const char *p;
3252 register const char *a;
3253 register int count = 0;
Eric Andersencc8ed391999-10-05 16:24:54 +00003254
Erik Andersene49d5ec2000-02-08 19:58:47 +00003255 for (p = s; *p != '\0'; ++p) {
3256 for (a = accept; *a != '\0'; ++a) {
3257 if (*p == *a)
3258 break;
3259 }
3260 if (*a == '\0')
3261 return count;
3262 ++count;
Eric Andersencc8ed391999-10-05 16:24:54 +00003263 }
Erik Andersene49d5ec2000-02-08 19:58:47 +00003264 return count;
Eric Andersencc8ed391999-10-05 16:24:54 +00003265}
3266
3267/* ========================================================================
3268 * Return the length of the maximum inital segment of s
3269 * which contains no characters from reject.
3270 */
3271int strcspn(s, reject)
Erik Andersene49d5ec2000-02-08 19:58:47 +00003272const char *s;
3273const char *reject;
Eric Andersencc8ed391999-10-05 16:24:54 +00003274{
Erik Andersene49d5ec2000-02-08 19:58:47 +00003275 register int count = 0;
Eric Andersencc8ed391999-10-05 16:24:54 +00003276
Erik Andersene49d5ec2000-02-08 19:58:47 +00003277 while (*s != '\0') {
3278 if (strchr(reject, *s++) != NULL)
3279 return count;
3280 ++count;
3281 }
3282 return count;
Eric Andersencc8ed391999-10-05 16:24:54 +00003283}
3284
Erik Andersene49d5ec2000-02-08 19:58:47 +00003285#endif /* NO_STRING_H */
Eric Andersencc8ed391999-10-05 16:24:54 +00003286
3287/* ========================================================================
3288 * Add an environment variable (if any) before argv, and update argc.
3289 * Return the expanded environment variable to be freed later, or NULL
3290 * if no options were added to argv.
3291 */
Erik Andersene49d5ec2000-02-08 19:58:47 +00003292#define SEPARATOR " \t" /* separators in env variable */
Eric Andersencc8ed391999-10-05 16:24:54 +00003293
3294char *add_envopt(argcp, argvp, env)
Erik Andersene49d5ec2000-02-08 19:58:47 +00003295int *argcp; /* pointer to argc */
3296char ***argvp; /* pointer to argv */
3297char *env; /* name of environment variable */
Eric Andersencc8ed391999-10-05 16:24:54 +00003298{
Erik Andersene49d5ec2000-02-08 19:58:47 +00003299 char *p; /* running pointer through env variable */
3300 char **oargv; /* runs through old argv array */
3301 char **nargv; /* runs through new argv array */
3302 int oargc = *argcp; /* old argc */
3303 int nargc = 0; /* number of arguments in env variable */
Eric Andersencc8ed391999-10-05 16:24:54 +00003304
Erik Andersene49d5ec2000-02-08 19:58:47 +00003305 env = (char *) getenv(env);
3306 if (env == NULL)
3307 return NULL;
Eric Andersencc8ed391999-10-05 16:24:54 +00003308
Erik Andersene49d5ec2000-02-08 19:58:47 +00003309 p = (char *) xmalloc(strlen(env) + 1);
3310 env = strcpy(p, env); /* keep env variable intact */
Eric Andersencc8ed391999-10-05 16:24:54 +00003311
Erik Andersene49d5ec2000-02-08 19:58:47 +00003312 for (p = env; *p; nargc++) { /* move through env */
3313 p += strspn(p, SEPARATOR); /* skip leading separators */
3314 if (*p == '\0')
3315 break;
Eric Andersencc8ed391999-10-05 16:24:54 +00003316
Erik Andersene49d5ec2000-02-08 19:58:47 +00003317 p += strcspn(p, SEPARATOR); /* find end of word */
3318 if (*p)
3319 *p++ = '\0'; /* mark it */
3320 }
3321 if (nargc == 0) {
3322 free(env);
3323 return NULL;
3324 }
3325 *argcp += nargc;
3326 /* Allocate the new argv array, with an extra element just in case
3327 * the original arg list did not end with a NULL.
3328 */
3329 nargv = (char **) calloc(*argcp + 1, sizeof(char *));
Eric Andersencc8ed391999-10-05 16:24:54 +00003330
Erik Andersene49d5ec2000-02-08 19:58:47 +00003331 if (nargv == NULL)
Mark Whitleyf57c9442000-12-07 19:56:48 +00003332 error_msg(memory_exhausted);
Erik Andersene49d5ec2000-02-08 19:58:47 +00003333 oargv = *argvp;
3334 *argvp = nargv;
Eric Andersencc8ed391999-10-05 16:24:54 +00003335
Erik Andersene49d5ec2000-02-08 19:58:47 +00003336 /* Copy the program name first */
3337 if (oargc-- < 0)
Matt Kraaidd19c692001-01-31 19:00:21 +00003338 error_msg("argc<=0");
Erik Andersene49d5ec2000-02-08 19:58:47 +00003339 *(nargv++) = *(oargv++);
Eric Andersencc8ed391999-10-05 16:24:54 +00003340
Erik Andersene49d5ec2000-02-08 19:58:47 +00003341 /* Then copy the environment args */
3342 for (p = env; nargc > 0; nargc--) {
3343 p += strspn(p, SEPARATOR); /* skip separators */
3344 *(nargv++) = p; /* store start */
3345 while (*p++); /* skip over word */
3346 }
3347
3348 /* Finally copy the old args and add a NULL (usual convention) */
3349 while (oargc--)
3350 *(nargv++) = *(oargv++);
3351 *nargv = NULL;
3352 return env;
Eric Andersencc8ed391999-10-05 16:24:54 +00003353}
Erik Andersene49d5ec2000-02-08 19:58:47 +00003354
Eric Andersencc8ed391999-10-05 16:24:54 +00003355/* ========================================================================
3356 * Display compression ratio on the given stream on 6 characters.
3357 */
3358void display_ratio(num, den, file)
Erik Andersene49d5ec2000-02-08 19:58:47 +00003359long num;
3360long den;
3361FILE *file;
Eric Andersencc8ed391999-10-05 16:24:54 +00003362{
Erik Andersene49d5ec2000-02-08 19:58:47 +00003363 long ratio; /* 1000 times the compression ratio */
Eric Andersencc8ed391999-10-05 16:24:54 +00003364
Erik Andersene49d5ec2000-02-08 19:58:47 +00003365 if (den == 0) {
3366 ratio = 0; /* no compression */
3367 } else if (den < 2147483L) { /* (2**31 -1)/1000 */
3368 ratio = 1000L * num / den;
3369 } else {
3370 ratio = num / (den / 1000L);
3371 }
3372 if (ratio < 0) {
3373 putc('-', file);
3374 ratio = -ratio;
3375 } else {
3376 putc(' ', file);
3377 }
3378 fprintf(file, "%2ld.%1ld%%", ratio / 10L, ratio % 10L);
Eric Andersencc8ed391999-10-05 16:24:54 +00003379}
3380
3381
3382/* zip.c -- compress files to the gzip or pkzip format
3383 * Copyright (C) 1992-1993 Jean-loup Gailly
3384 * This is free software; you can redistribute it and/or modify it under the
3385 * terms of the GNU General Public License, see the file COPYING.
3386 */
3387
Eric Andersencc8ed391999-10-05 16:24:54 +00003388#include <ctype.h>
3389#include <sys/types.h>
3390
3391#ifdef HAVE_UNISTD_H
3392# include <unistd.h>
3393#endif
3394#ifndef NO_FCNTL_H
3395# include <fcntl.h>
3396#endif
3397
Erik Andersene49d5ec2000-02-08 19:58:47 +00003398local ulg crc; /* crc on uncompressed file data */
3399long header_bytes; /* number of bytes in gzip header */
Eric Andersencc8ed391999-10-05 16:24:54 +00003400
3401/* ===========================================================================
3402 * Deflate in to out.
3403 * IN assertions: the input and output buffers are cleared.
3404 * The variables time_stamp and save_orig_name are initialized.
3405 */
3406int zip(in, out)
Erik Andersene49d5ec2000-02-08 19:58:47 +00003407int in, out; /* input and output file descriptors */
Eric Andersencc8ed391999-10-05 16:24:54 +00003408{
Eric Andersen851895a2001-03-21 21:52:25 +00003409 uch my_flags = 0; /* general purpose bit flags */
Erik Andersene49d5ec2000-02-08 19:58:47 +00003410 ush attr = 0; /* ascii/binary flag */
3411 ush deflate_flags = 0; /* pkzip -es, -en or -ex equivalent */
Eric Andersencc8ed391999-10-05 16:24:54 +00003412
Erik Andersene49d5ec2000-02-08 19:58:47 +00003413 ifd = in;
3414 ofd = out;
3415 outcnt = 0;
Eric Andersencc8ed391999-10-05 16:24:54 +00003416
Erik Andersene49d5ec2000-02-08 19:58:47 +00003417 /* Write the header to the gzip file. See algorithm.doc for the format */
Eric Andersencc8ed391999-10-05 16:24:54 +00003418
Eric Andersen96bcfd31999-11-12 01:30:18 +00003419
Erik Andersene49d5ec2000-02-08 19:58:47 +00003420 method = DEFLATED;
3421 put_byte(GZIP_MAGIC[0]); /* magic header */
3422 put_byte(GZIP_MAGIC[1]);
3423 put_byte(DEFLATED); /* compression method */
Eric Andersencc8ed391999-10-05 16:24:54 +00003424
Eric Andersen851895a2001-03-21 21:52:25 +00003425 put_byte(my_flags); /* general flags */
Erik Andersene49d5ec2000-02-08 19:58:47 +00003426 put_long(time_stamp);
Eric Andersencc8ed391999-10-05 16:24:54 +00003427
Erik Andersene49d5ec2000-02-08 19:58:47 +00003428 /* Write deflated file to zip file */
3429 crc = updcrc(0, 0);
Eric Andersencc8ed391999-10-05 16:24:54 +00003430
Erik Andersene49d5ec2000-02-08 19:58:47 +00003431 bi_init(out);
3432 ct_init(&attr, &method);
3433 lm_init(&deflate_flags);
Eric Andersencc8ed391999-10-05 16:24:54 +00003434
Erik Andersene49d5ec2000-02-08 19:58:47 +00003435 put_byte((uch) deflate_flags); /* extra flags */
3436 put_byte(OS_CODE); /* OS identifier */
Eric Andersencc8ed391999-10-05 16:24:54 +00003437
Erik Andersene49d5ec2000-02-08 19:58:47 +00003438 header_bytes = (long) outcnt;
Eric Andersencc8ed391999-10-05 16:24:54 +00003439
Erik Andersene49d5ec2000-02-08 19:58:47 +00003440 (void) deflate();
Eric Andersencc8ed391999-10-05 16:24:54 +00003441
Erik Andersene49d5ec2000-02-08 19:58:47 +00003442 /* Write the crc and uncompressed size */
3443 put_long(crc);
3444 put_long(isize);
3445 header_bytes += 2 * sizeof(long);
Eric Andersencc8ed391999-10-05 16:24:54 +00003446
Erik Andersene49d5ec2000-02-08 19:58:47 +00003447 flush_outbuf();
3448 return OK;
Eric Andersencc8ed391999-10-05 16:24:54 +00003449}
3450
3451
3452/* ===========================================================================
3453 * Read a new buffer from the current input file, perform end-of-line
3454 * translation, and update the crc and input file size.
3455 * IN assertion: size >= 2 (for end-of-line translation)
3456 */
3457int file_read(buf, size)
Erik Andersene49d5ec2000-02-08 19:58:47 +00003458char *buf;
3459unsigned size;
Eric Andersencc8ed391999-10-05 16:24:54 +00003460{
Erik Andersene49d5ec2000-02-08 19:58:47 +00003461 unsigned len;
Eric Andersencc8ed391999-10-05 16:24:54 +00003462
Erik Andersene49d5ec2000-02-08 19:58:47 +00003463 Assert(insize == 0, "inbuf not empty");
Eric Andersencc8ed391999-10-05 16:24:54 +00003464
Erik Andersene49d5ec2000-02-08 19:58:47 +00003465 len = read(ifd, buf, size);
3466 if (len == (unsigned) (-1) || len == 0)
3467 return (int) len;
Eric Andersencc8ed391999-10-05 16:24:54 +00003468
Erik Andersene49d5ec2000-02-08 19:58:47 +00003469 crc = updcrc((uch *) buf, len);
3470 isize += (ulg) len;
3471 return (int) len;
Eric Andersencc8ed391999-10-05 16:24:54 +00003472}
Matt Kraai7918e1f2000-11-08 06:52:57 +00003473
3474/* ===========================================================================
3475 * Write the output buffer outbuf[0..outcnt-1] and update bytes_out.
3476 * (used for the compressed data only)
3477 */
3478void flush_outbuf()
3479{
3480 if (outcnt == 0)
3481 return;
3482
3483 write_buf(ofd, (char *) outbuf, outcnt);
3484 bytes_out += (ulg) outcnt;
3485 outcnt = 0;
3486}