1 .\" $NetBSD: compress.1,v 1.6 1997/09/15 10:58:37 lukem Exp $
3 .\" Copyright (c) 1986, 1990, 1993
4 .\" The Regents of the University of California. All rights reserved.
6 .\" This code is derived from software contributed to Berkeley by
7 .\" James A. Woods, derived from original work by Spencer Thomas
10 .\" Redistribution and use in source and binary forms, with or without
11 .\" modification, are permitted provided that the following conditions
13 .\" 1. Redistributions of source code must retain the above copyright
14 .\" notice, this list of conditions and the following disclaimer.
15 .\" 2. Redistributions in binary form must reproduce the above copyright
16 .\" notice, this list of conditions and the following disclaimer in the
17 .\" documentation and/or other materials provided with the distribution.
18 .\" 3. All advertising materials mentioning features or use of this software
19 .\" must display the following acknowledgement:
20 .\" This product includes software developed by the University of
21 .\" California, Berkeley and its contributors.
22 .\" 4. Neither the name of the University nor the names of its contributors
23 .\" may be used to endorse or promote products derived from this software
24 .\" without specific prior written permission.
26 .\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
27 .\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29 .\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
30 .\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
31 .\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32 .\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33 .\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34 .\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35 .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
38 .\" @(#)compress.1 8.2 (Berkeley) 4/18/94
48 .Nd compress and expand data
61 reduces the size of the named files using adaptive Lempel-Ziv coding.
64 is renamed to the same name plus the extension
66 As many of the modification time, access time, file flags, file mode,
67 user ID, and group ID as allowed by permissions are retained in the
69 If compression would not reduce the size of a
74 restores the compressed files to their original form, renaming the
81 .\".Dq "uncompress -c" .
83 If renaming the files would cause files to be overwritten and the standard
84 input device is a terminal, the user is prompted (on the standard error
85 output) for confirmation.
86 If prompting is not possible or confirmation is not received, the files
89 If no files are specified, the standard input is compressed or uncompressed
90 to the standard output.
91 If either the input and output files are not regular files, the checks for
92 reduction in size and file overwriting are not performed, the input file is
93 not removed, and the attributes of the input file are not retained.
95 The options are as follows:
100 code limit (see below).
102 Compressed or uncompressed output is written to the standard output.
103 No files are modified.
107 even if it is not actually reduced in size.
108 Additionally, files are overwritten without prompting for confirmation.
110 Print the percentage reduction of each file.
114 uses a modified Lempel-Ziv algorithm.
115 Common substrings in the file are first replaced by 9-bit codes 257 and up.
116 When code 512 is reached, the algorithm switches to 10-bit codes and
117 continues to use more bits until the
118 limit specified by the
120 flag is reached (the default is 16).
122 must be between 9 and 16.
128 periodically checks the compression ratio.
131 continues to use the existing code dictionary.
132 However, if the compression ratio decreases,
134 discards the table of substrings and rebuilds it from scratch. This allows
135 the algorithm to adapt to the next "block" of the file.
143 parameter specified during compression
144 is encoded within the output, along with
145 a magic number to ensure that neither decompression of random data nor
146 recompression of compressed data is attempted.
149 The amount of compression obtained depends on the size of the
152 per code, and the distribution of common substrings.
153 Typically, text such as source code or English is reduced by 50\-60%.
154 Compression is generally much better than that achieved by Huffman
155 coding (as used in the historical command pack), or adaptive Huffman
156 coding (as used in the historical command compact), and takes less
161 utility exits 0 on success, and >0 if an error occurs.
167 .%T "A Technique for High Performance Data Compression"