* Copyright (c) 1985, 1986 The Regents of the University of California.
* This code is derived from software contributed to Berkeley by
* James A. Woods, derived from original work by Spencer Thomas
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the University of
* California, Berkeley and its contributors.
* 4. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
"@(#) Copyright (c) 1985, 1986 The Regents of the University of California.\n\
static char sccsid
[] = "@(#)compress.c 5.19 (Berkeley) 3/18/91";
* compress.c - File compression ala IEEE Computer, June 1984.
* Authors: Spencer W. Thomas (decvax!utah-cs!thomas)
* Jim McKie (decvax!mcvax!jim)
* Steve Davies (decvax!vax135!petsd!peora!srd)
* Ken Turkowski (decvax!decwrl!turtlevax!ken)
* James A. Woods (decvax!ihnp4!ames!jaw)
* Joe Orost (decvax!vax135!petsd!joe)
* Set USERMEM to the maximum amount of physical user memory available
* in bytes. USERMEM is used to determine the maximum BITS that can be used
* SACREDMEM is the amount of physical memory saved for others; compress
# define USERMEM 450000 /* default user memory */
# define BITS 12 /* max bits/code for 16-bit machine */
# define NO_UCHAR /* also if "unsigned char" functions as signed char */
#endif /* pdp11 */ /* don't forget to compile with -i */
# if USERMEM >= (433484+SACREDMEM)
# if USERMEM >= (229600+SACREDMEM)
# if USERMEM >= (127536+SACREDMEM)
# if USERMEM >= (73464+SACREDMEM)
#ifdef PBITS /* Preferred BITS for this memory size */
# define HSIZE 69001 /* 95% occupancy */
# define HSIZE 35023 /* 94% occupancy */
# define HSIZE 18013 /* 91% occupancy */
# define HSIZE 9001 /* 91% occupancy */
# define HSIZE 5003 /* 80% occupancy */
* a code_int must be able to hold 2**BITS values of type int, and also -1
typedef long int code_int
;
#ifdef SIGNED_COMPARE_SLOW
typedef unsigned long int count_int
;
typedef unsigned short int count_short
;
typedef long int count_int
;
typedef unsigned char char_type
;
char_type magic_header
[] = { "\037\235" }; /* 1F 9D */
/* Defines for third byte of header */
/* Masks 0x40 and 0x20 are free. I think 0x20 should mean that there is
a fourth header byte (for expansion).
#define INIT_BITS 9 /* initial number of bits/code */
int n_bits
; /* number of bits/code */
int maxbits
= BITS
; /* user settable max # bits/code */
code_int maxcode
; /* maximum code, given n_bits */
code_int maxmaxcode
= 1 << BITS
; /* should NEVER generate this code */
#ifdef COMPATIBLE /* But wrong! */
# define MAXCODE(n_bits) (1 << (n_bits) - 1)
# define MAXCODE(n_bits) ((1 << (n_bits)) - 1)
unsigned short codetab
[HSIZE
];
#define htabof(i) htab[i]
#define codetabof(i) codetab[i]
code_int hsize
= HSIZE
; /* for dynamic table sizing */
* To save much memory, we overlay the table used by compress() with those
* used by decompress(). The tab_prefix table is the same size and type
* as the codetab. The tab_suffix table needs 2**BITS characters. We
* get this from the beginning of htab. The output stack uses the rest
* of htab, and contains characters. There is plenty of room for any
* possible stack (stack used to be 8000 characters).
#define tab_prefixof(i) codetabof(i)
# define tab_suffixof(i) ((char_type *)(htab))[i]
# define de_stack ((char_type *)&tab_suffixof(1<<BITS))
code_int free_ent
= 0; /* first unused entry */
int exit_stat
= 0; /* per-file status */
int perm_stat
= 0; /* permanent status */
int nomagic
= 0; /* Use a 3-byte magic number header, unless old file */
int zcat_flg
= 0; /* Write output on stdout, suppress messages */
int precious
= 1; /* Don't unlink output file on interrupt */
int quiet
= 1; /* don't tell me about compression */
* block compression parameters -- after all codes are used up,
* and compression rate changes, start over.
int block_compress
= BLOCK_MASK
;
#define CHECK_GAP 10000 /* ratio check interval */
count_int checkpoint
= CHECK_GAP
;
* the next two codes should not be changed lightly, as they must not
* lie within the contiguous general code space.
#define FIRST 257 /* first free entry */
#define CLEAR 256 /* table clear output code */
* Algorithm from "A Technique for High Performance Data Compression",
* Terry A. Welch, IEEE Computer Vol 17, No 6 (June 1984), pp 8-19.
* Usage: compress [-dfvc] [-b bits] [file ...]
* -d: If given, decompression is done instead.
* -c: Write output on stdout, don't remove original.
* -b: Parameter limits the max number of bits/code.
* -f: Forces output file to be generated, even if one already
* exists, and even if no space is saved by compressing.
* If -f is not used, the user will be prompted if stdin is
* a tty, otherwise, the output file will not be overwritten.
* -v: Write compression statistics
* file ...: Files to be compressed. If none specified, stdin
* file.Z: Compressed form of file with same mode, owner, and utimes
* or stdout (if stdin used as input)
* When filenames are given, replaces with the compressed version
* (.Z suffix) only if the file decreases in size.
* Modified Lempel-Ziv method (LZW). Basically finds common
* substrings and replaces them with a variable size code. This is
* deterministic, and can be done on the fly. Thus, the decompression
* procedure needs no input table, but tracks the way the table was built.
char **filelist
, **fileptr
, *cp
, tempname
[MAXPATHLEN
];
/* This bg check only works for sh. */
if ((oldint
= signal(SIGINT
, SIG_IGN
)) != SIG_IGN
) {
(void)signal(SIGINT
, onintr
);
(void)signal(SIGSEGV
, oops
); /* XXX */
bgnd_flag
= oldint
!= SIG_DFL
;
nomagic
= 1; /* Original didn't have a magic number */
if (cp
= rindex(argv
[0], '/'))
if (strcmp(cp
, "uncompress") == 0)
else if(strcmp(cp
, "zcat") == 0) {
* -C => generate output compatible with compress 2.0.
* -c => cat all output to stdout
* -f => force overwrite of output file
* -n => no header: useful to uncompress old files
* -V => print Version; debug verbose
while ((ch
= getopt(argc
, argv
, "b:CcDdfnVv")) != EOF
)
while ((ch
= getopt(argc
, argv
, "b:Ccdfnv")) != EOF
)
maxmaxcode
= 1 << maxbits
;
/* Build useless input file list. */
filelist
= fileptr
= (char **)(malloc(argc
* sizeof(*argv
)));
for (fileptr
= filelist
; *fileptr
; fileptr
++) {
if (do_decomp
) { /* DECOMPRESSION */
/* Check for .Z suffix */
if (strcmp(*fileptr
+ strlen(*fileptr
) - 2, ".Z") != 0) {
strcpy(tempname
, *fileptr
);
if ((freopen(*fileptr
, "r", stdin
)) == NULL
) {
/* Check the magic number */
if ((getchar() != (magic_header
[0] & 0xFF))
|| (getchar() != (magic_header
[1] & 0xFF))) {
fprintf(stderr
, "%s: not in compressed format\n",
maxbits
= getchar(); /* set -b from file */
block_compress
= maxbits
& BLOCK_MASK
;
maxmaxcode
= 1 << maxbits
;
"%s: compressed with %d bits, can only handle %d bits\n",
*fileptr
, maxbits
, BITS
);
/* Generate output filename */
strcpy(ofname
, *fileptr
);
ofname
[strlen(*fileptr
) - 2] = '\0'; /* Strip off .Z */
} else { /* COMPRESSION */
if (strcmp(*fileptr
+ strlen(*fileptr
) - 2, ".Z") == 0) {
fprintf(stderr
, "%s: already has .Z suffix -- no change\n",
if ((freopen(*fileptr
, "r", stdin
)) == NULL
) {
stat ( *fileptr
, &statbuf
);
fsize
= (long) statbuf
.st_size
;
* tune hash table size for small files -- ad hoc,
* but the sizes match earlier #defines, which
* serve as upper bounds on the number of output codes.
hsize
= MIN ( 5003, HSIZE
);
else if ( fsize
< (1 << 13) )
hsize
= MIN ( 9001, HSIZE
);
else if ( fsize
< (1 << 14) )
hsize
= MIN ( 18013, HSIZE
);
else if ( fsize
< (1 << 15) )
hsize
= MIN ( 35023, HSIZE
);
else if ( fsize
< 47000 )
hsize
= MIN ( 50021, HSIZE
);
/* Generate output filename */
strcpy(ofname
, *fileptr
);
/* Check for overwrite of existing file */
if (overwrite
== 0 && zcat_flg
== 0) {
if (stat(ofname
, &statbuf
) == 0) {
fprintf(stderr
, "%s already exists;", ofname
);
if (bgnd_flag
== 0 && isatty(2)) {
fprintf(stderr
, " do you wish to overwrite %s (y or n)? ",
while (response
[1] != '\n') {
if (read(2, response
+1, 1) < 0) { /* Ack! */
if (response
[0] != 'y') {
fprintf(stderr
, "\tnot overwritten\n");
if(zcat_flg
== 0) { /* Open output file */
if (freopen(ofname
, "w", stdout
) == NULL
) {
fprintf(stderr
, "%s: ", *fileptr
);
/* Actually do the compression/decompression */
if (do_decomp
== 0) compress();
else if (debug
== 0) decompress();
copystat(*fileptr
, ofname
); /* Copy stats */
if((exit_stat
== 1) || (!quiet
))
} else { /* Standard input */
/* Check the magic number */
if ((getchar()!=(magic_header
[0] & 0xFF))
|| (getchar()!=(magic_header
[1] & 0xFF))) {
fprintf(stderr
, "stdin: not in compressed format\n");
maxbits
= getchar(); /* set -b from file */
block_compress
= maxbits
& BLOCK_MASK
;
maxmaxcode
= 1 << maxbits
;
fsize
= 100000; /* assume stdin large for USERMEM */
"stdin: compressed with %d bits, can only handle %d bits\n",
if (debug
== 0) decompress();
exit(perm_stat
? perm_stat
: exit_stat
);
long int in_count
= 1; /* length of input */
long int bytes_out
; /* length of compressed output */
long int out_count
= 0; /* # of codes output (for debugging) */
* compress stdin to stdout
* Algorithm: use open addressing double hashing (no chaining) on the
* prefix code / next character combination. We do a variant of Knuth's
* algorithm D (vol. 3, sec. 6.4) along with G. Knott's relatively-prime
* secondary probe. Here, the modular division first probe is gives way
* to a faster exclusive-or manipulation. Also do block compression with
* an adaptive reset, whereby the code table is cleared when the compression
* ratio decreases, but after the table fills. The variable-length output
* codes are re-sized at this point, and a special CLEAR code is generated
* for the decompressor. Late addition: construct the table according to
* file size for noticeable speed improvement on small files. Please direct
* questions about this implementation to ames!jaw.
register code_int hsize_reg
;
putchar(magic_header
[0]);
putchar(magic_header
[1]);
putchar((char)(maxbits
| block_compress
));
bytes_out
= 3; /* includes 3-byte header mojo */
maxcode
= MAXCODE(n_bits
= INIT_BITS
);
free_ent
= ((block_compress
) ? FIRST
: 256 );
for ( fcode
= (long) hsize
; fcode
< 65536L; fcode
*= 2L )
hshift
= 8 - hshift
; /* set hash code range bound */
cl_hash( (count_int
) hsize_reg
); /* clear hash table */
#ifdef SIGNED_COMPARE_SLOW
while ( (c
= getchar()) != (unsigned) EOF
) {
while ( (c
= getchar()) != EOF
) {
fcode
= (long) (((long) c
<< maxbits
) + ent
);
i
= ((c
<< hshift
) ^ ent
); /* xor hashing */
if ( htabof (i
) == fcode
) {
} else if ( (long)htabof (i
) < 0 ) /* empty slot */
disp
= hsize_reg
- i
; /* secondary hash (after G. Knott) */
if ( htabof (i
) == fcode
) {
if ( (long)htabof (i
) > 0 )
output ( (code_int
) ent
);
#ifdef SIGNED_COMPARE_SLOW
if ( (unsigned) free_ent
< (unsigned) maxmaxcode
) {
if ( free_ent
< maxmaxcode
) {
codetabof (i
) = free_ent
++; /* code -> hashtable */
else if ( (count_int
)in_count
>= checkpoint
&& block_compress
)
* Put out the final code.
* Print out stats on stderr
if(zcat_flg
== 0 && !quiet
) {
"%ld chars in, %ld codes (%ld bytes) out, compression factor: ",
in_count
, out_count
, bytes_out
);
prratio( stderr
, in_count
, bytes_out
);
fprintf( stderr
, "\tCompression as in compact: " );
prratio( stderr
, in_count
-bytes_out
, in_count
);
fprintf( stderr
, "\tLargest code (of last block) was %d (%d bits)\n",
fprintf( stderr
, "Compression: " );
prratio( stderr
, in_count
-bytes_out
, in_count
);
if(bytes_out
> in_count
) /* exit(2) if no savings */
* code: A n_bits-bit integer. If == -1, then EOF. This assumes
* that n_bits =< (long)wordsize - 1.
* Outputs code to the file.
* Maintain a BITS character long buffer (so that 8 codes will
* fit in it exactly). Use the VAX insv instruction to insert each
* code in turn. When the buffer fills up empty it and start over.
char_type lmask
[9] = {0xff, 0xfe, 0xfc, 0xf8, 0xf0, 0xe0, 0xc0, 0x80, 0x00};
char_type rmask
[9] = {0x00, 0x01, 0x03, 0x07, 0x0f, 0x1f, 0x3f, 0x7f, 0xff};
* On the VAX, it is important to have the register declarations
* in exactly the order given, or the asm will break.
register int r_off
= offset
, bits
= n_bits
;
register char * bp
= buf
;
fprintf( stderr
, "%5d%c", code
,
(col
+=6) >= 74 ? (col
= 0, '\n') : ' ' );
#if defined(vax) && !defined(__GNUC__)
* VAX and PCC DEPENDENT!! Implementation on other machines is
* Translation: Insert BITS bits from the argument starting at
* offset bits from the beginning of buf.
0; /* Work around for pcc -O bug with asm and if stmt */
asm( "insv 4(ap),r11,r10,(r9)" );
* byte/bit numbering on the VAX is simulated by the following code
* Since code is always >= 8 bits, only need to mask the first
*bp
= (*bp
& rmask
[r_off
]) | (code
<< r_off
) & lmask
[r_off
];
/* Get any 8 bit parts in the middle (<=1 for up to 16 bits). */
if ( offset
== (n_bits
<< 3) ) {
* If the next entry is going to be too big for the code size,
* then increase it, if possible.
if ( free_ent
> maxcode
|| (clear_flg
> 0))
* Write the whole buffer, because the input side won't
* discover the size increase until after it has read it.
if( fwrite( buf
, 1, n_bits
, stdout
) != n_bits
)
maxcode
= MAXCODE (n_bits
= INIT_BITS
);
maxcode
= MAXCODE(n_bits
);
fprintf( stderr
, "\nChange to %d bits\n", n_bits
);
* At EOF, write the rest of the buffer.
offset
= (offset
+ 7) / 8;
if( fwrite( buf
, 1, offset
, stdout
) != offset
)
* Decompress stdin to stdout. This routine adapts to the codes in the
* file building the "string" table on-the-fly; requiring no table to
* be stored in the compressed file. The tables used herein are shared
* with those of the compress() routine. See the definitions above.
register char_type
*stackp
;
register code_int code
, oldcode
, incode
;
int n
, nwritten
, offset
; /* Variables for buffered write */
char buff
[BUFSIZ
]; /* Buffer for buffered write */
* As above, initialize the first 256 entries in the table.
maxcode
= MAXCODE(n_bits
= INIT_BITS
);
for ( code
= 255; code
>= 0; code
-- ) {
tab_suffixof(code
) = (char_type
)code
;
free_ent
= ((block_compress
) ? FIRST
: 256 );
finchar
= oldcode
= getcode();
if(oldcode
== -1) /* EOF already? */
return; /* Get out of here */
/* first code must be 8 bits = char */
buff
[n
++] = (char)finchar
;
while ( (code
= getcode()) > -1 ) {
if ( (code
== CLEAR
) && block_compress
) {
for ( code
= 255; code
>= 0; code
-- )
if ( (code
= getcode ()) == -1 ) /* O, untimely death! */
* Special case for KwKwK string.
if ( code
>= free_ent
) {
* Generate output characters in reverse order
#ifdef SIGNED_COMPARE_SLOW
while ( ((unsigned long)code
) >= ((unsigned long)256) ) {
*stackp
++ = tab_suffixof(code
);
code
= tab_prefixof(code
);
*stackp
++ = finchar
= tab_suffixof(code
);
* And put them out in forward order
* About 60% of the time is spent in the putchar() call
* that appeared here. It was originally
* If we buffer the writes ourselves, we can go faster (about
* At this point, the next line is the next *big* time
* sink in the code. It takes up about 10% of the time.
nwritten
= write(fileno(stdout
), &buff
[offset
], n
);
} while ((n
-= nwritten
) > 0);
} while ( stackp
> de_stack
);
* Generate the new entry.
if ( (code
=free_ent
) < maxmaxcode
) {
tab_prefixof(code
) = (unsigned short)oldcode
;
tab_suffixof(code
) = finchar
;
* Remember previous code.
* Flush the stuff remaining in our buffer...
nwritten
= write(fileno(stdout
), &buff
[offset
], n
);
* Read one code from the standard input. If EOF, return -1.
* code or -1 is returned.
* On the VAX, it is important to have the register declarations
* in exactly the order given, or the asm will break.
static int offset
= 0, size
= 0;
static char_type buf
[BITS
];
register int r_off
, bits
;
register char_type
*bp
= buf
;
if ( clear_flg
> 0 || offset
>= size
|| free_ent
> maxcode
) {
* If the next entry will be too big for the current code
* size, then we must increase the size. This implies reading
* a new buffer full, too.
if ( free_ent
> maxcode
) {
maxcode
= maxmaxcode
; /* won't get any bigger now */
maxcode
= MAXCODE(n_bits
);
maxcode
= MAXCODE (n_bits
= INIT_BITS
);
size
= fread( buf
, 1, n_bits
, stdin
);
return -1; /* end of file */
/* Round size down to integral number of codes */
size
= (size
<< 3) - (n_bits
- 1);
asm( "extzv r10,r9,(r8),r11" );
/* Get first part (low order bits) */
code
= ((*bp
++ >> r_off
) & rmask
[8 - r_off
]) & 0xff;
r_off
= 8 - r_off
; /* now, offset into code word */
/* Get any 8 bit parts in the middle (<=1 for up to 16 bits). */
code
|= (*bp
++ & 0xff) << r_off
;
code
|= (*bp
& rmask
[bits
]) << r_off
;
* Just print out codes from input file. For debugging.
bits
= n_bits
= INIT_BITS
;
maxcode
= MAXCODE(n_bits
);
free_ent
= ((block_compress
) ? FIRST
: 256 );
while ( ( code
= getcode() ) >= 0 ) {
if ( (code
== CLEAR
) && block_compress
) {
else if ( free_ent
< maxmaxcode
)
fprintf(stderr
, "\nChange to %d bits\n", n_bits
);
fprintf(stderr
, "%5d%c", code
, (col
+=6) >= 74 ? (col
= 0, '\n') : ' ' );
code_int sorttab
[1<<BITS
]; /* sorted pointers into htab */
dump_tab() /* dump string table */
int stack_top
= STACK_SIZE
;
if(do_decomp
== 0) { /* compressing */
for(i
=0; i
<hsize
; i
++) { /* build sort pointers */
if((long)htabof(i
) >= 0) {
sorttab
[codetabof(i
)] = i
;
first
= block_compress
? FIRST
: 256;
for(i
= first
; i
< free_ent
; i
++) {
fprintf(stderr
, "%5d: \"", i
);
de_stack
[--stack_top
] = '\n';
de_stack
[--stack_top
] = '"';
stack_top
= in_stack((htabof(sorttab
[i
])>>maxbits
)&0xff,
for(ent
=htabof(sorttab
[i
]) & ((1<<maxbits
)-1);
ent
=htabof(sorttab
[ent
]) & ((1<<maxbits
)-1)) {
stack_top
= in_stack(htabof(sorttab
[ent
]) >> maxbits
,
stack_top
= in_stack(ent
, stack_top
);
fwrite( &de_stack
[stack_top
], 1, STACK_SIZE
-stack_top
, stderr
);
} else if(!debug
) { /* decompressing */
for ( i
= 0; i
< free_ent
; i
++ ) {
if ( isascii(c
) && isprint(c
) )
fprintf( stderr
, "%5d: %5d/'%c' \"",
ent
, tab_prefixof(ent
), c
);
fprintf( stderr
, "%5d: %5d/\\%03o \"",
ent
, tab_prefixof(ent
), c
);
de_stack
[--stack_top
] = '\n';
de_stack
[--stack_top
] = '"';
ent
= (ent
>= FIRST
? tab_prefixof(ent
) : NULL
) ) {
stack_top
= in_stack(tab_suffixof(ent
), stack_top
);
fwrite( &de_stack
[stack_top
], 1, STACK_SIZE
- stack_top
, stderr
);
if ( (isascii(c
) && isprint(c
) && c
!= '\\') || c
== ' ' ) {
de_stack
[--stack_top
] = c
;
case '\n': de_stack
[--stack_top
] = 'n'; break;
case '\t': de_stack
[--stack_top
] = 't'; break;
case '\b': de_stack
[--stack_top
] = 'b'; break;
case '\f': de_stack
[--stack_top
] = 'f'; break;
case '\r': de_stack
[--stack_top
] = 'r'; break;
case '\\': de_stack
[--stack_top
] = '\\'; break;
de_stack
[--stack_top
] = '0' + c
% 8;
de_stack
[--stack_top
] = '0' + (c
/ 8) % 8;
de_stack
[--stack_top
] = '0' + c
/ 64;
de_stack
[--stack_top
] = '\\';
(void)fprintf(stderr
, "compress: %s: %s\n",
ofname
[0] ? ofname
: "stdout", strerror(errno
));
if (stat(ifname
, &statbuf
)) { /* Get stat on input file */
if ((statbuf
.st_mode
& S_IFMT
/*0170000*/) != S_IFREG
/*0100000*/) {
fprintf(stderr
, "%s: ", ifname
);
fprintf(stderr
, " -- not a regular file: unchanged");
} else if (statbuf
.st_nlink
> 1) {
fprintf(stderr
, "%s: ", ifname
);
fprintf(stderr
, " -- has %d other links: unchanged",
} else if (exit_stat
== 2 && (!force
)) { /* No compression: remove file.Z */
fprintf(stderr
, " -- file unchanged");
} else { /* ***** Successful Compression ***** */
mode
= statbuf
.st_mode
& 07777;
if (chmod(ofname
, mode
)) /* Copy modes */
chown(ofname
, statbuf
.st_uid
, statbuf
.st_gid
); /* Copy ownership */
tp
.actime
= statbuf
.st_atime
;
tp
.modtime
= statbuf
.st_mtime
;
utime(ofname
, &tp
); /* Update last accessed and modified times */
if (unlink(ifname
)) /* Remove input file */
fprintf(stderr
, " -- replaced with %s", ofname
);
return; /* Successful return */
/* Unsuccessful return -- one of the tests failed */
oops ( ) /* wild pointer -- assume bad input */
fprintf ( stderr
, "uncompress: corrupt input\n" );
cl_block () /* table clear for block compress */
checkpoint
= in_count
+ CHECK_GAP
;
fprintf ( stderr
, "count: %ld, ratio: ", in_count
);
prratio ( stderr
, in_count
, bytes_out
);
if(in_count
> 0x007fffff) { /* shift will overflow */
if(rat
== 0) { /* Don't divide by zero */
rat
= (in_count
<< 8) / bytes_out
; /* 8 fractional bits */
dump_tab(); /* dump string table */
cl_hash ( (count_int
) hsize
);
output ( (code_int
) CLEAR
);
fprintf ( stderr
, "clear\n" );
cl_hash(hsize
) /* reset code table */
register count_int hsize
;
register count_int
*htab_p
= htab
+hsize
;
do { /* might use Sys V memset(3) here */
} while ((i
-= 16) >= 0);
for ( i
+= 16; i
> 0; i
-- )
prratio(stream
, num
, den
)
register int q
; /* Doesn't need to be long */
if(num
> 214748L) { /* 2147483647/10000 */
q
= num
/ (den
/ 10000L);
q
= 10000L * num
/ den
; /* Long calculations, though */
fprintf(stream
, "%d.%02d%%", q
/ 100, q
% 100);
"compress [-CDVcdfnv] [-b maxbits] [file ...]\n");
"compress [-Ccdfnv] [-b maxbits] [file ...]\n");