aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
Diffstat
-rw-r--r--Makefile10
-rw-r--r--bzip2.1.preformatted399
-rw-r--r--bzip2.txt391
-rwxr-xr-xprepare-release.sh2
4 files changed, 9 insertions, 793 deletions
diff --git a/Makefile b/Makefile
index f8a1772..b0fef95 100644
--- a/Makefile
+++ b/Makefile
@@ -135,7 +135,7 @@ bzip2recover.o: bzip2recover.c
135 135
136 136
137distclean: clean 137distclean: clean
138 rm -f manual.ps manual.html manual.pdf 138 rm -f manual.ps manual.html manual.pdf bzip2.txt bzip2.1.preformatted
139 139
140DISTNAME=bzip2-1.0.8 140DISTNAME=bzip2-1.0.8
141dist: check manual 141dist: check manual
@@ -205,7 +205,13 @@ dist: check manual
205MANUAL_SRCS= bz-common.xsl bz-fo.xsl bz-html.xsl bzip.css \ 205MANUAL_SRCS= bz-common.xsl bz-fo.xsl bz-html.xsl bzip.css \
206 entities.xml manual.xml 206 entities.xml manual.xml
207 207
208manual: manual.html manual.ps manual.pdf 208bzip2.txt: bzip2.1
209 MANWIDTH=67 man --ascii ./$^ > $@
210
211bzip2.1.preformatted: bzip2.1
212 MAN_KEEP_FORMATTING=1 MANWIDTH=67 man -E UTF-8 ./$^ > $@
213
214manual: manual.html manual.ps manual.pdf bzip2.txt bzip2.1.preformatted
209 215
210manual.ps: $(MANUAL_SRCS) 216manual.ps: $(MANUAL_SRCS)
211 ./xmlproc.sh -ps manual.xml 217 ./xmlproc.sh -ps manual.xml
diff --git a/bzip2.1.preformatted b/bzip2.1.preformatted
deleted file mode 100644
index 787f1c6..0000000
--- a/bzip2.1.preformatted
+++ /dev/null
@@ -1,399 +0,0 @@
1bzip2(1) bzip2(1)
2
3
4
5NNAAMMEE
6 bzip2, bunzip2 − a block‐sorting file compressor, v1.0.8
7 bzcat − decompresses files to stdout
8 bzip2recover − recovers data from damaged bzip2 files
9
10
11SSYYNNOOPPSSIISS
12 bbzziipp22 [ −−ccddffkkqqssttvvzzVVLL112233445566778899 ] [ _f_i_l_e_n_a_m_e_s _._._. ]
13 bbuunnzziipp22 [ −−ffkkvvssVVLL ] [ _f_i_l_e_n_a_m_e_s _._._. ]
14 bbzzccaatt [ −−ss ] [ _f_i_l_e_n_a_m_e_s _._._. ]
15 bbzziipp22rreeccoovveerr _f_i_l_e_n_a_m_e
16
17
18DDEESSCCRRIIPPTTIIOONN
19 _b_z_i_p_2 compresses files using the Burrows‐Wheeler block
20 sorting text compression algorithm, and Huffman coding.
21 Compression is generally considerably better than that
22 achieved by more conventional LZ77/LZ78‐based compressors,
23 and approaches the performance of the PPM family of sta­
24 tistical compressors.
25
26 The command‐line options are deliberately very similar to
27 those of _G_N_U _g_z_i_p_, but they are not identical.
28
29 _b_z_i_p_2 expects a list of file names to accompany the com­
30 mand‐line flags. Each file is replaced by a compressed
31 version of itself, with the name "original_name.bz2".
32 Each compressed file has the same modification date, per­
33 missions, and, when possible, ownership as the correspond­
34 ing original, so that these properties can be correctly
35 restored at decompression time. File name handling is
36 naive in the sense that there is no mechanism for preserv­
37 ing original file names, permissions, ownerships or dates
38 in filesystems which lack these concepts, or have serious
39 file name length restrictions, such as MS‐DOS.
40
41 _b_z_i_p_2 and _b_u_n_z_i_p_2 will by default not overwrite existing
42 files. If you want this to happen, specify the −f flag.
43
44 If no file names are specified, _b_z_i_p_2 compresses from
45 standard input to standard output. In this case, _b_z_i_p_2
46 will decline to write compressed output to a terminal, as
47 this would be entirely incomprehensible and therefore
48 pointless.
49
50 _b_u_n_z_i_p_2 (or _b_z_i_p_2 _−_d_) decompresses all specified files.
51 Files which were not created by _b_z_i_p_2 will be detected and
52 ignored, and a warning issued. _b_z_i_p_2 attempts to guess
53 the filename for the decompressed file from that of the
54 compressed file as follows:
55
56 filename.bz2 becomes filename
57 filename.bz becomes filename
58 filename.tbz2 becomes filename.tar
59 filename.tbz becomes filename.tar
60 anyothername becomes anyothername.out
61
62 If the file does not end in one of the recognised endings,
63 _._b_z_2_, _._b_z_, _._t_b_z_2 or _._t_b_z_, _b_z_i_p_2 complains that it cannot
64 guess the name of the original file, and uses the original
65 name with _._o_u_t appended.
66
67 As with compression, supplying no filenames causes decom­
68 pression from standard input to standard output.
69
70 _b_u_n_z_i_p_2 will correctly decompress a file which is the con­
71 catenation of two or more compressed files. The result is
72 the concatenation of the corresponding uncompressed files.
73 Integrity testing (−t) of concatenated compressed files is
74 also supported.
75
76 You can also compress or decompress files to the standard
77 output by giving the −c flag. Multiple files may be com­
78 pressed and decompressed like this. The resulting outputs
79 are fed sequentially to stdout. Compression of multiple
80 files in this manner generates a stream containing multi­
81 ple compressed file representations. Such a stream can be
82 decompressed correctly only by _b_z_i_p_2 version 0.9.0 or
83 later. Earlier versions of _b_z_i_p_2 will stop after decom­
84 pressing the first file in the stream.
85
86 _b_z_c_a_t (or _b_z_i_p_2 _‐_d_c_) decompresses all specified files to
87 the standard output.
88
89 _b_z_i_p_2 will read arguments from the environment variables
90 _B_Z_I_P_2 and _B_Z_I_P_, in that order, and will process them
91 before any arguments read from the command line. This
92 gives a convenient way to supply default arguments.
93
94 Compression is always performed, even if the compressed
95 file is slightly larger than the original. Files of less
96 than about one hundred bytes tend to get larger, since the
97 compression mechanism has a constant overhead in the
98 region of 50 bytes. Random data (including the output of
99 most file compressors) is coded at about 8.05 bits per
100 byte, giving an expansion of around 0.5%.
101
102 As a self‐check for your protection, _b_z_i_p_2 uses 32‐bit
103 CRCs to make sure that the decompressed version of a file
104 is identical to the original. This guards against corrup­
105 tion of the compressed data, and against undetected bugs
106 in _b_z_i_p_2 (hopefully very unlikely). The chances of data
107 corruption going undetected is microscopic, about one
108 chance in four billion for each file processed. Be aware,
109 though, that the check occurs upon decompression, so it
110 can only tell you that something is wrong. It can’t help
111 you recover the original uncompressed data. You can use
112 _b_z_i_p_2_r_e_c_o_v_e_r to try to recover data from damaged files.
113
114 Return values: 0 for a normal exit, 1 for environmental
115 problems (file not found, invalid flags, I/O errors, &c),
116 2 to indicate a corrupt compressed file, 3 for an internal
117 consistency error (eg, bug) which caused _b_z_i_p_2 to panic.
118
119
120OOPPTTIIOONNSS
121 −−cc ‐‐‐‐ssttddoouutt
122 Compress or decompress to standard output.
123
124 −−dd ‐‐‐‐ddeeccoommpprreessss
125 Force decompression. _b_z_i_p_2_, _b_u_n_z_i_p_2 and _b_z_c_a_t are
126 really the same program, and the decision about
127 what actions to take is done on the basis of which
128 name is used. This flag overrides that mechanism,
129 and forces _b_z_i_p_2 to decompress.
130
131 −−zz ‐‐‐‐ccoommpprreessss
132 The complement to −d: forces compression,
133 regardless of the invocation name.
134
135 −−tt ‐‐‐‐tteesstt
136 Check integrity of the specified file(s), but don’t
137 decompress them. This really performs a trial
138 decompression and throws away the result.
139
140 −−ff ‐‐‐‐ffoorrccee
141 Force overwrite of output files. Normally, _b_z_i_p_2
142 will not overwrite existing output files. Also
143 forces _b_z_i_p_2 to break hard links to files, which it
144 otherwise wouldn’t do.
145
146 bzip2 normally declines to decompress files which
147 don’t have the correct magic header bytes. If
148 forced (‐f), however, it will pass such files
149 through unmodified. This is how GNU gzip behaves.
150
151 −−kk ‐‐‐‐kkeeeepp
152 Keep (don’t delete) input files during compression
153 or decompression.
154
155 −−ss ‐‐‐‐ssmmaallll
156 Reduce memory usage, for compression, decompression
157 and testing. Files are decompressed and tested
158 using a modified algorithm which only requires 2.5
159 bytes per block byte. This means any file can be
160 decompressed in 2300k of memory, albeit at about
161 half the normal speed.
162
163 During compression, −s selects a block size of
164 200k, which limits memory use to around the same
165 figure, at the expense of your compression ratio.
166 In short, if your machine is low on memory (8
167 megabytes or less), use −s for everything. See
168 MEMORY MANAGEMENT below.
169
170 −−qq ‐‐‐‐qquuiieett
171 Suppress non‐essential warning messages. Messages
172 pertaining to I/O errors and other critical events
173 will not be suppressed.
174
175 −−vv ‐‐‐‐vveerrbboossee
176 Verbose mode ‐‐ show the compression ratio for each
177 file processed. Further −v’s increase the ver­
178 bosity level, spewing out lots of information which
179 is primarily of interest for diagnostic purposes.
180
181 −−LL ‐‐‐‐lliicceennssee ‐‐VV ‐‐‐‐vveerrssiioonn
182 Display the software version, license terms and
183 conditions.
184
185 −−11 ((oorr −−−−ffaasstt)) ttoo −−99 ((oorr −−−−bbeesstt))
186 Set the block size to 100 k, 200 k .. 900 k when
187 compressing. Has no effect when decompressing.
188 See MEMORY MANAGEMENT below. The −−fast and −−best
189 aliases are primarily for GNU gzip compatibility.
190 In particular, −−fast doesn’t make things signifi­
191 cantly faster. And −−best merely selects the
192 default behaviour.
193
194 −−‐‐ Treats all subsequent arguments as file names, even
195 if they start with a dash. This is so you can han­
196 dle files with names beginning with a dash, for
197 example: bzip2 −‐ −myfilename.
198
199 −−‐‐rreeppeettiittiivvee‐‐ffaasstt ‐‐‐‐rreeppeettiittiivvee‐‐bbeesstt
200 These flags are redundant in versions 0.9.5 and
201 above. They provided some coarse control over the
202 behaviour of the sorting algorithm in earlier ver­
203 sions, which was sometimes useful. 0.9.5 and above
204 have an improved algorithm which renders these
205 flags irrelevant.
206
207
208MMEEMMOORRYY MMAANNAAGGEEMMEENNTT
209 _b_z_i_p_2 compresses large files in blocks. The block size
210 affects both the compression ratio achieved, and the
211 amount of memory needed for compression and decompression.
212 The flags −1 through −9 specify the block size to be
213 100,000 bytes through 900,000 bytes (the default) respec­
214 tively. At decompression time, the block size used for
215 compression is read from the header of the compressed
216 file, and _b_u_n_z_i_p_2 then allocates itself just enough memory
217 to decompress the file. Since block sizes are stored in
218 compressed files, it follows that the flags −1 to −9 are
219 irrelevant to and so ignored during decompression.
220
221 Compression and decompression requirements, in bytes, can
222 be estimated as:
223
224 Compression: 400k + ( 8 x block size )
225
226 Decompression: 100k + ( 4 x block size ), or
227 100k + ( 2.5 x block size )
228
229 Larger block sizes give rapidly diminishing marginal
230 returns. Most of the compression comes from the first two
231 or three hundred k of block size, a fact worth bearing in
232 mind when using _b_z_i_p_2 on small machines. It is also
233 important to appreciate that the decompression memory
234 requirement is set at compression time by the choice of
235 block size.
236
237 For files compressed with the default 900k block size,
238 _b_u_n_z_i_p_2 will require about 3700 kbytes to decompress. To
239 support decompression of any file on a 4 megabyte machine,
240 _b_u_n_z_i_p_2 has an option to decompress using approximately
241 half this amount of memory, about 2300 kbytes. Decompres­
242 sion speed is also halved, so you should use this option
243 only where necessary. The relevant flag is ‐s.
244
245 In general, try and use the largest block size memory con­
246 straints allow, since that maximises the compression
247 achieved. Compression and decompression speed are virtu­
248 ally unaffected by block size.
249
250 Another significant point applies to files which fit in a
251 single block ‐‐ that means most files you’d encounter
252 using a large block size. The amount of real memory
253 touched is proportional to the size of the file, since the
254 file is smaller than a block. For example, compressing a
255 file 20,000 bytes long with the flag ‐9 will cause the
256 compressor to allocate around 7600k of memory, but only
257 touch 400k + 20000 * 8 = 560 kbytes of it. Similarly, the
258 decompressor will allocate 3700k but only touch 100k +
259 20000 * 4 = 180 kbytes.
260
261 Here is a table which summarises the maximum memory usage
262 for different block sizes. Also recorded is the total
263 compressed size for 14 files of the Calgary Text Compres­
264 sion Corpus totalling 3,141,622 bytes. This column gives
265 some feel for how compression varies with block size.
266 These figures tend to understate the advantage of larger
267 block sizes for larger files, since the Corpus is domi­
268 nated by smaller files.
269
270 Compress Decompress Decompress Corpus
271 Flag usage usage ‐s usage Size
272
273 ‐1 1200k 500k 350k 914704
274 ‐2 2000k 900k 600k 877703
275 ‐3 2800k 1300k 850k 860338
276 ‐4 3600k 1700k 1100k 846899
277 ‐5 4400k 2100k 1350k 845160
278 ‐6 5200k 2500k 1600k 838626
279 ‐7 6100k 2900k 1850k 834096
280 ‐8 6800k 3300k 2100k 828642
281 ‐9 7600k 3700k 2350k 828642
282
283
284RREECCOOVVEERRIINNGG DDAATTAA FFRROOMM DDAAMMAAGGEEDD FFIILLEESS
285 _b_z_i_p_2 compresses files in blocks, usually 900kbytes long.
286 Each block is handled independently. If a media or trans­
287 mission error causes a multi‐block .bz2 file to become
288 damaged, it may be possible to recover data from the
289 undamaged blocks in the file.
290
291 The compressed representation of each block is delimited
292 by a 48‐bit pattern, which makes it possible to find the
293 block boundaries with reasonable certainty. Each block
294 also carries its own 32‐bit CRC, so damaged blocks can be
295 distinguished from undamaged ones.
296
297 _b_z_i_p_2_r_e_c_o_v_e_r is a simple program whose purpose is to
298 search for blocks in .bz2 files, and write each block out
299 into its own .bz2 file. You can then use _b_z_i_p_2 −t to test
300 the integrity of the resulting files, and decompress those
301 which are undamaged.
302
303 _b_z_i_p_2_r_e_c_o_v_e_r takes a single argument, the name of the dam­
304 aged file, and writes a number of files
305 "rec00001file.bz2", "rec00002file.bz2", etc, containing
306 the extracted blocks. The output filenames are
307 designed so that the use of wildcards in subsequent pro­
308 cessing ‐‐ for example, "bzip2 ‐dc rec*file.bz2 > recov­
309 ered_data" ‐‐ processes the files in the correct order.
310
311 _b_z_i_p_2_r_e_c_o_v_e_r should be of most use dealing with large .bz2
312 files, as these will contain many blocks. It is clearly
313 futile to use it on damaged single‐block files, since a
314 damaged block cannot be recovered. If you wish to min­
315 imise any potential data loss through media or transmis­
316 sion errors, you might consider compressing with a smaller
317 block size.
318
319
320PPEERRFFOORRMMAANNCCEE NNOOTTEESS
321 The sorting phase of compression gathers together similar
322 strings in the file. Because of this, files containing
323 very long runs of repeated symbols, like "aabaabaabaab
324 ..." (repeated several hundred times) may compress more
325 slowly than normal. Versions 0.9.5 and above fare much
326 better than previous versions in this respect. The ratio
327 between worst‐case and average‐case compression time is in
328 the region of 10:1. For previous versions, this figure
329 was more like 100:1. You can use the −vvvv option to mon­
330 itor progress in great detail, if you want.
331
332 Decompression speed is unaffected by these phenomena.
333
334 _b_z_i_p_2 usually allocates several megabytes of memory to
335 operate in, and then charges all over it in a fairly ran­
336 dom fashion. This means that performance, both for com­
337 pressing and decompressing, is largely determined by the
338 speed at which your machine can service cache misses.
339 Because of this, small changes to the code to reduce the
340 miss rate have been observed to give disproportionately
341 large performance improvements. I imagine _b_z_i_p_2 will per­
342 form best on machines with very large caches.
343
344
345CCAAVVEEAATTSS
346 I/O error messages are not as helpful as they could be.
347 _b_z_i_p_2 tries hard to detect I/O errors and exit cleanly,
348 but the details of what the problem is sometimes seem
349 rather misleading.
350
351 This manual page pertains to version 1.0.8 of _b_z_i_p_2_. Com­
352 pressed data created by this version is entirely forwards
353 and backwards compatible with the previous public
354 releases, versions 0.1pl2, 0.9.0, 0.9.5, 1.0.0, 1.0.1,
355 1.0.2 and above, but with the following exception: 0.9.0
356 and above can correctly decompress multiple concatenated
357 compressed files. 0.1pl2 cannot do this; it will stop
358 after decompressing just the first file in the stream.
359
360 _b_z_i_p_2_r_e_c_o_v_e_r versions prior to 1.0.2 used 32‐bit integers
361 to represent bit positions in compressed files, so they
362 could not handle compressed files more than 512 megabytes
363 long. Versions 1.0.2 and above use 64‐bit ints on some
364 platforms which support them (GNU supported targets, and
365 Windows). To establish whether or not bzip2recover was
366 built with such a limitation, run it without arguments.
367 In any event you can build yourself an unlimited version
368 if you can recompile it with MaybeUInt64 set to be an
369 unsigned 64‐bit integer.
370
371
372
373
374AAUUTTHHOORR
375 Julian Seward, jseward@acm.org.
376
377 https://sourceware.org/bzip2/
378
379 The ideas embodied in _b_z_i_p_2 are due to (at least) the fol­
380 lowing people: Michael Burrows and David Wheeler (for the
381 block sorting transformation), David Wheeler (again, for
382 the Huffman coder), Peter Fenwick (for the structured cod­
383 ing model in the original _b_z_i_p_, and many refinements), and
384 Alistair Moffat, Radford Neal and Ian Witten (for the
385 arithmetic coder in the original _b_z_i_p_)_. I am much
386 indebted for their help, support and advice. See the man­
387 ual in the source distribution for pointers to sources of
388 documentation. Christian von Roques encouraged me to look
389 for faster sorting algorithms, so as to speed up compres­
390 sion. Bela Lubkin encouraged me to improve the worst‐case
391 compression performance. Donna Robinson XMLised the docu­
392 mentation. The bz* scripts are derived from those of GNU
393 gzip. Many people sent patches, helped with portability
394 problems, lent machines, gave advice and were generally
395 helpful.
396
397
398
399 bzip2(1)
diff --git a/bzip2.txt b/bzip2.txt
deleted file mode 100644
index a50570b..0000000
--- a/bzip2.txt
+++ /dev/null
@@ -1,391 +0,0 @@
1
2NAME
3 bzip2, bunzip2 - a block-sorting file compressor, v1.0.8
4 bzcat - decompresses files to stdout
5 bzip2recover - recovers data from damaged bzip2 files
6
7
8SYNOPSIS
9 bzip2 [ -cdfkqstvzVL123456789 ] [ filenames ... ]
10 bunzip2 [ -fkvsVL ] [ filenames ... ]
11 bzcat [ -s ] [ filenames ... ]
12 bzip2recover filename
13
14
15DESCRIPTION
16 bzip2 compresses files using the Burrows-Wheeler block
17 sorting text compression algorithm, and Huffman coding.
18 Compression is generally considerably better than that
19 achieved by more conventional LZ77/LZ78-based compressors,
20 and approaches the performance of the PPM family of sta-
21 tistical compressors.
22
23 The command-line options are deliberately very similar to
24 those of GNU gzip, but they are not identical.
25
26 bzip2 expects a list of file names to accompany the com-
27 mand-line flags. Each file is replaced by a compressed
28 version of itself, with the name "original_name.bz2".
29 Each compressed file has the same modification date, per-
30 missions, and, when possible, ownership as the correspond-
31 ing original, so that these properties can be correctly
32 restored at decompression time. File name handling is
33 naive in the sense that there is no mechanism for preserv-
34 ing original file names, permissions, ownerships or dates
35 in filesystems which lack these concepts, or have serious
36 file name length restrictions, such as MS-DOS.
37
38 bzip2 and bunzip2 will by default not overwrite existing
39 files. If you want this to happen, specify the -f flag.
40
41 If no file names are specified, bzip2 compresses from
42 standard input to standard output. In this case, bzip2
43 will decline to write compressed output to a terminal, as
44 this would be entirely incomprehensible and therefore
45 pointless.
46
47 bunzip2 (or bzip2 -d) decompresses all specified files.
48 Files which were not created by bzip2 will be detected and
49 ignored, and a warning issued. bzip2 attempts to guess
50 the filename for the decompressed file from that of the
51 compressed file as follows:
52
53 filename.bz2 becomes filename
54 filename.bz becomes filename
55 filename.tbz2 becomes filename.tar
56 filename.tbz becomes filename.tar
57 anyothername becomes anyothername.out
58
59 If the file does not end in one of the recognised endings,
60 .bz2, .bz, .tbz2 or .tbz, bzip2 complains that it cannot
61 guess the name of the original file, and uses the original
62 name with .out appended.
63
64 As with compression, supplying no filenames causes decom-
65 pression from standard input to standard output.
66
67 bunzip2 will correctly decompress a file which is the con-
68 catenation of two or more compressed files. The result is
69 the concatenation of the corresponding uncompressed files.
70 Integrity testing (-t) of concatenated compressed files is
71 also supported.
72
73 You can also compress or decompress files to the standard
74 output by giving the -c flag. Multiple files may be com-
75 pressed and decompressed like this. The resulting outputs
76 are fed sequentially to stdout. Compression of multiple
77 files in this manner generates a stream containing multi-
78 ple compressed file representations. Such a stream can be
79 decompressed correctly only by bzip2 version 0.9.0 or
80 later. Earlier versions of bzip2 will stop after decom-
81 pressing the first file in the stream.
82
83 bzcat (or bzip2 -dc) decompresses all specified files to
84 the standard output.
85
86 bzip2 will read arguments from the environment variables
87 BZIP2 and BZIP, in that order, and will process them
88 before any arguments read from the command line. This
89 gives a convenient way to supply default arguments.
90
91 Compression is always performed, even if the compressed
92 file is slightly larger than the original. Files of less
93 than about one hundred bytes tend to get larger, since the
94 compression mechanism has a constant overhead in the
95 region of 50 bytes. Random data (including the output of
96 most file compressors) is coded at about 8.05 bits per
97 byte, giving an expansion of around 0.5%.
98
99 As a self-check for your protection, bzip2 uses 32-bit
100 CRCs to make sure that the decompressed version of a file
101 is identical to the original. This guards against corrup-
102 tion of the compressed data, and against undetected bugs
103 in bzip2 (hopefully very unlikely). The chances of data
104 corruption going undetected is microscopic, about one
105 chance in four billion for each file processed. Be aware,
106 though, that the check occurs upon decompression, so it
107 can only tell you that something is wrong. It can't help
108 you recover the original uncompressed data. You can use
109 bzip2recover to try to recover data from damaged files.
110
111 Return values: 0 for a normal exit, 1 for environmental
112 problems (file not found, invalid flags, I/O errors, &c),
113 2 to indicate a corrupt compressed file, 3 for an internal
114 consistency error (eg, bug) which caused bzip2 to panic.
115
116
117OPTIONS
118 -c --stdout
119 Compress or decompress to standard output.
120
121 -d --decompress
122 Force decompression. bzip2, bunzip2 and bzcat are
123 really the same program, and the decision about
124 what actions to take is done on the basis of which
125 name is used. This flag overrides that mechanism,
126 and forces bzip2 to decompress.
127
128 -z --compress
129 The complement to -d: forces compression,
130 regardless of the invocation name.
131
132 -t --test
133 Check integrity of the specified file(s), but don't
134 decompress them. This really performs a trial
135 decompression and throws away the result.
136
137 -f --force
138 Force overwrite of output files. Normally, bzip2
139 will not overwrite existing output files. Also
140 forces bzip2 to break hard links to files, which it
141 otherwise wouldn't do.
142
143 bzip2 normally declines to decompress files which
144 don't have the correct magic header bytes. If
145 forced (-f), however, it will pass such files
146 through unmodified. This is how GNU gzip behaves.
147
148 -k --keep
149 Keep (don't delete) input files during compression
150 or decompression.
151
152 -s --small
153 Reduce memory usage, for compression, decompression
154 and testing. Files are decompressed and tested
155 using a modified algorithm which only requires 2.5
156 bytes per block byte. This means any file can be
157 decompressed in 2300k of memory, albeit at about
158 half the normal speed.
159
160 During compression, -s selects a block size of
161 200k, which limits memory use to around the same
162 figure, at the expense of your compression ratio.
163 In short, if your machine is low on memory (8
164 megabytes or less), use -s for everything. See
165 MEMORY MANAGEMENT below.
166
167 -q --quiet
168 Suppress non-essential warning messages. Messages
169 pertaining to I/O errors and other critical events
170 will not be suppressed.
171
172 -v --verbose
173 Verbose mode -- show the compression ratio for each
174 file processed. Further -v's increase the ver-
175 bosity level, spewing out lots of information which
176 is primarily of interest for diagnostic purposes.
177
178 -L --license -V --version
179 Display the software version, license terms and
180 conditions.
181
182 -1 (or --fast) to -9 (or --best)
183 Set the block size to 100 k, 200 k .. 900 k when
184 compressing. Has no effect when decompressing.
185 See MEMORY MANAGEMENT below. The --fast and --best
186 aliases are primarily for GNU gzip compatibility.
187 In particular, --fast doesn't make things signifi-
188 cantly faster. And --best merely selects the
189 default behaviour.
190
191 -- Treats all subsequent arguments as file names, even
192 if they start with a dash. This is so you can han-
193 dle files with names beginning with a dash, for
194 example: bzip2 -- -myfilename.
195
196 --repetitive-fast --repetitive-best
197 These flags are redundant in versions 0.9.5 and
198 above. They provided some coarse control over the
199 behaviour of the sorting algorithm in earlier ver-
200 sions, which was sometimes useful. 0.9.5 and above
201 have an improved algorithm which renders these
202 flags irrelevant.
203
204
205MEMORY MANAGEMENT
206 bzip2 compresses large files in blocks. The block size
207 affects both the compression ratio achieved, and the
208 amount of memory needed for compression and decompression.
209 The flags -1 through -9 specify the block size to be
210 100,000 bytes through 900,000 bytes (the default) respec-
211 tively. At decompression time, the block size used for
212 compression is read from the header of the compressed
213 file, and bunzip2 then allocates itself just enough memory
214 to decompress the file. Since block sizes are stored in
215 compressed files, it follows that the flags -1 to -9 are
216 irrelevant to and so ignored during decompression.
217
218 Compression and decompression requirements, in bytes, can
219 be estimated as:
220
221 Compression: 400k + ( 8 x block size )
222
223 Decompression: 100k + ( 4 x block size ), or
224 100k + ( 2.5 x block size )
225
226 Larger block sizes give rapidly diminishing marginal
227 returns. Most of the compression comes from the first two
228 or three hundred k of block size, a fact worth bearing in
229 mind when using bzip2 on small machines. It is also
230 important to appreciate that the decompression memory
231 requirement is set at compression time by the choice of
232 block size.
233
234 For files compressed with the default 900k block size,
235 bunzip2 will require about 3700 kbytes to decompress. To
236 support decompression of any file on a 4 megabyte machine,
237 bunzip2 has an option to decompress using approximately
238 half this amount of memory, about 2300 kbytes. Decompres-
239 sion speed is also halved, so you should use this option
240 only where necessary. The relevant flag is -s.
241
242 In general, try and use the largest block size memory con-
243 straints allow, since that maximises the compression
244 achieved. Compression and decompression speed are virtu-
245 ally unaffected by block size.
246
247 Another significant point applies to files which fit in a
248 single block -- that means most files you'd encounter
249 using a large block size. The amount of real memory
250 touched is proportional to the size of the file, since the
251 file is smaller than a block. For example, compressing a
252 file 20,000 bytes long with the flag -9 will cause the
253 compressor to allocate around 7600k of memory, but only
254 touch 400k + 20000 * 8 = 560 kbytes of it. Similarly, the
255 decompressor will allocate 3700k but only touch 100k +
256 20000 * 4 = 180 kbytes.
257
258 Here is a table which summarises the maximum memory usage
259 for different block sizes. Also recorded is the total
260 compressed size for 14 files of the Calgary Text Compres-
261 sion Corpus totalling 3,141,622 bytes. This column gives
262 some feel for how compression varies with block size.
263 These figures tend to understate the advantage of larger
264 block sizes for larger files, since the Corpus is domi-
265 nated by smaller files.
266
267 Compress Decompress Decompress Corpus
268 Flag usage usage -s usage Size
269
270 -1 1200k 500k 350k 914704
271 -2 2000k 900k 600k 877703
272 -3 2800k 1300k 850k 860338
273 -4 3600k 1700k 1100k 846899
274 -5 4400k 2100k 1350k 845160
275 -6 5200k 2500k 1600k 838626
276 -7 6100k 2900k 1850k 834096
277 -8 6800k 3300k 2100k 828642
278 -9 7600k 3700k 2350k 828642
279
280
281RECOVERING DATA FROM DAMAGED FILES
282 bzip2 compresses files in blocks, usually 900kbytes long.
283 Each block is handled independently. If a media or trans-
284 mission error causes a multi-block .bz2 file to become
285 damaged, it may be possible to recover data from the
286 undamaged blocks in the file.
287
288 The compressed representation of each block is delimited
289 by a 48-bit pattern, which makes it possible to find the
290 block boundaries with reasonable certainty. Each block
291 also carries its own 32-bit CRC, so damaged blocks can be
292 distinguished from undamaged ones.
293
294 bzip2recover is a simple program whose purpose is to
295 search for blocks in .bz2 files, and write each block out
296 into its own .bz2 file. You can then use bzip2 -t to test
297 the integrity of the resulting files, and decompress those
298 which are undamaged.
299
300 bzip2recover takes a single argument, the name of the dam-
301 aged file, and writes a number of files
302 "rec00001file.bz2", "rec00002file.bz2", etc, containing
303 the extracted blocks. The output filenames are
304 designed so that the use of wildcards in subsequent pro-
305 cessing -- for example, "bzip2 -dc rec*file.bz2 > recov-
306 ered_data" -- processes the files in the correct order.
307
308 bzip2recover should be of most use dealing with large .bz2
309 files, as these will contain many blocks. It is clearly
310 futile to use it on damaged single-block files, since a
311 damaged block cannot be recovered. If you wish to min-
312 imise any potential data loss through media or transmis-
313 sion errors, you might consider compressing with a smaller
314 block size.
315
316
317PERFORMANCE NOTES
318 The sorting phase of compression gathers together similar
319 strings in the file. Because of this, files containing
320 very long runs of repeated symbols, like "aabaabaabaab
321 ..." (repeated several hundred times) may compress more
322 slowly than normal. Versions 0.9.5 and above fare much
323 better than previous versions in this respect. The ratio
324 between worst-case and average-case compression time is in
325 the region of 10:1. For previous versions, this figure
326 was more like 100:1. You can use the -vvvv option to mon-
327 itor progress in great detail, if you want.
328
329 Decompression speed is unaffected by these phenomena.
330
331 bzip2 usually allocates several megabytes of memory to
332 operate in, and then charges all over it in a fairly ran-
333 dom fashion. This means that performance, both for com-
334 pressing and decompressing, is largely determined by the
335 speed at which your machine can service cache misses.
336 Because of this, small changes to the code to reduce the
337 miss rate have been observed to give disproportionately
338 large performance improvements. I imagine bzip2 will per-
339 form best on machines with very large caches.
340
341
342CAVEATS
343 I/O error messages are not as helpful as they could be.
344 bzip2 tries hard to detect I/O errors and exit cleanly,
345 but the details of what the problem is sometimes seem
346 rather misleading.
347
348 This manual page pertains to version 1.0.8 of bzip2. Com-
349 pressed data created by this version is entirely forwards
350 and backwards compatible with the previous public
351 releases, versions 0.1pl2, 0.9.0, 0.9.5, 1.0.0, 1.0.1,
352 1.0.2 and above, but with the following exception: 0.9.0
353 and above can correctly decompress multiple concatenated
354 compressed files. 0.1pl2 cannot do this; it will stop
355 after decompressing just the first file in the stream.
356
357 bzip2recover versions prior to 1.0.2 used 32-bit integers
358 to represent bit positions in compressed files, so they
359 could not handle compressed files more than 512 megabytes
360 long. Versions 1.0.2 and above use 64-bit ints on some
361 platforms which support them (GNU supported targets, and
362 Windows). To establish whether or not bzip2recover was
363 built with such a limitation, run it without arguments.
364 In any event you can build yourself an unlimited version
365 if you can recompile it with MaybeUInt64 set to be an
366 unsigned 64-bit integer.
367
368
369AUTHOR
370 Julian Seward, jseward@acm.org
371
372 https://sourceware.org/bzip2/
373
374 The ideas embodied in bzip2 are due to (at least) the fol-
375 lowing people: Michael Burrows and David Wheeler (for the
376 block sorting transformation), David Wheeler (again, for
377 the Huffman coder), Peter Fenwick (for the structured cod-
378 ing model in the original bzip, and many refinements), and
379 Alistair Moffat, Radford Neal and Ian Witten (for the
380 arithmetic coder in the original bzip). I am much
381 indebted for their help, support and advice. See the man-
382 ual in the source distribution for pointers to sources of
383 documentation. Christian von Roques encouraged me to look
384 for faster sorting algorithms, so as to speed up compres-
385 sion. Bela Lubkin encouraged me to improve the worst-case
386 compression performance. Donna Robinson XMLised the docu-
387 mentation. The bz* scripts are derived from those of GNU
388 gzip. Many people sent patches, helped with portability
389 problems, lent machines, gave advice and were generally
390 helpful.
391
diff --git a/prepare-release.sh b/prepare-release.sh
index 12c29f7..1bc8474 100755
--- a/prepare-release.sh
+++ b/prepare-release.sh
@@ -45,7 +45,7 @@ sed -i -e "s@ENTITY bz-version \".*\"@ENTITY bz-version \"$VERSION\"@" \
45# isn't, so explicitly change it here too. 45# isn't, so explicitly change it here too.
46sed -i -e "s@This manual page pertains to version .* of@This manual page pertains to version $VERSION of@" \ 46sed -i -e "s@This manual page pertains to version .* of@This manual page pertains to version $VERSION of@" \
47 -e "s@sorting file compressor, v.*@sorting file compressor, v$VERSION@" \ 47 -e "s@sorting file compressor, v.*@sorting file compressor, v$VERSION@" \
48 bzip2.1* bzip2.txt 48 bzip2.1
49 49
50# Update sources. All sources, use bzlib_private. 50# Update sources. All sources, use bzlib_private.
51# Except bzip2recover, which embeds a version string... 51# Except bzip2recover, which embeds a version string...
generated by cgit v1.2.3-55-g6feb (git 2.39.1) at 2026-01-06 07:36:21 +0000