1 .\" Copyright (c) 1986, 1990, 1993
2 .\" The Regents of the University of California. All rights reserved.
4 .\" This code is derived from software contributed to Berkeley by
5 .\" James A. Woods, derived from original work by Spencer Thomas
8 .\" Redistribution and use in source and binary forms, with or without
9 .\" modification, are permitted provided that the following conditions
11 .\" 1. Redistributions of source code must retain the above copyright
12 .\" notice, this list of conditions and the following disclaimer.
13 .\" 2. Redistributions in binary form must reproduce the above copyright
14 .\" notice, this list of conditions and the following disclaimer in the
15 .\" documentation and/or other materials provided with the distribution.
16 .\" 3. All advertising materials mentioning features or use of this software
17 .\" must display the following acknowledgement:
18 .\" This product includes software developed by the University of
19 .\" California, Berkeley and its contributors.
20 .\" 4. Neither the name of the University nor the names of its contributors
21 .\" may be used to endorse or promote products derived from this software
22 .\" without specific prior written permission.
24 .\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 .\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 .\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 .\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 .\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 .\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 .\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 .\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 .\" @(#)compress.1 8.2 (Berkeley) 4/18/94
37 .\" $FreeBSD: src/usr.bin/compress/compress.1,v 1.19 2004/07/05 17:12:53 ru Exp $
45 .Nd compress and expand data
57 utility reduces the size of the named files using adaptive Lempel-Ziv coding.
60 is renamed to the same name plus the extension
62 As many of the modification time, access time, file flags, file mode,
63 user ID, and group ID as allowed by permissions are retained in the
65 If compression would not reduce the size of a
71 utility restores the compressed files to their original form, renaming the
76 If renaming the files would cause files to be overwritten and the standard
77 input device is a terminal, the user is prompted (on the standard error
78 output) for confirmation.
79 If prompting is not possible or confirmation is not received, the files
82 If no files are specified or a
84 argument is a single dash
86 the standard input is compressed or uncompressed to the standard output.
87 If either the input and output files are not regular files, the checks for
88 reduction in size and file overwriting are not performed, the input file is
89 not removed, and the attributes of the input file are not retained.
91 The options are as follows:
92 .Bl -tag -width indent
96 code limit (see below).
98 Compressed or uncompressed output is written to the standard output.
99 No files are modified.
103 even if it is not actually reduced in size.
104 Additionally, files are overwritten without prompting for confirmation.
106 Print the percentage reduction of each file.
111 utility uses a modified Lempel-Ziv algorithm.
112 Common substrings in the file are first replaced by 9-bit codes 257 and up.
113 When code 512 is reached, the algorithm switches to 10-bit codes and
114 continues to use more bits until the
115 limit specified by the
117 flag is reached (the default is 16).
119 must be between 9 and 16.
125 periodically checks the compression ratio.
128 continues to use the existing code dictionary.
129 However, if the compression ratio decreases,
131 discards the table of substrings and rebuilds it from scratch.
133 the algorithm to adapt to the next "block" of the file.
141 parameter specified during compression
142 is encoded within the output, along with
143 a magic number to ensure that neither decompression of random data nor
144 recompression of compressed data is attempted.
146 The amount of compression obtained depends on the size of the
149 per code, and the distribution of common substrings.
150 Typically, text such as source code or English is reduced by 50\-60%.
151 Compression is generally much better than that achieved by Huffman
152 coding (as used in the historical command pack), or adaptive Huffman
153 coding (as used in the historical command compact), and takes less
156 .Ex -std compress uncompress
160 utility exits 2 if attempting to compress the file would not reduce its size
163 option was not specified.
174 .%T "A Technique for High Performance Data Compression"