clzip - reduces the size of files
clzip [options] [files]
Clzip is a C language version of lzip, fully compatible with lzip 1.4 or newer. As clzip is written in C, it may be easier to integrate in applications like package managers, embedded devices, or systems lacking a C++ compiler.
Lzip is a lossless data compressor with a user interface similar to the one of gzip or bzip2. Lzip uses a simplified form of the 'Lempel-Ziv-Markov chain-Algorithm' (LZMA) stream format, chosen to maximize safety and interoperability. Lzip can compress about as fast as gzip (lzip -0) or compress most files more than bzip2 (lzip -9). Decompression speed is intermediate between gzip and bzip2. Lzip is better than gzip and bzip2 from a data recovery perspective. Lzip has been designed, written, and tested with great care to replace gzip and bzip2 as the standard general-purpose compressed format for unix-like systems.
- -h, --help
- display this help and exit
- -V, --version
- output version information and exit
- -a, --trailing-error
- exit with error status if trailing data
- -b, --member-size=<bytes>
- set member size limit in bytes
- -c, --stdout
- write to standard output, keep input files
- -d, --decompress
- -f, --force
- overwrite existing output files
- -F, --recompress
- force re-compression of compressed files
- -k, --keep
- keep (don't delete) input files
- -l, --list
- print (un)compressed file sizes
- -m, --match-length=<bytes>
- set match length limit in bytes 
- -o, --output=<file>
- write to <file>, keep input files
- -q, --quiet
- suppress all messages
- -s, --dictionary-size=<bytes>
- set dictionary size limit in bytes [8 MiB]
- -S, --volume-size=<bytes>
- set volume size limit in bytes
- -t, --test
- test compressed file integrity
- -v, --verbose
- be verbose (a 2nd -v gives more)
- -0 .. -9
- set compression level [default 6]
- alias for -0
- alias for -9
- allow trailing data seeming corrupt header
If no file names are given, or if a file is '-', clzip compresses or decompresses from standard input to standard output. Numbers may be followed by a multiplier: k = kB = 10^3 = 1000, Ki = KiB = 2^10 = 1024, M = 10^6, Mi = 2^20, G = 10^9, Gi = 2^30, etc... Dictionary sizes 12 to 29 are interpreted as powers of two, meaning 2^12 to 2^29 bytes.
The bidimensional parameter space of LZMA can't be mapped to a linear scale optimal for all files. If your files are large, very repetitive, etc, you may need to use the options --dictionary-size and --match-length directly to achieve optimal performance.
To extract all the files from archive 'foo.tar.lz', use the commands 'tar -xf foo.tar.lz' or 'clzip -cd foo.tar.lz | tar -xf -'.
Exit status: 0 for a normal exit, 1 for environmental problems (file not found, invalid flags, I/O errors, etc), 2 to indicate a corrupt or invalid input file, 3 for an internal consistency error (eg, bug) which caused clzip to panic.
The ideas embodied in clzip are due to (at least) the following people: Abraham Lempel and Jacob Ziv (for the LZ algorithm), Andrey Markov (for the definition of Markov chains), G.N.N. Martin (for the definition of range encoding), Igor Pavlov (for putting all the above together in LZMA), and Julian Seward (for bzip2's CLI).
Report bugs to email@example.com
Clzip home page: http://www.nongnu.org/lzip/clzip.html
Copyright © 2021 Antonio Diaz Diaz. License GPLv2+: GNU GPL
version 2 or later <http://gnu.org/licenses/gpl.html>
This is free software: you are free to change and redistribute it. There is NO WARRANTY, to the extent permitted by law.
The full documentation for clzip is maintained as a Texinfo manual. If the info and clzip programs are properly installed at your site, the command
- info clzip
should give you access to the complete manual.
|January 2021||clzip 1.12|