Convert manpage to Markdown, converted with ronn
This commit is contained in:
parent
118a8e9ade
commit
72a243e3bd
@ -18,6 +18,19 @@
|
||||
|
||||
ZSTDDIR = ../lib
|
||||
|
||||
# Version numbers
|
||||
LIBVER_SRC := $(ZSTDDIR)/zstd.h
|
||||
LIBVER_MAJOR_SCRIPT:=`sed -n '/define ZSTD_VERSION_MAJOR/s/.*[[:blank:]]\([0-9][0-9]*\).*/\1/p' < $(LIBVER_SRC)`
|
||||
LIBVER_MINOR_SCRIPT:=`sed -n '/define ZSTD_VERSION_MINOR/s/.*[[:blank:]]\([0-9][0-9]*\).*/\1/p' < $(LIBVER_SRC)`
|
||||
LIBVER_PATCH_SCRIPT:=`sed -n '/define ZSTD_VERSION_RELEASE/s/.*[[:blank:]]\([0-9][0-9]*\).*/\1/p' < $(LIBVER_SRC)`
|
||||
LIBVER_SCRIPT:= $(LIBVER_MAJOR_SCRIPT).$(LIBVER_MINOR_SCRIPT).$(LIBVER_PATCH_SCRIPT)
|
||||
LIBVER_MAJOR := $(shell echo $(LIBVER_MAJOR_SCRIPT))
|
||||
LIBVER_MINOR := $(shell echo $(LIBVER_MINOR_SCRIPT))
|
||||
LIBVER_PATCH := $(shell echo $(LIBVER_PATCH_SCRIPT))
|
||||
LIBVER := $(shell echo $(LIBVER_SCRIPT))
|
||||
|
||||
ZSTD_VERSION=$(LIBVER)
|
||||
|
||||
ifeq ($(shell $(CC) -v 2>&1 | grep -c "gcc version "), 1)
|
||||
ALIGN_LOOP = -falign-loops=32
|
||||
else
|
||||
@ -91,6 +104,8 @@ else
|
||||
LZMA_MSG := $(NO_LZMA_MSG)
|
||||
endif
|
||||
|
||||
MD2ROFF =ronn
|
||||
MD2ROFF_FLAGS = --roff --warnings --manual="User Commands" --organization="zstd $(ZSTD_VERSION)"
|
||||
|
||||
.PHONY: default all clean clean_decomp_o install uninstall generate_res
|
||||
|
||||
@ -174,6 +189,16 @@ clean:
|
||||
clean_decomp_o:
|
||||
@$(RM) $(ZSTDDECOMP_O)
|
||||
|
||||
zstd.1: zstd.1.md
|
||||
cat $^ | $(MD2ROFF) $(MD2ROFF_FLAGS) | sed -n '/^\.\\\".*/!p' > $@
|
||||
|
||||
man: zstd.1
|
||||
|
||||
clean-man:
|
||||
rm zstd.1
|
||||
|
||||
preview-man: clean-man man
|
||||
man ./zstd.1
|
||||
|
||||
#-----------------------------------------------------------------------------
|
||||
# make install is validated only for Linux, OSX, BSD, Hurd and Solaris targets
|
||||
|
629
programs/zstd.1
629
programs/zstd.1
@ -1,408 +1,297 @@
|
||||
\"
|
||||
\" zstd.1: This is a manual page for 'zstd' program. This file is part of the
|
||||
\" zstd <http://www.zstd.net/> project.
|
||||
\" Author: Yann Collet
|
||||
\"
|
||||
|
||||
\" No hyphenation
|
||||
.hy 0
|
||||
.nr HY 0
|
||||
|
||||
.TH zstd "1" "2015-08-22" "zstd" "User Commands"
|
||||
.SH NAME
|
||||
\fBzstd, unzstd, zstdcat\fR - Compress or decompress .zst files
|
||||
|
||||
.SH SYNOPSIS
|
||||
.TP 5
|
||||
\fBzstd\fR [\fBOPTIONS\fR] [-|INPUT-FILE] [-o <OUTPUT-FILE>]
|
||||
.PP
|
||||
.B unzstd
|
||||
is equivalent to
|
||||
.BR "zstd \-d"
|
||||
.br
|
||||
.B zstdcat
|
||||
is equivalent to
|
||||
.BR "zstd \-dcf"
|
||||
.br
|
||||
|
||||
.SH DESCRIPTION
|
||||
.PP
|
||||
\fBzstd\fR is a fast lossless compression algorithm
|
||||
and data compression tool,
|
||||
with command line syntax similar to \fB gzip (1) \fR and \fB xz (1) \fR .
|
||||
It is based on the \fBLZ77\fR family, with further FSE & huff0 entropy stages.
|
||||
\fBzstd\fR offers highly configurable compression speed,
|
||||
with fast modes at > 200 MB/s per core,
|
||||
and strong modes nearing lzma compression ratios.
|
||||
It also features a very fast decoder, with speeds > 500 MB/s per core.
|
||||
|
||||
\fBzstd\fR command line syntax is generally similar to gzip,
|
||||
but features the following differences :
|
||||
- Source files are preserved by default.
|
||||
It's possible to remove them automatically by using \fB--rm\fR command.
|
||||
- When compressing a single file, \fBzstd\fR displays progress notifications and result summary by default.
|
||||
Use \fB-q\fR to turn them off
|
||||
|
||||
.PP
|
||||
.B zstd
|
||||
compresses or decompresses each
|
||||
.I file
|
||||
according to the selected operation mode.
|
||||
If no
|
||||
.I files
|
||||
are given or
|
||||
.I file
|
||||
is
|
||||
.BR \- ,
|
||||
.B zstd
|
||||
reads from standard input and writes the processed data
|
||||
to standard output.
|
||||
.B zstd
|
||||
will refuse (display an error and skip the
|
||||
.IR file )
|
||||
to write compressed data to standard output if it is a terminal.
|
||||
Similarly,
|
||||
.B zstd
|
||||
will refuse to read compressed data
|
||||
from standard input if it is a terminal.
|
||||
|
||||
.PP
|
||||
Unless
|
||||
.B \-\-stdout
|
||||
or
|
||||
.B \-o
|
||||
is specified,
|
||||
.I files
|
||||
are written to a new file whose name is derived from the source
|
||||
.I file
|
||||
name:
|
||||
.IP \(bu 3
|
||||
When compressing, the suffix
|
||||
.B .zst
|
||||
is appended to the source filename to get the target filename.
|
||||
.IP \(bu 3
|
||||
When decompressing, the
|
||||
.B .zst
|
||||
suffix is removed from the filename to get the target filename.
|
||||
|
||||
.SS "Concatenation with .zst files"
|
||||
It is possible to concatenate
|
||||
.B .zst
|
||||
files as is.
|
||||
.B zstd
|
||||
will decompress such files as if they were a single
|
||||
.B .zst
|
||||
file.
|
||||
|
||||
|
||||
|
||||
.SH OPTIONS
|
||||
|
||||
.
|
||||
.TH "ZSTD" "1" "March 2017" "zstd 1.1.4" "User Commands"
|
||||
.
|
||||
.SH "NAME"
|
||||
\fBzstd\fR \- zstd, unzstd, zstdcat \- Compress or decompress \.zst files
|
||||
.
|
||||
.SH "SYNOPSIS"
|
||||
\fBzstd\fR [\fIOPTIONS\fR] [\-|<INPUT\-FILE>] [\-o <OUTPUT\-FILE>]
|
||||
.
|
||||
.P
|
||||
\fBunzstd\fR is equivalent to \fBzstd \-d\fR \fBzstdcat\fR is equivalent to \fBzstd \-dcf\fR
|
||||
.
|
||||
.SH "DESCRIPTION"
|
||||
\fBzstd\fR is a fast lossless compression algorithm and data compression tool, with command line syntax similar to \fBgzip (1)\fR and \fBxz (1)\fR\. It is based on the \fBLZ77\fR family, with further FSE & huff0 entropy stages\. \fBzstd\fR offers highly configurable compression speed, with fast modes at > 200 MB/s per code, and strong modes nearing lzma compression ratios\. It also features a very fast decoder, with speeds > 500 MB/s per core\.
|
||||
.
|
||||
.P
|
||||
\fBzstd\fR command line syntax is generally similar to gzip, but features the following differences :
|
||||
.
|
||||
.IP "\(bu" 4
|
||||
Source files are preserved by default\. It\'s possible to remove them automatically by using the \fB\-\-rm\fR command\.
|
||||
.
|
||||
.IP "\(bu" 4
|
||||
When compressing a single file, \fBzstd\fR displays progress notifications and result summary by default\. Use \fB\-q\fR to turn them off\.
|
||||
.
|
||||
.IP "" 0
|
||||
.
|
||||
.P
|
||||
\fBzstd\fR compresses or decompresses each \fIfile\fR according to the selected operation mode\. If no \fIfiles\fR are given or \fIfile\fR is \fB\-\fR, \fBzstd\fR reads from standard input and writes the processed data to standard output\. \fBzstd\fR will refuse to (display an error and skip the \fIfile\fR) to write compressed data to standard output if it is a terminal\. Similarly, \fBzstd\fR will refuse to read compressed data from standard input if it is a terminal\.
|
||||
.
|
||||
.P
|
||||
Unless \fB\-\-stdout\fR or \fB\-o\fR is specified, \fIfiles\fR are written to a new file whose name is derived from the source \fIfile\fR name:
|
||||
.
|
||||
.IP "\(bu" 4
|
||||
When compressing, the suffix \fB\.zst\fR is appended to the source filename to get the target filename\.
|
||||
.
|
||||
.IP "\(bu" 4
|
||||
When decompressing, the \fB\.zst\fR suffix is removed from the source filename to get the target filename
|
||||
.
|
||||
.IP "" 0
|
||||
.
|
||||
.SS "Concatenation with \.zst files"
|
||||
It is possible to concatenate \fB\.zst\fR files as is\. \fBzstd\fR will decompress such files as if they were a single \fB\.zst\fR file\.
|
||||
.
|
||||
.SH "OPTIONS"
|
||||
.
|
||||
.SS "Integer suffixes and special values"
|
||||
In most places where an integer argument is expected,
|
||||
an optional suffix is supported to easily indicate large integers.
|
||||
There must be no space between the integer and the suffix.
|
||||
In most places where an integer argument is expected, an optional suffix is supported to easily indicate large integers\. There must be no space between the integer and the suffix\.
|
||||
.
|
||||
.TP
|
||||
.B KiB
|
||||
Multiply the integer by 1,024 (2^10).
|
||||
.BR Ki ,
|
||||
.BR K ,
|
||||
and
|
||||
.B KB
|
||||
are accepted as synonyms for
|
||||
.BR KiB .
|
||||
\fBKiB\fR
|
||||
Multiply the integer by 1,024 (2^10)\. \fBKi\fR, \fBK\fR, and \fBKB\fR are accepted as synonyms for \fBKiB\fR\.
|
||||
.
|
||||
.TP
|
||||
.B MiB
|
||||
Multiply the integer by 1,048,576 (2^20).
|
||||
.BR Mi ,
|
||||
.BR M ,
|
||||
and
|
||||
.B MB
|
||||
are accepted as synonyms for
|
||||
.BR MiB .
|
||||
|
||||
\fBMiB\fR
|
||||
Multiply the integer by 1,048,576 (2^20)\. \fBMi\fR, \fBM\fR, and \fBMB\fR are accepted as synonyms for \fBMiB\fR\.
|
||||
.
|
||||
.SS "Operation mode"
|
||||
If multiple operation mode options are given,
|
||||
the last one takes effect.
|
||||
If multiple operation mode options are given, the last one takes effect\.
|
||||
.
|
||||
.TP
|
||||
.BR \-z ", " \-\-compress
|
||||
Compress.
|
||||
This is the default operation mode when no operation mode option
|
||||
is specified and no other operation mode is implied from
|
||||
the command name (for example,
|
||||
.B unzstd
|
||||
implies
|
||||
.BR \-\-decompress ).
|
||||
\fB\-z\fR, \fB\-\-compress\fR
|
||||
Compress\. This is the default operation mode when no operation mode option is specified and no other operation mode is implied from the command name (for example, \fBunzstd\fR implies \fB\-\-decompress\fR)\.
|
||||
.
|
||||
.TP
|
||||
.BR \-d ", " \-\-decompress ", " \-\-uncompress
|
||||
Decompress.
|
||||
\fB\-d\fR, \fB\-\-decompress\fR, \fB\-\-uncompress\fR
|
||||
Decompress\.
|
||||
.
|
||||
.TP
|
||||
.BR \-t ", " \-\-test
|
||||
Test the integrity of compressed
|
||||
.IR files .
|
||||
This option is equivalent to
|
||||
.B "\-\-decompress \-\-stdout"
|
||||
except that the decompressed data is discarded instead of being
|
||||
written to standard output.
|
||||
No files are created or removed.
|
||||
\fB\-t\fR, \fB\-\-test\fR
|
||||
Test the integrity of compressed \fIfiles\fR\. This option is equivalent to \fB\-\-decompress \-\-stdout\fR except that the decompressed data is discarded instead of being written to standard output\. No files are created or removed\.
|
||||
.
|
||||
.TP
|
||||
.B \-b#
|
||||
benchmark file(s) using compression level #
|
||||
\fB\-b#\fR
|
||||
Benchmark file(s) using compression level #
|
||||
.
|
||||
.TP
|
||||
.B \--train FILEs
|
||||
use FILEs as training set to create a dictionary. The training set should contain a lot of small files (> 100).
|
||||
|
||||
\fB\-\-train FILEs\fR
|
||||
Use FILEs as a training set to create a dictionary\. The training set should contain a lot of small files (> 100)\.
|
||||
.
|
||||
.SS "Operation modifiers"
|
||||
.
|
||||
.TP
|
||||
.B \-#
|
||||
# compression level [1-19] (default:3)
|
||||
\fB\-#\fR
|
||||
\fB#\fR compression level [1\-19] (default: 3)
|
||||
.
|
||||
.TP
|
||||
.BR \--ultra
|
||||
unlocks high compression levels 20+ (maximum 22), using a lot more memory.
|
||||
Note that decompression will also require more memory when using these levels.
|
||||
\fB\-\-ultra\fR
|
||||
unlocks high compression levels 20+ (maximum 22), using a lot more memory\. Note that decompression will also require more memory when using these levels\.
|
||||
.
|
||||
.TP
|
||||
.B \-D file
|
||||
use `file` as Dictionary to compress or decompress FILE(s)
|
||||
\fB\-D file\fR
|
||||
use \fBfile\fR as Dictionary to compress or decompress FILE(s)
|
||||
.
|
||||
.TP
|
||||
.BR \--no-dictID
|
||||
do not store dictionary ID within frame header (dictionary compression).
|
||||
The decoder will have to rely on implicit knowledge about which dictionary to use,
|
||||
it won't be able to check if it's correct.
|
||||
\fB\-\-nodictID\fR
|
||||
do not store dictionary ID within frame header (dictionary compression)\. The decoder will have to rely on implicit knowledge about which dictionary to use, it won\'t be able to check if it\'s correct\.
|
||||
.
|
||||
.TP
|
||||
.B \-o file
|
||||
save result into `file` (only possible with a single INPUT-FILE)
|
||||
\fB\-o file\fR
|
||||
save result into \fBfile\fR (only possible with a single INPUT\-FILE)
|
||||
.
|
||||
.TP
|
||||
.BR \-f ", " --force
|
||||
overwrite output without prompting
|
||||
\fB\-f\fR, \fB\-\-force\fR
|
||||
overwrite output without prompting
|
||||
.
|
||||
.TP
|
||||
.BR \-c ", " --stdout
|
||||
force write to standard output, even if it is the console
|
||||
\fB\-c\fR, \fB\-\-stdout\fR
|
||||
force write to standard output, even if it is the console
|
||||
.
|
||||
.TP
|
||||
.BR \--[no-]sparse
|
||||
enable / disable sparse FS support, to make files with many zeroes smaller on disk.
|
||||
Creating sparse files may save disk space and speed up the decompression
|
||||
by reducing the amount of disk I/O.
|
||||
default : enabled when output is into a file, and disabled when output is stdout.
|
||||
This setting overrides default and can force sparse mode over stdout.
|
||||
\fB\-\-[no\-]sparse\fR
|
||||
enable / disable sparse FS support, to make files with many zeroes smaller on disk\. Creating sparse files may save disk space and speed up decompression by reducing the amount of disk I/O\. default : enabled when output is into a file, and disabled when output is stdout\. This setting overrides default and can force sparse mode over stdout\.
|
||||
.
|
||||
.TP
|
||||
.BR \--rm
|
||||
remove source file(s) after successful compression or decompression
|
||||
\fB\-\-rm\fR
|
||||
remove source file(s) after successful compression or decompression
|
||||
.
|
||||
.TP
|
||||
.BR \-k ", " --keep
|
||||
keep source file(s) after successful compression or decompression.
|
||||
This is the default behavior.
|
||||
\fB\-k\fR, \fB\-\-keep\fR
|
||||
keep source file(s) after successful compression or decompression\. This is the default behaviour\.
|
||||
.
|
||||
.TP
|
||||
.BR \-r
|
||||
operate recursively on directories
|
||||
\fB\-r\fR
|
||||
operate recursively on dictionaries
|
||||
.
|
||||
.TP
|
||||
.BR \-h/\-H ", " --help
|
||||
display help/long help and exit
|
||||
\fB\-h\fR/\fB\-H\fR, \fB\-\-help\fR
|
||||
display help/long help and exit
|
||||
.
|
||||
.TP
|
||||
.BR \-V ", " --version
|
||||
display Version number and exit
|
||||
\fB\-V\fR, \fB\-\-version\fR
|
||||
display version number and exit
|
||||
.
|
||||
.TP
|
||||
.BR \-v ", " --verbose
|
||||
verbose mode
|
||||
\fB\-v\fR
|
||||
verbose mode
|
||||
.
|
||||
.TP
|
||||
.BR \-q ", " --quiet
|
||||
suppress warnings, interactivity and notifications.
|
||||
specify twice to suppress errors too.
|
||||
\fB\-q\fR, \fB\-\-quiet\fR
|
||||
suppress warnings, interactivity, and notifications\. specify twice to suppress errors too\.
|
||||
.
|
||||
.TP
|
||||
.BR \-C ", " --[no-]check
|
||||
add integrity check computed from uncompressed data (default : enabled)
|
||||
\fB\-C\fR, \fB\-\-[no\-]check\fR
|
||||
add integrety check computed from uncompressed data (default : enabled)
|
||||
.
|
||||
.TP
|
||||
.BR \-t ", " --test
|
||||
Test the integrity of compressed files. This option is equivalent to \fB--decompress --stdout > /dev/null\fR.
|
||||
No files are created or removed.
|
||||
\fB\-\-\fR
|
||||
All arguments after \fB\-\-\fR are treated as files
|
||||
.
|
||||
.SH "DICTIONARY BUILDER"
|
||||
\fBzstd\fR offers \fIdictionary\fR compression, useful for very small files and messages\. It\'s possible to train \fBzstd\fR with some samples, the result of which is saved into a file called a \fBdictionary\fR\. Then during compression and decompression, reference the same dictionary\. It will improve compression ratio of small files\. Typical gains range from 10% (at 64KB) to x5 better (at <1KB)\.
|
||||
.
|
||||
.TP
|
||||
.BR --
|
||||
All arguments after -- are treated as files
|
||||
|
||||
|
||||
.SH DICTIONARY BUILDER
|
||||
.PP
|
||||
\fBzstd\fR offers \fIdictionary\fR compression, useful for very small files and messages.
|
||||
It's possible to train \fBzstd\fR with some samples, the result of which is saved into a file called `dictionary`.
|
||||
Then during compression and decompression, make reference to the same dictionary.
|
||||
It will improve compression ratio of small files.
|
||||
Typical gains range from ~10% (at 64KB) to x5 better (at <1KB).
|
||||
\fB\-\-train FILEs\fR
|
||||
use FILEs as training set to create a dictionary\. The training set should contain a lot of small files (> 100), and weight typically 100x the target dictionary size (for example, 10 MB for a 100 KB dictionary)\.
|
||||
.
|
||||
.TP
|
||||
.B \--train FILEs
|
||||
use FILEs as training set to create a dictionary. The training set should contain a lot of small files (> 100),
|
||||
and weight typically 100x the target dictionary size (for example, 10 MB for a 100 KB dictionary)
|
||||
\fB\-o file\fR
|
||||
dictionary saved into \fBfile\fR (default: dictionary)
|
||||
.
|
||||
.TP
|
||||
.B \-o file
|
||||
dictionary saved into `file` (default: dictionary)
|
||||
\fB\-\-maxdict #\fR
|
||||
limit dictionary to specified size (default : (112640)
|
||||
.
|
||||
.TP
|
||||
.B \--maxdict #
|
||||
limit dictionary to specified size (default : 112640)
|
||||
\fB\-\-dictID #\fR
|
||||
A dictionary ID is a locally unique ID that a decoder can use to verify it is using the right dictionary\. By default, zstd will create a 4\-bytes random number ID\. It\'s possible to give a precise number instead\. Short numbers have an advantage : an ID < 256 will only need 1 byte in the compressed frame header, and an ID < 65536 will only need 2 bytes\. This compares favorably to 4 bytes default\. However, it\'s up to the dictionary manager to not assign twice the same ID to 2 different dictionaries\.
|
||||
.
|
||||
.TP
|
||||
.B \--dictID #
|
||||
A dictionary ID is a locally unique ID that a decoder can use to verify it is using the right dictionary.
|
||||
By default, zstd will create a 4-bytes random number ID.
|
||||
It's possible to give a precise number instead.
|
||||
Short numbers have an advantage : an ID < 256 will only need 1 byte in the compressed frame header,
|
||||
and an ID < 65536 will only need 2 bytes. This compares favorably to 4 bytes default.
|
||||
However, it's up to the dictionary manager to not assign twice the same ID to 2 different dictionaries.
|
||||
\fB\-s#\fR
|
||||
dictionary selectivity level (default: 9) the smaller the value, the denser the dictionary, improving its efficiency but reducing its possible maximum size\.
|
||||
.
|
||||
.TP
|
||||
.B \-s#
|
||||
dictionary selectivity level (default: 9)
|
||||
the smaller the value, the denser the dictionary, improving its efficiency but reducing its possible maximum size.
|
||||
.TP
|
||||
.B \--cover=k=#,d=#
|
||||
Use alternate dictionary builder algorithm named cover with parameters \fIk\fR and \fId\fR with \fId\fR <= \fIk\fR.
|
||||
Selects segments of size \fIk\fR with the highest score to put in the dictionary.
|
||||
The score of a segment is computed by the sum of the frequencies of all the subsegments of of size \fId\fR.
|
||||
Generally \fId\fR should be in the range [6, 24].
|
||||
Good values for \fIk\fR vary widely based on the input data, but a safe range is [32, 2048].
|
||||
Example: \fB--train --cover=k=64,d=8 FILEs\fR.
|
||||
.TP
|
||||
.B \--optimize-cover[=steps=#,k=#,d=#]
|
||||
If \fIsteps\fR is not specified, the default value of 32 is used.
|
||||
If \fIk\fR is not specified, \fIsteps\fR values in [16, 2048] are checked for each value of \fId\fR.
|
||||
If \fId\fR is not specified, the values checked are [6, 8, ..., 16].
|
||||
|
||||
Runs the cover dictionary builder for each parameter set saves the optimal parameters and dictionary.
|
||||
Prints the optimal parameters and writes the optimal dictionary to the output file.
|
||||
Supports multithreading if \fBzstd\fR is compiled with threading support.
|
||||
|
||||
The parameter \fIk\fR is more sensitve than \fId\fR, and is faster to optimize over.
|
||||
Suggested use is to run with a \fIsteps\fR <= 32 with neither \fIk\fR nor \fId\fR set.
|
||||
Once it completes, use the value of \fId\fR it selects with a higher \fIsteps\fR (in the range [256, 1024]).
|
||||
\fBzstd --train --optimize-cover FILEs
|
||||
\fBzstd --train --optimize-cover=d=d,steps=512 FILEs
|
||||
.TP
|
||||
|
||||
.SH BENCHMARK
|
||||
.TP
|
||||
.B \-b#
|
||||
benchmark file(s) using compression level #
|
||||
.TP
|
||||
.B \-e#
|
||||
benchmark file(s) using multiple compression levels, from -b# to -e# (included).
|
||||
.TP
|
||||
.B \-i#
|
||||
minimum evaluation time, in seconds (default : 3s), benchmark mode only
|
||||
.TP
|
||||
.B \-B#
|
||||
cut file into independent blocks of size # (default: no block)
|
||||
.B \--priority=rt
|
||||
set process priority to real-time
|
||||
|
||||
.SH ADVANCED COMPRESSION OPTIONS
|
||||
.TP
|
||||
.B \--zstd[=\fIoptions\fR]
|
||||
.PD
|
||||
\fBzstd\fR provides 22 predefined compression levels. The selected or default predefined compression level can be changed with advanced compression options.
|
||||
The \fIoptions\fR are provided as a comma-separated list. You may specify only the \fIoptions\fR you want to change and the rest will be taken from the selected or default compression level.
|
||||
The list of available \fIoptions\fR:
|
||||
.RS
|
||||
|
||||
.TP
|
||||
.BI strategy= strat
|
||||
.PD 0
|
||||
.TP
|
||||
.BI strat= strat
|
||||
.PD
|
||||
Specify a strategy used by a match finder.
|
||||
.IP ""
|
||||
There are 8 strategies numbered from 0 to 7, from faster to stronger:
|
||||
0=ZSTD_fast, 1=ZSTD_dfast, 2=ZSTD_greedy, 3=ZSTD_lazy, 4=ZSTD_lazy2, 5=ZSTD_btlazy2, 6=ZSTD_btopt, 7=ZSTD_btopt2.
|
||||
.IP ""
|
||||
|
||||
.TP
|
||||
.BI windowLog= wlog
|
||||
.PD 0
|
||||
.TP
|
||||
.BI wlog= wlog
|
||||
.PD
|
||||
Specify the maximum number of bits for a match distance.
|
||||
.IP ""
|
||||
The higher number of bits increases the chance to find a match what usually improves compression ratio.
|
||||
It also increases memory requirements for compressor and decompressor.
|
||||
.IP ""
|
||||
The minimum \fIwlog\fR is 10 (1 KiB) and the maximum is 25 (32 MiB) for 32-bit compilation and 27 (128 MiB) for 64-bit compilation.
|
||||
.IP ""
|
||||
|
||||
.TP
|
||||
.BI hashLog= hlog
|
||||
.PD 0
|
||||
.TP
|
||||
.BI hlog= hlog
|
||||
.PD
|
||||
Specify the maximum number of bits for a hash table.
|
||||
.IP ""
|
||||
The bigger hash table causes less collisions what usually make compression faster but requires more memory during compression.
|
||||
.IP ""
|
||||
The minimum \fIhlog\fR is 6 (64 B) and the maximum is 25 (32 MiB) for 32-bit compilation and 27 (128 MiB) for 64-bit compilation.
|
||||
|
||||
.TP
|
||||
.BI chainLog= clog
|
||||
.PD 0
|
||||
.TP
|
||||
.BI clog= clog
|
||||
.PD
|
||||
Specify the maximum number of bits for a hash chain or a binary tree.
|
||||
.IP ""
|
||||
The higher number of bits increases the chance to find a match what usually improves compression ratio.
|
||||
It also slows down compression speed and increases memory requirements for compression.
|
||||
This option is ignored for the ZSTD_fast strategy.
|
||||
.IP ""
|
||||
The minimum \fIclog\fR is 6 (64 B) and the maximum is 26 (64 MiB) for 32-bit compilation and 28 (256 MiB) for 64-bit compilation.
|
||||
.IP ""
|
||||
|
||||
.TP
|
||||
.BI searchLog= slog
|
||||
.PD 0
|
||||
.TP
|
||||
.BI slog= slog
|
||||
.PD
|
||||
Specify the maximum number of searches in a hash chain or a binary tree using logarithmic scale.
|
||||
.IP ""
|
||||
The bigger number of searches increases the chance to find a match what usually improves compression ratio but decreases compression speed.
|
||||
.IP ""
|
||||
The minimum \fIslog\fR is 1 and the maximum is 24 for 32-bit compilation and 26 for 64-bit compilation.
|
||||
.IP ""
|
||||
|
||||
.TP
|
||||
.BI searchLength= slen
|
||||
.PD 0
|
||||
.TP
|
||||
.BI slen= slen
|
||||
.PD
|
||||
Specify the minimum searched length of a match in a hash table.
|
||||
.IP ""
|
||||
The bigger search length usually decreases compression ratio but improves decompression speed.
|
||||
.IP ""
|
||||
The minimum \fIslen\fR is 3 and the maximum is 7.
|
||||
.IP ""
|
||||
|
||||
.TP
|
||||
.BI targetLength= tlen
|
||||
.PD 0
|
||||
.TP
|
||||
.BI tlen= tlen
|
||||
.PD
|
||||
Specify the minimum match length that causes a match finder to interrupt searching of better matches.
|
||||
.IP ""
|
||||
The bigger minimum match length usually improves compression ratio but decreases compression speed.
|
||||
This option is used only with ZSTD_btopt and ZSTD_btopt2 strategies.
|
||||
.IP ""
|
||||
The minimum \fItlen\fR is 4 and the maximum is 999.
|
||||
.IP ""
|
||||
|
||||
.PP
|
||||
.B An example
|
||||
\fB\-\-cover=k#,d=#\fR
|
||||
Use alternate dictionary builder algorithm named cover with parameters \fIk\fR and \fId\fR with \fId\fR <= \fIk\fR\. Selects segments of size \fIk\fR with the highest score to put in the dictionary\. The score of a segment is computed by the sum of the frequencies of all the subsegments of of size \fId\fR\. Generally \fId\fR should be in the range [6, 24]\. Good values for \fIk\fR vary widely based on the input data, but a safe range is [32, 2048]\.
|
||||
.
|
||||
.br
|
||||
The following parameters sets advanced compression options to predefined level 19 for files bigger than 256 KB:
|
||||
.IP ""
|
||||
\fB--zstd=\fRwindowLog=23,chainLog=23,hashLog=22,searchLog=6,searchLength=3,targetLength=48,strategy=6
|
||||
|
||||
.SH BUGS
|
||||
Report bugs at:- https://github.com/facebook/zstd/issues
|
||||
|
||||
.SH AUTHOR
|
||||
Example: \fB\-\-train \-\-cover=k=64,d=8 FILEs\fR\.
|
||||
.
|
||||
.TP
|
||||
\fB\-\-optimize\-cover[=steps=#,k=#,d=#]\fR
|
||||
If \fIsteps\fR is not specified, the default value of 32 is used\. If \fIk\fR is not specified, the \fIk\fR values in [16, 2048] are checked for each value of \fId\fR\. If \fId\fR is not specified, the values checked are [6, 8, \.\.\., 16]\.
|
||||
.
|
||||
.IP
|
||||
Runs the cover dictionary builder for each parameter set and saves the optimal parameters and dictionary\. Prints the optimal parameters and writes the optimal dictionary to the output file\. Supports multithreading if \fBzstd\fR is compiled with threading support\.
|
||||
.
|
||||
.IP
|
||||
The parameter \fIk\fR is more sensitive than \fId\fR, and is faster to optimize over\. Suggested use is to run with a \fIsteps\fR <= 32 with neither \fIk\fR nor \fId\fR set\. Once it completes, use the value of \fId\fR it selects with a higher \fIsteps\fR (in the range [256, 1024])\.
|
||||
.
|
||||
.IP
|
||||
\fBzstd \-\-train \-\-optimize\-cover FILEs\fR
|
||||
.
|
||||
.br
|
||||
\fBzstd \-\-train \-\-optimize\-cover=d=d,steps=512 FILEs\fR
|
||||
.
|
||||
.SH "BENCHMARK"
|
||||
.
|
||||
.TP
|
||||
\fB\-b#\fR
|
||||
benchmark file(s) using compression level #
|
||||
.
|
||||
.TP
|
||||
\fB\-e#\fR
|
||||
benchmark file(s) using multiple compression levels, from \fB\-b#\fR to \fB\-e#\fR (inclusive)
|
||||
.
|
||||
.TP
|
||||
\fB\-i#\fR
|
||||
minimum evaluation time, in seconds (default : 3s), benchmark mode only
|
||||
.
|
||||
.TP
|
||||
\fB\-B#\fR
|
||||
cut file into independent blocks of size # (default: no block)
|
||||
.
|
||||
.TP
|
||||
\fB\-\-priority=rt\fR
|
||||
set process priority to real\-time
|
||||
.
|
||||
.SH "ADVANCED COMPRESSION OPTIONS"
|
||||
.
|
||||
.SS "\-\-zstd[=options]:"
|
||||
\fBzstd\fR provides 22 predefined compression levels\. The selected or default predefined compression level can be changed with advanced compression options\. The \fIoptions\fR are provided as a comma\-separated list\. You may specify only the options you want to change and the rest will be taken from the selected or default compression level\. The list of available \fIoptions\fR:
|
||||
.
|
||||
.TP
|
||||
\fBstrategy\fR=\fIstrat\fR, \fBstrat\fR=\fIstrat\fR
|
||||
Specify a strategy used by a match finder\.
|
||||
.
|
||||
.IP
|
||||
There are 8 strategies numbered from 0 to 7, from faster to stronger: 0=ZSTD_fast, 1=ZSTD_dfast, 2=ZSTD_greedy, 3=ZSTD_lazy, 4=ZSTD_lazy2, 5=ZSTD_btlazy2, 6=ZSTD_btopt, 7=ZSTD_btopt2\.
|
||||
.
|
||||
.TP
|
||||
\fBwindowLog\fR=\fIwlog\fR, \fBwlog\fR=\fIwlog\fR
|
||||
Specify the maximum number of bits for a match distance\.
|
||||
.
|
||||
.IP
|
||||
The higher number of increases the chance to find a match which usually improves compression ratio\. It also increases memory requirements for the compressor and decompressor\. The minimum \fIwlog\fR is 10 (1 KiB) and the maximum is 27 (128 MiB)\.
|
||||
.
|
||||
.TP
|
||||
\fBhashLog\fR=\fIhlog\fR, \fBhlog\fR=\fIhlog\fR
|
||||
Specify the maximum number of bits for a hash table\.
|
||||
.
|
||||
.IP
|
||||
Bigger hash tables cause less collisions which usually makes compression faster, but requires more memory during compression\.
|
||||
.
|
||||
.IP
|
||||
The minimum \fIhlog\fR is 6 (64 B) and the maximum is 26 (128 MiB)\.
|
||||
.
|
||||
.TP
|
||||
\fBchainLog\fR=\fIclog\fR, \fBclog\fR=\fIclog\fR
|
||||
Specify the maximum number of bits for a hash chain or a binary tree\.
|
||||
.
|
||||
.IP
|
||||
Higher numbers of bits increases the chance to find a match which usually improves compression ratio\. It also slows down compression speed and increases memory requirements for compression\. This option is ignored for the ZSTD_fast strategy\.
|
||||
.
|
||||
.IP
|
||||
The minimum \fIclog\fR is 6 (64 B) and the maximum is 28 (256 MiB)\.
|
||||
.
|
||||
.TP
|
||||
\fBsearchLog\fR=\fIslog\fR, \fBslog\fR=\fIslog\fR
|
||||
Specify the maximum number of searches in a hash chain or a binary tree using logarithmic scale\.
|
||||
.
|
||||
.IP
|
||||
More searches increases the chance to find a match which usually increases compression ratio but decreases compression speed\.
|
||||
.
|
||||
.IP
|
||||
The minimum \fIslog\fR is 1 and the maximum is 26\.
|
||||
.
|
||||
.TP
|
||||
\fBsearchLength\fR=\fIslen\fR, \fBslen\fR=\fIslen\fR
|
||||
Specify the minimum searched length of a match in a hash table\.
|
||||
.
|
||||
.IP
|
||||
Larger search lengths usually decrease compression ratio but improve decompression speed\.
|
||||
.
|
||||
.IP
|
||||
The minimum \fIslen\fR is 3 and the maximum is 7\.
|
||||
.
|
||||
.TP
|
||||
\fBtargetLen\fR=\fItlen\fR, \fBtlen\fR=\fItlen\fR
|
||||
Specify the minimum match length that causes a match finder to stop searching for better matches\.
|
||||
.
|
||||
.IP
|
||||
A larger minimum match length usually improves compression ratio but decreases compression speed\. This option is only used with strategies ZSTD_btopt and ZSTD_btopt2\.
|
||||
.
|
||||
.IP
|
||||
The minimum \fItlen\fR is 4 and the maximum is 999\.
|
||||
.
|
||||
.SS "Example"
|
||||
The following parameters sets advanced compression options to those of predefined level 19 for files bigger than 256 KB:
|
||||
.
|
||||
.P
|
||||
\fB\-\-zstd\fR=windowLog=23,chainLog=23,hashLog=22,searchLog=6,searchLength=3,targetLength=48,strategy=6
|
||||
.
|
||||
.SH "BUGS"
|
||||
Report bugs at: https://github\.com/facebook/zstd/issues
|
||||
.
|
||||
.SH "AUTHOR"
|
||||
Yann Collet
|
||||
|
299
programs/zstd.1.md
Normal file
299
programs/zstd.1.md
Normal file
@ -0,0 +1,299 @@
|
||||
zstd(1) -- zstd, unzstd, zstdcat - Compress or decompress .zst files
|
||||
====================================================================
|
||||
|
||||
SYNOPSIS
|
||||
--------
|
||||
|
||||
`zstd` [*OPTIONS*] [-|<INPUT-FILE>] [-o <OUTPUT-FILE>]
|
||||
|
||||
`unzstd` is equivalent to `zstd -d`
|
||||
`zstdcat` is equivalent to `zstd -dcf`
|
||||
|
||||
DESCRIPTION
|
||||
-----------
|
||||
`zstd` is a fast lossless compression algorithm and data compression tool,
|
||||
with command line syntax similar to `gzip (1)` and `xz (1)`.
|
||||
It is based on the **LZ77** family, with further FSE & huff0 entropy stages.
|
||||
`zstd` offers highly configurable compression speed,
|
||||
with fast modes at > 200 MB/s per code,
|
||||
and strong modes nearing lzma compression ratios.
|
||||
It also features a very fast decoder, with speeds > 500 MB/s per core.
|
||||
|
||||
`zstd` command line syntax is generally similar to gzip,
|
||||
but features the following differences :
|
||||
|
||||
- Source files are preserved by default.
|
||||
It's possible to remove them automatically by using the `--rm` command.
|
||||
- When compressing a single file, `zstd` displays progress notifications
|
||||
and result summary by default.
|
||||
Use `-q` to turn them off.
|
||||
|
||||
`zstd` compresses or decompresses each _file_ according to the selected
|
||||
operation mode.
|
||||
If no _files_ are given or _file_ is `-`, `zstd` reads from standard input
|
||||
and writes the processed data to standard output.
|
||||
`zstd` will refuse to (display an error and skip the _file_) to write
|
||||
compressed data to standard output if it is a terminal.
|
||||
Similarly, `zstd` will refuse to read compressed data from standard input if it
|
||||
is a terminal.
|
||||
|
||||
Unless `--stdout` or `-o` is specified, _files_ are written to a new file
|
||||
whose name is derived from the source _file_ name:
|
||||
|
||||
* When compressing, the suffix `.zst` is appended to the source filename to
|
||||
get the target filename.
|
||||
* When decompressing, the `.zst` suffix is removed from the source filename to
|
||||
get the target filename
|
||||
|
||||
### Concatenation with .zst files
|
||||
It is possible to concatenate `.zst` files as is.
|
||||
`zstd` will decompress such files as if they were a single `.zst` file.
|
||||
|
||||
OPTIONS
|
||||
-------
|
||||
|
||||
### Integer suffixes and special values
|
||||
In most places where an integer argument is expected,
|
||||
an optional suffix is supported to easily indicate large integers.
|
||||
There must be no space between the integer and the suffix.
|
||||
|
||||
* `KiB`:
|
||||
Multiply the integer by 1,024 (2\^10).
|
||||
`Ki`, `K`, and `KB` are accepted as synonyms for `KiB`.
|
||||
* `MiB`:
|
||||
Multiply the integer by 1,048,576 (2\^20).
|
||||
`Mi`, `M`, and `MB` are accepted as synonyms for `MiB`.
|
||||
|
||||
### Operation mode
|
||||
If multiple operation mode options are given,
|
||||
the last one takes effect.
|
||||
|
||||
* `-z`, `--compress`:
|
||||
Compress.
|
||||
This is the default operation mode when no operation mode option is specified
|
||||
and no other operation mode is implied from the command name
|
||||
(for example, `unzstd` implies `--decompress`).
|
||||
* `-d`, `--decompress`, `--uncompress`:
|
||||
Decompress.
|
||||
* `-t`, `--test`:
|
||||
Test the integrity of compressed _files_.
|
||||
This option is equivalent to `--decompress --stdout` except that the
|
||||
decompressed data is discarded instead of being written to standard output.
|
||||
No files are created or removed.
|
||||
* `-b#`:
|
||||
Benchmark file(s) using compression level #
|
||||
* `--train FILEs`:
|
||||
Use FILEs as a training set to create a dictionary.
|
||||
The training set should contain a lot of small files (> 100).
|
||||
|
||||
### Operation modifiers
|
||||
|
||||
* `-#`:
|
||||
`#` compression level \[1-19] (default: 3)
|
||||
* `--ultra`:
|
||||
unlocks high compression levels 20+ (maximum 22), using a lot more memory.
|
||||
Note that decompression will also require more memory when using these levels.
|
||||
* `-D file`:
|
||||
use `file` as Dictionary to compress or decompress FILE(s)
|
||||
* `--nodictID`:
|
||||
do not store dictionary ID within frame header (dictionary compression).
|
||||
The decoder will have to rely on implicit knowledge about which dictionary to use,
|
||||
it won't be able to check if it's correct.
|
||||
* `-o file`:
|
||||
save result into `file` (only possible with a single INPUT-FILE)
|
||||
* `-f`, `--force`:
|
||||
overwrite output without prompting
|
||||
* `-c`, `--stdout`:
|
||||
force write to standard output, even if it is the console
|
||||
* `--[no-]sparse`:
|
||||
enable / disable sparse FS support,
|
||||
to make files with many zeroes smaller on disk.
|
||||
Creating sparse files may save disk space and speed up decompression by
|
||||
reducing the amount of disk I/O.
|
||||
default : enabled when output is into a file,
|
||||
and disabled when output is stdout.
|
||||
This setting overrides default and can force sparse mode over stdout.
|
||||
* `--rm`:
|
||||
remove source file(s) after successful compression or decompression
|
||||
* `-k`, `--keep`:
|
||||
keep source file(s) after successful compression or decompression.
|
||||
This is the default behaviour.
|
||||
* `-r`:
|
||||
operate recursively on dictionaries
|
||||
* `-h`/`-H`, `--help`:
|
||||
display help/long help and exit
|
||||
* `-V`, `--version`:
|
||||
display version number and exit
|
||||
* `-v`:
|
||||
verbose mode
|
||||
* `-q`, `--quiet`:
|
||||
suppress warnings, interactivity, and notifications.
|
||||
specify twice to suppress errors too.
|
||||
* `-C`, `--[no-]check`:
|
||||
add integrety check computed from uncompressed data (default : enabled)
|
||||
* `--`:
|
||||
All arguments after `--` are treated as files
|
||||
|
||||
DICTIONARY BUILDER
|
||||
------------------
|
||||
`zstd` offers _dictionary_ compression,
|
||||
useful for very small files and messages.
|
||||
It's possible to train `zstd` with some samples,
|
||||
the result of which is saved into a file called a `dictionary`.
|
||||
Then during compression and decompression, reference the same dictionary.
|
||||
It will improve compression ratio of small files.
|
||||
Typical gains range from 10% (at 64KB) to x5 better (at <1KB).
|
||||
|
||||
* `--train FILEs`:
|
||||
use FILEs as training set to create a dictionary.
|
||||
The training set should contain a lot of small files (> 100),
|
||||
and weight typically 100x the target dictionary size
|
||||
(for example, 10 MB for a 100 KB dictionary).
|
||||
* `-o file`:
|
||||
dictionary saved into `file` (default: dictionary)
|
||||
* `--maxdict #`:
|
||||
limit dictionary to specified size (default : (112640)
|
||||
* `--dictID #`:
|
||||
A dictionary ID is a locally unique ID that a decoder can use to verify it is
|
||||
using the right dictionary.
|
||||
By default, zstd will create a 4-bytes random number ID.
|
||||
It's possible to give a precise number instead.
|
||||
Short numbers have an advantage : an ID < 256 will only need 1 byte in the
|
||||
compressed frame header, and an ID < 65536 will only need 2 bytes.
|
||||
This compares favorably to 4 bytes default.
|
||||
However, it's up to the dictionary manager to not assign twice the same ID to
|
||||
2 different dictionaries.
|
||||
* `-s#`:
|
||||
dictionary selectivity level (default: 9)
|
||||
the smaller the value, the denser the dictionary,
|
||||
improving its efficiency but reducing its possible maximum size.
|
||||
* `--cover=k#,d=#`:
|
||||
Use alternate dictionary builder algorithm named cover with parameters
|
||||
_k_ and _d_ with _d_ <= _k_.
|
||||
Selects segments of size _k_ with the highest score to put in the dictionary.
|
||||
The score of a segment is computed by the sum of the frequencies of all the
|
||||
subsegments of of size _d_.
|
||||
Generally _d_ should be in the range [6, 24].
|
||||
Good values for _k_ vary widely based on the input data,
|
||||
but a safe range is [32, 2048].<br />
|
||||
Example: `--train --cover=k=64,d=8 FILEs`.
|
||||
|
||||
* `--optimize-cover[=steps=#,k=#,d=#]`:
|
||||
If _steps_ is not specified, the default value of 32 is used.
|
||||
If _k_ is not specified, the _k_ values in [16, 2048] are checked for each
|
||||
value of _d_.
|
||||
If _d_ is not specified, the values checked are [6, 8, ..., 16].
|
||||
|
||||
Runs the cover dictionary builder for each parameter set and saves the
|
||||
optimal parameters and dictionary.
|
||||
Prints the optimal parameters and writes the optimal dictionary to the output file.
|
||||
Supports multithreading if `zstd` is compiled with threading support.
|
||||
|
||||
The parameter _k_ is more sensitive than _d_, and is faster to optimize over.
|
||||
Suggested use is to run with a _steps_ <= 32 with neither _k_ nor _d_ set.
|
||||
Once it completes, use the value of _d_ it selects with a higher _steps_
|
||||
(in the range [256, 1024]).
|
||||
|
||||
`zstd --train --optimize-cover FILEs` <br />
|
||||
`zstd --train --optimize-cover=d=d,steps=512 FILEs`
|
||||
|
||||
|
||||
BENCHMARK
|
||||
---------
|
||||
|
||||
* `-b#`:
|
||||
benchmark file(s) using compression level #
|
||||
* `-e#`:
|
||||
benchmark file(s) using multiple compression levels, from `-b#` to `-e#` (inclusive)
|
||||
* `-i#`:
|
||||
minimum evaluation time, in seconds (default : 3s), benchmark mode only
|
||||
* `-B#`:
|
||||
cut file into independent blocks of size # (default: no block)
|
||||
* `--priority=rt`:
|
||||
set process priority to real-time
|
||||
|
||||
ADVANCED COMPRESSION OPTIONS
|
||||
----------------------------
|
||||
### --zstd[=options]:
|
||||
`zstd` provides 22 predefined compression levels.
|
||||
The selected or default predefined compression level can be changed with
|
||||
advanced compression options.
|
||||
The _options_ are provided as a comma-separated list.
|
||||
You may specify only the options you want to change and the rest will be
|
||||
taken from the selected or default compression level.
|
||||
The list of available _options_:
|
||||
|
||||
- `strategy`=_strat_, `strat`=_strat_:
|
||||
Specify a strategy used by a match finder.
|
||||
|
||||
There are 8 strategies numbered from 0 to 7, from faster to stronger:
|
||||
0=ZSTD\_fast, 1=ZSTD\_dfast, 2=ZSTD\_greedy, 3=ZSTD\_lazy,
|
||||
4=ZSTD\_lazy2, 5=ZSTD\_btlazy2, 6=ZSTD\_btopt, 7=ZSTD\_btopt2.
|
||||
|
||||
- `windowLog`=_wlog_, `wlog`=_wlog_:
|
||||
Specify the maximum number of bits for a match distance.
|
||||
|
||||
The higher number of increases the chance to find a match which usually
|
||||
improves compression ratio.
|
||||
It also increases memory requirements for the compressor and decompressor.
|
||||
The minimum _wlog_ is 10 (1 KiB) and the maximum is 27 (128 MiB).
|
||||
|
||||
- `hashLog`=_hlog_, `hlog`=_hlog_:
|
||||
Specify the maximum number of bits for a hash table.
|
||||
|
||||
Bigger hash tables cause less collisions which usually makes compression
|
||||
faster, but requires more memory during compression.
|
||||
|
||||
The minimum _hlog_ is 6 (64 B) and the maximum is 26 (128 MiB).
|
||||
|
||||
- `chainLog`=_clog_, `clog`=_clog_:
|
||||
Specify the maximum number of bits for a hash chain or a binary tree.
|
||||
|
||||
Higher numbers of bits increases the chance to find a match which usually
|
||||
improves compression ratio.
|
||||
It also slows down compression speed and increases memory requirements for
|
||||
compression.
|
||||
This option is ignored for the ZSTD_fast strategy.
|
||||
|
||||
The minimum _clog_ is 6 (64 B) and the maximum is 28 (256 MiB).
|
||||
|
||||
- `searchLog`=_slog_, `slog`=_slog_:
|
||||
Specify the maximum number of searches in a hash chain or a binary tree
|
||||
using logarithmic scale.
|
||||
|
||||
More searches increases the chance to find a match which usually increases
|
||||
compression ratio but decreases compression speed.
|
||||
|
||||
The minimum _slog_ is 1 and the maximum is 26.
|
||||
|
||||
- `searchLength`=_slen_, `slen`=_slen_:
|
||||
Specify the minimum searched length of a match in a hash table.
|
||||
|
||||
Larger search lengths usually decrease compression ratio but improve
|
||||
decompression speed.
|
||||
|
||||
The minimum _slen_ is 3 and the maximum is 7.
|
||||
|
||||
- `targetLen`=_tlen_, `tlen`=_tlen_:
|
||||
Specify the minimum match length that causes a match finder to stop
|
||||
searching for better matches.
|
||||
|
||||
A larger minimum match length usually improves compression ratio but
|
||||
decreases compression speed.
|
||||
This option is only used with strategies ZSTD_btopt and ZSTD_btopt2.
|
||||
|
||||
The minimum _tlen_ is 4 and the maximum is 999.
|
||||
|
||||
### Example
|
||||
The following parameters sets advanced compression options to those of
|
||||
predefined level 19 for files bigger than 256 KB:
|
||||
|
||||
`--zstd`=windowLog=23,chainLog=23,hashLog=22,searchLog=6,searchLength=3,targetLength=48,strategy=6
|
||||
|
||||
BUGS
|
||||
----
|
||||
Report bugs at: https://github.com/facebook/zstd/issues
|
||||
|
||||
AUTHOR
|
||||
------
|
||||
Yann Collet
|
Loading…
Reference in New Issue
Block a user