6.31. Bzip2-1.0.5

The Bzip2 package contains programs for compressing and decompressing files. Compressing text files with bzip2 yields a much better compression percentage than with the traditional gzip.

Approximate build time: less than 0.1 SBU
Required disk space: 6.5 MB

6.31.1. Installation of Bzip2

Apply a patch to install the documentation for this package:

patch -Np1 -i ../bzip2-1.0.5-install_docs-1.patch

Prepare Bzip2 for compilation with:

make -f Makefile-libbz2_so
make clean

The meaning of the make parameter:

-f Makefile-libbz2_so

This will cause Bzip2 to be built using a different Makefile file, in this case the Makefile-libbz2_so file, which creates a dynamic libbz2.so library and links the Bzip2 utilities against it.

Compile and test the package:


Install the programs:

make PREFIX=/usr install

Install the shared bzip2 binary into the /bin directory, make some necessary symbolic links, and clean up:

cp -v bzip2-shared /bin/bzip2
cp -av libbz2.so* /lib
ln -sv ../../lib/libbz2.so.1.0 /usr/lib/libbz2.so
rm -v /usr/bin/{bunzip2,bzcat,bzip2}
ln -sv bzip2 /bin/bunzip2
ln -sv bzip2 /bin/bzcat

6.31.2. Contents of Bzip2

Installed programs: bunzip2 (link to bzip2), bzcat (link to bzip2), bzcmp (link to bzdiff), bzdiff, bzegrep (link to bzgrep), bzfgrep (link to bzgrep), bzgrep, bzip2, bzip2recover, bzless (link to bzmore), and bzmore
Installed libraries: libbz2.{a,so}

Short Descriptions


Decompresses bzipped files


Decompresses to standard output


Runs cmp on bzipped files


Runs diff on bzipped files


Runs grep on bzipped files


Runs egrep on bzipped files


Runs fgrep on bzipped files


Compresses files using the Burrows-Wheeler block sorting text compression algorithm with Huffman coding; the compression rate is better than that achieved by more conventional compressors using “Lempel-Ziv” algorithms, like gzip


Tries to recover data from damaged bzipped files


Runs less on bzipped files


Runs more on bzipped files


The library implementing lossless, block-sorting data compression, using the Burrows-Wheeler algorithm