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. Neither the name of the University nor the names of its contributors
17 .\" may be used to endorse or promote products derived from this software
18 .\" without specific prior written permission.
20 .\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
21 .\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22 .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23 .\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
24 .\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25 .\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26 .\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27 .\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28 .\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29 .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 .\" @(#)compress.1 8.2 (Berkeley) 4/18/94
33 .\" $FreeBSD: src/usr.bin/compress/compress.1,v 1.4.2.8 2002/07/15 04:41:52 keramida Exp $
34 .\" $DragonFly: src/usr.bin/compress/compress.1,v 1.3 2007/04/26 20:08:56 swildner Exp $
42 .Nd compress and expand data
54 utility reduces the size of the named files using adaptive Lempel-Ziv coding.
57 is renamed to the same name plus the extension
59 As many of the modification time, access time, file flags, file mode,
60 user ID, and group ID as allowed by permissions are retained in the
62 If compression would not reduce the size of a
68 utility restores the compressed files to their original form, renaming the
73 If renaming the files would cause files to be overwritten and the standard
74 input device is a terminal, the user is prompted (on the standard error
75 output) for confirmation.
76 If prompting is not possible or confirmation is not received, the files
79 If no files are specified or a
81 argument is a single dash
83 the standard input is compressed or uncompressed to the standard output.
84 If either the input and output files are not regular files, the checks for
85 reduction in size and file overwriting are not performed, the input file is
86 not removed, and the attributes of the input file are not retained.
88 The options are as follows:
89 .Bl -tag -width indent
93 code limit (see below).
95 Compressed or uncompressed output is written to the standard output.
96 No files are modified.
100 even if it is not actually reduced in size.
101 Additionally, files are overwritten without prompting for confirmation.
103 Print the percentage reduction of each file.
108 utility uses a modified Lempel-Ziv algorithm.
109 Common substrings in the file are first replaced by 9-bit codes 257 and up.
110 When code 512 is reached, the algorithm switches to 10-bit codes and
111 continues to use more bits until the
112 limit specified by the
114 flag is reached (the default is 16).
116 must be between 9 and 16.
122 periodically checks the compression ratio.
125 continues to use the existing code dictionary.
126 However, if the compression ratio decreases,
128 discards the table of substrings and rebuilds it from scratch. This allows
129 the algorithm to adapt to the next "block" of the file.
137 parameter specified during compression
138 is encoded within the output, along with
139 a magic number to ensure that neither decompression of random data nor
140 recompression of compressed data is attempted.
142 The amount of compression obtained depends on the size of the
145 per code, and the distribution of common substrings.
146 Typically, text such as source code or English is reduced by 50\-60%.
147 Compression is generally much better than that achieved by Huffman
148 coding (as used in the historical command pack), or adaptive Huffman
149 coding (as used in the historical command compact), and takes less
152 .Ex -std compress uncompress
156 utility exits 2 if attempting to compress the file would not reduce its size
159 option was not specified.
170 .%T "A Technique for High Performance Data Compression"